autosuggest-trie - Minimalistic trie implementation for autosuggest and autocomplete components

  •        2

Minimalistic trie implementation for autosuggest and autocomplete components. Creates a trie containing the given items.

https://github.com/moroshko/autosuggest-trie

Tags
Implementation
License
Platform

   




Related Projects

react-autosuggest - WAI-ARIA compliant React autosuggest component

  •    Javascript

Check out the Homepage and the Codepen examples. Array of suggestions to display. The only requirement is that suggestions is an array. Items in this array can take an arbitrary shape.

react-bootstrap-typeahead - React typeahead with Bootstrap styling

  •    Javascript

A React-based typeahead that relies on Bootstrap for styling and was originally inspired by Twitter's typeahead.js. It supports both single- and multi-selection and is compliant with WAI-ARIA authoring practices. Try the live examples. Please note that documentation and examples apply to the most recent release and may no longer be applicable if you're using an outdated version.

hat-trie - C++ implementation of a fast and memory efficient HAT-trie

  •    C++

Trie implementation based on the "HAT-trie: A Cache-conscious Trie-based Data Structure for Strings." (Askitis Nikolas and Sinha Ranjan, 2007) paper. For now, only the pure HAT-trie has been implemented, the hybrid version may arrive later. Details regarding the HAT-trie data structure can be found here. The library provides an efficient and compact way to store a set or a map of strings by compressing the common prefixes. It also allows to search for keys that match a prefix. Note though that the default parameters of the structure are geared toward optimizing exact searches, if you do a lot of prefix searches you may want to reduce the burst threshold through the burst_threshold method.

ForestDB - A Fast Key-Value Storage Engine Based on Hierarchical B+-Tree Trie

  •    C++

ForestDB is a key-value storage engine developed by Couchbase Caching and Storage Team, and its main index structure is built from Hierarchical B+-Tree based Trie, called HB+-Trie. ForestDB paper has been published in IEEE Transactions on Computers.

marisa-trie

  •    C++

Static memory-efficient Trie-like structures for Python (2.x and 3.x). Uses marisa-trie C++ library.


trie - A super fast, efficiently stored Trie for Ruby. Uses libdatrie.

  •    C

A super fast, efficiently stored Trie for Ruby. Uses libdatrie.

php-ext-trie-filter - php extension for spam word filter based on Double-Array Trie tree, it can detect if a spam word exists in a text message

  •    C

php extension for spam word filter based on Double-Array Trie tree, it can detect if a spam word exists in a text message. PHP 5.2 or later.

mux - A high performance and powerful trie based url path router for Go.

  •    Go

A high performance and powerful trie based url path router for Go. This router supports fixed and regex rules in routing pattern, and matches request method. It's optimized by trie structure for faster matching and large scale rules.

wayfarer - :eyeglasses: composable trie based router

  •    Javascript

Composable trie based router. It's faster than traditional, linear, regular expression-matching routers, although insignficantly, and scales with the number of routes. If you're looking for a client-side router check out sheet-router. If you're looking for a server router check out server-router.

gse - Go efficient text segmentation; support english, chinese, japanese and other. Go 语言高性能分词

  •    Go

Go efficient text segmentation; support english, chinese, japanese and other. Dictionary with double array trie (Double-Array Trie) to achieve, Sender algorithm is the shortest path based on word frequency plus dynamic programming.

datrie - Super-fast, efficiently stored Trie for Python. Uses libdatrie.

  •    C

Super-fast, efficiently stored Trie for Python. Uses libdatrie.

Trie for C#

  •    

Implementing the Trie structer in C#/.Net

Capsule - The Capsule Hash Trie Collections Library

  •    Java

Capsule aims to become a full-fledged (immutable) collections library for Java 8+ that is solely built around persistent tries. The library is designed for standalone use and for being embedded in domain-specific languages. Capsule still has to undergo some incubation before it can ship as a well-rounded collection library. Nevertheless, the code is stable and performance is solid.

ac - Aho-Corasick Automaton with Double Array Trie (Multi-pattern substitute in go)

  •    Go

Aho-Corasick Automaton with Double Array Trie (Multi-pattern substitute in go)

AutoSuggest for MooTools

  •    Javascript

AutoSuggest for MooTools provides a simple AJAX JavaScript Auto-Suggest framework for use with MooTools 1.2+ What makes this framework different from the others is that it is built from the ground-up to work with key-value pairs, not just strings.

vue-instant - (UNMAINTAINED) vue instant allows you to easily create custom search controls with auto suggestions for your vue 2 applications

  •    Vue

vue instant allows you to easily create custom search controls with auto suggestions for your vue 2 applications. If you need a example using webpack see the example folder.

mafsa - Package mafsa implements Minimal Acyclic Finite State Automata in Go, essentially a high-speed, memory-efficient, Unicode-friendly set of strings

  •    Go

Package mafsa implements Minimal Acyclic Finite State Automata (MA-FSA) with Minimal Perfect Hashing (MPH). Basically, it's a set of strings that lets you test for membership, do spelling correction (fuzzy matching) and autocomplete, but with higher memory efficiency than a regular trie. With MPH, you can associate each entry in the tree with data from your own application.A BuildTree is used to build data from scratch. Once all the elements have been inserted, the BuildTree can be serialized into a byte slice or written to a file directly. It can then be decoded into a MinTree, which uses significantly less memory. MinTrees are read-only, but this greatly improves space efficiency.