- Sort Score
- Result 10 results
- Languages All
Results 271 - 280 of 601 for separate (0.13 sec)
-
guava/src/com/google/common/math/LongMath.java
/* * We want to do this in long math for speed, but want to avoid overflow. We adapt the * technique previously used by BigIntegerMath: maintain separate numerator and * denominator accumulators, multiplying the fraction into result when near overflow. */ for (int i = 2; i <= k; i++, n--) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 09 16:39:37 UTC 2024 - 45.2K bytes - Viewed (0) -
cmd/bucket-replication.go
Host: globalLocalNodeName, EventName: event.ObjectReplicationNotTracked, }) return } // Lock the object name before starting replication operation. // Use separate lock that doesn't collide with regular objects. lk := objectAPI.NewNSLock(bucket, "/[replicate]/"+dobj.ObjectName) lkctx, err := lk.GetLock(ctx, globalOperationTimeout) if err != nil {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Oct 10 06:49:55 UTC 2024 - 116.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
/* * We want to do this in long math for speed, but want to avoid overflow. We adapt the * technique previously used by BigIntegerMath: maintain separate numerator and * denominator accumulators, multiplying the fraction into result when near overflow. */ for (int i = 2; i <= k; i++, n--) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 09 16:39:37 UTC 2024 - 45.2K bytes - Viewed (0) -
guava/src/com/google/common/base/CharMatcher.java
* href="https://docs.oracle.com/javase/8/docs/api/java/lang/Character.html#supplementary">encoded * into a {@code String} using surrogate pairs</a>, and a {@code CharMatcher} treats these just as * two separate characters. {@link #countIn} counts each supplementary character as 2 {@code char}s. * * <p>For up-to-date Unicode character properties (digit, letter, etc.) and support for
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 13:00:28 UTC 2024 - 53.9K bytes - Viewed (0) -
common-protos/k8s.io/api/extensions/v1beta1/generated.proto
// matches /foo/bar/baz, but does not match /foo/barbaz). // * ImplementationSpecific: Interpretation of the Path matching is up to // the IngressClass. Implementations can treat this as a separate PathType // or treat it identically to Prefix or Exact path types. // Implementations are required to support all path types. // Defaults to ImplementationSpecific. optional string pathType = 3;
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 45.6K bytes - Viewed (0) -
RELEASE.md
released as a Pip package from TF 2.17 onwards. ### Known Caveats * Full aarch64 Linux and Arm64 macOS wheels are now published to the `tensorflow` pypi repository and no longer redirect to a separate package. ### Major Features and Improvements * Support for Python 3.12 has been added. * [tensorflow-tpu](https://pypi.org/project/tensorflow-tpu/) package is now available for easier TPU based installs.
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Tue Oct 22 14:33:53 UTC 2024 - 735.3K bytes - Viewed (0) -
docs/en/docs/release-notes.md
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Fri Nov 01 11:25:57 UTC 2024 - 460.3K bytes - Viewed (0) -
doc/asm.html
the argument size must be provided. For assembly functions with Go prototypes, <code>go</code> <code>vet</code> will check that the argument size is correct. </p> <p> Note that the symbol name uses a middle dot to separate the components and is specified as an offset from the static base pseudo-register <code>SB</code>. This function would be called from Go source for package <code>runtime</code> using the simple name <code>profileloop</code>.
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Tue Nov 28 19:15:27 UTC 2023 - 36.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
Object[] sortedValues = new Object[size]; // We might, somehow, be able to reorder values in-place. But it doesn't seem like // there's a way around creating the separate sortedKeys array, and if we're allocating // one array of size n, we might as well allocate two -- to say nothing of the allocation // done in Arrays.sort. for (int i = 0; i < size; i++) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 53K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.29.md
### Other (Cleanup or Flake)
Registered: Fri Nov 01 09:05:11 UTC 2024 - Last Modified: Wed Oct 23 04:37:31 UTC 2024 - 375.1K bytes - Viewed (1)