3 # This file is part of DisOrder.
4 # Copyright (C) 2007-2009 Richard Kettlewell
6 # This program is free software: you can redistribute it and/or modify
7 # it under the terms of the GNU General Public License as published by
8 # the Free Software Foundation, either version 3 of the License, or
9 # (at your option) any later version.
11 # This program is distributed in the hope that it will be useful,
12 # but WITHOUT ANY WARRANTY; without even the implied warranty of
13 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 # GNU General Public License for more details.
16 # You should have received a copy of the GNU General Public License
17 # along with this program. If not, see <http://www.gnu.org/licenses/>.
19 import dtest,time,disorder,re,sys
22 """Play some tracks"""
25 dtest.rescan() # ensure all files are scanned
28 assert c.random_enabled() == False
29 track = u"%s/Joe Bloggs/First Album/02:Second track.ogg" % dtest.tracks
30 track2 = u"%s/Joe Bloggs/First Album/04:Fourth track.ogg" % dtest.tracks
31 track3 = u"%s/Joe Bloggs/First Album/05:Fifth track.ogg" % dtest.tracks
32 print " adding track to queue"
34 assert c.enabled() == False
36 print " checking track turned up in queue"
38 ts = filter(lambda t: t['track'] == track and 'submitter' in t, q)
39 assert len(ts) == 1, "checking track appears exactly once in queue"
41 assert t['submitter'] == u'fred', "check queue submitter"
43 print " waiting for track"
45 assert c.enabled() == True
49 while not((p is not None and p['id'] == i)
50 or (len(filter(lambda t: t['track'] == track
51 and 'submitter' in t, r)) > 0)) and limit > 0:
56 assert limit > 0, "check track did complete in a reasonable time"
57 print " checking track turned up in recent list"
58 while (p is not None and p['id'] == i):
62 ts = filter(lambda t: t['track'] == track and 'submitter' in t, r)
63 assert len(ts) == 1, "check track appears exactly once in recent"
65 assert t['submitter'] == u'fred', "check recent entry submitter"
67 print " ensuring queue is clear"
69 while c.playing() is not None:
75 print " testing playafter"
76 print " adding to empty queue"
77 c.playafter(None, [track])
79 print '\n'.join(map(lambda n: "%d: %s" % (n, q[n]["track"]),
82 assert q[0]['track'] == track
83 print " insert at start of queue"
84 c.playafter(None, [track2])
86 print '\n'.join(map(lambda n: "%d: %s" % (n, q[n]["track"]),
89 assert q[0]['track'] == track2
90 assert q[1]['track'] == track
91 print " insert in middle of queue"
92 c.playafter(q[0]['id'], [track3])
94 print '\n'.join(map(lambda n: "%d: %s" % (n, q[n]["track"]),
97 assert q[0]['track'] == track2
98 assert q[1]['track'] == track3
99 assert q[2]['track'] == track
100 print " insert multiple tracks at end of queue"
101 c.playafter(q[2]['id'], [track2, track])
103 print '\n'.join(map(lambda n: "%d: %s" % (n, q[n]["track"]),
106 assert q[0]['track'] == track2
107 assert q[1]['track'] == track3
108 assert q[2]['track'] == track
109 assert q[3]['track'] == track2
110 assert q[4]['track'] == track
112 print " clearing queue"
116 print " testing scratches"
119 while scratchlimit > 0:
122 print " starting a track"
127 print " track played too quickly, trying again..."
129 print " scratching track"
132 print " waiting for track to finish"
135 while (p is not None and p['id'] == i) and limit > 0:
139 assert limit > 0, "check track finishes in a reasonable period"
140 print " checking scratched track turned up in recent list"
142 ts = filter(lambda t: t['id'] == i, r)
143 assert len(ts) == 1, "check scratched track appears exactly once in recent"
144 if ts[0]['state'] == 'ok':
145 print " track played too quickly, trying again..."
147 assert ts[0]['state'] == 'scratched', "checking track scratched"
149 if scratchlimit == 0:
150 # TODO this is really not a great approach!
151 print " didn't complete in a reasonable time"
153 print " waiting for scratch to complete"
158 assert p is None, "checking nothing is playing"
159 assert c.enabled() == True
161 assert c.random_enabled() == True
163 if __name__ == '__main__':