//
// aegis - project change supervisor
// Copyright (C) 1997, 2002-2008 Peter Miller
//
// 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 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see
// .
//
#include
#include
#include
#include
#include
#include
#include
#include
tree_print::~tree_print()
{
}
tree_print::tree_print(const tree::pointer &a_arg) :
tree_monadic(a_arg)
{
}
tree::pointer
tree_print::create(const tree::pointer &a_arg)
{
return pointer(new tree_print(a_arg));
}
tree::pointer
tree_print::create_l(const tree_list &args)
{
function_needs_one("print", args);
return create(args[0]);
}
rpt_value::pointer
tree_print::evaluate(string_ty *path1, string_ty *path2, string_ty *path3,
struct stat *st) const
{
rpt_value::pointer vp = get_arg()->evaluate(path1, path2, path3, st);
rpt_value::pointer svp = rpt_value::stringize(vp);
rpt_value_string *ss = dynamic_cast(svp.get());
if (!ss)
{
// FIXME: shouldn't this be an error?
return rpt_value_boolean::create(true);
}
printf("%s\n", ss->query().c_str());
return rpt_value_boolean::create(true);
}
tree::pointer
tree_print::optimize()
const
{
return create(get_arg()->optimize());
}
bool
tree_print::useful()
const
{
return true;
}
bool
tree_print::constant()
const
{
return false;
}
const char *
tree_print::name()
const
{
return "print";
}