Classes

Class	Line #	Total Statements	% Filtered	Complexity	Uncovered Elements	TOTAL Coverage	Actions
LogTreeTest	33	31	0%	2	0	1.0100%	Show methods

Class LogTreeTest

Class LogTreeTest	Line # 33	Total Statements 31	% Filtered 0%	Complexity 2	Uncovered Elements 0	TOTAL Coverage 1.0100%
testTwoLevel0() : void   testTwoLevel0() : void	3535	5.05	0.00%	1.01	0.00	1.0 1.0100%
test3Levels() : void   test3Levels() : void	4747	26.026	0.00%	1.01	0.00	1.0 1.0100%

 

Contributing tests

Contributing tests

Select all

	Test contribution	Test	Result	Actions
	0.8181818	org.xwiki.logging.LogTreeTest.test3Levelsorg.xwiki.logging.LogTreeTest.test3Levels	1PASS
	0.18181819	org.xwiki.logging.LogTreeTest.testTwoLevel0org.xwiki.logging.LogTreeTest.testTwoLevel0	1PASS

 

Source view

1		/*
2		* See the NOTICE file distributed with this work for additional
3		* information regarding copyright ownership.
4		*
5		* This is free software; you can redistribute it and/or modify it
6		* under the terms of the GNU Lesser General Public License as
7		* published by the Free Software Foundation; either version 2.1 of
8		* the License, or (at your option) any later version.
9		*
10		* This software is distributed in the hope that it will be useful,
11		* but WITHOUT ANY WARRANTY; without even the implied warranty of
12		* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13		* Lesser General Public License for more details.
14		*
15		* You should have received a copy of the GNU Lesser General Public
16		* License along with this software; if not, write to the Free
17		* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
18		* 02110-1301 USA, or see the FSF site: http://www.fsf.org.
19		*/
20		package org.xwiki.logging;
21
22		import java.util.Iterator;
23
24		import org.junit.Assert;
25		import org.junit.Test;
26		import org.xwiki.logging.event.LogEvent;
27
28		/**
29		* Test {@link LogTree}.
30		*
31		* @version $Id: e98a9a960c142ec65035832e482c1bc7ce7735b3 $
32		*/
		100% Uncovered Elements: 0 (33) Complexity: 2 Complexity Density: 0.06
33		public class LogTreeTest
34		{
		100% Uncovered Elements: 0 (5) Complexity: 1 Complexity Density: 0.2 1PASS
35	1	@Test...
36		public void testTwoLevel0()
37		{
38	1	LogTree logTree = new LogTree();
39
40	1	logTree.error("message1");
41	1	logTree.error("message2");
42
43	1	Assert.assertEquals(2, logTree.size(false));
44	1	Assert.assertEquals(2, logTree.size(true));
45		}
46
		100% Uncovered Elements: 0 (26) Complexity: 1 Complexity Density: 0.04 1PASS
47	1	@Test...
48		public void test3Levels()
49		{
50	1	LogTree logTree = new LogTree();
51
52	1	logTree.error(LogEvent.MARKER_BEGIN, "begin1");
53	1	logTree.error("message11");
54	1	logTree.error(LogEvent.MARKER_BEGIN, "begin12");
55	1	logTree.error("message121");
56	1	logTree.error("message122");
57	1	logTree.error(LogEvent.MARKER_END, "end12");
58	1	logTree.error(LogEvent.MARKER_END, "end1");
59
60	1	logTree.error(LogEvent.MARKER_BEGIN, "begin2");
61	1	logTree.error("message21");
62	1	logTree.error(LogEvent.MARKER_BEGIN, "begin22");
63	1	logTree.error("message221");
64	1	logTree.error("message222");
65	1	logTree.error(LogEvent.MARKER_END, "end22");
66	1	logTree.error(LogEvent.MARKER_END, "end2");
67
68	1	Assert.assertEquals(2, logTree.size(false));
69	1	Assert.assertEquals(14, logTree.size(true));
70
71	1	Iterator<LogEvent> iterator0 = logTree.iterator();
72
73	1	LogTreeNode node1 = (LogTreeNode) iterator0.next();
74
75	1	Assert.assertEquals(3, node1.size(false));
76	1	Assert.assertEquals(6, node1.size(true));
77
78	1	Iterator<LogEvent> iterator1 = node1.iterator();
79
80	1	iterator1.next();
81
82	1	LogTreeNode node11 = (LogTreeNode) iterator1.next();
83
84	1	Assert.assertEquals(3, node11.size(false));
85	1	Assert.assertEquals(3, node11.size(true));
86		}
87		}