Is there a way to access the underlying container of STL container adaptors?

by

I spotted the following solution somewhere on the web and I’m using it in my projects:

template <class T, class S, class C>
    S& Container(priority_queue<T, S, C>& q) {
        struct HackedQueue : private priority_queue<T, S, C> {
            static S& Container(priority_queue<T, S, C>& q) {
                return q.*&HackedQueue::c;
            }
        };
    return HackedQueue::Container(q);
}

int main()
{
    priority_queue<SomeClass> pq;
    vector<SomeClass> &tasks = Container(pq);
    return 0;
}

Have fun :).

More Related Contents:

  1. Why are Standard iterator ranges [begin, end) instead of [begin, end]?
  2. Why is std::map implemented as a red-black tree?
  3. Why does the C++ STL not provide any “tree” containers?
  4. Looking for C++ STL-like vector class but using stack storage
  5. Is the order of iterating through std::map known (and guaranteed by the standard)?
  6. Relative performance of std::vector vs. std::list vs. std::slist?
  7. A proper way to create a matrix in c++
  8. How to choose between map and unordered_map?
  9. Efficiency of the STL priority_queue
  10. Standard Library Containers with additional optional template parameters?
  11. Order Statistic Tree in C++
  12. In which scenario do I use a particular STL container?
  13. What are the complexity guarantees of the standard containers?
  14. How do I sort a std::vector by the values of a different std::vector?
  15. Why can’t simple initialize (with braces) 2D std::array? [duplicate]
  16. Is it safe to assume that STL vector storage is always contiguous?
  17. Why can’t we declare a std::vector?
  18. Using Unicode in C++ source code
  19. Efficient way of reading a file into an std::vector?
  20. Determine if a type is an STL container at compile time
  21. How to initialize std::vector from C-style array?
  22. Removing item from vector while iterating?
  23. Sorting a vector in descending order
  24. std::map emplace without copying value
  25. C++ Double Address Operator? (&&)
  26. Can raw pointers be used instead of iterators with STL algorithms for containers with linear storage?
  27. std::back_inserter for a std::set?
  28. what is the difference between const_iterator and iterator? [duplicate]
  29. Why vector access operators are not specified as noexcept?
  30. Inspecting STL containers in Visual Studio debugging

Leave a Comment