@Nullable K getKey();

  /*
   * Used by entries that use access order. Access entries are maintained in a doubly-linked list.
   * New entries are added at the tail of the list at write time; stale entries are expired from
   * the head of the list.
   */

  /** Returns the time that this entry was last accessed, in ns. */
  @SuppressWarnings("GoodTime")
  long getAccessTime();

  /** Sets the entry access time in ns. */

		q[j-1] = 1 // difference is only found on the last byte
		for i := range b {
			idx := Index(b[i:], q[:j])
			if idx != -1 {
				t.Fatalf("Index(b[%d:], q[:%d])=%d, want -1\n", i, j, idx)
			}
		}
		q[j-1] = 0
	}

	// Test differing alignments and sizes of q which always end on a page boundary.
	q[len(q)-1] = 1 // difference is only found on the last byte
	for j := 0; j < len(q); j++ {
		for i := range b {

    }
  }

  private void checkConsistentHashCorrectness(long hashCode) {
    int last = 0;
    for (int shards = 1; shards <= 100000; shards++) {
      int b = Hashing.consistentHash(hashCode, shards);
      if (b != last) {
        assertEquals(shards - 1, b);
        last = b;
      }
    }
  }

  public void testConsistentHash_probabilities() {

        } finally {
            FileUtil.deleteInBackground(tempFile);
        }
    }

    /**
     * Marks the current position in this input stream. A subsequent call to the reset method repositions this stream at the last marked position so that subsequent reads re-read the same bytes.
     * This method delegates to {@link FileInputStream#mark(int)}.
     *

   *
   * Note that the list of proxies is never null, but it may be a list containing
   * only [Proxy.NO_PROXY]. This comes up in several situations:
   *
   * * If neither a proxy nor proxy selector is configured.
   * * If the proxy is configured explicitly as [Proxy.NO_PROXY].
   * * If the proxy selector returns only [Proxy.NO_PROXY].
   * * If the proxy selector returns an empty list or null.
   *

     */
    public Date readFiletime() throws IOException {
        Date date = null;

        final long last = readUnsignedInt();
        final long first = readUnsignedInt();
        if (first != 0x7fffffffL && last != 0xffffffffL) {
            final BigInteger lastBigInt = BigInteger.valueOf(last);
            final BigInteger firstBigInt = BigInteger.valueOf(first);

        int data1 = bb.getInt(); // first 4 bytes (little-endian)
        short data2 = bb.getShort(); // next 2 bytes (little-endian)
        short data3 = bb.getShort(); // next 2 bytes (little-endian)

        // The last 8 bytes are read as big-endian (network byte order for the high/low parts)
        ByteBuffer bb2 = ByteBuffer.wrap(bytes, 8, 8).order(java.nio.ByteOrder.BIG_ENDIAN);
        long data4 = bb2.getLong();

    }

    /**
     * Gets the last modified date of the resource.
     *
     * @return the last modified date, or null if not available
     */
    public Date getLastModified() {
        return lastModified;
    }

    /**
     * Sets the last modified date of the resource.
     *
     * @param lastModified the last modified date to set
     */

    /**
     * Notify when file size changes
     */
    public static final int FILE_NOTIFY_CHANGE_SIZE = 0x8;
    /**
     * Notify when last write time changes
     */
    public static final int FILE_NOTIFY_CHANGE_LAST_WRITE = 0x10;
    /**
     * Notify when last access time changes
     */
    public static final int FILE_NOTIFY_CHANGE_LAST_ACCESS = 0x20;
    /**
     * Notify when creation time changes
     */

    return new FluentIterable<T>() {
      @Override
      public Iterator<T> iterator() {
        if (iterable instanceof List) {
          List<T> list = (List<T>) iterable;
          int toSkip = Math.min(list.size(), numberToSkip);
          return list.subList(toSkip, list.size()).iterator();
        }
        Iterator<T> iterator = iterable.iterator();

        Iterators.advance(iterator, numberToSkip);