Tags : Browse Projects

Select a tag to browse associated projects and drill deeper into the tag cloud.

M2Collections

Compare

  Analyzed 9 months ago

Modula-2 collections library. The library provides an API for collection ADTs, in particular: stacks, queues, double ended queues, priority queues, balanced binary search trees, patricia tries, dynamic arrays and hash tables to store arbitrary data. The hash table ADT allows data to be stored and ... [More] retrieved by reference or by copy, with built-in reference counting. All other ADTs allow data to be stored and retrieved by reference only. The library follows PIM4, it has no dependencies and it is platform independent. The library is tested with GM2 using option 'fpim4'. Under development. BSD style license. [Less]

1.74K lines of code

0 current contributors

over 2 years since last commit

5 users on Open Hub

Activity Not Available
5.0
 
I Use This

DocSharePoint

Compare

  Analyzed about 2 months ago

Open Source Peer To Peer application based on pastry

6.14K lines of code

0 current contributors

over 5 years since last commit

3 users on Open Hub

Activity Not Available
5.0
 
I Use This

jshashtable

Compare

  Analyzed about 1 year ago

A standalone implementation of hash table in JavaScript. It associates keys with values, and allows any object to be used as the key (unlike JavaScript's built-in Object, which only allows strings as property names). jshashtable requires no libraries and is designed to work in all ECMAScript 3 ... [More] compliant environments, including all major browsers. In particular, it has been tested and works in: Firefox (all versions, back to Phoenix 0.1) Internet Explorer 5+ Safari 3+ (untested in previous versions) Google Chrome (all versions) Opera 7+ See the jshashtable website for full documentation. HashSet implementation addedA new HashSet download is now available from today (28 March 2010). Full documentation will follow. Version 2.1 releasedVersion 2.1 is released today (21st March 2010). It is a minor bugfix release that fixes issue #1. Version 2.0 releasedVersion 2.0 is released today (30th December 2009). It features big performance improvements (typically 200% speed increase for put and get operations) and adds a few new methods: clone(), putAll(), entries() and each(). Also, the compressed JS file is slightly smaller than in version 1.0 at just under 4K. [Less]

16.8K lines of code

0 current contributors

about 4 years since last commit

2 users on Open Hub

Activity Not Available
4.0
   
I Use This

uthash

Compare

  Analyzed 4 days ago

This is 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.

9.36K lines of code

3 current contributors

about 1 month since last commit

2 users on Open Hub

Low Activity
0.0
 
I Use This
Licenses: No declared licenses

concurrentlinkedhashmap

Compare

  Analyzed about 1 year ago

A high performance version of java.util.LinkedHashMap for use as a software cache. DesignA concurrent linked list runs through a ConcurrentHashMap to provide eviction ordering. Supports insertion and access ordered eviction policies (FIFO, LRU, and Second Chance). StatusTesting new algorithm. ... [More] Original AlgorithmThe Sept. 2008 jar contains the initial version, which uses a concurrent deque that runs through a ConcurrentHashMap. For simplicity, the implementation used a lazy removal strategy to allow focusing on validating the doubly linked list. A backtracking eager removal strategy was initially prototyped, but not adopted due to concerns over management of the data races. According to Greg's benchmarks, he found up to a 92.5x performance gain when compared to the previous version of Ehcache (v1.5). Note: A rare race condition was uncovered by Greg Luck (Ehcache). This algorithm is deprecated. Current AlgorithmThe design document describes a newer approach based on per-node spin-locks. Note: The algorithm needs further testing and is not deemed production ready. It is functional under concurrent tests, but needs additional load testing to assert correctness. Production VersionDue to popular demand and accidental usages in production environments, a certified production-ready version is provided for download. This version is will provide the desired performance without using experimental code intended for personal education. The modifications are documented outside of the repository. FutureAfter the current algorithm is released, work will begin towards maturing it into a lock-free algorithm. A lock-free algorithm is non-blocking, maintains the list in an acceptable but not always perfect state, and coerces to the desired state. This changes the thought process of trying to block concurrent operations from corrupting shared state to making them work together to arrive at a final state. LicenseThe algorithms and code are provided as-is under the APL-2. They were built primarily for fun and as a hobby project. The main motivation was that the puzzle of how to implement a concurrent linked hashmap sounded quite enjoyable (and educational). To figure it out for myself, I avoided venturing into certain academic literature. While this may make progress slower, it allows me to understand the algorithms rather than copying them. That said, others are free to use this structure as a template and make the necessary changes to implement one of those algorithms. [Less]

9.62K lines of code

0 current contributors

almost 5 years since last commit

2 users on Open Hub

Activity Not Available
0.0
 
I Use This

KVSlib

Compare

  Analyzed 11 months ago

C library for key-value storage. The library provides an API to create and use dynamic associative arrays for arbitrary data. Data may be stored and retrieved by copy or by reference. Stored data is reference counted to prevent dangling pointers. Optimised for fast lookups and large data sets. ... [More] Requires C99, no dependencies, platform independent. BSD style license. [Less]

706 lines of code

0 current contributors

over 7 years since last commit

1 users on Open Hub

Activity Not Available
5.0
 
I Use This

coelacanth-lib

Compare

  Analyzed about 1 year ago

Coelacanth is a C generic programming library

2.03K lines of code

0 current contributors

over 7 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

python-pastry

Compare

  Analyzed about 1 year ago

python-pastry is pure python implementation of Distributed Hash Table PASTRY overlay and routing network. Check http://en.wikipedia.org/wiki/Pastry_(DHT) for more info.

0 lines of code

0 current contributors

over 8 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: MIT

ding-libs

Compare

  Analyzed 6 months ago

DING-LIBS (DING Is Not Glib) are a set of small, useful libraries that SSSD uses and makes available to other projects. They provide: * dhash - A dynamic hash table * ini_config - A library for parsing and managing INI files * path_utils - Manage UNIX paths and subsets of paths * collection - ... [More] A generic, hierarchical grouping mechanism for complex data sets * ref_array - A dynamically-growing, reference-counted array * libbasicobjects - A set of fundamental object types for C [Less]

31.9K lines of code

4 current contributors

10 months since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

qt_sparsehash

Compare

  Analyzed 3 days ago

A Qt wrapper for sparsehash

4.11K lines of code

0 current contributors

almost 2 years since last commit

1 users on Open Hub

Very Low Activity
0.0
 
I Use This