Package jdbm.helper

Examples of jdbm.helper.Tuple

82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
    public void loadPreparedTransactions(TransactionManager transactionManager) throws XAException {
        log.info("Recovering prepared transactions");

        try {
            Tuple tuple = new Tuple();
            TupleBrowser iter = database.browse();
            while (iter.getNext(tuple)) {
                ActiveMQXid xid = (ActiveMQXid) tuple.getKey();
                Transaction transaction = (Transaction) tuple.getValue();
                transactionManager.loadTransaction(xid, transaction);
            }
        }
        catch (IOException e) {
            log.error("Failed to recover prepared transactions: " + e, e);
View Full Code Here
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
         }
      }

      // 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
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
         }
      }

      // 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 > timeService.wallClockTime())
            break;
         times.add(time);
         Object key = tuple.getValue();
         if (key instanceof List)
            keys.addAll((List<?>) key);
         else
            keys.add(key);
      }
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
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
         }
         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
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
         log.trace("erase " + name + " self=" + self);
      }
      synchronized (tree)
      {
         TupleBrowser browser = tree.browse(name);
         Tuple t = new Tuple();
         if (browser.getNext(t) && self)
         {
            tree.remove(t.getKey());
         }

         while (browser.getNext(t))
         {
            Fqn fqn = (Fqn) t.getKey();
            if (!fqn.isChildOf(name))
            {
               break;
            }
            tree.remove(fqn);
View Full Code Here
697
698
699
700
701
702
703
704
705
706
707
708
709
    * 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
39
40
41
42
43
44
45
46
47
48
49
50
51
        table.insert(new Long(124), "BAR", true);
        table.insert(new Long(125), "XYZ", true);
        table.insert(new Long(126), "ABC", true);
        table.insert(new Long(127), "DEF", true);

        Tuple tuple = new Tuple();
        TupleBrowser iter = table.browse();
        while (iter.getNext(tuple)) {
            Object key = tuple.getKey();
            System.out.println("Key " + key);
        }
        manager.stop();
    }
View Full Code Here
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
            Object lastAckedSequenceNumber = lastAcked.getSequenceNumber();

            // lets iterate through all IDs from the

            //Tuple tuple = new Tuple();
            Tuple tuple = getOrderedIndex().findGreaterOrEqual(lastAckedSequenceNumber);

            TupleBrowser iter = getOrderedIndex().browse();
            while (iter.getNext(tuple)) {
                Long sequenceNumber = (Long) tuple.getKey();
                if (sequenceNumber.compareTo(lastAckedSequenceNumber) > 0) {
                    ActiveMQMessage message = null;

                    // TODO we could probably tune this some more since we have tuple.getValue() already
                    message = getMessageBySequenceNumber(sequenceNumber);
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
        }
    }

    public synchronized void recover(RecoveryListener listener) throws JMSException {
        try {
            Tuple tuple = new Tuple();
            TupleBrowser iter = getOrderedIndex().browse();
            while (iter.getNext(tuple)) {
                Long key = (Long) tuple.getKey();
                MessageIdentity messageIdentity = null;
                if (key != null) {
                    String messageID = (String) tuple.getValue();
                    if (messageID != null) {
                        messageIdentity = new MessageIdentity(messageID, key);
                    }
                }
                if (messageIdentity != null) {
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.