Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 451 - 460 of 541 for representam (0.14 seconds)

  1. LICENSE

          "Derivative Works" shall mean any work, whether in Source or Object
          form, that is based on (or derived from) the Work and for which the
          editorial revisions, annotations, elaborations, or other modifications
          represent, as a whole, an original work of authorship. For the purposes
          of this License, Derivative Works shall not include works that remain
          separable from, or merely link (or bind by name) to the interfaces of,
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Mon Nov 29 17:31:56 GMT 2021
    - 13.3K bytes
    - Click Count (0)
  2. guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java

        SettableFuture<String> prev = orig;
        for (int i = 0; i < 100000; i++) {
          SettableFuture<String> curr = SettableFuture.create();
          prev.setFuture(curr);
          prev = curr;
        }
        // prev represents the 'innermost' future
        prev.set("done");
        assertTrue(orig.isDone());
      }
    
      // Verify that StackOverflowError in a long chain of SetFuture doesn't cause the entire toString
      // call to fail
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 11 20:45:32 GMT 2025
    - 46.8K bytes
    - Click Count (0)
  3. guava/src/com/google/common/cache/CacheBuilder.java

       * write operations. Expired entries are cleaned up as part of the routine maintenance described
       * in the class javadoc.
       *
       * <p>If you can represent the duration as a {@link Duration} (which should be preferred when
       * feasible), use {@link #expireAfterWrite(Duration)} instead.
       *
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Wed Oct 08 18:55:33 GMT 2025
    - 51.6K bytes
    - Click Count (0)
  4. LICENSES/vendor/cel.dev/expr/LICENSE

          "Derivative Works" shall mean any work, whether in Source or Object
          form, that is based on (or derived from) the Work and for which the
          editorial revisions, annotations, elaborations, or other modifications
          represent, as a whole, an original work of authorship. For the purposes
          of this License, Derivative Works shall not include works that remain
          separable from, or merely link (or bind by name) to the interfaces of,
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Wed Nov 06 20:53:17 GMT 2024
    - 11.2K bytes
    - Click Count (0)
  5. LICENSE

          "Derivative Works" shall mean any work, whether in Source or Object
          form, that is based on (or derived from) the Work and for which the
          editorial revisions, annotations, elaborations, or other modifications
          represent, as a whole, an original work of authorship. For the purposes
          of this License, Derivative Works shall not include works that remain
          separable from, or merely link (or bind by name) to the interfaces of,
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Wed Feb 22 18:59:39 GMT 2023
    - 11.1K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/hash/HashCode.java

       * is big-endian or little-endian depends on the byte order of {@link #asBytes}. This may be
       * surprising for implementations of {@code HashCode} that represent the number in big-endian
       * since everything else in the hashing API uniformly treats multibyte values as little-endian.
       *
       * <p>To create a {@code HashCode} from its string representation, see {@link #fromString}.
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Aug 11 19:31:30 GMT 2025
    - 12.6K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/graph/Graph.java

     *
     * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes.
     *
     * <p>There are three primary interfaces provided to represent graphs. In order of increasing
     * complexity they are: {@link Graph}, {@link ValueGraph}, and {@link Network}. You should generally
     * prefer the simplest interface that satisfies your use case. See the <a
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 13.6K bytes
    - Click Count (0)
  8. guava/src/com/google/common/graph/Graph.java

     *
     * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes.
     *
     * <p>There are three primary interfaces provided to represent graphs. In order of increasing
     * complexity they are: {@link Graph}, {@link ValueGraph}, and {@link Network}. You should generally
     * prefer the simplest interface that satisfies your use case. See the <a
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 13.6K bytes
    - Click Count (0)
  9. fess-crawler/src/main/java/org/codelibs/fess/crawler/client/storage/StorageClient.java

         * @return the response data containing metadata and optionally content
         * @throws CrawlingAccessException if an error occurs while accessing the resource
         * @throws ChildUrlsException if the URI represents a directory with child URLs
         */
        protected ResponseData getResponseData(final String uri, final boolean includeContent) {
            if (logger.isDebugEnabled()) {
    Created: Sat Dec 20 11:21:39 GMT 2025
    - Last Modified: Mon Nov 24 03:59:47 GMT 2025
    - 20K bytes
    - Click Count (2)
  10. fess-crawler/src/main/java/org/codelibs/fess/crawler/CrawlerThread.java

    import org.codelibs.fess.crawler.service.UrlQueueService;
    import org.codelibs.fess.crawler.util.CrawlingParameterUtil;
    
    import jakarta.annotation.Resource;
    
    /**
     * The {@code CrawlerThread} class represents a thread that executes the crawling process.
     * It is responsible for fetching URLs from the queue, accessing the content,
     * processing the response, and extracting child URLs.
     *
     * <p>
    Created: Sat Dec 20 11:21:39 GMT 2025
    - Last Modified: Thu Aug 07 02:55:08 GMT 2025
    - 20.4K bytes
    - Click Count (0)
Back to Top