nhà điều hành đặt tên của loại hoặc không gian tên. Việc tìm kiếm một cái tên sau:: nằm chỉ đặt tên là thành viên của một không gian tên hoặc lớp học. Đặc biệt, sử dụng chỉ thị () được bỏ qua, như bất kỳ khu vực kèm theo khai báo. không gian tên chưa đặt tên [] | Merge DRAFT 28 April 1995 Algorithms library 25- 23 Notes Stable for equal elements in the two ranges the elements from the first range always precede the elements from the second. template class BidirectionalIterator void inplace_merge BidirectionalIterator first BidirectionalIterator middle BidirectionalIterator last template class BidirectionalIterator class Compare void inplace_merge BidirectionalIterator first BidirectionalIterator middle BidirectionalIterator last Compare comp Effects Merges two sorted consecutive ranges first middle and middle last putting the result of the merge into the range first last . Complexity When enough additional memory is available last - first - 1 comparisons. If no additional memory is available an algorithm with complexity NlogN where N is equal to last -first may be used. Notes Stable for equal elements in the two ranges the elements from the first range always precede the elements from the second. Set operations on sorted structures 1 This section defines all the basic set operations on sorted structures. They even work with multisets containing multiple copies of equal elements. The semantics of the set operations are generalized to multisets in a standard way by defining union to contain the maximum number of occurrences of every element intersection to contain the minimum and so on. includes template class InputIterator1 class InputIterator2 bool includes InputIterator1 firstl InputIterator1 lastl InputIterator2 first2 InputIterator2 last2 template class InputIterator1 class InputIterator2 class Compare bool includes InputIterator1 firstl InputIterator1 lastl InputIterator2 first2 InputIterator2 last2 Compare comp Returns true if every element in the range first2 last2 is contained in the range firstl lastl . Returns false otherwise. Complexity At most 2 lastl - firstl last2 - first2 - 1 comparisons. set union 25- 24 Algorithms .
