kdtree.h

/* 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 TREE_KDTREE_H
#define TREE_KDTREE_H

#include "fastlib/base/base.h"

#include "fastlib/tree/spacetree.h"
#include "fastlib/tree/bounds.h"
//#include "spacetree.h"
//#include "bounds.h"

#include "fastlib/col/arraylist.h"
#include "fastlib/fx/fx.h"

#include "fastlib/tree/kdtree_impl.h"
//#include "kdtree_impl.h"

namespace tree {
  template<typename TKdTree, typename T>
  TKdTree *MakeKdTreeMidpointSelective(GenMatrix<T>& matrix, 
                                       const Vector& split_dimensions,
      index_t leaf_size,
      ArrayList<index_t> *old_from_new = NULL,
      ArrayList<index_t> *new_from_old = NULL) {
    TKdTree *node = new TKdTree();
    index_t *old_from_new_ptr;
   
    if (old_from_new) {
      old_from_new->Init(matrix.n_cols());
      
      for (index_t i = 0; i < matrix.n_cols(); i++) {
        (*old_from_new)[i] = i;
      }
      
      old_from_new_ptr = old_from_new->begin();
    } else {
      old_from_new_ptr = NULL;
    }
      
    node->Init(0, matrix.n_cols());
    node->bound().Init(split_dimensions.length());
    tree_kdtree_private::SelectFindBoundFromMatrix(matrix, split_dimensions,
        0, matrix.n_cols(), &node->bound());

    tree_kdtree_private::SelectSplitKdTreeMidpoint(matrix, split_dimensions, 
        node, leaf_size, old_from_new_ptr);
    
    if (new_from_old) {
      new_from_old->Init(matrix.n_cols());
      for (index_t i = 0; i < matrix.n_cols(); i++) {
        (*new_from_old)[(*old_from_new)[i]] = i;
      }
    }    
    return node;
  }

  template<typename TKdTree, typename T>
  TKdTree *MakeKdTreeMidpointSelective(GenMatrix<T>& matrix, 
                                       const Vector& split_dimensions,
      index_t leaf_size,
      GenVector<index_t> *old_from_new = NULL,
      GenVector<index_t> *new_from_old = NULL) {
    TKdTree *node = new TKdTree();
    index_t *old_from_new_ptr;
   
    if (old_from_new) {
      old_from_new->Init(matrix.n_cols());
      
      for (index_t i = 0; i < matrix.n_cols(); i++) {
        (*old_from_new)[i] = i;
      }
      
      old_from_new_ptr = old_from_new->ptr();
    } else {
      old_from_new_ptr = NULL;
    }
      
    node->Init(0, matrix.n_cols());
    node->bound().Init(split_dimensions.length());
    tree_kdtree_private::SelectFindBoundFromMatrix(matrix, split_dimensions,
        0, matrix.n_cols(), &node->bound());

    tree_kdtree_private::SelectSplitKdTreeMidpoint(matrix, split_dimensions, 
        node, leaf_size, old_from_new_ptr);
    
    if (new_from_old) {
      new_from_old->Init(matrix.n_cols());
      for (index_t i = 0; i < matrix.n_cols(); i++) {
        (*new_from_old)[(*old_from_new)[i]] = i;
      }
    }    
    return node;
  }

  
  template<typename TKdTree, typename T>
    TKdTree *MakeKdTreeMidpoint(GenMatrix<T>& matrix, index_t leaf_size,
                                ArrayList<index_t> *old_from_new = NULL,
                                ArrayList<index_t> *new_from_old = NULL) {  
    Vector split_dimensions;
    split_dimensions.Init(matrix.n_rows());
    int i;
    for (i = 0; i < matrix.n_rows(); i++){
      split_dimensions[i] = i;
    }
    TKdTree *result;
    result = MakeKdTreeMidpointSelective<TKdTree>(matrix, split_dimensions,
                   leaf_size, old_from_new, new_from_old);
    return result;
  }
  
  template<typename TKdTree, typename T>
    TKdTree *MakeKdTreeMidpoint(GenMatrix<T>& matrix, 
        index_t leaf_size,
                                GenVector<index_t> *old_from_new = NULL,
                                GenVector<index_t> *new_from_old = NULL) {  
    Vector split_dimensions;
    split_dimensions.Init(matrix.n_rows());
    int i;
    for (i = 0; i < matrix.n_rows(); i++){
      split_dimensions[i] = i;
    }
    TKdTree *result;
    result = MakeKdTreeMidpointSelective<TKdTree>(matrix, 
        split_dimensions,
                    leaf_size, old_from_new, new_from_old);
    return result;
  }

  template<typename TKdTree, typename T>
  success_t LoadKdTree(datanode *module,
      GenMatrix<T> *matrix, TKdTree **tree_pp,
      ArrayList<index_t> *old_from_new) {
    const char *type = fx_param_str(module, "type", "text");
    const char *fname = fx_param_str(module, "", NULL);
    success_t success = SUCCESS_PASS;

    fx_timer_start(module, "load");
    if (strcmp(type, "text") == 0) {
      int leaflen = fx_param_int(module, "leaflen", 20);

      fx_timer_start(module, "load_matrix");
      success = data::Load(fname, matrix);
      fx_timer_stop(module, "load_matrix");

      //if (fx_param_exists("do_pca")) {}

      fx_timer_start(module, "make_tree");
      *tree_pp = MakeKdTreeMidpoint<TKdTree>(
          *matrix, leaflen, old_from_new);
      fx_timer_stop(module, "make_tree");
    }
    fx_timer_stop(module, "load");

    return success;
  }
}

typedef BinarySpaceTree<DHrectBound<2>, Matrix> BasicKdTree;

#endif