Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for Hanbin (0.21 sec)

  1. docs/en/data/external_links.yml

        title: 'FastAPI lambda container: serverless simplified'
      - author: Teresa N. Fontanella De Santis
        author_link: https://dev.to/
        link: https://dev.to/teresafds/authorization-on-fastapi-with-casbin-41og
        title: Authorization on FastAPI with Casbin
      - author: New Relic
        author_link: https://newrelic.com
        link: https://newrelic.com/instant-observability/fastapi/e559ec64-f765-4470-a15f-1901fcebb468
    Others
    - Registered: Sun May 05 07:19:11 GMT 2024
    - Last Modified: Thu Mar 21 20:57:27 GMT 2024
    - 21.3K bytes
    - Viewed (2)
  2. android/guava-tests/test/com/google/common/math/LongMathTest.java

        }
      }
    
      @GwtIncompatible // isPrime is GWT-incompatible
      public void testIsPrimeManyConstants() {
        // Test the thorough test inputs, which also includes special constants in the Miller-Rabin
        // tests.
        for (long l : POSITIVE_LONG_CANDIDATES) {
          assertEquals(BigInteger.valueOf(l).isProbablePrime(100), LongMath.isPrime(l));
        }
      }
    
      @GwtIncompatible // isPrime is GWT-incompatible
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Mon Mar 04 20:15:57 GMT 2024
    - 32.5K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/math/LongMathTest.java

        }
      }
    
      @GwtIncompatible // isPrime is GWT-incompatible
      public void testIsPrimeManyConstants() {
        // Test the thorough test inputs, which also includes special constants in the Miller-Rabin
        // tests.
        for (long l : POSITIVE_LONG_CANDIDATES) {
          assertEquals(BigInteger.valueOf(l).isProbablePrime(100), LongMath.isPrime(l));
        }
      }
    
      @GwtIncompatible // isPrime is GWT-incompatible
    Java
    - Registered: Fri Apr 12 12:43:09 GMT 2024
    - Last Modified: Mon Mar 04 20:15:57 GMT 2024
    - 32.5K bytes
    - Viewed (0)
  4. src/bytes/bytes.go

    		}
    		if s[i+1] == c1 && Equal(s[i:i+n], sep) {
    			return i
    		}
    		i++
    		fails++
    		if fails >= 4+i>>4 && i < t {
    			// Give up on IndexByte, it isn't skipping ahead
    			// far enough to be better than Rabin-Karp.
    			// Experiments (using IndexPeriodic) suggest
    			// the cutover is about 16 byte skips.
    			// TODO: if large prefixes of sep are matching
    			// we should cutover at even larger average skips,
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Mon Feb 19 19:51:15 GMT 2024
    - 33.8K bytes
    - Viewed (0)
Back to top