Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
9.2 kB · 356 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2004 * * This file is part of Gecode, the generic constraint * development environment: * http://www.gecode.org * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * */
#include <sstream>
namespace Gecode {
/** * \brief Data stored for a %DFA * */ class DFA::DFAI : public SharedHandle::Object { public: /// Number of states int n_states; /// Number of symbols unsigned int n_symbols; /// Number of transitions int n_trans; /// Maximal degree (in-degree and out-degree of any state) and maximal number of transitions per symbol unsigned int max_degree; /// First final state int final_fst; /// Last final state int final_lst; /// Hash key std::size_t key; /// The transitions Transition* trans; /// Specification of transition range class HashEntry { public: int symbol; ///< Symbol const Transition* fst; ///< First transition for the symbol const Transition* lst; ///< Last transition for the symbol }; /// The transition hash table by symbol HashEntry* table; /// Size of table (as binary logarithm) int n_log; /// Fill hash table void fill(void); /// Initialize automaton implementation with \a nt transitions DFAI(int nt); /// Initialize automaton implementation as empty GECODE_INT_EXPORT DFAI(void); /// Delete automaton implemenentation virtual ~DFAI(void); };
forceinline DFA::DFAI::DFAI(int nt) : trans(nt == 0 ? nullptr : heap.alloc<Transition>(nt)) {}
forceinline DFA::DFAI::~DFAI(void) { if (n_trans > 0) heap.rfree(trans); heap.rfree(table); }
forceinline void DFA::DFAI::fill(void) { key = static_cast<std::size_t>(n_states); cmb_hash(key, n_trans); cmb_hash(key, n_symbols); cmb_hash(key, final_fst); cmb_hash(key, final_lst); // Compute smallest logarithm larger than n_symbols n_log = 1; while (n_symbols >= static_cast<unsigned int>(1<<n_log)) n_log++; // Allocate memory table = heap.alloc<HashEntry>(1<<n_log); // Initialize table for (int i=(1<<n_log); i--; ) table[i].fst = table[i].lst = nullptr; int mask = (1 << n_log) - 1; // Enter transitions to table for (int i = 0; i<n_trans; ) { cmb_hash(key, trans[i].i_state); cmb_hash(key, trans[i].symbol); cmb_hash(key, trans[i].o_state); int s = trans[i].symbol; Transition* fst = &trans[i]; i++; while ((i<n_trans) && (trans[i].symbol == s)) i++; Transition* lst = &trans[i]; // Enter with linear collision resolution int p = s & mask; while (table[p].fst != nullptr) p = (p+1) & mask; table[p].symbol = s; table[p].fst = fst; table[p].lst = lst; } }
forceinline DFA::DFA(void) {}
forceinline DFA::DFA(const DFA& d) : SharedHandle(d) {}
forceinline int DFA::n_states(void) const { const DFAI* d = static_cast<DFAI*>(object()); return (d == nullptr) ? 1 : d->n_states; }
forceinline unsigned int DFA::n_symbols(void) const { const DFAI* d = static_cast<DFAI*>(object()); return (d == nullptr) ? 0 : d->n_symbols; }
forceinline int DFA::n_transitions(void) const { const DFAI* d = static_cast<DFAI*>(object()); return (d == nullptr) ? 0 : d->n_trans; }
forceinline unsigned int DFA::max_degree(void) const { const DFAI* d = static_cast<DFAI*>(object()); return (d == nullptr) ? 0 : d->max_degree; }
forceinline int DFA::final_fst(void) const { const DFAI* d = static_cast<DFAI*>(object()); return (d == nullptr) ? 0 : d->final_fst; }
forceinline int DFA::final_lst(void) const { const DFAI* d = static_cast<DFAI*>(object()); return (d == nullptr) ? 0 : d->final_lst; }
forceinline int DFA::symbol_min(void) const { const DFAI* d = static_cast<DFAI*>(object()); return ((d != nullptr) && (d->n_trans > 0)) ? d->trans[0].symbol : Int::Limits::min; }
forceinline int DFA::symbol_max(void) const { const DFAI* d = static_cast<DFAI*>(object()); return ((d != nullptr) && (d->n_trans > 0)) ? d->trans[d->n_trans-1].symbol : Int::Limits::max; }
forceinline std::size_t DFA::hash(void) const { const DFAI* d = static_cast<DFAI*>(object()); return (d != nullptr) ? d->key : 0; }
/* * Constructing transitions * */
forceinline DFA::Transition::Transition(void) {}
forceinline DFA::Transition::Transition(int i_state0, int symbol0, int o_state0) : i_state(i_state0), symbol(symbol0), o_state(o_state0) {}
/* * Iterating over all transitions * */
forceinline DFA::Transitions::Transitions(const DFA& d) { const DFAI* o = static_cast<DFAI*>(d.object()); if (o != nullptr) { c_trans = &o->trans[0]; e_trans = c_trans+o->n_trans; } else { c_trans = e_trans = nullptr; } }
forceinline DFA::Transitions::Transitions(const DFA& d, int n) { const DFAI* o = static_cast<DFAI*>(d.object()); if (o != nullptr) { int mask = (1<<o->n_log)-1; int p = n & mask; while ((o->table[p].fst != nullptr) && (o->table[p].symbol != n)) p = (p+1) & mask; c_trans = o->table[p].fst; e_trans = o->table[p].lst; } else { c_trans = e_trans = nullptr; } }
forceinline bool DFA::Transitions::operator ()(void) const { return c_trans < e_trans; }
forceinline void DFA::Transitions::operator ++(void) { c_trans++; }
forceinline int DFA::Transitions::i_state(void) const { return c_trans->i_state; }
forceinline int DFA::Transitions::symbol(void) const { return c_trans->symbol; }
forceinline int DFA::Transitions::o_state(void) const { return c_trans->o_state; }
/* * Iterating over symbols * */
forceinline DFA::Symbols::Symbols(const DFA& d) { const DFAI* o = static_cast<DFAI*>(d.object()); if (o != nullptr) { c_trans = &o->trans[0]; e_trans = c_trans+o->n_trans; } else { c_trans = e_trans = nullptr; } }
forceinline bool DFA::Symbols::operator ()(void) const { return c_trans < e_trans; }
forceinline void DFA::Symbols::operator ++(void) { int s = c_trans->symbol; do { c_trans++; } while ((c_trans < e_trans) && (s == c_trans->symbol)); }
forceinline int DFA::Symbols::val(void) const { return c_trans->symbol; }
template<class Char, class Traits> std::basic_ostream<Char,Traits>& operator <<(std::basic_ostream<Char,Traits>& os, const DFA& d) { std::basic_ostringstream<Char,Traits> st; st.copyfmt(os); st.width(0); st << "Start state: 0" << std::endl << "States: 0..." << d.n_states()-1 << std::endl << "Transitions:"; for (int s = 0; s < static_cast<int>(d.n_states()); s++) { DFA::Transitions t(d); int n = 0; while (t()) { if (t.i_state() == s) { if ((n % 4) == 0) st << std::endl << "\t"; st << "[" << t.i_state() << "]" << "- " << t.symbol() << " >" << "[" << t.o_state() << "] "; ++n; } ++t; } } st << std::endl << "Final states: " << std::endl << "\t[" << d.final_fst() << "] ... [" << d.final_lst()-1 << "]" << std::endl; return os << st.str(); }
forceinline bool DFA::operator ==(const DFA& d) const { if (n_states() != d.n_states()) return false; if (n_transitions() != d.n_transitions()) return false; if (n_symbols() != d.n_symbols()) return false; if (max_degree() != d.max_degree()) return false; if (final_fst() != d.final_fst()) return false; if (final_lst() != d.final_lst()) return false; return equal(d); }
forceinline bool DFA::operator !=(const DFA& d) const { return !(*this == d); }
}
// STATISTICS: int-prop