Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 861 - 870 of 960 for valid2 (0.2 seconds)

  1. cmd/metacache-entries.go

    			selected = entry
    			continue
    		}
    
    		// Get new entry metadata,
    		// shallow decode.
    		xl, err := entry.xlmeta()
    		if err != nil {
    			continue
    		}
    		objsValid++
    
    		// Add all valid to candidates.
    		r.candidates = append(r.candidates, xl.versions)
    
    		// We select the first object we find as a candidate and see if all match that.
    		// This is to quickly identify if all agree.
    		if selected == nil {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Thu Aug 08 15:29:58 GMT 2024
    - 24.1K bytes
    - Click Count (0)
  2. guava-tests/test/com/google/common/primitives/DoublesTest.java

              escapedInput.append(c);
            } else {
              escapedInput.append(String.format("\\u%04x", (int) c));
            }
          }
          fail("FLOATING_POINT_PATTERN should have matched valid input <" + escapedInput + ">");
        }
      }
    
      @GwtIncompatible // Doubles.tryParse
      private static void checkTryParse(double expected, String input) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Mar 08 01:43:32 GMT 2026
    - 30.9K bytes
    - Click Count (0)
  3. guava-tests/test/com/google/common/math/LongMathTest.java

          assertTrue(
              LongMath.biggestBinomials[k] == Integer.MAX_VALUE
                  || !fitsInLong(BigIntegerMath.binomial(LongMath.biggestBinomials[k] + 1, k)));
          // In the first case, any long is valid; in the second, we want to test that the next-bigger
          // long overflows.
        }
        int k = LongMath.biggestBinomials.length;
        assertFalse(fitsInLong(BigIntegerMath.binomial(2 * k, k)));
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Oct 30 14:15:36 GMT 2025
    - 31.4K bytes
    - Click Count (0)
  4. impl/maven-cli/src/test/java/org/apache/maven/cling/invoker/mvnup/goals/ModelUpgradeStrategyTest.java

                UpgradeResult result = strategy.apply(context, pomMap);
    
                // Should succeed
                assertTrue(result.success(), "Valid upgrade should be successful");
                assertEquals(0, result.errorCount(), "Should have no errors");
                assertEquals(1, result.modifiedCount(), "Should have modified one POM");
            }
        }
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Tue Nov 18 18:03:26 GMT 2025
    - 38.8K bytes
    - Click Count (0)
  5. src/archive/tar/writer.go

    // It also fills out fields (uname, gname, devmajor, devminor) that are
    // shared in the USTAR, PAX, and GNU formats using the provided formatters.
    //
    // The block returned is only valid until the next call to
    // templateV7Plus or writeRawFile.
    func (tw *Writer) templateV7Plus(hdr *Header, fmtStr stringFormatter, fmtNum numberFormatter) *block {
    	tw.blk.reset()
    
    	modTime := hdr.ModTime
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Mon Feb 03 16:38:43 GMT 2025
    - 19.7K bytes
    - Click Count (0)
  6. LICENSE

        the user installs one, as long as the modified version is
        interface-compatible with the version that the work was made with.
    
        c) Accompany the work with a written offer, valid for at
        least three years, to give the same user the materials
        specified in Subsection 6a, above, for a charge no more
        than the cost of performing this distribution.
    
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Mon Jan 18 20:25:38 GMT 2016
    - 25.8K bytes
    - Click Count (0)
  7. cmd/utils.go

    		return true
    	}
    	cs, err := hash.GetContentChecksum(r.Header)
    	if err != nil {
    		return false
    	}
    	if cs == nil || !cs.Type.IsSet() {
    		return false
    	}
    	if cs.Valid() && !cs.Type.Trailing() {
    		r.Body = hash.NewChecker(r.Body, cs.Type.Hasher(), cs.Raw, r.ContentLength)
    	}
    	return true
    }
    
    // http://docs.aws.amazon.com/AmazonS3/latest/dev/UploadingObjects.html
    const (
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 33K bytes
    - Click Count (0)
  8. guava/src/com/google/common/collect/AbstractMapBasedMultimap.java

          WrappedIterator(Iterator<V> delegateIterator) {
            this.delegateIterator = delegateIterator;
          }
    
          /**
           * If the delegate changed since the iterator was created, the iterator is no longer valid.
           */
          void validateIterator() {
            refreshIfEmpty();
            if (delegate != originalDelegate) {
              throw new ConcurrentModificationException();
            }
          }
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Nov 17 22:50:48 GMT 2025
    - 48.4K bytes
    - Click Count (0)
  9. docs/fr/docs/alternatives.md

    Il ne peut pas très bien gérer les modèles imbriqués. Ainsi, si le corps JSON de la requête est un objet JSON comportant des champs internes qui sont à leur tour des objets JSON imbriqués, il ne peut pas être correctement documenté et validé.
    
    /// check | A inspiré **FastAPI** à
    
    Utiliser les types Python pour bénéficier d'un excellent support de l'éditeur.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:37:13 GMT 2026
    - 26.6K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/hash/BloomFilter.java

            int numHashFunctions,
            LockFreeBitArray bits);
    
        /**
         * Identifier used to encode this strategy, when marshalled as part of a BloomFilter. Only
         * values in the [-128, 127] range are valid for the compact serial form. Non-negative values
         * are reserved for enums defined in BloomFilterStrategies; negative values are reserved for any
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 10 22:28:12 GMT 2026
    - 27.6K bytes
    - Click Count (0)
Back to Top