/*
-* Name : test_tree *
-* Author : Chris Koeritz *
-* Purpose: *
-* Tests out the tree class. *
+* Name : test_tree
+* Author : Chris Koeritz
+* Purpose: Tests out the tree class.
**
-* Copyright (c) 1993-$now By Author. This program is free software; you can *
-* redistribute it and/or modify it under the terms of the GNU General Public *
-* License as published by the Free Software Foundation; either version 2 of *
-* the License or (at your option) any later version. This is online at: *
-* http://www.fsf.org/copyleft/gpl.html *
-* Please send any updates to: fred@gruntose.com *
+* Copyright (c) 1993-$now By Author. This program is free software; you can
+* redistribute it and/or modify it under the terms of the GNU General Public
+* License as published by the Free Software Foundation; either version 2 of
+* the License or (at your option) any later version. This is online at:
+* http://www.fsf.org/copyleft/gpl.html
+* Please send any updates to: fred@gruntose.com
*/
#include <application/hoople_main.h>
class bogotre : public packable, public tree
{
public:
- bogotre(const char *start = NIL) : who_cares(42), i_sure_dont('l'),
+ bogotre(const char *start = NULL_POINTER) : who_cares(42), i_sure_dont('l'),
another_useless_int(23) {
astring to_init(start);
if (to_init.length() < 1) to_init += "ack";
void test_tree::apply(larch *apply_to, applier *to_apply,
tree::traversal_directions order)
{
- larch *curr = NIL;
+ larch *curr = NULL_POINTER;
for (traveller skippy = apply_to->start(order);
next(curr, apply_to, skippy); ) to_apply(curr);
}