| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2023-02-18 | update std lib and compiler sources to new for loop syntax | Andrew Kelley | |
| 2022-12-13 | std: Fix update() method in PriorityQueue and PriorityDequeue (#13908) | Frechdachs | |
| Previously the update() method would iterate over its capacity, which may contain uninitialized memory or already removed elements. | |||
| 2022-09-16 | std: remove deprecated API for the upcoming release | Andrew Kelley | |
| See #3811 | |||
| 2022-08-22 | stage2+stage1: remove type parameter from bit builtins | Veikka Tuominen | |
| Closes #12529 Closes #12511 Closes #6835 | |||
| 2022-07-25 | PriorityDequeue: use compareFn in update() method | VÖRÖSKŐI András | |
| 2021-12-15 | std.priority_dequeue: allow comparator to take a context parameter | Arnavion | |
| 2021-11-30 | allocgate: std Allocator interface refactor | Lee Cannon | |
| 2021-11-30 | std lib API deprecations for the upcoming 0.9.0 release | Andrew Kelley | |
| See #3811 | |||
| 2021-10-27 | std.rand: Refactor `Random` interface | Ominitay | |
| These changes have been made to resolve issue #10037. The `Random` interface was implemented in such a way that causes significant slowdown when calling the `fill` function of the rng used. The `Random` interface is no longer stored in a field of the rng, and is instead returned by the child function `random()` of the rng. This avoids the performance issues caused by the interface. | |||
| 2021-10-17 | Move `compareFn` from init to type constructor in `PriorityQueue` and ↵ | Max Hollmann | |
| `PriorityDequeue`. This change significantly improves performance for simple compare functions and modifies the API to be more consistent with e.g. `HashMap`. | |||
| 2021-09-19 | std.PriorityDequeue: ensureUnusedCapacity and ensureTotalCapacity | Ryan Liptak | |
| Same as c8ae581fef6506a8234cdba1355ba7f0f449031a, but for PriorityDequeue. | |||
| 2021-08-24 | remove redundant license headers from zig standard library | Andrew Kelley | |
| We already have a LICENSE file that covers the Zig Standard Library. We no longer need to remind everyone that the license is MIT in every single file. Previously this was introduced to clarify the situation for a fork of Zig that made Zig's LICENSE file harder to find, and replaced it with their own license that required annual payments to their company. However that fork now appears to be dead. So there is no need to reinforce the copyright notice in every single file. | |||
| 2021-06-21 | fix code broken from previous commit | Jacob G-W | |
| 2021-05-12 | fix shrinkAndFree and remove shrinkRetainingCapacity in PriorityQueue and ↵ | Matthew Borkowski | |
| PriorityDequeue | |||
| 2021-05-08 | std: update usage of std.testing | Veikka Tuominen | |
| 2021-01-18 | Change `compareFn` to `fn (a: T, b: T) std.math.Order` | Zander Khan | |
| 2021-01-17 | Remove `resize`. Adding uninitialized memory at the end of the `items` would ↵ | Zander Khan | |
| break the heap property. | |||
| 2021-01-17 | Replace `shrink` with `shrinkAndFree` and `shrinkRetainingCapacity` | Zander Khan | |
| 2021-01-16 | Fix slice length when updating | Zander Khan | |
| 2021-01-16 | Fix update might change an element no longer in the queue | Zander Khan | |
| 2021-01-16 | Rename heap to queue in tests for consistency | Zander Khan | |
| 2021-01-16 | Fix edge cases in fromOwnedSlice | Zander Khan | |
| 2021-01-16 | Ensure we cannot remove an item outside the current length of the queue | Zander Khan | |
| 2021-01-16 | Remove magic number | Zander Khan | |
| 2021-01-16 | Add license to top of file | Zander Khan | |
| 2021-01-16 | std: Add Priority Dequeue | Zander Khan | |
 |
index : zig | |
| General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software. https://ziglang.org |
| aboutsummaryrefslogtreecommitdiff |