- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 150 for Resize (0.17 sec)
-
tensorflow/c/experimental/filesystem/plugins/gcs/ram_file_block_cache_test.cc
if (offset < buf.size()) { size_t bytes_to_copy = std::min<size_t>(buf.size() - offset, n); memcpy(buffer, buf.data() + offset, bytes_to_copy); bytes_transferred = bytes_to_copy; } else { bytes_transferred = 0; } TF_SetStatus(status, TF_OK, ""); return bytes_transferred; }; for (size_t block_size = 2; block_size <= 4; block_size++) {
C++ - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Fri Oct 15 03:16:57 GMT 2021 - 23.2K 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) -
src/main/webapp/css/admin/respond.min.js
:(!/^([a-zA-Z:]*\/\/)/.test(e)&&!r||e.replace(RegExp.$1,"").split("/")[0]===a.location.host)&&("//"===e.substring(0,2)&&(e=a.location.protocol+e),d.push({href:e,media:f})))}w()};x(),c.update=x,c.getEmValue=t,a.addEventListener?a.addEventListener("resize",b,!1):a.attachEvent&&a.attachEvent("onresize",b)}}(this);...
JavaScript - Registered: Mon Apr 29 08:04:11 GMT 2024 - Last Modified: Thu Oct 08 12:14:13 GMT 2015 - 4.3K 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) -
src/main/assemblies/files/fess.in.sh
fi if [ "x$FESS_MIN_MEM" = "x" ]; then FESS_MIN_MEM=256m fi if [ "x$FESS_MAX_MEM" = "x" ]; then FESS_MAX_MEM=2g fi if [ "x$FESS_HEAP_SIZE" != "x" ]; then FESS_MIN_MEM=$FESS_HEAP_SIZE FESS_MAX_MEM=$FESS_HEAP_SIZE fi # External opensearch cluster #SEARCH_ENGINE_HTTP_URL=http://localhost:9200 #FESS_DICTIONARY_PATH=/var/lib/opensearch/config/
Shell Script - Registered: Mon Apr 29 08:04:11 GMT 2024 - Last Modified: Sun Jan 15 06:32:15 GMT 2023 - 4.7K bytes - Viewed (0) -
src/main/webapp/js/admin/adminlte.min.js
y").addClass(h);var e=t.Event(s.EXPANDED);t(this._element).trigger(e)},n.toggle=function(){t("body").hasClass(h)||t("body").hasClass(f)?this.collapse():this.show()},n._init=function(){var e=this;this._fixHeight(),this._fixScrollHeight(),t(window).resize((function(){e._fixHeight(),e._fixScrollHeight()})),t(window).scroll((function(){(t("body").hasClass(h)||t("body").hasClass(f))&&e._fixScrollHeight()}))},n._fixScrollHeight=function(){var e={scroll:t(document).height(),window:t(window).height(),he...
JavaScript - Registered: Mon Apr 29 08:04:11 GMT 2024 - Last Modified: Wed Feb 12 07:55:41 GMT 2020 - 23.7K bytes - Viewed (3) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
// entry in a *single* long[], though that reduces the maximum size of the set by a factor of 2 /** * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the * first node in insertion order; all values at indices ≥ {@link #size()} are UNSET. */ @CheckForNull private transient int[] predecessor; /**
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
// entry in a *single* long[], though that reduces the maximum size of the set by a factor of 2 /** * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the * first node in insertion order; all values at indices ≥ {@link #size()} are UNSET. */ @CheckForNull private transient int[] predecessor; /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
tensorflow/c/eager/c_api_unified_experimental.cc
TF_Status* s) { unwrap(o)->expected_num_outputs = num_outputs; unwrap(o)->outputs.clear(); unwrap(o)->outputs.resize(num_outputs); } int TF_OutputListNumOutputs(TF_OutputList* o) { return unwrap(o)->outputs.size(); } TF_AbstractTensor* TF_OutputListGet(TF_OutputList* o, int i) { return wrap(unwrap(o)->outputs[i]); }
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Thu Feb 15 09:49:45 GMT 2024 - 9K bytes - Viewed (0)