source: trunk/c++_tools/classifier/DataLookup1D.h @ 675

#ifndef _theplu_classifier_dataLookup1D_ 
#define _theplu_classifier_dataLookup1D_ 

// $Id$

/*
  Copyright (C) The authors contributing to this file.

  This file is part of the yat library, http://lev.thep.lu.se/trac/yat

  The yat library 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.

  The yat 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
  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.
*/

#include "yat/classifier/DataLookup2D.h"

#include <cassert>
#include <iostream>
#include <vector>

namespace theplu {
namespace classifier {  

  ///
  /// Class for general vector view
  ///

  class DataLookup1D
  {
  
  public:

    ///
    /// Constructor. 
    ///
    /// @param row_vector if true DataLookup1D is looking into a
    /// row of DataLookup2D, otherwise looking into a
    /// column. @param index which row/column to look into.
    ///
    DataLookup1D(const DataLookup2D&, const size_t index, 
                 const bool row_vector);

    ///
    /// Copy constructor
    ///
    DataLookup1D(const DataLookup1D&);

    ///
    /// Construct DataLookup1D that owns its underlying matrix. Object
    /// has size @ size and all its element is equal to @a value.
    ///
    DataLookup1D(const size_t size, const double value=0); 

    ///
    ///
    ///
    virtual ~DataLookup1D();

    ///
    /// @return number of elements
    ///
    inline size_t size(void) const
      { return column_vector_ ? matrix_->rows() : matrix_->columns(); }

    ///
    /// @brief access operator
    ///
    inline double operator()(const size_t i) const 
    { 
      assert(i<size()); 
      return column_vector_ ? (*matrix_)(i,index_) : (*matrix_)(index_,i); 
    }

    ///
    /// @brief access operator
    ///
    inline double operator[](const size_t i) const 
    { 
      return this->operator()(i);
    }


    ///
    /// scalar product
    ///
    double operator*(const DataLookup1D&) const;

  private:
    const DataLookup1D& operator=(const DataLookup1D&);

    const bool column_vector_;
    const size_t index_;
    const DataLookup2D* matrix_;
    const bool owner_;
    
  };

  ///
  /// @brief The output operator for DataLookup1D.
  ///
  /**
   * Elements are separated by the character from the omanip fill.
   * The following example will write the elements separated by tab.
   * 
   @verbatim 
   char prev=s.fill('\t'); 
   s << v;
   s.fill(prev); 
   @endverbatim
  */
  std::ostream& operator<<(std::ostream& s, const DataLookup1D& v);
  
}} // of namespace classifier and namespace theplu

#endif