- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,304 for rinputs (0.22 sec)
-
src/main/webapp/js/jquery-3.6.3.min.map
e","list","booleans","whitespace","identifier","attributes","pseudos","rwhitespace","RegExp","rtrim","rcomma","rcombinators","rdescend","rpseudo","ridentifier","matchExpr","ID","CLASS","TAG","ATTR","PSEUDO","CHILD","bool","needsContext","rhtml","rinputs","rheader","rnative","rquickExpr","rsibling","runescape","funescape","escape","nonHex","high","String","fromCharCode","rcssescape","fcssescape","ch","asCodePoint","charCodeAt","unloadHandler","inDisabledFieldset","addCombinator","disabled","nodeN...
Plain Text - Registered: Mon Apr 22 08:04:10 GMT 2024 - Last Modified: Fri Feb 17 12:13:41 GMT 2023 - 135.2K bytes - Viewed (0) -
src/cmd/asm/internal/lex/input.go
"strings" "text/scanner" "cmd/asm/internal/flags" "cmd/internal/objabi" "cmd/internal/src" ) // Input is the main input: a stack of readers and some macro definitions. // It also handles #include processing (by pushing onto the input stack) // and parses and instantiates macro definitions. type Input struct { Stack includes []string beginningOfLine bool ifdefStack []bool
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Tue Aug 29 07:48:38 GMT 2023 - 12.6K bytes - Viewed (0) -
src/main/webapp/js/admin/jquery-3.6.3.min.map
e","list","booleans","whitespace","identifier","attributes","pseudos","rwhitespace","RegExp","rtrim","rcomma","rcombinators","rdescend","rpseudo","ridentifier","matchExpr","ID","CLASS","TAG","ATTR","PSEUDO","CHILD","bool","needsContext","rhtml","rinputs","rheader","rnative","rquickExpr","rsibling","runescape","funescape","escape","nonHex","high","String","fromCharCode","rcssescape","fcssescape","ch","asCodePoint","charCodeAt","unloadHandler","inDisabledFieldset","addCombinator","disabled","nodeN...
Plain Text - Registered: Mon Apr 22 08:04:10 GMT 2024 - Last Modified: Fri Feb 17 12:13:41 GMT 2023 - 135.2K bytes - Viewed (0) -
tensorflow/c/c_api_function.cc
std::unordered_map<const Node*, std::vector<int>>* input_nodes) TF_EXCLUSIVE_LOCKS_REQUIRED(fn_body->mu) { input_tensors->reserve(ninputs); for (int i = 0; i < ninputs; ++i) { Node* node = inputs[i].oper ? &inputs[i].oper->node : nullptr; int idx = inputs[i].index; TF_RETURN_WITH_CONTEXT_IF_ERROR( fn_body->graph.IsValidOutputTensor(node, idx),
C++ - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 13.6K bytes - Viewed (2) -
tensorflow/c/c_api.cc
void TF_AddInput(TF_OperationDescription* desc, TF_Output input) { desc->node_builder.Input(&input.oper->node, input.index); } void TF_AddInputList(TF_OperationDescription* desc, const TF_Output* inputs, int num_inputs) { std::vector<NodeBuilder::NodeOut> input_list; input_list.reserve(num_inputs); for (int i = 0; i < num_inputs; ++i) { input_list.emplace_back(&inputs[i].oper->node, inputs[i].index); }
C++ - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 102.3K bytes - Viewed (0) -
tensorflow/c/eager/c_api_test.cc
int num_inputs = TFE_OpGetFlatInputCount(other, status); CHECK_EQ(TF_OK, TF_GetCode(status)) << TF_Message(status); for (int input_index = 0; input_index < num_inputs; ++input_index) { TFE_TensorHandle* input = TFE_OpGetFlatInput(other, input_index, status); CHECK_EQ(TF_OK, TF_GetCode(status)) << TF_Message(status); TFE_OpAddInput(ret, input, status);
C++ - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Thu Aug 03 20:50:20 GMT 2023 - 94.6K bytes - Viewed (1) -
tensorflow/c/c_api.h
// automatic skipping of dummy input operations is performed. // ninputs - number of elements in `inputs` array // inputs - array of TF_Outputs that specify the inputs to the function. // If `ninputs` is zero (the function takes no inputs), `inputs` // can be null. The names used for function inputs are normalized
C - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Thu Oct 26 21:08:15 GMT 2023 - 82.3K bytes - Viewed (3) -
android/guava/src/com/google/common/util/concurrent/AggregateFuture.java
/** * A future whose value is derived from a collection of input futures. * * @param <InputT> the type of the individual inputs * @param <OutputT> the type of the output (i.e. this) future */ @GwtCompatible @ElementTypesAreNonnullByDefault abstract class AggregateFuture<InputT extends @Nullable Object, OutputT extends @Nullable Object> extends AggregateFutureState<OutputT> {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 15.4K bytes - Viewed (0) -
tensorflow/c/c_api_experimental.cc
// below. Allocate enough space so that no reallocation happens, which will // make the pointers invalid. all_input_tensors.reserve(num_inputs); for (int i = 0; i < num_inputs; ++i) { if (input_tensors[i] == nullptr) continue; all_input_tensors.emplace_back(); Tensor& input_tensor = all_input_tensors.back(); status->status = TF_TensorToTensor(input_tensors[i], &input_tensor);
C++ - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 29.4K bytes - Viewed (0) -
tensorflow/c/c_api_test.cc
grad_inputs[0] = TF_Output{grad_inputs_op, 0}; TF_AddGradientsWithPrefix(graph_, prefix, outputs, noutputs, inputs, ninputs, grad_inputs, s_, grad_outputs); } else { TF_AddGradientsWithPrefix(graph_, prefix, outputs, noutputs, inputs, ninputs, nullptr, s_, grad_outputs); } } void BuildErrorGraph(TF_Output* inputs, TF_Output* outputs) {
C++ - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 96.9K bytes - Viewed (3)