freemonoid_product.hxx

// freemonoid_product.hxx: this file is part of the Vaucanson project.
//
// Vaucanson, a generic library for finite state machines.
//
// Copyright (C) 2004, 2005, 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_CONCEPT_FREEMONOID_PRODUCT_HXX
# define VCSN_ALGEBRA_CONCEPT_FREEMONOID_PRODUCT_HXX

# include <vaucanson/algebra/concept/freemonoid_product.hh>

namespace vcsn
{
  namespace algebra
  {
    template <typename F, typename S>
    monoid_rep<FreeMonoidProduct<F, S> >::monoid_rep() :
    monoid_rep<F>(),
    open_par("("),
    sep(","),
    close_par(")")
    {
      maybe_epsilon.clear();

      // Sane defaults.
      maybe_epsilon.push_back("1");
      maybe_epsilon.push_back("e");

      // Trying with more than one char.
      maybe_epsilon.push_back("_e");
      maybe_epsilon.push_back("eps");

      empty = *(maybe_epsilon.begin());
      concat = "";
    }

    template <typename F, typename S>
    monoid_rep<F>
    monoid_rep<FreeMonoidProduct<F, S> >::first_projection() const
    {
      monoid_rep<F> ret;
      ret.empty = empty;
      return ret;
    }

    template <typename F, typename S>
    monoid_rep<S>
    monoid_rep<FreeMonoidProduct<F, S> >::second_projection() const
    {
      monoid_rep<S> ret;
      ret.empty = empty;
      return ret;
    }

    template <typename Semiring, typename F, typename S>
    series_rep<Semiring, FreeMonoidProduct<F, S> >::series_rep() :
    series_rep<Semiring, F>()
    {
    }

    template <typename Semiring, typename F, typename S>
    series_rep<Semiring, F>
    series_rep<Semiring, FreeMonoidProduct<F, S> >::first_projection() const
    {
      series_rep<Semiring, F> ret;

      ret.open_par = open_par;
      ret.close_par = close_par;
      ret.plus = plus;
      ret.times = times;
      ret.star = star;
      ret.zero = zero;
      ret.open_weight = open_weight;
      ret.close_weight = close_weight;
      ret.spaces = spaces;

      return ret;
    }

    template <typename Semiring, typename F, typename S>
    series_rep<Semiring, S>
    series_rep<Semiring, FreeMonoidProduct<F, S> >::second_projection() const
    {
      series_rep<Semiring, S> ret;

      ret.open_par = open_par;
      ret.close_par = close_par;
      ret.plus = plus;
      ret.times = times;
      ret.star = star;
      ret.zero = zero;
      ret.open_weight = open_weight;
      ret.close_weight = close_weight;
      ret.spaces = spaces;

      return ret;
    }

    template <typename F, typename S>
    bool
    operator==(boost::shared_ptr<monoid_rep<FreeMonoidProduct<F, S> > > lhs,
               boost::shared_ptr<monoid_rep<FreeMonoidProduct<F, S> > > rhs)
    {
      return (lhs->open_par == rhs->open_par) &&
             (lhs->sep == rhs->sep) &&
             (lhs->close_par == rhs->close_par) &&
             (static_cast<monoid_rep<F> >(lhs).representation() ==
              static_cast<monoid_rep<F> >(rhs).representation());
    }

    /*------------------------.
    | FreeMonoidProduct<F, S> |
    `------------------------*/

    template <class F, class S>
    FreeMonoidProduct<F, S>::FreeMonoidProduct(const F& a, const S& b) :
      first_monoid_ (a), second_monoid_ (b),
      rep_(monoid_rep_default<FreeMonoidProduct<F, S> >::get_instance())
    {}

    template <class F, class S>
    FreeMonoidProduct<F, S>::FreeMonoidProduct(const F& a, const S& b,
                                               monoid_rep<FreeMonoidProduct<F, S> > mr) :
      first_monoid_ (a), second_monoid_ (b),
      rep_(boost::shared_ptr<monoid_rep<FreeMonoidProduct<F, S> > >(new monoid_rep<FreeMonoidProduct<F, S> >(mr)))
    {}

    template <class F, class S>
    FreeMonoidProduct<F, S>::FreeMonoidProduct(const FreeMonoidProduct& w) :
      FreeMonoidProductBase<FreeMonoidProduct<F, S> >(w),
      first_monoid_(w.first_monoid_),
      second_monoid_(w.second_monoid_),
      rep_(w.rep_)
    {}

    template <class F, class S>
    typename FreeMonoidProduct<F, S>::first_monoid_t&
    FreeMonoidProduct<F, S>::first_monoid()
    {
      return first_monoid_;
    }

    template <class F, class S>
    const typename FreeMonoidProduct<F, S>::first_monoid_t&
    FreeMonoidProduct<F, S>::first_monoid() const
    {
      return first_monoid_;
    }

    template <class F, class S>
    typename FreeMonoidProduct<F, S>::second_monoid_t&
    FreeMonoidProduct<F, S>::second_monoid()
    {
      return second_monoid_;
    }

    template <class F, class S>
    const typename FreeMonoidProduct<F, S>::second_monoid_t&
    FreeMonoidProduct<F, S>::second_monoid() const
    {
      return second_monoid_;
    }

    template <typename F, typename S>
    const boost::shared_ptr<monoid_rep<FreeMonoidProduct<F, S> > >
    FreeMonoidProduct<F, S>::representation() const
    {
      return rep_;
    }

    template <typename F, typename S>
    void
    FreeMonoidProduct<F, S>::set_representation(monoid_rep<FreeMonoidProduct<F, S> > mr)
    {
      rep_ = boost::shared_ptr<monoid_rep<FreeMonoidProduct<F, S> > >(new monoid_rep<FreeMonoidProduct<F, S> > (mr));
    }

    template<class F, class S>
    bool operator==(const FreeMonoidProduct<F, S>& a,
                    const FreeMonoidProduct<F, S>& b)
    {
      return (a.first_monoid() == b.first_monoid()) and
             (a.second_monoid() == b.second_monoid());
    }

  } // ! algebra

} // ! vcsn

#endif // ! VCSN_ALGEBRA_CONCEPT_FREEMONOID_PRODUCT_HXX

---