001/**
002 * Copyright (C) 2007 - 2016, Jens Lehmann
003 *
004 * This file is part of DL-Learner.
005 *
006 * DL-Learner is free software; you can redistribute it and/or modify
007 * it under the terms of the GNU General Public License as published by
008 * the Free Software Foundation; either version 3 of the License, or
009 * (at your option) any later version.
010 *
011 * DL-Learner is distributed in the hope that it will be useful,
012 * but WITHOUT ANY WARRANTY; without even the implied warranty of
013 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
014 * GNU General Public License for more details.
015 *
016 * You should have received a copy of the GNU General Public License
017 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
018 */
019package org.dllearner.algorithms.qtl.datastructures.impl;
020
021import java.util.ArrayList;
022import java.util.List;
023
024import org.dllearner.algorithms.qtl.datastructures.QueryTree;
025import org.dllearner.algorithms.qtl.datastructures.impl.QueryTreeChange.ChangeType;
026
027public class GeneralisedQueryTree<N> {
028        
029        private QueryTree<N> tree;
030        private List<QueryTreeChange> changes;
031        
032        public GeneralisedQueryTree(QueryTree<N> tree){
033                this.tree = tree;
034                changes = new ArrayList<>();
035        }
036        
037        public GeneralisedQueryTree(QueryTree<N> tree, List<QueryTreeChange> changes){
038                this.tree = tree;
039                this.changes = changes;
040        }
041        
042        public void setQueryTree(QueryTree<N> tree){
043                this.tree = tree;
044        }
045        
046        public QueryTree<N> getQueryTree(){
047                return tree;
048        }
049        
050        public void addChange(QueryTreeChange change){
051                changes.add(change);
052        }
053        
054        public void addChanges(List<QueryTreeChange> changes){
055                this.changes.addAll(changes);
056        }
057        
058        public List<QueryTreeChange> getChanges(){
059                return changes;
060        }
061        
062        public QueryTreeChange getLastChange(){
063                if(changes.isEmpty()){
064                        return new QueryTreeChange(0, ChangeType.REPLACE_LABEL);
065                }
066                return changes.get(changes.size()-1);
067        }
068
069}