CPTrie: A sorted data structure for .NET

Qwertie

Rate me:

4.98/5 (54 votes)

31 Mar 2010LGPL330 min read

66.4K

813

A memory-efficient Patricia trie that implements IDictionary and supports the "find nearest key" operation.

Views

Daily Counts

Weekly Counts

This article, along with any associated source code and files, is licensed under The GNU Lesser General Public License (LGPLv3)

Written By

Qwertie

Software Developer None

Canada

Since I started programming when I was 11, I wrote the SNES emulator "SNEqr", the FastNav mapping component, the Enhanced C# programming language (in progress), the parser generator LLLPG, and LES, a syntax to help you start building programming languages, DSLs or build systems.

My overall focus is on the Language of your choice (Loyc) initiative, which is about investigating ways to improve interoperability between programming languages and putting more power in the hands of developers. I'm also seeking employment.