Click here to Skip to main content
13,252,183 members (56,549 online)
Click here to Skip to main content

Stats

40.1K views
687 downloads
65 bookmarked
Posted 24 Feb 2010

CPTrie: A sorted data structure for .NET

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

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)

Share

About the Author

Qwertie
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.

You may also be interested in...

Pro
Pro
Permalink | Advertise | Privacy | Terms of Use | Mobile
Web04 | 2.8.171114.1 | Last Updated 31 Mar 2010
Article Copyright 2010 by Qwertie
Everything else Copyright © CodeProject, 1999-2017
Layout: fixed | fluid