Built something? We create video reels & spotlights for GitHub projects.Promote your project →
Home / Developers / ned14
Developer Profile

ned14

Discovered public repositories for ned14 in the GitHub catalog.

↗

ned14/llfio

P1031 low level file i/o and filesystem library for the C++ standard

↗

ned14/type_index

Runtime/Compile time copyable type info. Library is waiting for boost reiew.

↗

ned14/FastDirectoryEnumerator

Enumerates very, very large directories quickly by directly using kernel syscalls. For POSIX and Windows. WARNING THIS IS OBSOLETE. USE BOOST.AFIO INSTEAD.

↗

ned14/BEXML

Provides fast, lazy, RESTful fastcgi access to various issue (bug) trackers. Compilable into a fast binary with IronPython and PyPy for even faster access.

↗

ned14/automodinit

Solves the problem of forgetting to keep __init__.py files up to date

↗

ned14/github-services

Official GitHub Services Integration - You can set these up in your repo admin screen under Service Hooks

↗

ned14/BEurtle

TortoiseXXX plugin for the Bugs Everywhere distributed issue tracker

↗

ned14/LiveXMLCV

An Interactive Live XML based Curriculum Vitae with XHTML output

↗

ned14/Easyshop

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

↗

ned14/uthash

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.

↗

ned14/nedmalloc

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.

↗

ned14/nedtries

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.

FOR MAINTAINERS

Built something? Put it in front of millions of developers.

We make a short reel about your project and post it across YouTube, Instagram, Threads, and X. Send a link, we do the rest.