static class LRUDictionary.BidirectionalLRUMap extends Object
Modifier and Type | Class and Description |
---|---|
private static class |
LRUDictionary.BidirectionalLRUMap.ByteArrayBackedNode |
private static class |
LRUDictionary.BidirectionalLRUMap.ByteBufferBackedNode |
private static class |
LRUDictionary.BidirectionalLRUMap.Node |
Modifier and Type | Field and Description |
---|---|
private int |
currSize |
private LRUDictionary.BidirectionalLRUMap.Node |
head |
private LRUDictionary.BidirectionalLRUMap.Node[] |
indexToNode |
private int |
initSize |
private HashMap<LRUDictionary.BidirectionalLRUMap.Node,Short> |
nodeToIndex |
private LRUDictionary.BidirectionalLRUMap.Node |
tail |
Constructor and Description |
---|
BidirectionalLRUMap(int initialSize) |
Modifier and Type | Method and Description |
---|---|
private void |
clear() |
private short |
findIdx(byte[] array,
int offset,
int length) |
private short |
findIdx(ByteBuffer buf,
int offset,
int length) |
private byte[] |
get(short idx) |
private void |
moveToHead(LRUDictionary.BidirectionalLRUMap.Node n) |
private short |
put(byte[] array,
int offset,
int length,
boolean copy) |
private short |
putInternal(byte[] stored) |
private void |
setHead(LRUDictionary.BidirectionalLRUMap.Node n) |
private int currSize
private LRUDictionary.BidirectionalLRUMap.Node head
private LRUDictionary.BidirectionalLRUMap.Node tail
private HashMap<LRUDictionary.BidirectionalLRUMap.Node,Short> nodeToIndex
private LRUDictionary.BidirectionalLRUMap.Node[] indexToNode
private int initSize
public BidirectionalLRUMap(int initialSize)
private short put(byte[] array, int offset, int length, boolean copy)
private short putInternal(byte[] stored)
private short findIdx(byte[] array, int offset, int length)
private short findIdx(ByteBuffer buf, int offset, int length)
private byte[] get(short idx)
private void moveToHead(LRUDictionary.BidirectionalLRUMap.Node n)
private void setHead(LRUDictionary.BidirectionalLRUMap.Node n)
private void clear()
Copyright © 2007–2019 The Apache Software Foundation. All rights reserved.