| /external/tensorflow/tensorflow/python/ops/ |
| D | clustering_ops_test.py | 64 distances = np.zeros(1000).astype(np.float32)
65 distances[6] = 10e7
66 distances[4] = 10e3
68 sampled_point = clustering_ops.kmc2_chain_initialization(distances, seed)
70 distances[6] = 0.0
71 sampled_point = clustering_ops.kmc2_chain_initialization(distances, seed)
137 [indices, distances] = clustering_ops.nearest_neighbors(self._points,
140 self.assertAllClose(distances, [[0.], [5.], [1.], [0.]])
144 [indices, distances] = clustering_ops.nearest_neighbors(self._points,
147 self.assertAllClose(distances, [[0., 2.], [5., 5.], [1., 5.], [0., 2.]])
[all …]
|
| D | clustering_ops.py | 257 (indices, distances) = gen_clustering_ops.nearest_neighbors(
260 distances *= 0.5
261 output.append((score, array_ops.squeeze(distances, [-1]),
669 _, distances = gen_clustering_ops.nearest_neighbors(
673 array_ops.squeeze(distances), self._seed)
|
| /external/lzma/C/ |
| D | LzFindMt.c | 247 …UInt32 *distances, UInt32 _maxLen, const UInt32 *hash, const UInt32 *limit, UInt32 size, UInt32 *p… in GetMatchesSpecN() argument
251 UInt32 *_distances = ++distances; in GetMatchesSpecN()
295 *distances++ = (UInt32)len; in GetMatchesSpecN()
296 *distances++ = delta - 1; in GetMatchesSpecN()
336 UInt32 num = (UInt32)(distances - _distances); in GetMatchesSpecN()
340 while (distances < limit && --size != 0); in GetMatchesSpecN()
342 return distances; in GetMatchesSpecN()
349 static void BtGetMatches(CMatchFinderMt *p, UInt32 *distances) in BtGetMatches() argument
355 distances[1] = p->hashNumAvail; in BtGetMatches()
362 distances[1] = numProcessed + p->hashNumAvail; in BtGetMatches()
[all …]
|
| D | LzFind.c | 391 UInt32 *distances, unsigned maxLen) in Hc_GetMatchesSpec() argument
440 distances[0] = (UInt32)(lim - cur); in Hc_GetMatchesSpec()
441 distances[1] = delta - 1; in Hc_GetMatchesSpec()
442 return distances + 2; in Hc_GetMatchesSpec()
450 distances[0] = (UInt32)len; in Hc_GetMatchesSpec()
451 distances[1] = delta - 1; in Hc_GetMatchesSpec()
452 distances += 2; in Hc_GetMatchesSpec()
460 return distances; in Hc_GetMatchesSpec()
467 UInt32 *distances, UInt32 maxLen) in GetMatchesSpec1() argument
478 return distances; in GetMatchesSpec1()
[all …]
|
| D | LzFind.h | 83 UInt32 *distances, UInt32 maxLen);
94 typedef UInt32 (*Mf_GetMatches_Func)(void *object, UInt32 *distances);
113 UInt32 Bt3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances);
114 UInt32 Hc3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances);
|
| /external/icu/tools/cldr/cldr-to-icu/src/main/java/org/unicode/icu/tool/cldrtoicu/localedistance/ |
| D | DistanceTable.java | 106 int[] distances = new int[IX_LIMIT]; in build() local
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()
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
179 this.distances = distances; in DistanceTable()
189 return distances; in getDefaultDistances()
[all …]
|
| /external/lzma/Java/SevenZip/Compression/LZ/ |
| D | BinTree.java | 118 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()
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_KMC2ChainInitialization.pbtxt | 5 name: "distances"
7 Vector with squared distances to the closest previously sampled cluster center
25 Entries in distances are assumed to be squared distances of candidate points to
|
| D | api_def_EditDistance.pbtxt | 74 // output is a 2x2 matrix with edit distances normalized by truth lengths.
82 boolean (if true, edit distances are normalized by length of truth).
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/locale/ |
| D | LocaleDistance.java | 110 public int[] distances; field in LocaleDistance.Data
114 Set<LSR> paradigmLSRs, int[] distances) { in Data() argument
119 this.distances = distances; in Data()
166 int[] distances = getValue(matchTable, "distances", value).getIntVector(); in load() local
167 if (distances.length < IX_LIMIT) { in load()
172 return new Data(trie, regionToPartitions, partitions, paradigmLSRs, distances); in load()
184 Arrays.equals(distances, od.distances); in equals()
201 defaultLanguageDistance = data.distances[IX_DEF_LANG_DISTANCE]; in LocaleDistance()
202 defaultScriptDistance = data.distances[IX_DEF_SCRIPT_DISTANCE]; in LocaleDistance()
203 defaultRegionDistance = data.distances[IX_DEF_REGION_DISTANCE]; in LocaleDistance()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/locale/ |
| D | LocaleDistance.java | 115 public int[] distances; field in LocaleDistance.Data
119 Set<LSR> paradigmLSRs, int[] distances) { in Data() argument
124 this.distances = distances; in Data()
171 int[] distances = getValue(matchTable, "distances", value).getIntVector(); in load() local
172 if (distances.length < IX_LIMIT) { in load()
177 return new Data(trie, regionToPartitions, partitions, paradigmLSRs, distances); in load()
189 Arrays.equals(distances, od.distances); in equals()
206 defaultLanguageDistance = data.distances[IX_DEF_LANG_DISTANCE]; in LocaleDistance()
207 defaultScriptDistance = data.distances[IX_DEF_SCRIPT_DISTANCE]; in LocaleDistance()
208 defaultRegionDistance = data.distances[IX_DEF_REGION_DISTANCE]; in LocaleDistance()
[all …]
|
| /external/lzma/CS/7zip/Compress/LZ/ |
| D | LzBinTree.cs | 118 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()
|
| D | IMatchFinder.cs | 21 UInt32 GetMatches(UInt32[] distances); in GetMatches() argument
|
| /external/webrtc/modules/audio_processing/agc2/rnn_vad/ |
| D | spectral_features.cc | 34 std::array<float, kCepstralCoeffsHistorySize - 1> distances; in UpdateCepstralDifferenceStats() local
38 distances[i] = 0.f; in UpdateCepstralDifferenceStats()
41 distances[i] += c * c; in UpdateCepstralDifferenceStats()
45 sym_matrix_buf->Push(distances); in UpdateCepstralDifferenceStats()
|
| /external/apache-commons-compress/src/main/java/org/apache/commons/compress/compressors/deflate64/ |
| D | HuffmanDecoder.java | 181 int distances = (int) (readBits(5) + 1); in readDynamicTables() local
182 result[1] = new int[distances]; in readDynamicTables()
369 …void populateDynamicTables(BitInputStream reader, int[] literals, int[] distances) throws IOExcept… in populateDynamicTables() argument
379 final int[] auxBuffer = new int[literals.length + distances.length]; in populateDynamicTables()
406 System.arraycopy(auxBuffer, literals.length, distances, 0, distances.length); in populateDynamicTables()
|
| /external/icu/icu4c/source/common/ |
| D | locdistance.cpp | 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()
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/tool/locale/ |
| D | LocaleDistanceBuilder.java | 352 void prune(int level, int[] distances) { in prune() argument
355 node.prune(level + 1, distances); in prune()
364 if (next.nodeDistance == distances[LocaleDistance.IX_DEF_SCRIPT_DISTANCE]) { in prune()
373 if (next.nodeDistance == distances[LocaleDistance.IX_DEF_REGION_DISTANCE]) { in prune()
597 int[] distances = new int[LocaleDistance.IX_LIMIT]; in build() local
599 distances[LocaleDistance.IX_DEF_LANG_DISTANCE] = node.nodeDistance; in build()
601 distances[LocaleDistance.IX_DEF_SCRIPT_DISTANCE] = node.nodeDistance; in build()
603 distances[LocaleDistance.IX_DEF_REGION_DISTANCE] = node.nodeDistance; in build()
604 distances[LocaleDistance.IX_MIN_REGION_DISTANCE] = minRegionDistance; in build()
606 defaultDistanceTable.prune(0, distances); in build()
[all …]
|
| /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/locale/ |
| D | LocaleDistanceBuilder.java | 349 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() local
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 …]
|
| /external/skqp/src/pathops/ |
| D | SkPathWriter.cpp | 187 DistanceLessThan(double* distances) : fDistances(distances) { } in DistanceLessThan() argument
277 SkSTArray<8, double, true> distances(entries); in assemble() local
290 distances.push_back(dist); // oStart distance from iStart in assemble()
296 SkTQSort<int>(sortedDist.begin(), sortedDist.end() - 1, DistanceLessThan(distances.begin())); in assemble()
|
| /external/skia/src/pathops/ |
| D | SkPathWriter.cpp | 187 DistanceLessThan(double* distances) : fDistances(distances) { } in DistanceLessThan() argument
274 SkSTArray<8, double, true> distances(entries); in assemble() local
287 distances.push_back(dist); // oStart distance from iStart in assemble()
293 SkTQSort<int>(sortedDist.begin(), sortedDist.end(), DistanceLessThan(distances.begin())); in assemble()
|
| /external/tensorflow/tensorflow/compiler/tf2xla/kernels/ |
| D | image_resize_ops.cc | 553 std::vector<int64> distances(out_size[dim] + 1); in GeneralCompile() local
555 for (int64 i = distances.size() - 2; i >= in_size[dim]; --i) { in GeneralCompile()
556 distances[i] = INT64_MAX; in GeneralCompile()
557 for (int64 j = i + 1; j < distances.size(); ++j) { in GeneralCompile()
558 int64 distance = pairwise_distance(i, j) + distances[j]; in GeneralCompile()
559 if (distance < distances[i]) { in GeneralCompile()
560 distances[i] = distance; in GeneralCompile()
|
| /external/tcpdump/ |
| D | print-egp.c | 138 int gateways, distances, networks; in egpnrprint() local
182 distances = *cp++; in egpnrprint()
190 while (--distances >= 0) { in egpnrprint()
|
| /external/tensorflow/tensorflow/core/ops/compat/ops_history_v2/ |
| D | KMC2ChainInitialization.pbtxt | 4 name: "distances"
|
| /external/tensorflow/tensorflow/core/ops/compat/ops_history_v1/ |
| D | KMC2ChainInitialization.pbtxt | 4 name: "distances"
|
| /external/tensorflow/tensorflow/core/kernels/ |
| D | clustering_ops_test.cc | 120 Tensor distances(DT_FLOAT, TensorShape({num_points})); in SetUpKMC2Initialization() local
122 distances.flat<float>().setRandom(); in SetUpKMC2Initialization()
127 .Input(test::graph::Constant(g, distances)) in SetUpKMC2Initialization()
|