## SortedDictionary::rend() const method


Gets a reverse iterator for a non-existent element before the start of the const-qualified collection.

```cpp
const_reverse_iterator System::Collections::Generic::SortedDictionary<TKey, TValue>::rend() const noexcept
```


### ReturnValue

A reverse iterator pointing to the theoretical element preceeding the first element in the const-qualified map (last in reverse).

## See Also

* Typedef [const_reverse_iterator](../const_reverse_iterator/)
* Class [SortedDictionary](../)
* Namespace [System::Collections::Generic](../../)
* Library [Aspose.PDF for C++](../../../)
## SortedDictionary::rend() method


Gets a reverse iterator for a non-existent element before the start of the collection.

```cpp
reverse_iterator System::Collections::Generic::SortedDictionary<TKey, TValue>::rend() noexcept
```


### ReturnValue

A reverse iterator pointing to the theoretical element preceeding the first element in the map (last in reverse).

## See Also

* Typedef [reverse_iterator](../reverse_iterator/)
* Class [SortedDictionary](../)
* Namespace [System::Collections::Generic](../../)
* Library [Aspose.PDF for C++](../../../)