- Sort Score
- Num 10 results
- Language All
Results 1 - 6 of 6 for newDom (0.06 seconds)
-
android/guava/src/com/google/common/collect/TreeMultiset.java
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 13:11:08 GMT 2026 - 34K bytes - Click Count (0) -
tensorflow/c/eager/c_api.cc
TF_Status* status) { tensorflow::ImmediateExecutionOperation* new_op = tensorflow::unwrap(ctx)->CreateOperation(); status->status = new_op->Reset(op_or_function_name, nullptr); if (!status->status.ok()) { new_op->Release(); new_op = nullptr; } return tensorflow::wrap(new_op); } void TFE_DeleteOp(TFE_Op* op) { if (op == nullptr) { return; }Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Fri Nov 07 05:55:21 GMT 2025 - 43.9K bytes - Click Count (0) -
cmd/metacache-entries_test.go
want := []string{"src/compress/bzip2/bit_reader.go", "src/compress/bzip2/bzip2.go", "src/compress/bzip2/bzip2_test.go", "src/compress/bzip2/huffman.go", "src/compress/bzip2/move_to_front.go", "src/compress/bzip2/testdata/Isaac.Newton-Opticks.txt.bz2", "src/compress/bzip2/testdata/e.txt.bz2", "src/compress/bzip2/testdata/fail-issue5747.bz2", "src/compress/bzip2/testdata/pass-random1.bin", "src/compress/bzip2/testdata/pass-random1.bz2", "src/compress/bzip2/testdata/pass-random2.bin",...Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 31.6K bytes - Click Count (0) -
api/go1.26.txt
pkg crypto/hpke, func NewHybridPublicKey(crypto.Encapsulator, *ecdh.PublicKey) (PublicKey, error) #75300 pkg crypto/hpke, func NewKDF(uint16) (KDF, error) #75300 pkg crypto/hpke, func NewKEM(uint16) (KEM, error) #75300 pkg crypto/hpke, func NewMLKEMPrivateKey(crypto.Decapsulator) (PrivateKey, error) #75300 pkg crypto/hpke, func NewMLKEMPublicKey(crypto.Encapsulator) (PublicKey, error) #75300
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Dec 11 19:57:52 GMT 2025 - 11.5K bytes - Click Count (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
* * We start out with a double-precision approximation, which may be higher or lower than the * true value. Therefore, we perform at least one Newton iteration to get a guess that's * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point. */ BigInteger sqrt0; int log2 = log2(x, FLOOR);Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 18.8K bytes - Click Count (0) -
cmd/metacache-stream_test.go
2/", "src/compress/bzip2/bit_reader.go", "src/compress/bzip2/bzip2.go", "src/compress/bzip2/bzip2_test.go", "src/compress/bzip2/huffman.go", "src/compress/bzip2/move_to_front.go", "src/compress/bzip2/testdata/", "src/compress/bzip2/testdata/Isaac.Newton-Opticks.txt.bz2", "src/compress/bzip2/testdata/e.txt.bz2", "src/compress/bzip2/testdata/fail-issue5747.bz2", "src/compress/bzip2/testdata/pass-random1.bin", "src/compress/bzip2/testdata/pass-random1.bz2", "src/compress/bzip2/testdata/pass-random2.bin",...
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Wed Apr 09 14:28:39 GMT 2025 - 15K bytes - Click Count (0)