- Sort Score
- Num 10 results
- Language All
Results 31 - 40 of 40 for smallint (0.11 seconds)
-
okhttp/src/jvmTest/kotlin/okhttp3/internal/http2/HttpOverHttp2Test.kt
fun streamTimeoutDegradesConnectionAfterNoPong() { assumeNotWindows() client = client .newBuilder() .readTimeout(Duration.ofMillis(500)) .build() // Stalling the socket will cause TWO requests to time out! server.enqueue(MockResponse.Builder().onRequestStart(Stall).build()) // The 3rd request should be sent to a fresh connection. server.enqueue(
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Sat Nov 01 12:18:11 GMT 2025 - 67.4K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/Sets.java
HashSet<E> set = new HashSet<>(); Iterators.addAll(set, elements); return set; } /** * Returns a new hash set using the smallest initial table size that can hold {@code expectedSize} * elements without resizing. Note that this is not what {@link HashSet#HashSet(int)} does, but it * is what most users want and expect it to do. *
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Sep 22 18:35:44 GMT 2025 - 81.6K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
I think that will be the best plan.' It sounded an excellent plan, no doubt, and very neatly and simply arranged; the only difficulty was, that she had not the smallest idea how to set about it; and while she was peering about anxiously among the trees, a little sharp bark just over her head made her look up in a great hurry. An enormous puppy was looking down at her with large round
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Fri Apr 21 02:27:51 GMT 2017 - 145.2K bytes - Click Count (0) -
doc/go_spec.html
The precise behavior is implementation-dependent. </p> <h3 id="Min_and_max">Min and max</h3> <p> The built-in functions <code>min</code> and <code>max</code> compute the smallest—or largest, respectively—value of a fixed number of arguments of <a href="#Comparison_operators">ordered types</a>. There must be at least one argument [<a href="#Go_1.21">Go 1.21</a>]. </p> <p>
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Tue Dec 02 23:07:19 GMT 2025 - 286.5K bytes - Click Count (1) -
src/main/webapp/css/admin/bootstrap.min.css.map
$grid-breakpoints, $breakpoint-names: map-keys($breakpoints)) {\n $n: index($breakpoint-names, $name);\n @return if($n != null and $n < length($breakpoint-names), nth($breakpoint-names, $n + 1), null);\n}\n\n// Minimum breakpoint width. Null for the smallest (first) breakpoint.\n//\n// >> breakpoint-min(sm, (xs: 0, sm: 576px, md: 768px, lg: 992px, xl: 1200px))\n// 576px\n@function breakpoint-min($name, $breakpoints: $grid-breakpoints) {\n $min: map-get($breakpoints, $name);\n @return if($min...Created: Sat Dec 20 09:19:18 GMT 2025 - Last Modified: Sat Oct 26 01:49:09 GMT 2024 - 639.3K bytes - Click Count (1) -
src/main/webapp/css/bootstrap.min.css.map
index($breakpoint-names, $name);\n @if not $n {\n @error \"breakpoint `#{$name}` not found in `#{$breakpoints}`\";\n }\n @return if($n < length($breakpoint-names), nth($breakpoint-names, $n + 1), null);\n}\n\n// Minimum breakpoint width. Null for the smallest (first) breakpoint.\n//\n// >> breakpoint-min(sm, (xs: 0, sm: 576px, md: 768px, lg: 992px, xl: 1200px, xxl: 1400px))\n// 576px\n@function breakpoint-min($name, $breakpoints: $grid-breakpoints) {\n $min: map-get($breakpoints, $name);\n @return...Created: Sat Dec 20 09:19:18 GMT 2025 - Last Modified: Sun Jan 12 06:14:02 GMT 2025 - 575.5K bytes - Click Count (0) -
RELEASE.md
* [Improve support](https://github.com/tensorflow/tensorflow/issues/33862) for dynamically-sized TensorArray inside `tf.function`. * `tf.math`: * Narrow down `argmin`/`argmax` contract to always return the smallest index for ties. * `tf.math.reduce_variance` and `tf.math.reduce_std` return correct computation for complex types and no longer support integer types.Created: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Tue Oct 28 22:27:41 GMT 2025 - 740.4K bytes - Click Count (3) -
src/main/webapp/css/admin/adminlte.min.css.map
$grid-breakpoints, $breakpoint-names: map-keys($breakpoints)) {\n $n: index($breakpoint-names, $name);\n @return if($n != null and $n < length($breakpoint-names), nth($breakpoint-names, $n + 1), null);\n}\n\n// Minimum breakpoint width. Null for the smallest (first) breakpoint.\n//\n// >> breakpoint-min(sm, (xs: 0, sm: 576px, md: 768px, lg: 992px, xl: 1200px))\n// 576px\n@function breakpoint-min($name, $breakpoints: $grid-breakpoints) {\n $min: map-get($breakpoints, $name);\n @return if($min...Created: Sat Dec 20 09:19:18 GMT 2025 - Last Modified: Sat Oct 26 01:49:09 GMT 2024 - 3.7M bytes - Click Count (3) -
lib/fips140/v1.0.0-c2097c7c.zip
constant-time implementation is adapted from Thomas Pornin's ecGFp5. // // https://github.com/pornin/ecgfp5/blob/82325b965/rust/src/field.rs#L337-L385 // p = q*2^n + 1 with q odd -> q = 2^128 - 1 and n = 96 // g^(2^n) = 1 -> g = 11 ^ q (where 11 is the smallest non-square) // GG[j] = g^(2^j) for j = 0 to n-1 p224GGOnce.Do(func() { p224GG = new([96]fiat.P224Element) for i := range p224GG { if i == 0 { p224GG[i].SetBytes([]byte{0x6a, 0x0f, 0xec, 0x67, 0x85, 0x98, 0xa7, 0x92, 0x0c, 0x55, 0xb2, 0xd4, 0x0b,...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
lib/fips140/v1.1.0-rc1.zip
constant-time implementation is adapted from Thomas Pornin's ecGFp5. // // https://github.com/pornin/ecgfp5/blob/82325b965/rust/src/field.rs#L337-L385 // p = q*2^n + 1 with q odd -> q = 2^128 - 1 and n = 96 // g^(2^n) = 1 -> g = 11 ^ q (where 11 is the smallest non-square) // GG[j] = g^(2^j) for j = 0 to n-1 p224GGOnce.Do(func() { p224GG = new([96]fiat.P224Element) for i := range p224GG { if i == 0 { p224GG[i].SetBytes([]byte{0x6a, 0x0f, 0xec, 0x67, 0x85, 0x98, 0xa7, 0x92, 0x0c, 0x55, 0xb2, 0xd4, 0x0b,...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0)