Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 381 - 390 of 2,406 for checks (0.04 seconds)

  1. build-logic/documentation/src/main/groovy/gradlebuild/docs/FindBrokenInternalLinks.java

            fw.println("#");
            fw.println("# The checker does not handle implicit section names, so they must be explicit and declared as: [[section-name]]");
            fw.println("#");
            fw.println("# The checker also rejects Markdown-style links, such as [text](https://example.com/something) as they do not render properly");
    
        }
    
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Thu Mar 12 23:22:57 GMT 2026
    - 12.8K bytes
    - Click Count (0)
  2. src/test/java/org/codelibs/fess/helper/IntervalControlHelperTest.java

            // For same-day rules, it should check the day directly
            assertTrue(rule.isTarget(12, 30, 8)); // Should be treated as day 1 (Sunday)
    
            // Test with cross-midnight rule
            IntervalRule crossRule = new IntervalRule("22:00", "02:00", "1", 1000); // Sunday only
            // For cross-midnight rule, when checking early morning hours (1:30), it checks day+1
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Wed Jan 14 14:29:07 GMT 2026
    - 13.6K bytes
    - Click Count (0)
  3. build-tools-internal/src/main/groovy/org/elasticsearch/gradle/internal/test/AntFixture.groovy

        protected boolean spawn = true
    
        /**
         * A closure to call before the fixture is considered ready. The closure is passed the fixture object,
         * as well as a groovy AntBuilder, to enable running ant condition checks. The default wait
         * condition is for http on the http port.
         */
        @Internal
        Closure waitCondition = { AntFixture fixture, AntBuilder ant ->
            File tmpFile = new File(fixture.cwd, 'wait.success')
    Created: Wed Apr 08 16:19:15 GMT 2026
    - Last Modified: Tue Jun 01 09:19:30 GMT 2021
    - 10.1K bytes
    - Click Count (0)
  4. guava-testlib/src/com/google/common/testing/NullPointerTester.java

            || isEquals(member)
            /*
             * We can assume that Kotlin code is performing the null checks that we want, since kotlinc
             * inserts checks automatically for non-private functions (which are the only kind that we
             * check).
             *
             * We *would* just check such functions redundantly, but kotlinc emits its nullness
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Jul 14 14:44:08 GMT 2025
    - 25.4K bytes
    - Click Count (0)
  5. src/main/java/jcifs/smb1/smb1/ACE.java

     * ACE and <i>any</i> of the desired access bits match bits in the access
     * mask of the ACE, the whole access check fails. If the ACE is an "allow"
     * ACE and <i>all</i> of the bits in the desired access bits match bits in
     * the access mask of the ACE, the access check is successful. Otherwise,
     * more ACEs are evaluated until all desired access bits (combined)
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 8.8K bytes
    - Click Count (0)
  6. cmd/object-handlers_test.go

    	// HTTP request for testing when `objectLayer` is set to `nil`.
    	// There is no need to use an existing bucket and valid input for creating the request
    	// since the `objectLayer==nil`  check is performed before any other checks inside the handlers.
    	// The only aim is to generate an HTTP request in a way that the relevant/registered end point is evoked/called.
    
    	nilBucket := "dummy-bucket"
    	nilObject := "dummy-object"
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 163.1K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/util/concurrent/TimeoutFuture.java

           * timeoutFuture can be set (and delegate cancelled) only once. (And "set only once" is
           * important for other reasons: run() can still be invoked concurrently in different threads,
           * even with the above null checks.)
           */
          timeoutFutureRef = null;
          if (delegate.isDone()) {
            timeoutFuture.setFuture(delegate);
          } else {
            try {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 8K bytes
    - Click Count (0)
  8. android/guava-testlib/src/com/google/common/collect/testing/SafeTreeMap.java

    import java.util.NavigableSet;
    import java.util.Set;
    import java.util.SortedMap;
    import java.util.TreeMap;
    import org.jspecify.annotations.Nullable;
    
    /**
     * A wrapper around {@code TreeMap} that aggressively checks to see if keys are mutually comparable.
     * This implementation passes the navigable map test suites.
     *
     * @author Louis Wasserman
     */
    @GwtIncompatible
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 21:06:42 GMT 2026
    - 7.4K bytes
    - Click Count (0)
  9. build-logic/documentation/src/main/groovy/gradlebuild/docs/dsl/docbook/AssembleDslDocTask.groovy

                }
            }
            return extensions
        }
    
        def mergeContent(Element typeTable, DslDocModel model) {
            def title = typeTable.title[0].text()
    
            //TODO below checks makes it harder to add new sections
            //because the new section will work correctly only when the section title ends with 'types' :)
            if (title.matches('(?i).* types')) {
                mergeTypes(typeTable, model)
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Wed Dec 09 08:14:05 GMT 2020
    - 9.8K bytes
    - Click Count (0)
  10. guava-tests/test/com/google/common/math/IntMathTest.java

      @GwtIncompatible // isPrime is GWT-incompatible
      public void testIsPrime() {
        // Defer correctness tests to Long.isPrime
    
        // Check the first 100,000 integers
        for (int i = 0; i < 100000; i++) {
          assertEquals(LongMath.isPrime(i), IntMath.isPrime(i));
        }
    
        // Then check 1000 deterministic pseudo-random int values.
        Random rand = new Random(1);
        for (int i = 0; i < 1000; i++) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Aug 11 19:31:30 GMT 2025
    - 24.1K bytes
    - Click Count (0)
Back to Top