Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for 199Z (0.13 sec)

  1. maven-core/src/test/java/org/apache/maven/project/PomConstructionTest.java

            assertEquals(1, ((List<?>) pom.getValue("build/plugins")).size());
            assertEquals("2.1", pom.getValue("build/plugins[1]/version"));
        }
    
        /* MNG-1995 */
        @Test
        void testBooleanInterpolation() throws Exception {
            PomTestWrapper pom = buildPom("boolean-interpolation");
            assertEquals(true, pom.getValue("repositories[1]/releases/enabled"));
    Java
    - Registered: Sun Apr 28 03:35:10 GMT 2024
    - Last Modified: Fri Apr 12 10:50:18 GMT 2024
    - 93.2K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/hash/BloomFilterTest.java

        // (These are all of the false positives under 900.)
        ImmutableSet<Integer> falsePositives =
            ImmutableSet.of(
                49, 51, 59, 163, 199, 321, 325, 363, 367, 469, 545, 561, 727, 769, 773, 781);
        for (int i = 1; i < 900; i += 2) {
          if (!falsePositives.contains(i)) {
            assertFalse("BF should not contain " + i, bf.mightContain(Integer.toString(i)));
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Thu Nov 09 22:49:56 GMT 2023
    - 21.3K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/math/QuantilesTest.java

        // is an integer 199*index/2. If index is odd, that is halfway between floor(199*index/2) and
        // ceil(199*index/2).
        if (index % 2 == 0) {
          int position = IntMath.divide(199 * index, 2, UNNECESSARY);
          return PSEUDORANDOM_DATASET_SORTED.get(position);
        } else {
          int positionFloor = IntMath.divide(199 * index, 2, FLOOR);
    Java
    - Registered: Fri Apr 12 12:43:09 GMT 2024
    - Last Modified: Wed Sep 06 17:04:31 GMT 2023
    - 29.7K bytes
    - Viewed (0)
  4. android/guava-tests/test/com/google/common/math/QuantilesTest.java

        // is an integer 199*index/2. If index is odd, that is halfway between floor(199*index/2) and
        // ceil(199*index/2).
        if (index % 2 == 0) {
          int position = IntMath.divide(199 * index, 2, UNNECESSARY);
          return PSEUDORANDOM_DATASET_SORTED.get(position);
        } else {
          int positionFloor = IntMath.divide(199 * index, 2, FLOOR);
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Wed Sep 06 17:04:31 GMT 2023
    - 29.7K bytes
    - Viewed (0)
  5. src/main/java/jcifs/smb1/util/DES.java

    // SPECIFICALLY DISCLAIMS ANY EXPRESS OR IMPLIED WARRANTY OF FITNESS FOR
    // HIGH RISK ACTIVITIES.
    //
    //
    // The rest is:
    //
    // Copyright (C) 1996 by Jef Poskanzer <******@****.***>.  All rights reserved.
    //
    // Copyright (C) 1996 by Wolfgang Platzer
    // email: ******@****.***
    //
    // All rights reserved.
    //
    // Redistribution and use in source and binary forms, with or without
    Java
    - Registered: Sun May 05 00:10:10 GMT 2024
    - Last Modified: Fri Mar 22 20:39:42 GMT 2019
    - 21.4K bytes
    - Viewed (0)
  6. src/main/java/jcifs/smb1/util/MD4.java

    //
    // Revision 1.1.1.1  1997/11/03 22:36:56  hopwood
    // + Imported to CVS (tagged as 'start').
    //
    // Revision 0.1.0.0  1997/07/14  R. Naffah
    // + original version
    //
    // $Endlog$
    /*
     * Copyright (c) 1997 Systemics Ltd
     * on behalf of the Cryptix Development Team.  All rights reserved.
     */
    
    package jcifs.smb1.util;
    
    import java.security.MessageDigest;
    
    /**
     * Implements the MD4 message digest algorithm in Java.
    Java
    - Registered: Sun May 05 00:10:10 GMT 2024
    - Last Modified: Fri Mar 22 20:39:42 GMT 2019
    - 9.3K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/hash/BloomFilterTest.java

        // (These are all of the false positives under 900.)
        ImmutableSet<Integer> falsePositives =
            ImmutableSet.of(
                49, 51, 59, 163, 199, 321, 325, 363, 367, 469, 545, 561, 727, 769, 773, 781);
        for (int i = 1; i < 900; i += 2) {
          if (!falsePositives.contains(i)) {
            assertFalse("BF should not contain " + i, bf.mightContain(Integer.toString(i)));
    Java
    - Registered: Fri Apr 19 12:43:09 GMT 2024
    - Last Modified: Thu Nov 09 22:49:56 GMT 2023
    - 21.3K bytes
    - Viewed (0)
Back to top