tmp/tmpcvgi59nm/{from.md → to.md}
RENAMED
|
@@ -72,24 +72,10 @@ namespace std {
|
|
| 72 |
typedef random_access_iterator_tag iterator_category;
|
| 73 |
};
|
| 74 |
}
|
| 75 |
```
|
| 76 |
|
| 77 |
-
If there is an additional pointer type ` \xname{far}` such that the
|
| 78 |
-
difference of two ` \xname{far}` is of type `long`, an implementation
|
| 79 |
-
may define
|
| 80 |
-
|
| 81 |
-
``` cpp
|
| 82 |
-
template<class T> struct iterator_traits<T __far*> {
|
| 83 |
-
typedef long difference_type;
|
| 84 |
-
typedef T value_type;
|
| 85 |
-
typedef T __far* pointer;
|
| 86 |
-
typedef T __far& reference;
|
| 87 |
-
typedef random_access_iterator_tag iterator_category;
|
| 88 |
-
};
|
| 89 |
-
```
|
| 90 |
-
|
| 91 |
To implement a generic `reverse` function, a C++program can do the
|
| 92 |
following:
|
| 93 |
|
| 94 |
``` cpp
|
| 95 |
template <class BidirectionalIterator>
|
|
|
|
| 72 |
typedef random_access_iterator_tag iterator_category;
|
| 73 |
};
|
| 74 |
}
|
| 75 |
```
|
| 76 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 77 |
To implement a generic `reverse` function, a C++program can do the
|
| 78 |
following:
|
| 79 |
|
| 80 |
``` cpp
|
| 81 |
template <class BidirectionalIterator>
|