libaca
hash-array-mapped-trie
libaca | hash-array-mapped-trie | |
---|---|---|
3 | 1 | |
7 | 9 | |
- | - | |
2.3 | 0.0 | |
about 1 year ago | over 2 years ago | |
C | C | |
BSD 3-clause "New" or "Revised" License | BSD 2-clause "Simplified" License |
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.
libaca
-
A Trie Variant Balancing between Time, Space, and Simplicity; And a C Implementation of the Aho-Corasick Algorithm Based on It
Repo of the A.-C algorithm implementation: https://github.com/dongyx/libaca
- LibACA: C Library Implementing `fgrep`, with Balance between Time, Space, and Simplicity, in 174 LOCs of C89
- LibACA: C Library of Aho-Corasick Algorithm, with Balance between Time, Space, and Simplicity
hash-array-mapped-trie
-
Fast and Elegant Clojure: Idiomatic Clojure without sacrificing performance
I’m familiar with the implementation of HAMTs - if anyone wants to study one in C I recommend https://github.com/Jamesbarford/hash-array-mapped-trie or my polymorphic fork of it https://github.com/fromheten/hash-array-mapped-trie-poly.
Are there any other key/value data structures where insertion and retrieval are less than O(n) in complexity, but where the memory layout is better ordered for cache hits during searches? Maybe good old red-black trees?
What are some alternatives?
multi_string_replace - A fast multiple string replace library for ruby. Uses a C implementation of the Aho–Corasick Algorithm based on https://github.com/morenice/ahocorasick while adding support for on the fly multiple string replacement. Faster alternative to String.gsub when dealing with non-regex (exact match) use cases
cl-cuda - Cl-cuda is a library to use NVIDIA CUDA in Common Lisp programs.
chtrie - Coordinate Hash Trie: A Trie Variant Balancing between Time, Space, and Simplicity
criterium - Benchmarking library for clojure
magicl - Matrix Algebra proGrams In Common Lisp.
april - The APL programming language (a subset thereof) compiling to Common Lisp.
JWM - Cross-platform window management and OS integration library for Java
skiko - Kotlin MPP bindings to Skia
hash-array-mapped-trie-poly - A hash array mapped trie implementation in c.
mgl - Common Lisp machine learning library.
Petalisp - Elegant High Performance Computing
http4s-native-image - Compiling an example http4s web service to a native executable using GraalVM Native Image