// First determine all the packages that exist in the dependencies. There might be
            // split packages across the dependencies, which is "ok", in that we don't care
            // about it for the purpose of this project, that split will be detected in
            // the other project
            Map<String, List<File>> dependencyPackages = getDependencyPackages();

        assertNotNull("Should have search alias", aliasResponse.getAliases());

        // Call switchIndex - should return early without error since they're already the same
        suggester.switchIndex();

        // Verify indices still exist and are functional

    TF_Operation* op;
    UseHelper(inputs, &op);
    return op;
  }

  // All the *Helper methods are used as a workaround for the restrictions that
  // one cannot call ASSERT_* methods in non-void-returning functions (when
  // exceptions are disabled during compilation)
  void UseHelper(const std::vector<TF_Output>& inputs, TF_Operation** op) {
    TF_OperationDescription* desc =

### 執行應用 { #run-the-app }

你可以執行應用：

<div class="termy">

```console
$ fastapi dev

<span style="color: green;">INFO</span>:     Uvicorn running on http://127.0.0.1:8000 (Press CTRL+C to quit)
```

</div>

然後前往 `/docs` 的 UI，你會看到 FastAPI 使用這些模型來「文件化」API，也會用它們來「序列化」與「驗證」資料。

<div class="screenshot">
<img src="/img/tutorial/sql-databases/image01.png">
</div>

    h ^= h >>> 10;
    h += h << 3;
    h ^= h >>> 6;
    h += (h << 2) + (h << 14);
    return h ^ (h >>> 16);
  }

  /**
   * This method is a convenience for testing. Code should call {@link Segment#newEntry} directly.
   */
  @VisibleForTesting
  ReferenceEntry<K, V> newEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) {
    Segment<K, V> segment = segmentFor(hash);
    segment.lock();

 *
 * <p>This uses the same efficient implementation as {@link Ordering#leastOf(Iterable, int)},
 * offering expected O(n + k log k) performance (worst case O(n log k)) for n calls to {@link
 * #offer} and a call to {@link #topK}, with O(k) memory. In comparison, quickselect has the same
 * asymptotics but requires O(n) memory, and a {@code PriorityQueue} implementation takes O(n log

            assertEquals(FileSystemInformation.FS_FULL_SIZE_INFO, fullInfo.getFileSystemInformationClass());
        }

        @Test
        @DisplayName("Should handle decode method call")
        void shouldHandleDecodeMethodCall() throws jcifs.internal.SMBProtocolDecodingException {
            // Given
            TestAllocInfo allocInfo = new TestAllocInfo(1000L, 500L);

  }

  /**
   * Returns an immutable sorted multiset containing the given elements sorted by their natural
   * ordering. To create a copy of a {@code SortedMultiset} that preserves the comparator, call
   * {@link #copyOfSorted} instead. This method iterates over {@code elements} at most once.
   *
   * <p>Note that if {@code s} is a {@code Multiset<String>}, then {@code

        return new BiMapEntry(entry);
      }

      @Override
      public void remove() {
        if (entry == null) {
          throw new IllegalStateException("no calls to next() since the last call to remove()");
        }
        V value = entry.getValue();
        iterator.remove();
        removeFromInverseMap(value);
        entry = null;
      }
    };
  }

  @WeakOuter

 */
@GwtCompatible
/*
 * Users will use most of these methods only if they're already using Stream. For a few other
 * methods, like stream(Iterable), we have to rely on users not to call them without library
 * desugaring.
 */
@IgnoreJRERequirement
public final class Streams {
  /**
   * Returns a sequential {@link Stream} of the contents of {@code iterable}, delegating to {@link