commit 3e5433eacfa56238f5f2899620f7a5a52f9b953d
parent 517bfa1baffa43eb78607ae79594c3756886b469
Author: Samdal <samdal@protonmail.com>
Date: Sun, 29 Jan 2023 01:05:07 +0100
update docs more
Diffstat:
2 files changed, 4 insertions(+), 4 deletions(-)
diff --git a/README.md b/README.md
@@ -23,7 +23,7 @@ Because of this the container also has a bit-field that specifies which elements
This creates an interface almost identitcal to gs_slot_array.
The major drawback of this is a somewhat slow iterator and insertion.
-### The guts of look somewhat like:
+### The guts look somewhat like:
gs_dyn_array(Type[bucket_size]) your_data;
gs_dyn_array(int64_t) bit_field;
@@ -36,7 +36,7 @@ The major drawback of this is a somewhat slow iterator and insertion.
float val = gs_bucket_array_get(arr, hndl);
-### The Bucket array provides iterators:
+### The bucket array provides iterators:
for (
gs_bucket_array_iter it = gs_bucket_array_iter_new(ba);
@@ -72,7 +72,7 @@ TIP:
> this is because un-initialized data will otherwise cause problems.
-### Bucket Array Usage:
+### Normal bucket array usage:
gs_bucket_array(float) ba = gs_bucket_array_new(float, 100); // Bucket array with internal 'float' data, where each bucket is 100 floats
uint32_t hndl = gs_bucket_array_insert(ba, 3.145f); // Inserts your data into the bucket array, returns handle to you
diff --git a/source/main.c b/source/main.c
@@ -212,7 +212,7 @@ __gs_bucket_array_fast_advance_func(gs_bucket_array_iter_fast* it, uint32_t buck
This creates an interface almost identitcal to gs_slot_array.
The major drawback of this is a somewhat slow iterator and insertion.
- The guts of look somewhat like:
+ The guts look somewhat like:
gs_dyn_array(Type[bucket_size]) your_data;
gs_dyn_array(int64_t) bit_field;