- Sort Score
- Result 10 results
- Languages All
Results 501 - 510 of 659 for kInput (0.2 sec)
-
src/cmd/asm/internal/asm/testdata/mips64.s
// Copyright 2015 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. // This input was created by taking the ppc64 testcase and modified // by hand. #include "../../../../../runtime/textflag.h" TEXT foo(SB),DUPOK|NOSPLIT,$0 // // branch // // LBRA rel // { // outcode(int($1), &nullgen, 0, &$2); // } BEQ R1, 2(PC) label0:
Registered: Tue Oct 29 11:13:09 UTC 2024 - Last Modified: Tue Aug 08 12:17:12 UTC 2023 - 12.4K bytes - Viewed (0) -
docs/en/docs/tutorial/extra-models.md
# Extra Models Continuing with the previous example, it will be common to have more than one related model. This is especially the case for user models, because: * The **input model** needs to be able to have a password. * The **output model** should not have a password. * The **database model** would probably need to have a hashed password. /// danger Never store user's plaintext passwords. Always store a "secure hash" that you can then verify.
Registered: Sun Oct 27 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 7.7K bytes - Viewed (0) -
internal/s3select/sql/aggregation.go
// them if they could be an ancestor of an // aggregation. } return nil } // getAggregate() implementation for each AST node follows. This is // called after calling aggregateRow() on each input row, to calculate // the final aggregate result. func (e *FuncExpr) getAggregate() (*Value, error) { switch e.getFunctionName() { case aggFnCount: return FromInt(e.aggregate.runningCount), nil
Registered: Sun Oct 27 19:28:09 UTC 2024 - Last Modified: Sat Dec 23 07:19:11 UTC 2023 - 7.9K bytes - Viewed (0) -
cmd/erasure-decode.go
// These will be chosen before others. func (p *parallelReader) preferReaders(prefer []bool) { if len(prefer) != len(p.orgReaders) { return } // Copy so we don't change our input. tmp := make([]io.ReaderAt, len(p.orgReaders)) copy(tmp, p.orgReaders) p.readers = tmp // next is the next non-preferred index. next := 0 for i, ok := range prefer { if !ok || p.readers[i] == nil {
Registered: Sun Oct 27 19:28:09 UTC 2024 - Last Modified: Thu Aug 29 01:40:52 UTC 2024 - 9.5K bytes - Viewed (0) -
docs/fr/docs/async.md
Ensuite, il 🤖 prendra la première tâche à finir (disons, notre "fichier-lent" 📝) et continuera à faire avec cette dernière ce qu'il était censé. Ce "attendre quelque chose d'autre" fait généralement référence à des opérations <abbr title="Input/Output ou Entrées et Sorties ">I/O</abbr> qui sont relativement "lentes" (comparées à la vitesse du processeur et de la mémoire RAM) telles qu'attendre que : * de la donnée soit envoyée par le client à travers le réseau
Registered: Sun Oct 27 07:19:11 UTC 2024 - Last Modified: Tue Aug 06 04:48:30 UTC 2024 - 25.4K bytes - Viewed (0) -
internal/hash/checksum.go
if res[part] == nil { res[part] = make(map[string]string, 1) } res[part][typ.String()] = cs } } return res } // NewChecksumWithType is similar to NewChecksumString but expects input algo of ChecksumType. func NewChecksumWithType(alg ChecksumType, value string) *Checksum { if !alg.IsSet() { return nil } wantParts := 0 if strings.ContainsRune(value, '-') {
Registered: Sun Oct 27 19:28:09 UTC 2024 - Last Modified: Thu Sep 19 12:59:07 UTC 2024 - 12.7K bytes - Viewed (0) -
cmd/metacache-set.go
if serverDebugLog { console.Debugln(data...) } } // gatherResults will collect all results on the input channel and filter results according // to the options or to the current bucket ILM expiry rules. // Caller should close the channel when done. // The returned function will return the results once there is enough or input is closed, // or the context is canceled.
Registered: Sun Oct 27 19:28:09 UTC 2024 - Last Modified: Fri Jul 12 16:23:16 UTC 2024 - 30.7K bytes - Viewed (0) -
tensorflow/c/eager/c_api.cc
const char* TFE_OpGetDevice(const TFE_Op* op, TF_Status* status) { return tensorflow::unwrap(op)->DeviceName().c_str(); } void TFE_OpAddInput(TFE_Op* op, TFE_TensorHandle* input, TF_Status* status) { status->status = tensorflow::unwrap(op)->AddInput(tensorflow::unwrap(input)); } void TFE_OpAddInputList(TFE_Op* op, TFE_TensorHandle** inputs, int num_inputs, TF_Status* status) {
Registered: Tue Oct 29 12:39:09 UTC 2024 - Last Modified: Sat Oct 12 05:11:17 UTC 2024 - 43.9K bytes - Viewed (0) -
docs/distributed/DESIGN.md
Registered: Sun Oct 27 19:28:09 UTC 2024 - Last Modified: Tue Aug 15 23:04:20 UTC 2023 - 8K bytes - Viewed (0) -
docs/de/docs/advanced/events.md
/// /// tip | "Tipp" Beachten Sie, dass wir in diesem Fall eine Standard-Python-Funktion `open()` verwenden, die mit einer Datei interagiert. Es handelt sich also um I/O (Input/Output), welches „Warten“ erfordert, bis Dinge auf die Festplatte geschrieben werden. Aber `open()` verwendet nicht `async` und `await`.
Registered: Sun Oct 27 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 9.1K bytes - Viewed (0)