/** * Returns the size of the list. * <p> * @return int */ private int dumpCacheSize() { return list.size(); }
/** * Return true if the size is <= 0; * <p> * @return true is size <= 0; */ public boolean isEmpty() { return list.size() <= 0; } }
/** * Returns the size of the list. * <p> * @return int */ private int dumpCacheSize() { return list.size(); }
/** * Return the number of items in the queue. * <p> * @return size */ public int size() { return list.size(); }
/** * Returns the size of the list. * <p> * @return the number of items in the map. */ protected int dumpCacheSize() { return list.size(); }
/** * @return IStats */ public IStats getStatistics() { IStats stats = new Stats(); stats.setTypeName( "LRUMap" ); ArrayList<IStatElement<?>> elems = new ArrayList<IStatElement<?>>(); elems.add(new StatElement<Integer>( "List Size", Integer.valueOf(list.size()) ) ); elems.add(new StatElement<Integer>( "Map Size", Integer.valueOf(map.size()) ) ); elems.add(new StatElement<Integer>( "Put Count", Integer.valueOf(putCnt) ) ); elems.add(new StatElement<Integer>( "Hit Count", Integer.valueOf(hitCnt) ) ); elems.add(new StatElement<Integer>( "Miss Count", Integer.valueOf(missCnt) ) ); stats.setStatElements( elems ); return stats; }
/** * @return IStats */ public IStats getStatistics() { IStats stats = new Stats(); stats.setTypeName( "LRUMap" ); ArrayList<IStatElement<?>> elems = new ArrayList<IStatElement<?>>(); elems.add(new StatElement<Integer>( "List Size", Integer.valueOf(list.size()) ) ); elems.add(new StatElement<Integer>( "Map Size", Integer.valueOf(map.size()) ) ); elems.add(new StatElement<Integer>( "Put Count", Integer.valueOf(putCnt) ) ); elems.add(new StatElement<Integer>( "Hit Count", Integer.valueOf(hitCnt) ) ); elems.add(new StatElement<Integer>( "Miss Count", Integer.valueOf(missCnt) ) ); stats.setStatElements( elems ); return stats; }
/** * This returns semi-structured information on the memory cache, such as the size, put count, * hit count, and miss count. * <p> * * @see org.apache.commons.jcs.engine.memory.behavior.IMemoryCache#getStatistics() */ @Override public IStats getStatistics() { IStats stats = super.getStatistics(); stats.setTypeName( /* add algorithm name */"Memory Cache"); List<IStatElement<?>> elems = stats.getStatElements(); elems.add(new StatElement<Integer>("List Size", Integer.valueOf(list.size()))); return stats; } }
/** * Adds an item to the end of the queue, which is the front of the list. * <p> * @param object */ public void add( T object ) { if ( list.size() >= maxSize ) { list.removeLast(); } list.addFirst( new DoubleLinkedListNode<T>( object ) ); }
elems.add(new StatElement<Integer>("List Size", Integer.valueOf(list.size()))); elems.add(new StatElement<Integer>("Map Size", Integer.valueOf(map.size()))); elems.add(new StatElement<Integer>("Put Count", Integer.valueOf(putCnt)));
+ list.size() + " elements"); log.debug("verifycache: checking linked list by key "); for (MemoryElementDescriptor<K, V> li = list.getFirst(); li != null; li = (MemoryElementDescriptor<K, V>) li.next)
/** verify that it's added last. */ public void testMakeLast_wasAlone() { // SETUP DoubleLinkedList<DoubleLinkedListNode<String>> list = new DoubleLinkedList<DoubleLinkedListNode<String>>(); String payload1 = "payload1"; DoubleLinkedListNode<String> node1 = new DoubleLinkedListNode<String>( payload1 ); list.addFirst( node1 ); // DO WORK list.makeLast( node1 ); // VERIFY assertEquals( "Wrong size", 1, list.size() ); assertEquals( "Wrong last", node1, list.getLast() ); assertEquals( "Wrong first", node1, list.getFirst() ); }
/** verify that it's added last. */ public void testMakeLast_wasAlone() { // SETUP DoubleLinkedList<DoubleLinkedListNode<String>> list = new DoubleLinkedList<DoubleLinkedListNode<String>>(); String payload1 = "payload1"; DoubleLinkedListNode<String> node1 = new DoubleLinkedListNode<String>( payload1 ); list.addFirst( node1 ); // DO WORK list.makeLast( node1 ); // VERIFY assertEquals( "Wrong size", 1, list.size() ); assertEquals( "Wrong last", node1, list.getLast() ); assertEquals( "Wrong first", node1, list.getFirst() ); }
/** verify that it's added last. */ public void testMakeLast_wasLast() { // SETUP DoubleLinkedList<DoubleLinkedListNode<String>> list = new DoubleLinkedList<DoubleLinkedListNode<String>>(); String payload1 = "payload1"; DoubleLinkedListNode<String> node1 = new DoubleLinkedListNode<String>( payload1 ); String payload2 = "payload2"; DoubleLinkedListNode<String> node2 = new DoubleLinkedListNode<String>( payload2 ); list.addFirst( node1 ); list.addFirst( node2 ); // DO WORK list.makeLast( node1 ); // VERIFY assertEquals( "Wrong size", 2, list.size() ); assertEquals( "Wrong last", node1, list.getLast() ); assertEquals( "Wrong first", node2, list.getFirst() ); }
/** verify that it's added last. */ public void testMakeLast_wasLast() { // SETUP DoubleLinkedList<DoubleLinkedListNode<String>> list = new DoubleLinkedList<DoubleLinkedListNode<String>>(); String payload1 = "payload1"; DoubleLinkedListNode<String> node1 = new DoubleLinkedListNode<String>( payload1 ); String payload2 = "payload2"; DoubleLinkedListNode<String> node2 = new DoubleLinkedListNode<String>( payload2 ); list.addFirst( node1 ); list.addFirst( node2 ); // DO WORK list.makeLast( node1 ); // VERIFY assertEquals( "Wrong size", 2, list.size() ); assertEquals( "Wrong last", node1, list.getLast() ); assertEquals( "Wrong first", node2, list.getFirst() ); }
/** verify that it's added last. */ public void testMakeLast_wasFirst() { // SETUP DoubleLinkedList<DoubleLinkedListNode<String>> list = new DoubleLinkedList<DoubleLinkedListNode<String>>(); String payload1 = "payload1"; DoubleLinkedListNode<String> node1 = new DoubleLinkedListNode<String>( payload1 ); String payload2 = "payload2"; DoubleLinkedListNode<String> node2 = new DoubleLinkedListNode<String>( payload2 ); list.addFirst( node2 ); list.addFirst( node1 ); // DO WORK list.makeLast( node1 ); // VERIFY assertEquals( "Wrong size", 2, list.size() ); assertEquals( "Wrong last", node1, list.getLast() ); assertEquals( "Wrong first", node2, list.getFirst() ); }
/** verify that it's added last. */ public void testMakeLast_wasFirst() { // SETUP DoubleLinkedList<DoubleLinkedListNode<String>> list = new DoubleLinkedList<DoubleLinkedListNode<String>>(); String payload1 = "payload1"; DoubleLinkedListNode<String> node1 = new DoubleLinkedListNode<String>( payload1 ); String payload2 = "payload2"; DoubleLinkedListNode<String> node2 = new DoubleLinkedListNode<String>( payload2 ); list.addFirst( node2 ); list.addFirst( node1 ); // DO WORK list.makeLast( node1 ); // VERIFY assertEquals( "Wrong size", 2, list.size() ); assertEquals( "Wrong last", node1, list.getLast() ); assertEquals( "Wrong first", node2, list.getFirst() ); }
/** verify that it's added last. */ public void testMakeLast_wasInMiddle() { // SETUP DoubleLinkedList<DoubleLinkedListNode<String>> list = new DoubleLinkedList<DoubleLinkedListNode<String>>(); String payload1 = "payload1"; DoubleLinkedListNode<String> node1 = new DoubleLinkedListNode<String>( payload1 ); String payload2 = "payload2"; DoubleLinkedListNode<String> node2 = new DoubleLinkedListNode<String>( payload2 ); String payload3 = "payload3"; DoubleLinkedListNode<String> node3 = new DoubleLinkedListNode<String>( payload3 ); list.addFirst( node2 ); list.addFirst( node1 ); list.addFirst( node3 ); // DO WORK list.makeLast( node1 ); // VERIFY assertEquals( "Wrong size", 3, list.size() ); assertEquals( "Wrong last", node1, list.getLast() ); assertEquals( "Wrong first", node3, list.getFirst() ); }
/** verify that it's added last. */ public void testMakeLast_wasInMiddle() { // SETUP DoubleLinkedList<DoubleLinkedListNode<String>> list = new DoubleLinkedList<DoubleLinkedListNode<String>>(); String payload1 = "payload1"; DoubleLinkedListNode<String> node1 = new DoubleLinkedListNode<String>( payload1 ); String payload2 = "payload2"; DoubleLinkedListNode<String> node2 = new DoubleLinkedListNode<String>( payload2 ); String payload3 = "payload3"; DoubleLinkedListNode<String> node3 = new DoubleLinkedListNode<String>( payload3 ); list.addFirst( node2 ); list.addFirst( node1 ); list.addFirst( node3 ); // DO WORK list.makeLast( node1 ); // VERIFY assertEquals( "Wrong size", 3, list.size() ); assertEquals( "Wrong last", node1, list.getLast() ); assertEquals( "Wrong first", node3, list.getFirst() ); }