val Project.buildBranch: Provider<String>
    get() = environmentVariable(BUILD_BRANCH).orElse(currentGitBranchViaFileSystemQuery())


/**
 * The logical branch.
 * For non-merge-queue branches this is the same as {@link #buildBranch}.
 * For merge-queue branches, this is the base branch.
 *
 * For example, for the merge queue branch "gh-readonly-queue/master/pr-12345-1a2b3c4d" the logical branch is "master".
 */

        serverData.encryptionKey = originalKey;

        // When - modify the original array
        originalKey[0] = (byte) 0xFF;

        // Then - the field should also be modified (same reference)
        assertEquals((byte) 0xFF, serverData.encryptionKey[0]);
        assertSame(originalKey, serverData.encryptionKey);
    }

    /**
     * Test multiple ServerData instances are independent

            }
        }

        /**
         * Deletes old documents from the search index.
         * This method removes documents that were indexed in previous
         * crawling sessions for the same data configuration, keeping
         * only the documents from the current session.
         *
         * <p>The deletion process:</p>
         * <ul>
         *   <li>Checks if old document deletion is enabled</li>

    @Test
    public void test_mergeItemsWithMultipleDuplicates() throws Exception {
        String[][] readings = new String[1][];
        readings[0] = new String[] { "test" };

        // Create 5 items with the same ID but different frequencies
        SuggestItem item1 = new SuggestItem(new String[] { "テスト" }, readings, new String[] { "content" }, 1, 0, -1, new String[] { "tag1" },

      return g + "(" + f + ")";
    }

    @GwtIncompatible @J2ktIncompatible private static final long serialVersionUID = 0;
  }

  /**
   * Creates a function that returns the same boolean output as the given predicate for all inputs.
   *
   * <p>The returned function is <i>consistent with equals</i> (as documented at {@link

     * implementation, because {@code map.get()} returns a view collection that changes in the
     * course of a call to {@code remove()}. Thus, the expectation doesn't hold that {@code
     * map.remove(x)} returns the same value which {@code map.get(x)} did immediately beforehand.
     */
    @Override
    public void testRemove() {
      Map<String, Map<Integer, Character>> map;
      try {
        map = makePopulatedMap();

 * average, in the marking phase, not {@code 5.0} as in {@code java.util.HashSet}.
 *
 * <p>If there are no removals, then {@link #iterator iteration} order is the same as insertion
 * order. Any removal invalidates any ordering guarantees.
 *
 * <p>This class should not be assumed to be universally superior to {@code java.util.HashSet}.

   *
   * @param a the array into which the elements of the queue are to be stored, if it is big enough;
   *     otherwise, a new array of the same runtime type is allocated for this purpose
   * @return an array containing all of the elements in this queue
   * @throws ArrayStoreException if the runtime type of the specified array is not a supertype of

     * implementation, because {@code map.get()} returns a view collection that changes in the
     * course of a call to {@code remove()}. Thus, the expectation doesn't hold that {@code
     * map.remove(x)} returns the same value which {@code map.get(x)} did immediately beforehand.
     */
    @Override
    public void testRemove() {
      Map<String, Map<Integer, Character>> map;
      try {
        map = makePopulatedMap();

            return t.getShare();
        }
    }

    /**
     *
     * Only call this method while holding a tree handle
     *
     * @param other
     * @return whether the connection refers to the same tree
     */
    public boolean isSame(final SmbTreeConnection other) {
        try (SmbTreeImpl t1 = getTree(); SmbTreeImpl t2 = other.getTree()) {
            return t1 == t2;
        }
    }