Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 999 for Murray (0.21 sec)

  1. android/guava/src/com/google/common/primitives/UnsignedBytes.java

       * @since 23.1
       */
      public static void sort(byte[] array, int fromIndex, int toIndex) {
        checkNotNull(array);
        checkPositionIndexes(fromIndex, toIndex, array.length);
        for (int i = fromIndex; i < toIndex; i++) {
          array[i] = flip(array[i]);
        }
        Arrays.sort(array, fromIndex, toIndex);
        for (int i = fromIndex; i < toIndex; i++) {
          array[i] = flip(array[i]);
        }
      }
    
      /**
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Thu Feb 22 17:40:56 GMT 2024
    - 18.3K bytes
    - Viewed (0)
  2. guava-tests/benchmark/com/google/common/base/StringsRepeatBenchmark.java

        final int len = string.length();
        final int size = len * count;
        final char[] array = new char[size];
        string.getChars(0, len, array, 0);
        int n;
        for (n = len; n < size - n; n <<= 1) {
          System.arraycopy(array, 0, array, n, n);
        }
        System.arraycopy(array, 0, array, n, size - n);
        return new String(array);
      }
    Java
    - Registered: Fri Apr 19 12:43:09 GMT 2024
    - Last Modified: Fri Sep 17 20:24:24 GMT 2021
    - 3.3K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/primitives/UnsignedLongs.java

       * @since 23.1
       */
      public static void sort(long[] array, int fromIndex, int toIndex) {
        checkNotNull(array);
        checkPositionIndexes(fromIndex, toIndex, array.length);
        for (int i = fromIndex; i < toIndex; i++) {
          array[i] = flip(array[i]);
        }
        Arrays.sort(array, fromIndex, toIndex);
        for (int i = fromIndex; i < toIndex; i++) {
          array[i] = flip(array[i]);
        }
      }
    
      /**
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Thu Feb 15 16:12:13 GMT 2024
    - 17.6K bytes
    - Viewed (0)
  4. android/guava-tests/test/com/google/common/collect/ObjectArraysTest.java

        assertEquals(String[].class, array.getClass());
        assertThat(array).hasLength(2);
        assertNull(array[0]);
      }
    
      public void testNewArray_fromArray_OfArray() {
        String[][] array = ObjectArrays.newArray(new String[0][0], 1);
        assertEquals(String[][].class, array.getClass());
        assertThat(array).hasLength(1);
        assertNull(array[0]);
      }
    
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Thu Mar 07 18:34:03 GMT 2024
    - 8.8K bytes
    - Viewed (0)
  5. guava-tests/test/com/google/common/primitives/ImmutableIntArrayTest.java

              array[i] = counter.getAndIncrement();
            }
            builder.addAll(ImmutableIntArray.copyOf(array));
          }
        },
        ADD_LARGER_ARRAY {
          @Override
          void doIt(ImmutableIntArray.Builder builder, AtomicInteger counter) {
            int[] array = new int[RANDOM.nextInt(200) + 200];
            for (int i = 0; i < array.length; i++) {
              array[i] = counter.getAndIncrement();
            }
    Java
    - Registered: Fri Apr 12 12:43:09 GMT 2024
    - Last Modified: Thu Jun 01 09:32:35 GMT 2023
    - 20.2K bytes
    - Viewed (0)
  6. common/scripts/metallb-native.yaml

                              values:
                                description: values is an array of string values. If the
                                  operator is In or NotIn, the values array must be non-empty.
                                  If the operator is Exists or DoesNotExist, the values
                                  array must be empty. This array is replaced during a
                                  strategic merge patch.
    Others
    - Registered: Wed May 01 22:53:12 GMT 2024
    - Last Modified: Fri Feb 23 23:56:31 GMT 2024
    - 63.9K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/primitives/BooleansTest.java

        assertThat(Booleans.concat(ARRAY_FALSE)).isEqualTo(ARRAY_FALSE);
        assertThat(Booleans.concat(ARRAY_FALSE)).isNotSameInstanceAs(ARRAY_FALSE);
        assertThat(Booleans.concat(EMPTY, ARRAY_FALSE, EMPTY)).isEqualTo(ARRAY_FALSE);
        assertThat(Booleans.concat(ARRAY_FALSE, ARRAY_FALSE, ARRAY_FALSE))
            .isEqualTo(new boolean[] {false, false, false});
        assertThat(Booleans.concat(ARRAY_FALSE, ARRAY_FALSE_TRUE))
    Java
    - Registered: Fri Apr 12 12:43:09 GMT 2024
    - Last Modified: Mon Mar 04 15:43:29 GMT 2024
    - 23.9K bytes
    - Viewed (0)
  8. android/guava-tests/test/com/google/common/primitives/BooleansTest.java

        assertThat(Booleans.concat(ARRAY_FALSE)).isEqualTo(ARRAY_FALSE);
        assertThat(Booleans.concat(ARRAY_FALSE)).isNotSameInstanceAs(ARRAY_FALSE);
        assertThat(Booleans.concat(EMPTY, ARRAY_FALSE, EMPTY)).isEqualTo(ARRAY_FALSE);
        assertThat(Booleans.concat(ARRAY_FALSE, ARRAY_FALSE, ARRAY_FALSE))
            .isEqualTo(new boolean[] {false, false, false});
        assertThat(Booleans.concat(ARRAY_FALSE, ARRAY_FALSE_TRUE))
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Mon Mar 04 15:43:29 GMT 2024
    - 23.9K bytes
    - Viewed (0)
  9. guava-tests/test/com/google/common/math/QuantilesAlgorithm.java

              swap(array, from, to);
            }
            return array[k];
          } else {
            int midIndex = (from + to) >>> 1;
            // Choose the median of the elements at the from, to and mid indexes,
            // and rearrange so that array[from]<=array[from+1], and
            // array[to] => array[from + 1].
    
            swap(array, midIndex, from + 1);
    
            if (array[from] > array[to]) {
    Java
    - Registered: Fri Apr 12 12:43:09 GMT 2024
    - Last Modified: Tue Feb 01 16:30:37 GMT 2022
    - 7.1K bytes
    - Viewed (0)
  10. android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java

              swap(array, from, to);
            }
            return array[k];
          } else {
            int midIndex = (from + to) >>> 1;
            // Choose the median of the elements at the from, to and mid indexes,
            // and rearrange so that array[from]<=array[from+1], and
            // array[to] => array[from + 1].
    
            swap(array, midIndex, from + 1);
    
            if (array[from] > array[to]) {
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Tue Feb 01 16:30:37 GMT 2022
    - 7.1K bytes
    - Viewed (0)
Back to top