File: copy_n.qbk

package info (click to toggle)
boost1.90 1.90.0-1
  • links: PTS, VCS
  • area: main
  • in suites:
  • size: 593,120 kB
  • sloc: cpp: 4,190,908; xml: 196,648; python: 34,618; ansic: 23,145; asm: 5,468; sh: 3,774; makefile: 1,161; perl: 1,020; sql: 728; ruby: 676; yacc: 478; java: 77; lisp: 24; csh: 6
file content (37 lines) | stat: -rw-r--r-- 1,076 bytes parent folder | download | duplicates (15)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
[/
    Copyright 2010 Neil Groves
    Distributed under the Boost Software License, Version 1.0.
    (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
/]
[section:copy_n copy_n]

[heading Prototype]

``
template<class SinglePassRange, class Size, class OutputIterator>
OutputIterator copy_n(const SinglePassRange& rng, Size n, OutputIterator out);
``

[heading Description]

`copy_n` is provided to completely replicate the standard algorithm header,
it is preferable to use Range Adaptors and the extension functions to achieve
the same result with greater safety.

`copy_n` copies elements from `[boost::begin(rng), boost::begin(rng) + n)` to the range `[out, out + n)`

[heading Definition]

Defined in the header file `boost/range/algorithm_ext/copy_n.hpp`

[heading Requirements]

# `SinglePassRange` is a model of the __single_pass_range__ Concept.
# `Size` is a model of the `Integer` Concept.
# `OutputIterator` is a model of the `OutputIteratorConcept`.

[heading Complexity]

Linear. Exactly `n` elements are copied.

[endsect]