cold - Code Search

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

   * value} before proceeding with the {@link #put} operation. If the bimap previously contained the
   * provided key-value mapping, this method has no effect.
   *
   * <p>Note that a successful call to this method could cause the size of the bimap to increase by
   * one, stay the same, or even decrease by one.
   *
   * <p><b>Warning:</b> If an existing entry with this value is removed, the key for that entry is
   * discarded and not returned.

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/WEB-INF/orig/view/help.jsp

<link href="${fe:url('/css/font-awesome.min.css')}"
	rel="stylesheet" type="text/css" />
</head>
<body>
	<jsp:include page="header.jsp" />
	<main class="container">
		<div class="row">
			<div class="col">

				<jsp:include page="${helpPage}" />

			</div>
		</div>
		<div class="text-end">
			<a href="#"><la:message key="labels.footer_back_to_top" /></a>
		</div>
	</main>
	<jsp:include page="footer.jsp" />

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

- Last Modified: Mon Feb 23 08:03:44 GMT 2026

- 1.3K bytes

- Click Count (0)

github.com/google/guava

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

  // TODO(b/418181860): This method creates retain cycles in J2ObjC. In order to break the cycle,
  // there needs to be separate classes for primary and descending multiset, where the primary one
  // would hold {@code @LazyInit @RetainedWith @Nullable} reference to its descending multiset, and
  // the other {@code final} reference.
  @Override
  public SortedMultiset<E> descendingMultiset() {

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

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

- 4K bytes

- Click Count (0)

github.com/google/guava

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

 * such custom interfaces directly; they are implemented only in subclasses. Therefore, forwarding
 * {@code equals} would break symmetry, as the forwarding object might consider itself equal to the
 * object being tested, but the reverse could not be true. This behavior is consistent with the
 * JDK's collection wrappers, such as {@link java.util.Collections#unmodifiableCollection}. Use an

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

- Last Modified: Sat Dec 21 03:10:51 GMT 2024

- 3K bytes

- Click Count (0)

github.com/square/okhttp

okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http/ExchangeCodec.kt

   * That may happen later by the connection pool thread.
   */
  fun cancel()

  /**
   * Carries an exchange. This is usually a connection, but it could also be a connect plan for
   * CONNECT tunnels. Note that CONNECT tunnels are significantly less capable than connections.
   */
  interface Carrier {
    val route: Route

    fun trackFailure(
      call: RealCall,

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

- Last Modified: Tue Jul 29 21:11:09 GMT 2025

- 3.3K bytes

- Click Count (0)

github.com/google/guava

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

        hashTableVToK[valueBucket] = entryToRehash;
      }
    }
  }

  /**
   * Returns the bucket (in either the K-to-V or V-to-K tables) where elements with the specified
   * hash could be found, if present, or could be inserted.
   */
  private int bucket(int hash) {
    return hash & (hashTableKToV.length - 1);
  }

  /** Given a key, returns the index of the entry in the tables, or ABSENT if not found. */

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/google/guava

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

     * execute Queue#drainTo is not added *on top* of waiting for the timeout (which could make
     * the timeout arbitrarily inaccurate, given a queue that is slow to drain).
     */
    long deadline = System.nanoTime() + unit.toNanos(timeout);
    int added = 0;
    while (added < numElements) {
      // we could rely solely on #poll, but #drainTo might be more efficient when there are multiple

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

- Last Modified: Mon Feb 23 19:19:10 GMT 2026

- 18K bytes

- Click Count (0)

github.com/codelibs/fess

src/test/java/org/codelibs/fess/exception/JobNotFoundExceptionTest.java

        // Test with a long message
        String message = "This is a very long error message that describes in detail why the job was not found. "
                + "The job with identifier XYZ123 was expected to be in the system but could not be located "
                + "after searching through all available job registries and scheduled task databases.";

        JobNotFoundException exception = new JobNotFoundException(message);

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

- Last Modified: Sun Jan 11 08:43:05 GMT 2026

- 9.2K bytes

- Click Count (0)

github.com/google/guava

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

    this.delegate = delegate;
  }

  @Override
  protected Map<Class<? extends B>, B> delegate() {
    return delegate;
  }

  @Override
  @SuppressWarnings("unchecked") // value could not get in if not a T
  public <T extends B> @Nullable T getInstance(Class<T> type) {
    return (T) delegate.get(checkNotNull(type));
  }

  /**
   * Guaranteed to throw an exception and leave the map unmodified.

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

- Last Modified: Mon Sep 22 21:07:18 GMT 2025

- 7K bytes

- Click Count (0)

github.com/google/guava

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

     * execute Queue#drainTo is not added *on top* of waiting for the timeout (which could make
     * the timeout arbitrarily inaccurate, given a queue that is slow to drain).
     */
    long deadline = System.nanoTime() + unit.toNanos(timeout);
    int added = 0;
    while (added < numElements) {
      // we could rely solely on #poll, but #drainTo might be more efficient when there are multiple

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

- Last Modified: Mon Feb 23 19:19:10 GMT 2026

- 18.2K bytes

- Click Count (0)

Search Options