| /dports/games/wesnoth/wesnoth-1.14.17/src/ |
| H A D | pathutils.cpp | 243 location_set not_visited(locs.begin(), locs.end()); in get_tiles_radius() local
245 for ( ; radius != 0 && !not_visited.empty(); --radius ) in get_tiles_radius()
247 location_set::const_iterator it = not_visited.begin(); in get_tiles_radius()
248 location_set::const_iterator it_end = not_visited.end(); in get_tiles_radius()
268 not_visited.swap(must_visit); in get_tiles_radius()
272 result.insert(not_visited.begin(), not_visited.end()); in get_tiles_radius()
|
| /dports/math/scilab/scilab-6.1.1/scilab/modules/scicos/src/modelica_compiler/ |
| H A D | causalityGraph.ml | 32 mutable not_visited : bool; RecordField
55 current_node.not_visited <- false;
61 if node.not_visited then visit1' node;
75 Array.iter (fun node -> if node.not_visited then visit1' node) nodes;
82 node.not_visited <- true;
94 not_visited = true;
|
| /dports/games/openage/openage-0.3.0-1262-ga554ab49/libopenage/pathfinding/ |
| H A D | a_star.cpp | 117 bool not_visited = (visited_tiles.count(neighbor->position) == 0); in a_star() local
121 if (not_visited or new_past_cost < neighbor->past_cost) { in a_star()
122 if (not_visited) { in a_star()
135 if (not_visited) { in a_star()
|
| /dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/hipe/icode/ |
| H A D | hipe_icode_bincomp.erl | 53 NewSuccs = not_visited(Succs, Visited),
182 not_visited([], _) -> []; function
183 not_visited([E|T], M) -> function
185 #{E := _} -> not_visited(T, M);
186 _ -> [E|not_visited(T, M)]
|
| H A D | hipe_icode_range.erl | 190 RealNew = not_visited(NewLabels, Visited),
1967 not_visited([], _) -> []; function
1968 not_visited([E|T], M) -> function
1970 #{E := []} -> not_visited(T, M);
1971 _ -> [E|not_visited(T, M)]
|
| /dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/lib/hipe/icode/ |
| H A D | hipe_icode_bincomp.erl | 53 NewSuccs = not_visited(Succs, Visited),
182 not_visited([], _) -> []; function
183 not_visited([E|T], M) -> function
185 #{E := _} -> not_visited(T, M);
186 _ -> [E|not_visited(T, M)]
|
| H A D | hipe_icode_range.erl | 190 RealNew = not_visited(NewLabels, Visited),
1967 not_visited([], _) -> []; function
1968 not_visited([E|T], M) -> function
1970 #{E := []} -> not_visited(T, M);
1971 _ -> [E|not_visited(T, M)]
|
| /dports/lang/erlang-runtime21/otp-OTP-21.3.8.24/lib/hipe/icode/ |
| H A D | hipe_icode_bincomp.erl | 53 NewSuccs = not_visited(Succs, Visited),
182 not_visited([], _) -> []; function
183 not_visited([E|T], M) -> function
185 #{E := _} -> not_visited(T, M);
186 _ -> [E|not_visited(T, M)]
|
| H A D | hipe_icode_range.erl | 190 RealNew = not_visited(NewLabels, Visited),
1967 not_visited([], _) -> []; function
1968 not_visited([E|T], M) -> function
1970 #{E := []} -> not_visited(T, M);
1971 _ -> [E|not_visited(T, M)]
|
| /dports/cad/horizon-eda/horizon-2.1.0/src/pool-update/ |
| H A D | graph.cpp | 73 std::set<const PoolUpdateNode *> not_visited; in get_not_visited() local
76 not_visited.insert(&node); in get_not_visited()
78 return not_visited; in get_not_visited()
|
| /dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/cluster/ |
| H A D | _agglomerative.py | 331 not_visited = np.empty(n_nodes, dtype=np.int8, order="C")
352 not_visited.fill(1)
353 not_visited[k] = 0
354 _hierarchical._get_parents(A[i], coord_col, parent, not_visited)
355 _hierarchical._get_parents(A[j], coord_col, parent, not_visited)
|
| H A D | _hierarchical_fast.pyx | 131 np.ndarray[INT8, ndim=1, mode='c'] not_visited):
134 Modifies 'heads' and 'not_visited' in-place.
144 not_visited
155 if not_visited[node]:
156 not_visited[node] = 0
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/kernel/trace/ |
| H A D | trace_events_filter.c | 2089 .not_visited = nvisit, \
2098 char *not_visited; member
2220 if (*d->not_visited) in ftrace_test_event_filter()
2221 update_pred_fn(filter, d->not_visited); in ftrace_test_event_filter()
|
| /dports/multimedia/libv4l/linux-5.13-rc2/kernel/trace/ |
| H A D | trace_events_filter.c | 2089 .not_visited = nvisit, \
2098 char *not_visited; member
2220 if (*d->not_visited) in ftrace_test_event_filter()
2221 update_pred_fn(filter, d->not_visited); in ftrace_test_event_filter()
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/kernel/trace/ |
| H A D | trace_events_filter.c | 2089 .not_visited = nvisit, \
2098 char *not_visited; member
2220 if (*d->not_visited) in ftrace_test_event_filter()
2221 update_pred_fn(filter, d->not_visited); in ftrace_test_event_filter()
|
| /dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/algo/gnomon/ |
| H A D | chainer.cpp | 1609 list<const SChainMember*> not_visited(1,this); in AddToContained() local
1610 while(!not_visited.empty()) { in AddToContained()
1611 const SChainMember* mbr = not_visited.front(); in AddToContained()
1621 not_visited.push_back(mi); //store for future in AddToContained()
1624 not_visited.pop_front(); in AddToContained()
|