Search Options

Results per page
Sort
Preferred Languages
Advance

Results 51 - 60 of 228 for skipped (0.05 sec)

  1. CHANGELOG/CHANGELOG-1.18.md

    - Pod Finalizers and Conditions updates are skipped for re-scheduling attempts ([#91298](https://github.com/kubernetes/kubernetes/pull/91298), [@alculquicondor](https://github.com/alculquicondor)) [SIG Scheduling]
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Wed Jun 16 17:18:28 UTC 2021
    - 373.2K bytes
    - Viewed (0)
  2. CHANGELOG/CHANGELOG-1.25.md

    to not return an error when the specified target can be detected as not a mount point. On Linux, the behavior of detecting a mount point depends on `umount` command is validated when the mounter is created. Additionally, mount point checks will be skipped in CleanupMountPoint/CleanupMountWithForce if the mounter's Unmount having the changed behavior of not returning error when target is not a mount point. ([#109676](https://github.com/kubernetes/kubernetes/pull/109676), [@cartermckinnon](https://g...
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Mon May 06 09:23:20 UTC 2024
    - 419.1K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/graph/PredecessorsFunction.java

     *
     * 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 :
     * someGraphAlgorithm(startNode, graph);
     * }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 4K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/graph/SuccessorsFunction.java

     *
     * 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 :
     * someGraphAlgorithm(startNode, graph);
     * }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  5. src/main/java/org/codelibs/core/timer/TimeoutTask.java

         * Cancels the task.
         */
        public void cancel() {
            status = CANCELED;
        }
    
        /**
         * Returns whether the task is stopped.
         *
         * @return whether the task is stopped
         */
        public boolean isStopped() {
            return status == STOPPED;
        }
    
        /**
         * Stops the timer.
         */
        public void stop() {
            if (status != ACTIVE) {
    Registered: Fri Sep 05 20:58:11 UTC 2025
    - Last Modified: Sat May 10 01:32:17 UTC 2025
    - 2.7K bytes
    - Viewed (0)
  6. src/main/java/org/codelibs/core/timer/TimeoutManager.java

        public synchronized void stop() {
            if (thread != null) {
                thread.interrupt();
                thread = null;
                if (logger.isDebugEnabled()) {
                    logger.debug("TimeoutManager stopped.");
                }
            }
        }
    
        /**
         * Interrupts the thread and waits for it to terminate.
         *
         * @param timeoutMillis
         *            The time to wait (in milliseconds)
    Registered: Fri Sep 05 20:58:11 UTC 2025
    - Last Modified: Sat May 10 01:32:17 UTC 2025
    - 7.8K bytes
    - Viewed (0)
  7. guava/src/com/google/common/graph/SuccessorsFunction.java

     *
     * 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 :
     * someGraphAlgorithm(startNode, graph);
     * }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  8. okhttp-sse/src/main/kotlin/okhttp3/sse/internal/RealEventSource.kt

              response,
            )
            return
          }
    
          // This is a long-lived response. Cancel full-call timeouts.
          call?.timeout()?.cancel()
    
          // Replace the body with a stripped one so the callbacks can't see real data.
          val response = response.stripBody()
    
          val reader = ServerSentEventReader(body.source(), this)
          try {
            if (!canceled) {
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sat Aug 30 11:47:47 UTC 2025
    - 3.3K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/collect/Tables.java

       * changes the contents of the transposed table and vice versa.
       *
       * <p>The returned table supports update operations as long as the input table supports the
       * analogous operation with swapped rows and columns. For example, in a {@link HashBasedTable}
       * instance, {@code rowKeySet().iterator()} supports {@code remove()} but {@code
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 24.9K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/base/Ascii.java

       * known as the XON code used for software flow control in serial communications. The main use is
       * restarting the transmission after the communication has been stopped by the XOFF control code.
       *
       * @since 8.0
       */
      public static final byte XON = 17; // aka DC1
    
      /**
       * Device Control 2. Characters for the control of ancillary devices associated with data
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 21.7K bytes
    - Viewed (0)
Back to top