Projects

Trove for Java

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

blist

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 * >>> ... [More] x = blist([0]) # x is a BList with one element >>> x *= 2**29 # x is a BList with > 500 million elements >>> x.append(5) # append to x >>> y = x[4:-234234] # Take a 500 million element slice from x >>> del x[3:1024] # Delete a few thousand elements from x [Less]

StructureGraphic

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 ... [More] on how "nice" is the structure) using either reflection or interfaces. Parsing of certain text formats is also supported. Currently, only data structures which can be represented as directed-tree graphs are supported. Support for Direct-Acyclic-Graphs (DAGs) and general Graphs is on the way! You can find an official manual in the downloads page! This library is being written in Java to learn how to view and edit data. It will hopefully serve as a base for a node editor for GEGL. [Less]

queXML

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.

radixtree

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 ... [More] strings of characters, bit strings such as integers or IP addresses, or generally arbitrary sequences of objects in lexicographical order. Sometimes the names radix tree and crit bit tree are only applied to trees storing integers and Patricia trie is retained for more general inputs, but the structure works the same way in all cases. For more information see http://en.wikipedia.org/wiki/Radix_tree I have created this Radix tree for a project that required fast searching of user name prefixes for a Google AJAX Search like interface. Radix Tree gives fastest possible ways to search prefixes. For example it can quickly answer queries like "Find all user name starting with 'tahseen'" The database solution for this problem boils down to queries like select * from user where username like 'tahseen%' Database solution does not scale very well if you have a large number of concurrent users searching. A memory based Radix Tree scale very well. Update: (1st Sept 2009) A new method added that would complete a given string to the point where the ambiguity starts. (Contribution by kaljurand (http://code.google.com/u/kaljurand/)) Update: (23rd June 2009) Dennis Heidsiek improvements has been merged with trunk. Update: Javid Jamae (http://www.javidjamae.com/) has provided an excellent implementation of Radix tree in javascript. Go ahead and download it! [Less]

irON Notation Parsers

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 ... [More] instance records (including in bulk), linkages to existing ontologies and schema, and schema definitions [Less]

mikeralib

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 ... [More] modules for game development: - Non-blocking IO library for simple game messaging Helpful utility functions: - Maths functions including fast vector / matrix maths - Random number functions [Less]

cache-table

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 ... [More] collision' the older item is 'discarded' and replaced with the new one. This container is ideal for implementing caching system, when you want super fast item insertion and retrieval and you know 'a priori' the memory amount you want to dedicate. It is also possible to use it in conjunction to a 2nd level cache, passing discarded item to a slower and bigger container. The interfaces of the containers are compatible with STL, and to get a glimpse you can check out the examples provided. Released CacheTable 0.2Fixed a bug with deletion of iterator range More complete documentation [Less]

bpt eXtension

bptx is an extension of the bpt macro-based toolkit which provides an abstraction for manipulating bpt in common environments such as in main memory.

bpt

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