Push as many of the items in the specified range [begin .. end)] as there is space available for (see {High-Water Mark Feature}) to the front of the container, stopping if the container high-water mark is reached. Return the number of items pushed. Note that the pushed items will be in the container in the reverse of the order in which they occur in the range. Also note that the items in the range are treated as const objects, copied without being modified.
Declared in <bdlcc_deque.h>
template<class INPUT_ITER>
Deque<TYPE>::size_type
tryPushFront(
INPUT_ITER begin,
INPUT_ITER end);