Mercurial Hosting > traffic-intelligence
view trajectorymanagement/test/EuclideanMetricTest.cpp @ 1221:5a207c838323
correcting recursive errors
author | Nicolas Saunier <nicolas.saunier@polymtl.ca> |
---|---|
date | Mon, 19 Jun 2023 22:37:45 -0400 |
parents | e1e7acef8eab |
children |
line wrap: on
line source
#include "EuclideanMetricTest.h" void EuclideanMetricTest::setUp(void) { trajectoryA = new Trajectory<CvPoint> (); trajectoryB = new Trajectory<CvPoint> (); metric = new EuclideanMetric<CvPoint, double> (); } void EuclideanMetricTest::tearDown(void) { delete trajectoryA; delete trajectoryB; delete metric; trajectoryA = NULL; trajectoryB = NULL; metric = NULL; } void EuclideanMetricTest::testMetric1(void) { double result = double(0); CPPUNIT_ASSERT_THROW(metric->distance(trajectoryA, trajectoryB, result), TrajectoryLengthErrorException); } void EuclideanMetricTest::testMetric2(void) { double result = double(0); trajectoryA->add(cvPoint(0, 0)); trajectoryB->add(cvPoint(0, 0)); metric->distance(trajectoryA, trajectoryB, result); CPPUNIT_ASSERT_EQUAL(result, double(0)); } void EuclideanMetricTest::testMetric3(void) { double result = double(0); trajectoryA->add(cvPoint(0, 0)); trajectoryB->add(cvPoint(1, 1)); metric->distance(trajectoryA, trajectoryB, result); CPPUNIT_ASSERT_EQUAL(result, double(sqrt(2))); } void EuclideanMetricTest::testMetric4(void) { double result = double(0); trajectoryA->add(cvPoint(0, 0)); trajectoryB->add(cvPoint(3, 4)); metric->distance(trajectoryA, trajectoryB, result); CPPUNIT_ASSERT_EQUAL(result, double(5)); } void EuclideanMetricTest::testMetric5(void) { double result = double(0); trajectoryA->add(cvPoint(0, 0)); trajectoryA->add(cvPoint(-4, -3)); trajectoryB->add(cvPoint(3, 4)); trajectoryB->add(cvPoint(0, 0)); metric->distance(trajectoryA, trajectoryB, result); CPPUNIT_ASSERT_EQUAL(result, sqrt(double(50))); } void EuclideanMetricTest::testMetric6(void) { double result = double(0); unsigned n = 100; unsigned maxRand = 10000; srand(time(NULL)); for (unsigned i = 0; i < n; ++i) { unsigned rand1 = rand() % maxRand; unsigned rand2 = rand() % maxRand; trajectoryA->add(cvPoint(rand1, rand2)); trajectoryB ->add(cvPoint(rand1 + 3, rand2 + 4)); } metric->distance(trajectoryA, trajectoryB, result); CPPUNIT_ASSERT_EQUAL(result, sqrt(double(n * 9 + n * 16))); }