- Sort Score
- Result 10 results
- Languages All
Results 131 - 140 of 1,082 for Bits (0.25 sec)
-
CHANGELOG/CHANGELOG-1.4.md
...
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Thu Dec 24 02:28:26 UTC 2020 - 133.5K bytes - Viewed (0) -
RELEASE.md
[TensorFloat-32](https://blogs.nvidia.com/blog/2020/05/14/tensorfloat-32-precision-format/). Specifically, inputs to such ops are rounded from 23 bits of precision to 10 bits of precision. This is unlikely to cause issues in practice for deep learning models. In some cases, TensorFloat-32 is also used for complex64 ops. TensorFloat-32 can be disabled by running
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Mon Aug 18 20:54:38 UTC 2025 - 740K bytes - Viewed (1) -
api/go1.2.txt
pkg syscall (linux-arm-cgo), type EpollEvent struct, Pad int32 pkg syscall (linux-arm-cgo), type EpollEvent struct, PadFd int32 pkg syscall (linux-arm-cgo), type FdSet struct pkg syscall (linux-arm-cgo), type FdSet struct, Bits [32]int32 pkg syscall (linux-arm-cgo), type Fsid struct pkg syscall (linux-arm-cgo), type Fsid struct, X__val [2]int32 pkg syscall (linux-arm-cgo), type ICMPv6Filter struct
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Fri Oct 18 04:36:59 UTC 2013 - 1.9M bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.21.md
## Dependencies ### Added - github.com/bits-and-blooms/bitset: [v1.2.0](https://github.com/bits-and-blooms/bitset/tree/v1.2.0) ### Changed - github.com/cilium/ebpf: [v0.5.0 → v0.6.2](https://github.com/cilium/ebpf/compare/v0.5.0...v0.6.2)
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Fri Oct 14 07:03:14 UTC 2022 - 367.3K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.17.md
## Urgent Upgrade Notes ### (No, really, you MUST read this before you upgrade) #### Cluster Lifecycle
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Thu Jan 28 10:44:33 UTC 2021 - 346.2K bytes - Viewed (1) -
CHANGELOG/CHANGELOG-1.22.md
### Added - github.com/antihax/optional: [v1.0.0](https://github.com/antihax/optional/tree/v1.0.0) - github.com/benbjohnson/clock: [v1.0.3](https://github.com/benbjohnson/clock/tree/v1.0.3) - github.com/bits-and-blooms/bitset: [v1.2.0](https://github.com/bits-and-blooms/bitset/tree/v1.2.0) - github.com/certifi/gocertifi: [2c3bb06](https://github.com/certifi/gocertifi/tree/2c3bb06)
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Tue Dec 13 12:43:45 UTC 2022 - 454.1K bytes - Viewed (0) -
api/go1.txt
pkg math/big, method (*Int) AndNot(*Int, *Int) *Int pkg math/big, method (*Int) Binomial(int64, int64) *Int pkg math/big, method (*Int) Bit(int) uint pkg math/big, method (*Int) BitLen() int pkg math/big, method (*Int) Bits() []Word pkg math/big, method (*Int) Bytes() []uint8 pkg math/big, method (*Int) Cmp(*Int) int pkg math/big, method (*Int) Div(*Int, *Int) *Int pkg math/big, method (*Int) DivMod(*Int, *Int, *Int) (*Int, *Int)
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Aug 14 18:58:28 UTC 2013 - 1.7M bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* type of the returned array is that of the specified array. If the queue fits in the specified * array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the * specified array and the size of this queue. * * <p>If this queue fits in the specified array with room to spare (i.e., the array has more
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 22.4K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/mylasta/direction/FessConfig.java
String QUERY_COLLAPSE_INNER_HITS_NAME = "query.collapse.inner.hits.name"; /** The key of the configuration. e.g. 0 */ String QUERY_COLLAPSE_INNER_HITS_SIZE = "query.collapse.inner.hits.size"; /** The key of the configuration. e.g. */ String QUERY_COLLAPSE_INNER_HITS_SORTS = "query.collapse.inner.hits.sorts"; /** The key of the configuration. e.g. */
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 525.6K bytes - Viewed (1) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
* array is that of the specified array. The returned array elements are in no particular order. * If the queue fits in the specified array, it is returned therein. Otherwise, a new array is * allocated with the runtime type of the specified array and the size of this queue. * * <p>If this queue fits in the specified array with room to spare (i.e., the array has more
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 18.9K bytes - Viewed (0)