/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
 *  Main authors:
 *     Christian Schulte <schulte@gecode.org>
 *
 *  Copyright:
 *     Christian Schulte, 2009
 *
 *  Last modified:
 *     $Date: 2011-05-26 00:56:41 +1000 (Thu, 26 May 2011) $ by $Author: schulte $
 *     $Revision: 12022 $
 *
 *  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.
 *
 */

#include <algorithm>

namespace Gecode { namespace Int {

  template<class TaskView, SortTaskOrder sto, bool inc>
  forceinline
  TaskViewIter<TaskView,sto,inc>::TaskViewIter(void) {}

  template<class TaskView, SortTaskOrder sto, bool inc>
  forceinline
  TaskViewIter<TaskView,sto,inc>
  ::TaskViewIter(Region& r, const TaskViewArray<TaskView>& t)
    : map(r.alloc<int>(t.size())), i(t.size()-1) {
    sort<TaskView,sto,!inc>(map,t);
  }

  template<class TaskView, SortTaskOrder sto, bool inc>
  forceinline bool
  TaskViewIter<TaskView,sto,inc>::operator ()(void) const {
    return i>=0;
  }
  template<class TaskView, SortTaskOrder sto, bool inc>
  forceinline int
  TaskViewIter<TaskView,sto,inc>::left(void) const {
    return i+1;
  }
  template<class TaskView, SortTaskOrder sto, bool inc>
  forceinline void
  TaskViewIter<TaskView,sto,inc>::operator ++(void) {
    i--;
  }

  template<class TaskView, SortTaskOrder sto, bool inc>
  forceinline int
  TaskViewIter<TaskView,sto,inc>::task(void) const {
    return map[i];
  }


  template<class OptTaskView, SortTaskOrder sto, bool inc>
  forceinline
  ManTaskViewIter<OptTaskView,sto,inc>
  ::ManTaskViewIter(Region& r, const TaskViewArray<OptTaskView>& t) {
    map = r.alloc<int>(t.size()); i=0;
    for (int j=t.size(); j--; )
      if (t[j].mandatory())
        map[i++]=j;
    sort<OptTaskView,sto,!inc>(map,i,t); 
    i--;
  }


}}

// STATISTICS: int-prop