Examples of LinkedListNode

CtCILibrary.LinkedListNode
org.drools.core.util.LinkedListNode
Items placed in a LinkedList must implement this interface . @see LinkedList



org.jivesoftware.util.LinkedListNode

Doubly linked node in a LinkedList. Most LinkedList implementations keep the equivalent of this class private. We make it public so that references to each node in the list can be maintained externally.  Exposing this class lets us make remove operations very fast. Remove is built into this class and only requires two reference reassignments. If remove existed in the main LinkedList class, a linear scan would have to be performed to find the correct node to delete. 
 The linked list implementation was specifically written for the Jive cache system. While it can be used as a general purpose linked list, for most applications, it is more suitable to use the linked list that is part of the Java Collections package.
@author Jive Software
@see org.jivesoftware.util.LinkedList



org.nemesis.forum.util.LinkedListNode

Doubly linked node in a LinkedList. Most LinkedList implementations keep the equivalent of this class private. We make it public so that references to each node in the list can be maintained externally. Exposing this class lets us make remove operations very fast. Remove is built into this class and only requires to reference reassignments. If remove was built into the main LinkedList class, a linear scan would have to be performed to find the correct node to delete. The linked list implementation was specifically written for the CoolServlets cache system. While it can be used as a general purpose linked list, for most applications, it is more suitable to use the linked list that is part of the Java Collections package.
@see LinkedList




Examples of CtCILibrary.LinkedListNode
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56     int k = 10;
    
    // Create linked list
    LinkedListNode[] nodes = new LinkedListNode[list_length];
    for (int i = 0; i < list_length; i++) {
      nodes[i] = new LinkedListNode(i, null, i > 0 ? nodes[i - 1] : null);
    }
    
    // Create loop;
    nodes[list_length - 1].next = nodes[list_length - k];
    
    LinkedListNode loop = FindBeginning(nodes[0]);
    if (loop == null) {
      System.out.println("No Cycle.");
    } else {
      System.out.println(loop.data);
    }

View Full Code Here



Examples of CtCILibrary.LinkedListNode
7
8
9
10
11
12
13
14
15
16 
  public static boolean deleteNode(LinkedListNode n) {
    if (n == null || n.next == null) {
      return false; // Failure
    } 
    LinkedListNode next = n.next; 
    n.data = next.data; 
    n.next = next.next; 
    return true;
  }

View Full Code Here

Examples of CtCILibrary.LinkedListNode
14
15
16
17
18
19
20
21
22
23     n.next = next.next; 
    return true;
  }
  
  public static void main(String[] args) {
    LinkedListNode head = AssortedMethods.randomLinkedList(10, 0, 10);
    System.out.println(head.printForward());
    deleteNode(head.next.next.next.next); // delete node 4
    System.out.println(head.printForward());
  }

View Full Code Here

Examples of CtCILibrary.LinkedListNode
30
31
32
33
34
35
36
37
38
39
40     }
  }
  
  public boolean isPalindrome(LinkedListNode head) {
    int size = 0;
    LinkedListNode n = head;
    while (n != null) {
      size++;
      n = n.next;
    }
    Result p = isPalindromeRecurse(head, size);

View Full Code Here

Examples of CtCILibrary.LinkedListNode
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65   
  public static void main(String[] args) {
    int length = 10;
    LinkedListNode[] nodes = new LinkedListNode[length];
    for (int i = 0; i < length; i++) {
      nodes[i] = new LinkedListNode(i >= length / 2 ? length - i - 1 : i, null, null);
    }
    
    for (int i = 0; i < length; i++) {
      if (i < length - 1) {
        nodes[i].setNext(nodes[i + 1]);
      }
      if (i > 0) {
        nodes[i].setPrevious(nodes[i - 1]);
      }
    }
    // nodes[length - 2].data = 9; // Uncomment to ruin palindrome
    
    LinkedListNode head = nodes[0];
    System.out.println(head.printForward());
    Question q = new Question();
    System.out.println(q.isPalindrome(head));
  }

View Full Code Here

Examples of org.drools.core.util.LinkedListNode
31
32
33
34
35
36
37
38
39         return beliefSystem;
    }


    @Override
    public InternalFactHandle getFactHandle() {
        LinkedListNode node = getFirst();
        SimpleLogicalDependency ld = (SimpleLogicalDependency) ((LinkedListEntry) node).getObject();
        return rootHandle;
    }

View Full Code Here

Examples of org.jivesoftware.util.LinkedListNode
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163         }
        cacheSize += objectSize;
        DefaultCache.CacheObject<V> cacheObject = new DefaultCache.CacheObject<V>(value, objectSize);
        map.put(key, cacheObject);
        // Make an entry into the cache order list.
        LinkedListNode lastAccessedNode = lastAccessedList.addFirst(key);
        // Store the cache order list entry so that we can get back to it
        // during later lookups.
        cacheObject.lastAccessedListNode = lastAccessedNode;
        // Add the object to the age list
        LinkedListNode ageNode = ageList.addFirst(key);
        // We make an explicit call to currentTimeMillis() so that total accuracy
        // of lifetime calculations is better than one second.
        ageNode.timestamp = System.currentTimeMillis();
        cacheObject.ageListNode = ageNode;


View Full Code Here

Examples of org.jivesoftware.util.LinkedListNode
602
603
604
605
606
607
608
609
610
611
612 
        // Remove all old entries. To do this, we remove objects from the end
        // of the linked list until they are no longer too old. We get to avoid
        // any hash lookups or looking at any more objects than is strictly
        // neccessary.
        LinkedListNode node = ageList.getLast();
        // If there are no entries in the age list, return.
        if (node == null) {
            return;
        }


View Full Code Here

Examples of org.nemesis.forum.util.LinkedListNode
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225     }
    size += objectSize;
    CacheObject cacheObject = new CacheObject(object, objectSize);
    cachedObjectsHash.put(key, cacheObject);
    //Make an entry into the cache order list.
    LinkedListNode lastAccessedNode = lastAccessedList.addFirst(key);
    //Store the cache order list entry so that we can get back to it
    //during later lookups.
    cacheObject.lastAccessedListNode = lastAccessedNode;
    //Add the object to the age list
    LinkedListNode ageNode = ageList.addFirst(key);
    //We make an explicit call to currentTimeMillis() so that total accuracy
    //of lifetime calculations is better than one second.
    ageNode.timestamp = System.currentTimeMillis();
    cacheObject.ageListNode = ageNode;


View Full Code Here

Examples of org.nemesis.forum.util.LinkedListNode
357
358
359
360
361
362
363
364
365
366
367 
    //Remove all old entries. To do this, we remove objects from the end
    //of the linked list until they are no longer too old. We get to avoid
    //any hash lookups or looking at any more objects than is strictly
    //neccessary.
    LinkedListNode node = ageList.getLast();
    //If there are no entries in the age list, return.
    if (node == null) {
      return;
    }


View Full Code Here


0
1
2



TOP


Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.