ref_search.h

/* Copyright 2014 United States Government as represented by the
 * Administrator of the National Aeronautics and Space
 * Administration. No copyright is claimed in the United States under
 * Title 17, U.S. Code.  All Other Rights Reserved.
 *
 * The refine platform is licensed under the Apache License, Version
 * 2.0 (the "License"); you may not use this file except in compliance
 * with the License. You may obtain a copy of the License at
 * http://www.apache.org/licenses/LICENSE-2.0.
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
 * implied. See the License for the specific language governing
 * permissions and limitations under the License.
 */

#ifndef REF_SEARCH_H
#define REF_SEARCH_H

#include "ref_defs.h"

BEGIN_C_DECLORATION
typedef struct REF_SEARCH_STRUCT REF_SEARCH_STRUCT;
typedef REF_SEARCH_STRUCT *REF_SEARCH;
END_C_DECLORATION

#include "ref_list.h"
#include "ref_mpi.h"

BEGIN_C_DECLORATION
struct REF_SEARCH_STRUCT {
  REF_INT d, n;
  REF_INT empty;
  REF_INT *item;
  REF_INT *left, *right;
  REF_DBL *pos;
  REF_DBL *radius;
  REF_DBL *children_ball;
};

REF_STATUS ref_search_create(REF_SEARCH *ref_search, REF_INT n);

REF_STATUS ref_search_free(REF_SEARCH ref_search);

REF_STATUS ref_search_insert(REF_SEARCH ref_search, REF_INT item,
                             REF_DBL *position, REF_DBL radius);
REF_STATUS ref_search_depth(REF_SEARCH ref_search, REF_INT *depth);
REF_STATUS ref_search_stats(REF_SEARCH ref_search);

REF_STATUS ref_search_touching(REF_SEARCH ref_search, REF_LIST ref_list,
                               REF_DBL *position, REF_DBL radius);

REF_STATUS ref_search_trim_radius(REF_SEARCH ref_search, REF_DBL *position,
                                  REF_DBL *trim_radius);
REF_STATUS ref_search_nearest_candidates(REF_SEARCH ref_search,
                                         REF_LIST ref_list, REF_DBL *position);
REF_STATUS ref_search_nearest_candidates_closer_than(REF_SEARCH ref_search,
                                                     REF_LIST ref_list,
                                                     REF_DBL *position,
                                                     REF_DBL distance);
REF_STATUS ref_search_nearest_element(REF_SEARCH ref_search, REF_INT node_per,
                                      REF_DBL *xyz, REF_DBL *position,
                                      REF_DBL *distance);

REF_STATUS ref_search_selection(REF_MPI ref_mpi, REF_INT n, REF_DBL *elements,
                                REF_LONG position, REF_DBL *value);

REF_STATUS ref_search_distance2(REF_DBL *xyz0, REF_DBL *xyz1, REF_DBL *xyz,
                                REF_DBL *distance);
REF_STATUS ref_search_distance3(REF_DBL *xyz0, REF_DBL *xyz1, REF_DBL *xyz2,
                                REF_DBL *xyz, REF_DBL *distance);
REF_STATUS ref_search_dist3(REF_DBL *xyz0, REF_DBL *xyz1, REF_DBL *xyz2,
                            REF_DBL *xyz, REF_DBL *distance);
END_C_DECLORATION

#endif /* REF_SEARCH_H */