Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 44 for prepending (0.07 seconds)

  1. android/guava/src/com/google/common/net/InternetDomainName.java

        }
        String ancestorName = name.substring(substringFrom);
    
        return new InternetDomainName(ancestorName, ancestorParts);
      }
    
      /**
       * Creates and returns a new {@code InternetDomainName} by prepending the argument and a dot to
       * the current name. For example, {@code InternetDomainName.from("foo.com").child("www.bar")}
       * returns a new {@code InternetDomainName} with the value {@code www.bar.foo.com}. Only lenient
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 21:21:59 GMT 2026
    - 26.2K bytes
    - Click Count (0)
  2. docs/en/docs/how-to/conditional-openapi.md

    # Conditional OpenAPI { #conditional-openapi }
    
    If you needed to, you could use settings and environment variables to configure OpenAPI conditionally depending on the environment, and even disable it entirely.
    
    ## About security, APIs, and docs { #about-security-apis-and-docs }
    
    Hiding your documentation user interfaces in production *shouldn't* be the way to protect your API.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 2.4K bytes
    - Click Count (0)
  3. docs/en/docs/deployment/index.md

    ## Deployment Strategies { #deployment-strategies }
    
    There are several ways to do it depending on your specific use case and the tools that you use.
    
    You could **deploy a server** yourself using a combination of tools, you could use a **cloud service** that does part of the work for you, or other possible options.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 1.5K bytes
    - Click Count (0)
  4. docs/en/docs/how-to/graphql.md

    If you need or want to work with **GraphQL**, [**Strawberry**](https://strawberry.rocks/) is the **recommended** library as it has the design closest to **FastAPI's** design, it's all based on **type annotations**.
    
    Depending on your use case, you might prefer to use a different library, but if you asked me, I would probably suggest you try **Strawberry**.
    
    Here's a small preview of how you could integrate Strawberry with FastAPI:
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 2.7K bytes
    - Click Count (0)
  5. src/test/java/org/codelibs/fess/it/admin/StorageTests.java

                    given().header("Authorization", getTestToken()).when().get(getApiPath() + "/download/nonexistent_file_12345.txt");
    
            int statusCode = response.getStatusCode();
            // Accept 404 or 200 with error (depending on implementation)
            assertTrue(statusCode == 200 || statusCode == 404 || statusCode == 500,
                    "Status code should be 200, 404 or 500, but was " + statusCode);
        }
    
        @Test
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Mar 13 23:01:26 GMT 2026
    - 5.3K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/graph/PredecessorsFunction.java

     *
     * <h3>Usage</h3>
     *
     * Given an algorithm, for example:
     *
     * {@snippet :
     * public <N> someGraphAlgorithm(N startNode, PredecessorsFunction<N> predecessorsFunction);
     * }
     *
     * you will invoke it depending on the graph representation you're using.
     *
     * <p>If you have an instance of one of the primary {@code common.graph} types ({@link Graph},
     * {@link ValueGraph}, and {@link Network}):
     *
     * {@snippet :
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 4K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/graph/SuccessorsFunction.java

     *
     * <h3>Usage</h3>
     *
     * Given an algorithm, for example:
     *
     * {@snippet :
     * public <N> someGraphAlgorithm(N startNode, SuccessorsFunction<N> successorsFunction);
     * }
     *
     * you will invoke it depending on the graph representation you're using.
     *
     * <p>If you have an instance of one of the primary {@code common.graph} types ({@link Graph},
     * {@link ValueGraph}, and {@link Network}):
     *
     * {@snippet :
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 4.2K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/collect/Interners.java

      public static InternerBuilder newBuilder() {
        return new InternerBuilder();
      }
    
      /**
       * Returns a new thread-safe interner which retains a strong reference to each instance it has
       * interned, thus preventing these instances from being garbage-collected. If this retention is
       * acceptable, this implementation may perform better than {@link #newWeakInterner}.
       */
      public static <E> Interner<E> newStrongInterner() {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Mar 08 16:16:42 GMT 2026
    - 6K bytes
    - Click Count (0)
  9. docs/en/docs/tutorial/index.md

    But you should first read the **Tutorial - User Guide** (what you are reading right now).
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sat Mar 07 09:29:03 GMT 2026
    - 5.3K bytes
    - Click Count (0)
  10. guava/src/com/google/common/collect/Interners.java

      public static InternerBuilder newBuilder() {
        return new InternerBuilder();
      }
    
      /**
       * Returns a new thread-safe interner which retains a strong reference to each instance it has
       * interned, thus preventing these instances from being garbage-collected. If this retention is
       * acceptable, this implementation may perform better than {@link #newWeakInterner}.
       */
      public static <E> Interner<E> newStrongInterner() {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Mar 08 16:16:42 GMT 2026
    - 6K bytes
    - Click Count (0)
Back to Top