Package com.leansoft.bigqueue

Examples of com.leansoft.bigqueue.IBigQueue.dequeue()

76
77
78
79
80
81
82
83
84
85
86
    QueueResponse resp = new QueueResponse();
    byte[] data = null;
    IBigQueue bigQueue = queueMap.get(topic);
    if (bigQueue != null) {
      try {
        data = bigQueue.dequeue();
      } catch (IOException e) {
        resp.setResultCode(ResultCode.FAILURE);
        return resp;
      }
    }
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
    if(targetSize != maxNumOfItems) {
        System.err.println("target queue size is not correct!, target queue size is " + targetSize + " expected queue size is " + maxNumOfItems);
    }
   
    // first sorted item
    String previousItem = new String(targetSortedQueue.dequeue());
   
    // validate the sorted queue
    for(int i = 1; i < targetSize; i++) {
      String item = new String(targetSortedQueue.dequeue());
      if (item.compareTo(previousItem) < 0) {
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
    // first sorted item
    String previousItem = new String(targetSortedQueue.dequeue());
   
    // validate the sorted queue
    for(int i = 1; i < targetSize; i++) {
      String item = new String(targetSortedQueue.dequeue());
      if (item.compareTo(previousItem) < 0) {
        System.err.println("target queue is not in sorted order!");
      }
      previousItem = item;
    }
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
          }
        }
      }
      if (queueWithLowestItem == null) break; // all queues are empty
      // extract and put the lowest item into the target queue
      byte[] data = queueWithLowestItem.dequeue();
      targetBigQueue.enqueue(data);
    }
   
    // release the source queues since we have done with them
    for(IBigQueue bigQueue : listOfSortedQueues) {
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
    if(targetSize != maxNumOfItems) {
        System.err.println("target queue size is not correct!, target queue size is " + targetSize + " expected queue size is " + maxNumOfItems);
    }
   
    // first sorted item
    String previousItem = new String(targetSortedQueue.dequeue());
   
    // put sorted items in a big array so we can binary search it later
    // validate the sorted queue at the same time
    IBigArray bigArray = new BigArrayImpl(MergeSortHelper.SAMPLE_DIR, "sample_array");
    bigArray.append(previousItem.getBytes());
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
    // put sorted items in a big array so we can binary search it later
    // validate the sorted queue at the same time
    IBigArray bigArray = new BigArrayImpl(MergeSortHelper.SAMPLE_DIR, "sample_array");
    bigArray.append(previousItem.getBytes());
    for(int i = 1; i < targetSize; i++) {
      String item = new String(targetSortedQueue.dequeue());
      if (item.compareTo(previousItem) < 0) {
        System.err.println("target queue is not in sorted order!");
      }
      bigArray.append(item.getBytes());
      previousItem = item;
View Full Code Here
28
29
30
31
32
33
34
35
36
37
38
       
      // ensure the new big queue is empty
      assertNotNull(bigQueue);
      assertTrue(bigQueue.size() == 0);
      assertTrue(bigQueue.isEmpty());
      assertNull(bigQueue.dequeue());
      assertNull(bigQueue.peek());
     
      // enqueue some items
      for(int i = 0; i < 10; i++) {
        String item = String.valueOf(i);
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
      // peek the front of the queue
      assertEquals(String.valueOf(0), new String(bigQueue.peek()));
     
      // dequeue some items
      for(int i = 0; i < 5; i++) {
        String item = new String(bigQueue.dequeue());
        assertEquals(String.valueOf(i), item);
      }
      // the big queue is not empty yet
      assertTrue(!bigQueue.isEmpty());
      assertTrue(bigQueue.size() == 5);
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
      assertTrue(!bigQueue.isEmpty());
      assertTrue(bigQueue.size() == 5);
     
      // dequeue all remaining items
      while(true) {
        byte[] data = bigQueue.dequeue();
        if (data == null) break;
      }
      // now the big is empty since all items have been dequeued
      assertTrue(bigQueue.isEmpty());
     
View Full Code Here
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.