/* Copyright (C) 2022 MariaDB Corporation

   This program is free software; you can redistribute it and/or
   modify it under the terms of the GNU General Public License
   as published by the Free Software Foundation; version 2 of
   the License.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
   MA 02110-1301, USA. */

#pragma once

#include <parsetree.h>
#include <treenode.h>
#include <simplefilter.h>

namespace execplan
{

#define debug_rewrites false

execplan::OpType oppositeOperator(execplan::OpType op);

struct NodeSemanticComparator
{
  bool operator()(execplan::ParseTree* left, execplan::ParseTree* right) const;
};

// Lift leaf Filter nodes that appear in every branch of every OR up to the
// root as a top-level AND chain:
//   (A AND B) OR (A AND C)  ->  A AND (B OR C)
// Returns a (possibly new) root of the rewritten tree.
template <bool stableSort = false>
execplan::ParseTree* extractCommonLeafConjunctionsToRoot(execplan::ParseTree* tree);

}  // namespace execplan
