Click here to Skip to main content
12,406,124 members (69,997 online)
Click here to Skip to main content


65 bookmarked

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.



Compare Revision Minor Date Status Editor
12 - publicly available No 11-Jun-10 15:28 Available Smitha Nishant
11 No 31-Mar-10 14:24 Composing Qwertie
10 No 31-Mar-10 13:59 Composing Qwertie
9 No 30-Mar-10 20:37 Composing Qwertie
8 No 30-Mar-10 20:23 Composing Qwertie
7 No 26-Feb-10 14:42 Composing Qwertie
6 No 26-Feb-10 14:16 Composing Qwertie
5 No 26-Feb-10 12:28 Composing Qwertie
4 No 25-Feb-10 20:59 Composing Qwertie
3 No 25-Feb-10 15:33 Composing Qwertie
2 No 25-Feb-10 13:46 Composing Qwertie
1 No 25-Feb-10 12:37 Composing Qwertie


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


About the Author

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.160726.1 | Last Updated 31 Mar 2010
Article Copyright 2010 by Qwertie
Everything else Copyright © CodeProject, 1999-2016
Layout: fixed | fluid