List of offer() Examples

Examples of offer()

EDU.oswego.cs.dl.util.concurrent.Slot.offer()
com.alibaba.otter.shared.arbitrate.impl.setl.helper.ReplyProcessQueue.offer()
com.browseengine.bobo.util.IntBoundedPriorityQueue.offer()
When the queue is full, the offered elements are added if they are bigger than the smallest one already in the queue.
Inserts the specified element into this queue, if possible. When using queues that may impose insertion restrictions (for example capacity bounds), method offer is generally preferable to method Collection.add, which can fail to insert an element only by throwing an exception. @see java.util.Queue#offer(java.lang.Object)
com.clearspring.analytics.stream.cardinality.ICardinality.offer()
@param o stream element @return false if the value returned by cardinality() is unaffected by the appearance of o in the stream.
com.clearspring.analytics.stream.quantile.QDigest.offer()
com.dianping.cat.message.io.DefaultMessageQueue.offer()
com.dianping.cat.message.spi.MessageQueue.offer()
com.hazelcast.core.IQueue.offer()
{@inheritDoc}
com.hazelcast.core.TransactionalQueue.offer()
{@inheritDoc}
com.hazelcast.queue.impl.QueueContainer.offer()
com.llfix.util.DiskQueue.offer()
com.netflix.suro.queue.FileQueue4Sink.offer()
com.netflix.suro.queue.MemoryQueue4Sink.offer()
edu.emory.mathcs.backport.java.util.concurrent.BlockingQueue.offer()
Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions, returning true upon success and false if no space is currently available. When using a capacity-restricted queue, this method is generally preferable to {@link #add}, which can fail to insert an element only by throwing an exception. @param e the element to add @return true if the element was added to this queue, elsefalse @throws ClassCastException if the class of the specified elementprevents it from being added to this queue @throws NullPointerException if the specified element is null @throws IllegalArgumentException if some property of the specifiedelement prevents it from being added to this queue
io.druid.query.aggregation.Histogram.offer()
io.netty.handler.codec.http.CookieDecoder.offer()
io.netty.handler.codec.http.multipart.HttpPostRequestDecoder.offer()
Initialized the internals from a new chunk @param content the new received chunk @throws ErrorDataDecoderException if there is a problem with the charset decoding or other errors
java.util.LinkedList.offer()
Adds the specified element as the tail (last element) of this list. @param e the element to add @return true (as specified by {@link Queue#offer}) @since 1.5
java.util.Queue.offer()
Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions. When using a capacity-restricted queue, this method is generally preferable to {@link #add}, which can fail to insert an element only by throwing an exception. @param e the element to add @return true if the element was added to this queue, elsefalse @throws ClassCastException if the class of the specified elementprevents it from being added to this queue @throws NullPointerException if the specified element is null andthis queue does not permit null elements @throws IllegalArgumentException if some property of this elementprevents it from being added to this queue
java.util.concurrent.ArrayBlockingQueue.offer()
Inserts the specified element at the tail of this queue if it is possible to do so immediately without exceeding the queue's capacity, returning {@code true} upon success and {@code false} if this queueis full. This method is generally preferable to method {@link #add}, which can fail to insert an element only by throwing an exception. @throws NullPointerException if the specified element is null
java.util.concurrent.BlockingQueue.offer()
Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions, returning {@code true} upon success and {@code false} if no space is currentlyavailable. When using a capacity-restricted queue, this method is generally preferable to {@link #add}, which can fail to insert an element only by throwing an exception. @param e the element to add @return {@code true} if the element was added to this queue, else{@code false} @throws ClassCastException if the class of the specified elementprevents it from being added to this queue @throws NullPointerException if the specified element is null @throws IllegalArgumentException if some property of the specifiedelement prevents it from being added to this queue
java.util.concurrent.LinkedBlockingQueue.offer()
Inserts the specified element at the tail of this queue, waiting if necessary up to the specified wait time for space to become available. @return {@code true} if successful, or {@code false} ifthe specified waiting time elapses before space is available @throws InterruptedException {@inheritDoc} @throws NullPointerException {@inheritDoc}
net.openhft.chronicle.sandbox.queue.LocalConcurrentBlockingObjectQueue.offer()
net.openhft.chronicle.sandbox.queue.SharedConcurrentBlockingObjectQueue.offer()
org.apache.mina.core.write.WriteRequestQueue.offer()
org.apache.qpid.proton.engine.Sender.offer()
indicates pending deliveries @param credits the number of pending deliveries @todo is this absolute or cumulative?
org.apache.synapse.message.store.MessageStore.offer()
Inserts the Message into this store if it is possible to do so immediately without violating capacity restrictions. @param messageContext MessageContext to be saved
org.eclipse.jetty.client.util.DeferredContentProvider.offer()
Adds the given content buffer to this content provider and notifies the listener that content is available. @param buffer the content to add @return true if the content was added, false otherwise
org.jboss.netty.handler.codec.http.CookieDecoder.offer()
org.mule.util.queue.Queue.offer()

Examples of EDU.oswego.cs.dl.util.concurrent.Slot.offer()

        
        final MessageListener bean = new MessageListener() {
            public void onMessage(Message message) {
                System.out.println(message);
                try {
                    messageSlot.offer(message, 1000);
                } catch (InterruptedException e) {
                }
            }            
        };

View Full Code Here

Examples of com.alibaba.otter.shared.arbitrate.impl.setl.helper.ReplyProcessQueue.offer()

        // 第一次/出现ROLLBACK/RESTART事件，删除了所有调度信号后，重新初始化一下select stage的数据，初始大小为并行度大小
        // 后续的select的reply队列变化，由load single时直接添加
        ReplyProcessQueue queue = replys.get(StageType.SELECT);
        int parallelism = ArbitrateConfigUtils.getParallelism(getPipelineId());
        while (parallelism-- > 0 && queue.size() <= parallelism) {
            queue.offer(atomicMaxProcessId.incrementAndGet());
        }
    }


    /**
     * 计算下一个load的processId

View Full Code Here

Examples of com.browseengine.bobo.util.IntBoundedPriorityQueue.offer()

          for (int i=1;i<countlength;++i)
          {
            int hits=count.get(i);
            if (hits>=minCount)
            {
              pq.offer(i);
            }
          }


          int val;
          while((val = pq.pollInt()) != forbidden)

View Full Code Here

Examples of com.browseengine.bobo.util.IntBoundedPriorityQueue.offer()

          for (int i=1;i<_countlength;++i) // exclude zero
          {
            int hits=_count.get(i);
            if (hits>=minCount)
            {
              if(!pq.offer(i))
              {
                // pq is full. we can safely ignore any facet with <=hits.
                minCount = hits + 1;
              }
            }

View Full Code Here

Examples of com.browseengine.bobo.util.IntBoundedPriorityQueue.offer()

          
          final int forbidden = -1;
          IntBoundedPriorityQueue pq=new IntBoundedPriorityQueue(comparator, maxNumOfFacets, forbidden);
          for (int i=0; i<_predefinedRangeIndexes.length; ++i)
          {
            if (rangeCount.get(i)>=minCount)   pq.offer(i);
          }


          int val;
          facetColl=new LinkedList<BrowseFacet>();
          while((val = pq.pollInt()) != forbidden)

View Full Code Here

Examples of com.browseengine.bobo.util.IntBoundedPriorityQueue.offer()

          for (int i=1;i<countlength;++i)
          {
            int hits=count[i];
            if (hits>=minCount)
            {
              pq.offer(i);
            }
          }


          int val;
          while((val = pq.pollInt()) != forbidden)

View Full Code Here

Examples of com.browseengine.bobo.util.IntBoundedPriorityQueue.offer()

          
          final int forbidden = -1;
          IntBoundedPriorityQueue pq=new IntBoundedPriorityQueue(comparator, maxNumOfFacets, forbidden);
          for (int i=0; i<_predefinedRangeIndexes.length; ++i)
          {
            if (rangeCount[i]>=minCount)   pq.offer(i);
          }


          int val;
          facetColl=new LinkedList<BrowseFacet>();
          while((val = pq.pollInt()) != forbidden)

View Full Code Here

Examples of com.browseengine.bobo.util.IntBoundedPriorityQueue.offer()

          for (int i=1;i<_countlength;++i) // exclude zero
          {
            int hits=_count[i];
            if (hits>=minCount)
            {
              if(!pq.offer(i))
              {
                // pq is full. we can safely ignore any facet with <=hits.
                minCount = hits + 1;
              }
            }

View Full Code Here

Examples of com.clearspring.analytics.stream.cardinality.ICardinality.offer()

        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));


        String line = null;
        while((line = in.readLine()) != null)
        {            
            card.offer(line);
            count++;
            
            if(updateRate > 0 && count % updateRate == 0)
            {
                System.out.println(formatSummary(count, card.cardinality()));

View Full Code Here

Examples of com.clearspring.analytics.stream.quantile.QDigest.offer()

            TreeDigest dist = new TreeDigest(compression);
            List<Double> data = Lists.newArrayList();
            for (int i = 0; i < 100000; i++) {
                double x = gen.nextDouble();
                dist.add(x);
                qd.offer((long) (x * scale));
                data.add(x);
            }
            dist.compress();
            Collections.sort(data);

View Full Code Here

0 1 2 3 4 5 6

TOP

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.