- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 557 for input (0.24 sec)
-
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) -
tests/test_openapi_separate_input_output_schemas.py
sub: Optional[SubItem] = None if PYDANTIC_V2: model_config = {"json_schema_serialization_defaults_required": True} def get_app_client(separate_input_output_schemas: bool = True) -> TestClient: app = FastAPI(separate_input_output_schemas=separate_input_output_schemas) @app.post("/items/") def create_item(item: Item): return item @app.post("/items-list/")
Python - Registered: Sun Apr 28 07:19:10 GMT 2024 - Last Modified: Thu Sep 28 04:14:40 GMT 2023 - 18.4K bytes - Viewed (2) -
guava-tests/test/com/google/common/primitives/FloatsTest.java
private static void testReverse(float[] input, float[] expectedOutput) { input = Arrays.copyOf(input, input.length); Floats.reverse(input); assertThat(input).isEqualTo(expectedOutput); } private static void testReverse( float[] input, int fromIndex, int toIndex, float[] expectedOutput) { input = Arrays.copyOf(input, input.length); Floats.reverse(input, fromIndex, toIndex);
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 29.5K bytes - Viewed (0) -
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/experimental/gradients/math_grad.cc
C++ - Registered: Tue Mar 26 12:39:09 GMT 2024 - Last Modified: Wed Feb 28 13:53:47 GMT 2024 - 15.2K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Murmur3_32HashFunction.java
for (int shift = 0; i < len; i++, shift += 8) { k1 ^= toInt(input[off + i]) << shift; } h1 ^= mixK1(k1); return fmix(h1, len); } private static int getIntLittleEndian(byte[] input, int offset) { return Ints.fromBytes(input[offset + 3], input[offset + 2], input[offset + 1], input[offset]); } private static int mixK1(int k1) { k1 *= C1; k1 = Integer.rotateLeft(k1, 15);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jun 15 20:59:00 GMT 2022 - 11.9K bytes - Viewed (0) -
tensorflow/c/c_api_function.cc
const TF_Output* inputs, std::vector<OutputTensor>* input_tensors, 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(
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_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_experimental_test.cc
const std::vector<TF_Tensor*>& input_tensors, const absl::optional<std::vector<int64_t>>& expected_shape) { // Create input_shapes. TF_ShapeAndTypeList* input_shapes = TF_NewShapeAndTypeList(input_shapes_vec.size()); for (size_t i = 0; i < input_shapes_vec.size(); ++i) { const auto& input_shape = input_shapes_vec[i];
C++ - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Tue Jan 17 22:27:52 GMT 2023 - 13.1K bytes - Viewed (1) -
android/guava/src/com/google/common/hash/HashFunction.java
*/ HashCode hashBytes(byte[] input, int off, int len); /** * Shortcut for {@code newHasher().putBytes(input).hash()}. The implementation <i>might</i> * perform better than its longhand equivalent, but should not perform worse. * * @since 23.0 */ HashCode hashBytes(ByteBuffer input); /** * Shortcut for {@code newHasher().putUnencodedChars(input).hash()}. The implementation
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 25 18:22:59 GMT 2021 - 10.9K bytes - Viewed (0)