Click here to Skip to main content
15,896,726 members
Articles / Programming Languages / C#

CPTrie: A sorted data structure for .NET

Rate me:
Please Sign up or sign in to vote.
4.98/5 (54 votes)
31 Mar 2010LGPL330 min read 66.6K   813   67  
A memory-efficient Patricia trie that implements IDictionary and supports the "find nearest key" operation.
CPTrie depends on some code of Loyc.Runtime.dll. In this folder is the source code for the relevant classes. If you wish to use CPTrie and remove the dependency on Loyc.Runtime.dll, include these source files in your project instead.

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

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


Written By
Software Developer None
Canada 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.

Comments and Discussions