| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/ranking/ |
| D | NaturalRanking.java | 193 IntDoublePair[] ranks = new IntDoublePair[data.length]; in rank() local
195 ranks[i] = new IntDoublePair(data[i], i); in rank()
202 recodeNaNs(ranks, Double.POSITIVE_INFINITY); in rank()
205 recodeNaNs(ranks, Double.NEGATIVE_INFINITY); in rank()
208 ranks = removeNaNs(ranks); in rank()
211 nanPositions = getNanPositions(ranks); in rank()
218 Arrays.sort(ranks); in rank()
222 double[] out = new double[ranks.length]; in rank()
224 out[ranks[0].getPosition()] = pos; in rank()
226 tiesTrace.add(ranks[0].getPosition()); in rank()
[all …]
|
| /external/harfbuzz_ng/src/ |
| D | gen-tag-table.py | 345 self.ranks = collections.defaultdict (int)
384 self.ranks[tag] = rank
482 self.ranks[ot_macrolanguage] += 1
505 key=lambda t: (self.ranks[t] + rank_delta (language, t), t))
661 ot.ranks['BAL'] = ot.ranks['KAR'] + 1
674 ot.ranks['FNE'] = ot.ranks['TNE'] + 1
688 ot.ranks['GUK'] = ot.ranks['GMZ'] + 1
697 ot.ranks['KHN'] = ot.ranks['KHT']
698 ot.ranks['KHT'] += 1
700 ot.ranks['LCR'] = ot.ranks['MCR'] + 1
[all …]
|
| /external/tensorflow/tensorflow/python/ops/ |
| D | check_ops.py | 1265 x, ranks, static_condition, dynamic_condition, data, summarize):
1286 for rank in ranks:
1290 ranks_static = tuple([tensor_util.constant_value(rank) for rank in ranks])
1303 condition = dynamic_condition(array_ops.rank(x), ranks)
1307 for rank, rank_static in zip(ranks, ranks_static):
1317 def assert_rank_in_v2(x, ranks, message=None, name=None): argument
1336 assert_rank_in(x=x, ranks=ranks, message=message, name=name)
1342 x, ranks, data=None, summarize=None, message=None, name=None): argument
1370 name, 'assert_rank_in', (x,) + tuple(ranks) + tuple(data or [])):
1372 ranks = tuple([ops.convert_to_tensor(rank, name='rank') for rank in ranks])
[all …]
|
| D | custom_gradient.py | 70 ranks = [len(s.dim) if not s.unknown_rank else -1 for s in shapes]
76 shapes, ranks, types)
|
| D | variables.py | 2952 ranks = []
2955 ranks.append(array_ops.rank_internal(var, optimize=False))
2956 if len(ranks) == 1:
2957 return ranks[0]
2959 return array_ops.stack(ranks)
|
| /external/tensorflow/tensorflow/contrib/constrained_optimization/python/ |
| D | candidates.py | 302 ranks = scipy.stats.rankdata(
304 maximum_ranks = np.maximum(maximum_ranks, ranks)
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_DeserializeManySparse.pbtxt | 20 `SerializeSparse`. The ranks of the original `SparseTensor` objects
22 higher than the ranks of the incoming `SparseTensor` objects
|
| D | api_def_TakeManySparseFromTensorsMap.pbtxt | 53 `AddSparseToTensorsMap` or `AddManySparseToTensorsMap`. The ranks of the
56 higher than the ranks of the incoming `SparseTensor` objects
|
| D | api_def_Concat.pbtxt | 14 The `N` Tensors to concatenate. Their ranks and types must match,
|
| D | api_def_ConcatV2.pbtxt | 9 List of `N` Tensors to concatenate. Their ranks and types must match,
|
| D | api_def_QuantizedConcat.pbtxt | 13 The `N` Tensors to concatenate. Their ranks and types must match,
|
| D | api_def_DeserializeSparse.pbtxt | 20 dimensions (N >= 0) correspond to a batch. The ranks of the original
|
| D | api_def_PaddingFIFOQueueV2.pbtxt | 28 different ranks and shapes, but only one element may be dequeued at a time.
|
| D | api_def_PaddingFIFOQueue.pbtxt | 26 different ranks and shapes, but only one element may be dequeued at a time.
|
| /external/u-boot/arch/x86/dts/ |
| D | chromebook_samus.dts | 290 * banks 8, ranks 2, rows 14,
364 * banks 8, ranks 2, rows 14,
403 * banks 8, ranks 2, rows 15,
442 * banks 8, ranks 2, rows 15,
|
| /external/swiftshader/third_party/LLVM/utils/TableGen/ |
| D | X86DisassemblerTables.cpp | 119 static int ranks[IC_max] = { in outranks() local
124 return (ranks[upper] > ranks[lower]); in outranks()
|
| /external/tensorflow/tensorflow/compiler/xla/g3doc/ |
| D | broadcasting.md | 13 different ranks, or between multi-dimensional arrays with different but
43 between arrays of different ranks is required. This is different from Numpy,
59 binary operation. When the inputs to the operation have different ranks, this
|
| /external/tensorflow/tensorflow/python/client/ |
| D | tf_session_helper.cc | 635 const std::vector<int>& ranks, const std::vector<TF_DataType>& types, in TF_GraphSetOutputHandleShapesAndTypes_wrapper() argument
639 shapes_pointers[i] = ranks[i] <= 0 ? nullptr : &shapes[i][0]; in TF_GraphSetOutputHandleShapesAndTypes_wrapper()
642 shapes_pointers.data(), ranks.data(), in TF_GraphSetOutputHandleShapesAndTypes_wrapper()
|
| D | tf_session_helper.h | 228 const std::vector<int>& ranks, const std::vector<TF_DataType>& types,
|
| /external/tensorflow/tensorflow/c/ |
| D | c_api_internal.h | 224 const int* ranks,
|
| /external/tensorflow/tensorflow/compiler/jit/graphcycles/ |
| D | graphcycles.cc | 87 NodeSet ranks; // Set of ranks seen so far. in CheckInvariants() local
93 if (!ranks.insert(nx->rank).second) { in CheckInvariants()
|
| /external/llvm/utils/TableGen/ |
| D | X86DisassemblerTables.cpp | 372 static int ranks[IC_max] = { in outranks() local
378 return (ranks[upper] > ranks[lower]); in outranks()
|
| /external/tensorflow/tensorflow/tools/api/golden/v2/ |
| D | tensorflow.debugging.pbtxt | 73 …argspec: "args=[\'x\', \'ranks\', \'message\', \'name\'], varargs=None, keywords=None, defaults=[\…
|
| /external/tensorflow/tensorflow/tools/api/golden/v1/ |
| D | tensorflow.debugging.pbtxt | 73 …argspec: "args=[\'x\', \'ranks\', \'data\', \'summarize\', \'message\', \'name\'], varargs=None, k…
|
| /external/swiftshader/third_party/llvm-7.0/llvm/utils/TableGen/ |
| D | X86DisassemblerTables.cpp | 581 static int ranks[IC_max] = { in outranks() local
587 return (ranks[upper] > ranks[lower]); in outranks()
|