Search Options

Results per page
Sort
Preferred Languages
Advance

Results 341 - 344 of 344 for 0xff (0.02 sec)

  1. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    01FD          ; valid                                  # 1.1  LATIN SMALL LETTER AE WITH ACUTE
    01FE          ; mapped                 ; 01FF          # 1.1  LATIN CAPITAL LETTER O WITH STROKE AND ACUTE
    01FF          ; valid                                  # 1.1  LATIN SMALL LETTER O WITH STROKE AND ACUTE
    0200          ; mapped                 ; 0201          # 1.1  LATIN CAPITAL LETTER A WITH DOUBLE GRAVE
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sat Feb 10 11:25:47 UTC 2024
    - 854.1K bytes
    - Viewed (0)
  2. src/bytes/bytes.go

    // TODO: update when package unicode captures more of the properties.
    func isSeparator(r rune) bool {
    	// ASCII alphanumerics and underscore are not separators
    	if r <= 0x7F {
    		switch {
    		case '0' <= r && r <= '9':
    			return false
    		case 'a' <= r && r <= 'z':
    			return false
    		case 'A' <= r && r <= 'Z':
    			return false
    		case r == '_':
    			return false
    		}
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 35.5K bytes
    - Viewed (0)
  3. src/test/java/jcifs/dcerpc/msrpc/lsarpcTest.java

            assertEquals(mockDomains, lookupSids.domains);
            assertEquals(mockNames, lookupSids.names);
            assertEquals(1, lookupSids.level);
            assertEquals(10, lookupSids.count);
            assertEquals(0x0f, lookupSids.getOpnum());
        }
    
        @Test
        void testLsarLookupSidsEncodeIn() throws NdrException {
            rpc.policy_handle mockHandle = mock(rpc.policy_handle.class);
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 60.8K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/collect/MapMakerInternalMap.java

       * of reads and delaying a lock acquisition until the threshold is crossed or a mutation occurs.
       *
       * <p>This must be a (2^n)-1 as it is used as a mask.
       */
      static final int DRAIN_THRESHOLD = 0x3F;
    
      /**
       * Maximum number of entries to be drained in a single cleanup run. This applies independently to
       * the cleanup queue and both reference queues.
       */
      // TODO(fry): empirically optimize this
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 90K bytes
    - Viewed (0)
Back to top