assertEquals("c", Iterables.getLast(list));
  }

  public void testGetLast_emptyList() {
    List<String> list = emptyList();
    assertThrows(NoSuchElementException.class, () -> Iterables.getLast(list));
  }

  public void testGetLast_sortedSet() {
    SortedSet<String> sortedSet = ImmutableSortedSet.of("b", "c", "a");
    assertEquals("c", Iterables.getLast(sortedSet));
  }

        }
        return sessionId;
    }

    public synchronized void store(final String sessionId, final boolean create) {
        CrawlingInfo crawlingInfo = create ? null : getCrawlingInfoService().getLast(sessionId);
        if (crawlingInfo == null) {
            crawlingInfo = new CrawlingInfo(sessionId);
            try {
                getCrawlingInfoService().store(crawlingInfo);
            } catch (final Exception e) {

        });
    }

    public List<CrawlingInfoParam> getLastCrawlingInfoParamList(final String sessionId) {
        final CrawlingInfo crawlingInfo = getLast(sessionId);
        if (crawlingInfo == null) {
            return Collections.emptyList();
        }
        final FessConfig fessConfig = ComponentUtil.getFessConfig();

  public static <T extends @Nullable Object> T getLast(Iterable<T> iterable) {
    // TODO(kevinb): Support a concurrently modified collection?
    if (iterable instanceof List) {
      List<T> list = (List<T>) iterable;
      if (list.isEmpty()) {
        throw new NoSuchElementException();
      }
      return getLastInNonemptyList(list);
    }

    return Iterators.getLast(iterable.iterator());
  }

  /**

   *
   * @throws NullPointerException if the last element is null; if this is a possibility, use {@link
   *     Iterables#getLast} instead.
   */
  @SuppressWarnings("nullness") // Unsafe, but we can't do much about it now.
  public final Optional<@NonNull E> last() {
    // Iterables#getLast was inlined here so we don't have to throw/catch a NSEE

    // TODO(kevinb): Support a concurrently modified collection?

            throw new NoSuchElementException();
        }
        return getFirstEntry().element;
    }

    /**
     * 最後の要素を返します。
     *
     * @return 最後の要素
     */
    public E getLast() {
        if (isEmpty()) {
            throw new NoSuchElementException();
        }
        return getLastEntry().element;
    }

    /**
     * 最初のエントリを返します。
     *
     * @return 最初のエントリ
     */

    private final boolean positiveBoundedAbove;

    private final int size;

    ComplementRanges() {
      this.positiveBoundedBelow = ranges.get(0).hasLowerBound();
      this.positiveBoundedAbove = Iterables.getLast(ranges).hasUpperBound();

      int size = ranges.size() - 1;
      if (positiveBoundedBelow) {
        size++;
      }
      if (positiveBoundedAbove) {
        size++;
      }

  public void testSubList_startNegative() {
    assertThrows(IndexOutOfBoundsException.class, () -> getList().subList(-1, 0));
  }

  public void testSubList_endTooLarge() {
    assertThrows(IndexOutOfBoundsException.class, () -> getList().subList(0, getNumElements() + 1));
  }

  public void testSubList_startGreaterThanEnd() {
    try {
      getList().subList(1, 0);
      fail("subList(1, 0) should throw");

  public void testSubList_startNegative() {
    assertThrows(IndexOutOfBoundsException.class, () -> getList().subList(-1, 0));
  }

  public void testSubList_endTooLarge() {
    assertThrows(IndexOutOfBoundsException.class, () -> getList().subList(0, getNumElements() + 1));
  }

  public void testSubList_startGreaterThanEnd() {
    try {
      getList().subList(1, 0);
      fail("subList(1, 0) should throw");

        return 0;
      } else {
        int old = values[lastKnownIndex];
        values[lastKnownIndex] = count;
        return old;
      }
    }
  }

  private static int getHash(long entry) {
    return (int) (entry >>> 32);
  }

  /** Returns the index, or UNSET if the pointer is "null" */
  private static int getNext(long entry) {
    return (int) entry;
  }