simple_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_SIMPLEHASHTABLE_INL_H
39 #define FCL_BROADPHASE_SIMPLEHASHTABLE_INL_H
40 
42 
43 #include <iterator>
44 
45 namespace fcl
46 {
47 
48 namespace detail
49 {
50 
51 //==============================================================================
52 template<typename Key, typename Data, typename HashFnc>
54  : h_(h)
55 {
56  // Do nothing
57 }
58 
59 //==============================================================================
60 template<typename Key, typename Data, typename HashFnc>
62 {
63  if(size == 0)
64  {
65  throw std::logic_error("SimpleHashTable must have non-zero size.");
66  }
67 
68  table_.resize(size);
69  table_size_ = size;
70 }
71 
72 //==============================================================================
73 template<typename Key, typename Data, typename HashFnc>
75 {
76  std::vector<unsigned int> indices = h_(key);
77  size_t range = table_.size();
78  for(size_t i = 0; i < indices.size(); ++i)
79  table_[indices[i] % range].push_back(value);
80 }
81 
82 //==============================================================================
83 template<typename Key, typename Data, typename HashFnc>
84 std::vector<Data> SimpleHashTable<Key, Data, HashFnc>::query(Key key) const
85 {
86  size_t range = table_.size();
87  std::vector<unsigned int> indices = h_(key);
88  std::set<Data> result;
89  for(size_t i = 0; i < indices.size(); ++i)
90  {
91  unsigned int index = indices[i] % range;
92  std::copy(table_[index].begin(), table_[index].end(),
93  std::inserter(result, result.end()));
94  }
95 
96  return std::vector<Data>(result.begin(), result.end());
97 }
98 
99 //==============================================================================
100 template<typename Key, typename Data, typename HashFnc>
102 {
103  size_t range = table_.size();
104  std::vector<unsigned int> indices = h_(key);
105  for(size_t i = 0; i < indices.size(); ++i)
106  {
107  unsigned int index = indices[i] % range;
108  table_[index].remove(value);
109  }
110 }
111 
112 //==============================================================================
113 template<typename Key, typename Data, typename HashFnc>
115 {
116  table_.clear();
117  table_.resize(table_size_);
118 }
119 
120 } // namespace detail
121 } // namespace fcl
122 
123 #endif
fcl::detail::SimpleHashTable::clear
void clear()
clear the hash table
Definition: simple_hash_table-inl.h:114
fcl::detail::SimpleHashTable::init
void init(size_t size)
Init the number of bins in the hash table.
Definition: simple_hash_table-inl.h:61
fcl::detail::SimpleHashTable::SimpleHashTable
SimpleHashTable(const HashFnc &h)
Definition: simple_hash_table-inl.h:53
fcl::detail::SimpleHashTable::remove
void remove(Key key, Data value)
remove the key-value pair from the table
Definition: simple_hash_table-inl.h:101
simple_hash_table.h
fcl::detail::SimpleHashTable::query
std::vector< Data > query(Key key) const
Find the elements in the hash table whose key is the same as query key.
Definition: simple_hash_table-inl.h:84
fcl
Main namespace.
Definition: broadphase_bruteforce-inl.h:45
fcl::detail::SimpleHashTable::insert
void insert(Key key, Data value)
Definition: simple_hash_table-inl.h:74


fcl
Author(s):
autogenerated on Tue Jun 22 2021 07:27:52