Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 471 - 480 of 637 for samples (0.05 seconds)

  1. android/guava/src/com/google/common/xml/XmlEscapers.java

         * replaces the allowed ASCII whitespace characters with themselves and to set the minimum safe
         * character to 0x20. However this would slow down the escaping of simple strings that contain
         * \t, \n, or \r.
         */
        for (char c = MIN_ASCII_CONTROL_CHAR; c <= MAX_ASCII_CONTROL_CHAR; c++) {
          if (c != '\t' && c != '\n' && c != '\r') {
            builder.addEscape(c, "\uFFFD");
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Sep 11 17:06:34 GMT 2025
    - 6.4K bytes
    - Click Count (0)
  2. docs/en/docs/async.md

    And as most of the execution time is taken by actual work (instead of waiting), and the work in a computer is done by a <abbr title="Central Processing Unit">CPU</abbr>, they call these problems "CPU bound".
    
    ---
    
    Common examples of CPU bound operations are things that require complex math processing.
    
    For example:
    
    * **Audio** or **image processing**.
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sun Aug 31 09:56:21 GMT 2025
    - 24K bytes
    - Click Count (0)
  3. src/builtin/builtin.go

    //   - String: the number of bytes in v.
    //   - Channel: the number of elements queued (unread) in the channel buffer;
    //     if v is nil, len(v) is zero.
    //
    // For some arguments, such as a string literal or a simple array expression, the
    // result can be a constant. See the Go language specification's "Length and
    // capacity" section for details.
    func len(v Type) int
    
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Mon Dec 30 23:59:23 GMT 2024
    - 12.8K bytes
    - Click Count (0)
  4. futures/listenablefuture1/src/com/google/common/util/concurrent/ListenableFuture.java

     * FluentFuture.transform}), but you will often find it easier to use a framework. Frameworks
     * automate the process, often adding features like monitoring, debugging, and cancellation.
     * Examples of frameworks include:
     *
     * <ul>
     *   <li><a href="https://dagger.dev/producers.html">Dagger Producers</a>
     * </ul>
     *
     * <p>The main purpose of {@link #addListener addListener} is to support this chaining. You will
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 8K bytes
    - Click Count (0)
  5. guava/src/com/google/common/util/concurrent/ListenableFuture.java

     * FluentFuture.transform}), but you will often find it easier to use a framework. Frameworks
     * automate the process, often adding features like monitoring, debugging, and cancellation.
     * Examples of frameworks include:
     *
     * <ul>
     *   <li><a href="https://dagger.dev/producers.html">Dagger Producers</a>
     * </ul>
     *
     * <p>The main purpose of {@link #addListener addListener} is to support this chaining. You will
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 8K bytes
    - Click Count (0)
  6. android/guava/pom.xml

                    <arg>${project.basedir}/src</arg>
                    <arg>--add-reads=com.google.common=ALL-UNNAMED</arg>
                    <!-- https://errorprone.info/docs/installation#maven -->
                    <arg>-XDcompilePolicy=simple</arg>
                  </compilerArgs>
                  <multiReleaseOutput>true</multiReleaseOutput>
                </configuration>
              </execution>
            </executions>
          </plugin>
          <plugin>
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Nov 17 21:36:50 GMT 2025
    - 9.8K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/hash/HashFunction.java

     *       at this goal. Important note: it may be easy to achieve the theoretical minimum collision
     *       rate when using completely <i>random</i> sample input. The true test of a hash function is
     *       how it performs on representative real-world data, which tends to contain many hidden
     *       patterns and clumps. The goal of a good hash function is to stamp these patterns out as
    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)
  8. guava/src/com/google/common/hash/HashFunction.java

     *       at this goal. Important note: it may be easy to achieve the theoretical minimum collision
     *       rate when using completely <i>random</i> sample input. The true test of a hash function is
     *       how it performs on representative real-world data, which tends to contain many hidden
     *       patterns and clumps. The goal of a good hash function is to stamp these patterns out as
    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)
  9. guava/src/com/google/common/net/InetAddresses.java

     * {@code InetAddress.getAddress()}) they are 4 and 16 bytes in length, respectively, and represent
     * the address in network byte order.
     *
     * <p>Examples of IP addresses and their byte representations:
     *
     * <dl>
     *   <dt>The IPv4 loopback address, {@code "127.0.0.1"}.
     *   <dd>{@code 7f 00 00 01}
     *   <dt>The IPv6 loopback address, {@code "::1"}.
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Wed Feb 19 21:24:11 GMT 2025
    - 47.4K bytes
    - Click Count (0)
  10. docs/es/docs/advanced/async-tests.md

    El `TestClient` está basado en <a href="https://www.python-httpx.org" class="external-link" target="_blank">HTTPX</a>, y afortunadamente, podemos usarlo directamente para probar la API.
    
    ## Ejemplo { #example }
    
    Para un ejemplo simple, consideremos una estructura de archivos similar a la descrita en [Aplicaciones Más Grandes](../tutorial/bigger-applications.md){.internal-link target=_blank} y [Testing](../tutorial/testing.md){.internal-link target=_blank}:
    
    ```
    .
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 20:41:43 GMT 2025
    - 4.2K bytes
    - Click Count (0)
Back to Top