diff options
Diffstat (limited to 'kexi/3rdparty/kexisql/src/btree_rb.c')
| -rw-r--r-- | kexi/3rdparty/kexisql/src/btree_rb.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/kexi/3rdparty/kexisql/src/btree_rb.c b/kexi/3rdparty/kexisql/src/btree_rb.c index 3954fe6d..86feaa5b 100644 --- a/kexi/3rdparty/kexisql/src/btree_rb.c +++ b/kexi/3rdparty/kexisql/src/btree_rb.c @@ -319,7 +319,7 @@ static void print_node(BtRbNode *pNode) /* * Check the following properties of the red-black tree: - * (1) - If a node is red, both of it's children are black + * (1) - If a node is red, both of it's tqchildren are black * (2) - Each path from a given node to a leaf (NULL) node passes thru the * same number of black nodes * @@ -951,10 +951,10 @@ static int memRbtreeDelete(RbtCursor* pCur) } /* First do a standard binary-tree delete (node pZ is to be deleted). How - * to do this depends on how many children pZ has: + * to do this depends on how many tqchildren pZ has: * - * If pZ has no children or one child, then splice out pZ. If pZ has two - * children, splice out the successor of pZ and replace the key and data of + * If pZ has no tqchildren or one child, then splice out pZ. If pZ has two + * tqchildren, splice out the successor of pZ and replace the key and data of * pZ with the key and data of the spliced out successor. */ if( pZ->pLeft && pZ->pRight ){ BtRbNode *pTmp; @@ -1008,7 +1008,7 @@ static int memRbtreeDelete(RbtCursor* pCur) } /* pZ now points at the spliced out node. pChild is the only child of pZ, or - * NULL if pZ has no children. If pZ is black, and not the tree root, then we + * NULL if pZ has no tqchildren. If pZ is black, and not the tree root, then we * will have violated the "same number of black nodes in every path to a * leaf" property of the red-black tree. The code in do_delete_balancing() * repairs this. */ |