- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 199 for word65 (3.83 sec)
-
src/crypto/internal/edwards25519/field/fe_test.go
func (v *Element) toBig() *big.Int { buf := v.Bytes() words := make([]big.Word, 32*8/bits.UintSize) for n := range words { for i := 0; i < bits.UintSize; i += 8 { if len(buf) == 0 { break } words[n] |= big.Word(buf[0]) << big.Word(i) buf = buf[1:] } } return new(big.Int).SetBits(words) } func TestDecimalConstants(t *testing.T) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 28 17:26:17 UTC 2023 - 13.9K bytes - Viewed (0) -
src/main/resources/fess_label_ru.properties
labels.elevate_word_button_upload=Upload labels.elevate_word_list_suggest_word=Word labels.elevate_word_suggest_word=Word labels.elevate_word_reading=Reading labels.elevate_word_permissions=Permissions labels.elevate_word_boost=Boost labels.elevate_word_file=Additional Word File labels.bad_word_configuration=Bad Word labels.bad_word_title_details=Bad Word labels.bad_word_link_list=List labels.bad_word_link_edit=Создать новый
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Fri Mar 22 11:58:34 UTC 2024 - 45.6K bytes - Viewed (0) -
src/math/big/arith_arm64.s
BEQ done copy_4: // no carry flag, copy the rest vwOneIterCopy(R0, done) B copy_4 // func shlVU(z, x []Word, s uint) (c Word) // This implementation handles the shift operation from the high word to the low word, // which may be an error for the case where the low word of x overlaps with the high // word of z. When calling this function directly, you need to pay attention to this // situation. TEXT ·shlVU(SB),NOSPLIT,$0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:27 UTC 2023 - 11.8K bytes - Viewed (0) -
src/test/java/org/codelibs/opensearch/extension/analysis/NGramSynonymTokenizer.java
} public MyToken(final String word, final int startOffset, final int endOffset, final int posInc) { this(word, startOffset, endOffset, posInc, Integer.MAX_VALUE); // Integer.MAX_VALUE for seq means unused } public MyToken(final String word, final int startOffset, final int endOffset, final int posInc, final int seq) { this.word = word; this.startOffset = startOffset;
Registered: Wed Jun 12 15:38:08 UTC 2024 - Last Modified: Thu Feb 22 01:36:54 UTC 2024 - 17K bytes - Viewed (0) -
src/internal/syscall/windows/registry/registry_test.go
{Type: registry.QWORD, Name: "Qword3", Value: uint64(0xff)}, {Type: registry.QWORD, Name: "Qword4", Value: uint64(0xffff)}, {Type: registry.QWORD, Name: "Qword5", Value: uint64(0xffffff)}, {Type: registry.QWORD, Name: "Qword6", Value: uint64(0xffffffff)}, {Type: registry.MULTI_SZ, Name: "MultiString1", Value: []string{"a", "b", "c"}}, {Type: registry.MULTI_SZ, Name: "MultiString2", Value: []string{"abc", "", "cba"}},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 06 19:19:00 UTC 2024 - 18.5K bytes - Viewed (0) -
src/go/constant/value.go
func MakeFromBytes(bytes []byte) Value { words := make([]big.Word, (len(bytes)+(wordSize-1))/wordSize) i := 0 var w big.Word var s uint for _, b := range bytes { w |= big.Word(b) << s if s += 8; s == wordSize*8 { words[i] = w i++ w = 0 s = 0 } } // store last word if i < len(words) { words[i] = w i++ } // remove leading 0's
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:03 UTC 2023 - 34K bytes - Viewed (0) -
src/runtime/arena.go
h.mask |= bits << h.valid h.valid += valid return h } // Too many bits to fit in this word. Write the current word // out and move on to the next word. data := h.mask | bits<<h.valid // mask for this word h.mask = bits >> (ptrBits - h.valid) // leftover for next word h.valid += valid - ptrBits // have h.valid+valid bits, writing ptrBits of them // Flush mask to the memory bitmap.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:44:56 UTC 2024 - 37.9K bytes - Viewed (0) -
src/cmd/go/testdata/script/README
This directory holds test scripts *.txt run during 'go test cmd/go'. To run a specific script foo.txt go test cmd/go -run=Script/^foo$ In general script files should have short names: a few words, not whole sentences. The first word should be the general category of behavior being tested, often the name of a go subcommand (list, build, test, ...) or concept (vendor, pattern). Each script is a text archive (go doc internal/txtar).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 21 22:16:54 UTC 2024 - 12.5K bytes - Viewed (0) -
pkg/collateral/control.go
if len(cmd.Aliases) > 0 { // first word in cmd.Use represents the command that is being aliased word := cmd.Use index := strings.Index(word, " ") if index > 0 { word = word[0:index] } g.emit("<div class=\"aliases\">") line := cmd.UseLine() for i, alias := range cmd.Aliases { r := strings.Replace(line, word, alias, 1) if i == 0 {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Jan 10 03:51:36 UTC 2024 - 17.8K bytes - Viewed (0) -
src/runtime/syscall_windows.go
p.dstStackSize = alignUp(p.dstStackSize, uintptr(t.Align_)) return } // In the C ABI, we're already on a word boundary. // Also, sub-word-sized fastcall register arguments // are stored to the least-significant bytes of the // argument word and all supported Windows // architectures are little endian, so srcStackOffset // is already pointing to the right place for smaller
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 20:12:46 UTC 2024 - 16.6K bytes - Viewed (0)