Home
last modified time | relevance | path

Searched refs:m_parent (Results 1 – 10 of 10) sorted by relevance

/OK3568_Linux_fs/app/forlinx/flapp/src/plugins/allwinner/browser/
H A Dxbel.cpp40 , m_parent(parent) in BookmarkNode()
49 if (m_parent) in ~BookmarkNode()
50 m_parent->remove(this); in ~BookmarkNode()
52 m_parent = 0; in ~BookmarkNode()
89 return m_parent; in parent()
95 if (child->m_parent) in add()
96 child->m_parent->remove(child); in add()
97 child->m_parent = this; in add()
105 child->m_parent = 0; in remove()
H A Dxbel.h68 BookmarkNode *m_parent;
H A Dbookmarks.cpp283 , m_parent(parent) in RemoveBookmarksCommand()
297 m_parent->add(m_node, m_row); in undo()
304 m_parent->remove(m_node); in redo()
305 emit m_bookmarkManagaer->entryRemoved(m_parent, m_row, m_node); in redo()
H A Dbookmarks.h107 BookmarkNode *m_parent; variable
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/index/detail/rtree/visitors/
H A Dremove.hpp56 , m_parent(0) in remove()
107 if ( 0 != m_parent ) in operator ()()
114 rtree::elements(*m_parent)[m_current_child_index].first in operator ()() local
170 if ( 0 != m_parent ) in operator ()()
172 rtree::elements(*m_parent)[m_current_child_index].first in operator ()() local
190 internal_node_pointer parent_bckup = m_parent; in traverse_apply_visitor()
194 m_parent = &n; in traverse_apply_visitor()
202 m_parent = parent_bckup; in traverse_apply_visitor()
332 internal_node_pointer m_parent; member in boost::geometry::index::detail::rtree::visitors::remove
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A Dfibonacci_heap.h58 fibonacci_node (): m_parent (NULL), m_child (NULL), m_left (this), in fibonacci_node()
64 fibonacci_node (K key, V *data = NULL): m_parent (NULL), m_child (NULL), in m_parent() function
115 fibonacci_node *m_parent; variable
301 if (m_parent != NULL && m_parent->m_child == this) in remove()
302 m_parent->m_child = ret; in remove()
307 m_parent = NULL; in remove()
324 m_parent = parent; in link()
424 y = node->m_parent; in replace_key_data()
568 node->m_parent = NULL; in cut()
580 while ((z = y->m_parent) != NULL) in cascading_cut()
[all …]
H A Dtree-switch-conversion.h463 case_tree_node *m_parent; variable
471 m_left (NULL), m_right (NULL), m_parent (NULL), m_c (NULL) in case_tree_node()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dfibonacci_heap.h58 fibonacci_node (): m_parent (NULL), m_child (NULL), m_left (this), in fibonacci_node()
64 fibonacci_node (K key, V *data = NULL): m_parent (NULL), m_child (NULL), in m_parent() function
115 fibonacci_node *m_parent; variable
301 if (m_parent != NULL && m_parent->m_child == this) in remove()
302 m_parent->m_child = ret; in remove()
307 m_parent = NULL; in remove()
324 m_parent = parent; in link()
424 y = node->m_parent; in replace_key_data()
568 node->m_parent = NULL; in cut()
580 while ((z = y->m_parent) != NULL) in cascading_cut()
[all …]
H A Dtree-switch-conversion.h463 case_tree_node *m_parent; variable
471 m_left (NULL), m_right (NULL), m_parent (NULL), m_c (NULL) in case_tree_node()
/OK3568_Linux_fs/buildroot/package/qt5/qt5wayland/
H A D0015-qwaylandwindow-Support-lower-and-raise.patch43 QWaylandWindow *parent() const { return m_parent; }