/*
 *  Main authors:
 *     Guido Tack <tack@gecode.org>
 *
 *  Copyright:
 *     Guido Tack, 2006
 *
 *  Last modified:
 *     $Date: 2007-11-26 15:48:52 +0100 (Mon, 26 Nov 2007) $ by $Author: tack $
 *     $Revision: 5437 $
 *
 *  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.
 *
 */

namespace Gecode { 

  namespace Gist {
    /// Implement branch-and-bound constraining function
    template <class S>
    class GistBetter : public Better {
    public:
      virtual void constrain(Space* s, Space* best) {
        static_cast<S*>(s)->constrain(best);
      }
    };

    template <class S>
    PrintingInspector<S>::PrintingInspector(const std::string& name)
    : TextInspector(name) {}
    
    template <class S>
    void
    PrintingInspector<S>::inspect(Space* node) {
      init();
      dynamic_cast<S*>(node)->print(getStream());
    }
    
  }

  template <class S>
  int exploreBest(S* root, Gist::Inspector* gi) {
    Gist::GistBetter<S>* gb = new Gist::GistBetter<S>();
    return Gist::explore(root, gb, gi);
  }

  template <class S>
  void exploreBestWidget(QWidget* parent, S* root, Gist::Inspector* gi) {
    Gist::GistBetter<S>* gb = new Gist::GistBetter<S>();
    (void) Gist::exploreWidget(parent, root, gb, gi);
  }

}

// STATISTICS: gist-any