src/main/java/org/wltea/analyzer/core/IKArbitrator.java
private Stack<QuickSortSet.Cell> forwardPath(QuickSortSet.Cell lexemeCell , LexemePath option){
		//发生冲突的Lexeme栈
		Stack<QuickSortSet.Cell> conflictStack = new Stack<QuickSortSet.Cell>();
		QuickSortSet.Cell c = lexemeCell;
		//迭代遍历Lexeme链表
		while(c != null && c.getLexeme() != null){
			if(!option.addNotCrossLexeme(c.getLexeme())){
				//词元交叉，添加失败则加入lexemeStack栈
				conflictStack.push(c);
			}
			c = c.getNext();
		}
		return conflictStack;
	}
private Stack<QuickSortSet.Cell> forwardPath(QuickSortSet.Cell lexemeCell , LexemePath option){
		//发生冲突的Lexeme栈
		Stack<QuickSortSet.Cell> conflictStack = new Stack<QuickSortSet.Cell>();
		QuickSortSet.Cell c = lexemeCell;
		//迭代遍历Lexeme链表
		while(c != null && c.getLexeme() != null){
			if(!option.addNotCrossLexeme(c.getLexeme())){
				//词元交叉，添加失败则加入lexemeStack栈
				conflictStack.push(c);
			}
			c = c.getNext();
		}
		return conflictStack;
	}
private Stack < QuickSortSet . Cell > forwardPath ( QuickSortSet . Cell lexemeCell , LexemePath option ) { //发生冲突的Lexeme栈
 Stack < QuickSortSet . Cell > conflictStack = new Stack < QuickSortSet . Cell > ( ) ; QuickSortSet . Cell c = lexemeCell ; //迭代遍历Lexeme链表
 while ( c != null && c . getLexeme ( ) != null ) { if ( ! option . addNotCrossLexeme ( c . getLexeme ( ) ) ) { //词元交叉，添加失败则加入lexemeStack栈
 conflictStack . push ( c ) ; } c = c . getNext ( ) ; } return conflictStack ; }
向前遍历，添加词元，构造一个无歧义词元组合
* @param LexemePath path
@return
向前遍历，添加词元，构造一个无歧义词元组合 *