Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 421 - 430 of 1,386 for Exists (0.05 seconds)

  1. src/test/java/jcifs/http/NtlmServletTest.java

            // This should not throw an exception
            assertDoesNotThrow(() -> ntlmServlet.init(servletConfig));
        }
    
        /**
         * Test the service method when no Authorization header is present and no session exists.
         * Expects a 401 Unauthorized response with NTLM and Basic authentication challenges.
         * @throws ServletException
         * @throws IOException
         */
        @Test
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 21 04:51:33 GMT 2025
    - 11.5K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/collect/ImmutableSortedMultiset.java

        throw new InvalidObjectException("Use SerializedForm");
      }
    
      /**
       * Not supported. Use {@link #toImmutableSortedMultiset} instead. This method exists only to hide
       * {@link ImmutableMultiset#toImmutableMultiset} from consumers of {@code
       * ImmutableSortedMultiset}.
       *
       * @throws UnsupportedOperationException always
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue May 13 17:27:14 GMT 2025
    - 35.2K bytes
    - Click Count (0)
  3. docs/en/docs/tutorial/security/first-steps.md

    If it doesn't see an `Authorization` header, or the value doesn't have a `Bearer ` token, it will respond with a 401 status code error (`UNAUTHORIZED`) directly.
    
    You don't even have to check if the token exists to return an error. You can be sure that if your function is executed, it will have a `str` in that token.
    
    You can try it already in the interactive docs:
    
    <img src="/img/tutorial/security/image03.png">
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sat Mar 07 09:29:03 GMT 2026
    - 8.3K bytes
    - Click Count (0)
  4. src/main/java/org/codelibs/fess/suggest/util/MapValueExtractor.java

        }
    
        /**
         * Checks if the map contains the specified key and the value is not null.
         *
         * @param map The source map
         * @param key The key to check
         * @return true if the key exists and its value is not null
         */
        public static boolean hasValue(final Map<String, Object> map, final String key) {
            return map.containsKey(key) && map.get(key) != null;
        }
    Created: Fri Apr 17 09:08:13 GMT 2026
    - Last Modified: Sun Feb 01 12:48:24 GMT 2026
    - 9.8K bytes
    - Click Count (0)
  5. src/test/java/jcifs/smb/DirFileEntryEnumIterator2Test.java

                Object arg = inv.getArgument(0);
                if (arg instanceof Smb2CreateRequest) {
                    Smb2CreateRequest create = (Smb2CreateRequest) arg;
                    // Initialize response chain so query exists
                    create.initResponse(cifsContext);
                    Smb2QueryDirectoryRequest q = (Smb2QueryDirectoryRequest) getNextOf(create);
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 13.7K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/primitives/Chars.java

       * @param target a primitive {@code char} value
       * @return the least index {@code i} for which {@code array[i] == target}, or {@code -1} if no
       *     such index exists.
       */
      public static int indexOf(char[] array, char target) {
        return indexOf(array, target, 0, array.length);
      }
    
      // TODO(kevinb): consider making this public
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 24.2K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/graph/Network.java

       */
      Set<E> edgesConnecting(EndpointPair<N> endpoints);
    
      /**
       * Returns the single edge that directly connects {@code nodeU} to {@code nodeV}, if one is
       * present, or {@code null} if no such edge exists.
       *
       * <p>In an undirected network, this is equal to {@code edgeConnectingOrNull(nodeV, nodeU)}.
       *
       * @throws IllegalArgumentException if there are multiple parallel edges connecting {@code nodeU}
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 17.6K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/io/MoreFiles.java

        // actually exists and then append the normalized remainder of the path to that.
        Path normalizedAbsolutePath = path.toAbsolutePath().normalize();
        Path parent = normalizedAbsolutePath.getParent();
        if (parent == null) {
          // The given directory is a filesystem root. All zero of its ancestors exist. This doesn't
          // mean that the root itself exists -- consider x:\ on a Windows machine without such a
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Apr 14 16:07:06 GMT 2025
    - 34.6K bytes
    - Click Count (0)
  9. tensorflow/c/eager/immediate_execution_context.h

      virtual absl::Status AsyncWait() = 0;
    
      // Add a function (serialized FunctionDef protocol buffer) so that it can
      // be executed as an op. Return error if the function with the same name
      // already exists.
      virtual absl::Status AddFunctionDef(const FunctionDef& fdef) = 0;
    
      // Notifies about the function removal.
      virtual absl::Status AddRemoveFunctionNotifier(
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Sat Oct 12 05:11:17 GMT 2024
    - 12.3K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/primitives/ImmutableDoubleArray.java

        Preconditions.checkElementIndex(index, length());
        return array[start + index];
      }
    
      /**
       * Returns the smallest index for which {@link #get} returns {@code target}, or {@code -1} if no
       * such index exists. Values are compared as if by {@link Double#equals}. Equivalent to {@code
       * asList().indexOf(target)}.
       */
      public int indexOf(double target) {
        for (int i = start; i < end; i++) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 12 14:49:24 GMT 2025
    - 22.7K bytes
    - Click Count (0)
Back to Top