}

  /**
   * Returns the number of bytes currently being used to store the values in this cache. This may be
   * greater than the max size if a background deletion is pending.
   */
  @Synchronized
  @Throws(IOException::class)
  fun size(): Long {
    initialize()
    return size
  }

  @Synchronized
  @Throws(IOException::class)
  internal fun completeEdit(
    editor: Editor,
    success: Boolean,

HSPLkotlinx/coroutines/internal/LockFreeTaskQueue;-><init>(Z)V
HSPLkotlinx/coroutines/internal/LockFreeTaskQueue;->addLast(Ljava/lang/Object;)Z
HSPLkotlinx/coroutines/internal/LockFreeTaskQueue;->getSize()I
HSPLkotlinx/coroutines/internal/LockFreeTaskQueue;->removeFirstOrNull()Ljava/lang/Object;
HSPLkotlinx/coroutines/internal/LockFreeTaskQueueCore;-><clinit>()V
HSPLkotlinx/coroutines/internal/LockFreeTaskQueueCore;-><init>(IZ)V

  static int chooseTableSize(int setSize) {
    setSize = max(setSize, 2);
    // Correct the size for open addressing to match desired load factor.
    if (setSize < CUTOFF) {
      // Round up to the next highest power of 2.
      int tableSize = Integer.highestOneBit(setSize - 1) << 1;
      while (tableSize * DESIRED_LOAD_FACTOR < setSize) {
        tableSize <<= 1;
      }
      return tableSize;

  * We have renamed “minions” to “nodes”.  If you were specifying NUM\_MINIONS or
MINION\_SIZE to kube-up, you should now specify NUM\_NODES or NODE\_SIZE.

### Known Issues

  * Paused deployments can't be resized and don't clean up old ReplicaSets.
  * Minimum memory limit is 4MB. This is a docker limitation
  * Minimum CPU limits is 10m. This is a Linux Kernel limitation

After the symbol, the arguments are flags (see below)
and the frame size, a constant (but see below):
</p>

<pre>
TEXT runtime·profileloop(SB),NOSPLIT,$8
	MOVQ	$runtime·profileloop1(SB), CX
	MOVQ	CX, 0(SP)
	CALL	runtime·externalthreadhandler(SB)
	RET
</pre>

<p>
In the general case, the frame size is followed by an argument size, separated by a minus sign.
(It's not a subtraction, just idiosyncratic syntax.)

    if (expectedSize < Ints.MAX_POWER_OF_TWO) {
      // This seems to be consistent across JDKs. The capacity argument to HashMap and LinkedHashMap
      // ends up being used to compute a "threshold" size, beyond which the internal table
      // will be resized. That threshold is ceilingPowerOfTwo(capacity*loadFactor), where
      // loadFactor is 0.75 by default. So with the calculation here we ensure that the

    if (expectedSize < Ints.MAX_POWER_OF_TWO) {
      // This seems to be consistent across JDKs. The capacity argument to HashMap and LinkedHashMap
      // ends up being used to compute a "threshold" size, beyond which the internal table
      // will be resized. That threshold is ceilingPowerOfTwo(capacity*loadFactor), where
      // loadFactor is 0.75 by default. So with the calculation here we ensure that the

FastMap$EntryImpl _poolFirst; private transient FastMap$EntryImpl _mapFirst; private transient FastMap$EntryImpl _mapLast; private transient int _size; private transient FastMap$Values _values; private transient FastMap$EntrySet _entrySet; private transient FastMap$KeySet _keySet; public void FastMap(); public void FastMap(java.util.Map); public void FastMap(int); public int size(); public int capacity(); public boolean isEmpty(); public boolean containsKey(Object); public boolean containsValue(Object); public...

pkg crypto/sha1, const Size ideal-int
pkg crypto/sha1, func New() hash.Hash
pkg crypto/sha256, const BlockSize ideal-int
pkg crypto/sha256, const Size ideal-int
pkg crypto/sha256, const Size224 ideal-int
pkg crypto/sha256, func New() hash.Hash
pkg crypto/sha256, func New224() hash.Hash
pkg crypto/sha512, const BlockSize ideal-int
pkg crypto/sha512, const Size ideal-int
pkg crypto/sha512, const Size384 ideal-int

shiftedLimbs[i+1] << (_W - shift) } } return x } // BitLenVarTime returns the actual size of x in bits. // // The actual size of x (but nothing more) leaks through timing side-channels. // Note that this is ordinarily secret, as opposed to the announced size of x. func (x *Nat) BitLenVarTime() int { // Eliminate bounds checks in the loop. size := len(x.limbs) xLimbs := x.limbs[:size] for i := size - 1; i >= 0; i-- { if xLimbs[i] != 0 { return i*_W + bitLen(xLimbs[i]) } } return 0 } // bitLen is a version of bits.Len...