- Sort Score
- Result 10 results
- Languages All
Results 11 - 19 of 19 for MID (0.2 sec)
-
src/main/java/jcifs/smb1/dcerpc/UUID.java
private static byte B(int i) { return (byte)(i & 0xFF); } private static short S(int i) { return (short)(i & 0xFFFF); } public UUID(rpc.uuid_t uuid) { time_low = uuid.time_low; time_mid = uuid.time_mid; time_hi_and_version = uuid.time_hi_and_version; clock_seq_hi_and_reserved = uuid.clock_seq_hi_and_reserved; clock_seq_low = uuid.clock_seq_low; node = new byte[6];
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Fri Mar 22 20:39:42 GMT 2019 - 4.1K bytes - Viewed (0) -
src/main/java/jcifs/dcerpc/rpc.java
import jcifs.dcerpc.ndr.NdrObject; @SuppressWarnings ( "all" ) public class rpc { public static class uuid_t extends NdrObject { public int time_low; public short time_mid; public short time_hi_and_version; public byte clock_seq_hi_and_reserved; public byte clock_seq_low; public byte[] node; @Override
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Fri Mar 22 20:40:13 GMT 2019 - 8.8K bytes - Viewed (0) -
src/main/java/jcifs/dcerpc/UUID.java
} /** * * @param uuid * wrapped uuid */ public UUID ( rpc.uuid_t uuid ) { this.time_low = uuid.time_low; this.time_mid = uuid.time_mid; this.time_hi_and_version = uuid.time_hi_and_version; this.clock_seq_hi_and_reserved = uuid.clock_seq_hi_and_reserved; this.clock_seq_low = uuid.clock_seq_low; this.node = new byte[6];
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 4.6K bytes - Viewed (0) -
src/main/java/jcifs/smb1/dcerpc/rpc.idl
interface rpc { /* base types */ typedef unsigned char uint8_t; typedef unsigned short uint16_t; typedef unsigned int uint32_t; /* dce */ typedef struct { uint32_t time_low; uint16_t time_mid; uint16_t time_hi_and_version; uint8_t clock_seq_hi_and_reserved; uint8_t clock_seq_low; uint8_t node[6]; } uuid_t; /* win32 stuff */ typedef struct { uint32_t type;
Others - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Fri Mar 22 20:39:42 GMT 2019 - 1.4K bytes - Viewed (0) -
src/main/java/jcifs/util/transport/Response.java
/** * @return status code */ int getErrorCode (); /** * @param k */ void setMid ( long k ); /** * @return mid */ long getMid (); /** * * @param buffer * @param i * @param size * @return whether signature verification is successful */
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 2.3K bytes - Viewed (0) -
src/main/java/jcifs/dcerpc/rpc.idl
interface rpc { /* base types */ typedef unsigned char uint8_t; typedef unsigned short uint16_t; typedef unsigned int uint32_t; /* dce */ typedef struct { uint32_t time_low; uint16_t time_mid; uint16_t time_hi_and_version; uint8_t clock_seq_hi_and_reserved; uint8_t clock_seq_low; uint8_t node[6]; } uuid_t; /* win32 stuff */ typedef struct { uint32_t type;
Others - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 1.4K bytes - Viewed (0) -
src/main/java/jcifs/smb1/util/mime.map
application/zip zip jar # ZIP Compressed File audio/basic au snd # Audio Sound File audio/x-aiff aif aiff aifc # AIFF Sound File audio/x-midi mid # MIDI Sound File audio/x-pn-realaudio ra ram rm rpm # REALAUDIO Sound File audio/x-wav wav # WAV Sound File audio/x-mpegurl mp3 # MP3 Sound File
Plain Text - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Fri Mar 22 20:39:42 GMT 2019 - 5.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
swap(array, from, to); } return array[k]; } else { int midIndex = (from + to) >>> 1; // Choose the median of the elements at the from, to and mid indexes, // and rearrange so that array[from]<=array[from+1], and // array[to] => array[from + 1]. swap(array, midIndex, from + 1); if (array[from] > array[to]) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
swap(array, from, to); } return array[k]; } else { int midIndex = (from + to) >>> 1; // Choose the median of the elements at the from, to and mid indexes, // and rearrange so that array[from]<=array[from+1], and // array[to] => array[from + 1]. swap(array, midIndex, from + 1); if (array[from] > array[to]) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0)