Package net.sf.joafip.btreeplus.entity

Examples of net.sf.joafip.btreeplus.entity.BigKey

68
69
70
71
72
73
74
75
76
77
78
79
    initialize();
  }

  private void initialize() throws TestException {
    try {
      lessThanMinKey = DATA_RECORD_KEY_MANAGER.createKey(new BigKey(-1));
      maxKey = DATA_RECORD_KEY_MANAGER.createKey(new BigKey(
          Long.MAX_VALUE));
    } catch (Exception exception) {
      throw new TestException(exception);
    }
  }
View Full Code Here
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
  public void testBalanceRightToLeft() throws HeapException {
    final int max = 8 * 8 * 2;
    for (int identifier = 0; identifier < max; identifier++) {
      try {
        dataManager.writeDataRecord(DATA_RECORD_KEY_MANAGER
            .createKey(new BigKey(identifier)),// NOPMD
            createData(identifier));
        // final String result =
        /**/BtreePlusDataMgrIntegrityChecker.getInstance()
            .checkIntegrity(dataManager, lessThanMinKey, maxKey)
            .toString();
        // System.out.println(result);
      } catch (Throwable throwable) {// NOPMD
        throw new HeapException("after add #" + identifier, throwable);// NOPMD
      }
      for (int k = 0; k <= identifier; k++) {
        final byte[] data = dataManager
            .readDataRecord(DATA_RECORD_KEY_MANAGER
                .createKey(new BigKey(k)));// NOPMD
        assertNotNull("after add #" + identifier + " must found #" + k,
            data);
        assertTrue("bad value", Arrays.equals(createData(k), data));
      }
    }
View Full Code Here
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
  public void testBalanceLeftToRight() throws HeapException {
    final int max = 8 * 8 * 2;
    for (int identifier = max - 1; identifier >= 0; identifier--) {
      try {
        dataManager.writeDataRecord(DATA_RECORD_KEY_MANAGER
            .createKey(new BigKey(identifier)),// NOPMD
            createData(identifier));
        // final String result =
        /**/BtreePlusDataMgrIntegrityChecker.getInstance()
            .checkIntegrity(dataManager, lessThanMinKey, maxKey)
            .toString();
        // System.out.println(result);
      } catch (Throwable throwable) {// NOPMD
        throw new HeapException("after add #" + identifier, throwable);
      }
      for (int k = identifier; k < max; k++) {
        final byte[] data = dataManager
            .readDataRecord(DATA_RECORD_KEY_MANAGER
                .createKey(new BigKey(k)));// NOPMD
        assertNotNull("after add #" + identifier + " must found #" + k,
            data);
        assertTrue("bad value", Arrays.equals(createData(k), data));
      }
    }
View Full Code Here
166
167
168
169
170
171
172
173
174
175
    final Iterator<DataRecordIdentifier> iterator = dataManager
        .dataRecordIterator();
    for (int identifier = 0; identifier < max; identifier++) {
      assertTrue("must has next", iterator.hasNext());
      assertEquals("bad value",
          DATA_RECORD_KEY_MANAGER.createKey(new BigKey(identifier)),// NOPMD
          iterator.next());
    }
    assertFalse("must not has next", iterator.hasNext());
  }
View Full Code Here
TOP

Related Classes of net.sf.joafip.btreeplus.entity.BigKey

  • net.sf.joafip.btreeplus.service.BtreePlusNonTerminalPageBalanceMergeTest
    • 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.