Kits - Code Search

apache-maven/src/main/appended-resources/licenses/EPL-2.0.txt

  Program, it is Recipient's responsibility to acquire that license
  before distributing the Program.

  d) Each Contributor represents that to its knowledge it has
  sufficient copyright rights in its Contribution, if any, to grant
  the copyright license set forth in this Agreement.

  e) Notwithstanding the terms of any Secondary License, no

Created: Sun Apr 05 03:35:12 GMT 2026

- Last Modified: Tue Jun 04 06:45:16 GMT 2024

- 13.9K bytes

- Click Count (0)

github.com/apache/maven

api/maven-api-core/src/main/java/org/apache/maven/api/Type.java

 * <p>
 * It provides information about the file type (or extension) of the associated artifact,
 * its default classifier, and how the artifact will be used in the build when creating
 * class paths or module paths.
 * <p>
 * For example, the type {@code java-source} has a {@code jar} extension and a
 * {@code sources} classifier. The artifact and its dependencies should be added
 * to the build path.
 *
 * @since 4.0.0
 */
@Experimental

Created: Sun Apr 05 03:35:12 GMT 2026

- Last Modified: Fri Jun 06 14:28:57 GMT 2025

- 6.5K bytes

- Click Count (0)

github.com/google/guava

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

import java.util.Map;
import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * A bimap (or "bidirectional map") is a map that preserves the uniqueness of its values as well as
 * that of its keys. This constraint enables bimaps to support an "inverse view", which is another
 * bimap containing the same entries as this bimap but with reversed keys and values.
 *
 * <h3>Implementations</h3>
 *

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Wed Aug 06 17:32:30 GMT 2025

- 4.2K bytes

- Click Count (0)

github.com/codelibs/fess

src/main/webapp/js/admin/popper.min.js.map

positioned, it\n  // may happen that the popper gets misplaced because of the new content\n  // overflowing its reference element\n  // To avoid this problem, we provide two options (x and y), which allow\n  // the consumer to define the offset origin.\n  // If we position a popper on top of a reference element, we can set\n  // `x` to `top` to make the popper grow towards its top instead of\n  // its bottom.\n  let left, top;\n  if (sideA === 'bottom') {\n    // when offsetParent is <html> the positioning...

Created: Tue Mar 31 13:07:34 GMT 2026

- Last Modified: Sat Oct 26 01:49:09 GMT 2024

- 120.9K bytes

- Click Count (0)

github.com/google/guava

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

import java.util.PriorityQueue;
import java.util.Queue;
import org.jspecify.annotations.Nullable;

/**
 * A double-ended priority queue, which provides constant-time access to both its least element and
 * its greatest element, as determined by the queue's specified comparator. If no comparator is
 * given at creation time, the natural order of elements is used. If no maximum size is given at

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Mon Mar 16 13:11:08 GMT 2026

- 34K bytes

- Click Count (0)

github.com/square/okhttp

okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Huffman.kt

    val symbol: Int

    /** Number of bits represented in the terminal node. */
    val terminalBitCount: Int

    /** Construct an internal node. */
    constructor() {
      this.children = arrayOfNulls(256)
      this.symbol = 0 // Not read.
      this.terminalBitCount = 0 // Not read.
    }

    /** Construct a terminal node. */
    constructor(symbol: Int, bits: Int) {
      this.children = null

Created: Fri Apr 03 11:42:14 GMT 2026

- Last Modified: Wed Mar 19 19:25:20 GMT 2025

- 11K bytes

- Click Count (0)

github.com/google/guava

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

   * of the returned array is that of the specified array. If the collection fits in the specified
   * array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the
   * specified array and the size of the specified collection.
   *
   * <p>If the collection fits in the specified array with room to spare (i.e., the array has more

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Fri Jan 23 17:16:53 GMT 2026

- 9.2K bytes

- Click Count (0)

github.com/google/guava

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

import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * A {@link Multiset} which maintains the ordering of its elements, according to either their
 * natural order or an explicit {@link Comparator}. This order is reflected when iterating over the
 * sorted multiset, either directly, or through its {@code elementSet} or {@code entrySet} views. In

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Thu Aug 07 16:05:33 GMT 2025

- 5.4K bytes

- Click Count (0)

github.com/google/guava

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

import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * A {@link Multiset} which maintains the ordering of its elements, according to either their
 * natural order or an explicit {@link Comparator}. This order is reflected when iterating over the
 * sorted multiset, either directly, or through its {@code elementSet} or {@code entrySet} views. In

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Thu Aug 07 16:05:33 GMT 2025

- 5.4K bytes

- Click Count (0)

github.com/google/guava

guava-tests/test/com/google/common/hash/HashCodeTest.java

    mutated[0]++;
    assertThat(hash.asBytes()).isEqualTo(original);
  }

  private static void assertReadableBytes(HashCode hashCode) {
    assertThat(hashCode.bits()).isAtLeast(32); // sanity
    byte[] hashBytes = hashCode.asBytes();
    int totalBytes = hashCode.bits() / 8;

    for (int bytes = 0; bytes < totalBytes; bytes++) {
      byte[] bb = new byte[bytes];
      hashCode.writeBytesTo(bb, 0, bb.length);

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Thu Mar 19 18:53:45 GMT 2026

- 13.2K bytes

- Click Count (0)

Search Options