naive_ortho_range_search.h

Go to the documentation of this file.

/* MLPACK 0.2
 *
 * Copyright (c) 2008, 2009 Alexander Gray,
 *                          Garry Boyer,
 *                          Ryan Riegel,
 *                          Nikolaos Vasiloglou,
 *                          Dongryeol Lee,
 *                          Chip Mappus, 
 *                          Nishant Mehta,
 *                          Hua Ouyang,
 *                          Parikshit Ram,
 *                          Long Tran,
 *                          Wee Chin Wong
 *
 * Copyright (c) 2008, 2009 Georgia Institute of Technology
 *
 * 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 2 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, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
 * 02110-1301, USA.
 */
#ifndef NAIVE_ORTHO_RANGE_SEARCH_H
#define NAIVE_ORTHO_RANGE_SEARCH_H

#include "fastlib/fastlib.h"


template<typename T>
class NaiveOrthoRangeSearch {
  
  // This class object cannot be copied!
  FORBID_ACCIDENTAL_COPIES(NaiveOrthoRangeSearch);

 private:

  GenMatrix<T> data_;
  
 public:
  

  NaiveOrthoRangeSearch() {}

  ~NaiveOrthoRangeSearch() {}


  void Init(const GenMatrix<T> &data) {

    // copy the incoming data
    data_.StaticCopy(data);
  }

  void Compute(const GenMatrix<T> &low_coord_limits, 
               const GenMatrix<T> &high_coord_limits,
               GenMatrix<bool> *search_results) {

    // Allocate the space for holding the search results.
    search_results->Init(data_.n_cols(), low_coord_limits.n_cols());

    // Start the search.
    fx_timer_start(NULL, "naive_search");
    for(index_t j = 0; j < low_coord_limits.n_cols(); j++) {
      for(index_t i = 0; i < data_.n_cols(); i++) {     
        GenVector<T> pt;
        bool flag = true;
        data_.MakeColumnVector(i, &pt);
        
        // Determine which one of the two cases we have: EXCLUDE, SUBSUME
        // first the EXCLUDE case: when dist is above the upper bound distance
        // of this dimension, or dist is below the lower bound distance of
        // this dimension
        for(index_t d = 0; d < data_.n_rows(); d++) {
          if(pt[d] < low_coord_limits.get(d, j) || 
             pt[d] > high_coord_limits.get(d, j)) {
            flag = false;
            break;
          }
        }
        (*search_results).set(i, j, flag);
      }
    }
    fx_timer_stop(NULL, "naive_search");
    
    // Search is now finished.
    
  }

};


#endif