Home
last modified time | relevance | path

Searched refs:words (Results 1 - 25 of 657) sorted by relevance

12345678910>>...27

/third_party/skia/modules/skparagraph/src/
H A DTextTabAlign.cpp83 bool TextTabAlign::leftAlignProcessTab(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, in leftAlignProcessTab() argument
89 fTabStartPos = words.width() + clusters.width() + totalFakeSpacing; in leftAlignProcessTab()
97 words.extend(clusters); in leftAlignProcessTab()
107 bool TextTabAlign::leftAlignProcessEndofWord(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, in leftAlignProcessEndofWord() argument
116 bool TextTabAlign::leftAlignProcessEndofLine(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, in leftAlignProcessEndofLine() argument
120 words.shiftWidth(0 - fTabCluster->width()); in leftAlignProcessEndofLine()
126 bool TextTabAlign::leftAlignProcessCluster(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, in leftAlignProcessCluster() argument
135 void TextTabAlign::rightAlignProcessTabBlockEnd(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters) in rightAlignProcessTabBlockEnd() argument
140 words.shiftWidth(fTabShift); in rightAlignProcessTabBlockEnd()
144 bool TextTabAlign::rightAlignProcessTab(TextWrapper::TextStretch& words, TextWrappe argument
172 rightAlignProcessEndofWord(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, SkScalar totalFakeSpacing) rightAlignProcessEndofWord() argument
194 rightAlignProcessEndofLine(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, SkScalar totalFakeSpacing) rightAlignProcessEndofLine() argument
205 rightAlignProcessCluster(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, SkScalar totalFakeSpacing) rightAlignProcessCluster() argument
216 centerAlignProcessTabBlockEnd(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters) centerAlignProcessTabBlockEnd() argument
231 centerAlignProcessTab(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, SkScalar totalFakeSpacing) centerAlignProcessTab() argument
263 centerAlignProcessEndofWord(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, SkScalar totalFakeSpacing) centerAlignProcessEndofWord() argument
291 centerAlignProcessEndofLine(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, SkScalar totalFakeSpacing) centerAlignProcessEndofLine() argument
302 centerAlignProcessCluster(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, SkScalar totalFakeSpacing) centerAlignProcessCluster() argument
[all...]
H A DTextTabAlign.h32 bool processTab(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, in processTab() argument
37 return (this->*(fTextTabFuncs->processTabFunc))(words, clusters, currentCluster, totalFakeSpacing); in processTab()
42 bool processEndofWord(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, in processEndofWord() argument
47 return (this->*(fTextTabFuncs->processEndofWordFunc))(words, clusters, currentCluster, totalFakeSpacing); in processEndofWord()
52 bool processEndofLine(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, in processEndofLine() argument
57 return (this->*(fTextTabFuncs->processEndofLineFunc))(words, clusters, currentCluster, totalFakeSpacing); in processEndofLine()
62 bool processCluster(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, in processCluster() argument
67 return (this->*(fTextTabFuncs->processClusterFunc))(words, clusters, currentCluster, totalFakeSpacing); in processCluster()
75 bool leftAlignProcessTab(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters,
77 bool leftAlignProcessEndofWord(TextWrapper::TextStretch& words, TextWrappe
[all...]
/third_party/node/deps/v8/tools/
H A Dprocess-wasm-compilation-times.py59 def AddLine(self, words):
60 assert self.index == words[2], "wrong function"
61 if words[4] == "TurboFan,":
62 self.AddTFLine(words)
63 elif words[4] == "Liftoff,":
64 self.AddLiftoffLine(words)
66 raise Exception("unknown compiler: %s" % words[4])
68 def AddTFLine(self, words):
75 self.time_tf = int(words[6])
76 self.mem_tf_max = int(words[
[all...]
/third_party/spirv-tools/test/
H A Dbinary_parse_test.cpp56 : words(inst.words, inst.words + inst.num_words), in ParsedInstruction()
63 std::vector<uint32_t> words; member
71 return words == b.words && opcode == b.opcode && in operator ==()
81 spvtest::PrintTo(spvtest::WordVector(inst.words), &os); in operator <<()
127 // The SPIR-V module header words for the Khronos Assembler generator,
134 // Returns the expected SPIR-V module header words for the Khronos
203 void Parse(const SpirvVector& words, spv_result_ argument
235 Parse(const SpirvVector& words, bool expected_result, bool flip_words = false, spv_target_env env = SPV_ENV_UNIVERSAL_1_0) Parse() argument
264 const auto words = CompileSuccessfully(""); TEST_F() local
274 const auto words = CompileSuccessfully(""); TEST_F() local
283 const auto words = CompileSuccessfully(""); TEST_F() local
293 const auto words = CompileSuccessfully(""); TEST_F() local
302 auto words = CompileSuccessfully(""); TEST_F() local
313 auto words = CompileSuccessfully(""); TEST_F() local
325 auto words = CompileSuccessfully(""); TEST_F() local
342 auto words = CompileSuccessfully(""); TEST_F() local
351 const auto words = CompileSuccessfully(""); TEST_F() local
368 const auto words = CompileSuccessfully(""); TEST_F() local
383 auto words = CompileSuccessfully(""); TEST_F() local
409 auto words = CompileSuccessfully(""); TEST_F() local
433 const auto words = CompileSuccessfully(""); TEST_F() local
451 const auto words = CompileSuccessfully(""); TEST_F() local
467 auto words = CompileSuccessfully(""); TEST_F() local
486 auto words = CompileSuccessfully(""); TEST_F() local
505 const auto words = CompileSuccessfully("%1 = OpTypeVoid"); TEST_F() local
518 const auto words = CompileSuccessfully("%1 = OpTypeVoid"); TEST_F() local
529 const auto words = CompileSuccessfully("%1 = OpTypeVoid"); TEST_F() local
541 const auto words = CompileSuccessfully("%1 = OpTypeVoid"); TEST_F() local
557 const auto words = CompileSuccessfully( TEST_F() local
573 const auto words = CompileSuccessfully( TEST_F() local
589 const auto words = CompileSuccessfully( TEST_F() local
604 const auto words = CompileSuccessfully( TEST_F() local
620 const auto words = CompileSuccessfully( TEST_F() local
637 const auto words = CompileSuccessfully( TEST_F() local
653 const auto words = CompileSuccessfully( TEST_F() local
670 const auto words = CompileSuccessfully( TEST_F() local
687 const auto words = CompileSuccessfully( TEST_F() local
706 const auto words = CompileSuccessfully( TEST_F() local
729 const auto words = Concatenate({ExpectedHeaderForBound(100), instruction}); TEST_F() local
754 const auto words = Concatenate({ExpectedHeaderForBound(100), instruction}); TEST_F() local
776 const auto words = CompileSuccessfully( TEST_F() local
807 const auto words = CompileSuccessfully( TEST_F() local
840 const uint32_t* words; global() member
878 std::vector<uint32_t> words; global() member
886 const auto& words = GetParam().words; TEST_P() local
1131 auto words = CompileSuccessfully(GetParam().assembly); TEST_P() local
[all...]
/third_party/vk-gl-cts/external/amber/src/src/
H A Dclspv_helper.cc70 auto ext_inst = inst->words[inst->operands[3].offset]; in ParseExtendedInst()
74 const auto& name = helper->strings[inst->words[inst->operands[5].offset]]; in ParseExtendedInst()
80 const auto& name = helper->strings[inst->words[inst->operands[4].offset]]; in ParseExtendedInst()
90 auto kernel_id = inst->words[inst->operands[4].offset]; in ParseExtendedInst()
91 auto ordinal_id = inst->words[inst->operands[5].offset]; in ParseExtendedInst()
92 auto ds_id = inst->words[inst->operands[6].offset]; in ParseExtendedInst()
93 auto binding_id = inst->words[inst->operands[7].offset]; in ParseExtendedInst()
96 arg_name = helper->strings[inst->words[inst->operands[8].offset]]; in ParseExtendedInst()
114 auto kernel_id = inst->words[inst->operands[4].offset]; in ParseExtendedInst()
115 auto ordinal_id = inst->words[ins in ParseExtendedInst()
[all...]
/third_party/mesa3d/src/panfrost/bifrost/
H A Ddisassemble.c441 static void dump_clause(FILE *fp, uint32_t *words, unsigned *size, unsigned offset, bool verbose) in dump_clause() argument
451 for (i = 0; ; i++, words += 4) { in dump_clause()
455 fprintf(fp, "%08x ", words[3 - j]); // low bit on the right in dump_clause()
458 unsigned tag = bits(words[0], 0, 8); in dump_clause()
463 main_instr.add_bits = bits(words[2], 2, 32 - 13); in dump_clause()
465 main_instr.fma_bits = bits(words[1], 11, 32) | bits(words[2], 0, 2) << (32 - 11); in dump_clause()
467 main_instr.reg_bits = ((uint64_t) bits(words[1], 0, 11)) << 24 | (uint64_t) bits(words[0], 8, 32); in dump_clause()
469 uint64_t const0 = bits(words[ in dump_clause()
691 uint32_t *words = (uint32_t *) code; disassemble_bifrost() local
[all...]
/third_party/skia/third_party/externals/spirv-tools/test/
H A Dbinary_parse_test.cpp56 : words(inst.words, inst.words + inst.num_words), in ParsedInstruction()
63 std::vector<uint32_t> words; member
71 return words == b.words && opcode == b.opcode && in operator ==()
81 spvtest::PrintTo(spvtest::WordVector(inst.words), &os); in operator <<()
127 // The SPIR-V module header words for the Khronos Assembler generator,
134 // Returns the expected SPIR-V module header words for the Khronos
203 void Parse(const SpirvVector& words, spv_result_ argument
239 const auto words = CompileSuccessfully(""); TEST_F() local
248 const auto words = CompileSuccessfully(""); TEST_F() local
258 auto words = CompileSuccessfully(""); TEST_F() local
271 auto words = CompileSuccessfully(""); TEST_F() local
285 const auto words = CompileSuccessfully(""); TEST_F() local
302 auto words = CompileSuccessfully(""); TEST_F() local
328 const auto words = CompileSuccessfully(""); TEST_F() local
346 auto words = CompileSuccessfully(""); TEST_F() local
367 const auto words = CompileSuccessfully("%1 = OpTypeVoid"); TEST_F() local
378 const auto words = CompileSuccessfully("%1 = OpTypeVoid"); TEST_F() local
390 const auto words = CompileSuccessfully("%1 = OpTypeVoid"); TEST_F() local
406 const auto words = CompileSuccessfully( TEST_F() local
422 const auto words = CompileSuccessfully( TEST_F() local
438 const auto words = CompileSuccessfully( TEST_F() local
454 const auto words = CompileSuccessfully( TEST_F() local
471 const auto words = CompileSuccessfully( TEST_F() local
493 const auto words = Concatenate({ExpectedHeaderForBound(100), instruction}); TEST_F() local
515 const auto words = CompileSuccessfully( TEST_F() local
548 const uint32_t* words; global() member
586 std::vector<uint32_t> words; global() member
594 const auto& words = GetParam().words; TEST_P() local
832 auto words = CompileSuccessfully(GetParam().assembly); TEST_P() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/
H A Dbinary_parse_test.cpp56 : words(inst.words, inst.words + inst.num_words), in ParsedInstruction()
63 std::vector<uint32_t> words; member
71 return words == b.words && opcode == b.opcode && in operator ==()
81 spvtest::PrintTo(spvtest::WordVector(inst.words), &os); in operator <<()
127 // The SPIR-V module header words for the Khronos Assembler generator,
134 // Returns the expected SPIR-V module header words for the Khronos
203 void Parse(const SpirvVector& words, spv_result_ argument
239 const auto words = CompileSuccessfully(""); TEST_F() local
248 const auto words = CompileSuccessfully(""); TEST_F() local
258 auto words = CompileSuccessfully(""); TEST_F() local
271 auto words = CompileSuccessfully(""); TEST_F() local
285 const auto words = CompileSuccessfully(""); TEST_F() local
302 auto words = CompileSuccessfully(""); TEST_F() local
328 const auto words = CompileSuccessfully(""); TEST_F() local
346 auto words = CompileSuccessfully(""); TEST_F() local
367 const auto words = CompileSuccessfully("%1 = OpTypeVoid"); TEST_F() local
378 const auto words = CompileSuccessfully("%1 = OpTypeVoid"); TEST_F() local
390 const auto words = CompileSuccessfully("%1 = OpTypeVoid"); TEST_F() local
406 const auto words = CompileSuccessfully( TEST_F() local
422 const auto words = CompileSuccessfully( TEST_F() local
438 const auto words = CompileSuccessfully( TEST_F() local
454 const auto words = CompileSuccessfully( TEST_F() local
471 const auto words = CompileSuccessfully( TEST_F() local
493 const auto words = Concatenate({ExpectedHeaderForBound(100), instruction}); TEST_F() local
515 const auto words = CompileSuccessfully( TEST_F() local
548 const uint32_t* words; global() member
586 std::vector<uint32_t> words; global() member
594 const auto& words = GetParam().words; TEST_P() local
832 auto words = CompileSuccessfully(GetParam().assembly); TEST_P() local
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dtypes.cpp185 void Type::GetHashWords(std::vector<uint32_t>* words, in GetHashWords() argument
191 words->push_back(kind_); in GetHashWords()
194 words->push_back(w); in GetHashWords()
201 As##type()->GetExtraHashWords(words, seen); \ in GetHashWords()
240 std::vector<uint32_t> words; in HashValue() local
241 GetHashWords(&words); in HashValue()
242 for (auto w : words) { in HashValue()
261 void Integer::GetExtraHashWords(std::vector<uint32_t>* words, in GetExtraHashWords() argument
263 words->push_back(width_); in GetExtraHashWords()
264 words in GetExtraHashWords()
278 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>*) const GetExtraHashWords() argument
302 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
327 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
365 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
390 GetExtraHashWords( std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
425 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
453 GetExtraHashWords( std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
512 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
539 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>*) const GetExtraHashWords() argument
572 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
609 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
631 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>*) const GetExtraHashWords() argument
656 GetExtraHashWords( std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
684 GetExtraHashWords( std::vector<uint32_t>* words, std::unordered_set<const Type*>* pSet) const GetExtraHashWords() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dtypes.cpp185 void Type::GetHashWords(std::vector<uint32_t>* words, in GetHashWords() argument
191 words->push_back(kind_); in GetHashWords()
194 words->push_back(w); in GetHashWords()
201 As##type()->GetExtraHashWords(words, seen); \ in GetHashWords()
240 std::vector<uint32_t> words; in HashValue() local
241 GetHashWords(&words); in HashValue()
242 for (auto w : words) { in HashValue()
261 void Integer::GetExtraHashWords(std::vector<uint32_t>* words, in GetExtraHashWords() argument
263 words->push_back(width_); in GetExtraHashWords()
264 words in GetExtraHashWords()
278 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>*) const GetExtraHashWords() argument
302 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
327 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
365 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
390 GetExtraHashWords( std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
425 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
453 GetExtraHashWords( std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
512 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
539 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>*) const GetExtraHashWords() argument
572 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
609 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
631 GetExtraHashWords(std::vector<uint32_t>* words, std::unordered_set<const Type*>*) const GetExtraHashWords() argument
656 GetExtraHashWords( std::vector<uint32_t>* words, std::unordered_set<const Type*>* seen) const GetExtraHashWords() argument
684 GetExtraHashWords( std::vector<uint32_t>* words, std::unordered_set<const Type*>* pSet) const GetExtraHashWords() argument
[all...]
/third_party/rust/crates/memchr/bench/src/memmem/
H A Dsliceslice.rs10 Here, we call them sliceslice-words/words and sliceslice-i386/words,
14 * In the sliceslice-words/words case, the benchmark is primarily about
15 searching very short haystacks using common English words.
16 * In the sliceslice-words/i386 case, the benchmark is primarily about searching
17 a longer haystack with common English words.
38 let mut words = SLICESLICE_WORDS.lines().collect::<Vec<_>>(); in search_short_haystack() variables
39 words in search_short_haystack()
[all...]
/third_party/mesa3d/src/compiler/spirv/tests/
H A Dvolatile.cpp54 static const uint32_t words[] = { in TEST_F() local
74 get_nir(sizeof(words) / sizeof(words[0]), words); in TEST_F() local
110 static const uint32_t words[] = { in TEST_F() local
130 get_nir(sizeof(words) / sizeof(words[0]), words); in TEST_F() local
165 static const uint32_t words[] = { in TEST_F() local
184 get_nir(sizeof(words) / sizeo in TEST_F() local
223 static const uint32_t words[] = { TEST_F() local
242 get_nir(sizeof(words) / sizeof(words[0]), words); TEST_F() local
281 static const uint32_t words[] = { TEST_F() local
300 get_nir(sizeof(words) / sizeof(words[0]), words); TEST_F() local
344 static const uint32_t words[] = { TEST_F() local
367 get_nir(sizeof(words) / sizeof(words[0]), words); TEST_F() local
407 static const uint32_t words[] = { TEST_F() local
430 get_nir(sizeof(words) / sizeof(words[0]), words); TEST_F() local
474 static const uint32_t words[] = { TEST_F() local
500 get_nir(sizeof(words) / sizeof(words[0]), words); TEST_F() local
544 static const uint32_t words[] = { TEST_F() local
570 get_nir(sizeof(words) / sizeof(words[0]), words); TEST_F() local
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/breakiter/
H A DBurmeseBreakEngine.java23 // How many words in a row are "good enough"?
89 PossibleWord words[] = new PossibleWord[BURMESE_LOOKAHEAD]; in divideUpDictionaryRange()
91 words[i] = new PossibleWord(); in divideUpDictionaryRange()
99 //Look for candidate words at the current position in divideUpDictionaryRange()
100 int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
104 wordLength = words[wordsFound%BURMESE_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
108 // If there was more than one, see which one can take us forward the most words in divideUpDictionaryRange()
114 if (words[(wordsFound+1)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
116 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
123 // See if any of the possible second words i in divideUpDictionaryRange()
[all...]
H A DKhmerBreakEngine.java22 // How many words in a row are "good enough"?
31 // Minimum number of characters for two words
96 PossibleWord words[] = new PossibleWord[KHMER_LOOKAHEAD]; in divideUpDictionaryRange()
98 words[i] = new PossibleWord(); in divideUpDictionaryRange()
107 //Look for candidate words at the current position in divideUpDictionaryRange()
108 int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
112 wordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
116 // If there was more than one, see which one can take us forward the most words in divideUpDictionaryRange()
122 if (words[(wordsFound+1)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
124 words[wordsFoun in divideUpDictionaryRange()
[all...]
H A DLaoBreakEngine.java22 // How many words in a row are "good enough"?
97 PossibleWord words[] = new PossibleWord[LAO_LOOKAHEAD]; in divideUpDictionaryRange()
99 words[i] = new PossibleWord(); in divideUpDictionaryRange()
107 //Look for candidate words at the current position in divideUpDictionaryRange()
108 int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
112 wordLength = words[wordsFound%LAO_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
116 // If there was more than one, see which one can take us forward the most words in divideUpDictionaryRange()
122 if (words[(wordsFound+1)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
124 words[wordsFound%LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
131 // See if any of the possible second words i in divideUpDictionaryRange()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DBurmeseBreakEngine.java22 // How many words in a row are "good enough"?
99 PossibleWord words[] = new PossibleWord[BURMESE_LOOKAHEAD]; in divideUpDictionaryRange()
101 words[i] = new PossibleWord(); in divideUpDictionaryRange()
109 //Look for candidate words at the current position in divideUpDictionaryRange()
110 int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
114 wordLength = words[wordsFound%BURMESE_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
118 // If there was more than one, see which one can take us forward the most words in divideUpDictionaryRange()
125 if (words[(wordsFound+1)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
128 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
137 // See if any of the possible second words i in divideUpDictionaryRange()
[all...]
H A DKhmerBreakEngine.java22 // How many words in a row are "good enough"?
31 // Minimum number of characters for two words
102 PossibleWord words[] = new PossibleWord[KHMER_LOOKAHEAD]; in divideUpDictionaryRange()
104 words[i] = new PossibleWord(); in divideUpDictionaryRange()
113 //Look for candidate words at the current position in divideUpDictionaryRange()
114 int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
118 wordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
122 // If there was more than one, see which one can take us forward the most words in divideUpDictionaryRange()
129 if (words[(wordsFound+1)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
132 words[wordsFoun in divideUpDictionaryRange()
[all...]
H A DLaoBreakEngine.java22 // How many words in a row are "good enough"?
102 PossibleWord words[] = new PossibleWord[LAO_LOOKAHEAD]; in divideUpDictionaryRange()
104 words[i] = new PossibleWord(); in divideUpDictionaryRange()
112 //Look for candidate words at the current position in divideUpDictionaryRange()
113 int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
117 wordLength = words[wordsFound%LAO_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
121 // If there was more than one, see which one can take us forward the most words in divideUpDictionaryRange()
128 if (words[(wordsFound+1)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
131 words[wordsFound%LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
140 // See if any of the possible second words i in divideUpDictionaryRange()
[all...]
/third_party/python/Lib/idlelib/
H A Dautoexpand.py1 '''Complete the current word before the cursor with words in the editor.
32 words = self.getwords()
35 words, index, insert, line = self.state
37 words = self.getwords()
39 if not words:
44 newword = words[index]
45 index = (index + 1) % len(words)
51 self.state = words, index, curinsert, curline
55 "Return a list of words that match the prefix before the cursor."
67 words
[all...]
/third_party/skia/third_party/externals/swiftshader/tests/SystemBenchmarks/
H A DLRUCacheBenchmarks.cpp41 std::array<size_t, 8> words; member
46 for(size_t w = 0; w < a.words.size(); w++) in operator ==()
48 if(a.words[w] != b.words[w]) { return false; } in operator ==()
58 for(size_t w = 0; w < key.words.size(); w++) in operator ()()
60 hash = hash * 11801 + key.words[w]; in operator ()()
141 for(size_t w = 0; w < key.words.size(); w++) in BENCHMARK_DEFINE_F()
143 key.words[w] = rnd() & 1; in BENCHMARK_DEFINE_F()
161 for(size_t w = 0; w < key.words.size(); w++) in BENCHMARK_DEFINE_F()
163 key.words[ in BENCHMARK_DEFINE_F()
[all...]
/third_party/icu/icu4c/source/common/
H A Ddictbe.cpp96 // List size, limited by the maximum number of words in the dictionary
178 // How many words in a row are "good enough"?
197 // Minimum number of characters for two words
243 return 0; // Not enough characters for two words in divideUpDictionaryRange()
252 PossibleWord words[THAI_LOOKAHEAD]; in divideUpDictionaryRange() local
260 // Look for candidate words at the current position in divideUpDictionaryRange()
261 int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
265 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
266 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
269 // If there was more than one, see which one can take us forward the most words in divideUpDictionaryRange()
488 PossibleWord words[LAO_LOOKAHEAD]; divideUpDictionaryRange() local
681 PossibleWord words[BURMESE_LOOKAHEAD]; divideUpDictionaryRange() local
887 PossibleWord words[KHMER_LOOKAHEAD]; divideUpDictionaryRange() local
[all...]
/third_party/node/deps/icu-small/source/common/
H A Ddictbe.cpp96 // List size, limited by the maximum number of words in the dictionary
178 // How many words in a row are "good enough"?
197 // Minimum number of characters for two words
243 return 0; // Not enough characters for two words in divideUpDictionaryRange()
252 PossibleWord words[THAI_LOOKAHEAD]; in divideUpDictionaryRange() local
260 // Look for candidate words at the current position in divideUpDictionaryRange()
261 int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
265 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
266 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
269 // If there was more than one, see which one can take us forward the most words in divideUpDictionaryRange()
488 PossibleWord words[LAO_LOOKAHEAD]; divideUpDictionaryRange() local
681 PossibleWord words[BURMESE_LOOKAHEAD]; divideUpDictionaryRange() local
887 PossibleWord words[KHMER_LOOKAHEAD]; divideUpDictionaryRange() local
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Ddictbe.cpp90 // List size, limited by the maximum number of words in the dictionary
172 // How many words in a row are "good enough"?
191 // Minimum number of characters for two words
234 return 0; // Not enough characters for two words in divideUpDictionaryRange()
244 PossibleWord words[THAI_LOOKAHEAD]; in divideUpDictionaryRange() local
252 // Look for candidate words at the current position in divideUpDictionaryRange()
253 int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
257 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
258 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
261 // If there was more than one, see which one can take us forward the most words in divideUpDictionaryRange()
478 PossibleWord words[LAO_LOOKAHEAD]; divideUpDictionaryRange() local
670 PossibleWord words[BURMESE_LOOKAHEAD]; divideUpDictionaryRange() local
874 PossibleWord words[KHMER_LOOKAHEAD]; divideUpDictionaryRange() local
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/
H A Dname_mapper.cpp175 SaveName(inst.words[1], reinterpret_cast<const char*>(inst.words + 2)); in ParseInstruction()
183 if (inst.words[2] == SpvDecorationBuiltIn) { in ParseInstruction()
185 SaveBuiltInName(inst.words[1], inst.words[3]); in ParseInstruction()
197 const auto bit_width = inst.words[2]; in ParseInstruction()
216 if (0 == inst.words[3]) signedness = "u"; in ParseInstruction()
220 const auto bit_width = inst.words[2]; in ParseInstruction()
237 SaveName(result_id, std::string("v") + to_string(inst.words[3]) + in ParseInstruction()
238 NameForId(inst.words[ in ParseInstruction()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/
H A Dname_mapper.cpp175 SaveName(inst.words[1], reinterpret_cast<const char*>(inst.words + 2)); in ParseInstruction()
183 if (inst.words[2] == SpvDecorationBuiltIn) { in ParseInstruction()
185 SaveBuiltInName(inst.words[1], inst.words[3]); in ParseInstruction()
197 const auto bit_width = inst.words[2]; in ParseInstruction()
216 if (0 == inst.words[3]) signedness = "u"; in ParseInstruction()
220 const auto bit_width = inst.words[2]; in ParseInstruction()
237 SaveName(result_id, std::string("v") + to_string(inst.words[3]) + in ParseInstruction()
238 NameForId(inst.words[ in ParseInstruction()
[all...]

Completed in 15 milliseconds

12345678910>>...27