Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 68 for Flip (0.61 sec)

  1. src/math/big/arith_s390x.s

    	VPDI  $0x4, V18, V18, V18 // flip the doublewords to big-endian order
    	VPDI  $0x4, V19, V19, V19 // flip the doublewords to big-endian order
    	VPDI  $0x4, V20, V20, V20 // flip the doublewords to big-endian order
    	VPDI  $0x4, V21, V21, V21 // flip the doublewords to big-endian order
    	VPDI  $0x4, V22, V22, V22 // flip the doublewords to big-endian order
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 23:33:27 UTC 2023
    - 20.3K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/primitives/UnsignedInts.java

       */
      public static int min(int... array) {
        checkArgument(array.length > 0);
        int min = flip(array[0]);
        for (int i = 1; i < array.length; i++) {
          int next = flip(array[i]);
          if (next < min) {
            min = next;
          }
        }
        return flip(min);
      }
    
      /**
       * Returns the greatest value present in {@code array}, treating values as unsigned.
       *
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Thu Feb 15 16:12:13 UTC 2024
    - 13.4K bytes
    - Viewed (0)
  3. guava/src/com/google/common/primitives/UnsignedInts.java

       */
      public static int min(int... array) {
        checkArgument(array.length > 0);
        int min = flip(array[0]);
        for (int i = 1; i < array.length; i++) {
          int next = flip(array[i]);
          if (next < min) {
            min = next;
          }
        }
        return flip(min);
      }
    
      /**
       * Returns the greatest value present in {@code array}, treating values as unsigned.
       *
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Thu Feb 15 16:12:13 UTC 2024
    - 13.4K bytes
    - Viewed (0)
  4. guava/src/com/google/common/primitives/UnsignedLongs.java

      /**
       * A (self-inverse) bijection which converts the ordering on unsigned longs to the ordering on
       * longs, that is, {@code a <= b} as unsigned longs if and only if {@code flip(a) <= flip(b)} as
       * signed longs.
       */
      private static long flip(long a) {
        return a ^ Long.MIN_VALUE;
      }
    
      /**
       * Compares the two specified {@code long} values, treating them as unsigned values between {@code
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Thu Feb 15 16:12:13 UTC 2024
    - 17.6K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/primitives/UnsignedLongs.java

      /**
       * A (self-inverse) bijection which converts the ordering on unsigned longs to the ordering on
       * longs, that is, {@code a <= b} as unsigned longs if and only if {@code flip(a) <= flip(b)} as
       * signed longs.
       */
      private static long flip(long a) {
        return a ^ Long.MIN_VALUE;
      }
    
      /**
       * Compares the two specified {@code long} values, treating them as unsigned values between {@code
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Thu Feb 15 16:12:13 UTC 2024
    - 17.6K bytes
    - Viewed (0)
  6. pkg/ctrlz/assets/static/js/popper-1.12.9.min.js

    s:{},arrowStyles:{},attributes:{},flipped:!1,offsets:{}};e.offsets.reference=O(this.state,this.popper,this.reference),e.placement=v(this.options.placement,e.offsets.reference,this.popper,this.reference,this.options.modifiers.flip.boundariesElement,this.options.modifiers.flip.padding),e.originalPlacement=e.placement,e.offsets.popper=S(this.popper,e.offsets.reference,e.placement),e.offsets.popper.position='absolute',e=C(this.modifiers,e),this.state.isCreated?this.options.onUpdate(e):(this.state.is...
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Tue May 23 17:08:31 UTC 2023
    - 18.7K bytes
    - Viewed (0)
  7. src/main/webapp/js/admin/popper.min.js

    tes:{},flipped:!1,offsets:{}};e.offsets.reference=L(this.state,this.popper,this.reference,this.options.positionFixed),e.placement=O(this.options.placement,e.offsets.reference,this.popper,this.reference,this.options.modifiers.flip.boundariesElement,this.options.modifiers.flip.padding),e.originalPlacement=e.placement,e.positionFixed=this.options.positionFixed,e.offsets.popper=C(this.popper,e.offsets.reference,e.placement),e.offsets.popper.position=this.options.positionFixed?'fixed':'absolute',e=P(...
    Registered: Wed Jun 12 13:08:18 UTC 2024
    - Last Modified: Fri Feb 07 10:28:50 UTC 2020
    - 20.8K bytes
    - Viewed (0)
  8. pkg/ctrlz/assets/static/css/fontawesome-all-5.0.6.css

    -webkit-transform:rotate(270deg);transform:rotate(270deg)}.fa-flip-horizontal{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=0, mirror=1)";-webkit-transform:scaleX(-1);transform:scaleX(-1)}.fa-flip-vertical{-webkit-transform:scaleY(-1);transform:scaleY(-1)}.fa-flip-horizontal.fa-flip-vertical,.fa-flip-vertical{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=2, mirror=1)"}.fa-flip-horizontal.fa-flip-vertical{-webkit-transform:scale(-1);transform:scale(-1)}:root...
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Tue May 23 17:08:31 UTC 2023
    - 33.9K bytes
    - Viewed (0)
  9. src/hash/maphash/smhasher_test.go

    	for z := 0; z < REP; z++ {
    		// pick a random key, hash it
    		k.random(r)
    		h := k.hash()
    
    		// flip each bit, hash & compare the results
    		for i := 0; i < n; i++ {
    			k.flipBit(i)
    			d := h ^ k.hash()
    			k.flipBit(i)
    
    			// record the effects of that bit flip
    			g := &grid[i]
    			for j := 0; j < hashSize; j++ {
    				g[j] += int(d & 1)
    				d >>= 1
    			}
    		}
    	}
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 03 16:41:38 UTC 2024
    - 11K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/hash/BloomFilterStrategies.java

          int hash1 = (int) hash64;
          int hash2 = (int) (hash64 >>> 32);
    
          boolean bitsChanged = false;
          for (int i = 1; i <= numHashFunctions; i++) {
            int combinedHash = hash1 + (i * hash2);
            // Flip all the bits if it's negative (guaranteed positive number)
            if (combinedHash < 0) {
              combinedHash = ~combinedHash;
            }
            bitsChanged |= bits.set(combinedHash % bitSize);
          }
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Oct 10 19:45:10 UTC 2022
    - 10.7K bytes
    - Viewed (0)
Back to top