randomstatistic

public class FixedBitSetPool {

  public static final int poolSize = 10;
  private static ArrayBlockingQueue<FixedBitSet> pool = new ArrayBlockingQueue<FixedBitSet>(poolSize);

  // Ask for a FBS
  public static FixedBitSet request(int size) {
    FixedBitSet next = pool.poll();
    if (next == null || next.length() < size) {
      // if the size doesn't match, throw it away and return a new one of the requested size

randomstatistic

This was against a pretty specific index, using a very specialized query corpus, with lots of caveats. Be careful about comparisions.
Index stats: 85M docs/shard, 3 shards, 1 node.
Query stats: 142k queries. 78k use a simple facet.query, 27k do geospatial radius, 115 use CollapseQParser

CollapsingQParserPlugin: 
  22% of garbage by size 
  These were huge, perhaps a half-dozen allocations
  Lines 510,512 CollapsingQParserPlugin
SolrIndexSearcher: (getDocListAndSetNC)
  56% of garbage by size

randomstatistic

import java.util.concurrent.{TimeUnit, LinkedBlockingQueue}

import scala.annotation.tailrec
import scala.collection.JavaConverters._
import scala.concurrent.Future

/**
 * Thread-safe lock on Future generation. The put() method accepts futures without blocking so long as there are less than
 * $size futures that have been added via put() that are still alive. If more than $size futures are still running,
 * calling put() *blocks* the calling thread until some of the current futures finish.

randomstatistic

for x in `seq 1 20`; do strace -f -tt -o /tmp/st dig
www.google.com > /dev/null && grep -P '(send|recv)msg\(20'
/tmp/st | grep -v EAGAIN | awk '/sendmsg/ {f= substr($2,7)} /recvmsg/
{e= substr($2,7)} END {print e-f}'; done | sort -n