- Sort Score
- Result 10 results
- Languages All
Results 221 - 230 of 435 for fakeFs (0.06 sec)
-
guava/src/com/google/common/hash/LittleEndianByteArray.java
} /** * Similar to load64, but allows offset + 8 > input.length, padding the result with zeroes. This * has to explicitly reverse the order of the bytes as it packs them into the result which makes * it slower than the native version. * * @param input the input bytes * @param offset the offset into the array at which to start reading * @param length the number of bytes from the input to read
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 9.8K bytes - Viewed (0) -
docs/debugging/README.md
Example: ```sh minio server /data{1...4} ``` The command takes no flags ```sh mc support diagnostics myminio/ ``` The output printed will be of the form ```sh ● Admin Info ... ✔ ● CPU ... ✔ ● Disk Hardware ... ✔ ● Os Info ... ✔ ● Mem Info ... ✔
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Feb 25 01:17:53 UTC 2022 - 8.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
silence. Alice noticed with some surprise that the pebbles were all turning into little cakes as they lay on the floor, and a bright idea came into her head. `If I eat one of these cakes,' she thought, `it's sure to make SOME change in my size; and as it can't possibly make me larger, it must make me smaller, I suppose.' So she swallowed one of the cakes, and was delighted to find that she began shrinking directly. As soon as she was small
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 29 21:35:03 UTC 2012 - 145.2K bytes - Viewed (0) -
tensorflow/c/eager/c_api_experimental.h
TF_Status*); // Creates a new TensorHandle from memory residing in the physical device // device_name. Takes ownership of the memory, and will call deleter to release // it after TF no longer needs it or in case of error. // // Custom devices must use TFE_NewCustomDeviceTensorHandle instead.
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Wed Feb 21 22:37:46 UTC 2024 - 39.5K bytes - Viewed (0) -
guava/src/com/google/common/base/Throwables.java
* by delaying the per-stack-frame work until each element is accessed. Roughly speaking: * * <ul> * <li>{@code getStackTrace} takes {@code stackSize} time to return but then negligible time to * retrieve each element of the returned list. * <li>{@code lazyStackTrace} takes negligible time to return but then {@code 1/stackSize} time * to retrieve each element of the returned list (probably slightly more than {@code
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Jul 19 16:02:36 UTC 2024 - 20.7K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/AndXServerMessageBlock.java
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Fri Mar 22 21:10:40 UTC 2019 - 11.3K bytes - Viewed (0) -
compat/maven-embedder/src/main/java/org/apache/maven/cli/internal/BootstrapCoreExtensionManager.java
try { /* TODO: Enhance the PluginDependenciesResolver to provide a * resolveCoreExtension method which uses a CoreExtension * object instead of a Plugin as this makes no sense. */ Plugin plugin = Plugin.newBuilder() .groupId(interpolator.apply(extension.getGroupId())) .artifactId(interpolator.apply(extension.getArtifactId()))
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 13.2K bytes - Viewed (0) -
guava/src/com/google/common/math/BigIntegerMath.java
* and the arithmetic mean is always higher than the geometric mean. * * b) this iteration converges to floor(sqrt(x)). In fact, the number of correct digits doubles * with each iteration, so this algorithm takes O(log(digits)) iterations. * * We start out with a double-precision approximation, which may be higher or lower than the * true value. Therefore, we perform at least one Newton iteration to get a guess that's
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 16 17:21:56 UTC 2024 - 18.8K bytes - Viewed (0) -
guava/src/com/google/common/eventbus/Dispatcher.java
// queue, immediately followed by another thread taking the next element in the queue. That // second thread can then dispatch to the subscriber it took before the first thread does. // // All this makes me really wonder if there's any value in queueing here at all. A dispatcher // that simply loops through the subscribers and dispatches the event to each would actually
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Dec 15 19:31:54 UTC 2023 - 7.3K bytes - Viewed (0) -
docs/en/docs/tutorial/metadata.md
{!../../docs_src/metadata/tutorial001_1.py!} ``` ## Metadata for tags You can also add additional metadata for the different tags used to group your path operations with the parameter `openapi_tags`. It takes a list containing one dictionary for each tag. Each dictionary can contain: * `name` (**required**): a `str` with the same tag name you use in the `tags` parameter in your *path operations* and `APIRouter`s.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 5.8K bytes - Viewed (0)