| /dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/thirdparty/nlohmann_json/nlohmann/ |
| H A D | fifo_map.hpp | 143 fifo_map() : m_keys(), m_compare(&m_keys), m_map(m_compare) {} in fifo_map()
146 …o_map &f) : m_keys(f.m_keys), m_compare(&m_keys, f.m_compare.m_timestamp), m_map(f.m_map.begin(), … in fifo_map()
151 : m_keys(), m_compare(&m_keys), m_map(m_compare) in fifo_map()
188 m_compare.add_key(key); in operator []()
195 m_compare.add_key(key); in operator []()
314 m_compare.add_key(value.first); in insert()
322 m_compare.add_key(value.first); in insert()
406 m_compare.remove_key(key); in erase()
416 std::swap(m_compare, other.m_compare); in swap()
487 return m_compare; in key_comp()
[all …]
|
| /dports/audio/giada/giada-0.17.1/src/deps/json/test/thirdparty/fifo_map/ |
| H A D | fifo_map.hpp | 126 fifo_map() : m_keys(), m_compare(&m_keys), m_map(m_compare) {} in fifo_map()
134 : m_keys(), m_compare(&m_keys), m_map(m_compare) in fifo_map()
171 m_compare.add_key(key); in operator []()
178 m_compare.add_key(key); in operator []()
297 m_compare.add_key(value.first); in insert()
305 m_compare.add_key(value.first); in insert()
312 m_compare.add_key(value.first); in insert()
389 m_compare.remove_key(key); in erase()
399 std::swap(m_compare, other.m_compare); in swap()
470 return m_compare; in key_comp()
[all …]
|
| /dports/www/libdatachannel/libdatachannel-0.16.1/deps/json/test/thirdparty/fifo_map/ |
| H A D | fifo_map.hpp | 126 fifo_map() : m_keys(), m_compare(&m_keys), m_map(m_compare) {} in fifo_map()
134 : m_keys(), m_compare(&m_keys), m_map(m_compare) in fifo_map()
171 m_compare.add_key(key); in operator []()
178 m_compare.add_key(key); in operator []()
297 m_compare.add_key(value.first); in insert()
305 m_compare.add_key(value.first); in insert()
312 m_compare.add_key(value.first); in insert()
389 m_compare.remove_key(key); in erase()
399 std::swap(m_compare, other.m_compare); in swap()
470 return m_compare; in key_comp()
[all …]
|
| /dports/devel/nlohmann-json/json-3.10.4/test/thirdparty/fifo_map/ |
| H A D | fifo_map.hpp | 126 fifo_map() : m_keys(), m_compare(&m_keys), m_map(m_compare) {} in fifo_map()
134 : m_keys(), m_compare(&m_keys), m_map(m_compare) in fifo_map()
171 m_compare.add_key(key); in operator []()
178 m_compare.add_key(key); in operator []()
297 m_compare.add_key(value.first); in insert()
305 m_compare.add_key(value.first); in insert()
312 m_compare.add_key(value.first); in insert()
389 m_compare.remove_key(key); in erase()
399 std::swap(m_compare, other.m_compare); in swap()
470 return m_compare; in key_comp()
[all …]
|
| /dports/net-p2p/libtorrent/libtorrent-0.13.8/rak/ |
| H A D | priority_queue.h | 66 : m_compare(l), m_equal(e) {}
73 std::pop_heap(begin(), end(), m_compare);
79 std::push_heap(begin(), end(), m_compare);
105 std::make_heap(begin(), end(), m_compare);
109 Compare m_compare;
122 queue_pop_iterator(Queue* q, Compare c) : m_queue(q), m_compare(c) {}
129 …bool operator != (const queue_pop_iterator& itr) { return !m_queue->empty() && !m_compare(m_…
130 …bool operator == (const queue_pop_iterator& itr) { return m_queue->empty() || m_compare(m_qu…
134 Compare m_compare;
|
| /dports/net-p2p/rtorrent/rtorrent-0.9.8/rak/ |
| H A D | priority_queue.h | 66 : m_compare(l), m_equal(e) {} in m_compare() function
73 std::pop_heap(begin(), end(), m_compare); in pop()
79 std::push_heap(begin(), end(), m_compare); in push()
105 std::make_heap(begin(), end(), m_compare); in erase()
109 Compare m_compare;
122 queue_pop_iterator(Queue* q, Compare c) : m_queue(q), m_compare(c) {} in queue_pop_iterator()
129 …bool operator != (const queue_pop_iterator& itr) { return !m_queue->empty() && !m_compare(m_…
130 …bool operator == (const queue_pop_iterator& itr) { return m_queue->empty() || m_compare(m_qu…
134 Compare m_compare; variable
|
| /dports/devel/loki/loki-0.1.7/include/loki/ |
| H A D | Checker.h | 121 m_compare( *host ) {} in CheckForNoChange()
126 || ( m_compare == *host ); in Check()
132 Host m_compare;
156 m_compare( *host ) {} in CheckForNoChangeOrThrow()
162 okay = ( m_compare == *host ); in Check()
168 Host m_compare;
191 m_compare( *host ) {} in CheckForEquality()
195 const bool okay = ( m_compare == *host ); in Check()
201 Host m_compare;
|
| /dports/games/trenchbroom/TrenchBroom-ed46601/common/src/Model/ |
| H A D | PickResult.cpp | 28 const CompareHits* m_compare; member in TrenchBroom::Model::PickResult::CompareWrapper
30 CompareWrapper(const CompareHits* compare) : m_compare(compare) {} in CompareWrapper()
31 … bool operator()(const Hit& lhs, const Hit& rhs) const { return m_compare->compare(lhs, rhs) < 0; } in operator ()()
36 m_compare(new CompareHitsByDistance()) {} in PickResult()
57 assert(m_compare.get() != NULL); in addHit()
58 …terator pos = std::upper_bound(m_hits.begin(), m_hits.end(), hit, CompareWrapper(m_compare.get())); in addHit()
|
| H A D | PickResult.h | 40 ComparePtr m_compare; variable
45 m_compare(compare) {} in PickResult()
|
| /dports/math/octave/octave-6.4.0/liboctave/util/ |
| H A D | oct-sort.cc | 143 m_compare = ascending_compare; in set_compare()
147 m_compare = nullptr; in set_compare()
1529 if (m_compare) in sort()
1547 if (m_compare) in sort()
1587 if (m_compare) in issorted()
1674 if (m_compare) in sort_rows()
1753 if (m_compare) in is_sorted_rows()
1799 if (m_compare) in lookup()
1835 if (m_compare) in lookup()
1910 if (m_compare) in lookup_sorted()
[all …]
|
| /dports/emulators/mess/mame-mame0226/src/devices/machine/ |
| H A D | ioptimer.cpp | 25 , m_compare(0) in iop_timer_device()
58 m_compare = 0; in device_reset()
94 m_compare_timer->adjust(attotime::from_ticks(m_compare - m_count, clock())); in update_compare_timer()
222 ret = m_compare; in read()
250 if (m_compare == data) in write()
253 m_compare = data; in write()
|
| H A D | ps2timer.cpp | 28 , m_compare(0) in ps2_timer_device()
63 m_compare = 0; in device_reset()
214 ret = m_compare; in read()
247 if (m_compare == data) in write()
250 m_compare = data; in write()
|
| /dports/emulators/mame/mame-mame0226/src/devices/machine/ |
| H A D | ioptimer.cpp | 25 , m_compare(0) in iop_timer_device()
58 m_compare = 0; in device_reset()
94 m_compare_timer->adjust(attotime::from_ticks(m_compare - m_count, clock())); in update_compare_timer()
222 ret = m_compare; in read()
250 if (m_compare == data) in write()
253 m_compare = data; in write()
|
| H A D | ps2timer.cpp | 28 , m_compare(0) in ps2_timer_device()
63 m_compare = 0; in device_reset()
214 ret = m_compare; in read()
247 if (m_compare == data) in write()
250 m_compare = data; in write()
|
| /dports/math/nfft/nfft-3.5.2/applications/quadratureS2/ |
| H A D | quadratureS2.c | 137 int m_compare; in main() local
233 fscanf(stdin,"points=%d\n",&m_compare); in main()
234 fprintf(stdout,"%d\n",m_compare); in main()
237 while (d < m_compare) in main()
663 m_compare = m_total; in main()
764 for (d = 0; d < m_compare; d++) in main()
787 for (d = 0; d < m_compare; d++) in main()
811 for (d = 0; d < m_compare; d++) in main()
836 for (d = 0; d < m_compare; d++) in main()
861 for (d = 0; d < m_compare; d++) in main()
[all …]
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | astar_search.hpp | 129 m_combine(combine), m_compare(compare), m_zero(zero) {} in astar_bfs_visitor()
150 if (m_compare(get(m_weight, e), m_zero)) in examine_edge()
162 m_combine, m_compare); in tree_edge()
177 m_combine, m_compare); in gray_target()
193 m_combine, m_compare); in black_target()
218 BinaryPredicate m_compare; member
|
| /dports/biology/lamarc/lamarc-2.1.8/boost/graph/ |
| H A D | astar_search.hpp | 126 m_combine(combine), m_compare(compare), m_zero(zero) {} in astar_bfs_visitor()
147 if (m_compare(get(m_weight, e), m_zero)) in examine_edge()
159 m_combine, m_compare); in tree_edge()
173 m_combine, m_compare); in gray_target()
188 m_combine, m_compare); in black_target()
212 BinaryPredicate m_compare; member
|
| H A D | dijkstra_shortest_paths.hpp | 88 m_combine(combine), m_compare(compare), m_zero(zero) { } in dijkstra_bfs_visitor()
93 m_combine, m_compare); in tree_edge()
102 m_combine, m_compare); in gray_target()
121 if (m_compare(get(m_weight, e), m_zero)) in examine_edge()
136 BinaryPredicate m_compare; member
|
| /dports/audio/amarok/amarok-3e11ccdd1417e70486eaaa84d8475182eec44c20/src/core-impl/collections/support/ |
| H A D | MemoryFilter.cpp | 219 , m_compare( Collections::QueryMaker::Equals ) in NumberMemoryFilter()
231 m_compare = compare; in setFilter()
238 switch( m_compare ) in filterMatches()
|
| /dports/math/ogdf/OGDF/include/ogdf/basic/ |
| H A D | PriorityQueue.h | 269 Compare(const C &compare = C()) : m_compare(compare) {} in m_compare() function
271 Compare(const Compare& other) : m_compare(other.m_compare) {} in Compare()
274 return m_compare(x.priority(), y.priority()); in operator()
277 C m_compare;
|
| /dports/deskutils/zanshin/zanshin-21.12.3/src/domain/ |
| H A D | livequery.h | 305 m_compare = compare; in setCompareFunction()
343 Q_ASSERT(m_compare); in onChanged()
346 return m_compare(input, existing); in onChanged()
407 CompareFunction m_compare; variable
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 94 m_combine(combine), m_compare(compare), m_zero(zero) { } in parallel_dijkstra_bfs_visitor()
109 if (m_compare(get(m_weight, e), m_zero)) in examine_edge()
120 m_combine, m_compare); in examine_edge()
145 BinaryPredicate m_compare; member
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 95 m_combine(combine), m_compare(compare), m_zero(zero) { } in parallel_dijkstra_bfs_visitor()
110 if (m_compare(get(m_weight, e), m_zero)) in examine_edge()
121 m_combine, m_compare); in examine_edge()
146 BinaryPredicate m_compare; member
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 94 m_combine(combine), m_compare(compare), m_zero(zero) { } in parallel_dijkstra_bfs_visitor()
109 if (m_compare(get(m_weight, e), m_zero)) in examine_edge()
120 m_combine, m_compare); in examine_edge()
145 BinaryPredicate m_compare; member
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/distributed/ |
| H A D | eager_dijkstra_shortest_paths.hpp | 94 m_combine(combine), m_compare(compare), m_zero(zero) { } in parallel_dijkstra_bfs_visitor()
109 if (m_compare(get(m_weight, e), m_zero)) in examine_edge()
120 m_combine, m_compare); in examine_edge()
145 BinaryPredicate m_compare; member
|