Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 179 for prime (0.15 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. src/cmd/asm/internal/asm/testdata/riscv64validation.s

    	CXOR	X10, X5					// ERROR "expected integer prime register in rd"
    	CSUB	X10, X11, X12				// ERROR "rd must be the same as rs1"
    	CSUB	X5, X11					// ERROR "expected integer prime register in rs2"
    	CSUB	X10, X5					// ERROR "expected integer prime register in rd"
    	CADDW	X10, X11, X12				// ERROR "rd must be the same as rs1"
    	CADDW	X5, X11					// ERROR "expected integer prime register in rs2"
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Nov 13 12:17:37 GMT 2025
    - 42.1K bytes
    - Click Count (0)
  2. tests/associations_test.go

    	if err := DB.Create(&user).Error; err != nil {
    		t.Fatalf("create user: %v", err)
    	}
    
    	// Prime with one language
    	if err := DB.Model(&user).Association("Languages").Append(&Language{Code: "prime", Name: "Prime"}); err != nil {
    		t.Fatalf("prime append: %v", err)
    	}
    	AssertAssociationCount(t, user, "Languages", 1, "before replace")
    
    	// Replace with a new map value
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Fri Sep 12 04:33:27 GMT 2025
    - 13.3K bytes
    - Click Count (0)
  3. guava-tests/test/com/google/common/math/MathTesting.java

        // Add boundary values manually to avoid over/under flow (this covers 2^N for 0 and 31).
        intValues.add(Integer.MAX_VALUE - 1, Integer.MAX_VALUE);
        // Add values up to 40. This covers cases like "square of a prime" and such.
        for (int i = 1; i <= 40; i++) {
          intValues.add(i);
        }
        // Now add values near 2^N for lots of values of N.
        for (int exponent : asList(2, 3, 4, 9, 15, 16, 17, 24, 25, 30)) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 17 16:11:48 GMT 2026
    - 9.9K bytes
    - Click Count (0)
  4. guava-tests/test/com/google/common/io/ByteStreamsTest.java

        ByteStreams.copy(inChannel, outChannel);
        assertThat(out.toByteArray()).isEqualTo(expected);
      }
    
    
      public void testCopyFileChannel() throws IOException {
        int chunkSize = 14407; // Random prime, unlikely to match any internal chunk size
        ByteArrayOutputStream out = new ByteArrayOutputStream();
        WritableByteChannel outChannel = Channels.newChannel(out);
    
        File testFile = createTempFile();
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 17 19:26:39 GMT 2026
    - 22K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/math/LongMath.java

              | (1 << 29));
    
      /**
       * Returns {@code true} if {@code n} is a <a
       * href="http://mathworld.wolfram.com/PrimeNumber.html">prime number</a>: an integer <i>greater
       * than one</i> that cannot be factored into a product of <i>smaller</i> positive integers.
       * Returns {@code false} if {@code n} is zero, one, or a composite number (one which <i>can</i> be
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 09 23:01:02 GMT 2026
    - 46.8K bytes
    - Click Count (0)
  6. guava/src/com/google/common/collect/Range.java

     *       {@code r.contains(c1) && r.contains(c3)} implies {@code r.contains(c2)}). This means that a
     *       {@code Range<Integer>} can never be used to represent, say, "all <i>prime</i> numbers from
     *       1 to 100."
     *   <li>When evaluated as a {@link Predicate}, a range yields the same result as invoking {@link
     *       #contains}.
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 28.3K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/collect/Range.java

     *       {@code r.contains(c1) && r.contains(c3)} implies {@code r.contains(c2)}). This means that a
     *       {@code Range<Integer>} can never be used to represent, say, "all <i>prime</i> numbers from
     *       1 to 100."
     *   <li>When evaluated as a {@link Predicate}, a range yields the same result as invoking {@link
     *       #contains}.
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 28K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/hash/Hashing.java

        hashFunctions[0] = Murmur3_128HashFunction.GOOD_FAST_HASH_128;
        int seed = GOOD_FAST_HASH_SEED;
        for (int i = 1; i < hashFunctionsNeeded; i++) {
          seed += 1500450271; // a prime; shouldn't matter
          hashFunctions[i] = murmur3_128(seed);
        }
        return new ConcatenatedHashFunction(hashFunctions);
      }
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Jul 17 15:26:41 GMT 2025
    - 29.8K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/primitives/Ints.java

        //     ends up at a[d], which in turn ends up at a[2d], and so on until we get back to a[0].
        //     (All indices taken mod n.) If d and n are mutually prime, all elements will have been
        //     moved at that point. Otherwise, we can rotate the cycle a[1], a[1 + d], a[1 + 2d], etc,
        //     then a[2] etc, and so on until we have rotated all elements. There are gcd(d, n) cycles
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 17 16:45:58 GMT 2026
    - 31.3K bytes
    - Click Count (0)
  10. lib/fips140/v1.26.0.zip

    return false } iterations-- if iterations == 0 { return true } } } // primes are the first prime numbers (except 2), such that the product of any // three primes fits in a uint32. // // More primes cause fewer Miller-Rabin tests of composites (nothing can help // with the final test on the actual prime) but have diminishing returns: these // 255 primes catch 84.9% of composites, the next 255 would catch 1.5% more. // Adding primes can still be marginally useful since they only compete with the // (much...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 08 17:58:32 GMT 2026
    - 660.3K bytes
    - Click Count (0)
Back to Top