Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 561 - 570 of 2,463 for just (0.12 seconds)

  1. src/test/java/org/codelibs/fess/job/PythonJobTest.java

            } catch (JobProcessingException e) {
                assertEquals("Python Process terminated.", e.getMessage());
                assertNotNull(e.getCause());
                // Check cause message if available, otherwise just verify cause exists
                if (e.getCause().getMessage() != null) {
                    assertTrue(e.getCause().getMessage().contains("Process start failed"));
                }
            }
        }
    
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Mar 13 23:01:26 GMT 2026
    - 22.2K bytes
    - Click Count (0)
  2. docs/en/docs/tutorial/first-steps.md

    **FastAPI** generates a "schema" with all your API using the **OpenAPI** standard for defining APIs.
    
    #### "Schema" { #schema }
    
    A "schema" is a definition or description of something. Not the code that implements it, but just an abstract description.
    
    #### API "schema" { #api-schema }
    
    In this case, [OpenAPI](https://github.com/OAI/OpenAPI-Specification) is a specification that dictates how to define a schema of your API.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sat Mar 07 09:29:03 GMT 2026
    - 13.4K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/reflect/TypeResolver.java

            }
            Type[] resolvedBounds = new TypeResolver(forDependants).resolveTypes(bounds);
            /*
             * We'd like to simply create our own TypeVariable with the newly resolved bounds. There's
             * just one problem: We want to interoperate properly with the platform's built-in
             * implementation of TypeVariable, but the behavior of the built-in implementation differs
             * across platforms:
             *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 23 22:30:05 GMT 2025
    - 25.3K bytes
    - Click Count (0)
  4. guava-tests/test/com/google/common/reflect/InvokableTest.java

          this.prefix = prefix;
          this.times = times;
        }
    
        Prepender(String... varargs) {
          this(null, 0);
        }
    
        // just for testing
        private <T> Prepender() {
          this(null, 0);
        }
    
        static <T> Iterable<String> prepend(@NotBlank String first, Iterable<String> tail) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 12 17:47:10 GMT 2026
    - 31.1K bytes
    - Click Count (0)
  5. guava-tests/test/com/google/common/io/MoreFilesTest.java

                  Files.createDirectories(changingFile);
                  Files.createFile(dirToDelete.resolve("j/k"));
                } catch (FileAlreadyExistsException expected) {
                  // if a file already exists, that's fine... just continue
                }
    
                try {
                  method.delete(dirToDelete);
                } catch (FileSystemException expected) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 17 19:26:39 GMT 2026
    - 27.5K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/collect/Multimap.java

     *       the values corresponding to {@code key}
     * </ul>
     *
     * <p>The collections returned by the {@link #replaceValues replaceValues} and {@link #removeAll
     * removeAll} methods, which contain values that have just been removed from the multimap, are
     * naturally <i>not</i> views.
     *
     * <h3>Subinterfaces</h3>
     *
     * <p>Instead of using the {@code Multimap} interface directly, prefer the subinterfaces {@link
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 15K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/collect/CompactHashSet.java

          // move last entry to deleted spot
          Object object = elements[srcIndex];
          elements[dstIndex] = object;
          elements[srcIndex] = null;
    
          // move the last entry to the removed spot, just like we moved the element
          entries[dstIndex] = entries[srcIndex];
          entries[srcIndex] = 0;
    
          // also need to update whoever's "next" pointer was pointing to the last entry place
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Jul 08 18:32:10 GMT 2025
    - 23.9K bytes
    - Click Count (0)
  8. guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java

        public void remove() {
          if (lastRet < 0) throw new IllegalStateException();
          Object x = array[lastRet];
          lastRet = -1;
          // Traverse underlying queue to find == element,
          // not just a .equals element.
          monitor.enter();
          try {
            for (Iterator<E> it = q.iterator(); it.hasNext(); ) {
              if (it.next() == x) {
                it.remove();
                return;
              }
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 21:06:42 GMT 2026
    - 19K bytes
    - Click Count (0)
  9. src/main/java/jcifs/smb/SmbTransportPoolImpl.java

            if (startBracket != -1 && endBracket != -1 && endBracket > startBracket) {
                return transportStr.substring(startBracket + 1, endBracket);
            }
            // Fallback: just use address
            return transport.getRemoteAddress().getHostAddress();
        }
    
        /**
         * Get connection key from address and port
         */
        private String getConnectionKey(Address address, int port) {
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sun Aug 31 08:00:57 GMT 2025
    - 33.4K bytes
    - Click Count (0)
  10. guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java

      /**
       * Utility for remove and iterator.remove: Delete item at position i. Call only when occupying
       * monitor.
       */
      void removeAt(int i) {
        E[] items = this.items;
        // if removing front item, just advance
        if (i == takeIndex) {
          items[takeIndex] = null;
          takeIndex = inc(takeIndex);
        } else {
          // slide over all others up through putIndex.
          for (; ; ) {
            int nexti = inc(i);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 21:06:42 GMT 2026
    - 22.4K bytes
    - Click Count (0)
Back to Top