Package jdbm.helper

Examples of jdbm.helper.Tuple

354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
    * keys' expiry has not changed.
    * @throws ClassNotFoundException
    */
   private void purgeInternal0() throws Exception {
      TupleBrowser browse = expiryTree.browse();
      Tuple tuple = new Tuple();
      List<Long> times = new ArrayList<Long>();
      List<Object> keys = new ArrayList<Object>();
      synchronized (expiryLock) {
         while (browse.getNext(tuple)) {
            Long time = (Long) tuple.getKey();
            if (time > System.currentTimeMillis())
               break;
            times.add(time);
            Object key = tuple.getValue();
            if (key instanceof List)
               keys.addAll((List) key);
            else
               keys.add(key);
         }
View Full Code Here
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
         }
      }

      // Browse the expiry and remove accordingly
      TupleBrowser browse = expiryTree.browse();
      Tuple tuple = new Tuple();
      List<Long> times = new ArrayList<Long>();
      List<Object> keys = new ArrayList<Object>();
      while (browse.getNext(tuple)) {
         Long time = (Long) tuple.getKey();
         if (time > System.currentTimeMillis())
            break;
         times.add(time);
         Object key = tuple.getValue();
         if (key instanceof List)
            keys.addAll((List) key);
         else
            keys.add(key);
      }
View Full Code Here
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
         }
      }

      // Browse the expiry and remove accordingly
      TupleBrowser browse = expiryTree.browse();
      Tuple tuple = new Tuple();
      List<Long> times = new ArrayList<Long>();
      List<Object> keys = new ArrayList<Object>();
      while (browse.getNext(tuple)) {
         Long time = (Long) tuple.getKey();
         if (time > System.currentTimeMillis())
            break;
         times.add(time);
         Object key = tuple.getValue();
         if (key instanceof List)
            keys.addAll((List) key);
         else
            keys.add(key);
      }
View Full Code Here
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
   @Override
   Set<Object> getChildrenNames0(Fqn name) throws IOException
   {
      Fqn name2 = withDepth(name, name.size() + 1);
      TupleBrowser browser = tree.browse(name2);
      Tuple t = new Tuple();

      Set<Object> set = new HashSet<Object>();

      while (browser.getNext(t))
      {
         Fqn fqn = (Fqn) t.getKey();
         if (!fqn.isChildOf(name2))
         {
            break;
         }
         set.add(fqn.getLastElement());
View Full Code Here
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
   }

   Set<Object> getChildrenNames0(Fqn name) throws IOException
   {
      TupleBrowser browser = tree.browse(name);
      Tuple t = new Tuple();

      if (browser.getNext(t))
      {
         if (!t.getValue().equals(NODE))
         {
            log.trace(" not a node");
            return null;
         }
      }
      else
      {
         log.trace(" no nodes");
         return null;
      }

      Set<Object> set = new HashSet<Object>();

      // Want only /a/b/c/X nodes
      int depth = name.size() + 1;
      while (browser.getNext(t))
      {
         Fqn fqn = (Fqn) t.getKey();
         int size = fqn.size();
         if (size < depth)
         {
            break;
         }
         if (size == depth && t.getValue().equals(NODE))
         {
            set.add(fqn.getLastElement());
         }
      }
View Full Code Here
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
         }
         return null;
      }

      Fqn keys = keys(name);
      Tuple t = new Tuple();
      Map map = new HashMap();

      synchronized (tree)
      {
         TupleBrowser browser = tree.browse(keys);
         while (browser.getNext(t))
         {
            Fqn fqn = (Fqn) t.getKey();
            if (!fqn.isChildOf(keys))
            {
               break;
            }
            Object k = fqn.getLastElement();
            Object v = t.getValue();
            map.put(nullUnmask(k), nullUnmask(v));
         }
      }

      if (trace)
View Full Code Here
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
      {
         return;
      }
     
      Fqn keys = keys(name);
      Tuple t = new Tuple();
      List<Object> removeList = new ArrayList<Object>();
      synchronized (tree)
      {
         TupleBrowser browser = tree.browse(keys);
         while (browser.getNext(t))
         {
            Fqn fqn = (Fqn) t.getKey();
            if (!fqn.isChildOf(keys))
            {
               break;
            }
            Object k = fqn.getLastElement();
View Full Code Here
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
      }
      List<Object> removeList = new ArrayList<Object>();
      synchronized (tree)
      {
         TupleBrowser browser = tree.browse(name);
         Tuple t = new Tuple();
         boolean first = true;
         while (browser.getNext(t))
         {
          if (first && !self)
          {
             first = false;
             continue;
          }
            Fqn fqn = (Fqn) t.getKey();
            if (!fqn.isChildOrEquals(name))
            {
               break;
            }
            removeList.add(fqn);
View Full Code Here
730
731
732
733
734
735
736
737
738
739
740
741
742
    * Dumps the tree past the key to debug.
    */
   public void dump(Object key) throws IOException
   {
      TupleBrowser browser = tree.browse(key);
      Tuple t = new Tuple();
      log.debug("contents: " + key);
      while (browser.getNext(t))
      {
         log.debug(t.getKey() + "\t" + t.getValue());
      }
      log.debug("");
   }
View Full Code Here
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
   }

   private Set<Object> getChildrenNames0(Fqn name) throws IOException
   {
      TupleBrowser browser = tree.browse(name);
      Tuple t = new Tuple();

      if (browser.getNext(t))
      {
         if (!t.getValue().equals(NODE))
         {
            log.trace(" not a node");
            return null;
         }
      }
      else
      {
         log.trace(" no nodes");
         return null;
      }

      Set<Object> set = new HashSet<Object>();

      // Want only /a/b/c/X nodes
      int depth = name.size() + 1;
      while (browser.getNext(t))
      {
         Fqn fqn = (Fqn) t.getKey();
         int size = fqn.size();
         if (size < depth)
         {
            break;
         }
         if (size == depth && t.getValue().equals(NODE))
         {
            set.add(fqn.getLastElement());
         }
      }
View Full Code Here
TOP

Related Classes of jdbm.helper.Tuple

  • FamousPeople
  • jdbm.btree.BTree
  • jdbm.btree.TestBPage
  • jdbm.btree.TestBTree
  • org.activemq.store.jdbm.JdbmMessageStore
  • org.activemq.store.jdbm.JdbmTopicMessageStore
  • org.activemq.store.jdbm.OrderTest
  • org.apache.directory.server.core.partition.impl.btree.jdbm.JdbmBrowserBugTest
  • org.apache.directory.server.core.partition.impl.btree.jdbm.KeyBTreeCursorTest
  • org.apache.directory.server.core.partition.impl.btree.jdbm.KeyCursorTest
    • 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.