Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 301 - 310 of 488 for small (0.03 seconds)

  1. src/archive/tar/testdata/gnu.tar

    small.txt Kilts small2.txt Google.com...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Mon Sep 08 04:08:51 GMT 2014
    - 3K bytes
    - Click Count (0)
  2. guava/src/com/google/common/collect/ImmutableBiMap.java

       *     new ImmutableBiMap.Builder<String, Integer>()
       *         .put("one", 1)
       *         .put("two", 2)
       *         .put("three", 3)
       *         .buildOrThrow();
       * }
       *
       * <p>For <i>small</i> immutable bimaps, the {@code ImmutableBiMap.of()} methods are even more
       * convenient.
       *
       * <p>By default, a {@code Builder} will generate bimaps that iterate over entries in the order
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 23 17:50:58 GMT 2025
    - 22.7K bytes
    - Click Count (0)
  3. src/test/java/jcifs/ntlmssp/Type2MessageTest.java

                byte[] rawMessage = originalMessage.toByteArray();
    
                // Manually set targetNameOff to a value that makes it too small for context/reserved
                Type2Message.writeULong(rawMessage, 16, 0); // targetNameOff is at byte 16
    
                // When
                Type2Message parsedMessage = new Type2Message(rawMessage);
    
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 38.9K bytes
    - Click Count (0)
  4. src/bytes/bytes.go

    			if j := bytealg.Index(s[i-last:], b[:n]); j >= 0 {
    				return i + j - last
    			}
    		} else {
    			// If bytealg.Index is not available a brute force search is
    			// ~1.5-3x faster than Rabin-Karp since n is small.
    			c0 := b[last]
    			c1 := b[last-1] // There are at least 2 chars to match
    		loop:
    			for ; i < len(s); i++ {
    				if s[i] == c0 && s[i-1] == c1 {
    					for k := 2; k < n; k++ {
    						if s[i-k] != b[last-k] {
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Mar 12 17:56:55 GMT 2026
    - 36.3K bytes
    - Click Count (0)
  5. docs/pt/docs/tutorial/metadata.md

    | Parâmetro | Tipo | Descrição |
    |------------|------|-------------|
    | `title` | `str` | O título da API. |
    | `summary` | `str` | Um breve resumo da API. <small>Disponível desde OpenAPI 3.1.0, FastAPI 0.99.0.</small> |
    | `description` | `str` | Uma breve descrição da API. Pode usar Markdown. |
    | `version` | `string` | A versão da API. Esta é a versão da sua aplicação, não do OpenAPI. Por exemplo, `2.5.0`. |
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:20:43 GMT 2026
    - 6.2K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/collect/Multimaps.java

      }
    
      /**
       * Creates a new {@code Multimap} backed by {@code map}, whose internal value collections are
       * generated by {@code factory}. Most users should prefer {@link MultimapBuilder}, though a small
       * number of users will need this method to cover map or collection types that {@link
       * MultimapBuilder} does not support.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 86K bytes
    - Click Count (0)
  7. guava/src/com/google/common/collect/Multimaps.java

      }
    
      /**
       * Creates a new {@code Multimap} backed by {@code map}, whose internal value collections are
       * generated by {@code factory}. Most users should prefer {@link MultimapBuilder}, though a small
       * number of users will need this method to cover map or collection types that {@link
       * MultimapBuilder} does not support.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 86.3K bytes
    - Click Count (0)
  8. guava/src/com/google/common/collect/MinMaxPriorityQueue.java

          Object[] newQueue = new Object[newCapacity];
          arraycopy(queue, 0, newQueue, 0, queue.length);
          queue = newQueue;
        }
      }
    
      /** Returns ~2x the old capacity if small; ~1.5x otherwise. */
      private int calculateNewCapacity() {
        int oldCapacity = queue.length;
        int newCapacity =
            (oldCapacity < 64) ? (oldCapacity + 1) * 2 : Math.multiplyExact(oldCapacity / 2, 3);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 34K bytes
    - Click Count (0)
  9. src/archive/tar/testdata/file-and-dir.tar

    small.txt Kilts...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Feb 13 18:36:49 GMT 2018
    - 2.5K bytes
    - Click Count (0)
  10. cmd/metacache-entries.go

    			Volume: bucket,
    			Name:   e.name,
    			Versions: []FileInfo{
    				{
    					Volume: bucket,
    					Name:   e.name,
    					Mode:   uint32(os.ModeDir),
    				},
    			},
    		}, nil
    	}
    	// Too small gains to reuse cache here.
    	return getFileInfoVersions(e.metadata, bucket, e.name, true)
    }
    
    // metaCacheEntries is a slice of metacache entries.
    type metaCacheEntries []metaCacheEntry
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Thu Aug 08 15:29:58 GMT 2024
    - 24.1K bytes
    - Click Count (0)
Back to Top