Main Page | Class Hierarchy | Class List | File List | Class Members

/home/nutarojj/Desktop/adevs/include/adevs_set.h

00001 /***************
00002 Copyright (C) 2000-2006 by James Nutaro
00003 
00004 This library is free software; you can redistribute it and/or
00005 modify it under the terms of the GNU Lesser General Public
00006 License as published by the Free Software Foundation; either
00007 version 2 of the License, or (at your option) any later version.
00008 
00009 This library is distributed in the hope that it will be useful,
00010 but WITHOUT ANY WARRANTY; without even the implied warranty of
00011 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
00012 Lesser General Public License for more details.
00013 
00014 You should have received a copy of the GNU Lesser General Public
00015 License along with this library; if not, write to the Free Software
00016 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
00017 
00018 Bugs, comments, and questions can be sent to nutaro@gmail.com
00019 ***************/
00020 #ifndef _adevs_set_h
00021 #define _adevs_set_h
00022 #include <set>
00023 #include <algorithm>
00024 
00025 namespace adevs
00026 {
00027 
00032 template <class T> class Set: public std::set<T>
00033 {
00034 };
00035 
00037 template <class T> 
00038 Set<T> set_intersect(const Set<T>& A, const Set<T>& B)
00039 {
00040         Set<T> result;
00041         std::insert_iterator<Set<T> > i_iter(result,result.begin());
00042         std::set_intersection(A.begin(),A.end(),B.begin(),B.end(),i_iter);
00043         return result;
00044 }
00046 template <class T> 
00047 Set<T> set_difference(const Set<T>& A, const Set<T>& B)
00048 {
00049         Set<T> result;
00050         std::insert_iterator<Set<T> > i_iter(result,result.begin());
00051         std::set_difference(A.begin(),A.end(),B.begin(),B.end(),i_iter);
00052         return result;
00053 }
00055 template <class T> 
00056 void set_assign_union(Set<T>& A, const Set<T>& B)
00057 {
00058         typename Set<T>::const_iterator iter = B.begin();
00059         for (; iter != B.end(); iter++)
00060         {
00061                 A.insert(*iter);
00062         }
00063 }
00064 
00065 }
00066 
00067 #endif

Generated on Mon Jun 1 09:53:42 2009 for adevs by  doxygen 1.3.9.1