- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 243 for bits (0.18 sec)
-
android/guava/src/com/google/common/collect/CompactHashMap.java
* metadata} is the size that the arrays should be allocated with. Once the arrays have been * allocated, the value of {@code metadata} combines the number of bits in the "short hash", in * its bottom {@value CompactHashing#HASH_TABLE_BITS_MAX_BITS} bits, with a modification count in * the remaining bits that is used to detect concurrent modification during iteration. */ private transient int metadata;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 35.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/LongMathTest.java
for (int bits = 10; bits < 63; bits++) { for (int i = 0; i < 100; i++) { long p = BigInteger.probablePrime(bits, rand).longValue(); assertTrue(LongMath.isPrime(p)); } } } @GwtIncompatible // isPrime is GWT-incompatible public void testIsPrimeOnRandomComposites() { Random rand = new Random(1); for (int bits = 5; bits < 32; bits++) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb1/com/SmbComTreeConnectAndXResponse.java
return 0; } @Override protected int readParameterWordsWireFormat ( byte[] buffer, int bufferIndex ) { this.supportSearchBits = ( buffer[ bufferIndex ] & SMB_SUPPORT_SEARCH_BITS ) == SMB_SUPPORT_SEARCH_BITS; this.shareIsInDfs = ( buffer[ bufferIndex ] & SMB_SHARE_IS_IN_DFS ) == SMB_SHARE_IS_IN_DFS; return 2; } @Override
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 4.2K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/SmbComTreeConnectAndXResponse.java
return 0; } int readParameterWordsWireFormat( byte[] buffer, int bufferIndex ) { supportSearchBits = ( buffer[bufferIndex] & SMB_SUPPORT_SEARCH_BITS ) == SMB_SUPPORT_SEARCH_BITS; shareIsInDfs = ( buffer[bufferIndex] & SMB_SHARE_IS_IN_DFS ) == SMB_SHARE_IS_IN_DFS; return 2; } int readBytesWireFormat( byte[] buffer, int bufferIndex ) {
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Fri Mar 22 21:10:40 GMT 2019 - 2.9K bytes - Viewed (0) -
internal/pubsub/mask.go
package pubsub import ( "math" "math/bits" ) // Mask allows filtering by a bitset mask. type Mask uint64 const ( // MaskAll is the mask for all entries. MaskAll Mask = math.MaxUint64 ) // MaskFromMaskable extracts mask from an interface. func MaskFromMaskable(m Maskable) Mask { return Mask(m.Mask()) } // Contains returns whether *all* flags in other is present in t. func (t Mask) Contains(other Mask) bool {
Go - Registered: Sun Apr 21 19:28:08 GMT 2024 - Last Modified: Tue Jul 05 21:45:49 GMT 2022 - 1.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* byte sequences under the covers. * <li><b>hash code:</b> each hash function always yields hash codes of the same fixed bit length * (given by {@link #bits}). For example, {@link Hashing#sha1} produces a 160-bit number, * while {@link Hashing#murmur3_32()} yields only 32 bits. Because a {@code long} value is * clearly insufficient to hold all hash code values, this API represents a hash code as an
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 25 18:22:59 GMT 2021 - 10.9K bytes - Viewed (0) -
src/main/java/jcifs/pac/ASN1Util.java
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Mon Oct 02 12:02:06 GMT 2023 - 6.5K bytes - Viewed (0) -
common-protos/k8s.io/api/networking/v1alpha1/generated.proto
optional k8s.io.api.core.v1.NodeSelector nodeSelector = 1; // perNodeHostBits defines the number of host bits to be configured per node. // A subnet mask determines how much of the address is used for network bits // and host bits. For example an IPv4 address of 192.168.0.0/24, splits the // address into 24 bits for the network portion and 8 bits for the host portion. // To allocate 256 IPs, set this field to 8 (a /24 mask for IPv4 or a /120 for IPv6).
Plain Text - Registered: Wed May 01 22:53:12 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/LongMathTest.java
for (int bits = 10; bits < 63; bits++) { for (int i = 0; i < 100; i++) { long p = BigInteger.probablePrime(bits, rand).longValue(); assertTrue(LongMath.isPrime(p)); } } } @GwtIncompatible // isPrime is GWT-incompatible public void testIsPrimeOnRandomComposites() { Random rand = new Random(1); for (int bits = 5; bits < 32; bits++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0) -
okhttp-tls/src/main/kotlin/okhttp3/tls/internal/der/BitString.kt
* limitations under the License. */ package okhttp3.tls.internal.der import okio.ByteString /** * Like a [ByteString], but whose bits are not necessarily a strict multiple of 8. */ internal data class BitString( val byteString: ByteString, /** 0-7 unused bits in the last byte. */ val unusedBitsCount: Int, ) { // Avoid Long.hashCode(long) which isn't available on Android 5. override fun hashCode(): Int {
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 1.1K bytes - Viewed (0)