Assembla home | Assembla project page
 

root/trunk/cbear.berlios.de/range/index.xml

Revision 2, 6.9 kB (checked in by sergey_shandar, 1 year ago)

restoring...

Line 
1 <?xml version="1.0" encoding="utf-8"?>
2 <?xml-stylesheet type="text/xsl" href="../cms/html.xsl"?>
3 <section
4         xmlns="http://cbear.berlios.de/cms" name="Iterator Range Algorithms">
5         <section name="Traits">
6 <pre><![CDATA[template<class Container>
7 class traits
8 {
9 public:
10         typedef ... iterator;
11         typedef ... difference_type;
12         typedef ... size_type;
13         typedef ... referense;
14         typedef ... pointer;
15         typedef ... value_type;
16         typedef ... reverse_iterator;
17         static size_type const const_size;
18         static iterator begin(Container & );
19         static iterator end(Container & );
20         static reference front(Container & );
21         static reference back(Container & );
22         static reference at(Container & , size_type);
23         static bool empty(Container & );
24         static size_type size(Container & );
25         static reverse_iterator rbegin(Container & );
26         static reverse_iterator rend(Container & );
27 };]]></pre>
28                 <section name="Iterator">
29 <pre><![CDATA[template<class Container>
30 class iterator
31 {
32 public:
33         typedef ... type;
34 };]]></pre>
35                 </section>
36                 <section name="Value Type">
37 <pre><![CDATA[template<class Container>
38 class value_type
39 {
40 public:
41         typedef ... type;
42 };]]></pre>
43                 </section>
44                 <section name="Difference Type">
45 <pre><![CDATA[template<class Container>
46 class difference_type
47 {
48 public:
49         typedef ... type;
50 };]]></pre>
51                 </section>
52                 <section name="Size Type">
53 <pre><![CDATA[template<class Container>
54 class size_type
55 {
56 public:
57         typedef ... type;
58 };]]></pre>
59                 </section>
60                 <section name="Reference">
61 <pre><![CDATA[template<class Container>
62 class reference
63 {
64 public:
65         typedef ... type;
66 };]]></pre>
67                 </section>
68                 <section name="Pointer">
69 <pre><![CDATA[template<class Container>
70 class pointer
71 {
72 public:
73         typedef ... type;
74 };]]></pre>
75                 </section>             
76                 <section name="Reverse Iterator">
77 <pre><![CDATA[template<class Container>
78 class reverse_iterator
79 {
80 public:
81         typedef ... type;
82 };]]></pre>
83                 </section>
84                 <section name="Constant Size">
85 <pre><![CDATA[template<class Container>
86 class const_size
87 {
88 public:
89         static ... const value = ...;
90 };]]></pre>
91                 </section>
92                 <section name="Begin">
93 <pre><![CDATA[template<class Container>
94 ... begin(Container &X);
95 template<class Container>
96 ... begin(Container const &X);]]></pre>
97                 </section>
98                 <section name="End">
99 <pre><![CDATA[template<class Container>
100 ... end(Container &X);
101 template<class Container>
102 ... end(Container const &X);]]></pre>
103                 </section>
104                 <section name="Empty">
105 <pre><![CDATA[template<class Container>
106 bool empty(Container const &X);]]></pre>
107                 </section>
108                 <section name="Size">
109 <pre><![CDATA[template<class Container>
110 ... size(Container const &X);]]></pre>
111                 </section>
112                 <section name="Front">
113 <pre><![CDATA[template<class Container>
114 ... front(Container &X);
115 template<class Container>
116 ... front(Container const &X);]]></pre>
117                 </section>
118                 <section name="Back">
119 <pre><![CDATA[template<class Container>
120 ... back(Container &X);
121 template<class Container>
122 ... back(Container const &X);]]></pre>
123                 </section>
124                 <section name="At">
125 <pre><![CDATA[template<class Container, class Size>
126 ... at(Container &X, Size I);
127 template<class Container>
128 ... at(Container const &X, Size I);]]></pre>
129                 </section>
130                 <section name="Reverse Begin">
131 <pre><![CDATA[template<class Container>
132 ... rbegin(Container &X);
133 template<class Container>
134 ... rbegin(Container const &X);]]></pre>
135                 </section>
136                 <section name="Reverse End">
137 <pre><![CDATA[template<class Container>
138 ... rend(Container &X);
139 template<class Container>
140 ... rend(Container const &X);]]></pre>
141                 </section>
142         </section>
143         <section name="Helper">
144 <pre><![CDATA[template<class Container, class Iterator, class ConstIterator>
145 class helper
146 {
147 public:
148         typedef Container container;
149         typedef Iterator iterator;
150         typedef ConstIterator const_iterator;
151         typedef ... value_type;
152         typedef ... difference_type;
153         typedef ... size_type;
154         typedef ... reference;
155         typedef ... const_reference;
156         typedef ... pointer;
157         typedef ... const_pointer;
158         typedef ... reverse_iterator;
159         typedef ... const_reverse_iterator;
160         bool empty() const;
161         size_type size() const;
162         reference front();
163         const_reference front() const;
164         reference back();
165         const_reference back() const;
166         reference operator[](size_type);
167         const_reference operator[](size_type) const;
168         reverse_iterator rbegin();
169         const_reverse_iterator rbegin() const;
170         reverse_iterator rend();
171         const_reverse_iterator rend() const;
172 };]]></pre>
173         </section>
174         <section name="Iterator Range">
175 <pre><![CDATA[template<class Iterator>
176 class iterator_range
177 {
178 public:
179         typedef Iterator iterator;
180         typedef Iterator const_iterator;
181         iterator_range();
182         iterator_range(iterator const & , iterator const & );
183         template<class Range>
184         explicit iterator_range(Range const & );
185         template<class Range>
186         explicit iterator_range(Range & );
187         iterator begin() const;
188         iterator end() const;
189         ...
190 };
191 template<class Iterator>
192 ... make_iterator_range(Iterator const & , Iterator const & );
193 template<class Range>
194 ... make_iterator_range(Range const & );
195 template<class Range>
196 ... make_iterator_range(Range & );]]></pre>
197                 <section name="Subrange">
198 <pre><![CDATA[template<class Container>
199 class sub_range
200 {
201 public:
202         typedef ... type;
203 };]]></pre>
204                 </section>
205                 <section name="Reverse Range">
206 <pre><![CDATA[template<class Iterator>
207 class reverse_iterator_range
208 {
209 public:
210         typedef ... type;
211 };
212 template<class Iterator>
213 ... make_reverse_iterator_range(Iterator const &, Iterator const &);
214 template<class Container>
215 ... make_reverse_iterator_range(Container &);
216 template<class Container>
217 ... make_reverse_iterator_range(Container const &);
218 template<class Container>
219 class reverse_sub_range
220 {
221 public:
222         typedef ... type;
223 };]]></pre>
224                 </section>
225                 <section name="Zero Ended Range">
226 <pre><![CDATA[template<class V>
227 ... make_arrayz_range(V *)]]></pre>
228                 </section>
229         </section>
230         <section name="Algorithms">
231                 <section name="Copy">
232 <pre><![CDATA[template<class Container, class OutputIterator>
233 OutputIterator copy(Container const &X, OutputIterator O);]]></pre>
234                 </section>
235                 <section name="Fill">
236 <pre><![CDATA[template<class Container, class T>
237 void fill(Container &X, T const &Value);
238
239 template<class T>
240 class fill_iterator_t
241 {
242 public:
243         ...
244         fill_iterator_t(T const &V, difference_type I);
245         ... operator*() const;
246         bool operator!=(fill_iterator_t const &B) const;
247         fill_iterator_t &operator++();
248         bool operator<(fill_iterator_t const &B);
249         ... operator-(fill_iterator_t const &B) const;
250 };
251
252 template<class T, class Size>
253 ... make_fill(T const &V, Size S);]]></pre>
254                 </section>
255                 <section name="Sort">
256 <pre><![CDATA[template<class Container, class Less>
257 void sort(Container &X, Less L);]]></pre>
258                 </section>
259                 <section name="Transform">
260 <pre><![CDATA[template<class InputRange, class OutputIterator, class UnaryOperation>
261 OutputIterator transform(
262         InputRange &R, OutputIterator Result, UnaryOperation Op);]]></pre>
263                 </section>
264         </section>
265 </section>
Note: See TracBrowser for help on using the browser.