Lib.rs

› Data structures › FQDN
#domain-name #trie

fqdn-trie

FQDN (Fully Qualified Domain Name) lookup structures (based on tries)

by Christophe Dousson

4 releases

0.4.3 Sep 27, 2024
0.4.2 Sep 18, 2023
0.4.1 Aug 8, 2023
0.3.0 Aug 6, 2023
0.1.0 Jul 12, 2022

#1330 in Data structures

Download history 10/week @ 2024-08-19 161/week @ 2024-09-23 41/week @ 2024-09-30 4/week @ 2024-10-07 9/week @ 2024-10-14 8/week @ 2024-10-21 12/week @ 2024-10-28 47/week @ 2024-11-04

76 downloads per month

MIT license

57KB
1K SLoC

fqdn-trie

Crates.io Crates.io License Docs

This crate provides two data structures based on FQDN tries in order to provide very fast lookup in the FQDN hierarchy.

The trie implementation is optimized to FQDN context and follows these rules:

  • the search algorithm finds the longuest domain suffix
  • the algorithm is case-insensitive
  • the internal structure exploits the range of allowed characters in FQDN

lib.rs:

This crate provides two data structures based on FQDN tries in order to provide very fast lookup in the FQDN hierarchy.

The trie implementation is optimized to FQDN context and follows these rules:

  • the search algorithm finds the longuest domain suffix
  • the algorithm is case-insensitive
  • the internal structure exploits the range of allowed characters in FQDN

Dependencies