| /external/fonttools/Tests/misc/ |
| D | filenames_test.py | 36 suffix = "TEST_SUFFIX"
40 userNameToFileName(name, prefix=prefix, suffix=suffix),
41 prefix + name_file + suffix)
45 suffix = "TEST_SUFFIX"
52 name, exist, prefix=prefix, suffix=suffix)
54 self.assertEqual(generated, prefix + name_file + suffix)
56 name, exist, prefix=prefix, suffix=suffix)
60 prefix + name_file + collision_avoidance1 + suffix)
62 name, exist, prefix=prefix, suffix=suffix)
65 prefix + name_file + collision_avoidance2+ suffix)
[all …]
|
| /external/fonttools/Tests/varLib/ |
| D | interpolate_layout_test.py | 42 def get_file_list(folder, suffix, prefix=''): argument
46 if p.startswith(prefix) and p.endswith(suffix):
50 def temp_path(self, suffix): argument
54 "tmp%d%s" % (self.num_tempfiles, suffix))
72 path = self.temp_path(suffix=".ttx")
82 def check_ttx_dump(self, font, expected_ttx, tables, suffix): argument
84 path = self.temp_path(suffix=suffix)
88 def compile_font(self, path, suffix, temp_dir, features=None): argument
90 savepath = os.path.join(temp_dir, ttx_filename.replace('.ttx', suffix))
108 suffix = '.ttf'
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/number/parse/ |
| D | AffixMatcher.java | 25 private final AffixPatternMatcher suffix; field in AffixMatcher
30 * suffixes, ensuring that the longest prefix/suffix pair is always chosen.
37 } else if (length(lhs.suffix) != length(rhs.suffix)) {
38 return length(lhs.suffix) > length(rhs.suffix) ? -1 : 1;
40 // If the prefix and suffix are the same length, arbitrarily break ties.
124 // Generate Suffix in createMatchers()
133 AffixPatternMatcher suffix = AffixPatternMatcher in createMatchers() local
138 posSuffix = suffix; in createMatchers()
139 } else if (Objects.equals(prefix, posPrefix) && Objects.equals(suffix, posSuffix)) { in createMatchers()
149 matchers.add(getInstance(prefix, suffix, flags)); in createMatchers()
[all …]
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/number/parse/ |
| D | AffixMatcher.java | 23 private final AffixPatternMatcher suffix; field in AffixMatcher
28 * suffixes, ensuring that the longest prefix/suffix pair is always chosen.
35 } else if (length(lhs.suffix) != length(rhs.suffix)) {
36 return length(lhs.suffix) > length(rhs.suffix) ? -1 : 1;
38 // If the prefix and suffix are the same length, arbitrarily break ties.
122 // Generate Suffix in createMatchers()
131 AffixPatternMatcher suffix = AffixPatternMatcher in createMatchers() local
136 posSuffix = suffix; in createMatchers()
137 } else if (Objects.equals(prefix, posPrefix) && Objects.equals(suffix, posSuffix)) { in createMatchers()
147 matchers.add(getInstance(prefix, suffix, flags)); in createMatchers()
[all …]
|
| /external/libcxx/test/std/re/re.alg/re.alg.search/ |
| D | ecma.pass.cpp | 45 assert(!m.suffix().matched); in main()
46 assert(m.suffix().first == m[0].second); in main()
47 assert(m.suffix().second == s+1); in main()
60 assert(!m.suffix().matched); in main()
61 assert(m.suffix().first == m[0].second); in main()
62 assert(m.suffix().second == s+2); in main()
82 assert(!m.suffix().matched); in main()
83 assert(m.suffix().first == m[0].second); in main()
84 assert(m.suffix().second == s+3); in main()
104 assert(m.suffix().matched); in main()
[all …]
|
| D | extended.pass.cpp | 45 assert(!m.suffix().matched); in main()
46 assert(m.suffix().first == m[0].second); in main()
47 assert(m.suffix().second == s+1); in main()
60 assert(!m.suffix().matched); in main()
61 assert(m.suffix().first == m[0].second); in main()
62 assert(m.suffix().second == s+2); in main()
82 assert(!m.suffix().matched); in main()
83 assert(m.suffix().first == m[0].second); in main()
84 assert(m.suffix().second == s+3); in main()
104 assert(m.suffix().matched); in main()
[all …]
|
| D | basic.pass.cpp | 51 assert(!m.suffix().matched); in main()
52 assert(m.suffix().first == m[0].second); in main()
53 assert(m.suffix().second == s+1); in main()
66 assert(!m.suffix().matched); in main()
67 assert(m.suffix().first == m[0].second); in main()
68 assert(m.suffix().second == s+2); in main()
88 assert(!m.suffix().matched); in main()
89 assert(m.suffix().first == m[0].second); in main()
90 assert(m.suffix().second == s+3); in main()
110 assert(m.suffix().matched); in main()
[all …]
|
| D | awk.pass.cpp | 45 assert(!m.suffix().matched); in main()
46 assert(m.suffix().first == m[0].second); in main()
47 assert(m.suffix().second == s+1); in main()
60 assert(!m.suffix().matched); in main()
61 assert(m.suffix().first == m[0].second); in main()
62 assert(m.suffix().second == s+2); in main()
82 assert(!m.suffix().matched); in main()
83 assert(m.suffix().first == m[0].second); in main()
84 assert(m.suffix().second == s+3); in main()
104 assert(m.suffix().matched); in main()
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/re/re.alg/re.alg.search/ |
| D | ecma.pass.cpp | 35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
50 assert(!m.suffix().matched); in main()
51 assert(m.suffix().first == m[0].second); in main()
52 assert(m.suffix().second == s+2); in main()
72 assert(!m.suffix().matched); in main()
73 assert(m.suffix().first == m[0].second); in main()
74 assert(m.suffix().second == s+3); in main()
94 assert(m.suffix().matched); in main()
[all …]
|
| D | extended.pass.cpp | 35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
50 assert(!m.suffix().matched); in main()
51 assert(m.suffix().first == m[0].second); in main()
52 assert(m.suffix().second == s+2); in main()
72 assert(!m.suffix().matched); in main()
73 assert(m.suffix().first == m[0].second); in main()
74 assert(m.suffix().second == s+3); in main()
94 assert(m.suffix().matched); in main()
[all …]
|
| D | awk.pass.cpp | 35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
50 assert(!m.suffix().matched); in main()
51 assert(m.suffix().first == m[0].second); in main()
52 assert(m.suffix().second == s+2); in main()
72 assert(!m.suffix().matched); in main()
73 assert(m.suffix().first == m[0].second); in main()
74 assert(m.suffix().second == s+3); in main()
94 assert(m.suffix().matched); in main()
[all …]
|
| D | basic.pass.cpp | 41 assert(!m.suffix().matched); in main()
42 assert(m.suffix().first == m[0].second); in main()
43 assert(m.suffix().second == s+1); in main()
56 assert(!m.suffix().matched); in main()
57 assert(m.suffix().first == m[0].second); in main()
58 assert(m.suffix().second == s+2); in main()
78 assert(!m.suffix().matched); in main()
79 assert(m.suffix().first == m[0].second); in main()
80 assert(m.suffix().second == s+3); in main()
100 assert(m.suffix().matched); in main()
[all …]
|
| /external/fonttools/Lib/fontTools/misc/ |
| D | filenames.py | 33 def userNameToFileName(userName, existing=[], prefix="", suffix=""): argument
43 suffix: Suffix to be appended to the file name.
101 # establish the prefix and suffix lengths
103 suffixLength = len(suffix)
130 fullName = prefix + userName + suffix
132 fullName = handleClash1(userName, existing, prefix, suffix)
136 def handleClash1(userName, existing=[], prefix="", suffix=""): argument
142 >>> suffix = "." + ("0" * 10)
147 ... prefix=prefix, suffix=suffix) == (
152 >>> e.append(prefix + "aaaaa" + "1".zfill(15) + suffix)
[all …]
|
| /external/fonttools/Lib/fontTools/ufoLib/ |
| D | filenames.py | 95 def userNameToFileName(userName: str, existing=(), prefix="", suffix=""): argument
147 # establish the prefix and suffix lengths
149 suffixLength = len(suffix)
176 fullName = prefix + userName + suffix
178 fullName = handleClash1(userName, existing, prefix, suffix)
182 def handleClash1(userName, existing=[], prefix="", suffix=""): argument
188 >>> suffix = "." + ("0" * 10)
193 ... prefix=prefix, suffix=suffix) == (
198 >>> e.append(prefix + "aaaaa" + "1".zfill(15) + suffix)
200 ... prefix=prefix, suffix=suffix) == (
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/number/ |
| D | ConstantAffixModifier.java | 11 * The canonical implementation of {@link Modifier}, containing a prefix and suffix string.
16 // TODO: Avoid making a new instance by default if prefix and suffix are empty
20 private final String suffix; field in ConstantAffixModifier
33 * @param suffix
34 * The suffix string.
41 public ConstantAffixModifier(String prefix, String suffix, Field field, boolean strong) { in ConstantAffixModifier() argument
43 // TODO: Consider returning a null modifier if both prefix and suffix are empty. in ConstantAffixModifier()
45 this.suffix = (suffix == null ? "" : suffix); in ConstantAffixModifier()
50 /** Constructs a new instance with an empty prefix, suffix, and field. */
53 suffix = ""; in ConstantAffixModifier()
[all …]
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/number/ |
| D | ConstantAffixModifier.java | 10 * The canonical implementation of {@link Modifier}, containing a prefix and suffix string.
14 // TODO: Avoid making a new instance by default if prefix and suffix are empty
18 private final String suffix; field in ConstantAffixModifier
31 * @param suffix
32 * The suffix string.
39 public ConstantAffixModifier(String prefix, String suffix, Field field, boolean strong) { in ConstantAffixModifier() argument
41 // TODO: Consider returning a null modifier if both prefix and suffix are empty. in ConstantAffixModifier()
43 this.suffix = (suffix == null ? "" : suffix); in ConstantAffixModifier()
48 /** Constructs a new instance with an empty prefix, suffix, and field. */
51 suffix = ""; in ConstantAffixModifier()
[all …]
|
| /external/libcxx/test/std/re/re.alg/re.alg.match/ |
| D | awk.pass.cpp | 39 assert(!m.suffix().matched); in main()
40 assert(m.suffix().first == m[0].second); in main()
41 assert(m.suffix().second == s+1); in main()
54 assert(!m.suffix().matched); in main()
55 assert(m.suffix().first == m[0].second); in main()
56 assert(m.suffix().second == s+2); in main()
95 assert(!m.suffix().matched); in main()
96 assert(m.suffix().first == m[0].second); in main()
97 assert(m.suffix().second == s+4); in main()
110 assert(!m.suffix().matched); in main()
[all …]
|
| D | ecma.pass.cpp | 45 assert(!m.suffix().matched); in main()
46 assert(m.suffix().first == m[0].second); in main()
47 assert(m.suffix().second == s+1); in main()
60 assert(!m.suffix().matched); in main()
61 assert(m.suffix().first == m[0].second); in main()
62 assert(m.suffix().second == s+2); in main()
101 assert(!m.suffix().matched); in main()
102 assert(m.suffix().first == m[0].second); in main()
103 assert(m.suffix().second == s+4); in main()
116 assert(!m.suffix().matched); in main()
[all …]
|
| D | extended.pass.cpp | 45 assert(!m.suffix().matched); in main()
46 assert(m.suffix().first == m[0].second); in main()
47 assert(m.suffix().second == s+1); in main()
60 assert(!m.suffix().matched); in main()
61 assert(m.suffix().first == m[0].second); in main()
62 assert(m.suffix().second == s+2); in main()
101 assert(!m.suffix().matched); in main()
102 assert(m.suffix().first == m[0].second); in main()
103 assert(m.suffix().second == s+4); in main()
116 assert(!m.suffix().matched); in main()
[all …]
|
| D | basic.pass.cpp | 51 assert(!m.suffix().matched); in main()
52 assert(m.suffix().first == m[0].second); in main()
53 assert(m.suffix().second == s+1); in main()
66 assert(!m.suffix().matched); in main()
67 assert(m.suffix().first == m[0].second); in main()
68 assert(m.suffix().second == s+2); in main()
107 assert(!m.suffix().matched); in main()
108 assert(m.suffix().first == m[0].second); in main()
109 assert(m.suffix().second == s+4); in main()
122 assert(!m.suffix().matched); in main()
[all …]
|
| /external/toybox/tests/ |
| D | basename.test | 12 # Standard suffix behavior.
13 testcmd "suffix" "a/b/c/d.suffix .suffix" "d\n" "" ""
15 # A suffix cannot be the entire result.
16 testcmd "suffix=result" ".txt .txt" ".txt\n" "" ""
18 # Deal with suffix appearing in the filename
19 testcmd "reappearing suffix 1" "a.txt.txt .txt" "a.txt\n" "" ""
20 testcmd "reappearing suffix 2" "a.txt.old .txt" "a.txt.old\n" "" ""
22 # A suffix should be a real suffix, only a the end.
23 testcmd "invalid suffix" "isthisasuffix? suffix" "isthisasuffix?\n" "" ""
25 # Zero-length suffix
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/re/re.alg/re.alg.match/ |
| D | extended.pass.cpp | 34 assert(!m.suffix().matched); in main()
35 assert(m.suffix().first == m[0].second); in main()
36 assert(m.suffix().second == s+1); in main()
49 assert(!m.suffix().matched); in main()
50 assert(m.suffix().first == m[0].second); in main()
51 assert(m.suffix().second == s+2); in main()
90 assert(!m.suffix().matched); in main()
91 assert(m.suffix().first == m[0].second); in main()
92 assert(m.suffix().second == s+4); in main()
105 assert(!m.suffix().matched); in main()
[all …]
|
| D | ecma.pass.cpp | 35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
50 assert(!m.suffix().matched); in main()
51 assert(m.suffix().first == m[0].second); in main()
52 assert(m.suffix().second == s+2); in main()
91 assert(!m.suffix().matched); in main()
92 assert(m.suffix().first == m[0].second); in main()
93 assert(m.suffix().second == s+4); in main()
106 assert(!m.suffix().matched); in main()
[all …]
|
| D | awk.pass.cpp | 35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
50 assert(!m.suffix().matched); in main()
51 assert(m.suffix().first == m[0].second); in main()
52 assert(m.suffix().second == s+2); in main()
91 assert(!m.suffix().matched); in main()
92 assert(m.suffix().first == m[0].second); in main()
93 assert(m.suffix().second == s+4); in main()
106 assert(!m.suffix().matched); in main()
[all …]
|
| /external/apache-commons-io/src/main/java/org/apache/commons/io/filefilter/ |
| D | SuffixFileFilter.java | 31 * Filters files based on the suffix (what the file name ends with).
80 * Constructs a new Suffix file filter for a list of suffixes.
83 * @throws IllegalArgumentException if the suffix list is null
91 * Constructs a new Suffix file filter for a list of suffixes
96 * @throws IllegalArgumentException if the suffix list is null
107 * Constructs a new Suffix file filter for a single extension.
109 * @param suffix the suffix to allow, must not be null
110 * @throws IllegalArgumentException if the suffix is null
112 public SuffixFileFilter(final String suffix) { in SuffixFileFilter() argument
113 this(suffix, IOCase.SENSITIVE); in SuffixFileFilter()
[all …]
|