/*

    This file is part of the Maude 3 interpreter.

    Copyright 1997-2003 SRI International, Menlo Park, CA 94025, USA.

    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.

*/

//
//      Implementation for class SortCheckSubproblem
//

//	utility stuff
#include "macros.hh"
#include "vector.hh"

//      forward declarations
#include "interface.hh"
#include "core.hh"

//      interface class definitions
#include "symbol.hh"
#include "dagNode.hh"

//      core class definitions
#include "sortCheckSubproblem.hh"

SortCheckSubproblem::SortCheckSubproblem(DagNode* subject, const Sort* sort) :
  subject(subject), sort(sort)
{
  result = UNDEFINED;
}

bool
SortCheckSubproblem::solve(bool findFirst, RewritingContext& solution)
{
  if (!findFirst)
    return false;	// only ever one way to solve; otherwise infinite loop
  if (result == UNDEFINED)
    result = subject->checkSort(sort, solution);
  return result;
}

