예제 #1
0
 types::none_type intersection_update(types::set<T> &set,
                                      Types const &... others)
 {
   set.intersection_update(others...);
   return {};
 }
예제 #2
0
 types::set<T> union_(types::set<T> const& set, Types const&... others){
     return set.union_(others...);
 }
예제 #3
0
 types::none_type difference_update(types::set<T> &set,
                                    Types const &... others)
 {
   set.difference_update(others...);
   return {};
 }
예제 #4
0
 types::none_type symmetric_difference_update(types::set<T> &set,
                                              U const &other)
 {
   set.symmetric_difference_update(other);
   return {};
 }
예제 #5
0
 bool issuperset(types::set<T> const& set, types::set<U> const& other){
     return set.issuperset(other);
 }
예제 #6
0
파일: add.hpp 프로젝트: OnlySang/pythran 
 void add(types::set<T> &s, F const& value) {
     s.add(value);
 }
예제 #7
0
void symmetric_difference_update(types::set<T> &set, U const &other)
{
    set.symmetric_difference_update(other);
}
예제 #8
0
 typename __combined<types::set<T>, U>::type
 symmetric_difference(types::set<T> const &set, U const &other)
 {
   return set.symmetric_difference(other);
 }
예제 #9
0
typename __combined<types::set<T>, Types...>::type
intersection(types::set<T> const &set, Types const &... others)
{
    return set.intersection(others...);
}
예제 #10
0
 void discard(types::set<T> & set, U const& elem)
 {
     set.discard(elem);
 }
예제 #11
0
 bool isdisjoint(types::set<T> const &calling_set, U const &arg_set)
 {
   return calling_set.isdisjoint(arg_set);
 }
예제 #12
0
 bool issubset(types::set<T> const &set, U const &other)
 {
   return set.issubset(other);
 }
예제 #13
0
 types::set<T> difference(types::set<T> const& set, Types const&... others){
     return set.difference(others...);
 }
예제 #14
0
 void difference_update(types::set<T> &set, Types const &... others)
 {
   set.difference_update(others...);
 }