- Sort Score
- Num 10 results
- Language All
Results 21 - 30 of 140 for vectors (0.11 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
tensorflow/c/eager/c_api_debug.cc
#include "tensorflow/core/platform/status.h" using tensorflow::string; namespace { std::vector<int64_t> TensorShapeAsVector(const tensorflow::TensorHandle& handle, absl::Status* status) { std::vector<int64_t> shape; int rank = -1; *status = handle.NumDims(&rank); if (!status->ok()) { return shape; } shape.reserve(rank);Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Sat Oct 12 05:11:17 GMT 2024 - 2.5K bytes - Click Count (0) -
src/main/java/org/codelibs/core/collection/CollectionsUtil.java
* @param c the collection of elements to be placed in the vector * @return a new instance of {@link Vector} * @see Vector#Vector(Collection) */ public static <E> Vector<E> newVector(final Collection<? extends E> c) { return new Vector<>(c); } /** * Creates and returns a new instance of {@link Vector}. * * @param <E> the element type of {@link Vector}Created: Fri Apr 03 20:58:12 GMT 2026 - Last Modified: Thu Jul 31 08:16:49 GMT 2025 - 49.9K bytes - Click Count (0) -
src/test/java/jcifs/pac/kerberos/KerberosEncDataTest.java
*/ @Test void testConstructorUnknownField() throws IOException { ASN1EncodableVector vector = new ASN1EncodableVector(); vector.add(new DERTaggedObject(99, new DERGeneralString("unknown"))); DERSequence sequence = new DERSequence(vector); byte[] encoded = new DERTaggedObject(false, BERTags.APPLICATION, 1, sequence).getEncoded();Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 7.7K bytes - Click Count (0) -
tensorflow/c/c_api_internal.h
std::vector<std::string> tensor_id_data; }; struct TF_ImportGraphDefResults { std::vector<TF_Output> return_tensors; std::vector<TF_Operation*> return_nodes; std::vector<const char*> missing_unused_key_names; std::vector<int> missing_unused_key_indexes; // Backing memory for missing_unused_key_names values. std::vector<std::string> missing_unused_key_names_data; };Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Wed Jan 07 04:56:09 GMT 2026 - 7.5K bytes - Click Count (0) -
tensorflow/c/eager/gradients.cc
const string& op_name) { std::vector<int64_t> input_ids(inputs.size()); std::vector<tensorflow::DataType> input_dtypes(inputs.size()); for (int i = 0; i < inputs.size(); i++) { input_ids[i] = ToId(inputs[i]); input_dtypes[i] = inputs[i]->DataType(); } std::vector<TapeTensor> tape_tensors; tape_tensors.reserve(outputs.size()); for (auto t : outputs) {
Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Tue Feb 24 06:18:31 GMT 2026 - 19.6K bytes - Click Count (0) -
tensorflow/c/c_api_experimental.cc
if (!status->status.ok()) return; // Initialize a input_tensor vector with `nullptr` values. std::vector<const Tensor*> input_tensors_vector(num_inputs, nullptr); // A vector to keep track of newly created `tf::Tensor` objects. std::vector<Tensor> all_input_tensors; // Update the vector with information from `input_tensors` if provided. if (input_tensors != nullptr) {
Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Sat Oct 04 05:55:32 GMT 2025 - 29.4K bytes - Click Count (0) -
tensorflow/c/c_api_function.cc
// Process inputs. std::vector<tensorflow::OutputTensor> input_tensors; std::unordered_map<const Node*, std::vector<int>> input_nodes; status->status = tensorflow::ProcessInputs(fn_body, fn_name, ninputs, inputs, &input_tensors, &input_nodes); if (TF_GetCode(status) != TF_OK) return nullptr; // Process outputs. std::vector<tensorflow::OutputTensor> output_tensors;
Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Sat Oct 12 16:27:48 GMT 2024 - 13.7K bytes - Click Count (0) -
tensorflow/c/eager/immediate_execution_context.h
virtual bool UsesTFRT() = 0; // List attributes of available devices virtual void ListDevices(std::vector<DeviceAttributes>* devices) = 0; // Add `devices` into context's device manager. Context's device manager // will take ownership and maintain devices' lifetime. virtual absl::Status AddDevices( std::vector<std::unique_ptr<Device>> devices) = 0; // Block until all pending nodes are finished.
Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Sat Oct 12 05:11:17 GMT 2024 - 12.3K bytes - Click Count (0) -
src/cmd/asm/internal/asm/testdata/riscv64.s
// 31.11.15: Vector Integer Merge Instructions VMERGEVVM V1, V2, V0, V3 // d781205c VMERGEVXM X10, V2, V0, V3 // d741255c VMERGEVIM $15, V2, V0, V3 // d7b1275c // 31.11.16: Vector Integer Move Instructions VMVVV V2, V3 // d701015e VMVVX X10, V3 // d741055e VMVVI $15, V3 // d7b1075e // 31.12.1: Vector Single-Width Saturating Add and Subtract
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Sat Apr 04 05:25:40 GMT 2026 - 74.2K bytes - Click Count (0) -
docs/distributed/DESIGN.md
- *If total drives has many common divisors the algorithm chooses the minimum amounts of erasure sets possible for a erasure set size of any N*. In the example with 1024 drives - 4, 8, 16 are GCD factors. With 16 drives we get a total of 64 possible sets, with 8 drives we get a total of 128 possible sets, with 4 drives we get a total of 256 possible sets. So algorithm automatically chooses 64 sets, which is *16* 64 = 1024* drives in total.
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Wed Feb 26 09:25:50 GMT 2025 - 8K bytes - Click Count (2)