evScalarField.h

Go to the documentation of this file.

/*
 *
 * EVITA: Efficient Visualization of Terascale Datasets
 * Copyright (C) 2000-2016  Team Evita
 * 
 * This library 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 of the License, or (at your option) any later version.
 * 
 * This library 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 library; if not, write to the
 * Free Software Foundation, Inc., 675 Mass Ave, Cambridge,
 * MA 02139, USA.
 *
 */


#ifndef __evScalarField_h
#define __evScalarField_h


#include "evField.h"


class evScalarField : public evField<double>
{
public:
  evScalarField(void);
  evScalarField(const evAddress &size);
  virtual ~evScalarField(void)
    { }

  virtual const evString GetClassName(void) const
  {
    return(evString("evScalarField"));
  }
  
  double Max(void) const;
  double Min(void) const;

  int Normalize(void);

protected:

private:

};


inline evScalarField::evScalarField(void)
{
  this->Initialize();
}


inline evScalarField::evScalarField(const evAddress &size)
{
  this->Initialize();

  this->SetSize(size);
}


inline double evScalarField::Max(void) const
{
  return(*std::max_element(this->Field.begin(), this->Field.end()));
}


inline double evScalarField::Min(void) const
{
  return(*std::min_element(this->Field.begin(), this->Field.end()));
}


inline int evScalarField::Normalize(void)
{
  double max_value = this->Max();
  double min_value = this->Min();

  if (max_value == min_value)
    this->PutField(0.0);
  else
    for (unsigned int i = 0; i < this->GetTotalSize(); i++)
      this->Field[i] =
        (this->Field[i] - min_value) / (max_value - min_value);

  return(0);
}

#endif