Home
last modified time | relevance | path

Searched refs:bad_link_p (Results 1 – 3 of 3) sorted by relevance

/dports/math/polymake/polymake-4.5/apps/topaz/include/
H A D1D_tools.tcc26 Int fill_graph(Graph<>& G, const Complex& C, Int* bad_link_p) in fill_graph() argument
35 if (bad_link_p) *bad_link_p = n1; in fill_graph()
39 if (bad_link_p) *bad_link_p = n2; in fill_graph()
71 Int is_manifold(const Complex& C, const GenericSet<VertexSet>& V, int_constant<1>, Int* bad_link_p) in is_manifold() argument
74 return fill_graph(G, C, bad_link_p); in is_manifold()
H A Dcomplex_tools.tcc101 Int is_manifold(const Complex& C, int_constant<d>, Int* bad_link_p) in is_manifold() argument
119 if (bad_link_p) *bad_link_p=-1; in is_manifold()
123 return is_manifold(C, V, int_constant<d>(), bad_link_p); in is_manifold()
128 Int is_manifold(const Complex& C, const GenericSet<VertexSet>& V, int_constant<d>, Int* bad_link_p) in is_manifold() argument
134 if (bad_link_p) *bad_link_p = *it; in is_manifold()
H A Dcomplex_tools.h180 Int is_manifold(const Complex& C, const GenericSet<VertexSet>& V, int_constant<1>, Int* bad_link_p …
186 Int is_manifold(const Complex& C, const GenericSet<VertexSet>& V, int_constant<d>, Int* bad_link_p …
203 Int is_manifold(const Complex& C, int_constant<d>, Int* bad_link_p = nullptr);
208 Int is_manifold(const Complex& C, Int n_vertices, int_constant<d>, Int* bad_link_p = nullptr)
210 return is_manifold(C, sequence(0,n_vertices), int_constant<d>(), bad_link_p);