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
|
// Merge prepared events without inserting between visible posts or evicting
// the reading position. Row geometry comes from the currently rendered feed.
export function mergeFeedWindow(notes, shown, additions, { rows = [], height = 0, keep = 200, page = 20 } = {}) {
const byId = new Map(rows.map((r) => [r.id, r]));
const first = rows.find((r) => r.bottom > 0 && r.top < height);
const seen = new Set(notes.map((e) => e.id));
const added = [], deferred = [];
for (const e of additions) {
if (seen.has(e.id)) continue;
seen.add(e.id);
// Equal timestamps sort after existing events. Ignore hidden rows when
// locating the next rendered post: they cannot serve as an anchor.
const next = notes.find((n) => n.created_at < e.created_at && byId.has(n.id));
const row = next && byId.get(next.id);
// Even a prepend must wait while the header is visible: anchoring just
// the first post would scroll the header away.
const inView = row && row.top < height && (row === first ? row.top > 0 : row.top >= 0);
(inView ? deferred : added).push(e);
}
if (!added.length) return { notes, shown, added, deferred };
const held = new Set([...notes.slice(0, shown).map((e) => e.id), ...byId.keys()]);
const merged = [...notes, ...added].sort((a, b) => b.created_at - a.created_at);
for (let i = 0; i < merged.length; i++) if (held.has(merged[i].id)) shown = Math.max(shown, i + 1);
// Keep another page beyond the displayed window so paging still advances
// after the reader has reached the normal in-memory cache limit.
return { notes: merged.slice(0, Math.max(keep, shown + page)), shown, added, deferred };
}
|
