home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
PC World Komputer 1999 mARCH
/
PCWK3A99.iso
/
Linux
/
DDD331
/
DDD-3_1_.000
/
DDD-3_1_
/
ddd-3.1.1
/
ddd
/
ArgNode.h
< prev
next >
Wrap
C/C++ Source or Header
|
1998-11-23
|
3KB
|
103 lines
// $Id: ArgNode.h,v 1.9 1998/11/23 17:43:16 zeller Exp $
// ArgNode class
// Copyright (C) 1995 Technische Universitaet Braunschweig, Germany.
// Written by Andreas Zeller <zeller@ips.cs.tu-bs.de>.
//
// This file is part of DDD.
//
// DDD 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 2 of the License, or (at your option) any later version.
//
// DDD 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 DDD -- see the file COPYING.
// If not, write to the Free Software Foundation, Inc.,
// 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//
// DDD is the data display debugger.
// For details, see the DDD World-Wide-Web page,
// `http://www.cs.tu-bs.de/softech/ddd/',
// or send a mail to the DDD developers <ddd@ips.cs.tu-bs.de>.
#ifndef _DDD_ArgNode_h
#define _DDD_ArgNode_h
#ifdef __GNUG__
#pragma interface
#endif
// Upon run-time, an ArgNode evaluates an argument from the argument list
// ArgNodes may be used for pattern matching.
// If 'ArgNode::matchAll' is set, an ArgNode matches all other VSL nodes.
// If 'ArgNode::matchCallback' is set, matching calls a function with
// the matched node as argument.
#include "assert.h"
#include <iostream.h>
#include "strclass.h"
#include "VSLNode.h"
#include "DummyNode.h"
// ArgNode
typedef void (*ArgNodeFunc)(int, const VSLNode *);
class ArgNode: public DummyNode {
public:
DECLARE_TYPE_INFO
private:
unsigned _id; // #Argument in arglist: erstes 0, zweites 1...
protected:
ArgNode(const ArgNode& node):
DummyNode(node),
_id(node._id)
{}
bool matches(const VSLNode &node) const;
void dump(ostream& s) const;
void _dumpTree(ostream& s) const;
public:
// Constructor
ArgNode(unsigned i, char *type = "ArgNode"):
DummyNode(type), _id(i)
{}
// Copy
VSLNode *dup() const { return new ArgNode(*this); }
// Evaluate
const Box *_eval(ListBox *arglist) const;
int instantiateArgs(VSLDef *cdef, VSLNode **node, VSLNode *values[],
unsigned base, unsigned n);
void countArgNodes(VSLDef *cdef, int instances[],
unsigned base, unsigned n);
bool isConst() const { return false; }
bool isArgNode() const { return true; }
unsigned id() { return _id; }
unsigned nargs() const { return 1; }
static ArgNodeFunc matchCallback; // Call when matching
};
#endif