| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | 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 |
| | | | |||||
| | * | add max heap implementation to slice package | Dale Weiler | 2022-06-04 | 1 | -0/+232 |
| | | | |||||
| * | | Fixed `slice.is_sorted_cmp` | Despacito696969 | 2022-06-07 | 1 | -1/+1 |
| |/ | |||||
| * | Remove `strings` dependency from `core:sys/windows` | gingerBill | 2022-06-02 | 1 | -3/+1 |
| | | |||||
| * | Duplicate some basic slice procedures from core:mem into core:slice | Tetralux | 2022-04-18 | 1 | -0/+47 |
| | | |||||
| * | Fix tail recursion in `_quick_sort_general` | Andrea Piseri | 2022-04-13 | 1 | -1/+1 |
| | | | | | | | The `if` statement should have been a `for` loop, in order to allow recursively sorting the subarrays with quicksort, and not resort to shell sort after one step. | ||||
| * | Add more things to `package slice` | gingerBill | 2022-03-08 | 1 | -5/+96 |
| | | | | | | | | | min_max any_of(_proc) none_of(_proc) all_of(_proc) count(_proc) | ||||
| * | Remove the unneeded `$` | gingerBill | 2022-01-31 | 1 | -2/+2 |
| | | |||||
| * | Add `slice.stable_sort*` procedures | gingerBill | 2022-01-31 | 3 | -12/+61 |
| | | |||||
| * | Unify logic for `slice.sort*` related procedures | gingerBill | 2022-01-31 | 2 | -488/+182 |
| | | |||||
| * | use multipointers instead of simple pointers | Andrea Piseri | 2021-12-28 | 1 | -11/+7 |
| | | |||||
| * | Merge branch 'master' into slice_scanner | Andrea Piseri | 2021-12-28 | 1 | -1/+1 |
| |\ | |||||
| | * | make `slice.as_ptr` return `[^]E` | gingerBill | 2021-12-28 | 1 | -1/+1 |
| | | | |||||
| * | | Add slice/scanner proc | Andrea Piseri | 2021-12-23 | 1 | -0/+21 |
| |/ | |||||
| * | Rename slice.to_dynamic to slice.clone_to_dynamic | Tetralux | 2021-12-21 | 1 | -2/+3 |
| | | |||||
| * | add builtin. | Michael Kutowski | 2021-11-19 | 1 | -1/+1 |
| | | |||||
| * | Add `slice.swap_between` | gingerBill | 2021-10-26 | 2 | -1/+32 |
| | | |||||
| * | Add `#no_bounds_check` to sorting procedures | gingerBill | 2021-10-26 | 1 | -18/+18 |
| | | |||||
| * | Make core and vendor adhere to `-vet`, `-strict-style`, and `-disallow-do` | gingerBill | 2021-09-11 | 1 | -3/+7 |
| | | |||||
| * | Remove unneeded semicolons from the core library | gingerBill | 2021-08-31 | 4 | -379/+379 |
| | | |||||
| * | Enforce `core:builtin` and `core:intrinsics` for imports | gingerBill | 2021-08-21 | 3 | -4/+4 |
| | | |||||
| * | Use builtin.min and builtin.max in package slice | gingerBill | 2021-07-09 | 1 | -2/+2 |
| | | |||||
| * | Add `slice.min` and add `slice.max` | gingerBill | 2021-07-08 | 1 | -0/+24 |
| | | |||||
| * | Add `slice.sort_by_cmp` Ordering based sorting algorithms | gingerBill | 2021-07-03 | 1 | -8/+229 |
| | | |||||
| * | Change uses for parapoly records to use `$` always | gingerBill | 2021-06-14 | 1 | -2/+2 |
| | | |||||
 |
index : odin/Odin.git | |
| Odin Programming Language | Odin Lang |
| aboutsummaryrefslogtreecommitdiff |