| /dports/graphics/tesseract/tesseract-5.0.0/src/textord/ |
| H A D | edgblob.cpp | 146 if (child_it.empty()) { in outline_complexity()
149 for (child_it.mark_cycle_pt(); !child_it.cycled_list(); in outline_complexity()
150 child_it.forward()) { in outline_complexity()
151 child = child_it.data(); in outline_complexity()
225 if (child_it.empty()) { in count_children()
228 for (child_it.mark_cycle_pt(); !child_it.cycled_list(); in count_children()
229 child_it.forward()) { in count_children()
230 child = child_it.data(); in count_children()
335 for (child_it.mark_cycle_pt(); !child_it.cycled_list(); in extract_children()
336 child_it.forward()) { in extract_children()
[all …]
|
| /dports/math/cvc4/CVC4-1.7/src/theory/arith/ |
| H A D | theory_arith_type_rules.h | 46 TNode::iterator child_it = n.begin(); in computeType() local
49 for(; child_it != child_it_end; ++child_it) { in computeType()
50 TypeNode childType = (*child_it).getType(check); in computeType()
80 TNode::iterator child_it = n.begin(); in computeType() local
83 for(; child_it != child_it_end; ++child_it) { in computeType()
84 TypeNode childType = (*child_it).getType(check); in computeType()
98 TNode::iterator child_it = n.begin(); in computeType() local
101 for(; child_it != child_it_end; ++child_it) { in computeType()
102 TypeNode childType = (*child_it).getType(check); in computeType()
|
| /dports/devel/poco/poco-1.10.1-all/Foundation/src/ |
| H A D | DirectoryIteratorStrategy.cpp | 73 DirectoryIterator child_it(itStack->top().path()); in next() local
75 if (child_it != _itEnd) in next()
77 itStack->push(child_it); in next()
78 return child_it->path(); in next()
141 DirectoryIterator child_it(dir); in next() local
144 if (child_it != _itEnd) in next()
146 itStack->push(child_it); in next()
148 return child_it->path(); in next()
|
| /dports/math/cvc4/CVC4-1.7/src/theory/booleans/ |
| H A D | theory_bool_type_rules.h | 32 TNode::iterator child_it = n.begin(); in computeType() local
34 for(; child_it != child_it_end; ++child_it) { in computeType()
35 if(!(*child_it).getType(check).isBoolean()) { in computeType()
36 Debug("pb") << "failed type checking: " << *child_it << std::endl; in computeType()
37 Debug("pb") << " integer: " << (*child_it).getType(check).isInteger() << std::endl; in computeType()
38 Debug("pb") << " real: " << (*child_it).getType(check).isReal() << std::endl; in computeType()
|
| /dports/math/cvc4/CVC4-1.7/src/theory/builtin/ |
| H A D | theory_builtin_type_rules.h | 106 TNode::iterator child_it = n.begin(); in computeType() local
108 TypeNode joinType = (*child_it).getType(check); in computeType()
109 for (++child_it; child_it != child_it_end; ++child_it) { in computeType()
110 TypeNode currentType = (*child_it).getType(); in computeType()
125 for(TNode::iterator child_it = n.begin(), child_it_end = n.end(); in computeType() local
126 child_it != child_it_end; in computeType()
127 ++child_it) { in computeType()
128 types.push_back((*child_it).getType(check)); in computeType()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 89 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
91 child_it != it->second.children.end(); in add_rings()
92 ++child_it) in add_rings()
94 iterator mit = map.find(*child_it); in add_rings()
99 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 108 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
110 child_it != it->second.children.end(); in add_rings()
111 ++child_it) in add_rings()
113 iterator mit = map.find(*child_it); in add_rings()
118 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 108 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
110 child_it != it->second.children.end(); in add_rings()
111 ++child_it) in add_rings()
113 iterator mit = map.find(*child_it); in add_rings()
118 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 108 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
110 child_it != it->second.children.end(); in add_rings()
111 ++child_it) in add_rings()
113 iterator mit = map.find(*child_it); in add_rings()
118 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 108 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
110 child_it != it->second.children.end(); in add_rings()
111 ++child_it) in add_rings()
113 iterator mit = map.find(*child_it); in add_rings()
118 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 108 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
110 child_it != it->second.children.end(); in add_rings()
111 ++child_it) in add_rings()
113 iterator mit = map.find(*child_it); in add_rings()
118 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 108 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
110 child_it != it->second.children.end(); in add_rings()
111 ++child_it) in add_rings()
113 iterator mit = map.find(*child_it); in add_rings()
118 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 108 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
110 child_it != it->second.children.end(); in add_rings()
111 ++child_it) in add_rings()
113 iterator mit = map.find(*child_it); in add_rings()
118 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/math/cvc4/CVC4-1.7/src/smt_util/ |
| H A D | node_visitor.h | 102 for(TNode::iterator child_it = current.begin(); child_it != current.end(); ++ child_it) { in run() local
103 TNode childNode = *child_it; in run()
|
| /dports/math/cvc4/CVC4-1.7/src/preprocessing/passes/ |
| H A D | int_to_bv.cpp | 104 for (TNode::iterator child_it = current.begin(); in intToBVMakeBinary() local
105 child_it != current.end(); in intToBVMakeBinary()
106 ++child_it) in intToBVMakeBinary()
108 TNode childNode = *child_it; in intToBVMakeBinary()
250 for (TNode::iterator child_it = current.begin(); in intToBV() local
251 child_it != current.end(); in intToBV()
252 ++child_it) in intToBV()
254 TNode childNode = *child_it; in intToBV()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 128 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
130 child_it != it->second.children.end(); in add_rings()
131 ++child_it) in add_rings()
133 iterator mit = map.find(*child_it); in add_rings()
138 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 130 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
132 child_it != it->second.children.end(); in add_rings()
133 ++child_it) in add_rings()
135 iterator mit = map.find(*child_it); in add_rings()
140 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 128 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
130 child_it != it->second.children.end(); in add_rings()
131 ++child_it) in add_rings()
133 iterator mit = map.find(*child_it); in add_rings()
138 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 130 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
132 child_it != it->second.children.end(); in add_rings()
133 ++child_it) in add_rings()
135 iterator mit = map.find(*child_it); in add_rings()
140 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 125 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
127 child_it != it->second.children.end(); in add_rings()
128 ++child_it) in add_rings()
130 iterator mit = map.find(*child_it); in add_rings()
135 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 130 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
132 child_it != it->second.children.end(); in add_rings()
133 ++child_it) in add_rings()
135 iterator mit = map.find(*child_it); in add_rings()
140 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 128 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
130 child_it != it->second.children.end(); in add_rings()
131 ++child_it) in add_rings()
133 iterator mit = map.find(*child_it); in add_rings()
138 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 128 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
130 child_it != it->second.children.end(); in add_rings()
131 ++child_it) in add_rings()
133 iterator mit = map.find(*child_it); in add_rings()
138 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/geometry/algorithms/detail/overlay/ |
| H A D | add_rings.hpp | 128 for (typename std::vector<ring_identifier>::const_iterator child_it in add_rings() local
130 child_it != it->second.children.end(); in add_rings()
131 ++child_it) in add_rings()
133 iterator mit = map.find(*child_it); in add_rings()
138 *child_it, mit->second.reversed, true); in add_rings()
|
| /dports/audio/gmpc/gmpc-11.8.16/src/Widgets/ |
| H A D | gmpc-widgets-qtable.c | 392 GList* child_it; in gmpc_widgets_qtable_real_size_request() local
394 for (child_it = child_collection; child_it != NULL; child_it = child_it->next) { in gmpc_widgets_qtable_real_size_request()
397 _tmp2_ = _qtable_entry_ref0 ((QtableEntry*) child_it->data); in gmpc_widgets_qtable_real_size_request()
447 GList* child_it; in gmpc_widgets_qtable_real_size_request() local
449 for (child_it = child_collection; child_it != NULL; child_it = child_it->next) { in gmpc_widgets_qtable_real_size_request()
452 _tmp12_ = _qtable_entry_ref0 ((QtableEntry*) child_it->data); in gmpc_widgets_qtable_real_size_request()
632 GList* child_it; in gmpc_widgets_qtable_real_size_allocate() local
634 for (child_it = child_collection; child_it != NULL; child_it = child_it->next) { in gmpc_widgets_qtable_real_size_allocate()
637 _tmp0_ = _qtable_entry_ref0 ((QtableEntry*) child_it->data); in gmpc_widgets_qtable_real_size_allocate()
696 GList* child_it; in gmpc_widgets_qtable_real_size_allocate() local
[all …]
|