Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 51 - 60 of 74 for ask (0.01 seconds)

  1. android/guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt

    time, as it didn't sound at all the right word) `--but I shall
    have to ask them what the name of the country is, you know.
    Please, Ma'am, is this New Zealand or Australia?' (and she tried
    to curtsey as she spoke--fancy CURTSEYING as you're falling
    through the air!  Do you think you could manage it?)  `And what
    an ignorant little girl she'll think me for asking!  No, it'll
    never do to ask:  perhaps I shall see it written up somewhere.'
    
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Fri Apr 21 02:27:51 GMT 2017
    - 145.2K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/hash/HashFunction.java

     * Hasher}. Obtain a new hasher from the hash function using {@link #newHasher}, "push" the relevant
     * data into it using methods like {@link Hasher#putBytes(byte[])}, and finally ask for the {@code
     * HashCode} when finished using {@link Hasher#hash}. (See an {@linkplain #newHasher example} of
     * this.)
     *
     * <p>If all you want to hash is a single byte array, string or {@code long} value, there are
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 10.9K bytes
    - Click Count (0)
  3. guava/src/com/google/common/hash/HashFunction.java

     * Hasher}. Obtain a new hasher from the hash function using {@link #newHasher}, "push" the relevant
     * data into it using methods like {@link Hasher#putBytes(byte[])}, and finally ask for the {@code
     * HashCode} when finished using {@link Hasher#hash}. (See an {@linkplain #newHasher example} of
     * this.)
     *
     * <p>If all you want to hash is a single byte array, string or {@code long} value, there are
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 10.9K bytes
    - Click Count (0)
  4. LICENSE

    it in new free programs; and that you are informed that you can do
    these things.
    
      To protect your rights, we need to make restrictions that forbid
    distributors to deny you these rights or to ask you to surrender these
    rights.  These restrictions translate to certain responsibilities for
    you if you distribute copies of the library or if you modify it.
    
      For example, if you distribute copies of the library, whether gratis
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Mon Jan 18 20:25:38 GMT 2016
    - 25.8K bytes
    - Click Count (0)
  5. okhttp/src/jvmTest/kotlin/okhttp3/internal/tls/CertificatePinnerChainValidationTest.kt

       *       -> realVictim
       * ```
       *
       * The attacker compromises a CA. They take the public key from an intermediate certificate
       * signed by the compromised CA's certificate and uses it in a non-CA certificate. They ask the
       * pinned CA above to sign it for non-certificate-authority uses:
       *
       * ```
       *   pinnedRoot (trusted by CertificatePinner)
       *     -> pinnedIntermediate (trusted by CertificatePinner)
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Fri Jun 20 11:46:46 GMT 2025
    - 24.3K bytes
    - Click Count (2)
  6. cmd/erasure-metadata.go

    				fmt.Fprint(h, meta.TransitionStatus)
    				fmt.Fprint(h, meta.TransitionTier)
    				fmt.Fprint(h, meta.TransitionedObjName)
    				fmt.Fprint(h, meta.TransitionVersionID)
    			}
    
    			// If metadata says encrypted, ask for it in quorum.
    			if etyp, ok := crypto.IsEncrypted(meta.Metadata); ok {
    				fmt.Fprint(h, etyp)
    			}
    
    			// If compressed, look for compressed FileInfo only
    			if meta.IsCompressed() {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 21.3K bytes
    - Click Count (0)
  7. src/main/java/jcifs/smb1/smb1/SmbTransport.java

        //        MsrpcDfsRootEnum rpc;
        //        DcerpcHandle handle = null;
        //
        //        /* Procedure:
        //         * Lookup a DC in the target domain
        //         * Ask the DC for a referral for the domain (e.g. "\example.com")
        //         * Do NetrDfsEnumEx on the server returned in the referral to
        //         * get roots in target domain
        //         */
        //
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 31.8K bytes
    - Click Count (0)
  8. docs/en/docs/deployment/concepts.md

    On the other hand, if you have 2 servers and you are using **100% of their CPU and RAM**, at some point one process will ask for more memory, and the server will have to use the disk as "memory" (which can be thousands of times slower), or even **crash**. Or one process might need to do some computation and would have to wait until the CPU is free again.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sun Aug 31 09:15:41 GMT 2025
    - 18.6K bytes
    - Click Count (1)
  9. cmd/erasure-server-pool-rebalance.go

    	disks, _ := set.getOnlineDisksWithHealing(false)
    	if len(disks) == 0 {
    		return fmt.Errorf("no online drives found for set with endpoints %s", set.getEndpoints())
    	}
    
    	// However many we ask, versions must exist on ~50%
    	listingQuorum := (set.setDriveCount + 1) / 2
    
    	// How to resolve partial results.
    	resolver := metadataResolutionParams{
    		dirQuorum: listingQuorum, // make sure to capture all quorum ratios
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 28.7K bytes
    - Click Count (0)
  10. src/bytes/buffer_test.go

    	for i := 0; i <= 5; i++ {
    		for j := i; j <= 5; j++ {
    			for k := 0; k <= 6; k++ {
    				// 0 <= i <= j <= 5; 0 <= k <= 6
    				// Check that if we start with a buffer
    				// of length j at offset i and ask for
    				// Next(k), we get the right bytes.
    				buf := NewBuffer(b[0:j])
    				n, _ := buf.Read(tmp[0:i])
    				if n != i {
    					t.Fatalf("Read %d returned %d", i, n)
    				}
    				bb := buf.Next(k)
    				want := k
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Nov 14 19:01:17 GMT 2025
    - 19.4K bytes
    - Click Count (0)
Back to Top