- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 90 for Resize (0.18 sec)
-
src/main/webapp/js/suggestor.js
JavaScript - Registered: Mon Apr 29 08:04:11 GMT 2024 - Last Modified: Thu Mar 30 05:45:24 GMT 2023 - 13.3K bytes - Viewed (2) -
guava/src/com/google/common/collect/CompactHashSet.java
newDelegate.addAll(delegate); this.table = newDelegate; return; } int size = this.size; if (size < requireEntries().length) { resizeEntries(size); } int minimumTableSize = CompactHashing.tableSize(size); int mask = hashTableMask(); if (minimumTableSize < mask) { // smaller table size will always be less than current mask
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
newDelegate.addAll(delegate); this.table = newDelegate; return; } int size = this.size; if (size < requireEntries().length) { resizeEntries(size); } int minimumTableSize = CompactHashing.tableSize(size); int mask = hashTableMask(); if (minimumTableSize < mask) { // smaller table size will always be less than current mask
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
tensorflow/c/eager/dlpack.cc
std::vector<int64_t>* shape_arr = &tf_dlm_tensor_ctx->shape; std::vector<int64_t>* stride_arr = &tf_dlm_tensor_ctx->strides; shape_arr->resize(ndim); stride_arr->resize(ndim, 1); for (int i = 0; i < ndim; i++) { (*shape_arr)[i] = tensor->dim_size(i); } for (int i = ndim - 2; i >= 0; --i) { (*stride_arr)[i] = (*shape_arr)[i + 1] * (*stride_arr)[i + 1]; }
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Thu Feb 15 09:49:45 GMT 2024 - 12.8K bytes - Viewed (0) -
src/main/assemblies/files/fess.in.bat
set FESS_MIN_MEM=256m ) if "%FESS_MAX_MEM%" == "" ( set FESS_MAX_MEM=1g ) if NOT "%FESS_HEAP_SIZE%" == "" ( set FESS_MIN_MEM=%FESS_HEAP_SIZE% set FESS_MAX_MEM=%FESS_HEAP_SIZE% ) REM min and max heap sizes should be set to the same value to avoid REM stop-the-world GC pauses during resize, and so that we can lock the REM heap in memory on startup to prevent any of it from being swapped REM out.
Batch File - Registered: Mon Apr 29 08:04:11 GMT 2024 - Last Modified: Sun Jan 15 06:32:15 GMT 2023 - 4.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashMap.java
} int size = this.size; if (size < requireEntries().length) { resizeEntries(size); } int minimumTableSize = CompactHashing.tableSize(size); int mask = hashTableMask(); if (minimumTableSize < mask) { // smaller table size will always be less than current mask resizeTable(mask, minimumTableSize, UNSET, UNSET); } } @Override public void clear() {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 39.8K bytes - Viewed (0) -
tensorflow/c/eager/unified_api_testutil.cc
} int retvals = outputs.size() - null_indices.size(); std::vector<AbstractTensorHandle*> fn_outputs(retvals); TF_RETURN_IF_ERROR(fn_op->Execute( absl::Span<AbstractTensorHandle*>(fn_outputs.data(), fn_outputs.size()), &retvals)); int skipped_indices = 0; for (int i = 0; i < outputs.size(); i++) { if (!null_indices.contains(i)) {
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Tue Feb 27 13:57:45 GMT 2024 - 5.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
private static final int ENDPOINT = -2; /** * Contains the link pointers corresponding with the entries, in the range of [0, size()). The * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are * all "null" (UNSET). *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
int size = this.size; if (size < requireEntries().length) { resizeEntries(size); } int minimumTableSize = CompactHashing.tableSize(size); int mask = hashTableMask(); if (minimumTableSize < mask) { // smaller table size will always be less than current mask resizeTable(mask, minimumTableSize, UNSET, UNSET); } } @Override public void clear() { if (needsAllocArrays()) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 35.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
private static final int ENDPOINT = -2; /** * Contains the link pointers corresponding with the entries, in the range of [0, size()). The * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are * all "null" (UNSET). *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0)