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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
|
##############################################################################
# Copyright (c) 2016 ZTE Corporation
# feng.xiaowei@zte.com.cn
# All rights reserved. This program and the accompanying materials
# are made available under the terms of the Apache License, Version 2.0
# which accompanies this distribution, and is available at
# http://www.apache.org/licenses/LICENSE-2.0
##############################################################################
import re
from operator import itemgetter
from bson.objectid import ObjectId
from concurrent.futures import ThreadPoolExecutor
def thread_execute(method, *args, **kwargs):
with ThreadPoolExecutor(max_workers=2) as executor:
result = executor.submit(method, *args, **kwargs)
return result
class MemCursor(object):
def __init__(self, collection):
self.collection = collection
self.length = len(self.collection)
self.sorted = []
def _is_next_exist(self):
return self.length != 0
@property
def fetch_next(self):
return thread_execute(self._is_next_exist)
def next_object(self):
self.length -= 1
return self.collection.pop()
def sort(self, key_or_list):
for k, v in key_or_list.iteritems():
if v == -1:
reverse = True
else:
reverse = False
self.collection = sorted(self.collection,
key=itemgetter(k), reverse=reverse)
return self
def limit(self, limit):
if limit != 0 and limit < len(self.collection):
self.collection = self.collection[0: limit]
self.length = limit
return self
def skip(self, skip):
if skip < self.length and (skip > 0):
self.collection = self.collection[self.length - skip: -1]
self.length -= skip
elif skip >= self.length:
self.collection = []
self.length = 0
return self
def _count(self):
return self.length
def count(self):
return thread_execute(self._count)
class MemDb(object):
def __init__(self, name):
self.name = name
self.contents = []
pass
def _find_one(self, spec_or_id=None, *args):
if spec_or_id is not None and not isinstance(spec_or_id, dict):
spec_or_id = {"_id": spec_or_id}
if '_id' in spec_or_id:
spec_or_id['_id'] = str(spec_or_id['_id'])
cursor = self._find(spec_or_id, *args)
for result in cursor:
return result
return None
def find_one(self, spec_or_id=None, *args):
return thread_execute(self._find_one, spec_or_id, *args)
def _insert(self, doc_or_docs, check_keys=True):
docs = doc_or_docs
return_one = False
if isinstance(docs, dict):
return_one = True
docs = [docs]
if check_keys:
for doc in docs:
self._check_keys(doc)
ids = []
for doc in docs:
if '_id' not in doc:
doc['_id'] = str(ObjectId())
if not self._find_one(doc['_id']):
ids.append(doc['_id'])
self.contents.append(doc_or_docs)
if len(ids) == 0:
return None
if return_one:
return ids[0]
else:
return ids
def insert(self, doc_or_docs, check_keys=True):
return thread_execute(self._insert, doc_or_docs, check_keys)
@staticmethod
def _compare_date(spec, value):
gte = True
lt = False
for k, v in spec.iteritems():
if k == '$gte' and value < v:
gte = False
elif k == '$lt' and value < v:
lt = True
return gte and lt
def _in(self, content, *args):
if self.name == 'scenarios':
return self._in_scenarios(content, *args)
else:
return self._in_others(content, *args)
def _in_scenarios_installer(self, installer, content):
hit = False
for s_installer in content['installers']:
if installer == s_installer['installer']:
hit = True
return hit
def _in_scenarios_version(self, version, content):
hit = False
for s_installer in content['installers']:
for s_version in s_installer['versions']:
if version == s_version['version']:
hit = True
return hit
def _in_scenarios_project(self, project, content):
hit = False
for s_installer in content['installers']:
for s_version in s_installer['versions']:
for s_project in s_version['projects']:
if project == s_project['project']:
hit = True
return hit
def _in_scenarios(self, content, *args):
for arg in args:
for k, v in arg.iteritems():
if k == 'installers':
for inner in v.values():
for i_k, i_v in inner.iteritems():
if i_k == 'installer':
return self._in_scenarios_installer(i_v,
content)
elif i_k == 'versions.version':
return self._in_scenarios_version(i_v,
content)
elif i_k == 'versions.projects.project':
return self._in_scenarios_project(i_v,
content)
elif content.get(k, None) != v:
return False
return True
def _in_others(self, content, *args):
for arg in args:
for k, v in arg.iteritems():
if k == 'start_date':
if not MemDb._compare_date(v, content.get(k)):
return False
elif k == 'trust_indicator.current':
if content.get('trust_indicator').get('current') != v:
return False
elif not isinstance(v, dict):
if isinstance(v, re._pattern_type):
if v.match(content.get(k, None)) is None:
return False
else:
if content.get(k, None) != v:
return False
return True
def _find(self, *args):
res = []
for content in self.contents:
if self._in(content, *args):
res.append(content)
return res
def find(self, *args):
return MemCursor(self._find(*args))
def _aggregate(self, *args, **kwargs):
res = self.contents
for arg in args[0]:
for k, v in arg.iteritems():
if k == '$match':
res = self._find(v)
cursor = MemCursor(res)
for arg in args[0]:
for k, v in arg.iteritems():
if k == '$sort':
cursor = cursor.sort(v)
elif k == '$skip':
cursor = cursor.skip(v)
elif k == '$limit':
cursor = cursor.limit(v)
return cursor
def aggregate(self, *args, **kwargs):
return self._aggregate(*args, **kwargs)
def _update(self, spec, document, check_keys=True):
updated = False
if check_keys:
self._check_keys(document)
for index in range(len(self.contents)):
content = self.contents[index]
if self._in(content, spec):
for k, v in document.iteritems():
updated = True
content[k] = v
self.contents[index] = content
return updated
def update(self, spec, document, check_keys=True):
return thread_execute(self._update, spec, document, check_keys)
def _remove(self, spec_or_id=None):
if spec_or_id is None:
self.contents = []
if not isinstance(spec_or_id, dict):
spec_or_id = {'_id': spec_or_id}
for index in range(len(self.contents)):
content = self.contents[index]
if self._in(content, spec_or_id):
del self.contents[index]
return True
return False
def remove(self, spec_or_id=None):
return thread_execute(self._remove, spec_or_id)
def clear(self):
self._remove()
def _check_keys(self, doc):
for key in doc.keys():
if '.' in key:
raise NameError('key {} must not contain .'.format(key))
if key.startswith('$'):
raise NameError('key {} must not start with $'.format(key))
if isinstance(doc.get(key), dict):
self._check_keys(doc.get(key))
def __getattr__(name):
return globals()[name]
pods = MemDb('pods')
projects = MemDb('projects')
testcases = MemDb('testcases')
results = MemDb('results')
scenarios = MemDb('scenarios')
tokens = MemDb('tokens')
users = MemDb('users')
|
