Package org.cipango.util.PriorityQueue

Examples of org.cipango.util.PriorityQueue.Node

22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
public class PriorityQueueTest extends TestCase
{
  public void testOne()
  {
    PriorityQueue queue = new PriorityQueue();
    queue.offer(new Node(123));
    assertEquals(123, queue.peek().getValue());
    assertEquals(1, queue.getSize());
    queue.offer(queue.peek(), 1234);
    assertEquals(1234, queue.peek().getValue());
    queue.offer(queue.peek(), 1);
    assertEquals(1, queue.poll().getValue());
    assertEquals(0, queue.getSize());
   
    Node t = new Node(4321);
    queue.offer(t);
    assertEquals(4321, queue.peek().getValue());
    queue.remove(t);
    assertEquals(0, queue.getSize());
    assertEquals(-1, t.getPosition());
    queue.remove(t);
    assertEquals(0, queue.getSize());
  }
View Full Code Here
51
52
53
54
55
56
57
58
59
60
61
    {
      PriorityQueue queue = new PriorityQueue();
      long previous = Long.MIN_VALUE;
      for (int j = 0; j < 1000; j++)
      {
        queue.offer(new Node(random.nextLong()));
      }
      while (queue.getSize() != 0)
      {
        long min = queue.poll().getValue();
        assertTrue(previous <= min);
View Full Code Here
71
72
73
74
75
76
77
78
79
80
    for (int i = 0; i < 1000; i++)
    {
      PriorityQueue queue = new PriorityQueue();
      for (int j = 0; j < 1000; j++)
      {
        queue.offer(new Node(random.nextLong()));
      }
      checkPosition(queue.asArray());
    }
  }
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
  public void testReschedule()
  {
    PriorityQueue queue = new PriorityQueue();
    for (int i = 50; i-->0;)
    {
      queue.offer(new Node(i));
    }
    Node[] tasks = queue.asArray();
    for (int i = 0; i < tasks.length; i++)
    {
      queue.offer(tasks[i], 100 - tasks[i].getValue());
View Full Code Here
115
116
117
118
119
120
121
122
123
124
125
    {
      PriorityQueue queue = new PriorityQueue();
      long previous = Long.MIN_VALUE;
      for (int j = 0; j < 1000; j++)
      {
        queue.offer(new Node(random.nextLong()));
      }
      for (int j = 0; j < 10; j++)
      {
        queue.offer(queue.asArray()[random.nextInt(1000)], random.nextLong());
      }
View Full Code Here
136
137
138
139
140
141
142
143
144
145
146
  public void testRemove()
  {
    PriorityQueue queue = new PriorityQueue();
    for (int i = 0; i < 100; i++)
    {
      queue.offer(new Node(i));
    }
    Node[] tasks = queue.asArray();
    for (int i = 0; i < tasks.length; i++)
    {
      if (tasks[i].getValue() % 2 == 0)
View Full Code Here
TOP

Related Classes of org.cipango.util.PriorityQueue.Node

  • org.cipango.util.PriorityQueueTest
    • Copyright © 2018 www.massapicom. 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.