Scroom 0.14-48-ga0fee447
Loading...
Searching...
No Matches
rectangletests.cc File Reference
#include <gtest/gtest.h>
#include <scroom/gtk-helpers.hh>
#include <scroom/linearsegment.hh>
#include <scroom/rectangle.hh>
Include dependency graph for rectangletests.cc:

Classes

class  RectangleHorizontalTestScaffold
 
class  RectangleVerticalTestScaffold
 
class  Rectangle_and_Segment_TypedTests< ScaffoldT >
 

Typedefs

using ScaffoldTypes = ::testing::Types< Segment< int >, RectangleHorizontalTestScaffold, RectangleVerticalTestScaffold >
 

Functions

template<class Scaffold >
void containedSegmentEqualsIntersection (const Scaffold &container, const Scaffold &contained)
 
template<class Scaffold >
void intersectsImpliesNonEmptyIntersection (const Scaffold &a, const Scaffold &b)
 
 TYPED_TEST_SUITE (Rectangle_and_Segment_TypedTests, ScaffoldTypes)
 
Scaffold s2 (2, 5)
 
Scaffold s4 (2, 5)
 
Scaffold s5 (3, 5)
 
Scaffold s6 (2, 6)
 
Scaffold s7 (7, -5)
 
 EXPECT_TRUE (s1.isEmpty())
 
 EXPECT_EQ (0, s1.getSize())
 
 EXPECT_FALSE (s2.isEmpty())
 
 EXPECT_TRUE (s3.isEmpty())
 
 EXPECT_FALSE (s4.isEmpty())
 
 EXPECT_FALSE (s5.isEmpty())
 
 EXPECT_FALSE (s6.isEmpty())
 
 EXPECT_EQ (2, s2.getStart())
 
 EXPECT_EQ (5, s2.getSize())
 
 EXPECT_EQ (7, s2.getEnd())
 
 EXPECT_TRUE (s1==s3)
 
 EXPECT_TRUE (s2==s4)
 
 EXPECT_TRUE (s1 !=s2)
 
 EXPECT_TRUE (s2 !=s5)
 
 EXPECT_EQ (2, s7.getStart())
 
 EXPECT_EQ (5, s7.getSize())
 
 EXPECT_EQ (7, s7.getEnd())
 
 EXPECT_EQ (s2, s7)
 
Scaffold orig (2, 5)
 
 EXPECT_FALSE (s.isEmpty())
 
 EXPECT_EQ (5, s.getStart())
 
 EXPECT_EQ (10, s.getEnd())
 
Scaffold s (2, 10)
 
s reduceSizeToMultipleOf (5)
 
 EXPECT_EQ (2, s.getStart())
 
s reduceSizeToMultipleOf (3)
 
 EXPECT_EQ (9, s.getSize())
 
 EXPECT_FALSE (s1.contains(0))
 
 EXPECT_FALSE (s2.contains(0))
 
 EXPECT_TRUE (s2.contains(2))
 
 EXPECT_TRUE (s2.contains(6))
 
 EXPECT_FALSE (s2.contains(7))
 
 EXPECT_FALSE (s2.contains(8))
 
Scaffold s2 (-1, 3)
 
Scaffold s3 (-3, 2)
 
Scaffold s4 (-2, 2)
 
Scaffold s5 (-1, 2)
 
Scaffold s6 (0, 2)
 
Scaffold s7 (1, 2)
 
Scaffold s8 (2, 2)
 
 EXPECT_FALSE (s1.contains(s2))
 
 containedSegmentEqualsIntersection (s1, s2)
 
 EXPECT_FALSE (s1.contains(s3))
 
 containedSegmentEqualsIntersection (s1, s3)
 
 EXPECT_FALSE (s1.contains(s4))
 
 containedSegmentEqualsIntersection (s1, s4)
 
 EXPECT_FALSE (s1.contains(s5))
 
 containedSegmentEqualsIntersection (s1, s5)
 
 EXPECT_FALSE (s1.contains(s6))
 
 containedSegmentEqualsIntersection (s1, s6)
 
 EXPECT_FALSE (s1.contains(s7))
 
 containedSegmentEqualsIntersection (s1, s7)
 
 EXPECT_FALSE (s1.contains(s8))
 
 containedSegmentEqualsIntersection (s1, s8)
 
 EXPECT_TRUE (s2.contains(s1))
 
 containedSegmentEqualsIntersection (s2, s1)
 
 EXPECT_FALSE (s2.contains(s3))
 
 containedSegmentEqualsIntersection (s2, s3)
 
 EXPECT_FALSE (s2.contains(s4))
 
 containedSegmentEqualsIntersection (s2, s4)
 
 EXPECT_TRUE (s2.contains(s5))
 
 containedSegmentEqualsIntersection (s2, s5)
 
 EXPECT_TRUE (s2.contains(s6))
 
 containedSegmentEqualsIntersection (s2, s6)
 
 EXPECT_FALSE (s2.contains(s7))
 
 containedSegmentEqualsIntersection (s2, s7)
 
 EXPECT_FALSE (s2.contains(s8))
 
 containedSegmentEqualsIntersection (s2, s8)
 
 intersectsImpliesNonEmptyIntersection (s1, s2)
 
 intersectsImpliesNonEmptyIntersection (s1, s3)
 
 intersectsImpliesNonEmptyIntersection (s1, s4)
 
 intersectsImpliesNonEmptyIntersection (s1, s5)
 
 intersectsImpliesNonEmptyIntersection (s1, s6)
 
 intersectsImpliesNonEmptyIntersection (s1, s7)
 
 intersectsImpliesNonEmptyIntersection (s1, s8)
 
 EXPECT_FALSE (s2.intersects(s1))
 
 intersectsImpliesNonEmptyIntersection (s2, s1)
 
 intersectsImpliesNonEmptyIntersection (s2, s3)
 
 EXPECT_TRUE (s2.intersects(s4))
 
 intersectsImpliesNonEmptyIntersection (s2, s4)
 
 intersectsImpliesNonEmptyIntersection (s2, s5)
 
 intersectsImpliesNonEmptyIntersection (s2, s6)
 
 EXPECT_TRUE (s2.intersects(s7))
 
 intersectsImpliesNonEmptyIntersection (s2, s7)
 
 intersectsImpliesNonEmptyIntersection (s2, s8)
 
 EXPECT_TRUE (s1.intersection(s2).isEmpty())
 
 EXPECT_TRUE (s1.intersection(s3).isEmpty())
 
 EXPECT_TRUE (s1.intersection(s4).isEmpty())
 
 EXPECT_TRUE (s1.intersection(s5).isEmpty())
 
 EXPECT_TRUE (s1.intersection(s6).isEmpty())
 
 EXPECT_TRUE (s1.intersection(s7).isEmpty())
 
 EXPECT_TRUE (s1.intersection(s8).isEmpty())
 
 EXPECT_TRUE (s2.intersection(s1).isEmpty())
 
 EXPECT_TRUE (s2.intersection(s3).isEmpty())
 
 EXPECT_EQ (Scaffold(-1, 1), s2.intersection(s4))
 
 EXPECT_EQ (s5, s2.intersection(s5))
 
 EXPECT_EQ (s6, s2.intersection(s6))
 
 EXPECT_EQ (Scaffold(1, 1), s2.intersection(s7))
 
 EXPECT_TRUE (s2.intersection(s8).isEmpty())
 
 EXPECT_EQ (make_segment(1, 3), r.getHorizontally())
 
 EXPECT_EQ (make_segment(2, 4), r.getVertically())
 
 EXPECT_EQ (make_rect(1, 2, 3, 4), rect)
 
 EXPECT_EQ (original, grect)
 
 EXPECT_EQ (make_point(1, 2), rect.getTopLeft())
 
 EXPECT_EQ (make_point(4, 2), rect.getTopRight())
 
 EXPECT_EQ (make_point(1, 6), rect.getBottomLeft())
 
 EXPECT_EQ (make_point(4, 6), rect.getBottomRight())
 
 EXPECT_EQ (make_point(4, 6) - make_point(1, 2), make_point(3, 4))
 
 EXPECT_EQ (make_point(2, 4), make_point(1, 2) *2)
 
 EXPECT_EQ (make_rect(6, 8, 3, 4), make_point(5, 6)+make_rect(1, 2, 3, 4))
 
 EXPECT_EQ (make_rect(6, 8, 3, 4) - make_point(5, 6), make_rect(1, 2, 3, 4))
 
 EXPECT_NEAR (0.5, result.getLeft(), 1e-6)
 
 EXPECT_NEAR (2.5, result.getWidth(), 1e-6)
 
 EXPECT_NEAR (1.5, result.getTop(), 1e-6)
 
 EXPECT_NEAR (3.5, result.getHeight(), 1e-6)
 
 EXPECT_TRUE (original.leftOf(5).isEmpty())
 
 EXPECT_EQ (original, original.leftOf(40))
 
 EXPECT_EQ (Rectangle< int >(10, 20, 10, 40), original.leftOf(20))
 
 EXPECT_TRUE (original.rightOf(40).isEmpty())
 
 EXPECT_EQ (original, original.rightOf(5))
 
 EXPECT_EQ (Rectangle< int >(20, 20, 20, 40), original.rightOf(20))
 
 EXPECT_EQ (original, original.above(60))
 
 EXPECT_EQ (Rectangle< int >(10, 20, 30, 20), original.above(40))
 
 EXPECT_TRUE (original.below(60).isEmpty())
 
 EXPECT_EQ (original, original.below(20))
 
 EXPECT_EQ (Rectangle< int >(10, 40, 30, 20), original.below(40))
 
 EXPECT_EQ (Rectangle< int >(10, 30, 5, 5), original.leftOf(Rectangle< int >(15, 30, 10, 5)))
 
 EXPECT_EQ (Rectangle< int >(10, 20, 10, 40), original.above(Rectangle< int >(0, 100, 20, 10)))
 
 EXPECT_EQ (expected, result)
 
Segment< int > const expected (-3, 3)
 
Segment< int > const expected (35, 15)
 
Segment< int > const expected (3, 2)
 

Variables

Scaffold s1
 
Scaffold s3
 
Scaffold s = orig.moveTo(5)
 
const auto rect = Rectangle<int>(original)
 
const GdkRectangle grect = rect.toGdkRectangle()
 
auto result = 0.5 * make_rect(1, 3, 5, 7)
 
Segment< int > const expected (12, 3)
 
Segment< int > const right (3, 7)
 

Typedef Documentation

◆ ScaffoldTypes

Function Documentation

◆ containedSegmentEqualsIntersection() [1/15]

template<class Scaffold >
void containedSegmentEqualsIntersection ( const Scaffold &  container,
const Scaffold &  contained 
)
107{
108 if(container.contains(contained))
109 {
110 EXPECT_EQ(contained, container.intersection(contained));
111 EXPECT_EQ(contained, contained.intersection(container));
112 }
113}
EXPECT_EQ(0, s1.getSize())
Here is the call graph for this function:

◆ containedSegmentEqualsIntersection() [2/15]

containedSegmentEqualsIntersection ( s1  ,
s2   
)

◆ containedSegmentEqualsIntersection() [3/15]

containedSegmentEqualsIntersection ( s1  ,
s3   
)

◆ containedSegmentEqualsIntersection() [4/15]

containedSegmentEqualsIntersection ( s1  ,
s4   
)

◆ containedSegmentEqualsIntersection() [5/15]

containedSegmentEqualsIntersection ( s1  ,
s5   
)

◆ containedSegmentEqualsIntersection() [6/15]

containedSegmentEqualsIntersection ( s1  ,
s6   
)

◆ containedSegmentEqualsIntersection() [7/15]

containedSegmentEqualsIntersection ( s1  ,
s7   
)

◆ containedSegmentEqualsIntersection() [8/15]

containedSegmentEqualsIntersection ( s1  ,
s8   
)

◆ containedSegmentEqualsIntersection() [9/15]

containedSegmentEqualsIntersection ( s2  ,
s1   
)

◆ containedSegmentEqualsIntersection() [10/15]

containedSegmentEqualsIntersection ( s2  ,
s3   
)

◆ containedSegmentEqualsIntersection() [11/15]

containedSegmentEqualsIntersection ( s2  ,
s4   
)

◆ containedSegmentEqualsIntersection() [12/15]

containedSegmentEqualsIntersection ( s2  ,
s5   
)

◆ containedSegmentEqualsIntersection() [13/15]

containedSegmentEqualsIntersection ( s2  ,
s6   
)

◆ containedSegmentEqualsIntersection() [14/15]

containedSegmentEqualsIntersection ( s2  ,
s7   
)

◆ containedSegmentEqualsIntersection() [15/15]

containedSegmentEqualsIntersection ( s2  ,
s8   
)

◆ EXPECT_EQ() [1/39]

EXPECT_EQ ( ,
s1.  getSize() 
)

Referenced by containedSegmentEqualsIntersection(), and intersectsImpliesNonEmptyIntersection().

Here is the caller graph for this function:

◆ EXPECT_EQ() [2/39]

EXPECT_EQ ( 10  ,
s.  getEnd() 
)

◆ EXPECT_EQ() [3/39]

EXPECT_EQ ( ,
s.  getStart() 
)

◆ EXPECT_EQ() [4/39]

EXPECT_EQ ( ,
s2.  getStart() 
)

◆ EXPECT_EQ() [5/39]

EXPECT_EQ ( ,
s7.  getStart() 
)

◆ EXPECT_EQ() [6/39]

EXPECT_EQ ( ,
s.  getStart() 
)

◆ EXPECT_EQ() [7/39]

EXPECT_EQ ( ,
s2.  getSize() 
)

◆ EXPECT_EQ() [8/39]

EXPECT_EQ ( ,
s7.  getSize() 
)

◆ EXPECT_EQ() [9/39]

EXPECT_EQ ( ,
s2.  getEnd() 
)

◆ EXPECT_EQ() [10/39]

EXPECT_EQ ( ,
s7.  getEnd() 
)

◆ EXPECT_EQ() [11/39]

EXPECT_EQ ( ,
s.  getSize() 
)

◆ EXPECT_EQ() [12/39]

EXPECT_EQ ( expected  ,
result   
)

◆ EXPECT_EQ() [13/39]

EXPECT_EQ ( make_point(1, 2)  ,
rect.  getTopLeft() 
)

◆ EXPECT_EQ() [14/39]

EXPECT_EQ ( make_point(1, 6)  ,
rect.  getBottomLeft() 
)

◆ EXPECT_EQ() [15/39]

EXPECT_EQ ( make_point(2, 4)  ,
make_point(1, 2) *  2 
)

◆ EXPECT_EQ() [16/39]

EXPECT_EQ ( make_point(4, 2)  ,
rect.  getTopRight() 
)

◆ EXPECT_EQ() [17/39]

EXPECT_EQ ( make_point(4, 6) - make_point(1, 2)  ,
make_point(3, 4)   
)

◆ EXPECT_EQ() [18/39]

EXPECT_EQ ( make_point(4, 6)  ,
rect.  getBottomRight() 
)

◆ EXPECT_EQ() [19/39]

EXPECT_EQ ( make_rect(1, 2, 3, 4)  ,
rect   
)

◆ EXPECT_EQ() [20/39]

EXPECT_EQ ( make_rect(6, 8, 3, 4) - make_point(5, 6)  ,
make_rect(1, 2, 3, 4)   
)

◆ EXPECT_EQ() [21/39]

EXPECT_EQ ( make_rect(6, 8, 3, 4)  ,
make_point(5, 6)+make_rect(1, 2, 3, 4)   
)

◆ EXPECT_EQ() [22/39]

EXPECT_EQ ( make_segment(1, 3)  ,
r.  getHorizontally() 
)

◆ EXPECT_EQ() [23/39]

EXPECT_EQ ( make_segment(2, 4)  ,
r.  getVertically() 
)

◆ EXPECT_EQ() [24/39]

EXPECT_EQ ( original  ,
grect   
)

◆ EXPECT_EQ() [25/39]

EXPECT_EQ ( original  ,
original.  above60 
)

◆ EXPECT_EQ() [26/39]

EXPECT_EQ ( original  ,
original.  below20 
)

◆ EXPECT_EQ() [27/39]

EXPECT_EQ ( original  ,
original.  leftOf40 
)

◆ EXPECT_EQ() [28/39]

EXPECT_EQ ( original  ,
original.  rightOf
)

◆ EXPECT_EQ() [29/39]

EXPECT_EQ ( Rectangle< int >  10, 20, 10, 40,
original.  aboveRectangle< int >(0, 100, 20, 10) 
)

◆ EXPECT_EQ() [30/39]

EXPECT_EQ ( Rectangle< int >  10, 20, 10, 40,
original.  leftOf20 
)

◆ EXPECT_EQ() [31/39]

EXPECT_EQ ( Rectangle< int >  10, 20, 30, 20,
original.  above40 
)

◆ EXPECT_EQ() [32/39]

EXPECT_EQ ( Rectangle< int >  10, 30, 5, 5,
original.  leftOfRectangle< int >(15, 30, 10, 5) 
)

◆ EXPECT_EQ() [33/39]

EXPECT_EQ ( Rectangle< int >  10, 40, 30, 20,
original.  below40 
)

◆ EXPECT_EQ() [34/39]

EXPECT_EQ ( Rectangle< int >  20, 20, 20, 40,
original.  rightOf20 
)

◆ EXPECT_EQ() [35/39]

EXPECT_EQ ( s2  ,
s7   
)

◆ EXPECT_EQ() [36/39]

EXPECT_EQ ( s5  ,
s2.  intersections5 
)

◆ EXPECT_EQ() [37/39]

EXPECT_EQ ( s6  ,
s2.  intersections6 
)

◆ EXPECT_EQ() [38/39]

EXPECT_EQ ( Scaffold(-1, 1)  ,
s2.  intersections4 
)

◆ EXPECT_EQ() [39/39]

EXPECT_EQ ( Scaffold(1, 1)  ,
s2.  intersections7 
)

◆ EXPECT_FALSE() [1/21]

EXPECT_FALSE ( s.  isEmpty())

◆ EXPECT_FALSE() [2/21]

EXPECT_FALSE ( s1.  contains0)

◆ EXPECT_FALSE() [3/21]

EXPECT_FALSE ( s1.  containss2)

◆ EXPECT_FALSE() [4/21]

EXPECT_FALSE ( s1.  containss3)

◆ EXPECT_FALSE() [5/21]

EXPECT_FALSE ( s1.  containss4)

◆ EXPECT_FALSE() [6/21]

EXPECT_FALSE ( s1.  containss5)

◆ EXPECT_FALSE() [7/21]

EXPECT_FALSE ( s1.  containss6)

◆ EXPECT_FALSE() [8/21]

EXPECT_FALSE ( s1.  containss7)

◆ EXPECT_FALSE() [9/21]

EXPECT_FALSE ( s1.  containss8)

◆ EXPECT_FALSE() [10/21]

EXPECT_FALSE ( s2.  contains0)

◆ EXPECT_FALSE() [11/21]

EXPECT_FALSE ( s2.  contains7)

◆ EXPECT_FALSE() [12/21]

EXPECT_FALSE ( s2.  contains8)

◆ EXPECT_FALSE() [13/21]

EXPECT_FALSE ( s2.  containss3)

◆ EXPECT_FALSE() [14/21]

EXPECT_FALSE ( s2.  containss4)

◆ EXPECT_FALSE() [15/21]

EXPECT_FALSE ( s2.  containss7)

◆ EXPECT_FALSE() [16/21]

EXPECT_FALSE ( s2.  containss8)

◆ EXPECT_FALSE() [17/21]

EXPECT_FALSE ( s2.  intersectss1)

◆ EXPECT_FALSE() [18/21]

EXPECT_FALSE ( s2.  isEmpty())

◆ EXPECT_FALSE() [19/21]

EXPECT_FALSE ( s4.  isEmpty())

◆ EXPECT_FALSE() [20/21]

EXPECT_FALSE ( s5.  isEmpty())

◆ EXPECT_FALSE() [21/21]

EXPECT_FALSE ( s6.  isEmpty())

◆ EXPECT_NEAR() [1/4]

EXPECT_NEAR ( 0.  5,
result.  getLeft(),
1e-  6 
)

◆ EXPECT_NEAR() [2/4]

EXPECT_NEAR ( 1.  5,
result.  getTop(),
1e-  6 
)

◆ EXPECT_NEAR() [3/4]

EXPECT_NEAR ( 2.  5,
result.  getWidth(),
1e-  6 
)

◆ EXPECT_NEAR() [4/4]

EXPECT_NEAR ( 3.  5,
result.  getHeight(),
1e-  6 
)

◆ EXPECT_TRUE() [1/26]

EXPECT_TRUE ( original.  below60).isEmpty()

◆ EXPECT_TRUE() [2/26]

EXPECT_TRUE ( original.  leftOf5).isEmpty()

◆ EXPECT_TRUE() [3/26]

EXPECT_TRUE ( original.  rightOf40).isEmpty()

◆ EXPECT_TRUE() [4/26]

EXPECT_TRUE ( s1 = s2)

◆ EXPECT_TRUE() [5/26]

EXPECT_TRUE ( s1.  intersections2).isEmpty()

◆ EXPECT_TRUE() [6/26]

EXPECT_TRUE ( s1.  intersections3).isEmpty()

◆ EXPECT_TRUE() [7/26]

EXPECT_TRUE ( s1.  intersections4).isEmpty()

◆ EXPECT_TRUE() [8/26]

EXPECT_TRUE ( s1.  intersections5).isEmpty()

◆ EXPECT_TRUE() [9/26]

EXPECT_TRUE ( s1.  intersections6).isEmpty()

◆ EXPECT_TRUE() [10/26]

EXPECT_TRUE ( s1.  intersections7).isEmpty()

◆ EXPECT_TRUE() [11/26]

EXPECT_TRUE ( s1.  intersections8).isEmpty()

◆ EXPECT_TRUE() [12/26]

EXPECT_TRUE ( s1.  isEmpty())

◆ EXPECT_TRUE() [13/26]

EXPECT_TRUE ( s1  = =s3)

◆ EXPECT_TRUE() [14/26]

EXPECT_TRUE ( s2 = s5)

◆ EXPECT_TRUE() [15/26]

EXPECT_TRUE ( s2.  contains2)

◆ EXPECT_TRUE() [16/26]

EXPECT_TRUE ( s2.  contains6)

◆ EXPECT_TRUE() [17/26]

EXPECT_TRUE ( s2.  containss1)

◆ EXPECT_TRUE() [18/26]

EXPECT_TRUE ( s2.  containss5)

◆ EXPECT_TRUE() [19/26]

EXPECT_TRUE ( s2.  containss6)

◆ EXPECT_TRUE() [20/26]

EXPECT_TRUE ( s2.  intersections1).isEmpty()

◆ EXPECT_TRUE() [21/26]

EXPECT_TRUE ( s2.  intersections3).isEmpty()

◆ EXPECT_TRUE() [22/26]

EXPECT_TRUE ( s2.  intersections8).isEmpty()

◆ EXPECT_TRUE() [23/26]

EXPECT_TRUE ( s2.  intersectss4)

◆ EXPECT_TRUE() [24/26]

EXPECT_TRUE ( s2.  intersectss7)

◆ EXPECT_TRUE() [25/26]

EXPECT_TRUE ( s2  = =s4)

◆ EXPECT_TRUE() [26/26]

EXPECT_TRUE ( s3.  isEmpty())

◆ expected() [1/3]

Segment< int > const expected ( 3,
 
)

◆ expected() [2/3]

Segment< int > const expected ( ,
 
)

◆ expected() [3/3]

Segment< int > const expected ( 35  ,
15   
)

◆ intersectsImpliesNonEmptyIntersection() [1/15]

template<class Scaffold >
void intersectsImpliesNonEmptyIntersection ( const Scaffold &  a,
const Scaffold &  b 
)
117{
118 EXPECT_EQ(a.intersects(b), b.intersects(a));
119 EXPECT_EQ(a.intersects(b), !a.intersection(b).isEmpty());
120 EXPECT_EQ(b.intersects(a), !b.intersection(a).isEmpty());
121 EXPECT_EQ(a.intersection(b), b.intersection(a));
122}
std::shared_ptr< A > a
Definition async-deleter-tests.cc:60
Blob::Ptr const b
Definition blob-tests.cc:118
Here is the call graph for this function:

◆ intersectsImpliesNonEmptyIntersection() [2/15]

intersectsImpliesNonEmptyIntersection ( s1  ,
s2   
)

◆ intersectsImpliesNonEmptyIntersection() [3/15]

intersectsImpliesNonEmptyIntersection ( s1  ,
s3   
)

◆ intersectsImpliesNonEmptyIntersection() [4/15]

intersectsImpliesNonEmptyIntersection ( s1  ,
s4   
)

◆ intersectsImpliesNonEmptyIntersection() [5/15]

intersectsImpliesNonEmptyIntersection ( s1  ,
s5   
)

◆ intersectsImpliesNonEmptyIntersection() [6/15]

intersectsImpliesNonEmptyIntersection ( s1  ,
s6   
)

◆ intersectsImpliesNonEmptyIntersection() [7/15]

intersectsImpliesNonEmptyIntersection ( s1  ,
s7   
)

◆ intersectsImpliesNonEmptyIntersection() [8/15]

intersectsImpliesNonEmptyIntersection ( s1  ,
s8   
)

◆ intersectsImpliesNonEmptyIntersection() [9/15]

intersectsImpliesNonEmptyIntersection ( s2  ,
s1   
)

◆ intersectsImpliesNonEmptyIntersection() [10/15]

intersectsImpliesNonEmptyIntersection ( s2  ,
s3   
)

◆ intersectsImpliesNonEmptyIntersection() [11/15]

intersectsImpliesNonEmptyIntersection ( s2  ,
s4   
)

◆ intersectsImpliesNonEmptyIntersection() [12/15]

intersectsImpliesNonEmptyIntersection ( s2  ,
s5   
)

◆ intersectsImpliesNonEmptyIntersection() [13/15]

intersectsImpliesNonEmptyIntersection ( s2  ,
s6   
)

◆ intersectsImpliesNonEmptyIntersection() [14/15]

intersectsImpliesNonEmptyIntersection ( s2  ,
s7   
)

◆ intersectsImpliesNonEmptyIntersection() [15/15]

intersectsImpliesNonEmptyIntersection ( s2  ,
s8   
)

◆ orig()

Scaffold orig ( ,
 
)

Referenced by Scroom::ColormapImpl::ColormapProvider::ColormapProvider().

Here is the caller graph for this function:

◆ reduceSizeToMultipleOf() [1/2]

s reduceSizeToMultipleOf ( )

◆ reduceSizeToMultipleOf() [2/2]

s reduceSizeToMultipleOf ( )

◆ s()

Scaffold s ( ,
10   
)

◆ s2() [1/2]

Scaffold s2 ( 1,
 
)

◆ s2() [2/2]

Scaffold s2 ( ,
 
)

◆ s3()

Scaffold s3 ( 3,
 
)

◆ s4() [1/2]

Scaffold s4 ( 2,
 
)

◆ s4() [2/2]

Scaffold s4 ( ,
 
)

◆ s5() [1/2]

Scaffold s5 ( 1,
 
)

◆ s5() [2/2]

Scaffold s5 ( ,
 
)

◆ s6() [1/2]

Scaffold s6 ( ,
 
)

◆ s6() [2/2]

Scaffold s6 ( ,
 
)

◆ s7() [1/2]

Scaffold s7 ( ,
 
)

◆ s7() [2/2]

Scaffold s7 ( ,
5 
)

◆ s8()

Scaffold s8 ( ,
 
)

◆ TYPED_TEST_SUITE()

TYPED_TEST_SUITE ( Rectangle_and_Segment_TypedTests  ,
ScaffoldTypes   
)

Variable Documentation

◆ expected

Segment< int > const expected(3, 2) ( 12  ,
 
)
Initial value:
{
Segment<int> const result = 5 + make_segment(7, 3)
Definition linearsegment.hh:50
auto result
Definition rectangletests.cc:360

◆ grect

const GdkRectangle grect = rect.toGdkRectangle()

◆ rect

◆ result

Segment<int> const result = 0.5 * make_rect(1, 3, 5, 7)

◆ right

◆ s

Scaffold s = orig.moveTo(5)

◆ s1

Scaffold s1
Initial value:
{
using Scaffold = TypeParam

◆ s3

Scaffold s3