beedb/include/plan/logical/node/delete_node.h

63 lines
2.4 KiB
C
Raw Permalink Normal View History

2022-04-04 20:25:01 +02:00
/*------------------------------------------------------------------------------*
* Architecture & Implementation of DBMS *
*------------------------------------------------------------------------------*
* Copyright 2022 Databases and Information Systems Group TU Dortmund *
* Visit us at *
* http://dbis.cs.tu-dortmund.de/cms/en/home/ *
* *
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, *
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL *
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR *
* OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, *
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *
* OTHER DEALINGS IN THE SOFTWARE. *
* *
* Authors: *
* Maximilian Berens <maximilian.berens@tu-dortmund.de> *
* Roland Kühn <roland.kuehn@cs.tu-dortmund.de> *
* Jan Mühlig <jan.muehlig@tu-dortmund.de> *
*------------------------------------------------------------------------------*
*/
#pragma once
#include "node_interface.h"
namespace beedb::plan::logical
{
class DeleteNode final : public UnaryNode
{
public:
DeleteNode() : UnaryNode("Delete")
{
}
~DeleteNode() override = default;
[[nodiscard]] const std::string &table_name() const
{
return _table_name;
}
const Schema &check_and_emit_schema(TableMap &tables) override
{
_schema.clear();
const auto &child = UnaryNode::child()->check_and_emit_schema(tables);
const auto all_tables = tables.tables();
_table_name = all_tables.front();
return _schema;
}
[[nodiscard]] const Schema &schema() const override
{
return _schema;
}
private:
Schema _schema;
std::string _table_name;
};
} // namespace beedb::plan::logical