implementation of queue in c++

[surrealtrauma]

how can i implemete a pointer-based queue in c++?

 

[Kai-Uwe Bux]

how can i implemete a pointer-based queue in c++?

Why would you want to: what about using std::queue?


Best

Kai-Uwe Bux

 

[Rapscallion]

Why would you want to: what about using std::queue?

Because std::queue is value-based (like any Standard container), not
pointer-based?

 

[Kai-Uwe Bux]

Because std::queue is value-based (like any Standard container), not
pointer-based?

I am confused, very likely, I do not understand what "pointer-based queue"
means: what about std::queue< T* > or some std::queue< SmartPtr< T > > ?


Best

Kai-Uwe Bux

 

[Peter Julian]

Because std::queue is value-based (like any Standard container), not
pointer-based?

A standard container can both provide the allocation mechanism or let the
user manage it. What makes you believe that a valid derefenced pointer is
not a value?

 

[Ioannis Vranos]

Because std::queue is value-based (like any Standard container), not
pointer-based?

I am not sure what you mean. It is implemented by using pointers and can store variables,
pointers or any other objects.