Home > Articles > Programming > C/C++

Resource Management in Action

In the conclusion of this two-part series, Bartosz Milewski uses the Resource Management methodology described in part 1 to show a new approach to the implementation of the topological sort. Interestingly, the Resource Management version is faster than the traditional implementation.
This pair of articles is an edited and extended version of two articles Bartosz Milewski published in C++ Report in September 1998 and February 1999. Bartosz Milewski is the author of C++ In Action: Industrial-Strength Programming Techniques (Addison-Wesley, 2001, ISBN 0-201-69948-6), a book that teaches professional programming in C++.

Resource management pops up in virtually every nontrivial programming exercise. Not long ago, I had the opportunity to listen to an interesting talk given by Andrew Koenig at the C++ World conference. He spoke about the standard library and, to round things up, gave an example of a simple implementation of a topological sort. What made the implementation simple and elegant was the use of the facilities of the standard library—string, vectors, maps, and iterators.

I liked his implementation, but it wasn't the kind of solution I would have come up with. In particular, it cleverly avoided all memory-management problems. Obviously, if you can avoid memory management, you should. But that's not always possible—and besides, it's not always most efficient. I started thinking about an alternative approach that would deal explicitly with the problems of allocating and deallocating objects.

I'll first describe the implementation based on Andrew Koenig's talk (I call it string-based) and then transform it into a more explicitly resource-management–based solution. In the process, I'll explain some of the tradeoffs and unveil some of the resource-management tricks of the standard library.

I would like to thank Andrew Koenig for letting me use his example and discussing the tradeoffs with me.

Topological Sort

Here's a short description of the problem. The program is given a list of pairs of strings. The second element of each pair, the successor, is meant to depend on the first element of the pair, the predecessor. After reading all the pairs, the program outputs the strings in an order that fulfills the following condition: No successor is output before its predecessor. There could be many acceptable orderings, or, in the case of cyclic dependencies, there could be none. In the latter case, the program should print the appropriate failure message.

This problem arises whenever you have to schedule several interdependent tasks. For instance, you might think of the process of dressing—putting on a shirt, pants, socks, shoes, and so on. Some of these items can be put on in any order; others depend on each other. For instance, it's impractical to put on shoes before putting on socks. The dependencies between various items of clothing can be expressed as a list of pairs, like this:

LeftSock LeftShoe
RightSock RightShoe
Pants LeftShoe
Pants RightShoe

Our program, given a list like that, should produce the output that describes one possible order of putting on various items of dress. For instance, this list fulfills the constraints of our problem:

LeftSock RightSock Pants LeftShoe RightShoe

The algorithm that creates such a list, given a list of dependencies, is called a topological sort. Here's how it works.

For each item, store a count of predecessors and a list of successors. For instance, for Pants you'd store zero predecessors and a list of LeftShoe, RightShoe as successors. For LeftShoe, you'd count one predecessor (LeftSock) and store an empty list of successors, and so on. Items whose predecessor count is zero can be immediately output—they have no dependencies. Each time you output such an item, go through its list of successors and decrement their predecessor count. Again, those items whose predecessor count goes to zero are ready to be output. You know you've been successful if you're able to output all items using this procedure.

String-Based Approach

This is my version of Andrew Koenig's implementation. The information about each item is stored inside the Item object. It's just a count of predecessors and a list of successors, together with methods to manipulate and access them:

class Item
  typedef vector<string>::iterator iter;

  Item () : _predCount (0) {}
  int PredCount () const { return _predCount; }
  void IncPred () { _predCount++; }
  void DecPred () { _predCount--; }
  void AddSucc (string str)
    _succ.push_back (str);
  iter begin () { return _succ.begin (); }
  iter end () { return _succ.end (); }
  int _predCount;
  vector<string> _succ;

Notice that successors are stored by name in a vector of strings. Access to successors is given by means of an iterator. It's a standard vector iterator that we typedef'd for convenience to Item::iter.

The name of the item itself is not stored in the Item. That's because the main data structure in this implementation is a standard map that maps names to Items.

Here's how this map is filled with the initial data:

void InputData (map<string, Item> & itemMap)
  string pred, succ;
  while (cin >> pred >> succ)
    itemMap [pred].AddSucc (succ);
    itemMap [succ].IncPred ();

An important point to remember, when dealing with maps, is that the mere action of subscripting a map creates a new entry, if one is not already there. In such a case, the default constructor is used to initialize the Item.

After filling the map with string/item pairs, we create a vector, zeroes, of items whose predecessor count is zero. Again, notice that items are stored in this vector by name, using strings. These items are ready to be output at any time, since they have no dependencies:

vector<string> zeroes;
map<string, Item>::iterator it;
for (it = itemMap.begin (); it != itemMap.end (); ++it)
  pair<string, Item> p = *it;
  if (p.second.PredCount () == 0)
    zeroes.push_back (p.first);

The map iterator returns key/value pairs. You access the key part of the pair as its first element, and the value part as its second element. In our case, the key is a string and the value is an Item.

Now we're ready to start outputting the elements. We pop them from our vector of zeroes. Notice that it's a two-step process—we access the top element of the vector using back, and destroy it using pop_back. The standard library is designed in such a way that the method pop_back doesn't return the popped element.

After an element has been output, we go through its list of successors and decrement their respective predecessor counts. Those items whose predecessor counts go to zero become ready to be output during the following iterations. We add them to our vector of zeroes:

int count = 0;
while (zeroes.size () != 0)
  string str = zeroes.back ();
  cout << str << endl;
  zeroes.pop_back ();
  // Iterate over successors
  Item & item = itemMap [str];
  for (Item::iter itSuc = item.begin ();
    itSuc != item.end (); ++itSuc)
    Item & suc = itemMap [*itSuc];
    suc.DecPred ();
    if (suc.PredCount () == 0)
      zeroes.push_back (*itSuc);

Finally, the measure of our success is the equality between the original number of items in the map and the number of items that we have output:

return count == itemMap.size ();


This is an elegant and reasonably efficient implementation of a topological sort. But there's something very non–C about it. Notice the way items are indirectly addressed using strings. The traditional C way would be to use pointers. Why isn't the list of successors, for instance, implemented as a vector of pointers? Same with the vector of zeroes. Pointer implementation would eliminate all these redundant map lookups. Innocent-looking statements like this are not what they seem:

Item & suc = itemMap [*itSuc];

Indexing into a map is not a constant-time operation. It's not a big deal—a log-time search in a balanced tree involving some string comparisons. But do we really have to sacrifice performance, and for what reason?

C programmers are usually very aware of little inefficiencies like these. So there must have been a good reason why this solution was chosen. Well, do you see any explicit memory allocation in this whole program? There is none! All the resource management is done behind the scenes. The design of this program was influenced by the attempt to avoid dealing with dynamic resources. It was possible to attain this goal by judicious use of value semantics and a very clever resource-management scheme implemented by the standard library's string. In fact, most implementations of the standard string come very close to what other languages call garbage collection.

Standard containers were designed to work with values. In this program, both items and strings are being internally treated as values—they're copied and passed around as if they were integers or doubles. For instance, when necessary, the map allocates a node with enough room to hold a string and an Item. The string is then copied into its space and the Item initialized using its default constructor. Since the map was designed to take care of the management of its nodes, the client doesn't have to worry about any allocations or deallocations.

In terms of resource management, the usual implementation of the standard string is in terms of a strong reference-counting pointer with a twist. Internally it contains a pointer to the actual storage area for the characters. This storage area has room for reference count (in most implementations, it's in the same array at offset –1). So whenever you're passing a string "by value," or assigning it to another string, you're not actually copying the characters—you're just incrementing their reference count.

The twist is that the characters are copied when you're trying to write into a string whose internal storage is shared with other strings. This is called copy-on-write, or COW for short. From the clients' point of view, it looks like they're always dealing with separate copies of strings, but they only pay the cost of copying when it actually matters. The downside of this scheme is that such behind-the-scenes manipulations of shared data might get ugly when multiple threads are involved. Synchronizing access at such a low level might be costly.

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020