test_sch_rtree.cpp File Reference

Test suite for SCH_SHEET. More...

#include <convert_to_biu.h>
#include <ignore.h>
#include <sch_junction.h>
#include <sch_no_connect.h>
#include <qa_utils/wx_utils/unit_test_utils.h>
#include <sch_rtree.h>
#include "uuid_test_utils.h"
#include <qa_utils/wx_utils/wx_assert.h>

Go to the source code of this file.

Classes
class	TEST_SCH_RTREE_FIXTURE

Functions
	BOOST_AUTO_TEST_CASE (Default)
	Declare the test suite. More...
	BOOST_AUTO_TEST_CASE (Junctions)
	BOOST_AUTO_TEST_CASE (MixedElements)
	BOOST_AUTO_TEST_CASE (SingleElementTree)

Detailed Description

Test suite for SCH_SHEET.

Definition in file test_sch_rtree.cpp.

Function Documentation

BOOST_AUTO_TEST_CASE() [1/4]

BOOST_AUTO_TEST_CASE

(

Default

)

Declare the test suite.

Check default iterators

Definition at line 62 of file test_sch_rtree.cpp.

{
 BOOST_CHECK_EQUAL( m_tree.empty(), true );
 
 int count = 0;
 for( auto item : m_tree )
 {
 ignore_unused( item );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 0 );
 
 for( int type = 0; type <= MAX_STRUCT_TYPE_ID; type++ )
 {
 count = 0;
 for( auto item : m_tree.OfType( KICAD_T( type ) ) )
 {
 ignore_unused( item );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 0 );
 }
 
 EDA_RECT bbox;
 
 for( int type = 0; type <= MAX_STRUCT_TYPE_ID; type++ )
 {
 count = 0;
 for( auto item : m_tree.Overlapping( SCH_JUNCTION_T, bbox ) )
 {
 ignore_unused( item );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 0 );
 }
}

References ignore_unused(), MAX_STRUCT_TYPE_ID, and SCH_JUNCTION_T.

BOOST_AUTO_TEST_CASE() [2/4]

BOOST_AUTO_TEST_CASE

(

Junctions

)

Definition at line 102 of file test_sch_rtree.cpp.

{
 for( int i = 0; i < 100; i++ )
 {
 SCH_JUNCTION* junction =
 new SCH_JUNCTION( VECTOR2I( Mils2iu( 100 ) * i, Mils2iu( 100 ) * i ) );
 m_tree.insert( junction );
 }
 
 int count = 0;
 
 for( auto item : m_tree.OfType( SCH_JUNCTION_T ) )
 {
 ignore_unused( item );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 100 );
 
 count = 0;
 for( auto item : m_tree.OfType( SCH_NO_CONNECT_T ) )
 {
 ignore_unused( item );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 0 );
 
 EDA_RECT small_bbox( VECTOR2I( -1, -1 ), VECTOR2I( Mils2iu( 2 ), Mils2iu( 2 ) ) );
 EDA_RECT med_bbox( VECTOR2I( 0, 0 ), VECTOR2I( Mils2iu( 100 ), Mils2iu( 100 ) ) );
 EDA_RECT big_bbox( VECTOR2I( 0, 0 ), VECTOR2I( Mils2iu( 5000 ), Mils2iu( 5000 ) ) );
 
 count = 0;
 for( auto item : m_tree.Overlapping( small_bbox ) )
 {
 BOOST_CHECK( small_bbox.Intersects( item->GetBoundingBox() ) );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 1 );
 
 count = 0;
 for( auto item : m_tree.Overlapping( SCH_JUNCTION_T, small_bbox ) )
 {
 BOOST_CHECK( small_bbox.Intersects( item->GetBoundingBox() ) );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 1 );
 
 count = 0;
 for( auto item : m_tree.Overlapping( SCH_NO_CONNECT_T, small_bbox ) )
 {
 BOOST_CHECK( small_bbox.Intersects( item->GetBoundingBox() ) );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 0 );
 
 count = 0;
 for( auto item : m_tree.Overlapping( med_bbox ) )
 {
 BOOST_CHECK( med_bbox.Intersects( item->GetBoundingBox() ) );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 2 );
 
 count = 0;
 for( auto item : m_tree.Overlapping( big_bbox ) )
 {
 BOOST_CHECK( big_bbox.Intersects( item->GetBoundingBox() ) );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 51 );
 
 for( SCH_ITEM* item : m_tree )
 delete item;
}

References BOOST_CHECK(), ignore_unused(), EDA_RECT::Intersects(), SCH_JUNCTION_T, and SCH_NO_CONNECT_T.

BOOST_AUTO_TEST_CASE() [3/4]

BOOST_AUTO_TEST_CASE

(

MixedElements

)

Definition at line 183 of file test_sch_rtree.cpp.

{
 for( int i = 0; i < 100; i++ )
 {
 int x_sign = ( i % 2 == 0 ) ? -1 : 1;
 int y_sign = ( i % 3 == 0 ) ? -1 : 1;
 
 SCH_JUNCTION* junction = new SCH_JUNCTION(
 VECTOR2I( Mils2iu( 100 ) * i * x_sign, Mils2iu( 100 ) * i * y_sign ) );
 m_tree.insert( junction );
 
 SCH_NO_CONNECT* nc = new SCH_NO_CONNECT(
 VECTOR2I( Mils2iu( 150 ) * i * y_sign, Mils2iu( 150 ) * i * x_sign ) );
 m_tree.insert( nc );
 }
 
 int count = 0;
 
 for( auto item : m_tree.OfType( SCH_JUNCTION_T ) )
 {
 ignore_unused( item );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 100 );
 
 count = 0;
 for( auto item : m_tree.OfType( SCH_NO_CONNECT_T ) )
 {
 ignore_unused( item );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 100 );
 
 EDA_RECT small_bbox( VECTOR2I( -1, -1 ), VECTOR2I( Mils2iu( 2 ), Mils2iu( 2 ) ) );
 
 count = 0;
 for( auto item : m_tree.Overlapping( small_bbox ) )
 {
 BOOST_CHECK( small_bbox.Intersects( item->GetBoundingBox() ) );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 2 );
 
 count = 0;
 for( auto item : m_tree.Overlapping( SCH_JUNCTION_T, small_bbox ) )
 {
 BOOST_CHECK( small_bbox.Intersects( item->GetBoundingBox() ) );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 1 );
 
 count = 0;
 for( auto item : m_tree.Overlapping( SCH_NO_CONNECT_T, small_bbox ) )
 {
 BOOST_CHECK( small_bbox.Intersects( item->GetBoundingBox() ) );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 1 );
 
 for( SCH_ITEM* item : m_tree )
 delete item;
}

References BOOST_CHECK(), ignore_unused(), EDA_RECT::Intersects(), SCH_JUNCTION_T, and SCH_NO_CONNECT_T.

BOOST_AUTO_TEST_CASE() [4/4]

BOOST_AUTO_TEST_CASE

(

SingleElementTree

)

Definition at line 253 of file test_sch_rtree.cpp.

{
 SCH_JUNCTION* junction = new SCH_JUNCTION( VECTOR2I( Mils2iu( 100 ), Mils2iu( 100 ) ) );
 m_tree.insert( junction );
 
 SCH_NO_CONNECT* nc = new SCH_NO_CONNECT( VECTOR2I( Mils2iu( 150 ), Mils2iu( 150 ) ) );
 m_tree.insert( nc );
 
 int count = 0;
 
 for( auto item : m_tree.OfType( SCH_JUNCTION_T ) )
 {
 ignore_unused( item );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 1 );
 
 count = 0;
 for( auto item : m_tree.OfType( SCH_NO_CONNECT_T ) )
 {
 ignore_unused( item );
 count++;
 }
 
 BOOST_CHECK_EQUAL( count, 1 );
 
 for( SCH_ITEM* item : m_tree )
 delete item;
}

References ignore_unused(), SCH_JUNCTION_T, and SCH_NO_CONNECT_T.