7 stable releases

1.3.0 Sep 16, 2024
1.2.4 Nov 9, 2024
1.2.3 Oct 14, 2024
1.2.2 Sep 16, 2024
0.1.2 Mar 21, 2023

#534 in Data structures

Download history 1/week @ 2024-08-30 19/week @ 2024-09-06 667/week @ 2024-09-13 166/week @ 2024-09-20 129/week @ 2024-09-27 19/week @ 2024-10-04 169/week @ 2024-10-11 35/week @ 2024-10-18 9/week @ 2024-10-25 44/week @ 2024-11-01 155/week @ 2024-11-08 51/week @ 2024-11-15 19/week @ 2024-11-22 13/week @ 2024-11-29 9/week @ 2024-12-06

94 downloads per month

MIT license

175KB
4K SLoC

tetengo Trie 1.2.4

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-2024 kaoru https://www.tetengo.org/

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

Dependencies

~4–13MB
~155K SLoC