MCPcopy Create free account
hub / github.com/davisking/dlib / test_segment_number_line

Function test_segment_number_line

dlib/test/clustering.cpp:306–341  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

304 }
305
306 void test_segment_number_line()
307 {
308 dlib::rand rnd;
309
310
311 std::vector<double> x;
312 for (int i = 0; i < 5000; ++i)
313 {
314 x.push_back(rnd.get_double_in_range(-1.5, -1.01));
315 x.push_back(rnd.get_double_in_range(-0.99, -0.01));
316 x.push_back(rnd.get_double_in_range(0.01, 1));
317 }
318
319 auto r = segment_number_line(x,1);
320 std::sort(r.begin(), r.end());
321 DLIB_TEST(r.size() == 3);
322 DLIB_TEST(-1.5 <= r[0].lower && r[0].lower < r[0].upper && r[0].upper <= -1.01);
323 DLIB_TEST(-0.99 <= r[1].lower && r[1].lower < r[1].upper && r[1].upper <= -0.01);
324 DLIB_TEST(0.01 <= r[2].lower && r[2].lower < r[2].upper && r[2].upper <= 1);
325
326 x.clear();
327 for (int i = 0; i < 5000; ++i)
328 {
329 x.push_back(rnd.get_double_in_range(-2, 1));
330 x.push_back(rnd.get_double_in_range(-2, 1));
331 x.push_back(rnd.get_double_in_range(-2, 1));
332 }
333
334 r = segment_number_line(x,1);
335 DLIB_TEST(r.size() == 3);
336 r = segment_number_line(x,1.5);
337 DLIB_TEST(r.size() == 2);
338 r = segment_number_line(x,10.5);
339 DLIB_TEST(r.size() == 1);
340 DLIB_TEST(-2 <= r[0].lower && r[0].lower < r[0].upper && r[0].upper <= 1);
341 }
342
343 class test_clustering : public tester
344 {

Callers 1

perform_testMethod · 0.85

Calls 7

segment_number_lineFunction · 0.85
get_double_in_rangeMethod · 0.80
push_backMethod · 0.45
beginMethod · 0.45
endMethod · 0.45
sizeMethod · 0.45
clearMethod · 0.45

Tested by

no test coverage detected