| /external/tensorflow/tensorflow/core/grappler/costs/ |
| D | robust_stats.cc | 65 const std::vector<double> &sorted_values) { in ScaledMedianAbsoluteDeviation() argument
66 double median = SortedMedian(sorted_values); in ScaledMedianAbsoluteDeviation()
71 deviations.reserve(sorted_values.size()); in ScaledMedianAbsoluteDeviation()
72 for (double d : sorted_values) { in ScaledMedianAbsoluteDeviation()
91 double UpdateHuberMean(const std::vector<double> &sorted_values, double mean, in UpdateHuberMean() argument
96 for (double d : sorted_values) { in UpdateHuberMean()
127 void RobustStats::HuberMAD(const std::vector<double> &sorted_values) { in HuberMAD() argument
129 ScaledMedianAbsoluteDeviation(sorted_values); in HuberMAD()
146 mean_ = UpdateHuberMean(sorted_values, mean_, margin); in HuberMAD()
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | hlo_alias_analysis.cc | 549 std::vector<const HloValue*> sorted_values(value_set.begin(), in Run() local
551 absl::c_sort(sorted_values, HloValue::IdLessThan); in Run()
552 alias_analysis->buffers_.emplace_back(next_id++, sorted_values); in Run()
553 for (const HloValue* value : sorted_values) { in Run()
|
| /external/libtextclassifier/abseil-cpp/absl/container/ |
| D | btree_test.cc | 602 std::vector<V> sorted_values(random_values); in BtreeTest() local
603 std::sort(sorted_values.begin(), sorted_values.end()); in BtreeTest()
604 DoTest("sorted: ", &container, sorted_values); in BtreeTest()
607 std::reverse(sorted_values.begin(), sorted_values.end()); in BtreeTest()
608 DoTest("rsorted: ", &container, sorted_values); in BtreeTest()
626 std::vector<V> sorted_values(random_values); in BtreeMultiTest() local
627 std::sort(sorted_values.begin(), sorted_values.end()); in BtreeMultiTest()
628 DoTest("sorted: ", &container, sorted_values); in BtreeMultiTest()
631 std::reverse(sorted_values.begin(), sorted_values.end()); in BtreeMultiTest()
632 DoTest("rsorted: ", &container, sorted_values); in BtreeMultiTest()
|
| /external/abseil-cpp/absl/container/ |
| D | btree_test.cc | 603 std::vector<V> sorted_values(random_values); in BtreeTest() local
604 std::sort(sorted_values.begin(), sorted_values.end()); in BtreeTest()
605 DoTest("sorted: ", &container, sorted_values); in BtreeTest()
608 std::reverse(sorted_values.begin(), sorted_values.end()); in BtreeTest()
609 DoTest("rsorted: ", &container, sorted_values); in BtreeTest()
627 std::vector<V> sorted_values(random_values); in BtreeMultiTest() local
628 std::sort(sorted_values.begin(), sorted_values.end()); in BtreeMultiTest()
629 DoTest("sorted: ", &container, sorted_values); in BtreeMultiTest()
632 std::reverse(sorted_values.begin(), sorted_values.end()); in BtreeMultiTest()
633 DoTest("rsorted: ", &container, sorted_values); in BtreeMultiTest()
|
| /external/openscreen/third_party/abseil/src/absl/container/ |
| D | btree_test.cc | 603 std::vector<V> sorted_values(random_values); in BtreeTest() local
604 std::sort(sorted_values.begin(), sorted_values.end()); in BtreeTest()
605 DoTest("sorted: ", &container, sorted_values); in BtreeTest()
608 std::reverse(sorted_values.begin(), sorted_values.end()); in BtreeTest()
609 DoTest("rsorted: ", &container, sorted_values); in BtreeTest()
627 std::vector<V> sorted_values(random_values); in BtreeMultiTest() local
628 std::sort(sorted_values.begin(), sorted_values.end()); in BtreeMultiTest()
629 DoTest("sorted: ", &container, sorted_values); in BtreeMultiTest()
632 std::reverse(sorted_values.begin(), sorted_values.end()); in BtreeMultiTest()
633 DoTest("rsorted: ", &container, sorted_values); in BtreeMultiTest()
|
| /external/webrtc/third_party/abseil-cpp/absl/container/ |
| D | btree_test.cc | 603 std::vector<V> sorted_values(random_values); in BtreeTest() local
604 std::sort(sorted_values.begin(), sorted_values.end()); in BtreeTest()
605 DoTest("sorted: ", &container, sorted_values); in BtreeTest()
608 std::reverse(sorted_values.begin(), sorted_values.end()); in BtreeTest()
609 DoTest("rsorted: ", &container, sorted_values); in BtreeTest()
627 std::vector<V> sorted_values(random_values); in BtreeMultiTest() local
628 std::sort(sorted_values.begin(), sorted_values.end()); in BtreeMultiTest()
629 DoTest("sorted: ", &container, sorted_values); in BtreeMultiTest()
632 std::reverse(sorted_values.begin(), sorted_values.end()); in BtreeMultiTest()
633 DoTest("rsorted: ", &container, sorted_values); in BtreeMultiTest()
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/ |
| D | btree_test.cc | 603 std::vector<V> sorted_values(random_values); in BtreeTest() local
604 std::sort(sorted_values.begin(), sorted_values.end()); in BtreeTest()
605 DoTest("sorted: ", &container, sorted_values); in BtreeTest()
608 std::reverse(sorted_values.begin(), sorted_values.end()); in BtreeTest()
609 DoTest("rsorted: ", &container, sorted_values); in BtreeTest()
627 std::vector<V> sorted_values(random_values); in BtreeMultiTest() local
628 std::sort(sorted_values.begin(), sorted_values.end()); in BtreeMultiTest()
629 DoTest("sorted: ", &container, sorted_values); in BtreeMultiTest()
632 std::reverse(sorted_values.begin(), sorted_values.end()); in BtreeMultiTest()
633 DoTest("rsorted: ", &container, sorted_values); in BtreeMultiTest()
|
| /external/angle/third_party/abseil-cpp/absl/container/ |
| D | btree_test.cc | 604 std::vector<V> sorted_values(random_values); in BtreeTest() local
605 std::sort(sorted_values.begin(), sorted_values.end()); in BtreeTest()
606 DoTest("sorted: ", &container, sorted_values); in BtreeTest()
609 std::reverse(sorted_values.begin(), sorted_values.end()); in BtreeTest()
610 DoTest("rsorted: ", &container, sorted_values); in BtreeTest()
628 std::vector<V> sorted_values(random_values); in BtreeMultiTest() local
629 std::sort(sorted_values.begin(), sorted_values.end()); in BtreeMultiTest()
630 DoTest("sorted: ", &container, sorted_values); in BtreeMultiTest()
633 std::reverse(sorted_values.begin(), sorted_values.end()); in BtreeMultiTest()
634 DoTest("rsorted: ", &container, sorted_values); in BtreeMultiTest()
|
| /external/nanopb-c/generator/ |
| D | nanopb_generator.py | 233 sorted_values = sorted(self.values, key = lambda x: (x[1], x[0]))
235 result += '\n#define _%s_MIN %s' % (self.names, sorted_values[0][0])
236 result += '\n#define _%s_MAX %s' % (self.names, sorted_values[-1][0])
237 … result += '\n#define _%s_ARRAYSIZE ((%s)(%s+1))' % (self.names, self.names, sorted_values[-1][0])
|
| /external/tensorflow/tensorflow/python/kernel_tests/ |
| D | lookup_ops_test.py | 2954 sorted_values = np.sort(self.evaluate(exported_values))
2956 self.assertAllEqual([0, 1, 2], sorted_values)
3180 sorted_values = np.sort(self.evaluate(exported_values), axis=0)
3183 self.assertAllEqual(sorted_expected_values, sorted_values)
|
| /external/tensorflow/tensorflow/go/op/ |
| D | wrappers.go | 44562 …(scope *Scope, keys tf.Output, values tf.Output) (sorted_keys tf.Output, sorted_values tf.Output) {
|
| /external/tensorflow/tensorflow/compiler/mlir/tensorflow/ir/ |
| D | tf_generated_ops.td | 19236 Res<TF_Tensor, [{A `Tensor` of type V.}]>:$sorted_values
|