Print this page
4745 fix AVL code misspellings

*** 37,47 **** #include <sys/types.h> #include <sys/avl_impl.h> /* ! * This is a generic implemenatation of AVL trees for use in the Solaris kernel. * The interfaces provide an efficient way of implementing an ordered set of * data structures. * * AVL trees provide an alternative to using an ordered linked list. Using AVL * trees will usually be faster, however they requires more storage. An ordered --- 37,47 ---- #include <sys/types.h> #include <sys/avl_impl.h> /* ! * This is a generic implementation of AVL trees for use in the Solaris kernel. * The interfaces provide an efficient way of implementing an ordered set of * data structures. * * AVL trees provide an alternative to using an ordered linked list. Using AVL * trees will usually be faster, however they requires more storage. An ordered
*** 173,183 **** /* * Insert "new_data" in "tree" in the given "direction" either after * or before the data "here". * ! * This might be usefull for avl clients caching recently accessed * data to avoid doing avl_find() again for insertion. * * new_data - new data to insert * here - existing node in "tree" * direction - either AVL_AFTER or AVL_BEFORE the data "here". --- 173,183 ---- /* * Insert "new_data" in "tree" in the given "direction" either after * or before the data "here". * ! * This might be useful for avl clients caching recently accessed * data to avoid doing avl_find() again for insertion. * * new_data - new data to insert * here - existing node in "tree" * direction - either AVL_AFTER or AVL_BEFORE the data "here".