diff options
Diffstat (limited to 'cpukit/score/include/rtems/score/rbtree.h')
-rw-r--r-- | cpukit/score/include/rtems/score/rbtree.h | 20 |
1 files changed, 0 insertions, 20 deletions
diff --git a/cpukit/score/include/rtems/score/rbtree.h b/cpukit/score/include/rtems/score/rbtree.h index 2e9bb83ad7..b3cfc45fa3 100644 --- a/cpukit/score/include/rtems/score/rbtree.h +++ b/cpukit/score/include/rtems/score/rbtree.h @@ -220,23 +220,6 @@ RBTree_Node *_RBTree_Get( ); /** - * @brief Check the min or max node on a rbtree - * - * This function returns a pointer to the min or max node of @a the_rbtree. - * If @a the_rbtree is empty, then NULL is returned. @a dir specifies - * whether to return the min (0) or max (1). - * - * @return This method returns a pointer to a node. - * If @a the_rbtree was empty, then NULL is returned. - * - * @note It disables interrupts to ensure the atomicity of the get operation. - */ -RBTree_Node *_RBTree_Peek( - const RBTree_Control *the_rbtree, - RBTree_Direction dir -); - -/** * @brief Find the node with given key in the tree * * This function returns a pointer to the node with key equal to a key @@ -324,7 +307,6 @@ void _RBTree_Extract( /** * @brief Returns the in-order next node of a node. * - * @param[in] rbtree The red-black tree. * @param[in] node The node. * @param[in] dir The direction. * @@ -332,7 +314,6 @@ void _RBTree_Extract( * @retval otherwise The next node. */ RBTree_Node *_RBTree_Next_unprotected( - const RBTree_Control *rbtree, const RBTree_Node *node, RBTree_Direction dir ); @@ -343,7 +324,6 @@ RBTree_Node *_RBTree_Next_unprotected( * The function disables the interrupts protect the operation. */ RBTree_Node *_RBTree_Next( - const RBTree_Control *rbtree, const RBTree_Node *node, RBTree_Direction dir ); |