| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Add `slice.permute` | Feoramund | 2024-06-09 | 1 | -0/+105 |
| | | |||||
| * | Fix slice.has_prefix & slice.has_suffix | korvahkh | 2024-05-25 | 1 | -2/+2 |
| | | | | | The needle was the element type instead of the slice type. | ||||
| * | Add allocator param. | Jeroen van Rijn | 2024-05-09 | 1 | -2/+2 |
| | | |||||
| * | Simplify bitset_to_enum_slice | Jeroen van Rijn | 2024-05-09 | 1 | -12/+3 |
| | | |||||
| * | Pass new -vet-style check. | Jeroen van Rijn | 2024-05-09 | 1 | -7/+12 |
| | | |||||
| * | Add make version of bitset to slice. | Jeroen van Rijn | 2024-05-09 | 1 | -2/+18 |
| | | |||||
| * | Add slice.enum_slice_to_bitset & slice.bitset_to_enum_slice | Jeroen van Rijn | 2024-05-09 | 1 | -0/+24 |
| | | |||||
| * | fixed slice.unique and slice.unique_proc | Aaron Kavaler | 2024-03-13 | 1 | -2/+2 |
| | | |||||
| * | Replace `core:*` to `base:*` where appropriate | gingerBill | 2024-01-28 | 4 | -8/+8 |
| | | |||||
| * | Fixed type of temporary slice in sort_by_indices_overwrite | Franz Höltermann | 2024-01-08 | 1 | -1/+1 |
| | | |||||
| * | Remove random tag | gingerBill | 2023-12-13 | 1 | -2/+2 |
| | | |||||
| * | Add `slice.unique` and `slice.unique_proc` | gingerBill | 2023-12-13 | 1 | -0/+36 |
| | | |||||
| * | Reimplement `binary_search_by` to be simpler | gingerBill | 2023-12-13 | 1 | -29/+11 |
| | | |||||
| * | Fix the implementation of `binary_search_by` to work with a normal ↵ | gingerBill | 2023-12-13 | 1 | -12/+4 |
| | | | | | | | `ordering` call, rather than the backwards version. WHY THE HECK WAS IT THIS WAY IN THE FIRST PLACE?! | ||||
| * | Revert | gingerBill | 2023-12-13 | 1 | -4/+12 |
| | | |||||
| * | Use `cmp_proc` in `binary_search` | gingerBill | 2023-12-13 | 1 | -12/+4 |
| | | |||||
| * | Add to `core:slice` `reduce_reverse`, `filter_reverse`, `repeat` | gingerBill | 2023-12-13 | 1 | -3/+42 |
| | | |||||
| * | added #no_bounds_check back into binary_search_by | Matija Dizdar | 2023-12-06 | 1 | -2/+1 |
| | | |||||
| * | removed incorrect requirement for key type to be ordered in binary_search_by | Matija Dizdar | 2023-12-06 | 1 | -1/+0 |
| | | |||||
| * | Add min_index and max_index procedures | Tarık B | 2023-11-26 | 1 | -0/+34 |
| | | |||||
| * | Removed some accidental semi-colons and converted indentation to tabs. | Hector | 2023-11-25 | 1 | -46/+46 |
| | | |||||
| * | Binary search improvements | Hector | 2023-11-25 | 1 | -33/+82 |
| | | | | | | | | | Modified the algorithm so that the index is either the location of the element if found or the index at which to insert the element to maintain sorted order. Also added some tests to verify the above claim. | ||||
| * | [core]: Remove `do` keyword from the core library | flysand7 | 2023-11-11 | 1 | -3/+9 |
| | | |||||
| * | Make slice.clone and slice.clone_to_dynamic take a loc parameter | Karl Zylinski | 2023-10-30 | 1 | -4/+4 |
| | | |||||
| * | Replace `mem` with `runtime` in `core:slice` | gingerBill | 2023-06-28 | 2 | -22/+28 |
| | | |||||
| * | Fix typo | gingerBill | 2023-05-25 | 1 | -1/+1 |
| | | |||||
| * | Add missing `Allocator_Error` and `@(require_results)` to many procedures | gingerBill | 2023-05-22 | 2 | -20/+75 |
| | | |||||
| * | Remove `where ORD(E)` on procedures that don't need it | gingerBill | 2023-03-14 | 1 | -2/+2 |
| | | |||||
| * | Fix `slice.reverse` | gingerBill | 2023-01-27 | 1 | -2/+1 |
| | | |||||
| * | Add the inner `for` loop back in the logic | Andrea Piseri | 2022-12-21 | 1 | -6/+16 |
| | | | | | | | This could be easier to predict in cases where one of `left` and `right` is significantly greater than the other, and as such the same branch is taken multiple times in a row | ||||
| * | Fix non-generic cast in core:slice.rotate_left | Andrea Piseri | 2022-12-21 | 1 | -1/+1 |
| | | |||||
| * | Fix `core:slice.rotate_left` | Andrea Piseri | 2022-12-21 | 2 | -16/+10 |
| | | | | | | | | This commit includes two fixes: - a temporary cast to make the function compile - a fix to a logic error that caused the function to hang or return incorrect results | ||||
| * | Fix typo err: runtime.Allocator to Allocator_Error | André (counter) | 2022-12-09 | 1 | -1/+1 |
| | | |||||
| * | Correct reflection usage of maps | gingerBill | 2022-11-08 | 1 | -26/+22 |
| | | |||||
| * | Update sort_private.odin | gingerBill | 2022-10-18 | 1 | -2/+3 |
| | | |||||
| * | Use `uint` instead of `int` to improve code generation for bounds checking | gingerBill | 2022-09-27 | 1 | -2/+2 |
| | | |||||
| * | Add `slice.enumerated_array` | gingerBill | 2022-09-22 | 1 | -0/+7 |
| | | |||||
| * | Correct slice/ptr.odin calls | gingerBill | 2022-09-17 | 1 | -7/+9 |
| | | |||||
| * | fix sort_by_indices_allocate | Phil | 2022-09-07 | 1 | -1/+1 |
| | | |||||
| * | fix sort_by_with_indices for zero and one length slices: | Phil | 2022-09-01 | 1 | -2/+2 |
| | | |||||
| * | add sort_by_indices overload and test | Phil | 2022-09-01 | 1 | -1/+11 |
| | | |||||
| * | add tests for sort_by_indices | Phil | 2022-09-01 | 1 | -1/+2 |
| | | |||||
| * | cleanup slice sorting with indices changes | Phil | 2022-09-01 | 1 | -3/+3 |
| | | |||||
| * | have sort_with_indices allocate. Add a couple convenience procs for using ↵ | Phil | 2022-09-01 | 1 | -5/+28 |
| | | | | | the indices result to sort other slices. | ||||
| * | add sort_with_indices family of procs | Phil | 2022-08-31 | 2 | -0/+205 |
| | | |||||
| * | Fix #1972 | gingerBill | 2022-08-24 | 1 | -2/+2 |
| | | |||||
| * | Add `strings.prefix_length` & `slice.prefix_length` | Jeroen van Rijn | 2022-06-16 | 1 | -0/+15 |
| | | |||||
| * | Minor changes to `core:slice/heap`; add to examples/all | gingerBill | 2022-06-12 | 1 | -24/+24 |
| | | |||||
| * | Merge pull request #1830 from graphitemaster/dale/max_heap | gingerBill | 2022-06-12 | 1 | -0/+231 |
| |\ | | | | | add max heap implementation to slice package | ||||
| | * | fix | Dale Weiler | 2022-06-04 | 1 | -2/+1 |
| | | | |||||
 |
index : odin/Odin.git | |
| Odin Programming Language | Odin Lang |
| aboutsummaryrefslogtreecommitdiff |