Search Results for "trie"
Sort By:
Showing 30 open source projects for "trie"
View related business solutions-
Find Hidden Risks in Windows Task SchedulerWindows Task Scheduler might be hiding critical failures. Download the free JAMS diagnostic tool to uncover problems before they impact production—get a color-coded risk report with clear remediation steps in minutes.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
EthereumJS Monorepo
Monorepo for the Ethereum VM TypeScript Implementation
...There is a TypeScript implementation of the Ethereum Virtual Machine (EVM) ready to be used in Node.js or a browser environment, implementations of core structural blockchain building blocks like an Ethereum Tx, Block or Blockchain as well as a Trie (Merkle Patricia Tree) and devp2p (execution networking layer) implementation. All libraries are bound together by the core Common library keeping track of chain specifics and hardfork changes. They are complemented by helper packages like RLP for data encoding/decoding or Util, providing helper functionalities like (byte) conversion, signatures, types and others. ... -
2
go-datastructures
A collection of useful, performant, and threadsafe Go datastructures
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... -
3
L2
A BST, B-tree and trie data structures library.
L2 is a data structures library. Featured are self balancing BSTs and self balancing BST backed sequences, in memory B-trees and B-tree backed sequences, pointer sets, radix and critical bit trees. A few articles about L2 data structures and more here: https://dsxxi.home.blog/ -
4
libfc4c
Fast containers for C language
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... -
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
5
Elementary Algorithms
Book of elementary algorithms and data structures
This book introduces elementary algorithms and data structure. It includes side-by-side comparison of purely functional realization and their imperative counterpart. From 2020/12, I started re-writing this book. The PDF can be downloaded for preview (EN, 中文). The 1st edition in Chinese (中文) was published in 2017. I recently switched my focus to the Mathematics of programming, the new book is also available in (github). To build the book in PDF format from the sources, you need the following... -
6
LBRY Chainquery
Chainquery parses and syncs the LBRY blockchain data
...The example provided is leveraged to handle the status of a claim which is actually stored in the ClaimTrie of LBRYcrd. So it runs periodically to make sure Chainquery has the most up-to-date status of claims in the trie. -
7
levin
in-memory key value server with fuzzy search capabilities
Levin is an event-based key/value server based on radix-tree (space optimized trie). Key search can be performed with an approximate key matching algorithm based on Levenshtein edit distance. -
8
AhoCorasickDoubleArrayTrie
An extremely fast implementation of Aho Corasick algorithm
AhoCorasickDoubleArrayTrie is a Java implementation of the Aho–Corasick multi-pattern matching algorithm that is optimized using a Double-Array Trie data structure. It is designed for fast keyword scanning across large texts, where you want to search for many patterns simultaneously and efficiently. The core idea is to build an automaton from a dictionary of patterns, then stream through input text to emit matches with minimal overhead. By using a double-array trie representation, the project emphasizes performance and memory efficiency compared to simpler pointer-heavy trie structures, which can matter a lot for large dictionaries or latency-sensitive services. ... -
9
HttpRouter
A high performance HTTP request router that scales well
...The router is optimized for high performance and a small memory footprint. It scales well even with very long paths and a large number of routes. A compressing dynamic trie (radix tree) structure is used for efficient matching. With other routers, like http.ServeMux, a requested URL path could match multiple patterns. Therefore they have some awkward pattern priority rules, like longest match or first registered, first matched. By design of this router, a request can only match exactly one or no route. ... -
Atera all-in-one platform IT management software with AI agentsAtera’s AI agents don’t just assist, they act. From detection to resolution, they handle incidents and requests instantly, taking your IT management from automated to autonomous.
-
10
-
11
This bash script translates an ODT file tree into an Opale tree. Dependencies : libreoffice, unoconv, 7z Opale project homepage : https://scenari.org/modeles/Opale/ LibreOffice homepage : https://www.libreoffice.org/
-
12
Triepocalypse
A trie data structure extracted from the typing game Typocalypse.
The typing game Typocalypse (https://code.google.com/p/typocalypse/source/browse/#hg/Trie) used a trie data structure which has been linked to separately from the game and has been of separate interest for some years now. It has now been given its own repository. A trie is a data structure used to find strings from their prefixes. After having stored strings in the trie, the trie will efficiently find all the strings which start with a particular prefix. ... -
13
Immutable Collections for Java
Immutable/Persistent Collections Library
...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. -
14
AppInfer
Probabilistic Trie-based Signature for Application Identification
Construct probabilistic signatures for application identification based on the trie data structure. -
15
A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.
-
16
the c prototyping tools library provides thread-safe linked list, priority queue, hash table, hash list, AVL tree and trie implementations, as well as a thread pool and thread management framework, a tcp and http socket api, and a dbms abstraction layer.
-
17
Prefix Tree
A lighting-fast prefix tree and DAWG implementation in C and python
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. -
18
creates a compressed trie that maps keys to values and values to keys. Compression is on the front end of keys. Useful for lightweight reserved word creation in constrained memory/processor power situations. Written in C.
-
19
Fast cython implementation of trie data structure for Python. Development is inactive, but moved to: http://github.com/martinkozak/cytrie.
-
20
Extensible Compressed Trie
An extensible and compressed trie data structure written in C++.
An extensible and compressed trie data structure written in C++. -
21
Random Java utility classes 1. Prefix Trie based data structure 2. An indexed map (indexed by keys or values). 3. Main class that provides start/stop functionality for standalone apps. 4. File io api's based based on callback design.
-
22
A collection API extending the Java Collections API. Currently it is providing a trie map (java.util.Map) and a trie set (java.util.Set).
-
23
A compression engine based on the Huffman trie algorithm. The algorithm is pretty cpu-light, and as such, runs much more quickly than RAR or other 'heavy' algorithms, but could still achieve decent compression. Use with tar for multi-file archives.
-
24
-
25
C++ implementation of Hash Array Mapped Trie (HAMT). Class design follows STL principles and aims to meet the requirements and to provide the guarantees of std::hash_map.
