/*-------------------------------------------------------------------------------------*/
/*  NOMAD - Nonsmooth Optimization by Mesh Adaptive Direct search - version 3.0.0      */
/*                                                                                     */
/*  Copyright (C) 2001-2008  Mark Abramson        - the Boeing Company, Seattle        */
/*                           Charles Audet        - Ecole Polytechnique, Montreal      */
/*                           Gilles Couture       - Ecole Polytechnique, Montreal      */
/*                           John Dennis          - Rice University, Houston           */
/*                           Sebastien Le Digabel - Ecole Polytechnique, Montreal      */
/*                                                                                     */
/*  funded in part by AFOSR and Exxon Mobil                                            */
/*                                                                                     */
/*  Author: Sebastien Le Digabel                                                       */
/*                                                                                     */
/*  Contact information:                                                               */
/*    Ecole Polytechnique de Montreal - GERAD                                          */
/*    C.P. 6079, Succ. Centre-ville, Montreal (Quebec) H3C 3A7 Canada                  */
/*    e-mail: Sebastien.Le.Digabel@gerad.ca                                            */
/*    phone : 1-514-340-6053 #6673                                                     */
/*    fax   : 1-514-340-5665                                                           */
/*                                                                                     */
/*  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 3 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, see <http://www.gnu.org/licenses/>.                               */
/*                                                                                     */
/*  You can find information on the NOMAD software at www.gerad.ca/nomad               */
/*-------------------------------------------------------------------------------------*/
#include "Parameter_Entries.hpp"
using namespace std;

/*--------------------------------------------*/
/*                 destructor                 */
/*--------------------------------------------*/
Parameter_Entries::~Parameter_Entries ( void ) {
  multiset<Parameter_Entry*, Parameter_Entry_Comp>::iterator end = _entries.end();
  for ( multiset<Parameter_Entry*, Parameter_Entry_Comp>::iterator it = _entries.begin() ;
	it != end ; ++it)
    delete *it;
}

/*--------------------------------------------*/
/*      finds a specific entry in the set     */
/*--------------------------------------------*/
Parameter_Entry * Parameter_Entries::find ( const string & name ) const {
  Parameter_Entry p (name);
  multiset<Parameter_Entry*, Parameter_Entry_Comp>::const_iterator it = _entries.find(&p);
  if ( it != _entries.end() )
    return (*it);
  return NULL;
}

/*----------------------------------------*/
/*      inserts an entry into the set     */
/*----------------------------------------*/
void Parameter_Entries::insert ( Parameter_Entry * entry ) {
  Parameter_Entry * cur = find ( entry->get_name() );
  if ( cur ) {
    entry->set_unique ( false );
    cur->set_unique   ( false );
    while ( cur->get_next() )
      cur = cur->get_next();
    cur->set_next ( entry );
  }
  _entries.insert ( entry );
}

/*----------------------------------------*/
/*       find a non-interpreted entry     */
/*----------------------------------------*/
Parameter_Entry * Parameter_Entries::find_non_interpreted ( void ) const {
  multiset<Parameter_Entry*, Parameter_Entry_Comp>::const_iterator end
    = _entries.end();
  for ( multiset<Parameter_Entry*, Parameter_Entry_Comp>::const_iterator it
	  = _entries.begin() ; it != end ; ++it )
    if ( !(*it)->has_been_interpreted() )
      return *it;
  return NULL;
}

/*--------------------------------------------*/
/*                   display                  */
/*--------------------------------------------*/
void Parameter_Entries::display ( ostream & out ) const {
  multiset<Parameter_Entry*,Parameter_Entry_Comp>::const_iterator end
    = _entries.end();
  for ( multiset<Parameter_Entry*,Parameter_Entry_Comp>::const_iterator it
	  = _entries.begin() ; it != end ; ++it )
    out << '\t' << **it << endl;
}
