HomeSort by: relevance | last modified time | path
    Searched defs:p_y (Results 1 - 16 of 16) sorted by relevancy

  /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/
insert_fn_imps.hpp 71 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right; local
72 if (p_y != 0 && p_y->m_red)
75 p_y->m_red = false;
93 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_left; local
94 if (p_y != 0 && p_y->m_red)
97 p_y->m_red = false;
erase_fn_imps.hpp 127 node_pointer p_y = p_z; local
131 if (p_y->m_p_left == 0)
132 p_x = p_y->m_p_right;
133 else if (p_y->m_p_right == 0)
134 p_x = p_y->m_p_left;
137 p_y = p_y->m_p_right;
138 while (p_y->m_p_left != 0)
139 p_y = p_y->m_p_left
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/
insert_fn_imps.hpp 71 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right; local
72 if (p_y != 0 && p_y->m_red)
75 p_y->m_red = false;
93 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_left; local
94 if (p_y != 0 && p_y->m_red)
97 p_y->m_red = false;
erase_fn_imps.hpp 127 node_pointer p_y = p_z; local
131 if (p_y->m_p_left == 0)
132 p_x = p_y->m_p_right;
133 else if (p_y->m_p_right == 0)
134 p_x = p_y->m_p_left;
137 p_y = p_y->m_p_right;
138 while (p_y->m_p_left != 0)
139 p_y = p_y->m_p_left
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
rotate_fn_imps.hpp 48 node_pointer p_y = p_x->m_p_right; local
50 p_x->m_p_right = p_y->m_p_left;
52 if (p_y->m_p_left != 0)
53 p_y->m_p_left->m_p_parent = p_x;
55 p_y->m_p_parent = p_x->m_p_parent;
58 m_p_head->m_p_parent = p_y;
60 p_x->m_p_parent->m_p_left = p_y;
62 p_x->m_p_parent->m_p_right = p_y;
64 p_y->m_p_left = p_x;
65 p_x->m_p_parent = p_y;
79 node_pointer p_y = p_x->m_p_left; local
    [all...]
point_iterators.hpp 226 Node_Pointer p_y = m_p_nd->m_p_parent; local
227 while (m_p_nd == p_y->m_p_right)
229 m_p_nd = p_y;
230 p_y = p_y->m_p_parent;
233 if (m_p_nd->m_p_right != p_y)
234 m_p_nd = p_y;
252 Node_Pointer p_y = m_p_nd->m_p_left; local
253 while (p_y->m_p_right != 0)
254 p_y = p_y->m_p_right
259 Node_Pointer p_y = m_p_nd->m_p_parent; local
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
rotate_fn_imps.hpp 48 node_pointer p_y = p_x->m_p_right; local
49 p_x->m_p_right = p_y->m_p_left;
51 if (p_y->m_p_left != 0)
52 p_y->m_p_left->m_p_parent = p_x;
54 p_y->m_p_parent = p_x->m_p_parent;
56 m_p_head->m_p_parent = p_y;
58 p_x->m_p_parent->m_p_left = p_y;
60 p_x->m_p_parent->m_p_right = p_y;
62 p_y->m_p_left = p_x;
63 p_x->m_p_parent = p_y;
77 node_pointer p_y = p_x->m_p_left; local
    [all...]
pat_trie_base.hpp 608 node_pointer p_y = m_p_nd->m_p_parent; local
609 while (p_y->m_type != head_node && get_larger_sibling(m_p_nd) == 0)
611 m_p_nd = p_y;
612 p_y = p_y->m_p_parent;
615 if (p_y->m_type == head_node)
617 m_p_nd = p_y;
636 node_pointer p_y = m_p_nd->m_p_parent; local
637 while (p_y->m_type != head_node && get_smaller_sibling(m_p_nd) == 0)
639 m_p_nd = p_y;
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
rotate_fn_imps.hpp 48 node_pointer p_y = p_x->m_p_right; local
50 p_x->m_p_right = p_y->m_p_left;
52 if (p_y->m_p_left != 0)
53 p_y->m_p_left->m_p_parent = p_x;
55 p_y->m_p_parent = p_x->m_p_parent;
58 m_p_head->m_p_parent = p_y;
60 p_x->m_p_parent->m_p_left = p_y;
62 p_x->m_p_parent->m_p_right = p_y;
64 p_y->m_p_left = p_x;
65 p_x->m_p_parent = p_y;
79 node_pointer p_y = p_x->m_p_left; local
    [all...]
point_iterators.hpp 226 Node_Pointer p_y = m_p_nd->m_p_parent; local
227 while (m_p_nd == p_y->m_p_right)
229 m_p_nd = p_y;
230 p_y = p_y->m_p_parent;
233 if (m_p_nd->m_p_right != p_y)
234 m_p_nd = p_y;
252 Node_Pointer p_y = m_p_nd->m_p_left; local
253 while (p_y->m_p_right != 0)
254 p_y = p_y->m_p_right
259 Node_Pointer p_y = m_p_nd->m_p_parent; local
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
rotate_fn_imps.hpp 48 node_pointer p_y = p_x->m_p_right; local
49 p_x->m_p_right = p_y->m_p_left;
51 if (p_y->m_p_left != 0)
52 p_y->m_p_left->m_p_parent = p_x;
54 p_y->m_p_parent = p_x->m_p_parent;
56 m_p_head->m_p_parent = p_y;
58 p_x->m_p_parent->m_p_left = p_y;
60 p_x->m_p_parent->m_p_right = p_y;
62 p_y->m_p_left = p_x;
63 p_x->m_p_parent = p_y;
77 node_pointer p_y = p_x->m_p_left; local
    [all...]
pat_trie_base.hpp 608 node_pointer p_y = m_p_nd->m_p_parent; local
609 while (p_y->m_type != head_node && get_larger_sibling(m_p_nd) == 0)
611 m_p_nd = p_y;
612 p_y = p_y->m_p_parent;
615 if (p_y->m_type == head_node)
617 m_p_nd = p_y;
636 node_pointer p_y = m_p_nd->m_p_parent; local
637 while (p_y->m_type != head_node && get_smaller_sibling(m_p_nd) == 0)
639 m_p_nd = p_y;
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/
insert_fn_imps.hpp 95 fix(node_pointer p_y)
99 if (p_y->m_p_prev_or_parent == 0)
101 fix_root(p_y);
104 else if (p_y->m_metadata == 1&& p_y->m_p_next_sibling == 0)
106 if (p_y->m_p_l_child != 0)
108 fix_sibling_rank_1_unmarked(p_y);
112 fix_sibling_rank_1_marked(p_y);
113 p_y = p_y->m_p_prev_or_parent
258 node_pointer p_y = p_nd->m_p_prev_or_parent; local
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/
insert_fn_imps.hpp 95 fix(node_pointer p_y)
99 if (p_y->m_p_prev_or_parent == 0)
101 fix_root(p_y);
104 else if (p_y->m_metadata == 1&& p_y->m_p_next_sibling == 0)
106 if (p_y->m_p_l_child != 0)
108 fix_sibling_rank_1_unmarked(p_y);
112 fix_sibling_rank_1_marked(p_y);
113 p_y = p_y->m_p_prev_or_parent
258 node_pointer p_y = p_nd->m_p_prev_or_parent; local
    [all...]
  /src/games/hunt/huntd/
hunt.h 98 int p_x, p_y; member in struct:player_def
  /src/games/phantasia/
phantstruct.h 32 double p_y; /* y coord */ member in struct:player

Completed in 59 milliseconds