public void C10_rootContainsTest() { ContainsNode root = new ContainsNode("root", null, true); Assert.AreNotEqual(null, root); Assert.AreEqual(0, root.getNbDocuments()); Assert.AreEqual(null, root.next()); Assert.AreEqual("root", root.getName()); Assert.AreEqual(null, root.getParent()); }
public void C12_treeNbDocumentsTest() { ContainsNode root = new ContainsNode("root", null, true); ContainsNode n1 = root.addNewNode("n1", true); ContainsNode n11 = n1.addNewNode("n11", true); n11.incNbDocs(2); ContainsNode n12 = n1.addNewNode("n12", true); n11.incNbDocs(1); ContainsNode n2 = root.addNewNode("n2", true); n2.incNbDocs(1); ContainsNode n21 = n2.addNewNode("n21", true); n21.incNbDocs(5); ContainsNode n22 = n2.addNewNode("n22", true); Assert.AreEqual(9, root.computeNbDocuments(), "root.computeNbDocuments()"); Assert.AreEqual(9, root.getNbDocuments(), "root.getNbDocuments()"); int nbNodes = 1; // Au moins root ContainsNode node = root; while ((node = node.next()) != null) { nbNodes++; } Assert.AreEqual(7, nbNodes, "next()"); }
public void C14_treeNonMandatoryAndEmptyTest() { ContainsNode root = new ContainsNode("root", null, true); ContainsNode n1 = root.addNewNode("n1", true); ContainsNode n11 = n1.addNewNode("n11", false); ContainsNode n12 = n1.addNewNode("n12", true); n11.incNbDocs(1); ContainsNode n2 = root.addNewNode("n2", false); ContainsNode n21 = n2.addNewNode("n21", true); ContainsNode n22 = n2.addNewNode("n22", true); Assert.AreEqual(1, root.computeNbDocuments(), "root.computeNbDocuments()"); Assert.AreEqual(1, root.getNbDocuments(), "root.getNbDocuments()"); root.trunkChildrenOfEmptyBranches(); int nbNodes = 1; // Au moins root ContainsNode node = root; while ((node = node.next()) != null) { nbNodes++; } Assert.AreEqual(5, nbNodes, "next()"); }