Home
last modified time | relevance | path

Searched refs:has_parent (Results 1 – 8 of 8) sorted by relevance

/third_party/boost/boost/graph/
Dboykov_kolmogorov_max_flow.hpp271 && (has_parent(current_node) || current_node == m_source in grow()
574 if (has_parent(other_node) in adopt()
639 if (has_parent(other_node) in adopt()
670 if (!has_parent(v) && v != m_source && v != m_sink) in get_next_active_node()
724 BOOST_ASSERT(!has_parent(v)); in remove_active_node()
756 inline bool has_parent(vertex_descriptor v) const in has_parent() function in boost::detail::bk_max_flow
804 if (has_parent(current_vertex)) in has_sink_connect()
852 if (has_parent(current_vertex)) in has_source_connect()
/third_party/boost/boost/pending/
Dmutable_heap.hpp39 while (x.has_parent() && comp(x, x.parent())) in up_heap()
/third_party/cef/libcef/browser/native/
Dnative_menu_win.cc424 : has_parent(false), has_submenu(false), menu(nullptr), position(-1) {} in HighlightedMenuItemInfo()
426 bool has_parent; member
582 info->has_parent = true; in GetHighlightedMenuItemInfo()
625 if (msg->wParam == VK_LEFT && !info.has_parent) { in MenuMessageHook()
628 } else if (msg->wParam == VK_RIGHT && !info.has_parent && in MenuMessageHook()
/third_party/boost/libs/graph/test/
Dboykov_kolmogorov_max_flow_test.cpp275 && (tSuper::has_parent(v) || it != tSuper::m_orphans.end())); in invariant_four()
317 BOOST_TEST(tSuper::has_parent(current_node)); in invariant_six()
339 while (tSuper::has_parent(current_node)) in invariant_seven()
360 while (tSuper::has_parent(current_node)) in invariant_eight()
/third_party/boost/boost/graph/detail/
Darray_binary_tree.hpp179 inline bool has_parent() const { return i != 0; } in has_parent() function in boost::array_binary_tree_node
/third_party/cef/tools/
Dmake_cpptoc_impl.py539 if cur_cls.has_parent(cur_clsname):
Dmake_ctocpp_impl.py547 if cur_cls.has_parent(clsname):
Dcef_parser.py934 def has_parent(self, parent_name): member in obj_class