- Sort Score
- Num 10 results
- Language All
Results 231 - 240 of 336 for finite (0.04 seconds)
-
src/bufio/bufio.go
func (b *Reader) Reset(r io.Reader) { // If a Reader r is passed to NewReader, NewReader will return r. // Different layers of code may do that, and then later pass r // to Reset. Avoid infinite recursion in that case. if b == r { return } if b.buf == nil { b.buf = make([]byte, defaultBufSize) } b.reset(b.buf, r) } func (b *Reader) reset(buf []byte, r io.Reader) { *b = Reader{
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Fri Feb 06 17:28:40 GMT 2026 - 22K bytes - Click Count (0) -
guava-testlib/test/com/google/common/testing/ArbitraryInstancesTest.java
static final NonPublicConstantIgnored INSTANCE = new NonPublicConstantIgnored(); private NonPublicConstantIgnored() {} } public static class NonStaticFieldIgnored { // This should cause infinite recursion. But it shouldn't be used anyway. public final NonStaticFieldIgnored instance = new NonStaticFieldIgnored(); private NonStaticFieldIgnored() {} }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 22.8K bytes - Click Count (0) -
okhttp/src/jvmTest/kotlin/okhttp3/internal/connection/FastFallbackExchangeFinderTest.kt
* * This test yields threads to force the decision of plan1 to be deliberate and not lucky. In * particular, we set up this sequence of events: * * 1. take plan 0 * 3. plan 0 connects * 4. finish taking plan 1 * * https://github.com/square/okhttp/issues/7152 */ @Test fun reusePlanAndNewConnectRace() { val plan0 = routePlanner.addPlan() plan0.tcpConnectDelayNanos = 250.ms
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Fri Dec 27 13:39:56 GMT 2024 - 20.9K bytes - Click Count (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
* otherwise, the rounding will choose between the two nearest representable values with {@code * mode}. * * <p>For the case of {@link RoundingMode#HALF_DOWN}, {@code HALF_UP}, and {@code HALF_EVEN}, * infinite {@code double} values are considered infinitely far away. For example, 2^2000 is not * representable as a double, but {@code roundToDouble(BigInteger.valueOf(2).pow(2000), HALF_UP)}Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 18.8K bytes - Click Count (0) -
src/main/java/jcifs/internal/smb2/multichannel/ChannelManager.java
} } private void performHealthCheck() { for (ChannelInfo channel : channels.values()) { if (channel.getIdleTime() > 60000) { // 1 minute idle // Send keep-alive try { sendKeepAlive(channel); } catch (Exception e) {Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 21 11:13:46 GMT 2025 - 20K bytes - Click Count (0) -
docs/fr/docs/tutorial/first-steps.md
Si vous avez déjà un compte **FastAPI Cloud** (nous vous avons invité depuis la liste d’attente 😉), vous pouvez déployer votre application avec une seule commande. Avant de déployer, vous devez vous assurer que vous êtes connecté : <div class="termy"> ```console
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 18:37:13 GMT 2026 - 15.1K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Http2Stream.kt
throw errorException ?: StreamResetException(errorCode!!) } return null } } /** * Sends a reply to an incoming stream. * * @param outFinished true to eagerly finish the output stream to send data to the remote peer. * Corresponds to `FLAG_FIN`. * @param flushHeaders true to force flush the response headers. This should be true unless the
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Mon Jul 07 18:57:05 GMT 2025 - 22.4K bytes - Click Count (0) -
guava/src/com/google/common/base/Joiner.java
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Apr 14 15:16:19 GMT 2025 - 21K bytes - Click Count (0) -
guava/src/com/google/common/collect/Iterables.java
* iterable}. The iterator's {@code hasNext()} method returns {@code true} until {@code iterable} * is empty. * * <p><b>Warning:</b> Typical uses of the resulting iterator may produce an infinite loop. You * should use an explicit {@code break} or be certain that you will eventually remove all the * elements. * * <p>To cycle over the iterable {@code n} times, use the following: {@code
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Mar 08 16:16:42 GMT 2026 - 43.6K bytes - Click Count (0) -
src/main/webapp/js/jquery-3.7.1.min.js
n(a){return!1!==a&&(a=a||"fx"),this.each(function(){var e,t=_.get(this),n=t[a+"queue"],r=t[a+"queueHooks"],i=ce.timers,o=n?n.length:0;for(t.finish=!0,ce.queue(this,a,[]),r&&r.stop&&r.stop.call(this,!0),e=i.length;e--;)i[e].elem===this&&i[e].queue===a&&(i[e].anim.stop(!0),i.splice(e,1));for(e=0;e<o;e++)n[e]&&n[e].finish&&n[e].finish.call(this);delete t.finish})}}),ce.each(["toggle","show","hide"],function(e,r){var i=ce.fn[r];ce.fn[r]=function(e,t,n){return null==e||"boolean"==typeof e?i.apply(thi...Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Oct 26 01:07:52 GMT 2024 - 85.5K bytes - Click Count (0)