aboutsummaryrefslogtreecommitdiff
path: root/core/container/bit_array
Commit message (Collapse)AuthorAgeFilesLines
* Replace `core:*` to `base:*` where appropriategingerBill2024-01-281-1/+1
|
* added set overload, made make explicitJon Lipstate2023-05-021-24/+17
|
* update docs, add unsafe_get/set, add round up to createJon Lipstate2023-04-301-61/+127
|
* unset functionJungerBoyo2022-06-031-0/+27
| | | unset function, clear single bits
* [bit_array] Really fix the leak.Jeroen van Rijn2022-03-062-17/+22
|
* Fix leak in `core:container/bit_array`Andrea Piseri2022-03-061-1/+2
| | | | | | calling `clear` on a `bit_array` no longer leaks the previous allocation, instead it sets all bits to `false` preserving the same backing dynamic array.
* replace a branch with `max` in `core:container/bit_array.set`ap296002022-02-051-1/+1
|
* rename iterator proceduresAndrea Piseri2022-02-051-3/+3
|
* Update interface to allow more modes of iterationAndrea Piseri2022-02-051-21/+90
| | | | | | | | | | It's now possible to iterate over: - all keys in the range min_value ..= max_value, with `iterate_all` - all set keys in the bit array, with `iterate_set` - all unset keys in the range min_value ..= max_value, with `iterate_unset` `Bit_Array` now stores the `max_value` provided during construction, and updates it when a key that was previously out of range is set.
* rename `iterator` proc to `next`, add named return valuesap296002022-02-041-1/+1
|
* add `iterator` to `core:container/bit_array`Andrea Piseri2022-02-041-1/+42
|
* bit_array: Fix initial size.Jeroen van Rijn2022-01-251-1/+1
|
* [core:container/bit_vector] Create new package.Jeroen van Rijn2021-12-282-0/+176
A dynamic bit array, optionally allowing negative indices.