- Sort Score
- Result 10 results
- Languages All
Results 951 - 960 of 1,011 for inputs (0.05 sec)
-
tensorflow/BUILD
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Thu Aug 28 19:11:51 UTC 2025 - 53.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
} private static final Object NOT_FOUND = new Object(); /** * Maximum allowed false positive probability of detecting a hash flooding attack given random * input. */ @VisibleForTesting( ) static final double HASH_FLOODING_FPP = 0.001; /** * Maximum allowed length of a hash table bucket before falling back to a j.u.LinkedHashMap-based
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 35.7K bytes - Viewed (0) -
cmd/endpoint.go
} } for i := range endpoints { endpoints[i].IsLocal = endpointLocalMap[endpoints[i].Host] } return nil } // NewEndpoints - returns new endpoint list based on input args. func NewEndpoints(args ...string) (endpoints Endpoints, err error) { var endpointType EndpointType var scheme string uniqueArgs := set.NewStringSet() // Loop through args and adds to endpoint list.Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Sun Mar 30 00:56:02 UTC 2025 - 34.4K bytes - Viewed (0) -
CHANGELOG.md
result in it OkHttp starting a thread for each queued task, even when a single thread could run all of them. * Fix: Address a performance bug in `MultipartReader`. We were scanning the entire input stream for a delimiter when we only needed to scan enough to return a result. * Fix: Don't double-compress the public suffix database. OkHttp is usually distributed in aRegistered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Mon Jul 07 19:32:33 UTC 2025 - 31.6K bytes - Viewed (2) -
helm-releases/minio-2.0.1.tgz
myminio/$BUCKET > /dev/null 2>&1) return $? } # createBucket ($bucket, $policy, $purge) # Ensure bucket exists, purging if asked to createBucket() { BUCKET=$1 POLICY=$2 PURGE=$3 VERSIONING=$4 # Purge the bucket, if set & exists # Since PURGE is user input, check explicitly for `true` if [ $PURGE = true ]; then if checkBucketExists $BUCKET ; then echo "Purging bucket '$BUCKET'." set +e ; # don't exit if this fails ${MC} rm -r --force myminio/$BUCKET set -e ; # reset `e` as active else echo "Bucket '$BUCKET'...
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 31 09:09:09 UTC 2021 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
for (int i = 0; i < len; i++) { doubles[i] = longs[i]; } return doubles; } private static double[] intsToDoubles(int[] ints) { int len = ints.length; double[] doubles = new double[len]; for (int i = 0; i < len; i++) { doubles[i] = ints[i]; } return doubles; } /** * Performs an in-place selection to find the element which would appear at a given index in a
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 30.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
public abstract class ImmutableSortedSet<E> extends ImmutableSet<E> implements NavigableSet<E>, SortedIterable<E> { /** * Returns a {@code Collector} that accumulates the input elements into a new {@code * ImmutableSortedSet}, ordered by the specified comparator. * * <p>If the elements contain duplicates (according to the comparator), only the first duplicate
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 36.8K bytes - Viewed (0) -
helm-releases/minio-3.0.0.tgz
myminio/$BUCKET > /dev/null 2>&1) return $? } # createBucket ($bucket, $policy, $purge) # Ensure bucket exists, purging if asked to createBucket() { BUCKET=$1 POLICY=$2 PURGE=$3 VERSIONING=$4 # Purge the bucket, if set & exists # Since PURGE is user input, check explicitly for `true` if [ $PURGE = true ]; then if checkBucketExists $BUCKET ; then echo "Purging bucket '$BUCKET'." set +e ; # don't exit if this fails ${MC} rm -r --force myminio/$BUCKET set -e ; # reset `e` as active else echo "Bucket '$BUCKET'...
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Thu Sep 02 01:47:43 UTC 2021 - 13.8K bytes - Viewed (0) -
docs/zh-hant/docs/async.md
因此,在等待「慢速檔案」📝 完成的這段時間,電腦可以去處理一些其他工作。 接著程式 🤖 會在有空檔時回來查看是否有等待的工作已經完成,並執行必要的後續操作。 接下來,它 🤖 完成第一個工作(例如我們的「慢速檔案」📝)並繼續執行相關的所有操作。 這個「等待其他事情」通常指的是一些相對較慢的(與處理器和 RAM 記憶體的速度相比)的 <abbr title="Input and Output">I/O</abbr> 操作,比如說: * 透過網路傳送來自用戶端的資料 * 從網路接收來自用戶端的資料 * 從磁碟讀取檔案內容 * 將內容寫入磁碟 * 遠端 API 操作 * 資料庫操作 * 資料庫查詢 * 等等 由於大部分的執行時間都消耗在等待 <abbr title="輸入與輸出">I/O</abbr> 操作上,因此這些操作被稱為 "I/O 密集型" 操作。
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:56:21 UTC 2025 - 21.1K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.28.md
- [CVE-2023-3955: Insufficient input sanitization on Windows nodes leads to privilege escalation](#cve-2023-3955-insufficient-input-sanitization-on-windows-nodes-leads-to-privilege-escalation) - [CVE-2023-3676: Insufficient input sanitization on Windows nodes leads to privilege escalation](#cve-2023-3676-insufficient-input-sanitization-on-windows-nodes-leads-to-privilege-escalation)Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Oct 23 20:13:20 UTC 2024 - 456.9K bytes - Viewed (1)