- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 147 for linear_1 (0.21 sec)
-
src/cmd/internal/obj/wasm/a.out.go
AEnd // opcode 0x0B ABr ABrIf ABrTable // ACall and AReturn are WebAssembly instructions. obj.ACALL and obj.ARET are higher level instructions // with Go semantics, e.g. they manipulate the Go stack on the linear memory. AReturn ACall ACallIndirect ADrop // opcode 0x1A ASelect ALocalGet // opcode 0x20 ALocalSet ALocalTee AGlobalGet AGlobalSet AI32Load // opcode 0x28 AI64Load
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 02 05:28:55 UTC 2023 - 4.3K bytes - Viewed (0) -
src/net/http/mapping_test.go
"articles", } if len(children) != 32 { panic("bad len") } for _, n := range []int{2, 4, 8, 16, 32} { list := children[:n] b.Run(fmt.Sprintf("n=%d", n), func(b *testing.B) { b.Run("rep=linear", func(b *testing.B) { var entries []entry[string, any] for _, c := range list { entries = append(entries, entry[string, any]{c, nil}) } b.ResetTimer() for i := 0; i < b.N; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 12 17:47:07 UTC 2023 - 2.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/PairedStatsAccumulator.java
return ensureInUnitRange(sumOfProductsOfDeltas / Math.sqrt(productOfSumsOfSquaresOfDeltas)); } /** * Returns a linear transformation giving the best fit to the data according to <a * href="http://mathworld.wolfram.com/LeastSquaresFitting.html">Ordinary Least Squares linear * regression</a> of {@code y} as a function of {@code x}. The count must be greater than one, and
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 10.3K bytes - Viewed (0) -
guava/src/com/google/common/math/PairedStatsAccumulator.java
return ensureInUnitRange(sumOfProductsOfDeltas / Math.sqrt(productOfSumsOfSquaresOfDeltas)); } /** * Returns a linear transformation giving the best fit to the data according to <a * href="http://mathworld.wolfram.com/LeastSquaresFitting.html">Ordinary Least Squares linear * regression</a> of {@code y} as a function of {@code x}. The count must be greater than one, and
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 10.3K bytes - Viewed (0) -
src/regexp/backtrack.go
// a bit vector with (length of input) * (length of prog) bits, // to make sure it never explores the same (character position, instruction) // state multiple times. This limits the search to run in time linear in // the length of the test. // // backtrack is a fast replacement for the NFA code on small // regexps when onepass cannot be used. package regexp import ( "regexp/syntax" "sync" )
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 14 17:25:39 UTC 2023 - 8.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
} return this; } /** * Adds each member of {@code elements} as a candidate for the top {@code k} elements. This * operation takes amortized linear time in the length of {@code elements}. * * <p>If all input data to this {@code TopKSelector} is in a single {@code Iterable}, prefer
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
src/cmd/internal/pkgpattern/pkgpattern.go
// This is a bit complicated but the obvious alternative, // namely a hand-written search like in most shell glob matchers, // is too easy to make accidentally exponential. // Using package regexp guarantees linear-time matching. const vendorChar = "\x00" if vendorExclude && strings.Contains(pattern, vendorChar) { return func(name string) bool { return false } } re := regexp.QuoteMeta(pattern) wild := `.*`
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 27 16:43:40 UTC 2022 - 4.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/TopKSelector.java
} return this; } /** * Adds each member of {@code elements} as a candidate for the top {@code k} elements. This * operation takes amortized linear time in the length of {@code elements}. * * <p>If all input data to this {@code TopKSelector} is in a single {@code Iterable}, prefer
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/dropped_requests_tracker.go
} s.retryAfter.Store(retryAfter) s.retryAfterUpdateUnix = unixTime return } if droppedRequests < retryAfter && retryAfter > 1 { // We try to mimc the TCP algorithm and thus are linearly // scaling down the retryAfter here. retryAfter-- s.retryAfter.Store(retryAfter) return } } // droppedRequestsTracker implement DroppedRequestsTracker interface
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 26 13:50:25 UTC 2023 - 6.5K bytes - Viewed (0) -
test/maplinear.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:25 UTC 2023 - 3.6K bytes - Viewed (0)