Function build_conversation_chain

tutorials/12_session_persistence.py:438–473

从叶节点沿 parent_uuid 链回溯，重建对话。 对应 Reference: EP09 §3 let currentMsg = leafMessage while (currentMsg) { if (seen.has(currentMsg.uuid)) break // 环检测 seen.add(currentMsg.uuid) transcript.push(currentMsg) currentMsg = messages.get(c

(
    messages: dict[str, ConversationMessage],
    leaf_uuid: str,
)

#   3. 崩溃恢复：从叶节点沿链回溯，重建完整对话

def build_conversation_chain(
    messages: dict[str, ConversationMessage],
    leaf_uuid: str,
) -> list[ConversationMessage]:
    """
    从叶节点沿 parent_uuid 链回溯，重建对话。

    对应 Reference: EP09 §3
        let currentMsg = leafMessage
        while (currentMsg) {
            if (seen.has(currentMsg.uuid)) break  // 环检测
            seen.add(currentMsg.uuid)
            transcript.push(currentMsg)
            currentMsg = messages.get(currentMsg.parentUuid)
        }
        transcript.reverse()
    """
    chain = []
    seen = set()  # 环检测（防止损坏的链指针导致无限循环）
    current_uuid = leaf_uuid

    while current_uuid:
        if current_uuid in seen:
            print(f"    [WARNING] 检测到循环引用 {current_uuid}，停止遍历")
            break
        seen.add(current_uuid)

        msg = messages.get(current_uuid)
        if msg is None:
            break

        chain.append(msg)
        current_uuid = msg.parent_uuid if msg.parent_uuid else ""

    chain.reverse()  # 从根到叶的顺序
    return chain


# ============================================================