Implementation of an R-Way Trie data structure.
Package trie implements a simple trie.
Implementation of an R-Way Trie data structure.
Package cedar implements double-array trie.
Package clevergo is a trie based high performance HTTP request router.
Package httprouter is a trie based high performance HTTP request router.
Package trie contains radix tree implementation in golang (without any dependencies).
Package httprouter is a trie based high performance HTTP request router. A trivial example is: The router matches incoming requests by the request method and the path. If a handle is registered for this path and method, the router delegates the request to that function. For the methods GET, POST, PUT, PATCH and DELETE shortcut functions exist to register handles, for all other methods router.Handle can be used. The registered path, against which the router matches incoming requests, can contain two types of parameters: Named parameters are dynamic path segments. They match anything until the next '/' or the path end: Catch-all parameters match anything until the path end, including the directory index (the '/' before the catch-all). Since they match anything until the end, catch-all parameters must always be the final path element. The value of parameters is saved as a slice of the Param struct, consisting each of a key and a value. The slice is passed to the Handle func as a third parameter. There are two ways to retrieve the value of a parameter:
Package amt provides a reference implementation of the IPLD AMT (Array Mapped Trie) used in the Filecoin blockchain.
Package amt provides a reference implementation of the IPLD AMT (Array Mapped Trie) used in the Filecoin blockchain.
The trie package implements a trie (prefix tree) data structure over byte slices.
Package trie provides a data structure for autocompletion searching of strings.