
com.mifmif.common.regex.GenerexIterator Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of generex Show documentation
Show all versions of generex Show documentation
Generex Library for Strings generation based on RegExp
The newest version!
/**
* Copyright 2014 y.mifrah
*
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.mifmif.common.regex;
import java.util.Stack;
import com.mifmif.common.regex.util.Iterator;
import dk.brics.automaton.State;
/**
* An implementation of {@code Iterator} class that iterate over the list of
* Strings that matches a given Regex.
*
* @author y.mifrah
*
*/
public class GenerexIterator implements Iterator {
Stack transitionsPath = new Stack();
String currentValue = "";
public GenerexIterator(State initialState) {
TransitionLevel initialLevel = new TransitionLevel(initialState);
transitionsPath.add(initialLevel);
}
public boolean hasNext() {
return !transitionsPath.isEmpty();
}
public String next() {
while (!transitionsPath.isEmpty()) {
TransitionLevel currentLevel = transitionsPath.peek();
State state = currentLevel.getState();
if (!state.isAccept()) {
addNextTransitionLevel(currentLevel);
continue;
} else {
currentValue = "";
for (int i = 0; i < transitionsPath.size() - 1; ++i) {
TransitionLevel transitionLevel = transitionsPath.get(i);
currentValue += transitionLevel.getCurrentChar();
}
jumpToNextPath();
break;
}
}
return currentValue;
}
private void jumpToNextPath() {
while (!transitionsPath.isEmpty()) {
TransitionLevel currentLevel = transitionsPath.peek();
if (currentLevel.hasNextTransitionLevel()) {
TransitionLevel nextTransitionLevel = currentLevel.nextTransitionLevel();
transitionsPath.push(nextTransitionLevel);
break;
}
if (currentLevel.hasCharacterTransition()) {
char currChar = currentLevel.getCurrentChar();
if (currChar < currentLevel.getMaxCharInCurrentTransition()) {
++currChar;
currentLevel.setCurrentChar(currChar);
break;
}
}
if (currentLevel.jumpToNextTransition()) {
break;
} else {
transitionsPath.pop();
}
}
}
private void addNextTransitionLevel(TransitionLevel currentLevel) {
State nextState = currentLevel.getCurrentTransition().getDest();
TransitionLevel nextLevel = new TransitionLevel(nextState);
transitionsPath.add(nextLevel);
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy