22 #include <spot/misc/common.hh> 24 #include <type_traits> 34 template <
typename State_Data,
typename Edge_Data>
40 template <
typename Of,
typename ...Args>
43 static const bool value =
false;
46 template <
typename Of,
typename Arg1,
typename ...Args>
49 static const bool value =
50 std::is_base_of<Of, typename std::decay<Arg1>::type>::value;
60 template <typename Data, bool boxed = !std::is_class<Data>::value>
67 template <
typename... Args,
68 typename =
typename std::enable_if<
70 boxed_label(Args&&... args)
71 noexcept(std::is_nothrow_constructible<Data, Args...>::value)
72 : label{std::forward<Args>(args)...}
79 explicit boxed_label()
80 noexcept(std::is_nothrow_constructible<Data>::value)
89 const Data& data()
const 94 bool operator<(
const boxed_label& other)
const 96 return label < other.label;
103 typedef std::tuple<> data_t;
109 const std::tuple<>& data()
const 116 template <
typename Data>
122 template <
typename... Args,
123 typename =
typename std::enable_if<
125 boxed_label(Args&&... args)
126 noexcept(std::is_nothrow_constructible<Data, Args...>::value)
127 : Data{std::forward<Args>(args)...}
134 explicit boxed_label()
135 noexcept(std::is_nothrow_constructible<Data>::value)
144 const Data& data()
const 157 template <
typename Edge,
typename State_Data>
164 template <
typename... Args,
165 typename =
typename std::enable_if<
167 distate_storage(Args&&... args)
168 noexcept(std::is_nothrow_constructible<State_Data, Args...>::value)
169 : State_Data{std::forward<Args>(args)...}
181 template <
typename StateIn,
182 typename StateOut,
typename Edge,
typename Edge_Data>
193 noexcept(std::is_nothrow_constructible<Edge_Data>::value)
199 template <
typename... Args>
201 StateIn src, Args&&... args)
202 noexcept(std::is_nothrow_constructible<Edge_Data, Args...>::value
203 && std::is_nothrow_constructible<StateOut, StateOut>::value
204 && std::is_nothrow_constructible<Edge, Edge>::value)
205 : Edge_Data{std::forward<Args>(args)...},
206 dst(dst), next_succ(next_succ), src(src)
222 return this->data() < other.data();
227 return src == other.src &&
229 this->data() == other.data();
241 template <
typename Graph>
245 typedef typename std::conditional<std::is_const<Graph>::value,
246 const typename Graph::edge_storage_t,
247 typename Graph::edge_storage_t>::type
249 typedef value_type& reference;
250 typedef value_type* pointer;
251 typedef std::ptrdiff_t difference_type;
252 typedef std::forward_iterator_tag iterator_category;
254 typedef typename Graph::edge edge;
276 reference operator*()
const 278 return g_->edge_storage(t_);
281 pointer operator->()
const 283 return &g_->edge_storage(t_);
288 t_ = operator*().next_succ;
295 t_ = operator*().next_succ;
299 operator bool()
const 314 template <
typename Graph>
319 typedef typename Graph::state_storage_t state_storage_t;
320 typedef typename Graph::edge edge;
323 : super(g, t), src_(src), prev_(0)
330 this->t_ = this->operator*().next_succ;
344 edge next = this->operator*().next_succ;
349 this->g_->edge_storage(prev_).next_succ = next;
353 if (src_.succ == this->t_)
356 if (src_.succ_tail == this->t_)
358 src_.succ_tail = prev_;
359 SPOT_ASSERT(next == 0);
363 this->operator*().next_succ = this->t_;
368 ++this->g_->killed_edge_;
372 state_storage_t& src_;
383 template <
typename Graph>
387 typedef typename Graph::edge edge;
417 template <
typename Graph>
421 typedef typename std::conditional<std::is_const<Graph>::value,
422 const typename Graph::edge_storage_t,
423 typename Graph::edge_storage_t>::type
425 typedef value_type& reference;
426 typedef value_type* pointer;
427 typedef std::ptrdiff_t difference_type;
428 typedef std::forward_iterator_tag iterator_category;
431 typedef typename std::conditional<std::is_const<Graph>::value,
432 const typename Graph::edge_vector_t,
433 typename Graph::edge_vector_t>::type
441 unsigned s = tv_.size();
444 while (t_ < s && tv_[t_].next_succ == t_);
455 : t_(tv.size()), tv_(tv)
482 reference operator*()
const 487 pointer operator->()
const 494 template <
typename Graph>
498 typedef typename std::conditional<std::is_const<Graph>::value,
499 const typename Graph::edge_vector_t,
500 typename Graph::edge_vector_t>::type
526 const unsigned* begin_;
527 const unsigned* end_;
531 : begin_(begin), end_(end)
536 : begin_(&tmp_), end_(&tmp_ + 1), tmp_(state)
540 const unsigned* begin()
const 545 const unsigned* end()
const 554 std::map<std::vector<unsigned>,
unsigned> uniq_;
564 unsigned new_univ_dests(I begin, I end)
566 std::vector<unsigned> tmp(begin, end);
567 std::sort(tmp.begin(), tmp.end());
568 tmp.erase(std::unique(tmp.begin(), tmp.end()), tmp.end());
569 auto p = uniq_.emplace(tmp, 0);
571 p.first->second = g_.new_univ_dests(tmp.begin(), tmp.end());
572 return p.first->second;
584 template <
typename State_Data,
typename Edge_Data>
596 typedef State_Data state_data_t;
597 typedef Edge_Data edge_data_t;
601 typedef unsigned state;
602 typedef unsigned edge;
610 typedef std::vector<state_storage_t> state_vector;
611 typedef std::vector<edge_storage_t> edge_vector_t;
615 typedef std::vector<unsigned> dests_vector_t;
618 state_vector states_;
619 edge_vector_t edges_;
620 dests_vector_t dests_;
622 unsigned killed_edge_;
630 digraph(
unsigned max_states = 10,
unsigned max_trans = 0)
633 states_.reserve(max_states);
635 max_trans = max_states * 2;
636 edges_.reserve(max_trans + 1);
641 edges_[0].next_succ = 0;
647 return states_.size();
655 return edges_.size() - killed_edge_ - 1;
661 return dests_.empty();
665 SPOT_DEPRECATED(
"use !is_existential() instead")
670 bool is_alternating()
const 672 return !is_existential();
681 template <
typename... Args>
684 state s = states_.size();
685 states_.emplace_back(std::forward<Args>(args)...);
695 template <
typename... Args>
698 state s = states_.size();
699 states_.reserve(s + n);
701 states_.emplace_back(std::forward<Args>(args)...);
728 typename state_storage_t::data_t&
731 return states_[s].data();
734 const typename state_storage_t::data_t&
737 return states_[s].data();
764 typename edge_storage_t::data_t&
767 return edges_[s].data();
770 const typename edge_storage_t::data_t&
773 return edges_[s].data();
782 template <
typename... Args>
786 edge t = edges_.size();
787 edges_.emplace_back(dst, 0, src, std::forward<Args>(args)...);
789 edge st = states_[src].succ_tail;
790 SPOT_ASSERT(st < t || !st);
792 states_[src].succ = t;
794 edges_[st].next_succ = t;
795 states_[src].succ_tail = t;
806 template <
typename I>
810 unsigned sz = std::distance(dst_begin, dst_end);
814 unsigned d = dests_.size();
815 dests_.emplace_back(sz);
816 dests_.insert(dests_.end(), dst_begin, dst_end);
826 template <
typename I,
typename... Args>
830 return new_edge(src, new_univ_dests(dst_begin, dst_end),
831 std::forward<Args>(args)...);
839 template <
typename... Args>
844 return new_univ_edge(src, dsts.begin(), dsts.end(),
845 std::forward<Args>(args)...);
853 const unsigned* d = dests_.data();
856 return { d + 1, d + num + 1 };
866 return univ_dests(e.dst);
872 SPOT_ASSERT(!states_.empty());
873 return &ss - &states_.front();
879 SPOT_ASSERT(!edges_.empty());
880 return &tt - &edges_.front();
888 return {
this, states_[src].succ};
894 return out(index_of_state(src));
900 return {
this, states_[src].succ};
906 return out(index_of_state(src));
917 return {
this, src.succ, src};
923 return out_iteraser(state_storage(src));
985 return (t < edges_.size() &&
986 edges_[t].next_succ != t);
995 return edges_[t].next_succ == t;
1000 return t.next_succ == index_of_edge(t);
1023 unsigned tend = edges_.size();
1024 for (
unsigned t = 1; t < tend; ++t)
1026 o <<
't' << t <<
": (s" 1027 << edges_[t].src <<
", ";
1028 int d = edges_[t].dst;
1033 o <<
") t" << edges_[t].next_succ <<
'\n';
1035 unsigned send = states_.size();
1036 for (
unsigned s = 0; s < send; ++s)
1038 o <<
's' << s <<
": t" 1039 << states_[s].succ <<
" t" 1040 << states_[s].succ_tail <<
'\n';
1042 unsigned dend = dests_.size();
1044 for (
unsigned s = 0; s < dend; ++s)
1046 o <<
'd' << s <<
": ";
1057 o << dests_[s] <<
'\n';
1061 enum dump_storage_items {
1062 DSI_GraphHeader = 1,
1063 DSI_GraphFooter = 2,
1064 DSI_StatesHeader = 4,
1066 DSI_StatesFooter = 16,
1067 DSI_States = DSI_StatesHeader | DSI_StatesBody | DSI_StatesFooter,
1068 DSI_EdgesHeader = 32,
1070 DSI_EdgesFooter = 128,
1071 DSI_Edges = DSI_EdgesHeader | DSI_EdgesBody | DSI_EdgesFooter,
1072 DSI_DestsHeader = 256,
1073 DSI_DestsBody = 512,
1074 DSI_DestsFooter = 1024,
1075 DSI_Dests = DSI_DestsHeader | DSI_DestsBody | DSI_DestsFooter,
1077 DSI_GraphHeader | DSI_States | DSI_Edges | DSI_Dests | DSI_GraphFooter,
1083 if (dsi & DSI_GraphHeader)
1084 o <<
"digraph g { \nnode [shape=plaintext]\n";
1085 unsigned send = states_.size();
1086 if (dsi & DSI_StatesHeader)
1088 o << (
"states [label=<\n" 1089 "<table border='0' cellborder='1' cellspacing='0'>\n" 1090 "<tr><td sides='b' bgcolor='yellow' port='s'>states</td>\n");
1091 for (
unsigned s = 0; s < send; ++s)
1092 o <<
"<td sides='b' bgcolor='yellow' port='s" << s <<
"'>" 1096 if (dsi & DSI_StatesBody)
1098 o <<
"<tr><td port='ss'>succ</td>\n";
1099 for (
unsigned s = 0; s < send; ++s)
1101 o <<
"<td port='ss" << s;
1102 if (states_[s].succ)
1103 o <<
"' bgcolor='cyan";
1104 o <<
"'>" << states_[s].succ <<
"</td>\n";
1106 o <<
"</tr><tr><td port='st'>succ_tail</td>\n";
1107 for (
unsigned s = 0; s < send; ++s)
1109 o <<
"<td port='st" << s;
1110 if (states_[s].succ_tail)
1111 o <<
"' bgcolor='cyan";
1112 o <<
"'>" << states_[s].succ_tail <<
"</td>\n";
1116 if (dsi & DSI_StatesFooter)
1117 o <<
"</table>>]\n";
1118 unsigned eend = edges_.size();
1119 if (dsi & DSI_EdgesHeader)
1121 o << (
"edges [label=<\n" 1122 "<table border='0' cellborder='1' cellspacing='0'>\n" 1123 "<tr><td sides='b' bgcolor='cyan' port='e'>edges</td>\n");
1124 for (
unsigned e = 1; e < eend; ++e)
1126 o <<
"<td sides='b' bgcolor='" 1127 << (e != edges_[e].next_succ ?
"cyan" :
"gray")
1128 <<
"' port='e" << e <<
"'>" << e <<
"</td>\n";
1132 if (dsi & DSI_EdgesBody)
1134 o <<
"<tr><td port='ed'>dst</td>\n";
1135 for (
unsigned e = 1; e < eend; ++e)
1137 o <<
"<td port='ed" << e;
1138 int d = edges_[e].dst;
1140 o <<
"' bgcolor='pink'>~" << ~d;
1142 o <<
"' bgcolor='yellow'>" << d;
1145 o <<
"</tr><tr><td port='en'>next_succ</td>\n";
1146 for (
unsigned e = 1; e < eend; ++e)
1148 o <<
"<td port='en" << e;
1149 if (edges_[e].next_succ)
1151 if (edges_[e].next_succ != e)
1152 o <<
"' bgcolor='cyan";
1154 o <<
"' bgcolor='gray";
1156 o <<
"'>" << edges_[e].next_succ <<
"</td>\n";
1158 o <<
"</tr><tr><td port='es'>src</td>\n";
1159 for (
unsigned e = 1; e < eend; ++e)
1160 o <<
"<td port='es" << e <<
"' bgcolor='yellow'>" 1161 << edges_[e].src <<
"</td>\n";
1164 if (dsi & DSI_EdgesFooter)
1165 o <<
"</table>>]\n";
1166 if (!dests_.empty())
1168 unsigned dend = dests_.size();
1169 if (dsi & DSI_DestsHeader)
1171 o << (
"dests [label=<\n" 1172 "<table border='0' cellborder='1' cellspacing='0'>\n" 1173 "<tr><td sides='b' bgcolor='pink' port='d'>dests</td>\n");
1177 o <<
"<td sides='b' bgcolor='pink' port='d" 1178 << d <<
"'>~" << d <<
"</td>\n";
1179 unsigned cnt = dests_[d];
1182 o <<
"<td sides='b'></td>\n";
1186 if (dsi & DSI_DestsBody)
1188 o <<
"<tr><td port='dd'>#cnt/dst</td>\n";
1192 unsigned cnt = dests_[d];
1193 o <<
"<td port='d'>#" << cnt <<
"</td>\n";
1197 o <<
"<td bgcolor='yellow' port='dd" 1198 << d <<
"'>" << dests_[d] <<
"</td>\n";
1204 if (dsi & DSI_DestsFooter)
1205 o <<
"</table>>]\n";
1207 if (dsi & DSI_GraphFooter)
1218 if (killed_edge_ == 0)
1220 auto i = std::remove_if(edges_.begin() + 1, edges_.end(),
1222 return this->is_dead_edge(t);
1224 edges_.erase(i, edges_.end());
1233 template<
class Predicate = std::less<edge_storage_t>>
1238 std::stable_sort(edges_.begin() + 1, edges_.end(), p);
1247 state last_src = -1
U;
1248 edge tend = edges_.size();
1249 for (edge t = 1; t < tend; ++t)
1251 state src = edges_[t].src;
1252 if (src != last_src)
1254 states_[src].succ = t;
1255 if (last_src != -1
U)
1257 states_[last_src].succ_tail = t - 1;
1258 edges_[t - 1].next_succ = 0;
1260 while (++last_src != src)
1262 states_[last_src].succ = 0;
1263 states_[last_src].succ_tail = 0;
1268 edges_[t - 1].next_succ = t;
1271 if (last_src != -1
U)
1273 states_[last_src].succ_tail = tend - 1;
1274 edges_[tend - 1].next_succ = 0;
1276 unsigned send = states_.size();
1277 while (++last_src != send)
1279 states_[last_src].succ = 0;
1280 states_[last_src].succ_tail = 0;
1293 SPOT_ASSERT(newst.size() == states_.size());
1294 unsigned tend = edges_.size();
1295 for (
unsigned t = 1; t < tend; t++)
1297 edges_[t].dst = newst[edges_[t].dst];
1298 edges_[t].src = newst[edges_[t].src];
1309 SPOT_ASSERT(newst.size() >= states_.size());
1310 SPOT_ASSERT(used_states > 0);
1316 unsigned send = states_.size();
1317 for (state s = 0; s < send; ++s)
1319 state dst = newst[s];
1327 auto t = states_[s].succ;
1329 std::swap(t, edges_[t].next_succ);
1332 states_[dst] = std::move(states_[s]);
1334 states_.resize(used_states);
1339 unsigned tend = edges_.size();
1340 std::vector<edge> newidx(tend);
1342 for (edge t = 1; t < tend; ++t)
1344 if (is_dead_edge(t))
1347 edges_[dest] = std::move(edges_[t]);
1351 edges_.resize(dest);
1355 for (edge t = 1; t < dest; ++t)
1357 auto& tr = edges_[t];
1358 tr.src = newst[tr.src];
1359 tr.dst = newst[tr.dst];
1360 tr.next_succ = newidx[tr.next_succ];
1364 for (
auto& s: states_)
1366 s.succ = newidx[s.succ];
1367 s.succ_tail = newidx[s.succ_tail];
state new_states(unsigned n, Args &&... args)
Create n new states.
Definition: graph.hh:696
Definition: automata.hh:26
state index_of_state(const state_storage_t &ss) const
Convert a storage reference into a state number.
Definition: graph.hh:870
const edge_storage_t::data_t & edge_data(edge s) const
return the Edgeg_Data of an edge.
Definition: graph.hh:771
internal::killer_edge_iterator< digraph > out_iteraser(state src)
Return a fake container with all edges leaving src, allowing erasure.
Definition: graph.hh:921
state_vector & states()
Return the vector of states.
Definition: graph.hh:935
const dests_vector_t & dests_vector() const
The vector used to store universal destinations.
Definition: graph.hh:1009
internal::state_out< const digraph > out(state src) const
Return a fake container with all edges leaving src.
Definition: graph.hh:898
state new_state(Args &&... args)
Create a new states.
Definition: graph.hh:682
A directed graph.
Definition: graph.hh:35
void dump_storage(std::ostream &o) const
Dump the state and edge storage for debugging.
Definition: graph.hh:1021
void sort_edges_(Predicate p=Predicate())
Sort all edges according to a predicate.
Definition: graph.hh:1234
Abstract class for states.
Definition: twa.hh:50
bool is_existential() const
Whether the automaton uses only existential branching.
Definition: graph.hh:659
const state_storage_t::data_t & state_data(state s) const
return the State_Data associated to a state
Definition: graph.hh:735
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:915
edge_storage_t & edge_storage(edge s)
return a reference to the storage of an edge
Definition: graph.hh:747
edge new_edge(state src, state dst, Args &&... args)
Create a new edge.
Definition: graph.hh:784
const state_vector & states() const
Return the vector of states.
Definition: graph.hh:930
state_storage_t::data_t & state_data(state s)
return the State_Data associated to a state
Definition: graph.hh:729
void dump_storage_as_dot(std::ostream &o, int dsi=DSI_All) const
Dump the state and edge storage for debugging.
Definition: graph.hh:1081
internal::state_out< const digraph > out(state_storage_t &src) const
Return a fake container with all edges leaving src.
Definition: graph.hh:904
void remove_dead_edges_()
Remove all dead edges.
Definition: graph.hh:1216
state_storage_t & state_storage(state s)
return a reference to the storage of a state
Definition: graph.hh:711
const state_storage_t & state_storage(state s) const
return a reference to the storage of a state
Definition: graph.hh:717
internal::all_trans< const digraph > edges() const
Return a fake container with all edges (exluding erased edges)
Definition: graph.hh:945
bool is_dead_edge(unsigned t) const
Tests whether an edge has been erased.
Definition: graph.hh:993
internal::all_trans< digraph > edges()
Return a fake container with all edges (exluding erased edges)
Definition: graph.hh:950
edge_storage_t::data_t & edge_data(edge s)
return the Edgeg_Data of an edge.
Definition: graph.hh:765
const edge_storage_t & edge_storage(edge s) const
return a reference to the storage of an edge
Definition: graph.hh:753
edge_vector_t & edge_vector()
Return the vector of all edges.
Definition: graph.hh:969
unsigned num_states() const
The number of states in the automaton.
Definition: graph.hh:645
const edge_vector_t & edge_vector() const
Return the vector of all edges.
Definition: graph.hh:964
dests_vector_t & dests_vector()
The vector used to store universal destinations.
Definition: graph.hh:1014
edge new_univ_edge(state src, const std::initializer_list< state > &dsts, Args &&... args)
Create a new universal edge.
Definition: graph.hh:841
unsigned num_edges() const
The number of edges in the automaton.
Definition: graph.hh:653
bool is_valid_edge(edge t) const
Test whether the given edge is valid.
Definition: graph.hh:981
edge index_of_edge(const edge_storage_t &tt) const
Conveart a storage reference into an edge number.
Definition: graph.hh:877
void rename_states_(const std::vector< unsigned > &newst)
Rename all the states in the edge vector.
Definition: graph.hh:1291
internal::state_out< digraph > out(state src)
Return a fake container with all edges leaving src.
Definition: graph.hh:886
void defrag_states(std::vector< unsigned > &&newst, unsigned used_states)
Rename and remove states.
Definition: graph.hh:1307
internal::state_out< digraph > out(state_storage_t &src)
Return a fake container with all edges leaving src.
Definition: graph.hh:892
state new_univ_dests(I dst_begin, I dst_end)
Create a new universal destination group.
Definition: graph.hh:808
digraph(unsigned max_states=10, unsigned max_trans=0)
Construct an empty graph.
Definition: graph.hh:630
edge new_univ_edge(state src, I dst_begin, I dst_end, Args &&... args)
Create a new universal edge.
Definition: graph.hh:828
void chain_edges_()
Reconstruct the chain of outgoing edges.
Definition: graph.hh:1245
bool is_dead_edge(const edge_storage_t &t) const
Tests whether an edge has been erased.
Definition: graph.hh:998