Heterogeneous containers in C++

by

Well generally C++ Containers are designed to hold objects of a single type using templates. If you want different types that are all derived from one type you can store a container of pointers (I guess you could also have a container of void* to anything…) e.g. std::vector<MyBaseType*>.

If you want completely unrelated types, you can store objects that can safely reference those other types, such as boost::any.

http://www.boost.org/doc/libs/1_47_0/doc/html/any.html

Some examples off the boost site:

#include <list>
#include <boost/any.hpp>

using boost::any_cast;
typedef std::list<boost::any> many;

void append_int(many & values, int value)
{
    boost::any to_append = value;
    values.push_back(to_append);
}

void append_string(many & values, const std::string & value)
{
    values.push_back(value);
}

bool is_int(const boost::any & operand)
{
    return operand.type() == typeid(int);
}
bool is_char_ptr(const boost::any & operand)
{
    try
    {
        any_cast<const char *>(operand);
        return true;
    }
    catch(const boost::bad_any_cast &)
    {
        return false;
    }
}

boost::variant is similar, but you specify all the allowed types, rather than allowing any type in your container.

http://www.boost.org/doc/libs/1_47_0/doc/html/variant.html

std::vector< boost::variant<unsigned, std::string> > vec;
vec.push_back( 44);
vec.push_back( "str" );
vec.push_back( SomthingElse(55, 65) ); //not allowed

More Related Contents:

  1. How can I use std::maps with user-defined types as key?
  2. What are the complexity guarantees of the standard containers?
  3. Why use iterators instead of array indices?
  4. Why isn’t vector a STL container?
  5. Copy map values to vector in STL [duplicate]
  6. What is an iterator’s default value?
  7. Why does storing references (not pointers) in containers in C++ not work?
  8. Template class with template container
  9. What is the right approach when using STL container for median calculation?
  10. Do STL iterators guarantee validity after collection was changed?
  11. General use cases for C++ containers
  12. What’s the difference between “STL” and “C++ Standard Library”?
  13. std::vector::resize() vs. std::vector::reserve()
  14. Is std::vector so much slower than plain arrays?
  15. How to convert wstring into string?
  16. How do I erase an element from std::vector by index?
  17. What requirements must std::map key classes meet to be valid keys?
  18. Is list::size() really O(n)?
  19. What’s faster, iterating an STL vector with vector::iterator or with at()?
  20. Capturing a time in milliseconds
  21. Performance of qsort vs std::sort?
  22. How does C++ STL unordered_map resolve collisions?
  23. How do I erase elements from STL containers?
  24. Are const_iterators faster?
  25. Why the libc++ std::vector internally keeps three pointers instead of one pointer and two sizes?
  26. Visual c++ “for each” portability
  27. Is stl vector concurrent read thread-safe?
  28. Is it more efficient to copy a vector by reserving and copying, or by creating and swapping? [duplicate]
  29. Missing C++ header after updating OSX Command Line Tools 6.3
  30. Obtain container type from (its) iterator type in C++ (STL)

Leave a Comment