79   UUTree Tree(Allocator);  in TEST()  local
83   EXPECT_TRUE(Tree.empty());  in TEST()
84   Tree.clear();  in TEST()
85   EXPECT_TRUE(Tree.empty());  in TEST()
91   Tree.insert(10, 20, 10.20);  in TEST()
92   Tree.insert(30, 40, 30.40);  in TEST()
93   Tree.create();  in TEST()
97   Intervals = Tree.getContaining(Point);  in TEST()
102   Intervals = Tree.getContaining(Point);  in TEST()
107   Intervals = Tree.getContaining(Point);  in TEST()
112   Intervals = Tree.getContaining(Point);  in TEST()
118   Intervals = Tree.getContaining(Point);  in TEST()
123   Intervals = Tree.getContaining(Point);  in TEST()
128   Intervals = Tree.getContaining(Point);  in TEST()
133   Intervals = Tree.getContaining(Point);  in TEST()
139   Intervals = Tree.getContaining(Point);  in TEST()
168   UUTree Tree(Allocator);  in TEST()  local
169   EXPECT_TRUE(Tree.empty());  in TEST()
170   Tree.clear();  in TEST()
171   EXPECT_TRUE(Tree.empty());  in TEST()
174   Tree.create();  in TEST()
175   EXPECT_TRUE(Tree.empty());  in TEST()
176   EXPECT_EQ(Tree.find(1), Tree.find_end());  in TEST()
182   UUTree Tree(Allocator);  in TEST()  local
189   Tree.insert(10, 20, 1020);  in TEST()
191   EXPECT_TRUE(Tree.empty());  in TEST()
192   Tree.create();  in TEST()
193   EXPECT_FALSE(Tree.empty());  in TEST()
197   Intervals = Tree.getContaining(Point);  in TEST()
202   Intervals = Tree.getContaining(Point);  in TEST()
207   Intervals = Tree.getContaining(Point);  in TEST()
212   Intervals = Tree.getContaining(Point);  in TEST()
218   Intervals = Tree.getContaining(Point);  in TEST()
225   UUTree Tree(Allocator);  in TEST()  local
233   Tree.insert(10, 20, 1020);  in TEST()
234   Tree.insert(30, 40, 3040);  in TEST()
235   Tree.create();  in TEST()
239   Intervals = Tree.getContaining(Point);  in TEST()
244   Intervals = Tree.getContaining(Point);  in TEST()
249   Intervals = Tree.getContaining(Point);  in TEST()
254   Intervals = Tree.getContaining(Point);  in TEST()
260   Intervals = Tree.getContaining(Point);  in TEST()
265   Intervals = Tree.getContaining(Point);  in TEST()
270   Intervals = Tree.getContaining(Point);  in TEST()
275   Intervals = Tree.getContaining(Point);  in TEST()
281   Intervals = Tree.getContaining(Point);  in TEST()
288   UUTree Tree(Allocator);  in TEST()  local
297   Tree.insert(10, 20, 1020);  in TEST()
298   Tree.insert(30, 40, 3040);  in TEST()
299   Tree.insert(50, 60, 5060);  in TEST()
300   Tree.create();  in TEST()
304   Intervals = Tree.getContaining(Point);  in TEST()
309   Intervals = Tree.getContaining(Point);  in TEST()
314   Intervals = Tree.getContaining(Point);  in TEST()
319   Intervals = Tree.getContaining(Point);  in TEST()
325   Intervals = Tree.getContaining(Point);  in TEST()
330   Intervals = Tree.getContaining(Point);  in TEST()
335   Intervals = Tree.getContaining(Point);  in TEST()
340   Intervals = Tree.getContaining(Point);  in TEST()
346   Intervals = Tree.getContaining(Point);  in TEST()
351   Intervals = Tree.getContaining(Point);  in TEST()
356   Intervals = Tree.getContaining(Point);  in TEST()
361   Intervals = Tree.getContaining(Point);  in TEST()
367   Intervals = Tree.getContaining(Point);  in TEST()
374   UUTree Tree(Allocator);  in TEST()  local
387   Tree.insert(40, 60, 4060);  in TEST()
388   Tree.insert(50, 50, 5050);  in TEST()
389   Tree.insert(10, 10, 1010);  in TEST()
390   Tree.insert(70, 70, 7070);  in TEST()
392   EXPECT_TRUE(Tree.empty());  in TEST()
393   Tree.create();  in TEST()
394   EXPECT_FALSE(Tree.empty());  in TEST()
398   Intervals = Tree.getContaining(Point);  in TEST()
403   Intervals = Tree.getContaining(Point);  in TEST()
409   Intervals = Tree.getContaining(Point);  in TEST()
414   Intervals = Tree.getContaining(Point);  in TEST()
420   Intervals = Tree.getContaining(Point);  in TEST()
427   Intervals = Tree.getContaining(Point);  in TEST()
433   Intervals = Tree.getContaining(Point);  in TEST()
438   Intervals = Tree.getContaining(Point);  in TEST()
444   Intervals = Tree.getContaining(Point);  in TEST()
451   UUTree Tree(Allocator);  in TEST()  local
464   Tree.insert(40, 60, 4060);  in TEST()
465   Tree.insert(30, 70, 3070);  in TEST()
466   Tree.insert(20, 80, 2080);  in TEST()
467   Tree.insert(10, 90, 1090);  in TEST()
468   Tree.create();  in TEST()
472   Intervals = Tree.getContaining(Point);  in TEST()
477   Intervals = Tree.getContaining(Point);  in TEST()
482   Intervals = Tree.getContaining(Point);  in TEST()
487   Intervals = Tree.getContaining(Point);  in TEST()
491   Intervals = Tree.getContaining(Point);  in TEST()
492   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
496   Intervals = Tree.getContaining(Point);  in TEST()
497   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
503   Intervals = Tree.getContaining(Point);  in TEST()
507   Intervals = Tree.getContaining(Point);  in TEST()
508   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
512   Intervals = Tree.getContaining(Point);  in TEST()
513   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
519   Intervals = Tree.getContaining(Point);  in TEST()
524   Intervals = Tree.getContaining(Point);  in TEST()
525   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
530   Intervals = Tree.getContaining(Point);  in TEST()
531   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
538   Intervals = Tree.getContaining(Point);  in TEST()
543   Intervals = Tree.getContaining(Point);  in TEST()
544   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
549   Intervals = Tree.getContaining(Point);  in TEST()
550   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
557   Intervals = Tree.getContaining(Point);  in TEST()
563   Intervals = Tree.getContaining(Point);  in TEST()
564   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
570   Intervals = Tree.getContaining(Point);  in TEST()
571   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
579   Intervals = Tree.getContaining(Point);  in TEST()
585   Intervals = Tree.getContaining(Point);  in TEST()
586   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
592   Intervals = Tree.getContaining(Point);  in TEST()
593   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
601   Intervals = Tree.getContaining(Point);  in TEST()
607   Intervals = Tree.getContaining(Point);  in TEST()
608   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
614   Intervals = Tree.getContaining(Point);  in TEST()
615   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
623   Intervals = Tree.getContaining(Point);  in TEST()
628   Intervals = Tree.getContaining(Point);  in TEST()
629   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
634   Intervals = Tree.getContaining(Point);  in TEST()
635   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
642   Intervals = Tree.getContaining(Point);  in TEST()
647   Intervals = Tree.getContaining(Point);  in TEST()
648   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
653   Intervals = Tree.getContaining(Point);  in TEST()
654   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
661   Intervals = Tree.getContaining(Point);  in TEST()
665   Intervals = Tree.getContaining(Point);  in TEST()
666   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
670   Intervals = Tree.getContaining(Point);  in TEST()
671   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
677   Intervals = Tree.getContaining(Point);  in TEST()
681   Intervals = Tree.getContaining(Point);  in TEST()
682   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
686   Intervals = Tree.getContaining(Point);  in TEST()
687   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
693   Intervals = Tree.getContaining(Point);  in TEST()
698   Intervals = Tree.getContaining(Point);  in TEST()
704   Intervals = Tree.getContaining(Point);  in TEST()
711   UUTree Tree(Allocator);  in TEST()  local
740   Tree.insert(30, 35, 3035);  in TEST()
741   Tree.insert(39, 50, 3950);  in TEST()
742   Tree.insert(55, 61, 5561);  in TEST()
743   Tree.insert(31, 56, 3156);  in TEST()
744   Tree.insert(12, 21, 1221);  in TEST()
745   Tree.insert(25, 41, 2541);  in TEST()
746   Tree.insert(49, 65, 4965);  in TEST()
747   Tree.insert(71, 79, 7179);  in TEST()
748   Tree.insert(11, 16, 1116);  in TEST()
749   Tree.insert(20, 30, 2030);  in TEST()
750   Tree.insert(36, 54, 3654);  in TEST()
751   Tree.insert(60, 70, 6070);  in TEST()
752   Tree.insert(74, 80, 7480);  in TEST()
753   Tree.insert(15, 40, 1540);  in TEST()
754   Tree.insert(43, 45, 4345);  in TEST()
755   Tree.insert(50, 75, 5075);  in TEST()
756   Tree.insert(10, 85, 1085);  in TEST()
757   Tree.create();  in TEST()
761   Intervals = Tree.getContaining(Point);  in TEST()
768   Intervals = Tree.getContaining(Point);  in TEST()
769   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
776   Intervals = Tree.getContaining(Point);  in TEST()
777   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
786   Intervals = Tree.getContaining(Point);  in TEST()
793   Intervals = Tree.getContaining(Point);  in TEST()
794   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
801   Intervals = Tree.getContaining(Point);  in TEST()
802   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
811   Intervals = Tree.getContaining(Point);  in TEST()
819   Intervals = Tree.getContaining(Point);  in TEST()
820   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
828   Intervals = Tree.getContaining(Point);  in TEST()
829   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
839   Intervals = Tree.getContaining(Point);  in TEST()
847   Intervals = Tree.getContaining(Point);  in TEST()
848   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
856   Intervals = Tree.getContaining(Point);  in TEST()
857   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
867   Intervals = Tree.getContaining(Point);  in TEST()
874   Intervals = Tree.getContaining(Point);  in TEST()
875   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
882   Intervals = Tree.getContaining(Point);  in TEST()
883   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
892   Intervals = Tree.getContaining(Point);  in TEST()
899   Intervals = Tree.getContaining(Point);  in TEST()
900   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
907   Intervals = Tree.getContaining(Point);  in TEST()
908   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
917   Intervals = Tree.getContaining(Point);  in TEST()
924   Intervals = Tree.getContaining(Point);  in TEST()
925   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
932   Intervals = Tree.getContaining(Point);  in TEST()
933   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
942   Intervals = Tree.getContaining(Point);  in TEST()
949   Intervals = Tree.getContaining(Point);  in TEST()
950   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
957   Intervals = Tree.getContaining(Point);  in TEST()
958   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
967   Intervals = Tree.getContaining(Point);  in TEST()
972   Intervals = Tree.getContaining(Point);  in TEST()
973   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
978   Intervals = Tree.getContaining(Point);  in TEST()
979   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
986   Intervals = Tree.getContaining(Point);  in TEST()
992   Intervals = Tree.getContaining(Point);  in TEST()
993   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
999   Intervals = Tree.getContaining(Point);  in TEST()
1000   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1008   Intervals = Tree.getContaining(Point);  in TEST()
1014   Intervals = Tree.getContaining(Point);  in TEST()
1015   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1021   Intervals = Tree.getContaining(Point);  in TEST()
1022   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1030   Intervals = Tree.getContaining(Point);  in TEST()
1037   Intervals = Tree.getContaining(Point);  in TEST()
1038   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1045   Intervals = Tree.getContaining(Point);  in TEST()
1046   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1055   Intervals = Tree.getContaining(Point);  in TEST()
1062   Intervals = Tree.getContaining(Point);  in TEST()
1063   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1070   Intervals = Tree.getContaining(Point);  in TEST()
1071   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1080   Intervals = Tree.getContaining(Point);  in TEST()
1086   Intervals = Tree.getContaining(Point);  in TEST()
1087   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1093   Intervals = Tree.getContaining(Point);  in TEST()
1094   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1102   Intervals = Tree.getContaining(Point);  in TEST()
1107   Intervals = Tree.getContaining(Point);  in TEST()
1108   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1113   Intervals = Tree.getContaining(Point);  in TEST()
1114   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1121   Intervals = Tree.getContaining(Point);  in TEST()
1126   Intervals = Tree.getContaining(Point);  in TEST()
1127   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1132   Intervals = Tree.getContaining(Point);  in TEST()
1133   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1140   Intervals = Tree.getContaining(Point);  in TEST()
1144   Intervals = Tree.getContaining(Point);  in TEST()
1145   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1149   Intervals = Tree.getContaining(Point);  in TEST()
1150   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1156   Intervals = Tree.getContaining(Point);  in TEST()
1162   Intervals = Tree.getContaining(Point);  in TEST()
1163   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1169   Intervals = Tree.getContaining(Point);  in TEST()
1170   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1178   Intervals = Tree.getContaining(Point);  in TEST()
1184   Intervals = Tree.getContaining(Point);  in TEST()
1185   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1191   Intervals = Tree.getContaining(Point);  in TEST()
1192   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1200   Intervals = Tree.getContaining(Point);  in TEST()
1207   Intervals = Tree.getContaining(Point);  in TEST()
1208   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1215   Intervals = Tree.getContaining(Point);  in TEST()
1216   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1225   Intervals = Tree.getContaining(Point);  in TEST()
1232   Intervals = Tree.getContaining(Point);  in TEST()
1233   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1240   Intervals = Tree.getContaining(Point);  in TEST()
1241   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1250   Intervals = Tree.getContaining(Point);  in TEST()
1257   Intervals = Tree.getContaining(Point);  in TEST()
1258   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1265   Intervals = Tree.getContaining(Point);  in TEST()
1266   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1275   Intervals = Tree.getContaining(Point);  in TEST()
1282   Intervals = Tree.getContaining(Point);  in TEST()
1283   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1290   Intervals = Tree.getContaining(Point);  in TEST()
1291   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1300   Intervals = Tree.getContaining(Point);  in TEST()
1305   Intervals = Tree.getContaining(Point);  in TEST()
1306   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1311   Intervals = Tree.getContaining(Point);  in TEST()
1312   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1319   Intervals = Tree.getContaining(Point);  in TEST()
1325   Intervals = Tree.getContaining(Point);  in TEST()
1326   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1332   Intervals = Tree.getContaining(Point);  in TEST()
1333   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1341   Intervals = Tree.getContaining(Point);  in TEST()
1345   Intervals = Tree.getContaining(Point);  in TEST()
1346   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1350   Intervals = Tree.getContaining(Point);  in TEST()
1351   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1357   Intervals = Tree.getContaining(Point);  in TEST()
1363   Intervals = Tree.getContaining(Point);  in TEST()
1364   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1370   Intervals = Tree.getContaining(Point);  in TEST()
1371   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1379   Intervals = Tree.getContaining(Point);  in TEST()
1387   Intervals = Tree.getContaining(Point);  in TEST()
1388   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1396   Intervals = Tree.getContaining(Point);  in TEST()
1397   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1407   Intervals = Tree.getContaining(Point);  in TEST()
1414   Intervals = Tree.getContaining(Point);  in TEST()
1415   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1422   Intervals = Tree.getContaining(Point);  in TEST()
1423   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1432   Intervals = Tree.getContaining(Point);  in TEST()
1439   Intervals = Tree.getContaining(Point);  in TEST()
1440   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1447   Intervals = Tree.getContaining(Point);  in TEST()
1448   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1457   Intervals = Tree.getContaining(Point);  in TEST()
1465   Intervals = Tree.getContaining(Point);  in TEST()
1466   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1474   Intervals = Tree.getContaining(Point);  in TEST()
1475   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1485   Intervals = Tree.getContaining(Point);  in TEST()
1491   Intervals = Tree.getContaining(Point);  in TEST()
1492   Tree.sortIntervals(Intervals, UUSorting::Ascending);  in TEST()
1498   Intervals = Tree.getContaining(Point);  in TEST()
1499   Tree.sortIntervals(Intervals, UUSorting::Descending);  in TEST()
1507   Intervals = Tree.getContaining(Point);  in TEST()
1512   Intervals = Tree.getContaining(Point);  in TEST()
1518   Intervals = Tree.getContaining(Point);  in TEST()
1521   Intervals = Tree.getContaining(Point);  in TEST()
1528   UUTree Tree(Allocator);  in TEST()  local
1540   Tree.insert(10, 20, 1020);  in TEST()
1541   Tree.insert(15, 25, 1525);  in TEST()
1542   Tree.insert(50, 60, 5060);  in TEST()
1543   Tree.insert(55, 65, 5565);  in TEST()
1544   Tree.create();  in TEST()
1550     UUIter Iter = Tree.find(Point);  in TEST()
1551     EXPECT_NE(Iter, Tree.find_end());  in TEST()
1554     EXPECT_EQ(Iter, Tree.find_end());  in TEST()
1559     UUIter Iter = Tree.find(Point);  in TEST()
1560     ASSERT_TRUE(Iter != Tree.find_end());  in TEST()
1563     ASSERT_TRUE(Iter != Tree.find_end());  in TEST()
1566     EXPECT_EQ(Iter, Tree.find_end());  in TEST()
1571     UUIter Iter = Tree.find(Point);  in TEST()
1572     ASSERT_TRUE(Iter != Tree.find_end());  in TEST()
1575     ASSERT_TRUE(Iter != Tree.find_end());  in TEST()
1578     EXPECT_EQ(Iter, Tree.find_end());  in TEST()
1583     UUIter Iter = Tree.find(Point);  in TEST()
1584     ASSERT_TRUE(Iter != Tree.find_end());  in TEST()
1587     EXPECT_EQ(Iter, Tree.find_end());  in TEST()
1592     UUIter Iter = Tree.find(Point);  in TEST()
1593     EXPECT_EQ(Iter, Tree.find_end());  in TEST()
1597     UUIter Iter = Tree.find(Point);  in TEST()
1598     EXPECT_EQ(Iter, Tree.find_end());  in TEST()
1602     UUIter Iter = Tree.find(Point);  in TEST()
1603     EXPECT_EQ(Iter, Tree.find_end());  in TEST()