Kits - Code Search

cmd/xl-storage-format-v2_gen.go

	var field []byte
	_ = field
	var zb0001 uint32
	zb0001, err = dc.ReadMapHeader()
	if err != nil {
		err = msgp.WrapError(err)
		return
	}
	var zb0001Mask uint8 /* 1 bits */
	_ = zb0001Mask
	for zb0001 > 0 {
		zb0001--
		field, err = dc.ReadMapKeyPtr()
		if err != nil {
			err = msgp.WrapError(err)
			return
		}
		switch msgp.UnsafeString(field) {
		case "V2Obj":

Created: Sun Apr 05 19:28:12 GMT 2026

- Last Modified: Sun Sep 28 20:59:21 GMT 2025

- 55.8K bytes

- Click Count (0)

github.com/google/guava

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

  /** Maps a bucket to the "entry" of its first element. */
  private transient int[] hashTableKToV;

  /** Maps a bucket to the "entry" of its first element. */
  private transient int[] hashTableVToK;

  /** Maps an "entry" to the "entry" that follows it in its bucket. */
  private transient int[] nextInBucketKToV;

  /** Maps an "entry" to the "entry" that follows it in its bucket. */

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

- Last Modified: Sun Mar 08 16:16:42 GMT 2026

- 37K bytes

- Click Count (0)

github.com/square/okhttp

okhttp-tls/README.md

Use its [builder][handshake_certificates_builder] to define which certificates the HTTPS server
returns to its clients. The returned instance can create an `SSLSocketFactory` that implements this
policy:

```java
HandshakeCertificates serverCertificates = new HandshakeCertificates.Builder()
    .heldCertificate(localhostCertificate)
    .build();
MockWebServer server = new MockWebServer();

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

- Last Modified: Sun Mar 15 09:01:42 GMT 2026

- 9.1K bytes

- Click Count (0)

github.com/google/guava

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

    }
    copyIntoArray(other, 0);
    return other;
  }

  /** If this collection is backed by an array of its elements in insertion order, returns it. */
  @Nullable Object @Nullable [] internalArray() {
    return null;
  }

  /**
   * If this collection is backed by an array of its elements in insertion order, returns the offset
   * where this collection's elements start.
   */
  int internalArrayStart() {

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

- Last Modified: Thu Jan 29 22:14:05 GMT 2026

- 21.4K bytes

- Click Count (0)

github.com/google/guava

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

  private LinkedHashMultiset(int distinctElements) {
    super(Maps.newLinkedHashMapWithExpectedSize(distinctElements));
  }

  /**
   * @serialData the number of distinct elements, the first element, its count, the second element,
   *     its count, and so on
   */
  @GwtIncompatible
  @J2ktIncompatible
    private void writeObject(ObjectOutputStream stream) throws IOException {
    stream.defaultWriteObject();

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

- Last Modified: Fri Dec 05 23:15:58 GMT 2025

- 3.8K bytes

- Click Count (0)

github.com/apache/maven

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/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/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)

Search Options