int_set
Integer set
An efficient data structure for storing positive integers
A time- and memory-efficient data structure for positive integers.
10 stars
3 watching
1 forks
Language: Elixir
last commit: 3 months ago
Linked from 1 awesome list
bitfieldbitfieldsbittorrentcollectionelixirenumerablehacktoberfestset
Related projects:
Repository | Description | Stars |
---|---|---|
| A fast and space-efficient data structure for lookups using bit arrays in Elixir | 36 |
| A library that provides a way to encode integers in a lexicographically sorted manner | 1 |
| An efficient data structure for compactly storing and manipulating binary numbers using bit-level parallelism. | 159 |
| A collection of optimized hashcat rules generated from real-world password compromise data. | 391 |
| A polyfill implementation of the Set data structure as specified in ECMAScript 6 | 46 |
| A C++14 implementation of a class to represent arbitrary range of signed integers | 11 |
| An embedded key-value database designed for robustness and minimal resource usage, supporting atomic transactions, concurrency control, and range selection. | 570 |
| Protects sensitive integer IDs by encoding and decoding them with encryption keys. | 3 |
| A pre-trained word embedding model informed by a large-scale knowledge graph, providing a nuanced representation of word meanings. | 1,296 |
| A Go package implementing bitsets as a mapping between non-negative integers and boolean values | 1,363 |
| A library that provides an efficient and customizable sorted set data structure for Elixir applications | 21 |
| An Elixir implementation of the Git object storage model, focusing on protocol over Git and enabling reuse with other storage systems. | 68 |
| Provides a Racket extension for untyped algebraic data structures with first-class support for sums and products. | 75 |
| An immutable data structure for efficiently managing sorted sets. | 27 |
| A set of algorithms for compressing integers in programming languages | 130 |