Mercurial > hg > nsaunier > traffic-intelligence

comparison python/tests/utils.txt @ 746:e7ff0f60fef8

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
merged new developments (indicator and trajectory clustering)
author Nicolas Saunier <nicolas.saunier@polymtl.ca>
date Thu, 10 Sep 2015 15:52:45 -0400
parents 4b3518f6dd01
children 8e8ec4ece66e
comparison
equal deleted inserted replaced
727:c6d4ea05a2d0 746:e7ff0f60fef8
1 >>> from utils import * 1 >>> from utils import *
2 >>> from moving import Point 2 >>> from moving import Point
3
4 >>> upperCaseFirstLetter('mmmm... donuts')
5 'Mmmm... Donuts'
6 >>> s = upperCaseFirstLetter('much ado about nothing')
7 >>> s == 'Much Ado About Nothing'
8 True
9 >>> upperCaseFirstLetter(s) == s
10 True
3 11
4 >>> computeChi2([],[]) 12 >>> computeChi2([],[])
5 0.0 13 0.0
6 >>> computeChi2(range(1,10),range(1,10)) 14 >>> computeChi2(range(1,10),range(1,10))
7 0.0 15 0.0
47 'b' 55 'b'
48 >>> mostCommon(range(10)+[1]) 56 >>> mostCommon(range(10)+[1])
49 1 57 1
50 >>> mostCommon([range(2), range(4), range(2)]) 58 >>> mostCommon([range(2), range(4), range(2)])
51 [0, 1] 59 [0, 1]
60
61 >>> res = sortByLength([range(3), range(4), range(1)])
62 >>> [len(r) for r in res]
63 [1, 3, 4]
64 >>> res = sortByLength([range(3), range(4), range(1), range(5)], reverse = True)
65 >>> [len(r) for r in res]
66 [5, 4, 3, 1]
52 67
53 >>> lcss = LCSS(similarityFunc = lambda x,y: abs(x-y) <= 0.1) 68 >>> lcss = LCSS(similarityFunc = lambda x,y: abs(x-y) <= 0.1)
54 >>> lcss.compute(range(5), range(5)) 69 >>> lcss.compute(range(5), range(5))
55 5 70 5
56 >>> lcss.compute(range(1,5), range(5)) 71 >>> lcss.compute(range(1,5), range(5))