Tags : Browse Projects

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

Trove for Java

Compare

  Analyzed 12 months ago

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

45.2K lines of code

1 current contributors

over 2 years since last commit

8 users on Open Hub

Activity Not Available
4.66667
   
I Use This

blist

Compare

  Analyzed about 2 months 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 * >>> ... [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]

13.6K lines of code

0 current contributors

about 3 years since last commit

2 users on Open Hub

Activity Not Available
5.0
 
I Use This

radixtree

Compare

  Analyzed about 1 year 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 ... [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]

3.61K lines of code

0 current contributors

over 7 years since last commit

2 users on Open Hub

Activity Not Available
0.0
 
I Use This

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

over 4 years since last commit

2 users on Open Hub

Activity Not Available
0.0
 
I Use This

fastutil

Compare

  Analyzed about 2 months ago

fastutil extends the Java™ Collections Framework by providing type-specific maps, sets, lists and queues with a small memory footprint and fast access and insertion; provides also big (64-bit) arrays, sets and lists, and fast, practical I/O classes for binary and text files.

14.6K lines of code

1 current contributors

3 months since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

mikeralib

Compare

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

43.5K lines of code

0 current contributors

over 3 years since last commit

1 users on Open Hub

Activity Not Available
5.0
 
I Use This

cache-table

Compare

  Analyzed about 1 year 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 ... [More] 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]

1.36K lines of code

0 current contributors

over 10 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

queXML

Compare

  Analyzed about 2 months 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 5 years since last commit

1 users on Open Hub

Activity Not Available
5.0
 
I Use This
Licenses: No declared licenses

StructureGraphic

Compare

  Analyzed about 1 year 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 ... [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]

1.29K lines of code

0 current contributors

over 6 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

irON Notation Parsers

Compare

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

2.68K lines of code

0 current contributors

over 4 years since last commit

1 users on Open Hub

Activity Not Available
5.0
 
I Use This