lift - Code Search

android/guava/src/com/google/common/primitives/Booleans.java

    INSTANCE;

    @Override
    public int compare(boolean[] left, boolean[] right) {
      int minLength = Math.min(left.length, right.length);
      for (int i = 0; i < minLength; i++) {
        int result = Booleans.compare(left[i], right[i]);
        if (result != 0) {
          return result;
        }
      }
      return left.length - right.length;
    }

    @Override

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Thu Feb 15 16:12:13 GMT 2024

- 19.9K bytes

- Viewed (0)

github.com/google/guava

guava/src/com/google/common/collect/ExplicitOrdering.java

import java.io.Serializable;
import java.util.List;
import javax.annotation.CheckForNull;

/** An ordering that compares objects according to a given order. */
@GwtCompatible(serializable = true)
@ElementTypesAreNonnullByDefault
final class ExplicitOrdering<T> extends Ordering<T> implements Serializable {
  final ImmutableMap<T, Integer> rankMap;

  ExplicitOrdering(List<T> valuesInOrder) {
    this(Maps.indexMap(valuesInOrder));

Java

- Registered: Fri Apr 05 12:43:09 GMT 2024

- Last Modified: Sun Jun 20 14:22:42 GMT 2021

- 2K bytes

- Viewed (0)

github.com/google/guava

android/guava/src/com/google/common/primitives/Doubles.java

   * the returned list is unspecified.
   *
   * <p>The returned list may have unexpected behavior if it contains {@code NaN}, or if {@code NaN}
   * is used as a parameter to any of its methods.
   *
   * <p>The returned list is serializable.
   *
   * <p><b>Note:</b> when possible, you should represent your data as an {@link

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Thu Feb 29 15:43:06 GMT 2024

- 27.1K bytes

- Viewed (0)

github.com/google/guava

android/guava/src/com/google/common/collect/TopKSelector.java

  private void trim() {
    int left = 0;
    int right = 2 * k - 1;

    int minThresholdPosition = 0;
    // The leftmost position at which the greatest of the k lower elements
    // -- the new value of threshold -- might be found.

    int iterations = 0;
    int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3;
    while (left < right) {
      int pivotIndex = (left + right + 1) >>> 1;

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Mon Apr 01 16:15:01 GMT 2024

- 11.2K bytes

- Viewed (0)

github.com/google/guava

guava-testlib/src/com/google/common/collect/testing/google/SortedMapGenerators.java

    public Iterable<Entry<String, Integer>> order(List<Entry<String, Integer>> insertionOrder) {
      return new Ordering<Entry<String, Integer>>() {
        @Override
        public int compare(Entry<String, Integer> left, Entry<String, Integer> right) {
          return left.getKey().compareTo(right.getKey());
        }
      }.sortedCopy(insertionOrder);
    }

    @Override
    public List<Entry<String, Integer>> create(Object... elements) {

Java

- Registered: Fri Apr 26 12:43:10 GMT 2024

- Last Modified: Mon Feb 26 19:46:10 GMT 2024

- 4.6K bytes

- Viewed (0)

github.com/gradle/gradle

build-logic-commons/code-quality-rules/src/main/resources/classycle/classycle_report_resources.zip

"</table>"; } showText(text); } function showText(text) { list = window.open("", "list", "dependent=yes,location=no,menubar=yes,resizable=yes,toolbar=no,scrollbars=yes,width=500,height=400"); list.document.close(); list.document.open(); list.document.write("<html><head><style type=\"text/css\">"); list.document.write("body { font-family:Helvetica,Arial,sans-serif; } "); list.document.write(".link { cursor:pointer;text-decoration:underline; } "); list.document.writeln("th { background-color:#aaaaaa; } ...

ZIP Archive

- Registered: Wed May 01 11:36:15 GMT 2024

- Last Modified: Wed Dec 09 08:14:05 GMT 2020

- 23.4K bytes

- Viewed (0)

github.com/google/guava

guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java

      this.x = x;
      this.left = left;
      this.right = right;
    }
  }

  enum Topology {
    BALANCED {
      @Override
      Optional<BinaryNode> createTree(int size, Random rng) {
        if (size == 0) {
          return Optional.absent();
        } else {
          int leftChildSize = (size - 1) / 2;
          int rightChildSize = size - 1 - leftChildSize;

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Tue Feb 26 19:18:53 GMT 2019

- 4.9K bytes

- Viewed (0)

github.com/JetBrains/kotlin

analysis/analysis-api-fir/src/org/jetbrains/kotlin/analysis/api/fir/components/KtFirSubstitutorProvider.kt

            else -> {
                val chained = substitutors.reduce { left, right -> left.chain(right) }
                firSymbolBuilder.typeBuilder.buildSubstitutor(chained)
            }
        }
    }


    private fun collectInheritancePath(
        baseSymbol: FirClassSymbol<*>,
        superSymbol: FirClassSymbol<*>,
    ): List<Pair<ConeClassLikeType, FirRegularClassSymbol>>? {

Plain Text

- Registered: Fri Apr 26 08:18:10 GMT 2024

- Last Modified: Fri Oct 06 11:39:33 GMT 2023

- 3.1K bytes

- Viewed (0)

github.com/google/guava

guava-tests/test/com/google/common/collect/TreeMultimapNaturalTest.java

                      List<Entry<String, String>> insertionOrder) {
                    return new Ordering<Entry<String, String>>() {
                      @Override
                      public int compare(Entry<String, String> left, Entry<String, String> right) {
                        return ComparisonChain.start()
                            .compare(left.getKey(), right.getKey(), Ordering.natural().nullsFirst())

Java

- Registered: Fri Apr 19 12:43:09 GMT 2024

- Last Modified: Thu Mar 07 18:34:03 GMT 2024

- 22.6K bytes

- Viewed (0)

github.com/google/guava

android/guava-tests/test/com/google/common/primitives/UnsignedBytesTest.java

      for (int trials = 10; trials-- > 0; ) {
        byte[] left = new byte[1 + rnd.nextInt(32)];
        rnd.nextBytes(left);
        byte[] right = left.clone();
        assertThat(comparator.compare(left, right)).isEqualTo(0);
        int i = rnd.nextInt(left.length);
        left[i] ^= (byte) (1 + rnd.nextInt(255));
        assertThat(comparator.compare(left, right)).isNotEqualTo(0);

Java

- Registered: Fri May 03 12:43:13 GMT 2024

- Last Modified: Tue Feb 20 17:00:05 GMT 2024

- 13.4K bytes

- Viewed (0)

Search Options