- Sort Score
- Result 10 results
- Languages All
Results 141 - 150 of 527 for Dword2 (0.09 sec)
-
src/runtime/memclr_ppc64x.s
// R3 = ptr // R4 = n // Determine if there are doublewords to clear check: ANDCC $7, R4, R5 // R5: leftover bytes to clear SRD $3, R4, R6 // R6: double words to clear CMP R6, $0, CR1 // CR1[EQ] set if no double words BC 12, 6, nozerolarge // only single bytes CMP R4, $512 BLT under512 // special case for < 512 ANDCC $127, R3, R8 // check for 128 alignment of address
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 17:08:59 UTC 2023 - 4.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/cmd/vendor/rsc.io/markdown/code.go
buf.WriteString("\n") } buf.WriteString("<pre><code") if b.Info != "" { // https://spec.commonmark.org/0.30/#info-string // “The first word of the info string is typically used to // specify the language of the code sample...” // No definition of what “first word” means though. // The Dingus splits on isUnicodeSpace, but Goldmark only uses space. lang := b.Info for i, c := range lang { if isUnicodeSpace(c) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 4.8K bytes - Viewed (0) -
src/runtime/atomic_mips64x.s
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. //go:build mips64 || mips64le #include "textflag.h" #define SYNC WORD $0xf TEXT ·publicationBarrier(SB),NOSPLIT|NOFRAME,$0-0 SYNC
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Nov 06 10:24:44 UTC 2021 - 300 bytes - Viewed (0) -
platforms/documentation/docs/src/samples/ide/problems-api-usage/README.adoc
* `sample-project`: A Gradle build with plugins that report problems * `sample-ide`: a project that simulates the IDE functionality. In other words, it uses the Gradle Tooling API to configure and run the `sample-project` build and prints the received problem reports received during the process.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Dec 20 08:50:13 UTC 2023 - 1.7K 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) -
maven-core/src/site/apt/plugin-execution-isolation.apt
the core realms listed above and these dependencies will be included in the plugin descriptor that is generated but when running within Maven these resources will be filtered out. In other words these resources will not be added the realm created for the plugins execution as they are provided
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Feb 03 09:12:28 UTC 2017 - 2.3K bytes - Viewed (0) -
tensorflow/c/experimental/ops/gen/common/case_format.cc
const bool toSnake = (to == LOWER_SNAKE || to == UPPER_SNAKE); string result; bool inputStart = true; bool wordStart = true; for (const char c : str) { // Find a word start. if (c == delimiter) { // Repeated cases of wordStart means explicit delimiter usage. if (wordStart) { result.push_back(delimiter); } wordStart = true; continue;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 21 09:51:28 UTC 2024 - 3K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/cases/info.go
// ICU prohibits breaking in such cases as well. // For the purpose of title casing we use an approximation of the Unicode Word // Breaking algorithm defined in Annex #29: // https://www.unicode.org/reports/tr29/#Default_Grapheme_Cluster_Table. // // For our approximation, we group the Word Break types into the following // categories, with associated rules: // // 1) Letter:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 2.9K bytes - Viewed (0)