lbug 0.16.1

#include "binder/binder.h"
#include "binder/expression/expression_util.h"
#include "binder/expression/literal_expression.h"
#include "binder/expression/property_expression.h"
#include "binder/expression/scalar_function_expression.h"
#include "binder/query/query_graph_label_analyzer.h"
#include "binder/query/updating_clause/bound_delete_clause.h"
#include "binder/query/updating_clause/bound_insert_clause.h"
#include "binder/query/updating_clause/bound_merge_clause.h"
#include "binder/query/updating_clause/bound_set_clause.h"
#include "catalog/catalog.h"
#include "catalog/catalog_entry/index_catalog_entry.h"
#include "catalog/catalog_entry/node_table_catalog_entry.h"
#include "catalog/catalog_entry/rel_group_catalog_entry.h"
#include "common/assert.h"
#include "common/exception/binder.h"
#include "common/json.h"
#include "common/json_utils.h"
#include "common/types/types.h"
#include "common/vector/value_vector.h"
#include "main/client_context.h"
#include "main/database_manager.h"
#include "parser/query/updating_clause/delete_clause.h"
#include "parser/query/updating_clause/insert_clause.h"
#include "parser/query/updating_clause/merge_clause.h"
#include "parser/query/updating_clause/set_clause.h"
#include "transaction/transaction.h"
#include <format>

using namespace lbug::common;
using namespace lbug::parser;
using namespace lbug::catalog;

namespace lbug {
namespace binder {

std::unique_ptr<BoundUpdatingClause> Binder::bindUpdatingClause(
    const UpdatingClause& updatingClause) {
    switch (updatingClause.getClauseType()) {
    case ClauseType::INSERT: {
        return bindInsertClause(updatingClause);
    }
    case ClauseType::MERGE: {
        return bindMergeClause(updatingClause);
    }
    case ClauseType::SET: {
        return bindSetClause(updatingClause);
    }
    case ClauseType::DELETE_: {
        return bindDeleteClause(updatingClause);
    }
    default:
        UNREACHABLE_CODE;
    }
}

static std::unordered_set<std::string> populatePatternsScope(const BinderScope& scope) {
    std::unordered_set<std::string> result;
    for (auto& expression : scope.getExpressions()) {
        if (ExpressionUtil::isNodePattern(*expression) ||
            ExpressionUtil::isRelPattern(*expression)) {
            result.insert(expression->toString());
        } else if (expression->expressionType == ExpressionType::VARIABLE) {
            if (scope.hasNodeReplacement(expression->toString())) {
                result.insert(expression->toString());
            }
        }
    }
    return result;
}

std::unique_ptr<BoundUpdatingClause> Binder::bindInsertClause(
    const UpdatingClause& updatingClause) {
    auto& insertClause = updatingClause.constCast<InsertClause>();
    auto patternsScope = populatePatternsScope(scope);
    // bindGraphPattern will update scope.
    auto boundGraphPattern = bindGraphPattern(insertClause.getPatternElementsRef());
    auto insertInfos = bindInsertInfos(boundGraphPattern.queryGraphCollection, patternsScope);
    return std::make_unique<BoundInsertClause>(std::move(insertInfos));
}

static expression_vector getColumnDataExprs(QueryGraphCollection& collection) {
    expression_vector exprs;
    for (auto i = 0u; i < collection.getNumQueryGraphs(); ++i) {
        auto queryGraph = collection.getQueryGraph(i);
        for (auto& pattern : queryGraph->getAllPatterns()) {
            for (auto& [_, rhs] : pattern->getPropertyDataExprRef()) {
                exprs.push_back(rhs);
            }
        }
    }
    return exprs;
}

std::unique_ptr<BoundUpdatingClause> Binder::bindMergeClause(const UpdatingClause& updatingClause) {
    auto& mergeClause = updatingClause.constCast<MergeClause>();
    auto patternsScope = populatePatternsScope(scope);
    // bindGraphPattern will update scope.
    auto boundGraphPattern = bindGraphPattern(mergeClause.getPatternElementsRef());
    auto columnDataExprs = getColumnDataExprs(boundGraphPattern.queryGraphCollection);
    // Rewrite key value pairs in MATCH clause as predicate
    rewriteMatchPattern(boundGraphPattern);
    auto existenceMark =
        expressionBinder.createVariableExpression(LogicalType::BOOL(), std::string("__existence"));
    auto distinctMark =
        expressionBinder.createVariableExpression(LogicalType::BOOL(), std::string("__distinct"));
    auto createInfos = bindInsertInfos(boundGraphPattern.queryGraphCollection, patternsScope);
    auto boundMergeClause =
        std::make_unique<BoundMergeClause>(columnDataExprs, std::move(existenceMark),
            std::move(distinctMark), std::move(boundGraphPattern.queryGraphCollection),
            std::move(boundGraphPattern.where), std::move(createInfos));
    if (mergeClause.hasOnMatchSetItems()) {
        for (auto& [lhs, rhs] : mergeClause.getOnMatchSetItemsRef()) {
            auto setPropertyInfo = bindSetPropertyInfo(lhs.get(), rhs.get());
            boundMergeClause->addOnMatchSetPropertyInfo(std::move(setPropertyInfo));
        }
    }
    if (mergeClause.hasOnCreateSetItems()) {
        for (auto& [lhs, rhs] : mergeClause.getOnCreateSetItemsRef()) {
            auto setPropertyInfo = bindSetPropertyInfo(lhs.get(), rhs.get());
            boundMergeClause->addOnCreateSetPropertyInfo(std::move(setPropertyInfo));
        }
    }
    return boundMergeClause;
}

std::vector<BoundInsertInfo> Binder::bindInsertInfos(QueryGraphCollection& queryGraphCollection,
    const std::unordered_set<std::string>& patternsInScope_) {
    auto patternsInScope = patternsInScope_;
    std::vector<BoundInsertInfo> result;
    auto analyzer = QueryGraphLabelAnalyzer(*clientContext, true /* throwOnViolate */);
    for (auto i = 0u; i < queryGraphCollection.getNumQueryGraphs(); ++i) {
        auto queryGraph = queryGraphCollection.getQueryGraphUnsafe(i);
        // Ensure query graph does not violate declared schema.
        analyzer.pruneLabel(*queryGraph);
        for (auto j = 0u; j < queryGraph->getNumQueryNodes(); ++j) {
            auto node = queryGraph->getQueryNode(j);
            if (node->getVariableName().empty()) { // Always create anonymous node.
                bindInsertNode(node, result);
                continue;
            }
            if (patternsInScope.contains(node->getVariableName())) {
                continue;
            }
            patternsInScope.insert(node->getVariableName());
            bindInsertNode(node, result);
        }
        for (auto j = 0u; j < queryGraph->getNumQueryRels(); ++j) {
            auto rel = queryGraph->getQueryRel(j);
            if (rel->getVariableName().empty()) { // Always create anonymous rel.
                bindInsertRel(rel, result);
                continue;
            }
            if (patternsInScope.contains(rel->getVariableName())) {
                continue;
            }
            patternsInScope.insert(rel->getVariableName());
            bindInsertRel(rel, result);
        }
    }
    if (result.empty()) {
        throw BinderException("Cannot resolve any node or relationship to create.");
    }
    return result;
}

static void validatePrimaryKeyExistence(const NodeTableCatalogEntry* nodeTableEntry,
    const NodeExpression& node, const expression_vector& defaultExprs) {
    auto primaryKeyName = nodeTableEntry->getPrimaryKeyName();
    auto pkeyDefaultExpr = defaultExprs.at(nodeTableEntry->getPrimaryKeyID());
    if (!node.hasPropertyDataExpr(primaryKeyName) &&
        ExpressionUtil::isNullLiteral(*pkeyDefaultExpr)) {
        throw BinderException(std::format("Create node {} expects primary key {} as input.",
            node.toString(), primaryKeyName));
    }
}

void Binder::bindInsertNode(std::shared_ptr<NodeExpression> node,
    std::vector<BoundInsertInfo>& infos) {
    auto transaction = transaction::Transaction::Get(*clientContext);
    auto useInternal = clientContext->useInternalCatalogEntry();
    auto dbManager = main::DatabaseManager::Get(*clientContext);
    auto defaultGraphCatalog = dbManager->getDefaultGraphCatalog();
    if (node->isEmpty()) {
        throw BinderException(
            "Create node " + node->toString() + " with empty node labels is not supported.");
    }
    if (node->isMultiLabeled()) {
        throw BinderException(
            "Create node " + node->toString() + " with multiple node labels is not supported.");
    }
    DASSERT(node->getNumEntries() == 1);
    auto entry = node->getEntry(0);
    DASSERT(entry->getTableType() == TableType::NODE);
    bool isAnyGraph = false;
    if (defaultGraphCatalog != nullptr &&
        defaultGraphCatalog->containsTable(transaction, "_nodes", useInternal)) {
        isAnyGraph = entry->getTableID() ==
                     defaultGraphCatalog->getTableCatalogEntry(transaction, "_nodes", useInternal)
                         ->getTableID();
    }

    auto insertInfo = BoundInsertInfo(TableType::NODE, node);
    for (auto& property : node->getPropertyExpressions()) {
        if (property->hasProperty(entry->getTableID())) {
            insertInfo.columnExprs.push_back(property);
        }
    }

    if (isAnyGraph) {
        // For ANY graphs, the _nodes table has columns: id (SERIAL), label (STRING[]), data
        // (JSON)
        // The id is auto-populated by the serial default
        // We need to build columnDataExprs for: [id_default, label, data]

        // Property expressions are already bound - just reference them
        const auto& boundPropertyExprs = node->getPropertyDataExprRef();

        // Build columnDataExprs for _nodes table: [id, label, data]
        insertInfo.columnDataExprs.clear();

        // id column: use default (SERIAL)
        auto props = entry->getProperties();
        auto idDefaultExpr = expressionBinder.bindExpression(*props[0].defaultExpr);
        insertInfo.columnDataExprs.push_back(
            expressionBinder.implicitCastIfNecessary(idDefaultExpr, props[0].getType()));

        // label column (STRING[])
        auto originalLabels = node->getOriginalLabels();
        std::vector<std::unique_ptr<Value>> labels;
        if (!originalLabels.empty()) {
            labels.reserve(originalLabels.size());
            for (const auto& label : originalLabels) {
                labels.push_back(std::make_unique<Value>(LogicalType::STRING(), label));
            }
        } else {
            labels.push_back(std::make_unique<Value>(LogicalType::STRING(), entry->getName()));
        }
        auto labelValue = Value(LogicalType::LIST(LogicalType::STRING()), std::move(labels));
        auto boundLabelExpr = expressionBinder.createLiteralExpression(std::move(labelValue));
        insertInfo.columnDataExprs.push_back(boundLabelExpr);

        // data column: build JSON from bound property expressions
        json_extension::JsonMutWrapper mutWrapper;
        yyjson_mut_val* root = yyjson_mut_obj(mutWrapper.ptr);

        for (const auto& [propertyName, boundExpr] : boundPropertyExprs) {
            const LiteralExpression* literalExpr = nullptr;
            if (boundExpr->expressionType == common::ExpressionType::FUNCTION) {
                auto* scalarFunc = dynamic_cast<ScalarFunctionExpression*>(boundExpr.get());
                if (scalarFunc &&
                    (scalarFunc->getFunction().name == "CAST" ||
                        scalarFunc->getFunction().name == "CAST_TO_JSON") &&
                    !scalarFunc->getChildren().empty()) {
                    auto const& children = scalarFunc->getChildren();
                    literalExpr = dynamic_cast<LiteralExpression*>(children[0].get());
                } else {
                    literalExpr = dynamic_cast<LiteralExpression*>(boundExpr.get());
                }
            } else {
                literalExpr = dynamic_cast<LiteralExpression*>(boundExpr.get());
            }

            yyjson_mut_val* jsonVal = nullptr;
            if (literalExpr && !literalExpr->isNull()) {
                auto val = literalExpr->getValue();
                // Create a temporary ValueVector of size 1 and reuse json_extension::jsonify
                ValueVector tempVec(val.getDataType().copy());
                tempVec.state = DataChunkState::getSingleValueDataChunkState();
                tempVec.copyFromValue(0, val);
                jsonVal = json_extension::jsonify(mutWrapper, tempVec, 0);
            } else {
                jsonVal = yyjson_mut_null(mutWrapper.ptr);
            }
            auto key = yyjson_mut_strcpy(mutWrapper.ptr, propertyName.c_str());
            yyjson_mut_obj_add(root, key, jsonVal);
        }

        yyjson_mut_doc_set_root(mutWrapper.ptr, root);
        auto jsonStr = json_extension::jsonToString(
            json_extension::JsonWrapper(yyjson_mut_doc_imut_copy(mutWrapper.ptr, nullptr)));
        auto dataExpr =
            expressionBinder.createLiteralExpression(Value(LogicalType::JSON(), jsonStr));
        insertInfo.columnDataExprs.push_back(dataExpr);
    } else {
        // For regular node tables, match input properties against table schema
        insertInfo.columnDataExprs =
            bindInsertColumnDataExprs(node->getPropertyDataExprRef(), entry->getProperties());
        auto nodeEntry = entry->ptrCast<NodeTableCatalogEntry>();
        validatePrimaryKeyExistence(nodeEntry, *node, insertInfo.columnDataExprs);
    }

    // Check extension secondary index loaded
    auto catalog = Catalog::Get(*clientContext);
    for (auto indexEntry : catalog->getIndexEntries(transaction, entry->getTableID())) {
        if (!indexEntry->isLoaded()) {
            throw BinderException(std::format(
                "Trying to insert into an index on table {} but its extension is not loaded.",
                entry->getName()));
        }
    }
    infos.push_back(std::move(insertInfo));
}

static TableCatalogEntry* tryPruneMultiLabeled(const RelExpression& rel,
    const TableCatalogEntry& srcEntry, const TableCatalogEntry& dstEntry) {
    std::vector<TableCatalogEntry*> candidates;
    for (auto& entry : rel.getEntries()) {
        DASSERT(entry->getType() == CatalogEntryType::REL_GROUP_ENTRY);
        auto& relEntry = entry->constCast<RelGroupCatalogEntry>();
        if (relEntry.hasRelEntryInfo(srcEntry.getTableID(), dstEntry.getTableID())) {
            candidates.push_back(entry);
        }
    }
    if (candidates.size() > 1) {
        throw BinderException(std::format(
            "Create rel {} with multiple rel labels is not supported.", rel.toString()));
    }
    if (candidates.size() == 0) {
        throw BinderException(
            std::format("Cannot find a valid label in {} that connects {} and {}.", rel.toString(),
                srcEntry.getName(), dstEntry.getName()));
    }
    return candidates[0];
}

void Binder::bindInsertRel(std::shared_ptr<RelExpression> rel,
    std::vector<BoundInsertInfo>& infos) {
    if (rel->isBoundByMultiLabeledNode()) {
        throw BinderException(std::format(
            "Create rel {} bound by multiple node labels is not supported.", rel->toString()));
    }
    if (rel->getDirectionType() == RelDirectionType::BOTH) {
        throw BinderException(std::format("Create undirected relationship is not supported. "
                                          "Try create 2 directed relationships instead."));
    }
    if (ExpressionUtil::isRecursiveRelPattern(*rel)) {
        throw BinderException(std::format("Cannot create recursive rel {}.", rel->toString()));
    }
    TableCatalogEntry* entry = nullptr;
    if (!rel->isMultiLabeled()) {
        DASSERT(rel->getNumEntries() == 1);
        entry = rel->getEntry(0);
    } else {
        auto srcEntry = rel->getSrcNode()->getEntry(0);
        auto dstEntry = rel->getDstNode()->getEntry(0);
        entry = tryPruneMultiLabeled(*rel, *srcEntry, *dstEntry);
    }
    rel->setEntries(std::vector{entry});
    auto insertInfo = BoundInsertInfo(TableType::REL, rel);
    // Because we might prune entries, some property exprs may belong to pruned entry
    for (auto& p : entry->getProperties()) {
        insertInfo.columnExprs.push_back(rel->getPropertyExpression(p.getName()));
    }

    // Check if this is an ANY graph (_edges table)
    auto transaction = transaction::Transaction::Get(*clientContext);
    auto useInternal = clientContext->useInternalCatalogEntry();
    auto dbManager = main::DatabaseManager::Get(*clientContext);
    auto defaultGraphCatalog = dbManager->getDefaultGraphCatalog();
    bool isAnyGraph =
        defaultGraphCatalog != nullptr &&
        entry->getTableID() ==
            defaultGraphCatalog->getTableCatalogEntry(transaction, "_edges", useInternal)
                ->getTableID();

    if (isAnyGraph) {
        // For ANY graphs, the _edges table has columns: _id (INTERNAL_ID), label (STRING), data
        // (JSON) Build columnDataExprs for these three columns

        // Property expressions are already bound - just reference them
        const auto& boundPropertyExprs = rel->getPropertyDataExprRef();

        // Build columnDataExprs for _edges table: [_id, label, data]
        insertInfo.columnDataExprs.clear();

        // _id column: use default
        auto props = entry->getProperties();
        auto idDefaultExpr = expressionBinder.bindExpression(*props[0].defaultExpr);
        insertInfo.columnDataExprs.push_back(
            expressionBinder.implicitCastIfNecessary(idDefaultExpr, props[0].getType()));

        // label column
        auto originalLabels = rel->getOriginalLabels();
        std::shared_ptr<Expression> boundLabelExpr;
        if (!originalLabels.empty()) {
            boundLabelExpr = expressionBinder.createLiteralExpression(originalLabels[0]);
        } else {
            boundLabelExpr = expressionBinder.createLiteralExpression(entry->getName());
        }
        insertInfo.columnDataExprs.push_back(boundLabelExpr);

        // data column: build JSON from bound property expressions
        json_extension::JsonMutWrapper mutWrapper;
        yyjson_mut_val* root = yyjson_mut_obj(mutWrapper.ptr);

        for (const auto& [propertyName, boundExpr] : boundPropertyExprs) {
            const LiteralExpression* literalExpr = nullptr;
            if (boundExpr->expressionType == common::ExpressionType::FUNCTION) {
                auto* scalarFunc = dynamic_cast<ScalarFunctionExpression*>(boundExpr.get());
                if (scalarFunc &&
                    (scalarFunc->getFunction().name == "CAST" ||
                        scalarFunc->getFunction().name == "CAST_TO_JSON") &&
                    !scalarFunc->getChildren().empty()) {
                    auto const& children = scalarFunc->getChildren();
                    literalExpr = dynamic_cast<LiteralExpression*>(children[0].get());
                } else {
                    literalExpr = dynamic_cast<LiteralExpression*>(boundExpr.get());
                }
            } else {
                literalExpr = dynamic_cast<LiteralExpression*>(boundExpr.get());
            }

            yyjson_mut_val* jsonVal = nullptr;
            if (literalExpr && !literalExpr->isNull()) {
                auto val = literalExpr->getValue();
                // Create a temporary ValueVector of size 1 and reuse json_extension::jsonify
                ValueVector tempVec(val.getDataType().copy());
                tempVec.state = DataChunkState::getSingleValueDataChunkState();
                tempVec.copyFromValue(0, val);
                jsonVal = json_extension::jsonify(mutWrapper, tempVec, 0);
            } else {
                jsonVal = yyjson_mut_null(mutWrapper.ptr);
            }
            auto key = yyjson_mut_strcpy(mutWrapper.ptr, propertyName.c_str());
            yyjson_mut_obj_add(root, key, jsonVal);
        }

        yyjson_mut_doc_set_root(mutWrapper.ptr, root);
        auto jsonStr = json_extension::jsonToString(
            json_extension::JsonWrapper(yyjson_mut_doc_imut_copy(mutWrapper.ptr, nullptr)));
        auto dataExpr =
            expressionBinder.createLiteralExpression(Value(LogicalType::JSON(), jsonStr));
        insertInfo.columnDataExprs.push_back(dataExpr);
    } else {
        // For regular rel tables, match input properties against table schema
        insertInfo.columnDataExprs =
            bindInsertColumnDataExprs(rel->getPropertyDataExprRef(), entry->getProperties());
    }

    infos.push_back(std::move(insertInfo));
}

expression_vector Binder::bindInsertColumnDataExprs(
    const case_insensitive_map_t<std::shared_ptr<Expression>>& propertyDataExprs,
    const std::vector<PropertyDefinition>& propertyDefinitions) {
    expression_vector result;
    for (auto& definition : propertyDefinitions) {
        std::shared_ptr<Expression> rhs;
        if (propertyDataExprs.contains(definition.getName())) {
            rhs = propertyDataExprs.at(definition.getName());
        } else {
            rhs = expressionBinder.bindExpression(*definition.defaultExpr);
        }
        rhs = expressionBinder.implicitCastIfNecessary(rhs, definition.getType());
        result.push_back(std::move(rhs));
    }
    return result;
}

std::unique_ptr<BoundUpdatingClause> Binder::bindSetClause(const UpdatingClause& updatingClause) {
    auto& setClause = updatingClause.constCast<SetClause>();
    auto boundSetClause = std::make_unique<BoundSetClause>();
    for (auto& setItem : setClause.getSetItemsRef()) {
        boundSetClause->addInfo(bindSetPropertyInfo(setItem.first.get(), setItem.second.get()));
    }
    return boundSetClause;
}

BoundSetPropertyInfo Binder::bindSetPropertyInfo(const ParsedExpression* column,
    const ParsedExpression* columnData) {
    auto expr = expressionBinder.bindExpression(*column->getChild(0));
    auto isNode = ExpressionUtil::isNodePattern(*expr);
    auto isRel = ExpressionUtil::isRelPattern(*expr);
    if (!isNode && !isRel) {
        throw BinderException(
            std::format("Cannot set expression {} with type {}. Expect node or rel pattern.",
                expr->toString(), ExpressionTypeUtil::toString(expr->expressionType)));
    }
    auto boundSetItem = bindSetItem(column, columnData);
    auto boundColumn = boundSetItem.first;
    auto boundColumnData = boundSetItem.second;
    auto& nodeOrRel = expr->constCast<NodeOrRelExpression>();
    auto& property = boundSetItem.first->constCast<PropertyExpression>();
    // Check secondary index constraint
    auto catalog = Catalog::Get(*clientContext);
    auto transaction = transaction::Transaction::Get(*clientContext);
    for (auto entry : nodeOrRel.getEntries()) {
        // When setting multi labeled node, skip checking if property is not in current table.
        if (!property.hasProperty(entry->getTableID())) {
            continue;
        }
        auto propertyID = entry->getPropertyID(property.getPropertyName());
        if (catalog->containsUnloadedIndex(transaction, entry->getTableID(), propertyID)) {
            throw BinderException(
                std::format("Cannot set property {} in table {} because it is used in one or more "
                            "indexes which is unloaded.",
                    property.getPropertyName(), entry->getName()));
        }
    }
    // Check primary key constraint
    if (isNode) {
        for (auto entry : nodeOrRel.getEntries()) {
            if (property.isPrimaryKey(entry->getTableID())) {
                throw BinderException(
                    std::format("Cannot set property {} in table {} because it is used as primary "
                                "key. Try delete and then insert.",
                        property.getPropertyName(), entry->getName()));
            }
        }
        return BoundSetPropertyInfo(TableType::NODE, expr, boundColumn, boundColumnData);
    }
    return BoundSetPropertyInfo(TableType::REL, expr, boundColumn, boundColumnData);
}

expression_pair Binder::bindSetItem(const ParsedExpression* column,
    const ParsedExpression* columnData) {
    auto boundColumn = expressionBinder.bindExpression(*column);
    auto boundColumnData = expressionBinder.bindExpression(*columnData);
    boundColumnData =
        expressionBinder.implicitCastIfNecessary(boundColumnData, boundColumn->dataType);
    return make_pair(std::move(boundColumn), std::move(boundColumnData));
}

std::unique_ptr<BoundUpdatingClause> Binder::bindDeleteClause(
    const UpdatingClause& updatingClause) {
    auto& deleteClause = updatingClause.constCast<DeleteClause>();
    auto deleteType = deleteClause.getDeleteClauseType();
    auto boundDeleteClause = std::make_unique<BoundDeleteClause>();
    for (auto i = 0u; i < deleteClause.getNumExpressions(); ++i) {
        auto pattern = expressionBinder.bindExpression(*deleteClause.getExpression(i));
        if (ExpressionUtil::isNodePattern(*pattern)) {
            auto deleteNodeInfo = BoundDeleteInfo(deleteType, TableType::NODE, pattern);
            auto& node = pattern->constCast<NodeExpression>();
            auto catalog = Catalog::Get(*clientContext);
            auto transaction = transaction::Transaction::Get(*clientContext);
            for (auto entry : node.getEntries()) {
                for (auto index : catalog->getIndexEntries(transaction, entry->getTableID())) {
                    if (!index->isLoaded()) {
                        throw BinderException(
                            std::format("Trying to delete from an index on table {} but its "
                                        "extension is not loaded.",
                                entry->getName()));
                    }
                }
            }
            boundDeleteClause->addInfo(std::move(deleteNodeInfo));
        } else if (ExpressionUtil::isRelPattern(*pattern)) {
            // LCOV_EXCL_START
            if (deleteClause.getDeleteClauseType() == DeleteNodeType::DETACH_DELETE) {
                throw BinderException("Detach delete on rel tables is not supported.");
            }
            // LCOV_EXCL_STOP
            auto rel = pattern->constPtrCast<RelExpression>();
            if (rel->getDirectionType() == RelDirectionType::BOTH) {
                throw BinderException("Delete undirected rel is not supported.");
            }
            auto deleteRel = BoundDeleteInfo(deleteType, TableType::REL, pattern);
            boundDeleteClause->addInfo(std::move(deleteRel));
        } else {
            throw BinderException(
                std::format("Cannot delete expression {} with type {}. Expect node or rel pattern.",
                    pattern->toString(), ExpressionTypeUtil::toString(pattern->expressionType)));
        }
    }
    return boundDeleteClause;
}

} // namespace binder
} // namespace lbug