1/** \file
2 * \brief Tests for ogdf::NodeArray
3 *
4 * \author Mirko Wagner, Tilo Wiedera
5 *
6 * \par License:
7 * This file is part of the Open Graph Drawing Framework (OGDF).
8 *
9 * \par
10 * Copyright (C)<br>
11 * See README.md in the OGDF root directory for details.
12 *
13 * \par
14 * This program is free software; you can redistribute it and/or
15 * modify it under the terms of the GNU General Public License
16 * Version 2 or 3 as published by the Free Software Foundation;
17 * see the file LICENSE.txt included in the packaging of this file
18 * for details.
19 *
20 * \par
21 * This program is distributed in the hope that it will be useful,
22 * but WITHOUT ANY WARRANTY; without even the implied warranty of
23 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
24 * GNU General Public License for more details.
25 *
26 * \par
27 * You should have received a copy of the GNU General Public
28 * License along with this program; if not, see
29 * http://www.gnu.org/copyleft/gpl.html
30 */
31#include "array_helper.h"
32
33using namespace ogdf;
34using namespace snowhouse;
35using namespace bandit;
36
37go_bandit([]() {
38 auto chooseNode = [](const Graph &graph) {
39 return graph.chooseNode();
40 };
41
42 auto allNodes = [](const Graph &graph, List<node> &list) {
43 graph.allNodes(list);
44 };
45
46 auto createNode = [](Graph &graph) {
47 return graph.newNode();
48 };
49
50 describeArray<NodeArray, node, int>("NodeArray filled with ints", 42, 43, chooseNode, allNodes, createNode);
51 describeArray<NodeArray, node, List<int>>("NodeArray filled with lists of ints", {1, 2, 3}, {42}, chooseNode, allNodes, createNode);
52});
53