Home
last modified time | relevance | path

Searched refs:suffixes (Results 1 - 25 of 68) sorted by relevance

123

/third_party/python/Tools/scripts/
H A Dsuff.py5 # show different suffixes amongst arguments
12 suffixes = {}
15 suffixes.setdefault(suff, []).append(filename)
16 for suff, filenames in sorted(suffixes.items()):
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DCollationIterator.java527 // All contraction suffixes start with characters with lccc!=0 in appendCEsFromCE32()
541 // All contraction suffixes start with characters with lccc!=0 in appendCEsFromCE32()
717 // and therefore need not remember the suffixes state from before a mismatch for retrying. in nextCE32FromContraction()
719 CharsTrie suffixes = new CharsTrie(trieChars, trieOffset); in nextCE32FromContraction()
720 if(skipped != null && !skipped.isEmpty()) { skipped.saveTrieState(suffixes); } in nextCE32FromContraction()
721 BytesTrie.Result match = suffixes.firstForCodePoint(c); in nextCE32FromContraction()
725 ce32 = suffixes.getValue(); in nextCE32FromContraction()
729 if(skipped != null && !skipped.isEmpty()) { skipped.saveTrieState(suffixes); } in nextCE32FromContraction()
753 d, suffixes, ce32, lookAhead, c); in nextCE32FromContraction()
766 match = suffixes in nextCE32FromContraction()
772 nextCE32FromDiscontiguousContraction( CollationData d, CharsTrie suffixes, int ce32, int lookAhead, int c) nextCE32FromDiscontiguousContraction() argument
[all...]
H A DTailoredSet.java290 // Parallel iteration over suffixes of both tables. in compareContractions()
291 CharsTrie.Iterator suffixes = new CharsTrie(p, pidx).iterator(); in compareContractions()
302 if (suffixes.hasNext()) { in compareContractions()
303 te = suffixes.next(); in compareContractions()
363 CharsTrie.Iterator suffixes = new CharsTrie(p, pidx).iterator(); in addContractions()
364 while (suffixes.hasNext()) { in addContractions()
365 Entry e = suffixes.next(); in addContractions()
H A DContractionsAndExpansions.java259 CharsTrie.Iterator suffixes = new CharsTrie(data.contexts, index + 2).iterator(); in handleContractions()
260 while (suffixes.hasNext()) { in handleContractions()
261 Entry e = suffixes.next(); in handleContractions()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/coll/
H A DCollationIterator.java529 // All contraction suffixes start with characters with lccc!=0 in appendCEsFromCE32()
543 // All contraction suffixes start with characters with lccc!=0 in appendCEsFromCE32()
719 // and therefore need not remember the suffixes state from before a mismatch for retrying. in nextCE32FromContraction()
721 CharsTrie suffixes = new CharsTrie(trieChars, trieOffset); in nextCE32FromContraction()
722 if(skipped != null && !skipped.isEmpty()) { skipped.saveTrieState(suffixes); } in nextCE32FromContraction()
723 BytesTrie.Result match = suffixes.firstForCodePoint(c); in nextCE32FromContraction()
727 ce32 = suffixes.getValue(); in nextCE32FromContraction()
731 if(skipped != null && !skipped.isEmpty()) { skipped.saveTrieState(suffixes); } in nextCE32FromContraction()
755 d, suffixes, ce32, lookAhead, c); in nextCE32FromContraction()
768 match = suffixes in nextCE32FromContraction()
774 nextCE32FromDiscontiguousContraction( CollationData d, CharsTrie suffixes, int ce32, int lookAhead, int c) nextCE32FromDiscontiguousContraction() argument
[all...]
H A DTailoredSet.java292 // Parallel iteration over suffixes of both tables. in compareContractions()
293 CharsTrie.Iterator suffixes = new CharsTrie(p, pidx).iterator(); in compareContractions()
304 if (suffixes.hasNext()) { in compareContractions()
305 te = suffixes.next(); in compareContractions()
365 CharsTrie.Iterator suffixes = new CharsTrie(p, pidx).iterator(); in addContractions()
366 while (suffixes.hasNext()) { in addContractions()
367 Entry e = suffixes.next(); in addContractions()
/third_party/icu/icu4c/source/i18n/
H A Dcollationiterator.cpp325 // All contraction suffixes start with characters with lccc!=0 in appendCEsFromCE32()
339 // All contraction suffixes start with characters with lccc!=0 in appendCEsFromCE32()
501 // and therefore need not remember the suffixes state from before a mismatch for retrying. in nextCE32FromContraction()
503 UCharsTrie suffixes(p); in nextCE32FromContraction()
504 if(skipped != NULL && !skipped->isEmpty()) { skipped->saveTrieState(suffixes); } in nextCE32FromContraction()
505 UStringTrieResult match = suffixes.firstForCodePoint(c); in nextCE32FromContraction()
509 ce32 = (uint32_t)suffixes.getValue(); in nextCE32FromContraction()
513 if(skipped != NULL && !skipped->isEmpty()) { skipped->saveTrieState(suffixes); } in nextCE32FromContraction()
537 d, suffixes, ce32, lookAhead, c, errorCode); in nextCE32FromContraction()
550 match = suffixes in nextCE32FromContraction()
557 nextCE32FromDiscontiguousContraction( const CollationData *d, UCharsTrie &suffixes, uint32_t ce32, int32_t lookAhead, UChar32 c, UErrorCode &errorCode) nextCE32FromDiscontiguousContraction() argument
[all...]
H A Dcollationsets.cpp263 // Parallel iteration over suffixes of both tables. in compareContractions()
264 UCharsTrie::Iterator suffixes(p, 0, errorCode); in compareContractions()
275 if(suffixes.next(errorCode)) { in compareContractions()
276 ts = &suffixes.getString(); in compareContractions()
300 compare(c, (uint32_t)suffixes.getValue(), (uint32_t)baseSuffixes.getValue()); in compareContractions()
330 UCharsTrie::Iterator suffixes(p, 0, errorCode); in addContractions()
331 while(suffixes.next(errorCode)) { in addContractions()
332 addSuffix(c, suffixes.getString()); in addContractions()
573 UCharsTrie::Iterator suffixes(p + 2, 0, errorCode); in handleContractions()
574 while(suffixes in handleContractions()
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Dcollationiterator.cpp325 // All contraction suffixes start with characters with lccc!=0 in appendCEsFromCE32()
339 // All contraction suffixes start with characters with lccc!=0 in appendCEsFromCE32()
501 // and therefore need not remember the suffixes state from before a mismatch for retrying. in nextCE32FromContraction()
503 UCharsTrie suffixes(p); in nextCE32FromContraction()
504 if(skipped != nullptr && !skipped->isEmpty()) { skipped->saveTrieState(suffixes); } in nextCE32FromContraction()
505 UStringTrieResult match = suffixes.firstForCodePoint(c); in nextCE32FromContraction()
509 ce32 = (uint32_t)suffixes.getValue(); in nextCE32FromContraction()
513 if(skipped != nullptr && !skipped->isEmpty()) { skipped->saveTrieState(suffixes); } in nextCE32FromContraction()
537 d, suffixes, ce32, lookAhead, c, errorCode); in nextCE32FromContraction()
550 match = suffixes in nextCE32FromContraction()
557 nextCE32FromDiscontiguousContraction( const CollationData *d, UCharsTrie &suffixes, uint32_t ce32, int32_t lookAhead, UChar32 c, UErrorCode &errorCode) nextCE32FromDiscontiguousContraction() argument
[all...]
H A Dcollationsets.cpp263 // Parallel iteration over suffixes of both tables. in compareContractions()
264 UCharsTrie::Iterator suffixes(p, 0, errorCode); in compareContractions()
275 if(suffixes.next(errorCode)) { in compareContractions()
276 ts = &suffixes.getString(); in compareContractions()
300 compare(c, (uint32_t)suffixes.getValue(), (uint32_t)baseSuffixes.getValue()); in compareContractions()
330 UCharsTrie::Iterator suffixes(p, 0, errorCode); in addContractions()
331 while(suffixes.next(errorCode)) { in addContractions()
332 addSuffix(c, suffixes.getString()); in addContractions()
573 UCharsTrie::Iterator suffixes(p + 2, 0, errorCode); in handleContractions()
574 while(suffixes in handleContractions()
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dcollationiterator.cpp325 // All contraction suffixes start with characters with lccc!=0 in appendCEsFromCE32()
339 // All contraction suffixes start with characters with lccc!=0 in appendCEsFromCE32()
501 // and therefore need not remember the suffixes state from before a mismatch for retrying. in nextCE32FromContraction()
503 UCharsTrie suffixes(p); in nextCE32FromContraction()
504 if(skipped != NULL && !skipped->isEmpty()) { skipped->saveTrieState(suffixes); } in nextCE32FromContraction()
505 UStringTrieResult match = suffixes.firstForCodePoint(c); in nextCE32FromContraction()
509 ce32 = (uint32_t)suffixes.getValue(); in nextCE32FromContraction()
513 if(skipped != NULL && !skipped->isEmpty()) { skipped->saveTrieState(suffixes); } in nextCE32FromContraction()
537 d, suffixes, ce32, lookAhead, c, errorCode); in nextCE32FromContraction()
550 match = suffixes in nextCE32FromContraction()
557 nextCE32FromDiscontiguousContraction( const CollationData *d, UCharsTrie &suffixes, uint32_t ce32, int32_t lookAhead, UChar32 c, UErrorCode &errorCode) nextCE32FromDiscontiguousContraction() argument
[all...]
H A Dcollationsets.cpp263 // Parallel iteration over suffixes of both tables. in compareContractions()
264 UCharsTrie::Iterator suffixes(p, 0, errorCode); in compareContractions()
275 if(suffixes.next(errorCode)) { in compareContractions()
276 ts = &suffixes.getString(); in compareContractions()
300 compare(c, (uint32_t)suffixes.getValue(), (uint32_t)baseSuffixes.getValue()); in compareContractions()
330 UCharsTrie::Iterator suffixes(p, 0, errorCode); in addContractions()
331 while(suffixes.next(errorCode)) { in addContractions()
332 addSuffix(c, suffixes.getString()); in addContractions()
573 UCharsTrie::Iterator suffixes(p + 2, 0, errorCode); in handleContractions()
574 while(suffixes in handleContractions()
[all...]
/third_party/rust/crates/regex/src/
H A Dexec.rs90 suffixes: LiteralSearcher,
125 suffixes: Literals,
232 let mut suffixes = Some(Literals::empty()); in parse() variables
273 // suffixes, so disable them. in parse()
274 suffixes = None; in parse()
278 suffixes = None; in parse()
280 suffixes = suffixes.and_then(|mut suffixes| { in parse()
281 if !suffixes in parse()
[all...]
/third_party/python/Lib/idlelib/
H A Dpathbrowser.py84 suffixes = importlib.machinery.EXTENSION_SUFFIXES[:]
85 suffixes += importlib.machinery.SOURCE_SUFFIXES
86 suffixes += importlib.machinery.BYTECODE_SUFFIXES
88 for suff in suffixes:
/third_party/python/Lib/test/test_importlib/
H A Dtest_windows.py128 suffixes = self.machinery.EXTENSION_SUFFIXES
132 untagged_i = suffixes.index(".pyd")
134 untagged_i = suffixes.index("_d.pyd")
137 self.assertIn(expected_tag, suffixes)
140 tagged_i = suffixes.index(expected_tag)
H A Dupdate-zips.py29 suffixes = '01', '02'
30 tuple(map(generate, suffixes))
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/scripts/
H A Dupdate.py225 def list_files(src_base, src, dst_base, suffixes):
227 `suffixes` and yield the source path and the destination path."""
232 if path.splitext(filename)[1] in suffixes:
241 suffixes = {'.inc', '.h', '.def'}
249 for src, dst in list_files(LLVM_OBJS, subdir, dst_base, suffixes):
345 suffixes = {'.inc', '.h', '.def'}
347 for src, dst in list_files(LLVM_OBJS, src_dir, dst_base, suffixes):
/third_party/node/deps/openssl/openssl/apps/
H A Drehash.c87 /* Keep in sync with |suffixes|, below. */
102 static const char *suffixes[] = { "", "r" }; variable
212 for (type = OSSL_NELEM(suffixes) - 1; type > 0; type--) { in handle_symlink()
213 const char *suffix = suffixes[type]; in handle_symlink()
217 i += strlen(suffixes[type]); in handle_symlink()
427 suffixes[bp->type], ep->old_id); in do_dir()
438 suffixes[bp->type], nextid); in do_dir()
460 suffixes[bp->type], ep->old_id); in do_dir()
/third_party/openssl/apps/
H A Drehash.c90 /* Keep in sync with |suffixes|, below. */
105 static const char *suffixes[] = { "", "r" }; variable
215 for (type = OSSL_NELEM(suffixes) - 1; type > 0; type--) { in handle_symlink()
216 const char *suffix = suffixes[type]; in handle_symlink()
220 i += strlen(suffixes[type]); in handle_symlink()
421 suffixes[bp->type], ep->old_id); in do_dir()
432 suffixes[bp->type], nextid); in do_dir()
454 suffixes[bp->type], ep->old_id); in do_dir()
/third_party/gptfdisk/
H A Dsupport.cc143 string suffixes = "KMGTPE"; in IeeeToInt() local
167 foundAt = suffixes.find(suffix); in IeeeToInt()
171 while (foundAt > (suffixes.length() - 1) && inString.peek() != -1) { in IeeeToInt()
173 foundAt = suffixes.find(suffix); in IeeeToInt()
/third_party/python/Doc/tools/extensions/
H A Dpatchlevel.py39 suffixes = {
45 release += suffixes[level] + str(int(d['PY_RELEASE_SERIAL']))
/third_party/mesa3d/include/android_stub/backtrace/
H A DBacktraceMap.h153 void SetSuffixesToIgnore(std::vector<std::string> suffixes) { in SetSuffixesToIgnore() argument
154 suffixes_to_ignore_.insert(suffixes_to_ignore_.end(), suffixes.begin(), suffixes.end()); in SetSuffixesToIgnore()
/third_party/python/Tools/c-analyzer/c_common/
H A Dfsutil.py277 if suffix and not isinstance(suffix, str): # multiple suffixes
285 def iter_files_by_suffix(root, suffixes, relparent=None, *,
289 """Yield each file in the tree that has the given suffixes.
293 if isinstance(suffixes, str):
294 suffixes = [suffixes]
295 # XXX Ignore repeated suffixes?
296 for suffix in suffixes:
/third_party/python/Lib/venv/
H A D__init__.py309 suffixes = [
314 suffixes = [
315 f for f in suffixes if
319 suffixes = {'python.exe', 'python_d.exe', 'pythonw.exe', 'pythonw_d.exe'}
321 suffixes.add(base_exe)
323 for suffix in suffixes:
/third_party/rust/crates/regex/regex-syntax/src/hir/literal/
H A Dmod.rs2 Provides routines for extracting literal prefixes and suffixes from an `Hir`.
64 /// Returns a set of literal suffixes extracted from the given `Hir`.
65 pub fn suffixes(expr: &Hir) -> Literals { in suffixes() functions
280 /// Returns a new set of suffixes of this set of literals that are
313 /// Unions the suffixes from the given expression to this set.
315 /// If suffixes could not be added (for example, this set would exceed its
316 /// size limits or the set of suffixes from `expr` includes the empty
324 suffixes(expr, &mut lits); in union_suffixes()
655 fn suffixes(expr: &Hir, lits: &mut Literals) { in suffixes() functions
678 suffixes( in suffixes()
1050 fn suffixes(lits: &mut Literals, expr: &Hir) { suffixes() functions
[all...]

Completed in 19 milliseconds

123