Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 201 - 210 of 458 for spacer (0.05 seconds)

  1. src/archive/zip/zip_test.go

    	return buf
    }
    
    func (ss *suffixSaver) Write(p []byte) (n int, err error) {
    	n = len(p)
    	ss.size += int64(len(p))
    	if len(ss.buf) < ss.keep {
    		space := ss.keep - len(ss.buf)
    		add := len(p)
    		if add > space {
    			add = space
    		}
    		ss.buf = append(ss.buf, p[:add]...)
    		p = p[add:]
    	}
    	for len(p) > 0 {
    		n := copy(ss.buf[ss.start:], p)
    		p = p[n:]
    		ss.start += n
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu May 23 01:00:11 GMT 2024
    - 19.6K bytes
    - Click Count (0)
  2. docs/fr/docs/python-types.md

    * Prend un `first_name` et un `last_name`.
    * Convertit la première lettre de chacun en majuscule avec `title()`.
    * <dfn title="Les met ensemble, en un seul. Avec le contenu de l'un après l'autre.">Concatène</dfn> ces deux valeurs avec un espace au milieu.
    
    {* ../../docs_src/python_types/tutorial001_py310.py hl[2] *}
    
    ### Modifier le code { #edit-it }
    
    C'est un programme très simple.
    
    Mais maintenant imaginez que vous l'écriviez de zéro.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:37:13 GMT 2026
    - 12.7K bytes
    - Click Count (0)
  3. guava/src/com/google/common/base/CaseFormat.java

        // deal with camel conversion
        StringBuilder out = null;
        int i = 0;
        int j = -1;
        while ((j = wordBoundary.indexIn(s, ++j)) != -1) {
          if (i == 0) {
            // include some extra space for separators
            out = new StringBuilder(s.length() + 4 * format.wordSeparator.length());
            out.append(format.normalizeFirstWord(s.substring(i, j)));
          } else {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Dec 03 18:46:33 GMT 2025
    - 6.5K bytes
    - Click Count (0)
  4. src/main/assemblies/files/fess.in.bat

    REM Causes the JVM to dump its heap on OutOfMemory.
    REM set FESS_JAVA_OPTS=%FESS_JAVA_OPTS% -XX:+HeapDumpOnOutOfMemoryError
    REM The path to the heap dump location, note directory must exists and have enough
    REM space for a full heap dump.
    REM FESS_JAVA_OPTS=%FESS_JAVA_OPTS% -XX:HeapDumpPath=%FESS_HOME%/logs/heapdump.hprof
    
    REM Disables explicit GC
    set FESS_JAVA_OPTS=%FESS_JAVA_OPTS% -XX:+DisableExplicitGC
    
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Thu Nov 27 03:48:59 GMT 2025
    - 4.8K bytes
    - Click Count (0)
  5. guava-testlib/src/com/google/common/testing/SerializableTester.java

       * of the same class. For example, if sublists of {@code MyList} instances were serializable,
       * those sublists might implement a private {@code MySubList} type but serialize as a plain {@code
       * MyList} to save space. So long as {@code MyList} has all the public supertypes of {@code
       * MySubList}, this is safe. For these cases, for which {@code reserializeAndAssert} is too
       * strict, use {@link #reserialize}.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Dec 21 14:50:24 GMT 2024
    - 4.1K bytes
    - Click Count (0)
  6. okhttp/src/jvmTest/kotlin/okhttp3/HeadersJvmTest.kt

            .add("foo : bak") // Name trailing whitespace is trimmed.
            .add("\tkey\t:\tvalue\t") // '\t' also counts as whitespace
            .add("ping:  pong  ") // Value whitespace is trimmed.
            .add("kit:kat") // Space after colon is not required.
            .build()
        assertThat(headers.values("foo")).containsExactly("bar", "baz", "bak")
        assertThat(headers.values("key")).containsExactly("value")
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue May 27 14:51:25 GMT 2025
    - 5.7K bytes
    - Click Count (0)
  7. docs/fr/docs/how-to/separate-openapi-schemas.md

    # Séparer les schémas OpenAPI pour l'entrée et la sortie ou non { #separate-openapi-schemas-for-input-and-output-or-not }
    
    Depuis la sortie de **Pydantic v2**, l'OpenAPI généré est un peu plus précis et **correct** qu'avant. 😎
    
    En fait, dans certains cas, il y aura même **deux schémas JSON** dans OpenAPI pour le même modèle Pydantic, pour l'entrée et pour la sortie, selon s'ils ont des **valeurs par défaut**.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sat Feb 14 08:12:41 GMT 2026
    - 5.1K bytes
    - Click Count (0)
  8. src/main/java/jcifs/dcerpc/ndr/NdrBuffer.java

         * @return the buffer capacity
         */
        public int getCapacity() {
            return this.buf.length - this.start;
        }
    
        /**
         * Returns the available space at the tail of the buffer.
         *
         * @return the available tail space
         */
        public int getTailSpace() {
            return this.buf.length - this.index;
        }
    
        /**
         * Returns the underlying byte buffer.
         *
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 10.7K bytes
    - Click Count (0)
  9. docs/de/docs/how-to/separate-openapi-schemas.md

    In diesem Fall können Sie diese Funktion in **FastAPI** mit dem Parameter `separate_input_output_schemas=False` deaktivieren.
    
    /// info | Info
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Wed Dec 24 10:28:19 GMT 2025
    - 5.2K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/collect/Comparators.java

       *
       * <p>This {@code Collector} uses O(k) memory and takes expected time O(n) (worst-case O(n log
       * k)), as opposed to e.g. {@code Stream.sorted(comparator).limit(k)}, which currently takes O(n
       * log n) time and O(n) space.
       *
       * @throws IllegalArgumentException if {@code k < 0}
       * @since 33.2.0 (available since 22.0 in guava-jre)
       */
      @IgnoreJRERequirement // Users will use this only if they're already using streams.
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 11.5K bytes
    - Click Count (0)
Back to Top