trie

There are 1076 repositories under trie topic.

  • ciri

    Ciri is an Ethereum implementation written in Ruby.

    Language:Ruby127

  • goodname

    Tool to assist you with cool naming of your methods and software

    Language:Rust125

  • java-ds-algorithms

    Data Structures and Algorithms in Java

    Language:Java125

  • healthcare-appointment-scheduling-app

    • This is a patient doctor appointment booking WebApp. Patient signs in using google account and Doctor needs to register prior in the system to login. • Patient can book appointment in slot and calendar event with meeting link will be created. • It also has Feedback, JWT Authentication and payment feature. • Tech Stack: React.js, Node.js, Express.js, MongoDB, Trie

    Language:JavaScript120

  • unitdb

    Fast specialized time-series database for IoT, real-time internet connected devices and AI analytics.

    Language:Go120

  • adaptive-radix-tree

    A fast and space efficient Radix tree in Java

    Language:Java118

  • Buckets-Swift

    Swift Collection Data Structures Library

    Language:Swift118

  • DawgSharp

    DAWG String Dictionary in C#

    Language:C#118

  • completely

    Java autocomplete library.

    Language:Java112

  • trie

    A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.

    Language:Go110

  • trie

    Fast Merkle-Patricia Trie (MPT) state root calculator and proof generator for prefix-sorted nibbles

    Language:Rust106

  • trie

    Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.

    Language:C#101

  • gogu

    A comprehensive, reusable and efficient concurrent-safe generics utility functions and data structures library.

    Language:Go100

  • trie-rs

    Memory efficient trie (prefix tree) library based on LOUDS

    Language:Rust100

  • efrt

    neato compression for key-value data

    Language:JavaScript100

  • treebitmap

    Fast IP lookup table for IPv4/IPv6 prefixes

    Language:Rust100

  • trie

    A fast trie implementation for typescript

    Language:TypeScript99

  • cyac

    High performance Trie and Ahocorasick automata (AC automata) Keyword Match & Replace Tool for python. Correct case insensitive implementation!

    Language:Cython95

  • qp-trie-rs

    An idiomatic and fast QP-trie implementation in pure Rust.

    Language:Rust95

  • HArray

    Fastest Trie structure (Linux & Windows)

    Language:C++92

  • thmap

    Concurrent trie-hash map library

    Language:C91

  • Algorithms

    Data Structures & Algorithms. Includes solutions for Cracking the Coding Interview 6th Edition

    Language:Ruby90

  • flash

    Golang Keyword extraction/replacement Datastructure using Tries instead of regexes

    Language:Go89
  • goblin

    goblin

    A golang http router based on trie tree.

    Language:Go79

  • dorado

    基于Netty4开发的简单、轻量级、高性能的的Http restful api server

    Language:Java77

  • Competitive_Programming

    Contains solutions and codes to various online competitive programming challenges and some good problems. The links to the problem sets are specified at the beginning of each code.

    Language:Python73

  • trie

    My take on an efficient implementation of a Trie in Javascript

    Language:JavaScript73

  • retrie

    Efficient Trie-based regex unions for blacklist/whitelist filtering and one-pass mapping-based string replacing

    Language:Python68

  • xcdat

    Fast compressed trie dictionary library

    Language:C++65

  • faststringmap

    A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.

    Language:Go64

  • dao

    Simple and high-performance data structures and algorithms library

    Language:Go59

  • poplar-trie

    C++17 implementation of memory-efficient dynamic tries

    Language:C++57
  • DSA-Simplified

    DSA-Simplified

    Designed by Engineers for Engineers. This is your One stop shop for all DSA queries! Here you will find implementation of all sorts of data structures and algorithms.

    Language:C#55

  • lexpy

    Python package for lexicon; Trie and DAWG implementation.

    Language:Python55

  • trie-prefix-tree

    Create and modify trie prefix structures and extract word lists including prefixes, anagrams and sub-anagrams

    Language:JavaScript51

  • swift-hamt

    An implementation of HAMT data-structure in Swift

    Language:Swift49