| Age | Commit message (Collapse) | Author |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Ensure getAndPopFront/getAndPopBack don't promote `system` to `safe`
|
|
|
|
|
|
|
|
|
|
|
|
.get() returns a memory block that can be changed if the original array
is manipulated after getting the slice. So the slice returned by .get()
may allow access to invalid memory.
|
|
|
|
In tanya.algorithm.iteration.take & retro preserve const/inout for `empty`/`front`/etc.
|
|
|
|
`empty`/`front`/etc.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
- move
- moveEmplace
- forward
- emplace
- swap
|
|
|
|
|
|
|
|
Fix #65.
|
|
... iterating over a single value.
|
|
|
|
|
|
|
|
|
|
Also special case int-aligned scalars on 64-bit machines.
On a 64-bit machine hashing an array of pointers is now ~5.95x faster
with LDC2 and ~8.54x faster with DMD, and hashing an array of ints is
~3.34x faster with LDC2 and ~8.12x faster with DMD.
|