- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,703 for mass (0.03 sec)
-
src/internal/trace/mud_test.go
mass += area l, u, ok := mud.approxInvCumulativeSum() inv, ok2 := mud.invCumulativeSum(trackMass) if mass < trackMass { if ok { t.Errorf("approx(%g) = [%g, %g), but mass = %g", trackMass, l, u, mass) } if ok2 { t.Errorf("exact(%g) = %g, but mass = %g", trackMass, inv, mass) } } else { if !ok { t.Errorf("approx(%g) failed, but mass = %g", trackMass, mass) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 2.5K bytes - Viewed (0) -
src/sort/example_keys_test.go
fmt.Println("By name:", planets) By(mass).Sort(planets) fmt.Println("By mass:", planets) By(distance).Sort(planets) fmt.Println("By distance:", planets) By(decreasingDistance).Sort(planets) fmt.Println("By decreasing distance:", planets) // Output: By name: [{Earth 1 1} {Mars 0.107 1.5} {Mercury 0.055 0.4} {Venus 0.815 0.7}] // By mass: [{Mercury 0.055 0.4} {Mars 0.107 1.5} {Venus 0.815 0.7} {Earth 1 1}]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 25 20:48:39 UTC 2017 - 2.7K bytes - Viewed (0) -
src/internal/trace/mud.go
} } } // setTrackMass sets the mass to track the inverse cumulative sum for. // // Specifically, mass is a cumulative duration, and the mutator // utilization bounds for this duration can be queried using // approxInvCumulativeSum. func (d *mud) setTrackMass(mass float64) { d.trackMass = mass // Find the bucket currently containing trackMass by computing // the cumulative sum. sum := 0.0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 5.7K bytes - Viewed (0) -
src/internal/trace/gc.go
if q > maxQ { maxQ = q } } // The distribution's mass is in units of time (it's not // normalized because this would make it more annoying to // account for future contributions of unrefined bands). The // total final mass will be the duration of the trace itself // minus the window size. Using this, we can compute the mass // corresponding to quantile maxQ. var duration int64
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 26K bytes - Viewed (0) -
src/crypto/internal/edwards25519/scalarmult.go
// for each binary place) but we allow the digits to grow in // magnitude up to 2^{w-1} so that the nonzero digits are as // sparse as possible. Intuitively, this "condenses" the // "mass" of the scalar onto sparse coefficients (meaning // fewer additions). basepointNafTable := basepointNafTable() var aTable nafLookupTable5 aTable.FromP3(A)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 05 21:53:10 UTC 2022 - 6.3K bytes - Viewed (0) -
docs/bucket/versioning/README.md
of uniqueness over space and time and are computationally difficult to guess. They are globally unique identifiers which can be locally generated without contacting a global registration authority. UUIDs are intended as unique identifiers for both mass tagging objects with an extremely short lifetime and to reliably identifying very persistent objects across a network. When you PUT an object in a versioning-enabled bucket, the noncurrent version is not overwritten. The following figure shows...
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu May 04 21:43:52 UTC 2023 - 11.9K bytes - Viewed (0) -
internal/pubsub/mask.go
"math" "math/bits" ) // Mask allows filtering by a bitset mask. type Mask uint64 const ( // MaskAll is the mask for all entries. MaskAll Mask = math.MaxUint64 ) // MaskFromMaskable extracts mask from an interface. func MaskFromMaskable(m Maskable) Mask { return Mask(m.Mask()) } // Contains returns whether *all* flags in other is present in t. func (t Mask) Contains(other Mask) bool { return t&other == other
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Jul 05 21:45:49 UTC 2022 - 1.3K bytes - Viewed (0) -
src/main/java/org/codelibs/core/collection/Maps.java
* @return 指定されたキーと値を持つ{@link HashMap}を構築するための{@literal Maps} */ public static <KEY, VALUE> Maps<KEY, VALUE> hashMap(final KEY key, final VALUE value) { return new Maps<>(new HashMap<KEY, VALUE>()).$(key, value); } /** * 指定されたキーと値を持つ{@link Hashtable}を構築するための{@literal Maps}を返します。 * * @param <KEY> * <code>Map</code>のキーの型 * @param <VALUE>
Registered: Wed Jun 12 12:50:12 UTC 2024 - Last Modified: Thu Mar 07 01:59:08 UTC 2024 - 8K bytes - Viewed (0) -
pkg/maps/maps.go
// See the License for the specific language governing permissions and // limitations under the License. package maps import "maps" // nolint: depguard // Equal reports whether two maps contain the same key/value pairs. // Values are compared using ==. func Equal[M1, M2 ~map[K]V, K, V comparable](m1 M1, m2 M2) bool { return maps.Equal(m1, m2) } // Clone returns a copy of the map.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri Mar 01 22:48:35 UTC 2024 - 2.5K bytes - Viewed (0) -
src/maps/maps.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Package maps defines various functions useful with maps of any type. package maps import ( _ "unsafe" ) // Equal reports whether two maps contain the same key/value pairs. // Values are compared using ==. func Equal[M1, M2 ~map[K]V, K, V comparable](m1 M1, m2 M2) bool { if len(m1) != len(m2) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 28 20:35:05 UTC 2024 - 1.8K bytes - Viewed (0)