Awesome Open Source

Programming Languages

Search results for golang trie

46 search results found

Go Datastructures ⭐ 7,165

A collection of useful, performant, and threadsafe Go datastructures.

Go Ethereum Code Analysis ⭐ 2,476

Go efficient multilingual NLP and text segmentation; support English, Chinese, Japanese and others.

Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).

Cidranger ⭐ 737

Fast IP to CIDR lookup in Golang

Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.

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

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

Gorouter ⭐ 480

xujiajun/gorouter is a simple and fast HTTP router for Go. It is easy to build RESTful APIs and your web framework.

Data Structures ⭐ 377

Go datastructures.

Fast, zero heap allocation Go Trie for runes or paths

Sensitive ⭐ 355

敏感词查找,验证,过滤和替换 🤓 FindAll, Validate, Filter and Replace words.

Go Ethereum Code Analysis ⭐ 355

English version

Muxie is a modern, fast and light HTTP multiplexer for Go. Fully compatible with the http.Handler interface. Written for everyone.

Go Adaptive Radix Tree ⭐ 261

Adaptive Radix Trees implemented in Go

Go Patricia ⭐ 259

A generic patricia trie (also called radix tree) implemented in Go (Golang)

Patricia ⭐ 237

Garbage collector-sensitive patricia tree for IP/CIDR tagging

⚡️ A lightning fast HTTP router

Suggestion ⭐ 151

搜索输入框-下拉提示(推荐), 提示词根据权重排序.基于double-array-trie的darts, golang语言实现.

Ahocorasick ⭐ 141

A faster and more efficient Golang implement of Aho-Corasick algorithm using Double Array Trie

Merkle Patricia Trie ⭐ 139

A simplified golang implementation of Ethereum's Modified Patricia Trie.

Go Urlrouter ⭐ 116

Efficient URL routing using a Trie data structure.

Ahocorasick ⭐ 110

A fast and memory efficient implementation of aho-corasick algorithm based on double-array trie (cedar), supports visualizing structure via graphviz.

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

Algorithms ⭐ 96

An implementation in GO (golang) of the basic algorithms and data structure.

Cedar Go ⭐ 96

A go implemention of efficiently-updatable double-array trie

Go Darts ⭐ 88

Double-ARray Trie System for golang

Golang Keyword extraction/replacement Datastructure using Tries instead of regexes

Studyalgorithm ⭐ 76

用Go 语言实现基础算法

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

A golang http router based on trie tree.

A Trie (Prefix Index) implementation in golang.

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

Node.js globbing for amqp-like topics

Simple and high-performance data structures and algorithms library

Go Erasure ⭐ 40

Erasure coding (Reed–Solomon coding) in Go

Phonegeocode ⭐ 33

Phone number geocoding library for Go (#golang)

Solvedchallenges ⭐ 33

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

A go implemention of efficiently-updatable double-array trie

Go Succinct Data Structure Trie ⭐ 31

Succinct Data Structure of Trie, written in Go

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

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.

A simple Golang implementation of Aho-Corasick algorithm.

Trie Mux ⭐ 22

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

The fast and flexible Trie Tree implementation in Go.

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

Trie implementation based on a minimal automaton for Go

Golang radix tree implementation

Prefixtree ⭐ 20

A prefix tree (trie) implementation in go

A golang implement of Double Array Trie

🔑 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.

A prefix tree implementation in go

Radixtree ⭐ 18

adaptive radix tree (a.k.a prefix tree or compact trie)

Golang implementation of 51Degrees/Device-Detection based on trie

Aho Corasick ⭐ 16

Aho-Corasick string-searching algorithm in Go

Levenshtein ⭐ 16

sparse levenshtein automaton in go

Storage Proofs Eth Go ⭐ 15

Golang library and utility for extracting erc20 token balances from EVM storage proofs

Flashtrie.go ⭐ 14

Flash Trie: Beyond 100-Gb/s IP Route Lookup Using Hash-Based Prefix-Compressed Trie

Efficient generic radix tree (trie) implementation in go

Lifelong Learner ⭐ 13

An app with Trie tree and Breve search Implementation CLI and HTTP both 🥳

Container ⭐ 13

golang实现常用集合

Common case conversions covering common initialisms.

Go Ethereum Code Analysis ⭐ 11

以太坊源码分析（go语言）

Servemux ⭐ 10

An efficient, API-compatible extension of http.ServeMux

Levenshteintrie ⭐ 10

A Trie data structure that allows for fuzzy string matching

micro web framework for go that uses a trie to handle route matching

A Go library that implements a Sparse Merkle Trie for a key-value map.

Generic prefix tree for golang

Go Autocomplete Trie ⭐ 10

go-autocomplete-trie is a data structure for text auto completion that allows for fuzzy matching and configurable levenshtein distance limits

Trie data structure implementation in Golang 🌳

A Trie structure implementation for Go, using Unicode runes as keys. Includes a customization for TeX-style hyphenation tries.

A simple radix tree implement by Golang

Multi-String Pattern Matching Algorithm Using TrieHashNode

Algorithms and Data Structure For Go Applications

A trie-tree string-matching in golang, fatster than trie 2 regex.

Go Datastructures ⭐ 9

This Project aims to port/build well known and commonly used data structures to GO.

A prefix sorting radix tree designed specifically for working with words, providing fuzzy search functionality, prefix filtering for autocomplete

🏃 🏃 🏃Somewhat fast, somewhat optimal Prefix Search in Go

Go Word Filter ⭐ 8

基于trie树的敏感词，脏词过滤服务，支持grpc调用

A primitive implementation of the Trie data structure in Golang.

Go Segment ⭐ 8

基于 sego 分词提供分词 HTTP RPC

Proofable ⭐ 8

General purpose proving framework for certifying digital assets to public blockchains

Go PATRICIA tree implementation

Sensitive_word_filter ⭐ 7

dirty or sensitive word filter via trie tree in golang（基于datrie库的GO敏感词过滤）

Go Libp2p Xor ⭐ 7

Xor Trie implementation

A pure Go trie (prefix tree) implementation.

A Go library for a succinct trie (not stable yet)

Missing Trie implementation for Go

Go Hamt Functional ⭐ 6

A Go Library for a functional (ie. persistent and immutable) Hash Array Mapped Trie (HAMT)

hairetsu is a TRIE implementation by double array.

WebAssembly efficient text segmentation; support english, chinese, japanese and other. WebAssembly 高性能分词

data struct using go

Dartsclone ⭐ 5

Double Array TRIE liblary

Oak is a trie-based data structure designed for mapping nested strings to disparate interface values.

A lightweight and fast HTTP router for Go.

Basic data structures and operations written in Go, such as trie, bloom filter union&find etc.

Related Searches

Golang Command Line (8,308)

Golang Docker (7,769)

Golang Server (4,309)

Golang Http (4,221)

Javascript Golang (3,372)

Golang Database (2,927)

Golang Json (2,652)

Golang Proxy (2,577)

Golang Grpc (2,432)

Python Golang (2,332)

1-46 of 46 search results

Privacy | About | Terms | Follow Us On Twitter

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