1 /* 2 Copyright (c) 2002-2012 René Ladan. All rights reserved. 3 4 Redistribution and use in source and binary forms, with or without 5 modification, are permitted provided that the following conditions 6 are met: 7 1. Redistributions of source code must retain the above copyright 8 notice, this list of conditions and the following disclaimer. 9 2. Redistributions in binary form must reproduce the above copyright 10 notice, this list of conditions and the following disclaimer in the 11 documentation and/or other materials provided with the distribution. 12 13 THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 14 ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 15 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 16 ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 17 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 18 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 19 OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 20 HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 21 LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 22 OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 23 SUCH DAMAGE. 24 */ 25 26 #ifndef BF2C_TREE_H 27 #define BF2C_TREE_H 1 28 29 #include "token.h" 30 31 class Tree { 32 public: 33 Tree(Token *token); 34 ~Tree(); 35 36 Token *getToken(); 37 Tree *prev(); 38 Tree *next(); 39 Tree *child(); 40 Tree *parent(); 41 42 bool hasPrev(); 43 bool hasNext(); 44 bool hasChild(); 45 bool hasParent(); /* false for upper row */ 46 47 void setToken(Token *token); 48 void prepend(Token *token); 49 void append(Token *token); 50 void insertChild(Token *token); 51 void delList(Tree *t); 52 void removeChild(); 53 private: 54 Token *mytoken; 55 Tree *myprev; 56 Tree *mynext; 57 Tree *myparent; 58 Tree *mychild; 59 60 } ; 61 #endif 62