Tags : Browse Projects

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

Showing page 1 of 7
Filter by Related Tags:

Trove for Java

Compare

  Analyzed about 9 hours ago

The Trove library provides high speed regular and primitive collections for Java.

45.3K lines of code

3 current contributors

26 days since last commit

6 users on Ohloh

Very Low Activity
4.66667
   

blist

Compare

  Analyzed 2 days ago

The BList is a type that looks, acts, and quacks like a Python list, but has better performance for for modifying large lists. For small lists (fewer than 128 elements), BLists and the built-in list have very similar performance. Example usage: >>> from blist import * >>> x = blist([0]) # x is a BList with one ele... [More]

13.6K lines of code

6 current contributors

About 1 month since last commit

2 users on Ohloh

Low Activity
5.0
 

radixtree

Compare

  Analyzed 3 days ago

A radix tree, Patricia trie/tree, or crit bit tree is a specialized set data structure based on the trie that is used to store a set of strings. In contrast with a regular trie, the edges of a Patricia trie are labelled with sequences of characters rather than with single characters. These can be strings of characters, bit strings such... [More]

3.61K lines of code

0 current contributors

Over 4 years since last commit

2 users on Ohloh

Inactive
0
 

irON Notation Parsers

Compare

  Analyzed about 8 hours ago

irON (instance record and Object Notation) is a abstract notation for specifying RDF triples and schema in non-RDF forms. The notation supports writing RDF and schema in JSON (irJSON), XML (irXML) and comma-delimited (CSV) formats (commON). The notation specification includes guidance for creating instance records (including in bulk), ... [More]

2.68K lines of code

0 current contributors

About 1 year since last commit

1 users on Ohloh

Very Low Activity
5.0
 

mikeralib

Compare

  Analyzed 1 day ago

Handy Java functions that people may find useful for their open source projects. Data structures: - Probability based object picker with fast O(log n) inserts and gets - Generic circular buffer - Soft reference HashMap for caching objects - "Octreap" 3d map data structure Useful modules for game development: - Non-blocking IO libra... [More]

43.5K lines of code

1 current contributors

4 months since last commit

1 users on Ohloh

Very Low Activity
5.0
 

concurrentlinkedhashmap

Compare

  Analyzed about 6 hours 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. Original AlgorithmThe Sept. 2008 jar cont... [More]

9.62K lines of code

0 current contributors

Over 1 year since last commit

1 users on Ohloh

Very Low Activity
0
 

cache-table

Compare

  Analyzed about 6 hours ago

CacheTable is a C++ template library that implements a very fast hash map container. Its particularity, compared with std::hash_map and google::sparse_hash_map it's that it has a fixed size (you decide it when you create it) and a random item replacement policy: in case of an 'hash collision' the older item is 'discarded' and replac... [More]

1.36K lines of code

0 current contributors

About 7 years since last commit

1 users on Ohloh

Inactive
0
 

queXML

Compare

  Analyzed about 14 hours ago

queXML is a simple XML schema for designing questionnaires. Included are stylesheets to administer the questionnaire in PDF (paper), CASES and LimeSurvey. queXML is compatible with the DDI standard.

6.66K lines of code

0 current contributors

Almost 2 years since last commit

1 users on Ohloh

Very Low Activity
5.0
 
Licenses: No declared licenses

bpt

Compare

  Analyzed 3 days ago

The bpt.h header file is a macro-based toolkit which enables C programmers to easily manage fully tunable balanced trees.

8.07K lines of code

0 current contributors

Over 1 year since last commit

1 users on Ohloh

Very Low Activity
0
 

StructureGraphic

Compare

  Analyzed 2 days ago

A library written in java, to help visualize data structures. Mainly, but not only, for debugging purposes. Originaly, this started for helping the debugging of Red Black trees, and it evolved much since then. The library connects to existing data structures with minimal to no effort (depending on how "nice" is the structure) using ... [More]

1.29K lines of code

0 current contributors

Over 3 years since last commit

1 users on Ohloh

Inactive
0