Data Abstraction and Problem Solving with C++
Walls and Mirrors
by Frank M. Carrano
c11p639.h
Go to the documentation of this file.00001 00015 OutputIter set_union(InputIter1 first, InputIter1 last, 00016 InputIter2 first2, InputIter2 last2, 00017 OutputIter result); 00018 // Returns a set that is a union of two sets. 00019 // Precondition: None. 00020 // Postcondition: A set s3 contains the union of sets s1 and s2. 00021 00022 OutputIter set_difference(InputIter1 first, InputIter1 last, 00023 InputIter2 first2, InputIter2 last2, 00024 OutputIter result); 00025 // Returns a set that has elements that belong to the 00026 // first set, but not the second. 00027 // Precondition: None. 00028 // Postcondition: A set s3 contains the difference of sets s1 and s2. 00029 00030 OutputIter set_intersection(InputIter1 first, InputIter1 last, 00031 InputIter2 first2, InputIter2 last2, 00032 OutputIter result); 00033 // Returns a set that has elements that belong to both 00034 // input sets. 00035 // Precondition: None. 00036 // Postcondition: A set s3 contains the intersection of sets s1 and s2. 00037 00038 bool includes(InputIter1 first, InputIter1 last, 00039 InputIter2 first2, InputIter2 last2); 00040 // Tests whether set2 is a subset of set1. 00041 // Precondition: None 00042 // Postcondition: Returns true if s2 is a subset of s1; otherwise 00043 // returns false
