Project
Loading...
Searching...
No Matches
testTrackingTopology.cxx File Reference
#include <boost/test/tools/old/interface.hpp>
#include <boost/test/unit_test.hpp>
#include "ITStracking/TrackingTopology.h"

Go to the source code of this file.

Macros

#define BOOST_TEST_MODULE   ITS TrackingTopology
 
#define BOOST_TEST_MAIN
 
#define BOOST_TEST_DYN_LINK
 

Functions

 BOOST_AUTO_TEST_CASE (layermask_holes_and_length)
 -----— Tests -----—
 
 BOOST_AUTO_TEST_CASE (layermask_topological_length_counts_internal_holes)
 
 BOOST_AUTO_TEST_CASE (trackingtopology_basic)
 
 BOOST_AUTO_TEST_CASE (trackingtopology_max_cell_level_is_the_chain_depth)
 
 BOOST_AUTO_TEST_CASE (trackingtopology_max_cell_level_follows_the_longest_path)
 
 BOOST_AUTO_TEST_CASE (trackingtopology_predecessors_belong_to_one_layer_wave)
 
 BOOST_AUTO_TEST_CASE (trackingtopology_single_allowed_hole)
 
 BOOST_AUTO_TEST_CASE (trackingtopology_rejects_wrong_hole_layer)
 

Macro Definition Documentation

◆ BOOST_TEST_DYN_LINK

#define BOOST_TEST_DYN_LINK

Definition at line 15 of file testTrackingTopology.cxx.

◆ BOOST_TEST_MAIN

#define BOOST_TEST_MAIN

Definition at line 14 of file testTrackingTopology.cxx.

◆ BOOST_TEST_MODULE

#define BOOST_TEST_MODULE   ITS TrackingTopology

Definition at line 13 of file testTrackingTopology.cxx.

Function Documentation

◆ BOOST_AUTO_TEST_CASE() [1/8]

BOOST_AUTO_TEST_CASE ( layermask_holes_and_length  )

-----— Tests -----—

Definition at line 21 of file testTrackingTopology.cxx.

◆ BOOST_AUTO_TEST_CASE() [2/8]

BOOST_AUTO_TEST_CASE ( layermask_topological_length_counts_internal_holes  )

Definition at line 43 of file testTrackingTopology.cxx.

◆ BOOST_AUTO_TEST_CASE() [3/8]

BOOST_AUTO_TEST_CASE ( trackingtopology_basic  )

Definition at line 53 of file testTrackingTopology.cxx.

◆ BOOST_AUTO_TEST_CASE() [4/8]

BOOST_AUTO_TEST_CASE ( trackingtopology_max_cell_level_follows_the_longest_path  )

With a hole allowed the graph branches, and the depth is the longest path ending on a cell rather than its index. Every cell must still be reachable by at least one chain, and no cell may claim a level deeper than the number of cells that could precede it.

Definition at line 94 of file testTrackingTopology.cxx.

◆ BOOST_AUTO_TEST_CASE() [5/8]

BOOST_AUTO_TEST_CASE ( trackingtopology_max_cell_level_is_the_chain_depth  )

Without holes the cell graph is a single chain, so cell i - spanning layers i, i+1, i+2 - can only ever be reached by the i cells below it.

Definition at line 77 of file testTrackingTopology.cxx.

◆ BOOST_AUTO_TEST_CASE() [6/8]

BOOST_AUTO_TEST_CASE ( trackingtopology_predecessors_belong_to_one_layer_wave  )

Neighbour construction can finalize a target after one source-layer wave: every predecessor of a target ends on the destination layer of the target's first link.

Definition at line 115 of file testTrackingTopology.cxx.

◆ BOOST_AUTO_TEST_CASE() [7/8]

BOOST_AUTO_TEST_CASE ( trackingtopology_rejects_wrong_hole_layer  )

Definition at line 161 of file testTrackingTopology.cxx.

◆ BOOST_AUTO_TEST_CASE() [8/8]

BOOST_AUTO_TEST_CASE ( trackingtopology_single_allowed_hole  )

Definition at line 134 of file testTrackingTopology.cxx.