| Name | Modified | Size | Downloads / Week |
|---|---|---|---|
| performance | 2012-05-07 | ||
| old version | 2012-05-05 | ||
| NitroCache.zip | 2012-05-06 | 35.4 kB | |
| ReadMe.txt | 2012-05-05 | 1.6 kB | |
| nitroCache-test-src.zip | 2012-04-27 | 30.1 kB | |
| Totals: 5 Items | 67.2 kB | 0 |
ReadMe
======
NitroCache is a 100% pure java in-memory cache. It is designed with an aim to provide high throughput, extremely fast and scalable cache api. It uses concepts of B-tree, Hashing and Skiplist to optimize performance. Result is, its one of the fastest in-memory cache in java providing constant time fetches.
Features
=========
+ Extremely fast, fetch operations execute at constant time, O(c), irrespective of number of threads or cache size
+ 100% Pure Java, in-memory
+ Extremely light weight, with no need of any external library
+ Simple to configure and use
+ Available with FIFO and LRU modes
Sample Usage
=============
NitroCache<String,String> _cache = null;
_cache = NitroCache.getInstance(5000, CacheEviction.FIFO);
_cache.put("1000","hello world");
System.out.println(_cache.get("1000");
Note
======
+ NitroCache uses hashCode() and equals() methods internally for storing and retrieving data. Hence its necessary for Key to have proper hashCode and equals implementation.
+ Implements java.util.Map, corresponding operations are now supported
+ FIFO setting is slightly faster then LRU setting
+ NitroCache is completely thread-safe and meant for use in multi-threaded system
System Requirement
==================
jre1.6 or above
Contact
=======
If you have problems, questions, ideas or suggestions, please contact us
by posting to a suitable message in sourceforge forum
Release .4Beta
==============
+ Improvements to LRU algorithm. Now speed is comparable to FIFO setting