dfa_mtf.h

一个类似STL的自动机的源代码库

/*
 * ASTL - the Automaton Standard Template Library.
 * C++ generic components for Finite State Automata handling.
 * Copyright (C) 2000-2003 Vincent Le Maout ([e-mail]).
 * 
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 * 
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 */

// Descrition:	
//   ASTL 2.0 Determinisic Finite Automaton Class Template DFA_mtf
//   Representation by arrays with move-to-front method                 

#ifndef ASTL_DFA_MTF_H
#define ASTL_DFA_MTF_H

#include <algorithm>  // find_if
#include <list>
#include <astl.h>
#include <dfa_base.h>

ASTL_BEGIN_NAMESPACE

template <class Sigma_ = plain,
          class Tag_   = empty_tag>
class DFA_mtf 
  : public DFA_base<Sigma_, Tag_, list<pair<typename Sigma_::char_type, unsigned int> > >
{
protected:
  typedef list<pair<typename Sigma_::char_type, unsigned int> > transition_container;
	
public:
  typedef DFA_base<Sigma_, Tag_, list<pair<typename Sigma_::char_type, unsigned int> > > super;
  typedef typename super::char_traits     char_traits;
  typedef Tag_                            tag_type;
  typedef typename char_traits::char_type char_type;
  typedef unsigned int                    state_type;

  
  // Backward compatibility
  typedef char_traits Sigma;
  typedef char_type   Alphabet;
  typedef tag_type    Tag;
  typedef state_type  State;

  class edges_type
  {
    friend class DFA_mtf;
  protected:
    const transition_container *container;

  public:
    typedef char_type                 key_type;
    typedef state_type                data_type;
    typedef pair<key_type, data_type> value_type;
    typedef value_type*               pointer;
    typedef const value_type*         const_pointer;
    typedef value_type&               reference;
    typedef const value_type&         const_reference;
    typedef unsigned int              size_type;
    typedef int                       difference_type;
    
    struct key_compare : public binary_function<key_type, key_type, bool>
    {
      bool operator () (const key_type &x, const key_type &y) const {
	return char_traits::eq(x, y);
      }
    }; 

    struct value_compare : public binary_function<value_type, value_type, bool>
    {
      bool operator () (const value_type& x, const value_type& y) const {
	return key_compare()(x.first, y.first);
      }
    };
    
    typedef typename transition_container::const_iterator         const_iterator;
    typedef typename transition_container::const_reverse_iterator const_reverse_iterator;

  protected:
    edges_type(const transition_container *c = NULL)
      : container(c) { }
    
  public:
    edges_type(const edges_type& x) 
      : container(x.container) { }
    
    key_compare key_comp() const { 
      return key_compare();
    }

    value_compare value_comp() const { 
      return value_compare();
    }

    const_iterator begin() const { 
      return (container->begin()); 
    }

    const_iterator end() const { 
      return (container->end()); 
    }

    const_reverse_iterator rbegin() const { 
      return (container->rbegin()); 
    }

    const_reverse_iterator rend() const { 
      return (container->rend()); 
    }

    bool empty() const {    
      return (container->empty()); 
    }

    size_type size() const {   // Warning: list is allowed to compute size() in linear time !!!!!
      return (container->size()); 
    }

    size_type max_size() const { 
      return (container->max_size()); 
    }
    
    const_iterator find(const key_type& x) const { 
#if (__GNUG__ && __GNUG__ < 3)
      return find_if(container->begin(), container->end(), 
		     compose1(bind2nd(key_compare(), x), select1st<value_type>()));
#else
      return find_if(container->begin(), container->end(), 
		     __gnu_cxx::compose1(bind2nd(key_compare(), x), __gnu_cxx::select1st<value_type>()));
#endif
    }

    size_type count(const key_type& x) const { 
      return find(x) == end() ? 0 : 1; 
    }

    const_iterator lower_bound(const key_type& x) const { 
      return find(x);
    }

    const_iterator upper_bound(const key_type& x) const { 
      const_iterator result = find(x);
      return result == end() ? result : ++result;
    }

    pair<const_iterator, const_iterator> equal_range(const key_type& x) const {
      const_iterator i = find(x);
      return i == end() ? make_pair(i, i) : make_pair(i, ++i);
    }
    
    friend bool operator==(const edges_type& x, const edges_type& y) {
      return x.container == y.container || *x.container == *y.container;
    }
  };

  void set_trans(state_type s, const char_type &a, state_type aim)
  {
    Q[s]->edges().push_back(make_pair(a, aim));
    ++trans_count_;
  }

  void del_trans(state_type s, const char_type &a)
  {
#if (__GNUG__ && __GNUG__ < 3)
    Q[s]->edges().erase(find_if(Q[s]->edges().begin(), Q[s]->edges().end(), 
				compose1(bind2nd(edges_type::key_compare(), a), 
					 select1st<pair<char_type, state_type> >())));
#else
    Q[s]->edges().erase(find_if(Q[s]->edges().begin(), Q[s]->edges().end(), 
				__gnu_cxx::compose1(bind2nd(edges_type::key_compare(), a), 
					 __gnu_cxx::select1st<pair<char_type, state_type> >())));
#endif
    --trans_count_;
  }

  void change_trans(state_type s, const char_type &a, state_type new_aim) {
#if (__GNUG__ && __GNUG__ < 3)
    (*find_if(Q[s]->edges().begin(), Q[s]->edges().end(), 
	      compose1(bind2nd(edges_type::key_compare(), a), 
		       select1st<pair<char_type, state_type> >()))).second = new_aim;
#else
    (*find_if(Q[s]->edges().begin(), Q[s]->edges().end(), 
	      __gnu_cxx::compose1(bind2nd(edges_type::key_compare(), a), 
		       __gnu_cxx::select1st<pair<char_type, state_type> >()))).second = new_aim;
#endif
  }

  state_type delta1(state_type s, const char_type &a) const
  {
    transition_container &edges = Q[s]->edges();
#if (__GNUG__ && __GNUG__ < 3)
    transition_container::iterator i = find_if(edges.begin(), edges.end(), 
					       compose1(bind2nd(edges_type::key_compare(), a), 
							select1st<pair<char_type, state_type> >()));
#else
    typename transition_container::iterator i = find_if(edges.begin(), edges.end(), 
					       __gnu_cxx::compose1(bind2nd(edges_type::key_compare(), a), 
								   __gnu_cxx::select1st<pair<char_type, state_type> >()));
#endif
    if (i == edges.end()) return null_state;
    else {
      edges.push_front(*i);
      edges.erase(i);
      return (*edges.begin()).second;
    }
  }

  edges_type delta2(state_type s) const {
    return edges_type(&Q[s]->edges());
  }

  DFA_mtf(unsigned long n = 0)
    : super(n)
  { }
};

ASTL_END_NAMESPACE

#endif // ASTL_DFA_MTF_H