Search Options

Results per page
Sort
Preferred Languages
Advance

Results 131 - 140 of 1,268 for three (0.03 sec)

  1. guava/src/com/google/common/base/Utf8.java

            // and overlong 2-byte form.
            if (byte1 < (byte) 0xC2 || bytes[index++] > (byte) 0xBF) {
              return false;
            }
          } else if (byte1 < (byte) 0xF0) {
            // Three-byte form.
            if (index + 1 >= end) {
              return false;
            }
            int byte2 = bytes[index++];
            if (byte2 > (byte) 0xBF
                // Overlong? 5 most significant bits must not all be zero.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 17 13:00:28 UTC 2024
    - 7K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/util/concurrent/ClosingFuture.java

     *       block or a {@link ListenableFuture}.
     *   <li>Each other step is derived from one or more input steps. At each step, zero or more objects
     *       can be captured for later closing.
     *   <li>There is one last step (the root of the tree), from which you can extract the final result
     *       of the computation. After that result is available (or the computation fails), all objects
     *       captured by any of the steps in the pipeline are closed.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Oct 08 19:36:35 UTC 2024
    - 98.5K bytes
    - Viewed (0)
  3. guava/src/com/google/common/collect/DiscreteDomain.java

    import java.util.NoSuchElementException;
    import javax.annotation.CheckForNull;
    
    /**
     * A descriptor for a <i>discrete</i> {@code Comparable} domain such as all {@link Integer}
     * instances. A discrete domain is one that supports the three basic operations: {@link #next},
     * {@link #previous} and {@link #distance}, according to their specifications. The methods {@link
     * #minValue} and {@link #maxValue} should also be overridden for bounded types.
     *
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Feb 22 21:19:52 UTC 2024
    - 10.3K bytes
    - Viewed (0)
  4. android/guava-testlib/src/com/google/common/collect/testing/AbstractContainerTester.java

          this.elements = elements;
          this.duplicate = duplicate;
        }
      }
    
      /**
       * @return an array of the proper size with a duplicate element. The size must be at least three.
       */
      protected ArrayWithDuplicate<E> createArrayWithDuplicateElement() {
        E[] elements = createSamplesArray();
        E duplicate = elements[(elements.length / 2) - 1];
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 8.8K bytes
    - Viewed (0)
  5. src/cmd/asm/internal/asm/asm.go

    }
    
    // asmText assembles a TEXT pseudo-op.
    // TEXT runtimeĀ·sigtramp(SB),4,$0-0
    func (p *Parser) asmText(operands [][]lex.Token) {
    	if len(operands) != 2 && len(operands) != 3 {
    		p.errorf("expect two or three operands for TEXT")
    		return
    	}
    
    	// Labels are function scoped. Patch existing labels and
    	// create a new label space for this TEXT.
    	p.patch()
    	p.labels = make(map[string]*obj.Prog)
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Mon Oct 21 14:11:44 UTC 2024
    - 25.5K bytes
    - Viewed (0)
  6. internal/dsync/dsync_test.go

    	}()
    
    	dm2nd.Lock(id, source)
    
    	// fmt.Printf("2nd lock obtained after 1st lock is released\n")
    	time.Sleep(testDrwMutexRefreshCallTimeout * 2)
    
    	dm2nd.Unlock(context.Background())
    }
    
    // Test three locks for same resource, one succeeds, one fails (after timeout)
    func TestThreeSimultaneousLocksForSameResource(t *testing.T) {
    	dm1st := NewDRWMutex(ds, "aap")
    	dm2nd := NewDRWMutex(ds, "aap")
    	dm3rd := NewDRWMutex(ds, "aap")
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Jun 19 14:35:19 UTC 2024
    - 11.1K bytes
    - Viewed (0)
  7. okhttp/src/test/java/okhttp3/URLConnectionTest.kt

          MockResponse(
            code = 401,
            headers = headersOf("WWW-Authenticate", "Basic realm=\"protected area\""),
            body = "Please authenticate.",
          )
        // Fail auth three times...
        server.enqueue(pleaseAuthenticate)
        server.enqueue(pleaseAuthenticate)
        server.enqueue(pleaseAuthenticate)
        // ...then succeed the fourth time.
        server.enqueue(
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Sat Jan 20 10:30:28 UTC 2024
    - 131.7K bytes
    - Viewed (0)
  8. src/main/java/jcifs/netbios/NbtAddress.java

                    this.calledName = null;
                }
            }
            else {
                this.calledName = null;
            }
    
            return this.calledName;
        }
    
    
        /*
         * There are three degrees of state that any NbtAddress can have.
         * 
         * 1) IP Address - If a dot-quad IP string is used with getByName (or used
         * to create an NbtAddress internal to this netbios package), no query is
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sun Jul 01 13:12:10 UTC 2018
    - 15.2K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/hash/Hashing.java

       *       take each of the servers offline, {@code consistentHash} will be a poor fit: It provides
       *       no way for you to specify which of the three buckets is disappearing. Thus, if your
       *       buckets change from {@code [alpha, bravo, charlie]} to {@code [bravo, charlie]}, it will
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Jul 19 16:02:36 UTC 2024
    - 29.3K bytes
    - Viewed (0)
  10. api/maven-api-core/src/main/java/org/apache/maven/api/services/DependencyResolverRequest.java

    import org.apache.maven.api.annotations.NotThreadSafe;
    import org.apache.maven.api.annotations.Nullable;
    
    /**
     * A request to collect the transitive dependencies and to build a dependency graph from them. There are three ways to
     * create a dependency graph. First, only the root dependency can be given. Second, a root dependency and direct
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Wed Oct 16 14:15:37 UTC 2024
    - 17.9K bytes
    - Viewed (0)
Back to top