Classes

Class	Line #	Total Statements	Complexity	TOTAL Coverage	Actions
Backup	17	8	8	0.00%	Show methods

Class Backup

Class Backup	Line # 17	Total Statements 8	Complexity 8	TOTAL Coverage 0.00%
Backup(int)   Backup(int)	2121	1.01	1.01	0.0 0.00%
toString() : String   toString() : String	2626	1.01	2.02	0.0 0.00%
matchInternal(int,Pthings) : int   matchInternal(int,Pthings) : int	3131	3.03	2.02	0.0 0.00%
minChars() : patInt   minChars() : patInt	4040	1.01	1.01	0.0 0.00%
maxChars() : patInt   maxChars() : patInt	4545	1.01	1.01	0.0 0.00%
clone1(Hashtable) : Pattern   clone1(Hashtable) : Pattern	5050	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. It also allows
15		* (?>number).
16		*/
		0% Uncovered Elements: 18 (18) Complexity: 8 Complexity Density: 1
17		class Backup extends Pattern
18		{
19		int bk;
20
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
21	0	Backup(int ii)...
22		{
23	0	bk = ii;
24		}
25
		0% Uncovered Elements: 3 (3) Complexity: 2 Complexity Density: 2
26	0	public String toString()...
27		{
28	0	return "(?" + (bk < 0 ? ">" + (-bk) : "<" + bk) + ")" + nextString();
29		}
30
		0% Uncovered Elements: 5 (5) Complexity: 2 Complexity Density: 0.67
31	0	public int matchInternal(int pos, Pthings pt)...
32		{
33	0	if (pos < bk)
34		{
35	0	return -1;
36		}
37	0	return nextMatch(pos - bk, pt);
38		}
39
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
40	0	public patInt minChars()...
41		{
42	0	return new patInt(-bk);
43		}
44
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
45	0	public patInt maxChars()...
46		{
47	0	return new patInt(-bk);
48		}
49
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
50	0	public Pattern clone1(Hashtable h)...
51		{
52	0	return new Backup(bk);
53		}
54		};