this.loadSuccessCount = loadSuccessCount;
    this.loadExceptionCount = loadExceptionCount;
    this.totalLoadTime = totalLoadTime;
    this.evictionCount = evictionCount;
  }

  /**
   * Returns the number of times {@link Cache} lookup methods have returned either a cached or
   * uncached value. This is defined as {@code hitCount + missCount}.
   *

		}
	}
}

// Tests maximum allowed part number.
func TestMaxPartID(t *testing.T) {
	sizes := []struct {
		isMax bool
		partN int
	}{
		// Test - 1 part number within max part number.
		{
			false,
			globalMaxPartID - 1,
		},
		// Test - 2 part number bigger than max part number.
		{
			true,
			globalMaxPartID + 1,
		},
	}

	for i, s := range sizes {

  }

  /**
   * Returns the number of times the current thread has entered this monitor in excess of the number
   * of times it has left. Returns 0 if the current thread is not occupying this monitor.
   */
  public int getOccupiedDepth() {
    return lock.getHoldCount();
  }

  /**
   * Returns an estimate of the number of threads waiting to enter this monitor. The value is only

        return "REG-" + System.currentTimeMillis() + "-" + Integer.toHexString(System.identityHashCode(this));
    }

    /**
     * Gets the next sequence number for this registration.
     *
     * @return the next sequence number
     */
    public long getNextSequenceNumber() {
        return sequenceNumber.incrementAndGet();
    }

    /**

		if err != nil {
			return result, err
		}
	}

	result.ObjectSize, err = latestMeta.ToObjectInfo(bucket, object, true).GetActualSize()
	if err != nil {
		return result, err
	}

	// Loop to find number of disks with valid data, per-drive
	// data state and a list of outdated disks on which data needs
	// to be healed.
	outDatedDisks := make([]StorageAPI, len(storageDisks))
	disksToHealCount, xlMetaToHealCount := 0, 0

    BigInteger result;
    do {
      result = randomNonNegativeBigInteger(numBits);
    } while (result.signum() == 0);
    return result;
  }

  /**
   * Generates a number in [0, 2^numBits) with an exponential distribution. The floor of the log2 of
   * the result is chosen uniformly at random in [0, numBits), and then the result is chosen in that

 */
@GwtCompatible
public class TreeBasedTable<R, C, V> extends StandardRowSortedTable<R, C, V> {
  private final Comparator<? super C> columnComparator;

  private static final class Factory<C, V> implements Supplier<Map<C, V>>, Serializable {
    final Comparator<? super C> comparator;

    Factory(Comparator<? super C> comparator) {
      this.comparator = comparator;
    }

    @Override
    public Map<C, V> get() {

            result = buf.dec_ndr_long();
        } else { /* Bind_ack or Response */
            decode_out(buf);
        }
    }

    /**
     * Get the operation number for this DCERPC message.
     * @return the operation number
     */
    public abstract int getOpnum();

    /**
     * Encode the input parameters for this DCERPC message.
     * @param buf the buffer to encode into

        // 4 (maxParameterCount) + 4 (maxDataCount) + 4 (parameterCount) + 4 (parameterOffset) +
        // 4 (dataCount) + 4 (dataOffset) + 1 (setupCount) + 2 (function)
        assertEquals(38, bytesWritten, "Number of bytes written should be 38 for primary transaction");

        // Verify some key values
        assertEquals(smbComNtTransaction.maxSetupCount, dst[0], "maxSetupCount should be written correctly");

    public JobNotFoundException(final ScheduledJob scheduledJob) {
        super(scheduledJob.toString());
    }

    /**
     * Constructs a new JobNotFoundException with the specified detail message.
     *
     * @param message the detail message explaining why the job was not found
     */
    public JobNotFoundException(final String message) {
        super(message);
    }