Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1381 - 1390 of 9,836 for asnd (0.07 seconds)

  1. docs/en/docs/advanced/middleware.md

    And then you also read how to handle [CORS with the `CORSMiddleware`](../tutorial/cors.md){.internal-link target=_blank}.
    
    In this section we'll see how to use other middlewares.
    
    ## Adding ASGI middlewares { #adding-asgi-middlewares }
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 20:41:43 GMT 2025
    - 4.4K bytes
    - Click Count (0)
  2. guava/src/com/google/common/collect/ArrayListMultimap.java

     * existing key-value pair, the {@code ArrayListMultimap} will contain entries for both the new
     * value and the old value.
     *
     * <p>Keys and values may be null. All optional multimap methods are supported, and all returned
     * views are modifiable.
     *
     * <p>The lists returned by {@link #get}, {@link #removeAll}, and {@link #replaceValues} all
     * implement {@link java.util.RandomAccess}.
     *
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Fri Dec 05 23:15:58 GMT 2025
    - 6.8K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/collect/Multisets.java

       *
       * <p>The resulting multiset's iterators, and those of its {@code entrySet()} and {@code
       * elementSet()}, do not support {@code remove()}. However, all other multiset methods supported
       * by {@code unfiltered} are supported by the returned multiset. When given an element that
       * doesn't satisfy the predicate, the multiset's {@code add()} and {@code addAll()} methods throw
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 41.3K bytes
    - Click Count (0)
  4. guava/src/com/google/common/collect/Multisets.java

       *
       * <p>The resulting multiset's iterators, and those of its {@code entrySet()} and {@code
       * elementSet()}, do not support {@code remove()}. However, all other multiset methods supported
       * by {@code unfiltered} are supported by the returned multiset. When given an element that
       * doesn't satisfy the predicate, the multiset's {@code add()} and {@code addAll()} methods throw
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 41.2K bytes
    - Click Count (0)
  5. src/main/java/org/codelibs/fess/helper/ViewHelper.java

                }
            }
    
            return StringUtil.EMPTY;
        }
    
        /**
         * Escapes HTML and applies highlighting to text.
         * Handles boundary position detection if enabled.
         *
         * @param text the text to process
         * @return the escaped and highlighted text
         */
        protected String escapeHighlight(final String text) {
            final String escaped = LaFunctions.h(text);
    Created: Sat Dec 20 09:19:18 GMT 2025
    - Last Modified: Fri Nov 28 16:29:12 GMT 2025
    - 52.6K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/graph/Graph.java

       * same structural relationships as those in this graph.
       *
       * <p>Thus, two graphs A and B are equal if <b>all</b> of the following are true:
       *
       * <ul>
       *   <li>A and B have equal {@link #isDirected() directedness}.
       *   <li>A and B have equal {@link #nodes() node sets}.
       *   <li>A and B have equal {@link #edges() edge sets}.
       * </ul>
       *
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 13.6K bytes
    - Click Count (0)
  7. guava/src/com/google/common/graph/Graph.java

       * same structural relationships as those in this graph.
       *
       * <p>Thus, two graphs A and B are equal if <b>all</b> of the following are true:
       *
       * <ul>
       *   <li>A and B have equal {@link #isDirected() directedness}.
       *   <li>A and B have equal {@link #nodes() node sets}.
       *   <li>A and B have equal {@link #edges() edge sets}.
       * </ul>
       *
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 13.6K bytes
    - Click Count (0)
  8. src/test/java/jcifs/smb/SmbPipeInputStreamTest.java

            return new SmbPipeInputStream(handle, tree);
        }
    
        @Test
        @DisplayName("available() on SMB2 returns peeked byte count and interacts with tree")
        void available_smb2_happyPath() throws Exception {
            // Verify SMB2 path: IOCTL peek result is returned and resources are closed
            SmbPipeInputStream stream = newStreamWithMinimalStubs(true);
    
            // Arrange mocks for available()
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 9.9K bytes
    - Click Count (0)
  9. guava/src/com/google/common/primitives/UnsignedInteger.java

      }
    
      /**
       * Returns the result of adding this and {@code val}. If the result would have more than 32 bits,
       * returns the low 32 bits of the result.
       *
       * @since 14.0
       */
      public UnsignedInteger plus(UnsignedInteger val) {
        return fromIntBits(this.value + checkNotNull(val).value);
      }
    
      /**
       * Returns the result of subtracting this and {@code val}. If the result would be negative,
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 8.3K bytes
    - Click Count (0)
  10. guava/src/com/google/common/collect/RangeSet.java

       */
      @Nullable Range<C> rangeContaining(C value);
    
      /**
       * Returns {@code true} if there exists a non-empty range enclosed by both a member range in this
       * range set and the specified range. This is equivalent to calling {@code
       * subRangeSet(otherRange)} and testing whether the resulting range set is non-empty.
       *
       * @since 20.0
       */
      boolean intersects(Range<C> otherRange);
    
      /**
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 10.1K bytes
    - Click Count (0)
Back to Top