Clover icon

Coverage Report

  1. Project Clover database Mon Sep 2 2024 17:57:51 BST
  2. Package com.stevesoft.pat

File FastMulti.java

 

Coverage histogram

../../../img/srcFileCovDistChart7.png
29% of files have more coverage

Code metrics

38
64
6
1
170
148
27
0.42
10.67
6
4.5

Classes

Class Line # Actions
FastMulti 17 64 27
0.638888963.9%
 

Contributing tests

This file is covered by 85 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    * A special case of Multi, implemented when minChars().equals(maxChars()), and
14    * some other conditions spelled out in RegOpt.safe4fm "Safe for FastMulti." It
15    * avoids stack growth problems as well as being slightly faster.
16    */
 
17    class FastMulti extends PatternSub
18    {
19    patInt fewestMatches, mostMatches;
20   
 
21  321 toggle public patInt minChars()
22    {
23  321 return sub.countMinChars().mul(fewestMatches);
24    }
25   
 
26  321 toggle public patInt maxChars()
27    {
28  321 return sub.countMaxChars().mul(mostMatches);
29    }
30   
31    public boolean matchFewest = false;
32   
 
33  5004 toggle FastMulti(patInt a, patInt b, Pattern p) throws RegSyntax
34    {
35  5004 if (p == null)
36    {
37  0 RegSyntaxError.endItAll(
38    "Null length pattern " + "followed by *, +, or other Multi.");
39    }
40  5004 fewestMatches = a;
41  5004 mostMatches = b;
42  5004 sub = p;
43  5004 step = p.countMinChars().intValue();
44  5004 sub.setParent(null);
45    }
46   
 
47  0 toggle public String toString()
48    {
49  0 return sub.toString() + "{" + fewestMatches + "," + mostMatches + "}"
50  0 + (matchFewest ? "?" : "") + "(?# <= fast multi)"
51    + nextString();
52    }
53   
54    int step = -1;
55   
 
56  43503 toggle public int matchInternal(int pos, Pthings pt)
57    {
58  43503 int m = -1;
59  43503 int i = pos;
60  43503 int endstr = pt.src.length() - step;
61  43503 patInt matches = new patInt(0);
62  43503 if (matchFewest)
63    {
64  0 if (fewestMatches.lessEq(matches))
65    {
66  0 int ii = nextMatch(i, pt);
67  0 if (ii >= 0)
68    {
69  0 return ii;
70    }
71    }
72  0 while (i >= 0 && i <= endstr)
73    {
74  0 i = sub.matchInternal(i, pt);
75  0 if (i >= 0)
76    {
77  0 matches.inc();
78  0 if (fewestMatches.lessEq(matches))
79    {
80  0 int ii = nextMatch(i, pt);
81  0 if (ii >= 0)
82    {
83  0 return ii;
84    }
85    }
86  0 if (matches.equals(mostMatches))
87    {
88  0 return -1;
89    }
90    }
91    }
92  0 return -1;
93    }
94  43503 int nMatches = 0;
95  61180 while (fewestMatches.intValue() > nMatches)
96    {
97  21679 i = sub.matchInternal(i, pt);
98  21679 if (i >= 0)
99    {
100  17677 nMatches++;
101    }
102    else
103    {
104  4002 return -1;
105    }
106    }
107  39501 m = i;
108  39501 if (mostMatches.finite())
109    {
110  3175 while (nMatches < mostMatches.intValue())
111    {
112  1573 i = sub.matchInternal(i, pt);
113  1573 if (i >= 0)
114    {
115  1552 m = i;
116  1552 nMatches++;
117    }
118    else
119    {
120  21 break;
121    }
122    }
123    }
124    else
125    {
126  37878 while (true)
127    {
128  243988 i = sub.matchInternal(i, pt);
129  243988 if (i >= 0)
130    {
131  206110 m = i;
132  206110 nMatches++;
133    }
134    else
135    {
136  37878 break;
137    }
138    }
139    }
140  72494 while (m >= pos)
141    {
142  72494 int r = nextMatch(m, pt);
143  72494 if (r >= 0)
144    {
145  14960 return r;
146    }
147  57534 m -= step;
148  57534 nMatches--;
149  57534 if (nMatches < fewestMatches.intValue())
150    {
151  24541 return -1;
152    }
153    }
154  0 return -1;
155    }
156   
 
157  1176 toggle public Pattern clone1(Hashtable h)
158    {
159  1176 try
160    {
161  1176 FastMulti fm = new FastMulti(fewestMatches, mostMatches,
162    sub.clone(h));
163  1176 fm.matchFewest = matchFewest;
164  1176 return fm;
165    } catch (RegSyntax rs)
166    {
167  0 return null;
168    }
169    }
170    }
  • Report generated by OpenClover v 4.4.1 on Mon Sep 2 2024 18:05:00 BST using coverage data from Mon Sep 2 2024 18:04:45 BST.
  • OpenClover is free and open-source software.