- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 74 for Bins (0.48 sec)
-
cmd/tier-last-day-stats.go
l.UpdatedAt = t // update to the latest time index if since >= 24 { l.Bins = [24]tierStats{} return } for lastIdx != idx { lastIdx = (lastIdx + 1) % 24 l.Bins[lastIdx] = tierStats{} } } func (l *lastDayTierStats) clone() lastDayTierStats { clone := lastDayTierStats{ UpdatedAt: l.UpdatedAt, } copy(clone.Bins[:], l.Bins[:]) return clone }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Feb 19 22:54:46 GMT 2024 - 2.8K bytes - Viewed (0) -
cmd/tier-last-day-stats_gen.go
// map header, size 2 // write "Bins" err = en.Append(0x82, 0xa4, 0x42, 0x69, 0x6e, 0x73) if err != nil { return } err = en.WriteArrayHeader(uint32(24)) if err != nil { err = msgp.WrapError(err, "Bins") return } for za0001 := range z.Bins { err = z.Bins[za0001].EncodeMsg(en) if err != nil { err = msgp.WrapError(err, "Bins", za0001) return } }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Mar 21 17:21:35 GMT 2024 - 9.3K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Striped.java
* stripes, the intended concurrency level, and the typical number of keys used in a {@code * bulkGet(keys)} operation. See <a href="http://www.mathpages.com/home/kmath199.htm">Balls in * Bins model</a> for mathematical formulas that can be used to estimate the probability of * collisions. * * @param keys arbitrary non-null keys
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 10 20:55:18 GMT 2023 - 20.3K bytes - Viewed (1) -
maven-compat/src/test/java/org/apache/maven/repository/legacy/resolver/conflict/OldestConflictResolverTest.java
/** * Tests that <code>a:1.0</code> wins in the scenario: * <pre> * a:1.0 * a:2.0 * </pre> */ @Test void testEqual() { ResolutionNode a1n = createResolutionNode(a1); ResolutionNode a2n = createResolutionNode(a2); assertResolveConflict(a1n, a1n, a2n); } /** * Tests that <code>a:1.0</code> wins in the scenario: * <pre> * a:2.0
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Apr 25 05:46:50 GMT 2024 - 2.8K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/CertificatePinner.kt
this } else { CertificatePinner(pins, certificateChainCleaner) } } override fun equals(other: Any?): Boolean { return other is CertificatePinner && other.pins == pins && other.certificateChainCleaner == certificateChainCleaner } override fun hashCode(): Int { var result = 37 result = 41 * result + pins.hashCode()
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 14.2K bytes - Viewed (1) -
RELEASE.md
supports equivalent functionality. `max_tokens` argument renamed to `num_tokens`. * `Discretization` added `num_bins` argument for learning bins boundaries through calling `adapt` on a dataset. Renamed `bins` argument to `bin_boundaries` for specifying bins without `adapt`. * Improvements to model saving/loading: * `model.load_weights` now accepts paths to saved models.
Plain Text - Registered: Tue May 07 12:40:20 GMT 2024 - Last Modified: Mon Apr 29 19:17:57 GMT 2024 - 727.7K bytes - Viewed (8) -
maven-compat/src/test/java/org/apache/maven/repository/legacy/resolver/conflict/NewestConflictResolverTest.java
/** * Tests that <code>a:2.0</code> wins in the scenario: * <pre> * a:1.0 * a:2.0 * </pre> */ @Test void testEqual() { ResolutionNode a1n = createResolutionNode(a1); ResolutionNode a2n = createResolutionNode(a2); assertResolveConflict(a2n, a1n, a2n); } /** * Tests that <code>a:2.0</code> wins in the scenario: * <pre> * a:2.0
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Apr 25 05:46:50 GMT 2024 - 2.8K bytes - Viewed (0) -
maven-compat/src/test/java/org/apache/maven/repository/legacy/resolver/conflict/FarthestConflictResolverTest.java
/** * Tests that <code>a:1.0</code> wins in the scenario: * <pre> * a:1.0 * a:2.0 * </pre> */ @Test void testEqual() { ResolutionNode a1n = createResolutionNode(a1); ResolutionNode a2n = createResolutionNode(a2); assertResolveConflict(a1n, a1n, a2n); } /** * Tests that <code>a:2.0</code> wins in the scenario: * <pre> * a:2.0
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Apr 25 05:46:50 GMT 2024 - 2.8K bytes - Viewed (0) -
src/main/java/jcifs/config/BaseConfiguration.java
} else if ( s.equalsIgnoreCase("WINS") ) { if ( this.winsServer.length == 0 ) { log.error("UniAddress resolveOrder specifies WINS however " + " WINS server has not been configured"); continue; } this.resolverOrder.add(ResolverType.RESOLVER_WINS); }
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Thu Jan 05 13:06:39 GMT 2023 - 20.4K bytes - Viewed (1) -
okhttp/src/test/java/okhttp3/ConnectionCoalescingTest.kt
* - 2 requests happen concurrently to a host that can be coalesced onto a single connection. * - Both request discover no existing connection. They both make a connection. * - The first request "wins the race". * - The second request discovers it "lost the race" and closes the connection it just opened. * - The second request uses the coalesced connection from request1.
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Sat Jan 20 10:30:28 GMT 2024 - 18.7K bytes - Viewed (0)