Trie implementation

c++ c data-structures trie
Anton Kazennikov picture Anton Kazennikov · Jun 24, 2009 · Viewed 40.9k times · Source

Is there any speed- and cache-efficient implementations of trie in C/C++? I know what a trie is, but I don't want reinvent the wheel, implementing it myself.

Answer

SashaN picture SashaN · Jun 24, 2009

if you are looking for an ANSI C implementation you can "steal" it from FreeBSD. The file you are looking for is called radix.c. It's used for managing routing data in kernel.

Related questions

Visual C++ equivalent of GCC's __attribute__ ((__packed__))

For some compilers, there is a packing specifier for structs, for example :: RealView ARM compiler has "__packed" Gnu C Compiler has "__attribute__ ((__packed__))" Visual C++ has no equivalent, it only has the "#pragma pack(1)" I need something that I can …

Read More
Looking for a disk-based B+ tree implementation in C++ or C

I am looking for a lightweight open source paging B+ tree implementation that uses a disk file for storing the tree. So far I have found only memory-based implementations, or something that has dependency on QT (?!) and does not even …

Read More
error: pointer to incomplete class type is not allowed

I am stumped at this step while implementing a ternary tree: #include<stdio.h> #include<string.h> #include<stdlib.h> typedef struct tnode *Tptr; typedef struct node { char splitchar; Tptr lokid,eqkid,hikid; }Tnode; …

Read More