Lecture06-1-2

Lecture06-1-2 - More on STL Continue STL notes from last...

Info icon This preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
CS2134 More on STL Continue STL notes from last lecture: STL algorithms find does sequential search. Does comparisons using == operator find_if does sequential search for object satisfying a predicate
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
CS2134 lower_bound does binary search on range [first,last) container must be sorted need random access iterator for runtime O(log n) Code (Figure 7.9, p. 244) for random access iterator (STL code is slightly different) note computation of middle iterator returns iterator to leftmost element in [first,last) containing element >= x (if none exists, returns last)
Image of page 2
CS2134 More STL function objects #include <functional> provides some useful function objects, e.g. template class <Object> class less { public:   bool operator()(const Object& lhs,                  const Object& rhs)const       {return lhs < rhs} }
Image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
CS2134 Associative Containers Set: collection of objects, indexed by the object’s value Map: collection of pairs valuetype=pair<key_type,data_type> indexed by keytype Efficient (O(log n) worst case) find and insert methods, which take value as parameter Iteration through set or map visits items in order (according to comparision provided by a functor) Related containers: Sets and maps are both unique sorted associative containers ; non-unique versions are multi-set and multi-map; hashmap provides O(1) average case for find and insert, but bad worst case and is not sorted.
Image of page 4
CS2134 Sets
Image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern