| /dports/math/libmesh/libmesh-1.6.2/include/geom/ |
| H A D | elem_internal.h | 195 libmesh_assert (elem->has_neighbor(neighbor_in));
204 if (!c.is_remote() && c.has_neighbor(neighbor_in))
221 libmesh_assert (elem->has_neighbor(neighbor_in));
230 if (!c.is_remote() && c.has_neighbor(neighbor_in))
253 libmesh_assert (elem->has_neighbor(neighbor_in));
293 libmesh_assert (elem->has_neighbor(neighbor_in));
337 libmesh_assert (elem->has_neighbor(neighbor_in));
348 if (!c.is_remote() && c.has_neighbor(neighbor_in))
|
| H A D | elem.h | 358 bool has_neighbor (const Elem * elem) const;
2159 bool Elem::has_neighbor (const Elem * elem) const in has_neighbor() function
2392 return this->has_neighbor(nullptr); in on_boundary()
|
| /dports/multimedia/py-guessit/guessit-3.3.1/guessit/rules/properties/ |
| H A D | screen_size.py | 146 has_neighbor = False
151 has_neighbor = True
158 has_neighbor = True
160 if not has_neighbor:
|
| /dports/net-p2p/bazarr/bazarr-1.0.2/libs/guessit/rules/properties/ |
| H A D | screen_size.py | 146 has_neighbor = False
151 has_neighbor = True
158 has_neighbor = True
160 if not has_neighbor:
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/ |
| H A D | Triangulation_ds_full_cell.h | 131 CGAL_precondition(has_neighbor(s));
181 bool has_neighbor(Full_cell_const_handle s) const /* Concept */
184 return has_neighbor(s, index);
187 bool has_neighbor(Full_cell_const_handle s, int & index) const /* Concept */
|
| H A D | Triangulation_ds_face_base_2.h | 61 bool has_neighbor(Face_handle n) const;
62 bool has_neighbor(Face_handle n, int& i) const;
189 has_neighbor(Face_handle n) const in has_neighbor() function
198 has_neighbor(Face_handle n, int& i) const in has_neighbor() function
|
| H A D | Triangulation_ds_cell_base_3.h | 103 bool has_neighbor(Cell_handle n) const in has_neighbor() function
108 bool has_neighbor(Cell_handle n, int & i) const in has_neighbor() function
|
| H A D | Periodic_3_triangulation_ds_cell_base_3.h | 100 bool has_neighbor(const Cell_handle& n) const in has_neighbor() function
105 bool has_neighbor(const Cell_handle& n, int & i) const in has_neighbor() function
|
| H A D | Triangulation_on_sphere_2.h | 1223 CGAL_triangulation_assertion(f1->has_neighbor(eit)); in check_neighboring_faces()
1224 CGAL_triangulation_assertion(f2->has_neighbor(eit)); in check_neighboring_faces()
1233 CGAL_triangulation_assertion(f1->has_neighbor(eit)); in check_neighboring_faces()
1234 CGAL_triangulation_assertion(f2->has_neighbor(eit)); in check_neighboring_faces()
1235 CGAL_triangulation_assertion(f3->has_neighbor(eit)); in check_neighboring_faces()
|
| H A D | Compact_mesh_cell_base_3.h | 391 bool has_neighbor(Cell_handle n) const in has_neighbor() function
396 bool has_neighbor(Cell_handle n, int & i) const in has_neighbor() function
|
| H A D | Regular_triangulation_2.h | 1824 CGAL_triangulation_assertion(f1->has_neighbor(f2)); in update_hidden_points_2_2()
1886 CGAL_triangulation_assertion(f1->has_neighbor(f2) && in update_hidden_points_1_3()
1887 f2->has_neighbor(f3) && in update_hidden_points_1_3()
1888 f3->has_neighbor(f1)); in update_hidden_points_1_3()
|
| /dports/math/libmesh/libmesh-1.6.2/src/geom/ |
| H A D | elem.C | 929 if (has_neighbor(elem)) in has_topological_neighbor()
1127 neigh->has_neighbor(this)) in make_links_to_me_remote()
1168 while (!neigh->has_neighbor(my_ancestor)) in make_links_to_me_remote()
1231 neigh->has_neighbor(this)) in remove_links_to_me()
1270 while (!neigh->has_neighbor(my_ancestor)) in remove_links_to_me()
1694 libmesh_assert(has_neighbor(neighbor_in)); in min_p_level_by_neighbor()
1705 if (&c != remote_elem && c.has_neighbor(neighbor_in)) in min_p_level_by_neighbor()
1733 libmesh_assert(has_neighbor(neighbor_in)); in min_new_p_level_by_neighbor()
1738 if (&c != remote_elem && c.has_neighbor(neighbor_in)) in min_new_p_level_by_neighbor()
|
| /dports/games/gnugo/gnugo-3.8/engine/ |
| H A D | board.h | 327 int has_neighbor(int pos, int color);
|
| H A D | aftermath.c | 440 && has_neighbor(pos, other)) { in do_aftermath_genmove()
|
| H A D | reading.c | 1574 && has_neighbor(xpos, color)) in defend2()
3160 && !has_neighbor(apos, other)) in attack2()
3321 && !has_neighbor(apos, other)) in attack3()
3456 && !has_neighbor(apos, other)) in attack4()
|
| H A D | board.c | 1226 && !has_neighbor(pos, color))) in is_allowed_move()
2961 has_neighbor(int pos, int color) in has_neighbor() function
|
| /dports/x11/xlockmore/xlockmore-5.67/modes/ |
| H A D | bug.c | 529 has_neighbor(bugfarmstruct * bp, int col, int row) in has_neighbor() function
1312 if (!bp->arr[colrow] && !has_neighbor(bp, col, row)) { in init_bug()
1436 &ncol, &nrow) || has_neighbor(bp, ncol, nrow) || in draw_bug()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Tetrahedral_remeshing/internal/ |
| H A D | collapse_short_edges.h | 186 if (n0_ch->has_neighbor(n1_ch)) in collapse()
402 || n0_ch->has_neighbor(n1_ch)) in is_valid_collapse()
|
| /dports/math/py-networkx/networkx-2.6.3/doc/release/ |
| H A D | api_1.0.rst | 211 has_neighbor():
|
| /dports/math/libmesh/libmesh-1.6.2/src/mesh/ |
| H A D | mesh_refinement.C | 1822 return elem->has_neighbor(neighbor); in has_topological_neighbor()
|
| /dports/math/py-or-tools/or-tools-9.2/ortools/constraint_solver/ |
| H A D | local_search.cc | 4182 bool has_neighbor = false;
4185 has_neighbor = ls_operator_->MakeNextNeighbor(delta, deltadelta);
4187 ls_operator_, has_neighbor, delta, deltadelta);
4190 if (has_neighbor && !solver->IsUncheckedSolutionLimitReached()) {
|
| /dports/games/gnugo/gnugo-3.8/doc/ |
| H A D | utils.texi | 745 @item @code{int has_neighbor(int pos, int color)}
746 @findex has_neighbor
|
| /dports/graphics/py-pygraphviz/pygraphviz-1.6/pygraphviz/ |
| H A D | agraph.py | 591 def has_neighbor(self, u, v, key=None): member in AGraph
|
| /dports/math/giacxcas/giac-1.6.0/src/ |
| H A D | graphe.cc | 1752 if ((sg<0 || it->subgraph()==sg) && it->has_neighbor(index)) in in_degree()
2670 return node(i).has_neighbor(j); in has_edge()
2675 return node(i).has_neighbor(j) || node(j).has_neighbor(i); in nodes_are_adjacent()
3176 if (i!=j && it->has_neighbor(i) && in adjacent_nodes()
4480 if (v.has_neighbor(*it)) in cp_recurse()
4552 if (v.has_neighbor(*it)) in recurse()
4590 if (v.has_neighbor(*it)) in maxclique()
4715 if (j<lb && G->node(initially_colored[j]).has_neighbor(i)) in make_values()
12511 num_triplets+=wn.size()-(w.has_neighbor(i)?1:0); in transitivity()
|
| H A D | graphe.h | 161 …inline bool has_neighbor(int i) const { return binary_search(m_neighbors.begin(),m_neighbors.end()… in has_neighbor() function
|