Package org.entityfs.util.io

Examples of org.entityfs.util.io.ReadWritableFileAdapter

2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
  private <K extends Comparable<K>, V> void testInsertWithFourRecordsPerNodeInternal(Serializer<K> keySerializer, ValueConverter<K> kconv, Serializer<V> valueSerializer, ValueConverter<V> vconv, int cacheSize, int pointerSize, boolean leafNodePointers)
  {
    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
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
  public void testInsertDuplicateKey()
  {
    File tmpFile = FileSupport.createTempFile();
    try
    {
      ReadWritableFile f = new ReadWritableFileAdapter(tmpFile);
      byte[] barr = writeJunk(f);
      LogAdapterHolder lah = new LogAdapterHolder(new StdOutLogAdapter());
      NodeRepository<Long> nr = new FileBackedNodeRepository<Long, Long>(f, false, f.getSize(), new NumberOfRecordsNodeSizeStrategy(2), false, LongNullSerializer.INSTANCE, LongSerializer.INSTANCE, 8, 8192, null, lah);
      BPlusTree<Long, Long> btr = new BPlusTree<Long, Long>(nr, lah);
      try
      {
        btr.insert(2L, 3L);
        try
View Full Code Here
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
  public void testInsertOrReplace()
  {
    File tmpFile = FileSupport.createTempFile();
    try
    {
      ReadWritableFile f = new ReadWritableFileAdapter(tmpFile);
      byte[] barr = writeJunk(f);
      LogAdapterHolder lah = new LogAdapterHolder(new StdOutLogAdapter());
      NodeRepository<Long> nr = new FileBackedNodeRepository<Long, Long>(f, false, f.getSize(), new NumberOfRecordsNodeSizeStrategy(2), false, LongNullSerializer.INSTANCE, LongSerializer.INSTANCE, 8, 8192, null, lah);
      BPlusTree<Long, Long> btr = new BPlusTree<Long, Long>(nr, lah);
      try
      {
        assertFalse(btr.insertOrReplace(2L, 3L));
        assertTrue(btr.insertOrReplace(2L, 4L));
View Full Code Here
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
  private <V> void testFindKeyInternal(Serializer<Character> keySerializer, ValueConverter<Character> kconv, Serializer<V> valueSerializer, ValueConverter<V> vconv, int cacheSize, int pointerSize, boolean leafNodePointers)
  {
    File tmpFile = FileSupport.createTempFile();
    try
    {
      ReadWritableFile f = new ReadWritableFileAdapter(tmpFile);
      byte[] barr = writeJunk(f);
      NodeRepository<Character> nr = new FileBackedNodeRepository<Character, V>(f, false, f.getSize(), new NumberOfRecordsNodeSizeStrategy(4), leafNodePointers, keySerializer, valueSerializer, pointerSize, 8192, null, new LogAdapterHolder(new StdOutLogAdapter()));
      if (cacheSize > 0)
      {
        nr = new LruCacheNodeRepository<Character, V>(nr, cacheSize);
      }
      testFindKeyInternal(nr, kconv, vconv);
View Full Code Here
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
  private <K extends Comparable<K>, V> void testReplaceInNodeInternal(Serializer<K> keySerializer, ValueConverter<K> kconv, Serializer<V> valueSerializer, ValueConverter<V> vconv, int cacheSize, int pointerSize, boolean leafNodePointers)
  {
    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);
      }
      testReplaceInNodeInternal(nr, kconv, vconv);
View Full Code Here
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
  public void testReplaceInNodeWithTooBigNodeSize()
  {
    File tmpFile = FileSupport.createTempFile();
    try
    {
      ReadWritableFile f = new ReadWritableFileAdapter(tmpFile);
      byte[] barr = writeJunk(f);
      NodeRepository<Long> nr = new FileBackedNodeRepository<Long, Long>(f, false, f.getSize(), new FixedSizeNodeSizeStrategy(new NumberOfRecordsNodeSizeStrategy(4).getNodeSize(9, 16, 0) + 3), false, LongNullSerializer.INSTANCE, LongSerializer.INSTANCE, 8, 8192, null, new LogAdapterHolder(new StdOutLogAdapter()));
      testReplaceInNodeInternal(nr, LONG_CONVERTER, LONG_CONVERTER);
      assertJunkUntouched(f, barr);
    }
    finally
    {
View Full Code Here
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
  public void testReplaceWhenKeyNotFound()
  {
    File tmpFile = FileSupport.createTempFile();
    try
    {
      ReadWritableFile f = new ReadWritableFileAdapter(tmpFile);
      byte[] barr = writeJunk(f);
      LogAdapterHolder lah = new LogAdapterHolder(new StdOutLogAdapter());
      NodeRepository<Long> nr = new FileBackedNodeRepository<Long, Long>(f, false, f.getSize(), new NumberOfRecordsNodeSizeStrategy(2), false, LongNullSerializer.INSTANCE, LongSerializer.INSTANCE, 8, 8192, null, lah);
      BPlusTree<Long, Long> btr = new BPlusTree<Long, Long>(nr, lah);
      try
      {
        btr.replace(2L, 2L);
        fail();
View Full Code Here
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
  public void testStealThreeLeafRecordsFromNodeToTheRightWithTooBigNodeSize()
  {
    File tmpFile = FileSupport.createTempFile();
    try
    {
      ReadWritableFile f = new ReadWritableFileAdapter(tmpFile);
      byte[] barr = writeJunk(f);
      // 12 records per node
      int nodeSize = new NumberOfRecordsNodeSizeStrategy(12).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()));
      testStealThreeLeafRecordsFromNodeToTheRightInternal(nr, new NodePositions(nodeSize, nodeSize, nr.getPositionOfRootNode()), LONG_CONVERTER, LONG_CONVERTER);
      assertJunkUntouched(f, barr);
    }
    finally
    {
View Full Code Here
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
  private <K extends Comparable<K>, V> void testStealThreeLeafRecordsFromNodeToTheRightInternal(Serializer<K> keySerializer, ValueConverter<K> kconv, Serializer<V> valueSerializer, ValueConverter<V> vconv, int cacheSize, int pointerSize, boolean leafNodePointers)
  {
    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(12), leafNodePointers, keySerializer, valueSerializer, pointerSize, 8192, null, new LogAdapterHolder(new StdOutLogAdapter()));
      if (cacheSize > 0)
      {
        nr = new LruCacheNodeRepository<K, V>(nr, cacheSize);
      }
      testStealThreeLeafRecordsFromNodeToTheRightInternal(nr, new NodePositions(getNonLeafNodeSize(keySerializer.getSerializedSize(), pointerSize, 12), getLeafNodeSize(keySerializer.getSerializedSize(), valueSerializer.getSerializedSize(), pointerSize, 12, leafNodePointers), nr.getPositionOfRootNode()), kconv, vconv);
View Full Code Here
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
  private <K extends Comparable<K>, V> void testStealThreeLeafRecordsFromNodeToTheLeftInternal(Serializer<K> keySerializer, ValueConverter<K> kconv, Serializer<V> valueSerializer, ValueConverter<V> vconv, int cacheSize, int pointerSize, boolean leafNodePointers)
  {
    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(12), leafNodePointers, keySerializer, valueSerializer, pointerSize, 8192, null, new LogAdapterHolder(new StdOutLogAdapter()));
      if (cacheSize > 0)
      {
        nr = new LruCacheNodeRepository<K, V>(nr, cacheSize);
      }
      testStealThreeLeafRecordsFromNodeToTheLeftInternal(nr, new NodePositions(getNonLeafNodeSize(keySerializer.getSerializedSize(), pointerSize, 12), getLeafNodeSize(keySerializer.getSerializedSize(), valueSerializer.getSerializedSize(), pointerSize, 12, leafNodePointers), nr.getPositionOfRootNode()), kconv, vconv);
View Full Code Here
TOP

Related Classes of org.entityfs.util.io.ReadWritableFileAdapter

  • org.helidb.backend.AbstractConstantRecordSizeBackendTest
  • org.helidb.backend.AbstractVariableRecordSizeBackendTest
  • 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.index.bplus.BPlusTreeIndexBackendOnConstantRecordSizeHeapBackendTest
  • org.helidb.backend.index.bplus.BPlusTreeIndexBackendOnHeapBackendTest
  • org.helidb.doc.ProgrammersGuideExamplesTest
    • 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.