| /dports/devel/libsigc++20/libsigc++-2.10.4/sigc++/adaptors/ |
| H A D | bound_argument.h | 57 : visited_(_A_argument) in bound_argument()
64 { return visited_; } in visit()
70 { return visited_; } in invoke()
75 T_type visited_;
93 : visited_(unwrap(_A_argument)) in bound_argument()
100 { return visited_; } in visit()
106 { return visited_.invoke(); } in invoke()
133 { return visited_; } in visit()
139 { return visited_.invoke(); } in invoke()
169 { return visited_; } in visit()
[all …]
|
| /dports/textproc/stardict3/stardict-3.0.6/dict/src/sigc++/adaptors/ |
| H A D | bound_argument.h | 57 : visited_(_A_argument) in bound_argument()
64 { return visited_; } in visit()
70 { return visited_; } in invoke()
75 T_type visited_;
91 : visited_(unwrap(_A_argument)) in bound_argument()
98 { return visited_; } in visit()
104 { return visited_.invoke(); } in invoke()
109 limit_reference<T_wrapped> visited_;
124 : visited_(unwrap(_A_argument)) in bound_argument()
131 { return visited_; } in visit()
[all …]
|
| /dports/games/ecwolf/ecwolf-1.3.3-src/android-libs/sigc++/sigc++/adaptors/ |
| H A D | bound_argument.h | 57 : visited_(_A_argument) in bound_argument()
64 { return visited_; } in visit()
70 { return visited_; } in invoke()
75 T_type visited_;
91 : visited_(unwrap(_A_argument)) in bound_argument()
98 { return visited_; } in visit()
104 { return visited_.invoke(); } in invoke()
109 limit_reference<T_wrapped> visited_;
124 : visited_(unwrap(_A_argument)) in bound_argument()
131 { return visited_; } in visit()
[all …]
|
| /dports/devel/libsigc++30/libsigc++-3.0.7/sigc++/adaptors/ |
| H A D | bound_argument.h | 56 bound_argument(const T_type& arg) : visited_(arg) {} in bound_argument()
61 inline const T_type& visit() const { return visited_; } in visit()
66 inline T_type& invoke() { return visited_; } in invoke()
71 T_type visited_;
86 bound_argument(const std::reference_wrapper<T_wrapped>& arg) : visited_(unwrap(arg)) {} in bound_argument()
91 inline const limit_reference<T_wrapped>& visit() const { return visited_; } in visit()
96 inline T_wrapped& invoke() { return visited_.invoke(); } in invoke()
101 limit_reference<T_wrapped> visited_;
120 inline const limit_reference<const T_wrapped>& visit() const { return visited_; } in visit()
125 inline const T_wrapped& invoke() { return visited_.invoke(); } in invoke()
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bgrl/ |
| H A D | bgrl_search_func.cxx | 19 if ( visited_.find(itr->to()) == visited_.end() ) in next_vertex()
22 while ( !eval_queue_.empty() && visited_.find(eval_queue_.front()->to()) != visited_.end() ) in next_vertex()
33 visited_.insert(curr_vertex_); in next_vertex()
50 if ( visited_.find(itr->to()) == visited_.end() ) in next_vertex()
53 while ( !eval_queue_.empty() && visited_.find(eval_queue_.front()->to()) != visited_.end() ) in next_vertex()
64 visited_.insert(curr_vertex_); in next_vertex()
|
| H A D | bgrl_search_func.h | 58 : bgrl_search_func(init_vertex) {visited_.insert(init_vertex);} in bgrl_search_func()
70 std::set<bgrl_vertex_sptr> visited_; variable
81 : bgrl_search_func(init_vertex) {visited_.insert(init_vertex);} in bgrl_search_func()
93 std::set<bgrl_vertex_sptr> visited_; variable
|
| /dports/math/clingo/clingo-5.5.1/libgringo/gringo/ |
| H A D | graph.hh | 53 unsigned visited_; member
80 , visited_(phase) { } in Node()
119 if (x.visited_ == nphase()) { in tarjan()
122 x.visited_ = ++index; in tarjan()
131 … for (; y->finished_ != end && (*y->finished_)->visited_ != nphase(); ++y->finished_) { } in tarjan()
137 if (z->visited_ != phase_ && z->visited_ < y->visited_) { in tarjan()
139 y->visited_ = z->visited_; in tarjan()
146 trail.back()->visited_ = phase_; in tarjan()
|
| /dports/misc/glow/glow-f24d960e3cc80db95ac0bc17b1900dbf60ca044a/include/glow/Graph/ |
| H A D | Utils.h | 34 std::unordered_set<const Node *> visited_; member
39 return !visited_.count(N); in shouldVisit()
44 return !visited_.count(N); in shouldVisit()
50 visited_.insert(N); in post()
87 std::unordered_set<const Node *> visited_; member
92 return !visited_.count(N); in shouldVisit()
97 return !visited_.count(N); in shouldVisit()
103 visited_.insert(N); in pre()
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/v8/src/ast/ |
| H A D | ast-function-literal-id-reindexer.cc | 21 visited_.clear(); in Reindex()
29 DCHECK(visited_.insert(lit).second); in VisitFunctionLiteral()
92 : AstTraversalVisitor(stack_limit), visited_(visited) {} in AstFunctionLiteralIdReindexChecker()
97 DCHECK(visited_->find(lit) != visited_->end()); in VisitFunctionLiteral()
101 const std::set<FunctionLiteral*>* visited_; member in v8::internal::__anoncafb8d010111::AstFunctionLiteralIdReindexChecker
107 AstFunctionLiteralIdReindexChecker(stack_limit(), &visited_).Visit(expr); in CheckVisited()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/v8/src/ast/ |
| H A D | ast-function-literal-id-reindexer.cc | 21 visited_.clear(); in Reindex()
29 DCHECK(visited_.insert(lit).second); in VisitFunctionLiteral()
93 : AstTraversalVisitor(stack_limit), visited_(visited) {} in AstFunctionLiteralIdReindexChecker()
98 DCHECK(visited_->find(lit) != visited_->end()); in VisitFunctionLiteral()
102 const std::set<FunctionLiteral*>* visited_; member in v8::internal::__anonb9c834860111::AstFunctionLiteralIdReindexChecker
108 AstFunctionLiteralIdReindexChecker(stack_limit(), &visited_).Visit(expr); in CheckVisited()
|
| /dports/lang/v8/v8-9.6.180.12/src/ast/ |
| H A D | ast-function-literal-id-reindexer.cc | 21 visited_.clear(); in Reindex()
29 DCHECK(visited_.insert(lit).second); in VisitFunctionLiteral()
93 : AstTraversalVisitor(stack_limit), visited_(visited) {} in AstFunctionLiteralIdReindexChecker()
98 DCHECK(visited_->find(lit) != visited_->end()); in VisitFunctionLiteral()
102 const std::set<FunctionLiteral*>* visited_; member in v8::internal::__anon21b26d7b0111::AstFunctionLiteralIdReindexChecker
108 AstFunctionLiteralIdReindexChecker(stack_limit(), &visited_).Visit(expr); in CheckVisited()
|
| /dports/math/disco/DisCO-releases-1.0.0-33-g68720be/examples/VRP/ |
| H A D | VrpHeurTSP.h | 74 bool *visited_; variable
91 if (visited_) { in freeGuts()
92 delete [] visited_; in freeGuts()
93 visited_ = NULL; in freeGuts()
114 visited_(0), preNode_(-1), in VrpHeurTSP()
123 visited_ = NULL; in VrpHeurTSP()
|
| H A D | VrpHeurTSP.cpp | 136 if (!visited_) { in searchSolution()
137 visited_ = new bool [numVertices]; in searchSolution()
140 visited_[k] = false; in searchSolution()
149 visited_[currV] = true; in searchSolution()
159 if (nextV > -1 && !visited_[nextV]) { in searchSolution()
165 visited_[nextV] = true; in searchSolution()
178 if (!visited_[nextV]) { in searchSolution()
184 visited_[nextV] = true; in searchSolution()
|
| /dports/textproc/regex2dfa/regex2dfa-0.1.6/third_party/re2/re2/testing/ |
| H A D | backtrack.cc | 74 uint32 *visited_; // bitmap: (Inst*, char*) pairs already backtracked member in re2::Backtracker
85 visited_(NULL), in Backtracker()
90 delete[] visited_; in ~Backtracker()
124 delete[] visited_; in Search()
126 visited_ = new uint32[nvisited_]; in Search()
127 memset(visited_, 0, nvisited_*sizeof visited_[0]); in Search()
155 if (visited_[n/32] & (1 << (n&31))) in Visit()
157 visited_[n/32] |= 1 << (n&31); in Visit()
|
| /dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/third_party/re2/re2/testing/ |
| H A D | backtrack.cc | 74 uint32 *visited_; // bitmap: (Inst*, char*) pairs already backtracked member in re2::Backtracker
85 visited_(NULL), in Backtracker()
90 delete[] visited_; in ~Backtracker()
124 delete[] visited_; in Search()
126 visited_ = new uint32[nvisited_]; in Search()
127 memset(visited_, 0, nvisited_*sizeof visited_[0]); in Search()
155 if (visited_[n/32] & (1 << (n&31))) in Visit()
157 visited_[n/32] |= 1 << (n&31); in Visit()
|
| /dports/net/ooni-mini/probe-engine-0.23.0/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/third_party/re2/re2/testing/ |
| H A D | backtrack.cc | 74 uint32 *visited_; // bitmap: (Inst*, char*) pairs already backtracked member in re2::Backtracker
85 visited_(NULL), in Backtracker()
90 delete[] visited_; in ~Backtracker()
124 delete[] visited_; in Search()
126 visited_ = new uint32[nvisited_]; in Search()
127 memset(visited_, 0, nvisited_*sizeof visited_[0]); in Search()
155 if (visited_[n/32] & (1 << (n&31))) in Visit()
157 visited_[n/32] |= 1 << (n&31); in Visit()
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/re2/src/re2/testing/ |
| H A D | backtrack.cc | 83 uint32_t *visited_; // bitmap: (Inst*, char*) pairs already backtracked member in re2::Backtracker
94 visited_(NULL), in Backtracker()
99 delete[] visited_; in ~Backtracker()
133 delete[] visited_; in Search()
135 visited_ = new uint32_t[nvisited_]; in Search()
136 memset(visited_, 0, nvisited_*sizeof visited_[0]); in Search()
168 if (visited_[n/32] & (1 << (n&31))) in Visit()
170 visited_[n/32] |= 1 << (n&31); in Visit()
|
| /dports/textproc/kibana6/kibana-6.8.16-darwin-x86_64/node_modules/re2/vendor/re2/testing/ |
| H A D | backtrack.cc | 83 uint32_t *visited_; // bitmap: (Inst*, char*) pairs already backtracked member in re2::Backtracker
97 visited_(NULL), in Backtracker()
102 delete[] visited_; in ~Backtracker()
136 delete[] visited_; in Search()
138 visited_ = new uint32_t[nvisited_]; in Search()
139 memset(visited_, 0, nvisited_*sizeof visited_[0]); in Search()
171 if (visited_[n/32] & (1 << (n&31))) in Visit()
173 visited_[n/32] |= 1 << (n&31); in Visit()
|
| /dports/games/warzone2100/warzone2100/3rdparty/re2/re2/testing/ |
| H A D | backtrack.cc | 83 PODArray<uint32_t> visited_; // bitmap: (Inst*, char*) pairs visited member in re2::Backtracker
131 visited_ = PODArray<uint32_t>(nvisited); in Search()
132 memset(visited_.data(), 0, nvisited*sizeof visited_[0]); in Search()
164 CHECK_LT(n/32, visited_.size()); in Visit()
165 if (visited_[n/32] & (1 << (n&31))) in Visit()
167 visited_[n/32] |= 1 << (n&31); in Visit()
|
| /dports/devel/re2/re2-2021-11-01/re2/testing/ |
| H A D | backtrack.cc | 83 PODArray<uint32_t> visited_; // bitmap: (Inst*, char*) pairs visited member in re2::Backtracker
131 visited_ = PODArray<uint32_t>(nvisited); in Search()
132 memset(visited_.data(), 0, nvisited*sizeof visited_[0]); in Search()
164 CHECK_LT(n/32, visited_.size()); in Visit()
165 if (visited_[n/32] & (1 << (n&31))) in Visit()
167 visited_[n/32] |= 1 << (n&31); in Visit()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/re2/src/re2/testing/ |
| H A D | backtrack.cc | 83 PODArray<uint32_t> visited_; // bitmap: (Inst*, char*) pairs visited member in re2::Backtracker
131 visited_ = PODArray<uint32_t>(nvisited); in Search()
132 memset(visited_.data(), 0, nvisited*sizeof visited_[0]); in Search()
164 CHECK_LT(n/32, visited_.size()); in Visit()
165 if (visited_[n/32] & (1 << (n&31))) in Visit()
167 visited_[n/32] |= 1 << (n&31); in Visit()
|
| /dports/textproc/kibana7/kibana-7.16.2-darwin-x86_64/node_modules/re2/vendor/re2/testing/ |
| H A D | backtrack.cc | 83 PODArray<uint32_t> visited_; // bitmap: (Inst*, char*) pairs visited member in re2::Backtracker
131 visited_ = PODArray<uint32_t>(nvisited); in Search()
132 memset(visited_.data(), 0, nvisited*sizeof visited_[0]); in Search()
164 CHECK_LT(n/32, visited_.size()); in Visit()
165 if (visited_[n/32] & (1 << (n&31))) in Visit()
167 visited_[n/32] |= 1 << (n&31); in Visit()
|
| /dports/textproc/opensearch-dashboards/opensearch-dashboards-1.2.0-linux-x64/node_modules/re2/vendor/re2/testing/ |
| H A D | backtrack.cc | 83 PODArray<uint32_t> visited_; // bitmap: (Inst*, char*) pairs visited member in re2::Backtracker
131 visited_ = PODArray<uint32_t>(nvisited); in Search()
132 memset(visited_.data(), 0, nvisited*sizeof visited_[0]); in Search()
164 CHECK_LT(n/32, visited_.size()); in Visit()
165 if (visited_[n/32] & (1 << (n&31))) in Visit()
167 visited_[n/32] |= 1 << (n&31); in Visit()
|
| /dports/devel/py-grpcio/grpcio-1.43.0/third_party/re2/re2/testing/ |
| H A D | backtrack.cc | 83 PODArray<uint32_t> visited_; // bitmap: (Inst*, char*) pairs visited member in re2::Backtracker
131 visited_ = PODArray<uint32_t>(nvisited); in Search()
132 memset(visited_.data(), 0, nvisited*sizeof visited_[0]); in Search()
164 CHECK_LT(n/32, visited_.size()); in Visit()
165 if (visited_[n/32] & (1 << (n&31))) in Visit()
167 visited_[n/32] |= 1 << (n&31); in Visit()
|
| /dports/textproc/regex2dfa/regex2dfa-0.1.6/third_party/re2/re2/ |
| H A D | bitstate.cc | 63 uint32 *visited_; // bitmap: (Inst*, char*) pairs already backtracked member in re2::BitState
80 visited_(NULL), in BitState()
88 delete[] visited_; in ~BitState()
98 if (visited_[n/VisitedBits] & (1 << (n & (VisitedBits-1)))) in ShouldVisit()
100 visited_[n/VisitedBits] |= 1 << (n & (VisitedBits-1)); in ShouldVisit()
315 visited_ = new uint32[nvisited_]; in Search()
316 memset(visited_, 0, nvisited_*sizeof visited_[0]); in Search()
|