/** * Adds a new node to the start of the link list. * <p> * @param key * @param val The feature to be added to the First */ private void addFirst(K key, V val) { lock.lock(); try { LRUElementDescriptor<K, V> me = new LRUElementDescriptor<K, V>(key, val); list.addFirst( me ); } finally { lock.unlock(); } }
/** * Adds a new node to the start of the link list. * <p> * @param key * @param val The feature to be added to the First */ private void addFirst(K key, V val) { lock.lock(); try { LRUElementDescriptor<K, V> me = new LRUElementDescriptor<K, V>(key, val); list.addFirst( me ); } finally { lock.unlock(); } }
/** * Adds a new node to the start of the link list. * <p> * @param ce The feature to be added to the First * @return MemoryElementDescriptor */ protected MemoryElementDescriptor<K, V> addFirst( ICacheElement<K, V> ce ) { lock.lock(); try { MemoryElementDescriptor<K, V> me = new MemoryElementDescriptor<K, V>(ce); list.addFirst(me); verifyCache(ce.getKey()); return me; } finally { lock.unlock(); } }
/** * Adds a new node to the start of the link list. * <p> * * @param ce * The feature to be added to the First * @return MemoryElementDescriptor */ protected MemoryElementDescriptor<K, V> addFirst(ICacheElement<K, V> ce) { lock.lock(); try { MemoryElementDescriptor<K, V> me = new MemoryElementDescriptor<K, V>(ce); list.addFirst(me); if ( log.isDebugEnabled() ) { verifyCache(ce.getKey()); } return me; } finally { lock.unlock(); } }
/** * 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 ) ); }
/** 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() ); }
/** 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_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_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() ); }