*
 * <p>The mappings corresponding to a given row key may be viewed as a {@link Map} whose keys are
 * the columns. The reverse is also available, associating a column with a row key / value map. Note
 * that, in some implementations, data access by column key may have fewer supported operations or
 * worse performance than data access by row key.
 *
 * <p>The methods returning collections or maps always return views of the underlying table.

   */
  public final FluentIterable<E> skip(int numberToSkip) {
    return from(Iterables.skip(getDelegate(), numberToSkip));
  }

  /**
   * Creates a fluent iterable with the first {@code size} elements of this fluent iterable. If this
   * fluent iterable does not contain that many elements, the returned fluent iterable will have the

   */
  public final FluentIterable<E> skip(int numberToSkip) {
    return from(Iterables.skip(getDelegate(), numberToSkip));
  }

  /**
   * Creates a fluent iterable with the first {@code size} elements of this fluent iterable. If this
   * fluent iterable does not contain that many elements, the returned fluent iterable will have the

    private int cursor = -1;
    private int nextCursor = -1;
    private int expectedModCount = modCount;
    // The same element is not allowed in both forgetMeNot and skipMe, but duplicates are allowed in
    // either of them, up to the same multiplicity as the queue.
    private @Nullable Queue<E> forgetMeNot;
    private @Nullable List<E> skipMe;
    private @Nullable E lastFromForgetMeNot;

    //     fgha[c]|[b]de -> fgha[b]|[c]de. Because these two blocks are the same size, we are done.
    // The Dolphin algorithm is attractive because it does the fewest array reads and writes: each
    // array slot is read and written exactly once. However, it can have very poor memory locality:
    // benchmarking shows it can take 7 times longer than the other two in some cases. The other two

      ListenableFuture<?> unused = serializer.submitAsync(() -> settableFuture, directExecutor());
      for (int i = 0; i < 50_000; i++) {
        if (i % DIRECT_EXECUTIONS_PER_THREAD == 0) {
          // after some number of iterations, switch threads
          unused =
              serializer.submit(
                  () -> {
                    holder.count++;
                    return null;
                  },

            verify(mockInfo, times(1)).encode(any(byte[].class), anyInt());

            // Verify total bytes written
            assertTrue(bytesWritten > 32); // At least the fixed part plus some info
        } catch (Exception e) {
            throw new RuntimeException(e);
        }
    }

    @ParameterizedTest
    @DisplayName("Test writeBytesWireFormat with different info sizes")

那是因為它沿用了 OpenAPI 規格中的名稱。如此一來，若你要深入查閱這些安全方案，便能直接複製貼上去搜尋更多資訊。

///

變數 `oauth2_scheme` 是 `OAuth2PasswordBearer` 的實例，但同時它也是「可呼叫的」（callable）。

它可以這樣被呼叫：

```Python
oauth2_scheme(some, parameters)
```

因此它可以配合 `Depends` 使用。

### 如何使用 { #use-it }

現在你可以在相依性中傳入 `oauth2_scheme` 與 `Depends` 搭配。

{* ../../docs_src/security/tutorial001_an_py310.py hl[12] *}

这是因为它使用了与 OpenAPI 规范中相同的名称。这样当你需要深入了解这些安全方案时，可以直接复制粘贴去查找更多信息。

///

`oauth2_scheme` 变量是 `OAuth2PasswordBearer` 的一个实例，同时它也是“可调用”的。

可以像这样调用：

```Python
oauth2_scheme(some, parameters)
```

因此，它可以与 `Depends` 一起使用。

### 使用 { #use-it }

现在你可以通过 `Depends` 将 `oauth2_scheme` 作为依赖传入。

{* ../../docs_src/security/tutorial001_an_py310.py hl[12] *}

            throws RepositoryMetadataStoreException {
        // TODO currently this is first wins, but really we should take the latest by comparing either the
        // snapshot timestamp, or some other timestamp later encoded into the metadata.
        // TODO this needs to be repeated here so the merging doesn't interfere with the written metadata