- Sort Score
- Result 10 results
- Languages All
Results 951 - 960 of 1,197 for close (0.05 sec)
-
android/guava/src/com/google/common/hash/MessageDigestHashFunction.java
this.bytes = bytes; this.supportsClone = supportsClone(prototype); } private static boolean supportsClone(MessageDigest digest) { try { Object unused = digest.clone(); return true; } catch (CloneNotSupportedException e) { return false; } } @Override public int bits() { return bytes * Byte.SIZE; } @Override
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed May 25 20:32:46 UTC 2022 - 5K bytes - Viewed (0) -
mockwebserver/src/main/kotlin/mockwebserver3/internal/BufferMockResponseBody.kt
package mockwebserver3.internal import mockwebserver3.MockResponseBody import okio.Buffer import okio.BufferedSink internal fun Buffer.toMockResponseBody(): MockResponseBody { val defensiveCopy = clone() return BufferMockResponseBody(defensiveCopy) } internal class BufferMockResponseBody( val buffer: Buffer, ) : MockResponseBody { override val contentLength = buffer.size
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Sun Jan 07 16:05:34 UTC 2024 - 1.1K bytes - Viewed (0) -
docs/fr/docs/async.md
* **Coroutines** ## Code asynchrone Faire du code asynchrone signifie que le langage 💬 est capable de dire à l'ordinateur / au programme 🤖 qu'à un moment du code, il 🤖 devra attendre que *quelque chose d'autre* se termine autre part. Disons que ce *quelque chose d'autre* est appelé "fichier-lent" 📝. Donc, pendant ce temps, l'ordinateur pourra effectuer d'autres tâches, pendant que "fichier-lent" 📝 se termine.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Tue Aug 06 04:48:30 UTC 2024 - 25.4K bytes - Viewed (0) -
okhttp-hpacktests/src/test/java/okhttp3/internal/http2/hpackjson/Case.kt
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Sat Dec 23 10:26:25 UTC 2023 - 1.3K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/PowerSetBenchmark.java
*/ public class PowerSetBenchmark { @Param({"2", "4", "8", "16"}) int elements; Set<Set<Integer>> powerSet; @BeforeExperiment void setUp() { Set<Integer> set = ContiguousSet.create(Range.closed(1, elements), integers()); powerSet = Sets.powerSet(set); } @Benchmark int iteration(int reps) { int sum = 0; for (int i = 0; i < reps; i++) { for (Set<Integer> subset : powerSet) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 1.4K bytes - Viewed (0) -
src/test/resources/before_script.sh
fi if [[ ${error_count} -ge 60 ]] ; then echo "Fess is not available." cat ${temp_log_file} ./fess-*/logs/*.log exit 1 fi sleep 1 done pushd /tmp >/dev/null git clone https://github.com/codelibs/fess-testdata.git popd >/dev/null cat ${temp_log_file} ./fess-*/logs/*.log curl -s "http://localhost:9201/_cat/indices?v"
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Sat Feb 10 03:25:34 UTC 2024 - 863 bytes - Viewed (0) -
docs/erasure/README.md
## Why is Erasure Code useful?
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Sep 29 04:28:45 UTC 2022 - 4.1K bytes - Viewed (0) -
src/bytes/bytes_test.go
var cloneTests = [][]byte{ []byte(nil), []byte{}, Clone([]byte{}), []byte(strings.Repeat("a", 42))[:0], []byte(strings.Repeat("a", 42))[:0:0], []byte("short"), []byte(strings.Repeat("a", 42)), } for _, input := range cloneTests { clone := Clone(input) if !Equal(clone, input) { t.Errorf("Clone(%q) = %q; want %q", input, clone, input) } if input == nil && clone != nil {
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Mon Aug 19 19:09:04 UTC 2024 - 61.2K bytes - Viewed (0) -
internal/s3select/parquet/reader.go
type Reader struct { io.Closer r *parquetgo.FileReader } // NewParquetReader creates a Reader2 from a io.ReadSeekCloser. func NewParquetReader(rsc io.ReadSeekCloser, _ *ReaderArgs) (r *Reader, err error) { fr, err := parquetgo.NewFileReader(rsc) if err != nil { return nil, errParquetParsingError(err) } return &Reader{Closer: rsc, r: fr}, nil }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Mon Sep 23 19:35:41 UTC 2024 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/ToDoubleRounder.java
X deltaToCeiling = minus(roundCeiling, x); int diff = deltaToFloor.compareTo(deltaToCeiling); if (diff < 0) { // closer to floor return roundFloorAsDouble; } else if (diff > 0) { // closer to ceiling return roundCeilingAsDouble; } // halfway between the representable values; do the half-whatever logic switch (mode) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 5.8K bytes - Viewed (0)