- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 776 for bots (0.14 sec)
-
src/cmd/asm/internal/arch/arm.go
if cond == "" { return true } bits, ok := ParseARMCondition(cond) if !ok { return false } /* hack to make B.NE etc. work: turn it into the corresponding conditional */ if prog.As == arm.AB { prog.As = bcode[(bits^arm.C_SCOND_XOR)&0xf] bits = (bits &^ 0xf) | arm.C_SCOND_NONE } prog.Scond = bits return true }
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Nov 18 17:59:44 GMT 2022 - 6.1K bytes - Viewed (0) -
src/main/java/jcifs/ACE.java
* the operation and the desired access bits are compared to the SID * and access mask of each ACE. If the SID matches, the allow/deny flags * and access mask are considered. If the ACE is a "deny" * ACE and <i>any</i> of the desired access bits match bits in the access * mask of the ACE, the whole access check fails. If the ACE is an "allow" * ACE and <i>all</i> of the bits in the desired access bits match bits in
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 6.5K bytes - Viewed (0) -
src/main/java/jcifs/smb1/UniAddress.java
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Fri Mar 22 21:10:40 GMT 2019 - 16.2K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
LockFreeBitArray bits) { long bitSize = bits.bitSize(); long hash64 = Hashing.murmur3_128().hashObject(object, funnel).asLong(); int hash1 = (int) hash64; int hash2 = (int) (hash64 >>> 32); boolean bitsChanged = false; for (int i = 1; i <= numHashFunctions; i++) { int combinedHash = hash1 + (i * hash2); // Flip all the bits if it's negative (guaranteed positive number)
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 10.7K 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 08 22:53:08 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
/** * Sets {@code numHashFunctions} bits of the given bit array, by hashing a user element. * * <p>Returns whether any bits changed as a result of this operation. */ <T extends @Nullable Object> boolean put( @ParametricNullness T object, Funnel<? super T> funnel, int numHashFunctions, LockFreeBitArray bits); /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
doc/godebug.md
can hold a comma-separated list of these settings. For example, if a Go program is running in an environment that contains GODEBUG=http2client=0,http2server=0 then that Go program will disable the use of HTTP/2 by default in both the HTTP client and the HTTP server. It is also possible to set the default `GODEBUG` for a given program (discussed below). When preparing any change that is permitted by Go 1 compatibility
Plain Text - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Tue Apr 16 17:29:58 GMT 2024 - 13.5K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/idn/IdnaMappingTable.kt
* * ``` * 0..63 : Length of the UTF-16 sequence that this range maps to. The offset is b2b3. * 64..79 : Offset by a fixed negative offset. The bottom 4 bits of b1 are the top 4 bits of the offset. * 80..95 : Offset by a fixed positive offset. The bottom 4 bits of b1 are the top 4 bits of the offset. * 119 : Ignored. * 120 : Valid. * 121 : Disallowed * 122 : Mapped inline to the sequence: [b2].
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Tue Apr 02 11:39:58 GMT 2024 - 9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
long numeratorAccum = n; long denominatorAccum = 1; int bits = LongMath.log2(n, CEILING); int numeratorBits = bits; for (int i = 1; i < k; i++) { int p = n - i; int q = i + 1; // log2(p) >= bits - 1, because p >= n/2 if (numeratorBits + bits >= Long.SIZE - 1) { // The numerator is as big as it can get without risking overflow.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/HashTestUtils.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 25.3K bytes - Viewed (0)