source: trunk/lib/classifier/DataLookup2D.cc @ 531

// $Id$

#include <c++_tools/classifier/DataLookup2D.h>

#include <vector>

namespace theplu {
namespace classifier {


  DataLookup2D::DataLookup2D()
  {
  }


  DataLookup2D::DataLookup2D(const DataLookup2D& m,
                             const std::vector<size_t>& row, 
                             const std::vector<size_t>& col)
  {
    assert(row_index_.empty());
    row_index_.reserve(row.size());
    for (size_t i=0; i<row.size(); i++) 
      row_index_.push_back(m.row_index_[row[i]]);
    assert(column_index_.empty());
    column_index_.reserve(col.size());
    for (size_t i=0; i<col.size(); i++) 
      column_index_.push_back(m.column_index_[col[i]]);
  }
    


  DataLookup2D::DataLookup2D(const DataLookup2D& m,
                         const std::vector<size_t>& index, 
                         const bool row)
  {
    if (row){
      assert(row_index_.empty());
      row_index_.reserve(index.size());
      for (size_t i=0; i<index.size(); i++) 
        row_index_.push_back(m.row_index_[index[i]]);
      column_index_= m.column_index_;
    }
    else{
      assert(column_index_.empty());
      column_index_.reserve(index.size());
      for (size_t i=0; i<index.size(); i++) 
        column_index_.push_back(m.row_index_[index[i]]);
      row_index_= m.row_index_;
    }
  }   


  DataLookup2D::DataLookup2D(const std::vector<size_t>& row, 
                             const std::vector<size_t>& col)
    : row_index_(row),column_index_(col)
  {
  }



  DataLookup2D::DataLookup2D(const std::vector<size_t>& index, bool row)
  {
  }

  
  DataLookup2D::DataLookup2D(const DataLookup2D& mv)
    : row_index_(mv.row_index_),column_index_(mv.column_index_)
  {
  }


}} // of namespace classifier and namespace theplu