Files
photon-tbw/src/lib/components/lemmy/comment/comments.ts
T
Peter Bui 9eb3665fa7 fix: improve building comment tree (#40)
As we build the map of nodes, keep track of the minimum depth level.
Afterwards, nodes at the minimum depth level go into the tree as the
roots.

We no longer need to check if the tree belongs to a parent comment or
not.

Fixes #36 more.
2023-07-28 20:37:44 -07:00

122 lines
2.8 KiB
TypeScript

import type { Comment, CommentView } from 'lemmy-js-client'
export interface CommentNodeI {
comment_view: CommentView
children: Array<CommentNodeI>
depth: number
loading?: boolean
}
function getCommentParentId(comment?: Comment): number | undefined {
const split = comment?.path.split('.')
// remove the 0
split?.shift()
return split && split.length > 1
? Number(split.at(split.length - 2))
: undefined
}
function getDepthFromComment(comment?: Comment): number | undefined {
const len = comment?.path.split('.').length
return len ? len - 2 : undefined
}
export function buildCommentsTree(
comments: CommentView[],
baseDepth: number = 0
): CommentNodeI[] {
const map = new Map<number, CommentNodeI>()
let min_depth = Number.MAX_VALUE
for (const comment_view of comments) {
const depthI = getDepthFromComment(comment_view.comment) ?? 0
const depth = depthI + baseDepth
const node: CommentNodeI = {
comment_view,
children: [],
depth: depth,
}
min_depth = Math.min(min_depth, depth)
map.set(comment_view.comment.id, { ...node })
}
const tree: CommentNodeI[] = []
// push all nodes at the minimum depth to the top of the tree
for (const comment_view of comments) {
const cNode = map.get(comment_view.comment.id)
if (cNode && cNode.depth == min_depth) {
tree.push(cNode)
}
}
for (const comment_view of comments) {
const child = map.get(comment_view.comment.id)
if (child) {
const parent_id = getCommentParentId(comment_view.comment)
if (parent_id) {
const parent = map.get(parent_id)
// Necessary because blocked comment might not exist
if (parent) {
parent.children.push(child)
}
}
}
}
return tree
}
export function searchCommentTree(
tree: CommentNodeI[],
id: number
): CommentNodeI | undefined {
for (const node of tree) {
if (node.comment_view.comment.id === id) {
return node
}
for (const child of node.children) {
const res = searchCommentTree([child], id)
if (res) {
return res
}
}
}
return undefined
}
export function insertCommentIntoTree(
tree: CommentNodeI[],
cv: CommentView,
parentComment: boolean
) {
// Building a fake node to be used for later
const node: CommentNodeI = {
comment_view: cv,
children: [],
depth: 0,
}
const parentId = getCommentParentId(cv.comment)
if (parentId) {
const parent_comment = searchCommentTree(tree, parentId)
if (parent_comment) {
node.depth = parent_comment.depth + 1
parent_comment.children.unshift(node)
}
} else if (!parentComment) {
tree.unshift(node)
}
}
export async function buildCommentsTreeAsync(
comments: CommentView[],
) {
const result = buildCommentsTree(comments)
return result
}