10 stable releases

new 1.3.2 Jan 5, 2025
1.3.0 Sep 16, 2024
1.2.5 Dec 22, 2024
1.1.0 Jul 28, 2024
0.1.2 Mar 21, 2023

#263 in Data structures

Download history 145/week @ 2024-09-21 134/week @ 2024-09-28 15/week @ 2024-10-05 176/week @ 2024-10-12 27/week @ 2024-10-19 19/week @ 2024-10-26 34/week @ 2024-11-02 158/week @ 2024-11-09 50/week @ 2024-11-16 17/week @ 2024-11-23 14/week @ 2024-11-30 34/week @ 2024-12-07 14/week @ 2024-12-14 126/week @ 2024-12-21 119/week @ 2024-12-28 153/week @ 2025-01-04

412 downloads per month

MIT license

175KB
4K SLoC

tetengo Trie 1.3.2

A trie library.

The trie is an associative data structure. Given a key, it returns the corresponding value in constant time.

It also supports prefix searches, allowing you to enumerate values with the same prefix.

The trie in this library is implemented using double arrays.

How to Use

Execute the cargo add command to add the "tetengo_trie" library to your cargo package.

An entry for "tetengo_trie" will be added to the "dependencies" section of Cargo.toml.

  • On Windows:
    • X:>cd \path\to\your\package
      X:>cargo add tetengo_trie
      
  • On Linux:
    • $ cd /path/to/your/package
      $ cargo add tetengo_trie
      

See the cargo document for details.

Source Files

The source files for this library are available on GitHub.


Copyright (C) 2023-2025 kaoru https://www.tetengo.org/

This product is released under the MIT license. See the LICENSE file for details.

Dependencies

~3–12MB
~153K SLoC