Click here to Skip to main content
Click here to Skip to main content
Add your own
alternative version

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.

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 Trapeze Software, Inc.
Canada Canada
Since I started programming when I was 11, I wrote the SNES emulator "SNEqr", the FastNav mapping component, and LLLPG, among other things. Now I'm old.
 
In my spare time I'm developing a system called Loyc (Language of your choice), which will include an enhanced C# compiler. Many programs have an add-in architecture; why not your programming language? I'm also looking for a life partner. Oh hi future wife! Wazzap.

| Advertise | Privacy | Mobile
Web03 | 2.8.141022.1 | Last Updated 31 Mar 2010
Article Copyright 2010 by Qwertie
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid