d/freebsd-skq
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

MFC r264836 (MFV r264830):

Browse Source 
4745 fix AVL code misspellings
This commit is contained in:
delphij 2014-05-09 07:17:29 +00:00
parent 7cb0f49ed2
commit 90e164441d
2 changed files with 8 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
sys/cddl/contrib/opensolaris/common/avl/avl.c
View File

@ -37,7 +37,7 @@
* insertion and deletion relatively efficiently. Searching the tree is
* still a fast operation, roughly O(log(N)).
*
* The key to insertion and deletion is a set of tree maniuplations called
* The key to insertion and deletion is a set of tree manipulations called
* rotations, which bring unbalanced subtrees back into the semi-balanced state.
*
* This implementation of AVL trees has the following peculiarities:
@ -45,7 +45,7 @@
* - The AVL specific data structures are physically embedded as fields
* in the "using" data structures. To maintain generality the code
* must constantly translate between "avl_node_t *" and containing
* data structure "void *"s by adding/subracting the avl_offset.
* data structure "void *"s by adding/subtracting the avl_offset.
*
* - Since the AVL data is always embedded in other structures, there is
* no locking or memory allocation in the AVL routines. This must be
@ -94,7 +94,7 @@
#include <sys/avl.h>
/*
* Small arrays to translate between balance (or diff) values and child indeces.
* Small arrays to translate between balance (or diff) values and child indices.
*
* Code that deals with binary tree data structures will randomly use
* left and right children when examining a tree. C "if()" statements
@ -114,7 +114,8 @@ static const int avl_balance2child[] = {0, 0, 1};
*
* - If there is a left child, go to it, then to it's rightmost descendant.
*
* - otherwise we return thru parent nodes until we've come from a right child.
* - otherwise we return through parent nodes until we've come from a right
* child.
*
* Return Value:
* NULL - if at the end of the nodes
@ -919,7 +920,7 @@ avl_is_empty(avl_tree_t *tree)
/*
* Post-order tree walk used to visit all tree nodes and destroy the tree
* in post order. This is used for destroying a tree w/o paying any cost
* in post order. This is used for destroying a tree without paying any cost
* for rebalancing it.
*
* example:

4
sys/cddl/contrib/opensolaris/uts/common/sys/avl.h
View File

@ -39,7 +39,7 @@ extern "C" {
#include <sys/avl_impl.h>
/*
* This is a generic implemenatation of AVL trees for use in the Solaris kernel.
* 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.
*
@ -175,7 +175,7 @@ extern void avl_insert(avl_tree_t *tree, void *node, avl_index_t where);
* 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
* 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