[#bsl-Vector_RangeIteratorCategory-09]
= xref:bsl.adoc[bsl]::Vector_RangeIteratorCategory
:relfileprefix: ../
:mrdocs:

This `struct` provides a primitive means to determine the iterator category for an iterator/sentinel pair where there is a preference to treat any iterator where the `insertDistance` can be computed as a forward iterator, even if it does not meet the ranges concepts needed to be treated as one.

== Synopsis

Declared in `<bslstl_vector.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    class t_ITERATOR,
    class t_SENTINEL,
    bool t_NOTSPECIALIZED = is_fundamental<t_ITERATOR>::value || is_fundamental<t_SENTINEL>::value>
struct Vector_RangeIteratorCategory;
----

== Type Aliases

[cols="1,4"]
|===
| Name| Description
| xref:bsl/Vector_RangeIteratorCategory-09/type.adoc[`type`] 
| This `typedef` is an alias to the iterator category used for range insertion.
|===


== Specializations

[cols="1,4"]
|===
| Name| Description
| xref:bsl/Vector_RangeIteratorCategory-08.adoc[`Vector_RangeIteratorCategory<t_ITERATOR, t_SENTINEL, true>`] 
| This partial specialization of the `struct` template for fundamental types provides a nested `type` that is not an iterator category, so can be used to control the internal dispatch of function template overloads taking two arguments of the same type.
|===



[.small]#Created with https://www.mrdocs.com[MrDocs]#