32 std::vector< double > vals( 6, 0.0 );
36 bool result =
box.contains_point( vec.array(), tol );
38 result =
box.intersects_box( other_box, tol );
45 result =
box.contains_point( &vals[0], tol );
47 result =
box.intersects_box( other_box, tol );
52 box.update_max( three.array() );
53 result =
box.contains_point( three.array(), tol );
55 result =
box.contains_point( ( three * 1.1 ).array(), tol );
57 result =
box.intersects_box(
BoundBox( three, three ), tol );
59 result =
box.intersects_box(
BoundBox( 1.1 * three, 3.0 * three ), tol );
63 box.update_min( negthree.array() );
64 result =
box.contains_point( negthree.array(), tol );
66 result =
box.contains_point( ( negthree * 1.1 ).array(), tol );
68 result =
box.intersects_box(
BoundBox( negthree, negthree ), tol );
70 result =
box.intersects_box(
BoundBox( 3.0 * negthree, 1.1 * negthree ), tol );
73 for(
int i = 0; i < 3; i++ )
78 box.update( &vals[0] );
79 result =
box.contains_point( &vals[0], tol );
81 result =
box.contains_point( (
CartVect( &vals[0] ) * 1.1 ).array(), tol );
83 result =
box.intersects_box(
BoundBox( &vals[0] ), tol );
92 double diagsq =
box.diagonal_squared();
94 double diag =
box.diagonal_length();
100 vals[0] = vals[1] = 0.0;
102 double dist =
box.distance_squared(
CartVect( &vals[0] ).array() );
104 dist =
box.distance(
CartVect( &vals[0] ).array() );
109 vals[1] = vals[2] = 6.0;
110 dist =
box.distance_squared(
CartVect( &vals[0] ).array() );
112 dist =
box.distance(
CartVect( &vals[0] ).array() );
116 vals[0] = vals[1] = vals[2] = 6.0;
117 dist =
box.distance_squared(
CartVect( &vals[0] ).array() );
119 dist =
box.distance(
CartVect( &vals[0] ).array() );
134 result =
box.contains_point( &vals[0], tol );
138 result =
box.contains_point( &vals[0], tol );