- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 523 for Qword6 (0.14 sec)
-
platforms/documentation/docs/src/snippets/native-binaries/assembler/groovy/src/main/asm_i386_masm/sum.s
.386 .model flat PUBLIC _sum _TEXT SEGMENT _sum PROC mov eax, DWORD PTR 4[esp] add eax, DWORD PTR 8[esp] ret 0 _sum ENDP _TEXT ENDS
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 184 bytes - Viewed (0) -
pkg/util/strcase/camelcase.go
t = append(t, 'X') i++ } // Invariant: if the next letter is lower case, it must be converted // to upper case. // That is, we process a word at a time, where words are marked by _, - or // upper case letter. Digits are treated as words. for ; i < len(s); i++ { c := s[i] if isWordSeparator(c) { // Skip the separate and capitalize the next letter. continue } if isASCIIDigit(c) {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri Feb 28 19:48:10 UTC 2020 - 2.7K bytes - Viewed (0) -
src/main/resources/fess_label_en.properties
labels.suggest_word_configuration=Suggest Word labels.suggest_word_title_details=Suggest Word labels.suggest_word_type=Word Type labels.suggest_word_number=Word Count labels.suggest_word_type_all=All labels.suggest_word_type_document=Document labels.suggest_word_type_query=Query labels.elevate_word_configuration=Additional Word labels.elevate_word_title_details=Additional Word labels.elevate_word_link_list=List
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Fri Mar 22 11:58:34 UTC 2024 - 40.7K bytes - Viewed (0) -
src/math/big/arith_s390x.s
MOVD R7, c+56(FP) RET // func shlVU(z, x []Word, s uint) (c Word) TEXT ·shlVU(SB), NOSPLIT, $0 BR ·shlVU_g(SB) // func shrVU(z, x []Word, s uint) (c Word) TEXT ·shrVU(SB), NOSPLIT, $0 BR ·shrVU_g(SB) // CX = R4, r8 = r8, r9=r9, r10 = r2, r11 = r5, DX = r3, AX = r6, BX = R1, (R0 set to 0) + use R11 + use R7 for i // func mulAddVWW(z, x []Word, y, r Word) (c Word) TEXT ·mulAddVWW(SB), NOSPLIT, $0 MOVD z+0(FP), R2
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:27 UTC 2023 - 20.3K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/helper/SuggestHelper.java
} refresh(); } public void deleteElevateWord(final String word, final boolean apply) { suggester.indexer().deleteElevateWord(word, apply); refresh(); } public void addElevateWord(final String word, final String reading, final String[] tags, final String[] permissions, final Float boost, final boolean apply) {
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Thu Feb 22 01:37:57 UTC 2024 - 18K bytes - Viewed (0) -
platforms/software/dependency-management/src/testFixtures/groovy/org/gradle/api/internal/artifacts/ivyservice/resolveengine/excludes/factories/ExcludeJsonLogToCode.groovy
"nut", "store", "finger" ] private final Map<String, String> mappingCache = [:].withDefault { def size = mappingCache.size() size >WORDS.size() ? "word${size}" : WORDS[size] } /** * Converts an operation dumped as JSON into code which can be used to * check the result, to be used in {@link NormalizingExcludeFactory} * * @param json
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 10 21:10:11 UTC 2023 - 4.9K bytes - Viewed (0) -
src/cmd/internal/gcprog/gcprog.go
panic("gcprog: out of sync") } } } // Ptr emits a 1 into the bit stream at the given bit index. // that is, it records that the index'th word in the object memory is a pointer. // Any bits between the current index and the new index // are set to zero, meaning the corresponding words are scalars. func (w *Writer) Ptr(index int64) { if index < w.index { println("gcprog: Ptr at index", index, "but current index is", w.index)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 7.4K 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/main/java/jcifs/smb1/smb1/AndXServerMessageBlock.java
andx.useUnicode = useUnicode; if( andx instanceof AndXServerMessageBlock ) { /* * A word about communicating header info to andx smbs * * This is where we recursively invoke the provided andx smb * object to write it's parameter words and bytes to our outgoing * array. Incedentally when these andx smbs are created they are not
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Fri Mar 22 21:10:40 UTC 2019 - 11.3K bytes - Viewed (0)