Home
last modified time | relevance | path

Searched refs:distances (Results 1 - 24 of 24) sorted by relevance

/third_party/lzma/C/
H A DLzFind.c1089 #define MOVE_POS_RET MOVE_POS return distances;
1110 #define GET_MATCHES_HEADER(minLen) GET_MATCHES_HEADER2(minLen, return distances)
1118 distances = func(MF_PARAMS(p), \
1119 distances, (UInt32)_maxLen_); MOVE_POS_RET
1136 static UInt32* Bt2_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) in Bt2_MatchFinder_GetMatches() argument
1145 UInt32* Bt3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) in Bt3Zip_MatchFinder_GetMatches() argument
1161 static UInt32* Bt3_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) in Bt3_MatchFinder_GetMatches() argument
1188 distances[0] = (UInt32)maxLen; in Bt3_MatchFinder_GetMatches() local
1189 distances[1] = d2 - 1; in Bt3_MatchFinder_GetMatches()
1190 distances in Bt3_MatchFinder_GetMatches()
1202 Bt4_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) Bt4_MatchFinder_GetMatches() argument
1257 distances[-2] = (UInt32)maxLen; Bt4_MatchFinder_GetMatches() local
1270 Bt5_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) Bt5_MatchFinder_GetMatches() argument
1329 distances[-2] = (UInt32)maxLen; Bt5_MatchFinder_GetMatches() local
1342 Hc4_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) Hc4_MatchFinder_GetMatches() argument
1397 distances[-2] = (UInt32)maxLen; Hc4_MatchFinder_GetMatches() local
1410 Hc5_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) Hc5_MatchFinder_GetMatches() argument
1469 distances[-2] = maxLen; Hc5_MatchFinder_GetMatches() local
1482 Hc3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances) Hc3Zip_MatchFinder_GetMatches() argument
[all...]
H A DLzFind.h119 UInt32 *distances, UInt32 maxLen);
130 typedef UInt32 * (*Mf_GetMatches_Func)(void *object, UInt32 *distances);
149 UInt32* Bt3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances);
150 UInt32* Hc3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances);
H A DLzFindMt.h34 typedef UInt32 * (*Mf_Mix_Matches)(void *p, UInt32 matchMinPos, UInt32 *distances);
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/locale/
H A DLocaleDistance.java49 // Indexes into array of distances.
110 public int[] distances; field in LocaleDistance.Data
114 Set<LSR> paradigmLSRs, int[] distances) { in Data()
119 this.distances = distances; in Data()
166 int[] distances = getValue(matchTable, "distances", value).getIntVector(); in load()
167 if (distances.length < IX_LIMIT) { in load()
169 "langInfo.res intvector too short", "", "match/distances"); in load()
172 return new Data(trie, regionToPartitions, partitions, paradigmLSRs, distances); in load()
112 Data(byte[] trie, byte[] regionToPartitionsIndex, String[] partitionArrays, Set<LSR> paradigmLSRs, int[] distances) Data() argument
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/locale/
H A DLocaleDistance.java51 // Indexes into array of distances.
115 public int[] distances; field in LocaleDistance.Data
119 Set<LSR> paradigmLSRs, int[] distances) { in Data()
124 this.distances = distances; in Data()
171 int[] distances = getValue(matchTable, "distances", value).getIntVector(); in load()
172 if (distances.length < IX_LIMIT) { in load()
174 "langInfo.res intvector too short", "", "match/distances"); in load()
177 return new Data(trie, regionToPartitions, partitions, paradigmLSRs, distances); in load()
117 Data(byte[] trie, byte[] regionToPartitionsIndex, String[] partitionArrays, Set<LSR> paradigmLSRs, int[] distances) Data() argument
[all...]
/third_party/lzma/Java/SevenZip/Compression/LZ/
H A DBinTree.java118 public int GetMatches(int[] distances) throws IOException in GetMatches() argument
160 distances[offset++] = maxLen = 2; in GetMatches()
161 distances[offset++] = _pos - curMatch2 - 1; in GetMatches()
168 distances[offset++] = maxLen = 3; in GetMatches()
169 distances[offset++] = _pos - curMatch3 - 1; in GetMatches()
194 distances[offset++] = maxLen = kNumHashDirectBytes; in GetMatches()
195 distances[offset++] = _pos - curMatch - 1; in GetMatches()
223 distances[offset++] = maxLen = len; in GetMatches()
224 distances[offset++] = delta - 1; in GetMatches()
/third_party/lzma/CS/7zip/Compress/LZ/
H A DLzBinTree.cs118 public UInt32 GetMatches(UInt32[] distances) in GetMatches() argument
160 distances[offset++] = maxLen = 2; in GetMatches()
161 distances[offset++] = _pos - curMatch2 - 1; in GetMatches()
168 distances[offset++] = maxLen = 3; in GetMatches()
169 distances[offset++] = _pos - curMatch3 - 1; in GetMatches()
194 distances[offset++] = maxLen = kNumHashDirectBytes; in GetMatches()
195 distances[offset++] = _pos - curMatch - 1; in GetMatches()
223 distances[offset++] = maxLen = len; in GetMatches()
224 distances[offset++] = delta - 1; in GetMatches()
H A DIMatchFinder.cs21 UInt32 GetMatches(UInt32[] distances); in GetMatches() argument
/third_party/icu/tools/cldr/cldr-to-icu/src/main/java/org/unicode/icu/tool/cldrtoicu/localedistance/
H A DDistanceTable.java106 int[] distances = new int[IX_LIMIT]; in build()
107 distances[IX_DEF_LANG_DISTANCE] = defLangNode.distance; in build()
108 distances[IX_DEF_SCRIPT_DISTANCE] = defScriptNode.distance; in build()
109 distances[IX_DEF_REGION_DISTANCE] = defRegionNode.distance; in build()
110 distances[IX_MIN_REGION_DISTANCE] = minRegionDistance; in build()
112 // Having determined the distances, prune the Trie to remove any sub-tables in build()
113 // where distances could only be determined to be the default value (i.e. in build()
116 return new DistanceTable(rootNode, distances); in build()
175 private final int[] distances; field in DistanceTable
177 private DistanceTable(Node rootNode, int[] distances) { in DistanceTable() argument
[all...]
H A DLocaleDistanceMapper.java64 // Definitions of region containment variables used when expressing match distances. E.g.:
113 private static final RbPath MATCH_DISTANCES = RbPath.of("match", "distances:intvector");
143 icuData.add(MATCH_DISTANCES, RbValue.of(Arrays.stream(distanceData.distances).mapToObj(Integer::toString))); in process()
/third_party/rust/crates/strsim-rs/src/
H A Dlib.rs336 let mut distances = vec![0; (a_len + 2) * (b_len + 2)]; in generic_damerau_levenshtein() variables
338 distances[0] = max_distance; in generic_damerau_levenshtein()
341 distances[flat_index(i + 1, 0, width)] = max_distance; in generic_damerau_levenshtein()
342 distances[flat_index(i + 1, 1, width)] = i; in generic_damerau_levenshtein()
346 distances[flat_index(0, j + 1, width)] = max_distance; in generic_damerau_levenshtein()
347 distances[flat_index(1, j + 1, width)] = j; in generic_damerau_levenshtein()
361 let insertion_cost = distances[flat_index(i, j + 1, width)] + 1; in generic_damerau_levenshtein()
362 let deletion_cost = distances[flat_index(i + 1, j, width)] + 1; in generic_damerau_levenshtein()
363 let transposition_cost = distances[flat_index(k, db, width)] + in generic_damerau_levenshtein()
366 let mut substitution_cost = distances[flat_inde in generic_damerau_levenshtein()
[all...]
/third_party/icu/icu4c/source/common/
H A Dlocdistance.cpp38 // Indexes into array of distances.
68 data.distances == nullptr) { in initLocaleDistance()
91 defaultLanguageDistance(data.distances[IX_DEF_LANG_DISTANCE]), in LocaleDistance()
92 defaultScriptDistance(data.distances[IX_DEF_SCRIPT_DISTANCE]), in LocaleDistance()
93 defaultRegionDistance(data.distances[IX_DEF_REGION_DISTANCE]), in LocaleDistance()
94 minRegionDistance(data.distances[IX_MIN_REGION_DISTANCE]) { in LocaleDistance()
138 // the default distances without further lookups. in getBestIndexAndDistance()
154 // for comparison with un-shifted distances until we need fraction bits. in getBestIndexAndDistance()
H A Dloclikelysubtags.h33 const int32_t *distances = nullptr; member
/third_party/node/deps/icu-small/source/common/
H A Dlocdistance.cpp38 // Indexes into array of distances.
68 data.distances == nullptr) { in initLocaleDistance()
91 defaultLanguageDistance(data.distances[IX_DEF_LANG_DISTANCE]), in LocaleDistance()
92 defaultScriptDistance(data.distances[IX_DEF_SCRIPT_DISTANCE]), in LocaleDistance()
93 defaultRegionDistance(data.distances[IX_DEF_REGION_DISTANCE]), in LocaleDistance()
94 minRegionDistance(data.distances[IX_MIN_REGION_DISTANCE]) { in LocaleDistance()
138 // the default distances without further lookups. in getBestIndexAndDistance()
154 // for comparison with un-shifted distances until we need fraction bits. in getBestIndexAndDistance()
H A Dloclikelysubtags.h34 const int32_t *distances = nullptr; member
/third_party/skia/third_party/externals/icu/source/common/
H A Dlocdistance.cpp38 // Indexes into array of distances.
68 data.distances == nullptr) { in initLocaleDistance()
91 defaultLanguageDistance(data.distances[IX_DEF_LANG_DISTANCE]), in LocaleDistance()
92 defaultScriptDistance(data.distances[IX_DEF_SCRIPT_DISTANCE]), in LocaleDistance()
93 defaultRegionDistance(data.distances[IX_DEF_REGION_DISTANCE]), in LocaleDistance()
94 minRegionDistance(data.distances[IX_MIN_REGION_DISTANCE]) { in LocaleDistance()
138 // the default distances without further lookups. in getBestIndexAndDistance()
154 // for comparison with un-shifted distances until we need fraction bits. in getBestIndexAndDistance()
H A Dloclikelysubtags.h33 const int32_t *distances = nullptr; member
/third_party/mesa3d/src/amd/vulkan/
H A Dradv_rt_common.c52 /* if (distances[chan_2] < distances[chan_1]) { */ in nir_sort_hit_pair()
56 /* swap(distances[chan_2], distances[chan_1]); */ in nir_sort_hit_pair()
83 /* vec4 distances = vec4(INF, INF, INF, INF); */ in intersect_ray_amd_software_box()
84 nir_variable *distances = in intersect_ray_amd_software_box() local
85 nir_variable_create(b->shader, nir_var_shader_temp, vec4_type, "distances"); in intersect_ray_amd_software_box()
86 nir_store_var(b, distances, nir_imm_vec4(b, INFINITY, INFINITY, INFINITY, INFINITY), 0xf); in intersect_ray_amd_software_box()
157 /* distances[i] = tmin; */ in intersect_ray_amd_software_box()
159 nir_store_var(b, distances, nir_ve in intersect_ray_amd_software_box()
[all...]
H A Dradv_cmd_buffer.c1091 uint32_t *distances = alloca(num_samples * sizeof(*distances)); in radv_compute_centroid_priority() local
1094 /* Compute the distances from center for each sample. */ in radv_compute_centroid_priority()
1096 distances[i] = (sample_locs[i].x * sample_locs[i].x) + (sample_locs[i].y * sample_locs[i].y); in radv_compute_centroid_priority()
1099 /* Compute the centroid priorities by looking at the distances array. */ in radv_compute_centroid_priority()
1104 if (distances[j] < distances[min_idx]) in radv_compute_centroid_priority()
1109 distances[min_idx] = 0xffffffff; in radv_compute_centroid_priority()
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/tool/locale/
H A DLocaleDistanceBuilder.java349 void prune(int level, int[] distances) { in prune() argument
352 node.prune(level + 1, distances); in prune()
361 if (next.nodeDistance == distances[LocaleDistance.IX_DEF_SCRIPT_DISTANCE]) { in prune()
370 if (next.nodeDistance == distances[LocaleDistance.IX_DEF_REGION_DISTANCE]) { in prune()
594 int[] distances = new int[LocaleDistance.IX_LIMIT]; in build()
596 distances[LocaleDistance.IX_DEF_LANG_DISTANCE] = node.nodeDistance; in build()
598 distances[LocaleDistance.IX_DEF_SCRIPT_DISTANCE] = node.nodeDistance; in build()
600 distances[LocaleDistance.IX_DEF_REGION_DISTANCE] = node.nodeDistance; in build()
601 distances[LocaleDistance.IX_MIN_REGION_DISTANCE] = minRegionDistance; in build()
603 defaultDistanceTable.prune(0, distances); in build()
[all...]
/third_party/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/locale/
H A DLocaleDistanceBuilder.java349 void prune(int level, int[] distances) { in prune() argument
352 node.prune(level + 1, distances); in prune()
361 if (next.nodeDistance == distances[LocaleDistance.IX_DEF_SCRIPT_DISTANCE]) { in prune()
370 if (next.nodeDistance == distances[LocaleDistance.IX_DEF_REGION_DISTANCE]) { in prune()
594 int[] distances = new int[LocaleDistance.IX_LIMIT]; in build()
596 distances[LocaleDistance.IX_DEF_LANG_DISTANCE] = node.nodeDistance; in build()
598 distances[LocaleDistance.IX_DEF_SCRIPT_DISTANCE] = node.nodeDistance; in build()
600 distances[LocaleDistance.IX_DEF_REGION_DISTANCE] = node.nodeDistance; in build()
601 distances[LocaleDistance.IX_MIN_REGION_DISTANCE] = minRegionDistance; in build()
603 defaultDistanceTable.prune(0, distances); in build()
[all...]
/third_party/skia/src/pathops/
H A DSkPathWriter.cpp187 DistanceLessThan(double* distances) : fDistances(distances) { } in DistanceLessThan() argument
274 SkSTArray<8, double, true> distances(entries); in assemble()
287 distances.push_back(dist); // oStart distance from iStart in assemble()
293 SkTQSort<int>(sortedDist.begin(), sortedDist.end(), DistanceLessThan(distances.begin())); in assemble()
/third_party/astc-encoder/Source/
H A Dastcenc_find_best_partitioning.cpp70 float distances[BLOCK_MAX_TEXELS]; in kmeans_init() local
86 distances[i] = distance; in kmeans_init()
106 summa += distances[sample]; in kmeans_init()
130 distance = astc::min(distance, distances[i]); in kmeans_init()
132 distances[i] = distance; in kmeans_init()
/third_party/lzma/Asm/x86/
H A DLzFindOpt.asm122 distances equ QWORD PTR [r4 + 8 * 5] define
241 mov distances, d
308 mov t0, distances
413 mov t0, distances

Completed in 31 milliseconds