Visual C++ 6 Unleashed

Visual C++ 6 Unleashed

By MICKEY WILLIAMS and David Bennett

Summary

In this chapter, you took a look at the Standard C++ Library. You examined the two major components of the library: the C++ language itself and the Standard Template Library (STL).

You learned that the STL is a generic container class library. You then examined its main components—containers, iterators, and algorithms. The containers manage the storage and processing of data, and they are implemented by template containers. The iterators are used to traverse the containers, and algorithms create the bond between the containers. The algorithms are standalone functions and are not member-specific.

You learned to think of a container as an object that holds other objects. Containers are implemented by template classes to enable them to hold different kinds of data in an easy manner. The STL contains the most common containers that programmers find useful when handling common programming tasks.

This chapter also showed you how iterators provide methods to traverse the contents of a container and are used to access individual elements in a container. Iterators are similar to pointers and can be incremented to point to the next element; iterators can be dereferenced to obtain the value of the element they point to. Iterators allow algorithms and containers to connect and create the bond that enables them to work together.

Next, you examined how algorithms enable you to perform functions on the containers. They are not container-specific or members of the containers but standalone functions that are general in nature. You saw that you can use the algorithms on containers you create yourself or C++ arrays. Algorithms are represented by template functions. In this chapter, you looked at a well-rounded group of examples using the containers, iterators, and algorithms.

You also were introduced to the Active Template Library (ATL), which you use to create very lightweight COM objects, Automation Server controls, and Active X controls. ATL objects do not require a DLL or static library upon distribution (unlike MFC) and leave a small memory footprint. ATL has no provisions for data structures or algorithms, which makes it an excellent partner with STL.

Finally, you looked at using STL with MFC and ATL. You saw that using MFC with STL is advantageous only if you want to traverse the MFC class libraries using the STL generic method and you want to apply the generic algorithms with MFC. ATL is an excellent partner to STL in that ATL has no provisions for data structures and algorithms, and STL fits that bill nicely.

Share ThisShare This

Informit Network