com.github.benmanes.caffeine.cache.simulator.admission.tinycache

Class TinySetIndexing

java.lang.Object

com.github.benmanes.caffeine.cache.simulator.admission.tinycache.TinySetIndexing

public final class TinySetIndexing
extends Object

An implementation of TinySet's indexing method. A method to index a succinct hash table that is only 2 bits from theoretical lower bound. This is only the indexing technique and it helps calculate offsets in array using two indexes. chainIndex - (set bit for non empty chain/unset for empty) isLastIndex (set bit for last in chain/empty bit for not last in chain). Both indexes are assumed to be 64 bits, (longs) for efficiency and simplicity. The technique update the indexes upon addition/removal. Paper link: http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-get.cgi/2015/CS/CS-2015-03.pdf Presentation: http://www.cs.technion.ac.il/~gilga/UCLA_and_TCL.pptx

Method Summary

Modifier and Type	Method and Description
static int	addItem(com.github.benmanes.caffeine.cache.simulator.admission.tinycache.HashedItem fpaux, long[] chainIndex, long[] lastIndex)
static boolean	chainExist(long chainIndex, int chainId)
static int	getChain(com.github.benmanes.caffeine.cache.simulator.admission.tinycache.HashedItem fpaux, long[] chainIndex, long[] isLastIndex)
static int	getChainAtOffset(com.github.benmanes.caffeine.cache.simulator.admission.tinycache.HashedItem fpaux, long[] chainIndex, long[] isLastIndex, int offset)
static int	getChainStart(com.github.benmanes.caffeine.cache.simulator.admission.tinycache.HashedItem fpaux, long[] chainIndex, long[] isLastIndex)
static int	rank(long index, int bitNum)
static void	removeItem(com.github.benmanes.caffeine.cache.simulator.admission.tinycache.HashedItem fpaux, long[] chainIndex, long[] isLastIndex)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

getChainStart

public static int getChainStart(com.github.benmanes.caffeine.cache.simulator.admission.tinycache.HashedItem fpaux,
                                long[] chainIndex,
                                long[] isLastIndex)

rank

public static int rank(long index,
                       int bitNum)

getChain

public static int getChain(com.github.benmanes.caffeine.cache.simulator.admission.tinycache.HashedItem fpaux,
                           long[] chainIndex,
                           long[] isLastIndex)

getChainAtOffset

public static int getChainAtOffset(com.github.benmanes.caffeine.cache.simulator.admission.tinycache.HashedItem fpaux,
                                   long[] chainIndex,
                                   long[] isLastIndex,
                                   int offset)

chainExist

public static boolean chainExist(long chainIndex,
                                 int chainId)

addItem

public static int addItem(com.github.benmanes.caffeine.cache.simulator.admission.tinycache.HashedItem fpaux,
                          long[] chainIndex,
                          long[] lastIndex)

removeItem

public static void removeItem(com.github.benmanes.caffeine.cache.simulator.admission.tinycache.HashedItem fpaux,
                              long[] chainIndex,
                              long[] isLastIndex)