| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/octree/include/pcl/octree/impl/ |
| H A D | octree_pointcloud_adjacency.hpp | 135 key_arg = OctreeKey(); in genOctreeKeyforPoint()
174 if (key_arg.x > this->max_key_.x || key_arg.y > this->max_key_.y || in computeNeighbors()
175 key_arg.z > this->max_key_.z) { in computeNeighbors()
182 int dx_min = (key_arg.x > 0) ? -1 : 0; in computeNeighbors()
183 int dy_min = (key_arg.y > 0) ? -1 : 0; in computeNeighbors()
184 int dz_min = (key_arg.z > 0) ? -1 : 0; in computeNeighbors()
185 int dx_max = (key_arg.x == this->max_key_.x) ? 0 : 1; in computeNeighbors()
186 int dy_max = (key_arg.y == this->max_key_.y) ? 0 : 1; in computeNeighbors()
187 int dz_max = (key_arg.z == this->max_key_.z) ? 0 : 1; in computeNeighbors()
192 neighbor_key.x = static_cast<std::uint32_t>(key_arg.x + dx); in computeNeighbors()
[all …]
|
| H A D | octree_base.hpp | 286 const OctreeKey& key_arg, in createLeafRecursive() argument
308 return createLeafRecursive(key_arg, in createLeafRecursive()
325 return createLeafRecursive(key_arg, in createLeafRecursive()
346 const OctreeKey& key_arg, in findLeafRecursive() argument
437 OctreeKey& key_arg, in serializeTreeRecursive() argument
456 key_arg.pushBranch(child_idx); in serializeTreeRecursive()
464 key_arg, in serializeTreeRecursive()
484 key_arg.popBranch(); in serializeTreeRecursive()
495 OctreeKey& key_arg, in deserializeTreeRecursive() argument
513 key_arg.pushBranch(child_idx); in deserializeTreeRecursive()
[all …]
|
| H A D | octree2buf_base.hpp | 358 const OctreeKey& key_arg, in createLeafRecursive() argument
416 return createLeafRecursive(key_arg, in createLeafRecursive()
469 const OctreeKey& key_arg, in findLeafRecursive() argument
558 OctreeKey& key_arg, in serializeTreeRecursive() argument
588 key_arg.pushBranch(child_idx); in serializeTreeRecursive()
596 key_arg, in serializeTreeRecursive()
629 key_arg.popBranch(); in serializeTreeRecursive()
644 OctreeKey& key_arg, in deserializeTreeRecursive() argument
680 key_arg.pushBranch(child_idx); in deserializeTreeRecursive()
725 key_arg, in deserializeTreeRecursive()
[all …]
|
| H A D | octree_pointcloud.hpp | 792 assert(key_arg.x <= this->max_key_.x); in genOctreeKeyforPoint()
793 assert(key_arg.y <= this->max_key_.y); in genOctreeKeyforPoint()
794 assert(key_arg.z <= this->max_key_.z); in genOctreeKeyforPoint()
807 OctreeKey& key_arg) const in genOctreeKeyforPoint()
816 genOctreeKeyforPoint(temp_point, key_arg); in genOctreeKeyforPoint()
831 genOctreeKeyforPoint(temp_point, key_arg); in genOctreeKeyForDataT()
861 genVoxelCenterFromOctreeKey(const OctreeKey& key_arg, in genVoxelCenterFromOctreeKey() argument
867 (static_cast<double>(key_arg.x) + 0.5f) * in genVoxelCenterFromOctreeKey()
872 (static_cast<double>(key_arg.y) + 0.5f) * in genVoxelCenterFromOctreeKey()
877 (static_cast<double>(key_arg.z) + 0.5f) * in genVoxelCenterFromOctreeKey()
[all …]
|
| /dports/math/octave/octave-6.4.0/libgui/src/ |
| H A D | gui-preferences.h | 39 gui_pref (const QString& key_arg, const QVariant& def_arg,
41 : key (key_arg), def (def_arg), ignore (ignore_arg) in key()
65 sc_pref (const QString& key_arg, Qt::Key def_arg) in sc_pref()
66 : key (key_arg), def (static_cast<unsigned int> (def_arg)), in sc_pref()
70 sc_pref (const QString& key_arg, unsigned int def_arg) in sc_pref()
71 : key (key_arg), def (def_arg), def_std (QKeySequence::UnknownKey) in sc_pref()
74 sc_pref (const QString& key_arg, QKeySequence::StandardKey def_std_arg) in sc_pref()
75 : key (key_arg), def (0), def_std (def_std_arg) in sc_pref()
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/abseil-cpp/absl/container/internal/ |
| H A D | raw_hash_map.h | 51 using key_arg = typename KeyArgImpl::template type<K, key_type>; variable
73 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign()
78 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign()
94 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign()
99 iterator insert_or_assign(const_iterator, key_arg<K>&& k, const V& v) { in insert_or_assign()
104 iterator insert_or_assign(const_iterator, const key_arg<K>& k, V&& v) { in insert_or_assign()
132 iterator try_emplace(const_iterator, key_arg<K>&& k, Args&&... args) { in try_emplace()
142 MappedReference<P> at(const key_arg<K>& key) { in at()
152 MappedConstReference<P> at(const key_arg<K>& key) const { in at()
162 MappedReference<P> operator[](key_arg<K>&& key) {
[all …]
|
| H A D | btree_container.h | 44 using key_arg =
93 iterator find(const key_arg<K> &key) { in find()
101 bool contains(const key_arg<K> &key) const { in contains()
126 const key_arg<K> &key) const { in equal_range()
221 using key_arg = typename super_type::template key_arg<K>;
320 size_type erase(const key_arg<K> &key) { in erase()
327 node_type extract(const key_arg<K> &key) { in extract()
377 using key_arg = typename super_type::template key_arg<K>;
503 mapped_type &at(const key_arg<K> &key) { in at()
527 using key_arg = typename super_type::template key_arg<K>; variable
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/abseil-cpp/absl/container/internal/ |
| H A D | raw_hash_map.h | 51 using key_arg = typename KeyArgImpl::template type<K, key_type>; variable
73 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign()
78 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign()
94 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign()
99 iterator insert_or_assign(const_iterator, key_arg<K>&& k, const V& v) { in insert_or_assign()
104 iterator insert_or_assign(const_iterator, const key_arg<K>& k, V&& v) { in insert_or_assign()
132 iterator try_emplace(const_iterator, key_arg<K>&& k, Args&&... args) { in try_emplace()
142 MappedReference<P> at(const key_arg<K>& key) { in at()
152 MappedConstReference<P> at(const key_arg<K>& key) const { in at()
162 MappedReference<P> operator[](key_arg<K>&& key) {
[all …]
|
| H A D | btree_container.h | 45 using key_arg =
112 iterator find(const key_arg<K> &key) { in find()
120 bool contains(const key_arg<K> &key) const { in contains()
145 const key_arg<K> &key) const { in equal_range()
161 size_type erase(const key_arg<K> &key) { in erase()
244 using key_arg = typename super_type::template key_arg<K>;
345 node_type extract(const key_arg<K> &key) { in extract()
396 using key_arg = typename super_type::template key_arg<K>;
478 mapped_type &operator[](key_arg<K> &&k) {
483 mapped_type &at(const key_arg<K> &key) { in at()
[all …]
|
| /dports/devel/abseil/abseil-cpp-20211102.0/absl/container/internal/ |
| H A D | raw_hash_map.h | 51 using key_arg = typename KeyArgImpl::template type<K, key_type>; variable
74 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign()
79 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign()
95 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign()
100 iterator insert_or_assign(const_iterator, key_arg<K>&& k, const V& v) { in insert_or_assign()
105 iterator insert_or_assign(const_iterator, const key_arg<K>& k, V&& v) { in insert_or_assign()
133 iterator try_emplace(const_iterator, key_arg<K>&& k, Args&&... args) { in try_emplace()
143 MappedReference<P> at(const key_arg<K>& key) { in at()
153 MappedConstReference<P> at(const key_arg<K>& key) const { in at()
163 MappedReference<P> operator[](key_arg<K>&& key) {
[all …]
|
| H A D | btree_container.h | 46 using key_arg =
113 iterator find(const key_arg<K> &key) { in find()
121 bool contains(const key_arg<K> &key) const { in contains()
146 const key_arg<K> &key) const { in equal_range()
162 size_type erase(const key_arg<K> &key) { in erase()
245 using key_arg = typename super_type::template key_arg<K>;
343 node_type extract(const key_arg<K> &key) { in extract()
396 using key_arg = typename super_type::template key_arg<K>;
478 mapped_type &operator[](key_arg<K> &&k) {
483 mapped_type &at(const key_arg<K> &key) { in at()
[all …]
|
| /dports/net-im/tg_owt/tg_owt-d578c76/src/third_party/abseil-cpp/absl/container/internal/ |
| H A D | raw_hash_map.h | 51 using key_arg = typename KeyArgImpl::template type<K, key_type>; variable
73 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign()
78 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign()
94 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign()
99 iterator insert_or_assign(const_iterator, key_arg<K>&& k, const V& v) { in insert_or_assign()
104 iterator insert_or_assign(const_iterator, const key_arg<K>& k, V&& v) { in insert_or_assign()
132 iterator try_emplace(const_iterator, key_arg<K>&& k, Args&&... args) { in try_emplace()
142 MappedReference<P> at(const key_arg<K>& key) { in at()
152 MappedConstReference<P> at(const key_arg<K>& key) const { in at()
162 MappedReference<P> operator[](key_arg<K>&& key) {
[all …]
|
| H A D | btree_container.h | 44 using key_arg =
93 iterator find(const key_arg<K> &key) { in find()
101 bool contains(const key_arg<K> &key) const { in contains()
126 const key_arg<K> &key) const { in equal_range()
221 using key_arg = typename super_type::template key_arg<K>;
320 size_type erase(const key_arg<K> &key) { in erase()
327 node_type extract(const key_arg<K> &key) { in extract()
377 using key_arg = typename super_type::template key_arg<K>;
503 mapped_type &at(const key_arg<K> &key) { in at()
527 using key_arg = typename super_type::template key_arg<K>; variable
[all …]
|
| /dports/graphics/R-cran-s2/s2/src/absl/container/internal/ |
| H A D | raw_hash_map.h | 51 using key_arg = typename KeyArgImpl::template type<K, key_type>; variable
73 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign()
78 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign()
94 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign()
99 iterator insert_or_assign(const_iterator, key_arg<K>&& k, const V& v) { in insert_or_assign()
104 iterator insert_or_assign(const_iterator, const key_arg<K>& k, V&& v) { in insert_or_assign()
132 iterator try_emplace(const_iterator, key_arg<K>&& k, Args&&... args) { in try_emplace()
142 MappedReference<P> at(const key_arg<K>& key) { in at()
152 MappedConstReference<P> at(const key_arg<K>& key) const { in at()
162 MappedReference<P> operator[](key_arg<K>&& key) {
[all …]
|
| H A D | btree_container.h | 45 using key_arg =
112 iterator find(const key_arg<K> &key) { in find()
120 bool contains(const key_arg<K> &key) const { in contains()
145 const key_arg<K> &key) const { in equal_range()
161 size_type erase(const key_arg<K> &key) { in erase()
244 using key_arg = typename super_type::template key_arg<K>;
342 node_type extract(const key_arg<K> &key) { in extract()
395 using key_arg = typename super_type::template key_arg<K>;
477 mapped_type &operator[](key_arg<K> &&k) {
482 mapped_type &at(const key_arg<K> &key) { in at()
[all …]
|
| /dports/www/firefox/firefox-99.0/third_party/libwebrtc/third_party/abseil-cpp/absl/container/internal/ |
| H A D | raw_hash_map.h | 51 using key_arg = typename KeyArgImpl::template type<K, key_type>; variable
73 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign()
78 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign()
94 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign()
99 iterator insert_or_assign(const_iterator, key_arg<K>&& k, const V& v) { in insert_or_assign()
104 iterator insert_or_assign(const_iterator, const key_arg<K>& k, V&& v) { in insert_or_assign()
132 iterator try_emplace(const_iterator, key_arg<K>&& k, Args&&... args) { in try_emplace()
142 MappedReference<P> at(const key_arg<K>& key) { in at()
152 MappedConstReference<P> at(const key_arg<K>& key) const { in at()
162 MappedReference<P> operator[](key_arg<K>&& key) {
[all …]
|
| H A D | btree_container.h | 44 using key_arg =
93 iterator find(const key_arg<K> &key) { in find()
101 bool contains(const key_arg<K> &key) const { in contains()
126 const key_arg<K> &key) const { in equal_range()
221 using key_arg = typename super_type::template key_arg<K>;
320 size_type erase(const key_arg<K> &key) { in erase()
377 using key_arg = typename super_type::template key_arg<K>;
459 mapped_type &operator[](key_arg<K> &&k) {
464 mapped_type &at(const key_arg<K> &key) { in at()
522 using key_arg = typename super_type::template key_arg<K>; variable
[all …]
|
| /dports/devel/pecl-grpc/grpc-1.42.0/third_party/abseil-cpp/absl/container/internal/ |
| H A D | raw_hash_map.h | 51 using key_arg = typename KeyArgImpl::template type<K, key_type>; variable
73 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign()
78 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign()
94 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign()
99 iterator insert_or_assign(const_iterator, key_arg<K>&& k, const V& v) { in insert_or_assign()
104 iterator insert_or_assign(const_iterator, const key_arg<K>& k, V&& v) { in insert_or_assign()
132 iterator try_emplace(const_iterator, key_arg<K>&& k, Args&&... args) { in try_emplace()
142 MappedReference<P> at(const key_arg<K>& key) { in at()
152 MappedConstReference<P> at(const key_arg<K>& key) const { in at()
162 MappedReference<P> operator[](key_arg<K>&& key) {
[all …]
|
| /dports/devel/py-grpcio/grpcio-1.43.0/third_party/abseil-cpp/absl/container/internal/ |
| H A D | raw_hash_map.h | 51 using key_arg = typename KeyArgImpl::template type<K, key_type>; variable
74 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, V&& v) { in insert_or_assign()
79 std::pair<iterator, bool> insert_or_assign(key_arg<K>&& k, const V& v) { in insert_or_assign()
95 iterator insert_or_assign(const_iterator, key_arg<K>&& k, V&& v) { in insert_or_assign()
100 iterator insert_or_assign(const_iterator, key_arg<K>&& k, const V& v) { in insert_or_assign()
105 iterator insert_or_assign(const_iterator, const key_arg<K>& k, V&& v) { in insert_or_assign()
133 iterator try_emplace(const_iterator, key_arg<K>&& k, Args&&... args) { in try_emplace()
143 MappedReference<P> at(const key_arg<K>& key) { in at()
153 MappedConstReference<P> at(const key_arg<K>& key) const { in at()
163 MappedReference<P> operator[](key_arg<K>&& key) {
[all …]
|
| H A D | btree_container.h | 46 using key_arg =
113 iterator find(const key_arg<K> &key) { in find()
121 bool contains(const key_arg<K> &key) const { in contains()
146 const key_arg<K> &key) const { in equal_range()
162 size_type erase(const key_arg<K> &key) { in erase()
245 using key_arg = typename super_type::template key_arg<K>;
343 node_type extract(const key_arg<K> &key) { in extract()
396 using key_arg = typename super_type::template key_arg<K>;
478 mapped_type &operator[](key_arg<K> &&k) {
483 mapped_type &at(const key_arg<K> &key) { in at()
[all …]
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/octree/include/pcl/octree/ |
| H A D | octree_base.h | 385 createLeaf(const OctreeKey& key_arg) in createLeaf() argument
403 findLeaf(const OctreeKey& key_arg) const in findLeaf() argument
415 existLeaf(const OctreeKey& key_arg) const in existLeaf() argument
417 return (findLeaf(key_arg) != nullptr); in existLeaf()
424 removeLeaf(const OctreeKey& key_arg) in removeLeaf() argument
426 if (key_arg <= max_key_) in removeLeaf()
582 createLeafRecursive(const OctreeKey& key_arg,
597 findLeafRecursive(const OctreeKey& key_arg,
611 deleteLeafRecursive(const OctreeKey& key_arg,
626 OctreeKey& key_arg,
[all …]
|
| H A D | octree2buf_base.h | 540 findLeaf(const OctreeKey& key_arg) const in findLeaf() argument
554 createLeaf(const OctreeKey& key_arg) in createLeaf() argument
572 existLeaf(const OctreeKey& key_arg) const in existLeaf() argument
574 return (findLeaf(key_arg) != nullptr); in existLeaf()
581 removeLeaf(const OctreeKey& key_arg) in removeLeaf() argument
583 if (key_arg <= max_key_) { in removeLeaf()
827 createLeafRecursive(const OctreeKey& key_arg,
843 findLeafRecursive(const OctreeKey& key_arg,
857 deleteLeafRecursive(const OctreeKey& key_arg,
877 OctreeKey& key_arg,
[all …]
|
| /dports/math/py-or-tools/or-tools-9.2/ortools/base/ |
| H A D | linked_hash_map.h | 314 size_type erase(const key_arg<K>& key) { in erase()
348 iterator find(const key_arg<K>& key) { in find()
355 const_iterator find(const key_arg<K>& key) const { in find()
362 size_type count(const key_arg<K>& key) const { in count()
366 bool contains(const key_arg<K>& key) const { in contains()
371 mapped_type& at(const key_arg<K>& key) { in at()
380 const mapped_type& at(const key_arg<K>& key) const { in at()
393 const key_arg<K>& key) const { in equal_range()
400 mapped_type& operator[](const key_arg<K>& key) {
405 mapped_type& operator[](key_arg<K>&& key) {
[all …]
|
| /dports/databases/pg_citus/citus-10.2.3/src/test/regress/sql/ |
| H A D | multi_prepare_plsql.sql | 209 CREATE FUNCTION single_parameter_insert(key_arg int)
212 INSERT INTO plpgsql_table (key) VALUES (key_arg);
224 CREATE FUNCTION double_parameter_insert(key_arg int, value_arg int)
227 INSERT INTO plpgsql_table (key, value) VALUES (key_arg, value_arg);
258 CREATE FUNCTION router_partition_column_select(key_arg int)
269 plpgsql_table.key = key_arg
338 CREATE FUNCTION real_time_partition_column_select(key_arg int)
349 plpgsql_table.key = key_arg OR
391 CREATE FUNCTION task_tracker_partition_column_select(key_arg int)
402 plpgsql_table.key = key_arg OR
|
| /dports/net/google-cloud-sdk/google-cloud-sdk/lib/googlecloudsdk/command_lib/oslogin/ |
| H A D | oslogin_utils.py | 45 def FindKeyInKeyList(key_arg, profile_keys): argument
48 key = profile_keys.get(key_arg)
50 return key_arg
53 key_split = key_arg.split()
|