/**
   * Returns a {@link Collector} that accumulates elements into an {@code ImmutableBiMap} whose keys
   * and values are the result of applying the provided mapping functions to the input elements.
   * Entries appear in the result {@code ImmutableBiMap} in encounter order.
   *
   * <p>If the mapped keys or values contain duplicates (according to {@link

		j--
	}

	if j > 1 {
		// Create parent.
		if err := osMkdirAll(dirPath[:j-1], perm, baseDir); err != nil {
			return err
		}
	}

	// Parent now exists; invoke Mkdir and use its result.
	if err := Mkdir(dirPath, perm); err != nil {
		if osIsExist(err) {
			return nil
		}
		return err
	}

	return nil
}

// The buffer must be at least a block long.

        assertTrue(populatedString.contains("requestedTime=1000000"));
    }

    @Test
    public void test_complexScenario() {
        // Simulate a typical search result scenario
        // Page 2 of search results with 10 items per page
        searchRenderData.setPageSize(10);
        searchRenderData.setCurrentPageNumber(2);
        searchRenderData.setAllRecordCount(45L);

 *
 * <p>Each of the {@code standard} methods uses the map's comparator (or the natural ordering of the
 * elements, if there is no comparator) to test element equality. As a result, if the comparator is
 * not consistent with equals, some of the standard implementations may violate the {@code Map}
 * contract.
 *

    static final boolean DISABLED = Config.getBoolean("jcifs.smb1.smb.client.dfs.disabled", false);

    /**
     * Sentinel cache entry indicating a negative cache result
     */
    protected static CacheEntry FALSE_ENTRY = new Dfs.CacheEntry(0L);

    /**
     * Cache of trusted domains for DFS resolution
     */

labels.footer.copyright=&copy;2026 <a href="https://github.com/codelibs">CodeLibs Project</a>.
labels.search=Search
labels.similar_doc_result_status=Showing similar results.
labels.search_result_status=Results <b>{2}</b> - <b>{3}</b> of <b>{1}</b> for <b>{0}</b>
labels.search_result_status_over=Results <b>{2}</b> - <b>{3}</b> of over <b>{1}</b> for <b>{0}</b>
labels.search_result_time=({0} seconds)
labels.prev_page=Prev
labels.next_page=Next

	if !truncated {
		return entries, io.EOF
	}
	return entries, nil
}

// listMerged will list across all sets and return a merged results stream.
// The result channel is closed when no more results are expected.
func (z *erasureServerPools) listMerged(ctx context.Context, o listPathOptions, results chan<- metaCacheEntry) error {
	var mu sync.Mutex
	var wg sync.WaitGroup
	var errs []error
	allAtEOF := true

                            .compare(
                                left.getValue(), right.getValue(), Ordering.natural().nullsFirst())
                            .result();
                      }
                    }.sortedCopy(insertionOrder);
                  }
                })
            .named("TreeMultimap nullsFirst")
            .withFeatures(

      negligent acts) or agreed to in writing, shall any Contributor be
      liable to You for damages, including any direct, indirect, special,
      incidental, or consequential damages of any character arising as a
      result of this License or out of the use or inability to use the
      Work (including but not limited to damages for loss of goodwill,
      work stoppage, computer failure or malfunction, or any and all

 */
@GwtCompatible
public final class Comparators {
  private Comparators() {}

  /**
   * Returns a new comparator which sorts iterables by comparing corresponding elements pairwise
   * until a nonzero result is found; imposes "dictionary order." If the end of one iterable is
   * reached, but not the other, the shorter iterable is considered to be less than the longer one.