/dports/databases/galera/galera-release_25.3.35/galerautils/src/ |
H A D | gu_thread.hpp | 33 prio_ (0) in ThreadSchedparam() 43 prio_ (prio) in ThreadSchedparam() 61 int prio() const { return prio_ ; } in prio() 66 return (policy_ == other.policy_ && prio_ == other.prio_); in operator ==() 83 int prio_; // Scheduling priority member in gu::ThreadSchedparam
|
/dports/databases/galera26/galera-release_26.4.10/galerautils/src/ |
H A D | gu_thread.hpp | 33 prio_ (0) in ThreadSchedparam() 43 prio_ (prio) in ThreadSchedparam() 61 int prio() const { return prio_ ; } in prio() 66 return (policy_ == other.policy_ && prio_ == other.prio_); in operator ==() 83 int prio_; // Scheduling priority member in gu::ThreadSchedparam
|
/dports/devel/boost-docs/boost_1_72_0/libs/intrusive/example/ |
H A D | doc_treap_set.cpp | 23 unsigned int prio_; member in MyClass 29 MyClass(int i, unsigned int prio) : int_(i), prio_(prio) in MyClass() 33 { return this->prio_; } in get_priority() 42 { return a.prio_ < b.prio_; } //Lower value means higher priority in priority_order() 45 { return a.prio_ > b.prio_; } //Higher value means higher priority in priority_inverse_order()
|
H A D | doc_treap_algorithms.cpp | 19 : prio_(priority), int_(i) in my_node() 22 int prio_; member 46 { bool operator()(const my_node *a, const my_node *b) { return a->prio_ < b->prio_;} }; in operator ()()
|
/dports/devel/boost-python-libs/boost_1_72_0/libs/intrusive/example/ |
H A D | doc_treap_set.cpp | 23 unsigned int prio_; member in MyClass 29 MyClass(int i, unsigned int prio) : int_(i), prio_(prio) in MyClass() 33 { return this->prio_; } in get_priority() 42 { return a.prio_ < b.prio_; } //Lower value means higher priority in priority_order() 45 { return a.prio_ > b.prio_; } //Higher value means higher priority in priority_inverse_order()
|
H A D | doc_treap_algorithms.cpp | 19 : prio_(priority), int_(i) in my_node() 22 int prio_; member 46 { bool operator()(const my_node *a, const my_node *b) { return a->prio_ < b->prio_;} }; in operator ()()
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/intrusive/example/ |
H A D | doc_treap_set.cpp | 23 unsigned int prio_; member in MyClass 29 MyClass(int i, unsigned int prio) : int_(i), prio_(prio) in MyClass() 33 { return this->prio_; } in get_priority() 42 { return a.prio_ < b.prio_; } //Lower value means higher priority in priority_order() 45 { return a.prio_ > b.prio_; } //Higher value means higher priority in priority_inverse_order()
|
H A D | doc_treap_algorithms.cpp | 19 : prio_(priority), int_(i) in my_node() 22 int prio_; member 46 { bool operator()(const my_node *a, const my_node *b) { return a->prio_ < b->prio_;} }; in operator ()()
|
/dports/databases/percona57-server/boost_1_59_0/libs/intrusive/example/ |
H A D | doc_treap_set.cpp | 23 unsigned int prio_; member in MyClass 29 MyClass(int i, unsigned int prio) : int_(i), prio_(prio) in MyClass() 33 { return this->prio_; } in get_priority() 42 { return a.prio_ < b.prio_; } //Lower value means higher priority in priority_order() 45 { return a.prio_ > b.prio_; } //Higher value means higher priority in priority_inverse_order()
|
H A D | doc_treap_algorithms.cpp | 19 : prio_(priority), int_(i) in my_node() 22 int prio_; member 46 { bool operator()(const my_node *a, const my_node *b) { return a->prio_ < b->prio_;} }; in operator ()()
|
/dports/databases/xtrabackup/boost_1_59_0/libs/intrusive/example/ |
H A D | doc_treap_set.cpp | 23 unsigned int prio_; member in MyClass 29 MyClass(int i, unsigned int prio) : int_(i), prio_(prio) in MyClass() 33 { return this->prio_; } in get_priority() 42 { return a.prio_ < b.prio_; } //Lower value means higher priority in priority_order() 45 { return a.prio_ > b.prio_; } //Higher value means higher priority in priority_inverse_order()
|
H A D | doc_treap_algorithms.cpp | 19 : prio_(priority), int_(i) in my_node() 22 int prio_; member 46 { bool operator()(const my_node *a, const my_node *b) { return a->prio_ < b->prio_;} }; in operator ()()
|
/dports/databases/percona57-client/boost_1_59_0/libs/intrusive/example/ |
H A D | doc_treap_set.cpp | 23 unsigned int prio_; member in MyClass 29 MyClass(int i, unsigned int prio) : int_(i), prio_(prio) in MyClass() 33 { return this->prio_; } in get_priority() 42 { return a.prio_ < b.prio_; } //Lower value means higher priority in priority_order() 45 { return a.prio_ > b.prio_; } //Higher value means higher priority in priority_inverse_order()
|
H A D | doc_treap_algorithms.cpp | 19 : prio_(priority), int_(i) in my_node() 22 int prio_; member 46 { bool operator()(const my_node *a, const my_node *b) { return a->prio_ < b->prio_;} }; in operator ()()
|
/dports/devel/boost-libs/boost_1_72_0/libs/intrusive/example/ |
H A D | doc_treap_set.cpp | 23 unsigned int prio_; member in MyClass 29 MyClass(int i, unsigned int prio) : int_(i), prio_(prio) in MyClass() 33 { return this->prio_; } in get_priority() 42 { return a.prio_ < b.prio_; } //Lower value means higher priority in priority_order() 45 { return a.prio_ > b.prio_; } //Higher value means higher priority in priority_inverse_order()
|
H A D | doc_treap_algorithms.cpp | 19 : prio_(priority), int_(i) in my_node() 22 int prio_; member 46 { bool operator()(const my_node *a, const my_node *b) { return a->prio_ < b->prio_;} }; in operator ()()
|
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/intrusive/example/ |
H A D | doc_treap_set.cpp | 23 unsigned int prio_; member in MyClass 29 MyClass(int i, unsigned int prio) : int_(i), prio_(prio) in MyClass() 33 { return this->prio_; } in get_priority() 42 { return a.prio_ < b.prio_; } //Lower value means higher priority in priority_order() 45 { return a.prio_ > b.prio_; } //Higher value means higher priority in priority_inverse_order()
|
H A D | doc_treap_algorithms.cpp | 19 : prio_(priority), int_(i) in my_node() 22 int prio_; member 46 { bool operator()(const my_node *a, const my_node *b) { return a->prio_ < b->prio_;} }; in operator ()()
|
/dports/devel/hyperscan/boost_1_75_0/libs/intrusive/example/ |
H A D | doc_treap_set.cpp | 23 unsigned int prio_; member in MyClass 29 MyClass(int i, unsigned int prio) : int_(i), prio_(prio) in MyClass() 33 { return this->prio_; } in get_priority() 42 { return a.prio_ < b.prio_; } //Lower value means higher priority in priority_order() 45 { return a.prio_ > b.prio_; } //Higher value means higher priority in priority_inverse_order()
|
H A D | doc_treap_algorithms.cpp | 19 : prio_(priority), int_(i) in my_node() 22 int prio_; member 46 { bool operator()(const my_node *a, const my_node *b) { return a->prio_ < b->prio_;} }; in operator ()()
|
/dports/math/openmesh/OpenMesh-8.1/src/OpenMesh/Tools/Decimater/ |
H A D | DecimaterT.hh | 152 : mesh_(_mesh), prio_(_prio), pos_(_pos) in HeapInterface() 157 { return mesh_.property(prio_, _vh0) < mesh_.property(prio_, _vh1); } in less() 161 { return mesh_.property(prio_, _vh0) > mesh_.property(prio_, _vh1); } in greater() 174 VPropHandleT<float> prio_; member in OpenMesh::Decimater::DecimaterT::HeapInterface
|
/dports/net/mpich/mpich-3.4.3/src/pm/hydra2/mpl/include/ |
H A D | mpl_thread_argobots.h | 122 #define MPL_thread_mutex_lock(mutex_ptr_, err_ptr_, prio_) \ argument 125 if (prio_ == MPL_THREAD_PRIO_HIGH) { \ 128 assert(prio_ == MPL_THREAD_PRIO_LOW); \
|
/dports/net/mpich/mpich-3.4.3/src/mpi/romio/mpl/include/ |
H A D | mpl_thread_argobots.h | 122 #define MPL_thread_mutex_lock(mutex_ptr_, err_ptr_, prio_) \ argument 125 if (prio_ == MPL_THREAD_PRIO_HIGH) { \ 128 assert(prio_ == MPL_THREAD_PRIO_LOW); \
|
/dports/net/mpich/mpich-3.4.3/src/mpl/include/ |
H A D | mpl_thread_argobots.h | 122 #define MPL_thread_mutex_lock(mutex_ptr_, err_ptr_, prio_) \ argument 125 if (prio_ == MPL_THREAD_PRIO_HIGH) { \ 128 assert(prio_ == MPL_THREAD_PRIO_LOW); \
|
/dports/net/mpich/mpich-3.4.3/src/pm/hydra/mpl/include/ |
H A D | mpl_thread_argobots.h | 122 #define MPL_thread_mutex_lock(mutex_ptr_, err_ptr_, prio_) \ argument 125 if (prio_ == MPL_THREAD_PRIO_HIGH) { \ 128 assert(prio_ == MPL_THREAD_PRIO_LOW); \
|