Awesome Open Source

Programming Languages

Search results for trie

628 search results found

Bloomfiltertrie ⭐ 36

An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.

Extra Collections ⭐ 36

extra-collections (or extra for short) is a python3 package that provides a pythonic, intuitive, and easy implementation of the most common data structures used in software projects.

Terark Zip ⭐ 35

A data structure and algorithm library built for TerarkDB

Healthcare Appointment Scheduling App ⭐ 35

• 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

single file C libraries

Trie implementation for PHP

Ip Radix Tree ⭐ 34

Fast, robust and memory-savvy IP radix tree (Patricia trie) implementation in Java

Compile-time TRIE based string matcher (C++11)

Csharp Trie ⭐ 33

A trie (prefix tree) data structure implementation in C#.

Phonegeocode ⭐ 33

Phone number geocoding library for Go (#golang)

Trie Prefix Tree ⭐ 33

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

Solvedchallenges ⭐ 33

My solved challenges and hacks (Go, Python, Java)

Scala implementation of data structures from Chris Okasaki's book

Swift Hamt ⭐ 32

An implementation of HAMT data-structure in Swift

A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.

Go Succinct Data Structure Trie ⭐ 31

Succinct Data Structure of Trie, written in Go

Pinyin2chinese ⭐ 31

Self complemented Pinyin2Chinese demo use algorithms including Trie and HMM model , 基于隐马尔科夫模型与Trie树的拼音切分与拼音转中文的简单demo实现。

Cidr Ip Trie ⭐ 31

Comparable CIDR and IP types, and Trie collections for suffix, prefix, and longest prefix matching

A go implemention of efficiently-updatable double-array trie

Play With Data Structure Python ⭐ 31

使用python语言写数据结构与算法。线性搜索、选择排序、插入排序、栈，队列，循环队列、链表，链表实和映射、堆、优先队列、冒泡排序、希尔排序、线段树、Trie字典树、并查集、AVL树、红黑树、哈希表、计

Cache Conscious Data Structures ⭐ 31

The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.

Ahocorasickdoublearraytrie ⭐ 30

Very fast C# implementation of Aho Corasick algorithm based on Double Array Trie.

Burst Trie ⭐ 30

Implements a Rust ordered map as a BurstTrie.

A small and simple URL routing library for Java

Algorithms ⭐ 30

General purpose implementation of advanced algorithms

Rust Darts ⭐ 29

Double Array Trie in Rust

Triebeard ⭐ 29

Radix trees in Rcpp and R

Compact Trie Based Thinglet

Merkle Patricia Trie ⭐ 28

Python implementation of the Modified Merkle Patricia Trie

Ruby Regexp_trie ⭐ 28

Fast keyword matching with the Trie algorithm (a Ruby port of Perl's Regexp::Trie)

Level Trie ⭐ 28

The TRIE data structure and search algorithm, on top of leveldb.

Directed Acyclic Word Graph

Patricia Trie ⭐ 28

a pure-Python PATRICIA trie implementation.

Simple Patricia Trie ⭐ 28

A simple PATRICIA Trie implementation that's more "hackable".

➿ 关键词过滤扩展, 用于检查一段文本中是否出现敏感词, 基于 Double-Array Trie 树实现。

Simple Serialize, the canonical serialization library for the Ethereum Serenity project

Rabbitmq Rtopic Exchange ⭐ 27

RabbitMQ Reverse Topic Exchange

Interviewprep ⭐ 27

A repo that might help you for Data structures and Algorithms (DSA) interviews

Boxwood is a PHP extension for fast replacement of multiple words in a piece of text. It supports case-sensitive and case-insensitive matching. It requires that the text it operates on be encoded as UTF-8.

xmnlp中文分词工具，java编写，统计概率分词+规则分词实现，功能包括人名识别，词性标注，用户自

Library implementing the prefix tree in Rust

Triehash ⭐ 26

Generator for order-preserving minimal perfect hash functions in C

Data_structure_note ⭐ 26

《恋上数据结构》第1季度 + 第2季完整学习笔记，从0实现的 Java 数据结构大全。

Static Radix Tree (Patricia trie) implementation in C

Optimized Patricia trie with disk storage

🐙 trie based suggestions microlibrary

Coco Trie ⭐ 25

COllapsed and COmpressed trie: a data-aware compressed string dictionary

Yt Challenges ⭐ 25

Crit-bit tree (trie) library

Dict Parser ⭐ 25

Create a fast parser to match dictionary keys.

Distinctkeywords ⭐ 25

semantically distinct key phrase extraction using hilbert hashes.

Static Double Array Trie (DASTrie)

HTTP URL.Path Router -- 专注路由

Faststringmap ⭐ 25

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

Wzqinstantsearch ⭐ 24

An Algorithm For Instant Search

C Dictionary Trie ⭐ 24

A dictionary implementation that is written in C and backed by a prefix tree.

System Design ⭐ 24

Some tiny exercises for system design.

Reldi Tagger ⭐ 23

A tagger and lemmatiser for Croatian, Serbian and Slovene.

A simple Golang implementation of Aho-Corasick algorithm.

An Implementation of Two-Trie and Tail-Trie using Double Array

Java port of a concurrent trie hash map implementation from the Scala collections library

Trie Mux ⭐ 22

A minimal and powerful trie based url path router (or mux) for Go.

Fixie Trie ⭐ 22

Compact tries for fixed-width keys

The fast and flexible Trie Tree implementation in Go.

Trie Ing ⭐ 22

The fastest weighted auto-completion trie known to...

A full rewrite of the DBreeze project

Deepspeech Spanish Model ⭐ 22

[No longer maintained] M-AILABS Spanish Corpus / Tensorflow / DeepSpeech.

快写完了....支持泛型的数据结构库(vec, linkedlist, skiplist, hashtable, btree, avltree, rbtree, trie, set

C++ implementation of Radix tree

Trie implementation based on a minimal automaton for Go

A JavaScript Double Array Trie

Route Trie ⭐ 21

A minimal and powerful trie based url path router for JavaScript.

Leetcode ⭐ 21

LeetCode-Algorithms-DataStructure(write LeetCode with Python3)

Yada is a yet another double-array trie library aiming for fast search and compact data representation.

Rust Trie ⭐ 21

Rust implementation of a Trie with generics

🔲 Trie data structure implementation

⚡ Lightning fast URL routing in Python (trie router)

Golang radix tree implementation

This is Data Structure and Algorithm - Notes and Codes Repo

Trie_filter ⭐ 20

搬自php-ext-trie-filter-master这个项目，我将其改造成了php7适用版

Roman Klyujkov's Practical Algorithm Template library

Merkletrie ⭐ 20

A merkel tree on the hard drive for a blockchain, written in erlang.

A golang implement of Double Array Trie

Autosuggest Trie ⭐ 20

Minimalistic trie implementation for autosuggest and autocomplete components

🔑 A high performance Key/Value store written in Go with a predictable read/write performance and high throughput. Uses a Bitcask on-disk layout (LSM+WAL) similar to Riak.

Prefixtree ⭐ 20

A prefix tree (trie) implementation in go

Bytestring Trie ⭐ 19

An efficient finite map from (byte)strings to values.

Hihocode ⭐ 19

🖥️ Hihocode 经典算法问题

KLAY - Korean Language AnalYzer (한국어 형태소 분석기)

Merkle_patricia_tree ⭐ 19

Elixir implementation of modified Merkle Patricia tree (trie)

A prefix tree implementation in go

Search Commons ⭐ 19

some search common utils, such as segment，canal client and so on

Double-Ended Vectors for Clojure

Advutils ⭐ 19

Advanced Utility Libs

Containers ⭐ 19

A library of binary tree data structures (bstree, dstree, trie, crit-bit, PATRICIA) implemented in C

🦞 Rust library of natural language dictionaries using character-wise double-array tries.

Python Chartrie ⭐ 19

Pure C character trie implementation, wrapped into python extension

Cppjieba_rb ⭐ 18

List of all React hooks using data structures and algorithms

Related Searches

Java Trie (239)

201-300 of 628 search results

Privacy | About | Terms | Follow Us On Twitter

Copyright 2018-2024 Awesome Open Source. All rights reserved.