Mercurial > hg > nsaunier > traffic-intelligence

comparison python/tests/moving.txt @ 776:84420159c5f4 dev

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
added __eq__ functions for Point and Trajectory
author Nicolas Saunier <nicolas.saunier@polymtl.ca>
date Fri, 05 Feb 2016 17:17:12 -0500
parents f8e0a8ea8402
children e2452abba0e7
comparison
equal deleted inserted replaced
775:56153d439f8c 776:84420159c5f4
17 17
18 >>> TimeInterval(0,1).length() 18 >>> TimeInterval(0,1).length()
19 2.0 19 2.0
20 >>> TimeInterval(10,8).length() 20 >>> TimeInterval(10,8).length()
21 0.0 21 0.0
22 >>> TimeInterval(10,8) == TimeInterval(10,8)
23 True
24 >>> TimeInterval(10,8) == TimeInterval(8,10)
25 True
26 >>> TimeInterval(11,8) == TimeInterval(10,8)
27 False
22 28
23 >>> [i for i in TimeInterval(9,13)] 29 >>> [i for i in TimeInterval(9,13)]
24 [9, 10, 11, 12, 13] 30 [9, 10, 11, 12, 13]
25 31
26 >>> TimeInterval(2,5).equal(TimeInterval(2,5)) 32 >>> TimeInterval(2,5).equal(TimeInterval(2,5))
39 >>> TimeInterval(20,30).distance(TimeInterval(3,15)) 45 >>> TimeInterval(20,30).distance(TimeInterval(3,15))
40 5 46 5
41 >>> TimeInterval.unionIntervals([TimeInterval(3,6), TimeInterval(8,10),TimeInterval(11,15)]) 47 >>> TimeInterval.unionIntervals([TimeInterval(3,6), TimeInterval(8,10),TimeInterval(11,15)])
42 [3, 15] 48 [3, 15]
43 49
50 >>> Point(0,3) == Point(0,3)
51 True
52 >>> Point(0,3) == Point(0,3.2)
53 False
44 >>> Point(3,4)-Point(1,7) 54 >>> Point(3,4)-Point(1,7)
45 (2.000000,-3.000000) 55 (2.000000,-3.000000)
46 >>> -Point(1,2) 56 >>> -Point(1,2)
47 (-1.000000,-2.000000) 57 (-1.000000,-2.000000)
48 >>> Point(1,2).multiply(0.5) 58 >>> Point(1,2).multiply(0.5)
67 >>> segmentIntersection(Point(0.,0.), Point(2.,2.), Point(0.,2.), Point(2.,0.)) 77 >>> segmentIntersection(Point(0.,0.), Point(2.,2.), Point(0.,2.), Point(2.,0.))
68 (1.000000,1.000000) 78 (1.000000,1.000000)
69 >>> segmentIntersection(Point(0,0), Point(4,4), Point(0,4), Point(4,0)) 79 >>> segmentIntersection(Point(0,0), Point(4,4), Point(0,4), Point(4,0))
70 (2.000000,2.000000) 80 (2.000000,2.000000)
71 >>> segmentIntersection(Point(0,1), Point(1,2), Point(2,0), Point(3,2)) 81 >>> segmentIntersection(Point(0,1), Point(1,2), Point(2,0), Point(3,2))
82
83 >>> t1 = Trajectory.fromPointList([(92.2, 102.9), (56.7, 69.6)])
84 >>> t2 = Trajectory.fromPointList([(92.2, 102.9), (56.7, 69.6)])
85 >>> t1 == t2
86 True
87 >>> t3 = Trajectory.fromPointList([(92.24, 102.9), (56.7, 69.6)])
88 >>> t1 == t3
89 False
90 >>> t3 = Trajectory.fromPointList([(92.2, 102.9), (56.7, 69.6), (56.7, 69.6)])
91 >>> t1 == t3
92 False
72 93
73 >>> left = Trajectory.fromPointList([(92.291666666666686, 102.99239033124439), (56.774193548387103, 69.688898836168306)]) 94 >>> left = Trajectory.fromPointList([(92.291666666666686, 102.99239033124439), (56.774193548387103, 69.688898836168306)])
74 >>> middle = Trajectory.fromPointList([(87.211021505376351, 93.390778871978512), (59.032258064516128, 67.540286481647257)]) 95 >>> middle = Trajectory.fromPointList([(87.211021505376351, 93.390778871978512), (59.032258064516128, 67.540286481647257)])
75 >>> right = Trajectory.fromPointList([(118.82392473118281, 115.68263205013426), (63.172043010752688, 66.600268576544309)]) 96 >>> right = Trajectory.fromPointList([(118.82392473118281, 115.68263205013426), (63.172043010752688, 66.600268576544309)])
76 >>> alignments = [left, middle, right] 97 >>> alignments = [left, middle, right]