1/** \file
2 * \brief Tests for ogdf::EdgeArray
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 bandit;
35
36go_bandit([]() {
37 auto chooseEdge = [](const Graph &graph) {
38 return graph.chooseEdge();
39 };
40
41 auto allEdges = [](const Graph &graph, List<edge> &list) {
42 graph.allEdges(list);
43 };
44
45 auto createEdge = [](Graph &graph) {
46 return graph.newEdge(graph.chooseNode(), graph.chooseNode());
47 };
48
49 describeArray<EdgeArray, edge, int>("EdgeArray filled with ints", 42, 43, chooseEdge, allEdges, createEdge);
50 describeArray<EdgeArray, edge, List<int>>("EdgeArray filled with lists of ints", {1, 2, 3}, {42}, chooseEdge, allEdges, createEdge);
51});
52