- Sort Score
- Result 10 results
- Languages All
Results 111 - 115 of 115 for 0xef (0.1 sec)
-
src/test/java/jcifs/smb1/dcerpc/msrpc/samrTest.java
new samr.SamrEnumerateAliasesInDomain(mockPolicyHandle, 1, 2, new samr.SamrSamArray(), 3); // Then: Should have correct values assertEquals(0x0f, message.getOpnum()); assertEquals(mockPolicyHandle, message.domain_handle); assertEquals(1, message.resume_handle); assertEquals(2, message.acct_flags);
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 33.6K bytes - Viewed (0) -
src/main/java/jcifs/smb1/dcerpc/msrpc/lsarpc.java
} /** * LSA lookup SIDs message. */ public static class LsarLookupSids extends DcerpcMessage { @Override public int getOpnum() { return 0x0f; } /** Return value from the RPC call. */ public int retval; /** Policy handle for the LSA operation. */ public rpc.policy_handle handle;
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 42.5K bytes - Viewed (0) -
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) -
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) -
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)