Project Description

• Write Howto Install
• Write Howto Use

A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.

Download

Windows nedtries-v1.02_final.zip (Date: 2012-07-09, Size: 8.2 MB)

Mac nedtries-v1.02_final.zip (Date: 2012-07-09, Size: 8.2 MB)

Linux nedtries-v1.02_final.zip (Date: 2012-07-09, Size: 8.2 MB)

BSD nedtries-v1.02_final.zip (Date: 2012-07-09, Size: 8.2 MB)

Solaris nedtries-v1.02_final.zip (Date: 2012-07-09, Size: 8.2 MB)

• Latest Files
  • nedtries-v1.02_final.zip (Date: 2012-07-09, Size: 8.2 MB)
  • nedtries-v1.01_rc1.zip (Date: 2011-06-19, Size: 7.3 MB)
  • nedtries_v1.00_beta1a.zip (Date: 2010-06-18, Size: 6.2 MB)

Download File List

Review

Your rating

Review this project

×

Your rating for nedtries

Your rationg?

Add an Optional comment

Submit Delete Cancel

Project Informations

Software Map

Related Projects

Programming Language ADP

Average

4.7

Reviews

AJD4JP 日本専用カレンダー処理 Javaクラスライブラリ

Average

4.0

Reviews

doar

Average

0.0

Reviews

Media Player Classic - Home Cinema

Average

4.6

Reviews

mpaligner

Average

0.0

Reviews

Search Keywords