- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 50 for recursion (0.19 sec)
-
src/index/suffixarray/sais2.go
// (from text_64), and saTmp will typically be much larger, so we'll use saTmp. // When deeper recursions come back to recurse_64, now oldTmp is // the saTmp from the top-most recursion, it is typically larger than // the current saTmp (because the current sa gets smaller and smaller // as the recursion gets deeper), and we keep reusing that top-most // large saTmp instead of the offered smaller ones. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 52.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/rewrite.go
} func areAdjacentOffsets(off1, off2, size int64) bool { return off1+size == off2 || off1 == off2+size } // check if value zeroes out upper 32-bit of 64-bit register. // depth limits recursion depth. In AMD64.rules 3 is used as limit, // because it catches same amount of cases as 4. func zeroUpper32Bits(x *Value, depth int) bool { switch x.Op {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 64.2K bytes - Viewed (0) -
src/cmd/compile/internal/types/type.go
// TODO(josharian): make this safe for recursive interface types // and use in signatlist sorting. See issue 19869. func (t *Type) cmp(x *Type) Cmp { // This follows the structure of function identical in identity.go // with two exceptions. // 1. Symbols are compared more carefully because a <,=,> result is desired. // 2. Maps are treated specially to avoid endless recursion -- maps
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:29:45 UTC 2024 - 49.5K bytes - Viewed (0) -
src/vendor/golang.org/x/net/dns/dnsmessage/message.go
sectionAdditionals sectionDone headerBitQR = 1 << 15 // query/response (response=1) headerBitAA = 1 << 10 // authoritative headerBitTC = 1 << 9 // truncated headerBitRD = 1 << 8 // recursion desired headerBitRA = 1 << 7 // recursion available headerBitAD = 1 << 5 // authentic data headerBitCD = 1 << 4 // checking disabled ) var sectionNames = map[section]string{ sectionHeader: "header",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Mar 09 00:09:40 UTC 2024 - 69K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AbstractClosingFutureTest.java
try { closingFuture.finishToValueAndCloser(new NoOpValueAndCloserConsumer<>(), executor); fail(); } catch (IllegalStateException expected) { } } // Avoid infinite recursion if a closeable's close() method throws RejectedExecutionException and // is closed using the direct executor. public void testCloseThrowsRejectedExecutionException() throws Exception {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 07 12:37:15 UTC 2024 - 75.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractClosingFutureTest.java
try { closingFuture.finishToValueAndCloser(new NoOpValueAndCloserConsumer<>(), executor); fail(); } catch (IllegalStateException expected) { } } // Avoid infinite recursion if a closeable's close() method throws RejectedExecutionException and // is closed using the direct executor. public void testCloseThrowsRejectedExecutionException() throws Exception {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 07 12:37:15 UTC 2024 - 75.3K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis.cc
::tensorflow::hash<int32>()( signature.second.has_value() ? *signature.second : 0))); } }; // Used to limit recursion to avoid blowing up the stack and cap compile time. class IncrementStackDepth { public: explicit IncrementStackDepth(PredicateFactory* parent) : parent_(parent) { parent_->stack_depth_++; }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
@SuppressWarnings("CatchingUnchecked") // sneaky checked exception private void appendUserObject(StringBuilder builder, @CheckForNull Object o) { // This is some basic recursion detection for when people create cycles via set/setFuture or // when deep chains of futures exist resulting in a StackOverflowException. We could detect
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 63.1K bytes - Viewed (1) -
guava/src/com/google/common/util/concurrent/AbstractFuture.java
@SuppressWarnings("CatchingUnchecked") // sneaky checked exception private void appendUserObject(StringBuilder builder, @CheckForNull Object o) { // This is some basic recursion detection for when people create cycles via set/setFuture or // when deep chains of futures exist resulting in a StackOverflowException. We could detect
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 62.8K bytes - Viewed (1) -
src/fmt/fmt_test.go
s := Sprintf(tt.fmt, tt.in) if s != tt.out { t.Errorf("%d: %q: got %q expected %q", i, tt.fmt, s, tt.out) } } } // recurCount tests that erroneous String routine doesn't cause fatal recursion. var recurCount = 0 type Recur struct { i int failed *bool } func (r *Recur) String() string { if recurCount++; recurCount > 10 { *r.failed = true return "FAIL"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:31:55 UTC 2024 - 58.6K bytes - Viewed (0)