| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Add `#+feature dynamic-literals` to tests | gingerBill | 2025-01-05 | 1 | -0/+1 |
| | | |||||
| * | Add linear_search_reverse and linear_search_reverse_proc | Nia | 2024-09-25 | 1 | -0/+35 |
| | | |||||
| * | Check for zero-length slices in `slice.equal` | Feoramund | 2024-09-03 | 1 | -1/+31 |
| | | |||||
| * | Merge pull request #3767 from Feoramund/use-rng-context-in-test-runner | Jeroen van Rijn | 2024-06-19 | 1 | -4/+2 |
| |\ | | | | | Setup `context.random_generator` in test runner | ||||
| | * | Keep `-vet` happy | Feoramund | 2024-06-15 | 1 | -1/+1 |
| | | | |||||
| | * | Use test's random generator | Feoramund | 2024-06-15 | 1 | -4/+2 |
| | | | | | | | | | | | This removes the `create` calls when a test was only setting up a generator, and it replaces them with `reset` when run in a loop. | ||||
| * | | Add tests for `slice.unique` and `slice.unique_proc` | Jeroen van Rijn | 2024-06-16 | 1 | -1/+61 |
| |/ | |||||
| * | Merge pull request #3764 from Feoramund/test-runner-fixes | gingerBill | 2024-06-15 | 1 | -1/+2 |
| |\ | | | | | Fix half-implemented features in the test runner | ||||
| | * | Prefer `log.error` over `fail_now` in this case | Feoramund | 2024-06-15 | 1 | -1/+2 |
| | | | |||||
| * | | Update `core:math/rand` to use `context.random_generator` and remove `rand.Rand` | gingerBill | 2024-06-15 | 1 | -5/+7 |
| |/ | |||||
| * | Add test for `slice.permute` | Feoramund | 2024-06-09 | 1 | -1/+31 |
| | | |||||
| * | Port `tests\core\slice` | Jeroen van Rijn | 2024-06-02 | 1 | -97/+39 |
| | | |||||
| * | Used `strings.builder_reset` instead of `clear` for the string builder | Hector | 2023-11-25 | 1 | -4/+6 |
| | | |||||
| * | Updated to tabs and used provided test methods. | Hector | 2023-11-25 | 1 | -33/+37 |
| | | |||||
| * | Binary search improvements | Hector | 2023-11-25 | 1 | -0/+57 |
| | | | | | | | | | 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. | ||||
| * | cleanup tests | Phil | 2022-09-01 | 1 | -0/+7 |
| | | |||||
| * | add sort_by_indices overload and test | Phil | 2022-09-01 | 1 | -0/+16 |
| | | |||||
| * | add tests for sort_by_indices | Phil | 2022-09-01 | 1 | -0/+65 |
| | | |||||
| * | cleanup slice sorting with indices changes | Phil | 2022-09-01 | 1 | -1/+4 |
| | | |||||
| * | have sort_with_indices allocate. Add a couple convenience procs for using ↵ | Phil | 2022-09-01 | 1 | -10/+4 |
| | | | | | the indices result to sort other slices. | ||||
| * | Add test for core:slice. | Jeroen van Rijn | 2022-09-01 | 1 | -0/+97 |
 |
index : odin/Odin.git | |
| Odin Programming Language | Odin Lang |
| aboutsummaryrefslogtreecommitdiff |