/home/archives/aegis/branch.4/branch.25/delta28933.505/aefind/tree/logical.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_LOGICAL_H
#define AEFIND_TREE_LOGICAL_H

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

class tree_list; // forward

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

private:
    tree_and(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_and();

    tree_and(const tree_and &);

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


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

private:
    tree_or(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_or();

    tree_or(const tree_or &);

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


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

private:
    tree_not(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_not();

    tree_not(const tree_not &);

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


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

private:
    tree_comma(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_comma();

    tree_comma(const tree_comma &);

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


class tree_triadic:
    public tree
{
public:
    virtual ~tree_triadic();

private:
    tree_triadic(const pointer &a1, const pointer &a2, const pointer &a3);

public:
    static pointer create(const pointer &a1, const pointer &a2,
        const pointer &a3);

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;

    // See base class for documentation.
    void print() const;

    // See base class for documentation.
    bool useful() const;

    // See base class for documentation.
    bool constant() const;

private:
    tree::pointer a1;
    tree::pointer a2;
    tree::pointer a3;

    tree_triadic();

    tree_triadic(const tree_triadic &);

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

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