Mercurial > hg > nsaunier > traffic-intelligence
comparison python/tests/moving.txt @ 255:13ec22bec5d4
corrected typos and bugs and added a test
| author | Nicolas Saunier <nicolas.saunier@polymtl.ca> |
|---|---|
| date | Mon, 23 Jul 2012 23:07:19 -0400 |
| parents | 99173da7afae |
| children | f2cf16ad798f |
comparison
equal
deleted
inserted
replaced
| 254:4b71e81e3383 | 255:13ec22bec5d4 |
|---|---|
| 52 >>> Point(3,2).inPolygon([Point(0,0),Point(1,0),Point(1,1),Point(0,1)]) | 52 >>> Point(3,2).inPolygon([Point(0,0),Point(1,0),Point(1,1),Point(0,1)]) |
| 53 False | 53 False |
| 54 >>> Point(3,2).inPolygon([Point(0,0),Point(4,0),Point(4,3),Point(0,3)]) | 54 >>> Point(3,2).inPolygon([Point(0,0),Point(4,0),Point(4,3),Point(0,3)]) |
| 55 True | 55 True |
| 56 | 56 |
| 57 >>> predictPosition(10, Point(0,0), Point(1,1)) # doctest:+ELLIPSIS | 57 >>> predictPositionNoLimit(10, Point(0,0), Point(1,1)) # doctest:+ELLIPSIS |
| 58 (10...,10...) | 58 ((1.0...,1.0...), (10.0...,10.0...)) |
| 59 | 59 |
| 60 >>> segmentIntersection(Point(0,0),Point(1,1), Point(0,1), Point(1,2)) | 60 >>> segmentIntersection(Point(0,0),Point(1,1), Point(0,1), Point(1,2)) |
| 61 >>> segmentIntersection(Point(0,1),Point(1,0), Point(0,2), Point(2,1)) | 61 >>> segmentIntersection(Point(0,1),Point(1,0), Point(0,2), Point(2,1)) |
| 62 >>> segmentIntersection(Point(0,0),Point(2,0), Point(1,-1),Point(1,1)) | 62 >>> segmentIntersection(Point(0,0),Point(2,0), Point(1,-1),Point(1,1)) |
| 63 (1.000000,0.000000) | 63 (1.000000,0.000000) |
