public class RegexpSinglelineJavaCheck extends Check
| Constructor and Description |
|---|
RegexpSinglelineJavaCheck() |
| Modifier and Type | Method and Description |
|---|---|
void |
beginTree(DetailAST rootAST)
Called before the starting to process a tree.
|
int[] |
getDefaultTokens()
Returns the default token a check is interested in.
|
void |
init()
Initialise the check.
|
void |
setFormat(String format)
Set the format of the regular expression to match.
|
void |
setIgnoreCase(boolean ignore)
Set whether to ignore case when matching.
|
void |
setIgnoreComments(boolean ignore)
Set whether to ignore comments when matching.
|
void |
setMaximum(int maximum)
Set the maximum number of matches required per file.
|
void |
setMessage(String message)
Set the message to report for a match.
|
void |
setMinimum(int minimum)
Set the minimum number of matches required per file.
|
destroy, finishTree, getAcceptableTokens, getClassLoader, getFileContents, getLine, getLines, getRequiredTokens, getTabWidth, getTokenNames, isCommentNodesRequired, leaveToken, log, log, setClassLoader, setFileContents, setMessages, setTabWidth, setTokens, visitTokengetCustomMessages, getId, getMessageBundle, getSeverity, getSeverityLevel, log, setId, setSeverityconfigure, contextualize, finishLocalSetup, getConfiguration, setupChildpublic RegexpSinglelineJavaCheck()
public int[] getDefaultTokens()
CheckgetDefaultTokens in class CheckTokenTypespublic void init()
Checkpublic void beginTree(DetailAST rootAST)
Checkpublic void setFormat(String format)
format - the format of the regular expression to match.public void setMessage(String message)
message - the message to report for a match.public void setMinimum(int minimum)
minimum - the minimum number of matches required per file.public void setMaximum(int maximum)
maximum - the maximum number of matches required per file.public void setIgnoreCase(boolean ignore)
ignore - whether to ignore case when matching.public void setIgnoreComments(boolean ignore)
ignore - whether to ignore comments when matching.Copyright © 2001–2015. All rights reserved.