22 #include <spot/misc/common.hh> 24 #include <type_traits> 31 #include <type_traits> 35 template <
typename State_Data,
typename Edge_Data>
41 template <
typename Of,
typename ...Args>
44 static const bool value =
false;
47 template <
typename Of,
typename Arg1,
typename ...Args>
50 static const bool value =
51 std::is_base_of<Of, typename std::decay<Arg1>::type>::value;
61 template <typename Data, bool boxed = !std::is_class<Data>::value>
68 template <
typename... Args,
69 typename =
typename std::enable_if<
71 boxed_label(Args&&... args)
72 noexcept(std::is_nothrow_constructible<Data, Args...>::value)
73 : label{std::forward<Args>(args)...}
80 explicit boxed_label()
81 noexcept(std::is_nothrow_constructible<Data>::value)
90 const Data& data()
const 95 bool operator<(
const boxed_label& other)
const 97 return label < other.label;
104 typedef std::tuple<> data_t;
110 const std::tuple<>& data()
const 117 template <
typename Data>
123 template <
typename... Args,
124 typename =
typename std::enable_if<
126 boxed_label(Args&&... args)
127 noexcept(std::is_nothrow_constructible<Data, Args...>::value)
128 : Data{std::forward<Args>(args)...}
135 explicit boxed_label()
136 noexcept(std::is_nothrow_constructible<Data>::value)
145 const Data& data()
const 158 template <
typename Edge,
typename State_Data>
165 template <
typename... Args,
166 typename =
typename std::enable_if<
168 distate_storage(Args&&... args)
169 noexcept(std::is_nothrow_constructible<State_Data, Args...>::value)
170 : State_Data{std::forward<Args>(args)...}
182 template <
typename StateIn,
183 typename StateOut,
typename Edge,
typename Edge_Data>
194 noexcept(std::is_nothrow_constructible<Edge_Data>::value)
200 template <
typename... Args>
202 StateIn src, Args&&... args)
203 noexcept(std::is_nothrow_constructible<Edge_Data, Args...>::value
204 && std::is_nothrow_constructible<StateOut, StateOut>::value
205 && std::is_nothrow_constructible<Edge, Edge>::value)
206 : Edge_Data{std::forward<Args>(args)...},
207 dst(dst), next_succ(next_succ), src(src)
223 return this->data() < other.data();
228 return src == other.src &&
230 this->data() == other.data();
242 template <
typename Graph>
246 typedef typename std::conditional<std::is_const<Graph>::value,
247 const typename Graph::edge_storage_t,
248 typename Graph::edge_storage_t>::type
250 typedef value_type& reference;
251 typedef value_type* pointer;
252 typedef std::ptrdiff_t difference_type;
253 typedef std::forward_iterator_tag iterator_category;
255 typedef typename Graph::edge edge;
277 reference operator*()
const 279 return g_->edge_storage(t_);
282 pointer operator->()
const 284 return &g_->edge_storage(t_);
289 t_ = operator*().next_succ;
296 t_ = operator*().next_succ;
300 operator bool()
const 315 template <
typename Graph>
320 typedef typename Graph::state_storage_t state_storage_t;
321 typedef typename Graph::edge edge;
324 : super(g, t), src_(src), prev_(0)
331 this->t_ = this->operator*().next_succ;
345 edge next = this->operator*().next_succ;
350 this->g_->edge_storage(prev_).next_succ = next;
354 if (src_.succ == this->t_)
357 if (src_.succ_tail == this->t_)
359 src_.succ_tail = prev_;
360 SPOT_ASSERT(next == 0);
364 this->operator*().next_succ = this->t_;
369 ++this->g_->killed_edge_;
373 state_storage_t& src_;
384 template <
typename Graph>
388 typedef typename Graph::edge edge;
418 template <
typename Graph>
422 typedef typename std::conditional<std::is_const<Graph>::value,
423 const typename Graph::edge_storage_t,
424 typename Graph::edge_storage_t>::type
426 typedef value_type& reference;
427 typedef value_type* pointer;
428 typedef std::ptrdiff_t difference_type;
429 typedef std::forward_iterator_tag iterator_category;
432 typedef typename std::conditional<std::is_const<Graph>::value,
433 const typename Graph::edge_vector_t,
434 typename Graph::edge_vector_t>::type
442 unsigned s = tv_.size();
445 while (t_ < s && tv_[t_].next_succ == t_);
456 : t_(tv.size()), tv_(tv)
483 reference operator*()
const 488 pointer operator->()
const 495 template <
typename Graph>
499 typedef typename std::conditional<std::is_const<Graph>::value,
500 const typename Graph::edge_vector_t,
501 typename Graph::edge_vector_t>::type
527 const unsigned* begin_;
528 const unsigned* end_;
532 : begin_(begin), end_(end)
537 : begin_(&tmp_), end_(&tmp_ + 1), tmp_(state)
541 const unsigned* begin()
const 546 const unsigned* end()
const 555 std::map<std::vector<unsigned>,
unsigned> uniq_;
565 unsigned new_univ_dests(I begin, I end)
567 std::vector<unsigned> tmp(begin, end);
568 std::sort(tmp.begin(), tmp.end());
569 tmp.erase(std::unique(tmp.begin(), tmp.end()), tmp.end());
570 auto p = uniq_.emplace(tmp, 0);
572 p.first->second = g_.new_univ_dests(tmp.begin(), tmp.end());
573 return p.first->second;
585 template <
typename State_Data,
typename Edge_Data>
597 typedef State_Data state_data_t;
598 typedef Edge_Data edge_data_t;
602 typedef unsigned state;
603 typedef unsigned edge;
611 typedef std::vector<state_storage_t> state_vector;
612 typedef std::vector<edge_storage_t> edge_vector_t;
616 typedef std::vector<unsigned> dests_vector_t;
619 state_vector states_;
620 edge_vector_t edges_;
621 dests_vector_t dests_;
623 unsigned killed_edge_;
631 digraph(
unsigned max_states = 10,
unsigned max_trans = 0)
634 states_.reserve(max_states);
636 max_trans = max_states * 2;
637 edges_.reserve(max_trans + 1);
642 edges_[0].next_succ = 0;
648 return states_.size();
656 return edges_.size() - killed_edge_ - 1;
662 return dests_.empty();
666 SPOT_DEPRECATED(
"use !is_existential() instead")
671 bool is_alternating()
const 673 return !is_existential();
682 template <
typename... Args>
685 state s = states_.size();
686 states_.emplace_back(std::forward<Args>(args)...);
696 template <
typename... Args>
699 state s = states_.size();
700 states_.reserve(s + n);
702 states_.emplace_back(std::forward<Args>(args)...);
729 typename state_storage_t::data_t&
732 return states_[s].data();
735 const typename state_storage_t::data_t&
738 return states_[s].data();
765 typename edge_storage_t::data_t&
768 return edges_[s].data();
771 const typename edge_storage_t::data_t&
774 return edges_[s].data();
783 template <
typename... Args>
787 edge t = edges_.size();
788 edges_.emplace_back(dst, 0, src, std::forward<Args>(args)...);
790 edge st = states_[src].succ_tail;
791 SPOT_ASSERT(st < t || !st);
793 states_[src].succ = t;
795 edges_[st].next_succ = t;
796 states_[src].succ_tail = t;
807 template <
typename I>
811 unsigned sz = std::distance(dst_begin, dst_end);
815 unsigned d = dests_.size();
816 dests_.emplace_back(sz);
817 dests_.insert(dests_.end(), dst_begin, dst_end);
827 template <
typename I,
typename... Args>
831 return new_edge(src, new_univ_dests(dst_begin, dst_end),
832 std::forward<Args>(args)...);
840 template <
typename... Args>
845 return new_univ_edge(src, dsts.begin(), dsts.end(),
846 std::forward<Args>(args)...);
854 const unsigned* d = dests_.data();
857 return { d + 1, d + num + 1 };
867 return univ_dests(e.dst);
873 SPOT_ASSERT(!states_.empty());
874 return &ss - &states_.front();
880 SPOT_ASSERT(!edges_.empty());
881 return &tt - &edges_.front();
889 return {
this, states_[src].succ};
895 return out(index_of_state(src));
901 return {
this, states_[src].succ};
907 return out(index_of_state(src));
918 return {
this, src.succ, src};
924 return out_iteraser(state_storage(src));
986 return (t < edges_.size() &&
987 edges_[t].next_succ != t);
996 return edges_[t].next_succ == t;
1001 return t.next_succ == index_of_edge(t);
1024 unsigned tend = edges_.size();
1025 for (
unsigned t = 1; t < tend; ++t)
1027 o <<
't' << t <<
": (s" 1028 << edges_[t].src <<
", ";
1029 int d = edges_[t].dst;
1034 o <<
") t" << edges_[t].next_succ <<
'\n';
1036 unsigned send = states_.size();
1037 for (
unsigned s = 0; s < send; ++s)
1039 o <<
's' << s <<
": t" 1040 << states_[s].succ <<
" t" 1041 << states_[s].succ_tail <<
'\n';
1043 unsigned dend = dests_.size();
1045 for (
unsigned s = 0; s < dend; ++s)
1047 o <<
'd' << s <<
": ";
1058 o << dests_[s] <<
'\n';
1069 if (killed_edge_ == 0)
1071 auto i = std::remove_if(edges_.begin() + 1, edges_.end(),
1073 return this->is_dead_edge(t);
1075 edges_.erase(i, edges_.end());
1084 template<
class Predicate = std::less<edge_storage_t>>
1089 std::stable_sort(edges_.begin() + 1, edges_.end(), p);
1098 state last_src = -1
U;
1099 edge tend = edges_.size();
1100 for (edge t = 1; t < tend; ++t)
1102 state src = edges_[t].src;
1103 if (src != last_src)
1105 states_[src].succ = t;
1106 if (last_src != -1
U)
1108 states_[last_src].succ_tail = t - 1;
1109 edges_[t - 1].next_succ = 0;
1111 while (++last_src != src)
1113 states_[last_src].succ = 0;
1114 states_[last_src].succ_tail = 0;
1119 edges_[t - 1].next_succ = t;
1122 if (last_src != -1
U)
1124 states_[last_src].succ_tail = tend - 1;
1125 edges_[tend - 1].next_succ = 0;
1127 unsigned send = states_.size();
1128 while (++last_src != send)
1130 states_[last_src].succ = 0;
1131 states_[last_src].succ_tail = 0;
1144 SPOT_ASSERT(newst.size() == states_.size());
1145 unsigned tend = edges_.size();
1146 for (
unsigned t = 1; t < tend; t++)
1148 edges_[t].dst = newst[edges_[t].dst];
1149 edges_[t].src = newst[edges_[t].src];
1160 SPOT_ASSERT(newst.size() >= states_.size());
1161 SPOT_ASSERT(used_states > 0);
1167 unsigned send = states_.size();
1168 for (state s = 0; s < send; ++s)
1170 state dst = newst[s];
1178 auto t = states_[s].succ;
1180 std::swap(t, edges_[t].next_succ);
1183 states_[dst] = std::move(states_[s]);
1185 states_.resize(used_states);
1190 unsigned tend = edges_.size();
1191 std::vector<edge> newidx(tend);
1193 for (edge t = 1; t < tend; ++t)
1195 if (is_dead_edge(t))
1198 edges_[dest] = std::move(edges_[t]);
1202 edges_.resize(dest);
1206 for (edge t = 1; t < dest; ++t)
1208 auto& tr = edges_[t];
1209 tr.src = newst[tr.src];
1210 tr.dst = newst[tr.dst];
1211 tr.next_succ = newidx[tr.next_succ];
1215 for (
auto& s: states_)
1217 s.succ = newidx[s.succ];
1218 s.succ_tail = newidx[s.succ_tail];
state new_states(unsigned n, Args &&... args)
Create n new states.
Definition: graph.hh:697
state index_of_state(const state_storage_t &ss) const
Convert a storage reference into a state number.
Definition: graph.hh:871
const edge_storage_t::data_t & edge_data(edge s) const
return the Edgeg_Data of an edge.
Definition: graph.hh:772
internal::killer_edge_iterator< digraph > out_iteraser(state src)
Return a fake container with all edges leaving src, allowing erasure.
Definition: graph.hh:922
state_vector & states()
Return the vector of states.
Definition: graph.hh:936
const dests_vector_t & dests_vector() const
The vector used to store universal destinations.
Definition: graph.hh:1010
internal::state_out< const digraph > out(state src) const
Return a fake container with all edges leaving src.
Definition: graph.hh:899
state new_state(Args &&... args)
Create a new states.
Definition: graph.hh:683
A directed graph.
Definition: graph.hh:36
void dump_storage(std::ostream &o) const
Dump the state and edge storage for debugging.
Definition: graph.hh:1022
void sort_edges_(Predicate p=Predicate())
Sort all edge according to a predicate.
Definition: graph.hh:1085
Abstract class for states.
Definition: twa.hh:50
bool is_existential() const
Whether the automaton uses only existential branching.
Definition: graph.hh:660
const state_storage_t::data_t & state_data(state s) const
return the State_Data associated to a state
Definition: graph.hh:736
internal::killer_edge_iterator< digraph > out_iteraser(state_storage_t &src)
Return a fake container with all edges leaving src, allowing erasure.
Definition: graph.hh:916
edge_storage_t & edge_storage(edge s)
return a reference to the storage of an edge
Definition: graph.hh:748
edge new_edge(state src, state dst, Args &&... args)
Create a new edge.
Definition: graph.hh:785
const state_vector & states() const
Return the vector of states.
Definition: graph.hh:931
state_storage_t::data_t & state_data(state s)
return the State_Data associated to a state
Definition: graph.hh:730
internal::state_out< const digraph > out(state_storage_t &src) const
Return a fake container with all edges leaving src.
Definition: graph.hh:905
void remove_dead_edges_()
Remove all dead edges.
Definition: graph.hh:1067
state_storage_t & state_storage(state s)
return a reference to the storage of a state
Definition: graph.hh:712
const state_storage_t & state_storage(state s) const
return a reference to the storage of a state
Definition: graph.hh:718
internal::all_trans< const digraph > edges() const
Return a fake container with all edges (exluding erased edges)
Definition: graph.hh:946
bool is_dead_edge(unsigned t) const
Tests whether an edge has been erased.
Definition: graph.hh:994
internal::all_trans< digraph > edges()
Return a fake container with all edges (exluding erased edges)
Definition: graph.hh:951
edge_storage_t::data_t & edge_data(edge s)
return the Edgeg_Data of an edge.
Definition: graph.hh:766
const edge_storage_t & edge_storage(edge s) const
return a reference to the storage of an edge
Definition: graph.hh:754
edge_vector_t & edge_vector()
Return the vector of all edges.
Definition: graph.hh:970
unsigned num_states() const
The number of states in the automaton.
Definition: graph.hh:646
const edge_vector_t & edge_vector() const
Return the vector of all edges.
Definition: graph.hh:965
dests_vector_t & dests_vector()
The vector used to store universal destinations.
Definition: graph.hh:1015
edge new_univ_edge(state src, const std::initializer_list< state > &dsts, Args &&... args)
Create a new universal edge.
Definition: graph.hh:842
unsigned num_edges() const
The number of edges in the automaton.
Definition: graph.hh:654
bool is_valid_edge(edge t) const
Test whether the given edge is valid.
Definition: graph.hh:982
edge index_of_edge(const edge_storage_t &tt) const
Conveart a storage reference into an edge number.
Definition: graph.hh:878
void rename_states_(const std::vector< unsigned > &newst)
Rename all the states in the edge vector.
Definition: graph.hh:1142
internal::state_out< digraph > out(state src)
Return a fake container with all edges leaving src.
Definition: graph.hh:887
void defrag_states(std::vector< unsigned > &&newst, unsigned used_states)
Rename and remove states.
Definition: graph.hh:1158
internal::state_out< digraph > out(state_storage_t &src)
Return a fake container with all edges leaving src.
Definition: graph.hh:893
state new_univ_dests(I dst_begin, I dst_end)
Create a new universal destination group.
Definition: graph.hh:809
digraph(unsigned max_states=10, unsigned max_trans=0)
Construct an empty graph.
Definition: graph.hh:631
edge new_univ_edge(state src, I dst_begin, I dst_end, Args &&... args)
Create a new universal edge.
Definition: graph.hh:829
void chain_edges_()
Reconstruct the chain of outgoing edges.
Definition: graph.hh:1096
bool is_dead_edge(const edge_storage_t &t) const
Tests whether an edge has been erased.
Definition: graph.hh:999