* of reads and delaying a lock acquisition until the threshold is crossed or a mutation occurs.
   *
   * <p>This must be a (2^n)-1 as it is used as a mask.
   */
  static final int DRAIN_THRESHOLD = 0x3F;

  /**
   * Maximum number of entries to be drained in a single cleanup run. This applies independently to
   * the cleanup queue and both reference queues.
   */
  // TODO(fry): empirically optimize this

   * of reads and delaying a lock acquisition until the threshold is crossed or a mutation occurs.
   *
   * <p>This must be a (2^n)-1 as it is used as a mask.
   */
  static final int DRAIN_THRESHOLD = 0x3F;

  /**
   * Maximum number of entries to be drained in a single cleanup run. This applies independently to
   * the cleanup queue and both reference queues.
   */
  // TODO(fry): empirically optimize this

E,iBAAA,QACA,MAAA,KAFF,+EAOQ,MAAA,kBAPR,sEAOQ,MAAA,kBAPR,0EAOQ,MAAA,kBAPR,2EAOQ,MAAA,kBAPR,iEAOQ,MAAA,kBAPR,oD7Fo0eF,oF6FzzeU,iBAAA,QACA,aAAA,QACA,MAAA,kBAbR,qFAkBU,MAAA,QAlBV,4EAkBU,MAAA,QAlBV,gFAkBU,MAAA,QAlBV,iFAkBU,MAAA,QAlBV,uEAkBU,MAAA,QAlBV,0D7F+1eF,0F6Fz0eY,iBAAA,QACA,aAAA,kBACA,MAAA,QAxBV,8EAgCQ,MAAA,qBAhCR,qEAgCQ,MAAA,qBAhCR,yEAgCQ,MAAA,qBAhCR,0EAgCQ,MAAA,qBAhCR,gEAgCQ,MAAA,qBAhCR,mD7F03eF,mF6Ft1eU,iBAAA,QACA,aAAA,QACA,MAAA,qBAtCR,oFA2CU,MAAA,KA3CV,2EA2CU,MAAA,KA3CV,+EA2CU,MAAA,KA3CV,g...