- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 211 for Dword2 (0.38 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/math/big/natconv_test.go
// If x == 0, the result is -1. func log2(x Word) int { return bits.Len(uint(x)) - 1 } func itoa(x nat, base int) []byte { // special cases switch { case base < 2: panic("illegal base") case len(x) == 0: return []byte("0") } // allocate buffer for conversion i := x.bitLen()/log2(Word(base)) + 1 // +1: round up s := make([]byte, i) // don't destroy x
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 12:54:00 UTC 2019 - 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/math/erfc_s390x.s
WFMADB V0, V6, V3, V0 FMOVD F2, F6 FMADD F4, F1, F0 WORD $0xED609318 //sdb %f6,.L39-.L38(%r9) BYTE $0x00 BYTE $0x1B WFMSDB V2, V0, V6, V2 FMOVD F2, ret+8(FP) RET L30: WORD $0xED009238 //adb %f0,.L67-.L38(%r9) BYTE $0x00 BYTE $0x1A BR L8 L20: FMOVD 88(R9), F0 WFMADB V7, V2, V0, V2 WORD $0xB3130022 //lcdbr %f2,%f2 FMOVD F2, ret+8(FP) RET L13:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 16 15:34:41 UTC 2019 - 14.4K 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) -
android/guava/src/com/google/common/hash/Crc32cHashFunction.java
static final int INVERSE_COMPUTE_FOR_WORD_OF_ALL_1S = 0xeee3ddcd; static int computeForWord(int word) { return STRIDE_TABLE[3][word & 0xFF] ^ STRIDE_TABLE[2][(word >>> 8) & 0xFF] ^ STRIDE_TABLE[1][(word >>> 16) & 0xFF] ^ STRIDE_TABLE[0][word >>> 24]; } static int combine(int csum, int crc) { csum ^= crc; for (int i = 0; i < 4; i++) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 20 18:43:59 UTC 2021 - 21.3K 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)