1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
# Copyright 2010 Lars Wirzenius
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
import os
import shutil
import tempfile
import unittest
import larch
class UploadQueueTests(unittest.TestCase):
def setUp(self):
self.max_queue = 2
self.nodes = []
self.uq = larch.UploadQueue(self.really_put, self.max_queue)
self.node = larch.LeafNode(1, [], [])
def really_put(self, node):
self.nodes.append(node)
def test_has_no_nodes_initially(self):
self.assertEqual(self.uq.list_ids(), [])
def test_get_returns_None_for_nonexistent_node(self):
self.assertEqual(self.uq.get(self.node.id), None)
def test_puts_node(self):
self.uq.put(self.node)
self.assertEqual(self.uq.list_ids(), [self.node.id])
self.assertEqual(self.uq.get(self.node.id), self.node)
def test_put_replaces_existing_node(self):
node2 = larch.LeafNode(1, ['foo'], ['bar'])
self.uq.put(self.node)
self.uq.put(node2)
self.assertEqual(self.uq.get(self.node.id), node2)
def test_remove_returns_false_for_nonexistent_node(self):
self.assertEqual(self.uq.remove(self.node.id), False)
def test_remove_removes_node(self):
self.uq.put(self.node)
self.uq.remove(self.node.id)
self.assertEqual(self.uq.list_ids(), [])
self.assertEqual(self.uq.get(self.node.id), None)
def test_does_not_push_first_node(self):
self.uq.put(self.node)
self.assertEqual(self.nodes, [])
def test_does_not_push_second_node(self):
self.uq.put(self.node)
self.uq.put(larch.LeafNode(2, [], []))
self.assertEqual(self.nodes, [])
def test_pushes_first_node_after_third_is_pushed(self):
self.uq.put(self.node)
self.uq.put(larch.LeafNode(2, [], []))
self.uq.put(larch.LeafNode(3, [], []))
self.assertEqual(self.nodes, [self.node])
def test_pushes_oldest_even_if_recently_used(self):
self.uq.put(self.node)
self.uq.put(larch.LeafNode(2, [], []))
self.uq.get(self.node.id)
self.uq.put(larch.LeafNode(3, [], []))
self.assertEqual(self.nodes, [self.node])
def test_pushes_out_only_node_when_requested(self):
self.uq.put(self.node)
self.uq.push()
self.assertEqual(self.nodes, [self.node])
|
