Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 101 - 110 of 613 for OVER (0.03 seconds)

  1. src/test/java/org/codelibs/fess/ds/callback/FileListIndexUpdateCallbackImplTest.java

            assertNull(exceptions[0], "Add thread threw exception");
            assertNull(exceptions[1], "Clear thread threw exception");
        }
    
        /**
         * Test iteration over deleteUrlList while synchronized.
         * This simulates what happens in deleteDocuments() method.
         */
        @Test
        public void test_deleteUrlList_iteration() throws Exception {
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Wed Jan 14 14:29:07 GMT 2026
    - 19.7K bytes
    - Click Count (0)
  2. okhttp-dnsoverhttps/src/main/kotlin/okhttp3/dnsoverhttps/DnsOverHttps.kt

    /**
     * [DNS over HTTPS implementation][doh_spec].
     *
     * > A DNS API client encodes a single DNS query into an HTTP request
     * > using either the HTTP GET or POST method and the other requirements
     * > of this section.  The DNS API server defines the URI used by the
     * > request through the use of a URI Template.
     *
     * [doh_spec]: https://tools.ietf.org/html/draft-ietf-doh-dns-over-https-13
     */
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sat May 10 11:15:14 GMT 2025
    - 8.6K bytes
    - Click Count (0)
  3. docs/zh-hant/docs/tutorial/stream-json-lines.md

        App->>Client: Send Item 2
        App->>App: Produce Item 3
        Client->>Client: Process Item 2
        App->>Client: Send Item 3
        Client->>Client: Process Item 3
        Note over App: Keeps producing...
        Note over Client: Keeps consuming...
    ```
    
    它甚至可以是無限串流,你可以一直持續傳送資料。
    
    ## JSON Lines { #json-lines }
    
    在這些情況下,常見做法是傳送「**JSON Lines**」,這是一種每一行各包含一個 JSON 物件的格式。
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 14:33:04 GMT 2026
    - 4.2K bytes
    - Click Count (0)
  4. cmd/lock-rest-server.go

    package cmd
    
    import (
    	"context"
    	"time"
    
    	"github.com/minio/minio/internal/dsync"
    	"github.com/minio/minio/internal/grid"
    	"github.com/minio/minio/internal/logger"
    )
    
    // To abstract a node over network.
    type lockRESTServer struct {
    	ll *localLocker
    }
    
    // RefreshHandler - refresh the current lock
    func (l *lockRESTServer) RefreshHandler(args *dsync.LockArgs) (*dsync.LockResp, *grid.RemoteErr) {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Jan 31 19:54:34 GMT 2025
    - 6.3K bytes
    - Click Count (0)
  5. guava-testlib/src/com/google/common/collect/testing/google/UnmodifiableCollectionTests.java

        } catch (UnsupportedOperationException expected) {
        }
      }
    
      /**
       * Verifies that an Iterator is unmodifiable.
       *
       * <p>This test only works with iterators that iterate over a finite set.
       */
      public static void assertIteratorIsUnmodifiable(Iterator<?> iterator) {
        while (iterator.hasNext()) {
          iterator.next();
          try {
            iterator.remove();
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Aug 10 19:54:19 GMT 2025
    - 14.9K bytes
    - Click Count (0)
  6. samples/unixdomainsockets/src/main/java/okhttp3/unixdomainsockets/UnixDomainSocketFactory.java

    import java.net.InetAddress;
    import java.net.InetSocketAddress;
    import java.net.Socket;
    import javax.net.SocketFactory;
    import jnr.unixsocket.UnixSocketChannel;
    
    /** Impersonate TCP-style SocketFactory over UNIX domain sockets. */
    public final class UnixDomainSocketFactory extends SocketFactory {
      private final File path;
    
      public UnixDomainSocketFactory(File path) {
        this.path = path;
      }
    
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sun Dec 03 21:33:52 GMT 2023
    - 2.1K bytes
    - Click Count (0)
  7. futures/listenablefuture1/pom.xml

        27.0, depends on
        listenablefuture-9999.0-empty-to-avoid-conflict-with-guava. The 9999.0-...
        version number is enough for some build systems (notably, Gradle) to select
        that empty artifact over the "real" listenablefuture-1.0 -- avoiding a
        conflict with the copy of ListenableFuture in guava itself. If users are
        using an older version of Guava or a build system other than Gradle, they
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Oct 02 19:27:26 GMT 2025
    - 2.1K bytes
    - Click Count (0)
  8. guava/src/com/google/common/collect/RangeMap.java

       * Returns a view of this range map as an unmodifiable {@code Map<Range<K>, V>}. Modifications to
       * this range map are guaranteed to read through to the returned {@code Map}.
       *
       * <p>The returned {@code Map} iterates over entries in ascending order of the bounds of the
       * {@code Range} entries.
       *
       * <p>It is guaranteed that no empty ranges will be in the returned {@code Map}.
       */
      Map<Range<K>, V> asMapOfRanges();
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 7.6K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/graph/GraphConnections.java

     * @param <V> Value parameter type
     */
    interface GraphConnections<N, V> {
    
      Set<N> adjacentNodes();
    
      Set<N> predecessors();
    
      Set<N> successors();
    
      /**
       * Returns an iterator over the incident edges.
       *
       * @param thisNode The node that this all of the connections in this class are connected to.
       */
      Iterator<EndpointPair<N>> incidentEdgeIterator(N thisNode);
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 2.4K bytes
    - Click Count (0)
  10. guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java

        E[] items = this.items;
        // if removing front item, just advance
        if (i == takeIndex) {
          items[takeIndex] = null;
          takeIndex = inc(takeIndex);
        } else {
          // slide over all others up through putIndex.
          for (; ; ) {
            int nexti = inc(i);
            if (nexti != putIndex) {
              items[i] = items[nexti];
              i = nexti;
            } else {
              items[i] = null;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 21:06:42 GMT 2026
    - 22.4K bytes
    - Click Count (0)
Back to Top