Coverage Report - net.sf.jmatchparser.template.engine.operation.MatchAnyOperation
 
Classes in this File Line Coverage Branch Coverage Complexity
MatchAnyOperation
92%
23/25
70%
7/10
5
 
 1  
 /*
 2  
  * Copyright (c) 2006 - 2011 Michael Schierl
 3  
  * All rights reserved.
 4  
  * 
 5  
  * This program is free software: you can redistribute it and/or modify
 6  
  * it under the terms of the GNU General Public License as published by
 7  
  * the Free Software Foundation, either version 2 of the License, or
 8  
  * (at your option) any later version.
 9  
  * 
 10  
  * This program is distributed in the hope that it will be useful,
 11  
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
 12  
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 13  
  * GNU General Public License for more details.
 14  
  * 
 15  
  * You should have received a copy of the GNU General Public License
 16  
  * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 17  
  */
 18  
 package net.sf.jmatchparser.template.engine.operation;
 19  
 
 20  
 import java.util.regex.Matcher;
 21  
 
 22  
 import net.sf.jmatchparser.template.engine.ParserState;
 23  
 import net.sf.jmatchparser.template.engine.parameter.Parameter;
 24  
 import net.sf.jmatchparser.util.PatternCache;
 25  
 
 26  
 public class MatchAnyOperation extends Operation {
 27  
 
 28  
         private final Parameter parameter;
 29  
         private final Label nextInstruction;
 30  
 
 31  
         public MatchAnyOperation(String templatePosition, Parameter parameter, Label nextInstruction) {
 32  23
                 super(templatePosition);
 33  23
                 this.parameter = parameter;
 34  23
                 this.nextInstruction = nextInstruction;
 35  23
         }
 36  
 
 37  
         @Override
 38  
         public OperationResult execute(ParserState state) {
 39  27
                 String regex = parameter.getRegex(state);
 40  
                 boolean success;
 41  27
                 boolean enqueued = false;
 42  
                 Matcher m;
 43  
 
 44  27
                 CharSequence rest = regex.contains("\n") ? state.getRest() : state.getFirstLine();
 45  27
                 if (rest == null)
 46  0
                         rest = "";
 47  
                 while (true) {
 48  54
                         m = PatternCache.compile("^" + regex).matcher(rest);
 49  54
                         success = m.find();
 50  54
                         if (!success)
 51  27
                                 break;
 52  27
                         if (m.start() != 0)
 53  0
                                 throw new RuntimeException();
 54  27
                         ParserState newState = new ParserState(state, nextInstruction.getDestination());
 55  27
                         parameter.applyMatch(newState, m);
 56  27
                         newState.discardCharacters(m.end());
 57  27
                         enqueued = true;
 58  27
                         state.getParser().enqueueState(newState);
 59  27
                         rest = rest.subSequence(0, m.end() - 1);
 60  27
                 }
 61  27
                 if (enqueued) {
 62  19
                         return OperationResult.DIE;
 63  
                 } else {
 64  8
                         return OperationResult.FAIL;
 65  
                 }
 66  
         }
 67  
 }