Lines Matching refs:t1
47 t1(12,88); in int_test() local
52 ASSERT_TRUE(t1.begin() == 12) << "int ctor1"; in int_test()
53 ASSERT_TRUE(t1.end() == 88) << "int ctor2"; in int_test()
62 ASSERT_TRUE(t1.size() == size_t(t1.end() - t1.begin())) << "int size1"; in int_test()
77 ASSERT_TRUE(t1.contains(t1)) << "int contains1"; in int_test()
78 ASSERT_TRUE(t1.contains(t2)) << "int contains2"; in int_test()
79 ASSERT_TRUE(! t1.contains(t3)) << "int contains3"; in int_test()
80 ASSERT_TRUE(! t1.contains(t4)) << "int contains4"; in int_test()
81 ASSERT_TRUE(t1.contains(t5)) << "int contains5"; in int_test()
82 ASSERT_TRUE(t1.contains(t6)) << "int contains6"; in int_test()
83 ASSERT_TRUE(t1.contains(t7)) << "int contains7"; in int_test()
84 ASSERT_TRUE(t1.contains(t8)) << "int contains8"; in int_test()
85 ASSERT_TRUE(! t1.contains(t9)) << "int contains9"; in int_test()
86 ASSERT_TRUE(! t1.contains(t10)) << "int contains10"; in int_test()
87 ASSERT_TRUE(! t1.contains(t11)) << "int contains11"; in int_test()
88 ASSERT_TRUE(! t1.contains(t12)) << "int contains12"; in int_test()
90 ASSERT_TRUE(t1.contains(50)) << "int contains n1"; in int_test()
91 ASSERT_TRUE(t1.contains(12)) << "int contains n2"; in int_test()
92 ASSERT_TRUE(t1.contains(87)) << "int contains n3"; in int_test()
93 ASSERT_TRUE(! t1.contains(3)) << "int contains n4"; in int_test()
94 ASSERT_TRUE(! t1.contains(11)) << "int contains n5"; in int_test()
95 ASSERT_TRUE(! t1.contains(88)) << "int contains n6"; in int_test()
96 ASSERT_TRUE(! t1.contains(100)) << "int contains n7"; in int_test()
101 ASSERT_TRUE(t1.overlaps(t1)) << "int overlaps1"; in int_test()
102 ASSERT_TRUE(t1.overlaps(t2)) << "int overlaps2"; in int_test()
103 ASSERT_TRUE(! t1.overlaps(t3)) << "int overlaps3"; in int_test()
104 ASSERT_TRUE(t1.overlaps(t4)) << "int overlaps4"; in int_test()
105 ASSERT_TRUE(t1.overlaps(t5)) << "int overlaps5"; in int_test()
106 ASSERT_TRUE(t1.overlaps(t6)) << "int overlaps6"; in int_test()
107 ASSERT_TRUE(t1.overlaps(t7)) << "int overlaps7"; in int_test()
108 ASSERT_TRUE(t1.overlaps(t8)) << "int overlaps8"; in int_test()
109 ASSERT_TRUE(! t1.overlaps(t9)) << "int overlaps9"; in int_test()
110 ASSERT_TRUE(t1.overlaps(t10)) << "int overlaps10"; in int_test()
111 ASSERT_TRUE(! t1.overlaps(t11)) << "int overlaps11"; in int_test()
112 ASSERT_TRUE(! t1.overlaps(t12)) << "int overlaps12"; in int_test()
113 ASSERT_TRUE(! t1.overlaps(t13)) << "int overlaps13"; in int_test()
116 ASSERT_TRUE(t1.distance_to(t13) == 0) << "int distance_to1"; in int_test()
117 ASSERT_TRUE(t1.distance_to(t9) == 0) << "int distance_to2"; in int_test()
118 ASSERT_TRUE(t1.distance_to(t11) == 2) << "int distance_to3"; in int_test()
119 ASSERT_TRUE(t1.distance_to(t8) == -1) << "int distance_to4"; in int_test()
120 ASSERT_TRUE(t1.distance_to(t3) == -88) << "int distance_to5"; in int_test()
133 t1(hit1, hit2); in iterator_test() local
138 ASSERT_TRUE(t1.begin() == hit1) << "ivec ctor1"; in iterator_test()
139 ASSERT_TRUE(t1.end() == hit2) << "ivec ctor2"; in iterator_test()
148 ASSERT_TRUE(t1.size() == size_t(t1.end() - t1.begin())) << "ivec size1"; in iterator_test()
163 ASSERT_TRUE(t1.contains(t1)) << "ivec contains1"; in iterator_test()
164 ASSERT_TRUE(t1.contains(t2)) << "ivec contains2"; in iterator_test()
165 ASSERT_TRUE(! t1.contains(t3)) << "ivec contains3"; in iterator_test()
166 ASSERT_TRUE(! t1.contains(t4)) << "ivec contains4"; in iterator_test()
167 ASSERT_TRUE(t1.contains(t5)) << "ivec contains5"; in iterator_test()
168 ASSERT_TRUE(t1.contains(t6)) << "ivec contains6"; in iterator_test()
169 ASSERT_TRUE(t1.contains(t7)) << "ivec contains7"; in iterator_test()
170 ASSERT_TRUE(t1.contains(t8)) << "ivec contains8"; in iterator_test()
171 ASSERT_TRUE(! t1.contains(t9)) << "ivec contains9"; in iterator_test()
172 ASSERT_TRUE(! t1.contains(t10)) << "ivec contains10"; in iterator_test()
173 ASSERT_TRUE(! t1.contains(t11)) << "ivec contains11"; in iterator_test()
174 ASSERT_TRUE(! t1.contains(t12)) << "ivec contains12"; in iterator_test()
176 ASSERT_TRUE(t1.contains(hv.begin() + 50)) << "ivec contains n1"; in iterator_test()
177 ASSERT_TRUE(t1.contains(hit1)) << "ivec contains n2"; in iterator_test()
178 ASSERT_TRUE(t1.contains(hv.begin() + 87)) << "ivec contains n3"; in iterator_test()
179 ASSERT_TRUE(! t1.contains(hv.begin() + 3)) << "ivec contains n4"; in iterator_test()
180 ASSERT_TRUE(! t1.contains(hv.begin() + 11)) << "ivec contains n5"; in iterator_test()
181 ASSERT_TRUE(! t1.contains(hit2)) << "ivec contains n6"; in iterator_test()
182 ASSERT_TRUE(! t1.contains(hv.begin() + 100)) << "ivec contains n7"; in iterator_test()
187 ASSERT_TRUE(t1.overlaps(t1)) << "ivec overlaps1"; in iterator_test()
188 ASSERT_TRUE(t1.overlaps(t2)) << "ivec overlaps2"; in iterator_test()
189 ASSERT_TRUE(! t1.overlaps(t3)) << "ivec overlaps3"; in iterator_test()
190 ASSERT_TRUE(t1.overlaps(t4)) << "ivec overlaps4"; in iterator_test()
191 ASSERT_TRUE(t1.overlaps(t5)) << "ivec overlaps5"; in iterator_test()
192 ASSERT_TRUE(t1.overlaps(t6)) << "ivec overlaps6"; in iterator_test()
193 ASSERT_TRUE(t1.overlaps(t7)) << "ivec overlaps7"; in iterator_test()
194 ASSERT_TRUE(t1.overlaps(t8)) << "ivec overlaps8"; in iterator_test()
195 ASSERT_TRUE(! t1.overlaps(t9)) << "ivec overlaps9"; in iterator_test()
196 ASSERT_TRUE(t1.overlaps(t10)) << "ivec overlaps10"; in iterator_test()
197 ASSERT_TRUE(! t1.overlaps(t11)) << "ivec overlaps11"; in iterator_test()
198 ASSERT_TRUE(! t1.overlaps(t12)) << "ivec overlaps12"; in iterator_test()
199 ASSERT_TRUE(! t1.overlaps(t13)) << "ivec overlaps13"; in iterator_test()
202 ASSERT_TRUE(t1.distance_to(t13) == 0) << "ivec distance_to1"; in iterator_test()
203 ASSERT_TRUE(t1.distance_to(t8) == -1) << "ivec distance_to2"; in iterator_test()
204 ASSERT_TRUE(t1.distance_to(t9) == 0) << "ivec distance_to3"; in iterator_test()
205 ASSERT_TRUE(t1.distance_to(t11) == 2) << "ivec distance_to4"; in iterator_test()
206 ASSERT_TRUE(t1.distance_to(t3) == -88) << "ivec distance_to5"; in iterator_test()