Mercurial > hg > nsaunier > traffic-intelligence

comparison python/tests/moving.txt @ 152:74b1fc68d4df

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
re-organized code to avoid cyclic python module dependencies
author Nicolas Saunier <nicolas.saunier@polymtl.ca>
date Tue, 06 Sep 2011 18:44:23 -0400
parents 606010d1d9a4
children 571ba5ed22e2
comparison
equal deleted inserted replaced
151:4af774bb186d 152:74b1fc68d4df
41 >>> Point(3,2).inPolygon([Point(0,0),Point(1,0),Point(1,1),Point(0,1)]) 41 >>> Point(3,2).inPolygon([Point(0,0),Point(1,0),Point(1,1),Point(0,1)])
42 False 42 False
43 >>> Point(3,2).inPolygon([Point(0,0),Point(4,0),Point(4,3),Point(0,3)]) 43 >>> Point(3,2).inPolygon([Point(0,0),Point(4,0),Point(4,3),Point(0,3)])
44 True 44 True
45 45
46 >>> segmentIntersection(Point(0,0),Point(1,1), Point(0,1), Point(1,2))
47 >>> segmentIntersection(Point(0,1),Point(1,0), Point(0,2), Point(2,1))
48 >>> segmentIntersection(Point(0,0),Point(2,0), Point(1,-1),Point(1,1))
49 (1.000000,0.000000)
50 >>> segmentIntersection(Point(0,1),Point(2,0),Point(1,1),Point(1,2))
51
46 >>> Trajectory().length() 52 >>> Trajectory().length()
47 0 53 0
48 >>> t1 = Trajectory([[0.5,1.5,2.5],[0.5,3.5,6.5]]) 54 >>> t1 = Trajectory([[0.5,1.5,2.5],[0.5,3.5,6.5]])
49 >>> t1.length() == 3. 55 >>> t1.length() == 3.
50 True 56 True