- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 249 for uans (3.99 sec)
-
src/main/resources/fess_indices/fess/da/stopwords.txt
som på de med han af for ikke der var mig sig men et har om vi min havde ham hun nu over da fra du ud sin dem os op man hans hvor eller hvad skal selv her alle vil blev kunne ind når være dog noget ville jo deres efter ned skulle denne end dette mit også under
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Mon Nov 27 12:59:36 UTC 2023 - 564 bytes - Viewed (0) -
src/internal/syscall/unix/net_darwin.go
func ResNsearch(state *ResState, dname *byte, class, typ int, ans *byte, anslen int) (int, error) { r1, _, errno := syscall_syscall6(abi.FuncPCABI0(libresolv_res_9_nsearch_trampoline), uintptr(unsafe.Pointer(state)), uintptr(unsafe.Pointer(dname)), uintptr(class), uintptr(typ), uintptr(unsafe.Pointer(ans)), uintptr(anslen)) if errno != 0 { return 0, errno }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 28 13:41:21 UTC 2023 - 4.3K bytes - Viewed (0) -
src/math/bits.go
// NaN returns an IEEE 754 “not-a-number” value. func NaN() float64 { return Float64frombits(uvnan) } // IsNaN reports whether f is an IEEE 754 “not-a-number” value. func IsNaN(f float64) (is bool) { // IEEE 754 says that only NaNs satisfy f != f. // To avoid the floating-point hardware, could use: // x := Float64bits(f); // return uint32(x>>shift)&mask == mask && x != uvinf && x != uvneginf return f != f }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 05 17:52:29 UTC 2022 - 1.9K bytes - Viewed (0) -
testing/internal-performance-testing/src/main/resources/org/gradle/reporting/style.css
body { font-family: sans-serif; font-size: 12pt; margin: 3em; color: #444; } h2 { font-size: 14pt; margin-top: 2em; } h3 { margin-top: 2em; margin-bottom: 1.4em; } #footer { margin-top: 4em; font-size: 8pt; } table { border-collapse: collapse; } table.history, table.test-details { margin-top: 20px; font-size: 10pt; }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 2.2K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/report/source_html.go
template.Must(t.Parse(`{{define "weblistjs"}}` + weblistPageScript + `{{end}}`)) } const weblistPageCSS = `<style type="text/css"> body #content{ font-family: sans-serif; } h1 { font-size: 1.5em; } .legend { font-size: 1.25em; } .line, .nop, .unimportant { color: #aaaaaa; } .inlinesrc { color: #000066; } .livesrc { cursor: pointer; }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 1.7K bytes - Viewed (0) -
test/maplinear.go
//go:build darwin || linux // Copyright 2013 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Test that maps don't go quadratic for NaNs and other values. package main import ( "fmt" "math" "time" ) // checkLinear asserts that the running time of f(n) is in O(n). // tries is the initial number of iterations.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:25 UTC 2023 - 3.6K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/shufflesharding/shufflesharding_test.go
// ff computes the falling factorial `n!/(n-m)!` and requires n to be // positive and m to be in the range [0, n] and requires the answer to // fit in an int func ff(n, m int) int { ans := 1 for f := n; f > n-m; f-- { ans *= f } return ans } func TestUniformDistribution(t *testing.T) { const spare = 64 - MaxHashBits tests := []struct { deckSize, handSize int hashMax int }{
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Jan 25 06:44:08 UTC 2021 - 6.7K bytes - Viewed (0) -
docs/de/docs/tutorial/security/simple-oauth2.md
```Python hl_lines="3 77-79" {!> ../../../docs_src/security/tutorial003.py!} ``` ### Das Passwort überprüfen Zu diesem Zeitpunkt liegen uns die Benutzerdaten aus unserer Datenbank vor, das Passwort haben wir jedoch noch nicht überprüft. Lassen Sie uns diese Daten zunächst in das Pydantic-Modell `UserInDB` einfügen.
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sat Mar 30 18:08:44 UTC 2024 - 14.3K bytes - Viewed (0) -
src/slices/sort.go
//go:generate go run $GOROOT/src/sort/gen_sort_variants.go -generic package slices import ( "cmp" "math/bits" ) // Sort sorts a slice of any ordered type in ascending order. // When sorting floating-point numbers, NaNs are ordered before other values. func Sort[S ~[]E, E cmp.Ordered](x S) { n := len(x) pdqsortOrdered(x, 0, n, bits.Len(uint(n))) } // SortFunc sorts the slice x in ascending order as determined by the cmp
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 07 23:54:41 UTC 2024 - 5.8K bytes - Viewed (0) -
docs/de/docs/tutorial/security/get-current-user.md
Bevorzugen Sie die `Annotated`-Version, falls möglich. ```Python hl_lines="10" {!> ../../../docs_src/security/tutorial001.py!} ``` Aber das ist immer noch nicht so nützlich. Lassen wir es uns den aktuellen Benutzer überreichen. ## Ein Benutzermodell erstellen Erstellen wir zunächst ein Pydantic-Benutzermodell. So wie wir Pydantic zum Deklarieren von Bodys verwenden, können wir es auch überall sonst verwenden:
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sat Mar 30 18:08:05 UTC 2024 - 8.5K bytes - Viewed (0)