Home
last modified time | relevance | path

Searched refs:ring_vector (Results 1 – 12 of 12) sorted by relevance

/dports/science/libghemical/libghemical-3.0.0/src/
H A Dtyperule.cpp50 ring_vector.resize(p1.ring_vector.size()); in typerule()
51 for (i32u n1 = 0;n1 < ring_vector.size();n1++) in typerule()
53 ring_vector[n1] = new signed char[strlen((const char *) p1.ring_vector[n1]) + 1]; in typerule()
54 strcpy((char *) ring_vector[n1], (const char *) p1.ring_vector[n1]); in typerule()
60 for (i32u n1 = 0;n1 < ring_vector.size();n1++) delete[] ring_vector[n1]; in ~typerule()
206 newsr.data = ring_vector.size(); in ReadSubRule()
207 ring_vector.push_back(newring); in ReadSubRule()
391 n1 = strlen((const char *) ring_vector[sr_vector[rule].data]); n1 = (n1 + 1) / 2; in CheckRules()
392 if (!mdl->FindRing(atom, atom, ring_vector[sr_vector[rule].data], n1, flag + 1)) return false; in CheckRules()
460 p1 << "["; PrintRing(p1, ring_vector[sr_vector[p2].data]); p1 << "]"; in PrintSubRules()
H A Dtyperule.h65 vector<signed char *> ring_vector; variable
H A Dmodel.cpp941 static vector<signed char> ring_vector; in FindRing() local
943 if (!dist && str != NULL) ring_vector.resize(0); in FindRing()
954 if (str[n1] != ring_vector[n1]) return false; in FindRing()
968 ring_vector.push_back((* it1).bndr->bt.GetSymbol2()); in FindRing()
969 ring_vector.push_back((signed char) (* it1).atmr->el.GetAtomicNumber()); in FindRing()
978 ring_vector.pop_back(); in FindRing()
979 ring_vector.pop_back(); in FindRing()
/dports/databases/postgis30/postgis-3.0.4/deps/wagyu/include/mapbox/geometry/wagyu/
H A Dring.hpp67 using ring_vector = std::vector<ring_ptr<T>>; typedef
78 ring_vector<T> children;
159 ring_vector<T> children;
229 void set_to_children(ring_ptr<T> r, ring_vector<T>& children) { in set_to_children()
240 void remove_from_children(ring_ptr<T> r, ring_vector<T>& children) { in remove_from_children()
593 …ostream<charT, traits>& operator<<(std::basic_ostream<charT, traits>& out, ring_vector<T>& rings) { in operator <<()
H A Dtopology_correction.hpp240 ring_vector<T>& new_rings, in correct_repeated_points()
260 void find_and_correct_repeated_points(ring_ptr<T> r, ring_manager<T>& manager, ring_vector<T>& new_… in find_and_correct_repeated_points()
294 ring_vector<T>& new_rings) { in reassign_children_if_necessary()
337 void assign_new_ring_parents(ring_manager<T>& manager, ring_ptr<T> original_ring, ring_vector<T>& n… in assign_new_ring_parents()
459 ring_vector<T> new_rings; in correct_ring_self_intersections()
799 ring_vector<T> sort_rings_largest_to_smallest(ring_manager<T>& manager) { in sort_rings_largest_to_smallest()
800 ring_vector<T> sorted_rings; in sort_rings_largest_to_smallest()
815 ring_vector<T> sort_rings_smallest_to_largest(ring_manager<T>& manager) { in sort_rings_smallest_to_largest()
816 ring_vector<T> sorted_rings; in sort_rings_smallest_to_largest()
1272 using rev_itr = typename ring_vector<T>::reverse_iterator; in correct_tree()
[all …]
H A Dbuild_result.hpp35 ring_vector<T1> const& rings, in build_result_polygons()
/dports/databases/postgis32/postgis-3.2.0/deps/wagyu/include/mapbox/geometry/wagyu/
H A Dring.hpp67 using ring_vector = std::vector<ring_ptr<T>>; typedef
78 ring_vector<T> children;
159 ring_vector<T> children;
229 void set_to_children(ring_ptr<T> r, ring_vector<T>& children) { in set_to_children()
240 void remove_from_children(ring_ptr<T> r, ring_vector<T>& children) { in remove_from_children()
593 …ostream<charT, traits>& operator<<(std::basic_ostream<charT, traits>& out, ring_vector<T>& rings) { in operator <<()
H A Dtopology_correction.hpp240 ring_vector<T>& new_rings, in correct_repeated_points()
260 void find_and_correct_repeated_points(ring_ptr<T> r, ring_manager<T>& manager, ring_vector<T>& new_… in find_and_correct_repeated_points()
294 ring_vector<T>& new_rings) { in reassign_children_if_necessary()
337 void assign_new_ring_parents(ring_manager<T>& manager, ring_ptr<T> original_ring, ring_vector<T>& n… in assign_new_ring_parents()
459 ring_vector<T> new_rings; in correct_ring_self_intersections()
799 ring_vector<T> sort_rings_largest_to_smallest(ring_manager<T>& manager) { in sort_rings_largest_to_smallest()
800 ring_vector<T> sorted_rings; in sort_rings_largest_to_smallest()
815 ring_vector<T> sort_rings_smallest_to_largest(ring_manager<T>& manager) { in sort_rings_smallest_to_largest()
816 ring_vector<T> sorted_rings; in sort_rings_smallest_to_largest()
1272 using rev_itr = typename ring_vector<T>::reverse_iterator; in correct_tree()
[all …]
H A Dbuild_result.hpp35 ring_vector<T1> const& rings, in build_result_polygons()
/dports/databases/postgis31/postgis-3.1.4/deps/wagyu/include/mapbox/geometry/wagyu/
H A Dring.hpp67 using ring_vector = std::vector<ring_ptr<T>>; typedef
78 ring_vector<T> children;
159 ring_vector<T> children;
229 void set_to_children(ring_ptr<T> r, ring_vector<T>& children) { in set_to_children()
240 void remove_from_children(ring_ptr<T> r, ring_vector<T>& children) { in remove_from_children()
593 …ostream<charT, traits>& operator<<(std::basic_ostream<charT, traits>& out, ring_vector<T>& rings) { in operator <<()
H A Dtopology_correction.hpp240 ring_vector<T>& new_rings, in correct_repeated_points()
260 void find_and_correct_repeated_points(ring_ptr<T> r, ring_manager<T>& manager, ring_vector<T>& new_… in find_and_correct_repeated_points()
294 ring_vector<T>& new_rings) { in reassign_children_if_necessary()
337 void assign_new_ring_parents(ring_manager<T>& manager, ring_ptr<T> original_ring, ring_vector<T>& n… in assign_new_ring_parents()
459 ring_vector<T> new_rings; in correct_ring_self_intersections()
799 ring_vector<T> sort_rings_largest_to_smallest(ring_manager<T>& manager) { in sort_rings_largest_to_smallest()
800 ring_vector<T> sorted_rings; in sort_rings_largest_to_smallest()
815 ring_vector<T> sort_rings_smallest_to_largest(ring_manager<T>& manager) { in sort_rings_smallest_to_largest()
816 ring_vector<T> sorted_rings; in sort_rings_smallest_to_largest()
1272 using rev_itr = typename ring_vector<T>::reverse_iterator; in correct_tree()
[all …]
H A Dbuild_result.hpp35 ring_vector<T1> const& rings, in build_result_polygons()