HTB_NEXT_RB_NODE

Section: (9)
Updated: 09 October 2005
Index Return to Main Contents

 

NAME

htb_next_rb_node - finds next node in binary tree  

SYNOPSIS

"SYNOPSIS"

void htb_next_rb_node (struct rb_node ** n);  

ARGUMENTS

n
-- undescribed --
 

DESCRIPTION

When we are past last key we return NULL. Average complexity is 2 steps per call.


 

Index

NAME
SYNOPSIS
ARGUMENTS
DESCRIPTION

This document was created by man2html, using the manual pages.
Time: 00:02:12 GMT, October 09, 2005