Which C 11 Container Should I Choose?

Choosing the Optimal C 11 Container

Introduction

Selecting the most appropriate container in C has always been a crucial decision, and with the introduction of new features in C 11, the options have expanded. This article aims to provide guidance in navigating the container options available in C 11, offering a comprehensive approach to container selection.

Associative vs. Simple Sequence Containers

The fundamental distinction lies between associative and simple sequence containers. Associative containers excel in situations requiring efficient search operations based on keys, while simple sequence containers prioritize sequential access and manipulation of data.

Selecting an Associative Container

Consider the following guidelines when selecting an associative container:

• Ordered: If maintaining the order of elements is essential, opt for an ordered associative container (e.g., map or set). Otherwise, choose an unordered container (e.g., unordered_map or unordered_set).
• Separate Key: If the key is separate from the value, use a map. For scenarios where the key and value are inseparable, a set is more suitable.
• Duplicates: To allow duplicates, use a container with "multi" in its name (e.g., multimap, multiset). Otherwise, choose a container without "multi" to prevent duplicates.

Selecting a Simple Sequence Container

For simple sequence containers, follow these guidelines:

• Memory Stable: If elements need to remain stable in memory during container modifications, choose a list (e.g., list, forward_list).
• Dynamically Sized: If the container's size is known at compile time, will not change, and elements are default constructible or can be initialized with a full initialization list, an array is recommended.
• Double-Ended: For efficient insertion or removal from both ends, select a deque. For other cases, a vector is generally the preferred choice.

Example:

To illustrate the decision-making process, consider a scenario where we need to store a collection of names and their corresponding unique IDs, with the requirement for efficient lookup by ID and arbitrary insertion and deletion.

• Associative container: Yes, since we need to search by key (ID).
• Ordered: Not necessarily, as the order of the names is not significant.
• Separate Key: Yes, the ID is distinct from the name.
• Duplicates: No, IDs are unique.

Based on these criteria, the best container choice would be an unordered_map.

Conclusion

While this text-based approach cannot substitute for a graphical flowchart, it provides a structured and comprehensive guide to selecting the most suitable Standard Library container in C 11. By following the guidelines provided, developers can make informed decisions and optimize their code both for efficiency and maintainability.

The above is the detailed content of Which C 11 Container Should I Choose?. For more information, please follow other related articles on the PHP Chinese website!