| Commit message (Expand) | Author | Age | Files | Lines |
| * | Makefile: Add switch for picking number of parallel fuzz workersHEADmain | EuAndreh | 2025-05-27 | 1 | -1/+2 |
| * | meta.capim: Add with :dependencies key | EuAndreh | 2025-05-23 | 1 | -0/+8 |
| * | src/pds.go: Aesthetic tweaks 💅 | EuAndreh | 2025-05-19 | 1 | -170/+192 |
| * | src/pds.go: Hoist type definitions, constants and global variables | EuAndreh | 2025-05-19 | 1 | -288/+291 |
| * | src/pds.go: Add leading slash on package comment | EuAndreh | 2025-05-19 | 1 | -41/+41 |
| * | tests/fuzz/vector/pds.go: Implement first model for others to be made equivalent | EuAndreh | 2025-05-15 | 1 | -0/+136 |
| * | tests/fuzz/: Add noop fuzz targets | EuAndreh | 2025-05-15 | 32 | -0/+575 |
| * | Setup i18n with gotext | EuAndreh | 2025-05-15 | 21 | -122/+410 |
| * | src/pds.go: Add NewVectorOf() | EuAndreh | 2025-01-22 | 1 | -0/+9 |
| * | src/pds.go: Use NewMapBuilder() in implementation of NewMapOf() | EuAndreh | 2025-01-22 | 1 | -14/+16 |
| * | s/List/Vector/g | EuAndreh | 2025-01-22 | 24 | -420/+437 |
| * | tests/pds.go: Init removal of "testing" usage | EuAndreh | 2025-01-22 | 1 | -15/+26 |
| * | tests/pds.go: Move benchmarks and examples to separate test files | EuAndreh | 2024-12-27 | 60 | -720/+1364 |
| * | Add Makefile and move files to structured folders | EuAndreh | 2024-12-14 | 9 | -380/+612 |
| * | Remove extraneous files | EuAndreh | 2024-12-14 | 4 | -57/+0 |
| * | Merge pull request #49 from astef/master•••Link badge to pkg.go.dev (README) | Ben Johnson | 2023-08-17 | 1 | -1/+1 |
| |\ |
|
| | * | Merge pull request #1 from astef/astef-patch-1•••Link badge to pkg.go.dev | Alexander Stefurishin | 2023-08-17 | 1 | -1/+1 |
| |/| |
|
| | * | link badge to pkg.go.dev | Alexander Stefurishin | 2023-08-17 | 1 | -1/+1 |
| |/ |
|
| * | Merge pull request #46 from d80tb7/f/chrisma/sortedsetbuilder•••Expose sorted sets builder | Ben Johnson | 2023-03-11 | 2 | -4/+37 |
| |\ |
|
| | * | expose sorted sets builder | Chris Martin | 2023-03-01 | 2 | -4/+37 |
| |/ |
|
| * | Merge pull request #43 from infogulch/patch-1•••Fix typo in README NewMap -> NewSet | Ben Johnson | 2023-02-25 | 1 | -1/+1 |
| |\ |
|
| | * | Fix typo in README NewMap -> NewSet | Joe Taber | 2023-02-24 | 1 | -1/+1 |
| |/ |
|
| * | Merge pull request #38 from BarrensZeppelin/master•••Widen key constraint to 'any' for maps and sets | Ben Johnson | 2023-01-29 | 3 | -52/+51 |
| |\ |
|
| | * | Update documentation | Oskar Haarklou Veileborg | 2023-01-18 | 1 | -2/+2 |
| | * | Widen key constraint to 'any' for maps and sets | Oskar Haarklou Veileborg | 2023-01-18 | 2 | -50/+49 |
| |/ |
|
| * | Merge pull request #41 from benbjohnson/retract-v0.4.2•••Retract v0.4.2 | Ben Johnson | 2023-01-17 | 1 | -0/+2 |
| |\ |
|
| | * | Retract v0.4.2 | Ben Johnson | 2023-01-17 | 1 | -0/+2 |
| |/ |
|
| * | Merge pull request #39 from BarrensZeppelin/fix-sets•••Ensure immutability of sets, maps & lists | Ben Johnson | 2023-01-17 | 5 | -83/+41 |
| |\ |
|
| | * | Fix random seed for TestRandom•••The closure passed to t.Run captured the loop variable which would
always be equal to `*randomN` once the tests started running. This meant
that all of the runs used the same random seed.
| Oskar Haarklou Veileborg | 2023-01-12 | 1 | -0/+1 |
| | * | list: fix Append & Prepend, remove varargs support•••Similar reason for the API change as the previous commit.
| Oskar Haarklou Veileborg | 2023-01-12 | 2 | -12/+17 |
| | * | sets & maps: remove varargs APIs & SetMany variants•••The implementation behind the API is not more efficient than manually
looping over a data structure and inserting elements one-by-one.
| Oskar Haarklou Veileborg | 2023-01-12 | 3 | -56/+21 |
| | * | Ensure immutability of sets (and maps with SetMany) | Oskar Haarklou Veileborg | 2023-01-09 | 4 | -30/+17 |
| |/ |
|
| * | Merge pull request #35 from laher/sets-maps-append-multi•••Sets & maps append-multi. Also docs and a fix for SortedSets | Ben Johnson | 2023-01-02 | 5 | -21/+212 |
| |\ |
|
| | * | set/sorted-set: Items() to return slice of items | Am Laher | 2022-12-28 | 1 | -0/+22 |
| | * | SortedMap: set multiple items at once | Am Laher | 2022-12-28 | 1 | -0/+23 |
| | * | Fix SortedSet.Set. NewMapOf. docs | Am Laher | 2022-12-28 | 4 | -3/+125 |
| | * | sets: varargs | Am Laher | 2022-12-28 | 2 | -18/+42 |
| |/ |
|
| * | Merge pull request #34 from laher/sets•••Set + SortedSet with tests | Ben Johnson | 2022-12-26 | 2 | -0/+272 |
| |\ |
|
| | * | Set + SortedSet with test | Am Laher | 2022-12-24 | 2 | -0/+272 |
| * | | Merge pull request #33 from laher/addmulti•••List: varargs for Append,Prepend,NewList | Ben Johnson | 2022-12-26 | 1 | -7/+19 |
| |\ \
| |/
|/| |
|
| | * | List: varargs for Append,Prepend,NewList | Am Laher | 2022-12-24 | 1 | -7/+19 |
| |/ |
|
| * | Merge pull request #30 from laher/master•••readme updates for latest changes | Ben Johnson | 2022-12-21 | 1 | -18/+9 |
| |\ |
|
| | * | readme updates for latest changes | Am Laher | 2022-12-22 | 1 | -18/+9 |
| |/ |
|
| * | Merge pull request #29 from laher/map-keys-comparable•••generics: widen map key constraint to 'comparable' | Ben Johnson | 2022-12-20 | 1 | -47/+81 |
| |\ |
|
| | * | generic-widening: improve docs | Am Laher | 2022-12-04 | 1 | -6/+6 |
| | * | generics: widen map key constraint to 'comparable' | Am Laher | 2022-12-04 | 1 | -42/+76 |
| |/ |
|
| * | Merge pull request #28 from BarrensZeppelin/master•••Allow lists to contain non-comparable elements | Ben Johnson | 2022-12-02 | 2 | -30/+65 |
| |\ |
|
| | * | Allow lists to contain non-comparable elements•••The current design uses comparability of elements only to detect vacant
entries in leaf node children lists, using the zero value of the
element type as "vacant".
The reason we care about vacant entries is to avoid copy operations in
certain Slice calls. If the entries are not vacant, we have to "zero"
the entries in the returned slice to remove references to allocated
memory.
Therefore, (hackily) treating the zero value as vacant works because the
zero value for pointers is nil (it does not reference anything).
However, requiring the list elements to be comparable is inconvenient.
There shouldn't be a type bound on the elements of a general purpose
list.
With this change vacancy is kept track of with a bitset in list leaf nodes.
| Oskar Haarklou Veileborg | 2022-11-17 | 2 | -30/+65 |
| |/ |
|
| * | Merge pull request #24 from banks/patch-1•••Remove references to []byte keys in README | Ben Johnson | 2022-10-06 | 1 | -12/+19 |
| |\ |
|
| | * | Remove references to []byte keys in README•••#23 added generic support (which is awesome) but noted the breaking change about no longer supporting `[]byte` keys due to the `Ordered` constraint.
Ideally, this library would continue to support `[]byte` keys and use a custom interface to constrain key types instead. But until that happens, the README right now is a bit surprising as it talks explicitly about supporting `[]byte` keys still but they are actually a compile error!
Here's a drive-by fix for the README for now - I _think_ I caught all the incorrect statements. | Paul Banks | 2022-10-05 | 1 | -12/+19 |
| |/ |
|