Showing 25 modules with matching packages. Search help

Package trie implements a simple trie tree for minio server/tools borrows idea from - https://godoc.org/golang.org/x/text/internal/triegen.

Imported by 9 | v2.0.17 published on Apr 15, 2024 | AGPL-3.0
Other major versions: v1
Imported by 25 | v0.0.0-...-5b9678d published on Oct 18, 2017 | MIT
Imported by 6 | v0.0.0-...-ea7a860 published on Oct 1, 2023 | MIT

Package xfast provides access to a sorted tree that treats integers as if they were words of m bits, where m can be 8, 16, 32, or 64.

Imported by 169 | v1.1.4 published on Apr 25, 2024 | Apache-2.0

Package radixtree implements an Adaptive Radix Tree, aka compressed trie or compact prefix tree.

Imported by 5 | v0.3.2 published on Feb 27, 2024 | MIT

Package trie contains radix tree implementation in golang (without any dependencies).

Imported by 4 | v1.0.0 published on Jun 2, 2023 | MIT

Package prefixtree implements a prefix tree (technically, a trie).

Imported by 4 | v0.3.0 published on Jun 27, 2023 | BSD-2-Clause

Package trie is an implementation of a trie (prefix tree) data structure over byte slices.

Imported by 3 | v1.0.0 published on Jan 26, 2019 | MIT
Imported by 2 | v2.0.0 published on Mar 12, 2023 | MIT
Other major versions: v1

Package trietree provides two trie-tree (prefix tree) implementations.

Imported by 2 | v1.0.0 published on Feb 15, 2024 | MIT
Other packages in module github.com/koron-go/trietree: trie

Package trie implements a simple trie tree for minio server/tools borrows idea from - https://godoc.org/golang.org/x/text/internal/triegen.

Imported by 2 | v1.0.3 published on Sep 14, 2023 | AGPL-3.0

* * A minimalistic, memory size-savvy and fairly fast radix tree (AKA Patricia trie) * implementation that uses IPv4 addresses with netmasks as keys and 32-bit signed * integers as values.

Imported by 4 | v0.11.2770-beta published on Oct 4, 2015 | MIT

Package trie implements a simple trie tree for minio server/tools borrows idea from - https://godoc.org/golang.org/x/text/internal/triegen.

Imported by 1 | v0.0.0-...-e9b145e published on Nov 5, 2021 | Apache-2.0

Package trie implements a simple trie tree for minio server/tools borrows idea from - https://godoc.org/golang.org/x/text/internal/triegen.

Imported by 1 | v0.0.0-...-6b3dfbf published on Jul 11, 2018 | Apache-2.0

The trie package implements a trie (prefix tree) data structure over byte slices.

Imported by 1 | v0.0.0-...-2fac99a published on Sep 25, 2012 | MIT

https://en.wikipedia.org/wiki/Ternary_search_tree In computer science, a ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary search tree, but with up to three children rather than the binary tree's limit of two.

Imported by 0 | v1.2.115 published on Feb 2, 2024 | MIT

Package trie implements trie tree (or prefix tree) data structure useful for things like prefix search/autocompletion.

Imported by 0 | v1.0.1 published on Aug 31, 2021 | MIT

Package implement_trie_prefix_tree https://leetcode-cn.com/problems/implement-trie-prefix-tree/

Imported by 0 | v0.0.0-...-a70e5fa published on Apr 27, 2022 | MIT

Package core provides essential abstractions for building a trie tree

Imported by 0 | v0.0.0-...-adfef49 published on Sep 26, 2022 | MIT
Other packages in module github.com/eng-gabrielscardoso/trie-tree:

Package trie implements Trie (suffix tree) data structure.

Imported by 0 | v0.0.0-...-ff2cc36 published on Jul 5, 2021 | MIT

Package trie implements a in-memory trie tree.

Imported by 0 | v1.0.0 published on Jan 16, 2023 | BSD-3-Clause

Package trie implements a simple trie tree for minio server/tools borrows idea from - https://godoc.org/golang.org/x/text/internal/triegen.

Imported by 0 | v0.0.0-...-2ecbb9b published on Apr 30, 2020 | Apache-2.0
Didn't find what you were looking for? Show more results.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL