- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 1,316 for hits (0.12 sec)
-
docs/pt/docs/history-design-future.md
</blockquote> ## Investigação Ao usar todas as alternativas anteriores, eu tive a chance de aprender com todas elas, aproveitar ideias e combiná-las da melhor maneira que encontrei para mim e para os times de desenvolvedores com os quais trabalhava. Por exemplo, estava claro que idealmente ele deveria ser baseado nos _type hints_ padrões do Python.
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Fri Mar 22 01:42:11 GMT 2024 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountHashMap.java
/** * The hashtable. Its values are indexes to the keys, values, and entries arrays. * * <p>Currently, the UNSET value means "null pointer", and any non negative value x is the actual * index. * * <p>Its size must be a power of two. */ private transient int[] table; /** * Contains the logical entries, in the range of [0, size()). The high 32 bits of each long is the
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashCode.java
public abstract class HashCode { HashCode() {} /** Returns the number of bits in this hash code; a positive multiple of 8. */ public abstract int bits(); /** * Returns the first four bytes of {@linkplain #asBytes() this hashcode's bytes}, converted to an * {@code int} value in little-endian order. * * @throws IllegalStateException if {@code bits() < 32} */ public abstract int asInt(); /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 20 18:43:59 GMT 2021 - 12.6K bytes - Viewed (0) -
okhttp-tls/src/main/kotlin/okhttp3/tls/internal/der/DerReader.kt
constructed = pushedConstructed if (name != null) path.removeAt(path.size - 1) } } /** * Execute [block] with a new namespace for type hints. Type hints from the enclosing type are no * longer usable by the current type's members. */ fun <T> withTypeHint(block: () -> T): T { typeHintStack.add(null) try { return block() } finally {
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 10.5K bytes - Viewed (0) -
tensorflow/c/eager/dlpack_test.cc
EXPECT_EQ(dltensor_out->ndim, dltensor_in->ndim); EXPECT_EQ(dltensor_out->dtype.code, dltensor_in->dtype.code); EXPECT_EQ(dltensor_out->dtype.bits, dltensor_in->dtype.bits); EXPECT_EQ(dltensor_out->dtype.lanes, dltensor_in->dtype.lanes); for (int i = 0; i < dltensor_in->ndim; ++i) { EXPECT_EQ(dltensor_out->shape[i], dltensor_in->shape[i]); if (dltensor_out->strides) {
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Fri Jun 30 03:04:46 GMT 2023 - 4.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountLinkedHashMap.java
* which the superconstructor calls. */ /** * Contains the link pointers corresponding with the entries, in the range of [0, size()). The * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer * (pointing to the nextEntry entry in the linked list). The pointers in [size(), entries.length) * are all "null" (UNSET). *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 5.9K bytes - Viewed (0) -
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) -
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 Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 39.8K bytes - Viewed (0) -
docs/en/docs/alternatives.md
It had automatic data validation, data serialization and OpenAPI schema generation based on the same type hints in several places.
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Thu Apr 18 19:53:19 GMT 2024 - 23.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
} private static final int ENDPOINT = -2; /** * Contains the link pointers corresponding with the entries, in the range of [0, size()). The * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are * all "null" (UNSET). *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0)