15 // c) Query for specific interval point, covering points inside and outside
17 // d) Traversal for specific interval point, using the iterators.
38 void checkItem(TPoint Point, TItem Item, TPoint Left, TPoint Right,  in checkItem()  argument
40   EXPECT_TRUE(Item->contains(Point));  in checkItem()
60     bool left(const PointType &Point) const { return UUData::left(Point); }  in TEST()
61     bool right(const PointType &Point) const { return UUData::right(Point); }  in TEST()
62     bool contains(const PointType &Point) const {  in TEST()
63       return UUData::contains(Point);  in TEST()
72   auto CheckData = [](UUPoint Point, const UUData *Data, UUPoint Left,  in TEST()
74     checkItem<UUPoint, const UUData *, UUValue>(Point, Data, Left, Right,  in TEST()
81   UUPoint Point;  in TEST()  argument
96   Point = 5;  in TEST()
97   Intervals = Tree.getContaining(Point);  in TEST()
101   Point = 10;  in TEST()
102   Intervals = Tree.getContaining(Point);  in TEST()
104   CheckData(Point, Intervals[0], 10, 20, 10.20);  in TEST()
106   Point = 15;  in TEST()
107   Intervals = Tree.getContaining(Point);  in TEST()
109   CheckData(Point, Intervals[0], 10, 20, 10.20);  in TEST()
111   Point = 20;  in TEST()
112   Intervals = Tree.getContaining(Point);  in TEST()
114   CheckData(Point, Intervals[0], 10, 20, 10.20);  in TEST()
117   Point = 25;  in TEST()
118   Intervals = Tree.getContaining(Point);  in TEST()
122   Point = 30;  in TEST()
123   Intervals = Tree.getContaining(Point);  in TEST()
125   CheckData(Point, Intervals[0], 30, 40, 30.40);  in TEST()
127   Point = 35;  in TEST()
128   Intervals = Tree.getContaining(Point);  in TEST()
130   CheckData(Point, Intervals[0], 30, 40, 30.40);  in TEST()
132   Point = 40;  in TEST()
133   Intervals = Tree.getContaining(Point);  in TEST()
135   CheckData(Point, Intervals[0], 30, 40, 30.40);  in TEST()
138   Point = 45;  in TEST()
139   Intervals = Tree.getContaining(Point);  in TEST()
155 void checkData(UUPoint Point, const UUData *Data, UUPoint Left, UUPoint Right,  in checkData()  argument
157   checkItem<UUPoint, const UUData *, UUValue>(Point, Data, Left, Right, Value);  in checkData()
160 void checkData(UUPoint Point, UUIter Iter, UUPoint Left, UUPoint Right,  in checkData()  argument
162   checkItem<UUPoint, UUIter, UUValue>(Point, Iter, Left, Right, Value);  in checkData()
184   UUPoint Point;  in TEST()  local
196   Point = 5;  in TEST()
197   Intervals = Tree.getContaining(Point);  in TEST()
201   Point = 10;  in TEST()
202   Intervals = Tree.getContaining(Point);  in TEST()
204   checkData(Point, Intervals[0], 10, 20, 1020);  in TEST()
206   Point = 15;  in TEST()
207   Intervals = Tree.getContaining(Point);  in TEST()
209   checkData(Point, Intervals[0], 10, 20, 1020);  in TEST()
211   Point = 20;  in TEST()
212   Intervals = Tree.getContaining(Point);  in TEST()
214   checkData(Point, Intervals[0], 10, 20, 1020);  in TEST()
217   Point = 25;  in TEST()
218   Intervals = Tree.getContaining(Point);  in TEST()
227   UUPoint Point;  in TEST()  local
238   Point = 5;  in TEST()
239   Intervals = Tree.getContaining(Point);  in TEST()
243   Point = 10;  in TEST()
244   Intervals = Tree.getContaining(Point);  in TEST()
246   checkData(Point, Intervals[0], 10, 20, 1020);  in TEST()
248   Point = 15;  in TEST()
249   Intervals = Tree.getContaining(Point);  in TEST()
251   checkData(Point, Intervals[0], 10, 20, 1020);  in TEST()
253   Point = 20;  in TEST()
254   Intervals = Tree.getContaining(Point);  in TEST()
256   checkData(Point, Intervals[0], 10, 20, 1020);  in TEST()
259   Point = 25;  in TEST()
260   Intervals = Tree.getContaining(Point);  in TEST()
264   Point = 30;  in TEST()
265   Intervals = Tree.getContaining(Point);  in TEST()
267   checkData(Point, Intervals[0], 30, 40, 3040);  in TEST()
269   Point = 35;  in TEST()
270   Intervals = Tree.getContaining(Point);  in TEST()
272   checkData(Point, Intervals[0], 30, 40, 3040);  in TEST()
274   Point = 40;  in TEST()
275   Intervals = Tree.getContaining(Point);  in TEST()
277   checkData(Point, Intervals[0], 30, 40, 3040);  in TEST()
280   Point = 45;  in TEST()
281   Intervals = Tree.getContaining(Point);  in TEST()
290   UUPoint Point;  in TEST()  local
303   Point = 5;  in TEST()
304   Intervals = Tree.getContaining(Point);  in TEST()
308   Point = 10;  in TEST()
309   Intervals = Tree.getContaining(Point);  in TEST()
311   checkData(Point, Intervals[0], 10, 20, 1020);  in TEST()
313   Point = 15;  in TEST()
314   Intervals = Tree.getContaining(Point);  in TEST()
316   checkData(Point, Intervals[0], 10, 20, 1020);  in TEST()
318   Point = 20;  in TEST()
319   Intervals = Tree.getContaining(Point);  in TEST()
321   checkData(Point, Intervals[0], 10, 20, 1020);  in TEST()
324   Point = 25;  in TEST()
325   Intervals = Tree.getContaining(Point);  in TEST()
329   Point = 30;  in TEST()
330   Intervals = Tree.getContaining(Point);  in TEST()
332   checkData(Point, Intervals[0], 30, 40, 3040);  in TEST()
334   Point = 35;  in TEST()
335   Intervals = Tree.getContaining(Point);  in TEST()
337   checkData(Point, Intervals[0], 30, 40, 3040);  in TEST()
339   Point = 40;  in TEST()
340   Intervals = Tree.getContaining(Point);  in TEST()
342   checkData(Point, Intervals[0], 30, 40, 3040);  in TEST()
345   Point = 45;  in TEST()
346   Intervals = Tree.getContaining(Point);  in TEST()
350   Point = 50;  in TEST()
351   Intervals = Tree.getContaining(Point);  in TEST()
353   checkData(Point, Intervals[0], 50, 60, 5060);  in TEST()
355   Point = 55;  in TEST()
356   Intervals = Tree.getContaining(Point);  in TEST()
358   checkData(Point, Intervals[0], 50, 60, 5060);  in TEST()
360   Point = 60;  in TEST()
361   Intervals = Tree.getContaining(Point);  in TEST()
363   checkData(Point, Intervals[0], 50, 60, 5060);  in TEST()
366   Point = 65;  in TEST()
367   Intervals = Tree.getContaining(Point);  in TEST()
376   UUPoint Point;  in TEST()  local
397   Point = 5;  in TEST()
398   Intervals = Tree.getContaining(Point);  in TEST()
402   Point = 10;  in TEST()
403   Intervals = Tree.getContaining(Point);  in TEST()
405   checkData(Point, Intervals[0], 10, 10, 1010);  in TEST()
408   Point = 15;  in TEST()
409   Intervals = Tree.getContaining(Point);  in TEST()
413   Point = 45;  in TEST()
414   Intervals = Tree.getContaining(Point);  in TEST()
416   checkData(Point, Intervals[0], 40, 60, 4060);  in TEST()
419   Point = 50;  in TEST()
420   Intervals = Tree.getContaining(Point);  in TEST()
422   checkData(Point, Intervals[0], 40, 60, 4060);  in TEST()
423   checkData(Point, Intervals[1], 50, 50, 5050);  in TEST()
426   Point = 55;  in TEST()
427   Intervals = Tree.getContaining(Point);  in TEST()
429   checkData(Point, Intervals[0], 40, 60, 4060);  in TEST()
432   Point = 65;  in TEST()
433   Intervals = Tree.getContaining(Point);  in TEST()
437   Point = 70;  in TEST()
438   Intervals = Tree.getContaining(Point);  in TEST()
440   checkData(Point, Intervals[0], 70, 70, 7070);  in TEST()
443   Point = 75;  in TEST()
444   Intervals = Tree.getContaining(Point);  in TEST()
453   UUPoint Point;  in TEST()  local
471   Point = 5;  in TEST()
472   Intervals = Tree.getContaining(Point);  in TEST()
476   Point = 10;  in TEST()
477   Intervals = Tree.getContaining(Point);  in TEST()
479   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
481   Point = 15;  in TEST()
482   Intervals = Tree.getContaining(Point);  in TEST()
484   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
486   Point = 20;  in TEST()
487   Intervals = Tree.getContaining(Point);  in TEST()
489   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
490   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
491   Intervals = Tree.getContaining(Point);  in TEST()
494   checkData(Point, Intervals[0], 20, 80, 2080);  in TEST()
495   checkData(Point, Intervals[1], 10, 90, 1090);  in TEST()
496   Intervals = Tree.getContaining(Point);  in TEST()
499   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
500   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
502   Point = 25;  in TEST()
503   Intervals = Tree.getContaining(Point);  in TEST()
505   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
506   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
507   Intervals = Tree.getContaining(Point);  in TEST()
510   checkData(Point, Intervals[0], 20, 80, 2080);  in TEST()
511   checkData(Point, Intervals[1], 10, 90, 1090);  in TEST()
512   Intervals = Tree.getContaining(Point);  in TEST()
515   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
516   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
518   Point = 30;  in TEST()
519   Intervals = Tree.getContaining(Point);  in TEST()
521   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
522   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
523   checkData(Point, Intervals[2], 30, 70, 3070);  in TEST()
524   Intervals = Tree.getContaining(Point);  in TEST()
527   checkData(Point, Intervals[0], 30, 70, 3070);  in TEST()
528   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
529   checkData(Point, Intervals[2], 10, 90, 1090);  in TEST()
530   Intervals = Tree.getContaining(Point);  in TEST()
533   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
534   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
535   checkData(Point, Intervals[2], 30, 70, 3070);  in TEST()
537   Point = 35;  in TEST()
538   Intervals = Tree.getContaining(Point);  in TEST()
540   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
541   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
542   checkData(Point, Intervals[2], 30, 70, 3070);  in TEST()
543   Intervals = Tree.getContaining(Point);  in TEST()
546   checkData(Point, Intervals[0], 30, 70, 3070);  in TEST()
547   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
548   checkData(Point, Intervals[2], 10, 90, 1090);  in TEST()
549   Intervals = Tree.getContaining(Point);  in TEST()
552   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
553   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
554   checkData(Point, Intervals[2], 30, 70, 3070);  in TEST()
556   Point = 40;  in TEST()
557   Intervals = Tree.getContaining(Point);  in TEST()
559   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
560   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
561   checkData(Point, Intervals[2], 30, 70, 3070);  in TEST()
562   checkData(Point, Intervals[3], 40, 60, 4060);  in TEST()
563   Intervals = Tree.getContaining(Point);  in TEST()
566   checkData(Point, Intervals[0], 40, 60, 4060);  in TEST()
567   checkData(Point, Intervals[1], 30, 70, 3070);  in TEST()
568   checkData(Point, Intervals[2], 20, 80, 2080);  in TEST()
569   checkData(Point, Intervals[3], 10, 90, 1090);  in TEST()
570   Intervals = Tree.getContaining(Point);  in TEST()
573   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
574   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
575   checkData(Point, Intervals[2], 30, 70, 3070);  in TEST()
576   checkData(Point, Intervals[3], 40, 60, 4060);  in TEST()
578   Point = 50;  in TEST()
579   Intervals = Tree.getContaining(Point);  in TEST()
581   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
582   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
583   checkData(Point, Intervals[2], 30, 70, 3070);  in TEST()
584   checkData(Point, Intervals[3], 40, 60, 4060);  in TEST()
585   Intervals = Tree.getContaining(Point);  in TEST()
588   checkData(Point, Intervals[0], 40, 60, 4060);  in TEST()
589   checkData(Point, Intervals[1], 30, 70, 3070);  in TEST()
590   checkData(Point, Intervals[2], 20, 80, 2080);  in TEST()
591   checkData(Point, Intervals[3], 10, 90, 1090);  in TEST()
592   Intervals = Tree.getContaining(Point);  in TEST()
595   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
596   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
597   checkData(Point, Intervals[2], 30, 70, 3070);  in TEST()
598   checkData(Point, Intervals[3], 40, 60, 4060);  in TEST()
600   Point = 60;  in TEST()
601   Intervals = Tree.getContaining(Point);  in TEST()
603   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
604   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
605   checkData(Point, Intervals[2], 30, 70, 3070);  in TEST()
606   checkData(Point, Intervals[3], 40, 60, 4060);  in TEST()
607   Intervals = Tree.getContaining(Point);  in TEST()
610   checkData(Point, Intervals[0], 40, 60, 4060);  in TEST()
611   checkData(Point, Intervals[1], 30, 70, 3070);  in TEST()
612   checkData(Point, Intervals[2], 20, 80, 2080);  in TEST()
613   checkData(Point, Intervals[3], 10, 90, 1090);  in TEST()
614   Intervals = Tree.getContaining(Point);  in TEST()
617   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
618   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
619   checkData(Point, Intervals[2], 30, 70, 3070);  in TEST()
620   checkData(Point, Intervals[3], 40, 60, 4060);  in TEST()
622   Point = 65;  in TEST()
623   Intervals = Tree.getContaining(Point);  in TEST()
625   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
626   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
627   checkData(Point, Intervals[2], 30, 70, 3070);  in TEST()
628   Intervals = Tree.getContaining(Point);  in TEST()
631   checkData(Point, Intervals[0], 30, 70, 3070);  in TEST()
632   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
633   checkData(Point, Intervals[2], 10, 90, 1090);  in TEST()
634   Intervals = Tree.getContaining(Point);  in TEST()
637   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
638   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
639   checkData(Point, Intervals[2], 30, 70, 3070);  in TEST()
641   Point = 70;  in TEST()
642   Intervals = Tree.getContaining(Point);  in TEST()
644   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
645   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
646   checkData(Point, Intervals[2], 30, 70, 3070);  in TEST()
647   Intervals = Tree.getContaining(Point);  in TEST()
650   checkData(Point, Intervals[0], 30, 70, 3070);  in TEST()
651   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
652   checkData(Point, Intervals[2], 10, 90, 1090);  in TEST()
653   Intervals = Tree.getContaining(Point);  in TEST()
656   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
657   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
658   checkData(Point, Intervals[2], 30, 70, 3070);  in TEST()
660   Point = 75;  in TEST()
661   Intervals = Tree.getContaining(Point);  in TEST()
663   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
664   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
665   Intervals = Tree.getContaining(Point);  in TEST()
668   checkData(Point, Intervals[0], 20, 80, 2080);  in TEST()
669   checkData(Point, Intervals[1], 10, 90, 1090);  in TEST()
670   Intervals = Tree.getContaining(Point);  in TEST()
673   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
674   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
676   Point = 80;  in TEST()
677   Intervals = Tree.getContaining(Point);  in TEST()
679   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
680   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
681   Intervals = Tree.getContaining(Point);  in TEST()
684   checkData(Point, Intervals[0], 20, 80, 2080);  in TEST()
685   checkData(Point, Intervals[1], 10, 90, 1090);  in TEST()
686   Intervals = Tree.getContaining(Point);  in TEST()
689   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
690   checkData(Point, Intervals[1], 20, 80, 2080);  in TEST()
692   Point = 85;  in TEST()
693   Intervals = Tree.getContaining(Point);  in TEST()
695   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
697   Point = 90;  in TEST()
698   Intervals = Tree.getContaining(Point);  in TEST()
700   checkData(Point, Intervals[0], 10, 90, 1090);  in TEST()
703   Point = 95;  in TEST()
704   Intervals = Tree.getContaining(Point);  in TEST()
713   UUPoint Point;  in TEST()  local
760   Point = 30;  in TEST()
761   Intervals = Tree.getContaining(Point);  in TEST()
763   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
764   checkData(Point, Intervals[1], 25, 41, 2541);  in TEST()
765   checkData(Point, Intervals[2], 15, 40, 1540);  in TEST()
766   checkData(Point, Intervals[3], 20, 30, 2030);  in TEST()
767   checkData(Point, Intervals[4], 30, 35, 3035);  in TEST()
768   Intervals = Tree.getContaining(Point);  in TEST()
771   checkData(Point, Intervals[0], 30, 35, 3035);  in TEST()
772   checkData(Point, Intervals[1], 20, 30, 2030);  in TEST()
773   checkData(Point, Intervals[2], 25, 41, 2541);  in TEST()
774   checkData(Point, Intervals[3], 15, 40, 1540);  in TEST()
775   checkData(Point, Intervals[4], 10, 85, 1085);  in TEST()
776   Intervals = Tree.getContaining(Point);  in TEST()
779   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
780   checkData(Point, Intervals[1], 15, 40, 1540);  in TEST()
781   checkData(Point, Intervals[2], 25, 41, 2541);  in TEST()
782   checkData(Point, Intervals[3], 20, 30, 2030);  in TEST()
783   checkData(Point, Intervals[4], 30, 35, 3035);  in TEST()
785   Point = 35;  in TEST()
786   Intervals = Tree.getContaining(Point);  in TEST()
788   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
789   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
790   checkData(Point, Intervals[2], 25, 41, 2541);  in TEST()
791   checkData(Point, Intervals[3], 15, 40, 1540);  in TEST()
792   checkData(Point, Intervals[4], 30, 35, 3035);  in TEST()
793   Intervals = Tree.getContaining(Point);  in TEST()
796   checkData(Point, Intervals[0], 30, 35, 3035);  in TEST()
797   checkData(Point, Intervals[1], 25, 41, 2541);  in TEST()
798   checkData(Point, Intervals[2], 31, 56, 3156);  in TEST()
799   checkData(Point, Intervals[3], 15, 40, 1540);  in TEST()
800   checkData(Point, Intervals[4], 10, 85, 1085);  in TEST()
801   Intervals = Tree.getContaining(Point);  in TEST()
804   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
805   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
806   checkData(Point, Intervals[2], 15, 40, 1540);  in TEST()
807   checkData(Point, Intervals[3], 25, 41, 2541);  in TEST()
808   checkData(Point, Intervals[4], 30, 35, 3035);  in TEST()
810   Point = 39;  in TEST()
811   Intervals = Tree.getContaining(Point);  in TEST()
813   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
814   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
815   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
816   checkData(Point, Intervals[3], 39, 50, 3950);  in TEST()
817   checkData(Point, Intervals[4], 25, 41, 2541);  in TEST()
818   checkData(Point, Intervals[5], 15, 40, 1540);  in TEST()
819   Intervals = Tree.getContaining(Point);  in TEST()
822   checkData(Point, Intervals[0], 39, 50, 3950);  in TEST()
823   checkData(Point, Intervals[1], 25, 41, 2541);  in TEST()
824   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
825   checkData(Point, Intervals[3], 31, 56, 3156);  in TEST()
826   checkData(Point, Intervals[4], 15, 40, 1540);  in TEST()
827   checkData(Point, Intervals[5], 10, 85, 1085);  in TEST()
828   Intervals = Tree.getContaining(Point);  in TEST()
831   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
832   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
833   checkData(Point, Intervals[2], 15, 40, 1540);  in TEST()
834   checkData(Point, Intervals[3], 36, 54, 3654);  in TEST()
835   checkData(Point, Intervals[4], 25, 41, 2541);  in TEST()
836   checkData(Point, Intervals[5], 39, 50, 3950);  in TEST()
838   Point = 50;  in TEST()
839   Intervals = Tree.getContaining(Point);  in TEST()
841   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
842   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
843   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
844   checkData(Point, Intervals[3], 39, 50, 3950);  in TEST()
845   checkData(Point, Intervals[4], 49, 65, 4965);  in TEST()
846   checkData(Point, Intervals[5], 50, 75, 5075);  in TEST()
847   Intervals = Tree.getContaining(Point);  in TEST()
850   checkData(Point, Intervals[0], 39, 50, 3950);  in TEST()
851   checkData(Point, Intervals[1], 49, 65, 4965);  in TEST()
852   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
853   checkData(Point, Intervals[3], 31, 56, 3156);  in TEST()
854   checkData(Point, Intervals[4], 50, 75, 5075);  in TEST()
855   checkData(Point, Intervals[5], 10, 85, 1085);  in TEST()
856   Intervals = Tree.getContaining(Point);  in TEST()
859   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
860   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
861   checkData(Point, Intervals[2], 50, 75, 5075);  in TEST()
862   checkData(Point, Intervals[3], 36, 54, 3654);  in TEST()
863   checkData(Point, Intervals[4], 49, 65, 4965);  in TEST()
864   checkData(Point, Intervals[5], 39, 50, 3950);  in TEST()
866   Point = 55;  in TEST()
867   Intervals = Tree.getContaining(Point);  in TEST()
869   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
870   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
871   checkData(Point, Intervals[2], 49, 65, 4965);  in TEST()
872   checkData(Point, Intervals[3], 50, 75, 5075);  in TEST()
873   checkData(Point, Intervals[4], 55, 61, 5561);  in TEST()
874   Intervals = Tree.getContaining(Point);  in TEST()
877   checkData(Point, Intervals[0], 55, 61, 5561);  in TEST()
878   checkData(Point, Intervals[1], 49, 65, 4965);  in TEST()
879   checkData(Point, Intervals[2], 31, 56, 3156);  in TEST()
880   checkData(Point, Intervals[3], 50, 75, 5075);  in TEST()
881   checkData(Point, Intervals[4], 10, 85, 1085);  in TEST()
882   Intervals = Tree.getContaining(Point);  in TEST()
885   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
886   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
887   checkData(Point, Intervals[2], 50, 75, 5075);  in TEST()
888   checkData(Point, Intervals[3], 49, 65, 4965);  in TEST()
889   checkData(Point, Intervals[4], 55, 61, 5561);  in TEST()
891   Point = 61;  in TEST()
892   Intervals = Tree.getContaining(Point);  in TEST()
894   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
895   checkData(Point, Intervals[1], 49, 65, 4965);  in TEST()
896   checkData(Point, Intervals[2], 50, 75, 5075);  in TEST()
897   checkData(Point, Intervals[3], 55, 61, 5561);  in TEST()
898   checkData(Point, Intervals[4], 60, 70, 6070);  in TEST()
899   Intervals = Tree.getContaining(Point);  in TEST()
902   checkData(Point, Intervals[0], 55, 61, 5561);  in TEST()
903   checkData(Point, Intervals[1], 60, 70, 6070);  in TEST()
904   checkData(Point, Intervals[2], 49, 65, 4965);  in TEST()
905   checkData(Point, Intervals[3], 50, 75, 5075);  in TEST()
906   checkData(Point, Intervals[4], 10, 85, 1085);  in TEST()
907   Intervals = Tree.getContaining(Point);  in TEST()
910   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
911   checkData(Point, Intervals[1], 50, 75, 5075);  in TEST()
912   checkData(Point, Intervals[2], 49, 65, 4965);  in TEST()
913   checkData(Point, Intervals[3], 60, 70, 6070);  in TEST()
914   checkData(Point, Intervals[4], 55, 61, 5561);  in TEST()
916   Point = 31;  in TEST()
917   Intervals = Tree.getContaining(Point);  in TEST()
919   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
920   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
921   checkData(Point, Intervals[2], 25, 41, 2541);  in TEST()
922   checkData(Point, Intervals[3], 15, 40, 1540);  in TEST()
923   checkData(Point, Intervals[4], 30, 35, 3035);  in TEST()
924   Intervals = Tree.getContaining(Point);  in TEST()
927   checkData(Point, Intervals[0], 30, 35, 3035);  in TEST()
928   checkData(Point, Intervals[1], 25, 41, 2541);  in TEST()
929   checkData(Point, Intervals[2], 31, 56, 3156);  in TEST()
930   checkData(Point, Intervals[3], 15, 40, 1540);  in TEST()
931   checkData(Point, Intervals[4], 10, 85, 1085);  in TEST()
932   Intervals = Tree.getContaining(Point);  in TEST()
935   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
936   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
937   checkData(Point, Intervals[2], 15, 40, 1540);  in TEST()
938   checkData(Point, Intervals[3], 25, 41, 2541);  in TEST()
939   checkData(Point, Intervals[4], 30, 35, 3035);  in TEST()
941   Point = 56;  in TEST()
942   Intervals = Tree.getContaining(Point);  in TEST()
944   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
945   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
946   checkData(Point, Intervals[2], 49, 65, 4965);  in TEST()
947   checkData(Point, Intervals[3], 50, 75, 5075);  in TEST()
948   checkData(Point, Intervals[4], 55, 61, 5561);  in TEST()
949   Intervals = Tree.getContaining(Point);  in TEST()
952   checkData(Point, Intervals[0], 55, 61, 5561);  in TEST()
953   checkData(Point, Intervals[1], 49, 65, 4965);  in TEST()
954   checkData(Point, Intervals[2], 31, 56, 3156);  in TEST()
955   checkData(Point, Intervals[3], 50, 75, 5075);  in TEST()
956   checkData(Point, Intervals[4], 10, 85, 1085);  in TEST()
957   Intervals = Tree.getContaining(Point);  in TEST()
960   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
961   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
962   checkData(Point, Intervals[2], 50, 75, 5075);  in TEST()
963   checkData(Point, Intervals[3], 49, 65, 4965);  in TEST()
964   checkData(Point, Intervals[4], 55, 61, 5561);  in TEST()
966   Point = 12;  in TEST()
967   Intervals = Tree.getContaining(Point);  in TEST()
969   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
970   checkData(Point, Intervals[1], 11, 16, 1116);  in TEST()
971   checkData(Point, Intervals[2], 12, 21, 1221);  in TEST()
972   Intervals = Tree.getContaining(Point);  in TEST()
975   checkData(Point, Intervals[0], 11, 16, 1116);  in TEST()
976   checkData(Point, Intervals[1], 12, 21, 1221);  in TEST()
977   checkData(Point, Intervals[2], 10, 85, 1085);  in TEST()
978   Intervals = Tree.getContaining(Point);  in TEST()
981   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
982   checkData(Point, Intervals[1], 12, 21, 1221);  in TEST()
983   checkData(Point, Intervals[2], 11, 16, 1116);  in TEST()
985   Point = 21;  in TEST()
986   Intervals = Tree.getContaining(Point);  in TEST()
988   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
989   checkData(Point, Intervals[1], 15, 40, 1540);  in TEST()
990   checkData(Point, Intervals[2], 20, 30, 2030);  in TEST()
991   checkData(Point, Intervals[3], 12, 21, 1221);  in TEST()
992   Intervals = Tree.getContaining(Point);  in TEST()
995   checkData(Point, Intervals[0], 12, 21, 1221);  in TEST()
996   checkData(Point, Intervals[1], 20, 30, 2030);  in TEST()
997   checkData(Point, Intervals[2], 15, 40, 1540);  in TEST()
998   checkData(Point, Intervals[3], 10, 85, 1085);  in TEST()
999   Intervals = Tree.getContaining(Point);  in TEST()
1002   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1003   checkData(Point, Intervals[1], 15, 40, 1540);  in TEST()
1004   checkData(Point, Intervals[2], 20, 30, 2030);  in TEST()
1005   checkData(Point, Intervals[3], 12, 21, 1221);  in TEST()
1007   Point = 25;  in TEST()
1008   Intervals = Tree.getContaining(Point);  in TEST()
1010   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1011   checkData(Point, Intervals[1], 15, 40, 1540);  in TEST()
1012   checkData(Point, Intervals[2], 20, 30, 2030);  in TEST()
1013   checkData(Point, Intervals[3], 25, 41, 2541);  in TEST()
1014   Intervals = Tree.getContaining(Point);  in TEST()
1017   checkData(Point, Intervals[0], 20, 30, 2030);  in TEST()
1018   checkData(Point, Intervals[1], 25, 41, 2541);  in TEST()
1019   checkData(Point, Intervals[2], 15, 40, 1540);  in TEST()
1020   checkData(Point, Intervals[3], 10, 85, 1085);  in TEST()
1021   Intervals = Tree.getContaining(Point);  in TEST()
1024   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1025   checkData(Point, Intervals[1], 15, 40, 1540);  in TEST()
1026   checkData(Point, Intervals[2], 25, 41, 2541);  in TEST()
1027   checkData(Point, Intervals[3], 20, 30, 2030);  in TEST()
1029   Point = 41;  in TEST()
1030   Intervals = Tree.getContaining(Point);  in TEST()
1032   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1033   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1034   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1035   checkData(Point, Intervals[3], 39, 50, 3950);  in TEST()
1036   checkData(Point, Intervals[4], 25, 41, 2541);  in TEST()
1037   Intervals = Tree.getContaining(Point);  in TEST()
1040   checkData(Point, Intervals[0], 39, 50, 3950);  in TEST()
1041   checkData(Point, Intervals[1], 25, 41, 2541);  in TEST()
1042   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1043   checkData(Point, Intervals[3], 31, 56, 3156);  in TEST()
1044   checkData(Point, Intervals[4], 10, 85, 1085);  in TEST()
1045   Intervals = Tree.getContaining(Point);  in TEST()
1048   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1049   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1050   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1051   checkData(Point, Intervals[3], 25, 41, 2541);  in TEST()
1052   checkData(Point, Intervals[4], 39, 50, 3950);  in TEST()
1054   Point = 49;  in TEST()
1055   Intervals = Tree.getContaining(Point);  in TEST()
1057   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1058   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1059   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1060   checkData(Point, Intervals[3], 39, 50, 3950);  in TEST()
1061   checkData(Point, Intervals[4], 49, 65, 4965);  in TEST()
1062   Intervals = Tree.getContaining(Point);  in TEST()
1065   checkData(Point, Intervals[0], 39, 50, 3950);  in TEST()
1066   checkData(Point, Intervals[1], 49, 65, 4965);  in TEST()
1067   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1068   checkData(Point, Intervals[3], 31, 56, 3156);  in TEST()
1069   checkData(Point, Intervals[4], 10, 85, 1085);  in TEST()
1070   Intervals = Tree.getContaining(Point);  in TEST()
1073   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1074   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1075   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1076   checkData(Point, Intervals[3], 49, 65, 4965);  in TEST()
1077   checkData(Point, Intervals[4], 39, 50, 3950);  in TEST()
1079   Point = 65;  in TEST()
1080   Intervals = Tree.getContaining(Point);  in TEST()
1082   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1083   checkData(Point, Intervals[1], 50, 75, 5075);  in TEST()
1084   checkData(Point, Intervals[2], 60, 70, 6070);  in TEST()
1085   checkData(Point, Intervals[3], 49, 65, 4965);  in TEST()
1086   Intervals = Tree.getContaining(Point);  in TEST()
1089   checkData(Point, Intervals[0], 60, 70, 6070);  in TEST()
1090   checkData(Point, Intervals[1], 49, 65, 4965);  in TEST()
1091   checkData(Point, Intervals[2], 50, 75, 5075);  in TEST()
1092   checkData(Point, Intervals[3], 10, 85, 1085);  in TEST()
1093   Intervals = Tree.getContaining(Point);  in TEST()
1096   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1097   checkData(Point, Intervals[1], 50, 75, 5075);  in TEST()
1098   checkData(Point, Intervals[2], 49, 65, 4965);  in TEST()
1099   checkData(Point, Intervals[3], 60, 70, 6070);  in TEST()
1101   Point = 71;  in TEST()
1102   Intervals = Tree.getContaining(Point);  in TEST()
1104   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1105   checkData(Point, Intervals[1], 50, 75, 5075);  in TEST()
1106   checkData(Point, Intervals[2], 71, 79, 7179);  in TEST()
1107   Intervals = Tree.getContaining(Point);  in TEST()
1110   checkData(Point, Intervals[0], 71, 79, 7179);  in TEST()
1111   checkData(Point, Intervals[1], 50, 75, 5075);  in TEST()
1112   checkData(Point, Intervals[2], 10, 85, 1085);  in TEST()
1113   Intervals = Tree.getContaining(Point);  in TEST()
1116   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1117   checkData(Point, Intervals[1], 50, 75, 5075);  in TEST()
1118   checkData(Point, Intervals[2], 71, 79, 7179);  in TEST()
1120   Point = 79;  in TEST()
1121   Intervals = Tree.getContaining(Point);  in TEST()
1123   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1124   checkData(Point, Intervals[1], 74, 80, 7480);  in TEST()
1125   checkData(Point, Intervals[2], 71, 79, 7179);  in TEST()
1126   Intervals = Tree.getContaining(Point);  in TEST()
1129   checkData(Point, Intervals[0], 74, 80, 7480);  in TEST()
1130   checkData(Point, Intervals[1], 71, 79, 7179);  in TEST()
1131   checkData(Point, Intervals[2], 10, 85, 1085);  in TEST()
1132   Intervals = Tree.getContaining(Point);  in TEST()
1135   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1136   checkData(Point, Intervals[1], 71, 79, 7179);  in TEST()
1137   checkData(Point, Intervals[2], 74, 80, 7480);  in TEST()
1139   Point = 11;  in TEST()
1140   Intervals = Tree.getContaining(Point);  in TEST()
1142   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1143   checkData(Point, Intervals[1], 11, 16, 1116);  in TEST()
1144   Intervals = Tree.getContaining(Point);  in TEST()
1147   checkData(Point, Intervals[0], 11, 16, 1116);  in TEST()
1148   checkData(Point, Intervals[1], 10, 85, 1085);  in TEST()
1149   Intervals = Tree.getContaining(Point);  in TEST()
1152   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1153   checkData(Point, Intervals[1], 11, 16, 1116);  in TEST()
1155   Point = 16;  in TEST()
1156   Intervals = Tree.getContaining(Point);  in TEST()
1158   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1159   checkData(Point, Intervals[1], 15, 40, 1540);  in TEST()
1160   checkData(Point, Intervals[2], 12, 21, 1221);  in TEST()
1161   checkData(Point, Intervals[3], 11, 16, 1116);  in TEST()
1162   Intervals = Tree.getContaining(Point);  in TEST()
1165   checkData(Point, Intervals[0], 11, 16, 1116);  in TEST()
1166   checkData(Point, Intervals[1], 12, 21, 1221);  in TEST()
1167   checkData(Point, Intervals[2], 15, 40, 1540);  in TEST()
1168   checkData(Point, Intervals[3], 10, 85, 1085);  in TEST()
1169   Intervals = Tree.getContaining(Point);  in TEST()
1172   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1173   checkData(Point, Intervals[1], 15, 40, 1540);  in TEST()
1174   checkData(Point, Intervals[2], 12, 21, 1221);  in TEST()
1175   checkData(Point, Intervals[3], 11, 16, 1116);  in TEST()
1177   Point = 20;  in TEST()
1178   Intervals = Tree.getContaining(Point);  in TEST()
1180   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1181   checkData(Point, Intervals[1], 15, 40, 1540);  in TEST()
1182   checkData(Point, Intervals[2], 20, 30, 2030);  in TEST()
1183   checkData(Point, Intervals[3], 12, 21, 1221);  in TEST()
1184   Intervals = Tree.getContaining(Point);  in TEST()
1187   checkData(Point, Intervals[0], 12, 21, 1221);  in TEST()
1188   checkData(Point, Intervals[1], 20, 30, 2030);  in TEST()
1189   checkData(Point, Intervals[2], 15, 40, 1540);  in TEST()
1190   checkData(Point, Intervals[3], 10, 85, 1085);  in TEST()
1191   Intervals = Tree.getContaining(Point);  in TEST()
1194   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1195   checkData(Point, Intervals[1], 15, 40, 1540);  in TEST()
1196   checkData(Point, Intervals[2], 20, 30, 2030);  in TEST()
1197   checkData(Point, Intervals[3], 12, 21, 1221);  in TEST()
1199   Point = 30;  in TEST()
1200   Intervals = Tree.getContaining(Point);  in TEST()
1202   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1203   checkData(Point, Intervals[1], 25, 41, 2541);  in TEST()
1204   checkData(Point, Intervals[2], 15, 40, 1540);  in TEST()
1205   checkData(Point, Intervals[3], 20, 30, 2030);  in TEST()
1206   checkData(Point, Intervals[4], 30, 35, 3035);  in TEST()
1207   Intervals = Tree.getContaining(Point);  in TEST()
1210   checkData(Point, Intervals[0], 30, 35, 3035);  in TEST()
1211   checkData(Point, Intervals[1], 20, 30, 2030);  in TEST()
1212   checkData(Point, Intervals[2], 25, 41, 2541);  in TEST()
1213   checkData(Point, Intervals[3], 15, 40, 1540);  in TEST()
1214   checkData(Point, Intervals[4], 10, 85, 1085);  in TEST()
1215   Intervals = Tree.getContaining(Point);  in TEST()
1218   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1219   checkData(Point, Intervals[1], 15, 40, 1540);  in TEST()
1220   checkData(Point, Intervals[2], 25, 41, 2541);  in TEST()
1221   checkData(Point, Intervals[3], 20, 30, 2030);  in TEST()
1222   checkData(Point, Intervals[4], 30, 35, 3035);  in TEST()
1224   Point = 36;  in TEST()
1225   Intervals = Tree.getContaining(Point);  in TEST()
1227   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1228   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1229   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1230   checkData(Point, Intervals[3], 25, 41, 2541);  in TEST()
1231   checkData(Point, Intervals[4], 15, 40, 1540);  in TEST()
1232   Intervals = Tree.getContaining(Point);  in TEST()
1235   checkData(Point, Intervals[0], 25, 41, 2541);  in TEST()
1236   checkData(Point, Intervals[1], 36, 54, 3654);  in TEST()
1237   checkData(Point, Intervals[2], 31, 56, 3156);  in TEST()
1238   checkData(Point, Intervals[3], 15, 40, 1540);  in TEST()
1239   checkData(Point, Intervals[4], 10, 85, 1085);  in TEST()
1240   Intervals = Tree.getContaining(Point);  in TEST()
1243   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1244   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1245   checkData(Point, Intervals[2], 15, 40, 1540);  in TEST()
1246   checkData(Point, Intervals[3], 36, 54, 3654);  in TEST()
1247   checkData(Point, Intervals[4], 25, 41, 2541);  in TEST()
1249   Point = 54;  in TEST()
1250   Intervals = Tree.getContaining(Point);  in TEST()
1252   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1253   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1254   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1255   checkData(Point, Intervals[3], 49, 65, 4965);  in TEST()
1256   checkData(Point, Intervals[4], 50, 75, 5075);  in TEST()
1257   Intervals = Tree.getContaining(Point);  in TEST()
1260   checkData(Point, Intervals[0], 49, 65, 4965);  in TEST()
1261   checkData(Point, Intervals[1], 36, 54, 3654);  in TEST()
1262   checkData(Point, Intervals[2], 31, 56, 3156);  in TEST()
1263   checkData(Point, Intervals[3], 50, 75, 5075);  in TEST()
1264   checkData(Point, Intervals[4], 10, 85, 1085);  in TEST()
1265   Intervals = Tree.getContaining(Point);  in TEST()
1268   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1269   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1270   checkData(Point, Intervals[2], 50, 75, 5075);  in TEST()
1271   checkData(Point, Intervals[3], 36, 54, 3654);  in TEST()
1272   checkData(Point, Intervals[4], 49, 65, 4965);  in TEST()
1274   Point = 60;  in TEST()
1275   Intervals = Tree.getContaining(Point);  in TEST()
1277   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1278   checkData(Point, Intervals[1], 49, 65, 4965);  in TEST()
1279   checkData(Point, Intervals[2], 50, 75, 5075);  in TEST()
1280   checkData(Point, Intervals[3], 55, 61, 5561);  in TEST()
1281   checkData(Point, Intervals[4], 60, 70, 6070);  in TEST()
1282   Intervals = Tree.getContaining(Point);  in TEST()
1285   checkData(Point, Intervals[0], 55, 61, 5561);  in TEST()
1286   checkData(Point, Intervals[1], 60, 70, 6070);  in TEST()
1287   checkData(Point, Intervals[2], 49, 65, 4965);  in TEST()
1288   checkData(Point, Intervals[3], 50, 75, 5075);  in TEST()
1289   checkData(Point, Intervals[4], 10, 85, 1085);  in TEST()
1290   Intervals = Tree.getContaining(Point);  in TEST()
1293   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1294   checkData(Point, Intervals[1], 50, 75, 5075);  in TEST()
1295   checkData(Point, Intervals[2], 49, 65, 4965);  in TEST()
1296   checkData(Point, Intervals[3], 60, 70, 6070);  in TEST()
1297   checkData(Point, Intervals[4], 55, 61, 5561);  in TEST()
1299   Point = 70;  in TEST()
1300   Intervals = Tree.getContaining(Point);  in TEST()
1302   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1303   checkData(Point, Intervals[1], 50, 75, 5075);  in TEST()
1304   checkData(Point, Intervals[2], 60, 70, 6070);  in TEST()
1305   Intervals = Tree.getContaining(Point);  in TEST()
1308   checkData(Point, Intervals[0], 60, 70, 6070);  in TEST()
1309   checkData(Point, Intervals[1], 50, 75, 5075);  in TEST()
1310   checkData(Point, Intervals[2], 10, 85, 1085);  in TEST()
1311   Intervals = Tree.getContaining(Point);  in TEST()
1314   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1315   checkData(Point, Intervals[1], 50, 75, 5075);  in TEST()
1316   checkData(Point, Intervals[2], 60, 70, 6070);  in TEST()
1318   Point = 74;  in TEST()
1319   Intervals = Tree.getContaining(Point);  in TEST()
1321   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1322   checkData(Point, Intervals[1], 50, 75, 5075);  in TEST()
1323   checkData(Point, Intervals[2], 71, 79, 7179);  in TEST()
1324   checkData(Point, Intervals[3], 74, 80, 7480);  in TEST()
1325   Intervals = Tree.getContaining(Point);  in TEST()
1328   checkData(Point, Intervals[0], 74, 80, 7480);  in TEST()
1329   checkData(Point, Intervals[1], 71, 79, 7179);  in TEST()
1330   checkData(Point, Intervals[2], 50, 75, 5075);  in TEST()
1331   checkData(Point, Intervals[3], 10, 85, 1085);  in TEST()
1332   Intervals = Tree.getContaining(Point);  in TEST()
1335   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1336   checkData(Point, Intervals[1], 50, 75, 5075);  in TEST()
1337   checkData(Point, Intervals[2], 71, 79, 7179);  in TEST()
1338   checkData(Point, Intervals[3], 74, 80, 7480);  in TEST()
1340   Point = 80;  in TEST()
1341   Intervals = Tree.getContaining(Point);  in TEST()
1343   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1344   checkData(Point, Intervals[1], 74, 80, 7480);  in TEST()
1345   Intervals = Tree.getContaining(Point);  in TEST()
1348   checkData(Point, Intervals[0], 74, 80, 7480);  in TEST()
1349   checkData(Point, Intervals[1], 10, 85, 1085);  in TEST()
1350   Intervals = Tree.getContaining(Point);  in TEST()
1353   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1354   checkData(Point, Intervals[1], 74, 80, 7480);  in TEST()
1356   Point = 15;  in TEST()
1357   Intervals = Tree.getContaining(Point);  in TEST()
1359   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1360   checkData(Point, Intervals[1], 15, 40, 1540);  in TEST()
1361   checkData(Point, Intervals[2], 11, 16, 1116);  in TEST()
1362   checkData(Point, Intervals[3], 12, 21, 1221);  in TEST()
1363   Intervals = Tree.getContaining(Point);  in TEST()
1366   checkData(Point, Intervals[0], 11, 16, 1116);  in TEST()
1367   checkData(Point, Intervals[1], 12, 21, 1221);  in TEST()
1368   checkData(Point, Intervals[2], 15, 40, 1540);  in TEST()
1369   checkData(Point, Intervals[3], 10, 85, 1085);  in TEST()
1370   Intervals = Tree.getContaining(Point);  in TEST()
1373   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1374   checkData(Point, Intervals[1], 15, 40, 1540);  in TEST()
1375   checkData(Point, Intervals[2], 12, 21, 1221);  in TEST()
1376   checkData(Point, Intervals[3], 11, 16, 1116);  in TEST()
1378   Point = 40;  in TEST()
1379   Intervals = Tree.getContaining(Point);  in TEST()
1381   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1382   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1383   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1384   checkData(Point, Intervals[3], 39, 50, 3950);  in TEST()
1385   checkData(Point, Intervals[4], 25, 41, 2541);  in TEST()
1386   checkData(Point, Intervals[5], 15, 40, 1540);  in TEST()
1387   Intervals = Tree.getContaining(Point);  in TEST()
1390   checkData(Point, Intervals[0], 39, 50, 3950);  in TEST()
1391   checkData(Point, Intervals[1], 25, 41, 2541);  in TEST()
1392   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1393   checkData(Point, Intervals[3], 31, 56, 3156);  in TEST()
1394   checkData(Point, Intervals[4], 15, 40, 1540);  in TEST()
1395   checkData(Point, Intervals[5], 10, 85, 1085);  in TEST()
1396   Intervals = Tree.getContaining(Point);  in TEST()
1399   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1400   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1401   checkData(Point, Intervals[2], 15, 40, 1540);  in TEST()
1402   checkData(Point, Intervals[3], 36, 54, 3654);  in TEST()
1403   checkData(Point, Intervals[4], 25, 41, 2541);  in TEST()
1404   checkData(Point, Intervals[5], 39, 50, 3950);  in TEST()
1406   Point = 43;  in TEST()
1407   Intervals = Tree.getContaining(Point);  in TEST()
1409   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1410   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1411   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1412   checkData(Point, Intervals[3], 39, 50, 3950);  in TEST()
1413   checkData(Point, Intervals[4], 43, 45, 4345);  in TEST()
1414   Intervals = Tree.getContaining(Point);  in TEST()
1417   checkData(Point, Intervals[0], 43, 45, 4345);  in TEST()
1418   checkData(Point, Intervals[1], 39, 50, 3950);  in TEST()
1419   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1420   checkData(Point, Intervals[3], 31, 56, 3156);  in TEST()
1421   checkData(Point, Intervals[4], 10, 85, 1085);  in TEST()
1422   Intervals = Tree.getContaining(Point);  in TEST()
1425   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1426   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1427   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1428   checkData(Point, Intervals[3], 39, 50, 3950);  in TEST()
1429   checkData(Point, Intervals[4], 43, 45, 4345);  in TEST()
1431   Point = 45;  in TEST()
1432   Intervals = Tree.getContaining(Point);  in TEST()
1434   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1435   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1436   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1437   checkData(Point, Intervals[3], 39, 50, 3950);  in TEST()
1438   checkData(Point, Intervals[4], 43, 45, 4345);  in TEST()
1439   Intervals = Tree.getContaining(Point);  in TEST()
1442   checkData(Point, Intervals[0], 43, 45, 4345);  in TEST()
1443   checkData(Point, Intervals[1], 39, 50, 3950);  in TEST()
1444   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1445   checkData(Point, Intervals[3], 31, 56, 3156);  in TEST()
1446   checkData(Point, Intervals[4], 10, 85, 1085);  in TEST()
1447   Intervals = Tree.getContaining(Point);  in TEST()
1450   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1451   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1452   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1453   checkData(Point, Intervals[3], 39, 50, 3950);  in TEST()
1454   checkData(Point, Intervals[4], 43, 45, 4345);  in TEST()
1456   Point = 50;  in TEST()
1457   Intervals = Tree.getContaining(Point);  in TEST()
1459   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1460   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1461   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1462   checkData(Point, Intervals[3], 39, 50, 3950);  in TEST()
1463   checkData(Point, Intervals[4], 49, 65, 4965);  in TEST()
1464   checkData(Point, Intervals[5], 50, 75, 5075);  in TEST()
1465   Intervals = Tree.getContaining(Point);  in TEST()
1468   checkData(Point, Intervals[0], 39, 50, 3950);  in TEST()
1469   checkData(Point, Intervals[1], 49, 65, 4965);  in TEST()
1470   checkData(Point, Intervals[2], 36, 54, 3654);  in TEST()
1471   checkData(Point, Intervals[3], 31, 56, 3156);  in TEST()
1472   checkData(Point, Intervals[4], 50, 75, 5075);  in TEST()
1473   checkData(Point, Intervals[5], 10, 85, 1085);  in TEST()
1474   Intervals = Tree.getContaining(Point);  in TEST()
1477   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1478   checkData(Point, Intervals[1], 31, 56, 3156);  in TEST()
1479   checkData(Point, Intervals[2], 50, 75, 5075);  in TEST()
1480   checkData(Point, Intervals[3], 36, 54, 3654);  in TEST()
1481   checkData(Point, Intervals[4], 49, 65, 4965);  in TEST()
1482   checkData(Point, Intervals[5], 39, 50, 3950);  in TEST()
1484   Point = 75;  in TEST()
1485   Intervals = Tree.getContaining(Point);  in TEST()
1487   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1488   checkData(Point, Intervals[1], 50, 75, 5075);  in TEST()
1489   checkData(Point, Intervals[2], 74, 80, 7480);  in TEST()
1490   checkData(Point, Intervals[3], 71, 79, 7179);  in TEST()
1491   Intervals = Tree.getContaining(Point);  in TEST()
1494   checkData(Point, Intervals[0], 74, 80, 7480);  in TEST()
1495   checkData(Point, Intervals[1], 71, 79, 7179);  in TEST()
1496   checkData(Point, Intervals[2], 50, 75, 5075);  in TEST()
1497   checkData(Point, Intervals[3], 10, 85, 1085);  in TEST()
1498   Intervals = Tree.getContaining(Point);  in TEST()
1501   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1502   checkData(Point, Intervals[1], 50, 75, 5075);  in TEST()
1503   checkData(Point, Intervals[2], 71, 79, 7179);  in TEST()
1504   checkData(Point, Intervals[3], 74, 80, 7480);  in TEST()
1506   Point = 10;  in TEST()
1507   Intervals = Tree.getContaining(Point);  in TEST()
1509   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1511   Point = 85;  in TEST()
1512   Intervals = Tree.getContaining(Point);  in TEST()
1514   checkData(Point, Intervals[0], 10, 85, 1085);  in TEST()
1517   Point = 5;  in TEST()
1518   Intervals = Tree.getContaining(Point);  in TEST()
1520   Point = 90;  in TEST()
1521   Intervals = Tree.getContaining(Point);  in TEST()
1529   UUPoint Point;  in TEST()  local
1549     Point = 10;  in TEST()
1550     UUIter Iter = Tree.find(Point);  in TEST()
1552     checkData(Point, Iter, 10, 20, 1020);  in TEST()
1558     Point = 15;  in TEST()
1559     UUIter Iter = Tree.find(Point);  in TEST()
1561     checkData(Point, Iter, 15, 25, 1525);  in TEST()
1564     checkData(Point, Iter, 10, 20, 1020);  in TEST()
1570     Point = 20;  in TEST()
1571     UUIter Iter = Tree.find(Point);  in TEST()
1573     checkData(Point, Iter, 15, 25, 1525);  in TEST()
1576     checkData(Point, Iter, 10, 20, 1020);  in TEST()
1582     Point = 25;  in TEST()
1583     UUIter Iter = Tree.find(Point);  in TEST()
1585     checkData(Point, Iter, 15, 25, 1525);  in TEST()
1591     Point = 5;  in TEST()
1592     UUIter Iter = Tree.find(Point);  in TEST()
1596     Point = 45;  in TEST()
1597     UUIter Iter = Tree.find(Point);  in TEST()
1601     Point = 70;  in TEST()
1602     UUIter Iter = Tree.find(Point);  in TEST()