Click here to Skip to main content
12,297,454 members (60,535 online)
Click here to Skip to main content

Stats

33.1K views
636 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.

Views

Downloads

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, LLLPG, and LES: XML for code, among other things. Now I'm old.

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, and includes Enhanced C# and LeMP, its Lexical Macro Processor.

You may also be interested in...

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