- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 200 for remainders (0.18 sec)
-
src/runtime/time_windows_arm.s
// subtract (10**9 * sec) from nsec to get nanosecond remainder MOVW $1000000000, R5 // 10**9 MULLU R6,R5,(R9,R8) // R9:R8 = R7:R6 * R5 MULA R7,R5,R9,R9 SUB.S R8,R1 // R2:R1 -= R9:R8 SBC R9,R2 // because reciprocal was a truncated repeating fraction, quotient // may be slightly too small -- adjust to make remainder < 10**9 CMP R5,R1 // if remainder > 10**9 SUB.HS R5,R1 // remainder -= 10**9 ADD.HS $1,R6 // sec += 1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 07 17:19:45 UTC 2023 - 2K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/excludes/factories/ExcludeFactory.java
default ExcludeSpec fromUnion(Set<ExcludeSpec> remainder) { if (remainder.isEmpty()) { // It's an intersection, and this method is always called on the remainder // of a reduction operation. If the remainder is empty then it means that // the intersection is empty return nothing(); } return remainder.size() == 1 ? remainder.iterator().next() : anyOf(remainder); }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Feb 23 17:19:13 UTC 2024 - 3.6K bytes - Viewed (0) -
pkg/kubelet/cm/cpumanager/cpu_assignment.go
// Make a local copy of 'remainder'. remainder := remainder // Make a local copy of 'availableAfterAllocation'. availableAfterAllocation := availableAfterAllocation.Clone() // If this subset is not capable of allocating all // remainder CPUs, continue to the next one. if sum(availableAfterAllocation.Values(subset...)) < remainder { return Continue }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jan 25 23:56:21 UTC 2024 - 36.3K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/internal/poly1305/sum_s390x.go
func (h *mac) Sum(out *[TagSize]byte) { state := h.macState remainder := h.buffer[:h.offset] // Use the generic implementation if we have 2 or fewer blocks left // to sum. The vector implementation has a higher startup time. if cpu.S390X.HasVX && len(remainder) > 2*TagSize { updateVX(&state, remainder) } else if len(remainder) > 0 { updateGeneric(&state, remainder) } finalize(out, &state.h, &state.s)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 2K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/util/net/http_test.go
{ name: "ok with date and comma and remainder", header: ` 299 - "text\"\\\a\b\c" "Tue, 15 Nov 1994 08:12:31 GMT" , remainder `, wantResult: WarningHeader{Code: 299, Agent: `-`, Text: `text"\abc`}, wantRemainder: "remainder", }, { name: "ok with comma and remainder", header: ` 299 - "text\"\\\a\b\c" ,remainder text,second remainder`,
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Apr 18 01:21:56 UTC 2023 - 24.5K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/api/resource/scale_int.go
// divisor = 10^(dif) // TODO: create loop up table if exp costs too much. divisor.Exp(bigTen, exp.SetInt64(int64(dif)), nil) // reuse exp remainder := exp // result = unscaled / divisor // remainder = unscaled % divisor result.DivMod(unscaled, divisor, remainder) if remainder.Sign() != 0 { return result.Int64() + 1 } return result.Int64()
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Jan 29 20:41:44 UTC 2017 - 2.5K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/ivyresolve/verification/writer/PgpKeyGrouper.java
} List<List<String>> commonPrefixes = new ArrayList<>(); List<List<String>> remainder = Lists.newArrayList(splitGroups); List<List<String>> previous; while (!remainder.isEmpty()) { previous = Lists.newArrayList(remainder); shortest = remainder.get(0); int prefixLen = 2; List<String> prefix = shortest.subList(0, prefixLen);
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Dec 11 13:37:56 UTC 2023 - 10.4K bytes - Viewed (0) -
src/main/java/jcifs/smb1/util/Base64.java
int length = bytes.length; if (length == 0) return ""; StringBuffer buffer = new StringBuffer((int) Math.ceil((double) length / 3d) * 4); int remainder = length % 3; length -= remainder; int block; int i = 0; while (i < length) { block = ((bytes[i++] & 0xff) << 16) | ((bytes[i++] & 0xff) << 8) | (bytes[i++] & 0xff);
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Fri Mar 22 20:39:42 UTC 2019 - 3.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/UnsignedLongsTest.java
assertThat(UnsignedLongs.remainder(14, 5)).isEqualTo(4); assertThat(UnsignedLongs.remainder(0, 50)).isEqualTo(0); assertThat(UnsignedLongs.remainder(0xfffffffffffffffeL, 0xfffffffffffffffdL)).isEqualTo(1); assertThat(UnsignedLongs.remainder(0xfffffffffffffffdL, 0xfffffffffffffffeL)) .isEqualTo(0xfffffffffffffffdL); assertThat(UnsignedLongs.remainder(0xfffffffffffffffeL, 65535)).isEqualTo(65534L);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:36:17 UTC 2024 - 13.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
int positionFloor = (int) LongMath.divide(numerator, scale, RoundingMode.DOWN); int remainder = (int) (numerator - positionFloor * scale); if (remainder == 0) { return dataset[positionFloor]; } else { double positionFrac = (double) remainder / scale; return dataset[positionFloor] + positionFrac * (dataset[positionFloor + 1] - dataset[positionFloor]);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 01 16:30:37 UTC 2022 - 7.1K bytes - Viewed (0)