View Javadoc
1   /*
2    *   Licensed to the Apache Software Foundation (ASF) under one
3    *   or more contributor license agreements.  See the NOTICE file
4    *   distributed with this work for additional information
5    *   regarding copyright ownership.  The ASF licenses this file
6    *   to you under the Apache License, Version 2.0 (the
7    *   "License"); you may not use this file except in compliance
8    *   with the License.  You may obtain a copy of the License at
9    *
10   *     http://www.apache.org/licenses/LICENSE-2.0
11   *
12   *   Unless required by applicable law or agreed to in writing,
13   *   software distributed under the License is distributed on an
14   *   "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
15   *   KIND, either express or implied.  See the License for the
16   *   specific language governing permissions and limitations
17   *   under the License.
18   *
19   */
20  
21  package org.apache.directory.mavibot.btree;
22  
23  
24  import static org.junit.Assert.assertEquals;
25  
26  import java.io.IOException;
27  import java.util.ArrayList;
28  import java.util.List;
29  
30  import org.apache.directory.mavibot.btree.exception.KeyNotFoundException;
31  import org.apache.directory.mavibot.btree.serializer.IntSerializer;
32  import org.junit.Ignore;
33  import org.junit.Test;
34  
35  
36  /**
37   * Test cases for BTreeBuilder.
38   *
39   * @author <a href="mailto:dev@directory.apache.org">Apache Directory Project</a>
40   */
41  public class InMemoryBTreeBuilderTest
42  {
43      @Test
44      @Ignore
45      public void testIntegerTree() throws IOException, KeyNotFoundException
46      {
47          List<Tuple<Integer, Integer>> sortedTuple = new ArrayList<Tuple<Integer, Integer>>();
48  
49          for ( int i = 1; i < 8; i++ )
50          {
51              Tuple<Integer, Integer> t = new Tuple<Integer, Integer>( i, i );
52              sortedTuple.add( t );
53          }
54  
55          IntSerializer ser = IntSerializer.INSTANCE;
56          InMemoryBTreeBuilder<Integer, Integer> bb = new InMemoryBTreeBuilder<Integer, Integer>( "master", 4, ser, ser );
57  
58          // contains 1, 2, 3, 4, 5, 6, 7
59          BTree<Integer, Integer> btree = bb.build( sortedTuple.iterator() );
60  
61          assertEquals( 1, btree.getRootPage().getNbElems() );
62  
63          assertEquals( 7, btree.getRootPage().findRightMost().getKey().intValue() );
64  
65          assertEquals( 1, btree.getRootPage().findLeftMost().getKey().intValue() );
66  
67          TupleCursor<Integer, Integer> cursor = btree.browse();
68          int i = 0;
69  
70          while ( cursor.hasNext() )
71          {
72              Tuple<Integer, Integer> expected = sortedTuple.get( i++ );
73              Tuple<Integer, Integer> actual = cursor.next();
74              assertEquals( expected.getKey(), actual.getKey() );
75              assertEquals( expected.getValue(), actual.getValue() );
76          }
77  
78          cursor.close();
79          btree.close();
80      }
81  
82  }