- Sort Score
- Result 10 results
- Languages All
Results 1081 - 1090 of 1,142 for clean (0.07 sec)
-
src/main/java/org/codelibs/fess/es/log/cbean/cq/bs/BsSearchLogCQ.java
* governing permissions and limitations under the License. */ package org.codelibs.fess.es.log.cbean.cq.bs; import java.time.LocalDateTime; import java.util.ArrayList; import java.util.Collection; import org.codelibs.fess.es.log.allcommon.EsAbstractConditionQuery; import org.codelibs.fess.es.log.cbean.cq.SearchLogCQ; import org.dbflute.cbean.ckey.ConditionKey; import org.opensearch.index.query.BoolQueryBuilder;
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Thu Feb 22 01:37:57 UTC 2024 - 145.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/LongMathTest.java
/* * Bug in older versions of Android we test against, since fixed: -9223372036854775808L / * -4294967296L = -9223372036854775808L! * * To be clear, this bug affects not the test's computation of the expected result but the * _actual prod code_. But it probably affects only unusual cases. */ continue; }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 15:00:32 UTC 2024 - 30.6K bytes - Viewed (0) -
tensorflow/c/c_api.cc
if (!mutation_warning.empty()) { // TODO(b/74949947): turn this back into an error status LOG(WARNING) << mutation_warning; session->graph->sessions[session].clear(); } const auto num_nodes = graph.num_node_ids(); if (session->last_num_graph_nodes < num_nodes) { // TODO(nolivia): check this on a subset of the graph instead of all of // it.
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Sat Oct 12 16:27:48 UTC 2024 - 102.3K bytes - Viewed (0) -
doc/go_spec.html
n2 := copy(s, s[2:]) // n2 == 4, s is []int{2, 3, 4, 5, 4, 5} n3 := copy(b, "Hello, World!") // n3 == 5, b is []byte("Hello") </pre> <h3 id="Clear">Clear</h3> <p> The built-in function <code>clear</code> takes an argument of <a href="#Map_types">map</a>, <a href="#Slice_types">slice</a>, or <a href="#Type_parameter_declarations">type parameter</a> type, and deletes or zeroes out all elements
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Wed Oct 02 00:58:01 UTC 2024 - 282.5K bytes - Viewed (0) -
doc/asm.html
The assembler works on the semi-abstract form, so when you see an instruction like <code>MOV</code> what the toolchain actually generates for that operation might not be a move instruction at all, perhaps a clear or load. Or it might correspond exactly to the machine instruction with that name. In general, machine-specific operations tend to appear as themselves, while more general concepts like
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Tue Nov 28 19:15:27 UTC 2023 - 36.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedSet.java
*/ /* * TODO(cpovirk): use Object[] instead of E[] in the mainline? (The backport is different and * doesn't need this suppression, but we keep it to minimize diffs.) Generally be more clear * about when we have an Object[] vs. a Comparable[] or other array type in internalArray? If we * used Object[], we might be able to optimize toArray() to use clone() sometimes. (See * cl/592273615 and cl/592273683.)
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 39.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/JSR166TestCase.java
* defined this way, but enough to live with. * <li>If you override {@link #setUp} or {@link #tearDown}, make sure to invoke {@code * super.setUp} and {@code super.tearDown} within them. These methods are used to clear and * check for thread assertion failures. * <li>All delays and timeouts must use one of the constants {@code SHORT_DELAY_MS}, {@code
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 02:42:09 UTC 2024 - 37.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
* * @since 22.0 */ public long approximateElementCount() { long bitSize = bits.bitSize(); long bitCount = bits.bitCount(); /** * Each insertion is expected to reduce the # of clear bits by a factor of * `numHashFunctions/bitSize`. So, after n insertions, expected bitCount is `bitSize * (1 - (1 - * numHashFunctions/bitSize)^n)`. Solving that for n, and approximating `ln x` as `x - 1` when x
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 23 16:45:30 UTC 2024 - 26.6K bytes - Viewed (0) -
cmd/metacache-set.go
topEntries[i] = entry continue } // We got different entries if entry.name > current.name { continue } // We got a new, better current. // Clear existing entries. for i := range topEntries[:i] { topEntries[i] = metaCacheEntry{} } agree = 1 current = entry topEntries[i] = entry }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Jul 12 16:23:16 UTC 2024 - 30.7K bytes - Viewed (0) -
src/archive/tar/reader.go
} func (sr sparseFileReader) physicalRemaining() int64 { return sr.fr.physicalRemaining() } type zeroReader struct{} func (zeroReader) Read(b []byte) (int, error) { clear(b) return len(b), nil } // mustReadFull is like io.ReadFull except it returns // io.ErrUnexpectedEOF when io.EOF is hit before len(b) bytes are read. func mustReadFull(r io.Reader, b []byte) (int, error) {
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Fri Mar 08 01:59:14 UTC 2024 - 26.8K bytes - Viewed (0)