Classes

Class	Line #	Total Statements	Complexity	TOTAL Coverage	Actions
BackMatch	15	15	10	0.00%	Show methods

Class BackMatch

Class BackMatch	Line # 15	Total Statements 15	Complexity 10	TOTAL Coverage 0.00%
BackMatch(int)   BackMatch(int)	1919	1.01	1.01	0.0 0.00%
toString() : String   toString() : String	2424	1.01	1.01	0.0 0.00%
matchInternal(int,Pthings) : int   matchInternal(int,Pthings) : int	2929	12.012	7.07	0.0 0.00%
clone1(Hashtable) : Pattern   clone1(Hashtable) : Pattern	5353	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		* Provides the ability to match a backreference from within a Pattern.
14		*/
		0% Uncovered Elements: 27 (27) Complexity: 10 Complexity Density: 0.67
15		class BackMatch extends Pattern
16		{
17		int id;
18
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
19	0	BackMatch(int id)...
20		{
21	0	this.id = id;
22		}
23
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
24	0	public String toString()...
25		{
26	0	return "\\" + (id) + nextString();
27		}
28
		0% Uncovered Elements: 20 (20) Complexity: 7 Complexity Density: 0.58
29	0	public int matchInternal(int pos, Pthings p)...
30		{
31	0	int i1 = p.marks[id];
32	0	int i2 = p.marks[id + p.nMarks];
33	0	int imax = i2 - i1;
34	0	if (i1 < 0 || imax < 0 || pos + imax > p.src.length())
35		{
36	0	return -1;
37		}
38	0	int ns = p.src.length() - pos;
39	0	if (imax < ns)
40		{
41	0	ns = imax;
42		}
43	0	for (int i = 0; i < ns; i++)
44		{
45	0	if (p.src.charAt(i + i1) != p.src.charAt(pos + i))
46		{
47	0	return -1;
48		}
49		}
50	0	return nextMatch(pos + imax, p);
51		}
52
		0% Uncovered Elements: 1 (1) Complexity: 1 Complexity Density: 1
53	0	Pattern clone1(Hashtable h)...
54		{
55	0	return new BackMatch(id);
56		}
57		}