jcs.org
Serenity Operating System
1/*
2 * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are met:
7 *
8 * 1. Redistributions of source code must retain the above copyright notice, this
9 * list of conditions and the following disclaimer.
10 *
11 * 2. Redistributions in binary form must reproduce the above copyright notice,
12 * this list of conditions and the following disclaimer in the documentation
13 * and/or other materials provided with the distribution.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
18 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
19 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
21 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
22 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
23 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 */
26
27#include <AK/TestSuite.h>
28
29#include <AK/String.h>
30#include <AK/Queue.h>
31
32TEST_CASE(construct)
33{
34 EXPECT(Queue<int>().is_empty());
35 EXPECT(Queue<int>().size() == 0);
36}
37
38TEST_CASE(populate_int)
39{
40 Queue<int> ints;
41 ints.enqueue(1);
42 ints.enqueue(2);
43 ints.enqueue(3);
44 EXPECT_EQ(ints.size(), 3u);
45 EXPECT_EQ(ints.dequeue(), 1);
46 EXPECT_EQ(ints.size(), 2u);
47 EXPECT_EQ(ints.dequeue(), 2);
48 EXPECT_EQ(ints.size(), 1u);
49 EXPECT_EQ(ints.dequeue(), 3);
50 EXPECT_EQ(ints.size(), 0u);
51}
52
53TEST_CASE(populate_string)
54{
55 Queue<String> strings;
56 strings.enqueue("ABC");
57 strings.enqueue("DEF");
58 EXPECT_EQ(strings.size(), 2u);
59 EXPECT_EQ(strings.dequeue(), "ABC");
60 EXPECT_EQ(strings.dequeue(), "DEF");
61 EXPECT(strings.is_empty());
62}
63
64TEST_CASE(order)
65{
66 Queue<String> strings;
67 EXPECT(strings.is_empty());
68
69 for (size_t i = 0; i < 10000; ++i) {
70 strings.enqueue(String::number(i));
71 EXPECT_EQ(strings.size(), i + 1);
72 }
73
74 for (int i = 0; i < 10000; ++i) {
75 bool ok;
76 EXPECT_EQ(strings.dequeue().to_int(ok), i);
77 }
78
79 EXPECT(strings.is_empty());
80}
81
82TEST_MAIN(Queue)