1<?php
2
3/**
4 * Hoa
5 *
6 *
7 * @license
8 *
9 * New BSD License
10 *
11 * Copyright © 2007-2017, Hoa community. All rights reserved.
12 *
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions are met:
15 *     * Redistributions of source code must retain the above copyright
16 *       notice, this list of conditions and the following disclaimer.
17 *     * Redistributions in binary form must reproduce the above copyright
18 *       notice, this list of conditions and the following disclaimer in the
19 *       documentation and/or other materials provided with the distribution.
20 *     * Neither the name of the Hoa nor the names of its contributors may be
21 *       used to endorse or promote products derived from this software without
22 *       specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37namespace Hoa\Iterator\Test\Unit;
38
39use Hoa\Iterator as LUT;
40use Hoa\Test;
41
42/**
43 * Class \Hoa\Iterator\Test\Unit\Append.
44 *
45 * Test suite of the repeater iterator.
46 *
47 * @copyright  Copyright © 2007-2017 Hoa community
48 * @license    New BSD License
49 */
50class Append extends Test\Unit\Suite
51{
52    public function case_classic()
53    {
54        $this
55            ->given(
56                $counter1 = new LUT\Counter(0, 12, 3),
57                $counter2 = new LUT\Counter(13, 23, 2),
58                $append   = new LUT\Append(),
59                $append->append($counter1),
60                $append->append($counter2)
61            )
62            ->when($result = iterator_to_array($append, false))
63            ->then
64                ->array($result)
65                    ->isEqualTo([
66                        0,
67                        3,
68                        6,
69                        9,
70                        13,
71                        15,
72                        17,
73                        19,
74                        21
75                    ]);
76    }
77
78    public function case_singleton()
79    {
80        $this
81            ->given(
82                $counter1 = new LUT\Counter(0, 12, 3),
83                $append   = new LUT\Append(),
84                $append->append($counter1)
85            )
86            ->when($result = iterator_to_array($append))
87            ->then
88                ->array($result)
89                    ->isEqualTo([
90                        0,
91                        3,
92                        6,
93                        9
94                    ]);
95    }
96
97    public function case_empty()
98    {
99        $this
100            ->given($append = new LUT\Append())
101            ->when($result = iterator_to_array($append))
102            ->then
103                ->array($result)
104                    ->isEmpty();
105    }
106}
107