free_monoid.hh

// free_monoid.hh: this file is part of the Vaucanson project.
//
// Vaucanson, a generic library for finite state machines.
//
// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2008 The Vaucanson Group.
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 2
// of the License, or (at your option) any later version.
//
// The complete GNU General Public Licence Notice can be found as the
// `COPYING' file in the root directory.
//
// The Vaucanson Group consists of people listed in the `AUTHORS' file.
//
#ifndef VCSN_ALGEBRA_IMPLEMENTATION_MONOID_FREE_MONOID_HH
# define VCSN_ALGEBRA_IMPLEMENTATION_MONOID_FREE_MONOID_HH

# include <set>

# include <vaucanson/algebra/concept/freemonoid_base.hh>
# include <vaucanson/algebra/implementation/monoid/monoid_rep.hh>
# include <vaucanson/algebra/implementation/alphabets/alphabet_set.hh>
# include <vaucanson/misc/unique.hh>
# include <vaucanson/misc/usual_macros.hh>

namespace vcsn
{
  namespace algebra
  {  
    /*---------------.
    | Predeclaration |
    `---------------*/

    template <typename A>
    struct FreeMonoid;

    /*-------------------------------------------------------------.
    | Specialization of the monoid_rep structure for int letter    |
    | based free monoids.                                          |
    `-------------------------------------------------------------*/

    template <>
    struct monoid_rep<FreeMonoid<Element<AlphabetSet<int>, std::set<int> > > >
    : monoid_rep<FreeMonoid<Element<AlphabetSet<char>, std::set<char> > > >
    {
      // Type helpers.
      typedef monoid_rep<FreeMonoid<Element<AlphabetSet<char>,
              std::set<char> > > > parent_t;

      using parent_t::empty;
      using parent_t::concat;
      using parent_t::maybe_epsilon;

      monoid_rep();
    };

    /*--------------.
    | FreeMonoid<A> |
    `--------------*/

    template<typename A>
    struct FreeMonoid
      : FreeMonoidBase<FreeMonoid<A> >
    {
      // Type helpers.
      typedef A alphabets_elt_t;
      typedef monoid_rep<FreeMonoid<A> > monoid_rep_t;
      typedef boost::shared_ptr<monoid_rep_t> shared_monoid_rep_t;

      FreeMonoid(const A& a);

      FreeMonoid(const A& a, monoid_rep_t mr);

      FreeMonoid(const FreeMonoid& w);

      const shared_monoid_rep_t representation() const;

      A&        alphabet();

      const A&  alphabet() const;

    public:
      void set_representation(monoid_rep_t mr);

    protected:
      shared_monoid_rep_t rep_;
      A alph_;
    };

    template<typename A>
    bool operator==(const FreeMonoid<A>& a,
                    const FreeMonoid<A>& b);

  } // ! algebra
  
  /*-------------------------------.
  | dynamic_traits<FreeMonoid<A> > |
  `-------------------------------*/
  template<typename A>
  struct dynamic_traits<algebra::FreeMonoid<A> >
    : dynamic_traits<algebra::FreeMonoidBase<algebra::FreeMonoid<A> > >
  {
    static const bool           ret = A::dynamic;
  };

  /*------------------------------.
  | MetaElement<FreeMonoid<A>, T> |
  `------------------------------*/
  template<typename A, typename T>
  struct MetaElement<algebra::FreeMonoid<A>, T>
    : MetaElement<algebra::FreeMonoidBase<algebra::FreeMonoid<A> >, T>
  {};

  template <class A>
  struct virtual_types<algebra::FreeMonoid<A> >
    : virtual_types<algebra::FreeMonoidBase<algebra::FreeMonoid<A> > >
  {
    typedef A           alphabet_t;
  };

  enum op_choose_max_word_length_t { op_choose_max_word_length = 32 };

} // ! vcsn

# if !defined VCSN_USE_INTERFACE_ONLY || defined VCSN_USE_LIB
#  include <vaucanson/algebra/implementation/monoid/free_monoid.hxx>
# endif // VCSN_USE_INTERFACE_ONLY

#endif // ! VCSN_ALGEBRA_IMPLEMENTATION_MONOID_FREE_MONOID_HH

---