Home
last modified time | relevance | path

Searched refs:end_node (Results 1 – 5 of 5) sorted by relevance

/OK3568_Linux_fs/app/forlinx/flapp/src/keyboard/pinyin/share/
H A Dmatrixsearch.cpp917 MatrixNode *end_node = matrix_[step_end].mtrx_nd_fixed; in cancel_last_choice() local
918 assert(NULL != end_node); in cancel_last_choice()
920 step_start = end_node->from->step; in cancel_last_choice()
923 DictMatchInfo *dmi = dmi_pool_ + end_node->dmi_fr; in cancel_last_choice()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/share/gcc-10.3.1/python/libstdcxx/v6/
H A Dxmethods.py357 end_node = obj['_M_impl']['_M_node'].address
359 while begin_node != end_node:
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/share/gcc-10.3.1/python/libstdcxx/v6/
H A Dxmethods.py357 end_node = obj['_M_impl']['_M_node'].address
359 while begin_node != end_node:
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/
H A D__tree59 __root->__parent_ will be referred to below (in comments only) as end_node.
60 end_node->__left_ is an externably accessible lvalue for __root, and can be
61 changed by node insertion and removal (without explicit reference to end_node).
63 All nodes (with the exception of end_node), even the node referred to as
268 // Postcondition: __tree_invariant(end_node->__left_) == true. end_node->__left_
337 // Postcondition: __tree_invariant(end_node->__left_) == true && end_node->__left_
338 // nor any of its children refer to __z. end_node->__left_
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/
H A D__tree59 __root->__parent_ will be referred to below (in comments only) as end_node.
60 end_node->__left_ is an externably accessible lvalue for __root, and can be
61 changed by node insertion and removal (without explicit reference to end_node).
63 All nodes (with the exception of end_node), even the node referred to as
268 // Postcondition: __tree_invariant(end_node->__left_) == true. end_node->__left_
337 // Postcondition: __tree_invariant(end_node->__left_) == true && end_node->__left_
338 // nor any of its children refer to __z. end_node->__left_