vcsn Namespace Reference

Namespaces
	ast
	ctx
	detail
	detail_info
	dyn
	rat

Classes
struct	a_star_tag
	A-Star implementation (from vcsn/algos/a-star.hh). More...
struct	any
	Whether some of the values evaluate as true. More...
struct	are_composable
	Whether two contexts are composable. More...
struct	are_labelsets_composable
	Whether two labelsets are composable. More...
struct	are_labelsets_composable< tupleset< LS1... >, tupleset< LS2... > >
	Currently we support only composing on the last tape with the first one. More...
struct	as_pair
struct	as_tuple
struct	auto_tag
	Tag to request the most appropriate version of an algorithm. More...
class	automaton_editor
	Abstract Builder (the design pattern) for automata. More...
class	automatonset
struct	bellman_ford_tag
	Bellman-Ford implementation (from vcsn/algos/bellman-ford.hh). More...
struct	boolean_tag
	Request the Boolean specialization for determinization (B and F2). More...
struct	brzozowski_tag
	Request for Brzozowski implementation of minimize (B and free). More...
class	char_letters
	Represent alphabets whose "letters" are plain chars. More...
struct	container_filter_range
struct	container_range
	Restrict the interface of a container to begin/end. More...
class	context
struct	cross_sequences
	Provide a range that allows to iterate over the cross product of the provided ranges. More...
struct	deterministic_tag
	Tag for operations on deterministic automata. More...
struct	dijkstra_tag
	Dijkstra implementation. More...
struct	discrete_chooser
	Random selector on container, using discrete distribution. More...
struct	dyn_vector_vnamer
	The vname of a vector of dyn:: objects (e.g., automaton, expression, ...) is the tuple of their vnames. More...
class	edit_automaton
	Concrete Builder (the design pattern) for automata. More...
struct	empty_t
	Empty labels, for LAO. More...
class	equal_to
	This is useful to make hashes with labels or weights as keys without using non-default constructors; to be used along with vcsn::hash. More...
class	file_library
	Manage search paths. More...
class	format
	An input/output format for valuesets. More...
struct	general_tag
	Tag for operations on all automata. More...
struct	getarg
	A mapping from strings to Values. More...
class	hash
	This is useful to make hashes with labels or weights as keys without using non-default constructors; to be used along with vcsn::equal_to. More...
struct	hopcroft_tag
	Request for Hopcroft implementation of minimize (B and free). More...
struct	integral_constant
	A simple placeholder for integral constants. More...
struct	iomanipulator
	Defines the operator() for the classes get_type, set_type and swap_type. More...
struct	is_lal
struct	is_lan
struct	is_lao
struct	is_lar
struct	is_lat
struct	is_law
struct	is_multitape
	Whether a ValueSet, or a context, is multitape. More...
struct	is_multitape< context< LabelSet, WeightSet > >
struct	is_multitape< expressionset< Context > >
	Number of tapes of an expressionset. More...
struct	is_multitape< tupleset< ValueSet... > >
struct	is_tropical
struct	is_tropical< nmin >
struct	is_tropical< rmin >
struct	is_tropical< zmin >
struct	kosaraju_tag
	Request the Kosaraju's algorithm to compute the SCCs. More...
struct	labels_are_expressions
struct	labels_are_letters
struct	labels_are_nullable
struct	labels_are_one
struct	labels_are_tuples
struct	labels_are_words
class	lazy_automaton_editor
	Build an automaton with unknown context. More...
struct	less
	Functor to compare Values of ValueSets. More...
struct	less_equal
	Functor to compare Values of ValueSets. More...
class	letterset
	Implementation of labels are letters. More...
struct	MilitaryOrder
	Military strict order predicate. More...
struct	moore_tag
	Request for Moore implementation of minimize (B and free). More...
class	nullableset
	Implementation of labels are nullables (letter or empty). More...
struct	number_of_tapes
struct	number_of_tapes< context< LabelSet, WeightSet > >
struct	number_of_tapes< tupleset< ValueSets... > >
class	oneset
	Implementation of labels are ones: there is a single instance of label. More...
struct	possibly_labeled_transition_tuple
	Transition on non-empty label. More...
struct	possibly_labeled_transition_tuple< State, empty_t >
	Transition on empty label. More...
struct	random_selector
	Random selector on container, using uniform distribution. More...
class	set_alphabet
	A set of letters of type L. More...
struct	signature
	Signature of a function call. More...
struct	signature_tag
	Request for Moore implementation of minimize (B). More...
struct	snamer
struct	snamer< bool >
struct	snamer< boost::optional< unsigned > >
struct	snamer< const std::set< std::pair< std::string, std::string > > >
struct	snamer< const std::string >
struct	snamer< const std::vector< unsigned > >
struct	snamer< float >
struct	snamer< int >
struct	snamer< std::integral_constant< T, Value > >
struct	snamer< std::istream >
struct	snamer< std::ostream >
struct	snamer< std::shared_ptr< T > >
struct	snamer< std::tuple< Args... > >
	The sname of a tuple is the tuple of the snames. More...
struct	snamer< unsigned >
struct	snamer< vcsn::direction >
struct	snamer< vcsn::rat::identities >
class	sparse_map
	Sparse Map implementation. More...
class	sparse_set
	Sparse Set implementation. More...
struct	standard_tag
	Tag for operations on standard automata. More...
struct	state_map_t
	A map indexed by states. More...
class	stateset
	State labelset. More...
class	string_letters
	Represent alphabets whose "letters" are strings. More...
struct	tarjan_iterative_tag
	Request the Tarjan's algorithm to compute the SCCs, implemented with explicit stack handling. More...
struct	tarjan_recursive_tag
	Request the Tarjan's algorithm to compute the SCCs, implemented with recursion. More...
class	to
	An exponent, or range of exponents. More...
struct	transition_tuple
	Transition with label and non Boolean weight. More...
struct	transition_tuple< State, Label, bool >
	Transition with label and Boolean weight. More...
struct	vnamer
struct	vnamer< bool >
struct	vnamer< boost::optional< unsigned > >
struct	vnamer< const std::set< std::pair< std::string, std::string > > >
struct	vnamer< const std::string >
struct	vnamer< const std::vector< dyn::automaton > >
	vector<dyn::automaton> -> std::tuple<automaton_t, ...>. More...
struct	vnamer< const std::vector< dyn::context > >
	vector<dyn::context> -> std::tuple<context_t, ...>. More...
struct	vnamer< const std::vector< dyn::expansion > >
	vector<dyn::expansion> -> std::tuple<expansion_t, ...>. More...
struct	vnamer< const std::vector< dyn::expression > >
	vector<dyn::expression> -> std::tuple<expression_t, ...>. More...
struct	vnamer< const std::vector< dyn::label > >
	vector<dyn::label> -> std::tuple<label_t, ...>. More...
struct	vnamer< const std::vector< dyn::polynomial > >
	vector<dyn::polynomial> -> std::tuple<polynomial_t, ...>. More...
struct	vnamer< const std::vector< dyn::weight > >
	vector<dyn::weight> -> std::tuple<weight_t, ...>. More...
struct	vnamer< const std::vector< unsigned > >
struct	vnamer< float >
struct	vnamer< int >
struct	vnamer< integral_constant >
struct	vnamer< std::integral_constant< T, Value > >
struct	vnamer< std::istream >
struct	vnamer< std::ostream >
struct	vnamer< unsigned >
struct	vnamer< vcsn::direction >
struct	vnamer< vcsn::rat::identities >
struct	weighted_tag
	Request for the weighted version of an algorithm. More...
struct	weightset_mixin
	Provide a variadic mul on top of a binary mul(), and one(). More...
struct	welement
	Storage for a label and a non-null weight. More...
class	wordset
	Implementation of labels are words. More...
class	xalloc
	Allocate slots in std::ostreams. More...
struct	yen_tag
	Yen implementation. More...
struct	zip_sequences
struct	zip_sequences_padded
struct	zipped_maps

Typedefs
template<Automaton Aut>
using	states_t = std::unordered_set< state_t_of< Aut > >
template<bool Lazy, Automaton Lhs, Automaton Rhs>
using	compose_automaton = std::shared_ptr< detail::compose_automaton_impl< Lazy, Lhs, Rhs > >
	A compose automaton as a shared pointer. More...
template<typename ExpSet >
using	derived_term_automaton = std::shared_ptr< detail::derived_term_automaton_impl< ExpSet > >
	A derived-term automaton as a shared pointer. More...
template<Automaton Aut, wet_kind_t Kind, bool Lazy = false>
using	determinized_automaton = std::shared_ptr< detail::determinized_automaton_impl< Aut, Kind, Lazy > >
	A determinized automaton as a shared pointer. More...
template<Automaton Aut>
using	lazy_proper_automaton = std::shared_ptr< detail::lazy_proper_automaton_impl< Aut > >
template<Automaton Aut, bool Trans = false>
using	filter_automaton = std::shared_ptr< detail::filter_automaton_impl< Aut, Trans > >
template<Automaton Aut>
using	delay_automaton = std::shared_ptr< detail::delay_automaton_impl< Aut > >
	An automaton wrapper that presents the delay automaton. More...
template<std::size_t Tape, Automaton Aut>
using	focus_automaton = std::shared_ptr< detail::focus_automaton_impl< Tape, Aut > >
	A focus automaton as a shared pointer. More...
template<Automaton Aut>
using	synchronized_automaton = std::shared_ptr< detail::synchronized_automaton_impl< Aut > >
	An automaton wrapper that presents the synchronized automaton. More...
template<Automaton Aut>
using	transpose_automaton = std::shared_ptr< detail::transpose_automaton_impl< Aut > >
	An automaton wrapper that presents the transposed automaton. More...
using	letter_class_t = std::set< std::pair< std::string, std::string > >
	A set of letter ranges. More...
template<Automaton Aut>
using	insplit_automaton = detail::insplit_automaton< Aut >
	An insplit automaton as a shared pointer. More...
template<Automaton Aut>
using	codeterminized_automaton = transpose_automaton< determinized_automaton< decltype(transpose(std::declval< Aut >())), wet_kind_t::bitset > >
	The type of the codeterminized automaton. More...
template<typename ValueSet >
using	add_mem_fn_t = decltype(std::declval< ValueSet >() .add(std::declval< typename ValueSet::value_t >(), std::declval< typename ValueSet::value_t >()))
	The type of the add member function in valuesets. More...
template<typename ValueSet >
using	has_add_mem_fn = detail::detect< ValueSet, add_mem_fn_t >
	Whether ValueSet features an add() member function. More...
template<Automaton Aut>
using	pair_automaton = std::shared_ptr< detail::pair_automaton_impl< Aut > >
template<Automaton Aut>
using	partial_identity_context_t_of = typename detail::partial_identity_context< Aut >::context_t
template<Automaton Aut>
using	quotient_t = partition_automaton_t< Aut >
	The return type when calling quotient on Aut. More...
template<Automaton Aut>
using	scc_automaton = std::shared_ptr< detail::scc_automaton_impl< Aut > >
template<typename Aut >
using	predecessors_t_of = std::vector< transition_t_of< Aut > >
	A state-indexed vector of predecessor transitions from the path path. More...
template<typename Aut >
using	path_t_of = std::vector< transition_t_of< Aut > >
	A list of transitions representing a path. More...
template<typename Context >
using	mutable_automaton = std::shared_ptr< detail::mutable_automaton_impl< Context > >
template<Automaton Aut>
using	name_automaton = std::shared_ptr< detail::name_automaton_impl< Aut > >
template<Automaton Aut>
using	permutation_automaton = std::shared_ptr< detail::permutation_automaton_impl< Aut > >
	A permutation automaton as a shared pointer. More...
template<Automaton Aut>
using	expression_automaton = std::shared_ptr< detail::expression_automaton_impl< Aut > >
	An expression automaton as a shared pointer. More...
template<typename... ValueSets>
using	join_t = decltype(join(std::declval< ValueSets >()...))
	The type of the join of the ValueSets. More...
template<Automaton Aut>
using	partition_automaton = std::shared_ptr< detail::partition_automaton_impl< Aut > >
	A partition automaton as a shared pointer. More...
template<Automaton Aut>
using	partition_automaton_t = typename detail::partition_automaton_t_impl< Aut >::type
	The return type when calling quotient on Aut. More...
template<typename Context >
using	expressionset = weightset_mixin< rat::expressionset_impl< Context > >
template<typename ExpSet >
using	expansionset = rat::expansionset< ExpSet >
using	state_map_t = std::vector< Value >
template<Automaton... Auts>
using	tuple_automaton = std::shared_ptr< detail::tuple_automaton_impl< Auts... > >
	A tuple automaton as a shared pointer. More...
template<typename... ValueSets>
using	meet_t = decltype(meet(std::declval< ValueSets >()...))
template<typename T >
using	base_t = std::remove_cv_t< std::remove_reference_t< T > >
	T without reference or const/volatile qualifiers. More...
template<typename ValueSet >
using	context_t_of = typename detail::context_t_of_impl< base_t< ValueSet > >::type
template<typename ValueSet >
using	label_t_of = typename detail::label_t_of_impl< base_t< ValueSet > >::type
template<typename ValueSet >
using	labelset_t_of = typename detail::labelset_t_of_impl< base_t< ValueSet > >::type
template<typename ValueSet >
using	state_t_of = typename detail::state_t_of_impl< base_t< ValueSet > >::type
template<typename ValueSet >
using	transition_t_of = typename detail::transition_t_of_impl< base_t< ValueSet > >::type
template<typename ValueSet >
using	weight_t_of = typename detail::weight_t_of_impl< base_t< ValueSet > >::type
template<typename ValueSet >
using	weightset_t_of = typename detail::weightset_t_of_impl< base_t< ValueSet > >::type
template<typename Aut , typename Context = context_t_of<Aut>>
using	fresh_automaton_t_of = typename Aut::element_type::template fresh_automaton_t< Context >
	Given an automaton type, the type of its copies. More...
template<typename ValueSet >
using	letter_t_of = typename labelset_t_of< base_t< ValueSet > >::letter_t
template<typename ValueSet >
using	word_t_of = typename labelset_t_of< base_t< ValueSet > >::word_t
template<typename... LabelSets>
using	tupleset = weightset_mixin< detail::tupleset_impl< LabelSets... > >
using	dynamic_bitset = boost::dynamic_bitset<>
template<typename Elt >
using	min_fibonacci_heap = boost::heap::fibonacci_heap< Elt, detail::comparator_t< Elt > >
template<typename Elt >
using	max_fibonacci_heap = boost::heap::fibonacci_heap< Elt >
using	symbol = boost::flyweight< std::string, boost::flyweights::no_tracking, boost::flyweights::intermodule_holder >
	An internalized string. More...
template<size_t I, typename T >
using	tuple_element_t = typename std::tuple_element< I, T >::type
	C++14. More...
template<bool B>
using	bool_constant = std::integral_constant< bool, B >
template<typename Key , typename Value , wet_kind_t Kind = detail::wet_kind<Key, Value>(), typename Compare = std::less<Key>, typename Hash = std::hash<Key>, typename KeyEqual = std::equal_to<Key>>
using	wet = detail::wet_impl< Kind, Key, Value, Compare, Hash, KeyEqual >
	Given Key/Value types, the appropriate weighted set type. More...
template<typename Context , wet_kind_t Kind = detail::wet_kind<labelset_t_of<Context>, weightset_t_of<Context>>()>
using	wet_of = wet< label_t_of< Context >, weight_t_of< Context >, Kind, vcsn::less< labelset_t_of< Context > >, vcsn::hash< labelset_t_of< Context > >, vcsn::equal_to< labelset_t_of< Context > >>
	The corresponding wet for a LabelSet -> WeightSet context. More...
using	b = weightset_mixin< detail::b_impl >
using	f2 = weightset_mixin< detail::f2_impl >
using	log = weightset_mixin< detail::log_impl >
using	nmin = weightset_mixin< detail::nmin_impl >
using	q = weightset_mixin< detail::q_impl >
using	qmp = weightset_mixin< detail::qmp_impl >
using	r = weightset_mixin< detail::r_impl >
using	rmin = weightset_mixin< detail::rmin_impl >
using	z = weightset_mixin< detail::z_impl >
using	zmin = weightset_mixin< detail::zmin_impl >
template<typename Context , wet_kind_t Kind = detail::wet_kind<labelset_t_of<Context>, weightset_t_of<Context>>()>
using	polynomialset = weightset_mixin< detail::polynomialset_impl< Context, Kind > >

Enumerations
enum	scc_algo_t {   scc_algo_t::auto_, scc_algo_t::dijkstra, scc_algo_t::tarjan_iterative, scc_algo_t::tarjan_recursive,   scc_algo_t::kosaraju }
enum	to_expression_heuristic_t {   to_expression_heuristic_t::best, to_expression_heuristic_t::delgado, to_expression_heuristic_t::delgado_label, to_expression_heuristic_t::naive,   to_expression_heuristic_t::best, to_expression_heuristic_t::delgado, to_expression_heuristic_t::delgado_label, to_expression_heuristic_t::naive }
enum	to_expression_heuristic_t {   to_expression_heuristic_t::best, to_expression_heuristic_t::delgado, to_expression_heuristic_t::delgado_label, to_expression_heuristic_t::naive,   to_expression_heuristic_t::best, to_expression_heuristic_t::delgado, to_expression_heuristic_t::delgado_label, to_expression_heuristic_t::naive }
enum	direction { direction::forward, direction::backward }
	Orientation. More...
enum	star_status_t { ABSVAL, NON_STARRABLE, STARRABLE, TOPS }
enum	wet_kind_t { wet_kind_t::bitset, wet_kind_t::map, wet_kind_t::set, wet_kind_t::unordered_map }
	Different implementations of wets. More...

Functions
template<Automaton Aut>
std::vector< transition_t_of< Aut > >	lightest_path (const Aut &aut, state_t_of< Aut > source, state_t_of< Aut > dest, a_star_tag)
template<Automaton Aut>
states_t< Aut >	accessible_states (const Aut &aut, bool strict=true)
	The set of accessible states, including pre(), and possibly post(). More...
template<Automaton Aut>
states_t< Aut >	coaccessible_states (const Aut &a, bool strict=true)
	The set of coaccessible states, including post(), and possibly pre(). More...
template<Automaton Aut>
states_t< Aut >	useful_states (const Aut &a, bool strict=true)
	The set of useful states, including possibly pre() and post(). More...
template<Automaton Aut>
size_t	num_accessible_states (const Aut &a)
	Number of accessible states, not counting pre() and post(). More...
template<Automaton Aut>
size_t	num_coaccessible_states (const Aut &a)
	Number of accessible states, not counting pre() and post(). More...
template<Automaton Aut>
size_t	num_useful_states (const Aut &a)
	Number of accessible states, not counting pre() and post(). More...
template<Automaton Aut>
filter_automaton< Aut >	accessible (const Aut &a)
	Accessible part of an automaton. More...
template<Automaton Aut>
filter_automaton< Aut >	coaccessible (const Aut &a)
	Coaccessible part of an automaton. More...
template<Automaton Aut>
filter_automaton< Aut >	trim (const Aut &a)
	Useful part of an automaton. More...
template<Automaton Aut>
bool	is_trim (const Aut &a)
	Whether all its states are useful. More...
template<Automaton Aut>
bool	is_useless (const Aut &a)
	Whether all no state is useful. More...
template<Automaton Aut>
bool	is_accessible (const Aut &a)
	Whether all its states are accessible. More...
template<Automaton Aut>
bool	is_coaccessible (const Aut &a)
	Whether all its states are coaccessible. More...
template<Automaton Aut>
bool	is_empty (const Aut &a)
	Whether has no states. More...
template<Automaton Aut1, Automaton Aut2>
Aut1 &	add_here (Aut1 &res, const Aut2 &b, standard_tag)
	Merge transitions of b into those of res. More...
template<Automaton Aut1, Automaton Aut2>
auto	add_here (Aut1 &res, const Aut2 &b, deterministic_tag)
template<Automaton Aut1, Automaton Aut2>
auto	add (const Aut1 &lhs, const Aut2 &rhs, deterministic_tag)
template<Automaton Aut1, Automaton Aut2>
Aut1 &	add_here (Aut1 &res, const Aut2 &b, general_tag)
	Merge transitions of b into those of res. More...
template<Automaton Aut1, Automaton Aut2, typename Tag = general_tag>
auto	add (const Aut1 &lhs, const Aut2 &rhs, Tag tag={}) -> decltype(join_automata(lhs, rhs))
	The sum of two automata. More...
template<typename ValueSet >
ValueSet::value_t	add (const ValueSet &vs, const typename ValueSet::value_t &lhs, const typename ValueSet::value_t &rhs)
	Sums of values. More...
template<Automaton Aut1, Automaton Aut2>
auto	are_equivalent (const Aut1 &a1, const Aut2 &a2) -> std::enable_if_t<(std::is_same< weightset_t_of< Aut1 >, b >::value &&std::is_same< weightset_t_of< Aut2 >, b >::value), bool >
	Check equivalence between Boolean automata on a free labelset. More...
template<typename ExpSet1 , typename ExpSet2 >
auto	are_equivalent (const ExpSet1 &rs1, const typename ExpSet1::value_t r1, const ExpSet2 &rs2, const typename ExpSet2::value_t r2) -> bool
	Check equivalence between two expressions. More...
template<Automaton Lhs, Automaton Rhs>
fresh_automaton_t_of< Lhs >	difference (const Lhs &lhs, const Rhs &rhs)
	An automaton that computes weights of lhs, but not by rhs. More...
template<typename ExpSet >
ExpSet::value_t	difference (const ExpSet &rs, const typename ExpSet::value_t &lhs, const typename ExpSet::value_t &rhs)
	Difference of expressions. More...
template<Automaton Aut1, Automaton Aut2>
bool	are_isomorphic (const Aut1 &a1, const Aut2 &a2)
template<Automaton Aut>
predecessors_t_of< Aut >	lightest_path (const Aut &aut, state_t_of< Aut > source, state_t_of< Aut >, bellman_ford_tag)
	Destination is ignored as bellman-ford does not stop when reaching dest, but when each iteration has been done. More...
template<typename Ctx >
mutable_automaton< Ctx >	cerny (const Ctx &ctx, unsigned num_states)
	Cerny automata are automata whose synchronizing word length is always (n - 1)^2, the upper bound of the Cerny's conjecture. More...
template<Automaton Lhs, Automaton Rhs>
int	compare (const Lhs &lhs, const Rhs &rhs)
	Comparison between lhs and rhs. More...
template<Automaton Lhs, Automaton Rhs>
bool	are_equal (const Lhs &lhs, const Rhs &rhs)
	Whether lhs is equal to rhs. More...
template<Automaton Lhs, Automaton Rhs>
bool	less_than (const Lhs &lhs, const Rhs &rhs)
	Whether lhs precedes rhs. More...
template<Automaton Aut>
void	complement_here (Aut &aut)
template<Automaton Aut>
auto	complement (const Aut &aut) -> decltype(copy(aut))
template<Automaton Aut>
Aut &	complete_here (Aut &aut)
	Complete aut and return it. More...
template<Automaton Aut>
auto	complete (const Aut &aut) -> decltype(::vcsn::copy(aut))
	A complete copy of aut. More...
template<typename... LS1, typename... LS2>
auto	compose_labelset (const tupleset< LS1... > &ls1, const tupleset< LS2... > &ls2)
template<typename Ctx1 , typename Ctx2 >
auto	compose_context (const Ctx1 &ctx1, const Ctx2 &ctx2)
template<typename ValueSet >
ValueSet::value_t	compose (const ValueSet &vs, const typename ValueSet::value_t &lhs, const typename ValueSet::value_t &rhs)
	Composition of values. More...
template<typename Ctx1 , typename Ctx2 >
auto	compose_polynomialset (const polynomialset< Ctx1 > &ps1, const polynomialset< Ctx2 > &ps2)
template<bool Lazy, std::size_t OutTape, std::size_t InTape, Automaton Lhs, Automaton Rhs>
auto	make_compose_automaton (const Lhs &lhs, const Rhs &rhs)
template<Automaton Lhs, Automaton Rhs, std::size_t OutTape = 1, std::size_t InTape = 0>
auto	compose (const Lhs &lhs, const Rhs &rhs)
	Build the (accessible part of the) composition. More...
template<typename Lhs , typename Rhs , std::size_t OutTape = 1, std::size_t InTape = 0>
auto	compose_lazy (const Lhs &lhs, const Rhs &rhs)
	Build the (accessible part of the) lazy composition. More...
template<Automaton Aut>
Aut	conjugate (const Aut &aut)
template<typename ValueSet >
ValueSet::value_t	conjunction (const ValueSet &rs, const typename ValueSet::value_t &lhs, const typename ValueSet::value_t &rhs)
	Intersection/Hadamard product of values. More...
template<Automaton Aut1, Automaton Aut2>
auto	ldivide (const Aut1 &lhs, const Aut2 &rhs, auto_tag={})
	Compute the left quotient. More...
template<Automaton Aut1, Automaton Aut2>
auto	ldivide (const Aut1 &lhs, const Aut2 &rhs, boolean_tag)
template<Automaton Aut1, Automaton Aut2>
auto	ldivide (const Aut1 &lhs, const Aut2 &rhs, weighted_tag)
template<Automaton Aut1, Automaton Aut2>
auto	rdivide (const Aut1 &a1, const Aut2 &a2)
	Compute the right quotient. More...
template<Automaton... Auts>
auto	shuffle (const Auts &... as) -> tuple_automaton< decltype(join_automata(as...)), Auts... >
	The (accessible part of the) shuffle product. More...
template<Automaton A1, Automaton A2>
auto	infiltrate (const A1 &a1, const A2 &a2) -> tuple_automaton< decltype(join_automata(a1, a2)), A1, A2 >
	The (accessible part of the) infiltration product. More...
template<Automaton A1, Automaton A2, Automaton A3, Automaton... Auts>
auto	infiltrate (const A1 &a1, const A2 &a2, const A3 &a3, const Auts &... as) -> decltype(infiltrate(infiltrate(a1, a2), a3, as...))
	The (accessible part of the) infiltration product. More...
template<Automaton Aut>
auto	conjunction (const Aut &aut, to exp) -> fresh_automaton_t_of< Aut >
	Repeated conjunction of a automaton. More...
template<typename ExpSet >
weight_t_of< ExpSet >	constant_term (const ExpSet &rs, const typename ExpSet::value_t &e)
	The constant term of e. More...
template<Automaton AutIn, Automaton AutOut = fresh_automaton_t_of<AutIn>>
AutOut	make_fresh_automaton (const AutIn &model)
	Create an empty, mutable, automaton, based on another one. More...
template<Automaton AutIn, Automaton AutOut>
detail::copier< AutIn, AutOut >	make_copier (const AutIn &in, AutOut &out, bool safe=true)
	Build an automaton copier. More...
template<Automaton AutIn, Automaton AutOut, typename KeepState , typename KeepTrans >
void	copy_into (const AutIn &in, AutOut &out, KeepState keep_state, KeepTrans keep_trans)
	Copy selected states and transitions of an automaton. More...
template<Automaton AutIn, Automaton AutOut, typename KeepState >
void	copy_into (const AutIn &in, AutOut &out, KeepState keep_state)
	Copy the selected states an automaton. More...
template<Automaton AutIn, Automaton AutOut>
void	copy_into (const AutIn &in, AutOut &out)
	Copy an automaton. More...
template<Automaton AutIn, Automaton AutOut>
void	copy_into (const AutIn &in, AutOut &out, bool safe)
	Copy an automaton. More...
template<Automaton AutIn, Automaton AutOut = fresh_automaton_t_of<AutIn>, typename KeepState , typename KeepTrans >
auto	copy (const AutIn &input, KeepState keep_state, KeepTrans keep_trans) -> decltype(keep_state(input->null_state()), keep_trans(input->null_transition()), make_fresh_automaton< AutIn, AutOut >(input))
	A copy of input keeping only its states that are accepted by keep_state, and transitions accepted by keep_trans. More...
template<Automaton AutIn, Automaton AutOut = fresh_automaton_t_of<AutIn>, typename KeepState >
auto	copy (const AutIn &input, KeepState keep_state) -> decltype(keep_state(input->null_state()), make_fresh_automaton< AutIn, AutOut >(input))
	A copy of input. More...
template<Automaton AutIn, Automaton AutOut = fresh_automaton_t_of<AutIn>>
AutOut	copy (const AutIn &input)
	A copy of input. More...
template<Automaton AutIn, Automaton AutOut = fresh_automaton_t_of<AutIn>, typename States >
auto	copy (const AutIn &input, const States &ss) -> decltype(*ss.begin()==input->null_state(), make_fresh_automaton< AutIn, AutOut >(input))
	A copy of input keeping only its states that are members of states. More...
template<Automaton AutIn, Automaton AutOut = fresh_automaton_t_of<AutIn>, typename States , typename Trans >
auto	copy (const AutIn &input, const States &ss, const Trans &ts) -> decltype(*ss.begin()==input->null_state(), *ts.begin()==input->null_transition(), make_fresh_automaton< AutIn, AutOut >(input))
	A copy of input keeping only its states that are members of container ss, and transitions that are members of container ts. More...
template<Automaton AutIn, Automaton AutOut = fresh_automaton_t_of<AutIn>, typename Transitions >
auto	copy (const AutIn &input, const Transitions &ts) -> decltype(*ts.begin()==input->null_transition(), make_fresh_automaton< AutIn, AutOut >(input))
	A copy of input keeping only its transitions that are members of ts, and the states on which these transitions depend. More...
template<Automaton Aut>
std::ostream &	daut (const Aut &aut, std::ostream &out=std::cout)
	Print an automaton in Daut format. More...
template<typename Context >
mutable_automaton< Context >	de_bruijn (const Context &ctx, unsigned n)
	Build a automaton for (a+b)*a(a+b){n}. More...
template<typename ExpSet >
rat::expression_polynomial_t< ExpSet >	derivation (const ExpSet &rs, const typename ExpSet::value_t &e, label_t_of< ExpSet > a, bool breaking)
	Derive an expression wrt to a letter. More...
template<typename ExpSet >
rat::expression_polynomial_t< ExpSet >	derivation (const ExpSet &rs, const rat::expression_polynomial_t< ExpSet > &p, label_t_of< ExpSet > a, bool breaking=false)
	Derive a polynomial of expressions wrt to a letter. More...
template<typename ExpSet , typename = std::enable_if_t<!std::is_same<word_t_of<ExpSet>, label_t_of<ExpSet>>{}>>
rat::expression_polynomial_t< ExpSet >	derivation (const ExpSet &rs, const typename ExpSet::value_t &e, const word_t_of< ExpSet > &l, bool breaking=false)
	Derive an expression wrt to a word. More...
template<typename ExpSet >
auto	make_derived_term_automaton (const ExpSet &rs, const detail::derived_term_algo &algo) -> derived_term_automaton< ExpSet >
template<typename ExpSet >
std::enable_if_t< labelset_t_of< ExpSet >::is_letterized(), expression_automaton< mutable_automaton< typename ExpSet::context_t > > >	derived_term (const ExpSet &rs, const typename ExpSet::value_t &r, const std::string &algo="auto")
	The derived-term automaton, for letterized labelsets. More...
template<typename ExpSet >
std::enable_if_t<!labelset_t_of< ExpSet >::is_letterized(), expression_automaton< mutable_automaton< typename ExpSet::context_t > > >	derived_term (const ExpSet &rs, const typename ExpSet::value_t &r, const std::string &algo="auto")
	The derived-term automaton, for non letterized labelsets. More...
template<typename ExpansionSet >
ExpansionSet::value_t	determinize (const ExpansionSet &xs, const typename ExpansionSet::value_t &x)
	Determinize an expansion. More...
template<Automaton Aut, typename Tag , bool Lazy = false>
auto	determinize (const Aut &a, Tag={}, bool_constant< Lazy >={})
template<Automaton Aut, bool Lazy = false>
auto	determinize (const Aut &a, auto_tag={}, bool_constant< Lazy > lazy={})
	Determinization: automatic dispatch based on the automaton type. More...
template<Automaton Aut, typename Tag = auto_tag>
auto	codeterminize (const Aut &aut, Tag tag={})
template<Automaton Aut>
predecessors_t_of< Aut >	lightest_path (const Aut &aut, state_t_of< Aut > source, state_t_of< Aut > dest, dijkstra_tag)
template<Automaton Aut>
std::vector< weight_t_of< Aut > >	ss_shortest_distance (const Aut &aut, state_t_of< Aut > s0)
	Single source shortest distance. More...
template<Automaton Aut>
std::unordered_map< state_t_of< Aut >, std::pair< unsigned, transition_t_of< Aut > > >	paths_ibfs (const Aut &aut, const std::vector< state_t_of< Aut >> &start)
	Find the shortest paths from some states to all the states. More...
template<Automaton Aut>
std::vector< std::vector< weight_t_of< Aut > > >	all_distances (const Aut &aut)
template<typename ValueSet >
ValueSet::value_t	ldivide (const ValueSet &vs, const typename ValueSet::value_t &lhs, const typename ValueSet::value_t &rhs)
	Left-division of values. More...
template<typename ValueSet >
ValueSet::value_t	lgcd (const ValueSet &vs, const typename ValueSet::value_t &lhs, const typename ValueSet::value_t &rhs)
	Left-division of values. More...
template<typename ValueSet >
ValueSet::value_t	rdivide (const ValueSet &vs, const typename ValueSet::value_t &lhs, const typename ValueSet::value_t &rhs)
	Right-division of values. More...
template<typename Context >
mutable_automaton< Context >	divkbaseb (const Context &ctx, unsigned divisor, unsigned base)
	Build the Boolean automaton which accepts a word n representing a number in base "base" if and only if divisor|n. More...
template<Automaton Aut>
std::ostream &	dot (const Aut &aut, std::ostream &out=std::cout, format fmt={}, bool mathjax=false)
	Print an automaton in Graphviz's Dot format. More...
template<typename Context >
mutable_automaton< Context >	double_ring (const Context &ctx, unsigned n, const std::vector< unsigned > &finals)
template<Automaton Aut>
std::ostream &	efsm (const Aut &aut, std::ostream &out=std::cout)
	Print automaton to EFSM format, based on FSM format. More...
template<Automaton Aut>
std::vector< detail::path< Aut > >	compute_eppstein (const Aut &aut, state_t_of< Aut > src, state_t_of< Aut > dst, unsigned num)
	Compute the num lightest paths in the automaton aut from src to dst. More...
template<Automaton Aut>
auto	evaluate (const Aut &a, const word_t_of< Aut > &w) -> std::enable_if_t<!context_t_of< Aut >::is_lao, weight_t_of< Aut >>
	General case of evaluation. More...
template<Automaton Aut>
auto	evaluate (const Aut &a, const label_t_of< Aut > &={}) -> std::enable_if_t< context_t_of< Aut >::is_lao, weight_t_of< Aut >>
	Evaluation for lao automaton. More...
template<Automaton Aut>
auto	evaluate (const Aut &a, const typename detail::word_polynomialset_t< context_t_of< Aut >>::value_t &p) -> weight_t_of< Aut >
	Evaluation of a polynomial. More...
template<typename ExpSet >
ExpSet::value_t	expand (const ExpSet &rs, const typename ExpSet::value_t &r)
	Expand a typed expression, i.e., distribute multiplications over sums. More...
template<Automaton Aut, bool Trans = false>
filter_automaton< Aut, Trans >	filter (const Aut &aut, boost::optional< dynamic_bitset > ss={}, boost::optional< dynamic_bitset > ts={})
	Build a filtered view of an automaton. More...
template<Automaton Aut>
filter_automaton< Aut >	filter (const Aut &aut, const std::unordered_set< state_t_of< Aut >> &ss)
	Build a filtered view of an automaton. More...
template<unsigned Tape, Automaton Aut>
focus_automaton< Tape, Aut >	focus (Aut aut)
template<Automaton Aut>
bool	in_situ_remover (Aut &aut, bool prune=true)
template<Automaton Aut>
bool	is_ambiguous (const Aut &aut)
	Whether an automaton is ambiguous. More...
template<Automaton Aut>
bool	is_proper (const Aut &aut) ATTRIBUTE_CONST
	Test whether an automaton is proper. More...
template<Automaton Aut>
bool	is_valid (const Aut &aut)
template<typename ExpSet >
bool	is_valid (const ExpSet &rs, const typename ExpSet::value_t &e)
	Whether e has only computable stars. More...
template<typename ExpSet >
rat::expansionset< ExpSet >::value_t	to_expansion (const ExpSet &rs, const typename ExpSet::value_t &e)
	First order expansion. More...
template<Automaton Aut>
std::ostream &	fado (const Aut &aut, std::ostream &out=std::cout)
	Format automaton to FAdo format. More...
template<Automaton Aut>
std::ostream &	grail (const Aut &aut, std::ostream &out)
	Print automaton in Grail format. More...
std::string	guess_automaton_format (std::istream &is)
	Guess the format of an automaton file. More...
template<Automaton Aut>
bool	has_bounded_lag (const Aut &aut)
	Whether a transducer has a bounded lag. More...
template<Automaton Aut>
std::enable_if_t< weightset_t_of< Aut >::has_lightening_weights(), bool >	has_lightening_cycle (const Aut &aut)
template<Automaton Aut>
std::enable_if_t<!weightset_t_of< Aut >::has_lightening_weights(), bool >	has_lightening_cycle (const Aut &)
template<Automaton Aut>
bool	cycle_identity (const detail::component_t< Aut > &c, const Aut &aut)
	Check the weight of two states on this component is unique. More...
template<Automaton AutIn, Automaton AutOut>
void	create_states_and_trans_ (const AutIn &aut, AutOut &naut1, AutOut &naut2)
	Create states and the transitions two new automata naut1 and naut2 with weight of transition <(w, one)> and <(one, w)> corresponding with the weight of transition <w> of aut. More...
template<Automaton Aut>
bool	has_twins_property (const Aut &aut)
	Whether aut has the twins property. More...
template<Automaton Aut, typename ExpSet , typename Tag >
Aut	inductive (const ExpSet &rs, const typename ExpSet::value_t &r, Tag={})
	Build an automaton by induction from an expression. More...
template<typename ValueSet >
ValueSet::value_t	infiltrate (const ValueSet &vs, const typename ValueSet::value_t &lhs, const typename ValueSet::value_t &rhs)
	Infiltration product of values. More...
template<Automaton Aut>
std::ostream &	info (const Aut &aut, std::ostream &out=std::cout, unsigned details=2)
	Print info about an automaton. More...
template<typename ExpSet >
void	info (const ExpSet &rs, const typename ExpSet::value_t &e, std::ostream &o=std::cout)
	Print info about the expression. More...
template<Automaton Aut>
ATTRIBUTE_CONST std::enable_if_t< context_t_of< Aut >::has_one(), bool >	is_eps_acyclic (const Aut &aut)
	Detect epsilon-circuits. More...
template<Automaton Aut>
ATTRIBUTE_CONST std::enable_if_t<!context_t_of< Aut >::has_one(), bool >	is_eps_acyclic (const Aut &)
template<Automaton Aut>
ATTRIBUTE_CONST bool	is_acyclic (const Aut &aut)
template<Automaton Aut>
word_t_of< Aut >	ambiguous_word (const Aut &aut)
template<Automaton Aut>
bool	is_cycle_ambiguous (const Aut &aut)
	Whether aut is cycle-ambiguous. More...
template<Automaton Aut>
bool	is_cycle_ambiguous_scc (const Aut &aut)
	Whether aut is cycle-ambiguous. More...
template<Automaton Aut>
bool	is_complete (const Aut &aut)
	Whether aut is complete. More...
template<Automaton Aut>
bool	is_deterministic (const Aut &aut, state_t_of< Aut > s)
	Whether state s is deterministic in aut. More...
template<Automaton Aut>
size_t	num_deterministic_states (const Aut &aut)
	Number of non-deterministic states. More...
template<Automaton Aut>
size_t	num_codeterministic_states (const Aut &aut)
	Number of non-deterministic states of transposed automaton. More...
template<Automaton Aut>
bool	is_deterministic (const Aut &aut)
	Whether has at most an initial state, and all its states are deterministic. More...
template<Automaton Aut>
bool	is_codeterministic (const Aut &aut)
	Whether the transposed automaton is deterministic. More...
template<Automaton Aut>
constexpr bool	is_free_boolean ()
template<Automaton Aut>
bool	is_functional (const Aut &aut)
	Whether aut is functional. More...
template<Automaton Aut>
bool	is_partial_identity (const Aut &aut)
	Whether transducer aut is equivalent to a partial identity function on all successful paths. More...
template<Automaton Aut>
bool	is_synchronized (const Aut &aut)
	Check whether the transducer is synchronized. More...
template<Automaton Aut>
auto	make_delay_automaton (const Aut &aut) -> decltype(detail::make_delay_automaton(aut))
	Check whether the transducer is synchronized. More...
template<Automaton Aut>
std::vector< path_t_of< Aut > >	k_lightest_path (const Aut &aut, state_t_of< Aut > src, state_t_of< Aut > dst, unsigned k)
template<Automaton Aut>
predecessors_t_of< Aut >	format_lightest (const Aut &aut, const std::vector< transition_t_of< Aut >> &path)
	A state-indexed vector of predecessor transitions from the path path. More...
template<Automaton Aut>
predecessors_t_of< Aut >	lightest_path (const Aut &aut, state_t_of< Aut > src, state_t_of< Aut > dst, yen_tag)
template<typename Context >
mutable_automaton< Context >	ladybird (const Context &ctx, unsigned n)
	Build the ladybird automaton of n states. More...
template<Automaton Aut>
auto	letterize (const Aut &aut) -> decltype(detail::letterize(aut))
	Split the word transitions in the input automaton into letter ones. More...
template<Automaton Aut>
bool	is_letterized (const Aut &aut)
	Check if the transitions are all letters. More...
template<Automaton Aut>
auto	realtime (const Aut &aut) -> decltype(proper(::vcsn::letterize(aut)))
	Split the word transitions in the input automaton into letter ones, and remove the spontaneous transitions. More...
template<Automaton Aut>
bool	is_realtime (const Aut &aut)
	Check if the automaton is realtime, i.e. More...
template<typename Context >
mutable_automaton< Context >	levenshtein (const Context &ctx)
	The Levenshtein automaton for a given context. More...
template<Automaton Aut, size_t... Tapes>
detail::lifted_automaton_t< Aut, Tapes... >	lift (const Aut &a, vcsn::rat::identities ids={})
	Lift some tapes of the transducer. More...
template<typename ExpSet >
detail::lifted_expressionset_t< ExpSet >::value_t	lift (const ExpSet &rs, const typename ExpSet::value_t &e)
	Move all the labels to the weights. More...
template<Automaton Aut, typename Algo = auto_tag>
fresh_automaton_t_of< Aut >	lightest_automaton (const Aut &aut, unsigned k, Algo algo={})
	Lightest Automaton. More...
template<Automaton Aut, typename Tag = auto_tag>
predecessors_t_of< Aut >	lightest_path (const Aut &aut, Tag tag={})
	Lightest path dispatch between algorithms with tags. More...
template<Automaton Aut>
predecessors_t_of< Aut >	lightest_path (const Aut &aut, state_t_of< Aut > source, state_t_of< Aut > dest, auto_tag={})
template<Automaton Aut>
predecessors_t_of< Aut >	lightest_path (const Aut &aut, state_t_of< Aut > src, state_t_of< Aut > dst, const std::string &algo)
	Lightest path dispatch between algorithms with string. More...
template<Automaton Aut>
auto	path_monomial (const Aut &aut, const predecessors_t_of< Aut > &path, state_t_of< Aut > src=Aut::element_type::pre(), state_t_of< Aut > dst=Aut::element_type::post()) -> boost::optional< typename detail::word_polynomialset_t< context_t_of< Aut >>::monomial_t >
	Given a path (typically computed by lightest_path), the corresponding monomial (label, weight). More...
template<Automaton Aut>
detail::word_polynomialset_t< context_t_of< Aut > >::value_t	lightest (const Aut &aut, unsigned num=1, const std::string &algo="auto")
	The approximated behavior of an automaton. More...
template<typename Ctx >
Ctx	make_context (const std::string &name)
	Build a context from its name. More...
template<Automaton Aut>
auto	minimize (const Aut &a, brzozowski_tag) -> std::enable_if_t< is_free_boolean< Aut >(), determinized_automaton< codeterminized_automaton< Aut >, wet_kind_t::bitset >>
	Brzozowski-based minimization. More...
template<Automaton Aut>
std::enable_if_t< is_free_boolean< Aut >), quotient_t< Aut > >	minimize (const Aut &a, hopcroft_tag)
template<Automaton Aut, typename Tag >
auto	minimize (const Aut &a, Tag) -> quotient_t< Aut >
	Minimization via the minimizer functors. More...
template<Automaton Aut>
std::enable_if_t< std::is_same< weightset_t_of< Aut >, b >::value, quotient_t< Aut > >	minimize (const Aut &a, auto_tag={})
	Minimization for Boolean automata: auto_tag. More...
template<Automaton Aut>
std::enable_if_t<!std::is_same< weightset_t_of< Aut >, b >::value, quotient_t< Aut > >	minimize (const Aut &a, auto_tag={})
	Minimization for non Boolean automata: auto_tag.. More...
template<Automaton Aut>
std::enable_if_t< is_free_boolean< Aut >), quotient_t< Aut > >	minimize (const Aut &a, const std::string &algo)
	Minimization for Boolean automata on a free labelset: algo selection. More...
template<Automaton Aut>
std::enable_if_t< std::is_same< weightset_t_of< Aut >, b >::value &&!labelset_t_of< Aut >::is_free(), quotient_t< Aut > >	minimize (const Aut &a, const std::string &algo)
	Minimization for Boolean automata on a non-free labelset: algo selection. More...
template<Automaton Aut>
std::enable_if_t<!std::is_same< weightset_t_of< Aut >, b >::value, quotient_t< Aut > >	minimize (const Aut &a, const std::string &algo)
	Minimization for non Boolean automata: algo selection. More...
template<Automaton Aut, typename Tag = auto_tag>
auto	cominimize (const Aut &a, Tag tag={}) -> decltype(transpose(minimize(transpose(a), tag)))
	Cominimization. More...
template<Automaton Aut1, Automaton Aut2>
Aut1 &	multiply_here (Aut1 &res, const Aut2 &b, deterministic_tag)
	Append automaton b to res. More...
template<Automaton Aut1, Automaton Aut2>
Aut1 &	multiply_here (Aut1 &res, const Aut2 &b, general_tag)
	Append automaton b to res for non standard automata. More...
template<Automaton Aut1, Automaton Aut2>
Aut1 &	multiply_here (Aut1 &res, const Aut2 &b, standard_tag={})
	Append automaton b to res. More...
template<Automaton Aut1, Automaton Aut2, typename Tag = general_tag>
auto	multiply (const Aut1 &lhs, const Aut2 &rhs, Tag tag={}) -> decltype(lhs->null_state(), rhs->null_state(), detail::make_join_automaton(tag, lhs, rhs))
	Concatenate two automata, general case. More...
template<Automaton Aut, typename Tag = general_tag>
auto	multiply (const Aut &aut, to exp, Tag tag={}) -> decltype(aut->null_state(), detail::make_join_automaton(tag, aut))
	Repeated concatenation of an automaton. More...
template<typename ValueSet >
ValueSet::value_t	multiply (const ValueSet &vs, const typename ValueSet::value_t &lhs, const typename ValueSet::value_t &rhs)
	Product (concatenation) of expressions/labels/polynomials/weights. More...
template<typename ValueSet >
auto	multiply (const ValueSet &vs, const typename ValueSet::value_t &v, const to &exp) -> std::enable_if_t<!has_add_mem_fn< ValueSet >
	Repeated multiplication of values that cannot be added. More...
return	detail::static_if< detail::has_power_mem_fn< ValueSet >{}> ([](const auto &vs, const auto &v, auto n){ return vs.power(v, n);}, [](const auto &vs, const auto &v, auto n) { auto res=vs.one();if(!vs.is_one(v)) while(n--) res=vs.mul(res, v);return res;})(vs
	if (exp.max==-1)
	if (exp.min< exp.max)
template<typename ExpansionSet >
ExpansionSet::value_t	denormalize (const ExpansionSet &xs, typename ExpansionSet::value_t x)
	Denormalize an expansion. More...
template<typename ExpansionSet >
bool	is_normal (const ExpansionSet &xs, const typename ExpansionSet::value_t &x)
	Normalize an expansion. More...
template<typename ExpansionSet >
ExpansionSet::value_t	normalize (const ExpansionSet &xs, typename ExpansionSet::value_t x)
	Normalize an expansion. More...
template<Automaton Aut>
bool	is_normalized (const Aut &a)
	Whether a is standard and co-standard. More...
template<Automaton Aut>
auto	normalize (const Aut &a) -> decltype(copy(a))
	Normalize automaton a. More...
template<typename Ctx >
constexpr auto	num_tapes () -> size_t
template<typename Ctx >
constexpr auto	num_tapes (const Ctx &) -> size_t
template<Automaton Aut>
pair_automaton< Aut >	pair (const Aut &aut, bool keep_initials=false)
template<Automaton Aut>
fresh_automaton_t_of< Aut, partial_identity_context_t_of< Aut > >	partial_identity (const Aut &aut)
	Create a partial identity transducer from aut. More...
template<Automaton Aut>
Aut &	suffix_here (Aut &aut)
	Make all accessible states initial. More...
template<Automaton Aut>
auto	suffix (const Aut &aut) -> decltype(::vcsn::copy(aut))
template<Automaton Aut>
Aut &	prefix_here (Aut &aut)
	Make all coaccessible states final. More...
template<Automaton Aut>
auto	prefix (const Aut &aut) -> decltype(::vcsn::copy(aut))
template<Automaton Aut>
Aut &	factor_here (Aut &aut)
	Make each useful state both initial and final. More...
template<Automaton Aut>
auto	factor (const Aut &aut) -> decltype(::vcsn::copy(aut))
template<Automaton Aut>
Aut &	subword_here (Aut &aut)
	Add spontaneous transitions for each non spontaneous transition, with same source, destination and weight. More...
template<Automaton Aut>
auto	subword (const Aut &aut) -> decltype(make_nullable_automaton(aut->context()))
	Apply subword_here() to a copy of aut. More...
template<Automaton Aut>
std::ostream &	print (const Aut &aut, std::ostream &out=std::cout, const std::string &fmt="default")
template<typename ValueSet >
std::ostream &	print (const ValueSet &vs, const typename ValueSet::value_t &v, std::ostream &o=std::cout, format fmt={})
	Print a value thanks to a valueset. More...
template<typename Context >
std::ostream &	print (const expressionset< Context > &rs, const typename expressionset< Context >::value_t &r, std::ostream &o=std::cout, const std::string &fmt="default")
	Print an expression. More...
template<typename PolynomialSet >
std::ostream &	list (const PolynomialSet &ps, const typename PolynomialSet::value_t &p, std::ostream &o=std::cout)
template<std::size_t Tape, Automaton Aut>
auto	project (const Aut &aut) -> mutable_automaton< detail::project_context< Tape, context_t_of< Aut >>>
template<Automaton Aut>
auto	proper (const Aut &aut, direction dir=direction::backward, bool prune=true, const std::string &algo="auto") -> fresh_automaton_t_of< Aut, detail::proper_context< context_t_of< Aut >>>
	Eliminate spontaneous transitions. More...
template<Automaton Aut>
auto	proper_lazy (const Aut &aut, direction dir=direction::backward, bool prune=true) -> lazy_proper_automaton< Aut >
template<Automaton Aut>
void	proper_here (Aut &aut, direction dir=direction::backward, bool prune=true, const std::string &algo="auto")
	Eliminate spontaneous transitions in place. More...
template<Automaton Aut>
weight_t_of< Aut >	shortest_distance_to_finals (Aut aut, state_t_of< Aut > s0)
	Find shorhest of s0 to the final states of aut by using single source shortest distance. More...
template<Automaton Aut>
std::unordered_map< state_t_of< Aut >, weight_t_of< Aut > >	shortest_distance_to_finals (Aut aut)
	Find all shortest distances of each state to the final states of aut. More...
template<Automaton Aut>
auto	push_weights (const Aut &aut) -> decltype(::vcsn::copy(aut))
	The algorithm weight pushing. More...
template<Automaton Aut>
auto	quotient (const Aut &a, typename detail::quotienter< Aut >::class_to_set_t &cs) -> quotient_t< Aut >
template<typename Context >
mutable_automaton< Context >	quotkbaseb (const Context &ctx, unsigned divisor, unsigned base)
	Build the transducer which accepts a word n representing a number in base "base" and outputs the quotient of the division of n by k. More...
template<typename Ctx >
mutable_automaton< Ctx >	random_automaton (const Ctx &ctx, unsigned num_states, float density=0.1, unsigned num_initial=1, unsigned num_final=1, boost::optional< unsigned > max_labels={}, float loop_chance=0.0, const std::string &weights="")
	Produce a random automaton. More...
template<typename Ctx >
mutable_automaton< Ctx >	random_automaton_deterministic (const Ctx &ctx, unsigned num_states)
template<typename ExpressionSet >
std::string	random_expression_string (const ExpressionSet &es, const std::string &param)
	Generate a random expression string. More...
template<typename ExpressionSet >
ExpressionSet::value_t	random_expression (const ExpressionSet &es, const std::string &param)
	Generate a random expression. More...
template<typename WeightSet >
WeightSet::value_t	random_weight (const WeightSet &ws, const std::string &param={})
	Generate a random weight. More...
template<Automaton Aut>
Aut	read_automaton (std::istream &is, const std::string &f="default")
	Static version of the read_automaton function. More...
template<typename Context >
auto	read_label (const Context &ctx, std::istream &is, bool quoted=false) -> label_t_of< Context >
template<typename Context >
auto	read_polynomial (const Context &ctx, std::istream &is) -> typename polynomialset< Context >::value_t
template<typename Context >
auto	read_weight (const Context &ctx, std::istream &is) -> weight_t_of< Context >
template<Automaton Aut>
auto	left_reduce (const Aut &input) -> decltype(copy(input))
template<Automaton Aut>
auto	reduce (const Aut &input) -> decltype(copy(input))
template<Automaton Aut>
std::vector< state_t_of< Aut > >	reverse_postorder (const Aut &aut)
	Get all states in reverse postorder. More...
scc_algo_t	scc_algo (const std::string &algo)
template<Automaton Aut, typename Tag = auto_tag>
const detail::components_t< Aut >	strong_components (const Aut &aut, Tag={})
	Find all strongly connected components of aut. More...
template<Automaton Aut>
const detail::components_t< Aut >	strong_components (const Aut &aut, scc_algo_t algo=scc_algo_t::tarjan_iterative)
	Find all strongly connected components of aut. More...
template<Automaton Aut>
fresh_automaton_t_of< Aut >	aut_of_component (const detail::component_t< Aut > &com, const Aut &aut)
	Generate a subautomaton corresponding to an SCC. More...
template<Automaton Aut>
scc_automaton< Aut >	scc (const Aut &aut, const std::string &algo="auto")
	Get scc_automaton from aut. More...
template<Automaton Aut>
std::size_t	num_components (const scc_automaton< Aut > &aut)
	Get number of strongly connected components. More...
template<Automaton Aut>
std::size_t	num_components (const Aut &)
template<Automaton Aut>
filter_automaton< scc_automaton< Aut > >	component (const scc_automaton< Aut > &aut, unsigned num)
	An SCC as a subautomaton. More...
template<Automaton Aut>
void	component (const Aut &, unsigned)
template<Automaton Aut>
partition_automaton< scc_automaton< Aut > >	condense (const scc_automaton< Aut > &aut)
	Create a condensation of automaton with each its state who is a strongly connected component of aut. More...
template<Automaton Aut>
partition_automaton< Aut >	condense (const Aut &)
template<Automaton Aut>
detail::enumerater< Aut >::polynomial_t	shortest (const Aut &aut, boost::optional< unsigned > num={}, boost::optional< unsigned > len={})
	The approximated behavior of an automaton. More...
template<Automaton Aut>
detail::enumerater< Aut >::polynomial_t	shortest (const Aut &aut, state_t_of< Aut > src, state_t_of< Aut > dst)
	The approximated behavior of a part of an automaton (looks for one word of unspecified length). More...
template<Automaton Aut>
detail::enumerater< Aut >::polynomial_t	enumerate (const Aut &aut, unsigned len)
	The approximated behavior of an automaton. More...
template<typename ValueSet >
ValueSet::value_t	shuffle (const ValueSet &vs, const typename ValueSet::value_t &lhs, const typename ValueSet::value_t &rhs)
	Shuffle product of values. More...
template<Automaton Aut>
bool	is_out_sorted (const Aut &a)
	Whether for each state, the outgoing transitions are sorted by increasing label. More...
template<Automaton Aut>
auto	sort (const Aut &a) -> permutation_automaton< Aut >
template<typename ExpSet >
rat::expression_polynomial_t< ExpSet >	split (const ExpSet &rs, const typename ExpSet::value_t &e)
	Split an expression. More...
template<typename PolynomialSet >
PolynomialSet::value_t	split_polynomial (const PolynomialSet &ps, const typename PolynomialSet::value_t &p)
	Split a polynomial of expressions, given the polynomialset. More...
template<typename ExpSet >
rat::expression_polynomial_t< ExpSet >	split (const ExpSet &rs, const rat::expression_polynomial_t< ExpSet > &p)
	Split a polynomial of expressions, given the expressionset. More...
template<Automaton Aut>
bool	is_standard (const Aut &a)
	Whether a is standard. More...
template<Automaton Aut>
bool	is_costandard (const Aut &a)
	Whether a is costandard. More...
template<Automaton Aut>
void	standard_here (Aut &aut)
	Turn aut into a standard automaton. More...
template<Automaton Aut>
auto	standard (const Aut &aut)
template<Automaton Aut>
auto	costandard (const Aut &aut) -> decltype(copy(aut))
template<Automaton Aut, typename ExpSet >
Aut	standard (const ExpSet &rs, const typename ExpSet::value_t &r)
	Build a standard automaton from an expression. More...
template<typename ExpSet >
unsigned	star_height (const ExpSet &es, const typename ExpSet::value_t &e)
	Star height of an expression. More...
template<typename ExpSet >
ExpSet::value_t	star_normal_form (const ExpSet &rs, const typename ExpSet::value_t &e)
	Star-normal form of an expression. More...
template<Automaton Aut>
Aut &	star_here (Aut &res, general_tag={})
	In-place star of an automaton. More...
template<Automaton Aut>
Aut &	star_here (Aut &res, standard_tag)
	In-place star of a standard automaton. More...
template<Automaton Aut>
Aut &	star_here (Aut &res, deterministic_tag)
	In-place star of a deterministic automaton. More...
template<Automaton Aut, typename Tag = general_tag>
auto	star (const Aut &aut, Tag tag={}) -> decltype(detail::make_join_automaton(tag, aut))
	Star of an automaton. More...
template<Automaton Aut>
auto	strip (const Aut &aut)
	Remove (all) the decorations from a decorated automaton. More...
template<Automaton Aut>
auto	synchronize (const Aut &aut) -> decltype(detail::synchronize(aut))
	Synchronize the transducer. More...
template<Automaton Aut>
bool	is_synchronized_by (const Aut &aut, const word_t_of< Aut > &w)
	Whether w synchronizes automaton aut. More...
template<Automaton Aut>
bool	is_synchronizing (const Aut &aut)
	Whether this automaton is synchronizing, i.e., has synchronizing words. More...
template<Automaton Aut>
word_t_of< Aut >	synchronizing_word (const Aut &aut, const std::string &algo="greedy")
	Return a synchronizing word for aut using algo algo. More...
template<Automaton Aut, typename ExpSet >
Aut	thompson (const context_t_of< Aut > &ctx, const ExpSet &rs, const typename ExpSet::value_t &r)
	Build a Thompson automaton from an expression. More...
template<Automaton Aut, typename ExpSet >
Aut	thompson (const ExpSet &rs, const typename ExpSet::value_t &r)
	Build a Thompson automaton from an expression. More...
template<Automaton AutPtr>
std::ostream &	tikz (const AutPtr &aut, std::ostream &out)
	Print automaton to TikZ format. More...
template<Automaton Aut>
Aut &	to_automaton (const LabelSet &ls, const typename LabelSet::word_t &w) -> mutable_automaton<>
	In place removal of state s from automaton res. More...
template<Automaton Aut>
auto	eliminate_state (const Aut &aut, state_t_of< Aut > s=Aut::element_type::null_state()) -> fresh_automaton_t_of< Aut >
	A copy of automaton res without the state s. More...
template<Automaton Aut, typename Profiler , typename ExpSet = expressionset<context_t_of<Aut>>>
ExpSet::value_t	to_expression (Aut &a, Profiler &profiler)
template<Automaton Aut, typename ExpSet = expressionset<context_t_of<Aut>>>
ExpSet::value_t	to_expression_heuristic (const Aut &aut, vcsn::rat::identities ids, to_expression_heuristic_t algo)
template<Automaton Aut, typename ExpSet = expressionset<context_t_of<Aut>>>
ExpSet::value_t	to_expression (const Aut &aut, vcsn::rat::identities ids, to_expression_heuristic_t algo)
template<Automaton Aut, typename ExpSet = expressionset<context_t_of<Aut>>>
ExpSet::value_t	to_expression (const Aut &a, vcsn::rat::identities ids, const std::string &algo)
template<typename ExpressionSet >
ExpressionSet::value_t	to_expression (const ExpressionSet &rs, const letter_class_t &letters, bool accept=true)
	An expression matching one letter in a letter class. More...
template<typename ExpansionSet >
ExpansionSet::expression_t	to_expression (const ExpansionSet &xs, const typename ExpansionSet::value_t &x)
	The projection of an expansion as an expression. More...
template<Automaton Aut>
Aut &	eliminate_state_here (Aut &res, state_t_of< Aut > s=Aut::element_type::null_state())
	In place removal of state s from automaton res. More...
template<Automaton Aut>
auto	to_spontaneous (const Aut &aut) -> std::enable_if_t<!context_t_of< Aut >::is_lao, decltype(make_mutable_automaton(make_context(oneset(), *aut->weightset())))>
	Convert to spontaneous automaton: change every transition's label to the empty word. More...
template<Automaton Aut>
Aut	transpose (const transpose_automaton< Aut > &aut)
	The transpose of a transpose automaton is the original automaton. More...
template<Automaton Aut>
transpose_automaton< Aut >	transpose (Aut aut)
	Transpose of an automaton. More...
template<typename PolynomialSet >
mutable_automaton< detail::free_context< context_t_of< PolynomialSet > > >	trie (const PolynomialSet &ps, const typename PolynomialSet::value_t &p)
	Make a trie-like mutable_automaton for a finite series given as a polynomial. More...
template<typename PolynomialSet >
mutable_automaton< detail::free_context< context_t_of< PolynomialSet > > >	cotrie (const PolynomialSet &ps, const typename PolynomialSet::value_t &p)
	Make a cotrie-like mutable_automaton for a finite series given as a polynomial. More...
template<typename PolynomialSet >
mutable_automaton< detail::free_context< context_t_of< PolynomialSet > > >	trie (const PolynomialSet &ps, std::istream &is, const std::string &format="default")
	Make a trie-like mutable_automaton for a finite series read from a stream. More...
template<typename PolynomialSet >
mutable_automaton< detail::free_context< context_t_of< PolynomialSet > > >	cotrie (const PolynomialSet &ps, std::istream &is, const std::string &format="default")
	Make a trie-like mutable_automaton for a finite series read from a stream. More...
template<typename... Ctx>
auto	tuple_context (Ctx &&... ctx) -> context< tupleset< labelset_t_of< Ctx >... >, join_t< weightset_t_of< Ctx >... >>
template<typename... ExpansionSets>
auto	tuple_expansionset (const ExpansionSets &... ess) -> rat::expansionset< decltype(tuple_expressionset(ess.expressionset()...))>
template<typename ValueSet , typename... ValueSets>
ValueSet::value_t	tuple (const ValueSet &vs, const typename ValueSets::value_t &... v)
template<typename... ExpSets>
auto	tuple_expressionset (const ExpSets &... rss) -> expressionset< decltype(tuple_context(rss.context()...))>
template<typename... PolynomialSets>
auto	tuple_polynomialset (const PolynomialSets &... pss) -> polynomialset< decltype(tuple_context(pss.context()...))>
template<typename Context >
mutable_automaton< Context >	u (const Context &ctx, unsigned n)
	The Brzozowski universal witness. More...
template<Automaton Aut>
Aut	universal (const Aut &a)
template<Automaton Aut>
auto	weight_series (const Aut &a) -> std::enable_if_t<!is_tropical< weightset_t_of< Aut >>::value, weight_t_of< Aut >>
template<Automaton Aut, typename Tag = auto_tag>
Aut &	lweight_here (const weight_t_of< Aut > &w, Aut &res, Tag tag={})
	In place left-multiplication of an automaton by a weight. More...
template<Automaton Aut, typename Tag = auto_tag>
auto	lweight (const weight_t_of< Aut > &w, const Aut &aut, Tag tag={}) -> fresh_automaton_t_of< Aut >
	Left-multiplication of an automaton by a weight. More...
template<typename ValueSet >
auto	lweight (const ValueSet &rs, const weight_t_of< ValueSet > &w, const typename ValueSet::value_t &r) -> decltype(rs.lweight(w, r))
template<typename WeightSet , typename ExpSet >
expansionset< expressionset< context< labelset_t_of< ExpSet >, join_t< WeightSet, weightset_t_of< ExpSet > > > > >	join_weightset_expansionset (const WeightSet &ws, const expansionset< ExpSet > &rs)
template<typename WeightSet , typename ExpSet >
expressionset< context< labelset_t_of< ExpSet >, join_t< WeightSet, weightset_t_of< ExpSet > > > >	join_weightset_expressionset (const WeightSet &ws, const ExpSet &rs)
	Join between an expressionset and a weightset. More...
template<typename WeightSet , typename ExpSet >
auto	join_weightset_polynomialset (const WeightSet &ws, const polynomialset< ExpSet > &ps)
template<Automaton Aut, typename Tag = auto_tag>
Aut &	rweight_here (Aut &res, const weight_t_of< Aut > &w, Tag tag={})
	In place right-multiplication of an automaton by a weight. More...
template<Automaton Aut, typename Tag = auto_tag>
fresh_automaton_t_of< Aut >	rweight (const Aut &aut, const weight_t_of< Aut > &w, Tag tag={})
	Right-multiplication of an automaton by a weight. More...
template<typename ValueSet >
ValueSet::value_t	rweight (const ValueSet &rs, const typename ValueSet::value_t &r, const weight_t_of< ValueSet > &w)
template<Automaton Aut, typename ExpSet >
Aut	zpc (const context_t_of< Aut > &ctx, const ExpSet &rs, const typename ExpSet::value_t &r, const std::string &algo="auto")
	Build a ZPC automaton from an expression. More...
template<>
char_letters::letter_t	char_letters::special< char_letters::letter_t > ()
template<>
char_letters::word_t	char_letters::special< char_letters::word_t > ()
template<typename Key , typename Compare , typename Allocator >
ATTRIBUTE_PURE bool	has (const boost::container::flat_set< Key, Compare, Allocator > &s, const Key &e)
	Whether e is member of s. More...
template<>
string_letters::letter_t	string_letters::special< string_letters::letter_t > ()
template<>
string_letters::word_t	string_letters::special< string_letters::word_t > ()
template<typename ValueSet >
auto	join (const ValueSet &vs) -> ValueSet
	The join of a single valueset. More...
template<typename ValueSet1 , typename ValueSet2 >
auto	join (ValueSet1 vs1, ValueSet2 vs2) -> decltype(detail::join_(vs1, vs2, 0))
	The join of two valuesets. More...
template<typename ValueSet1 , typename ValueSet2 , typename ValueSet3 , typename... VSs>
auto	join (ValueSet1 vs1, ValueSet2 vs2, ValueSet3 vs3, VSs &&... vs)
	The join of three (or more) valuesets. More...
template<typename Context >
mutable_automaton< Context >	make_mutable_automaton (const Context &ctx)
template<typename Context >
auto	make_nullable_automaton (const Context &ctx)
template<Automaton Aut>
auto	make_partition_automaton (const fresh_automaton_t_of< Aut > &res, const Aut &input, const typename detail::partition_automaton_impl< Aut >::origins_t origins) -> partition_automaton_t< Aut >
	Build a partition_automaton. More...
template<Automaton Aut>
auto	make_partition_automaton (const fresh_automaton_t_of< Aut > &res, const partition_automaton< Aut > &input, const typename detail::partition_automaton_impl< Aut >::origins_t origins) -> partition_automaton_t< Aut >
	Build a partition_automaton of a partition_automaton: smash into a single level partition_automaton. More...
template<Automaton Aut>
auto	make_partition_automaton (const fresh_automaton_t_of< transpose_automaton< Aut >> &res, const transpose_automaton< Aut > &input, const typename detail::partition_automaton_impl< Aut >::origins_t origins) -> transpose_automaton< partition_automaton_t< Aut >>
	Build a partition_automaton of a transpose_automaton: smash into a transpose_automaton of a partition_automaton. More...
template<typename Context >
expansionset< expressionset< Context > >	make_expansionset (const expressionset< Context > &es)
template<typename LabelSet , typename WeightSet >
auto	make_expressionset (const context< LabelSet, WeightSet > &ctx, rat::identities ids={}) -> expressionset< context< LabelSet, WeightSet >>
	Shorthand to expressionset constructor. More...
template<typename Context >
auto	make_expressionset (const expressionset< Context > &rs, rat::identities ids={}) -> expressionset< Context >
	Shorthand to expressionset constructor. More...
template<typename Ctx1 , typename Ctx2 >
auto	meet (const expressionset< Ctx1 > &a, const expressionset< Ctx2 > &b) -> expressionset< meet_t< Ctx1, Ctx2 >>
	The meet of two expressionsets. More...
template<typename Context , typename RandomGenerator = std::default_random_engine>
expressionset< Context >::value_t	random_label (const expressionset< Context > &rs, RandomGenerator &gen=RandomGenerator())
	Random label from expressionset: limited to a single label. More...
template<typename ExpSet >
ExpSet::value_t	transpose (const ExpSet &rs, const typename ExpSet::value_t &v)
	An expression that denotes the transposition of v. More...
template<typename Value >
state_map_t< Value >	make_state_map () const
template<Automaton... Auts>
auto	make_tuple_automaton (const Auts &... auts) -> tuple_automaton< Auts... >
template<typename LabelSet , typename WeightSet >
context< LabelSet, WeightSet >	make_context (const LabelSet &ls, const WeightSet &ws)
	Shorthand to build a context. More...
template<typename ValueSet >
auto	meet (const ValueSet &vs) -> ValueSet
	The meet of a single valueset. More...
template<typename ValueSet1 , typename ValueSet2 , typename ValueSet3 , typename... VSs>
auto	meet (const ValueSet1 &vs1, const ValueSet2 &vs2, const ValueSet3 &vs3, const VSs &... vs) -> decltype(meet(meet(vs1, vs2), vs3, vs...))
template<typename LhsLabelSet , typename LhsWeightSet , typename RhsLabelSet , typename RhsWeightSet >
auto	meet (const context< LhsLabelSet, LhsWeightSet > &a, const context< RhsLabelSet, RhsWeightSet > &b) -> context< meet_t< LhsLabelSet, RhsLabelSet >, join_t< LhsWeightSet, RhsWeightSet >>
	The meet of two contexts. More...
	VCSN_CTX_INSTANTIATE (ctx::lal_char_b)
	VCSN_CTX_INSTANTIATE (ctx::lal_char_br)
	VCSN_CTX_INSTANTIATE (ctx::lal_char_q)
	VCSN_CTX_INSTANTIATE (ctx::lal_char_zr)
	VCSN_CTX_INSTANTIATE (ctx::lal_char_zrr)
	VCSN_CTX_INSTANTIATE (ctx::law_char_br)
	VCSN_CTX_INSTANTIATE (ctx::law_char_zr)
	VCSN_CTX_INSTANTIATE (ctx::law_char_zrr)
template<typename T >
symbol	sname ()
template<typename T >
symbol	sname (T &)
template<typename... Args>
signature	ssignature ()
	Static signature. More...
template<typename T >
symbol	vname (T &t)
template<typename... Args>
signature	vsignature (Args &&... args)
	The signature of (Args...). More...
template<typename LabelSet , typename RandomGenerator = std::default_random_engine>
LabelSet::value_t	random_label (const LabelSet &ls, RandomGenerator &gen=RandomGenerator())
	Random label from general case such as letterset. More...
template<typename GenSet >
letterset< GenSet >	meet (const letterset< GenSet > &lhs, const letterset< GenSet > &rhs)
	Compute the meet with another labelset. More...
template<typename GenSet >
nullableset< letterset< GenSet > >	meet (const nullableset< letterset< GenSet >> &lhs, const nullableset< letterset< GenSet >> &rhs)
	Compute the meet with another labelset. More...
template<typename GenSet >
nullableset< letterset< GenSet > >	meet (const letterset< GenSet > &lhs, const nullableset< letterset< GenSet >> &rhs)
template<typename GenSet >
nullableset< letterset< GenSet > >	meet (const nullableset< letterset< GenSet >> &lhs, const letterset< GenSet > &rhs)
template<typename Lls , typename Rls >
nullableset< meet_t< Lls, Rls > >	meet (const nullableset< Lls > &lhs, const nullableset< Rls > &rhs)
template<typename LabelSet , typename RandomGenerator = std::default_random_engine>
nullableset< LabelSet >::value_t	random_label (const nullableset< LabelSet > &ls, RandomGenerator &gen=RandomGenerator())
	Random label from nullableset. More...
oneset	meet (const oneset &, const oneset &)
	The meet of two labelsets. More...
template<typename RandomGenerator = std::default_random_engine>
oneset::value_t	random_label (const oneset &ls, RandomGenerator &=RandomGenerator())
	Random label from oneset. More...
template<typename... LabelSet, typename RandomGenerator = std::default_random_engine>
tupleset< LabelSet... >::value_t	random_label (const tupleset< LabelSet... > &ls, RandomGenerator &gen=RandomGenerator())
	Random label from tupleset. More...
template<typename... LabelSet, size_t... I, typename RandomGenerator = std::default_random_engine>
tupleset< LabelSet... >::value_t	random_label_ (const tupleset< LabelSet... > &ls, RandomGenerator &gen, detail::index_sequence< I... >)
	Implementation detail for random label from tupleset. More...
template<typename GenSet >
wordset< GenSet >	meet (const wordset< GenSet > &lhs, const wordset< GenSet > &rhs)
	Compute the meet with another alphabet. More...
template<typename GenSet , typename RandomGenerator = std::default_random_engine>
wordset< GenSet >::value_t	random_label (const wordset< GenSet > &ls, RandomGenerator &gen=RandomGenerator())
	Random label from wordset. More...
template<typename Container , typename = typename Container::value_type>
Container	set_difference (const Container &s1, const Container &s2)
	The set of members of s1 that are not members of s2. More...
template<typename Container , typename = typename Container::value_type>
Container	set_intersection (const Container &s1, const Container &s2)
	The intersection of two sets. More...
template<typename Container >
bool	same_domain (const Container &x, const Container &y)
	Check that two associative containers have the same keys. More...
template<typename Container , typename = typename Container::value_type>
Container	set_union (const Container &s1, const Container &s2)
	The union of two sets. More...
template<typename Map , typename Key >
auto	has (const Map &s, const Key &e) -> decltype(s.find(e) !=std::end(s))
	Whether e is in s. More...
detail::config &	get_config ()
	Get the configuration singleton. More...
std::string	configuration (const std::string &key)
	Get the string mapped by key (e.g., "configuration.version", "dot.styles"). More...
template<typename Cont , typename Pred >
container_filter_range< Cont, Pred >	make_container_filter_range (const Cont &cont, Pred pred)
template<typename... Sequences>
cross_sequences< Sequences... >	cross (Sequences &&... seqs)
template<typename... Sequences>
cross_sequences< Sequences... >	cross_tuple (const std::tuple< Sequences... > &seqs)
template<typename T , typename Allocator = std::allocator<T>>
ATTRIBUTE_PURE bool	has (const std::deque< T, Allocator > &s, const T &e)
	Whether e is member of s. More...
std::string	to_string (direction d)
	Conversion to string. More...
std::istream &	operator>> (std::istream &is, direction &d)
	Parsing. More...
std::ostream &	operator<< (std::ostream &os, direction d)
	Pretty-printing. More...
template<typename Container >
dynamic_bitset	make_dynamic_bitset (const Container &c, size_t size)
bool	operator< (empty_t, empty_t)
bool	operator== (empty_t, empty_t)
std::ostream &	str_escape (std::ostream &os, const std::string &str, const char *special=nullptr)
	Output a string, escaping special characters. More...
template<typename T >
std::ostream &	str_escape (std::ostream &os, const std::vector< T > &s, const char *special=nullptr)
	A container of letters. More...
std::ostream &	str_escape (std::ostream &os, int c, const char *special=nullptr)
	Output a character, escaping special characters. More...
std::ostream &	str_escape (std::ostream &os, char c, const char *special=nullptr)
	Output a character, escaping special characters. More...
template<typename T >
std::string	str_escape (T &&s, const char *special=nullptr)
	Convert to a string, escaped. More...
template<typename... Args>
std::string	str_quote (Args &&... args)
	Convert to a string, in quotes. More...
std::ostream &	operator<< (std::ostream &o, const file_library &l)
	Print l on o. More...
template<typename Range , typename Filter >
auto	filter (Range &&r, Filter f, decltype(f(*std::begin(r)), void()) *=nullptr)
	Similar to boost::adaptors::filter, but ensures that the range is kept alive. More...
std::string	to_string (format i)
	Wrapper around operator<<. More...
std::istream &	operator>> (std::istream &is, format &i)
	Read from string form. More...
std::ostream &	operator<< (std::ostream &os, format i)
	Output in string form. More...
void	hash_combine_hash (std::size_t &seed, size_t h)
template<typename T >
void	hash_combine (std::size_t &seed, const T &v)
std::ostream &	incindent (std::ostream &o)
	Increment the indentation. More...
std::ostream &	decindent (std::ostream &o)
	Decrement the indentation. More...
std::ostream &	resetindent (std::ostream &o)
	Reset the indentation. More...
std::ostream &	indent (std::ostream &o)
	Set the indentation. More...
std::ostream &	iendl (std::ostream &o)
	Print an end of line, then set the indentation. More...
std::ostream &	incendl (std::ostream &o)
	Increment the indentation, print an end of line, and set the indentation. More...
std::ostream &	decendl (std::ostream &o)
	Decrement the indentation, print an end of line, and set the indentation. More...
template<typename T , typename U >
bool	has (std::initializer_list< T > s, const U &e)
	Whether e is in s. More...
template<typename Key , typename Value , typename Compare , typename Alloc >
bool	has (const std::map< Key, Value, Compare, Alloc > &s, const Key &e)
	Whether e is in s. More...
template<typename Key , typename Value , typename Comp , typename Alloc >
std::set< typename std::map< Key, Value, Comp, Alloc >::mapped_type >	image (const std::map< Key, Value, Comp, Alloc > &m)
	The set of values of a map. More...
template<typename SharedPtr , typename... Args>
SharedPtr	make_shared_ptr (Args &&... args)
	Same as std::make_shared, but parameterized by the shared_ptr type, not the (pointed to) element_type. More...
unsigned	address (const void *t)
	Name pointers, to make them easier to read. More...
template<typename T >
unsigned	address (T *t)
template<typename T >
unsigned	address (const T &t)
template<typename T >
auto	make_unordered_pair (T &&e1, T &&e2)
template<typename T , typename Container >
ATTRIBUTE_PURE bool	has (const std::queue< T, Container > &s, const T &e)
	Whether e is member of s. More...
template<typename... Args>
ATTRIBUTE_NORETURN void	raise (Args &&... args)
	Raise a runtime_error with the concatenation of args as message. More...
template<typename Bool , typename... Args>
void	require (Bool b, Args &&... args)
	If b is not verified, raise an error with args as message. More...
std::mt19937 &	make_random_engine ()
	Generate a unique random device. More...
template<typename RandomGenerator = std::default_random_engine>
static bool	choose_map (const std::vector< float > &map, RandomGenerator &gen=RandomGenerator())
	Choose whether to pick an element from a map or not. More...
template<typename RandomGenerator >
random_selector< RandomGenerator >	make_random_selector (RandomGenerator &g)
template<typename T , typename Compare , typename Alloc >
bool	has (const std::set< T, Compare, Alloc > &s, const T &e) ATTRIBUTE_PURE
	Whether e is member of s. More...
template<typename T , typename Compare , typename Alloc >
std::set< std::set< T, Compare, Alloc > >	intersection_closure (std::set< std::set< T, Compare, Alloc >> pset)
	The set of all the intersections of the sets in pset. More...
template<typename T , typename Compare , typename Alloc >
std::ostream &	print (const std::set< T, Compare, Alloc > &set, std::ostream &o)
	Print with a separator. Meant to help debugging. More...
template<typename Container >
bool	subset (const Container &set1, const Container &set2) ATTRIBUTE_PURE
	Whether set1 ⊆ set2. More...
std::ostream &	operator<< (std::ostream &os, const signature &sig)
	Output a string, escaping special characters. More...
template<typename Key , typename Value >
bool	has (const sparse_map< Key, Value > &s, Key k)
template<typename T >
bool	has (const sparse_set< T > &s, T e)
std::string	bracketed (std::istream &i, char lbracket, char rbracket)
	Extract the string which is here between lbracket and rbracket. More...
template<typename ValueSet , typename... Args>
auto	conv (const ValueSet &vs, const std::string &str, Args &&... args) -> decltype(vs.conv(std::declval< std::istream &>(), std::forward< Args >(args)...))
	Parse str via vs.conv. More...
char	eat (std::istream &is, char c)
	Check lookahead character and advance. More...
const std::string &	eat (std::istream &is, const std::string &s)
	Check lookahead string and advance. More...
bool	equal_files (const std::string &fn1, const std::string &fn2)
	Whether two files have exactly equal contents. More...
std::string	expand_tilda (const std::string &res)
	Expand initial "~" in res. More...
template<typename... Args>
ATTRIBUTE_NORETURN void	fail_reading (std::istream &is, Args &&... args)
	Throw an exception after failing to read from is. More...
char	get_char (std::istream &i)
	Read a single char, with possible -escape support. More...
std::string	get_file_contents (const std::string &file)
	Return the contents of file. More...
std::shared_ptr< std::istream >	open_input_file (const std::string &file)
	Open file for reading and return its autoclosing stream. More...
std::shared_ptr< std::ostream >	open_output_file (const std::string &file)
	Open file for writing and return its autoclosing stream. More...
void	skip_space (std::istream &is)
	Ignore spaces. More...
std::string	xgetenv (const std::string &var, const std::string &val="")
	getenv(var) if defined, otherwise val. More...
template<typename ValueSet , typename Value = typename ValueSet::value_t, typename... Args>
auto	to_string (const ValueSet &vs, const Value &v, Args &&... args) -> std::string
	Format v via vs.print. More...
template<typename ValueSet >
auto	to_string (const ValueSet &vs) -> decltype(vs.print_set(std::cout), std::string
	Format vs via print_set. More...
vs	print_set (o)
return o	str ()
std::ostream &	operator<< (std::ostream &o, const to &t)
template<bool... B>
constexpr bool	any_ ()
	Static evaluation of the 'or' of the template parameters. More...
template<bool... B>
constexpr bool	all_ ()
template<typename... Bool>
bool	all (Bool &&... values)
	Whether all the values evaluate as true. More...
template<typename Key , typename T , typename Hash , typename KeyEqual , typename Alloc >
size_t	collision_count (const std::unordered_map< Key, T, Hash, KeyEqual, Alloc > &m)
	Sum of bucket sizes. More...
template<typename Key , typename T , typename Hash , typename KeyEqual , typename Alloc >
bool	has (const std::unordered_map< Key, T, Hash, KeyEqual, Alloc > &m, const Key &k)
	Whether e is member of m. More...
template<typename Key , typename Hash , typename KeyEqual , typename Alloc >
bool	has (const std::unordered_set< Key, Hash, KeyEqual, Alloc > &s, const Key &k)
	Whether e is member of s. More...
template<typename Key , typename Hash , typename KeyEqual , typename Alloc >
std::unordered_set< Key, Hash, KeyEqual, Alloc >	set_intersection (const std::unordered_set< Key, Hash, KeyEqual, Alloc > &s1, const std::unordered_set< Key, Hash, KeyEqual, Alloc > &s2)
	Intersection of s1 and s2. More...
template<typename T , typename Alloc >
ATTRIBUTE_PURE bool	has (const std::vector< T, Alloc > &s, const T &e)
	Whether e is member of s. More...
template<typename Label , typename Weight >
auto	label_of (const welement< Label, Weight > &m) -> decltype(m.label())
	The label of a welement. More...
template<typename Label , typename Weight >
auto	weight_of (const welement< Label, Weight > &m) -> decltype(m.weight())
	The weight of a welement. More...
template<typename Label , typename Weight >
void	weight_set (welement< Label, Weight > &m, const Weight &w)
	Set the weight of a welement. More...
template<typename Label , typename Weight >
const Label &	label_of (const std::pair< Label, Weight > &m)
	The label of a pair (label, weight). More...
template<typename Label , typename Weight >
const Weight &	weight_of (const std::pair< Label, Weight > &m)
	The weight of a pair (label, weight). More...
template<typename Label , typename Weight >
Label &	label_of (std::pair< Label, Weight > &m)
	The label of a pair (label, weight). More...
template<typename Label , typename Weight >
void	weight_set (std::pair< Label, Weight > &m, const Weight &w)
	Set the weight of a pair (label, weight). More...
std::string	to_string (wet_kind_t k)
	String version of a wet kind. More...
std::ostream &	operator<< (std::ostream &o, const iomanipulator &g)
	Launch the iomanipulator action on o. More...
template<typename Dereference = as_pair, typename... Maps>
zipped_maps< Dereference, Maps... >	zip_maps (Maps &&... maps)
template<typename Dereference = as_pair, typename... Maps>
zipped_maps< Dereference, Maps... >	zip_map_tuple (const std::tuple< Maps... > &maps)
template<typename... Sequences>
zip_sequences< Sequences... >	zip (Sequences &&... seqs)
template<typename... Sequences>
zip_sequences< Sequences... >	zip_tuple (const std::tuple< Sequences... > &seqs)
template<typename... Sequences>
zip_sequences_padded< zip_sequences< Sequences... > >	zip_with_padding (const std::tuple< typename Sequences::value_type... > &pad, const Sequences &... seq)
template<typename ValueSet , typename... Args>
ATTRIBUTE_NORETURN void	raise_invalid_value (const ValueSet &vs, Args &&... args)
	Cannot make a value from this. More...
template<typename WeightSet >
ATTRIBUTE_NORETURN void	raise_not_starrable (const WeightSet &ws, const typename WeightSet::value_t &w)
	This value is not starrable. More...

Variables
return	v
return exp	min
	else
return	res
std::ostream	cnull {nullptr}
	An narrow-char stream that discards the output. More...
std::wostream	wcnull {nullptr}
	An wide-char stream that discards the output. More...

Typedef Documentation

add_mem_fn_t

template<typename ValueSet >

using vcsn::add_mem_fn_t = typedef decltype(std::declval<ValueSet>() .add(std::declval<typename ValueSet::value_t>(), std::declval<typename ValueSet::value_t>()))

The type of the add member function in valuesets.

Definition at line 333 of file multiply.hh.

b

using vcsn::b = typedef weightset_mixin<detail::b_impl>

Definition at line 48 of file fwd.hh.

base_t

template<typename T >

using vcsn::base_t = typedef std::remove_cv_t<std::remove_reference_t<T> >

T without reference or const/volatile qualifiers.

Definition at line 13 of file traits.hh.

bool_constant

template<bool B>

using vcsn::bool_constant = typedef std::integral_constant<bool, B>

Definition at line 12 of file type_traits.hh.

codeterminized_automaton

template<Automaton Aut>

using vcsn::codeterminized_automaton = typedef transpose_automaton<determinized_automaton <decltype(transpose(std::declval<Aut>())), wet_kind_t::bitset> >

The type of the codeterminized automaton.

Use decltype on transpose because transpose(transpose(a)) returns a.

Definition at line 25 of file minimize-brzozowski.hh.

compose_automaton

template<bool Lazy, Automaton Lhs, Automaton Rhs>

using vcsn::compose_automaton = typedef std::shared_ptr<detail::compose_automaton_impl<Lazy, Lhs, Rhs> >

A compose automaton as a shared pointer.

Definition at line 451 of file compose.hh.

context_t_of

template<typename ValueSet >

using vcsn::context_t_of = typedef typename detail:: context_t_of_impl<base_t<ValueSet> >::type

Definition at line 61 of file traits.hh.

delay_automaton

template<Automaton Aut>

using vcsn::delay_automaton = typedef std::shared_ptr<detail::delay_automaton_impl<Aut> >

An automaton wrapper that presents the delay automaton.

Definition at line 27 of file fwd.hh.

derived_term_automaton

template<typename ExpSet >

using vcsn::derived_term_automaton = typedef std::shared_ptr<detail::derived_term_automaton_impl<ExpSet> >

A derived-term automaton as a shared pointer.

Definition at line 315 of file derived-term.hh.

determinized_automaton

template<Automaton Aut, wet_kind_t Kind, bool Lazy = false>

using vcsn::determinized_automaton = typedef std::shared_ptr<detail::determinized_automaton_impl<Aut, Kind, Lazy> >

A determinized automaton as a shared pointer.

Definition at line 243 of file determinize.hh.

dynamic_bitset

using vcsn::dynamic_bitset = typedef boost::dynamic_bitset<>

Definition at line 35 of file dynamic_bitset.hh.

expansionset

template<typename ExpSet >

using vcsn::expansionset = typedef rat::expansionset<ExpSet>

Definition at line 216 of file fwd.hh.

expression_automaton

template<Automaton Aut>

using vcsn::expression_automaton = typedef std::shared_ptr<detail::expression_automaton_impl<Aut> >

An expression automaton as a shared pointer.

Definition at line 61 of file fwd.hh.

expressionset

template<typename Context >

using vcsn::expressionset = typedef weightset_mixin<rat::expressionset_impl<Context> >

Definition at line 213 of file fwd.hh.

f2

using vcsn::f2 = typedef weightset_mixin<detail::f2_impl>

Definition at line 49 of file fwd.hh.

filter_automaton

template<Automaton Aut, bool Trans = false>

using vcsn::filter_automaton = typedef std::shared_ptr<detail::filter_automaton_impl<Aut, Trans> >

Definition at line 312 of file filter.hh.

focus_automaton

template<std::size_t Tape, Automaton Aut>

using vcsn::focus_automaton = typedef std::shared_ptr<detail::focus_automaton_impl<Tape, Aut> >

A focus automaton as a shared pointer.

Definition at line 42 of file fwd.hh.

fresh_automaton_t_of

template<typename Aut , typename Context = context_t_of<Aut>>

using vcsn::fresh_automaton_t_of = typedef typename Aut::element_type::template fresh_automaton_t<Context>

Given an automaton type, the type of its copies.

Strips most decorators, with the notable exception of transpose_automaton: copies of transposed automata are transposed automata, but with all other kinds of decorations removed. This allows a simple implementation of "co-algorithms": transpose the input automaton, create a fresh copy (which is therefore transposed), process it, and then return its transposition, i.e., a forward automaton.

Definition at line 82 of file traits.hh.

has_add_mem_fn

template<typename ValueSet >

using vcsn::has_add_mem_fn = typedef detail::detect<ValueSet, add_mem_fn_t>

Whether ValueSet features an add() member function.

Definition at line 337 of file multiply.hh.

insplit_automaton

template<Automaton Aut>

using vcsn::insplit_automaton = typedef detail::insplit_automaton<Aut>

An insplit automaton as a shared pointer.

Definition at line 272 of file insplit.hh.

join_t

template<typename... ValueSets>

using vcsn::join_t = typedef decltype(join(std::declval<ValueSets>()...))

The type of the join of the ValueSets.

Definition at line 78 of file join.hh.

label_t_of

template<typename ValueSet >

using vcsn::label_t_of = typedef typename detail:: label_t_of_impl<base_t<ValueSet> >::type

Definition at line 62 of file traits.hh.

labelset_t_of

template<typename ValueSet >

using vcsn::labelset_t_of = typedef typename detail:: labelset_t_of_impl<base_t<ValueSet> >::type

Definition at line 63 of file traits.hh.

lazy_proper_automaton

template<Automaton Aut>

using vcsn::lazy_proper_automaton = typedef std::shared_ptr<detail::lazy_proper_automaton_impl<Aut> >

Definition at line 204 of file epsilon-remover-lazy.hh.

letter_class_t

using vcsn::letter_class_t = typedef std::set<std::pair<std::string, std::string> >

A set of letter ranges.

Definition at line 111 of file fwd.hh.

letter_t_of

template<typename ValueSet >

using vcsn::letter_t_of = typedef typename labelset_t_of<base_t<ValueSet> >::letter_t

Definition at line 86 of file traits.hh.

log

using vcsn::log = typedef weightset_mixin<detail::log_impl>

Definition at line 50 of file fwd.hh.

max_fibonacci_heap

template<typename Elt >

using vcsn::max_fibonacci_heap = typedef boost::heap::fibonacci_heap<Elt>

Definition at line 31 of file fibonacci_heap.hh.

meet_t

template<typename... ValueSets>

using vcsn::meet_t = typedef decltype(meet(std::declval<ValueSets>()...))

Definition at line 168 of file context.hh.

min_fibonacci_heap

template<typename Elt >

using vcsn::min_fibonacci_heap = typedef boost::heap::fibonacci_heap<Elt, detail::comparator_t<Elt> >

Definition at line 28 of file fibonacci_heap.hh.

mutable_automaton

template<typename Context >

using vcsn::mutable_automaton = typedef std::shared_ptr<detail::mutable_automaton_impl<Context> >

Definition at line 25 of file fwd.hh.

name_automaton

template<Automaton Aut>

using vcsn::name_automaton = typedef std::shared_ptr<detail::name_automaton_impl<Aut> >

Definition at line 35 of file fwd.hh.

nmin

using vcsn::nmin = typedef weightset_mixin<detail::nmin_impl>

Definition at line 51 of file fwd.hh.

pair_automaton

template<Automaton Aut>

using vcsn::pair_automaton = typedef std::shared_ptr<detail::pair_automaton_impl<Aut> >

Definition at line 245 of file pair.hh.

partial_identity_context_t_of

template<Automaton Aut>

using vcsn::partial_identity_context_t_of = typedef typename detail::partial_identity_context<Aut>::context_t

Definition at line 35 of file partial-identity.hh.

partition_automaton

template<Automaton Aut>

using vcsn::partition_automaton = typedef std::shared_ptr<detail::partition_automaton_impl<Aut> >

A partition automaton as a shared pointer.

Definition at line 143 of file partition-automaton.hh.

partition_automaton_t

template<Automaton Aut>

using vcsn::partition_automaton_t = typedef typename detail::partition_automaton_t_impl<Aut>::type

The return type when calling quotient on Aut.

Definition at line 202 of file partition-automaton.hh.

path_t_of

template<typename Aut >

using vcsn::path_t_of = typedef std::vector<transition_t_of<Aut> >

A list of transitions representing a path.

Transitions are listed from source (front) to destination (back). The destination of each transition is the source of the following one in the vector. By definition, none of these transitions can be null_transition or this path would be considered ill-formed.

Definition at line 28 of file automaton.hh.

permutation_automaton

template<Automaton Aut>

using vcsn::permutation_automaton = typedef std::shared_ptr<detail::permutation_automaton_impl<Aut> >

A permutation automaton as a shared pointer.

Definition at line 48 of file fwd.hh.

polynomialset

template<typename Context , wet_kind_t Kind = detail::wet_kind<labelset_t_of<Context>, weightset_t_of<Context>>()>

using vcsn::polynomialset = typedef weightset_mixin<detail::polynomialset_impl<Context, Kind> >

Definition at line 63 of file fwd.hh.

predecessors_t_of

template<typename Aut >

using vcsn::predecessors_t_of = typedef std::vector<transition_t_of<Aut> >

A state-indexed vector of predecessor transitions from the path path.

For each state s, res[s] is null_transition if it is not part of path (or it is its beginning), or res[s] is the transition index that points to the incoming transition to s in path.

Definition at line 18 of file automaton.hh.

q

using vcsn::q = typedef weightset_mixin<detail::q_impl>

Definition at line 52 of file fwd.hh.

qmp

using vcsn::qmp = typedef weightset_mixin<detail::qmp_impl>

Definition at line 53 of file fwd.hh.

quotient_t

template<Automaton Aut>

using vcsn::quotient_t = typedef partition_automaton_t<Aut>

The return type when calling quotient on Aut.

Definition at line 119 of file quotient.hh.

r

using vcsn::r = typedef weightset_mixin<detail::r_impl>

Definition at line 54 of file fwd.hh.

rmin

using vcsn::rmin = typedef weightset_mixin<detail::rmin_impl>

Definition at line 55 of file fwd.hh.

scc_automaton

template<Automaton Aut>

using vcsn::scc_automaton = typedef std::shared_ptr<detail::scc_automaton_impl<Aut> >

Definition at line 692 of file scc.hh.

state_map_t

using vcsn::state_map_t = typedef std::vector<Value>

Definition at line 11 of file state-map.hh.

state_t_of

template<typename ValueSet >

using vcsn::state_t_of = typedef typename detail:: state_t_of_impl<base_t<ValueSet> >::type

Definition at line 64 of file traits.hh.

states_t

template<Automaton Aut>

using vcsn::states_t = typedef std::unordered_set<state_t_of<Aut> >

Definition at line 20 of file accessible.hh.

symbol

using vcsn::symbol = typedef boost::flyweight<std::string, boost::flyweights::no_tracking, boost::flyweights::intermodule_holder>

An internalized string.

We do use different modules, since we dlopen plugins. For a while, we had the illusion that it worked properly, but that's only because we were using the default operator< which actually compares the strings, not the address of the symbols. So we did have synonymous symbols, which the code gracefully accepted.

Play it safe and make our symbols unique.

Definition at line 21 of file symbol.hh.

synchronized_automaton

template<Automaton Aut>

using vcsn::synchronized_automaton = typedef std::shared_ptr<detail::synchronized_automaton_impl<Aut> >

An automaton wrapper that presents the synchronized automaton.

Definition at line 91 of file fwd.hh.

transition_t_of

template<typename ValueSet >

using vcsn::transition_t_of = typedef typename detail:: transition_t_of_impl<base_t<ValueSet> >::type

Definition at line 65 of file traits.hh.

transpose_automaton

template<Automaton Aut>

using vcsn::transpose_automaton = typedef std::shared_ptr<detail::transpose_automaton_impl<Aut> >

An automaton wrapper that presents the transposed automaton.

Definition at line 108 of file fwd.hh.

tuple_automaton

template<Automaton... Auts>

using vcsn::tuple_automaton = typedef std::shared_ptr<detail::tuple_automaton_impl<Auts...> >

A tuple automaton as a shared pointer.

Definition at line 293 of file tuple-automaton.hh.

tuple_element_t

template<size_t I, typename T >

using vcsn::tuple_element_t = typedef typename std::tuple_element<I, T>::type

C++14.

Definition at line 14 of file tuple.hh.

tupleset

template<typename... LabelSets>

using vcsn::tupleset = typedef weightset_mixin<detail::tupleset_impl<LabelSets...> >

Definition at line 27 of file fwd.hh.

weight_t_of

template<typename ValueSet >

using vcsn::weight_t_of = typedef typename detail:: weight_t_of_impl<base_t<ValueSet> >::type

Definition at line 66 of file traits.hh.

weightset_t_of

template<typename ValueSet >

using vcsn::weightset_t_of = typedef typename detail:: weightset_t_of_impl<base_t<ValueSet> >::type

Definition at line 67 of file traits.hh.

wet

template<typename Key , typename Value , wet_kind_t Kind = detail::wet_kind<Key, Value>(), typename Compare = std::less<Key>, typename Hash = std::hash<Key>, typename KeyEqual = std::equal_to<Key>>

using vcsn::wet = typedef detail::wet_impl<Kind, Key, Value, Compare, Hash, KeyEqual>

Given Key/Value types, the appropriate weighted set type.

Definition at line 852 of file wet.hh.

wet_of

template<typename Context , wet_kind_t Kind = detail::wet_kind<labelset_t_of<Context>, weightset_t_of<Context>>()>

using vcsn::wet_of = typedef wet<label_t_of<Context>, weight_t_of<Context>, Kind, vcsn::less<labelset_t_of<Context> >, vcsn::hash<labelset_t_of<Context> >, vcsn::equal_to<labelset_t_of<Context> >>

The corresponding wet for a LabelSet -> WeightSet context.

Definition at line 863 of file wet.hh.

word_t_of

template<typename ValueSet >

using vcsn::word_t_of = typedef typename labelset_t_of<base_t<ValueSet> >::word_t

Definition at line 90 of file traits.hh.

z

using vcsn::z = typedef weightset_mixin<detail::z_impl>

Definition at line 56 of file fwd.hh.

zmin

using vcsn::zmin = typedef weightset_mixin<detail::zmin_impl>

Definition at line 57 of file fwd.hh.

Enumeration Type Documentation

direction

enum vcsn::direction

strong

Orientation.

Enumerator
forward	Looking downstream.
backward	Looking upstream.

Definition at line 11 of file direction.hh.

scc_algo_t

enum vcsn::scc_algo_t

strong

Enumerator
auto_
dijkstra
tarjan_iterative
tarjan_recursive
kosaraju

Definition at line 510 of file scc.hh.

star_status_t

enum vcsn::star_status_t

Enumerator
ABSVAL	valid iff proper succeeds on the "absolute value" of the automaton
NON_STARRABLE
STARRABLE	always valid.
TOPS	valid iff proper succeeds.

Definition at line 5 of file star-status.hh.

to_expression_heuristic_t [1/2]

enum vcsn::to_expression_heuristic_t

strong

Enumerator
best
delgado
delgado_label
naive
best
delgado
delgado_label
naive

Definition at line 79 of file to-automaton.hh.

to_expression_heuristic_t [2/2]

enum vcsn::to_expression_heuristic_t

strong

Enumerator
best
delgado
delgado_label
naive
best
delgado
delgado_label
naive

Definition at line 510 of file to-expression.hh.

wet_kind_t

enum vcsn::wet_kind_t

strong

Different implementations of wets.

Enumerator
bitset	Request the bitset implementation (bool weights).
map	Request the map implementation.
set	Request the set implementation (bool weights).
unordered_map	Request the unordered_map implementation.

Definition at line 197 of file wet.hh.

Function Documentation

accessible()

template<Automaton Aut>

filter_automaton<Aut> vcsn::accessible

(

const Aut &

a

)

Accessible part of an automaton.

Definition at line 138 of file accessible.hh.

References accessible_states(), and filter().

Referenced by vcsn::automatonset< context_t_of< automaton_t >, tag_t >::ldivide(), vcsn::ctx::detail::register_automaton_functions(), and useful_states().

Here is the call graph for this function:

accessible_states()

template<Automaton Aut>

states_t<Aut> vcsn::accessible_states	(	const Aut &	aut,
		bool	strict = true
	)

The set of accessible states, including pre(), and possibly post().

Parameters

aut	the automaton.
strict	whether to evaluate lazy states.

Definition at line 28 of file accessible.hh.

References vcsn::detail::all_out(), and res.

Referenced by accessible(), coaccessible_states(), num_accessible_states(), suffix_here(), and useful_states().

Here is the call graph for this function:

add() [1/3]

template<Automaton Aut1, Automaton Aut2>

auto vcsn::add	(	const Aut1 &	lhs,
		const Aut2 &	rhs,
		deterministic_tag
	)

Definition at line 71 of file add.hh.

References determinize(), and vcsn::detail::join_automata().

Referenced by vcsn::dyn::add(), vcsn::dyn::detail::add_expansion(), vcsn::dyn::detail::add_expression(), and are_equivalent().

Here is the call graph for this function:

add() [2/3]

template<Automaton Aut1, Automaton Aut2, typename Tag = general_tag>

auto vcsn::add	(	const Aut1 &	lhs,
		const Aut2 &	rhs,
		Tag	tag = {}
	)		-> decltype(join_automata(lhs, rhs))

The sum of two automata.

Parameters

lhs	the first automaton.
rhs	the second automaton.
tag	whether to use constructs for standard automata.

Definition at line 108 of file add.hh.

References add_here(), copy_into(), vcsn::detail::join_automata(), and res.

Here is the call graph for this function:

add() [3/3]

template<typename ValueSet >

ValueSet::value_t vcsn::add	(	const ValueSet &	vs,
		const typename ValueSet::value_t &	lhs,
		const typename ValueSet::value_t &	rhs
	)

Sums of values.

Definition at line 146 of file add.hh.

add_here() [1/3]

template<Automaton Aut1, Automaton Aut2>

Aut1& vcsn::add_here	(	Aut1 &	res,
		const Aut2 &	b,
		standard_tag
	)

Merge transitions of b into those of res.

Precondition

The context of res must include that of b.

res and b must be standard.

Definition at line 28 of file add.hh.

References vcsn::detail::all_transitions(), vcsn::detail::front(), vcsn::detail::initial_transitions(), is_standard(), require(), and res.

Referenced by vcsn::detail::polynomialset_impl< Context, Kind >::abs(), add(), vcsn::detail::polynomialset_impl< Context, Kind >::add(), add_here(), vcsn::detail::polynomialset_impl< Context, Kind >::add_here(), vcsn::detail::polynomialset_impl< Context, Kind >::add_here_impl_(), vcsn::detail::polynomialset_impl< Context, Kind >::add_ldivide_here(), vcsn::detail::polynomialset_impl< Context, Kind >::conjunction_impl_(), vcsn::detail::polynomialset_impl< Context, Kind >::conv(), vcsn::detail::polynomialset_impl< Context, Kind >::infiltrate(), vcsn::detail::polynomialset_impl< Context, Kind >::ldivide(), vcsn::detail::polynomialset_impl< Context, Kind >::lmul_label(), vcsn::detail::polynomialset_impl< Context, Kind >::lweight(), vcsn::detail::polynomialset_impl< Context, Kind >::mul(), vcsn::detail::polynomialset_impl< Context, Kind >::mul_impl_(), vcsn::detail::polynomialset_impl< Context, Kind >::rmul_label(), vcsn::detail::polynomialset_impl< Context, Kind >::rweight(), and vcsn::detail::polynomialset_impl< Context, Kind >::tuple().

Here is the call graph for this function:

add_here() [2/3]

template<Automaton Aut1, Automaton Aut2>

auto vcsn::add_here	(	Aut1 &	res,
		const Aut2 &	b,
		deterministic_tag
	)

Definition at line 62 of file add.hh.

References add_here(), determinize(), and res.

Here is the call graph for this function:

add_here() [3/3]

template<Automaton Aut1, Automaton Aut2>

Aut1& vcsn::add_here	(	Aut1 &	res,
		const Aut2 &	b,
		general_tag
	)

Merge transitions of b into those of res.

Precondition

Aut2 <: Aut1.

Definition at line 95 of file add.hh.

References copy_into(), and res.

Here is the call graph for this function:

address() [1/3]

unsigned vcsn::address ( const void *  t )

inline

Name pointers, to make them easier to read.

Definition at line 21 of file memory.hh.

Referenced by address(), and vcsn::rat::printer< ExpSet >::print_().

address() [2/3]

template<typename T >

unsigned vcsn::address

(

T *

t

)

Definition at line 31 of file memory.hh.

References address().

Here is the call graph for this function:

address() [3/3]

template<typename T >

unsigned vcsn::address

(

const T &

t

)

Definition at line 37 of file memory.hh.

References address().

Here is the call graph for this function:

all()

template<typename... Bool>

bool vcsn::all

(

Bool &&...

values

)

Whether all the values evaluate as true.

Definition at line 492 of file tuple.hh.

References res, and vcsn::detail::void.

Referenced by vcsn::detail::tuple_automata_impl< Aut, Auts >::add_tuple_transitions_(), vcsn::detail::compose_automaton_impl< Lazy, Lhs, Rhs >::are_proper_in(), vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::are_proper_in(), vcsn::detail::minimizer< Aut, weighted_tag >::build_classes_(), vcsn::detail::minimizer< Aut, signature_tag >::build_classes_(), vcsn::detail::dispatch_tags(), vcsn::detail::compose_automaton_impl< Lazy, Lhs, Rhs >::have_proper_out(), and vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::have_proper_out().

all_()

template<bool... B>

constexpr bool vcsn::all_

(

)

Definition at line 485 of file tuple.hh.

all_distances()

template<Automaton Aut>

std::vector<std::vector<weight_t_of<Aut> > > vcsn::all_distances

(

const Aut &

aut

)

Definition at line 107 of file distance.hh.

References vcsn::detail::all_transitions(), res, and vcsn::detail::states_size().

Referenced by vcsn::detail::epsilon_remover_distance< Aut, has_one >::epsilon_remover_distance().

Here is the call graph for this function:

ambiguous_word()

template<Automaton Aut>

word_t_of<Aut> vcsn::ambiguous_word

(

const Aut &

aut

)

Definition at line 113 of file is-ambiguous.hh.

References is_ambiguous(), and require().

Referenced by vcsn::dyn::ambiguous_word().

Here is the call graph for this function:

any_()

template<bool... B>

constexpr bool vcsn::any_

(

)

Static evaluation of the 'or' of the template parameters.

Definition at line 478 of file tuple.hh.

are_equal()

template<Automaton Lhs, Automaton Rhs>

bool vcsn::are_equal	(	const Lhs &	lhs,
		const Rhs &	rhs
	)

Whether lhs is equal to rhs.

Definition at line 71 of file compare-automaton.hh.

References vcsn::dyn::detail::compare().

Here is the call graph for this function:

are_equivalent() [1/2]

template<Automaton Aut1, Automaton Aut2>

auto vcsn::are_equivalent	(	const Aut1 &	a1,
		const Aut2 &	a2
	)		-> std::enable_if_t<(std::is_same<weightset_t_of<Aut1>, b>::value && std::is_same<weightset_t_of<Aut2>, b>::value), bool>

Check equivalence between Boolean automata on a free labelset.

Check equivalence between automata on fields, or Z.

Definition at line 27 of file are-equivalent.hh.

References add(), difference(), is_empty(), is_useless(), lweight(), realtime(), and reduce().

Here is the call graph for this function:

are_equivalent() [2/2]

template<typename ExpSet1 , typename ExpSet2 >

auto vcsn::are_equivalent	(	const ExpSet1 &	rs1,
		const typename ExpSet1::value_t	r1,
		const ExpSet2 &	rs2,
		const typename ExpSet2::value_t	r2
	)		-> bool

Check equivalence between two expressions.

Definition at line 83 of file are-equivalent.hh.

References vcsn::dyn::detail::are_equivalent(), vcsn::dyn::detail::derived_term(), and vcsn::dyn::detail::strip().

Referenced by vcsn::dyn::are_equivalent(), and vcsn::dyn::detail::are_equivalent_expression().

Here is the call graph for this function:

are_isomorphic()

template<Automaton Aut1, Automaton Aut2>

bool vcsn::are_isomorphic	(	const Aut1 &	a1,
		const Aut2 &	a2
	)

Definition at line 694 of file are-isomorphic.hh.

Referenced by vcsn::dyn::are_isomorphic(), and vcsn::ctx::detail::register_automaton_functions().

aut_of_component()

template<Automaton Aut>

fresh_automaton_t_of<Aut> vcsn::aut_of_component	(	const detail::component_t< Aut > &	com,
		const Aut &	aut
	)

Generate a subautomaton corresponding to an SCC.

Definition at line 577 of file scc.hh.

References has(), make_fresh_automaton(), vcsn::detail::map(), vcsn::detail::out(), and res.

Referenced by is_cycle_ambiguous().

Here is the call graph for this function:

bracketed()

std::string vcsn::bracketed	(	std::istream &	i,
		char	lbracket,
		char	rbracket
	)

Extract the string which is here between lbracket and rbracket.

Support nested lbracket/rbracket.

Definition at line 17 of file stream.cc.

References str_quote().

Referenced by vcsn::detail::polynomialset_impl< Context, Kind >::conv_weight().

Here is the call graph for this function:

cerny()

template<typename Ctx >

mutable_automaton<Ctx> vcsn::cerny	(	const Ctx &	ctx,
		unsigned	num_states
	)

Cerny automata are automata whose synchronizing word length is always (n - 1)^2, the upper bound of the Cerny's conjecture.

Their transition function d(q, l) is defined by:

• (q + 1) % n if l == a
• q if l != a and q != n - 1
• 0 if l != a and q == n - 1

Definition at line 25 of file cerny.hh.

References vcsn::detail::ctx, require(), and res.

Referenced by vcsn::dyn::cerny(), and vcsn::ctx::detail::register_context_functions().

Here is the call graph for this function:

char_letters::special< char_letters::letter_t >()

template<>

char_letters::letter_t vcsn::char_letters::special< char_letters::letter_t > ( )

inline

Definition at line 281 of file char.hh.

References vcsn::char_letters::special_letter().

Here is the call graph for this function:

char_letters::special< char_letters::word_t >()

template<>

char_letters::word_t vcsn::char_letters::special< char_letters::word_t > ( )

inline

Definition at line 289 of file char.hh.

References vcsn::char_letters::special_letter().

Here is the call graph for this function:

choose_map()

template<typename RandomGenerator = std::default_random_engine>

static bool vcsn::choose_map ( const std::vector< float > &  map, RandomGenerator &  gen = RandomGenerator()  )

static

Choose whether to pick an element from a map or not.

To do so we apply a Bernoulli distribution on the sum of the probabilities of the map.

Definition at line 17 of file random.hh.

Referenced by vcsn::detail::random_weight_base< zmin, RandomGenerator >::print_random_weight_().

coaccessible()

template<Automaton Aut>

filter_automaton<Aut> vcsn::coaccessible

(

const Aut &

a

)

Coaccessible part of an automaton.

Definition at line 146 of file accessible.hh.

References coaccessible_states(), and filter().

Referenced by vcsn::automatonset< context_t_of< automaton_t >, tag_t >::complement(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::conjunction(), vcsn::detail::is_ambiguous_impl< Aut >::operator()(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::rdivide(), vcsn::ctx::detail::register_automaton_functions(), and useful_states().

Here is the call graph for this function:

coaccessible_states()

template<Automaton Aut>

states_t<Aut> vcsn::coaccessible_states	(	const Aut &	a,
		bool	strict = true
	)

The set of coaccessible states, including post(), and possibly pre().

Parameters

a	the automaton.
strict	whether to evaluate lazy states.

Definition at line 68 of file accessible.hh.

References accessible_states(), and transpose().

Referenced by coaccessible(), is_partial_identity(), vcsn::detail::is_ambiguous_impl< Aut >::operator()(), and useful_states().

Here is the call graph for this function:

codeterminize()

template<Automaton Aut, typename Tag = auto_tag>

auto vcsn::codeterminize	(	const Aut &	aut,
		Tag	tag = {}
	)

Definition at line 376 of file determinize.hh.

References determinize(), and transpose().

Referenced by minimize().

Here is the call graph for this function:

collision_count()

template<typename Key , typename T , typename Hash , typename KeyEqual , typename Alloc >

size_t vcsn::collision_count

(

const std::unordered_map< Key, T, Hash, KeyEqual, Alloc > &

m

)

Sum of bucket sizes.

Definition at line 12 of file unordered_map.hh.

References res.

cominimize()

template<Automaton Aut, typename Tag = auto_tag>

auto vcsn::cominimize	(	const Aut &	a,
		Tag	tag = {}
	)		-> decltype(transpose(minimize(transpose(a), tag)))

Cominimization.

Definition at line 122 of file minimize.hh.

References minimize(), and transpose().

Here is the call graph for this function:

compare()

template<Automaton Lhs, Automaton Rhs>

int vcsn::compare	(	const Lhs &	lhs,
		const Rhs &	rhs
	)

Comparison between lhs and rhs.

Comparing two automata for order is really dubious. Even comparing for equality is really difficult, as is proved by are-isomorphic. Yet, to be able to use automata as weights, we need to be able to order-compare two automata, and to hash an automaton.

Both problems are ill-defined from a semantical point of view, in automata theory, but from an implementation point of view, we can decide for some order between automata. For instance, by lexicograpical comparison of all their transitions.

Definition at line 28 of file compare-automaton.hh.

References vcsn::detail::lexicographical_cmp(), and res.

Referenced by vcsn::rat::compare< ExpSet >::cmp_(), vcsn::wordset< GenSet >::compare(), vcsn::letterset< GenSet >::compare(), vcsn::nullableset< LabelSet >::compare(), vcsn::detail::polynomialset_impl< Context, Kind >::monomial_compare(), vcsn::detail::compare< ValueSet, Value >::operator()(), vcsn::rat::compare< ExpSet >::visit_tuple< typename >::operator()(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

complement()

template<Automaton Aut>

auto vcsn::complement

(

const Aut &

aut

)

-> decltype(copy(aut))

Definition at line 48 of file complement.hh.

References complement_here(), copy(), and res.

Here is the call graph for this function:

complement_here()

template<Automaton Aut>

void vcsn::complement_here

(

Aut &

aut

)

Definition at line 21 of file complement.hh.

References vcsn::detail::final_transitions(), has(), is_complete(), is_deterministic(), and require().

Referenced by complement().

Here is the call graph for this function:

complete()

template<Automaton Aut>

auto vcsn::complete

(

const Aut &

aut

)

-> decltype(::vcsn::copy(aut))

A complete copy of aut.

Definition at line 65 of file complete.hh.

References complete_here(), copy(), and res.

Referenced by vcsn::automatonset< context_t_of< automaton_t >, tag_t >::complement(), vcsn::detail::universal_impl< Aut >::operator()(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

complete_here()

template<Automaton Aut>

Aut& vcsn::complete_here

(

Aut &

aut

)

Complete aut and return it.

Definition at line 13 of file complete.hh.

References has(), and vcsn::detail::out().

Referenced by complete().

Here is the call graph for this function:

component() [1/2]

template<Automaton Aut>

filter_automaton<scc_automaton<Aut> > vcsn::component	(	const scc_automaton< Aut > &	aut,
		unsigned	num
	)

An SCC as a subautomaton.

Parameters

aut	the input automaton.
num	the number of the scc.

Definition at line 757 of file scc.hh.

component() [2/2]

template<Automaton Aut>

void vcsn::component	(	const Aut &	,
		unsigned
	)

Definition at line 764 of file scc.hh.

compose() [1/2]

template<typename ValueSet >

ValueSet::value_t vcsn::compose	(	const ValueSet &	vs,
		const typename ValueSet::value_t &	lhs,
		const typename ValueSet::value_t &	rhs
	)

Composition of values.

Definition at line 81 of file compose-expression.hh.

Referenced by vcsn::dyn::detail::compose_expansion(), and vcsn::dyn::detail::compose_expression().

compose() [2/2]

template<Automaton Lhs, Automaton Rhs, std::size_t OutTape = 1, std::size_t InTape = 0>

auto vcsn::compose	(	const Lhs &	lhs,
		const Rhs &	rhs
	)

Build the (accessible part of the) composition.

Definition at line 474 of file compose.hh.

References res.

compose_context()

template<typename Ctx1 , typename Ctx2 >

auto vcsn::compose_context	(	const Ctx1 &	ctx1,
		const Ctx2 &	ctx2
	)

Definition at line 51 of file compose-expression.hh.

References compose_labelset(), join(), and make_context().

Referenced by compose_polynomialset().

Here is the call graph for this function:

compose_labelset()

template<typename... LS1, typename... LS2>

auto vcsn::compose_labelset	(	const tupleset< LS1... > &	ls1,
		const tupleset< LS2... > &	ls2
	)

Definition at line 31 of file compose-expression.hh.

References vcsn::detail::compose_labelset_impl(), vcsn::detail::in(), vcsn::detail::out(), and vcsn::rat::size().

Referenced by compose_context(), and vcsn::dyn::detail::compose_label().

Here is the call graph for this function:

compose_lazy()

template<typename Lhs , typename Rhs , std::size_t OutTape = 1, std::size_t InTape = 0>

auto vcsn::compose_lazy	(	const Lhs &	lhs,
		const Rhs &	rhs
	)

Build the (accessible part of the) lazy composition.

Definition at line 485 of file compose.hh.

References res.

Referenced by vcsn::dyn::compose().

compose_polynomialset()

template<typename Ctx1 , typename Ctx2 >

auto vcsn::compose_polynomialset	(	const polynomialset< Ctx1 > &	ps1,
		const polynomialset< Ctx2 > &	ps2
	)

Definition at line 162 of file compose-expression.hh.

References compose_context(), and vcsn::detail::make_polynomialset().

Referenced by vcsn::dyn::detail::compose_polynomial().

Here is the call graph for this function:

compute_eppstein()

template<Automaton Aut>

std::vector<detail::path<Aut> > vcsn::compute_eppstein	(	const Aut &	aut,
		state_t_of< Aut >	src,
		state_t_of< Aut >	dst,
		unsigned	num
	)

Compute the num lightest paths in the automaton aut from src to dst.

Use Eppstein algorithm.

Definition at line 129 of file eppstein.hh.

References vcsn::detail::eppstein< Aut >::k_shortest_path().

Referenced by lightest().

Here is the call graph for this function:

condense() [1/2]

template<Automaton Aut>

partition_automaton<scc_automaton<Aut> > vcsn::condense

(

const scc_automaton< Aut > &

aut

)

Create a condensation of automaton with each its state who is a strongly connected component of aut.

Definition at line 792 of file scc.hh.

condense() [2/2]

template<Automaton Aut>

partition_automaton<Aut> vcsn::condense

(

const Aut &

)

Definition at line 825 of file scc.hh.

configuration()

std::string vcsn::configuration

(

const std::string &

key

)

Get the string mapped by key (e.g., "configuration.version", "dot.styles").

Definition at line 175 of file configuration.cc.

References vcsn::detail::config::config(), get_config(), res, and split().

Referenced by vcsn::dyn::configuration(), and get_config().

Here is the call graph for this function:

conjugate()

template<Automaton Aut>

Aut vcsn::conjugate

(

const Aut &

aut

)

Definition at line 10 of file conjugate.hh.

References vcsn::detail::final_transitions(), vcsn::detail::initial_transitions(), make_copier(), require(), and res.

Here is the call graph for this function:

conjunction() [1/2]

template<typename ValueSet >

ValueSet::value_t vcsn::conjunction	(	const ValueSet &	rs,
		const typename ValueSet::value_t &	lhs,
		const typename ValueSet::value_t &	rhs
	)

Intersection/Hadamard product of values.

Definition at line 16 of file conjunction-expression.hh.

Referenced by vcsn::dyn::detail::conjunction_value().

conjunction() [2/2]

template<Automaton Aut>

auto vcsn::conjunction	(	const Aut &	aut,
		to	exp
	)		-> fresh_automaton_t_of<Aut>

Repeated conjunction of a automaton.

Parameters

aut	the automaton to conjoin with itself.
exp	the "power": number of conjunction to apply.

Returns

A non-decorated automaton.

Definition at line 884 of file conjunction.hh.

References vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::conjunction(), make_fresh_automaton(), require(), res, and vcsn::detail::automaton_decorator< tuple_automaton< Aut, Auts... > >::strip().

Referenced by vcsn::dyn::detail::conjunction_repeated().

Here is the call graph for this function:

constant_term()

template<typename ExpSet >

weight_t_of< ExpSet > vcsn::constant_term	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	e
	)

The constant term of e.

Definition at line 208 of file constant-term.hh.

Referenced by vcsn::rat::star_normal_form_visitor< ExpSet >::box_of(), vcsn::detail::derived_term_automaton_impl< ExpSet >::complete_via_derivation_(), is_valid(), vcsn::ctx::detail::register_expression_functions(), vcsn::rat::derivation_visitor< ExpSet >::VCSN_RAT_VISIT(), vcsn::rat::star_normal_form_visitor< ExpSet >::VCSN_RAT_VISIT(), and vcsn::rat::derivation_visitor< ExpSet >::visit_tuple< bool, Dummy >::work_().

conv()

template<typename ValueSet , typename... Args>

auto vcsn::conv	(	const ValueSet &	vs,
		const std::string &	str,
		Args &&...	args
	)		-> decltype(vs.conv(std::declval<std::istream&>(), std::forward<Args>(args)...))

Parse str via vs.conv.

Definition at line 29 of file stream.hh.

References eat(), equal_files(), expand_tilda(), res, str(), str_quote(), and VCSN_REQUIRE.

Referenced by vcsn::edit_automaton< Aut >::add_entry(), vcsn::detail::mutable_automaton_impl< Context >::add_transition_copy(), vcsn::detail::trie_builder< Context, Dir >::add_words(), vcsn::detail::tupleset_impl< ValueSets >::conv(), vcsn::detail::tupleset_impl< ValueSets >::conv_(), vcsn::detail::polynomialset_impl< Context, Kind >::conv_weight(), expand(), vcsn::edit_automaton< Aut >::label_(), vcsn::detail::random_weight_base< zmin, RandomGenerator >::parse_param_(), vcsn::detail::tupleset_impl< ValueSets >::partial_identity_(), vcsn::detail::random_expression_impl< ExpressionSet, RandomGenerator >::random_expression(), read_polynomial(), and vcsn::edit_automaton< Aut >::weight_().

Here is the call graph for this function:

copy() [1/6]

template<Automaton AutIn, Automaton AutOut = fresh_automaton_t_of<AutIn>, typename KeepState , typename KeepTrans >

auto vcsn::copy	(	const AutIn &	input,
		KeepState	keep_state,
		KeepTrans	keep_trans
	)		-> decltype(keep_state(input->null_state()), keep_trans(input->null_transition()), make_fresh_automaton<AutIn, AutOut>(input))

A copy of input keeping only its states that are accepted by keep_state, and transitions accepted by keep_trans.

Definition at line 322 of file copy.hh.

References Automaton, copy_into(), and res.

Referenced by vcsn::detail::absval(), complement(), complete(), copy(), copy_into(), eliminate_state(), eliminate_state_here(), factor(), vcsn::detail::invalid_argument(), vcsn::detail::is_valid_impl< Aut, has_one >::is_valid_(), ldivide(), lightest_automaton(), lweight(), multiply_here(), vcsn::detail::epsilon_remover_distance< Aut, false >::operator()(), vcsn::detail::epsilon_remover< Aut, false >::operator()(), vcsn::detail::epsilon_remover_separate< Aut, false >::operator()(), prefix(), push_weights(), vcsn::ctx::detail::register_automaton_functions(), vcsn::detail::properer< Aut >::remover_(), rweight(), suffix(), and to_spontaneous().

Here is the call graph for this function:

copy() [2/6]

template<Automaton AutIn, Automaton AutOut = fresh_automaton_t_of<AutIn>, typename KeepState >

auto vcsn::copy	(	const AutIn &	input,
		KeepState	keep_state
	)		-> decltype(keep_state(input->null_state()), make_fresh_automaton<AutIn, AutOut>(input))

A copy of input.

Definition at line 338 of file copy.hh.

References Automaton.

copy() [3/6]

template<Automaton AutIn, Automaton AutOut = fresh_automaton_t_of<AutIn>>

AutOut vcsn::copy

(

const AutIn &

input

)

A copy of input.

Definition at line 354 of file copy.hh.

References Automaton.

copy() [4/6]

template<Automaton AutIn, Automaton AutOut = fresh_automaton_t_of<AutIn>, typename States >

auto vcsn::copy	(	const AutIn &	input,
		const States &	ss
	)		-> decltype(*ss.begin() == input->null_state(), make_fresh_automaton<AutIn, AutOut>(input))

A copy of input keeping only its states that are members of states.

Definition at line 370 of file copy.hh.

References Automaton, and has().

Here is the call graph for this function:

copy() [5/6]

template<Automaton AutIn, Automaton AutOut = fresh_automaton_t_of<AutIn>, typename States , typename Trans >

auto vcsn::copy	(	const AutIn &	input,
		const States &	ss,
		const Trans &	ts
	)		-> decltype(*ss.begin() == input->null_state(), *ts.begin() == input->null_transition(), make_fresh_automaton<AutIn, AutOut>(input))

A copy of input keeping only its states that are members of container ss, and transitions that are members of container ts.

Definition at line 387 of file copy.hh.

References Automaton, and has().

Here is the call graph for this function:

copy() [6/6]

template<Automaton AutIn, Automaton AutOut = fresh_automaton_t_of<AutIn>, typename Transitions >

auto vcsn::copy	(	const AutIn &	input,
		const Transitions &	ts
	)		-> decltype(*ts.begin() == input->null_transition(), make_fresh_automaton<AutIn, AutOut>(input))

A copy of input keeping only its transitions that are members of ts, and the states on which these transitions depend.

Definition at line 405 of file copy.hh.

References copy(), make_copier(), and res.

Here is the call graph for this function:

copy_into() [1/4]

template<Automaton AutIn, Automaton AutOut, typename KeepState , typename KeepTrans >

void vcsn::copy_into	(	const AutIn &	in,
		AutOut &	out,
		KeepState	keep_state,
		KeepTrans	keep_trans
	)

Copy selected states and transitions of an automaton.

Precondition

AutIn <: AutOut.

Definition at line 267 of file copy.hh.

References copy(), and make_copier().

Referenced by add(), add_here(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::complement(), copy_into(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::ldivide(), vcsn::dyn::lweight(), multiply(), vcsn::detail::epsilon_remover< Aut, has_one >::operator()(), project(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::rdivide(), vcsn::dyn::rweight(), star(), and subword().

Here is the call graph for this function:

copy_into() [2/4]

template<Automaton AutIn, Automaton AutOut, typename KeepState >

void vcsn::copy_into	(	const AutIn &	in,
		AutOut &	out,
		KeepState	keep_state
	)

Copy the selected states an automaton.

Precondition

AutIn <: AutOut.

Definition at line 278 of file copy.hh.

References copy_into().

Here is the call graph for this function:

copy_into() [3/4]

template<Automaton AutIn, Automaton AutOut>

void vcsn::copy_into	(	const AutIn &	in,
		AutOut &	out
	)

Copy an automaton.

Precondition

AutIn <: AutOut.

Definition at line 289 of file copy.hh.

References copy_into().

Here is the call graph for this function:

copy_into() [4/4]

template<Automaton AutIn, Automaton AutOut>

void vcsn::copy_into	(	const AutIn &	in,
		AutOut &	out,
		bool	safe
	)

Copy an automaton.

Parameters

in	input automaton, to copy
out	output automaton, the destination
safe	whether the input automaton is in normal form, i.e., never has two transitions with same (src, label, dst).

Precondition

AutIn <: AutOut.

Definition at line 308 of file copy.hh.

References Automaton, copy(), and make_copier().

Referenced by copy(), and vcsn::dyn::detail::copy_convert().

Here is the call graph for this function:

costandard()

template<Automaton Aut>

auto vcsn::costandard

(

const Aut &

aut

)

-> decltype(copy(aut))

Definition at line 125 of file standard.hh.

References vcsn::dyn::detail::standard(), and vcsn::dyn::detail::transpose().

Referenced by normalize().

Here is the call graph for this function:

cotrie() [1/2]

template<typename PolynomialSet >

mutable_automaton<detail::free_context<context_t_of<PolynomialSet> > > vcsn::cotrie	(	const PolynomialSet &	ps,
		const typename PolynomialSet::value_t &	p
	)

Make a cotrie-like mutable_automaton for a finite series given as a polynomial.

Parameters

ps	the polynomialset
p	the polynomial that specifies the series.

Definition at line 228 of file trie.hh.

Referenced by vcsn::dyn::cotrie(), and vcsn::dyn::detail::cotrie_stream().

cotrie() [2/2]

template<typename PolynomialSet >

mutable_automaton<detail::free_context<context_t_of<PolynomialSet> > > vcsn::cotrie	(	const PolynomialSet &	ps,
		std::istream &	is,
		const std::string &	format = "default"
	)

Make a trie-like mutable_automaton for a finite series read from a stream.

Parameters

ps	the polynomialset
is	the stream to read
format	the format of the file: "words" or "monomials"

Definition at line 287 of file trie.hh.

create_states_and_trans_()

template<Automaton AutIn, Automaton AutOut>

void vcsn::create_states_and_trans_	(	const AutIn &	aut,
		AutOut &	naut1,
		AutOut &	naut2
	)

Create states and the transitions two new automata naut1 and naut2 with weight of transition <(w, one)> and <(one, w)> corresponding with the weight of transition <w> of aut.

Definition at line 102 of file has-twins-property.hh.

References vcsn::detail::all_transitions().

Referenced by has_twins_property().

Here is the call graph for this function:

cross()

template<typename... Sequences>

cross_sequences<Sequences...> vcsn::cross

(

Sequences &&...

seqs

)

Definition at line 303 of file cross.hh.

Referenced by vcsn::detail::tupleset_impl< ValueSets >::pregenerators_().

cross_tuple()

template<typename... Sequences>

cross_sequences<Sequences...> vcsn::cross_tuple

(

const std::tuple< Sequences... > &

seqs

)

Definition at line 310 of file cross.hh.

cycle_identity()

template<Automaton Aut>

bool vcsn::cycle_identity	(	const detail::component_t< Aut > &	c,
		const Aut &	aut
	)

Check the weight of two states on this component is unique.

Definition at line 86 of file has-twins-property.hh.

References vcsn::detail::cycle_identity_impl< Aut >::check().

Referenced by has_twins_property().

Here is the call graph for this function:

daut()

template<Automaton Aut>

std::ostream& vcsn::daut	(	const Aut &	aut,
		std::ostream &	out = std::cout
	)

Print an automaton in Daut format.

Parameters

aut	the automaton to print.
out	the output stream.

Definition at line 101 of file daut.hh.

References vcsn::detail::out().

Referenced by guess_automaton_format(), and print().

Here is the call graph for this function:

de_bruijn()

template<typename Context >

mutable_automaton<Context> vcsn::de_bruijn	(	const Context &	ctx,
		unsigned	n
	)

Build a automaton for (a+b)*a(a+b){n}.

Definition at line 14 of file de-bruijn.hh.

References vcsn::detail::front(), make_mutable_automaton(), require(), and res.

Referenced by vcsn::ctx::detail::register_context_functions().

Here is the call graph for this function:

decendl()

std::ostream & vcsn::decendl

(

std::ostream &

o

)

Decrement the indentation, print an end of line, and set the indentation.

Definition at line 59 of file indent.cc.

References decindent(), and iendl().

Referenced by vcsn::rat::to_expansion_visitor< expressionset_t >::operator()(), vcsn::rat::dot_printer< ExpSet >::operator()(), and vcsn::rat::printer< ExpSet >::print_().

Here is the call graph for this function:

decindent()

std::ostream & vcsn::decindent

(

std::ostream &

o

)

Decrement the indentation.

Definition at line 27 of file indent.cc.

References vcsn::detail::indentation.

Referenced by decendl().

denormalize()

template<typename ExpansionSet >

ExpansionSet::value_t vcsn::denormalize	(	const ExpansionSet &	xs,
		typename ExpansionSet::value_t	x
	)

Denormalize an expansion.

Definition at line 15 of file normalize-expansion.hh.

derivation() [1/3]

template<typename ExpSet >

rat::expression_polynomial_t< ExpSet > vcsn::derivation	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	e,
		label_t_of< ExpSet >	a,
		bool	breaking = false
	)

Derive an expression wrt to a letter.

Definition at line 292 of file derivation.hh.

References vcsn::detail::is_letterized(), res, and split().

Referenced by derivation(), vcsn::dyn::detail::derivation(), vcsn::ctx::detail::register_functions_is_free(), and vcsn::rat::derivation_visitor< ExpSet >::visit_tuple< bool, Dummy >::work_().

Here is the call graph for this function:

derivation() [2/3]

template<typename ExpSet >

rat::expression_polynomial_t<ExpSet> vcsn::derivation	(	const ExpSet &	rs,
		const rat::expression_polynomial_t< ExpSet > &	p,
		label_t_of< ExpSet >	a,
		bool	breaking = false
	)

Derive a polynomial of expressions wrt to a letter.

Definition at line 310 of file derivation.hh.

References derivation(), label_of(), vcsn::rat::make_expression_polynomialset(), res, and weight_of().

Here is the call graph for this function:

derivation() [3/3]

template<typename ExpSet , typename = std::enable_if_t<!std::is_same<word_t_of<ExpSet>, label_t_of<ExpSet>>{}>>

rat::expression_polynomial_t<ExpSet> vcsn::derivation	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	e,
		const word_t_of< ExpSet > &	l,
		bool	breaking = false
	)

Derive an expression wrt to a word.

Do not enable this overload when labels and words are the same thing (e.g., when working on a wordset), since in this case we fail with an ambiguous overload. Thanks to this enable_if, only the first overload (derivation wrt a label) is enabled, and the compilation fails but this time with the right diagnostic: the labelset must be free.

Definition at line 338 of file derivation.hh.

References derivation(), require(), res, and vcsn::rat::word.

Here is the call graph for this function:

derived_term() [1/2]

template<typename ExpSet >

std::enable_if_t<labelset_t_of<ExpSet>::is_letterized(), expression_automaton<mutable_automaton<typename ExpSet::context_t> > > vcsn::derived_term	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	r,
		const std::string &	algo = "auto"
	)

The derived-term automaton, for letterized labelsets.

Parameters

rs	the expressionset
r	the expression
algo	the algo to run: "auto", "derivation", or "expansion".

Definition at line 335 of file derived-term.hh.

References vcsn::detail::derived_term_algo::algo, vcsn::detail::is_letterized(), and make_derived_term_automaton().

Referenced by vcsn::ctx::detail::register_expression_functions().

Here is the call graph for this function:

derived_term() [2/2]

template<typename ExpSet >

std::enable_if_t<!labelset_t_of<ExpSet>::is_letterized(), expression_automaton<mutable_automaton<typename ExpSet::context_t> > > vcsn::derived_term	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	r,
		const std::string &	algo = "auto"
	)

The derived-term automaton, for non letterized labelsets.

Parameters

rs	the expressionset
r	the expression
algo	the algo to run: "auto", "derivation", or "expansion".

Definition at line 352 of file derived-term.hh.

References vcsn::detail::derived_term_algo::algo, vcsn::detail::derived_term_algo::expansion, make_derived_term_automaton(), and require().

Here is the call graph for this function:

detail::static_if< detail::has_power_mem_fn< ValueSet >{}>()

return vcsn::detail::static_if< detail::has_power_mem_fn< ValueSet >{}>	(	[] (const auto &vs, const auto &v, auto n){ return vs.power(v, n);}	,
		[] (const auto &vs, const auto &v, auto n) { auto res=vs.one();if(!vs.is_one(v)) while(n--) res=vs.mul(res, v);return res;}
	)

determinize() [1/3]

template<typename ExpansionSet >

ExpansionSet::value_t vcsn::determinize	(	const ExpansionSet &	xs,
		const typename ExpansionSet::value_t &	x
	)

Determinize an expansion.

Definition at line 11 of file determinize-expansion.hh.

Referenced by add(), add_here(), codeterminize(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::complement(), determinize(), minimize(), multiply_here(), vcsn::detail::universal_impl< Aut >::operator()(), vcsn::ctx::detail::register_automaton_functions(), star_here(), and vcsn::detail::universal_impl< Aut >::work_().

determinize() [2/3]

template<Automaton Aut, typename Tag , bool Lazy = false>

auto vcsn::determinize	(	const Aut &	a,
		Tag	= {},
		bool_constant< Lazy >	= {}
	)

Definition at line 247 of file determinize.hh.

References bitset, and res.

determinize() [3/3]

template<Automaton Aut, bool Lazy = false>

auto vcsn::determinize	(	const Aut &	a,
		auto_tag	= {},
		bool_constant< Lazy >	lazy = {}
	)

Determinization: automatic dispatch based on the automaton type.

Definition at line 273 of file determinize.hh.

References determinize().

Here is the call graph for this function:

difference() [1/2]

template<Automaton Lhs, Automaton Rhs>

fresh_automaton_t_of<Lhs> vcsn::difference	(	const Lhs &	lhs,
		const Rhs &	rhs
	)

An automaton that computes weights of lhs, but not by rhs.

Definition at line 122 of file are-equivalent.hh.

References vcsn::dyn::detail::complement(), vcsn::dyn::detail::complete(), vcsn::dyn::detail::conjunction(), vcsn::dyn::detail::determinize(), vcsn::dyn::detail::is_complete(), vcsn::dyn::detail::is_deterministic(), and vcsn::dyn::detail::strip().

Referenced by are_equivalent().

Here is the call graph for this function:

difference() [2/2]

template<typename ExpSet >

ExpSet::value_t vcsn::difference	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	lhs,
		const typename ExpSet::value_t &	rhs
	)

Difference of expressions.

Definition at line 156 of file are-equivalent.hh.

Referenced by vcsn::dyn::difference(), and vcsn::dyn::detail::difference_expression().

divkbaseb()

template<typename Context >

mutable_automaton<Context> vcsn::divkbaseb	(	const Context &	ctx,
		unsigned	divisor,
		unsigned	base
	)

Build the Boolean automaton which accepts a word n representing a number in base "base" if and only if divisor|n.

Definition at line 16 of file divkbaseb.hh.

References vcsn::detail::ctx, require(), res, and VCSN_REQUIRE.

Referenced by vcsn::ctx::detail::register_context_functions().

Here is the call graph for this function:

dot()

template<Automaton Aut>

std::ostream& vcsn::dot	(	const Aut &	aut,
		std::ostream &	out = std::cout,
		format	fmt = {},
		bool	mathjax = false
	)

Print an automaton in Graphviz's Dot format.

Parameters

aut	the automaton to print.
out	the output stream.
fmt	how to format the automaton.
mathjax	shall it be formatted for MathJax.

Definition at line 435 of file dot.hh.

References vcsn::detail::out().

Referenced by vcsn::detail::epsilon_remover< Aut, has_one >::in_situ_remover_(), vcsn::detail::epsilon_remover_separate< transpose_in_automaton_t >::operator()(), print(), and vcsn::detail::dot::parser::yy_reduce_print_().

Here is the call graph for this function:

double_ring()

template<typename Context >

mutable_automaton<Context> vcsn::double_ring	(	const Context &	ctx,
		unsigned	n,
		const std::vector< unsigned > &	finals
	)

Definition at line 16 of file double-ring.hh.

References vcsn::detail::ctx, vcsn::detail::make_vector(), require(), and res.

Referenced by vcsn::ctx::detail::register_context_functions().

Here is the call graph for this function:

eat() [1/2]

char vcsn::eat	(	std::istream &	is,
		char	c
	)

Check lookahead character and advance.

Parameters

is	the stream to read.
c	the expected character.

Returns

c

Exceptions

std::runtime_error

if the next character is not c.

Definition at line 147 of file stream.cc.

References fail_reading(), and str_quote().

Referenced by conv(), vcsn::detail::log_impl::conv(), vcsn::detail::q_impl::conv(), vcsn::detail::tupleset_impl< ValueSets >::conv_(), vcsn::detail::tupleset_impl< ValueSets >::convs(), vcsn::detail::genset_labelset< GenSet >::convs_(), vcsn::ast::context_parser::eat_(), vcsn::detail::tupleset_impl< ValueSets >::eat_separator_(), vcsn::char_letters::get_letter(), vcsn::detail::tupleset_impl< ValueSets >::get_letter(), vcsn::detail::nmin_impl::make(), vcsn::detail::zmin_impl::make(), vcsn::detail::rmin_impl::make(), vcsn::detail::f2_impl::make(), vcsn::detail::z_impl::make(), vcsn::detail::b_impl::make(), vcsn::detail::r_impl::make(), vcsn::detail::log_impl::make(), vcsn::detail::q_impl::make(), vcsn::detail::qmp_impl::make(), vcsn::set_alphabet< L >::make(), vcsn::letterset< GenSet >::make(), vcsn::wordset< GenSet >::make(), vcsn::context< Tape, full_context_t >::make(), vcsn::rat::expressionset_impl< Context >::make(), vcsn::detail::tupleset_impl< ValueSets >::make(), vcsn::nullableset< LabelSet >::make(), vcsn::detail::polynomialset_impl< Context, Kind >::make(), and operator>>().

Here is the call graph for this function:

eat() [2/2]

const std::string & vcsn::eat	(	std::istream &	is,
		const std::string &	s
	)

Check lookahead string and advance.

Parameters

is	the stream to read.
s	the expected string.

Returns

s

Exceptions

std::runtime_error

if the next character is not s.

Definition at line 160 of file stream.cc.

References str_quote(), and VCSN_REQUIRE.

Here is the call graph for this function:

efsm()

template<Automaton Aut>

std::ostream& vcsn::efsm	(	const Aut &	aut,
		std::ostream &	out = std::cout
	)

Print automaton to EFSM format, based on FSM format.

Template Parameters

Aut	an automaton type.

Definition at line 332 of file efsm.hh.

References vcsn::detail::out().

Referenced by print().

Here is the call graph for this function:

eliminate_state()

template<Automaton Aut>

auto vcsn::eliminate_state	(	const Aut &	aut,
		state_t_of< Aut >	s = Aut::element_type::null_state()
	)		-> fresh_automaton_t_of<Aut>

A copy of automaton res without the state s.

Definition at line 17 of file to-automaton.hh.

References copy(), eliminate_state_here(), make_copier(), require(), and res.

Referenced by vcsn::dyn::eliminate_state(), eliminate_state_here(), and vcsn::ctx::detail::register_kind_functions().

Here is the call graph for this function:

eliminate_state_here()

template<Automaton Aut>

Aut& vcsn::eliminate_state_here	(	Aut &	res,
		state_t_of< Aut >	s = Aut::element_type::null_state()
	)

In place removal of state s from automaton res.

Definition at line 435 of file to-expression.hh.

References Automaton, copy(), eliminate_state(), make_copier(), vcsn::detail::make_state_eliminator(), require(), res, and to_expression().

Referenced by eliminate_state().

Here is the call graph for this function:

enumerate()

template<Automaton Aut>

detail::enumerater<Aut>::polynomial_t vcsn::enumerate	(	const Aut &	aut,
		unsigned	len
	)

The approximated behavior of an automaton.

Parameters

aut	the automaton whose behavior to approximate
len	maximum length of words looked for.

Definition at line 308 of file shortest.hh.

References shortest().

Here is the call graph for this function:

equal_files()

bool vcsn::equal_files	(	const std::string &	fn1,
		const std::string &	fn2
	)

Whether two files have exactly equal contents.

Definition at line 39 of file stream.cc.

Referenced by conv().

evaluate() [1/3]

template<Automaton Aut>

auto vcsn::evaluate	(	const Aut &	a,
		const word_t_of< Aut > &	w
	)		-> std::enable_if_t<!context_t_of<Aut>::is_lao, weight_t_of<Aut>>

General case of evaluation.

Definition at line 182 of file evaluate.hh.

References vcsn::detail::evaluator< Aut >::labeled_weight::w.

Referenced by vcsn::ctx::detail::register_automaton_functions(), and weight_series().

evaluate() [2/3]

template<Automaton Aut>

auto vcsn::evaluate	(	const Aut &	a,
		const label_t_of< Aut > &	= {}
	)		-> std::enable_if_t<context_t_of<Aut>::is_lao, weight_t_of<Aut>>

Evaluation for lao automaton.

Requires a proper automaton. In a proper lao automaton, an accepting path can only be composed by initial and final transitions. Sum the weight of these paths.

Definition at line 196 of file evaluate.hh.

References vcsn::detail::all_out(), vcsn::detail::initial_transitions(), is_proper(), vcsn::detail::out(), require(), res, vcsn::detail::evaluator< Aut >::labeled_weight::s, and vcsn::detail::evaluator< Aut >::labeled_weight::w.

Here is the call graph for this function:

evaluate() [3/3]

template<Automaton Aut>

auto vcsn::evaluate	(	const Aut &	a,
		const typename detail::word_polynomialset_t< context_t_of< Aut >>::value_t &	p
	)		-> weight_t_of<Aut>

Evaluation of a polynomial.

Definition at line 252 of file evaluate.hh.

Referenced by vcsn::dyn::evaluate(), and vcsn::dyn::detail::evaluate_polynomial().

expand()

template<typename ExpSet >

ExpSet::value_t vcsn::expand	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	r
	)

Expand a typed expression, i.e., distribute multiplications over sums.

Definition at line 13 of file expand.hh.

References conv(), make_expressionset(), and to_string().

Referenced by vcsn::ctx::detail::register_expression_functions().

Here is the call graph for this function:

expand_tilda()

std::string vcsn::expand_tilda

(

const std::string &

res

)

Expand initial "~" in res.

Definition at line 58 of file stream.cc.

References res, and xgetenv().

Referenced by vcsn::detail::config::config(), and conv().

Here is the call graph for this function:

factor()

template<Automaton Aut>

auto vcsn::factor

(

const Aut &

aut

)

-> decltype(::vcsn::copy(aut))

Definition at line 106 of file prefix.hh.

References copy(), factor_here(), and res.

Referenced by vcsn::detail::polynomialset_impl< Context, Kind >::add_ldivide_here().

Here is the call graph for this function:

factor_here()

template<Automaton Aut>

Aut& vcsn::factor_here

(

Aut &

aut

)

Make each useful state both initial and final.

Definition at line 99 of file prefix.hh.

References prefix_here(), and suffix_here().

Referenced by factor().

Here is the call graph for this function:

fado()

template<Automaton Aut>

std::ostream& vcsn::fado	(	const Aut &	aut,
		std::ostream &	out = std::cout
	)

Format automaton to FAdo format.

Template Parameters

Aut	an automaton type.

Definition at line 115 of file grail.hh.

References vcsn::detail::out().

Here is the call graph for this function:

fail_reading()

template<typename... Args>

ATTRIBUTE_NORETURN void vcsn::fail_reading	(	std::istream &	is,
		Args &&...	args
	)

Throw an exception after failing to read from is.

Reset the stream to a "good" state, and read the presumably ill-formed input into a buffer string; then throw with the given explanation followed by the buffer string. explanation should not contain trailing punctuation or spaces.

Definition at line 76 of file stream.hh.

References get_char(), get_file_contents(), open_input_file(), open_output_file(), skip_space(), str_quote(), and xgetenv().

Referenced by vcsn::ast::context_parser::check_eof_(), eat(), and operator>>().

Here is the call graph for this function:

filter() [1/3]

template<typename Range , typename Filter >

auto vcsn::filter	(	Range &&	r,
		Filter	f,
		decltype(f(*std::begin(r)), void()) *	= nullptr
	)

Similar to boost::adaptors::filter, but ensures that the range is kept alive.

Definition at line 48 of file filter.hh.

filter() [2/3]

template<Automaton Aut, bool Trans = false>

filter_automaton<Aut, Trans> vcsn::filter	(	const Aut &	aut,
		boost::optional< dynamic_bitset >	ss = {},
		boost::optional< dynamic_bitset >	ts = {}
	)

Build a filtered view of an automaton.

Parameters

aut	automaton whose states/transitions to filter.
ss	set of states to reveal. If {}, hide none.
ts	set of transitions to reveal. If {}, hide none.

Definition at line 321 of file filter.hh.

Referenced by accessible(), coaccessible(), and trim().

filter() [3/3]

template<Automaton Aut>

filter_automaton<Aut> vcsn::filter	(	const Aut &	aut,
		const std::unordered_set< state_t_of< Aut >> &	ss
	)

Build a filtered view of an automaton.

Parameters

aut	automaton whose states/transitions to filter.
ss	set of states to reveal.

Definition at line 334 of file filter.hh.

focus()

template<unsigned Tape, Automaton Aut>

focus_automaton< Tape, Aut > vcsn::focus

(

Aut

aut

)

Definition at line 327 of file focus.hh.

format_lightest()

template<Automaton Aut>

predecessors_t_of<Aut> vcsn::format_lightest	(	const Aut &	aut,
		const std::vector< transition_t_of< Aut >> &	path
	)

A state-indexed vector of predecessor transitions from the path path.

For each state s, res[s] is null_transition if it is not part of path (or it is its beginning), or res[s] is the transition index that points to the incoming transition to s in path.

Definition at line 228 of file k-lightest-path.hh.

References res, and vcsn::detail::states_size().

Referenced by lightest(), lightest_path(), and vcsn::detail::yen_impl< Aut, ValueSet, Mul, GetValue >::operator()().

Here is the call graph for this function:

get_char()

char vcsn::get_char

(

std::istream &

i

)

Read a single char, with possible -escape support.

EOF is an error.

Definition at line 92 of file stream.cc.

References CASE, require(), res, str_quote(), and VCSN_REQUIRE.

Referenced by fail_reading(), vcsn::char_letters::get_letter(), and vcsn::string_letters::get_letter().

Here is the call graph for this function:

get_config()

detail::config& vcsn::get_config ( )

inline

Get the configuration singleton.

Definition at line 96 of file configuration.hh.

References configuration().

Referenced by configuration(), vcsn::detail::dot_impl< Aut >::get_style(), vcsn::detail::dot_impl< Aut >::print_prologue_(), and vcsn::detail::dot_impl< Aut >::print_states_().

Here is the call graph for this function:

get_file_contents()

std::string vcsn::get_file_contents

(

const std::string &

file

)

Return the contents of file.

Definition at line 178 of file stream.cc.

References vcsn::detail::in(), res, and VCSN_REQUIRE.

Referenced by fail_reading().

Here is the call graph for this function:

grail()

template<Automaton Aut>

std::ostream& vcsn::grail	(	const Aut &	aut,
		std::ostream &	out
	)

Print automaton in Grail format.

Template Parameters

Aut	an automaton type.

Definition at line 185 of file grail.hh.

References vcsn::detail::out().

Referenced by vcsn::detail::grail_impl_().

Here is the call graph for this function:

guess_automaton_format()

std::string vcsn::guess_automaton_format

(

std::istream &

is

)

Guess the format of an automaton file.

Parameters

is	the input stream

Precondition

is is seekable

Returns

the name of the format, suitable for read_automaton.

Definition at line 18 of file read.cc.

References daut(), vcsn::detail::dot::driver::parse(), vcsn::dyn::read_automaton(), and require().

Here is the call graph for this function:

has() [1/12]

template<typename Map , typename Key >

auto vcsn::has	(	const Map &	s,
		const Key &	e
	)		-> decltype(s.find(e) != std::end(s))

Whether e is in s.

Definition at line 12 of file bimap.hh.

has() [2/12]

template<typename T , typename U >

bool vcsn::has ( std::initializer_list< T >  s, const U &  e  )

inline

Whether e is in s.

Definition at line 13 of file initializer_list.hh.

has() [3/12]

template<typename T , typename Allocator = std::allocator<T>>

ATTRIBUTE_PURE bool vcsn::has	(	const std::deque< T, Allocator > &	s,
		const T &	e
	)

Whether e is member of s.

Definition at line 15 of file deque.hh.

has() [4/12]

template<typename Key , typename T , typename Hash , typename KeyEqual , typename Alloc >

bool vcsn::has	(	const std::unordered_map< Key, T, Hash, KeyEqual, Alloc > &	m,
		const Key &	k
	)

Whether e is member of m.

Definition at line 24 of file unordered_map.hh.

has() [5/12]

template<typename Key , typename Compare , typename Allocator >

ATTRIBUTE_PURE bool vcsn::has	(	const boost::container::flat_set< Key, Compare, Allocator > &	s,
		const Key &	e
	)

Whether e is member of s.

Definition at line 26 of file setalpha.hh.

Referenced by vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::add_add_transitions(), vcsn::detail::eppstein< Aut >::add_children_to_queue_(), vcsn::ast::context_parser::any_(), aut_of_component(), vcsn::detail::cycle_identity_impl< Aut >::check(), vcsn::rat::expansionset< expressionset_t >::complement_(), complement_here(), vcsn::detail::determinized_automaton_impl< Aut, Kind, Lazy >::complete_(), complete_here(), vcsn::detail::scc_impl< Aut, dijkstra_tag >::components(), copy(), vcsn::detail::reverse_postorder_impl< Aut >::dfs(), vcsn::detail::scc_impl< Aut, dijkstra_tag >::dfs(), vcsn::detail::scc_impl< Aut, kosaraju_tag >::dfs(), vcsn::detail::scc_impl< Aut, tarjan_iterative_tag >::dfs(), vcsn::detail::scc_impl< Aut, tarjan_recursive_tag >::dfs(), vcsn::set_alphabet< L >::has(), vcsn::detail::are_isomorphic_impl< Aut1, Aut2 >::is_isomorphism_valid_throwing(), vcsn::rat::expansionset< expressionset_t >::is_normal(), is_partial_identity(), vcsn::ast::context_parser::labelset_or_weightset_(), vcsn::rat::expansionset< expressionset_t >::ldivide(), vcsn::rat::expressionset_impl< Context >::letter_class_(), num_accessible_states(), num_useful_states(), vcsn::detail::is_ambiguous_impl< Aut >::operator()(), vcsn::detail::a_star_impl< Aut >::operator()(), vcsn::detail::random_expression_impl< ExpressionSet, RandomGenerator >::parse_param_(), vcsn::detail::dot_impl< Aut >::print_state_(), vcsn::detail::dot_impl< Aut >::print_transitions_(), vcsn::detail::reverse_postorder_impl< Aut >::reverse_postorder_impl(), vcsn::detail::scc_impl< Aut, kosaraju_tag >::scc_impl(), vcsn::detail::scc_impl< Aut, tarjan_iterative_tag >::scc_impl(), vcsn::detail::scc_impl< Aut, tarjan_recursive_tag >::scc_impl(), vcsn::detail::shortest_path_tree< Aut >::set_parent_of(), ss_shortest_distance(), vcsn::detail::polystate_automaton_impl< Aut, Kind, Lazy >::state_has_name(), vcsn::detail::tuple_automaton_impl< Aut, Auts >::state_has_name(), vcsn::detail::pair_automaton_impl< Aut >::state_has_name(), vcsn::rat::standard_visitor< Aut, ExpSet >::VCSN_RAT_VISIT(), vcsn::ast::context_parser::weightset_(), and vcsn::detail::universal_impl< Aut >::work_().

has() [6/12]

template<typename T , typename Container >

ATTRIBUTE_PURE bool vcsn::has	(	const std::queue< T, Container > &	s,
		const T &	e
	)

Whether e is member of s.

Definition at line 29 of file queue.hh.

has() [7/12]

template<typename T , typename Alloc >

ATTRIBUTE_PURE bool vcsn::has	(	const std::vector< T, Alloc > &	s,
		const T &	e
	)

Whether e is member of s.

Definition at line 30 of file vector.hh.

has() [8/12]

template<typename T , typename Compare , typename Alloc >

bool vcsn::has	(	const std::set< T, Compare, Alloc > &	s,
		const T &	e
	)

Whether e is member of s.

Definition at line 9 of file set.hxx.

Referenced by std::hash< set< T, Compare, Alloc > >::operator()().

has() [9/12]

template<typename Key , typename Hash , typename KeyEqual , typename Alloc >

bool vcsn::has	(	const std::unordered_set< Key, Hash, KeyEqual, Alloc > &	s,
		const Key &	k
	)

Whether e is member of s.

Definition at line 37 of file unordered_set.hh.

Referenced by set_intersection().

has() [10/12]

template<typename Key , typename Value , typename Compare , typename Alloc >

bool vcsn::has ( const std::map< Key, Value, Compare, Alloc > &  s, const Key &  e  )

inline

Whether e is in s.

Definition at line 38 of file map.hh.

has() [11/12]

template<typename Key , typename Value >

bool vcsn::has	(	const sparse_map< Key, Value > &	s,
		Key	k
	)

Definition at line 128 of file sparse-map.hh.

References vcsn::sparse_map< Key, Value >::has().

Here is the call graph for this function:

has() [12/12]

template<typename T >

bool vcsn::has	(	const sparse_set< T > &	s,
		T	e
	)

Definition at line 129 of file sparse-set.hh.

References vcsn::sparse_set< T >::has().

Here is the call graph for this function:

has_bounded_lag()

template<Automaton Aut>

bool vcsn::has_bounded_lag

(

const Aut &

aut

)

Whether a transducer has a bounded lag.

Parameters

[in]

aut

the transducer

Returns

whether the lag is bounded

Definition at line 150 of file has-bounded-lag.hh.

References vcsn::detail::bounded_lag_checker< Aut >::has_bounded_lag().

Here is the call graph for this function:

has_lightening_cycle() [1/2]

template<Automaton Aut>

std::enable_if_t<weightset_t_of<Aut>::has_lightening_weights(), bool> vcsn::has_lightening_cycle

(

const Aut &

aut

)

Definition at line 17 of file has-lightening-cycle.hh.

References vcsn::detail::bellman_ford_impl().

Referenced by vcsn::detail::bellman_ford_impl(), and vcsn::detail::lightest_impl< Aut >::operator()().

Here is the call graph for this function:

has_lightening_cycle() [2/2]

template<Automaton Aut>

std::enable_if_t<!weightset_t_of<Aut>::has_lightening_weights(), bool> vcsn::has_lightening_cycle

(

const Aut &

)

Definition at line 24 of file has-lightening-cycle.hh.

has_twins_property()

template<Automaton Aut>

bool vcsn::has_twins_property

(

const Aut &

aut

)

Whether aut has the twins property.

Definition at line 132 of file has-twins-property.hh.

References vcsn::detail::conjunction(), create_states_and_trans_(), cycle_identity(), is_cycle_ambiguous(), make_context(), make_mutable_automaton(), require(), strong_components(), tarjan_iterative, and trim().

Here is the call graph for this function:

hash_combine()

template<typename T >

void vcsn::hash_combine	(	std::size_t &	seed,
		const T &	v
	)

Definition at line 63 of file functional.hh.

References hash_combine_hash(), and vcsn::detail::hash_value().

Referenced by vcsn::rat::hash< ExpSet >::combine_(), vcsn::detail::q_impl::hash(), vcsn::detail::polynomialset_impl< Context, Kind >::hash(), std::hash< std::tuple< Elements... > >::hash_(), vcsn::detail::tupleset_impl< ValueSets >::hash_(), std::hash< pair< T1, T2 > >::operator()(), std::hash< map< Key, Value, Compare, Alloc > >::operator()(), std::hash< set< T, Compare, Alloc > >::operator()(), std::hash< vector< T, Alloc > >::operator()(), vcsn::detail::minimizer< Aut, signature_tag >::signature_hasher::operator()(), std::hash< std::array< Value, Size > >::operator()(), and vcsn::detail::are_isomorphic_impl< Aut1, Aut2 >::state_to_class().

Here is the call graph for this function:

hash_combine_hash()

void vcsn::hash_combine_hash ( std::size_t &  seed, size_t  h  )

inline

Definition at line 56 of file functional.hh.

Referenced by hash_combine(), std::hash< boost::dynamic_bitset< B, A > >::operator()(), vcsn::detail::minimizer< Aut, signature_tag >::signature_hasher::operator()(), and vcsn::detail::minimizer< Aut, weighted_tag >::signature_hasher::operator()().

iendl()

std::ostream & vcsn::iendl

(

std::ostream &

o

)

Print an end of line, then set the indentation.

Definition at line 49 of file indent.cc.

References indent().

Referenced by decendl(), incendl(), vcsn::rat::to_expansion_visitor< expressionset_t >::operator()(), vcsn::rat::dot_printer< ExpSet >::operator()(), vcsn::rat::dot_printer< ExpSet >::visit_tuple< typename >::operator()(), vcsn::rat::dot_printer< ExpSet >::visit_tuple< typename >::print_(), vcsn::rat::dot_printer< ExpSet >::print_(), and vcsn::ast::context_printer::visit().

Here is the call graph for this function:

if() [1/2]

vcsn::if

(

exp.

max = = -1

)

Definition at line 382 of file multiply.hh.

References vcsn::to::min, and res.

Referenced by vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::add_shuffle_transitions_(), vcsn::rat::location::lines(), and vcsn::rat::operator<<().

if() [2/2]

vcsn::if

(

)

Definition at line 391 of file multiply.hh.

References vcsn::to::max, and vcsn::to::min.

image()

template<typename Key , typename Value , typename Comp , typename Alloc >

std::set<typename std::map<Key, Value, Comp, Alloc>::mapped_type> vcsn::image

(

const std::map< Key, Value, Comp, Alloc > &

m

)

The set of values of a map.

Definition at line 46 of file map.hh.

References res.

Referenced by vcsn::detail::universal_impl< Aut >::work_().

in_situ_remover()

template<Automaton Aut>

bool vcsn::in_situ_remover	(	Aut &	aut,
		bool	prune = true
	)

incendl()

std::ostream & vcsn::incendl

(

std::ostream &

o

)

Increment the indentation, print an end of line, and set the indentation.

Definition at line 54 of file indent.cc.

References iendl(), and incindent().

Referenced by vcsn::rat::to_expansion_visitor< expressionset_t >::operator()(), vcsn::rat::dot_printer< ExpSet >::operator()(), vcsn::rat::printer< ExpSet >::print_(), and vcsn::ast::context_printer::visit().

Here is the call graph for this function:

incindent()

std::ostream & vcsn::incindent

(

std::ostream &

o

)

Increment the indentation.

Definition at line 21 of file indent.cc.

References vcsn::detail::indentation.

Referenced by incendl().

indent()

std::ostream & vcsn::indent

(

std::ostream &

o

)

Set the indentation.

Definition at line 40 of file indent.cc.

References vcsn::detail::indentation.

Referenced by iendl().

inductive()

template<Automaton Aut, typename ExpSet , typename Tag >

Aut vcsn::inductive	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	r,
		Tag	= {}
	)

Build an automaton by induction from an expression.

Template Parameters

Aut	the type of the generated automaton.
ExpSet	the expressionset.
Tag	the nature of the operations (standard_tag, etc.).

Definition at line 319 of file inductive.hh.

Referenced by vcsn::ctx::detail::register_expression_functions().

infiltrate() [1/3]

template<typename ValueSet >

ValueSet::value_t vcsn::infiltrate	(	const ValueSet &	vs,
		const typename ValueSet::value_t &	lhs,
		const typename ValueSet::value_t &	rhs
	)

Infiltration product of values.

Definition at line 17 of file infiltrate-expression.hh.

infiltrate() [2/3]

template<Automaton A1, Automaton A2>

auto vcsn::infiltrate	(	const A1 &	a1,
		const A2 &	a2
	)		-> tuple_automaton<decltype(join_automata(a1, a2)), A1, A2>

The (accessible part of the) infiltration product.

Definition at line 827 of file conjunction.hh.

References Automaton, vcsn::detail::join_automata(), and res.

Referenced by vcsn::dyn::detail::infiltrate_(), and vcsn::dyn::detail::infiltrate_value().

Here is the call graph for this function:

infiltrate() [3/3]

template<Automaton A1, Automaton A2, Automaton A3, Automaton... Auts>

auto vcsn::infiltrate	(	const A1 &	a1,
		const A2 &	a2,
		const A3 &	a3,
		const Auts &...	as
	)		-> decltype(infiltrate(infiltrate(a1, a2), a3, as...))

The (accessible part of the) infiltration product.

Definition at line 840 of file conjunction.hh.

References vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::infiltrate().

Here is the call graph for this function:

info() [1/2]

template<Automaton Aut>

std::ostream& vcsn::info	(	const Aut &	aut,
		std::ostream &	out = std::cout,
		unsigned	details = 2
	)

Print info about an automaton.

Definition at line 73 of file info.hh.

References ECHO, is_ambiguous(), is_codeterministic(), is_complete(), is_cycle_ambiguous(), is_deterministic(), is_empty(), is_eps_acyclic(), is_normalized(), is_proper(), is_standard(), is_synchronizing(), is_trim(), is_useless(), is_valid(), num_accessible_states(), num_coaccessible_states(), num_codeterministic_states(), num_components(), num_deterministic_states(), vcsn::detail::num_lazy_states(), vcsn::detail::num_spontaneous_transitions(), num_useful_states(), vcsn::detail::out(), scc(), vcsn::format::sname, and VCSN_IF_FREE.

Referenced by info(), vcsn::dyn::info(), vcsn::dyn::detail::info_expression(), print(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

info() [2/2]

template<typename ExpSet >

void vcsn::info	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	e,
		std::ostream &	o = std::cout
	)

Print info about the expression.

Definition at line 153 of file info.hh.

References vcsn::detail::conjunction(), ECHO, info(), vcsn::format::sname, and vcsn::detail::tuple().

Here is the call graph for this function:

intersection_closure()

template<typename T , typename Compare , typename Alloc >

std::set< std::set< T, Compare, Alloc > > vcsn::intersection_closure

(

std::set< std::set< T, Compare, Alloc >>

pset

)

The set of all the intersections of the sets in pset.

Definition at line 17 of file set.hxx.

References set_intersection().

Referenced by std::hash< set< T, Compare, Alloc > >::operator()(), and vcsn::detail::universal_impl< Aut >::work_().

Here is the call graph for this function:

is_accessible()

template<Automaton Aut>

bool vcsn::is_accessible

(

const Aut &

a

)

Whether all its states are accessible.

Definition at line 179 of file accessible.hh.

References num_accessible_states().

Referenced by vcsn::detail::are_isomorphic_impl< Aut1, Aut2 >::get_full_response().

Here is the call graph for this function:

is_acyclic()

template<Automaton Aut>

ATTRIBUTE_CONST bool vcsn::is_acyclic

(

const Aut &

aut

)

Definition at line 131 of file is-acyclic.hh.

Referenced by is_eps_acyclic().

is_ambiguous()

template<Automaton Aut>

bool vcsn::is_ambiguous

(

const Aut &

aut

)

Whether an automaton is ambiguous.

Parameters

aut	the automaton.

Returns

whether ambiguous.

Definition at line 88 of file is-ambiguous.hh.

Referenced by ambiguous_word(), info(), vcsn::dyn::is_ambiguous(), and vcsn::ctx::detail::register_automaton_functions().

is_coaccessible()

template<Automaton Aut>

bool vcsn::is_coaccessible

(

const Aut &

a

)

Whether all its states are coaccessible.

Definition at line 186 of file accessible.hh.

References is_empty(), and num_coaccessible_states().

Here is the call graph for this function:

is_codeterministic()

template<Automaton Aut>

bool vcsn::is_codeterministic

(

const Aut &

aut

)

Whether the transposed automaton is deterministic.

Definition at line 73 of file is-deterministic.hh.

References is_deterministic(), and transpose().

Referenced by info().

Here is the call graph for this function:

is_complete()

template<Automaton Aut>

bool vcsn::is_complete

(

const Aut &

aut

)

Whether aut is complete.

Precondition

aut is LTL

Definition at line 14 of file is-complete.hh.

References vcsn::detail::all_out().

Referenced by complement_here(), info(), vcsn::detail::universal_impl< Aut >::operator()(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

is_costandard()

template<Automaton Aut>

bool vcsn::is_costandard

(

const Aut &

a

)

Whether a is costandard.

Definition at line 41 of file standard.hh.

References is_standard(), and transpose().

Referenced by is_normalized().

Here is the call graph for this function:

is_cycle_ambiguous()

template<Automaton Aut>

bool vcsn::is_cycle_ambiguous

(

const Aut &

aut

)

Whether aut is cycle-ambiguous.

Definition at line 144 of file is-ambiguous.hh.

References aut_of_component(), is_cycle_ambiguous_scc(), strong_components(), and tarjan_iterative.

Referenced by has_twins_property(), and info().

Here is the call graph for this function:

is_cycle_ambiguous_scc()

template<Automaton Aut>

bool vcsn::is_cycle_ambiguous_scc

(

const Aut &

aut

)

Whether aut is cycle-ambiguous.

Precondition

aut is a strongly connected component.

Definition at line 167 of file is-ambiguous.hh.

References vcsn::detail::conjunction(), strong_components(), and tarjan_iterative.

Referenced by is_cycle_ambiguous().

Here is the call graph for this function:

is_deterministic() [1/2]

template<Automaton Aut>

bool vcsn::is_deterministic	(	const Aut &	aut,
		state_t_of< Aut >	s
	)

Whether state s is deterministic in aut.

Definition at line 16 of file is-deterministic.hh.

References vcsn::detail::all_out().

Referenced by complement_here(), vcsn::detail::dispatch_tags(), info(), is_codeterministic(), is_deterministic(), vcsn::detail::fado_impl< Aut >::is_deterministic_(), vcsn::detail::minimizer< Aut, moore_tag >::minimizer(), num_deterministic_states(), vcsn::detail::universal_impl< Aut >::operator()(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

is_deterministic() [2/2]

template<Automaton Aut>

bool vcsn::is_deterministic

(

const Aut &

aut

)

Whether has at most an initial state, and all its states are deterministic.

Definition at line 56 of file is-deterministic.hh.

References vcsn::detail::initial_transitions(), is_deterministic(), and vcsn::rat::size().

Here is the call graph for this function:

is_empty()

template<Automaton Aut>

bool vcsn::is_empty

(

const Aut &

a

)

Whether has no states.

Definition at line 196 of file accessible.hh.

Referenced by are_equivalent(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::complement(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::conjunction(), info(), is_coaccessible(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::ldivide(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::rdivide(), and vcsn::ctx::detail::register_automaton_functions().

is_eps_acyclic() [1/2]

template<Automaton Aut>

ATTRIBUTE_CONST std::enable_if_t<context_t_of<Aut>::has_one(), bool> vcsn::is_eps_acyclic

(

const Aut &

aut

)

Detect epsilon-circuits.

In this algorithm, only epsilon-transitions are considered.

Definition at line 114 of file is-acyclic.hh.

References is_acyclic().

Referenced by info(), vcsn::dyn::is_eps_acyclic(), vcsn::detail::is_valid_impl< Aut, has_one >::is_valid_(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

is_eps_acyclic() [2/2]

template<Automaton Aut>

ATTRIBUTE_CONST std::enable_if_t<!context_t_of<Aut>::has_one(), bool> vcsn::is_eps_acyclic

(

const Aut &

)

Definition at line 123 of file is-acyclic.hh.

is_free_boolean()

template<Automaton Aut>

constexpr bool vcsn::is_free_boolean

(

)

Definition at line 10 of file is-free-boolean.hh.

is_functional()

template<Automaton Aut>

bool vcsn::is_functional

(

const Aut &

aut

)

Whether aut is functional.

Precondition

aut is a transducer.

Definition at line 17 of file is-functional.hh.

References is_partial_identity().

Here is the call graph for this function:

is_letterized()

template<Automaton Aut>

bool vcsn::is_letterized

(

const Aut &

aut

)

Check if the transitions are all letters.

Parameters

[in]

aut

the automaton

Returns

whether the transitions are letters

Definition at line 190 of file letterize.hh.

References vcsn::detail::is_letterized().

Here is the call graph for this function:

is_normal()

template<typename ExpansionSet >

bool vcsn::is_normal	(	const ExpansionSet &	xs,
		const typename ExpansionSet::value_t &	x
	)

Normalize an expansion.

Definition at line 23 of file normalize-expansion.hh.

is_normalized()

template<Automaton Aut>

bool vcsn::is_normalized

(

const Aut &

a

)

Whether a is standard and co-standard.

Definition at line 16 of file normalize.hh.

References is_costandard(), and is_standard().

Referenced by info(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

is_out_sorted()

template<Automaton Aut>

bool vcsn::is_out_sorted

(

const Aut &

a

)

Whether for each state, the outgoing transitions are sorted by increasing label.

Definition at line 59 of file sort.hh.

References vcsn::detail::is_sorted_forward(), and vcsn::detail::out().

Referenced by vcsn::dyn::is_out_sorted(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

is_partial_identity()

template<Automaton Aut>

bool vcsn::is_partial_identity

(

const Aut &

aut

)

Whether transducer aut is equivalent to a partial identity function on all successful paths.

This automaton is expected to be two-tape, both tapes having the same labelset.

Words of the k-tape automaton: k-tuples of words.

Common labelset for both tapes.

Residue of input and output paths arriving to a given state, with longest common prefix eliminated.

Definition at line 21 of file is-partial-identity.hh.

References vcsn::detail::all_out(), coaccessible_states(), has(), vcsn::detail::make_wordset(), and vcsn::weightset_mixin< WeightSet >::mul().

Referenced by is_functional().

Here is the call graph for this function:

is_proper()

template<Automaton Aut>

bool vcsn::is_proper

(

const Aut &

aut

)

Test whether an automaton is proper.

An automaton is proper iff it contains no epsilon-transition.

Parameters

aut	The tested automaton

Returns

true iff the automaton is proper

Definition at line 47 of file is-proper.hh.

References vcsn::detail::is_proper_().

Referenced by evaluate(), vcsn::detail::epsilon_remover< Aut, has_one >::in_situ_remover(), vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::infiltrate(), info(), vcsn::dyn::is_proper(), vcsn::detail::is_proper_(), is_realtime(), vcsn::detail::is_valid_impl< Aut, has_one >::is_valid_(), vcsn::ctx::detail::register_automaton_functions(), and vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::shuffle().

Here is the call graph for this function:

is_realtime()

template<Automaton Aut>

bool vcsn::is_realtime

(

const Aut &

aut

)

Check if the automaton is realtime, i.e.

it is letterized and proper.

Parameters

[in]

aut

the automaton

Returns

whether the automaton is realtime

Definition at line 248 of file letterize.hh.

References vcsn::dyn::detail::is_letterized(), and is_proper().

Here is the call graph for this function:

is_standard()

template<Automaton Aut>

bool vcsn::is_standard

(

const Aut &

a

)

Whether a is standard.

Definition at line 28 of file standard.hh.

References vcsn::detail::in(), and vcsn::detail::initial_transitions().

Referenced by add_here(), vcsn::detail::dispatch_tags(), info(), is_costandard(), is_normalized(), vcsn::detail::standard_operations< Aut >::lweight_here(), vcsn::ctx::detail::register_automaton_functions(), vcsn::detail::standard_operations< Aut >::rweight_here(), and star_here().

Here is the call graph for this function:

is_synchronized()

template<Automaton Aut>

bool vcsn::is_synchronized

(

const Aut &

aut

)

Check whether the transducer is synchronized.

Parameters

[in]

aut

the transducer

Returns

whether it is synchronized

Definition at line 309 of file is-synchronized.hh.

is_synchronized_by()

template<Automaton Aut>

bool vcsn::is_synchronized_by	(	const Aut &	aut,
		const word_t_of< Aut > &	w
	)

Whether w synchronizes automaton aut.

Definition at line 36 of file synchronizing-word.hh.

References vcsn::detail::out(), require(), and vcsn::rat::size().

Referenced by vcsn::dyn::is_synchronized_by(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

is_synchronizing()

template<Automaton Aut>

bool vcsn::is_synchronizing

(

const Aut &

aut

)

Whether this automaton is synchronizing, i.e., has synchronizing words.

Definition at line 390 of file synchronizing-word.hh.

References vcsn::detail::word_synchronizer< Aut >::is_synchronizing().

Referenced by info(), vcsn::dyn::is_synchronizing(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

is_trim()

template<Automaton Aut>

bool vcsn::is_trim

(

const Aut &

a

)

Whether all its states are useful.

Definition at line 165 of file accessible.hh.

References num_useful_states().

Referenced by info(), vcsn::detail::minimizer< Aut, moore_tag >::minimizer(), vcsn::detail::minimizer< Aut, weighted_tag >::minimizer(), vcsn::detail::minimizer< Aut, signature_tag >::minimizer(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

is_useless()

template<Automaton Aut>

bool vcsn::is_useless

(

const Aut &

a

)

Whether all no state is useful.

Definition at line 172 of file accessible.hh.

References num_useful_states().

Referenced by are_equivalent(), info(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

is_valid() [1/2]

template<Automaton Aut>

bool vcsn::is_valid

(

const Aut &

aut

)

Definition at line 139 of file is-valid.hh.

References vcsn::detail::is_valid_impl< Aut, has_one >::is_valid().

Referenced by vcsn::nullableset< LabelSet >::conv(), info(), vcsn::detail::tupleset_impl< ValueSets >::is_valid_(), vcsn::dyn::detail::is_valid_expression(), vcsn::detail::properer< Aut >::proper_star_(), vcsn::detail::properer< Aut >::proper_star_here_(), vcsn::ctx::detail::register_automaton_functions(), and vcsn::rat::expressionset_impl< Context >::star().

Here is the call graph for this function:

is_valid() [2/2]

template<typename ExpSet >

bool vcsn::is_valid	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	e
	)

Whether e has only computable stars.

Definition at line 18 of file is-valid-expression.hh.

References constant_term().

Here is the call graph for this function:

join() [1/3]

template<typename ValueSet >

auto vcsn::join

(

const ValueSet &

vs

)

-> ValueSet

The join of a single valueset.

Useful for variadic operator on a single argument.

Definition at line 44 of file join.hh.

Referenced by compose_context(), join(), vcsn::detail::join_impl< context< LS1, WS1 >, context< LS2, WS2 > >::join(), vcsn::detail::join_impl< expressionset< Ctx1 >, expressionset< Ctx2 > >::join(), vcsn::detail::join_impl< letterset< GenSet1 >, expressionset< Ctx2 > >::join(), vcsn::detail::join_impl_simple< WeightSet, expressionset< Context > >::join(), vcsn::detail::join_impl< expansionset< expressionset< Ctx1 > >, expansionset< expressionset< Ctx2 > > >::join(), vcsn::detail::join_impl< tupleset< VS1... >, tupleset< VS2... > >::join(), vcsn::detail::join_impl< tupleset< VS1... >, VS2 >::join(), vcsn::detail::join_impl< polynomialset< Ctx1, Kind1 >, polynomialset< Ctx2, Kind2 > >::join(), vcsn::detail::join_impl< polynomialset< Ctx1, Kind1 >, WS2 >::join(), vcsn::detail::join_automata(), join_weightset_expressionset(), join_weightset_polynomialset(), vcsn::dyn::lweight(), vcsn::detail::compose_automaton_impl< Lazy, Lhs, Rhs >::make_context_(), meet(), vcsn::detail::nullable_join_context(), vcsn::dyn::rweight(), and tuple_context().

join() [2/3]

template<typename ValueSet1 , typename ValueSet2 >

auto vcsn::join	(	ValueSet1	vs1,
		ValueSet2	vs2
	)		-> decltype(detail::join_(vs1, vs2, 0))

The join of two valuesets.

Definition at line 53 of file join.hh.

References vcsn::detail::join_().

Here is the call graph for this function:

join() [3/3]

template<typename ValueSet1 , typename ValueSet2 , typename ValueSet3 , typename... VSs>

auto vcsn::join	(	ValueSet1	vs1,
		ValueSet2	vs2,
		ValueSet3	vs3,
		VSs &&...	vs
	)

The join of three (or more) valuesets.

We once had a single case for two-and-more arguments (instead of one join for two and one join for three-and-more), but the decltype() used in the return type failed to find the appropriate 'recursive' call to join in the case of three rat::identities. It turns out that removing the return type (and leaving its computation to the C++14 compiler) suffices to force the instantiation of the function, and to fix the problem.

Definition at line 71 of file join.hh.

References join().

Referenced by vcsn::detail::join_().

Here is the call graph for this function:

join_weightset_expansionset()

template<typename WeightSet , typename ExpSet >

expansionset<expressionset<context<labelset_t_of<ExpSet>, join_t<WeightSet, weightset_t_of<ExpSet> > > > > vcsn::join_weightset_expansionset	(	const WeightSet &	ws,
		const expansionset< ExpSet > &	rs
	)

Definition at line 201 of file weight.hh.

References vcsn::rat::expansionset< ExpSet >::expressionset(), join_weightset_expressionset(), and make_expansionset().

Referenced by vcsn::dyn::detail::lweight_expansion(), and vcsn::dyn::detail::rweight_expansion().

Here is the call graph for this function:

join_weightset_expressionset()

template<typename WeightSet , typename ExpSet >

expressionset<context<labelset_t_of<ExpSet>, join_t<WeightSet, weightset_t_of<ExpSet> > > > vcsn::join_weightset_expressionset	(	const WeightSet &	ws,
		const ExpSet &	rs
	)

Join between an expressionset and a weightset.

We must not perform a plain

join(w1.weightset(), r1.expressionset())

here. Consider for instance

expressionset<lal(abc), expressionset<law(xyz), b>>

we would perform

join(expressionset<law(xyz), b>, expressionset<lal(abc), expressionset<law(xyz), b>>)

i.e., a join of contexts which applies to both labelsets (here, join(lal(abc), "law(xyz)) = law(abcxyz)") and weightsets. Here, the "expressionset<law(xyz), b>" must really be considered as a weightset, so compute the join of weightsets by hand, and leave the labelset alone.

Definition at line 255 of file weight.hh.

References vcsn::detail::ctx, join(), make_context(), and make_expressionset().

Referenced by join_weightset_expansionset(), vcsn::dyn::detail::lweight_expression(), and vcsn::dyn::detail::rweight_expression().

Here is the call graph for this function:

join_weightset_polynomialset()

template<typename WeightSet , typename ExpSet >

auto vcsn::join_weightset_polynomialset	(	const WeightSet &	ws,
		const polynomialset< ExpSet > &	ps
	)

Definition at line 287 of file weight.hh.

References join(), make_context(), and vcsn::detail::make_polynomialset().

Referenced by vcsn::dyn::detail::lweight_polynomial(), and vcsn::dyn::detail::rweight_polynomial().

Here is the call graph for this function:

k_lightest_path()

template<Automaton Aut>

std::vector<path_t_of<Aut> > vcsn::k_lightest_path	(	const Aut &	aut,
		state_t_of< Aut >	src,
		state_t_of< Aut >	dst,
		unsigned	k
	)

Definition at line 208 of file k-lightest-path.hh.

References vcsn::detail::make_yen().

Referenced by lightest(), lightest_automaton(), and lightest_path().

Here is the call graph for this function:

label_of() [1/3]

template<typename Label , typename Weight >

auto vcsn::label_of

(

const welement< Label, Weight > &

m

)

-> decltype(m.label())

The label of a welement.

Definition at line 146 of file wet.hh.

Referenced by vcsn::detail::polynomialset_impl< Context, Kind >::abs(), vcsn::detail::trie_builder< Context, Dir >::add(), vcsn::edit_automaton< Aut >::add_entry(), vcsn::detail::polynomialset_impl< Context, Kind >::add_here(), vcsn::detail::polynomialset_impl< Context, Kind >::add_ldivide_here(), vcsn::detail::derived_term_automaton_impl< ExpSet >::complete_via_derivation_(), vcsn::detail::derived_term_automaton_impl< ExpSet >::complete_via_expansion_(), vcsn::rat::expansionset< expressionset_t >::compose(), vcsn::detail::polynomialset_impl< Context, Kind >::conjunction_impl_(), vcsn::detail::polynomialset_impl< Context, Kind >::conv(), derivation(), vcsn::detail::polynomialset_impl< Context, Kind >::hash(), vcsn::detail::polynomialset_impl< Context, Kind >::infiltrate(), vcsn::detail::derived_term_automaton_impl< ExpSet >::init_(), vcsn::detail::polynomialset_impl< Context, Kind >::ldivide(), vcsn::detail::polynomialset_impl< Context, Kind >::lmul_label(), vcsn::detail::polynomialset_impl< Context, Kind >::lweight(), minimize(), vcsn::detail::polynomialset_impl< Context, Kind >::monomial_compare(), vcsn::detail::polynomialset_impl< Context, Kind >::monomial_equal(), vcsn::detail::polynomialset_impl< Context, Kind >::monomial_less(), vcsn::detail::polynomialset_impl< Context, Kind >::mul(), vcsn::detail::polynomialset_impl< Context, Kind >::mul_impl_(), vcsn::rat::split_visitor< ExpSet >::multiply(), vcsn::detail::evaluator< Aut >::operator()(), vcsn::detail::polynomialset_impl< Context, Kind >::print(), vcsn::detail::polynomialset_impl< Context, Kind >::print_with_classes_(), vcsn::detail::polynomialset_impl< Context, Kind >::project(), vcsn::detail::polynomialset_impl< Context, Kind >::rmul_label(), vcsn::rat::expansionset< expressionset_t >::rweight(), vcsn::detail::polynomialset_impl< Context, Kind >::rweight(), vcsn::rat::expansionset< expressionset_t >::shuffle_(), split_polynomial(), vcsn::detail::polynomialset_impl< Context, Kind >::sub_here(), vcsn::detail::polynomialset_impl< Context, Kind >::to_label(), vcsn::detail::polynomialset_impl< Context, Kind >::transpose(), vcsn::rat::derivation_visitor< ExpSet >::VCSN_RAT_VISIT(), vcsn::rat::to_expansion_visitor< expressionset_t >::VCSN_RAT_VISIT(), vcsn::detail::wet_bitset::wet_bitset(), vcsn::detail::wet_set< Key, Compare >::wet_set(), and vcsn::detail::universal_impl< Aut >::work_().

label_of() [2/3]

template<typename Label , typename Weight >

const Label& vcsn::label_of

(

const std::pair< Label, Weight > &

m

)

The label of a pair (label, weight).

Definition at line 169 of file wet.hh.

label_of() [3/3]

template<typename Label , typename Weight >

Label& vcsn::label_of

(

std::pair< Label, Weight > &

m

)

The label of a pair (label, weight).

Definition at line 183 of file wet.hh.

ladybird()

template<typename Context >

mutable_automaton<Context> vcsn::ladybird	(	const Context &	ctx,
		unsigned	n
	)

Build the ladybird automaton of n states.

Definition at line 14 of file ladybird.hh.

References make_mutable_automaton(), vcsn::detail::make_vector(), require(), and res.

Referenced by vcsn::ctx::detail::register_context_functions().

Here is the call graph for this function:

ldivide() [1/4]

template<typename ValueSet >

ValueSet::value_t vcsn::ldivide	(	const ValueSet &	vs,
		const typename ValueSet::value_t &	lhs,
		const typename ValueSet::value_t &	rhs
	)

Left-division of values.

Definition at line 15 of file divide.hh.

ldivide() [2/4]

template<Automaton Aut1, Automaton Aut2>

auto vcsn::ldivide	(	const Aut1 &	lhs,
		const Aut2 &	rhs,
		auto_tag	= {}
	)

Compute the left quotient.

Parameters

lhs	left hand side
rhs	right hand side

Definition at line 683 of file conjunction.hh.

References vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::ldivide().

Here is the call graph for this function:

ldivide() [3/4]

template<Automaton Aut1, Automaton Aut2>

auto vcsn::ldivide	(	const Aut1 &	lhs,
		const Aut2 &	rhs,
		boolean_tag
	)

Definition at line 700 of file conjunction.hh.

References copy(), vcsn::detail::insplit(), vcsn::detail::join_automata(), and res.

Here is the call graph for this function:

ldivide() [4/4]

template<Automaton Aut1, Automaton Aut2>

auto vcsn::ldivide	(	const Aut1 &	lhs,
		const Aut2 &	rhs,
		weighted_tag
	)

Definition at line 715 of file conjunction.hh.

References vcsn::detail::join_automata().

Here is the call graph for this function:

left_reduce()

template<Automaton Aut>

auto vcsn::left_reduce

(

const Aut &

input

)

-> decltype(copy(input))

Definition at line 598 of file reduce.hh.

Referenced by reduce().

less_than()

template<Automaton Lhs, Automaton Rhs>

bool vcsn::less_than	(	const Lhs &	lhs,
		const Rhs &	rhs
	)

Whether lhs precedes rhs.

Definition at line 79 of file compare-automaton.hh.

References vcsn::dyn::detail::compare().

Here is the call graph for this function:

letterize()

template<Automaton Aut>

auto vcsn::letterize

(

const Aut &

aut

)

-> decltype(detail::letterize(aut))

Split the word transitions in the input automaton into letter ones.

Parameters

[in]

aut

the automaton

Returns

the letterized automaton

Definition at line 134 of file letterize.hh.

References vcsn::detail::letterize().

Referenced by realtime().

Here is the call graph for this function:

levenshtein()

template<typename Context >

mutable_automaton<Context> vcsn::levenshtein

(

const Context &

ctx

)

The Levenshtein automaton for a given context.

Definition at line 14 of file levenshtein.hh.

References make_mutable_automaton(), vcsn::detail::make_vector(), res, and vcsn::rat::size().

Here is the call graph for this function:

lgcd()

template<typename ValueSet >

ValueSet::value_t vcsn::lgcd	(	const ValueSet &	vs,
		const typename ValueSet::value_t &	lhs,
		const typename ValueSet::value_t &	rhs
	)

Left-division of values.

Definition at line 91 of file divide.hh.

Referenced by vcsn::detail::polynomialset_impl< Context, Kind >::lgcd(), and vcsn::detail::tupleset_impl< ValueSets >::lnormalize_here_().

lift() [1/2]

template<Automaton Aut, size_t... Tapes>

detail::lifted_automaton_t<Aut, Tapes...> vcsn::lift	(	const Aut &	a,
		vcsn::rat::identities	ids = {}
	)

Lift some tapes of the transducer.

Parameters

a	the input automaton
ids	the identities to use for the generated expressions

Definition at line 215 of file lift.hh.

References vcsn::detail::all_transitions(), Automaton, vcsn::rat::ids(), vcsn::detail::map(), and res.

Here is the call graph for this function:

lift() [2/2]

template<typename ExpSet >

detail::lifted_expressionset_t<ExpSet>::value_t vcsn::lift	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	e
	)

Move all the labels to the weights.

Definition at line 293 of file lift.hh.

References vcsn::detail::lift_expressionset().

Referenced by vcsn::dyn::detail::lift_automaton(), and vcsn::dyn::detail::lift_expression().

Here is the call graph for this function:

lightest()

template<Automaton Aut>

detail::word_polynomialset_t<context_t_of<Aut> >::value_t vcsn::lightest	(	const Aut &	aut,
		unsigned	num = 1,
		const std::string &	algo = "auto"
	)

The approximated behavior of an automaton.

Parameters

aut	the automaton whose behavior to approximate
num	number of words looked for
algo	the algorithm to use.

Definition at line 192 of file lightest.hh.

References compute_eppstein(), format_lightest(), k_lightest_path(), lightest_path(), vcsn::detail::make_word_polynomialset(), path_monomial(), require(), and res.

Referenced by vcsn::dyn::lightest().

Here is the call graph for this function:

lightest_automaton()

template<Automaton Aut, typename Algo = auto_tag>

fresh_automaton_t_of<Aut> vcsn::lightest_automaton	(	const Aut &	aut,
		unsigned	k,
		Algo	algo = {}
	)

Lightest Automaton.

An automaton composed only of the states included in the lightest path from pre to post. Using the shortest path algorithm given as parameter to compute the lightest 'in' transition of each state. Then, reconstruct the path keeping the states and transitions we met. Now that we have the sets of elements to keep we can construct a new automaton using these states/transitions.

Definition at line 22 of file lightest-automaton.hh.

References copy(), k_lightest_path(), lightest_path(), make_copier(), make_fresh_automaton(), require(), and res.

Here is the call graph for this function:

lightest_path() [1/7]

template<Automaton Aut, typename Tag = auto_tag>

predecessors_t_of<Aut> vcsn::lightest_path	(	const Aut &	aut,
		Tag	tag = {}
	)

Lightest path dispatch between algorithms with tags.

Definition at line 19 of file lightest-path.hh.

References lightest_path().

Here is the call graph for this function:

lightest_path() [2/7]

template<Automaton Aut>

predecessors_t_of<Aut> vcsn::lightest_path	(	const Aut &	aut,
		state_t_of< Aut >	source,
		state_t_of< Aut >	dest,
		auto_tag	= {}
	)

Definition at line 26 of file lightest-path.hh.

References lightest_path().

Here is the call graph for this function:

lightest_path() [3/7]

template<Automaton Aut>

predecessors_t_of<Aut> vcsn::lightest_path	(	const Aut &	aut,
		state_t_of< Aut >	src,
		state_t_of< Aut >	dst,
		const std::string &	algo
	)

Lightest path dispatch between algorithms with string.

Definition at line 50 of file lightest-path.hh.

References vcsn::detail::map().

Here is the call graph for this function:

lightest_path() [4/7]

template<Automaton Aut>

predecessors_t_of<Aut> vcsn::lightest_path	(	const Aut &	aut,
		state_t_of< Aut >	source,
		state_t_of< Aut >	,
		bellman_ford_tag
	)

Destination is ignored as bellman-ford does not stop when reaching dest, but when each iteration has been done.

Definition at line 80 of file bellman-ford.hh.

References vcsn::detail::bellman_ford_impl(), require(), and res.

Here is the call graph for this function:

lightest_path() [5/7]

template<Automaton Aut>

predecessors_t_of<Aut> vcsn::lightest_path	(	const Aut &	aut,
		state_t_of< Aut >	source,
		state_t_of< Aut >	dest,
		dijkstra_tag
	)

Definition at line 140 of file dijkstra.hh.

References vcsn::detail::make_dijkstra_impl().

Here is the call graph for this function:

lightest_path() [6/7]

template<Automaton Aut>

std::vector<transition_t_of<Aut> > vcsn::lightest_path	(	const Aut &	aut,
		state_t_of< Aut >	source,
		state_t_of< Aut >	dest,
		a_star_tag
	)

Definition at line 151 of file a-star.hh.

Referenced by lightest(), lightest_automaton(), lightest_path(), vcsn::detail::lightest_path_tag(), vcsn::detail::yen_impl< Aut, ValueSet, Mul, GetValue >::operator()(), and weight_series().

lightest_path() [7/7]

template<Automaton Aut>

predecessors_t_of<Aut> vcsn::lightest_path	(	const Aut &	aut,
		state_t_of< Aut >	src,
		state_t_of< Aut >	dst,
		yen_tag
	)

Definition at line 239 of file k-lightest-path.hh.

References format_lightest(), k_lightest_path(), and res.

Here is the call graph for this function:

list()

template<typename PolynomialSet >

std::ostream& vcsn::list	(	const PolynomialSet &	ps,
		const typename PolynomialSet::value_t &	p,
		std::ostream &	o = std::cout
	)

Definition at line 249 of file print.hh.

Referenced by vcsn::dyn::detail::list_polynomial().

lweight() [1/2]

template<Automaton Aut, typename Tag = auto_tag>

auto vcsn::lweight	(	const weight_t_of< Aut > &	w,
		const Aut &	aut,
		Tag	tag = {}
	)		-> fresh_automaton_t_of<Aut>

Left-multiplication of an automaton by a weight.

Definition at line 126 of file weight.hh.

References copy(), vcsn::detail::standard_operations< Aut >::lweight_here(), and res.

Referenced by are_equivalent().

Here is the call graph for this function:

lweight() [2/2]

template<typename ValueSet >

auto vcsn::lweight	(	const ValueSet &	rs,
		const weight_t_of< ValueSet > &	w,
		const typename ValueSet::value_t &	r
	)		-> decltype(rs.lweight(w, r))

Definition at line 186 of file weight.hh.

Referenced by vcsn::dyn::detail::lweight_expansion(), vcsn::dyn::detail::lweight_expression(), and vcsn::dyn::detail::lweight_polynomial().

lweight_here()

template<Automaton Aut, typename Tag = auto_tag>

Aut& vcsn::lweight_here	(	const weight_t_of< Aut > &	w,
		Aut &	res,
		Tag	tag = {}
	)

In place left-multiplication of an automaton by a weight.

Definition at line 118 of file weight.hh.

References vcsn::detail::standard_operations< Aut >::lweight_here().

Referenced by vcsn::dyn::detail::lweight_tag().

Here is the call graph for this function:

make_compose_automaton()

template<bool Lazy, std::size_t OutTape, std::size_t InTape, Automaton Lhs, Automaton Rhs>

auto vcsn::make_compose_automaton	(	const Lhs &	lhs,
		const Rhs &	rhs
	)

Definition at line 456 of file compose.hh.

References Automaton, and vcsn::detail::insplit().

Here is the call graph for this function:

make_container_filter_range()

template<typename Cont , typename Pred >

container_filter_range<Cont, Pred> vcsn::make_container_filter_range	(	const Cont &	cont,
		Pred	pred
	)

Definition at line 114 of file crange.hh.

Referenced by vcsn::detail::all_in(), vcsn::detail::all_out(), vcsn::detail::all_transitions(), vcsn::detail::mutable_automaton_impl< Context >::all_transitions(), and vcsn::detail::mutable_automaton_impl< Context >::state_range().

make_context() [1/2]

template<typename Ctx >

Ctx vcsn::make_context

(

const std::string &

name

)

Build a context from its name.

Definition at line 21 of file make-context.hh.

References require(), res, and str_quote().

Referenced by compose_context(), has_twins_property(), join_weightset_expressionset(), join_weightset_polynomialset(), vcsn::dyn::lweight(), minimize(), vcsn::ctx::detail::register_context_functions(), vcsn::dyn::rweight(), and to_spontaneous().

Here is the call graph for this function:

make_context() [2/2]

template<typename LabelSet , typename WeightSet >

context<LabelSet, WeightSet> vcsn::make_context	(	const LabelSet &	ls,
		const WeightSet &	ws
	)

Shorthand to build a context.

Definition at line 147 of file context.hh.

make_copier()

template<Automaton AutIn, Automaton AutOut>

detail::copier<AutIn, AutOut> vcsn::make_copier	(	const AutIn &	in,
		AutOut &	out,
		bool	safe = true
	)

Build an automaton copier.

Parameters

in	input automaton, to copy
out	output automaton, the destination
safe	whether the input automaton is in normal form, i.e., never has two transitions with same (src, label, dst).

Definition at line 256 of file copy.hh.

References Automaton, vcsn::detail::in(), and vcsn::detail::out().

Referenced by conjugate(), copy(), copy_into(), eliminate_state(), eliminate_state_here(), vcsn::detail::epsilon_remover_distance< Aut, has_one >::epsilon_remover_distance(), vcsn::detail::epsilon_remover_separate< transpose_in_automaton_t >::epsilon_remover_separate(), lightest_automaton(), and multiply_here().

Here is the call graph for this function:

make_delay_automaton()

template<Automaton Aut>

auto vcsn::make_delay_automaton

(

const Aut &

aut

)

-> decltype(detail::make_delay_automaton(aut))

Check whether the transducer is synchronized.

Parameters

[in]

aut

the transducer

Returns

whether it is synchronized

Definition at line 337 of file is-synchronized.hh.

make_derived_term_automaton()

template<typename ExpSet >

auto vcsn::make_derived_term_automaton	(	const ExpSet &	rs,
		const detail::derived_term_algo &	algo
	)		-> derived_term_automaton<ExpSet>

Definition at line 319 of file derived-term.hh.

References vcsn::detail::derived_term_algo::algo, and vcsn::detail::is_letterized().

Referenced by derived_term(), and vcsn::dyn::detail::derived_term().

Here is the call graph for this function:

make_dynamic_bitset()

template<typename Container >

dynamic_bitset vcsn::make_dynamic_bitset	(	const Container &	c,
		size_t	size
	)

Definition at line 39 of file dynamic_bitset.hh.

References res.

make_expansionset()

template<typename Context >

expansionset<expressionset<Context> > vcsn::make_expansionset

(

const expressionset< Context > &

es

)

Definition at line 983 of file expansionset.hh.

Referenced by join_weightset_expansionset().

make_expressionset() [1/2]

template<typename LabelSet , typename WeightSet >

auto vcsn::make_expressionset	(	const context< LabelSet, WeightSet > &	ctx,
		rat::identities	ids = {}
	)		-> expressionset<context<LabelSet, WeightSet>>

Shorthand to expressionset constructor.

Definition at line 610 of file expressionset.hh.

References vcsn::rat::ctx(), and vcsn::rat::ids().

Referenced by vcsn::dyn::detail::copy_expression(), expand(), vcsn::dyn::expression_one(), vcsn::dyn::expression_zero(), join_weightset_expressionset(), vcsn::detail::project(), vcsn::dyn::random_expression(), vcsn::dyn::detail::to_expression_class(), and vcsn::dyn::detail::to_expression_label().

Here is the call graph for this function:

make_expressionset() [2/2]

template<typename Context >

auto vcsn::make_expressionset	(	const expressionset< Context > &	rs,
		rat::identities	ids = {}
	)		-> expressionset<Context>

Shorthand to expressionset constructor.

Definition at line 620 of file expressionset.hh.

References vcsn::rat::ids().

Here is the call graph for this function:

make_fresh_automaton()

template<Automaton AutIn, Automaton AutOut = fresh_automaton_t_of<AutIn>>

AutOut vcsn::make_fresh_automaton

(

const AutIn &

model

)

Create an empty, mutable, automaton, based on another one.

To this end, each automaton type provides a fresh_automaton_t. In the case of mutable_automaton, it's simply mutable_automaton. In the case of a transpose_automaton<Aut>, it's transpose_automaton (of the fresh_automaton of Aut) so that we also create a transposed automaton. In the case of decorator, it's the base type, as we don't copy decorations.

Definition at line 91 of file copy.hh.

References vcsn::detail::real_context().

Referenced by aut_of_component(), conjunction(), lightest_automaton(), vcsn::detail::quotienter< Aut >::operator()(), vcsn::detail::universal_impl< Aut >::work_(), and vcsn::detail::standard_operations< Aut >::zero_here().

Here is the call graph for this function:

make_mutable_automaton()

template<typename Context >

mutable_automaton<Context> vcsn::make_mutable_automaton

(

const Context &

ctx

)

Definition at line 874 of file mutable-automaton.hh.

References vcsn::detail::ctx.

Referenced by vcsn::automatonset< context_t_of< automaton_t >, tag_t >::atom(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::complement(), vcsn::detail::compose_automaton_impl< Lazy, Lhs, Rhs >::compose_automaton_impl(), vcsn::dyn::detail::copy_convert(), de_bruijn(), has_twins_property(), vcsn::detail::join_automata(), ladybird(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::ldivide(), levenshtein(), vcsn::dyn::lweight(), make_nullable_automaton(), vcsn::detail::meet_automata(), vcsn::detail::nullable_join_automata(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::one(), project(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::rdivide(), vcsn::dyn::rweight(), to_spontaneous(), vcsn::detail::tuple(), and vcsn::automatonset< context_t_of< automaton_t >, tag_t >::zero().

make_nullable_automaton()

template<typename Context >

auto vcsn::make_nullable_automaton

(

const Context &

ctx

)

Definition at line 881 of file mutable-automaton.hh.

References make_mutable_automaton(), and vcsn::detail::make_nullableset_context().

Referenced by vcsn::automatonset< context_t_of< automaton_t >, tag_t >::ldivide(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::rdivide(), and subword().

Here is the call graph for this function:

make_partition_automaton() [1/3]

template<Automaton Aut>

auto vcsn::make_partition_automaton	(	const fresh_automaton_t_of< Aut > &	res,
		const Aut &	input,
		const typename detail::partition_automaton_impl< Aut >::origins_t	origins
	)		-> partition_automaton_t<Aut>

Build a partition_automaton.

Parameters

res	the actual result, typically a mutable_automaton
input	the automaton from which the partition is computed
origins	map each state of res to its states in input

Definition at line 212 of file partition-automaton.hh.

Referenced by vcsn::detail::quotienter< Aut >::operator()().

make_partition_automaton() [2/3]

template<Automaton Aut>

auto vcsn::make_partition_automaton	(	const fresh_automaton_t_of< Aut > &	res,
		const partition_automaton< Aut > &	input,
		const typename detail::partition_automaton_impl< Aut >::origins_t	origins
	)		-> partition_automaton_t<Aut>

Build a partition_automaton of a partition_automaton: smash into a single level partition_automaton.

Parameters

res	the actual result, typically a mutable_automaton
input	the automaton from which the partition is computed
origins	map each state of res to its states in input

Definition at line 228 of file partition-automaton.hh.

make_partition_automaton() [3/3]

template<Automaton Aut>

auto vcsn::make_partition_automaton	(	const fresh_automaton_t_of< transpose_automaton< Aut >> &	res,
		const transpose_automaton< Aut > &	input,
		const typename detail::partition_automaton_impl< Aut >::origins_t	origins
	)		-> transpose_automaton<partition_automaton_t<Aut>>

Build a partition_automaton of a transpose_automaton: smash into a transpose_automaton of a partition_automaton.

Parameters

res	the actual result, typically a mutable_automaton
input	the automaton from which the partition is computed
origins	map each state of res to its states in input

Definition at line 254 of file partition-automaton.hh.

make_random_engine()

std::mt19937 & vcsn::make_random_engine

(

)

Generate a unique random device.

Definition at line 6 of file random.cc.

References res.

Referenced by random_automaton(), random_automaton_deterministic(), and random_weight().

make_random_selector()

template<typename RandomGenerator >

random_selector<RandomGenerator> vcsn::make_random_selector

(

RandomGenerator &

g

)

Definition at line 102 of file random.hh.

Referenced by random_automaton(), and random_label().

make_shared_ptr()

template<typename SharedPtr , typename... Args>

SharedPtr vcsn::make_shared_ptr

(

Args &&...

args

)

Same as std::make_shared, but parameterized by the shared_ptr type, not the (pointed to) element_type.

Definition at line 13 of file memory.hh.

make_state_map()

template<typename Value >

state_map_t<Value> vcsn::make_state_map

(

)

const

Definition at line 15 of file state-map.hh.

References vcsn::detail::states_size().

Here is the call graph for this function:

make_tuple_automaton()

template<Automaton... Auts>

auto vcsn::make_tuple_automaton

(

const Auts &...

auts

)

-> tuple_automaton<Auts...>

Definition at line 297 of file tuple-automaton.hh.

Referenced by vcsn::detail::lazy_tuple_automaton< product_automaton_impl< Lazy, Aut, Auts... >, false, Lazy, Aut, Auts... >::lazy_tuple_automaton().

make_unordered_pair()

template<typename T >

auto vcsn::make_unordered_pair	(	T &&	e1,
		T &&	e2
	)

Definition at line 34 of file pair.hh.

Referenced by vcsn::detail::pair_automaton_impl< Aut >::state_().

meet() [1/11]

template<typename ValueSet >

auto vcsn::meet

(

const ValueSet &

vs

)

-> ValueSet

The meet of a single valueset.

Useful for variadic operator on a single argument.

Definition at line 174 of file context.hh.

meet() [2/11]

template<typename ValueSet1 , typename ValueSet2 , typename ValueSet3 , typename... VSs>

auto vcsn::meet	(	const ValueSet1 &	vs1,
		const ValueSet2 &	vs2,
		const ValueSet3 &	vs3,
		const VSs &...	vs
	)		-> decltype(meet(meet(vs1, vs2), vs3, vs...))

Definition at line 183 of file context.hh.

References meet().

Here is the call graph for this function:

meet() [3/11]

template<typename LhsLabelSet , typename LhsWeightSet , typename RhsLabelSet , typename RhsWeightSet >

auto vcsn::meet	(	const context< LhsLabelSet, LhsWeightSet > &	a,
		const context< RhsLabelSet, RhsWeightSet > &	b
	)		-> context<meet_t<LhsLabelSet, RhsLabelSet>, join_t<LhsWeightSet, RhsWeightSet>>

The meet of two contexts.

Definition at line 226 of file context.hh.

References join(), and meet().

Here is the call graph for this function:

meet() [4/11]

oneset vcsn::meet ( const oneset &  , const oneset &    )

inline

The meet of two labelsets.

Definition at line 256 of file oneset.hh.

meet() [5/11]

template<typename GenSet >

letterset<GenSet> vcsn::meet	(	const letterset< GenSet > &	lhs,
		const letterset< GenSet > &	rhs
	)

Compute the meet with another labelset.

Definition at line 406 of file letterset.hh.

meet() [6/11]

template<typename GenSet >

wordset<GenSet> vcsn::meet	(	const wordset< GenSet > &	lhs,
		const wordset< GenSet > &	rhs
	)

Compute the meet with another alphabet.

Definition at line 438 of file wordset.hh.

meet() [7/11]

template<typename Ctx1 , typename Ctx2 >

auto vcsn::meet	(	const expressionset< Ctx1 > &	a,
		const expressionset< Ctx2 > &	b
	)		-> expressionset<meet_t<Ctx1, Ctx2>>

The meet of two expressionsets.

Definition at line 636 of file expressionset.hh.

References vcsn::rat::meet().

Referenced by meet(), vcsn::detail::tupleset_impl< ValueSets >::meet_(), and vcsn::detail::meet_automata().

Here is the call graph for this function:

meet() [8/11]

template<typename GenSet >

nullableset<letterset<GenSet> > vcsn::meet	(	const nullableset< letterset< GenSet >> &	lhs,
		const nullableset< letterset< GenSet >> &	rhs
	)

Compute the meet with another labelset.

Definition at line 742 of file nullableset.hh.

meet() [9/11]

template<typename GenSet >

nullableset<letterset<GenSet> > vcsn::meet	(	const letterset< GenSet > &	lhs,
		const nullableset< letterset< GenSet >> &	rhs
	)

Definition at line 745 of file nullableset.hh.

meet() [10/11]

template<typename GenSet >

nullableset<letterset<GenSet> > vcsn::meet	(	const nullableset< letterset< GenSet >> &	lhs,
		const letterset< GenSet > &	rhs
	)

Definition at line 748 of file nullableset.hh.

meet() [11/11]

template<typename Lls , typename Rls >

nullableset<meet_t<Lls, Rls> > vcsn::meet	(	const nullableset< Lls > &	lhs,
		const nullableset< Rls > &	rhs
	)

Definition at line 752 of file nullableset.hh.

minimize() [1/8]

template<Automaton Aut, typename Tag >

auto vcsn::minimize	(	const Aut &	a,
		Tag
	)		-> quotient_t<Aut>

Minimization via the minimizer functors.

Template Parameters

Aut	the input automaton type.
Tag	the requested algorithm: moore_tag, signature_tag, weighted_tag.

Definition at line 24 of file minimize.hh.

References minimize(), and quotient().

Here is the call graph for this function:

minimize() [2/8]

template<Automaton Aut>

std::enable_if_t<is_free_boolean<Aut>), quotient_t<Aut> > vcsn::minimize	(	const Aut &	a,
		hopcroft_tag
	)

Definition at line 28 of file minimize-hopcroft.hh.

References bitset, vcsn::detail::ctx, vcsn::detail::in(), label_of(), make_context(), vcsn::detail::make_polynomialset(), vcsn::detail::make_vector(), quotient(), res, vcsn::rat::size(), vcsn::detail::states_size(), and vcsn::detail::transform().

Here is the call graph for this function:

minimize() [3/8]

template<Automaton Aut>

auto vcsn::minimize	(	const Aut &	a,
		brzozowski_tag
	)		-> std::enable_if_t<is_free_boolean<Aut>(), determinized_automaton<codeterminized_automaton<Aut>, wet_kind_t::bitset>>

Brzozowski-based minimization.

Definition at line 30 of file minimize-brzozowski.hh.

References codeterminize(), and determinize().

Referenced by cominimize(), minimize(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

minimize() [4/8]

template<Automaton Aut>

std::enable_if_t<std::is_same<weightset_t_of<Aut>, b>::value, quotient_t<Aut> > vcsn::minimize	(	const Aut &	a,
		auto_tag	= {}
	)

Minimization for Boolean automata: auto_tag.

Definition at line 35 of file minimize.hh.

References minimize().

Here is the call graph for this function:

minimize() [5/8]

template<Automaton Aut>

std::enable_if_t<!std::is_same<weightset_t_of<Aut>, b>::value, quotient_t<Aut> > vcsn::minimize	(	const Aut &	a,
		auto_tag	= {}
	)

Minimization for non Boolean automata: auto_tag..

Definition at line 44 of file minimize.hh.

References minimize().

Here is the call graph for this function:

minimize() [6/8]

template<Automaton Aut>

std::enable_if_t<is_free_boolean<Aut>), quotient_t<Aut> > vcsn::minimize	(	const Aut &	a,
		const std::string &	algo
	)

Minimization for Boolean automata on a free labelset: algo selection.

Parameters

a	the automaton
algo	the algorithm to run.

Definition at line 56 of file minimize.hh.

References minimize().

Here is the call graph for this function:

minimize() [7/8]

template<Automaton Aut>

std::enable_if_t<std::is_same<weightset_t_of<Aut>, b>::value && !labelset_t_of<Aut>::is_free(), quotient_t<Aut> > vcsn::minimize	(	const Aut &	a,
		const std::string &	algo
	)

Minimization for Boolean automata on a non-free labelset: algo selection.

Parameters

a	the automaton
algo	the algorithm to run.

Definition at line 83 of file minimize.hh.

References minimize().

Here is the call graph for this function:

minimize() [8/8]

template<Automaton Aut>

std::enable_if_t<!std::is_same<weightset_t_of<Aut>, b>::value, quotient_t<Aut> > vcsn::minimize	(	const Aut &	a,
		const std::string &	algo
	)

Minimization for non Boolean automata: algo selection.

Parameters

a	the automaton
algo	the algorithm to run.

Definition at line 105 of file minimize.hh.

References minimize().

Here is the call graph for this function:

multiply() [1/4]

template<Automaton Aut1, Automaton Aut2, typename Tag = general_tag>

auto vcsn::multiply	(	const Aut1 &	lhs,
		const Aut2 &	rhs,
		Tag	tag = {}
	)		-> decltype(lhs->null_state(), rhs->null_state(), detail::make_join_automaton(tag, lhs, rhs))

Concatenate two automata, general case.

Definition at line 151 of file multiply.hh.

References copy_into(), vcsn::detail::make_join_automaton(), multiply_here(), and res.

Referenced by vcsn::automatonset< context_t_of< automaton_t >, tag_t >::mul(), vcsn::rat::split_visitor< ExpSet >::multiply(), vcsn::dyn::multiply(), vcsn::dyn::detail::multiply_expression(), vcsn::dyn::detail::multiply_repeated(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::power(), vcsn::ctx::detail::register_automaton_functions(), and vcsn::rat::split_visitor< ExpSet >::VCSN_RAT_VISIT().

Here is the call graph for this function:

multiply() [2/4]

template<Automaton Aut, typename Tag = general_tag>

auto vcsn::multiply	(	const Aut &	aut,
		to	exp,
		Tag	tag = {}
	)		-> decltype(aut->null_state(), detail::make_join_automaton(tag, aut))

Repeated concatenation of an automaton.

Parameters

aut	the automaton
exp	the exponents
tag	tag for dispatch

Definition at line 207 of file multiply.hh.

References vcsn::dyn::detail::add(), copy_into(), vcsn::detail::make_join_automaton(), vcsn::to::max, vcsn::to::min, vcsn::dyn::detail::multiply(), res, vcsn::dyn::detail::star(), and vcsn::dyn::detail::strip().

Here is the call graph for this function:

multiply() [3/4]

template<typename ValueSet >

ValueSet::value_t vcsn::multiply	(	const ValueSet &	vs,
		const typename ValueSet::value_t &	lhs,
		const typename ValueSet::value_t &	rhs
	)

Product (concatenation) of expressions/labels/polynomials/weights.

Definition at line 281 of file multiply.hh.

multiply() [4/4]

template<typename ValueSet >

auto vcsn::multiply	(	const ValueSet &	vs,
		const typename ValueSet::value_t &	v,
		const to &	exp
	)		-> std::enable_if_t<!has_add_mem_fn<ValueSet>

Repeated multiplication of values that cannot be added.

Repeated multiplication of values that can be added.

Parameters

vs	the valueset
v	the value
exp	the exponent, single.
vs	the valueset
v	the value
exp	the exponent, composed of: min the minimum number. If -1, denotes 0. max the maximum number. If -1, denotes infinity, using star. If -2, denotes the same value as min.

Definition at line 346 of file multiply.hh.

References vcsn::to::finite(), res, vcsn::to::single(), v, and VCSN_REQUIRE.

Referenced by vcsn::dyn::detail::multiply_expression_repeated(), vcsn::dyn::detail::multiply_label_repeated(), vcsn::dyn::detail::multiply_weight(), and vcsn::dyn::detail::multiply_weight_repeated().

Here is the call graph for this function:

multiply_here() [1/3]

template<Automaton Aut1, Automaton Aut2>

Aut1& vcsn::multiply_here	(	Aut1 &	res,
		const Aut2 &	b,
		deterministic_tag
	)

Append automaton b to res.

Precondition

The context of res must include that of b.

The context of res is free.

Postcondition

The result is a deterministic automaton.

Definition at line 34 of file multiply.hh.

References determinize(), and res.

Referenced by multiply().

Here is the call graph for this function:

multiply_here() [2/3]

template<Automaton Aut1, Automaton Aut2>

Aut1& vcsn::multiply_here	(	Aut1 &	res,
		const Aut2 &	b,
		general_tag
	)

Append automaton b to res for non standard automata.

Precondition

The context of res must include that of b.

Definition at line 48 of file multiply.hh.

References copy(), vcsn::detail::final_transitions(), vcsn::detail::initial_transitions(), make_copier(), vcsn::detail::make_vector(), and res.

Here is the call graph for this function:

multiply_here() [3/3]

template<Automaton Aut1, Automaton Aut2>

Aut1& vcsn::multiply_here	(	Aut1 &	res,
		const Aut2 &	b,
		standard_tag	= {}
	)

Append automaton b to res.

Precondition

The context of res must include that of b.

Definition at line 89 of file multiply.hh.

References vcsn::detail::all_out(), copy(), vcsn::detail::final_transitions(), vcsn::detail::in(), vcsn::detail::initial_transitions(), make_copier(), vcsn::detail::make_vector(), and res.

Here is the call graph for this function:

normalize() [1/2]

template<Automaton Aut>

auto vcsn::normalize

(

const Aut &

a

)

-> decltype(copy(a))

Normalize automaton a.

Definition at line 24 of file normalize.hh.

References costandard(), and standard().

Here is the call graph for this function:

normalize() [2/2]

template<typename ExpansionSet >

ExpansionSet::value_t vcsn::normalize	(	const ExpansionSet &	xs,
		typename ExpansionSet::value_t	x
	)

Normalize an expansion.

Definition at line 31 of file normalize-expansion.hh.

Referenced by vcsn::detail::polynomialset_impl< Context, Kind >::complement().

num_accessible_states()

template<Automaton Aut>

size_t vcsn::num_accessible_states

(

const Aut &

a

)

Number of accessible states, not counting pre() and post().

Definition at line 94 of file accessible.hh.

References accessible_states(), has(), and res.

Referenced by info(), is_accessible(), and num_coaccessible_states().

Here is the call graph for this function:

num_coaccessible_states()

template<Automaton Aut>

size_t vcsn::num_coaccessible_states

(

const Aut &

a

)

Number of accessible states, not counting pre() and post().

Definition at line 109 of file accessible.hh.

References num_accessible_states(), and transpose().

Referenced by info(), and is_coaccessible().

Here is the call graph for this function:

num_codeterministic_states()

template<Automaton Aut>

size_t vcsn::num_codeterministic_states

(

const Aut &

aut

)

Number of non-deterministic states of transposed automaton.

Definition at line 47 of file is-deterministic.hh.

References num_deterministic_states(), and transpose().

Referenced by info().

Here is the call graph for this function:

num_components() [1/2]

template<Automaton Aut>

std::size_t vcsn::num_components

(

const scc_automaton< Aut > &

aut

)

Get number of strongly connected components.

Definition at line 722 of file scc.hh.

Referenced by info().

num_components() [2/2]

template<Automaton Aut>

std::size_t vcsn::num_components

(

const Aut &

)

Definition at line 728 of file scc.hh.

num_deterministic_states()

template<Automaton Aut>

size_t vcsn::num_deterministic_states

(

const Aut &

aut

)

Number of non-deterministic states.

Definition at line 33 of file is-deterministic.hh.

References is_deterministic(), and res.

Referenced by info(), and num_codeterministic_states().

Here is the call graph for this function:

num_tapes() [1/2]

template<typename Ctx >

constexpr auto vcsn::num_tapes

(

)

-> size_t

Definition at line 14 of file num-tapes.hh.

Referenced by vcsn::dyn::num_tapes(), and vcsn::ctx::detail::register_functions().

num_tapes() [2/2]

template<typename Ctx >

constexpr auto vcsn::num_tapes

(

const Ctx &

)

-> size_t

Definition at line 22 of file num-tapes.hh.

num_useful_states()

template<Automaton Aut>

size_t vcsn::num_useful_states

(

const Aut &

a

)

Number of accessible states, not counting pre() and post().

Definition at line 117 of file accessible.hh.

References has(), res, and useful_states().

Referenced by info(), is_trim(), and is_useless().

Here is the call graph for this function:

open_input_file()

std::shared_ptr< std::istream > vcsn::open_input_file

(

const std::string &

file

)

Open file for reading and return its autoclosing stream.

Parameters

file	the file name. "-" and "" denote stdin.

Exceptions

std::runtime_error

on failure.

Definition at line 193 of file stream.cc.

References res, and VCSN_REQUIRE.

Referenced by fail_reading().

open_output_file()

std::shared_ptr< std::ostream > vcsn::open_output_file

(

const std::string &

file

)

Open file for writing and return its autoclosing stream.

Parameters

file	the file name. "-" and "" denote stdout.

Exceptions

std::runtime_error

on failure.

Definition at line 208 of file stream.cc.

References res, and VCSN_REQUIRE.

Referenced by fail_reading().

operator<()

bool vcsn::operator< ( empty_t  , empty_t    )

inline

Definition at line 14 of file empty.hh.

operator<<() [1/6]

std::ostream & vcsn::operator<<	(	std::ostream &	os,
		direction	d
	)

Pretty-printing.

Definition at line 19 of file direction.cc.

References to_string().

Here is the call graph for this function:

operator<<() [2/6]

std::ostream & vcsn::operator<< ( std::ostream &  o, const iomanipulator &  g  )

inline

Launch the iomanipulator action on o.

Call the operator() of g(so set, get or swap the xalloced data with data_).

Definition at line 14 of file xalloc.hxx.

operator<<() [3/6]

std::ostream & vcsn::operator<<	(	std::ostream &	os,
		const signature &	sig
	)

Output a string, escaping special characters.

Definition at line 17 of file signature.cc.

References os, and vcsn::signature::sig.

operator<<() [4/6]

std::ostream& vcsn::operator<< ( std::ostream &  o, const to &  t  )

inline

Definition at line 72 of file to.hh.

References vcsn::to::max, and vcsn::to::min.

operator<<() [5/6]

std::ostream & vcsn::operator<<	(	std::ostream &	os,
		format	i
	)

Output in string form.

Definition at line 46 of file format.cc.

References to_string().

Here is the call graph for this function:

operator<<() [6/6]

std::ostream & vcsn::operator<< ( std::ostream &  o, const file_library &  l  )

inline

Print l on o.

Definition at line 102 of file file-library.hxx.

References vcsn::file_library::dump().

Here is the call graph for this function:

operator==()

bool vcsn::operator== ( empty_t  , empty_t    )

inline

Definition at line 21 of file empty.hh.

operator>>() [1/2]

std::istream & vcsn::operator>>	(	std::istream &	is,
		direction &	d
	)

Parsing.

Definition at line 24 of file direction.cc.

References backward, eat(), fail_reading(), and forward.

Here is the call graph for this function:

operator>>() [2/2]

std::istream & vcsn::operator>>	(	std::istream &	is,
		format &	i
	)

Read from string form.

Definition at line 51 of file format.cc.

References vcsn::format::format().

Here is the call graph for this function:

pair()

template<Automaton Aut>

pair_automaton<Aut> vcsn::pair	(	const Aut &	aut,
		bool	keep_initials = false
	)

Definition at line 252 of file pair.hh.

Referenced by vcsn::rat::expressionset_impl< Context >::as_tupleset(), vcsn::detail::epsilon_remover< Aut, has_one >::in_situ_remover_(), vcsn::ctx::detail::register_automaton_functions(), vcsn::detail::epsilon_remover_separate< transpose_in_automaton_t >::remover_on(), and ss_shortest_distance().

partial_identity()

template<Automaton Aut>

fresh_automaton_t_of<Aut, partial_identity_context_t_of<Aut> > vcsn::partial_identity

(

const Aut &

aut

)

Create a partial identity transducer from aut.

Definition at line 40 of file partial-identity.hh.

References vcsn::detail::all_transitions(), vcsn::detail::map(), res, and vcsn::detail::states_size().

Here is the call graph for this function:

path_monomial()

template<Automaton Aut>

auto vcsn::path_monomial	(	const Aut &	aut,
		const predecessors_t_of< Aut > &	path,
		state_t_of< Aut >	src = Aut::element_type::pre(),
		state_t_of< Aut >	dst = Aut::element_type::post()
	)		-> boost::optional<typename detail::word_polynomialset_t<context_t_of<Aut>>::monomial_t>

Given a path (typically computed by lightest_path), the corresponding monomial (label, weight).

Returns

boost::none if there is no path from src to dst.

Definition at line 76 of file lightest-path.hh.

References vcsn::detail::make_word_polynomialset().

Referenced by lightest(), vcsn::detail::yen_impl< Aut, ValueSet, Mul, GetValue >::operator()(), and weight_series().

Here is the call graph for this function:

paths_ibfs()

template<Automaton Aut>

std::unordered_map<state_t_of<Aut>, std::pair<unsigned, transition_t_of<Aut> > > vcsn::paths_ibfs	(	const Aut &	aut,
		const std::vector< state_t_of< Aut >> &	start
	)

Find the shortest paths from some states to all the states.

Parameters

aut	the automaton to traverse.
start	the states from which we reach the order states.

Returns

a map that, for each state, gives a pair: the shortest distance to its parent, and the transition id that allows to reach it.

Definition at line 72 of file distance.hh.

References vcsn::detail::all_in(), and vcsn::detail::make_queue().

Referenced by vcsn::detail::word_synchronizer< Aut >::init_pair().

Here is the call graph for this function:

prefix()

template<Automaton Aut>

auto vcsn::prefix

(

const Aut &

aut

)

-> decltype(::vcsn::copy(aut))

Definition at line 69 of file prefix.hh.

References copy(), prefix_here(), and res.

Referenced by vcsn::ast::context_parser::automaton_(), and vcsn::detail::synchronizer< Aut >::get_prefix().

Here is the call graph for this function:

prefix_here()

template<Automaton Aut>

Aut& vcsn::prefix_here

(

Aut &

aut

)

Make all coaccessible states final.

Definition at line 60 of file prefix.hh.

References suffix_here(), and vcsn::dyn::detail::transpose().

Referenced by factor_here(), and prefix().

Here is the call graph for this function:

print() [1/4]

template<typename T , typename Compare , typename Alloc >

std::ostream & vcsn::print	(	const std::set< T, Compare, Alloc > &	set,
		std::ostream &	o
	)

Print with a separator. Meant to help debugging.

Definition at line 35 of file set.hxx.

Referenced by std::hash< set< T, Compare, Alloc > >::operator()().

print() [2/4]

template<Automaton Aut>

std::ostream& vcsn::print	(	const Aut &	aut,
		std::ostream &	out = std::cout,
		const std::string &	fmt = "default"
	)

Definition at line 83 of file print.hh.

References daut(), dot(), efsm(), info(), vcsn::detail::map(), vcsn::detail::out(), and tikz().

Referenced by vcsn::rat::printer< ExpSet >::visit_tuple< Dummy >::print_(), vcsn::dyn::detail::print_expansion(), vcsn::dyn::detail::print_expression(), vcsn::dyn::detail::print_label(), vcsn::dyn::detail::print_polynomial(), vcsn::set_alphabet< L >::print_set(), vcsn::dyn::detail::print_weight(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

print() [3/4]

template<typename ValueSet >

std::ostream& vcsn::print	(	const ValueSet &	vs,
		const typename ValueSet::value_t &	v,
		std::ostream &	o = std::cout,
		format	fmt = {}
	)

Print a value thanks to a valueset.

Applies for expansions, expressions, labels, polynomials, and weights. Beware that because of this, the fmt ought to specify whether to print for labels or for weights.

Definition at line 160 of file print.hh.

print() [4/4]

template<typename Context >

std::ostream& vcsn::print	(	const expressionset< Context > &	rs,
		const typename expressionset< Context >::value_t &	r,
		std::ostream &	o = std::cout,
		const std::string &	fmt = "default"
	)

Print an expression.

Definition at line 189 of file print.hh.

References vcsn::rat::make_dot_printer(), and vcsn::detail::print().

Here is the call graph for this function:

print_set()

vs vcsn::print_set

(

o

)

Referenced by vcsn::detail::synchronized_automaton_impl< Aut >::print_set(), and vcsn::detail::compose_automaton_impl< Lazy, Lhs, Rhs >::print_set().

project()

template<std::size_t Tape, Automaton Aut>

auto vcsn::project

(

const Aut &

aut

)

-> mutable_automaton<detail::project_context<Tape, context_t_of<Aut>>>

Definition at line 18 of file project-automaton.hh.

References copy_into(), make_mutable_automaton(), and res.

Here is the call graph for this function:

proper()

template<Automaton Aut>

auto vcsn::proper	(	const Aut &	aut,
		direction	dir = direction::backward,
		bool	prune = true,
		const std::string &	algo = "auto"
	)		-> fresh_automaton_t_of<Aut, detail::proper_context<context_t_of<Aut>>>

Eliminate spontaneous transitions.

Raise if the input automaton is invalid.

Parameters

aut	the input automaton
dir	whether backward or forward elimination
prune	whether to suppress states becoming inaccessible
algo	how elimination is performed "auto" same as "inplace" "default" same as "inplace" "inplace" eliminate in place "separate" first separate the automaton into spontaneous and proper parts "distance" compute all-pairs distances

Definition at line 244 of file proper.hh.

References backward, BUILTIN_UNREACHABLE, forward, vcsn::detail::make_properer(), and transpose().

Referenced by vcsn::automatonset< context_t_of< automaton_t >, tag_t >::complement(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::ldivide(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::rdivide(), realtime(), vcsn::ctx::detail::register_automaton_functions(), and weight_series().

Here is the call graph for this function:

proper_here()

template<Automaton Aut>

void vcsn::proper_here	(	Aut &	aut,
		direction	dir = direction::backward,
		bool	prune = true,
		const std::string &	algo = "auto"
	)

Eliminate spontaneous transitions in place.

Raise if the automaton was not valid.

Parameters

aut	the input automaton
dir	whether backward or forward elimination
prune	whether to suppress states becoming inaccessible
algo	the algorithm to use

Definition at line 278 of file proper.hh.

References backward, forward, vcsn::detail::make_properer(), and transpose().

Here is the call graph for this function:

proper_lazy()

template<Automaton Aut>

auto vcsn::proper_lazy	(	const Aut &	aut,
		direction	dir = direction::backward,
		bool	prune = true
	)		-> lazy_proper_automaton<Aut>

Definition at line 261 of file proper.hh.

References backward, and require().

Referenced by vcsn::dyn::proper().

Here is the call graph for this function:

push_weights()

template<Automaton Aut>

auto vcsn::push_weights

(

const Aut &

aut

)

-> decltype(::vcsn::copy(aut))

The algorithm weight pushing.

1) Calculate shortest distance each state s to final states. 2) Update the weight of each transition by using shortest distance.

Definition at line 44 of file push-weights.hh.

References vcsn::detail::all_transitions(), copy(), res, and shortest_distance_to_finals().

Referenced by vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

quotient()

template<Automaton Aut>

auto vcsn::quotient	(	const Aut &	a,
		typename detail::quotienter< Aut >::class_to_set_t &	cs
	)		-> quotient_t<Aut>

Definition at line 123 of file quotient.hh.

Referenced by minimize().

quotkbaseb()

template<typename Context >

mutable_automaton<Context> vcsn::quotkbaseb	(	const Context &	ctx,
		unsigned	divisor,
		unsigned	base
	)

Build the transducer which accepts a word n representing a number in base "base" and outputs the quotient of the division of n by k.

Definition at line 17 of file quotkbaseb.hh.

References vcsn::detail::ctx, vcsn::detail::make_vector(), require(), res, and VCSN_REQUIRE.

Here is the call graph for this function:

raise()

template<typename... Args>

ATTRIBUTE_NORETURN void vcsn::raise

(

Args &&...

args

)

Raise a runtime_error with the concatenation of args as message.

Definition at line 71 of file raise.hh.

References vcsn::detail::print_(), and vcsn::detail::void.

Referenced by vcsn::detail::xlt_advise::raise().

Here is the call graph for this function:

raise_invalid_value()

template<typename ValueSet , typename... Args>

ATTRIBUTE_NORETURN void vcsn::raise_invalid_value	(	const ValueSet &	vs,
		Args &&...	args
	)

Cannot make a value from this.

Definition at line 227 of file weightset.hh.

Referenced by vcsn::detail::nmin_impl::conv(), vcsn::detail::min_plus_impl< zmin_impl, int >::conv(), vcsn::detail::f2_impl::conv(), vcsn::detail::log_impl::conv(), vcsn::detail::b_impl::conv(), and vcsn::detail::z_impl::conv().

raise_not_starrable()

template<typename WeightSet >

ATTRIBUTE_NORETURN void vcsn::raise_not_starrable	(	const WeightSet &	ws,
		const typename WeightSet::value_t &	w
	)

This value is not starrable.

Definition at line 235 of file weightset.hh.

References to_string().

Referenced by vcsn::detail::min_plus_impl< zmin_impl, int >::star(), vcsn::detail::f2_impl::star(), vcsn::detail::log_impl::star(), vcsn::detail::qmp_impl::star(), vcsn::detail::r_impl::star(), vcsn::detail::z_impl::star(), vcsn::detail::q_impl::star(), vcsn::rat::expressionset_impl< Context >::star(), and vcsn::detail::polynomialset_impl< Context, Kind >::star().

Here is the call graph for this function:

random_automaton()

template<typename Ctx >

mutable_automaton<Ctx> vcsn::random_automaton	(	const Ctx &	ctx,
		unsigned	num_states,
		float	density = 0.1,
		unsigned	num_initial = 1,
		unsigned	num_final = 1,
		boost::optional< unsigned >	max_labels = {},
		float	loop_chance = 0.0,
		const std::string &	weights = ""
	)

Produce a random automaton.

Parameters

ctx	The context of the result.
num_states	The number of states wanted in the automata (>0). All states will be connected, and there will be no dead state. However, some might not be coaccessible.
density	The density of the automata. This is the probability (between 0.0 and 1.0), to add a transition between two states. All states have at least one outgoing transition, so d is considered only when adding the remaining transition. A density of 1 means all states will be connected to each other.
num_initial	The number of initial states wanted (0 <= num_initial <= num_states)
num_final	The number of final states wanted (0 <= num_final <= num_states)
max_labels	The maximum number of labels per transition. Defaults to the number of generators.
loop_chance	The probability (between 0.0 and 1.0) for each state to have a loop.
weights	The specification string (following the format of random_weight) used to generate weights on each transitions.

Definition at line 46 of file random-automaton.hh.

References vcsn::detail::ctx, vcsn::detail::irange(), make_random_engine(), make_random_selector(), random_label(), random_weight(), require(), res, and vcsn::detail::swap().

Referenced by vcsn::dyn::random_automaton().

Here is the call graph for this function:

random_automaton_deterministic()

template<typename Ctx >

mutable_automaton<Ctx> vcsn::random_automaton_deterministic	(	const Ctx &	ctx,
		unsigned	num_states
	)

Definition at line 242 of file random-automaton.hh.

References vcsn::detail::ctx, vcsn::detail::irange(), make_random_engine(), require(), and res.

Referenced by vcsn::dyn::random_automaton_deterministic().

Here is the call graph for this function:

random_expression()

template<typename ExpressionSet >

ExpressionSet::value_t vcsn::random_expression	(	const ExpressionSet &	es,
		const std::string &	param
	)

Generate a random expression.

Definition at line 349 of file random-expression.hh.

References vcsn::detail::make_random_expression_impl().

Here is the call graph for this function:

random_expression_string()

template<typename ExpressionSet >

std::string vcsn::random_expression_string	(	const ExpressionSet &	es,
		const std::string &	param
	)

Generate a random expression string.

Return a string. This allows doing easily constructs that are not possible in the AST in case we want them (i.e [a-z] ranges). Furthermore, the user can then choose the identities they want to apply to the resulting expression.

Definition at line 339 of file random-expression.hh.

References vcsn::detail::make_random_expression_impl().

Referenced by vcsn::detail::random_expression_impl< ExpressionSet, RandomGenerator >::print_tuple_exp_().

Here is the call graph for this function:

random_label() [1/6]

template<typename RandomGenerator = std::default_random_engine>

oneset::value_t vcsn::random_label	(	const oneset &	ls,
		RandomGenerator &	= RandomGenerator()
	)

Random label from oneset.

Definition at line 264 of file oneset.hh.

References vcsn::oneset::one().

Here is the call graph for this function:

random_label() [2/6]

template<typename GenSet , typename RandomGenerator = std::default_random_engine>

wordset<GenSet>::value_t vcsn::random_label	(	const wordset< GenSet > &	ls,
		RandomGenerator &	gen = RandomGenerator()
	)

Random label from wordset.

Definition at line 452 of file wordset.hh.

random_label() [3/6]

template<typename LabelSet , typename RandomGenerator = std::default_random_engine>

LabelSet::value_t vcsn::random_label	(	const LabelSet &	ls,
		RandomGenerator &	gen = RandomGenerator()
	)

Random label from general case such as letterset.

Definition at line 459 of file labelset.hh.

References make_random_selector(), and require().

Here is the call graph for this function:

random_label() [4/6]

template<typename Context , typename RandomGenerator = std::default_random_engine>

expressionset<Context>::value_t vcsn::random_label	(	const expressionset< Context > &	rs,
		RandomGenerator &	gen = RandomGenerator()
	)

Random label from expressionset: limited to a single label.

Definition at line 652 of file expressionset.hh.

Referenced by vcsn::detail::random_expression_impl< ExpressionSet, RandomGenerator >::print_label_(), random_automaton(), and random_label_().

random_label() [5/6]

template<typename LabelSet , typename RandomGenerator = std::default_random_engine>

nullableset<LabelSet>::value_t vcsn::random_label	(	const nullableset< LabelSet > &	ls,
		RandomGenerator &	gen = RandomGenerator()
	)

Random label from nullableset.

Definition at line 769 of file nullableset.hh.

random_label() [6/6]

template<typename... LabelSet, typename RandomGenerator = std::default_random_engine>

tupleset<LabelSet...>::value_t vcsn::random_label	(	const tupleset< LabelSet... > &	ls,
		RandomGenerator &	gen = RandomGenerator()
	)

Random label from tupleset.

Definition at line 1469 of file tupleset.hh.

References random_label_().

Here is the call graph for this function:

random_label_()

template<typename... LabelSet, size_t... I, typename RandomGenerator = std::default_random_engine>

tupleset<LabelSet...>::value_t vcsn::random_label_	(	const tupleset< LabelSet... > &	ls,
		RandomGenerator &	gen,
		detail::index_sequence< I... >
	)

Implementation detail for random label from tupleset.

Definition at line 1481 of file tupleset.hh.

References random_label().

Referenced by random_label().

Here is the call graph for this function:

random_weight()

template<typename WeightSet >

WeightSet::value_t vcsn::random_weight	(	const WeightSet &	ws,
		const std::string &	param = {}
	)

Generate a random weight.

Definition at line 15 of file random-weight.hh.

References make_random_engine().

Referenced by random_automaton().

Here is the call graph for this function:

rdivide() [1/2]

template<typename ValueSet >

ValueSet::value_t vcsn::rdivide	(	const ValueSet &	vs,
		const typename ValueSet::value_t &	lhs,
		const typename ValueSet::value_t &	rhs
	)

Right-division of values.

Definition at line 123 of file divide.hh.

rdivide() [2/2]

template<Automaton Aut1, Automaton Aut2>

auto vcsn::rdivide	(	const Aut1 &	a1,
		const Aut2 &	a2
	)

Compute the right quotient.

Parameters

a1	left hand side
a2	right hand side

Definition at line 752 of file conjunction.hh.

References vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::ldivide(), and transpose().

Referenced by vcsn::automatonset< context_t_of< automaton_t >, tag_t >::rdivide(), vcsn::dyn::rdivide(), and vcsn::detail::polynomialset_impl< Context, Kind >::rdivide_here().

Here is the call graph for this function:

read_automaton()

template<Automaton Aut>

Aut vcsn::read_automaton	(	std::istream &	is,
		const std::string &	f = "default"
	)

Static version of the read_automaton function.

Read an automaton with a specified context (from the Aut template parameter).

Parameters

is	the input stream
f	the automaton format

Definition at line 22 of file read-automaton.hh.

References vcsn::dyn::automaton::as(), vcsn::dyn::read_automaton(), res, sname(), VCSN_REQUIRE, vcsn::dyn::automaton::vname(), and vname().

Here is the call graph for this function:

read_label()

template<typename Context >

auto vcsn::read_label	(	const Context &	ctx,
		std::istream &	is,
		bool	quoted = false
	)		-> label_t_of<Context>

Definition at line 16 of file read.hh.

References vcsn::detail::ctx.

Referenced by vcsn::ctx::detail::register_functions().

read_polynomial()

template<typename Context >

auto vcsn::read_polynomial	(	const Context &	ctx,
		std::istream &	is
	)		-> typename polynomialset<Context>::value_t

Definition at line 46 of file read.hh.

References conv(), and vcsn::detail::ctx.

Referenced by vcsn::ctx::detail::register_functions().

Here is the call graph for this function:

read_weight()

template<typename Context >

auto vcsn::read_weight	(	const Context &	ctx,
		std::istream &	is
	)		-> weight_t_of<Context>

Definition at line 76 of file read.hh.

References vcsn::detail::ctx.

Referenced by vcsn::ctx::detail::register_functions().

realtime()

template<Automaton Aut>

auto vcsn::realtime

(

const Aut &

aut

)

-> decltype(proper(::vcsn::letterize(aut)))

Split the word transitions in the input automaton into letter ones, and remove the spontaneous transitions.

Parameters

[in]

aut

the automaton

Returns

the realtime automaton

Definition at line 219 of file letterize.hh.

References letterize(), and proper().

Referenced by are_equivalent().

Here is the call graph for this function:

reduce()

template<Automaton Aut>

auto vcsn::reduce

(

const Aut &

input

)

-> decltype(copy(input))

Definition at line 608 of file reduce.hh.

References left_reduce(), and transpose().

Referenced by are_equivalent(), and vcsn::dyn::reduce().

Here is the call graph for this function:

require()

template<typename Bool , typename... Args>

void vcsn::require	(	Bool	b,
		Args &&...	args
	)

If b is not verified, raise an error with args as message.

Beware that the arguments are, of course, always evaluated. So avoid passing costly function calls. See VCSN_REQUIRE.

Definition at line 87 of file raise.hh.

Referenced by vcsn::edit_automaton< Aut >::add_entry(), add_here(), vcsn::detail::is_ambiguous_impl< Aut >::ambiguous_word(), ambiguous_word(), vcsn::detail::config::value::begin(), cerny(), vcsn::rat::expansionset< expressionset_t >::complement_(), complement_here(), vcsn::rat::to_expansion_visitor< expressionset_t >::compose(), conjugate(), conjunction(), vcsn::oneset::conv(), vcsn::letterset< GenSet >::conv(), vcsn::detail::q_impl::conv(), vcsn::detail::polynomialset_impl< Context, Kind >::conv(), vcsn::detail::conv_label_class_(), vcsn::detail::polynomialset_impl< Context, Kind >::conv_monomial(), de_bruijn(), derivation(), derived_term(), vcsn::dyn::detail::derived_term(), vcsn::detail::word_synchronizer< Aut >::dest_state(), vcsn::detail::dispatch_tags(), divkbaseb(), double_ring(), eliminate_state(), eliminate_state_here(), evaluate(), vcsn::ast::context_parser::expressionset_(), vcsn::rat::expressionset_impl< Context >::expressionset_impl(), vcsn::detail::gcd(), vcsn::detail::config::value::gen_keys(), vcsn::ast::context_parser::genset_(), get_char(), vcsn::detail::are_isomorphic_impl< Aut1, Aut2 >::get_full_response(), vcsn::detail::pair_automaton_impl< Aut >::get_origin(), vcsn::set_alphabet< L >::get_word(), guess_automaton_format(), has_twins_property(), vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::infiltrate(), vcsn::detail::word_synchronizer< Aut >::init_synchro(), is_synchronized_by(), ladybird(), vcsn::rat::expressionset_impl< Context >::letter_class_(), vcsn::detail::z_impl::lgcd(), vcsn::detail::b_impl::lgcd(), vcsn::detail::r_impl::lgcd(), vcsn::detail::q_impl::lgcd(), lightest(), lightest_automaton(), lightest_path(), vcsn::detail::standard_operations< Aut >::lweight_here(), vcsn::dyn::make_automaton(), make_context(), vcsn::dyn::make_expression(), vcsn::rat::driver::make_label(), vcsn::dyn::make_label(), vcsn::dyn::make_polynomial(), vcsn::rat::driver::make_weight(), vcsn::dyn::make_weight(), vcsn::detail::minimizer< Aut, moore_tag >::minimizer(), vcsn::detail::minimizer< Aut, weighted_tag >::minimizer(), vcsn::detail::minimizer< Aut, signature_tag >::minimizer(), vcsn::detail::lightest_impl< Aut >::operator()(), vcsn::detail::state_eliminator< Aut, Profiler >::operator()(), vcsn::detail::config::value::operator[](), vcsn::detail::are_isomorphic_impl< Aut1, Aut2 >::origins(), vcsn::detail::dot::driver::parse(), proper_lazy(), vcsn::detail::properer< Aut >::proper_star_(), vcsn::detail::properer< Aut >::proper_star_here_(), quotkbaseb(), random_automaton(), random_automaton_deterministic(), random_label(), vcsn::detail::min_plus_impl< zmin_impl, int >::rdivide(), vcsn::detail::f2_impl::rdivide(), vcsn::detail::log_impl::rdivide(), vcsn::detail::qmp_impl::rdivide(), vcsn::detail::z_impl::rdivide(), vcsn::detail::r_impl::rdivide(), vcsn::detail::b_impl::rdivide(), vcsn::detail::q_impl::rdivide(), vcsn::dyn::read_fado(), vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::shuffle(), star_here(), vcsn::to::to(), and u().

resetindent()

std::ostream & vcsn::resetindent

(

std::ostream &

o

)

Reset the indentation.

Definition at line 34 of file indent.cc.

References vcsn::detail::indentation.

reverse_postorder()

template<Automaton Aut>

std::vector<state_t_of<Aut> > vcsn::reverse_postorder

(

const Aut &

aut

)

Get all states in reverse postorder.

Definition at line 102 of file scc.hh.

References vcsn::detail::reverse_postorder_impl< Aut >::reverse_post().

Referenced by vcsn::detail::scc_impl< Aut, kosaraju_tag >::scc_impl().

Here is the call graph for this function:

rweight() [1/2]

template<Automaton Aut, typename Tag = auto_tag>

fresh_automaton_t_of<Aut> vcsn::rweight	(	const Aut &	aut,
		const weight_t_of< Aut > &	w,
		Tag	tag = {}
	)

Right-multiplication of an automaton by a weight.

Definition at line 329 of file weight.hh.

References copy(), res, and vcsn::detail::standard_operations< Aut >::rweight_here().

Here is the call graph for this function:

rweight() [2/2]

template<typename ValueSet >

ValueSet::value_t vcsn::rweight	(	const ValueSet &	rs,
		const typename ValueSet::value_t &	r,
		const weight_t_of< ValueSet > &	w
	)

Definition at line 388 of file weight.hh.

Referenced by vcsn::dyn::detail::rweight_expansion(), vcsn::dyn::detail::rweight_expression(), and vcsn::dyn::detail::rweight_polynomial().

rweight_here()

template<Automaton Aut, typename Tag = auto_tag>

Aut& vcsn::rweight_here	(	Aut &	res,
		const weight_t_of< Aut > &	w,
		Tag	tag = {}
	)

In place right-multiplication of an automaton by a weight.

Definition at line 321 of file weight.hh.

References vcsn::detail::standard_operations< Aut >::rweight_here().

Referenced by vcsn::dyn::detail::rweight_tag().

Here is the call graph for this function:

same_domain()

template<typename Container >

bool vcsn::same_domain	(	const Container &	x,
		const Container &	y
	)

Check that two associative containers have the same keys.

Definition at line 249 of file algorithm.hh.

scc()

template<Automaton Aut>

scc_automaton<Aut> vcsn::scc	(	const Aut &	aut,
		const std::string &	algo = "auto"
	)

Get scc_automaton from aut.

Definition at line 697 of file scc.hh.

Referenced by vcsn::detail::scc_impl< Aut, dijkstra_tag >::dfs(), and info().

scc_algo()

scc_algo_t vcsn::scc_algo ( const std::string &  algo )

inline

Definition at line 519 of file scc.hh.

References auto_, dijkstra, kosaraju, vcsn::detail::map(), tarjan_iterative, and tarjan_recursive.

Here is the call graph for this function:

set_difference()

template<typename Container , typename = typename Container::value_type>

Container vcsn::set_difference	(	const Container &	s1,
		const Container &	s2
	)

The set of members of s1 that are not members of s2.

Definition at line 225 of file algorithm.hh.

References res.

Referenced by vcsn::detail::conv_label_class_().

set_intersection() [1/2]

template<typename Key , typename Hash , typename KeyEqual , typename Alloc >

std::unordered_set<Key, Hash, KeyEqual, Alloc> vcsn::set_intersection	(	const std::unordered_set< Key, Hash, KeyEqual, Alloc > &	s1,
		const std::unordered_set< Key, Hash, KeyEqual, Alloc > &	s2
	)

Intersection of s1 and s2.

Definition at line 45 of file unordered_set.hh.

References has(), and res.

Here is the call graph for this function:

set_intersection() [2/2]

template<typename Container , typename = typename Container::value_type>

Container vcsn::set_intersection	(	const Container &	s1,
		const Container &	s2
	)

The intersection of two sets.

Definition at line 238 of file algorithm.hh.

References res.

Referenced by intersection_closure(), and useful_states().

set_union()

template<typename Container , typename = typename Container::value_type>

Container vcsn::set_union	(	const Container &	s1,
		const Container &	s2
	)

The union of two sets.

Definition at line 271 of file algorithm.hh.

References res.

shortest() [1/2]

template<Automaton Aut>

detail::enumerater<Aut>::polynomial_t vcsn::shortest	(	const Aut &	aut,
		boost::optional< unsigned >	num = {},
		boost::optional< unsigned >	len = {}
	)

The approximated behavior of an automaton.

Parameters

aut	the automaton whose behavior to approximate
num	number of words looked for.
len	maximum length of words looked for.

Definition at line 279 of file shortest.hh.

References vcsn::detail::enumerater< Aut >::enumerater().

Referenced by vcsn::detail::is_ambiguous_impl< Aut >::ambiguous_word(), enumerate(), vcsn::ctx::detail::register_automaton_functions(), and vcsn::dyn::shortest().

Here is the call graph for this function:

shortest() [2/2]

template<Automaton Aut>

detail::enumerater<Aut>::polynomial_t vcsn::shortest	(	const Aut &	aut,
		state_t_of< Aut >	src,
		state_t_of< Aut >	dst
	)

The approximated behavior of a part of an automaton (looks for one word of unspecified length).

Parameters

aut	the automaton whose behavior to approximate
src	the starting state of the calculation
dst	the ending state of the calculation.

Definition at line 295 of file shortest.hh.

References vcsn::detail::enumerater< Aut >::enumerater().

Here is the call graph for this function:

shortest_distance_to_finals() [1/2]

template<Automaton Aut>

weight_t_of<Aut> vcsn::shortest_distance_to_finals	(	Aut	aut,
		state_t_of< Aut >	s0
	)

Find shorhest of s0 to the final states of aut by using single source shortest distance.

Definition at line 18 of file push-weights.hh.

References ss_shortest_distance().

Referenced by push_weights(), and shortest_distance_to_finals().

Here is the call graph for this function:

shortest_distance_to_finals() [2/2]

template<Automaton Aut>

std::unordered_map<state_t_of<Aut>, weight_t_of<Aut> > vcsn::shortest_distance_to_finals

(

Aut

aut

)

Find all shortest distances of each state to the final states of aut.

Definition at line 28 of file push-weights.hh.

References res, and shortest_distance_to_finals().

Here is the call graph for this function:

shuffle() [1/2]

template<typename ValueSet >

ValueSet::value_t vcsn::shuffle	(	const ValueSet &	vs,
		const typename ValueSet::value_t &	lhs,
		const typename ValueSet::value_t &	rhs
	)

Shuffle product of values.

Definition at line 17 of file shuffle-expression.hh.

shuffle() [2/2]

template<Automaton... Auts>

auto vcsn::shuffle

(

const Auts &...

as

)

-> tuple_automaton<decltype(join_automata(as...)), Auts...>

The (accessible part of the) shuffle product.

Definition at line 783 of file conjunction.hh.

References vcsn::detail::join_automata(), and res.

Referenced by vcsn::dyn::detail::shuffle_(), and vcsn::dyn::detail::shuffle_value().

Here is the call graph for this function:

skip_space()

void vcsn::skip_space

(

std::istream &

is

)

Ignore spaces.

Parameters

is	the stream to read.

Definition at line 222 of file stream.cc.

Referenced by vcsn::ast::context_parser::eat_(), fail_reading(), vcsn::ast::context_parser::peek_(), and vcsn::ast::context_parser::word_().

sname() [1/2]

template<typename T >

symbol vcsn::sname

(

)

Definition at line 65 of file name.hh.

References vcsn::snamer< T >::name().

Referenced by vcsn::dyn::make_context(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::print_set(), read_automaton(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::sname(), vcsn::detail::genset_labelset< GenSet >::sname(), vcsn::detail::expression_automaton_impl< Aut >::sname(), vcsn::set_alphabet< L >::sname(), vcsn::detail::permutation_automaton_impl< Aut >::sname(), vcsn::detail::name_automaton_impl< Aut >::sname(), vcsn::detail::lazy_proper_automaton_impl< Aut, has_one >::sname(), vcsn::rat::expansionset< expressionset_t >::sname(), vcsn::detail::insplit_automaton_impl< Aut >::sname(), vcsn::detail::partition_automaton_impl< Aut >::sname(), vcsn::detail::transpose_automaton_impl< Aut >::sname(), vcsn::context< Tape, full_context_t >::sname(), vcsn::detail::delay_automaton_impl< Aut >::sname(), vcsn::detail::determinized_automaton_impl< Aut, Kind, Lazy >::sname(), vcsn::detail::filter_automaton_impl< Aut, Trans >::sname(), vcsn::rat::expressionset_impl< Context >::sname(), vcsn::detail::synchronized_automaton_impl< Aut >::sname(), vcsn::detail::polynomialset_impl< Context, Kind >::sname(), vcsn::detail::focus_automaton_impl< Tape, Aut >::sname(), vcsn::detail::mutable_automaton_impl< Context >::sname(), vcsn::detail::pair_automaton_impl< Aut >::sname(), vcsn::detail::compose_automaton_impl< Lazy, Lhs, Rhs >::sname(), vcsn::detail::derived_term_automaton_impl< ExpSet >::sname(), vcsn::nullableset< LabelSet >::sname(), vcsn::detail::scc_automaton_impl< Aut >::sname(), vcsn::detail::tuple_automaton_impl< Aut, Auts >::sname_(), and vcsn::detail::tupleset_impl< ValueSets >::sname_().

Here is the call graph for this function:

sname() [2/2]

template<typename T >

symbol vcsn::sname

(

T &

)

Definition at line 71 of file name.hh.

Referenced by vcsn::snamer< T >::name().

sort()

template<Automaton Aut>

auto vcsn::sort

(

const Aut &

a

)

-> permutation_automaton<Aut>

Definition at line 161 of file sort.hh.

Referenced by vcsn::detail::printer< Aut >::finals_(), vcsn::detail::config::value::gen_keys(), vcsn::detail::printer< Aut >::initials_(), vcsn::detail::are_isomorphic_impl< Aut1, Aut2 >::make_state_classes(), vcsn::detail::minimizer< Aut, signature_tag >::minimizer(), vcsn::detail::printer< Aut >::print_state_(), vcsn::detail::efsmer< Aut >::print_transitions_(), vcsn::ctx::detail::register_automaton_functions(), vcsn::dyn::detail::Registry< Fun >::signatures(), and vcsn::detail::quotienter< Aut >::sort_classes_().

split() [1/2]

template<typename ExpSet >

rat::expression_polynomial_t<ExpSet> vcsn::split	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	e
	)

Split an expression.

Definition at line 227 of file split.hh.

Referenced by vcsn::detail::derived_term_automaton_impl< ExpSet >::complete_via_expansion_(), configuration(), derivation(), vcsn::detail::derived_term_automaton_impl< ExpSet >::init_(), vcsn::rat::split_visitor< ExpSet >::multiply(), vcsn::rat::split_visitor< ExpSet >::operator()(), vcsn::ctx::detail::register_expression_functions(), and split_polynomial().

split() [2/2]

template<typename ExpSet >

rat::expression_polynomial_t<ExpSet> vcsn::split	(	const ExpSet &	rs,
		const rat::expression_polynomial_t< ExpSet > &	p
	)

Split a polynomial of expressions, given the expressionset.

Definition at line 267 of file split.hh.

References vcsn::rat::make_expression_polynomialset(), and split_polynomial().

Here is the call graph for this function:

split_polynomial()

template<typename PolynomialSet >

PolynomialSet::value_t vcsn::split_polynomial	(	const PolynomialSet &	ps,
		const typename PolynomialSet::value_t &	p
	)

Split a polynomial of expressions, given the polynomialset.

Definition at line 253 of file split.hh.

References label_of(), res, split(), and weight_of().

Referenced by split().

Here is the call graph for this function:

ss_shortest_distance()

template<Automaton Aut>

std::vector<weight_t_of<Aut> > vcsn::ss_shortest_distance	(	const Aut &	aut,
		state_t_of< Aut >	s0
	)

Single source shortest distance.

Find shortest (weighted) path from state s0 to all states of automaton aut.

Definition at line 28 of file distance.hh.

References vcsn::detail::all_out(), has(), vcsn::weightset_mixin< WeightSet >::mul(), pair(), and vcsn::detail::states_size().

Referenced by shortest_distance_to_finals().

Here is the call graph for this function:

ssignature()

template<typename... Args>

signature vcsn::ssignature ( )

inline

Static signature.

Definition at line 80 of file name.hh.

standard() [1/2]

template<Automaton Aut>

auto vcsn::standard

(

const Aut &

aut

)

Definition at line 116 of file standard.hh.

References vcsn::dyn::detail::copy(), res, and standard_here().

Referenced by vcsn::automatonset< context_t_of< automaton_t >, tag_t >::ldivide(), normalize(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::rdivide(), vcsn::ctx::detail::register_automaton_functions(), and vcsn::automatonset< context_t_of< automaton_t >, tag_t >::transposition().

Here is the call graph for this function:

standard() [2/2]

template<Automaton Aut, typename ExpSet >

Aut vcsn::standard	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	r
	)

Build a standard automaton from an expression.

Template Parameters

Aut	relative to the generated automaton.
ExpSet	relative to the expression.

Definition at line 392 of file standard.hh.

Referenced by vcsn::dyn::standard().

standard_here()

template<Automaton Aut>

void vcsn::standard_here

(

Aut &

aut

)

Turn aut into a standard automaton.

Template Parameters

Aut	an automaton type, not a pointer type.

Definition at line 80 of file standard.hh.

References vcsn::detail::all_in(), vcsn::detail::all_out(), vcsn::detail::initial_transitions(), and vcsn::dyn::detail::is_standard().

Referenced by standard(), and star_here().

Here is the call graph for this function:

star()

template<Automaton Aut, typename Tag = general_tag>

auto vcsn::star	(	const Aut &	aut,
		Tag	tag = {}
	)		-> decltype(detail::make_join_automaton(tag, aut))

Star of an automaton.

Definition at line 108 of file star.hh.

References copy_into(), vcsn::detail::make_join_automaton(), res, and star_here().

Referenced by vcsn::dyn::star().

Here is the call graph for this function:

star_height()

template<typename ExpSet >

unsigned vcsn::star_height	(	const ExpSet &	es,
		const typename ExpSet::value_t &	e
	)

Star height of an expression.

Definition at line 146 of file star-height.hh.

Referenced by vcsn::ctx::detail::register_expression_functions(), and vcsn::detail::star_height_visitor< ExpSet >::visit_tuple< bool, Dummy >::tape_().

star_here() [1/3]

template<Automaton Aut>

Aut& vcsn::star_here	(	Aut &	res,
		general_tag	= {}
	)

In-place star of an automaton.

Definition at line 23 of file star.hh.

References vcsn::detail::final_transitions(), vcsn::detail::initial_transitions(), vcsn::detail::make_vector(), and res.

Referenced by star(), and star_here().

Here is the call graph for this function:

star_here() [2/3]

template<Automaton Aut>

Aut& vcsn::star_here	(	Aut &	res,
		standard_tag
	)

In-place star of a standard automaton.

See standard_visitor::visit(star).

Standard algorithm requires standard automaton because there is a problem with "final weight of the initial state" if the automaton has several initial states. Indeed we cannot preserve several initial states since (a+b) is not equal to (a*+b*)

Definition at line 51 of file star.hh.

References vcsn::detail::final_transitions(), vcsn::detail::front(), vcsn::detail::initial_transitions(), is_standard(), vcsn::detail::out(), require(), and res.

Here is the call graph for this function:

star_here() [3/3]

template<Automaton Aut>

Aut& vcsn::star_here	(	Aut &	res,
		deterministic_tag
	)

In-place star of a deterministic automaton.

Definition at line 94 of file star.hh.

References determinize(), res, standard_here(), and star_here().

Here is the call graph for this function:

star_normal_form()

template<typename ExpSet >

ExpSet::value_t vcsn::star_normal_form	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	e
	)

Star-normal form of an expression.

Definition at line 182 of file star-normal-form.hh.

str()

return o vcsn::str

(

)

Referenced by conv(), and vcsn::detail::lexical_cast().

str_escape() [1/5]

std::ostream & vcsn::str_escape	(	std::ostream &	os,
		const std::string &	str,
		const char *	special = nullptr
	)

Output a string, escaping special characters.

Definition at line 51 of file escape.cc.

Referenced by vcsn::set_alphabet< L >::add_letter(), vcsn::letterset< GenSet >::conv(), vcsn::wordset< GenSet >::conv(), vcsn::detail::dispatch_tags(), vcsn::detail::genset_labelset< GenSet >::get_letter(), vcsn::set_alphabet< L >::get_word(), vcsn::detail::lexical_cast(), vcsn::char_letters::print(), vcsn::string_letters::print(), vcsn::dyn::print(), str_escape(), str_quote(), and synchronizing_word().

str_escape() [2/5]

template<typename T >

std::ostream& vcsn::str_escape	(	std::ostream &	os,
		const std::vector< T > &	s,
		const char *	special = nullptr
	)

A container of letters.

Definition at line 19 of file escape.hh.

References os, and str_escape().

Here is the call graph for this function:

str_escape() [3/5]

std::ostream & vcsn::str_escape	(	std::ostream &	os,
		int	c,
		const char *	special = nullptr
	)

Output a character, escaping special characters.

-1 denotes end-of-file.

Definition at line 13 of file escape.cc.

References os.

str_escape() [4/5]

std::ostream & vcsn::str_escape	(	std::ostream &	os,
		char	c,
		const char *	special = nullptr
	)

Output a character, escaping special characters.

Definition at line 39 of file escape.cc.

References str_escape().

Here is the call graph for this function:

str_escape() [5/5]

template<typename T >

std::string vcsn::str_escape	(	T &&	s,
		const char *	special = nullptr
	)

Convert to a string, escaped.

Definition at line 39 of file escape.hh.

References str_escape().

Here is the call graph for this function:

str_quote()

template<typename... Args>

std::string vcsn::str_quote

(

Args &&...

args

)

Convert to a string, in quotes.

Definition at line 49 of file escape.hh.

References str_escape(), and vcsn::detail::void.

Referenced by vcsn::ast::context_parser::automaton_(), bracketed(), conv(), vcsn::rat::copy(), eat(), fail_reading(), get_char(), vcsn::ast::context_parser::labelset_(), vcsn::ast::context_parser::labelset_or_weightset_(), make_context(), vcsn::dyn::make_expression(), vcsn::dyn::make_label(), vcsn::dyn::make_polynomial(), vcsn::dyn::make_weight(), vcsn::ast::parse_context(), vcsn::ast::parse_type(), vcsn::detail::print_(), and vcsn::ast::context_parser::weightset_().

Here is the call graph for this function:

string_letters::special< string_letters::letter_t >()

template<>

string_letters::letter_t vcsn::string_letters::special< string_letters::letter_t > ( )

inline

Definition at line 292 of file string.hh.

References vcsn::string_letters::special_letter().

Here is the call graph for this function:

string_letters::special< string_letters::word_t >()

template<>

string_letters::word_t vcsn::string_letters::special< string_letters::word_t > ( )

inline

Definition at line 300 of file string.hh.

References vcsn::string_letters::special_letter().

Here is the call graph for this function:

strip()

template<Automaton Aut>

auto vcsn::strip

(

const Aut &

aut

)

Remove (all) the decorations from a decorated automaton.

Definition at line 34 of file strip.hh.

References vcsn::detail::strip().

Here is the call graph for this function:

strong_components() [1/2]

template<Automaton Aut, typename Tag = auto_tag>

const detail::components_t<Aut> vcsn::strong_components	(	const Aut &	aut,
		Tag	= {}
	)

Find all strongly connected components of aut.

Template Parameters

Aut	the automaton type.
Tag	specifies the chosen algorithm.

Definition at line 544 of file scc.hh.

Referenced by has_twins_property(), is_cycle_ambiguous(), is_cycle_ambiguous_scc(), vcsn::detail::scc_automaton_impl< Aut >::scc_automaton_impl(), and strong_components().

strong_components() [2/2]

template<Automaton Aut>

const detail::components_t<Aut> vcsn::strong_components	(	const Aut &	aut,
		scc_algo_t	algo = scc_algo_t::tarjan_iterative
	)

Find all strongly connected components of aut.

Parameters

aut	the input automaton.
algo	specifies the chosen algorithm.

Definition at line 555 of file scc.hh.

References auto_, BUILTIN_UNREACHABLE, dijkstra, kosaraju, strong_components(), tarjan_iterative, and tarjan_recursive.

Here is the call graph for this function:

subset()

template<typename Container >

bool vcsn::subset	(	const Container &	set1,
		const Container &	set2
	)

Whether set1 ⊆ set2.

Definition at line 48 of file set.hxx.

Referenced by std::hash< set< T, Compare, Alloc > >::operator()(), and vcsn::detail::universal_impl< Aut >::work_().

subword()

template<Automaton Aut>

auto vcsn::subword

(

const Aut &

aut

)

-> decltype(make_nullable_automaton(aut->context()))

Apply subword_here() to a copy of aut.

Definition at line 158 of file prefix.hh.

References copy_into(), make_nullable_automaton(), res, and subword_here().

Here is the call graph for this function:

subword_here()

template<Automaton Aut>

Aut& vcsn::subword_here

(

Aut &

aut

)

Add spontaneous transitions for each non spontaneous transition, with same source, destination and weight.

Definition at line 137 of file prefix.hh.

References vcsn::detail::out().

Referenced by subword().

Here is the call graph for this function:

suffix()

template<Automaton Aut>

auto vcsn::suffix

(

const Aut &

aut

)

-> decltype(::vcsn::copy(aut))

Definition at line 29 of file prefix.hh.

References copy(), res, and suffix_here().

Referenced by vcsn::detail::synchronizer< Aut >::get_prefix().

Here is the call graph for this function:

suffix_here()

template<Automaton Aut>

Aut& vcsn::suffix_here

(

Aut &

aut

)

Make all accessible states initial.

Definition at line 17 of file prefix.hh.

References accessible_states().

Referenced by factor_here(), prefix_here(), and suffix().

Here is the call graph for this function:

synchronize()

template<Automaton Aut>

auto vcsn::synchronize

(

const Aut &

aut

)

-> decltype(detail::synchronize(aut))

Synchronize the transducer.

Parameters

[in]

aut

the transducer

Returns

the synchronized transducer

Definition at line 350 of file synchronize.hh.

References vcsn::detail::synchronize().

Here is the call graph for this function:

synchronizing_word()

template<Automaton Aut>

word_t_of<Aut> vcsn::synchronizing_word	(	const Aut &	aut,
		const std::string &	algo = "greedy"
	)

Return a synchronizing word for aut using algo algo.

Definition at line 418 of file synchronizing-word.hh.

References vcsn::detail::word_synchronizer< Aut >::cycle(), vcsn::detail::word_synchronizer< Aut >::fastsynchro(), vcsn::detail::word_synchronizer< Aut >::greedy(), str_escape(), vcsn::detail::word_synchronizer< Aut >::synchroP(), and vcsn::detail::word_synchronizer< Aut >::synchroPL().

Referenced by vcsn::ctx::detail::register_automaton_functions(), and vcsn::dyn::synchronizing_word().

Here is the call graph for this function:

thompson() [1/2]

template<Automaton Aut, typename ExpSet >

Aut vcsn::thompson	(	const context_t_of< Aut > &	ctx,
		const ExpSet &	rs,
		const typename ExpSet::value_t &	r
	)

Build a Thompson automaton from an expression.

Template Parameters

Aut	relative to the generated automaton.
ExpSet	relative to the expression.

Definition at line 190 of file thompson.hh.

References vcsn::rat::ctx().

Referenced by vcsn::ctx::detail::register_expression_functions().

Here is the call graph for this function:

thompson() [2/2]

template<Automaton Aut, typename ExpSet >

Aut vcsn::thompson	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	r
	)

Build a Thompson automaton from an expression.

Template Parameters

Aut	relative to the generated automaton.
ExpSet	relative to the expression.

Definition at line 203 of file thompson.hh.

tikz()

template<Automaton AutPtr>

std::ostream& vcsn::tikz	(	const AutPtr &	aut,
		std::ostream &	out
	)

Print automaton to TikZ format.

Template Parameters

AutPtr

an automaton type.

Definition at line 157 of file tikz.hh.

References vcsn::detail::out().

Referenced by print().

Here is the call graph for this function:

to_automaton()

template<Automaton Aut>

Aut& vcsn::to_automaton	(	const LabelSet &	ls,
		const typename LabelSet::word_t &	w
	)		-> mutable_automaton<>

In place removal of state s from automaton res.

Definition at line 8 of file to-automaton.hh.

to_expansion()

template<typename ExpSet >

rat::expansionset< ExpSet >::value_t vcsn::to_expansion	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	e
	)

First order expansion.

Definition at line 476 of file to-expansion.hh.

References vcsn::rat::to_expansion_visitor< ExpSet >::to_expansion().

Referenced by vcsn::ctx::detail::register_expression_functions(), and vcsn::rat::to_expansion_visitor< ExpSet >::visit_tuple< bool, Dummy >::work_().

Here is the call graph for this function:

to_expression() [1/5]

template<typename ExpansionSet >

ExpansionSet::expression_t vcsn::to_expression	(	const ExpansionSet &	xs,
		const typename ExpansionSet::value_t &	x
	)

The projection of an expansion as an expression.

Parameters

xs	The expansionset.
x	The expansion.

Definition at line 14 of file to-expression-expansion.hh.

References res.

to_expression() [2/5]

template<Automaton Aut, typename Profiler , typename ExpSet = expressionset<context_t_of<Aut>>>

ExpSet::value_t vcsn::to_expression	(	Aut &	a,
		Profiler &	profiler
	)

Definition at line 65 of file to-automaton.hh.

References vcsn::detail::make_state_eliminator().

Referenced by eliminate_state_here(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

to_expression() [3/5]

template<Automaton Aut, typename ExpSet = expressionset<context_t_of<Aut>>>

ExpSet::value_t vcsn::to_expression	(	const Aut &	aut,
		vcsn::rat::identities	ids,
		to_expression_heuristic_t	algo
	)

Definition at line 126 of file to-automaton.hh.

References Automaton, best, delgado, delgado_label, vcsn::rat::ids(), and naive.

Here is the call graph for this function:

to_expression() [4/5]

template<Automaton Aut, typename ExpSet = expressionset<context_t_of<Aut>>>

ExpSet::value_t vcsn::to_expression	(	const Aut &	a,
		vcsn::rat::identities	ids,
		const std::string &	algo
	)

Definition at line 156 of file to-automaton.hh.

References best, delgado, delgado_label, vcsn::rat::ids(), and naive.

Here is the call graph for this function:

to_expression() [5/5]

template<typename ExpressionSet >

ExpressionSet::value_t vcsn::to_expression	(	const ExpressionSet &	rs,
		const letter_class_t &	letters,
		bool	accept = true
	)

An expression matching one letter in a letter class.

Parameters

rs	The expressionset to use.
letters	The letter class as a set of ranges.
accept	Whether to accept these characters ([abc]) as opposed to refusing them ([^abc]).

Definition at line 279 of file to-automaton.hh.

References vcsn::detail::letter_class_impl().

Referenced by vcsn::dyn::to_expression().

Here is the call graph for this function:

to_expression_heuristic()

template<Automaton Aut, typename ExpSet = expressionset<context_t_of<Aut>>>

ExpSet::value_t vcsn::to_expression_heuristic	(	const Aut &	aut,
		vcsn::rat::identities	ids,
		to_expression_heuristic_t	algo
	)

Definition at line 90 of file to-automaton.hh.

References Automaton, best, BUILTIN_UNREACHABLE, delgado, delgado_label, vcsn::dyn::lift(), and naive.

Here is the call graph for this function:

to_spontaneous()

template<Automaton Aut>

auto vcsn::to_spontaneous

(

const Aut &

aut

)

-> std::enable_if_t<!context_t_of<Aut>::is_lao, decltype(make_mutable_automaton(make_context(oneset(), *aut->weightset())))>

Convert to spontaneous automaton: change every transition's label to the empty word.

to_spontaneous specialisation for lao automaton.

The automaton is already spontaneous: we do not need to convert it.

input state -> output state.

Definition at line 13 of file to-spontaneous.hh.

References vcsn::detail::all_transitions(), copy(), make_context(), make_mutable_automaton(), and res.

Referenced by weight_series().

Here is the call graph for this function:

to_string() [1/5]

template<typename ValueSet , typename Value = typename ValueSet::value_t, typename... Args>

auto vcsn::to_string	(	const ValueSet &	vs,
		const Value &	v,
		Args &&...	args
	)		-> std::string

Format v via vs.print.

Definition at line 13 of file to-string.hh.

References v.

to_string() [2/5]

std::string vcsn::to_string

(

direction

d

)

Conversion to string.

Definition at line 7 of file direction.cc.

References backward, BUILTIN_UNREACHABLE, and forward.

Referenced by vcsn::detail::polynomialset_impl< Context, Kind >::add_ldivide_here(), vcsn::letterset< GenSet >::conjunction(), vcsn::nullableset< LabelSet >::conjunction(), vcsn::oneset::conv(), vcsn::nullableset< LabelSet >::conv(), expand(), vcsn::detail::qmp_impl::hash(), vcsn::detail::printer< Aut >::label_(), vcsn::letterset< GenSet >::ldivide(), vcsn::nullableset< LabelSet >::ldivide(), vcsn::letterset< GenSet >::lgcd(), vcsn::letterset< GenSet >::maybe_ldivide(), vcsn::letterset< GenSet >::maybe_rdivide(), vcsn::nullableset< LabelSet >::mul(), vcsn::detail::derived_term_automaton_impl< ExpSet >::operator()(), vcsn::rat::standard_visitor< Aut, ExpSet >::operator()(), operator<<(), vcsn::detail::determinized_automaton_impl< Aut, Kind, Lazy >::print_set(), vcsn::detail::daut_impl< Aut >::print_transitions_(), vcsn::detail::dot_impl< Aut >::print_transitions_(), raise_not_starrable(), vcsn::letterset< GenSet >::rdivide(), vcsn::nullableset< LabelSet >::rdivide(), vcsn::detail::polynomialset_impl< Context, Kind >::rdivide(), vcsn::lazy_automaton_editor::result_context(), vcsn::detail::determinized_automaton_impl< Aut, Kind, Lazy >::sname(), and vcsn::detail::polynomialset_impl< Context, Kind >::sub_here().

to_string() [3/5]

template<typename ValueSet >

auto vcsn::to_string

(

const ValueSet &

vs

)

-> decltype(vs.print_set(std::cout), std::string

Format vs via print_set.

Definition at line 24 of file to-string.hh.

to_string() [4/5]

std::string vcsn::to_string

(

format

i

)

Wrapper around operator<<.

Definition at line 28 of file format.cc.

References BUILTIN_UNREACHABLE, vcsn::format::kind(), vcsn::format::latex, vcsn::format::raw, vcsn::format::sname, vcsn::format::text, and vcsn::format::utf8.

Here is the call graph for this function:

to_string() [5/5]

std::string vcsn::to_string ( wet_kind_t  k )

inline

String version of a wet kind.

Definition at line 210 of file wet.hh.

References bitset, BUILTIN_UNREACHABLE, DEFINE, vcsn::detail::map(), and unordered_map.

Here is the call graph for this function:

transpose() [1/3]

template<typename ExpSet >

ExpSet::value_t vcsn::transpose	(	const ExpSet &	rs,
		const typename ExpSet::value_t &	v
	)

An expression that denotes the transposition of v.

Works deeply, contrary to transposition() that merely applies the {T} operator.

Definition at line 223 of file transpose.hh.

transpose() [2/3]

template<Automaton Aut>

Aut vcsn::transpose

(

const transpose_automaton< Aut > &

aut

)

The transpose of a transpose automaton is the original automaton.

Definition at line 253 of file transpose.hh.

Referenced by vcsn::detail::mutable_automaton_impl< Context >::add_transition_copy(), coaccessible_states(), codeterminize(), cominimize(), is_codeterministic(), is_costandard(), num_coaccessible_states(), num_codeterministic_states(), proper(), proper_here(), rdivide(), reduce(), vcsn::ctx::detail::register_automaton_functions(), vcsn::detail::trie_builder< Context, Dir >::result(), vcsn::detail::scc_impl< Aut, kosaraju_tag >::scc_impl(), vcsn::rat::expressionset_impl< Context >::transpose(), vcsn::nullableset< LabelSet >::transpose(), vcsn::detail::polynomialset_impl< Context, Kind >::transpose(), vcsn::detail::tupleset_impl< ValueSets >::transpose_(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::transposition(), vcsn::detail::universal_impl< Aut >::work_(), and vcsn::detail::transpose_impl< ExpSet >::visit_tuple< Dummy >::work_().

transpose() [3/3]

template<Automaton Aut>

transpose_automaton<Aut> vcsn::transpose

(

Aut

aut

)

Transpose of an automaton.

Definition at line 261 of file transpose.hh.

trie() [1/2]

template<typename PolynomialSet >

mutable_automaton<detail::free_context<context_t_of<PolynomialSet> > > vcsn::trie	(	const PolynomialSet &	ps,
		const typename PolynomialSet::value_t &	p
	)

Make a trie-like mutable_automaton for a finite series given as a polynomial.

Parameters

ps	the polynomialset
p	the polynomial that specifies the series.

Definition at line 214 of file trie.hh.

Referenced by vcsn::dyn::trie(), and vcsn::dyn::detail::trie_stream().

trie() [2/2]

template<typename PolynomialSet >

mutable_automaton<detail::free_context<context_t_of<PolynomialSet> > > vcsn::trie	(	const PolynomialSet &	ps,
		std::istream &	is,
		const std::string &	format = "default"
	)

Make a trie-like mutable_automaton for a finite series read from a stream.

Parameters

ps	the polynomialset
is	the stream to read
format	the format of the file: "words" or "monomials"

Definition at line 271 of file trie.hh.

trim()

template<Automaton Aut>

filter_automaton<Aut> vcsn::trim

(

const Aut &

a

)

Useful part of an automaton.

Definition at line 154 of file accessible.hh.

References filter(), and useful_states().

Referenced by has_twins_property(), and vcsn::ctx::detail::register_automaton_functions().

Here is the call graph for this function:

tuple()

template<typename ValueSet , typename... ValueSets>

ValueSet::value_t vcsn::tuple	(	const ValueSet &	vs,
		const typename ValueSets::value_t &...	v
	)

Definition at line 73 of file tuple.hh.

tuple_context()

template<typename... Ctx>

auto vcsn::tuple_context

(

Ctx &&...

ctx

)

-> context<tupleset<labelset_t_of<Ctx>...>, join_t<weightset_t_of<Ctx>...>>

Definition at line 16 of file tuple.hh.

References vcsn::detail::ctx, join(), and vcsn::detail::make_tupleset().

Referenced by vcsn::detail::tuple().

Here is the call graph for this function:

tuple_expansionset()

template<typename... ExpansionSets>

auto vcsn::tuple_expansionset

(

const ExpansionSets &...

ess

)

-> rat::expansionset<decltype(tuple_expressionset(ess.expressionset()...))>

Definition at line 61 of file tuple.hh.

References tuple_expressionset().

Referenced by vcsn::dyn::detail::tuple_().

Here is the call graph for this function:

tuple_expressionset()

template<typename... ExpSets>

auto vcsn::tuple_expressionset

(

const ExpSets &...

rss

)

-> expressionset<decltype(tuple_context(rss.context()...))>

Definition at line 85 of file tuple.hh.

References vcsn::detail::ctx, vcsn::rat::ids(), vcsn::dyn::detail::join(), and vcsn::dyn::detail::tuple_context().

Referenced by vcsn::dyn::detail::partial_identity_expression(), vcsn::dyn::detail::tuple_(), and tuple_expansionset().

Here is the call graph for this function:

tuple_polynomialset()

template<typename... PolynomialSets>

auto vcsn::tuple_polynomialset

(

const PolynomialSets &...

pss

)

-> polynomialset<decltype(tuple_context(pss.context()...))>

Definition at line 176 of file tuple.hh.

References vcsn::detail::ctx, and vcsn::dyn::detail::tuple_context().

Referenced by vcsn::dyn::detail::tuple_().

Here is the call graph for this function:

u()

template<typename Context >

mutable_automaton<Context> vcsn::u	(	const Context &	ctx,
		unsigned	n
	)

The Brzozowski universal witness.

Definition at line 15 of file u.hh.

References vcsn::detail::ctx, require(), and res.

Referenced by vcsn::rat::position::initialize(), vcsn::detail::yen_impl< Aut, ValueSet, Mul, GetValue >::operator()(), and vcsn::ctx::detail::register_context_functions().

Here is the call graph for this function:

universal()

template<Automaton Aut>

Aut vcsn::universal

(

const Aut &

a

)

Definition at line 135 of file universal.hh.

useful_states()

template<Automaton Aut>

states_t<Aut> vcsn::useful_states	(	const Aut &	a,
		bool	strict = true
	)

The set of useful states, including possibly pre() and post().

Parameters

a	the automaton.
strict	whether to evaluate lazy states.

Definition at line 79 of file accessible.hh.

References accessible(), accessible_states(), coaccessible(), coaccessible_states(), and set_intersection().

Referenced by num_useful_states(), and trim().

Here is the call graph for this function:

VCSN_CTX_INSTANTIATE() [1/8]

vcsn::VCSN_CTX_INSTANTIATE

(

ctx::lal_char_q

)

VCSN_CTX_INSTANTIATE() [2/8]

vcsn::VCSN_CTX_INSTANTIATE

(

ctx::lal_char_zr

)

VCSN_CTX_INSTANTIATE() [3/8]

vcsn::VCSN_CTX_INSTANTIATE

(

ctx::law_char_br

)

VCSN_CTX_INSTANTIATE() [4/8]

vcsn::VCSN_CTX_INSTANTIATE

(

ctx::law_char_zr

)

VCSN_CTX_INSTANTIATE() [5/8]

vcsn::VCSN_CTX_INSTANTIATE

(

ctx::law_char_zrr

)

VCSN_CTX_INSTANTIATE() [6/8]

vcsn::VCSN_CTX_INSTANTIATE

(

ctx::lal_char_zrr

)

VCSN_CTX_INSTANTIATE() [7/8]

vcsn::VCSN_CTX_INSTANTIATE

(

ctx::lal_char_br

)

VCSN_CTX_INSTANTIATE() [8/8]

vcsn::VCSN_CTX_INSTANTIATE

(

ctx::lal_char_b

)

vname()

template<typename T >

symbol vcsn::vname

(

T &

t

)

Definition at line 99 of file name.hh.

References vcsn::vnamer< T >::name().

Referenced by vcsn::dyn::lift(), vcsn::dyn_vector_vnamer< dyn::label >::name(), read_automaton(), and vsignature().

Here is the call graph for this function:

vsignature()

template<typename... Args>

signature vcsn::vsignature ( Args &&...  args )

inline

The signature of (Args...).

Definition at line 310 of file name.hh.

References vname().

Referenced by vcsn::dyn::detail::Registry< Fun >::call().

Here is the call graph for this function:

weight_of() [1/2]

template<typename Label , typename Weight >

auto vcsn::weight_of

(

const welement< Label, Weight > &

m

)

-> decltype(m.weight())

The weight of a welement.

Definition at line 154 of file wet.hh.

Referenced by vcsn::detail::polynomialset_impl< Context, Kind >::abs(), vcsn::detail::trie_builder< Context, Dir >::add(), vcsn::edit_automaton< Aut >::add_entry(), vcsn::detail::polynomialset_impl< Context, Kind >::add_here(), vcsn::detail::polynomialset_impl< Context, Kind >::add_ldivide_here(), vcsn::detail::derived_term_automaton_impl< ExpSet >::complete_via_derivation_(), vcsn::detail::derived_term_automaton_impl< ExpSet >::complete_via_expansion_(), vcsn::detail::polynomialset_impl< Context, Kind >::conjunction_impl_(), vcsn::detail::polynomialset_impl< Context, Kind >::conv(), derivation(), vcsn::detail::polynomialset_impl< Context, Kind >::get_weight(), vcsn::detail::polynomialset_impl< Context, Kind >::hash(), vcsn::detail::polynomialset_impl< Context, Kind >::infiltrate(), vcsn::detail::derived_term_automaton_impl< ExpSet >::init_(), vcsn::detail::polynomialset_impl< Context, Kind >::ldivide(), vcsn::rat::expansionset< expressionset_t >::ldivide_here(), vcsn::detail::polynomialset_impl< Context, Kind >::ldivide_here(), vcsn::detail::polynomialset_impl< Context, Kind >::lmul_label(), vcsn::detail::polynomialset_impl< Context, Kind >::lweight(), vcsn::detail::polynomialset_impl< Context, Kind >::monomial_compare(), vcsn::detail::polynomialset_impl< Context, Kind >::monomial_equal(), vcsn::detail::polynomialset_impl< Context, Kind >::monomial_less(), vcsn::detail::polynomialset_impl< Context, Kind >::mul(), vcsn::detail::polynomialset_impl< Context, Kind >::mul_impl_(), vcsn::rat::split_visitor< ExpSet >::multiply(), vcsn::rat::expansionset< expressionset_t >::normalize_(), vcsn::detail::evaluator< Aut >::operator()(), vcsn::detail::polynomialset_impl< Context, Kind >::norm_< WeightSet, Dummy >::operator()(), vcsn::detail::polynomialset_impl< Context, Kind >::norm_< z, Dummy >::operator()(), vcsn::detail::polynomialset_impl< Context, Kind >::norm_< polynomialset< Ctx, Knd >, Dummy >::operator()(), vcsn::detail::polynomialset_impl< Context, Kind >::print(), vcsn::detail::polynomialset_impl< Context, Kind >::print_with_classes_(), vcsn::detail::polynomialset_impl< Context, Kind >::project(), vcsn::detail::polynomialset_impl< Context, Kind >::rdivide_here(), vcsn::detail::polynomialset_impl< Context, Kind >::rmul_label(), vcsn::rat::expansionset< expressionset_t >::rweight(), vcsn::detail::polynomialset_impl< Context, Kind >::rweight(), vcsn::detail::polynomialset_impl< Context, Kind >::scalar_product(), vcsn::rat::expansionset< expressionset_t >::shuffle_(), split_polynomial(), vcsn::detail::polynomialset_impl< Context, Kind >::sub_here(), vcsn::detail::polynomialset_impl< Context, Kind >::to_label(), vcsn::detail::polynomialset_impl< Context, Kind >::transpose(), vcsn::rat::derivation_visitor< ExpSet >::VCSN_RAT_VISIT(), vcsn::rat::to_expansion_visitor< expressionset_t >::VCSN_RAT_VISIT(), vcsn::detail::wet_bitset::wet_bitset(), and vcsn::detail::wet_set< Key, Compare >::wet_set().

weight_of() [2/2]

template<typename Label , typename Weight >

const Weight& vcsn::weight_of

(

const std::pair< Label, Weight > &

m

)

The weight of a pair (label, weight).

Definition at line 176 of file wet.hh.

weight_series()

template<Automaton Aut>

auto vcsn::weight_series

(

const Aut &

a

)

-> std::enable_if_t<!is_tropical<weightset_t_of<Aut>>::value, weight_t_of<Aut>>

Definition at line 16 of file weight-series.hh.

References evaluate(), lightest_path(), path_monomial(), proper(), res, and to_spontaneous().

Here is the call graph for this function:

weight_set() [1/2]

template<typename Label , typename Weight >

void vcsn::weight_set	(	welement< Label, Weight > &	m,
		const Weight &	w
	)

Set the weight of a welement.

Definition at line 162 of file wet.hh.

References vcsn::detail::welement_weight< Weight >::weight().

Referenced by vcsn::rat::expansionset< expressionset_t >::ldivide_here(), vcsn::detail::polynomialset_impl< Context, Kind >::ldivide_here(), vcsn::detail::polynomialset_impl< Context, Kind >::rdivide_here(), and vcsn::detail::polynomialset_impl< Context, Kind >::sub_here().

Here is the call graph for this function:

weight_set() [2/2]

template<typename Label , typename Weight >

void vcsn::weight_set	(	std::pair< Label, Weight > &	m,
		const Weight &	w
	)

Set the weight of a pair (label, weight).

Definition at line 190 of file wet.hh.

xgetenv()

std::string vcsn::xgetenv	(	const std::string &	var,
		const std::string &	val = ""
	)

getenv(var) if defined, otherwise val.

Definition at line 229 of file stream.cc.

Referenced by vcsn::detail::config::config(), expand_tilda(), and fail_reading().

zip()

template<typename... Sequences>

zip_sequences<Sequences...> vcsn::zip

(

Sequences &&...

seqs

)

Definition at line 439 of file zip.hh.

Referenced by vcsn::detail::tupleset_impl< ValueSets >::letters_of_().

zip_map_tuple()

template<typename Dereference = as_pair, typename... Maps>

zipped_maps<Dereference, Maps...> vcsn::zip_map_tuple

(

const std::tuple< Maps... > &

maps

)

Definition at line 257 of file zip-maps.hh.

Referenced by vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::add_add_transitions(), vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::add_conjunction_transitions(), and vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::add_ldivide_transitions().

zip_maps()

template<typename Dereference = as_pair, typename... Maps>

zipped_maps<Dereference, Maps...> vcsn::zip_maps

(

Maps &&...

maps

)

Definition at line 250 of file zip-maps.hh.

Referenced by vcsn::detail::compose_automaton_impl< Lazy, Lhs, Rhs >::add_compose_transitions(), vcsn::rat::expansionset< expressionset_t >::ldivide(), and vcsn::detail::pair_automaton_impl< Aut >::pair_automaton_impl().

zip_tuple()

template<typename... Sequences>

zip_sequences<Sequences...> vcsn::zip_tuple

(

const std::tuple< Sequences... > &

seqs

)

Definition at line 446 of file zip.hh.

zip_with_padding()

template<typename... Sequences>

zip_sequences_padded<zip_sequences<Sequences...> > vcsn::zip_with_padding	(	const std::tuple< typename Sequences::value_type... > &	pad,
		const Sequences &...	seq
	)

Definition at line 453 of file zip.hh.

Referenced by vcsn::detail::tupleset_impl< ValueSets >::letters_of_padded_().

zpc()

template<Automaton Aut, typename ExpSet >

Aut vcsn::zpc	(	const context_t_of< Aut > &	ctx,
		const ExpSet &	rs,
		const typename ExpSet::value_t &	r,
		const std::string &	algo = "auto"
	)

Build a ZPC automaton from an expression.

Template Parameters

Aut	relative to the generated automaton.
ExpSet	relative to the expression.

Definition at line 349 of file zpc.hh.

References vcsn::rat::ctx().

Here is the call graph for this function:

Variable Documentation

cnull

std::ostream vcsn::cnull {nullptr}

An narrow-char stream that discards the output.

Definition at line 13 of file stream.cc.

else

vcsn::else

Initial value:

{
        res = vs.power(v, exp.min)

Definition at line 389 of file multiply.hh.

min

return exp vcsn::min

Definition at line 362 of file multiply.hh.

Referenced by vcsn::detail::min_plus_impl< zmin_impl, int >::add(), vcsn::detail::word_synchronizer< Aut >::cycle_(), vcsn::detail::scc_impl< Aut, tarjan_recursive_tag >::dfs(), vcsn::detail::word_synchronizer< Aut >::fastsynchro_(), vcsn::detail::left_reductioner< Aut >::find_pivot_by_norm(), vcsn::detail::synchronizer< Aut >::get_min_length_(), vcsn::detail::z_impl::min(), vcsn::detail::log_impl::min(), vcsn::detail::r_impl::min(), vcsn::detail::qmp_impl::min(), vcsn::detail::min_plus_impl< zmin_impl, int >::min(), vcsn::detail::q_impl::min(), vcsn::dyn::detail::multiply_expression_repeated(), vcsn::dyn::detail::multiply_repeated(), vcsn::dyn::detail::multiply_weight_repeated(), vcsn::detail::are_isomorphic_impl< Aut1, Aut2 >::print_class_stats(), and vcsn::detail::word_synchronizer< Aut >::synchro().

res

return vcsn::res

Definition at line 399 of file multiply.hh.

Referenced by vcsn::detail::polynomialset_impl< Context, Kind >::abs(), vcsn::detail::absval(), accessible_states(), add(), vcsn::detail::polynomialset_impl< Context, Kind >::add(), vcsn::rat::position::add_(), add_here(), vcsn::detail::polynomialset_impl< Context, Kind >::add_ldivide_here(), vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::add_shuffle_transitions_(), all(), all_distances(), vcsn::ast::context_parser::any_(), vcsn::rat::expressionset_impl< Context >::as_tupleset(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::atom(), aut_of_component(), vcsn::ast::context_parser::automaton_(), vcsn::detail::back(), vcsn::zipped_maps< Dereference, Maps >::begin(), vcsn::cross_sequences< Sequences >::begin(), vcsn::detail::bellman_ford_impl(), vcsn::rat::star_normal_form_visitor< ExpSet >::box_of(), vcsn::detail::down_caster::cast(), vcsn::cross_sequences< Sequences >::cbegin(), cerny(), vcsn::rat::compare< ExpSet >::cmp_(), collision_count(), compare(), vcsn::nullableset< LabelSet >::compare(), complement(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::complement(), vcsn::rat::expressionset_impl< Context >::complement(), complete(), vcsn::rat::expressionset_impl< Context >::compose(), compose(), vcsn::detail::polynomialset_impl< Context, Kind >::compose(), compose_lazy(), configuration(), conjugate(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::conjunction(), vcsn::rat::expressionset_impl< Context >::conjunction(), vcsn::detail::conjunction(), conjunction(), vcsn::detail::polynomialset_impl< Context, Kind >::conjunction_impl_(), vcsn::detail::conjunction_lazy(), conv(), vcsn::detail::min_plus_impl< zmin_impl, int >::conv(), vcsn::detail::log_impl::conv(), vcsn::detail::z_impl::conv(), vcsn::detail::qmp_impl::conv(), vcsn::detail::r_impl::conv(), vcsn::wordset< GenSet >::conv(), vcsn::rat::expressionset_impl< Context >::conv(), vcsn::detail::polynomialset_impl< Context, Kind >::conv(), vcsn::detail::tupleset_impl< ValueSets >::conv_(), vcsn::detail::conv_label_class_(), copy(), vcsn::dyn::detail::copy_convert(), de_bruijn(), vcsn::rat::driver::debug_level(), vcsn::format::delimit(), derivation(), vcsn::dyn::detail::derived_term(), determinize(), vcsn::detail::dispatch_tags(), divkbaseb(), vcsn::detail::xlt_advise::dlopen_(), vcsn::rat::star_normal_form_visitor< ExpSet >::dot_of(), double_ring(), eliminate_state(), eliminate_state_here(), evaluate(), vcsn::dyn::evaluate(), vcsn::dyn::detail::evaluate_polynomial(), expand_tilda(), vcsn::ast::context_parser::expansionset_(), vcsn::detail::implicit_path< Aut >::explicit_path(), factor(), vcsn::detail::are_isomorphic_impl< Aut1, Aut2 >::factorial(), vcsn::rat::standard_visitor< Aut, ExpSet >::finals(), vcsn::detail::printer< Aut >::finals_(), vcsn::format::for_labels(), vcsn::format::for_weights(), format_lightest(), vcsn::detail::left_reductioner< Aut >::gcd(), vcsn::detail::config::value::gen_keys(), vcsn::ast::context_parser::genset_(), vcsn::dyn::detail::Registry< Fun >::get(), get_char(), get_file_contents(), vcsn::detail::genset_labelset< GenSet >::get_letter(), vcsn::char_letters::get_letter(), vcsn::string_letters::get_letter(), vcsn::detail::tupleset_impl< ValueSets >::get_letter(), vcsn::set_alphabet< L >::get_word(), vcsn::detail::q_impl::hash(), vcsn::detail::polynomialset_impl< Context, Kind >::hash(), std::hash< std::tuple< Elements... > >::hash_(), vcsn::detail::tupleset_impl< ValueSets >::hash_(), vcsn::detail::polynomialset_impl< Context, Kind >::hash_impl_(), if(), image(), vcsn::cross_sequences< Sequences >::cross_iterator< ValueType, IteratorsType >::increment_(), vcsn::rat::expressionset_impl< Context >::infiltrate(), vcsn::detail::polynomialset_impl< Context, Kind >::infiltrate(), infiltrate(), vcsn::detail::printer< Aut >::initials_(), vcsn::detail::insplit(), vcsn::detail::eppstein< Aut >::k_shortest_path(), vcsn::ast::context_parser::labelset_(), ladybird(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::ldivide(), vcsn::rat::expressionset_impl< Context >::ldivide(), vcsn::nullableset< LabelSet >::ldivide(), vcsn::detail::polynomialset_impl< Context, Kind >::ldivide(), ldivide(), vcsn::rat::expressionset_impl< Context >::letter_class_(), levenshtein(), vcsn::detail::lexical_cast(), vcsn::detail::lexicographical_cmp(), vcsn::detail::polynomialset_impl< Context, Kind >::lgcd(), lift(), lightest(), vcsn::detail::lightest_impl< Aut >::lightest_(), lightest_automaton(), lightest_path(), vcsn::rat::location::lines(), vcsn::detail::polynomialset_impl< Context, Kind >::lmul_label(), vcsn::detail::tupleset_impl< ValueSets >::lnormalize_here_(), lweight(), vcsn::rat::expressionset_impl< Context >::lweight(), vcsn::detail::polynomialset_impl< Context, Kind >::lweight(), vcsn::detail::standard_operations< Aut >::lweight_here(), vcsn::set_alphabet< L >::make(), vcsn::detail::tupleset_impl< ValueSets >::make(), vcsn::dyn::make_automaton(), make_context(), make_dynamic_bitset(), vcsn::dyn::make_expression(), vcsn::rat::driver::make_label(), vcsn::dyn::make_label(), vcsn::detail::random_expression_impl< ExpressionSet, RandomGenerator >::make_param_(), vcsn::dyn::make_polynomial(), vcsn::detail::make_queue(), make_random_engine(), vcsn::detail::are_isomorphic_impl< Aut1, Aut2 >::make_state_classes(), vcsn::rat::driver::make_weight(), vcsn::dyn::make_weight(), vcsn::detail::max_forward(), vcsn::nullableset< LabelSet >::maybe_ldivide(), vcsn::detail::tupleset_impl< ValueSets >::maybe_ldivide(), vcsn::detail::tupleset_impl< ValueSets >::maybe_rdivide(), vcsn::nullableset< LabelSet >::maybe_rdivide(), vcsn::rat::to_expansion_visitor< expressionset_t >::me(), vcsn::format::meta(), vcsn::detail::min_forward(), minimize(), vcsn::detail::polynomialset_impl< Context, Kind >::monomial_compare(), vcsn::detail::polynomialset_impl< Context, Kind >::monomial_one(), vcsn::weightset_mixin< expressionset_t >::mul(), vcsn::string_letters::mul(), vcsn::detail::polynomialset_impl< Context, Kind >::mul(), vcsn::detail::polynomialset_impl< Context, Kind >::mul_impl_(), vcsn::rat::split_visitor< ExpSet >::multiply(), multiply(), multiply_here(), vcsn::snamer< std::integral_constant< T, Value > >::name(), vcsn::zip_sequences< Sequences >::zip_iterator< ValueType, IteratorsType >::next_(), vcsn::zip_sequences_padded< ZipSequences >::zip_iterator< ValueType, IteratorsType >::next_(), vcsn::detail::polynomialset_impl< Context, Kind >::normalize(), vcsn::detail::polynomialset_impl< Context, Kind >::normalize_here(), num_accessible_states(), num_deterministic_states(), vcsn::detail::num_lazy_states(), vcsn::detail::num_spontaneous_transitions(), vcsn::detail::epsilon_remover< Aut, has_one >::num_spontaneous_transitions_(), num_useful_states(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::one(), vcsn::detail::polynomialset_impl< Context, Kind >::one(), vcsn::detail::xlt_advise::open(), open_input_file(), open_output_file(), std::hash< pair< T1, T2 > >::operator()(), std::hash< boost::dynamic_bitset< B, A > >::operator()(), std::hash< map< Key, Value, Compare, Alloc > >::operator()(), std::hash< unordered_set< Key, Hash, KeyEqual, Alloc > >::operator()(), std::hash< set< T, Compare, Alloc > >::operator()(), std::hash< vector< T, Alloc > >::operator()(), vcsn::rat::compare< ExpSet >::operator()(), vcsn::detail::evaluator< Aut >::operator()(), vcsn::detail::minimizer< Aut, signature_tag >::signature_hasher::operator()(), vcsn::rat::to_expansion_visitor< expressionset_t >::operator()(), vcsn::detail::quotienter< Aut >::operator()(), vcsn::detail::epsilon_remover< Aut, has_one >::operator()(), vcsn::detail::minimizer< Aut, weighted_tag >::signature_hasher::operator()(), std::hash< std::array< Value, Size > >::operator()(), vcsn::detail::yen_impl< Aut, ValueSet, Mul, GetValue >::operator()(), vcsn::any::operator()(), vcsn::detail::polynomialset_impl< Context, Kind >::norm_< z, Dummy >::operator()(), vcsn::detail::polynomialset_impl< Context, Kind >::norm_< polynomialset< Ctx, Knd >, Dummy >::operator()(), vcsn::rat::operator+=(), vcsn::getarg< Value >::operator[](), vcsn::detail::transition_map< automaton_t, weightset_t_of< automaton_t >, true, true >::operator[](), vcsn::detail::are_isomorphic_impl< Aut1, Aut2 >::origins(), vcsn::ast::context_parser::parameters_(), vcsn::ast::context_parser::parse(), vcsn::detail::dot::driver::parse(), vcsn::ast::context_parser::parse_context(), partial_identity(), vcsn::detail::yen_impl< Aut, ValueSet, Mul, GetValue >::path(), vcsn::detail::path< Aut >::path_sum(), vcsn::detail::word_synchronizer< Aut >::phi_1(), vcsn::detail::word_synchronizer< Aut >::phi_3(), vcsn::ast::context_parser::polynomialset_(), vcsn::random_selector< RandomGenerator >::pop(), vcsn::rat::expressionset_impl< Context >::power(), vcsn::weightset_mixin< expressionset_t >::power_(), prefix(), vcsn::rat::dot_printer< ExpSet >::print_(), project(), vcsn::detail::polynomialset_impl< Context, Kind >::project(), push_weights(), quotkbaseb(), random_automaton(), random_automaton_deterministic(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::rdivide(), vcsn::nullableset< LabelSet >::rdivide(), read_automaton(), vcsn::dyn::read_automaton(), vcsn::dyn::detail::read_label(), vcsn::dyn::read_polynomial(), vcsn::dyn::read_weight(), vcsn::rat::project_impl< InExpSet, OutExpSet, Tape >::rec_(), vcsn::rat::copy_impl< InExpSet, OutExpSet >::rec_(), vcsn::detail::word_synchronizer< Aut >::recompose_path(), vcsn::detail::star_height_visitor< ExpSet >::recurse_(), vcsn::lazy_automaton_editor::result_context(), vcsn::detail::polynomialset_impl< Context, Kind >::rmul_label(), vcsn::rat::expressionset_impl< Context >::rweight(), rweight(), vcsn::detail::polynomialset_impl< Context, Kind >::rweight(), vcsn::detail::standard_operations< Aut >::rweight_here(), vcsn::detail::left_reductioner< Aut >::scalar_product(), vcsn::detail::polynomialset_impl< Context, Kind >::scalar_product(), vcsn::discrete_chooser< random_generator_t >::select(), set_difference(), set_intersection(), set_union(), vcsn::detail::enumerater< Aut >::shortest_(), shortest_distance_to_finals(), vcsn::rat::expressionset_impl< Context >::shuffle(), shuffle(), vcsn::detail::minimizer< Aut, weighted_tag >::signature(), vcsn::dyn::detail::Registry< Fun >::signatures(), vcsn::rat::sizer< ExpSet >::visit_tuple< Dummy >::size_(), vcsn::detail::delgado_profiler< Aut >::size_of_transition(), vcsn::char_letters::sname(), vcsn::detail::nmin_impl::sname(), vcsn::detail::zmin_impl::sname(), vcsn::general_tag::sname(), vcsn::detail::rmin_impl::sname(), vcsn::detail::f2_impl::sname(), vcsn::detail::z_impl::sname(), vcsn::detail::b_impl::sname(), vcsn::detail::r_impl::sname(), vcsn::detail::log_impl::sname(), vcsn::detail::q_impl::sname(), vcsn::oneset::sname(), vcsn::string_letters::sname(), vcsn::detail::qmp_impl::sname(), vcsn::standard_tag::sname(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::sname(), vcsn::detail::genset_labelset< GenSet >::sname(), vcsn::detail::expression_automaton_impl< Aut >::sname(), vcsn::set_alphabet< L >::sname(), vcsn::detail::permutation_automaton_impl< Aut >::sname(), vcsn::detail::name_automaton_impl< Aut >::sname(), vcsn::detail::lazy_proper_automaton_impl< Aut, has_one >::sname(), vcsn::wordset< GenSet >::sname(), vcsn::letterset< GenSet >::sname(), vcsn::detail::insplit_automaton_impl< Aut >::sname(), vcsn::detail::tuple_automaton_impl< Aut, Auts >::sname(), vcsn::detail::product_automaton_impl< Lazy, Aut, Auts >::sname(), vcsn::detail::partition_automaton_impl< Aut >::sname(), vcsn::detail::transpose_automaton_impl< Aut >::sname(), vcsn::context< Tape, full_context_t >::sname(), vcsn::detail::delay_automaton_impl< Aut >::sname(), vcsn::detail::determinized_automaton_impl< Aut, Kind, Lazy >::sname(), vcsn::detail::filter_automaton_impl< Aut, Trans >::sname(), vcsn::rat::expressionset_impl< Context >::sname(), vcsn::detail::synchronized_automaton_impl< Aut >::sname(), vcsn::detail::polynomialset_impl< Context, Kind >::sname(), vcsn::detail::tupleset_impl< ValueSets >::sname(), vcsn::detail::focus_automaton_impl< Tape, Aut >::sname(), vcsn::detail::mutable_automaton_impl< Context >::sname(), vcsn::detail::pair_automaton_impl< Aut >::sname(), vcsn::boolean_tag::sname(), vcsn::detail::compose_automaton_impl< Lazy, Lhs, Rhs >::sname(), vcsn::detail::derived_term_automaton_impl< ExpSet >::sname(), vcsn::weighted_tag::sname(), vcsn::nullableset< LabelSet >::sname(), vcsn::detail::scc_automaton_impl< Aut >::sname(), vcsn::detail::lazy_tuple_automaton< product_automaton_impl< Lazy, Aut, Auts... >, false, Lazy, Aut, Auts... >::sname_(), vcsn::detail::tuple_automaton_impl< Aut, Auts >::sname_(), vcsn::detail::tupleset_impl< ValueSets >::sname_(), vcsn::file_library::split(), split_polynomial(), standard(), star(), vcsn::rat::expressionset_impl< Context >::star(), star_here(), vcsn::detail::copier< AutIn, AutOut >::state(), vcsn::detail::polystate_automaton_impl< Aut, Kind, Lazy >::state_(), vcsn::detail::are_isomorphic_impl< Aut1, Aut2 >::state_to_class(), vcsn::detail::polynomialset_impl< Context, Kind >::sub(), subword(), suffix(), vcsn::detail::xlt_handle::sym(), to_expression(), vcsn::dyn::to_expression(), vcsn::detail::polynomialset_impl< Context, Kind >::to_label(), to_spontaneous(), vcsn::detail::transform(), vcsn::detail::transpose_impl< ExpSet >::transpose(), vcsn::detail::polynomialset_impl< Context, Kind >::transpose(), vcsn::rat::expressionset_impl< Context >::transposition(), vcsn::detail::tuple(), vcsn::detail::polynomialset_impl< Context, Kind >::tuple(), vcsn::ast::context_parser::tuple_(), vcsn::ast::context_parser::tupleset_(), u(), vcsn::rat::star_normal_form_visitor< ExpSet >::VCSN_RAT_VISIT(), vcsn::rat::constant_term_visitor< ExpSet >::VCSN_RAT_VISIT(), vcsn::rat::derivation_visitor< ExpSet >::VCSN_RAT_VISIT(), vcsn::rat::split_visitor< ExpSet >::VCSN_RAT_VISIT(), vcsn::rat::inductive_visitor< Aut, ExpSet, Tag >::VCSN_RAT_VISIT(), vcsn::rat::constant_term_visitor< ExpSet >::visit_product(), weight_series(), vcsn::dyn::weight_series(), vcsn::ast::context_parser::word_(), vcsn::detail::universal_impl< Aut >::work_(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::zero(), vcsn::detail::polynomialset_impl< Context, Kind >::zero(), and vcsn::detail::standard_operations< Aut >::zero_here().

v

return vcsn::v

Definition at line 362 of file multiply.hh.

Referenced by vcsn::rat::variadic< Type, Context >::accept(), vcsn::rat::unary< Type, Context >::accept(), vcsn::rat::weight_node< Type, Context >::accept(), vcsn::rat::name< Context >::accept(), vcsn::rat::constant< Type, Context >::accept(), vcsn::rat::atom< Context >::accept(), vcsn::rat::expressionset_impl< Context >::tuple_of_label< Dummy >::as_label_(), vcsn::detail::dot::parser::basic_symbol< by_state >::basic_symbol(), vcsn::rat::parser::basic_symbol< by_state >::basic_symbol(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::complement(), vcsn::rat::expansionset< expressionset_t >::complement(), vcsn::rat::expansionset< expressionset_t >::complement_(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::conjunction(), vcsn::oneset::conv(), vcsn::wordset< GenSet >::conv(), vcsn::letterset< GenSet >::conv(), vcsn::rat::expansionset< expressionset_t >::conv(), vcsn::rat::expressionset_impl< Context >::conv(), vcsn::sparse_map< Key, Value >::emplace(), vcsn::rat::expressionset_impl< Context >::hash(), vcsn::rat::info< ExpSet >::visit_tuple< Dummy >::info_(), vcsn::rat::expressionset_impl< Context >::is_letter(), vcsn::rat::printer< ExpSet >::is_letter_(), vcsn::rat::expressionset_impl< Context >::is_one(), vcsn::letterset< GenSet >::is_special(), vcsn::rat::expressionset_impl< Context >::is_universal(), vcsn::rat::printer< ExpSet >::is_word_(), vcsn::rat::expressionset_impl< Context >::is_zero(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::ldivide(), vcsn::wordset< GenSet >::letters_of(), vcsn::letterset< GenSet >::letters_of(), vcsn::wordset< GenSet >::letters_of_padded(), vcsn::letterset< GenSet >::letters_of_padded(), multiply(), vcsn::rat::printer< ExpSet >::operator()(), vcsn::rat::printer< ExpSet >::precedence_(), vcsn::rat::expressionset_impl< Context >::print(), vcsn::rat::printer< ExpSet >::print_(), vcsn::rat::printer< ExpSet >::visit_tuple< Dummy >::print_(), vcsn::rat::dot_printer< ExpSet >::visit_tuple< typename >::print_(), vcsn::detail::yen_impl< Aut, ValueSet, Mul, GetValue >::profile::profile(), vcsn::detail::project(), vcsn::rat::project(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::rdivide(), vcsn::rat::expressionset_impl< Context >::size(), vcsn::rat::sizer< ExpSet >::visit_tuple< Dummy >::size_(), to_string(), vcsn::oneset::transpose(), vcsn::rat::expressionset_impl< Context >::transpose(), vcsn::automatonset< context_t_of< automaton_t >, tag_t >::tuple(), vcsn::rat::expressionset_impl< Context >::tuple(), vcsn::rat::unary< Type, Context >::type(), vcsn::rat::weight_node< Type, Context >::type(), vcsn::rat::name< Context >::type(), vcsn::rat::constant< Type, Context >::type(), vcsn::rat::atom< Context >::type(), vcsn::dyn::value_impl< Tag >::value_impl(), vcsn::rat::variadic< Type, Context >::variadic(), vcsn::rat::sizer< ExpSet >::VCSN_RAT_VISIT(), vcsn::rat::hash< ExpSet >::VCSN_RAT_VISIT(), vcsn::rat::star_normal_form_visitor< ExpSet >::VCSN_RAT_VISIT(), vcsn::rat::project_impl< InExpSet, OutExpSet, Tape >::VCSN_RAT_VISIT(), vcsn::rat::constant_term_visitor< ExpSet >::VCSN_RAT_VISIT(), vcsn::rat::copy_impl< InExpSet, OutExpSet >::VCSN_RAT_VISIT(), vcsn::rat::info< ExpSet >::VCSN_RAT_VISIT(), vcsn::rat::derivation_visitor< ExpSet >::VCSN_RAT_VISIT(), vcsn::rat::split_visitor< ExpSet >::VCSN_RAT_VISIT(), vcsn::rat::dot_printer< ExpSet >::VCSN_RAT_VISIT(), vcsn::rat::to_expansion_visitor< expressionset_t >::VCSN_RAT_VISIT(), vcsn::rat::const_visitor< Context >::visit(), vcsn::rat::hash< ExpSet >::visit(), vcsn::rat::sizer< ExpSet >::visit(), vcsn::rat::compare< ExpSet >::visit(), vcsn::rat::inductive_visitor< Aut, ExpSet, Tag >::visit(), vcsn::rat::project_impl< InExpSet, OutExpSet, Tape >::visit(), vcsn::rat::copy_impl< InExpSet, OutExpSet >::visit(), vcsn::rat::printer< ExpSet >::visit(), vcsn::rat::info< ExpSet >::visit(), vcsn::rat::constant_term_visitor< ExpSet >::visit(), vcsn::rat::dot_printer< ExpSet >::visit(), vcsn::rat::derivation_visitor< ExpSet >::visit(), vcsn::rat::to_expansion_visitor< expressionset_t >::visit(), and vcsn::wordset< GenSet >::word().

wcnull

std::wostream vcsn::wcnull {nullptr}

An wide-char stream that discards the output.

Definition at line 14 of file stream.cc.