* as a false predicate is found.
   *
   * <p><b>Discouraged:</b> Prefer using {@code first.and(second)}.
   */
  public static <T extends @Nullable Object> Predicate<T> and(
      Predicate<? super T> first, Predicate<? super T> second) {
    return new AndPredicate<>(Predicates.<T>asList(checkNotNull(first), checkNotNull(second)));
  }

  /**

    }

    @Test
    @DisplayName("Test setTid sets tree ID")
    void testSetTid() {
        // Given
        Smb2CancelRequest request = new Smb2CancelRequest(mockConfig, 1L, 0L);
        int treeId = 42;

        // When
        request.setTid(treeId);

        // Then
        assertEquals(treeId, request.getTreeId(), "Tree ID should be set correctly");

   * @param second the second array of elements to concatenate
   * @param type the component type of the returned array
   */
  @GwtIncompatible // Array.newInstance(Class, int)
  public static <T extends @Nullable Object> T[] concat(
      T[] first, T[] second, Class<@NonNull T> type) {
    T[] result = newArray(type, first.length + second.length);
    arraycopy(first, 0, result, 0, first.length);

   * as a false predicate is found.
   *
   * <p><b>Discouraged:</b> Prefer using {@code first.and(second)}.
   */
  public static <T extends @Nullable Object> Predicate<T> and(
      Predicate<? super T> first, Predicate<? super T> second) {
    return new AndPredicate<>(Predicates.<T>asList(checkNotNull(first), checkNotNull(second)));
  }

  /**

      if (iter != fdef.ret().end()) {
        const auto& v = a_edges.insert({iter->second, arg.name()});
        ASSERT_TRUE(v.second) << "Duplicate edge " << iter->second << " -> "
                              << arg.name() << ". fdef: " << fdef.DebugString();
      } else {
        const auto& v = a_edges.insert({arg.name(), arg.name()});
        ASSERT_TRUE(v.second) << "Duplicate edge " << arg.name() << " -> "

            statusField.setAccessible(true);
            statusField.setInt(resp, status);
            Field availField = TransPeekNamedPipeResponse.class.getDeclaredField("available");
            availField.setAccessible(true);
            availField.setInt(resp, 123);
            return resp;
        }).when(tree).send(any(TransPeekNamedPipe.class), any(TransPeekNamedPipeResponse.class), eq(RequestParam.NO_RETRY));

	input := `{"id": 0,"title": "Test Record","desc": "Some text","synonyms": ["foo", "bar", "whatever"]}
	{"id": 1,"title": "Second Record","desc": "another text","synonyms": ["some", "synonym", "value"]}
	{"id": 2,"title": "Second Record","desc": "another text","numbers": [2, 3.0, 4]}
	{"id": 3,"title": "Second Record","desc": "another text","nested": [[2, 3.0, 4], [7, 8.5, 9]]}`

	testTable := []struct {
		name       string

   * that would have been produced in that idle time). So, if rate == 1 permit per second, and
   * arrivals come exactly one second after the previous, then storedPermits is _never_ increased --
   * we would only increase it for arrivals _later_ than the expected one second.
   */

  /**
   * This implements the following function where coldInterval = coldFactor * stableInterval.
   *

        TestScriptEngine engine1 = new TestScriptEngine("first");
        TestScriptEngine engine2 = new TestScriptEngine("second");

        scriptEngineFactory.add("test", engine1);
        scriptEngineFactory.add("test", engine2);

        // Should get the second engine
        ScriptEngine retrieved = scriptEngineFactory.getScriptEngine("test");
        assertEquals(engine2, retrieved);
    }

```Python
old_dict = {
    "old key": "old value",
    "second old key": "second old value",
}
new_dict = {**old_dict, "new key": "new value"}
```

此處，`new_dict` 會包含 `old_dict` 的所有鍵值配對，再加上新的鍵值配對：

```Python
{
    "old key": "old value",
    "second old key": "second old value",
    "new key": "new value",
}
```

你可以用這個技巧在「路徑操作」中重用一些預先定義的回應，並與其他自訂回應結合。