Classes

Class	Line #	Total Statements	Complexity	TOTAL Coverage	Actions
Multi	19	20	8	0.550%	Show methods

Class Multi

Class Multi	Line # 19	Total Statements 20	Complexity 8	TOTAL Coverage 0.550%
minChars() : patInt   minChars() : patInt	2323	1.01	1.01	0.0 0.00%
maxChars() : patInt   maxChars() : patInt	2828	1.01	1.01	0.0 0.00%
Multi(patInt,patInt,Pattern)   Multi(patInt,patInt,Pattern)	4949	6.06	1.01	1.0 1.0100%
toString() : String   toString() : String	5959	2.02	1.01	0.0 0.00%
matchInternal(int,Pthings) : int   matchInternal(int,Pthings) : int	6565	5.05	2.02	1.0 1.0100%
clone1(Hashtable) : Pattern   clone1(Hashtable) : Pattern	7878	5.05	2.02	0.0 0.00%

 

Contributing tests

Contributing tests

Select all

	Test contribution	Test	Result	Actions
	0.5	jalview.io.NewickFileTests.testTreeIOjalview.io.NewickFileTests.testTreeIO	1PASS
	0.5	jalview.io.NewickFileTests.testTreeIOjalview.io.NewickFileTests.testTreeIO	1PASS

 

Source view

1		//
2		// This software is now distributed according to
3		// the Lesser Gnu Public License. Please see
4		// http://www.gnu.org/copyleft/lesser.txt for
5		// the details.
6		// -- Happy Computing!
7		//
8		package com.stevesoft.pat;
9
10		import java.util.Hashtable;
11
12		/**
13		* Matches any number of instances of sub Pattern this was the hardest method to
14		* write. It implements '+', '*', '?', "{0,10}", "{5,}", "{5}", etc.
15		*
16		* @see pat.Multi_stage2
17		* @see pat.MultiMin
18		*/
		50% Uncovered Elements: 13 (26) Complexity: 8 Complexity Density: 0.4
19		class Multi extends PatternSub
20		{
21		patInt a, b;
22
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
23	0	public patInt minChars()...
24		{
25	0	return a.mul(p.countMinChars());
26		}
27
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
28	0	public patInt maxChars()...
29		{
30	0	return b.mul(p.countMaxChars());
31		}
32
33		Pattern p;
34
35		Multi_stage2 st2;
36
37		public boolean matchFewest = false;
38
39		/**
40		* @param a
41		* The fewest number of times the sub pattern can match.
42		* @param b
43		* The maximum number of times the sub pattern can match.
44		* @param p
45		* The sub pattern.
46		* @see Multi_stage2
47		* @see MultiMin
48		*/
		100% Uncovered Elements: 0 (6) Complexity: 1 Complexity Density: 0.17
49	8	public Multi(patInt a, patInt b, Pattern p) throws RegSyntax...
50		{
51	8	this.a = a;
52	8	this.b = b;
53	8	this.p = p;
54	8	st2 = new Multi_stage2(a, b, p);
55	8	st2.parent = this;
56	8	sub = st2.sub;
57		}
58
		0% Uncovered Elements: 2 (2) Complexity: 1 Complexity Density: 0.5
59	0	public String toString()...
60		{
61	0	st2.matchFewest = matchFewest;
62	0	return st2.toString();
63		}
64
		100% Uncovered Elements: 0 (5) Complexity: 2 Complexity Density: 0.4
65	8	public int matchInternal(int pos, Pthings pt)...
66		{
67	8	try
68		{
69	8	st2 = new Multi_stage2(a, b, p);
70		} catch (RegSyntax r__)
71		{
72		}
73	8	st2.matchFewest = matchFewest;
74	8	st2.parent = this;
75	8	return st2.matchInternal(pos, pt);
76		}
77
		0% Uncovered Elements: 5 (5) Complexity: 2 Complexity Density: 0.4
78	0	public Pattern clone1(Hashtable h)...
79		{
80	0	try
81		{
82	0	Multi m = new Multi(a, b, ((Pattern) p).clone(h));
83	0	m.matchFewest = matchFewest;
84	0	return m;
85		} catch (RegSyntax rs)
86		{
87	0	return null;
88		}
89		}
90		};