Search Options

Results per page
Sort
Preferred Languages
Advance

Results 311 - 320 of 412 for indented (0.05 sec)

  1. src/main/java/jcifs/Configuration.java

         *
         * @return whether to use strict resource lifecycle
         */
        boolean isStrictResourceLifecycle();
    
        /**
         * This is solely intended for debugging
         *
         * @return whether to track the locations from which resources were created
         */
        boolean isTraceResourceUsage();
    
        /**
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sun Aug 31 08:00:57 UTC 2025
    - 25.4K bytes
    - Viewed (0)
  2. LICENSES/vendor/cyphar.com/go-pathrs/LICENSE

    Contributions are its original creation(s) or it has sufficient rights
    to grant the rights to its Contributions conveyed by this License.
    
    2.6. Fair Use
    
    This License is not intended to limit any rights You have under
    applicable copyright doctrines of fair use, fair dealing, or other
    equivalents.
    
    2.7. Conditions
    
    Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted
    Registered: Fri Dec 26 09:05:12 UTC 2025
    - Last Modified: Wed Nov 12 14:46:31 UTC 2025
    - 16.5K bytes
    - Viewed (0)
  3. docs/LICENSE

    following considerations are for informational purposes only, are not
    exhaustive, and do not form part of our licenses.
    
         Considerations for licensors: Our public licenses are
         intended for use by those authorized to give the public
         permission to use material in ways otherwise restricted by
         copyright and certain other rights. Our licenses are
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Mon May 10 16:50:06 UTC 2021
    - 18.2K bytes
    - Viewed (0)
  4. okhttp/src/jvmTest/kotlin/okhttp3/internal/connection/RouteSelectorTest.kt

        // Extract the regular sequence of routes from selector.
        val selection1 = routeSelector.next()
        val regularRoutes = selection1.routes
    
        // Check that we do indeed have more than one route.
        assertThat(regularRoutes.size).isEqualTo(numberOfAddresses)
        // Add first regular route as failed.
        routeDatabase.failed(regularRoutes[0])
        // Reset selector
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Wed Oct 08 03:50:05 UTC 2025
    - 20.3K bytes
    - Viewed (0)
  5. guava/src/com/google/common/util/concurrent/Striped.java

       * stripes (much like the birthday paradox, where much fewer than anticipated birthdays are needed
       * for a pair of them to match). Please consider carefully the implications of the number of
       * stripes, the intended concurrency level, and the typical number of keys used in a {@code
       * bulkGet(keys)} operation. See <a href="http://www.mathpages.com/home/kmath199.htm">Balls in
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Sep 16 22:01:32 UTC 2025
    - 20.6K bytes
    - Viewed (0)
  6. docs/en/docs/tutorial/query-params-str-validations.md

    Let's take this application as example:
    
    {* ../../docs_src/query_params_str_validations/tutorial001_py310.py hl[7] *}
    
    The query parameter `q` is of type `str | None`, that means that it's of type `str` but could also be `None`, and indeed, the default value is `None`, so FastAPI will know it's not required.
    
    /// note
    
    FastAPI will know that the value of `q` is not required because of the default value `= None`.
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sat Dec 20 15:55:38 UTC 2025
    - 16.7K bytes
    - Viewed (0)
  7. src/bytes/bytes.go

    func LastIndexFunc(s []byte, f func(r rune) bool) int {
    	return lastIndexFunc(s, f, true)
    }
    
    // indexFunc is the same as IndexFunc except that if
    // truth==false, the sense of the predicate function is
    // inverted.
    func indexFunc(s []byte, f func(r rune) bool, truth bool) int {
    	start := 0
    	for start < len(s) {
    		r, wid := utf8.DecodeRune(s[start:])
    		if f(r) == truth {
    			return start
    		}
    		start += wid
    	}
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Tue Sep 16 16:42:15 UTC 2025
    - 35.5K bytes
    - Viewed (0)
  8. impl/maven-cli/src/main/java/org/apache/maven/cling/invoker/mvnup/goals/InferenceStrategy.java

                processedPoms.add(pomPath);
    
                String currentVersion = ModelVersionUtils.detectModelVersion(pomDocument);
                context.info(pomPath + " (current: " + currentVersion + ")");
                context.indent();
    
                try {
                    if (!ModelVersionUtils.isEligibleForInference(currentVersion)) {
                        context.warning(
    Registered: Sun Dec 28 03:35:09 UTC 2025
    - Last Modified: Tue Nov 18 18:03:26 UTC 2025
    - 27.6K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/io/CharSource.java

     * encoding} may be viewed as a {@code CharSource} using {@link ByteSource#asCharSource(Charset)}.
     *
     * <p><b>Note:</b> In general, {@code CharSource} is intended to be used for "file-like" sources
     * that provide readers that are:
     *
     * <ul>
     *   <li><b>Finite:</b> Many operations, such as {@link #length()} and {@link #read()}, will either
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Sep 08 18:35:13 UTC 2025
    - 25.7K bytes
    - Viewed (0)
  10. guava/src/com/google/common/collect/LinkedListMultimap.java

          nextSibling.previous = node;
          nextSibling.previousSibling = node;
        }
        size++;
        return node;
      }
    
      /**
       * Removes the specified node from the linked list. This method is only intended to be used from
       * the {@code Iterator} classes. See also {@link LinkedListMultimap#removeAllNodes(Object)}.
       */
      private void removeNode(Node<K, V> node) {
        if (node.previous != null) {
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Sep 22 18:35:44 UTC 2025
    - 27K bytes
    - Viewed (0)
Back to top