RomandevJavaScript
diff --git a/‎docs/standard-library/drop-while-view-class.md‎
Lines changed: 1 addition & 1 deletion b/‎docs/standard-library/drop-while-view-class.md‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎docs/standard-library/iterator-concepts.md‎
Lines changed: 3 additions & 0 deletions b/‎docs/standard-library/iterator-concepts.md‎
Lines changed: 3 additions & 0 deletions
diff --git a/‎docs/standard-library/media/iterator-hiearchy.svg‎
Lines changed: 194 additions & 0 deletions b/‎docs/standard-library/media/iterator-hiearchy.svg‎
Lines changed: 194 additions & 0 deletions
@@ -36,7 +36,7 @@ For a description of the following entries, see [View class characteristics](vie
 | Characteristic | Description |
 |--|--|
 | **Range adaptor** | [`views::drop_while`](range-adaptors.md#drop_while) |
-| **Underlying range** | Must satisfy [`forward_range`](range-concepts.md#forward_range) or higher and the underlying range's iterators must model `sized_sentinel_for` |
+| **Underlying range** | Must satisfy [`forward_range`](range-concepts.md#forward_range) or higher and the underlying range's iterators must model [`sized_sentinel_for`](iterator-concepts.md#sized_sentinel_for) |
 | **Element type** | Same as the underlying range |
 | **View iterator category** | Same as the underlying range |
 | **Sized** | Only if the underlying range satisfies [`random_access_range`](range-concepts.md#random_access_range) |
 
@@ -56,6 +56,8 @@ There are six categories of iterators. They're directly related to the categorie
 
 The following iterator concepts are listed in order of increasing capability. `input_or_output_iterator` is at the low end of the capability hierarchy, and `contiguous_iterator` is at the high end. Iterators higher in the hierarchy can generally be used in place of those that are lower, but not vice-versa. For example, a `random_access_iterator` iterator can be used in place of a `forward_iterator`, but not the other way around. An exception is `input_iterator`, which can't be used in place of `output_iterator` because it can't write.
 
+:::image type="content" source="media/iterator-hierarchy.svg" alt-text="Diagram of the iterator hierarchy. input_or_output_iterator is the base. input_iterator and output_iterator are shown as refining input_or_output_iterator. forward_iterator is next and refines both input_iterator and output_iterator. bidirectional_iterator refines forward_iterator. random_access_iterator refines bidirectional_iterator. Finally, contiguous_iterator refines random_access_iterator":::
+
 In the following table, "Multi-pass" refers to whether the iterator can revisit the same element more than once. For example, `vector::iterator` is a multi-pass iterator because you can make a copy of the iterator, read the elements in the collection, and then restore the iterator to the value in the copy, and revisit the same elements again. If an iterator is single-pass, you can only visit the elements in the collection once.
 
 In the following table, "Types" refers to the types of collections/iterators that satisfy the concept.
@@ -477,5 +479,6 @@ int main()
 
 ## See also
 
+[Range concepts](range-concepts.md)\
 [Range adaptors](range-adaptors.md)\
 [View classes](view-classes.md)