Package org.apache.directory.mavibot.btree.serializer

Examples of org.apache.directory.mavibot.btree.serializer.IntSerializer

48
49
50
51
52
53
54
55
56
57
58
        {
            Tuple<Integer, Integer> t = new Tuple<Integer, Integer>( i, i );
            sortedTuple.add( t );
        }

        IntSerializer ser = IntSerializer.INSTANCE;
        InMemoryBTreeBuilder<Integer, Integer> bb = new InMemoryBTreeBuilder<Integer, Integer>( "master", 4, ser, ser );

        // contains 1, 2, 3, 4, 5, 6, 7
        BTree<Integer, Integer> btree = bb.build( sortedTuple.iterator() );
View Full Code Here
145
146
147
148
149
150
151
152
153
154
155

    @Test
    public void testBrowseEmptyTree() throws IOException, KeyNotFoundException, BTreeAlreadyManagedException
    {
        IntSerializer serializer = IntSerializer.INSTANCE;

        BTree<Integer, Integer> btree = BTreeFactory.createPersistedBTree( "master", serializer, serializer );
       
        // Inject the newly created BTree into teh recordManager
        recordManager1.manage( btree );
View Full Code Here
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933

    @Test
    public void testNextAfterPrev() throws Exception
    {
        IntSerializer serializer = IntSerializer.INSTANCE;

        InMemoryBTreeConfiguration<Integer, Integer> config = new InMemoryBTreeConfiguration<Integer, Integer>();
        config.setName( "master" );
        config.setPageSize( 4 );
        config.setSerializers( serializer, serializer );
View Full Code Here
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973

    @Test
    public void testCheckRootPageContents() throws Exception
    {
        IntSerializer ser = IntSerializer.INSTANCE;
        BTree<Integer, Integer> btree = BTreeFactory.createInMemoryBTree( "master1", ser, ser, 4 );

        for ( int i = 1; i < 8; i++ )
        {
            btree.insert( i, i );
View Full Code Here
613
614
615
616
617
618
619
620
621
622
623
     */
    @Test
    public void testBrowseForward() throws Exception
    {
        // Create a BTree with pages containing 8 elements
        BTree<Integer, String> btree = BTreeFactory.createInMemoryBTree( "test", new IntSerializer(),
            new StringSerializer() );
        btree.setPageSize( 8 );

        // Inject the values
        for ( int value : sortedValues )
View Full Code Here
698
699
700
701
702
703
704
705
706
707
708
     */
    @Test
    public void testBrowseBackward() throws Exception
    {
        // Create a BTree with pages containing 8 elements
        BTree<Integer, String> btree = BTreeFactory.createInMemoryBTree( "test", new IntSerializer(),
            new StringSerializer() );
        btree.setPageSize( 8 );

        // Inject the values
        for ( int value : sortedValues )
View Full Code Here
774
775
776
777
778
779
780
781
782
783
784
     */
    @Test
    public void testBrowseEmptyTree() throws Exception
    {
        // Create a BTree with pages containing 8 elements
        BTree<Integer, String> btree = BTreeFactory.createInMemoryBTree( "test", new IntSerializer(),
            new StringSerializer() );
        btree.setPageSize( 8 );

        TupleCursor<Integer, String> cursor = btree.browse();

View Full Code Here
795
796
797
798
799
800
801
802
803
804
805
     */
    @Test
    public void testBrowseForwardBackward() throws Exception
    {
        // Create a BTree with pages containing 4 elements
        BTree<Integer, String> btree = BTreeFactory.createInMemoryBTree( "test", new IntSerializer(),
            new StringSerializer() );
        btree.setPageSize( 4 );

        for ( int i = 0; i < 16; i++ )
        {
View Full Code Here
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
     */
    @Test
    public void testBrowseNonExistingKey() throws Exception
    {
        // Create a BTree with pages containing 8 elements
        BTree<Integer, String> btree = BTreeFactory.createInMemoryBTree( "test", new IntSerializer(),
            new StringSerializer() );
        btree.setPageSize( 8 );
        for ( int i = 0; i < 11; i++ )
        {
            btree.insert( i, String.valueOf( i ) );
View Full Code Here
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
    /**
     * Creates a 2 level depth tree of full pages
     */
    private BTree<Integer, String> createTwoLevelBTreeFullLeaves() throws IOException
    {
        BTree<Integer, String> btree = BTreeFactory.createInMemoryBTree( "test", new IntSerializer(),
            new StringSerializer() );
        btree.setPageSize( 4 );

        // Create a tree with 5 children containing 4 elements each. The tree is full.
        int[] keys = new int[]
View Full Code Here
TOP

Related Classes of org.apache.directory.mavibot.btree.serializer.IntSerializer

  • org.apache.directory.mavibot.btree.BTreeBuilderTest
  • org.apache.directory.mavibot.btree.BTreeConfigurationTest
  • org.apache.directory.mavibot.btree.BTreeDuplicateKeyTest
  • org.apache.directory.mavibot.btree.BTreeFlushTest
  • org.apache.directory.mavibot.btree.comparator.IntComparator
  • org.apache.directory.mavibot.btree.InMemoryBTreeBuilderTest
  • org.apache.directory.mavibot.btree.InMemoryBTreeConfigurationTest
  • org.apache.directory.mavibot.btree.InMemoryBTreeDuplicateKeyTest
  • org.apache.directory.mavibot.btree.InMemoryBTreeFlushTest
  • org.apache.directory.mavibot.btree.InMemoryBTreeTest
    • 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.