| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | replace a branch with `max` in `core:container/bit_array.set` | ap29600 | 2022-02-05 | 1 | -1/+1 |
| | | |||||
| * | rename iterator procedures | Andrea Piseri | 2022-02-05 | 1 | -3/+3 |
| | | |||||
| * | Update interface to allow more modes of iteration | Andrea Piseri | 2022-02-05 | 1 | -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 values | ap29600 | 2022-02-04 | 1 | -1/+1 |
| | | |||||
| * | add `iterator` to `core:container/bit_array` | Andrea Piseri | 2022-02-04 | 1 | -1/+42 |
| | | |||||
| * | `core:container/topological_sort` | gingerBill | 2022-02-04 | 1 | -0/+98 |
| | | |||||
| * | Update `core:container/lru` to support `clear` and take a boolean to ↵ | gingerBill | 2022-02-02 | 1 | -14/+23 |
| | | | | | indicate whether or not to call the `on_remove` procedure on `clear` or `destroy` | ||||
| * | `core:container/lru`dev-2022-02 | gingerBill | 2022-02-01 | 1 | -0/+183 |
| | | |||||
| * | Keep -vet happy | gingerBill | 2022-01-25 | 1 | -0/+1 |
| | | |||||
| * | bit_array: Fix initial size. | Jeroen van Rijn | 2022-01-25 | 1 | -1/+1 |
| | | |||||
| * | fix push_back and pop_front | CiD- | 2022-01-14 | 1 | -1/+4 |
| | | |||||
| * | Add `core:container/queue` | gingerBill | 2022-01-01 | 1 | -0/+205 |
| | | |||||
| * | Correct `_shift_down` logic | gingerBill | 2022-01-01 | 1 | -8/+7 |
| | | |||||
| * | Fix typo in priority_queue.odin and add `default_swap_proc` | gingerBill | 2022-01-01 | 1 | -1/+7 |
| | | |||||
| * | Change the implementation of `Priority_Queue` to have a better interface ↵ | gingerBill | 2021-12-30 | 1 | -104/+102 |
| | | | | | that allows for a `less` and `swap` procedure | ||||
| * | Add `core:container/priority_queue` | gingerBill | 2021-12-29 | 1 | -0/+140 |
| | | |||||
| * | Minor improvements to `core:container/small_array` | gingerBill | 2021-12-29 | 1 | -3/+3 |
| | | |||||
| * | Add `core:container/small_array` | gingerBill | 2021-12-29 | 1 | -0/+117 |
| | | |||||
| * | [core:container/bit_vector] Create new package. | Jeroen van Rijn | 2021-12-28 | 2 | -0/+176 |
| | | | | | A dynamic bit array, optionally allowing negative indices. | ||||
| * | Remove `core:container` contents | gingerBill | 2021-12-28 | 8 | -1378/+0 |
| | | |||||
| * | Make core and vendor adhere to `-vet`, `-strict-style`, and `-disallow-do` | gingerBill | 2021-09-11 | 1 | -4/+12 |
| | | |||||
| * | Remove unneeded semicolons from the core library | gingerBill | 2021-08-31 | 8 | -472/+472 |
| | | |||||
| * | Enforce `core:builtin` and `core:intrinsics` for imports | gingerBill | 2021-08-21 | 1 | -1/+1 |
| | | |||||
| * | Fix error: Cannot assign to a procedure parameter | streof | 2021-07-09 | 1 | -0/+1 |
| | | |||||
| * | Fix error: Undeclared name: p | streof | 2021-07-09 | 1 | -1/+1 |
| | | |||||
| * | Change uses for parapoly records to use `$` always | gingerBill | 2021-06-14 | 6 | -7/+7 |
| | | |||||
| * | Fix `container/map.odin` | gingerBill | 2021-06-01 | 1 | -4/+4 |
| | | |||||
| * | Add `linalg.matrix_cast` | gingerBill | 2021-03-26 | 1 | -1/+1 |
| | | |||||
| * | Add `container.Priority_Queue` | breeo | 2021-03-25 | 1 | -0/+113 |
| | | |||||
| * | Make `container.Map` have similar semantics to the built-in `map` type | gingerBill | 2020-12-15 | 1 | -37/+49 |
| | | |||||
| * | Reuse container.Queue capacity when calling pop_front() | Tetralux | 2020-10-26 | 1 | -0/+3 |
| | | | | | | | Currently, the Queue will never reuse it's full capacity if you call `pop_front`, even if you empty it before pushing more items. With this change, if you empty the Queue with `pop_front`, then the offset will be set back to the start of the underlying array when you pop the last item. Future pushes will then reuse the already-allocated--but now empty--space. | ||||
| * | Fix container.Array and container.Ring | gingerBill | 2020-10-01 | 2 | -3/+6 |
| | | |||||
| * | Remove usage of `do` in core library | gingerBill | 2020-09-23 | 1 | -1/+3 |
| | | |||||
| * | Fix typo in Small_Array procedure | gingerBill | 2020-09-14 | 1 | -1/+1 |
| | | |||||
| * | Update ring.odin | Platin21 | 2020-08-22 | 1 | -1/+1 |
| | | | | Someone missed the T type here ;) | ||||
| * | Commit fix | gingerBill | 2020-06-16 | 2 | -3/+1 |
| | | |||||
| * | Add `hash.djb2` `hash.jenkins`; Add `container.Bloom_Filter`; Add ↵ | gingerBill | 2020-06-16 | 2 | -0/+153 |
| | | | | | `container.Ring` | ||||
| * | Fix container.Array.array_push_back_elems | Tetralux | 2020-05-15 | 1 | -5/+8 |
| | | | | | | | | | | | | We were previously using array_slice to get the storage that we were copying the new elements into, using the current length as the offset: `copy(data[len:], ..elems)` However, array_slice returns a slice over `data[0:len]` -- we were using it as if it was `data[0:cap]`. Add array_cap_slice that does this instead. :^) | ||||
| * | Remove unused headers | gingerBill | 2020-04-21 | 2 | -7/+0 |
| | | |||||
| * | `container.Set` | gingerBill | 2020-04-20 | 2 | -7/+251 |
| | | |||||
| * | `container.Small_Array` | gingerBill | 2020-04-19 | 1 | -0/+97 |
| | | |||||
| * | `container.Small_Array` | gingerBill | 2020-04-19 | 1 | -12/+12 |
| | | |||||
| * | `container.Map` | gingerBill | 2020-04-19 | 3 | -6/+438 |
| | | |||||
| * | Fix `#optional_ok`; Fix `container.Array` | gingerBill | 2020-04-19 | 1 | -13/+13 |
| | | |||||
| * | `#optional_ok` tag for procedures | gingerBill | 2020-04-19 | 1 | -1/+9 |
| | | |||||
| * | `package container` with `Queue` and `Array` | gingerBill | 2020-04-17 | 2 | -0/+308 |
 |
index : odin/Odin.git | |
| Odin Programming Language | Odin Lang |
| aboutsummaryrefslogtreecommitdiff |