Skip to content

Commit 0fdd650

Browse files
author
mtx48109
committed
broken links
1 parent be8d631 commit 0fdd650

1 file changed

Lines changed: 7 additions & 7 deletions

File tree

‎docs/dotnet/deque-stl-clr.md‎

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -130,7 +130,7 @@ template<typename Value>
130130
## Remarks
131131
The object allocates and frees storage for the sequence it controls through a stored array of handles that designate blocks of `Value` elements. The array grows on demand. Growth occurs in such a way that the cost of either prepending or appending a new element is constant time, and no remaining elements are disturbed. You can also remove an element at either end in constant time, and without disturbing remaining elements. Thus, a deque is a good candidate for the underlying container for template class [queue (STL/CLR)](../dotnet/queue-stl-clr.md) or template class [stack (STL/CLR)](../dotnet/stack-stl-clr.md).
132132

133-
A `deque` object supports random-access iterators, which means you can refer to an element directly given its numerical position, counting from zero for the first (front) element, to [deque::size (STL/CLR)](../dotnet/deque-size-stl-clr.md)`() - 1` for the last (back) element. It also means that a deque is a good candidate for the underlying container for template class [priority_queue (STL/CLR)](../dotnet/priority-queue-stl-clr.md).
133+
A `deque` object supports random-access iterators, which means you can refer to an element directly given its numerical position, counting from zero for the first (front) element, to [deque::size (STL/CLR)](#size)`() - 1` for the last (back) element. It also means that a deque is a good candidate for the underlying container for template class [priority_queue (STL/CLR)](../dotnet/priority-queue-stl-clr.md).
134134

135135
A deque iterator stores a handle to its associated deque object, along with the bias of the element it designates. You can use iterators only with their associated container objects. The bias of a deque element is `not` necessarily the same as its position. The first element inserted has bias zero, the next appended element has bias 1, but the next prepended element has bias -1.
136136

@@ -433,7 +433,7 @@ void clear();
433433
```
434434

435435
### Remarks
436-
The member function effectively calls [deque::erase (STL/CLR)](../dotnet/deque-erase-stl-clr.md)`(` [deque::begin (STL/CLR)](../dotnet/deque-begin-stl-clr.md)`(),` [deque::end (STL/CLR)](../dotnet/deque-end-stl-clr.md)`())`. You use it to ensure that the controlled sequence is empty.
436+
The member function effectively calls [deque::erase (STL/CLR)](#erase)`(` [deque::begin (STL/CLR)](#begin)`(),` [deque::end (STL/CLR)](#end)`())`. You use it to ensure that the controlled sequence is empty.
437437

438438
### Example
439439

@@ -646,7 +646,7 @@ deque(System::Collections::Generic::IEnumerable<Value>^ right);
646646

647647
`deque(deque<Value>% right);`
648648

649-
initializes the controlled sequence with the sequence [`right.begin()`, `right.end()`). You use it to specify an initial controlled sequence that is a copy of the sequence controlled by the deque object `right`. For more information on the iterators, see [deque::begin (STL/CLR)](../dotnet/deque-begin-stl-clr.md) and [deque::end (STL/CLR)](../dotnet/deque-end-stl-clr.md).
649+
initializes the controlled sequence with the sequence [`right.begin()`, `right.end()`). You use it to specify an initial controlled sequence that is a copy of the sequence controlled by the deque object `right`. For more information on the iterators, see [deque::begin (STL/CLR)](#begin) and [deque::end (STL/CLR)](#end).
650650

651651
The constructor:
652652

@@ -809,7 +809,7 @@ bool empty();
809809
```
810810

811811
### Remarks
812-
The member function returns true for an empty controlled sequence. It is equivalent to [deque::size (STL/CLR)](../dotnet/deque-size-stl-clr.md)`() == 0`. You use it to test whether the deque is empty.
812+
The member function returns true for an empty controlled sequence. It is equivalent to [deque::size (STL/CLR)](#size)`() == 0`. You use it to test whether the deque is empty.
813813

814814
### Example
815815

@@ -929,7 +929,7 @@ iterator erase(iterator first, iterator last);
929929

930930
The second member function removes the elements of the controlled sequence in the range [`first`, `last`). You use it to remove zero or more contiguous elements.
931931

932-
Both member functions return an iterator that designates the first element remaining beyond any elements removed, or [deque::end (STL/CLR)](../dotnet/deque-end-stl-clr.md)`()` if no such element exists.
932+
Both member functions return an iterator that designates the first element remaining beyond any elements removed, or [deque::end (STL/CLR)](#end)`()` if no such element exists.
933933

934934
When erasing elements, the number of element copies is linear in the number of elements between the end of the erasure and the nearer end of the sequence. (When erasing one or more elements at either end of the sequence, no element copies occur.)
935935

@@ -1936,7 +1936,7 @@ void resize(size_type new_size, value_type val);
19361936
Value of the padding element.
19371937

19381938
### Remarks
1939-
The member functions both ensure that [deque::size (STL/CLR)](../dotnet/deque-size-stl-clr.md)`()` henceforth returns `new_size`. If it must make the controlled sequence longer, the first member function appends elements with value `value_type()`, while the second member function appends elements with value `val`. To make the controlled sequence shorter, both member functions effectively erase the last element [deque::size (STL/CLR)](../dotnet/deque-size-stl-clr.md)`() -` `new_size` times. You use it to ensure that the controlled sequence has size `new_size`, by either trimming or padding the current controlled sequence.
1939+
The member functions both ensure that [deque::size (STL/CLR)](#size)`()` henceforth returns `new_size`. If it must make the controlled sequence longer, the first member function appends elements with value `value_type()`, while the second member function appends elements with value `val`. To make the controlled sequence shorter, both member functions effectively erase the last element [deque::size (STL/CLR)](#size)`() -` `new_size` times. You use it to ensure that the controlled sequence has size `new_size`, by either trimming or padding the current controlled sequence.
19401940

19411941
### Example
19421942

@@ -2034,7 +2034,7 @@ size_type size();
20342034
```
20352035

20362036
### Remarks
2037-
The member function returns the length of the controlled sequence. You use it to determine the number of elements currently in the controlled sequence. If all you care about is whether the sequence has nonzero size, see [deque::empty (STL/CLR)](../dotnet/deque-empty-stl-clr.md)`()`.
2037+
The member function returns the length of the controlled sequence. You use it to determine the number of elements currently in the controlled sequence. If all you care about is whether the sequence has nonzero size, see [deque::empty (STL/CLR)](#empty)`()`.
20382038

20392039
### Example
20402040

0 commit comments

Comments
 (0)