Examples of IBigArray

Examples of com.leansoft.bigqueue.IBigArray

77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
    // 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());
    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;
    }
    MergeSortHelper.output("Validation finished.");
   
    // have done with target sorted queue, empty it and delete back data files to save disk space
    targetSortedQueue.removeAll();
    targetSortedQueue.close();
   
    bigArray.close();
  }
View Full Code Here

Examples of com.leansoft.bigqueue.IBigArray

97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
   
    bigArray.close();
  }
 
  static void binarySearch() throws IOException {
    IBigArray bigArray = new BigArrayImpl(MergeSortHelper.SAMPLE_DIR, "sample_array");
    // randomly get some items which can be found later
    int searchLoopLimit = 10000;
    List<String> randomKeys = new ArrayList<String>();
    Random random = new Random();
    for(int i = 0; i < searchLoopLimit / 2; i++) {
      long randomIndex = (long)(random.nextDouble() * maxNumOfItems);
      String randomKey = new String(bigArray.get(randomIndex));
      randomKeys.add(randomKey);
    }
    bigArray.close(); // close to release cache, otherwise the performance of binary search will not be real.
   
    bigArray = new BigArrayImpl(MergeSortHelper.SAMPLE_DIR, "sample_array");
   
    MergeSortHelper.output("Single thread binary search begin ...");
    int foundCount = 0;
    long start = System.currentTimeMillis();
    for(int i = 0; i < searchLoopLimit; i++) {
      String randomKey = null;
      if (i < searchLoopLimit / 2) {
        randomKey = randomKeys.get(i);
      } else {
        randomKey = MergeSortHelper.genRandomString(itemSize);
      }
      long result = BinarySearchHelper.binarySearch(bigArray, randomKey, 0, bigArray.size() - 1);
      if (result != BinarySearchHelper.NOT_FOUND) {
        foundCount++;
      }
    }
    long end = System.currentTimeMillis();
    MergeSortHelper.output("Binary search finished.");
    MergeSortHelper.output("Time to search " + searchLoopLimit + " items in the big array is " + (end - start) + " ms.");
    MergeSortHelper.output("Average search time is " + (double)(end - start) / searchLoopLimit + "ms.");
    MergeSortHelper.output("Found count is " + foundCount);
   
    // have done with the big array, empty it and delete back data files to save disk space
    bigArray.removeAll();
    bigArray.close();
  }
View Full Code Here

Examples of com.leansoft.bigqueue.IBigArray

18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
*/
public class BigArrayTutorial {

  @Test
  public void demo() throws IOException {
    IBigArray bigArray = null;
    try {
      // create a new big array
      bigArray = new BigArrayImpl("d:/bigarray/tutorial", "demo");
      // ensure the new big array is empty
      assertNotNull(bigArray);
      assertTrue(bigArray.isEmpty());
      assertTrue(bigArray.size() == 0);
      assertTrue(bigArray.getHeadIndex() == 0);
      assertTrue(bigArray.getTailIndex() == 0);
     
      // append some items into the array
      for(int i = 0; i < 10; i++) {
        String item = String.valueOf(i);
        long index = bigArray.append(item.getBytes());
        assertTrue(i == index);
      }
      assertTrue(bigArray.size() == 10);
      assertTrue(bigArray.getHeadIndex() == 10);
      assertTrue(bigArray.getTailIndex() == 0);
     
      // randomly read items in the array
      String item0 = new String(bigArray.get(0));
      assertEquals(String.valueOf(0), item0);
     
      String item3 = new String(bigArray.get(3));
      assertEquals(String.valueOf(3), item3);
     
      String item9 = new String(bigArray.get(9));
      assertEquals(String.valueOf(9), item9);
     
      // empty the big array
      bigArray.removeAll();
      assertTrue(bigArray.isEmpty());
    } finally {
      bigArray.close();
    }
  }
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.