- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 254 for word65 (0.5 sec)
-
src/math/big/arith_ppc64x.s
MOVD 8(R8), R11 MOVD 8(R9), R16 SUBE R16, R11, R20 MOVD R20, 8(R10) final: ADDZE R4 XOR $1, R4 done: MOVD R4, c+72(FP) RET // func addVW(z, x []Word, y Word) (c Word) TEXT ·addVW(SB), NOSPLIT, $0 MOVD z+0(FP), R10 // R10 = z[] MOVD x+24(FP), R8 // R8 = x[] MOVD y+48(FP), R4 // R4 = y = c MOVD z_len+8(FP), R11 // R11 = z_len
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 18:17:17 UTC 2024 - 16.8K bytes - Viewed (0) -
src/cmd/asm/internal/arch/arch.go
case "s390x": return archS390x() case "wasm": return archWasm() } return nil } func jumpX86(word string) bool { return word[0] == 'J' || word == "CALL" || strings.HasPrefix(word, "LOOP") || word == "XBEGIN" } func jumpRISCV(word string) bool { switch word { case "BEQ", "BEQZ", "BGE", "BGEU", "BGEZ", "BGT", "BGTU", "BGTZ", "BLE", "BLEU", "BLEZ",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 21 06:51:28 UTC 2023 - 21.3K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
scratch := make([][]lex.Token, 0, 3) for { word, cond, operands, ok := p.line(scratch) if !ok { break } scratch = operands if p.pseudo(word, operands) { continue } i, present := p.arch.Instructions[word] if present { p.instruction(i, word, cond, operands) continue } p.errorf("unrecognized instruction %q", word) } if p.errorCount > 0 { return nil, false
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 21 14:34:57 UTC 2024 - 36.9K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/cases/map.go
// Chapter 3 of The Unicode Standard: // toTitlecase(X): Find the word boundaries in X according to Unicode Standard // Annex #29, "Unicode Text Segmentation." For each word boundary, find the // first cased character F following the word boundary. If F exists, map F to // Titlecase_Mapping(F); then map all characters C between F and the following // word boundary to Lowercase_Mapping(C).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 22.7K bytes - Viewed (0) -
src/main/resources/fess_label_fr.properties
labels.elevate_word_button_upload = Envoyer labels.elevate_word_list_suggest_word = Word labels.elevate_word_suggest_word = Word labels.elevate_word_reading = Lecture labels.elevate_word_permissions = Permissions labels.elevate_word_boost = Booster labels.elevate_word_file = Fichier Word supplémentaire labels.bad_word_configuration = Bad Word labels.bad_word_title_details = Bad Word labels.bad_word_link_list = Liste
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Fri Mar 22 11:58:34 UTC 2024 - 46.6K bytes - Viewed (0) -
src/math/big/natdiv.go
} // divWVW overwrites z with ⌊x/y⌋, returning the remainder r. // The caller must ensure that len(z) = len(x). func divWVW(z []Word, xn Word, x []Word, y Word) (r Word) { r = xn if len(x) == 1 { qq, rr := bits.Div(uint(r), uint(x[0]), uint(y)) z[0] = Word(qq) return Word(rr) } rec := reciprocalWord(y) for i := len(z) - 1; i >= 0; i-- { z[i], r = divWW(r, x[i], y, rec) } return r }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0) -
src/encoding/csv/reader_test.go
Output: [][]string{{"#1", "2", "3"}, {"a", "b", "c"}}, }, { Name: "LazyQuotes", Input: `§a "word",§"1"2",§a",§"b`, Output: [][]string{{`a "word"`, `1"2`, `a"`, `b`}}, LazyQuotes: true, }, { Name: "BareQuotes", Input: `§a "word",§"1"2",§a"`, Output: [][]string{{`a "word"`, `1"2`, `a"`}}, LazyQuotes: true, }, { Name: "BareDoubleQuotes", Input: `§a""b,§c`,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 14 04:25:13 UTC 2022 - 19.1K bytes - Viewed (0) -
src/internal/reflectlite/value.go
// Value is indirect, but interface is direct. We need // to load the data at v.ptr into the interface data word. e.Data = *(*unsafe.Pointer)(v.ptr) default: // Value is direct, and so is the interface. e.Data = v.ptr } // Now, fill in the type portion. We're very careful here not // to have any operation between the e.word and e.typ assignments // that would let the garbage collector observe the partially-built
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 07 17:01:54 UTC 2024 - 13.6K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/chacha20/chacha_generic.go
} return c, nil } // The constant first 4 words of the ChaCha20 state. const ( j0 uint32 = 0x61707865 // expa j1 uint32 = 0x3320646e // nd 3 j2 uint32 = 0x79622d32 // 2-by j3 uint32 = 0x6b206574 // te k ) const blockSize = 64 // quarterRound is the core of ChaCha20. It shuffles the bits of 4 state words. // It's executed 4 times for each of the 20 ChaCha20 rounds, operating on all 16
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 26 00:11:50 UTC 2022 - 13.9K bytes - Viewed (0) -
docs/en/docs/python-types.md
I think `Union[SomeType, None]` is more explicit about what it means. It's just about the words and names. But those words can affect how you and your teammates think about the code.
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Fri May 31 02:38:05 UTC 2024 - 17.1K bytes - Viewed (0)