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
|
import type { NostrEvent } from "@/types/nostr";
import type { FlatFeed, FullFeed, FullNode, Poast } from "@/types/trill";
import { eventToPoast } from "../nostrill";
export function toFlat(n: FullNode): Poast {
return {
...n,
children: !n.children
? []
: Object.keys(n.children).map((c) => n.children[c].id),
};
}
type res = { threadChildren: FullNode[]; replies: FullNode[] };
const bunt: res = { threadChildren: [], replies: [] };
export function extractThread(node: FullNode): res {
if (!node.children) return bunt;
const r = Object.keys(node.children)
.sort()
.reduce((acc, index) => {
const n = node.children[index];
// if (typeof n.post === "string") return acc;
const nn = n as FullNode;
return n.author !== node.author
? { ...acc, replies: [...acc.replies, nn] }
: {
...acc,
threadChildren: [
...acc.threadChildren,
nn,
...extractThread(nn).threadChildren,
],
};
}, bunt);
return r;
}
export function findReplies(n: Poast, f: FlatFeed): Poast[] {
const posts = Object.values(f);
const kids: Poast[] = [];
for (const p of posts) {
if (p.parent === n.id) kids.push(p);
}
return kids;
}
export function eventToFn(ev: NostrEvent) {
const p = eventToPoast(ev)!;
const fn: FullNode = { ...p, children: {} };
return fn;
}
export function eventsToFF(nodes: FullNode[]): FullFeed {
// Step 1: Create a map with all nodes having empty children
const nodeMap: Record<string, FullNode> = {};
nodes.forEach((node) => {
nodeMap[node.hash] = node;
});
// Step 2: Build relationships by adding each node to its parent's children
const rootNodes: FullFeed = {};
nodes.forEach((node) => {
const currentNode = nodeMap[node.hash];
if (!node.parent) {
rootNodes[node.hash] = currentNode; // It's a root
} else if (nodeMap[node.parent]) {
nodeMap[node.parent].children[node.hash] = currentNode; // Add to parent
} else {
rootNodes[node.hash] = currentNode; // Parent missing, treat as root
}
});
return rootNodes;
}
export function getDescendants(node: FullNode): FullNode[] {
const descendants: FullNode[] = [];
function traverse(currentNode: FullNode) {
Object.values(currentNode.children).forEach((child) => {
descendants.push(child);
traverse(child);
});
}
traverse(node);
return descendants;
}
/**
* Alternative implementation that handles orphaned nodes differently
* Orphaned nodes (whose parents aren't in the array) are collected separately
*/
export function buildTreeWithOrphans(nodes: FullNode[]): {
tree: FullFeed;
orphans: FullFeed;
} {
const nodeMap: Record<string, FullNode> = {};
// Initialize all nodes
nodes.forEach((node) => {
nodeMap[node.hash] = node;
});
const rootNodes: FullFeed = {};
const orphanNodes: FullFeed = {};
nodes.forEach((node) => {
const currentNode = nodeMap[node.id];
if (!node.parent) {
// Root node
rootNodes[node.id] = currentNode;
} else if (nodeMap[node.parent]) {
// Parent exists, add to parent's children
nodeMap[node.parent].children[node.id] = currentNode;
} else {
// Parent doesn't exist, it's an orphan
orphanNodes[node.id] = currentNode;
}
});
return { tree: rootNodes, orphans: orphanNodes };
}
export function findNodeById(
tree: FullFeed,
targetId: string,
): FullNode | null {
function search(nodes: FullFeed): FullNode | null {
for (const node of Object.values(nodes)) {
if (node.id === targetId) {
return node;
}
const found = search(node.children);
if (found) {
return found;
}
}
return null;
}
return search(tree);
}
export function getPathToNode(
tree: FullFeed,
targetId: string,
): FullNode[] | null {
function search(nodes: FullFeed, path: FullNode[]): FullNode[] | null {
for (const node of Object.values(nodes)) {
const currentPath = [...path, node];
if (node.id === targetId) {
return currentPath;
}
const found = search(node.children, currentPath);
if (found) {
return found;
}
}
return null;
}
return search(tree, []);
}
export function flattenTree(tree: FullFeed): FullNode[] {
const result: FullNode[] = [];
function traverse(nodes: FullFeed) {
Object.values(nodes).forEach((node) => {
result.push(node);
traverse(node.children);
});
}
traverse(tree);
return result;
}
export function getTreeDepth(tree: FullFeed): number {
function getDepth(nodes: FullFeed, currentDepth: number): number {
if (Object.keys(nodes).length === 0) {
return currentDepth;
}
let maxDepth = currentDepth;
Object.values(nodes).forEach((node) => {
const childDepth = getDepth(node.children, currentDepth + 1);
maxDepth = Math.max(maxDepth, childDepth);
});
return maxDepth;
}
return getDepth(tree, 0);
}
/**
* Count total nodes in the tree
*/
export function countNodes(tree: FullFeed): number {
let count = 0;
function traverse(nodes: FullFeed) {
count += Object.keys(nodes).length;
Object.values(nodes).forEach((node) => {
traverse(node.children);
});
}
traverse(tree);
return count;
}
// http://localhost:5173/apps/nostrill/t/nevent1qqsp3faj5jy9fpc6779rcs9kdccc0mxwlv2pnhymwqtjmletn72u5echttguv
|
