Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 161 - 170 of 2,806 for Sink (0.02 seconds)

  1. scripts/tests/test_translation_fixer/test_complex_doc/data/en_doc.md

    ## Markdown-style links { #markdown-style-links }
    
    This is a [Markdown link](https://example.com) to an external site.
    
    This is a link with attributes: [**FastAPI** Project Generators](project-generation.md){.internal-link target=_blank}
    
    This is a link to the main FastAPI site: [FastAPI](https://fastapi.tiangolo.com) - tool should add language code to the URL.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Tue Feb 17 08:08:04 GMT 2026
    - 7.6K bytes
    - Click Count (0)
  2. guava/src/com/google/common/base/Equivalence.java

        return new Wrapper<>(this, reference);
      }
    
      /**
       * Wraps an object so that {@link #equals(Object)} and {@link #hashCode()} delegate to an {@link
       * Equivalence}.
       *
       * <p>For example, given an {@link Equivalence} for {@link String strings} named {@code equiv}
       * that tests equivalence using their lengths:
       *
       * {@snippet :
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Jul 10 01:47:55 GMT 2025
    - 15K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/collect/SortedMultiset.java

    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
     * all cases, this implementation uses {@link Comparable#compareTo} or {@link Comparator#compare}
    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)
  4. guava/src/com/google/common/collect/SortedMultiset.java

    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
     * all cases, this implementation uses {@link Comparable#compareTo} or {@link Comparator#compare}
    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)
  5. guava-testlib/src/com/google/common/collect/testing/TestSortedMapGenerator.java

      /**
       * Returns an entry with a key less than the keys of the {@link #samples()} and less than the key
       * of {@link #belowSamplesGreater()}.
       */
      Entry<K, V> belowSamplesLesser();
    
      /**
       * Returns an entry with a key less than the keys of the {@link #samples()} but greater than the
       * key of {@link #belowSamplesLesser()}.
       */
      Entry<K, V> belowSamplesGreater();
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 1.9K bytes
    - Click Count (0)
  6. build-logic/documentation/src/main/groovy/gradlebuild/docs/FindBrokenInternalLinks.java

                String link = linkMatcher.group(1);
                File referencedFile = new File(getJavadocRoot().get().getAsFile(), link);
                if (!referencedFile.exists() || referencedFile.isDirectory()) {
                    String errMsg = "Missing Javadoc file for " + link + " in " + sourceFile.getName();
                    if (link.startsWith("javadoc")) {
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Thu Mar 12 23:22:57 GMT 2026
    - 12.8K bytes
    - Click Count (0)
  7. guava/src/com/google/common/collect/SneakyThrows.java

    /** Static utility method for unchecked throwing of any {@link Throwable}. */
    @GwtCompatible
    final class SneakyThrows<T extends Throwable> {
      /**
       * Throws {@code t} as if it were an unchecked {@link Throwable}.
       *
       * <p>This method is useful primarily when we make a reflective call to a method with no {@code
       * throws} clause: Java forces us to handle an arbitrary {@link Throwable} from that method,
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Dec 30 18:44:22 GMT 2024
    - 2.4K bytes
    - Click Count (0)
  8. build-logic/documentation/src/main/groovy/gradlebuild/docs/dsl/docbook/ElementWarningsRenderer.java

                para.appendChild(document.createTextNode(String.format("Note: This %s is ", type)));
                Element link = document.createElement("ulink");
                para.appendChild(link);
                link.setAttribute("url", "../userguide/feature_lifecycle.html");
                link.appendChild(document.createTextNode("deprecated"));
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Wed Dec 09 08:14:05 GMT 2020
    - 2.8K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/base/Stopwatch.java

     * successive readings of "now" in the same process.
     *
     * <p>In contrast, <i>wall time</i> is a reading of "now" as given by a method like
     * {@link System#currentTimeMillis()}, best represented as an {@link java.time.Instant}. Such values
     * <i>can</i> be subtracted to obtain a {@link Duration} (such as by {@link Duration#between}), but
     * doing so does <i>not</i> give a reliable measurement of elapsed time, because wall time readings
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Oct 08 18:55:33 GMT 2025
    - 9.5K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/graph/BaseGraph.java

       * {@link #edges()}, {@link #adjacentNodes(Object)}, {@link #predecessors(Object)}, {@link
       * #successors(Object)} and {@link #incidentEdges(Object)}.
       *
       * @since 29.0
       */
      ElementOrder<N> incidentEdgeOrder();
    
      /**
       * Returns a live view of this graph as a {@link Network} whose edges {@code E} are {@code
       * EndpointPair<N>} objects (that is, a {@code Network<N, EndpointPair<N>>}). The resulting {@code
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Nov 11 17:11:16 GMT 2025
    - 2.9K bytes
    - Click Count (0)
Back to Top