// -*- C++ -*-

/*  src/iter/iterators/EnumerationIterator.cpp  */


/*
 * Author: Philogelos A. <Philogelos@yahoo.com>
 * Maintainer: Philogelos A.
 * Keywords: C++, library, containers
 *
 * Copyright (C) 1998 Philogelos A.
 *
 * This file is part of Quercus Robusta.
 *
 * Quercus Robusta is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Library General Public License as published by
 * the Free Software Foundation; either version 2, or (at your option)
 * any later version.
 *
 * This software 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 Library General Public License for more details.
 *
 * You should have received a copy of the GNU Library General Public License
 * along with this software; see the file COPYING.LIB.  If not, write to the
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 * Boston, MA 02111-1307, USA.
 *
 */


/* $Id: EnumerationIterator.cpp,v 1.3 1999/03/03 19:09:46 philogelos Exp $ */
#if !defined(_INLINE)
static char cvsid[] = "@(#)$Id: EnumerationIterator.cpp,v 1.3 1999/03/03 19:09:46 philogelos Exp $";
static char debugFileId[] = __FILE__;
#endif


#include "iter/iterators/EnumerationIterator.hpp"
#include "defines.h"
#include "Debug.hpp"
#include "OGuard.hpp"
#include "iter/enumerations/Enumeration.hpp"
#include "String.hpp"
#include "LinkManager.hpp"

EnumerationIterator::EnumerationIterator( Enumeration *aSequence )
{
  sequence = aSequence;
  if( getEnumeration() != nil )
	{
	  LinkManager::reg( this, getEnumeration() );
	}
}

EnumerationIterator::~EnumerationIterator()
{
  if( getEnumeration() != nil )
	{
	  LinkManager::free( this, getEnumeration() );
   	}
  sequence = ( Enumeration * ) NIL;
}

void EnumerationIterator::iterate( Iterable *aBlock )
{
  preC_( getEnumeration() != nil );
  preC_( aBlock != nil );

  OGuard _( aBlock , this );
  aBlock -> initIterations();
  while( getEnumeration() -> hasMoreElements() )
	{
	  aBlock -> fire( getEnumeration() -> getNextElement() );
	  if( ! aBlock -> isMore() )
		{
		  break;
		}
	}
  aBlock -> doneIterations();
}

Enumeration *EnumerationIterator::getEnumeration() const
{
  return sequence;
}

// String  EnumerationIterator::toString() const
// {
//   return Object::toString() + "on top of: " + 
// 	( ( getEnumeration() != ( Enumeration * ) null ) ? 
// 	  getEnumeration() -> toString() :
// 	  String() );
// }

String  EnumerationIterator::getClassName() const
{
  return "EnumerationIterator";
}

#if defined(_INLINE)
#include "../src/Debug.ipp"
#endif


#if defined(_INLINE)
#include "../src/String.ipp"
#endif

/* $Log: EnumerationIterator.cpp,v $
 * Revision 1.3  1999/03/03 19:09:46  philogelos
 * Put sources under GNU Library License
 *
 * Revision 1.2  1999/02/28 16:30:50  philogelos
 * Tuned for inlines.
 *
 * Revision 1.1.1.1  1998/11/25 20:11:04  philogelos
 * Quercus Robusta
 *
 * Revision 1.4  1998/07/09 09:04:52  philogelos
 * custom new/delete added
 *
 * Revision 1.3  1998/07/07 14:30:07  philogelos
 * Memory leak in SUNWspro dynamic_cast fixed.
 *
 * Revision 1.2  1998/06/22 18:13:02  philogelos
 * Enumerations and containers added
 *
 * Revision 1.1.1.1  1998/06/22 08:47:13  philogelos
 * First version under CVS
 *
 * Revision 1.1.1.1  1998/04/01 17:15:29  philogelos
 * first version under CVS
 * */