Examples of RangeSet


Examples of org.apache.qpid.transport.RangeSet

            case 0:
                return null;
            case 1:
                return Range.newInstance(readSequenceNo(), readSequenceNo());
            default:
                RangeSet ranges = RangeSetFactory.createRangeSet(count);
                for (int i = 0; i < count; i++)
                {
                    ranges.add(readSequenceNo(), readSequenceNo());
                }
                return ranges;
        }
    }
View Full Code Here

Examples of org.apache.qpid.transport.RangeSet

     * @throws FailoverException
     */
    public void sendRecover() throws AMQException, FailoverException
    {
        // release all unacked messages
        RangeSet all = RangeSetFactory.createRangeSet();
        RangeSet delivered = gatherRangeSet(getUnacknowledgedMessageTags());
        RangeSet prefetched = gatherRangeSet(getPrefetchedMessageTags());
        for (Iterator<Range> deliveredIter = delivered.iterator(); deliveredIter.hasNext();)
        {
            Range range = deliveredIter.next();
            all.add(range);
        }
        for (Iterator<Range> prefetchedIter = prefetched.iterator(); prefetchedIter.hasNext();)
        {
            Range range = prefetchedIter.next();
            all.add(range);
        }
        flushProcessed(all, false);
View Full Code Here

Examples of org.apache.qpidity.transport.RangeSet

        //AMQP currently doesn't support server side filters, so doing client side temporarily
        if(corelationId.equals(m.getMessageProperties().getCorrelationId())){
            queue.add(m);
        }else{
            RangeSet r = new RangeSet();
            r.add(m.getMessageTransferId());
            session.messageRelease(r);
        }
    }
View Full Code Here

Examples of plotter.internal.RangeSet

    }
    long bucket = (long) ((inx.get(0) - offset) / scale);
    double nextx = (bucket + 1) * scale + offset;
    int i = 0;
    double oldy = Double.NaN;
    RangeSet r = new RangeSet();
    long bucketSize = 0;
    double firsty = Double.NaN;
    while(true) {
      double x = inx.get(i);
      double y = iny.get(i);
      if(x >= nextx) {
        double bucketx = bucket * scale + offset;
        flushBucket(output, bucketx, firsty, r, oldy, bucketSize);
        r.clear();
        bucket = (int) ((x - offset) / scale);
        nextx = (bucket + 1) * scale + offset;
        bucketSize = 0;
        firsty = y;
        if(!Double.isNaN(y)) {
          r.add(y, y);
        }
      } else {
        if(bucketSize == 0) {
          firsty = y;
        }
        if(!Double.isNaN(y)) {
          if(Double.isNaN(oldy)) {
            r.add(y, y);
          } else {
            double min, max;
            if(oldy > y) {
              max = oldy;
              min = y;
            } else {
              max = y;
              min = oldy;
            }
            r.add(min, max);
          }
        }
      }
      oldy = y;
      i++;
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.