Classes

Class	Line #	Total Statements	Complexity	TOTAL Coverage	Actions
Skipped	16	8	8	0.00%	Show methods

Class Skipped

Class Skipped	Line # 16	Total Statements 8	Complexity 8	TOTAL Coverage 0.00%
Skipped(String)   Skipped(String)	2020	1.01	1.01	0.0 0.00%
toString() : String   toString() : String	2525	1.01	1.01	0.0 0.00%
matchInternal(int,Pthings) : int   matchInternal(int,Pthings) : int	3030	3.03	3.03	0.0 0.00%
minChars() : patInt   minChars() : patInt	4141	1.01	1.01	0.0 0.00%
maxChars() : patInt   maxChars() : patInt	4646	1.01	1.01	0.0 0.00%
clone1(Hashtable) : Pattern   clone1(Hashtable) : Pattern	5151	1.01	1.01	0.0 0.00%

 

Contributing tests

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		* Implements the (?<number) Pattern, where number is an integer telling us
14		* how far to back up in the Pattern. Not in perl 5.
15		*/
		0% Uncovered Elements: 16 (16) Complexity: 8 Complexity Density: 1
16		class Skipped extends Pattern
17		{
18		String s;
19
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
20	0	Skipped(String s)...
21		{
22	0	this.s = s;
23		}
24
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
25	0	public String toString()...
26		{
27	0	return s + nextString();
28		}
29
		0% Uncovered Elements: 5 (5) Complexity: 3 Complexity Density: 1
30	0	public int matchInternal(int pos, Pthings pt)...
31		{
32		// if(pt.no_check || s.regionMatches(pt.ignoreCase,0,pt.src,pos,s.length()))
33	0	if (pt.no_check || CaseMgr.regionMatches(s, pt.ignoreCase, 0, pt.src,
34		pos, s.length()))
35		{
36	0	return nextMatch(pos + s.length(), pt);
37		}
38	0	return -1;
39		}
40
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
41	0	public patInt minChars()...
42		{
43	0	return new patInt(s.length());
44		}
45
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
46	0	public patInt maxChars()...
47		{
48	0	return new patInt(s.length());
49		}
50
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
51	0	Pattern clone1(Hashtable h)...
52		{
53	0	return new Skipped(s);
54		}
55		};