X-Git-Url: https://git.opendaylight.org/gerrit/gitweb?a=blobdiff_plain;f=opendaylight%2Fsal%2Fyang-prototype%2Fcode-generator%2Fyang-model-parser-impl%2Fsrc%2Ftest%2Fjava%2Forg%2Fopendaylight%2Fcontroller%2Fyang%2Fmodel%2Fparser%2Futil%2FTopologicalSortTest.java;fp=opendaylight%2Fsal%2Fyang-prototype%2Fcode-generator%2Fyang-model-parser-impl%2Fsrc%2Ftest%2Fjava%2Forg%2Fopendaylight%2Fcontroller%2Fyang%2Fmodel%2Fparser%2Futil%2FTopologicalSortTest.java;h=0000000000000000000000000000000000000000;hb=8992ae54ecd2c79e0d93d0904962c5f32f3bb33a;hp=bfb94e530c7c16a317c16998f10ab4ea7b530a12;hpb=e8c736d30bc80ba229a1b6d35802e05c2ffe3a78;p=controller.git diff --git a/opendaylight/sal/yang-prototype/code-generator/yang-model-parser-impl/src/test/java/org/opendaylight/controller/yang/model/parser/util/TopologicalSortTest.java b/opendaylight/sal/yang-prototype/code-generator/yang-model-parser-impl/src/test/java/org/opendaylight/controller/yang/model/parser/util/TopologicalSortTest.java deleted file mode 100644 index bfb94e530c..0000000000 --- a/opendaylight/sal/yang-prototype/code-generator/yang-model-parser-impl/src/test/java/org/opendaylight/controller/yang/model/parser/util/TopologicalSortTest.java +++ /dev/null @@ -1,72 +0,0 @@ -/* - * Copyright (c) 2013 Cisco Systems, Inc. and others. All rights reserved. - * - * This program and the accompanying materials are made available under the - * terms of the Eclipse Public License v1.0 which accompanies this distribution, - * and is available at http://www.eclipse.org/legal/epl-v10.html - */ -package org.opendaylight.controller.yang.model.parser.util; - -import static org.hamcrest.core.Is.*; -import static org.junit.Assert.*; - -import java.util.List; -import java.util.Set; - -import org.junit.Test; -import org.opendaylight.controller.yang.model.parser.util.TopologicalSort.Node; -import org.opendaylight.controller.yang.model.parser.util.TopologicalSort.NodeImpl; - -import com.google.common.collect.Sets; - -public class TopologicalSortTest { - - @Test(expected = IllegalStateException.class) - public void test() throws Exception { - Set nodes = Sets.newHashSet(); - - NodeImpl node1 = new NodeImpl(); - nodes.add(node1); - NodeImpl node2 = new NodeImpl(); - nodes.add(node2); - NodeImpl node3 = new NodeImpl(); - nodes.add(node3); - - node1.addEdge(node2); - node2.addEdge(node3); - node3.addEdge(node1); - - try { - TopologicalSort.sort(nodes); - } catch (IllegalStateException e) { - throw e; - } - } - - @Test - public void testValidSimple() throws Exception { - Set nodes = Sets.newHashSet(); - - Node node1 = new NodeImpl(); - nodes.add(node1); - Node node2 = new NodeImpl(); - nodes.add(node2); - Node node3 = new NodeImpl(); - nodes.add(node3); - Node node4 = new NodeImpl(); - nodes.add(node4); - - ((NodeImpl) node1).addEdge(node2); - ((NodeImpl) node1).addEdge(node3); - ((NodeImpl) node2).addEdge(node4); - ((NodeImpl) node3).addEdge(node2); - - List sorted = TopologicalSort.sort(nodes); - - assertThat(sorted.get(0), is(node4)); - assertThat(sorted.get(1), is(node2)); - assertThat(sorted.get(2), is(node3)); - assertThat(sorted.get(3), is(node1)); - } - -}