scoringCache_tpl.h

Go to the documentation of this file.

/***************************************************************************
 *   Copyright (C) 2005 by Christophe GONZALES and Pierre-Henri WUILLEMIN  *
 *   {prenom.nom}_at_lip6.fr                                               *
 *                                                                         *
 *   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.                                   *
 *                                                                         *
 *   This program 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 General Public License for more details.                          *
 *                                                                         *
 *   You should have received a copy of the GNU General Public License     *
 *   along with this program; if not, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
 ***************************************************************************/
#ifndef DOXYGEN_SHOULD_SKIP_THIS

namespace gum {

  namespace learning {


    template < template < typename > class ALLOC >
    INLINE typename ScoringCache< ALLOC >::allocator_type
       ScoringCache< ALLOC >::getAllocator() const {
      return *this;
    }


    template < template < typename > class ALLOC >
    INLINE ScoringCache< ALLOC >::ScoringCache(
       const typename ScoringCache< ALLOC >::allocator_type& alloc) :
        ALLOC< NodeId >(alloc) {
      GUM_CONSTRUCTOR(ScoringCache);
    }


    template < template < typename > class ALLOC >
    INLINE ScoringCache< ALLOC >::ScoringCache(
       const ScoringCache< ALLOC >&                          from,
       const typename ScoringCache< ALLOC >::allocator_type& alloc) :
        ALLOC< NodeId >(alloc),
        __scores(from.__scores) {
      GUM_CONS_CPY(ScoringCache);
    }


    template < template < typename > class ALLOC >
    INLINE ScoringCache< ALLOC >::ScoringCache(const ScoringCache< ALLOC >& from) :
        ScoringCache< ALLOC >(from, from.getAllocator()) {}


    template < template < typename > class ALLOC >
    INLINE ScoringCache< ALLOC >::ScoringCache(
       ScoringCache< ALLOC >&&                               from,
       const typename ScoringCache< ALLOC >::allocator_type& alloc) :
        ALLOC< NodeId >(alloc),
        __scores(std::move(from.__scores)) {
      GUM_CONS_MOV(ScoringCache);
    }


    template < template < typename > class ALLOC >
    INLINE ScoringCache< ALLOC >::ScoringCache(ScoringCache< ALLOC >&& from) :
        ScoringCache< ALLOC >(std::move(from), from.getAllocator()) {}


    template < template < typename > class ALLOC >
    ScoringCache< ALLOC >* ScoringCache< ALLOC >::clone(
       const typename ScoringCache< ALLOC >::allocator_type& alloc) const {
      ALLOC< ScoringCache< ALLOC > > allocator(alloc);
      ScoringCache< ALLOC >*         cache = allocator.allocate(1);
      try {
        allocator.construct(cache, *this, alloc);
      } catch (...) {
        allocator.deallocate(cache, 1);
        throw;
      }
      return cache;
    }


    template < template < typename > class ALLOC >
    ScoringCache< ALLOC >* ScoringCache< ALLOC >::clone() const {
      return clone(this->getAllocator());
    }


    template < template < typename > class ALLOC >
    INLINE ScoringCache< ALLOC >::~ScoringCache() {
      GUM_DESTRUCTOR(ScoringCache);
    }


    template < template < typename > class ALLOC >
    INLINE ScoringCache< ALLOC >& ScoringCache< ALLOC >::
                                  operator=(const ScoringCache< ALLOC >& from) {
      if (&from != this) { __scores = from.__scores; }
      return *this;
    }


    template < template < typename > class ALLOC >
    INLINE ScoringCache< ALLOC >& ScoringCache< ALLOC >::
                                  operator=(ScoringCache< ALLOC >&& from) {
      if (&from != this) { __scores = std::move(from.__scores); }
      return *this;
    }


    template < template < typename > class ALLOC >
    INLINE void ScoringCache< ALLOC >::insert(const IdSet< ALLOC >& idset,
                                              double                score) {
      __scores.insert(idset, score);
    }


    template < template < typename > class ALLOC >
    INLINE void ScoringCache< ALLOC >::insert(IdSet< ALLOC >&& idset,
                                              double           score) {
      __scores.insert(std::move(idset), std::move(score));
    }


    template < template < typename > class ALLOC >
    INLINE void ScoringCache< ALLOC >::erase(const IdSet< ALLOC >& idset) {
      __scores.erase(idset);
    }


    template < template < typename > class ALLOC >
    INLINE bool ScoringCache< ALLOC >::exists(const IdSet< ALLOC >& idset) {
      return __scores.exists(idset);
    }


    template < template < typename > class ALLOC >
    INLINE double ScoringCache< ALLOC >::score(const IdSet< ALLOC >& idset) {
      return __scores[idset];
    }


    template < template < typename > class ALLOC >
    INLINE void ScoringCache< ALLOC >::clear() {
      __scores.clear();
    }


    template < template < typename > class ALLOC >
    INLINE std::size_t ScoringCache< ALLOC >::size() const {
      return __scores.size();
    }


  } /* namespace learning */

} /* namespace gum */

#endif /* DOXYGEN_SHOULD_SKIP_THIS */