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

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

77
78
79
80
81
82
83
84
85
86
87
        openRecordManagerAndBtree();

        try
        {
            // Create a new BTree
            btree = recordManager.addBTree( "test", new LongSerializer(), new StringSerializer(), false );
        }
        catch ( Exception e )
        {
            throw new RuntimeException( e );
        }
View Full Code Here
847
848
849
850
851
852
853
854
855
856
857
        String name = "duplicateTree";
        String[] testValues = new String[]
            { "00", "01", "02", "03", "04", "05", "06", "07", "08", "09", "0A", "0B", "0C", "0D", "0E", "0F", "10" };

        BTree<Long, String> dupsTree = BTreeFactory.createPersistedBTree( name, new LongSerializer(),
            new StringSerializer(), pageSize, true );

        recordManager.manage( dupsTree );

        for ( long i = 0; i < numKeys; i++ )
        {
View Full Code Here
47
48
49
50
51
52
53
     * @throws IOException If the creation failed
     */
    @BeforeClass
    public static void setup() throws IOException
    {
        btree = BTreeFactory.createInMemoryBTree( "test", new LongSerializer(), new StringSerializer() );
    }
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
68
        openRecordManagerAndBtrees();

        try
        {
            // Create a new BTree with transaction and another one without
            btreeWithTransactions = recordManagerTxn.addBTree( "testWithTxn", new LongSerializer(), new StringSerializer(), false );
            btreeNoTransactions = recordManagerNoTxn.addBTree( "testNoTxn", new LongSerializer(), new StringSerializer(), false );
        }
        catch ( Exception e )
        {
            throw new RuntimeException( e );
        }
View Full Code Here
128
129
130
131
132
133
134
135
136
137
138
        long l1 = System.currentTimeMillis();
        int n = 0;
        long delta = l1;
        int nbElems = 100000;

        BTree<Long, String> btree = new BTree<Long, String>( "test", new LongSerializer(), new StringSerializer() );
        btree.setPageSize( 32 );

        for ( int i = 0; i < nbElems; i++ )
        {
            Long key = ( long ) random.nextLong();
View Full Code Here
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
    {
        // Create a BTree with pages containing 8 elements
        String path = tempFolder.getRoot().getCanonicalPath();

        BTree<Integer, String> btree = new BTree<Integer, String>( "test", path, new IntSerializer(),
            new StringSerializer() );
        btree.setPageSize( 8 );

        File journal = btree.getJournal();
        File data = btree.getFile();

        try
        {
            // Inject the values
            for ( int value : sortedValues )
            {
                String strValue = "V" + value;

                btree.insert( value, strValue );
            }

            // The journal must be full
            assertTrue( journal.length() > 0 );

            // Now, flush the btree
            btree.flush();

            // The journal must be empty
            assertEquals( 0, journal.length() );

            // Load the data into a new tree
            BTree<Integer, String> btreeLoaded = new BTree<Integer, String>( "test", path, new IntSerializer(),
                new StringSerializer() );
            btree.setPageSize( 8 );

            TupleCursor<Integer, String> cursor1 = btree.browse();
            TupleCursor<Integer, String> cursor2 = btree.browse();
View Full Code Here
290
291
292
293
294
295
296
297
298
        File dataFile = new File( data100K );
        BTree<Long, String> btree = new BTree<Long, String>(
            "test",
            dataFile.getParent(),
            new LongSerializer(),
            new StringSerializer() );
        btree.setPageSize( 32 );
        btree.close();
    }
View Full Code Here
56
57
58
59
60
61
62
63
     * Create a btree
     */
    @Before
    public void setup() throws IOException
    {
        btree = new BTree<Long, String>( "test", new LongSerializer(), new StringSerializer() );
        btree.setPageSize( 8 );
    }
View Full Code Here
169
170
171
172
173
174
175
176
177
178
179
        int nbTrees = 1000;
        int nbElems = 1000;

        for ( int j = 0; j < nbTrees; j++ )
        {
            BTree<Long, String> btree = new BTree<Long, String>( "test", new LongSerializer(), new StringSerializer() );
            btree.setPageSize( 32 );

            for ( int i = 0; i < nbElems; i++ )
            {
                Long key = ( long ) random.nextInt( 1024 );
View Full Code Here
271
272
273
274
275
276
277
278
279
280
281
        int nbTrees = 1000;
        int nbElems = 1000;

        for ( int j = 0; j < nbTrees; j++ )
        {
            BTree<Long, String> btree = new BTree<Long, String>( "test", new LongSerializer(), new StringSerializer() );
            btree.setPageSize( 8 );

            for ( int i = 0; i < nbElems; i++ )
            {
                Long key = ( long ) random.nextInt( 1024 );
View Full Code Here
TOP

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

  • org.apache.directory.mavibot.btree.BTreeConfigurationTest
  • org.apache.directory.mavibot.btree.BTreeDuplicateKeyTest
  • org.apache.directory.mavibot.btree.BTreeFlushTest
  • org.apache.directory.mavibot.btree.comparator.StringComparator
  • org.apache.directory.mavibot.btree.InMemoryBTreeConfigurationTest
  • org.apache.directory.mavibot.btree.InMemoryBTreeDuplicateKeyTest
  • org.apache.directory.mavibot.btree.InMemoryBTreeFlushTest
  • org.apache.directory.mavibot.btree.InMemoryBTreeTest
  • org.apache.directory.mavibot.btree.InMemoryBTreeTestOps
  • org.apache.directory.mavibot.btree.InMemoryLeafTest
    • 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.