Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for pseudo (0.16 sec)

  1. api/maven-api-core/src/main/java/org/apache/maven/api/services/VersionResolver.java

    import org.apache.maven.api.Session;
    import org.apache.maven.api.annotations.Consumer;
    import org.apache.maven.api.annotations.Experimental;
    import org.apache.maven.api.annotations.Nonnull;
    
    /**
     * Resolves artifact meta/pseudo versions.
     *
     * @since 4.0.0
     */
    @Experimental
    @Consumer
    public interface VersionResolver extends Service {
    
        /**
    Java
    - Registered: Sun May 05 03:35:11 GMT 2024
    - Last Modified: Wed Feb 28 23:54:53 GMT 2024
    - 2.5K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/escape/CharEscaperBuilder.java

     * it. The array will be from 0 to the maximum index given. All non-set indexes will contain null
     * (so it's not really a sparse array, just a pseudo sparse array). The builder can also return a
     * CharEscaper based on the generated array.
     *
     * @author Sven Mawson
     * @since 15.0
     */
    @GwtCompatible
    @ElementTypesAreNonnullByDefault
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Tue Jan 18 20:55:09 GMT 2022
    - 4K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/math/IntMathTest.java

        // 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++) {
          int n = rand.nextInt(Integer.MAX_VALUE);
          assertEquals(LongMath.isPrime(n), IntMath.isPrime(n));
        }
      }
    
    Java
    - Registered: Fri Apr 12 12:43:09 GMT 2024
    - Last Modified: Wed Feb 07 17:50:39 GMT 2024
    - 24.5K bytes
    - Viewed (0)
  4. android/guava-tests/test/com/google/common/math/IntMathTest.java

        // 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++) {
          int n = rand.nextInt(Integer.MAX_VALUE);
          assertEquals(LongMath.isPrime(n), IntMath.isPrime(n));
        }
      }
    
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Wed Feb 07 17:50:39 GMT 2024
    - 24.5K bytes
    - Viewed (0)
  5. android/guava/src/com/google/thirdparty/publicsuffix/PublicSuffixPatterns.java

    ?siri???s??q!.&eman?gro?hcs?lim?moc?t&en?opsgolb,?ude?vog???r&az?emac?f4a3abgm--nx?n!d5uhf8le58r4w--nx??u&kas?tan???s!.&bup?dem?gro?hcs?moc?ten?ude?vog??ac!.uban.iu,?iv??t&ad?elhta?led?oyot??u!.&a&cinniv?emirc?i&hzhziropaz?stynniv?ttaprakaz??s&edo?sedo??tlay?vatlop??bs?cc,d&argovorik?o!ro&ghzu?hhzu???tl,?e&hzhziropaz?i,nvir?t??f&i?ni,?g&l?ro??hk?i&stvinrehc?ykstyn&lemhk?vypork???k&c?m?s&na&gul?hul??t&enod?ul??v&iknarf-onavi?orteporp&end?ind?????l&iponret?opotsa&bes?ves??p??m&k?oc?s?yrk??n&c?d?i?...
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Thu Mar 21 21:04:43 GMT 2024
    - 72.4K bytes
    - Viewed (1)
  6. guava-tests/test/com/google/common/io/FilesSimplifyPathTest.java

         * - Run the test.
         * - Pull the relevant lines of output from the test into a testcases file.
         * - Test the output:
         * --- cat testcases | while read L; do
         *       X=($L)
         *       A=$( cd /b/c && sudo mkdir -p ${X[0]} && cd ${X[0]} && pwd |
         *           sed -e 's#^//*#/#' )
         *       B=$( cd /b/c && cd ${X[1]} && pwd )
         *       cmp -s <(echo $A) <(echo $B) || echo "$X[0] -> $A vs. $B"
    Java
    - Registered: Fri Apr 19 12:43:09 GMT 2024
    - Last Modified: Tue Jul 19 14:00:24 GMT 2016
    - 11K bytes
    - Viewed (0)
  7. android/guava-tests/test/com/google/common/io/FilesSimplifyPathTest.java

         * - Run the test.
         * - Pull the relevant lines of output from the test into a testcases file.
         * - Test the output:
         * --- cat testcases | while read L; do
         *       X=($L)
         *       A=$( cd /b/c && sudo mkdir -p ${X[0]} && cd ${X[0]} && pwd |
         *           sed -e 's#^//*#/#' )
         *       B=$( cd /b/c && cd ${X[1]} && pwd )
         *       cmp -s <(echo $A) <(echo $B) || echo "$X[0] -> $A vs. $B"
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Fri Apr 21 02:27:51 GMT 2017
    - 11K bytes
    - Viewed (0)
Back to top