File: accumulate.yo

package info (click to toggle)
c%2B%2B-annotations 13.02.02-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 13,576 kB
  • sloc: cpp: 25,297; makefile: 1,523; ansic: 165; sh: 126; perl: 90; fortran: 27
file content (29 lines) | stat: -rw-r--r-- 1,268 bytes parent folder | download | duplicates (2)
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
    hi(accumulate)
    itemization(
    it() Header file: tt(<numeric>)
    it() Function prototypes:
        itemization(
        itt(Type accumulate(InputIterator first, InputIterator last,
            Type init);)
        itt(Type accumulate(InputIterator first, InputIterator
            last, Type init, BinaryOperation op);)
        )
    it() Description:
        itemization(
        it() The first prototype: ti(operator+) is applied to the initial
value tt(init) (lhs argument) and, in sequence, all elements reached from
the iterator range (rhs argument). The resulting value is returned.
        it() The second prototype: the binary operator tt(op) is applied to
the initial value tt(init) (lhs argument) and, in sequence, all elements
reached from the iterator range. The resulting value is returned.
        )
       At each step the initial value receives the result of that step's
        computation. E.g., if tt(minus<int>) is used with the intial value 1,
        and the iterators refer to 2 and 3, then at step 1: 1 - 2 = -1 is
        computed and at step 2: -1 - 3 = -4. So tt(accumulate) returns -4.

       (See also the tt(reduce) algorithm (section ref(REDUCE))).

        it() Example:
        verbinclude(-a examples/accumulate.cc)
    )