sdsl-lite
plurid-data-structures-typescript
sdsl-lite | plurid-data-structures-typescript | |
---|---|---|
5 | 1 | |
2,174 | 1 | |
- | - | |
0.0 | 3.1 | |
11 months ago | about 1 year ago | |
C++ | TypeScript | |
GNU General Public License v3.0 or later | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
sdsl-lite
- SDSL – Succinct Data Structure Library
-
Ask HN: What are some 'cool' but obscure data structures you know about?
Succinct Data Structures [0] [1]. It encompass many different underlying data structure types but the overarching idea is that you want small data size while still keeping "big O" run time.
In other words, data structures that effectively reach a 'practical' entropy lower bound while still keeping asymptotic run time.
[0] https://en.wikipedia.org/wiki/Succinct_data_structure
[1] https://github.com/simongog/sdsl-lite
-
SDSL-RS: A Rust interface for the C++ Succinct Data Structure Library.
The book mentioned in another comment is probably the best way to go. But FYI, documentation for some data structures include references. An SDSL-lite example can be found here. And its equivalent in SDSL-RS can be found here.
plurid-data-structures-typescript
-
Ask HN: What are some 'cool' but obscure data structures you know about?
Somewhat along these lines, I have formed a concept forcedly called "differentially composable string", or "deposed string", or more precise "poor man's git".
The intended use case is to obtain a compact representation of all the historic text entered into an input field (notes, comments, maybe long-form): all the stages of the text, where a stage is a tuple [add/remove, start_index, text/end_index]. Once you get the stages from the deposed string as JSON, you could transform them however you want then load them into a new deposed string.
You can read more on GitHub: https://github.com/plurid/plurid-data-structures-typescript#... or play around on my note-taking app implementing deposed strings and more: https://denote.plurid.com
What are some alternatives?
sdsl-lite - Succinct Data Structure Library 3.0
RVS_Generic_Swift_Toolbox - A Collection Of Various Swift Tools, Like Extensions and Utilities
minisketch - Minisketch: an optimized library for BCH-based set reconciliation
multiversion-concurrency-control - Implementation of multiversion concurrency control, Raft, Left Right concurrency Hashmaps and a multi consumer multi producer Ringbuffer, concurrent and parallel load-balanced loops, parallel actors implementation in Main.java, Actor2.java and a parallel interpreter
dictomaton - Finite state dictionaries in Java
PSI - Private Set Intersection Cardinality protocol based on ECDH and Bloom Filters
gring - Golang circular linked list with array backend
t-digest - A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means
pyroscope - Continuous Profiling Platform. Debug performance issues down to a single line of code [Moved to: https://github.com/grafana/pyroscope]
AspNetCoreDiagnosticScenarios - This repository has examples of broken patterns in ASP.NET Core applications
ctrie-java - Java implementation of a concurrent trie
entt - Gaming meets modern C++ - a fast and reliable entity component system (ECS) and much more