proxy.golang.org : github.com/blackbox-tech/flatset
Package flatset provides the sorted associative containers 'FlatSet' and 'FlatMultiSet' that store data in continuous memory instead of a binary tree (similar to C++ std::flat_set and std::flat_multiset). Both the FlatSet and FlatMultiSet implement stable ordering, but the previous indices for values are invalidated following an method that modifies the container. Compared to a binary tree, flatsets are considerably faster to read as they avoid the cache misses from pointer referencing. On modern CPUs it is also surprisingly fast to insert into a flatset, especially if the collection is small, or if you frequently update the end of the flatset. For larger collections you can optimize write operations by using a flatset of pointers to structures instead of values, although you must be careful not to modify the data inside the flatset as it might affect how the data is sorted. This package uses 'range over functions' so it requires golang >= 1.23
Registry
-
Source
- Documentation
- JSON
purl: pkg:golang/github.com/blackbox-tech/flatset
Keywords:
collection
, container
, fast
, flat
, flatset
, go
, golang
, iterator
, ordered
, set
, sort
, sorted
License: MIT
Latest release: 12 months ago
First release: about 1 year ago
Namespace: github.com/blackbox-tech
Stars: 0 on GitHub
Forks: 0 on GitHub
See more repository details: repos.ecosyste.ms
Last synced: 14 days ago