SHA256
105 lines
5.3 KiB
Python
105 lines
5.3 KiB
Python
#!/usr/bin/env python3
|
|
"""Offline invariants for synthetic graph. No DB required."""
|
|
from collections import Counter, defaultdict, deque
|
|
from pathlib import Path
|
|
from generate import network, generate, GROUPS, HUBS, COUNT, REL_HASH, MARKER
|
|
|
|
users, edges, deg = network()
|
|
assert (users, edges, deg) == network(), 'generation must be deterministic'
|
|
assert len(users) == COUNT == 250
|
|
assert len({u['login'] for u in users}) == COUNT
|
|
assert [u['login'] for u in users] == [f'testuser{i:03d}@free' for i in range(1,251)]
|
|
assert Counter(u['community'] for u in users) == dict(GROUPS)
|
|
assert len({n for n,s in GROUPS}) == 10 and sum(s for n,s in GROUPS) == 250
|
|
assert len(set(s for n,s in GROUPS)) == 10, 'each community should have different size'
|
|
assert sum(bool(u['secondary']) for u in users) == 100
|
|
assert all('ДЕМО SHiNE' in u['about'] and 'Мои сообщества:' in u['about'] for u in users)
|
|
assert all(u['community'] in u['about'] for u in users)
|
|
assert all(not u['secondary'] or u['secondary'] in u['about'] for u in users)
|
|
assert all(len(u['about']) <= 160 for u in users)
|
|
assert Counter(u['shine'] for u in users) == {'shining': 83, 'unknown': 167}
|
|
assert Counter(u['role'] for u in users) == {'primary': 167, 'non_voting': 83}
|
|
assert 'not_interested' not in {u['shine'] for u in users}
|
|
assert len(edges) == len(set(edges))
|
|
assert all(a != b and a in range(1,251) and b in range(1,251) for a,t,b in edges)
|
|
types = Counter(t for a,t,b in edges)
|
|
assert set(types) == {10,14,70,80}
|
|
assert types[70] == 500 and types[80] == 1000
|
|
assert types[10] > 500 and types[14] > 1500
|
|
|
|
userbyid = {u['id']:u for u in users}
|
|
received = defaultdict(Counter)
|
|
issued = defaultdict(Counter)
|
|
friends = {}
|
|
adj = defaultdict(set)
|
|
for src,t,dst in edges:
|
|
if t in (10,14):
|
|
assert (src,dst) not in friends, 'only one friendship type per direction'
|
|
friends[(src,dst)] = t
|
|
adj[src].add(dst)
|
|
adj[dst].add(src)
|
|
else:
|
|
issuer = userbyid[src]
|
|
recipient = userbyid[dst]
|
|
assert issuer['role'] == 'primary'
|
|
if t == 70:
|
|
assert issuer['shine'] == 'shining'
|
|
assert recipient['shine'] == 'shining'
|
|
else:
|
|
assert recipient['role'] == 'primary'
|
|
received[dst][t] += 1
|
|
issued[src][t] += 1
|
|
assert Counter(received[i][70] for i in range(1,251) if userbyid[i]['shine']=='shining') == {
|
|
20:11, 10:16, 5:20, 1:20, 0:16}
|
|
assert Counter(received[i][80] for i in range(1,251) if userbyid[i]['role']=='primary') == {
|
|
20:20, 10:38, 5:40, 1:20, 0:49}
|
|
assert max(sum(issued[i].values()) for i in range(1,251)) <= 80
|
|
pairs = {tuple(sorted(p)) for p in friends}
|
|
mutual = sum((a,b) in friends and (b,a) in friends for a,b in pairs)
|
|
assert mutual / len(pairs) >= 0.9, f'mutual rate is {mutual / len(pairs):.3f}'
|
|
closepairs = {tuple(sorted(p)) for p,t in friends.items() if t==10}
|
|
closeboth = sum(friends.get((a,b))==10 and friends.get((b,a))==10 for a,b in closepairs)
|
|
assert closeboth / len(closepairs) >= 0.80
|
|
for hub, degree in HUBS.items():
|
|
assert len(adj[hub]) == degree
|
|
assert sum(src==hub and t in (10,14) for src,t,dst in edges) == degree
|
|
seen={1}
|
|
queue=deque([1])
|
|
while queue:
|
|
for peer in adj[queue.popleft()]:
|
|
if peer not in seen:
|
|
seen.add(peer)
|
|
queue.append(peer)
|
|
assert len(seen)==COUNT, 'all friend clusters must connect'
|
|
|
|
base = Path(__file__).resolve().parent
|
|
before = {name: (base/name).read_bytes() for name in ('seed.sql','remove.sql','users.csv')}
|
|
generate()
|
|
assert before == {name: (base/name).read_bytes() for name in before}, 're-generating changed checked-in files'
|
|
seed = (base/'seed.sql').read_text(encoding='utf8')
|
|
remove = (base/'remove.sql').read_text(encoding='utf8')
|
|
assert f'decode(\'{REL_HASH}\',\'hex\')' in seed
|
|
assert f'decode(\'{REL_HASH}\',\'hex\')' in remove
|
|
assert f'\'{MARKER}001\'' in seed
|
|
assert 'to_login, to_block_number, to_block_hash' in seed
|
|
assert 'shine_refresh_user_profile(login)' in seed
|
|
assert 'shine_refresh_user_stats(login)' in seed
|
|
assert seed.index('shine_refresh_user_profile(login)') < seed.index('INSERT INTO connections_state') < seed.index('shine_refresh_user_stats(login)')
|
|
assert 'COMMIT;' in seed and 'COMMIT;' in remove
|
|
assert "current_database() IS DISTINCT FROM current_setting('shine.expected_test_database'" in seed
|
|
assert "current_database() IS DISTINCT FROM current_setting('shine.expected_test_database'" in remove
|
|
assert "NOT EXISTS (SELECT 1 FROM db_schema_version WHERE id=1 AND schema_version >= 40)" in seed
|
|
assert 'DELETE FROM connections_state cs' in seed
|
|
assert seed.index('DELETE FROM connections_state cs') < seed.index('INSERT INTO connections_state')
|
|
assert 'ON CONFLICT (login, param) DO UPDATE' in seed
|
|
assert 'Non-fixture relationships found' in remove
|
|
assert 'user_identity_current WHERE left(free_data_item_id,20)' in remove
|
|
assert 'DO $references$' in remove
|
|
assert 'not_interested' not in seed
|
|
assert 'LIKE \'SHINE_DEV_GRAPH_250_%\'' not in seed
|
|
assert 'LIKE \'SHINE_DEV_GRAPH_250_%\'' not in remove
|
|
print(f'PASS: {COUNT} users, {len(pairs)} friendship pairs, {mutual/len(pairs):.1%} reciprocal')
|
|
print(f'PASS: 10 communities {dict(GROUPS)}; hubs: {HUBS}')
|
|
print(f'PASS: friendship records 10={types[10]},14={types[14]}; confirmations 70=500,80=1000')
|
|
print('PASS: README fixture logic, unique endpoints, SQL marker/guards, deterministic output')
|