t_node.cpp

Go to the documentation of this file.

/*****************************************************************************\
*                                                                             *
*  Name   : t_node                                                            *
*  Author : Chris Koeritz                                                     *
*                                                                             *
*  Purpose:                                                                   *
*                                                                             *
*    Tests out the node base class.                                           *
*                                                                             *
*******************************************************************************
* Copyright (c) 1989-$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                               *
\*****************************************************************************/

//hmmm: make this a more aggressive and realistic test.  try implementing
//      some list algorithms or graph algorithms to push node around.

#include <basis/byte_array.h>
#include <basis/function.h>
#include <basis/guards.h>
#include <basis/istring.h>
#include <nodes/node.h>
#include <loggers/console_logger.h>
#include <data_struct/static_memory_gremlin.h>

HOOPLE_STARTUP_CODE;

using namespace nodes;

void log(const istring &to_print)
{ static console_logger _log; _log.log(to_print); }

void bogon(byte_array *fred)
{
  if (fred) log("eep");
  else log("eek");
}

int main(int formal(argc), char *formal(argv)[])
{
  SET_DEFAULT_CONSOLE_LOGGER;

  byte_array blank;
  basket<byte_array> fred(2, blank);
  basket<byte_array> george(2, blank);
  basket<byte_array> f_end1(0);
  basket<byte_array> f_end2(0);
  basket<byte_array> g_end1(0);
  basket<byte_array> g_end2(0);

  node root;

  // add some links to the linkless root.
  root.insert_link(0, &fred);
  root.insert_link(1, &george);

  // set the pre-existing links to our end points.
  fred.set_link(0, &f_end1);
  fred.set_link(1, &f_end2);
  george.set_link(0, &g_end1);
  george.set_link(1, &g_end2);

  guards::alert_message("node:: works for those functions tested.");
  return 0;
}

---