Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/* The following code was generated by JFlex 1.4.3 on 6-12-19 20:34 */
package com.thoughtworks.qdox.parser.impl;
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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.
*/
import com.thoughtworks.qdox.parser.*;
/**
* This class is a scanner generated by
* JFlex 1.4.3
* on 6-12-19 20:34 from the specification file
* E:/java-workspace/github/qdox/target/checkout/src/grammar/commentlexer.flex
*/
public class DefaultJavaCommentLexer implements Lexer {
/** This character denotes the end of file */
public static final int YYEOF = -1;
/** initial size of the lookahead buffer */
private static final int ZZ_BUFFERSIZE = 16384;
/** lexical states */
public static final int MULTILINECOMMENT = 10;
public static final int JAVADOCLINE = 6;
public static final int JAVADOCCONTENT = 4;
public static final int YYINITIAL = 0;
public static final int SINGLELINECOMMENT = 12;
public static final int JAVADOCTAG = 8;
public static final int JAVADOC = 2;
/**
* ZZ_LEXSTATE[l] is the state in the DFA for the lexical state l
* ZZ_LEXSTATE[l+1] is the state in the DFA for the lexical state l
* at the beginning of a line
* l is of the form l = 2*k, k a non negative integer
*/
private static final int ZZ_LEXSTATE[] = {
0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6
};
/**
* Translates characters to character classes
*/
private static final String ZZ_CMAP_PACKED =
"\11\0\1\5\1\2\2\0\1\1\22\0\1\5\11\0\1\3\4\0"+
"\1\4\20\0\1\6\uffbf\0";
/**
* Translates characters to character classes
*/
private static final char [] ZZ_CMAP = zzUnpackCMap(ZZ_CMAP_PACKED);
/**
* Translates DFA states to action switch labels.
*/
private static final int [] ZZ_ACTION = zzUnpackAction();
private static final String ZZ_ACTION_PACKED_0 =
"\13\0\3\1\1\2\1\3\1\4\2\5\1\1\1\6"+
"\1\1\2\7\2\1\2\10\1\11\2\1\2\12\5\0"+
"\1\13\1\14\1\15\1\3\1\16\1\17\10\0\1\20"+
"\1\0\1\21\1\22\3\0\1\23\1\0\2\24\1\0"+
"\1\24\1\21\1\0\1\23\1\25\1\26\1\27";
private static int [] zzUnpackAction() {
int [] result = new int[71];
int offset = 0;
offset = zzUnpackAction(ZZ_ACTION_PACKED_0, offset, result);
return result;
}
private static int zzUnpackAction(String packed, int offset, int [] result) {
int i = 0; /* index in packed string */
int j = offset; /* index in unpacked array */
int l = packed.length();
while (i < l) {
int count = packed.charAt(i++);
int value = packed.charAt(i++);
do result[j++] = value; while (--count > 0);
}
return j;
}
/**
* Translates a state to a row index in the transition table
*/
private static final int [] ZZ_ROWMAP = zzUnpackRowMap();
private static final String ZZ_ROWMAP_PACKED_0 =
"\0\0\0\7\0\16\0\25\0\34\0\43\0\52\0\61"+
"\0\70\0\77\0\106\0\115\0\124\0\133\0\115\0\142"+
"\0\115\0\115\0\151\0\160\0\115\0\167\0\176\0\205"+
"\0\214\0\223\0\232\0\115\0\241\0\250\0\257\0\266"+
"\0\115\0\61\0\115\0\275\0\304\0\313\0\322\0\115"+
"\0\115\0\331\0\115\0\115\0\160\0\167\0\340\0\347"+
"\0\356\0\365\0\205\0\214\0\167\0\223\0\374\0\115"+
"\0\u0103\0\304\0\313\0\u010a\0\331\0\167\0\347\0\u0111"+
"\0\115\0\u0118\0\u011f\0\u0126\0\115\0\374\0\115";
private static int [] zzUnpackRowMap() {
int [] result = new int[71];
int offset = 0;
offset = zzUnpackRowMap(ZZ_ROWMAP_PACKED_0, offset, result);
return result;
}
private static int zzUnpackRowMap(String packed, int offset, int [] result) {
int i = 0; /* index in packed string */
int j = offset; /* index in unpacked array */
int l = packed.length();
while (i < l) {
int high = packed.charAt(i++) << 16;
result[j++] = high | packed.charAt(i++);
}
return j;
}
/**
* The transition table of the DFA
*/
private static final int [] ZZ_TRANS = zzUnpackTrans();
private static final String ZZ_TRANS_PACKED_0 =
"\1\14\1\15\2\14\1\16\2\14\1\17\1\15\1\17"+
"\1\20\1\17\1\14\1\21\1\22\1\23\3\22\1\24"+
"\1\25\1\26\1\27\1\30\1\31\1\26\1\32\1\26"+
"\1\14\1\33\1\34\2\14\1\35\1\36\1\14\1\15"+
"\1\14\1\37\4\14\1\40\1\41\4\14\2\42\1\43"+
"\1\10\1\42\1\10\1\42\4\0\1\44\10\0\1\45"+
"\4\0\1\46\13\0\1\14\7\0\1\47\1\50\5\0"+
"\1\20\1\51\1\52\1\53\2\0\1\54\11\0\1\55"+
"\1\25\1\56\1\27\1\30\1\57\3\56\2\60\1\30"+
"\1\61\3\60\3\0\1\62\1\0\1\63\1\0\1\56"+
"\1\27\1\30\1\64\1\65\1\66\2\56\1\27\1\30"+
"\1\66\1\56\1\66\1\56\2\0\1\34\11\0\1\35"+
"\1\0\1\67\2\0\2\67\1\0\1\67\4\0\1\70"+
"\4\0\1\41\7\0\1\71\3\0\1\72\2\0\2\72"+
"\1\0\1\72\3\0\1\73\6\0\1\74\10\0\1\75"+
"\1\53\1\56\1\27\1\30\1\57\1\76\1\66\1\56"+
"\2\60\1\63\1\61\5\60\1\63\1\61\1\77\1\100"+
"\1\60\3\0\1\62\1\101\2\0\1\67\2\0\1\102"+
"\1\67\1\0\1\67\3\0\1\71\1\0\1\103\4\0"+
"\1\104\1\105\2\0\2\60\1\63\1\100\1\60\1\100"+
"\1\60\1\67\2\0\1\102\1\106\1\0\1\67\5\0"+
"\1\103\4\0\1\104\1\107\2\0";
private static int [] zzUnpackTrans() {
int [] result = new int[301];
int offset = 0;
offset = zzUnpackTrans(ZZ_TRANS_PACKED_0, offset, result);
return result;
}
private static int zzUnpackTrans(String packed, int offset, int [] result) {
int i = 0; /* index in packed string */
int j = offset; /* index in unpacked array */
int l = packed.length();
while (i < l) {
int count = packed.charAt(i++);
int value = packed.charAt(i++);
value--;
do result[j++] = value; while (--count > 0);
}
return j;
}
/* error codes */
private static final int ZZ_UNKNOWN_ERROR = 0;
private static final int ZZ_NO_MATCH = 1;
private static final int ZZ_PUSHBACK_2BIG = 2;
/* error messages for the codes above */
private static final String ZZ_ERROR_MSG[] = {
"Unkown internal scanner error",
"Error: could not match input",
"Error: pushback value was too large"
};
/**
* ZZ_ATTRIBUTE[aState] contains the attributes of state aState
*/
private static final int [] ZZ_ATTRIBUTE = zzUnpackAttribute();
private static final String ZZ_ATTRIBUTE_PACKED_0 =
"\13\0\1\11\2\1\1\11\1\1\2\11\2\1\1\11"+
"\6\1\1\11\4\1\1\11\1\1\1\11\3\0\1\1"+
"\2\11\1\1\2\11\10\0\1\1\1\0\1\1\1\11"+
"\4\1\1\0\2\1\1\0\1\11\3\1\1\11\1\1"+
"\1\11";
private static int [] zzUnpackAttribute() {
int [] result = new int[71];
int offset = 0;
offset = zzUnpackAttribute(ZZ_ATTRIBUTE_PACKED_0, offset, result);
return result;
}
private static int zzUnpackAttribute(String packed, int offset, int [] result) {
int i = 0; /* index in packed string */
int j = offset; /* index in unpacked array */
int l = packed.length();
while (i < l) {
int count = packed.charAt(i++);
int value = packed.charAt(i++);
do result[j++] = value; while (--count > 0);
}
return j;
}
/** the input device */
private java.io.Reader zzReader;
/** the current state of the DFA */
private int zzState;
/** the current lexical state */
private int zzLexicalState = YYINITIAL;
/** this buffer contains the current text to be matched and is
the source of the yytext() string */
private char zzBuffer[] = new char[ZZ_BUFFERSIZE];
/** the textposition at the last accepting state */
private int zzMarkedPos;
/** the current text position in the buffer */
private int zzCurrentPos;
/** startRead marks the beginning of the yytext() string in the buffer */
private int zzStartRead;
/** endRead marks the last character in the buffer, that has been read
from input */
private int zzEndRead;
/** number of newlines encountered up to the start of the matched text */
private int yyline;
/** the number of characters up to the start of the matched text */
private int yychar;
/**
* the number of characters from the last newline up to the start of the
* matched text
*/
private int yycolumn;
/**
* zzAtBOL == true <=> the scanner is currently at the beginning of a line
*/
private boolean zzAtBOL = true;
/** zzAtEOF == true <=> the scanner is at the EOF */
private boolean zzAtEOF;
/** denotes if the user-EOF-code has already been executed */
private boolean zzEOFDone;
/** For the backwards DFA of general lookahead statements */
private boolean [] zzFin = new boolean [ZZ_BUFFERSIZE+1];
/* user code: */
private int lineOffset = 1;
private int columnOffset =1;
private int stateDepth = 0;
private int[] stateStack = new int[10];
private StringBuffer codeBody = new StringBuffer(8192);
private boolean appendingToCodeBody;
public int lex() throws java.io.IOException {
return yylex();
}
public String text() {
return yytext();
}
public int getLine() {
return yyline + lineOffset;
}
public void setLineOffset(int lineOffset) {
this.lineOffset = lineOffset;
}
public int getColumn() {
return yycolumn + columnOffset;
}
public void setColumnOffset(int columnOffset) {
this.columnOffset = columnOffset;
}
public String getCodeBody(){
String s = codeBody.toString();
codeBody = new StringBuffer(8192);
return s;
}
private void pushState(int newState) {
stateStack[stateDepth++] = zzLexicalState;
yybegin(newState);
}
private void popState() {
yybegin(stateStack[--stateDepth]);
}
private int peekState(int relative) {
if(relative > stateDepth) {
return -1;
}
else {
return stateStack[stateDepth - relative];
}
}
/**
* Creates a new scanner
* There is also a java.io.InputStream version of this constructor.
*
* @param in the java.io.Reader to read input from.
*/
public DefaultJavaCommentLexer(java.io.Reader in) {
this.zzReader = in;
}
/**
* Creates a new scanner.
* There is also java.io.Reader version of this constructor.
*
* @param in the java.io.Inputstream to read input from.
*/
public DefaultJavaCommentLexer(java.io.InputStream in) {
this(new java.io.InputStreamReader(in));
}
/**
* Unpacks the compressed character translation table.
*
* @param packed the packed character translation table
* @return the unpacked character translation table
*/
private static char [] zzUnpackCMap(String packed) {
char [] map = new char[0x10000];
int i = 0; /* index in packed string */
int j = 0; /* index in unpacked array */
while (i < 28) {
int count = packed.charAt(i++);
char value = packed.charAt(i++);
do map[j++] = value; while (--count > 0);
}
return map;
}
/**
* Refills the input buffer.
*
* @return false, iff there was new input.
*
* @exception java.io.IOException if any I/O-Error occurs
*/
private boolean zzRefill() throws java.io.IOException {
/* first: make room (if you can) */
if (zzStartRead > 0) {
System.arraycopy(zzBuffer, zzStartRead,
zzBuffer, 0,
zzEndRead-zzStartRead);
/* translate stored positions */
zzEndRead-= zzStartRead;
zzCurrentPos-= zzStartRead;
zzMarkedPos-= zzStartRead;
zzStartRead = 0;
}
/* is the buffer big enough? */
if (zzCurrentPos >= zzBuffer.length) {
/* if not: blow it up */
char newBuffer[] = new char[zzCurrentPos*2];
System.arraycopy(zzBuffer, 0, newBuffer, 0, zzBuffer.length);
zzBuffer = newBuffer;
}
/* finally: fill the buffer with new input */
int numRead = zzReader.read(zzBuffer, zzEndRead,
zzBuffer.length-zzEndRead);
if (numRead > 0) {
zzEndRead+= numRead;
return false;
}
// unlikely but not impossible: read 0 characters, but not at end of stream
if (numRead == 0) {
int c = zzReader.read();
if (c == -1) {
return true;
} else {
zzBuffer[zzEndRead++] = (char) c;
return false;
}
}
// numRead < 0
return true;
}
/**
* Closes the input stream.
*/
public final void yyclose() throws java.io.IOException {
zzAtEOF = true; /* indicate end of file */
zzEndRead = zzStartRead; /* invalidate buffer */
if (zzReader != null)
zzReader.close();
}
/**
* Resets the scanner to read from a new input stream.
* Does not close the old reader.
*
* All internal variables are reset, the old input stream
* cannot be reused (internal buffer is discarded and lost).
* Lexical state is set to ZZ_INITIAL.
*
* @param reader the new input stream
*/
public final void yyreset(java.io.Reader reader) {
zzReader = reader;
zzAtBOL = true;
zzAtEOF = false;
zzEOFDone = false;
zzEndRead = zzStartRead = 0;
zzCurrentPos = zzMarkedPos = 0;
yyline = yychar = yycolumn = 0;
zzLexicalState = YYINITIAL;
}
/**
* Returns the current lexical state.
*/
public final int yystate() {
return zzLexicalState;
}
/**
* Enters a new lexical state
*
* @param newState the new lexical state
*/
public final void yybegin(int newState) {
zzLexicalState = newState;
}
/**
* Returns the text matched by the current regular expression.
*/
public final String yytext() {
return new String( zzBuffer, zzStartRead, zzMarkedPos-zzStartRead );
}
/**
* Returns the character at position pos from the
* matched text.
*
* It is equivalent to yytext().charAt(pos), but faster
*
* @param pos the position of the character to fetch.
* A value from 0 to yylength()-1.
*
* @return the character at position pos
*/
public final char yycharat(int pos) {
return zzBuffer[zzStartRead+pos];
}
/**
* Returns the length of the matched text region.
*/
public final int yylength() {
return zzMarkedPos-zzStartRead;
}
/**
* Reports an error that occured while scanning.
*
* In a wellformed scanner (no or only correct usage of
* yypushback(int) and a match-all fallback rule) this method
* will only be called with things that "Can't Possibly Happen".
* If this method is called, something is seriously wrong
* (e.g. a JFlex bug producing a faulty scanner etc.).
*
* Usual syntax/scanner level error handling should be done
* in error fallback rules.
*
* @param errorCode the code of the errormessage to display
*/
private void zzScanError(int errorCode) {
String message;
try {
message = ZZ_ERROR_MSG[errorCode];
}
catch (ArrayIndexOutOfBoundsException e) {
message = ZZ_ERROR_MSG[ZZ_UNKNOWN_ERROR];
}
throw new Error(message);
}
/**
* Pushes the specified amount of characters back into the input stream.
*
* They will be read again by then next call of the scanning method
*
* @param number the number of characters to be read again.
* This number must not be greater than yylength()!
*/
public void yypushback(int number) {
if ( number > yylength() )
zzScanError(ZZ_PUSHBACK_2BIG);
zzMarkedPos -= number;
}
/**
* Contains user EOF-code, which will be executed exactly once,
* when the end of file is reached
*/
private void zzDoEOF() throws java.io.IOException {
if (!zzEOFDone) {
zzEOFDone = true;
yyclose();
}
}
/**
* Resumes scanning until the next regular expression is matched,
* the end of input is encountered or an I/O-Error occurs.
*
* @return the next token
* @exception java.io.IOException if any I/O-Error occurs
*/
public int yylex() throws java.io.IOException {
int zzInput;
int zzAction;
// cached fields:
int zzCurrentPosL;
int zzMarkedPosL;
int zzEndReadL = zzEndRead;
char [] zzBufferL = zzBuffer;
char [] zzCMapL = ZZ_CMAP;
int [] zzTransL = ZZ_TRANS;
int [] zzRowMapL = ZZ_ROWMAP;
int [] zzAttrL = ZZ_ATTRIBUTE;
while (true) {
zzMarkedPosL = zzMarkedPos;
boolean zzR = false;
for (zzCurrentPosL = zzStartRead; zzCurrentPosL < zzMarkedPosL;
zzCurrentPosL++) {
switch (zzBufferL[zzCurrentPosL]) {
case '\u000B':
case '\u000C':
case '\u0085':
case '\u2028':
case '\u2029':
yyline++;
yycolumn = 0;
zzR = false;
break;
case '\r':
yyline++;
yycolumn = 0;
zzR = true;
break;
case '\n':
if (zzR)
zzR = false;
else {
yyline++;
yycolumn = 0;
}
break;
default:
zzR = false;
yycolumn++;
}
}
if (zzR) {
// peek one character ahead if it is \n (if we have counted one line too much)
boolean zzPeek;
if (zzMarkedPosL < zzEndReadL)
zzPeek = zzBufferL[zzMarkedPosL] == '\n';
else if (zzAtEOF)
zzPeek = false;
else {
boolean eof = zzRefill();
zzEndReadL = zzEndRead;
zzMarkedPosL = zzMarkedPos;
zzBufferL = zzBuffer;
if (eof)
zzPeek = false;
else
zzPeek = zzBufferL[zzMarkedPosL] == '\n';
}
if (zzPeek) yyline--;
}
zzAction = -1;
zzCurrentPosL = zzCurrentPos = zzStartRead = zzMarkedPosL;
zzState = ZZ_LEXSTATE[zzLexicalState];
zzForAction: {
while (true) {
if (zzCurrentPosL < zzEndReadL)
zzInput = zzBufferL[zzCurrentPosL++];
else if (zzAtEOF) {
zzInput = YYEOF;
break zzForAction;
}
else {
// store back cached positions
zzCurrentPos = zzCurrentPosL;
zzMarkedPos = zzMarkedPosL;
boolean eof = zzRefill();
// get translated positions and possibly new buffer
zzCurrentPosL = zzCurrentPos;
zzMarkedPosL = zzMarkedPos;
zzBufferL = zzBuffer;
zzEndReadL = zzEndRead;
if (eof) {
zzInput = YYEOF;
break zzForAction;
}
else {
zzInput = zzBufferL[zzCurrentPosL++];
}
}
int zzNext = zzTransL[ zzRowMapL[zzState] + zzCMapL[zzInput] ];
if (zzNext == -1) break zzForAction;
zzState = zzNext;
int zzAttributes = zzAttrL[zzState];
if ( (zzAttributes & 1) == 1 ) {
zzAction = zzState;
zzMarkedPosL = zzCurrentPosL;
if ( (zzAttributes & 8) == 8 ) break zzForAction;
}
}
}
// store back cached position
zzMarkedPos = zzMarkedPosL;
switch (zzAction < 0 ? zzAction : ZZ_ACTION[zzAction]) {
case 5:
{ yypushback(1);
popState();
pushState(JAVADOCLINE);
}
case 24: break;
case 8:
{ popState();
return DefaultJavaCommentParser.JAVADOCLINE;
}
case 25: break;
case 11:
{ codeBody.append( "/*" );
pushState( MULTILINECOMMENT );
}
case 26: break;
case 4:
{ yypushback(1);
pushState(JAVADOCTAG);
}
case 27: break;
case 21:
{ codeBody.append( "/**/" );
}
case 28: break;
case 13:
{ popState();
return DefaultJavaCommentParser.JAVADOCEND;
}
case 29: break;
case 15:
{ popState();
return DefaultJavaCommentParser.JAVADOCLINE;
}
case 30: break;
case 3:
{ pushState(JAVADOCLINE);
}
case 31: break;
case 6:
{ yypushback(1);
popState();
pushState(JAVADOCTAG);
}
case 32: break;
case 16:
{ popState();
popState();
return DefaultJavaCommentParser.JAVADOCEND;
}
case 33: break;
case 14:
// lookahead expression with fixed lookahead length
yypushback(1);
{ pushState(JAVADOCTAG);
}
case 34: break;
case 1:
{ codeBody.append(yytext());
}
case 35: break;
case 18:
{ codeBody.append("*/");
popState();
}
case 36: break;
case 17:
{ return DefaultJavaCommentParser.JAVADOCTAG;
}
case 37: break;
case 2:
{ yypushback(1);
pushState(JAVADOCLINE);
}
case 38: break;
case 12:
{ codeBody.append( "//" );
pushState( SINGLELINECOMMENT );
}
case 39: break;
case 22:
// general lookahead, find correct zzMarkedPos
{ int zzFState = 9;
int zzFPos = zzStartRead;
if (zzFin.length <= zzBufferL.length) { zzFin = new boolean[zzBufferL.length+1]; }
boolean zzFinL[] = zzFin;
while (zzFState != -1 && zzFPos < zzMarkedPos) {
if ((zzAttrL[zzFState] & 1) == 1) { zzFinL[zzFPos] = true; }
zzInput = zzBufferL[zzFPos++];
zzFState = zzTransL[ zzRowMapL[zzFState] + zzCMapL[zzInput] ];
}
if (zzFState != -1 && (zzAttrL[zzFState] & 1) == 1) { zzFinL[zzFPos] = true; }
zzFState = 10;
zzFPos = zzMarkedPos;
while (!zzFinL[zzFPos] || (zzAttrL[zzFState] & 1) != 1) {
zzInput = zzBufferL[--zzFPos];
zzFState = zzTransL[ zzRowMapL[zzFState] + zzCMapL[zzInput] ];
};
zzMarkedPos = zzFPos;
}
{ popState();
return DefaultJavaCommentParser.JAVADOCTAG;
}
case 40: break;
case 20:
// general lookahead, find correct zzMarkedPos
{ int zzFState = 7;
int zzFPos = zzStartRead;
if (zzFin.length <= zzBufferL.length) { zzFin = new boolean[zzBufferL.length+1]; }
boolean zzFinL[] = zzFin;
while (zzFState != -1 && zzFPos < zzMarkedPos) {
if ((zzAttrL[zzFState] & 1) == 1) { zzFinL[zzFPos] = true; }
zzInput = zzBufferL[zzFPos++];
zzFState = zzTransL[ zzRowMapL[zzFState] + zzCMapL[zzInput] ];
}
if (zzFState != -1 && (zzAttrL[zzFState] & 1) == 1) { zzFinL[zzFPos] = true; }
zzFState = 8;
zzFPos = zzMarkedPos;
while (!zzFinL[zzFPos] || (zzAttrL[zzFState] & 1) != 1) {
zzInput = zzBufferL[--zzFPos];
zzFState = zzTransL[ zzRowMapL[zzFState] + zzCMapL[zzInput] ];
};
zzMarkedPos = zzFPos;
}
{ popState();
return DefaultJavaCommentParser.JAVADOCLINE;
}
case 41: break;
case 7:
{ popState();
return DefaultJavaCommentParser.JAVADOCLINE;
}
case 42: break;
case 23:
{ yypushback(2);
pushState(JAVADOC);
return DefaultJavaCommentParser.JAVADOCSTART;
}
case 43: break;
case 10:
{ codeBody.append(yytext());
popState();
}
case 44: break;
case 9:
{ popState();
pushState(JAVADOCLINE);
}
case 45: break;
case 19:
{ pushState( JAVADOC );
pushState( JAVADOCCONTENT );
return DefaultJavaCommentParser.JAVADOCSTART;
}
case 46: break;
default:
if (zzInput == YYEOF && zzStartRead == zzCurrentPos) {
zzAtEOF = true;
zzDoEOF();
{ return 0; }
}
else {
zzScanError(ZZ_NO_MATCH);
}
}
}
}
}
