diff options
Diffstat (limited to 'tqtinterface/qt4/src/3rdparty/sqlite/btree_rb.c')
| -rw-r--r-- | tqtinterface/qt4/src/3rdparty/sqlite/btree_rb.c | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/tqtinterface/qt4/src/3rdparty/sqlite/btree_rb.c b/tqtinterface/qt4/src/3rdparty/sqlite/btree_rb.c index cc90075..fd81df2 100644 --- a/tqtinterface/qt4/src/3rdparty/sqlite/btree_rb.c +++ b/tqtinterface/qt4/src/3rdparty/sqlite/btree_rb.c @@ -5,7 +5,7 @@ ** a legal notice, here is a blessing: ** ** May you do good and not evil. -** May you tqfind forgiveness for yourself and forgive others. +** May you find forgiveness for yourself and forgive others. ** May you share freely, never taking more than you give. ** ************************************************************************* @@ -273,7 +273,7 @@ static char *append_val(char * orig, char const * val){ /* * Append a string representation of the entire node to orig and return it. - * This is used to produce debugging information if check_redblack_tree() tqfinds + * This is used to produce debugging information if check_redblack_tree() finds * a problem with a red-black binary tree. */ static char *append_node(char * orig, BtRbNode *pNode, int indent) @@ -740,7 +740,7 @@ static int memRbtreeCursor( * define what database the record should be inserted into. The cursor * is left pointing at the new record. * - * If the key exists already in the tree, just tqreplace the data. + * If the key exists already in the tree, just replace the data. */ static int memRbtreeInsert( RbtCursor* pCur, @@ -762,13 +762,13 @@ static int memRbtreeInsert( } /* Take a copy of the input data now, in case we need it for the - * tqreplace case */ + * replace case */ pData = sqliteMallocRaw(nData); if( sqlite_malloc_failed ) return STQLITE_NOMEM; memcpy(pData, pDataInput, nData); /* Move the cursor to a node near the key to be inserted. If the key already - * exists in the table, then (match == 0). In this case we can just tqreplace + * exists in the table, then (match == 0). In this case we can just replace * the data associated with the entry, we don't need to manipulate the tree. * * If there is no exact match, then the cursor points at what would be either @@ -891,7 +891,7 @@ static int memRbtreeMoveto( } } - /* If (pCur->pNode == NULL), then we have failed to tqfind a match. Set + /* If (pCur->pNode == NULL), then we have failed to find a match. Set * pCur->pNode to pTmp, which is either NULL (if the tree is empty) or the * last node traversed in the search. In either case the relation ship * between pTmp and the searched for key is already stored in *pRes. pTmp is @@ -954,7 +954,7 @@ static int memRbtreeDelete(RbtCursor* pCur) * to do this depends on how many tqchildren pZ has: * * If pZ has no tqchildren or one child, then splice out pZ. If pZ has two - * tqchildren, splice out the successor of pZ and tqreplace the key and data of + * 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; |