Home
last modified time | relevance | path

Searched refs:case_index (Results 1 – 5 of 5) sorted by relevance

/third_party/boost/libs/geometry/test/robustness/overlay/areal_areal/
Dgeneral_intersection_precision.cpp117 std::size_t case_index, std::size_t i, std::size_t j, in test_case() argument
128 switch (case_index) in test_case()
154 std::size_t test_all(std::size_t case_index, std::size_t min_vertex_index, in test_all() argument
165 = case_index == 1 ? case_a[1] in test_all()
166 : case_index == 2 ? case_b[1] in test_all()
167 : case_index == 3 ? case_c[1] in test_all()
189 case_index, i, j, in test_all()
197 std::cout << case_index in test_all()
/third_party/weston/tests/
Dweston-test-runner.c188 if (data->case_index == -1) { in for_each_test_case()
192 elem = data->case_index; in for_each_test_case()
422 harness->data.case_index = harness->case_ind; in weston_test_harness_create()
427 harness->data.case_index = -1; in weston_test_harness_create()
Dweston-testsuite-data.h70 int case_index; member
/third_party/boost/libs/geometry/test/algorithms/set_operations/union/
Dtest_union.hpp59 inline void check_input_validity(std::string const& caseid, int case_index, in check_input_validity() argument
66 << case_index << "] not valid" << std::endl in check_input_validity()
/third_party/mindspore/mindspore/ccsrc/transform/graph_ir/
Dconvert.cc790 const size_t case_index = 1; in GetCaseNodeInput() local
793 AnfNodePtr case_index_iter = input_node->input(case_index); in GetCaseNodeInput()