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 FCL_BROADPHASE_SPARSEHASHTABLE_INL_H
39 #define FCL_BROADPHASE_SPARSEHASHTABLE_INL_H
40 
42 
43 namespace fcl
44 {
45 
46 namespace detail
47 {
48 
49 //==============================================================================
50 template <typename Key, typename Data, typename HashFnc,
51  template<typename, typename> class TableT>
53  : h_(h)
54 {
55  // Do nothing
56 }
57 
58 //==============================================================================
59 template <typename Key, typename Data, typename HashFnc,
60  template<typename, typename> class TableT>
62 {
63  table_.clear();
64 }
65 
66 //==============================================================================
67 template <typename Key, typename Data, typename HashFnc,
68  template<typename, typename> class TableT>
70 {
71  std::vector<unsigned int> indices = h_(key);
72  for(size_t i = 0; i < indices.size(); ++i)
73  table_[indices[i]].push_back(value);
74 }
75 
76 //==============================================================================
77 template <typename Key, typename Data, typename HashFnc,
78  template<typename, typename> class TableT>
80 {
81  std::vector<unsigned int> indices = h_(key);
82  std::set<Data> result;
83  for(size_t i = 0; i < indices.size(); ++i)
84  {
85  unsigned int index = indices[i];
86  typename Table::const_iterator p = table_.find(index);
87  if(p != table_.end())
88  {
89  std::copy((*p).second.begin(), (*p).second.end(), std
90  ::inserter(result, result.end()));
91  }
92  }
93 
94  return std::vector<Data>(result.begin(), result.end());
95 }
96 
97 //==============================================================================
98 template <typename Key, typename Data, typename HashFnc,
99  template<typename, typename> class TableT>
101 {
102  std::vector<unsigned int> indices = h_(key);
103  for(size_t i = 0; i < indices.size(); ++i)
104  {
105  unsigned int index = indices[i];
106  table_[index].remove(value);
107  }
108 }
109 
110 //==============================================================================
111 template <typename Key, typename Data, typename HashFnc,
112  template<typename, typename> class TableT>
114 {
115  table_.clear();
116 }
117 
118 } // namespace detail
119 } // namespace fcl
120 
121 #endif
sparse_hash_table.h
fcl::detail::SparseHashTable::init
void init(size_t)
Init the hash table. The bucket size is dynamically decided.
Definition: sparse_hash_table-inl.h:61
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:69
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:79
std
Definition: gtest-tuple.h:104
fcl::detail::SparseHashTable::clear
void clear()
clear the hash table
Definition: sparse_hash_table-inl.h:113
fcl::detail::SparseHashTable::SparseHashTable
SparseHashTable(const HashFnc &h)
Definition: sparse_hash_table-inl.h:52
fcl
Main namespace.
Definition: broadphase_bruteforce-inl.h:45
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:100


fcl
Author(s):
autogenerated on Sat Sep 11 2021 02:37:42