cmtkSearchTrace.h

Go to the documentation of this file.

/*
//
//  Copyright 1997-2009 Torsten Rohlfing
//
//  Copyright 2004-2011 SRI International
//
//  This file is part of the Computational Morphometry Toolkit.
//
//  http://www.nitrc.org/projects/cmtk/
//
//  The Computational Morphometry Toolkit 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.
//
//  The Computational Morphometry Toolkit 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 the Computational Morphometry Toolkit.  If not, see
//  <http://www.gnu.org/licenses/>.
//
//  $Revision: 2752 $
//
//  $LastChangedDate: 2011-01-17 11:33:31 -0800 (Mon, 17 Jan 2011) $
//
//  $LastChangedBy: torstenrohlfing $
//
*/

#ifndef __cmtkSearchTrace_h_included_
#define __cmtkSearchTrace_h_included_

#include <stdlib.h>

namespace
cmtk
{


template<class R = short>
class SearchTrace 
{
private:
  typedef struct _TraceListEntry 
  {
    R *RelativePosition;

    double FunctionValue;

    struct _TraceListEntry *Next;
  } TraceListEntry;

  int DOF;

  TraceListEntry *List;

  int IsHit ( const TraceListEntry* entry, const int dir, const R step ) const 
  {
    for ( int idx=0; idx<DOF; ++idx )
      if ( entry->RelativePosition[idx] && ( (dir != idx) || (entry->RelativePosition[idx] != step) ) )
        return 0;
    
    return 1;
  }
  
public:
  SearchTrace ( const int _DOF ) {
    DOF = _DOF;
    List = NULL;
  }

  ~SearchTrace () { Clear(); }

  void Add ( const double value, const int dir = 0, const R step = 0 ) 
  {
    TraceListEntry *add = new TraceListEntry;
    add->RelativePosition = Memory::AllocateArray<R>( DOF );
    memset( add->RelativePosition, 0, sizeof(R) );
    add->RelativePosition[dir] += step;
    add->FunctionValue = value;
    add->Next = List;
    List = add;
  }

  int Get ( double& value, const int dir = 0, const R step = 0 ) const 
  {
    TraceListEntry *cursor = List;
    while ( cursor ) 
      {
      if ( IsHit( cursor, dir, step ) ) 
        {
        value = cursor->FunctionValue;
        return 1;
        }
      cursor = cursor ->Next;
      }
    return 0;
  }

  void Move ( const int dir, const R step ) 
  {
    TraceListEntry *cursor = List;
    while ( cursor ) 
      {
      cursor->RelativePosition[dir] -= step;
      cursor = cursor ->Next;
      }    
  }

  void Clear () 
  {
    while ( List ) 
      {
      TraceListEntry *save = List->Next;
      Memory::DeleteArray( List->RelativePosition );
      delete List;
      List = save;
      }
  }
};


} // namespace cmtk

#endif // #ifndef __cmtkSearchTrace_h_included_