Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for 0xfffffffff (0.05 sec)

  1. src/main/java/org/codelibs/core/collection/ArrayMap.java

        public boolean containsKey(final Object key) {
            final Entry<K, V>[] tbl = mapTable;
            if (key != null) {
                final int hashCode = key.hashCode();
                final int index = (hashCode & 0x7FFFFFFF) % tbl.length;
                for (Entry<K, V> e = tbl[index]; e != null; e = e.next) {
                    if (e.hashCode == hashCode && key.equals(e.key)) {
                        return true;
                    }
                }
    Registered: Sat Dec 20 08:55:33 UTC 2025
    - Last Modified: Sat Nov 22 11:21:59 UTC 2025
    - 20.1K bytes
    - Viewed (0)
  2. fess-crawler/src/main/java/org/codelibs/fess/crawler/client/http/ntlm/JcifsEngine.java

                throw new NTLMEngineException("Invalid NTLM type 2 message", exception);
            }
            final int type2Flags = type2Message.getFlags();
            final int type3Flags = type2Flags & (0xffffffff ^ (NtlmFlags.NTLMSSP_TARGET_TYPE_DOMAIN | NtlmFlags.NTLMSSP_TARGET_TYPE_SERVER));
            try {
                final Type3Message type3Message =
    Registered: Sat Dec 20 11:21:39 UTC 2025
    - Last Modified: Thu Dec 11 08:38:29 UTC 2025
    - 4.3K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/hash/HashTestUtils.java

          int count = 0;
          // originally was 2 * Math.log(...), making it try more times to avoid flakiness issues
          int maxCount = (int) (4 * Math.log(2 * keyBits * hashBits) + 1);
          while (same != 0xffffffff || diff != 0xffffffff) {
            int key1 = rand.nextInt();
            // flip input bit for key2
            int key2 = key1 ^ (1 << i);
            // get hashes
            int hash1 = function.hashInt(key1).asInt();
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Oct 28 18:19:59 UTC 2025
    - 25.6K bytes
    - Viewed (0)
  4. guava/src/com/google/common/math/LongMath.java

          }
    
          @Override
          long mulMod(long a, long b, long m) {
            long aHi = a >>> 32; // < 2^31
            long bHi = b >>> 32; // < 2^31
            long aLo = a & 0xFFFFFFFFL; // < 2^32
            long bLo = b & 0xFFFFFFFFL; // < 2^32
    
            /*
             * a * b == aHi * bHi * 2^64 + (aHi * bLo + aLo * bHi) * 2^32 + aLo * bLo.
             *       == (aHi * bHi * 2^32 + aHi * bLo + aLo * bHi) * 2^32 + aLo * bLo
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Nov 03 21:01:09 UTC 2025
    - 46.8K bytes
    - Viewed (0)
  5. android/guava-tests/test/com/google/common/hash/HashTestUtils.java

          int count = 0;
          // originally was 2 * Math.log(...), making it try more times to avoid flakiness issues
          int maxCount = (int) (4 * Math.log(2 * keyBits * hashBits) + 1);
          while (same != 0xffffffff || diff != 0xffffffff) {
            int key1 = rand.nextInt();
            // flip input bit for key2
            int key2 = key1 ^ (1 << i);
            // get hashes
            int hash1 = function.hashInt(key1).asInt();
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Oct 28 18:19:59 UTC 2025
    - 25.6K bytes
    - Viewed (0)
  6. fess-crawler/src/main/resources/org/codelibs/fess/crawler/mime/tika-mimetypes.xml

        <!-- Always seem to have a version integer as their first entry, -->
        <!--  normally 00, 01 or 02, check for that -->
        <magic priority="40">
          <match value="0x3080020100" type="string"
                  mask="0xFFFFFFFFFC" offset="0"/>
          <match value="0x3081FF020100" type="string"
                  mask="0xFFFF00FFFFFC" offset="0"/>
          <match value="0x3082FFFF020100" type="string"
                  mask="0xFFFF0000FFFFFC" offset="0"/>
    Registered: Sat Dec 20 11:21:39 UTC 2025
    - Last Modified: Thu Oct 16 07:46:32 UTC 2025
    - 320.2K bytes
    - Viewed (5)
Back to top