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.core.ref;
020
021import java.util.Comparator;
022import java.util.SortedSet;
023import java.util.TreeSet;
024
025/**
026 * @author Lorenz Buehmann
027 *
028 */
029public class SearchTree<S, T extends SearchTreeNode<S>> {
030        
031        private SortedSet<T> tree;
032        
033        public SearchTree(Comparator<T> comparator) {
034                tree = new TreeSet<>(comparator);
035        }
036        
037        public boolean addNode(T node) {
038                return tree.add(node);
039        }
040        
041        public boolean removeNode(T node) {
042                return tree.remove(node);
043        }
044        
045        public SortedSet<T> getNodes() {
046                return tree;
047        }
048
049}