Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 34 for unshift (0.06 sec)

  1. src/main/webapp/js/admin/jquery-3.7.1.min.js

    0,p=r||"",T.readyState=0<e?4:0,i=200<=e&&e<300||304===e,n&&(s=function(e,t,n){var r,i,o,a,s=e.contents,u=e.dataTypes;while("*"===u[0])u.shift(),void 0===r&&(r=e.mimeType||t.getResponseHeader("Content-Type"));if(r)for(i in s)if(s[i]&&s[i].test(r)){u.unshift(i);break}if(u[0]in n)o=u[0];else{for(i in n){if(!u[0]||e.converters[i+" "+u[0]]){o=i;break}a||(a=i)}o=o||a}if(o)return o!==u[0]&&u.unshift(o),n[o]}(v,T,n)),!i&&-1<ce.inArray("script",v.dataTypes)&&ce.inArray("json",v.dataTypes)<0&&(v.converters["text script"]...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 26 01:07:52 UTC 2024
    - 85.5K bytes
    - Viewed (0)
  2. src/main/webapp/js/jquery-3.7.1.min.js

    0,p=r||"",T.readyState=0<e?4:0,i=200<=e&&e<300||304===e,n&&(s=function(e,t,n){var r,i,o,a,s=e.contents,u=e.dataTypes;while("*"===u[0])u.shift(),void 0===r&&(r=e.mimeType||t.getResponseHeader("Content-Type"));if(r)for(i in s)if(s[i]&&s[i].test(r)){u.unshift(i);break}if(u[0]in n)o=u[0];else{for(i in n){if(!u[0]||e.converters[i+" "+u[0]]){o=i;break}a||(a=i)}o=o||a}if(o)return o!==u[0]&&u.unshift(o),n[o]}(v,T,n)),!i&&-1<ce.inArray("script",v.dataTypes)&&ce.inArray("json",v.dataTypes)<0&&(v.converters["text script"]...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 26 01:07:52 UTC 2024
    - 85.5K bytes
    - Viewed (0)
  3. src/main/webapp/js/jquery-3.7.1.min.map

    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 26 01:07:52 UTC 2024
    - 131.6K bytes
    - Viewed (0)
  4. src/main/webapp/js/admin/jquery-3.7.1.min.map

    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 26 01:07:52 UTC 2024
    - 131.6K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/hash/Murmur3_32HashFunction.java

            }
          }
    
          long buffer = 0;
          int shift = 0;
          for (; i < utf16Length; i++) {
            char c = input.charAt(i);
            if (c < 0x80) {
              buffer |= (long) c << shift;
              shift += 8;
              len++;
            } else if (c < 0x800) {
              buffer |= charToTwoUtf8Bytes(c) << shift;
              shift += 16;
              len += 2;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Apr 14 16:36:11 UTC 2025
    - 11.8K bytes
    - Viewed (0)
  6. src/main/assemblies/files/fess

    do
        case $1 in
          --help) ARGV="$ARGV -h"; shift;;
          --*=*) properties="$properties -Dfess.${1#--}"
               shift 1
               ;;
          --*) [ $# -le 1 ] && {
                    echo "Option requires an argument: '$1'."
                    shift
                    continue
                }
               properties="$properties -Dfess.${1#--}=$2"
               shift 2
               ;;
          *) ARGV="$ARGV $1" ; shift
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sun Jan 15 06:32:15 UTC 2023
    - 5.4K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/math/DoubleUtils.java

         * top SIGNIFICAND_BITS + 1.
         *
         * It helps to consider the real number signif = absX * 2^(SIGNIFICAND_BITS - exponent).
         */
        int shift = exponent - SIGNIFICAND_BITS - 1;
        long twiceSignifFloor = absX.shiftRight(shift).longValue();
        long signifFloor = twiceSignifFloor >> 1;
        signifFloor &= SIGNIFICAND_MASK; // remove the implied bit
    
        /*
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 5.1K bytes
    - Viewed (0)
  8. guava/src/com/google/common/math/BigIntegerMath.java

          sqrt0 = sqrtApproxWithDoubles(x);
        } else {
          int shift = (log2 - DoubleUtils.SIGNIFICAND_BITS) & ~1; // even!
          /*
           * We have that x / 2^shift < 2^54. Our initial approximation to sqrtFloor(x) will be
           * 2^(shift/2) * sqrtApproxWithDoubles(x / 2^shift).
           */
          sqrt0 = sqrtApproxWithDoubles(x.shiftRight(shift)).shiftLeft(shift >> 1);
        }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 18.8K bytes
    - Viewed (0)
  9. guava/src/com/google/common/hash/Murmur3_32HashFunction.java

            }
          }
    
          long buffer = 0;
          int shift = 0;
          for (; i < utf16Length; i++) {
            char c = input.charAt(i);
            if (c < 0x80) {
              buffer |= (long) c << shift;
              shift += 8;
              len++;
            } else if (c < 0x800) {
              buffer |= charToTwoUtf8Bytes(c) << shift;
              shift += 16;
              len += 2;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Apr 14 16:36:11 UTC 2025
    - 11.8K bytes
    - Viewed (0)
  10. guava/src/com/google/common/math/DoubleUtils.java

         * top SIGNIFICAND_BITS + 1.
         *
         * It helps to consider the real number signif = absX * 2^(SIGNIFICAND_BITS - exponent).
         */
        int shift = exponent - SIGNIFICAND_BITS - 1;
        long twiceSignifFloor = absX.shiftRight(shift).longValue();
        long signifFloor = twiceSignifFloor >> 1;
        signifFloor &= SIGNIFICAND_MASK; // remove the implied bit
    
        /*
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 5.1K bytes
    - Viewed (0)
Back to top