Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 141 - 150 of 204 for compris (0.05 seconds)

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

  1. guava-tests/test/com/google/common/collect/ImmutableSortedSetTest.java

        assertThat(reverse).isNotNull();
      }
    
      public void testBuilderAsymptotics() {
        int[] compares = {0};
        Comparator<Integer> countingComparator =
            (i, j) -> {
              compares[0]++;
              return i.compareTo(j);
            };
        ImmutableSortedSet.Builder<Integer> builder =
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Mar 13 13:01:07 GMT 2026
    - 47.2K bytes
    - Click Count (0)
  2. android/guava-tests/test/com/google/common/primitives/UnsignedBytesTest.java

        Comparator<byte[]> comparator2 = UnsignedBytes.lexicographicalComparatorJavaImpl();
    
        /*
         * These arrays are set up to test that the comparator compares bytes within a word in the
         * correct order—in order words, that it doesn't mix up big-endian and little-endian. The first
         * array has a smaller element at one index, and then the second array has a smaller element at
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Mar 08 01:43:32 GMT 2026
    - 13.6K bytes
    - Click Count (0)
  3. LICENSE

          for use, reproduction, or distribution of Your modifications, or
          for any such Derivative Works as a whole, provided Your use,
          reproduction, and distribution of the Work otherwise complies with
          the conditions stated in this License.
    
       5. Submission of Contributions. Unless You explicitly state otherwise,
          any Contribution intentionally submitted for inclusion in the Work
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Mon Nov 29 17:31:56 GMT 2021
    - 13.3K bytes
    - Click Count (0)
  4. guava-tests/test/com/google/common/primitives/UnsignedBytesTest.java

        Comparator<byte[]> comparator2 = UnsignedBytes.lexicographicalComparatorJavaImpl();
    
        /*
         * These arrays are set up to test that the comparator compares bytes within a word in the
         * correct order—in order words, that it doesn't mix up big-endian and little-endian. The first
         * array has a smaller element at one index, and then the second array has a smaller element at
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Mar 08 01:43:32 GMT 2026
    - 14K bytes
    - Click Count (0)
  5. LICENSE

          for use, reproduction, or distribution of Your modifications, or
          for any such Derivative Works as a whole, provided Your use,
          reproduction, and distribution of the Work otherwise complies with
          the conditions stated in this License.
    
       5. Submission of Contributions. Unless You explicitly state otherwise,
          any Contribution intentionally submitted for inclusion in the Work
    Created: Wed Apr 01 00:11:11 GMT 2026
    - Last Modified: Thu Feb 20 19:53:57 GMT 2020
    - 11.1K bytes
    - Click Count (0)
  6. LICENSE.txt

          for use, reproduction, or distribution of Your modifications, or
          for any such Derivative Works as a whole, provided Your use,
          reproduction, and distribution of the Work otherwise complies with
          the conditions stated in this License.
    
       5. Submission of Contributions. Unless You explicitly state otherwise,
          any Contribution intentionally submitted for inclusion in the Work
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Mon Jul 23 14:02:28 GMT 2012
    - 11.1K bytes
    - Click Count (0)
  7. update-credits.sh

          for use, reproduction, or distribution of Your modifications, or
          for any such Derivative Works as a whole, provided Your use,
          reproduction, and distribution of the Work otherwise complies with
          the conditions stated in this License.
    
       5. Submission of Contributions. Unless You explicitly state otherwise,
          any Contribution intentionally submitted for inclusion in the Work
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 11 05:08:38 GMT 2023
    - 11.4K bytes
    - Click Count (0)
  8. LICENSE

          for use, reproduction, or distribution of Your modifications, or
          for any such Derivative Works as a whole, provided Your use,
          reproduction, and distribution of the Work otherwise complies with
          the conditions stated in this License.
    
       5. Submission of Contributions. Unless You explicitly state otherwise,
          any Contribution intentionally submitted for inclusion in the Work
    Created: Sun Apr 12 03:50:13 GMT 2026
    - Last Modified: Mon Jan 11 04:26:17 GMT 2021
    - 11.1K bytes
    - Click Count (0)
  9. LICENSES/third_party/forked/shell2junit/LICENSE

    reproduction, or distribution of Your modifications, or for any such 
    Derivative Works as a whole, provided Your use, reproduction, and 
    distribution of the Work otherwise complies with the conditions stated in 
    this License. 
    
    5. Submission of Contributions. Unless You explicitly state otherwise, any 
    Contribution intentionally submitted for inclusion in the Work by You to the 
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Thu Jul 08 11:48:19 GMT 2021
    - 9.2K bytes
    - Click Count (0)
  10. misc/cgo/gmp/gmp.go

    func (z *Int) Abs(x *Int) *Int {
    	x.doinit()
    	z.doinit()
    	C.mpz_abs(&z.i[0], &x.i[0])
    	return z
    }
    
    /*
     * functions without a clear receiver
     */
    
    // CmpInt compares x and y. The result is
    //
    //	-1 if x <  y
    //	 0 if x == y
    //	+1 if x >  y
    func CmpInt(x, y *Int) int {
    	x.doinit()
    	y.doinit()
    	switch cmp := C.mpz_cmp(&x.i[0], &y.i[0]); {
    	case cmp < 0:
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Mon Apr 11 16:34:30 GMT 2022
    - 9.5K bytes
    - Click Count (0)
Back to Top