- Sort Score
- Num 10 results
- Language All
Results 31 - 40 of 43 for minst (0.08 seconds)
-
guava/src/com/google/common/collect/MapMakerInternalMap.java
* about one-sixth of them need cloning when a table doubles. The nodes they replace will be * garbage collectable as soon as they are no longer referenced by any reader thread that may * be in the midst of traversing table right now. */ int newCount = count; AtomicReferenceArray<E> newTable = newEntryArray(oldCapacity << 1); threshold = newTable.length() * 3 / 4;Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 89.9K bytes - Click Count (0) -
okhttp/src/jvmMain/resources/okhttp3/internal/publicsuffix/PublicSuffixDatabase.list
minato.osaka.jp minato.tokyo.jp mincom.tn mine.nu mini miniserver.com minisite.ms mino.gifu.jp minobu.yamanashi.jp minoh.osaka.jp minokamo.gifu.jp minowa.nagano.jp mint mints.ne.jp mircloud.host mircloud.ru mircloud.us misaki.okayama.jp misaki.osaka.jp misasa.tottori.jp misato.akita.jp misato.miyagi.jp misato.saitama.jp misato.shimane.jp
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue May 27 22:00:49 GMT 2025 - 129.6K bytes - Click Count (3) -
okhttp/src/jvmTest/resources/okhttp3/internal/publicsuffix/public_suffix_list.dat
microsoft // mini : Bayerische Motoren Werke Aktiengesellschaft // https://www.iana.org/domains/root/db/mini.html mini // mint : Intuit Administrative Services, Inc. // https://www.iana.org/domains/root/db/mint.html mint // mit : Massachusetts Institute of Technology // https://www.iana.org/domains/root/db/mit.html mit // mitsubishi : Mitsubishi Corporation
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Fri Dec 27 13:39:56 GMT 2024 - 309.7K bytes - Click Count (1) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
* about one-sixth of them need cloning when a table doubles. The nodes they replace will be * garbage collectable as soon as they are no longer referenced by any reader thread that may * be in the midst of traversing table right now. */ int newCount = count; AtomicReferenceArray<E> newTable = newEntryArray(oldCapacity << 1); threshold = newTable.length() * 3 / 4;Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 89.9K bytes - Click Count (0) -
cmd/testdata/decryptObjectInfo.json.zst
Key":"IAAfAKB7mzuLdFnCG5IC/axDcFVtQANvSAnq3hA==","X-Minio-Internal-Server-Side-Encryption-Seal-Algorithm":"DAREv2-HMAC-SHA256","content-type":"application/octet-stream"}},{"Bucket":"buck1","Name":"go_113/src/cmd/vendor/golang.org/x/arch/x86/x86asm/inst.go","UserDef":{"X-Minio-Internal-Server-Side-Encryption-Iv":"+9WbTyx+bRebHTxDPzmpLq0zeKDa=","X-Minio-Internal-Server-Side-Encryption-S3-Kms-Key-Id":"my-minio-key","X-Minio-Internal-Server-Side-Encryption-S3-Kms-Sealed-Key":"IAAfAOv8heC6NMYJSrSc+LZ...Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Thu Oct 29 16:34:20 GMT 2020 - 164K bytes - Click Count (0) -
android/guava/src/com/google/common/cache/LocalCache.java
* one-sixth of them need cloning when a table doubles. The nodes they replace will be garbage * collectable as soon as they are no longer referenced by any reader thread that may be in * the midst of traversing table right now. */ int newCount = count; AtomicReferenceArray<ReferenceEntry<K, V>> newTable = newEntryArray(oldCapacity << 1); threshold = newTable.length() * 3 / 4;Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 143.5K bytes - Click Count (0) -
okhttp/src/androidMain/assets/PublicSuffixDatabase.list
minato.osaka.jp minato.tokyo.jp mincom.tn mine.nu mini miniserver.com minisite.ms mino.gifu.jp minobu.yamanashi.jp minoh.osaka.jp minokamo.gifu.jp minowa.nagano.jp mint mints.ne.jp mircloud.host mircloud.ru mircloud.us misaki.okayama.jp misaki.osaka.jp misasa.tottori.jp misato.akita.jp misato.miyagi.jp misato.saitama.jp misato.shimane.jp
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Dec 31 14:50:53 GMT 2024 - 129.6K bytes - Click Count (2) -
CHANGELOG/CHANGELOG-1.22.md
- github.com/alecthomas/template: [fb15b89](https://github.com/alecthomas/template/tree/fb15b89) - github.com/andreyvit/diff: [c7f18ee](https://github.com/andreyvit/diff/tree/c7f18ee) - github.com/bifurcation/mint: [93c51c6](https://github.com/bifurcation/mint/tree/93c51c6) - github.com/caddyserver/caddy: [v1.0.3](https://github.com/caddyserver/caddy/tree/v1.0.3) - github.com/cenkalti/backoff: [v2.1.1+incompatible](https://github.com/cenkalti/backoff/tree/v2.1.1)
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Tue Dec 13 12:43:45 GMT 2022 - 454.1K bytes - Click Count (0) -
guava/src/com/google/common/cache/LocalCache.java
* one-sixth of them need cloning when a table doubles. The nodes they replace will be garbage * collectable as soon as they are no longer referenced by any reader thread that may be in * the midst of traversing table right now. */ int newCount = count; AtomicReferenceArray<ReferenceEntry<K, V>> newTable = newEntryArray(oldCapacity << 1); threshold = newTable.length() * 3 / 4;Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 148.9K bytes - Click Count (0) -
api/go1.3.txt
pkg net/http, type Server struct, ConnState func(net.Conn, ConnState) pkg net/http, type Server struct, ErrorLog *log.Logger pkg net/http, type Transport struct, TLSHandshakeTimeout time.Duration pkg regexp/syntax, method (*Inst) MatchRunePos(int32) int pkg regexp/syntax, method (InstOp) String() string pkg runtime/debug, func SetPanicOnFault(bool) bool pkg runtime/debug, func WriteHeapDump(uintptr) pkg sync, method (*Pool) Get() interface{}
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Mon Jun 02 02:45:00 GMT 2014 - 117K bytes - Click Count (0)