001    /**
002     * Copyright (C) 2007-2011, 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     */
019    
020    package org.dllearner.utilities.datastructures;
021    
022    import java.util.SortedSet;
023    import java.util.TreeSet;
024    
025    import org.dllearner.utilities.Helper;
026    
027    /**
028     * 
029     * Convenience data structure for keeping positive and negative examples in a single structure.
030     * 
031     * @author Jens Lehmann
032     *
033     * @param <T> The datatype (usually Individual or String).
034     */
035    public class SortedSetTuple<T> {
036    
037            private SortedSet<T> posSet;
038            private SortedSet<T> negSet;
039            
040            public SortedSetTuple() {
041                    posSet = new TreeSet<T>();
042                    negSet = new TreeSet<T>();
043            }
044            
045            public SortedSetTuple(SortedSet<T> posSet, SortedSet<T> negSet) {
046                    this.posSet = posSet;
047                    this.negSet = negSet;
048            }
049    
050            public SortedSet<T> getPosSet() {
051                    return posSet;
052            }
053    
054            public SortedSet<T> getNegSet() {
055                    return negSet;
056            }
057            
058            public SortedSet<T> getCompleteSet() {
059                    return Helper.union(posSet, negSet);
060            }
061            
062    }