• Home
  • Raw
  • Download

Lines Matching refs:__child

978                           __node_base_pointer& __child,
1708 __node_base_pointer& __child,
1714 __child = __new_node;
1717 __tree_balance_after_insert(__end_node()->__left_, __child);
1743 __node_base_pointer& __child = __find_equal(__parent, __h->__value_);
1744 __node_pointer __r = static_cast<__node_pointer>(__child);
1746 if (__child == nullptr)
1748 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1762 __node_base_pointer& __child = __find_equal(__p, __parent, __h->__value_);
1763 __node_pointer __r = static_cast<__node_pointer>(__child);
1764 if (__child == nullptr)
1766 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1779 __node_base_pointer& __child = __find_leaf_high(__parent, __h->__value_);
1780 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1792 __node_base_pointer& __child = __find_leaf(__p, __parent, __h->__value_);
1793 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1830 __node_base_pointer& __child = __find_leaf_high(__parent, __h->__value_);
1831 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1842 __node_base_pointer& __child = __find_leaf(__p, __parent, __h->__value_);
1843 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1867 __node_base_pointer& __child = __find_equal(__parent, __v);
1868 __node_pointer __r = static_cast<__node_pointer>(__child);
1870 if (__child == nullptr)
1873 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1885 __node_base_pointer& __child = __find_equal(__p, __parent, __v);
1886 __node_pointer __r = static_cast<__node_pointer>(__child);
1887 if (__child == nullptr)
1890 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1901 __node_base_pointer& __child = __find_leaf_high(__parent, __v);
1903 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1912 __node_base_pointer& __child = __find_leaf(__p, __parent, __v);
1914 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1923 __node_base_pointer& __child = __find_equal(__parent, __nd->__value_);
1924 __node_pointer __r = static_cast<__node_pointer>(__child);
1926 if (__child == nullptr)
1928 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
1941 __node_base_pointer& __child = __find_equal(__p, __parent, __nd->__value_);
1942 __node_pointer __r = static_cast<__node_pointer>(__child);
1943 if (__child == nullptr)
1945 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
1956 __node_base_pointer& __child = __find_leaf_high(__parent, __nd->__value_);
1957 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
1967 __node_base_pointer& __child = __find_leaf(__p, __parent, __nd->__value_);
1968 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));