|
Aegis
4.25.D505
|
00001 // 00002 // aegis - project change supervisor 00003 // Copyright (C) 1997, 2002, 2005-2008 Peter Miller 00004 // 00005 // This program is free software; you can redistribute it and/or modify 00006 // it under the terms of the GNU General Public License as published by 00007 // the Free Software Foundation; either version 3 of the License, or 00008 // (at your option) any later version. 00009 // 00010 // This program is distributed in the hope that it will be useful, 00011 // but WITHOUT ANY WARRANTY; without even the implied warranty of 00012 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00013 // GNU General Public License for more details. 00014 // 00015 // You should have received a copy of the GNU General Public License 00016 // along with this program. If not, see 00017 // <http://www.gnu.org/licenses/>. 00018 // 00019 00020 #ifndef AEFIND_TREE_MATCH_H 00021 #define AEFIND_TREE_MATCH_H 00022 00023 #include <aefind/tree/diadic.h> 00024 00030 class tree_match: 00031 public tree_diadic 00032 { 00033 public: 00037 virtual ~tree_match(); 00038 00039 private: 00044 tree_match(const tree::pointer &lhs, const tree::pointer &rhs); 00045 00046 public: 00051 static pointer create(const tree::pointer &lhs, const tree::pointer &rhs); 00052 00053 protected: 00054 // See base class for documentation. 00055 const char *name() const; 00056 00057 // See base class for documentation. 00058 rpt_value::pointer evaluate(string_ty *, string_ty *, string_ty *, 00059 struct stat *) const; 00060 00061 // See base class for documentation. 00062 tree::pointer optimize() const; 00063 00064 private: 00068 tree_match(); 00069 00073 tree_match(const tree_match &); 00074 00078 tree_match &operator=(const tree_match &); 00079 }; 00080 00081 00082 #endif // AEFIND_TREE_MATCH_H
1.7.6.1