sparse_hash_table-inl.h
Go to the documentation of this file.
1 /*
2  * Software License Agreement (BSD License)
3  *
4  * Copyright (c) 2011-2014, Willow Garage, Inc.
5  * Copyright (c) 2014-2016, Open Source Robotics Foundation
6  * All rights reserved.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
11  *
12  * * Redistributions of source code must retain the above copyright
13  * notice, this list of conditions and the following disclaimer.
14  * * Redistributions in binary form must reproduce the above
15  * copyright notice, this list of conditions and the following
16  * disclaimer in the documentation and/or other materials provided
17  * with the distribution.
18  * * Neither the name of Open Source Robotics Foundation nor the names of its
19  * contributors may be used to endorse or promote products derived
20  * from this software without specific prior written permission.
21  *
22  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
25  * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
26  * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
27  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
28  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
29  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
30  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
32  * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
33  * POSSIBILITY OF SUCH DAMAGE.
34  */
35 
38 #ifndef HPP_FCL_BROADPHASE_SPARSEHASHTABLE_INL_H
39 #define HPP_FCL_BROADPHASE_SPARSEHASHTABLE_INL_H
40 
42 
43 namespace hpp {
44 namespace fcl {
45 
46 namespace detail {
47 
48 //==============================================================================
49 template <typename Key, typename Data, typename HashFnc,
50  template <typename, typename> class TableT>
52  : h_(h) {
53  // Do nothing
54 }
55 
56 //==============================================================================
57 template <typename Key, typename Data, typename HashFnc,
58  template <typename, typename> class TableT>
60  table_.clear();
61 }
62 
63 //==============================================================================
64 template <typename Key, typename Data, typename HashFnc,
65  template <typename, typename> class TableT>
67  std::vector<unsigned int> indices = h_(key);
68  for (size_t i = 0; i < indices.size(); ++i)
69  table_[indices[i]].push_back(value);
70 }
71 
72 //==============================================================================
73 template <typename Key, typename Data, typename HashFnc,
74  template <typename, typename> class TableT>
76  Key key) const {
77  std::vector<unsigned int> indices = h_(key);
78  std::set<Data> result;
79  for (size_t i = 0; i < indices.size(); ++i) {
80  unsigned int index = indices[i];
81  typename Table::const_iterator p = table_.find(index);
82  if (p != table_.end()) {
83  std::copy((*p).second.begin(), (*p).second.end(),
84  std ::inserter(result, result.end()));
85  }
86  }
87 
88  return std::vector<Data>(result.begin(), result.end());
89 }
90 
91 //==============================================================================
92 template <typename Key, typename Data, typename HashFnc,
93  template <typename, typename> class TableT>
95  std::vector<unsigned int> indices = h_(key);
96  for (size_t i = 0; i < indices.size(); ++i) {
97  unsigned int index = indices[i];
98  table_[index].remove(value);
99  }
100 }
101 
102 //==============================================================================
103 template <typename Key, typename Data, typename HashFnc,
104  template <typename, typename> class TableT>
106  table_.clear();
107 }
108 
109 } // namespace detail
110 } // namespace fcl
111 } // namespace hpp
112 
113 #endif
doxygen_xml_parser.index
index
Definition: doxygen_xml_parser.py:886
sparse_hash_table.h
hpp::fcl::detail::SparseHashTable::SparseHashTable
SparseHashTable(const HashFnc &h)
Definition: sparse_hash_table-inl.h:51
hpp::fcl::detail::SparseHashTable::init
void init(size_t)
Init the hash table. The bucket size is dynamically decided.
Definition: sparse_hash_table-inl.h:59
hpp
Main namespace.
Definition: broadphase_bruteforce.h:44
value
float value
hpp::fcl::detail::SparseHashTable::query
std::vector< Data > query(Key key) const
find the elements whose key is the same as the query
Definition: sparse_hash_table-inl.h:75
hpp::fcl::detail::SparseHashTable::remove
void remove(Key key, Data value)
remove one key-value pair from the hash table
Definition: sparse_hash_table-inl.h:94
hpp::fcl::detail::SparseHashTable::clear
void clear()
clear the hash table
Definition: sparse_hash_table-inl.h:105
hpp::fcl::detail::SparseHashTable::insert
void insert(Key key, Data value)
insert one key-value pair into the hash table
Definition: sparse_hash_table-inl.h:66


hpp-fcl
Author(s):
autogenerated on Fri Aug 2 2024 02:45:15