Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 481 - 490 of 659 for skip1 (0.03 seconds)

  1. internal/hash/checksum.go

    		t, n := binary.Uvarint(b)
    		if n <= 0 {
    			break
    		}
    		b = b[n:]
    
    		typ := ChecksumType(t)
    		length := typ.RawByteLen()
    		if length == 0 || len(b) < length {
    			break
    		}
    		// Skip main checksum
    		b = b[length:]
    		parts, n := binary.Uvarint(b)
    		if n <= 0 {
    			break
    		}
    		if !typ.Is(ChecksumIncludesMultipart) {
    			continue
    		}
    
    		if len(res) == 0 {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 22 14:15:21 GMT 2025
    - 18.3K bytes
    - Click Count (0)
  2. CHANGELOG/CHANGELOG-1.18.md

    - Kubectl/drain: add skip-wait-for-delete-timeout option. If a pod’s  `DeletionTimestamp` is older than N seconds, skip waiting for the pod.  Seconds must be greater than 0 to skip. ([#85577](https://github.com/kubernetes/kubernetes/pull/85577), [@michaelgugino](https://github.com/michaelgugino)) [SIG CLI]
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Wed Jun 16 17:18:28 GMT 2021
    - 373.2K bytes
    - Click Count (0)
  3. src/main/java/org/codelibs/fess/opensearch/client/SearchEngineClient.java

         * atomically switches aliases, then cleans up old and backup indices.
         *
         * @param loadBulkData    whether to load default bulk data after rebuilding (using OpType.CREATE to skip existing documents)
         * @param targetPrefixes  the set of index prefixes to rebuild (e.g., "fess_config", "fess_user", "fess_log")
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Thu Mar 26 14:36:23 GMT 2026
    - 138.6K bytes
    - Click Count (1)
  4. guava/src/com/google/common/collect/Collections2.java

          calculateNextPermutation();
          return next;
        }
    
        void calculateNextPermutation() {
          j = list.size() - 1;
          int s = 0;
    
          // Handle the special case of an empty list. Skip the calculation of the
          // next permutation.
          if (j == -1) {
            return;
          }
    
          while (true) {
            int q = c[j] + o[j];
            if (q < 0) {
              switchDirection();
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Mar 08 16:16:42 GMT 2026
    - 23K bytes
    - Click Count (0)
  5. CHANGELOG/CHANGELOG-1.32.md

    `post-upgrade` phases. Users can use `kubeadm upgrade node phase addon` to execute the addon upgrade, or use `kubeadm upgrade node --skip-phases addon` to skip the addon upgrade. If you were previously skipping an addon subphase on `kubeadm init` you should now skip the same addon when calling `kubeadm upgrade apply` and `kubeadm upgrade node`. Currently, the `post-upgrade` phase is no-op, and it is mainly used to handle some release-specific post-upgrade tasks. ([#127242](https://github.com/kube...
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Thu Feb 26 23:58:21 GMT 2026
    - 470.5K bytes
    - Click Count (0)
  6. CHANGELOG/CHANGELOG-1.9.md

    * This fix prevents a GCE PD volume from being mounted if the udev device link is stale and tries to correct the link. ([#66832](https://github.com/kubernetes/kubernetes/pull/66832), [@msau42](https://github.com/msau42))
    * skip nodes that have a primary NIC in a 'Failed' provisioningState ([#65412](https://github.com/kubernetes/kubernetes/pull/65412), [@yastij](https://github.com/yastij))
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Tue Nov 16 10:46:27 GMT 2021
    - 313.7K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java

          E parent;
          // If toTrickle is moved up to a parent of removeIndex, the parent is
          // placed in removeIndex position. We must return that to the iterator so
          // that it knows to skip it.
          if (crossOver < removeIndex) {
            // We crossed over to the parent level in crossOver, so the parent
            // has already been moved.
            parent = elementData(removeIndex);
          } else {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 34K bytes
    - Click Count (0)
  8. tests/query_test.go

    	}
    }
    
    func TestFindInBatchesWithError(t *testing.T) {
    	if name := DB.Dialector.Name(); name == "sqlserver" {
    		t.Skip("skip sqlserver due to it will raise data race for invalid sql")
    	}
    
    	users := []User{
    		*GetUser("find_in_batches_with_error", Config{}),
    		*GetUser("find_in_batches_with_error", Config{}),
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Tue Jul 22 06:21:04 GMT 2025
    - 51K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/util/concurrent/Striped.java

            }
          }
          drainQueue();
          return created;
        }
    
        // N.B. Draining the queue is only necessary to ensure that we don't accumulate empty references
        // in the array. We could skip this if we decide we don't care about holding on to Reference
        // objects indefinitely.
        private void drainQueue() {
          Reference<? extends L> ref;
          while ((ref = queue.poll()) != null) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 16 22:01:32 GMT 2025
    - 20.6K bytes
    - Click Count (0)
  10. guava/src/com/google/common/base/Ascii.java

       * Horizontal Tabulation ('\t'): A format effector which controls the movement of the printing
       * position to the next in a series of predetermined positions along the printing line.
       * (Applicable also to display devices and the skip function on punched cards.)
       *
       * @since 8.0
       */
      public static final byte HT = 9;
    
      /**
       * Line Feed ('\n'): A format effector which controls the movement of the printing position to the
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 21.7K bytes
    - Click Count (0)
Back to Top