Package net.sf.joafip.kvstore.record.entity

Examples of net.sf.joafip.kvstore.record.entity.DataRecordIdentifier

168
169
170
171
172
173
174
175
176
177
        .setSubstituteObjectAndPersistInfo(substituteObjectAndPersistInfo);
    return objectAndPersistInfo;
  }

  public DataRecordIdentifier getNewDataRecordIdentifier() {
    final DataRecordIdentifier result = nextDataRecordIdentifier;
    nextDataRecordIdentifier = new DataRecordIdentifier(
        nextDataRecordIdentifier);
    return result;
  }
View Full Code Here
154
155
156
157
158
159
160
161
162
163
164
      final Integer numberOfChild = numberOfChildFromBinary(
          helperBinaryConversion, binary, offset);
      offset += HelperBinaryConversion.INT_BYTE_SIZE;
      node.setNumberOfChild(numberOfChild);

      DataRecordIdentifier dataRecordIdentifier =
      /**/dataRecordIdentifierFromBinary(helperBinaryConversion, binary,
          offset);
      offset += HelperBinaryConversion.REFERENCE_NULLABLE_BYTE_SIZE;

      AbstractHeapRecordableRBTNode<E> parent;
View Full Code Here
277
278
279
280
281
282
283
284
285
    }
    if (!binaryConverter.valueDefinedFromBinary) {
      throw new HeapRecordableException(
          "data record identifier value must be defined");
    }
    final DataRecordIdentifier objectFromBinary = (DataRecordIdentifier) binaryConverter.objectFromBinary;
    binaryConverter.objectFromBinary = null;// NOPMD
    return objectFromBinary;
  }
View Full Code Here
138
139
140
141
142
143
144
145
146
    }
  }

  public int compareTo(final IHeapRecordable heapRecordable) {
    final DataRecordIdentifier otherDataRecordIdentifier = heapRecordable
        .getDataRecordIdentifier();
    return dataRecordIdentifier.compareTo(otherDataRecordIdentifier);
  }
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
      randomAccessFile.open();
      randomAccessFile.seek(0);
      final byte[] block = new byte[FIRST_BLOCK_LENGTH];
      if (removeFiles) {
        randomAccessFile.write(block);
        header.setNextIdentifier(new DataRecordIdentifier());
        header.setNumberOfDataRecord(0);
      } else {
        if (randomAccessFile.read(block) == FIRST_BLOCK_LENGTH) {
          final int length = (((int) block[0]) & 0xff) << 8
              | (((int) block[1]) & 0xff);
          final byte[] data = new byte[length];
          System.arraycopy(block, 2, data, 0, length);
          header.set(data);
        } else {
          randomAccessFile.write(block);
          header.setNextIdentifier(new DataRecordIdentifier());
          header.setNumberOfDataRecord(0);
        }
      }
    } catch (FileIOException exception) {
      throw new HeapException(exception);
View Full Code Here
191
192
193
194
195
196
197
198
199
  }

  @Override
  protected DataRecordIdentifier getNewDataRecordIdentifierImpl()
      throws HeapException {
    final DataRecordIdentifier result = header.getNextIdentifier();
    header.setNextIdentifier(new DataRecordIdentifier(result));
    return result;
  }
View Full Code Here
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
          }
        } else {
          position = Long.MAX_VALUE;
        }
      } while (!found && position < header.getDataLength());
      DataRecordIdentifier result;
      if (found) {
        lengthData[0] = 0;
        lengthData[1] = 0;
        write(position, 0, lengthData);
        result = new DataRecordIdentifier(
            (position - firstRecordPositionInfile)
                / header.getBlockLength());
      } else {
        result = null;// NOPMD
      }
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
100
101
    super.tearDown();
  }

  public void test1() throws GarbageException { // NOPMD
    for (long[] entry : referencingReferenced) {
      final DataRecordIdentifier referencing = new DataRecordIdentifier(// NOPMD
          entry[0]);
      final DataRecordIdentifier referenced = new DataRecordIdentifier(// NOPMD
          entry[1]);
      graph.addReferenced(referencing,
          new DataRecordIdentifier[] { referenced });// NOPMD
    }
    computeAndCheck();
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
112
113
    computeAndCheck();
  }

  public void test2() throws GarbageException { // NOPMD
    for (long[] entry : referencingReferenced) {
      final DataRecordIdentifier referencing = new DataRecordIdentifier(// NOPMD
          entry[0]);
      final DataRecordIdentifier referenced = new DataRecordIdentifier(// NOPMD
          entry[1]);
      graph.addReferencing(referenced, referencing, 1);
    }
    computeAndCheck();
  }
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
135
136
137
138
139
140
141
142
143
144
145
    }
    computeAndCheck();
  }

  private void computeAndCheck() throws GarbageException {
    graph.compute(new DataRecordIdentifier(1));
    final Set<DataRecordIdentifier> attachedSet = graph
        .getAttachedToRootSet();
    assertEquals("bad number of attached", attachedList.length,
        attachedSet.size());
    for (long attachedExpected : attachedList) {
      if (!attachedSet
          .contains(new DataRecordIdentifier(attachedExpected))) {// NOPMD
        fail("must contains " + attachedExpected);
      }
    }
    assertEquals("bad number of detached set", 2,
        graph.numberOfDetachedSet());

    Set<DataRecordIdentifier> detachedSet = graph
        .getDetachedToRootSet(new DataRecordIdentifier(detachedList1[0]));
    for (long detached : detachedList1) {
      final Set<DataRecordIdentifier> detachedSet2 = graph
          .getDetachedToRootSet(new DataRecordIdentifier(detached));// NOPMD
      assertSame("bad set", detachedSet, detachedSet2);
    }

    detachedSet = graph.getDetachedToRootSet(new DataRecordIdentifier(
        detachedList2[0]));
    for (long detached : detachedList2) {
      final Set<DataRecordIdentifier> detachedSet2 = graph
          .getDetachedToRootSet(new DataRecordIdentifier(detached));// NOPMD
      assertSame("bad set", detachedSet, detachedSet2);
    }
  }
View Full Code Here
TOP

Related Classes of net.sf.joafip.kvstore.record.entity.DataRecordIdentifier

  • net.sf.joafip.btreeplus.entity.AbstractPageRecord
  • net.sf.joafip.btreeplus.entity.LeafPage
  • net.sf.joafip.btreeplus.entity.LeafPageTest
  • net.sf.joafip.btreeplus.entity.NonTerminalPage
  • net.sf.joafip.btreeplus.entity.NonTerminalPageTest
  • net.sf.joafip.btreeplus.entity.PageRecord
  • net.sf.joafip.btreeplus.service.BtreePlusDataManager
  • net.sf.joafip.btreeplus.service.BtreePlusElementMgrTest
  • net.sf.joafip.btreeplus.service.BtreePlusLeafPageBalanceMergeTest
  • net.sf.joafip.heapfile.record.entity.HeapRecord
    • 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.