Package org.entityfs.support.log

Examples of org.entityfs.support.log.LogAdapterHolder

778
779
780
781
782
783
784
785
786
787
788
    File tmpFile = FileSupport.createTempFile();
    try
    {
      ReadWritableFile f = new ReadWritableFileAdapter(tmpFile);
      byte[] barr = writeJunk(f);
      LogAdapterHolder lah = new LogAdapterHolder(new StdOutLogAdapter());
      NodeRepository<K> nr = new FileBackedNodeRepository<K, V>(f, false, f.getSize(), new NumberOfRecordsNodeSizeStrategy(2), leafNodePointers, keySerializer, valueSerializer, pointerSize, 8192, null, lah);
      if (cacheSize > 0)
      {
        nr = new LruCacheNodeRepository<K, V>(nr, cacheSize);
      }
View Full Code Here
834
835
836
837
838
839
840
841
842
843
844
  @SuppressWarnings("unchecked")
  private <K extends Comparable<K>, V> void testInsertFrom15ToOneWithTwoRecordsPerNodeInternal(NodeRepository<K> nr, ValueConverter<K> kconv, ValueConverter<V> vconv, long nonLeafNodeSize, long leafNodeSize)
  {
    NodePositions np = new NodePositions(nonLeafNodeSize, leafNodeSize, nr.getPositionOfRootNode());
    BPlusTree<K, V> btr = new BPlusTree<K, V>(nr, new LogAdapterHolder(new StdOutLogAdapter()));
    try
    {
      // *0[15, ]
      KeyAndValue<K, V> r15 = createLRecord(kconv, vconv, 15, 15);
      btr.insert(r15.getKey(), r15.getValue());
View Full Code Here
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
    File tmpFile = FileSupport.createTempFile();
    try
    {
      ReadWritableFile f = new ReadWritableFileAdapter(tmpFile);
      byte[] barr = writeJunk(f);
      NodeRepository<K> nr = new FileBackedNodeRepository<K, V>(f, false, f.getSize(), new NumberOfRecordsNodeSizeStrategy(2), leafNodePointers, keySerializer, valueSerializer, pointerSize, 8192, null, new LogAdapterHolder(new StdOutLogAdapter()));
      if (cacheSize > 0)
      {
        nr = new LruCacheNodeRepository<K, V>(nr, cacheSize);
      }
      testInsertFrom15ToOneWithTwoRecordsPerNodeInternal(nr, kconv, vconv, getNonLeafNodeSize(keySerializer.getSerializedSize(), pointerSize, 2), getLeafNodeSize(keySerializer.getSerializedSize(), valueSerializer.getSerializedSize(), pointerSize, 2, leafNodePointers));
View Full Code Here
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
  @SuppressWarnings("unchecked")
  private <K extends Comparable<K>, V> void testInsertFromOneToTenInRandomOrderWithTwoRecordsPerNodeInternal(NodeRepository<K> nr, ValueConverter<K> kconv, ValueConverter<V> vconv, long nonLeafNodeSize, long leafNodeSize)
  {
    NodePositions np = new NodePositions(nonLeafNodeSize, leafNodeSize, nr.getPositionOfRootNode());
    BPlusTree<K, V> btr = new BPlusTree<K, V>(nr, new LogAdapterHolder(new StdOutLogAdapter()));
    try
    {
      // Insert 4, 2, 3, 9, 8, 6, 5, 1, 10, 7
      // *0[4, ]
      KeyAndValue<K, V> r4 = createLRecord(kconv, vconv, 4, 4);
View Full Code Here
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
    File tmpFile = FileSupport.createTempFile();
    try
    {
      ReadWritableFile f = new ReadWritableFileAdapter(tmpFile);
      byte[] barr = writeJunk(f);
      NodeRepository<K> nr = new FileBackedNodeRepository<K, V>(f, false, f.getSize(), new NumberOfRecordsNodeSizeStrategy(2), leafNodePointers, keySerializer, valueSerializer, pointerSize, 8192, null, new LogAdapterHolder(new StdOutLogAdapter()));
      if (cacheSize > 0)
      {
        nr = new LruCacheNodeRepository<K, V>(nr, cacheSize);
      }
      testInsertFromOneToTenInRandomOrderWithTwoRecordsPerNodeInternal(nr, kconv, vconv, getNonLeafNodeSize(keySerializer.getSerializedSize(), pointerSize, 2), getLeafNodeSize(keySerializer.getSerializedSize(), valueSerializer.getSerializedSize(), pointerSize, 2, leafNodePointers));
View Full Code Here
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
  @SuppressWarnings("unchecked")
  private <K extends Comparable<K>, V> void testInsertWithTreeRecordsPerNodeInternal(NodeRepository<K> nr, ValueConverter<K> kconv, ValueConverter<V> vconv, long nonLeafNodeSize, long leafNodeSize)
  {
    NodePositions np = new NodePositions(nonLeafNodeSize, leafNodeSize, nr.getPositionOfRootNode());
    BPlusTree<K, V> btr = new BPlusTree<K, V>(nr, new LogAdapterHolder(new StdOutLogAdapter()));
    try
    {
      // Insert 5, 10, 30, 50, 25, 15, 20, 55, 75, 80, 85, 60, 65, 90,
      // 28, 70, 95, 72
View Full Code Here
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
    File tmpFile = FileSupport.createTempFile();
    try
    {
      ReadWritableFile f = new ReadWritableFileAdapter(tmpFile);
      byte[] barr = writeJunk(f);
      NodeRepository<K> nr = new FileBackedNodeRepository<K, V>(f, false, f.getSize(), new NumberOfRecordsNodeSizeStrategy(3), leafNodePointers, keySerializer, valueSerializer, pointerSize, 8192, null, new LogAdapterHolder(new StdOutLogAdapter()));
      if (cacheSize > 0)
      {
        nr = new LruCacheNodeRepository<K, V>(nr, cacheSize);
      }
      testInsertWithTreeRecordsPerNodeInternal(nr, kconv, vconv, getNonLeafNodeSize(keySerializer.getSerializedSize(), pointerSize, 3), getLeafNodeSize(keySerializer.getSerializedSize(), valueSerializer.getSerializedSize(), pointerSize, 3, leafNodePointers));
View Full Code Here
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
  }

  @SuppressWarnings("unchecked")
  private <K extends Comparable<K>, V> void testInsertWithFourRecordsPerNodeInternal(NodeRepository<K> nr, NodePositions np, ValueConverter<K> kconv, ValueConverter<V> vconv)
  {
    BPlusTree<K, V> btr = new BPlusTree<K, V>(nr, new LogAdapterHolder(new StdOutLogAdapter()));
    try
    {
      // Insert 5, 10, 30, 50, 25, 15, 20, 55, 75, 80, 85, 60, 65, 90, 73,
      // 100
      // 0[(1),25(2),50(3),75(4), ]
View Full Code Here
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
    try
    {
      ReadWritableFile f = new ReadWritableFileAdapter(tmpFile);
      byte[] barr = writeJunk(f);
      int nodeSize = new NumberOfRecordsNodeSizeStrategy(4).getNodeSize(9, 2 * LongSerializer.DATA_SIZE, 0) + 3;
      NodeRepository<Long> nr = new FileBackedNodeRepository<Long, Long>(f, false, f.getSize(), new FixedSizeNodeSizeStrategy(nodeSize), false, LongNullSerializer.INSTANCE, LongSerializer.INSTANCE, 8, 8192, null, new LogAdapterHolder(new StdOutLogAdapter()));
      testInsertWithFourRecordsPerNodeInternal(nr, new NodePositions(nodeSize, nodeSize, nr.getPositionOfRootNode()), LONG_CONVERTER, LONG_CONVERTER);
      assertJunkUntouched(f, barr);
    }
    finally
    {
View Full Code Here
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
    File tmpFile = FileSupport.createTempFile();
    try
    {
      ReadWritableFile f = new ReadWritableFileAdapter(tmpFile);
      byte[] barr = writeJunk(f);
      NodeRepository<K> nr = new FileBackedNodeRepository<K, V>(f, false, f.getSize(), new NumberOfRecordsNodeSizeStrategy(4), leafNodePointers, keySerializer, valueSerializer, pointerSize, 8192, null, new LogAdapterHolder(new StdOutLogAdapter()));
      if (cacheSize > 0)
      {
        nr = new LruCacheNodeRepository<K, V>(nr, cacheSize);
      }
      testInsertWithFourRecordsPerNodeInternal(nr, new NodePositions(getNonLeafNodeSize(keySerializer.getSerializedSize(), pointerSize, 4), getLeafNodeSize(keySerializer.getSerializedSize(), valueSerializer.getSerializedSize(), pointerSize, 4, leafNodePointers), nr.getPositionOfRootNode()), kconv, vconv);
View Full Code Here
TOP

Related Classes of org.entityfs.support.log.LogAdapterHolder

  • org.helidb.backend.bpluscrs.ConstantRecordSizeBPlusTreeBackendTest
  • org.helidb.backend.cache.lru.LruCacheBackendOnConstantRecordSizeHeapBackendTest
  • org.helidb.backend.cache.lru.LruCacheBackendOnHeapBackendTest
  • org.helidb.backend.heap.HeapBackendTest
  • org.helidb.backend.heapcrs.ConstantRecordSizeHeapBackendTest
  • org.helidb.backend.impl.map.MapBackendTest
  • org.helidb.backend.index.bplus.BPlusTreeIndexBackendOnConstantRecordSizeHeapBackendTest
  • org.helidb.backend.index.bplus.BPlusTreeIndexBackendOnHeapBackendTest
  • org.helidb.doc.ProgrammersGuideExamplesTest
  • org.helidb.impl.txn.log.LoggingTxnDbOnConstantRecordSizeBPlusTreeBackendTest
    • 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.