Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
Comment: | Suppress the warning message about print_node() being unused in btree_rb.c. Ticket #347. (CVS 1017) |
---|---|
Downloads: | Tarball | ZIP archive |
Timelines: | family | ancestors | descendants | both | trunk |
Files: | files | file ages | folders |
SHA1: |
b52f07e1c894a52bb12459d03fd0efce |
User & Date: | drh 2003-06-10 02:46:15.000 |
Context
2003-06-12
| ||
08:59 | Added missing error string to sqlite_error_string(). (CVS 1018) (check-in: 3afb7b3586 user: jplyon tags: trunk) | |
2003-06-10
| ||
02:46 | Suppress the warning message about print_node() being unused in btree_rb.c. Ticket #347. (CVS 1017) (check-in: b52f07e1c8 user: drh tags: trunk) | |
2003-06-09
| ||
11:53 | Remove redundant "return" statement from btree_rb.c. (CVS 1016) (check-in: 373d077173 user: drh tags: trunk) | |
Changes
Changes to src/btree_rb.c.
1 2 3 4 5 6 7 8 9 10 11 | /* ** 2003 Feb 4 ** ** The author disclaims copyright to this source code. In place of ** a legal notice, here is a blessing: ** ** May you do good and not evil. ** May you find forgiveness for yourself and forgive others. ** May you share freely, never taking more than you give. ** ************************************************************************* | | | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 | /* ** 2003 Feb 4 ** ** The author disclaims copyright to this source code. In place of ** a legal notice, here is a blessing: ** ** May you do good and not evil. ** May you find forgiveness for yourself and forgive others. ** May you share freely, never taking more than you give. ** ************************************************************************* ** $Id: btree_rb.c,v 1.13 2003/06/10 02:46:15 drh Exp $ ** ** This file implements an in-core database using Red-Black balanced ** binary trees. ** ** It was contributed to SQLite by anonymous on 2003-Feb-04 23:24:49 UTC. */ #include "btree.h" |
︙ | ︙ | |||
272 273 274 275 276 277 278 | orig = append_val(orig, "\n"); } return orig; } /* * Print a representation of a node to stdout. This function is only included | | > > > > | 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 | orig = append_val(orig, "\n"); } return orig; } /* * Print a representation of a node to stdout. This function is only included * so you can call it from within a debugger if things get really bad. It * is not called from anyplace in the code. */ static void print_node(BtRbNode *pNode) { char * str = append_node(0, pNode, 0); printf(str); /* Suppress a warning message about print_node() being unused */ (void)print_node; } /* * Check the following properties of the red-black tree: * (1) - If a node is red, both of it's children are black * (2) - Each path from a given node to a leaf (NULL) node passes thru the * same number of black nodes |
︙ | ︙ |