Skip to content
Mar 25, 2010
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.
An EXTREMELY FAST portable thread caching malloc implementation written in C for multiple threads without lock contention based on dlmalloc. Optimised for x86 and x64. Compatible with C++. Can patch itself into existing binaries on Windows.
A GIT clone of uthash.sourceforge.net, a hash table, implemented in C, supporting constant-time add/find/remove of C structures. Any structure having a unique, arbitrarily-typed key member can be hashed by adding a UT_hash_handle member to the structure and calling these macros.
An E-Commerce solution for Plone supporting a shopping basket, stock quantities, differing delivery and taxation rules based on criteria, product variants and Paypal payment processing
TortoiseXXX plugin for the Bugs Everywhere distributed issue tracker
Repositories contributed to
Proposed GSoC 2013 async file i/o library for Boost
Conversion to Git for Boost
Summary of Pull Requests, issues opened and commits.
Mar 16 2013 - Mar 16 2014
Year of Contributions
August 31 - September 03
Rock - Hard Place
ned14 has no activity during this period.
Something went wrong with that request. Please try again.