/home/archives/aegis/branch.4/branch.25/delta28933.505/aefind/tree/arithmetic.h

Go to the documentation of this file.

//
//      aegis - project change supervisor
//      Copyright (C) 1997, 2002, 2005-2008, 2012 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
//      <http://www.gnu.org/licenses/>.
//

#ifndef AEFIND_TREE_ARITHMETIC_H
#define AEFIND_TREE_ARITHMETIC_H

#include <aefind/tree/diadic.h>
#include <aefind/tree/monadic.h>

class tree_list; // forward

class tree_divide:
    public tree_diadic
{
public:
    virtual ~tree_divide();

private:
    tree_divide(const pointer &left, const pointer &right);

public:
    static pointer create(const pointer &left, const pointer &right);

    static pointer create_l(const tree_list &args);

protected:
    // See base class for documentation.
    const char *name() const;

    // See base class for documentation.
    rpt_value::pointer evaluate(string_ty *, string_ty *, string_ty *,
        struct stat *) const;

    // See base class for documentation.
    tree::pointer optimize() const;

private:
    tree_divide();

    tree_divide(const tree_divide &);

    tree_divide &operator=(const tree_divide &);
};


class tree_join:
    public tree_diadic
{
public:
    virtual ~tree_join();

private:
    tree_join(const pointer &left, const pointer &right);

public:
    static pointer create(const pointer &left, const pointer &right);

    static pointer create_l(const tree_list &args);

protected:
    // See base class for documentation.
    const char *name() const;

    // See base class for documentation.
    rpt_value::pointer evaluate(string_ty *, string_ty *, string_ty *,
        struct stat *) const;

    // See base class for documentation.
    tree::pointer optimize() const;

private:
    tree_join();

    tree_join(const tree_join &);

    tree_join &operator=(const tree_join &);
};


class tree_subtract:
    public tree_diadic
{
public:
    virtual ~tree_subtract();

private:
    tree_subtract(const pointer &left, const pointer &right);

public:
    static pointer create(const pointer &left, const pointer &right);

    static pointer create_l(const tree_list &args);

protected:
    // See base class for documentation.
    const char *name() const;

    // See base class for documentation.
    rpt_value::pointer evaluate(string_ty *, string_ty *, string_ty *,
        struct stat *) const;

    // See base class for documentation.
    tree::pointer optimize() const;

private:
    tree_subtract();

    tree_subtract(const tree_subtract &);

    tree_subtract &operator=(const tree_subtract &);
};


class tree_mod:
    public tree_diadic
{
public:
    virtual ~tree_mod();

private:
    tree_mod(const pointer &left, const pointer &right);

public:
    static pointer create(const pointer &left, const pointer &right);

    static pointer create_l(const tree_list &args);

protected:
    // See base class for documentation.
    const char *name() const;

    // See base class for documentation.
    rpt_value::pointer evaluate(string_ty *, string_ty *, string_ty *,
        struct stat *) const;

    // See base class for documentation.
    tree::pointer optimize() const;

private:
    tree_mod();

    tree_mod(const tree_mod &);

    tree_mod &operator=(const tree_mod &);
};


class tree_mul:
    public tree_diadic
{
public:
    virtual ~tree_mul();

private:
    tree_mul(const pointer &left, const pointer &right);

public:
    static pointer create(const pointer &left, const pointer &right);

    static pointer create_l(const tree_list &args);

protected:
    // See base class for documentation.
    const char *name() const;

    // See base class for documentation.
    rpt_value::pointer evaluate(string_ty *, string_ty *, string_ty *,
        struct stat *) const;

    // See base class for documentation.
    tree::pointer optimize() const;

private:
    tree_mul();

    tree_mul(const tree_mul &);

    tree_mul &operator=(const tree_mul &);
};


class tree_neg:
    public tree_monadic
{
public:
    virtual ~tree_neg();

private:
    tree_neg(const pointer &arg);

public:
    static pointer create(const pointer &arg);

    static pointer create_l(const tree_list &args);

protected:
    // See base class for documentation.
    const char *name() const;

    // See base class for documentation.
    rpt_value::pointer evaluate(string_ty *, string_ty *, string_ty *,
        struct stat *) const;

    // See base class for documentation.
    tree::pointer optimize() const;

private:
    tree_neg();

    tree_neg(const tree_neg &);

    tree_neg &operator=(const tree_neg &);
};


class tree_plus:
    public tree_diadic
{
public:
    virtual ~tree_plus();

private:
    tree_plus(const pointer &left, const pointer &right);

public:
    static pointer create(const pointer &left, const pointer &right);

    static pointer create_l(const tree_list &args);

protected:
    // See base class for documentation.
    const char *name() const;

    // See base class for documentation.
    rpt_value::pointer evaluate(string_ty *, string_ty *, string_ty *,
        struct stat *) const;

    // See base class for documentation.
    tree::pointer optimize() const;

private:
    tree_plus();

    tree_plus(const tree_plus &);

    tree_plus &operator=(const tree_plus &);
};

class tree_pos:
    public tree_monadic
{
public:
    virtual ~tree_pos();

private:
    tree_pos(const pointer &arg);

public:
    static pointer create(const pointer &arg);

    static pointer create_l(const tree_list &args);

protected:
    // See base class for documentation.
    const char *name() const;

    // See base class for documentation.
    rpt_value::pointer evaluate(string_ty *, string_ty *, string_ty *,
        struct stat *) const;

    // See base class for documentation.
    tree::pointer optimize() const;

private:
    tree_pos();

    tree_pos(const tree_pos &);

    tree_pos &operator=(const tree_pos &);
};

#endif // AEFIND_TREE_ARITHMETIC_H
// vim: set ts=8 sw=4 et :