Advertisement
Fast MD5 Implementation in Java
Fast MD5 Implementation in Java is a heavily optimized implementation of the MD5 hashing algorithm written in Java....
Bellagio OpenMAX IL Implementation
Bellagio is a sample implementation of OpenMAX IL for Linux....
OpenMAX library OpenMAX Implementation OpenMAX IL Bellagio OpenMAX
Suffix tree implementation library
Suffix tree implementation library is a C library, an implementation of the suffix trees algorithm to store/retrieve key/data pa...
Catalyst::Plugin::Geography::Implementation
Catalyst::Plugin::Geography::Implementation module uses Geography::Countries and IP::Country::Fast to return Geographical info....
hash.c
hash.c is a C hash table with quadratic probing....
Hash::NoVivify
Hash::NoVivify is a Perl extension for non-vivifying exists and defined functions....
Perl module non-vivifying exists defined functions non-vivifying exists
Set::Hash
Set::Hash is a Perl module with hashes as objects with lots of handy methods and support for method chaining....
Hash::Param
CGI/Catalyst::Request-like parameter-hash accessor/mutator...
Advertisement
Hash::Flatten
Flatten/unflatten complex data hashes...
Perl module hash unflatten hash data flatten hash data flatten
Hash::Merge
Hash::Merge Perl module merges arbitrarily deep hashes into a single hash....
Hash::WithDefaults
A class for hashes with key-casing requirements supporting defaults...
drs-hash
drs-hash is a set of C-callable hash routines that can be fast, a bit memory inefficient, strongly typed, and static, or slower....
Hash::Case
Hash::Case is a base class for hashes with key-casing requirements....
Perl module hashes key-casing requirements class hashes key-casing
Hash::Type
Hash::Type module contains pseudo-hashes as arrays tied to a "type" (list of fields)....
Hash::NoRef
Hash::NoRef is a HASH that store values without increase the reference count (weak references)....