| /dports/net/pjsip/pjproject-2.11.1/pjsip/src/pjsua2/ |
| H A D | account.cpp | 90 NODE_READ_BOOL (this_node, dontUseAvpf); in readObject()
107 NODE_WRITE_BOOL (this_node, dontUseAvpf); in writeObject()
238 NODE_READ_UNSIGNED (this_node, proxyUse); in readObject()
271 NODE_READ_STRINGV (this_node, proxies); in readObject()
277 NODE_READ_INT (this_node, transportId); in readObject()
293 NODE_WRITE_STRINGV (this_node, proxies); in writeObject()
299 NODE_WRITE_INT (this_node, transportId); in writeObject()
368 NODE_READ_BOOL ( this_node, enabled); in readObject()
462 NODE_READ_OBJ ( this_node, srtpOpt); in readObject()
899 NODE_READ_STRING ( this_node, idUri); in readObject()
[all …]
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 64 static void init(node_ptr this_node) in init() argument
89 NodeTraits::set_next(this_node, this_node); in init_header()
90 NodeTraits::set_previous(this_node, this_node); in init_header()
105 return !next || next == this_node; in unique()
119 const_node_ptr p = this_node; in count()
123 }while (p != this_node); in count()
144 return this_node; in unlink()
262 if (other_node == this_node) in swap_nodes()
267 init_header(this_node); in swap_nodes()
280 swap_next(this_node, other_node); in swap_nodes()
[all …]
|
| H A D | circular_slist_algorithms.hpp | 71 static void init(node_ptr this_node);
141 { NodeTraits::set_next(this_node, this_node); } in init_header()
163 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
173 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
189 while (this_node != p_next_next){ in get_previous_previous_node()
208 const_node_ptr p = this_node; in count()
212 } while (p != this_node); in count()
251 if (other_node == this_node) in swap_nodes()
256 base_t::init_header(this_node); in swap_nodes()
272 NodeTraits::set_next(empty2 ? this_node : prev_other, this_node); in swap_nodes()
[all …]
|
| /dports/science/smoldyn/smoldyn-2.67/source/NextSubVolume/boost_include/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 89 NodeTraits::set_next(this_node, this_node); in init_header()
90 NodeTraits::set_previous(this_node, this_node); in init_header()
105 return !next || next == this_node; in unique()
119 const_node_ptr p = this_node; in count()
123 }while (p != this_node); in count()
144 return this_node; in unlink()
268 if (other_node == this_node) in swap_nodes()
273 init_header(this_node); in swap_nodes()
286 swap_next(this_node, other_node); in swap_nodes()
287 swap_prev(this_node, other_node); in swap_nodes()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node) BOOST_NOEXCEPT;
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node); in init()
145 { NodeTraits::set_next(this_node, this_node); } in unlink()
167 { return base_t::get_previous_node(this_node, this_node); }
177 { return get_previous_previous_node(this_node, this_node); } in link_before()
192 while (this_node != p_next_next){ in link_after() argument
211 const_node_ptr p = this_node;
215 } while (p != this_node);
228 if(NodeTraits::get_next(this_node))
254 if (other_node == this_node)
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no…
[all …]
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); }
167 { return base_t::get_previous_node(this_node, this_node); }
177 { return get_previous_previous_node(this_node, this_node); }
192 while (this_node != p_next_next){
211 const_node_ptr p = this_node;
215 } while (p != this_node);
228 if(NodeTraits::get_next(this_node))
254 if (other_node == this_node)
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no…
[all …]
|
| /dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/boost-1.60.0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
177 { return get_previous_previous_node(this_node, this_node); } in get_previous_previous_node()
192 while (this_node != p_next_next){ in get_previous_previous_node()
211 const_node_ptr p = this_node; in count()
215 } while (p != this_node); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
254 if (other_node == this_node) in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
[all …]
|