- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 30 for onresize (0.21 sec)
-
docs/debugging/inspect/decrypt-v1.go
} stream, err := sio.AES_256_GCM.Stream(key) if err != nil { return err } // Zero nonce, we only use each key once, and 32 bytes is plenty. nonce := make([]byte, stream.NonceSize()) encr := stream.DecryptReader(r, nonce, nil) _, err = io.Copy(w, encr) if err == nil { fmt.Println(okMsg) } return err
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 11 21:22:47 GMT 2024 - 1.6K bytes - Viewed (0) -
internal/kms/single-key.go
HTTPStatusCode: http.StatusBadRequest, APICode: "KMS.InternalException", Err: errors.New("invalid algorithm: " + algorithm), } } nonce, err := sioutil.Random(aead.NonceSize()) if err != nil { return DEK{}, err } plaintext, err := sioutil.Random(32) if err != nil { return DEK{}, err } associatedData, _ := context.MarshalText()
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Mar 01 21:09:42 GMT 2024 - 7.9K bytes - Viewed (0) -
tensorflow/c/eager/dlpack.cc
dlm_tensor->dl_tensor.dtype = tf_dlm_type; std::vector<int64_t>* shape_arr = &tf_dlm_tensor_ctx->shape; std::vector<int64_t>* stride_arr = &tf_dlm_tensor_ctx->strides; shape_arr->resize(ndim); stride_arr->resize(ndim, 1); for (int i = 0; i < ndim; i++) { (*shape_arr)[i] = tensor->dim_size(i); } for (int i = ndim - 2; i >= 0; --i) { (*stride_arr)[i] = (*shape_arr)[i + 1] * (*stride_arr)[i + 1];
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Thu Feb 15 09:49:45 GMT 2024 - 12.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/ImmutableDoubleArrayTest.java
} public void testBuilder_presize_zero() { ImmutableDoubleArray.Builder builder = ImmutableDoubleArray.builder(0); builder.add(5.0); ImmutableDoubleArray array = builder.build(); assertThat(array.asList()).containsExactly(5.0); } public void testBuilder_presize_negative() { try { ImmutableDoubleArray.builder(-1); fail();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 06 15:23:21 GMT 2023 - 20K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
* good job of distributing the elements to the buckets to a distribution not far from uniform), and * amortized since some operations can trigger a hash table resize. * * <p>Unlike {@code java.util.HashSet}, iteration is only proportional to the actual {@code size()}, * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
* good job of distributing the elements to the buckets to a distribution not far from uniform), and * amortized since some operations can trigger a hash table resize. * * <p>Unlike {@code java.util.HashSet}, iteration is only proportional to the actual {@code size()}, * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
tensorflow/c/eager/unified_api_testutil.cc
func_inputs.reserve(inputs.size()); TF_RETURN_IF_ERROR( CreateParamsForInputs(func_ctx.get(), inputs, &func_inputs)); std::vector<AbstractTensorHandle*> model_outputs; model_outputs.resize(outputs.size()); TF_RETURN_IF_ERROR(model(func_ctx.get(), absl::MakeSpan(func_inputs), absl::MakeSpan(model_outputs))); for (auto func_input : func_inputs) { func_input->Unref();
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Tue Feb 27 13:57:45 GMT 2024 - 5.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* function doing a good job of distributing the elements to the buckets to a distribution not far * from uniform), and amortized since some operations can trigger a hash table resize. * * <p>As compared with {@link java.util.LinkedHashMap}, this structure places significantly reduced * load on the garbage collector by only using a constant number of internal objects. *
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) -
android/guava/src/com/google/common/collect/CompactHashMap.java
* function doing a good job of distributing the elements to the buckets to a distribution not far * from uniform), and amortized since some operations can trigger a hash table resize. * * <p>Unlike {@code java.util.HashMap}, iteration is only proportional to the actual {@code size()}, * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger
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/src/com/google/common/collect/CompactLinkedHashMap.java
* function doing a good job of distributing the elements to the buckets to a distribution not far * from uniform), and amortized since some operations can trigger a hash table resize. * * <p>As compared with {@link java.util.LinkedHashMap}, this structure places significantly reduced * load on the garbage collector by only using a constant number of internal objects. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0)