22 #include <spot/misc/common.hh>
24 #include <type_traits>
30 #include <type_traits>
34 template <
typename State_Data,
typename Edge_Data,
bool Alternating = false>
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>
243 std::iterator<std::forward_iterator_tag,
245 std::conditional<std::is_const<Graph>::value,
246 const typename Graph::edge_storage_t,
247 typename Graph::edge_storage_t>::type>
250 std::iterator<std::forward_iterator_tag,
252 std::conditional<std::is_const<Graph>::value,
253 const typename Graph::edge_storage_t,
254 typename Graph::edge_storage_t>::type>
257 typedef typename Graph::edge edge;
279 typename super::reference
282 return g_->edge_storage(t_);
285 const typename super::reference
288 return g_->edge_storage(t_);
291 typename super::pointer
294 return &g_->edge_storage(t_);
297 const typename super::pointer
300 return &g_->edge_storage(t_);
305 t_ = operator*().next_succ;
312 t_ = operator*().next_succ;
316 operator bool()
const
331 template <
typename Graph>
336 typedef typename Graph::state_storage_t state_storage_t;
337 typedef typename Graph::edge edge;
340 : super(g, t), src_(src), prev_(0)
347 this->t_ = this->operator*().next_succ;
361 edge next = this->operator*().next_succ;
366 this->g_->edge_storage(prev_).next_succ = next;
370 if (src_.succ == this->t_)
373 if (src_.succ_tail == this->t_)
375 src_.succ_tail = prev_;
380 this->operator*().next_succ = this->t_;
385 ++this->g_->killed_edge_;
389 state_storage_t& src_;
400 template <
typename Graph>
404 typedef typename Graph::edge edge;
434 template <
typename Graph>
436 std::iterator<std::forward_iterator_tag,
438 std::conditional<std::is_const<Graph>::value,
439 const typename Graph::edge_storage_t,
440 typename Graph::edge_storage_t>::type>
443 std::iterator<std::forward_iterator_tag,
445 std::conditional<std::is_const<Graph>::value,
446 const typename Graph::edge_storage_t,
447 typename Graph::edge_storage_t>::type>
450 typedef typename std::conditional<std::is_const<Graph>::value,
451 const typename Graph::edge_vector_t,
452 typename Graph::edge_vector_t>::type
460 unsigned s = tv_.size();
463 while (t_ < s && tv_[t_].next_succ == t_);
474 : t_(tv.size()), tv_(tv)
501 typename super::reference
507 const typename super::reference
513 const typename super::pointer
519 typename super::pointer
527 template <
typename Graph>
530 typedef typename std::conditional<std::is_const<Graph>::value,
531 const typename Graph::edge_vector_t,
532 typename Graph::edge_vector_t>::type
559 template <
typename State_Data,
typename Edge_Data,
bool Alternating>
570 static constexpr
bool alternating()
576 typedef State_Data state_data_t;
577 typedef Edge_Data edge_data_t;
581 typedef unsigned state;
582 typedef unsigned edge;
586 typedef typename std::conditional<Alternating,
588 state>::type out_state;
590 typedef internal::distate_storage<edge,
591 internal::boxed_label<State_Data>>
593 typedef internal::edge_storage<state, out_state, edge,
594 internal::boxed_label<Edge_Data>>
596 typedef std::vector<state_storage_t> state_vector;
597 typedef std::vector<edge_storage_t> edge_vector_t;
599 state_vector states_;
600 edge_vector_t edges_;
602 unsigned killed_edge_;
610 digraph(
unsigned max_states = 10,
unsigned max_trans = 0)
613 states_.reserve(max_states);
615 max_trans = max_states * 2;
616 edges_.reserve(max_trans + 1);
621 edges_[0].next_succ = 0;
624 unsigned num_states()
const
626 return states_.size();
629 unsigned num_edges()
const
631 return edges_.size() - killed_edge_ - 1;
634 bool valid_trans(edge t)
const
638 return (t < edges_.size() &&
639 edges_[t].next_succ != t);
642 template <
typename... Args>
643 state new_state(Args&&... args)
645 state s = states_.size();
646 states_.emplace_back(std::forward<Args>(args)...);
650 template <
typename... Args>
651 state new_states(
unsigned n, Args&&... args)
653 state s = states_.size();
654 states_.reserve(s + n);
656 states_.emplace_back(std::forward<Args>(args)...);
661 state_storage(state s)
663 assert(s < states_.size());
667 const state_storage_t&
668 state_storage(state s)
const
670 assert(s < states_.size());
676 typename state_storage_t::data_t&
679 assert(s < states_.size());
680 return states_[s].data();
684 const typename state_storage_t::data_t&
685 state_data(state s)
const
687 assert(s < states_.size());
688 return states_[s].data();
694 assert(s < edges_.size());
698 const edge_storage_t&
699 edge_storage(edge s)
const
701 assert(s < edges_.size());
705 typename edge_storage_t::data_t&
708 assert(s < edges_.size());
709 return edges_[s].data();
712 const typename edge_storage_t::data_t&
713 edge_data(edge s)
const
715 assert(s < edges_.size());
716 return edges_[s].data();
719 template <
typename... Args>
721 new_edge(state src, out_state dst, Args&&... args)
723 assert(src < states_.size());
725 edge t = edges_.size();
726 edges_.emplace_back(dst, 0, src, std::forward<Args>(args)...);
728 edge st = states_[src].succ_tail;
729 assert(st < t || !st);
731 states_[src].succ = t;
733 edges_[st].next_succ = t;
734 states_[src].succ_tail = t;
738 state index_of_state(
const state_storage_t& ss)
const
740 assert(!states_.empty());
741 return &ss - &states_.front();
744 edge index_of_edge(
const edge_storage_t&
tt)
const
746 assert(!edges_.empty());
747 return &tt - &edges_.front();
750 internal::state_out<digraph>
753 return {
this, states_[src].succ};
756 internal::state_out<digraph>
757 out(state_storage_t& src)
759 return out(index_of_state(src));
762 internal::state_out<const digraph>
765 return {
this, states_[src].succ};
768 internal::state_out<const digraph>
769 out(state_storage_t& src)
const
771 return out(index_of_state(src));
774 internal::killer_edge_iterator<digraph>
775 out_iteraser(state_storage_t& src)
777 return {
this, src.succ, src};
780 internal::killer_edge_iterator<digraph>
781 out_iteraser(state src)
783 return out_iteraser(state_storage(src));
786 const state_vector& states()
const
791 state_vector& states()
796 internal::all_trans<const digraph> edges()
const
801 internal::all_trans<digraph> edges()
811 const edge_vector_t& edge_vector()
const
816 edge_vector_t& edge_vector()
821 bool is_dead_edge(
unsigned t)
const
823 return edges_[t].next_succ == t;
826 bool is_dead_edge(
const edge_storage_t& t)
const
828 return t.next_succ == index_of_edge(t);
833 void dump_storage(std::ostream& o)
const
835 unsigned tend = edges_.size();
836 for (
unsigned t = 1; t < tend; ++t)
838 o <<
't' << t <<
": (s"
839 << edges_[t].src <<
", s"
840 << edges_[t].dst <<
") t"
841 << edges_[t].next_succ <<
'\n';
843 unsigned send = states_.size();
844 for (
unsigned s = 0; s < send; ++s)
846 o <<
's' << s <<
": t"
847 << states_[s].succ <<
" t"
848 << states_[s].succ_tail <<
'\n';
856 void remove_dead_edges_()
858 if (killed_edge_ == 0)
860 auto i = std::remove_if(edges_.begin() + 1, edges_.end(),
861 [
this](
const edge_storage_t& t) {
862 return this->is_dead_edge(t);
864 edges_.erase(i, edges_.end());
871 template<
class Predicate = std::less<edge_storage_t>>
872 void sort_edges_(Predicate p = Predicate())
876 std::stable_sort(edges_.begin() + 1, edges_.end(), p);
883 state last_src = -1
U;
884 edge tend = edges_.size();
885 for (edge t = 1; t < tend; ++t)
887 state src = edges_[t].src;
890 states_[src].succ = t;
893 states_[last_src].succ_tail = t - 1;
894 edges_[t - 1].next_succ = 0;
896 while (++last_src != src)
898 states_[last_src].succ = 0;
899 states_[last_src].succ_tail = 0;
904 edges_[t - 1].next_succ = t;
909 states_[last_src].succ_tail = tend - 1;
910 edges_[tend - 1].next_succ = 0;
912 unsigned send = states_.size();
913 while (++last_src != send)
915 states_[last_src].succ = 0;
916 states_[last_src].succ_tail = 0;
926 void rename_states_(
const std::vector<unsigned>& newst)
928 assert(newst.size() == states_.size());
929 unsigned tend = edges_.size();
930 for (
unsigned t = 1; t < tend; t++)
932 edges_[t].dst = newst[edges_[t].dst];
933 edges_[t].src = newst[edges_[t].src];
937 void defrag_states(std::vector<unsigned>&& newst,
unsigned used_states)
939 assert(newst.size() == states_.size());
940 assert(used_states > 0);
946 unsigned send = states_.size();
947 for (state s = 0; s < send; ++s)
949 state dst = newst[s];
957 auto t = states_[s].succ;
959 std::swap(t, edges_[t].next_succ);
962 states_[dst] = std::move(states_[s]);
964 states_.resize(used_states);
969 unsigned tend = edges_.size();
970 std::vector<edge> newidx(tend);
972 for (edge t = 1; t < tend; ++t)
977 edges_[dest] = std::move(edges_[t]);
985 for (edge t = 1; t < dest; ++t)
987 auto& tr = edges_[t];
988 tr.next_succ = newidx[tr.next_succ];
989 tr.dst = newst[tr.dst];
990 tr.src = newst[tr.src];
991 assert(tr.dst != -1
U);
995 for (
auto& s: states_)
997 s.succ = newidx[s.succ];
998 s.succ_tail = newidx[s.succ_tail];
digraph(unsigned max_states=10, unsigned max_trans=0)
construct an empty graph
Definition: graph.hh:610