Click here to Skip to main content
12,632,959 members (31,984 online)
Click here to Skip to main content
Alternatives
Add your own
alternative version

Stats

35.2K views
650 downloads
65 bookmarked
Posted

CPTrie: A sorted data structure for .NET

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

Alternatives

Members may post updates or alternatives to this current article in order to show different approaches or add new features.

No alternatives have been posted.

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 open-source LeMP preprocessor for C#, the LLLPG parser generator, and LES, the syntax tree interchange format, among other things.

In my spare time I work on the Language of your choice (Loyc) initiative, which is about investigating ways to improve interoperability between programming languages.

Pro
| | Privacy | Terms of Use | Mobile
Web01 | 2.8.161208.2 | Last Updated 31 Mar 2010
Article Copyright 2010 by Qwertie
Everything else Copyright © CodeProject, 1999-2016
Layout: fixed | fluid