Search Results for "trie"
Sort By:
Showing 29 open source projects for "trie"
View related business solutions-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
-
Simple, Secure Domain RegistrationRegister or renew your domain and pay only what we pay. No markups, hidden fees, or surprise add-ons. Choose from over 400 TLDs (.com, .ai, .dev). Every domain is integrated with Cloudflare's industry-leading DNS, CDN, and free SSL to make your site faster and more secure. Simple, secure, at-cost domain registration.
-
1
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... -
2
EthereumJS Monorepo
Monorepo for the Ethereum VM TypeScript Implementation
This repository holds various protocol building blocks of the Ethereum blockchain execution layer and is managed by the Ethereum Foundation JavaScript team. 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... -
3
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... -
4
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/ -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
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... -
6
LBRY Chainquery
Chainquery parses and syncs the LBRY blockchain data
... types of jobs to update the Chainquery database example. These jobs synchronize different areas of the data either to make queries faster or ascertain information that is not directly part of the raw blockchain. 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
HttpRouter
A high performance HTTP request router that scales well
HttpRouter is a lightweight high performance HTTP request router (also called multiplexer or just mux for short) for Go. In contrast to the default mux of Go's net/http package, this router supports variables in the routing pattern and matches against the request method. It also scales better. 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... -
9
-
The All-in-One Commerce Platform for Businesses - ShopifyShopify is a leading all-in-one commerce platform that enables businesses to start, build, and grow their online and physical stores. It offers tools to create customized websites, manage inventory, process payments, and sell across multiple channels including online, in-person, wholesale, and global markets. The platform includes integrated marketing tools, analytics, and customer engagement features to help merchants reach and retain customers. Shopify supports thousands of third-party apps and offers developer-friendly APIs for custom solutions. With world-class checkout technology, Shopify powers over 150 million high-intent shoppers worldwide. Its reliable, scalable infrastructure ensures fast performance and seamless operations at any business size.
-
10
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/
-
11
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. Project was developed using C... -
12
Immutable Collections for Java
Immutable/Persistent Collections Library
Library providing immutable/persistent collection classes for Java. While collections are immutable they provide methods for adding and removing values by creating new modified copies of themselves. Each copy shares as much as possible of its structure with other copies to minimize memory consumption. The library includes a singly linked (cons/cddr style) list/stack, an integer trie based indexed list, a 2-3 tree based random access indexed list, a 2-3 tree based map, a hash trie based map... -
13
AppInfer
Probabilistic Trie-based Signature for Application Identification
Construct probabilistic signatures for application identification based on the trie data structure. -
14
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.
-
15
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.
-
16
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. -
17
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.
-
18
Fast cython implementation of trie data structure for Python. Development is inactive, but moved to: http://github.com/martinkozak/cytrie.
-
19
Extensible Compressed Trie
An extensible and compressed trie data structure written in C++.
An extensible and compressed trie data structure written in C++. -
20
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.
-
21
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).
-
22
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.
-
23
-
24
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.
-
25
Raku-ML-TriesWithFrequencies
Creation and manipulation of tries (prefix trees) with frequencies.
This Raku package has functions for creation and manipulation of Tries (Prefix trees) with frequencies. The package provides Machine Learning (ML) functionalities, not "just" a Trie data structure. This Raku implementation closely follows the Java implementation [AAp3]. The system of function names follows the one used in the Mathematica package [AAp2]. ## References [AAp2] Anton Antonov, Tries with frequencies Mathematica package, (2013-2018), MathematicaForPrediction at GitHub...