- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 377 for tight (0.14 sec)
-
tensorflow/c/eager/parallel_device/parallel_device.cc
std::vector<ParallelTensor*> parallel_inputs; std::vector<std::unique_ptr<ParallelTensor>> implicitly_broadcast_tensors; parallel_inputs.reserve(inputs.size()); implicitly_broadcast_tensors.reserve(inputs.size()); // not tight for (const auto& input : inputs) { if (absl::holds_alternative<TFE_TensorHandle*>(input)) { if (operation_name == std::string("_EagerConst")) {
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Wed Mar 29 22:05:31 GMT 2023 - 18.3K bytes - Viewed (0) -
architecture/ambient/ztunnel.md
In our experience and testing, these types force us to represent data in inefficient ways because they are general purpose. Ztunnel is not general purpose; it has an extremely tight goal. We can exploit this to make a more efficient protocol, which is critical to achieve our resource footprint goals.
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Thu Apr 25 22:35:16 GMT 2024 - 16.6K bytes - Viewed (0) -
tensorflow/c/eager/tape.h
pop_backward_tape.release()(); std::vector<int64_t> targets; std::vector<Gradient*> used_in_grads; // We may end up with slightly fewer elements than we reserve, but grad.size() // should be a reasonably tight upper bound. targets.reserve(grad.size()); used_in_grads.reserve(grad.size()); std::unordered_map<int64_t, TapeTensor> sources_that_are_targets;
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Tue Apr 02 12:40:29 GMT 2024 - 47.2K bytes - Viewed (1) -
docs/en/docs/help-fastapi.md
### Suggest solutions * After being able to understand the question, you can give them a possible **answer**. * In many cases, it's better to understand their **underlying problem or use case**, because there might be a better way to solve it than what they are trying to do.
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Thu Apr 18 19:53:19 GMT 2024 - 13.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
int left = 0; int right = 2 * k - 1; int minThresholdPosition = 0; // The leftmost position at which the greatest of the k lower elements // -- the new value of threshold -- might be found. int iterations = 0; int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3; while (left < right) { int pivotIndex = (left + right + 1) >>> 1;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* perform better than its longhand equivalent, but should not perform worse. * * @since 12.0 */ HashCode hashInt(int input); /** * Shortcut for {@code newHasher().putLong(input).hash()}; returns the hash code for the given * {@code long} value, interpreted in little-endian byte order. The implementation <i>might</i>
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) -
docs/en/docs/async.md
--- If you just don't know, use normal `def`. --- **Note**: You can mix `def` and `async def` in your *path operation functions* as much as you need and define each one using the best option for you. FastAPI will do the right thing with them. Anyway, in any of the cases above, FastAPI will still work asynchronously and be extremely fast. But by following the steps above, it will be able to do some performance optimizations.
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Thu Apr 18 19:53:19 GMT 2024 - 23K bytes - Viewed (0) -
guava/src/com/google/common/collect/ComparisonChain.java
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Sep 21 17:28:11 GMT 2022 - 11.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/UnsignedBytesTest.java
rnd.nextBytes(left); byte[] right = left.clone(); assertThat(comparator.compare(left, right)).isEqualTo(0); int i = rnd.nextInt(left.length); left[i] ^= (byte) (1 + rnd.nextInt(255)); assertThat(comparator.compare(left, right)).isNotEqualTo(0); assertThat(UnsignedBytes.compare(left[i], right[i]) > 0) .isEqualTo(comparator.compare(left, right) > 0); } } }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 13.4K bytes - Viewed (0) -
doc/asm.html
<code>R0<<16</code> <br> <code>R0@>16</code>: For <code><<</code>, left shift <code>R0</code> by 16 bits. The other codes are <code>-></code> (arithmetic right shift), <code>>></code> (logical right shift), and <code>@></code> (rotate right). </li> <li> <code>R0->R1</code> <br> <code>R0>>R1</code> <br> <code>R0<<R1</code> <br> <code>R0@>R1</code>:
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Tue Nov 28 19:15:27 GMT 2023 - 36.3K bytes - Viewed (0)