/*------------------------------------------------------------------------------* * 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 * * Roland Kühn * * Jan Mühlig * *------------------------------------------------------------------------------* */ #pragma once #include "node_interface.h" namespace beedb::plan::logical { class CrossProductNode final : public BinaryNode { public: CrossProductNode() : BinaryNode("Cross Product") { } ~CrossProductNode() override = default; const Schema &check_and_emit_schema(TableMap &tables) override { _schema.clear(); const auto &left_schema = left_child()->check_and_emit_schema(tables); const auto &right_schema = right_child()->check_and_emit_schema(tables); _schema.reserve(left_schema.size() + right_schema.size()); std::copy(left_schema.begin(), left_schema.end(), std::back_inserter(_schema)); std::copy(right_schema.begin(), right_schema.end(), std::back_inserter(_schema)); return _schema; } [[nodiscard]] const Schema &schema() const override { return _schema; } private: Schema _schema; }; } // namespace beedb::plan::logical