Mercurial > p > roundup > code
diff test/db_test_base.py @ 6413:7b1b6dffc7ed
Fix searching+sorting for Link properties
Note that this turns off recursive pre-populating the cache in
filter_iter, we only pre-populate the top-level element. Otherwise this
interacts with searching producing duplicates.
| author | Ralf Schlatterbeck <rsc@runtux.com> |
|---|---|
| date | Mon, 17 May 2021 20:52:27 +0200 |
| parents | a0c0ee3ed8b1 |
| children | dbacf6bf2a2f |
line wrap: on
line diff
--- a/test/db_test_base.py Mon May 17 17:35:50 2021 +0200 +++ b/test/db_test_base.py Mon May 17 20:52:27 2021 +0200 @@ -3658,14 +3658,14 @@ ('+','username')]): result.append(id) nodeid = id - for x in range(4): - assert(('user', nodeid) in self.db.cache) - n = self.db.user.getnode(nodeid) - for k, v in user_result[nodeid].items(): - ae((k, n[k]), (k, v)) - for k in 'creation', 'activity': - assert(n[k]) - nodeid = n.supervisor + # Note in the recent implementation we do not recursively + # cache results in filter_iter + assert(('user', nodeid) in self.db.cache) + n = self.db.user.getnode(nodeid) + for k, v in user_result[nodeid].items(): + ae((k, n[k]), (k, v)) + for k in 'creation', 'activity': + assert(n[k]) self.db.clearCache() ae (result, ['8', '9', '10', '6', '7', '1', '3', '2', '4', '5']) @@ -3683,14 +3683,13 @@ for k in 'creation', 'activity': assert(n[k]) nodeid = n.assignedto - for x in range(4): - assert(('user', nodeid) in self.db.cache) - n = self.db.user.getnode(nodeid) - for k, v in user_result[nodeid].items(): - ae((k, n[k]), (k, v)) - for k in 'creation', 'activity': - assert(n[k]) - nodeid = n.supervisor + # Note in the recent implementation we do not recursively + # cache results in filter_iter + n = self.db.user.getnode(nodeid) + for k, v in user_result[nodeid].items(): + ae((k, n[k]), (k, v)) + for k in 'creation', 'activity': + assert(n[k]) self.db.clearCache() ae (result, ['4', '5', '6', '7', '8', '1', '2', '3'])