Package net.sf.joafip.heapfile.record.entity

Examples of net.sf.joafip.heapfile.record.entity.HeapRecord

422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
      throws HeapException {
    heapRecord.freeRecord();
    final long positionInFile = heapRecord.getPositionInFile();
    final int areaSize = next.getRecordSize() + heapRecord.getRecordSize();
    /* first delete from free node tree */
    final HeapRecord nextHeapRecord = next;
    freeNodeTreeDelete(nextHeapRecord);
    /* then delete record */
    heapElementManager.delete(next.getPositionInFile());
    final long nextPositionInFile = next.getNextRecordFilePosition();
    if (nextHeapRecord.getPositionInFile() == heapHeader
        .getLastRecordPositionInFile()) {
      heapHeader.setLastRecordPositionInFile(positionInFile);
    }
    freeRecord(positionInFile, areaSize, nextPositionInFile, heapRecord);
  }
View Full Code Here
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
   * @throws HeapException
   */
  private HeapRecord deleteAndGetDataRecord(final HeapIdNode heapIdNode)
      throws HeapException {
    final DataRecordIdentifier identifier = heapIdNode.getElement();
    final HeapRecord heapRecord = heapIdNode.getHeapRecord();
    idNodeTreeDelete(heapRecord);
    final long positionInFile = heapRecord.getPositionInFile();
    if (logger.debugEnabled) {
      logger.debug("data record #" + identifier + " position in file "
          + positionInFile + " is free record="
          + heapRecord.isFreeRecord());
    }
    return heapRecord;
  }
View Full Code Here
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
  @Override
  public byte[] readDataRecordImpl(
      final DataRecordIdentifier dataRecordIdentifier)
      throws HeapException {
    final byte[] dataAssociated;
    HeapRecord heapRecord;
    try {
      heapRecord = getHeapRecord(dataRecordIdentifier);
    } catch (HeapException exception) {// NOPMD
      final String message = FAILED_READ_DATA_RECORD
          + dataRecordIdentifier;
      logger.warn(message);
      throw new HeapException(message, exception);
    }
    if (heapRecord == null) {
      /*
       * no data associated to heap record => no data record
       */
      dataAssociated = null;
      if (logger.debugEnabled) {
        logger.debug("no record #" + dataRecordIdentifier);
      }
    } else {
      dataAssociated = heapRecord.getDataAssociated();
    }
    return dataAssociated;
  }
View Full Code Here
603
604
605
606
607
608
609
  @Override
  public IFileStorable createHeapRecord(
      final IHeapElementManager heapElementManager,
      final long positionInFile) throws HeapException {
    return new HeapRecord(heapElementManager, positionInFile);
  }
View Full Code Here
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
   */
  private HeapRecord createRecordForDataFromFree(final int neededDataSize,
      final DataRecordIdentifier nodeIdentifier,
      final int neededRecordSize, final HeapFreeNode freeNode)
      throws HeapException {
    final HeapRecord heapRecord;
    /* usable free area size */
    final int freeRecordSize = freeNode.getRecordSize();
    /* unused area size is usable minus needed area size */
    final int newFreeRecordSize = freeRecordSize - neededRecordSize;
    heapRecord = freeNode.getHeapRecord();
    /* no more free */
    freeNodeTreeDelete(heapRecord);
    // NO NO NO do not delete, reused as data record
    // heapElementManager.delete(heapRecord.getPositionInFile());
    /* will update heap header for free and used size */
    final HeapHeader heapHeader = (HeapHeader) heapElementManager
        .getHeapHeader();

    if (newFreeRecordSize >= HeapRecord.MAX_RECORD_HEADER_SIZE
        + MINIMUM_RECORD_DATA_SIZE + 4) {
      /*
       * split free record : one part used for data the other keep free
       */
      final long nextRecordFilePosition = heapRecord
          .getNextRecordFilePosition();
      heapRecord.unfreeRecord(neededDataSize, neededRecordSize,
          nodeIdentifier, false);
      final long positionInFile = heapRecord.getPositionInFile();
      final long newFreeRecordPositionInFile = positionInFile
          + neededRecordSize;

      final HeapRecord newFreeHeapRecord = new HeapRecord(
          heapElementManager,
          newFreeRecordPositionInFile/* positionInFile */,
          positionInFile/* previousPositionInFile */,
          null/* nodeIdentifier */, true/* freeRecord */,
          0/* dataAssociatedSize */, newFreeRecordSize/* recordSize */);

      // final HeapRecord newFreeHeapRecord = heapElementManager
      // .newHeapFileRecord(
      // newFreeRecordPositionInFile/* positionInFile */,
      // positionInFile/* previousPositionInFile */,
      // null/* nodeIdentifier */, true/* freeRecord */,
      // null/* dataAssociatedSize */, newFreeRecordSize/*recordSize*/);

      heapElementManager.appendHeapFileRecord(newFreeHeapRecord);

      if (heapRecord.getPositionInFile() == heapHeader
          .getLastRecordPositionInFile()) {
        heapHeader
            .setLastRecordPositionInFile(newFreeRecordPositionInFile);
      }
      freeNodeTreeAppend(newFreeHeapRecord);
      if (nextRecordFilePosition != -1) {
        final HeapRecord nextHeapRecord = readHeapFileDataRecord(nextRecordFilePosition);
        nextHeapRecord
            .setPreviousRecordPositionInFile(newFreeRecordPositionInFile);
      }
    } else {
      heapRecord.unfreeRecord(neededDataSize, nodeIdentifier);
    }
View Full Code Here
720
721
722
723
724
725
726
727
728
729
730
    assert assertFirstPositionInFile(positionInFile,
        previousRecordPositionInFile);
    heapHeader.setLastRecordPositionInFile(positionInFile);
    heapHeader.addUsedSize(needAreaSize);
    /* new at end of file with a new record identification */
    final HeapRecord heapRecord = new HeapRecord(heapElementManager,
        positionInFile, previousRecordPositionInFile, nodeIdentifier,
        false, needDataSize, needAreaSize);
    // final HeapRecord heapRecord = heapElementManager.newHeapFileRecord(
    // positionInFile, previousRecordPositionInFile, nodeIdentifier,
    // false, needDataSize, needAreaSize);
View Full Code Here
750
751
752
753
754
755
756
757
758
759
760
   * @throws HeapException
   */
  private HeapRecord getHeapRecord(final DataRecordIdentifier identifier)
      throws HeapException {
    final HeapIdNode heapIdNode = idNodeSearchMayBeNotExist(identifier);
    final HeapRecord heapRecord;
    if (heapIdNode == null) {
      heapRecord = null;
    } else {
      final long positionInFile = heapIdNode.getPositionInFile();
      heapRecord = readHeapFileDataRecord(positionInFile);
View Full Code Here
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
    heapElementManager.startService();
    heapElementManager.openTransaction();

    // final HeapRecord heapRecord = new HeapRecord(heapElementManager,
    // HeapHeader.HEAP_HEADER_SIZE);
    final HeapRecord heapRecord = new HeapRecord(heapElementManager,
        HeapHeader.HEAP_HEADER_SIZE,
        -1L/* previousRecordPositionInFile */,
        DataRecordIdentifier.ZERO/* nodeIdentification */,
        false/* freeRecord */, 0/* dataAssociatedSize */,
        HeapRecord.DATA_RECORD_HEADER_SIZE + 4/* areaSize */);

    // final HeapRecord heapRecord = heapElementManager.newHeapFileRecord(
    // HeapHeader.HEAP_HEADER_SIZE,
    // -1/* previousRecordPositionInFile */,
    // DataRecordIdentifier.ZERO/* nodeIdentification */,
    // false/* freeRecord */, 0/* dataAssociatedSize */,
    // HeapRecord.DATA_RECORD_HEADER_SIZE + 4/* areaSize */);
    heapElementManager.appendHeapFileRecord(heapRecord);

    heapIdNode = new HeapIdNode(heapElementManager,
        heapRecord.getPositionInFile(), -1, -1, -1, false, false, 0,
        heapRecord.getNodeIdentifier());
  }
View Full Code Here
165
166
167
168
169
170
171
  @Override
  public IFileStorable createHeapRecord(
      final IHeapElementManager heapElementManager,
      final long positionInFile) throws HeapException {
    return new HeapRecord(heapElementManager, positionInFile);
  }
View Full Code Here
TOP

Related Classes of net.sf.joafip.heapfile.record.entity.HeapRecord

  • net.sf.joafip.heapfile.record.service.HeapFreeNodeManager
  • net.sf.joafip.heapfile.record.service.HeapIdNodeManager
  • net.sf.joafip.heapfile.record.service.TestHeapElementManagerWithHeapRecord
  • net.sf.joafip.heapfile.record.service.TestHeapRecordManage
  • net.sf.joafip.heapfile.record.service.TestHeapRecordStoreRestore
  • net.sf.joafip.heapfile.record.TestIdNode
  • net.sf.joafip.heapfile.service.HeapFileDataManager
  • net.sf.joafip.heapfile.service.HeapFileDataManagerIntegrityChecker
  • net.sf.joafip.heapfile.service.HeapRecordIterator
  • net.sf.joafip.kvstore.record.entity.DataRecordIdentifier
    • 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.