Search Results for "trie"

Go-datastructures is a collection of useful, performant, and threadsafe Go datastructures. Interval tree for collision in n-dimensional ranges. Implemented via a red-black augmented tree. Extra dimensions are handled in simultaneous inserts/queries to save space although this may result in suboptimal time complexity. Intersection determined using bit arrays. In a single dimension, inserts, deletes, and queries should be in O(log n) time. Bitarray used to detect existence without having to...

C dynamic containers are missing in the standard, so almost every single project in C uses different implementations. This library is yet another implementation of few basic containers, optimized for speed. A simplified interface to libarchive allows to save the containers in a compressed form. All the containers are 32bit. This greatly improves the performance (up to ~32%) and reduces the memory consumption (up to 41%) on 64bit systems. All the containers are pre-allocating buffers to...

...The 2-3 tree and integer trie classes are optimized for performance and can be used alongside java.util Collections when immutability is needed for safe data sharing.

A lighting-fast prefix tree (trie) and compressed prefix tree (DAWG) implementation. This library can be usefull for longest-prefix matching, code completion, dictionary compression, spell checking.

Fast cython implementation of trie data structure for Python. Development is inactive, but moved to: http://github.com/martinkozak/cytrie.