containers

Okay, simple template question. Say I define my template class something like this: template<typename T> class foo { public: foo(T const& first, T const& second) : first(first), second(second) {} template<typename C> void bar(C& container, T const& baz) { //... } private: T first; T second; } The question is about my bar function... I need it to be able to use a standard container of some sort, which is why I included the template/typename C part, to define that container type. But apparently that's not the right way to do it, since my test class then complains that: error: 'bar' was not

Unquestionably, I would choose to use the STL for most C++ programming projects. The question was presented to me recently however, "Are there any cases where you wouldn't use the STL?"... The more I thought about it, the more I realized that perhaps there SHOULD be cases where I choose not to use the STL... For example, a really large, long term project whose codebase is expected to last years... Perhaps a custom container solution that precisely fits the projects needs is worth the initial overhead? What do you think, are there any cases where you would choose NOT to STL? Projects with

Queue and Stack are a structures widely mentioned. However, in C++, for queue you can do it in two ways: #include <queue> #include <deque> but for stack you can only do it like this #include <stack> My question is, what's the difference between queue and deque, why two structures proposed? For stack, any other structure could be included? Moron/Aryabhatta is correct, but a little more detail may be helpful. Queue and stack are higher level containers than deque, vector, or list. By this, I mean that you can build a queue or stack out of the lower level containers. For example: std::stack<int,

I'm trying to remove an image and I get: # docker rmi f50f9524513f Failed to remove image (f50f9524513f): Error response from daemon: conflict: unable to delete f50f9524513f (cannot be forced) - image has dependent child images This is the docker version: # docker version Client: Version: 1.10.3 API version: 1.22 Go version: go1.5.3 Git commit: 20f81dd Built: Thu Mar 10 21:49:11 2016 OS/Arch: linux/amd64 Server: Version: 1.10.3 API version: 1.22 Go version: go1.5.3 Git commit: 20f81dd Built: Thu Mar 10 21:49:11 2016 OS/Arch: linux/amd64 but there is no extra information: # docker images -

For any STL container that I'm using, if I declare an iterator (of this particular container type) using the iterator's default constructor, what will the iterator be initialised to? For example, I have: std::list<void*> address_list; std::list<void*>::iterator iter; What will iter be initialised to? By convention a "NULL iterator" for containers, which is used to indicate no result, compares equal to the result of container.end() . std::vector<X>::iterator iter = std::find(my_vec.begin(), my_vec.end(), x); if (iter == my_vec.end()) { //no result found; iter points to "nothing" } However,