Create a priority queue having the same value as the specified original object. Use a copy of the comparator from original to order elements in the priority queue.
original
Declared in <bslstl_priorityqueue.h>
<bslstl_priorityqueue.h>
priority_queue(priority_queue const& original);