https://github.com/simre1/sparse-set

https://github.com/simre1/sparse-set

Last synced: 13 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/simre1/sparse-set
• Owner: Simre1
• License: mit
• Created: 2022-09-02T14:04:07.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2023-02-08T17:16:13.000Z (almost 2 years ago)
• Last Synced: 2024-11-07T18:29:12.675Z (2 months ago)
• Language: Haskell
• Size: 36.1 KB
• Stars: 2
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: CHANGELOG.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Sparse Set

Sparse Sets are useful when you have a lot of potential keys but only a small part of them is used. Sparse sets can deal with many keys while providing fast iteration over the values within the set.

There are 4 variants:

- `Boxed`: The standard version which can deal with arbitrary Haskell values.

- `Storable`: Can only deal with Storable values.

- `Unboxed`: Can only deal with Unbox(vector package) values.

- `NoComponent`: Contains no values, only the keys.