| /dports/science/chrono/chrono-7.0.1/src/chrono_thirdparty/HACD/ |
| H A D | hacdCircularList.inl | 31 m_head = next;
46 delete m_head;
49 m_head = 0;
72 delete m_head;
75 m_head = next;
89 delete m_head;
92 m_head = 0;
130 m_head->GetNext() = m_head->GetPrev() = m_head;
167 return m_head;
182 m_head = m_head->GetNext();
[all …]
|
| /dports/devel/bullet/bullet3-3.21/Extras/VHACD/inc/ |
| H A D | vhacdCircularList.inl | 21 m_head = next;
29 delete m_head;
31 m_head = 0;
47 delete m_head;
49 m_head = next;
56 delete m_head;
58 m_head = 0;
79 m_head->GetNext() = m_head->GetPrev() = m_head;
99 return m_head;
114 m_head = m_head->GetNext();
[all …]
|
| /dports/devel/bullet/bullet3-3.21/Extras/HACD/ |
| H A D | hacdCircularList.inl | 23 m_head = next;
31 delete m_head;
33 m_head = 0;
49 delete m_head;
51 m_head = next;
58 delete m_head;
60 m_head = 0;
81 m_head->GetNext() = m_head->GetPrev() = m_head;
101 return m_head;
116 m_head = m_head->GetNext();
[all …]
|
| /dports/devel/godot/godot-3.2.3-stable/thirdparty/vhacd/inc/ |
| H A D | vhacdCircularList.inl | 21 m_head = next;
29 delete m_head;
31 m_head = 0;
47 delete m_head;
49 m_head = next;
56 delete m_head;
58 m_head = 0;
79 m_head->GetNext() = m_head->GetPrev() = m_head;
99 return m_head;
114 m_head = m_head->GetNext();
[all …]
|
| /dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/vhacd/inc/ |
| H A D | vhacdCircularList.inl | 21 m_head = next;
29 delete m_head;
31 m_head = 0;
47 delete m_head;
49 m_head = next;
56 delete m_head;
58 m_head = 0;
79 m_head->GetNext() = m_head->GetPrev() = m_head;
99 return m_head;
114 m_head = m_head->GetNext();
[all …]
|
| /dports/devel/py-bullet3/bullet3-3.21/Extras/VHACD/inc/ |
| H A D | vhacdCircularList.inl | 21 m_head = next;
29 delete m_head;
31 m_head = 0;
47 delete m_head;
49 m_head = next;
56 delete m_head;
58 m_head = 0;
79 m_head->GetNext() = m_head->GetPrev() = m_head;
99 return m_head;
114 m_head = m_head->GetNext();
[all …]
|
| /dports/devel/py-bullet3/bullet3-3.21/Extras/HACD/ |
| H A D | hacdCircularList.inl | 23 m_head = next;
31 delete m_head;
33 m_head = 0;
49 delete m_head;
51 m_head = next;
58 delete m_head;
60 m_head = 0;
81 m_head->GetNext() = m_head->GetPrev() = m_head;
101 return m_head;
116 m_head = m_head->GetNext();
[all …]
|
| /dports/net-p2p/qtum/qtum-mainnet-fastlane-v0.20.3/src/cryptopp/ |
| H A D | queue.cpp | 86 m_head += len; in Get()
158 m_head = m_tail = new ByteQueueNode(*copy.m_head); in CopyFrom()
248 while (m_head && m_head != m_tail && m_head->UsedUp()) in CleanupUsedNodes()
251 m_head=m_head->next; in CleanupUsedNodes()
256 if (m_head && m_head->CurrentSize() == 0) in CleanupUsedNodes()
392 size_t len = STDMIN(length, m_head->m_head); in Unget()
394 m_head->m_head -= len; in Unget()
395 memcpy(m_head->buf + m_head->m_head, inString + length, len); in Unget()
408 contiguousSize = m_head->m_tail - m_head->m_head; in Spy()
415 return m_head->buf + m_head->m_head; in Spy()
[all …]
|
| /dports/security/cryptopp/cryptopp-8.6.0/ |
| H A D | queue.cpp | 91 m_head += len; in Get()
167 m_head = m_tail = new ByteQueueNode(*copy.m_head); in CopyFrom()
259 while (m_head && m_head != m_tail && m_head->UsedUp()) in CleanupUsedNodes()
262 m_head=m_head->m_next; in CleanupUsedNodes()
267 if (m_head && m_head->CurrentSize() == 0) in CleanupUsedNodes()
410 size_t len = STDMIN(length, m_head->m_head); in Unget()
412 m_head->m_head = m_head->m_head - len; in Unget()
413 memcpy(m_head->m_buf + m_head->m_head, inString + length, len); in Unget()
426 contiguousSize = m_head->m_tail - m_head->m_head; in Spy()
433 return m_head->m_buf + m_head->m_head; in Spy()
[all …]
|
| /dports/emulators/citra-qt5/citra-ac98458e0/externals/cryptopp/cryptopp/ |
| H A D | queue.cpp | 91 m_head += len; in Get()
166 m_head = m_tail = new ByteQueueNode(*copy.m_head); in CopyFrom()
258 while (m_head && m_head != m_tail && m_head->UsedUp()) in CleanupUsedNodes()
261 m_head=m_head->m_next; in CleanupUsedNodes()
266 if (m_head && m_head->CurrentSize() == 0) in CleanupUsedNodes()
409 size_t len = STDMIN(length, m_head->m_head); in Unget()
411 m_head->m_head = m_head->m_head - len; in Unget()
412 memcpy(m_head->m_buf + m_head->m_head, inString + length, len); in Unget()
425 contiguousSize = m_head->m_tail - m_head->m_head; in Spy()
432 return m_head->m_buf + m_head->m_head; in Spy()
[all …]
|
| /dports/emulators/citra/citra-ac98458e0/externals/cryptopp/cryptopp/ |
| H A D | queue.cpp | 91 m_head += len; in Get()
166 m_head = m_tail = new ByteQueueNode(*copy.m_head); in CopyFrom()
258 while (m_head && m_head != m_tail && m_head->UsedUp()) in CleanupUsedNodes()
261 m_head=m_head->m_next; in CleanupUsedNodes()
266 if (m_head && m_head->CurrentSize() == 0) in CleanupUsedNodes()
409 size_t len = STDMIN(length, m_head->m_head); in Unget()
411 m_head->m_head = m_head->m_head - len; in Unget()
412 memcpy(m_head->m_buf + m_head->m_head, inString + length, len); in Unget()
425 contiguousSize = m_head->m_tail - m_head->m_head; in Spy()
432 return m_head->m_buf + m_head->m_head; in Spy()
[all …]
|
| /dports/sysutils/fusefs-securefs/securefs-0.12.0/external/cryptopp/ |
| H A D | queue.cpp | 91 m_head += len; in Get()
166 m_head = m_tail = new ByteQueueNode(*copy.m_head); in CopyFrom()
258 while (m_head && m_head != m_tail && m_head->UsedUp()) in CleanupUsedNodes()
261 m_head=m_head->m_next; in CleanupUsedNodes()
266 if (m_head && m_head->CurrentSize() == 0) in CleanupUsedNodes()
409 size_t len = STDMIN(length, m_head->m_head); in Unget()
411 m_head->m_head = m_head->m_head - len; in Unget()
412 memcpy(m_head->m_buf + m_head->m_head, inString + length, len); in Unget()
425 contiguousSize = m_head->m_tail - m_head->m_head; in Spy()
432 return m_head->m_buf + m_head->m_head; in Spy()
[all …]
|
| /dports/databases/gigabase/gigabase/crypt/rc4/ |
| H A D | queue.cpp | 88 m_head += len; in Get()
95 m_head += len; in Get()
102 m_head += len; in TransferTo()
109 m_head += len; in TransferTo()
116 m_head += len; in Skip()
148 m_head = m_tail = new ByteQueueNode(*copy.m_head); in CopyFrom()
229 while (m_head != m_tail && m_head->UsedUp()) in CleanupUsedNodes()
232 m_head=m_head->next; in CleanupUsedNodes()
356 contiguousSize = m_head->m_tail - m_head->m_head; in Spy()
363 return m_head->buf + m_head->m_head; in Spy()
[all …]
|
| /dports/x11/disman/disman-fd261a3b0c8991d1deb81e2d78e575bd96f5be60/backends/wayland/plugins/wlroots-wrapland/ |
| H A D | wlroots_output.cpp | 62 , m_head(head) in WlrootsOutput()
76 return m_head != nullptr; in enabled()
97 if (portraitMode(m_head)) { in geometry()
108 return m_head; in outputHead()
138 for (auto wlMode : m_head->modes()) { in updateDismanOutput()
182 output->set_scale(m_head->scale()); in updateDismanOutput()
183 output->setType(guessType(m_head->name(), m_head->name())); in updateDismanOutput()
242 assert(m_head); in hash()
243 if (!m_head->model().isEmpty()) { in hash()
245 .arg(m_head->make(), m_head->model(), m_head->serialNumber(), m_head->name()); in hash()
[all …]
|
| /dports/x11-toolkits/qt5-quick3d/kde-qtquick3d-5.15.2p19/src/utils/ |
| H A D | qssginvasivelinkedlist_p.h | 161 T *m_head = nullptr; member
163 QSSGInvasiveSingleLinkedList(const List &inOther) : m_head(inOther.m_head) {} in QSSGInvasiveSingleLinkedList()
166 m_head = inOther.m_head;
176 m_head = &inObj; in push_front()
182 m_head = &inObj; in push_back()
221 T *m_head = nullptr; member
228 m_head = inOther.m_head;
235 Q_ASSERT(m_head); in front()
236 return *m_head; in front()
251 m_head = &inObj; in push_front()
[all …]
|
| /dports/math/ogdf/OGDF/include/ogdf/basic/ |
| H A D | SList.h | 401 m_head = L.m_head;
410 SListElement<E> *pX = m_head, *pY = L.m_head;
434 m_head = new SListElement<E>(this, x, m_head); in pushFront()
436 return m_head; in pushFront()
447 return m_head; in emplaceFront()
500 if ((m_head = m_head->m_next) == nullptr) m_tail = nullptr; in popFront()
554 if ((m_head = m_head->m_next) == nullptr) m_tail = nullptr; in moveFrontToFront()
568 if ((m_head = m_head->m_next) == nullptr) m_tail = nullptr; in moveFrontToBack()
589 if ((m_head = m_head->m_next) == nullptr) m_tail = nullptr; in moveFrontToSucc()
599 if (m_head) in conc()
[all …]
|
| /dports/games/wop/wop-0.4.3/src/ |
| H A D | ringbuffer.hpp | 60 : m_head(0), in RingBuffer()
91 m_tail = m_head = 0; in setFull()
137 if( m_head >= m_maxSize ) m_head = 0; in pull()
179 if( !m_head ) m_head = getMaxSize()-1; in pushFront()
181 m_data[m_head] = entry; in pushFront()
193 if( ++m_head >= getMaxSize() ) m_head = 0; in continuousPushBack()
203 if( !m_head ) m_head = getMaxSize()-1; in continuousPushFront()
205 m_data[m_head] = entry; in continuousPushFront()
260 if( (m_head += v) >= getMaxSize() ) m_head -= getMaxSize(); in shift()
271 m_head = 0; in setSize()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/spirit/home/classic/iterator/ |
| H A D | fixed_size_queue.hpp | 248 std::size_t m_head; member in boost::spirit::fixed_size_queue
257 : m_head(0) in fixed_size_queue()
270 : m_head(x.m_head) in fixed_size_queue()
287 m_head = x.m_head; in operator =()
345 if (m_head == 0) in push_front()
346 m_head = N; in push_front()
348 --m_head; in push_front()
350 m_queue[m_head] = e; in push_front()
384 ++m_head; in pop_front()
385 if (m_head == N+1) in pop_front()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/spirit/home/support/iterators/detail/ |
| H A D | fixed_size_queue.hpp | 241 std::size_t m_head; member in boost::spirit::detail::fixed_size_queue
250 : m_head(0) in fixed_size_queue()
263 : m_head(x.m_head) in fixed_size_queue()
280 m_head = x.m_head; in operator =()
338 if (m_head == 0) in push_front()
339 m_head = N; in push_front()
341 --m_head; in push_front()
343 m_queue[m_head] = e; in push_front()
377 ++m_head; in pop_front()
378 if (m_head == N+1) in pop_front()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/spirit/home/support/iterators/detail/ |
| H A D | fixed_size_queue.hpp | 241 std::size_t m_head; member in boost::spirit::detail::fixed_size_queue
250 : m_head(0) in fixed_size_queue()
263 : m_head(x.m_head) in fixed_size_queue()
280 m_head = x.m_head; in operator =()
338 if (m_head == 0) in push_front()
339 m_head = N; in push_front()
341 --m_head; in push_front()
343 m_queue[m_head] = e; in push_front()
377 ++m_head; in pop_front()
378 if (m_head == N+1) in pop_front()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/spirit/home/classic/iterator/ |
| H A D | fixed_size_queue.hpp | 248 std::size_t m_head; member in boost::spirit::fixed_size_queue
257 : m_head(0) in fixed_size_queue()
270 : m_head(x.m_head) in fixed_size_queue()
287 m_head = x.m_head; in operator =()
345 if (m_head == 0) in push_front()
346 m_head = N; in push_front()
348 --m_head; in push_front()
350 m_queue[m_head] = e; in push_front()
384 ++m_head; in pop_front()
385 if (m_head == N+1) in pop_front()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/spirit/home/support/iterators/detail/ |
| H A D | fixed_size_queue.hpp | 241 std::size_t m_head; member in boost::spirit::detail::fixed_size_queue
250 : m_head(0) in fixed_size_queue()
263 : m_head(x.m_head) in fixed_size_queue()
280 m_head = x.m_head; in operator =()
338 if (m_head == 0) in push_front()
339 m_head = N; in push_front()
341 --m_head; in push_front()
343 m_queue[m_head] = e; in push_front()
377 ++m_head; in pop_front()
378 if (m_head == N+1) in pop_front()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/spirit/home/classic/iterator/ |
| H A D | fixed_size_queue.hpp | 248 std::size_t m_head; member in boost::spirit::fixed_size_queue
257 : m_head(0) in fixed_size_queue()
270 : m_head(x.m_head) in fixed_size_queue()
287 m_head = x.m_head; in operator =()
345 if (m_head == 0) in push_front()
346 m_head = N; in push_front()
348 --m_head; in push_front()
350 m_queue[m_head] = e; in push_front()
384 ++m_head; in pop_front()
385 if (m_head == N+1) in pop_front()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/spirit/home/classic/iterator/ |
| H A D | fixed_size_queue.hpp | 248 std::size_t m_head; member in boost::spirit::fixed_size_queue
257 : m_head(0) in fixed_size_queue()
270 : m_head(x.m_head) in fixed_size_queue()
287 m_head = x.m_head; in operator =()
345 if (m_head == 0) in push_front()
346 m_head = N; in push_front()
348 --m_head; in push_front()
350 m_queue[m_head] = e; in push_front()
384 ++m_head; in pop_front()
385 if (m_head == N+1) in pop_front()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/spirit/home/support/iterators/detail/ |
| H A D | fixed_size_queue.hpp | 241 std::size_t m_head; member in boost::spirit::detail::fixed_size_queue
250 : m_head(0) in fixed_size_queue()
263 : m_head(x.m_head) in fixed_size_queue()
280 m_head = x.m_head; in operator =()
338 if (m_head == 0) in push_front()
339 m_head = N; in push_front()
341 --m_head; in push_front()
343 m_queue[m_head] = e; in push_front()
377 ++m_head; in pop_front()
378 if (m_head == N+1) in pop_front()
[all …]
|