normalizers.cpp File Reference

#include <algorithm>
#include <iterator>
#include <numeric>
#include <ranges>
#include <automaton/range_helper.h>
#include <fe/assert.h>
#include <mim/axm.h>
#include <mim/def.h>
#include <mim/driver.h>
#include <mim/tuple.h>
#include <mim/world.h>
#include "mim/plug/regex/regex.h"

Include dependency graph for normalizers.cpp:

Go to the source code of this file.

Classes
struct	mim::plug::regex::app_range

Namespaces
namespace	mim
namespace	mim::plug
namespace	mim::plug::regex
	The regex Plugin

Typedefs
using	Ranges = fe::Vector<Range>

Functions
template<class ConjOrDisj>
const Def *	mim::plug::regex::make_binary_tree (Defs args)
const App *	mim::plug::regex::lit_range (const Def *d)
bool	mim::plug::regex::compare_re (const Def *lhs, const Def *rhs)
void	mim::plug::regex::make_vector_unique (DefVec &args)
auto	mim::plug::regex::get_range (const Def *rng) -> Range
void	mim::plug::regex::merge_ranges (DefVec &args)
bool	mim::plug::regex::equals_any (const Def *lhs, const Def *rhs)
bool	mim::plug::regex::equals_any (Defs lhs, Defs negated_rhs)
const Def *	mim::plug::regex::any_unwanted_for_not (const Def *arg)
<tt>regex.quant</tt>
template<quant id>
const Def *	mim::plug::regex::normalize_quant (const Def *type, const Def *callee, const Def *arg)
<tt>regex.conj</tt>
const Def *	mim::plug::regex::normalize_conj (const Def *type, const Def *callee, const Def *arg)
<tt>regex.disj</tt>
const Def *	mim::plug::regex::normalize_disj (const Def *type, const Def *, const Def *arg)
<tt>regex.range</tt>
const Def *	mim::plug::regex::normalize_range (const Def *type, const Def *callee, const Def *arg)
<tt>regex.not</tt>
const Def *	mim::plug::regex::normalize_not (const Def *, const Def *callee, const Def *arg)

Typedef Documentation

Ranges

using Ranges = fe::Vector<Range>

Definition at line 18 of file normalizers.cpp.