/home/archives/aegis/branch.4/branch.25/delta28933.505/aefind/tree/bitwise.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_BITWISE_H
#define AEFIND_TREE_BITWISE_H

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

class tree_list; // forward

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

private:
    tree_bitwise_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_bitwise_and();

    tree_bitwise_and(const tree_bitwise_and &);

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


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

private:
    tree_bitwise_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_bitwise_or();

    tree_bitwise_or(const tree_bitwise_or &);

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


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

private:
    tree_bitwise_xor(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_bitwise_xor();

    tree_bitwise_xor(const tree_bitwise_xor &);

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


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

private:
    tree_bitwise_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_bitwise_not();

    tree_bitwise_not(const tree_bitwise_not &);

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


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

private:
    tree_shift_left(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_shift_left();

    tree_shift_left(const tree_shift_left &);

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


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

private:
    tree_shift_right(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_shift_right();

    tree_shift_right(const tree_shift_right &);

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

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