org.htmlcleaner.HtmlCleaner Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of htmlcleaner Show documentation
Show all versions of htmlcleaner Show documentation
HtmlCleaner is an HTML parser written in Java. It transforms dirty HTML to well-formed XML following
the same rules that most web-browsers use.
/* Copyright (c) 2006-2014, The HtmlCleaner Project
All rights reserved.
Redistribution and use of this software in source and binary forms,
with or without modification, are permitted provided that the following
conditions are met:
* Redistributions of source code must retain the above
copyright notice, this list of conditions and the
following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the
following disclaimer in the documentation and/or other
materials provided with the distribution.
* The name of HtmlCleaner may not be used to endorse or promote
products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
*/
package org.htmlcleaner;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.Reader;
import java.io.StringReader;
import java.net.URL;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.ListIterator;
import java.util.Map;
import java.util.Set;
import java.util.Stack;
import org.htmlcleaner.audit.ErrorType;
import org.htmlcleaner.conditional.ITagNodeCondition;
/**
* Main HtmlCleaner class.
*
* It represents public interface to the user. It's task is to call tokenizer with
* specified source HTML, traverse list of produced token list and create internal
* object model. It also offers a set of methods to write resulting XML to string,
* file or any output stream.
* Typical usage is the following:
*
*
* // create an instance of HtmlCleaner
* HtmlCleaner cleaner = new HtmlCleaner();
*
* // take default cleaner properties
* CleanerProperties props = cleaner.getProperties();
*
* // customize cleaner's behavior with property setters
* props.setXXX(...);
*
* // Clean HTML taken from simple string, file, URL, input stream,
* // input source or reader. Result is root node of created
* // tree-like structure. Single cleaner instance may be safely used
* // multiple times.
* TagNode node = cleaner.clean(...);
*
* // optionally find parts of the DOM or modify some nodes
* TagNode[] myNodes = node.getElementsByXXX(...);
* // and/or
* Object[] myNodes = node.evaluateXPath(xPathExpression);
* // and/or
* aNode.removeFromTree();
* // and/or
* aNode.addAttribute(attName, attValue);
* // and/or
* aNode.removeAttribute(attName, attValue);
* // and/or
* cleaner.setInnerHtml(aNode, htmlContent);
* // and/or do some other tree manipulation/traversal
*
* // serialize a node to a file, output stream, DOM, JDom...
* new XXXSerializer(props).writeXmlXXX(aNode, ...);
* myJDom = new JDomSerializer(props, true).createJDom(aNode);
* myDom = new DomSerializer(props, true).createDOM(aNode);
*
*/
public class HtmlCleaner {
/**
* Marker attribute added to aid with part of the cleaning process.
* TODO: a non-intrusive way of doing this that does not involve modifying the source html
*/
private static final String MARKER_ATTRIBUTE = "htmlcleaner_marker";
public static int HTML_4=4;
public static int HTML_5=5;
/**
* Contains information about single open tag
*/
private class TagPos {
private int position;
private String name;
private TagInfo info;
TagPos(int position, String name) {
this.position = position;
this.name = name;
this.info = getTagInfoProvider().getTagInfo(name);
}
}
/**
* Contains information about nodes that were closed due to their child nodes.
* i.e. if 'p' tag was closed due to 'table' child tag.
*
* @author Konstantin Burov
*
*/
private class ChildBreaks{
private Stack < TagPos> closedByChildBreak = new Stack < TagPos >();
private Stack < TagPos > breakingTags = new Stack < TagPos >();
/**
* Adds the break info to the top of the stacks.
*
* @param closedPos - position of the tag that was closed due to incorrect child
* @param breakPos - position of the child that has broken its parent
*/
public void addBreak(TagPos closedPos, TagPos breakPos){
closedByChildBreak.add(closedPos);
breakingTags.add(breakPos);
}
public boolean isEmpty() {
return closedByChildBreak.isEmpty();
}
/**
* @return name of the last children tag that has broken its parent.
*/
public String getLastBreakingTag() {
return breakingTags.peek().name;
}
/**
* pops out latest broken tag position.
*
* @return tag pos of the last parent that was broken.
*/
public TagPos pop() {
breakingTags.pop();
return closedByChildBreak.pop();
}
/**
* @return position of the last tag that has broken its parent. -1 if no such tag found.
*/
public int getLastBreakingTagPosition() {
return breakingTags.isEmpty()?-1:breakingTags.peek().position;
}
}
protected class NestingState {
private OpenTags openTags = new OpenTags();
private ChildBreaks childBreaks = new ChildBreaks();
public OpenTags getOpenTags() {
return this.openTags;
}
public ChildBreaks getChildBreaks() {
return this.childBreaks;
}
}
/**
* Class that contains information and methods for managing list of open,
* but unhandled tags.
*/
class OpenTags {
private List list = new ArrayList();
private TagPos last;
private Set set = new HashSet();
private boolean isEmpty() {
return list.isEmpty();
}
private void addTag(String tagName, int position) {
last = new TagPos(position, tagName);
list.add(last);
set.add(tagName);
}
private void removeTag(String tagName) {
ListIterator it = list.listIterator( list.size() );
while ( it.hasPrevious() ) {
if (Thread.currentThread().isInterrupted()) {
handleInterruption();
break;
}
TagPos currTagPos = it.previous();
if (tagName.equals(currTagPos.name)) {
it.remove();
break;
}
}
last = list.isEmpty() ? null : (TagPos) list.get( list.size() - 1 );
}
private TagPos findFirstTagPos() {
return list.isEmpty() ? null : (TagPos) list.get(0);
}
private TagPos getLastTagPos() {
return last;
}
private TagPos findTag(String tagName) {
if (tagName != null) {
ListIterator it = list.listIterator(list.size());
String fatalTag = null;
TagInfo fatalInfo = getTagInfoProvider().getTagInfo(tagName);
while (it.hasPrevious()) {
if (Thread.currentThread().isInterrupted()) {
handleInterruption();
return null;
}
TagPos currTagPos = it.previous();
if (tagName.equals(currTagPos.name)) {
return currTagPos;
} else if (fatalInfo != null && fatalInfo.isFatalTag(currTagPos.name)) {
// do not search past a fatal tag for this tag
return null;
}
}
}
return null;
}
private boolean tagExists(String tagName) {
TagPos tagPos = findTag(tagName);
return tagPos != null;
}
private TagPos findTagToPlaceRubbish() {
TagPos result = null, prev = null;
if ( !isEmpty() ) {
ListIterator it = list.listIterator( list.size() );
while ( it.hasPrevious() ) {
if (Thread.currentThread().isInterrupted()) {
handleInterruption();
return null;
}
result = it.previous();
if ( result.info == null || result.info.allowsAnything() ) {
if (prev != null) {
return prev;
}
}
prev = result;
}
}
return result;
}
private boolean tagEncountered(String tagName) {
return set.contains(tagName);
}
/**
* Checks if any of tags specified in the set are already open.
* @param tags
*/
private boolean someAlreadyOpen(Set tags) {
for (TagPos curr : list) {
if ( tags.contains(curr.name) ) {
return true;
}
}
return false;
}
}
private CleanerProperties properties;
private CleanerTransformations transformations;
/**
* Constructor - creates cleaner instance with default tag info provider,default html version 5
* and default properties.
*/
/**
* Constructor - creates cleaner instance with default tag info provider,default version and default properties.
*/
public HtmlCleaner() {
this(null, null);
}
/**
* Constructor - creates the instance with specified tag info provider and default properties
* @param tagInfoProvider Provider for tag filtering and balancing
*/
public HtmlCleaner(ITagInfoProvider tagInfoProvider) {
this(tagInfoProvider, null);
}
/**
* Constructor - creates the instance with default tag info provider and specified properties
* @param properties Properties used during parsing and serializing
*/
public HtmlCleaner(CleanerProperties properties) {
this(null, properties);
}
/**
* Constructor - creates the instance with specified tag info provider and specified properties
* @param tagInfoProvider Provider for tag filtering and balancing
* @param properties Properties used during parsing and serializing
*/
public HtmlCleaner(ITagInfoProvider tagInfoProvider, CleanerProperties properties) {
this.properties = properties == null ? new CleanerProperties() : properties;
//
// If the given tagInfoProvider is null, then we set it to the default
// UNLESS the TagInfoProvider has already been set in cleanerProperties.
// in which case we leave properties as they are.
//
if (tagInfoProvider == null && this.properties.getTagInfoProvider() == null){
if (this.properties.getHtmlVersion()==HTML_4)
this.properties.setTagInfoProvider(Html4TagProvider.INSTANCE);
else
this.properties.setTagInfoProvider(Html5TagProvider.INSTANCE);
} else {
if (tagInfoProvider != null){
this.properties.setTagInfoProvider(tagInfoProvider == null ? Html4TagProvider.INSTANCE : tagInfoProvider);
}
}
}
public TagNode clean(String htmlContent) {
try {
return clean( new StringReader(htmlContent), new CleanTimeValues() );
} catch (IOException e) {
// should never happen because reading from StringReader
throw new HtmlCleanerException(e);
}
}
public TagNode clean(File file, String charset) throws IOException {
FileInputStream in = new FileInputStream(file);
Reader reader = null;
try {
reader = new InputStreamReader(in, charset);
return clean(reader, new CleanTimeValues());
} finally {
if ( reader != null) {
try{ reader.close(); } catch(IOException e) {}
}
try{ in.close(); } catch(IOException e) {}
}
}
public TagNode clean(File file) throws IOException {
return clean(file, properties.getCharset());
}
/**
* Deprecated because unmanaged network IO does not handle proxies, slow servers or broken connections well.
* the htmlcleaner caller should be managing the connections themselves and just providing the htmlcleaner library with a stream.
* @param url
* @param charset
* @return
* @throws IOException
*/
@Deprecated // Removing network I/O will make htmlcleaner better suited to a server environment which needs managed connections
public TagNode clean(URL url, String charset) throws IOException {
CharSequence content = Utils.readUrl(url, charset);
Reader reader = new StringReader( content.toString() );
return clean(reader, new CleanTimeValues()) ;
}
/**
* Creates instance from the content downloaded from specified URL.
* HTML encoding is resolved following the attempts in the sequence:
* 1. reading Content-Type response header, 2. Analyzing META tags at the
* beginning of the html, 3. Using platform's default charset.
* @param url
* @return
* @throws IOException
*/
public TagNode clean(URL url) throws IOException {
return clean(url, properties.getCharset());
}
public TagNode clean(InputStream in, String charset) throws IOException {
return clean( new InputStreamReader(in, charset), new CleanTimeValues() );
}
public TagNode clean(InputStream in) throws IOException {
return clean(in, properties.getCharset());
}
public TagNode clean(Reader reader) throws IOException {
return clean(reader, new CleanTimeValues());
}
/**
* Basic version of the cleaning call.
* @param reader (not closed)
* @return An instance of TagNode object which is the root of the XML tree.
* @throws IOException
*/
protected TagNode clean(Reader reader, final CleanTimeValues cleanTimeValues) throws IOException {
pushNesting(cleanTimeValues);
cleanTimeValues._headOpened = false;
cleanTimeValues._bodyOpened = false;
cleanTimeValues._headTags.clear();
cleanTimeValues.allTags.clear();
cleanTimeValues.pruneTagSet = new HashSet(this.properties.getPruneTagSet());
cleanTimeValues.allowTagSet = new HashSet(this.properties.getAllowTagSet());
this.transformations = this.properties.getCleanerTransformations();
cleanTimeValues.pruneNodeSet.clear();
cleanTimeValues.htmlNode = this.newTagNode("html");
cleanTimeValues.bodyNode = this.newTagNode("body");
cleanTimeValues.headNode = this.newTagNode("head");
cleanTimeValues.rootNode = null;
cleanTimeValues.htmlNode.addChild(cleanTimeValues.headNode);
cleanTimeValues.htmlNode.addChild(cleanTimeValues.bodyNode);
HtmlTokenizer htmlTokenizer = new HtmlTokenizer(this, reader, cleanTimeValues);
htmlTokenizer.start();
if (Thread.currentThread().isInterrupted()) {
handleInterruption();
return null;
}
List nodeList = htmlTokenizer.getTokenList();
closeAll(nodeList, cleanTimeValues);
if (Thread.currentThread().isInterrupted()) {
handleInterruption();
return null;
}
createDocumentNodes(nodeList, cleanTimeValues);
if (Thread.currentThread().isInterrupted()) {
handleInterruption();
return null;
}
calculateRootNode( cleanTimeValues, htmlTokenizer.getNamespacePrefixes() );
if (Thread.currentThread().isInterrupted()) {
handleInterruption();
return null;
}
// Some transitions on resulting html require us to have the tag tree structure.
// i.e. if we want to clear insignificant
tags. Thus this place is best for
// marking nodes to be pruned.
while(markNodesToPrune(nodeList, cleanTimeValues)) {
if (Thread.currentThread().isInterrupted()) {
handleInterruption();
return null;
}
// do them all
}
// if there are some nodes to prune from tree
if (cleanTimeValues.pruneNodeSet != null && !cleanTimeValues.pruneNodeSet.isEmpty() ) {
Iterator iterator = cleanTimeValues.pruneNodeSet.iterator();
while (iterator.hasNext()) {
if (Thread.currentThread().isInterrupted()) {
handleInterruption();
return null;
}
TagNode tagNode = iterator.next();
TagNode parent = tagNode.getParent();
if (parent != null) {
parent.removeChild(tagNode);
}
}
}
cleanTimeValues.rootNode.setDocType( htmlTokenizer.getDocType() );
popNesting(cleanTimeValues);
return cleanTimeValues.rootNode;
}
private boolean markNodesToPrune(List nodeList, CleanTimeValues cleanTimeValues) {
boolean nodesPruned = false;
for (Object next :nodeList) {
if(next instanceof TagNode && !cleanTimeValues.pruneNodeSet.contains(next)){
TagNode node = (TagNode) next;
if(addIfNeededToPruneSet(node, cleanTimeValues)) {
nodesPruned = true;
} else if (!node.isEmpty()){
nodesPruned |= markNodesToPrune(node.getAllChildren(), cleanTimeValues);
}
}
}
return nodesPruned;
}
/**
* Assigns root node to internal variable and adds neccessery xmlns
* attributes if cleaner is namespace-aware.
* Root node of the result depends on parameter "omitHtmlEnvelope".
* If it is set, then first child of the body will be root node,
* or html will be root node otherwise.
*
* @param namespacePrefixes
*/
private void calculateRootNode(CleanTimeValues cleanTimeValues, Set namespacePrefixes) {
cleanTimeValues.rootNode = cleanTimeValues.htmlNode;
// original behavior -- just take the first html element ignoring all other content, or later html elements.
// if (properties.isOmitHtmlEnvelope()) {
// List bodyChildren = this.bodyNode.getAllChildren();
// if (bodyChildren != null) {
// Iterator iterator = bodyChildren.iterator();
// while (iterator.hasNext()) {
// Object currChild = iterator.next();
// // if found child that is tag itself, then return it
// if (currChild instanceof TagNode) {
// this.rootNode = (TagNode)currChild;
// }
// }
// }
// }
// new behavior -- wrap in null TagNode
if (properties.isOmitHtmlEnvelope()) {
List bodyChildren = cleanTimeValues.bodyNode.getAllChildren();
cleanTimeValues.rootNode = new TagNode(null);
if (bodyChildren != null) {
for(Iterator iterator = bodyChildren.iterator(); iterator.hasNext(); ) {
Object currChild = iterator.next();
cleanTimeValues.rootNode.addChild(currChild);
}
}
}
Map atts = cleanTimeValues.rootNode.getAttributes();
//
// Add root namespace from xmlns if its given, for example XHTML or SVG
//
if (cleanTimeValues.rootNode.hasAttribute("xmlns")){
cleanTimeValues.rootNode.addNamespaceDeclaration("", cleanTimeValues.rootNode.getAttributeByName("xmlns"));
}
//
// Add any undefined namespace prefixes used in the document as
// placeholder namespace declarations. We can "guess" the URI of the namespace
// if its a common prefix such as "svg:" or "xlink:"
//
if (properties.isNamespacesAware() && namespacePrefixes != null) {
Iterator iterator = namespacePrefixes.iterator();
while (iterator.hasNext()) {
if (Thread.currentThread().isInterrupted()) {
handleInterruption();
return;
}
String prefix = iterator.next();
if (!cleanTimeValues.namespaceMap.containsKey(prefix)){
String xmlnsAtt = "xmlns:" + prefix;
//
// Don't include the XML NS or the default document namespace
//
if ( !atts.containsKey(xmlnsAtt) && !prefix.equals("xml") &&!prefix.equals("")) {
if (prefix.equals("svg")){
cleanTimeValues.rootNode.addAttribute(xmlnsAtt, "http://www.w3.org/2000/svg");
} else if (prefix.equals("xlink")){
cleanTimeValues.rootNode.addAttribute(xmlnsAtt, "http://www.w3.org/1999/xlink");
} else{
cleanTimeValues.rootNode.addAttribute(xmlnsAtt, prefix);
}
}
}
}
}
}
/**
* Add attributes from specified map to the specified tag.
* If some attribute already exist it is preserved.
* @param tag
* @param attributes
*/
private void addAttributesToTag(TagNode tag, Map attributes) {
if (attributes != null) {
Map tagAttributes = tag.getAttributes();
for(Map.Entry< String, String > currEntry : attributes.entrySet()) {
String attName = currEntry.getKey();
if ( !tagAttributes.containsKey(attName) ) {
String attValue = currEntry.getValue();
tag.addAttribute(attName, attValue);
}
}
}
}
/**
* Checks if open fatal tag is missing if there is a fatal tag for
* the specified tag.
* @param tag
*/
private boolean isFatalTagSatisfied(TagInfo tag, CleanTimeValues cleanTimeValues) {
boolean fatal = true;
if (tag != null) {
if (tag.getFatalTags().isEmpty()) return true;
fatal = false;
for (String fatalTagName:tag.getFatalTags()){
if(getOpenTags(cleanTimeValues).tagExists(fatalTagName)){
fatal = true;
}
}
}
return fatal;
}
/**
* Check if specified tag requires parent tag, but that parent
* tag is missing in the appropriate context.
* @param tag
*/
private boolean mustAddRequiredParent(TagInfo tag, CleanTimeValues cleanTimeValues) {
if (tag == null) return false;
//
// The tag has no required parent tags
//
if (tag.getRequiredParentTags().isEmpty()) return false;
//
// Iterate through fatal tags and find location of last fatal tag
//
int fatalTagPosition = -1;
for (String fatalTag:tag.getFatalTags()){
if (fatalTag != null) {
TagPos tagPos = getOpenTags(cleanTimeValues).findTag(fatalTag);
if (tagPos != null) {
fatalTagPosition = tagPos.position;
}
}
}
//
// Iterate through required parent tags and find location of last required parent tag
// If any required parent tag is present, we're OK.
//
boolean requiredTagMissing = true;
for (String requiredTag : tag.getRequiredParentTags()){
if (requiredTag != null) {
TagPos currTagPos = getOpenTags(cleanTimeValues).findTag(requiredTag);
if (currTagPos != null) {
requiredTagMissing = currTagPos.position <= fatalTagPosition;
}
}
}
if (!requiredTagMissing) return false;
//
// iterates through the list of open tags from the end and check if there is some higher
//
ListIterator it = getOpenTags(cleanTimeValues).list.listIterator( getOpenTags(cleanTimeValues).list.size() );
while ( it.hasPrevious() ) {
TagPos currTagPos = (TagPos) it.previous();
if (Thread.currentThread().isInterrupted()) {
handleInterruption();
return currTagPos.position <= fatalTagPosition;
}
if (tag.isHigher(currTagPos.name)) {
return currTagPos.position <= fatalTagPosition;
}
}
return true;
}
private TagNode newTagNode(String tagName) {
TagNode tagNode = new TagNode(tagName);
return tagNode;
}
private TagNode createTagNode(TagNode startTagToken) {
startTagToken.setFormed();
return startTagToken;
}
private boolean isAllowedInLastOpenTag(BaseToken token, CleanTimeValues cleanTimeValues) {
TagPos last = getOpenTags(cleanTimeValues).getLastTagPos();
if (last != null) {
if (last.info != null) {
return last.info.allowsItem(token);
}
}
return true;
}
private void saveToLastOpenTag(List nodeList, Object tokenToAdd, CleanTimeValues cleanTimeValues) {
TagPos last = getOpenTags(cleanTimeValues).getLastTagPos();
//
// If we can simply ignore this token, then we remove it.
//
if ( last != null && last.info != null && last.info.isIgnorePermitted() ) {
return;
}
//
// Find an open tag where the token can live
//
TagPos rubbishPos = getOpenTags(cleanTimeValues).findTagToPlaceRubbish();
if (rubbishPos != null){
TagNode startTagToken = (TagNode) nodeList.get(rubbishPos.position);
if (startTagToken != null) {
startTagToken.addItemForMoving(tokenToAdd);
return;
}
}
}
private boolean isStartToken(Object o) {
return (o instanceof TagNode) && !((TagNode)o).isFormed();
}
/**
* Checks whether we can allow a tag as "foreign markup".
* This means we must have namespace aware set to true, and we must
* either have a current xmlns declaration within scope that isn't for
* HTML, or we have a namespace prefix on the tag
* @param cleanTimeValues
* @return
*/
private boolean isAllowedAsForeignMarkup(String tagname, CleanTimeValues cleanTimeValues){
if (!properties.isNamespacesAware()) return false;
if (tagname == null) return false;
if (tagname.contains(":")) return true;
if (cleanTimeValues.namespace == null || cleanTimeValues.namespace.size() == 0) return false;
String ns = cleanTimeValues.namespace.peek();
if (ns == null) return false;
if (ns.equals("http://www.w3.org/1999/xhtml")) return false;
return true;
}
/**
* This method generally mutates flattened list of tokens into tree structure.
*
* @param nodeList
* @param nodeIterator
*/
void makeTree(List nodeList, ListIterator nodeIterator, CleanTimeValues cleanTimeValues) {
// process while not reach the end of the list
while ( nodeIterator.hasNext() ) {
if (Thread.currentThread().isInterrupted()) {
handleInterruption();
return;
}
BaseToken token = nodeIterator.next();
if (token instanceof EndTagToken) {
EndTagToken endTagToken = (EndTagToken) token;
String tagName = endTagToken.name;
TagInfo tag = getTagInfo(tagName, cleanTimeValues);
//
// If the tag is a known tag (e.g. a HTML5 tag) use its correct name from spec
// (usually, its in lower case).
//
if (tag != null) {
tagName = tag.getName();
}
if ( (tag == null && properties.isOmitUnknownTags()) && !isAllowedAsForeignMarkup(tagName,cleanTimeValues) || (tag != null && tag.isDeprecated() && properties.isOmitDeprecatedTags()) ) {
//tag is either unknown or deprecated, so we just prune the end token out
nodeIterator.set(null);
} else if ( tag != null && !tag.allowsBody() ) {
//tag doesn't allow body, so end token is not needed
nodeIterator.set(null);
} else {
//trying to find corresponding opened tag for the end token
TagPos matchingPosition = getOpenTags(cleanTimeValues).findTag(tagName);
if (matchingPosition != null) {
//open tag found.. closing the node.. this will add all
//the nodes between open and end tokens to the children list of the tag node.
List closed = closeSnippet(nodeList, matchingPosition, endTagToken, cleanTimeValues);
//
// Get the open start tag. If it contained an xmlns, then we remove it from the current namespace stack
//
if (closed.size()>0){
TagNode startingTag = (TagNode) closed.get(0);
if (startingTag.hasAttribute("xmlns")){
cleanTimeValues.namespace.pop();
}
}
nodeIterator.set(null);
for (int i = closed.size() - 1; i >= 0; i--) {
TagNode closedTag = (TagNode) closed.get(i);
if ( i > 0 && tag != null && tag.isContinueAfter(closedTag.getName()) ) {
// even if pruned still want to allow a continuation.
// the nested tags that were also closed as part of the wrapping html closing.
// TODO: look at reversing hierarchy ( for example, "" reverse to )
TagNode cloned = closedTag.makeCopy();
cloned.setAutoGenerated(true);
nodeIterator.add( cloned );
nodeIterator.previous();
}
}
if(!getChildBreaks(cleanTimeValues).isEmpty()){
while(matchingPosition.position < getChildBreaks(cleanTimeValues).getLastBreakingTagPosition()){
//We're closing tag that is parent for the last closed by childbreak,
//thus we no longer need this info.
getChildBreaks(cleanTimeValues).pop();
}
}
while( !getChildBreaks(cleanTimeValues).isEmpty() && tagName.equals(getChildBreaks(cleanTimeValues).getLastBreakingTag())
&& matchingPosition.position == getChildBreaks(cleanTimeValues).getLastBreakingTagPosition()){
if(nodeList.get(getChildBreaks(cleanTimeValues).closedByChildBreak.peek().position) != null) {
//this tag has broken it's parent, thus the parent tag should be reopened.
int position = getChildBreaks(cleanTimeValues).pop().position;
Object toReopen = nodeList.get(position);
if(toReopen instanceof TagNode) {
// normal case
reopenBrokenNode(nodeIterator, (TagNode)toReopen, cleanTimeValues);
} else if (toReopen instanceof List) {
// might happen with :
// -- opens table element
//
-- added to table's itemsToMove
// -- will close first table and result in List[br, table]
//
-- will try to reopen table, but table is now a List
List tagNodes = (List) toReopen;
//
// We may have nested lists, in which case we need to flatten it first
//
tagNodes = flattenNestedList(tagNodes);
for(TagNode n : tagNodes) {
if (Thread.currentThread().isInterrupted()) {
// TODO Interruption
return;
}
nodeIterator.add(n);
makeTree(nodeList, nodeList.listIterator(nodeList.size()-1), cleanTimeValues);
}
// delete the elements from the previous position, we should not need them anymore
nodeList.set(position, null);
}
} else {
// Example of when it happens :
// Some incomplete li
//
// When starting the second li tag, it will first close p, then the previous li.
// li will then become the parent of p, and thus p will become null in the node list
// so we cannot do much about that.
// This means the HTML is messed up anyways, so we will not add a new p tag.
getChildBreaks(cleanTimeValues).pop();
}
}
}
}
} else if ( isStartToken(token) ) {
TagNode startTagToken = (TagNode) token;
String tagName = startTagToken.getName();
TagInfo tag = getTagInfo(tagName, cleanTimeValues);
TagPos lastTagPos = getOpenTags(cleanTimeValues).isEmpty() ? null : getOpenTags(cleanTimeValues).getLastTagPos();
TagInfo lastTagInfo = lastTagPos == null ? null : getTagInfo(lastTagPos.name, cleanTimeValues);
// add tag to set of all tags
cleanTimeValues.allTags.add(tagName);
//
// If this is embedded content with an assumed namespace, push the NS onto the stack.
// We generally do this for svg and math tags in HTML5, where the namespace is optional.
//
if (tag != null && tag.getAssumedNamespace() != null && !startTagToken.hasAttribute("xmlns")){
cleanTimeValues.namespace.push(tag.getAssumedNamespace());
}
//
// If there are any XMLNS attributes with prefixes, add them to the
// namespace map and pop them onto the stack
//
Iterator in = startTagToken.getAttributes().keySet().iterator();
while (in.hasNext()){
String attribute = in.next();
if (attribute.toLowerCase().indexOf("xmlns:") != -1){
String prefix = attribute.toLowerCase().split("xmlns:")[1];
String ns = startTagToken.getAttributeByName(attribute);
startTagToken.addNamespaceDeclaration(prefix.toLowerCase(), ns);
cleanTimeValues.namespaceMap.put(prefix.toLowerCase(), ns);
}
}
//
// If there is an XMLNS attribute, push a namespace
// onto the namespaces stack - this means that we
// consider child tags to be within this namespace
//
if (startTagToken.hasAttribute("xmlns")){
String ns = startTagToken.getAttributeByName("xmlns");
//
// Fix common misspellings of the XHTML namespace
//
if (ns.equals("https://www.w3.org/1999/xhtml") || ns.equals("http://w3.org/1999/xhtml")){
ns = "http://www.w3.org/1999/xhtml";
Map attributes = startTagToken.getAttributes();
attributes.put("xmlns", "http://www.w3.org/1999/xhtml");
startTagToken.setAttributes(attributes);
}
//
// If this is the HTML tag, and the namespace is the legacy HTML NS, remove the
// xmlns attribute
//
if ( "html".equals(tagName) && ns.equals("http://www.w3.org/TR/REC-html40")) {
startTagToken.removeAttribute("xmlns");
} else {
//
// Remove any empty xmlns attributes
//
if (ns.trim().isEmpty()){
startTagToken.removeAttribute("xmlns");
} else {
//
// Add the XMLNS attribute, and add the NS to the stack and the map
//
cleanTimeValues.namespace.push(ns);
startTagToken.addNamespaceDeclaration("", ns);
cleanTimeValues.namespaceMap.put("", ns);
}
}
//
// If NS-aware is set to false, we should remove the attribute
//
if (!properties.isNamespacesAware()){
startTagToken.removeAttribute("xmlns");
}
}
//
// Set the foreign markup flag if appropriate
//
if (isAllowedAsForeignMarkup(tagName, cleanTimeValues)){
startTagToken.setForeignMarkup(true);
} else {
startTagToken.setForeignMarkup(false);
}
//
// Re-obtain the name from the token now we know
// whether its native HTML or foreign markup; we
// do this because the rules are different -
// for foreign markup we want the original case,
// whereas for HTML we want lowercase.
//
tagName = startTagToken.getName();
// HTML open tag
if ( "html".equals(tagName) ) {
addAttributesToTag(cleanTimeValues.htmlNode, startTagToken.getAttributes());
nodeIterator.set(null);
// BODY open tag
} else if ( "body".equals(tagName) ) {
cleanTimeValues._bodyOpened = true;
addAttributesToTag(cleanTimeValues.bodyNode, startTagToken.getAttributes());
nodeIterator.set(null);
// HEAD open tag
} else if ( "head".equals(tagName) ) {
cleanTimeValues._headOpened = true;
addAttributesToTag(cleanTimeValues.headNode, startTagToken.getAttributes());
nodeIterator.set(null);
// unknown HTML tag and unknown tags are not allowed
// unless we have set the namespace-aware option, and the current NS is valid
} else if ( tag == null && properties.isOmitUnknownTags() && !isAllowedAsForeignMarkup(tagName, cleanTimeValues)) {
nodeIterator.set(null);
properties.fireUglyHtml(true, startTagToken, ErrorType.Unknown);
} else if ( tag != null && tag.isDeprecated() && properties.isOmitDeprecatedTags()) {
nodeIterator.set(null);
properties.fireUglyHtml(true, startTagToken, ErrorType.Deprecated);
// if current tag is unknown and last open tag doesn't allow any other tags in its body
} else if ( tag == null && lastTagInfo != null && !lastTagInfo.allowsAnything() ) {
closeSnippet(nodeList, lastTagPos, startTagToken, cleanTimeValues);
nodeIterator.previous();
} else if ( tag != null && tag.hasPermittedTags() && getOpenTags(cleanTimeValues).someAlreadyOpen(tag.getPermittedTags()) ) {
nodeIterator.set(null);
// if tag that must be unique, ignore this occurence
} else if ( tag != null && tag.isUnique() && getOpenTags(cleanTimeValues).tagEncountered(tagName) ) {
nodeIterator.set(null);
properties.fireHtmlError(true, startTagToken, ErrorType.UniqueTagDuplicated);
// if there is no required outer tag without that this open tag is ignored
} else if ( !isFatalTagSatisfied(tag, cleanTimeValues) ) {
nodeIterator.set(null);
properties.fireHtmlError(true, startTagToken, ErrorType.FatalTagMissing);
//
// The tag requires a parent tag.
//
} else if (mustAddRequiredParent(tag, cleanTimeValues)){
//
// Where there are multiple possible required parents, we add the first in the list
//
String requiredParent = tag.getRequiredParentTags().iterator().next();
TagNode requiredParentStartToken = newTagNode(requiredParent);
//
// Check the parent is allowed in this position. If it isn't, pop the tag out to the next level
//
if (isAllowedInLastOpenTag(requiredParentStartToken, cleanTimeValues)){
requiredParentStartToken.setAutoGenerated(true);
nodeIterator.previous();
nodeIterator.add(requiredParentStartToken);
nodeIterator.previous();
properties.fireHtmlError(true, startTagToken, ErrorType.RequiredParentMissing);
} else {
saveToLastOpenTag(nodeList, token, cleanTimeValues);
nodeIterator.set(null);
}
//
// if last open tag has lower precedence then this, it must be closed
//
} else if ( tag != null && lastTagPos != null && tag.isMustCloseTag(lastTagInfo) ) {
//since tag is closed earlier due to incorrect child tag, we store this info
//to reopen it later, on the child close.
getChildBreaks(cleanTimeValues).addBreak(lastTagPos, new TagPos(nodeIterator.previousIndex(), tag.getName()));
boolean certainty = startTagToken.hasAttribute("id") ? false : true;
properties.fireHtmlError(certainty, (TagNode)nodeList.get(lastTagPos.position), ErrorType.UnpermittedChild);
List closed = closeSnippet(nodeList, lastTagPos, startTagToken, cleanTimeValues);
int closedCount = closed.size();
// it is needed to copy some tags again in front of current, if there are any
if ( tag.hasCopyTags() && closedCount > 0 ) {
// first iterates over list from the back and collects all start tokens
// in sequence that must be copied
ListIterator closedIt = closed.listIterator(closedCount);
List toBeCopied = new ArrayList();
while (closedIt.hasPrevious()) {
if (Thread.currentThread().isInterrupted()) {
// TODO Interruption
return;
}
TagNode currStartToken = (TagNode) closedIt.previous();
if ( tag.isCopy(currStartToken.getName()) ) {
toBeCopied.add(0, currStartToken);
} else {
break;
}
}
if (toBeCopied.size() > 0) {
Iterator copyIt = toBeCopied.iterator();
while (copyIt.hasNext()) {
if (Thread.currentThread().isInterrupted()) {
// TODO Interruption
return;
}
TagNode currStartToken = (TagNode) copyIt.next();
if (!isCopiedTokenEqualToNextThreeCopiedTokens(currStartToken, nodeIterator)) {
nodeIterator.add(currStartToken.makeCopy());
} else {
copyIt.remove();
}
}
// back to the previous place, before adding new start tokens
for (int i = 0; i < toBeCopied.size(); i++) {
nodeIterator.previous();
}
}
}
nodeIterator.previous();
} else if ( !isAllowedInLastOpenTag(token, cleanTimeValues) ) {
//
// For some tags, rather than just move them outside of the parent, we want to push an intervening
// tag into the stack - e.g. LI in UL, TD in TR
//
TagPos last = getOpenTags(cleanTimeValues).getLastTagPos();
if (last != null && last.info != null && last.info.getPreferredChildTag()!=null){
TagNode interveningTagStartToken = newTagNode(last.info.getPreferredChildTag());
//
// Check that the intervening tag will work here and that it allows the current token as a child
//
if (
isAllowedInLastOpenTag(interveningTagStartToken, cleanTimeValues) &&
getTagInfo(last.info.getPreferredChildTag(),cleanTimeValues) != null &&
getTagInfo(last.info.getPreferredChildTag(),cleanTimeValues).allowsItem(token)
){
interveningTagStartToken.setAutoGenerated(true);
nodeIterator.previous();
nodeIterator.add(interveningTagStartToken);
nodeIterator.previous();
properties.fireHtmlError(true, startTagToken, ErrorType.RequiredParentMissing);
} else {
//
// If not, just pop the current token out
//
saveToLastOpenTag(nodeList, token, cleanTimeValues);
nodeIterator.set(null);
}
} else {
//
// if this open tag is not allowed inside last open tag, then it must be moved to the place where it can be
//
saveToLastOpenTag(nodeList, token, cleanTimeValues);
nodeIterator.set(null);
}
} else if ( tag != null && !tag.allowsBody() ) {
// if it is known HTML tag but doesn't allow body, it is immediately closed
TagNode newTagNode = createTagNode(startTagToken);
addPossibleHeadCandidate(tag, newTagNode, cleanTimeValues);
nodeIterator.set(newTagNode);
// default case - just remember this open tag and go further
} else {
getOpenTags(cleanTimeValues).addTag( tagName, nodeIterator.previousIndex() );
}
} else {
if (cleanTimeValues._headOpened && !cleanTimeValues._bodyOpened && properties.isKeepWhitespaceAndCommentsInHead()) {
if (token instanceof CommentNode) {
if (getOpenTags(cleanTimeValues).getLastTagPos()==null) {
cleanTimeValues._headTags.add(new ProxyTagNode((CommentNode)token, cleanTimeValues.bodyNode));
}
} else if (token instanceof ContentNode) {
ContentNode contentNode = (ContentNode)token;
if (contentNode.isBlank()) {
BaseToken lastTok = (BaseToken)nodeList.get(nodeList.size()-1);
if (lastTok==token) {
cleanTimeValues._headTags.add(new ProxyTagNode(contentNode, cleanTimeValues.bodyNode));
}
}
}
}
if ( !isAllowedInLastOpenTag(token, cleanTimeValues) ) {
saveToLastOpenTag(nodeList, token, cleanTimeValues);
nodeIterator.set(null);
}
}
}
}
/**
* Determines if a copied token is equal to the next 3 tokens in the iterator.
*/
private static boolean isCopiedTokenEqualToNextThreeCopiedTokens(TagNode copiedStartToken, ListIterator nodeIterator) {
int steps = 0;
int matches = 0;
while (nodeIterator.hasNext() && steps < 3) {
BaseToken nextToken = nodeIterator.next();
steps++;
if (nextToken instanceof TagNode && ((TagNode) nextToken).isCopy() && areCopiedTokensEqual((TagNode) nextToken, copiedStartToken)) {
matches++;
} else {
break;
}
}
for (int i = 0; i < steps; i++) {
nodeIterator.previous();
}
return matches == 3;
}
/**
* Flattens a list of tagnodes
*/
private List flattenNestedList(List list){
ArrayListflattenedNodeList = new ArrayList();
for (Object item : list){
if (item instanceof TagNode){
flattenedNodeList.add((TagNode)item);
} else {
if (item instanceof List){
flattenedNodeList.addAll((List)item);
}
}
}
return flattenedNodeList;
}
/**
* Determines if two copied tokens are equal.
*/
private static boolean areCopiedTokensEqual(TagNode token1, TagNode token2) {
return token1.name.equals(token2.name) &&
token1.getAttributes().equals(token2.getAttributes());
}
private void reopenBrokenNode(ListIterator nodeIterator, TagNode toReopen, CleanTimeValues cleanTimeValues) {
TagNode closedByPresidence = toReopen;
TagNode copy = closedByPresidence.makeCopy();
copy.setAutoGenerated(true);
copy.removeAttribute("id");
nodeIterator.add(copy);
getOpenTags(cleanTimeValues).addTag(closedByPresidence.getName(), nodeIterator.previousIndex());
}
/**
*
* @param startTagToken
* @return true if no id attribute or class attribute
*/
protected boolean isRemovingNodeReasonablySafe(TagNode startTagToken) {
return !startTagToken.hasAttribute("id") && !startTagToken.hasAttribute("name") && !startTagToken.hasAttribute("class");
}
private void createDocumentNodes(List listNodes, CleanTimeValues cleanTimeValues) {
Iterator it = listNodes.iterator();
while (it.hasNext()) {
Object child = it.next();
if (child == null) {
continue;
}
boolean toAdd = true;
if (child instanceof TagNode) {
TagNode node = (TagNode) child;
TagInfo tag = getTagInfoProvider().getTagInfo( node.getName() );
addPossibleHeadCandidate(tag, node, cleanTimeValues);
} else {
if (child instanceof ContentNode) {
toAdd = !"".equals(child.toString());
}
}
if (toAdd) {
cleanTimeValues.bodyNode.addChild(child);
}
}
// move all viable head candidates to head section of the tree
Iterator headIterator = cleanTimeValues._headTags.iterator();
while (headIterator.hasNext()) {
if (Thread.currentThread().isInterrupted()) {
handleInterruption();
return;
}
TagNode headCandidateNode = (TagNode) headIterator.next();
// check if this node is already inside a candidate for moving to head
TagNode parent = headCandidateNode.getParent();
boolean toMove = true;
while (parent != null) {
if ( cleanTimeValues._headTags.contains(parent) ) {
toMove = false;
break;
}
parent = parent.getParent();
}
if (toMove) {
headCandidateNode.removeFromTree();
cleanTimeValues.headNode.addChild(headCandidateNode);
}
}
}
/**
* Forced closing
* @param nodeList
* @param tagPos
* @param toNode
* @return
*/
private List closeSnippet(List nodeList, TagPos tagPos, Object toNode, CleanTimeValues cleanTimeValues) {
List closed = new ArrayList();
ListIterator it = nodeList.listIterator(tagPos.position);
TagNode tagNode = null;
Object item = it.next();
boolean isListEnd = false;
while ( (toNode == null && !isListEnd) || (toNode != null && item != toNode) ) {
if (Thread.currentThread().isInterrupted()) {
// Interruption
handleInterruption();
return closed;
}
if ( isStartToken(item) ) {
TagNode startTagToken = (TagNode) item;
closed.add(startTagToken);
List itemsToMove = startTagToken.getItemsToMove();
if (itemsToMove != null) {
pushNesting(cleanTimeValues);
makeTree(itemsToMove, itemsToMove.listIterator(0), cleanTimeValues);
closeAll(itemsToMove, cleanTimeValues);
startTagToken.setItemsToMove(null);
popNesting(cleanTimeValues);
}
TagNode newTagNode = createTagNode(startTagToken);
TagInfo tag = getTagInfo(newTagNode.getName(), cleanTimeValues);
addPossibleHeadCandidate(tag, newTagNode, cleanTimeValues);
if (tagNode != null) {
tagNode.addChildren(itemsToMove);
tagNode.addChild(newTagNode);
it.set(null);
} else {
if (itemsToMove != null) {
itemsToMove.add(newTagNode);
it.set(itemsToMove);
} else {
it.set(newTagNode);
}
}
getOpenTags(cleanTimeValues).removeTag( newTagNode.getName() );
tagNode = newTagNode;
} else {
if (tagNode != null) {
it.set(null);
if (item != null) {
tagNode.addChild(item);
}
}
}
if ( it.hasNext() ) {
item = it.next();
} else {
isListEnd = true;
}
}
return closed;
}
/**
* Close all unclosed tags if there are any.
*/
private void closeAll(List nodeList, CleanTimeValues cleanTimeValues) {
TagPos firstTagPos = getOpenTags(cleanTimeValues).findFirstTagPos();
for (TagPos pos : getOpenTags(cleanTimeValues).list) {
if (Thread.currentThread().isInterrupted()) {
handleInterruption();
return;
}
properties.fireHtmlError(true, (TagNode)nodeList.get(pos.position), ErrorType.UnclosedTag);
}
if (firstTagPos != null) {
closeSnippet(nodeList, firstTagPos, null, cleanTimeValues);
}
}
/**
* Checks if specified tag with specified info is candidate for moving to head section.
* @param tagInfo
* @param tagNode
*/
private void addPossibleHeadCandidate(TagInfo tagInfo, TagNode tagNode, CleanTimeValues cleanTimeValues) {
if (tagInfo != null && tagNode != null) {
if ( tagInfo.isHeadTag() || (tagInfo.isHeadAndBodyTag() && cleanTimeValues._headOpened && !cleanTimeValues._bodyOpened) ) {
cleanTimeValues._headTags.add(tagNode);
}
}
}
public CleanerProperties getProperties() {
return properties;
}
protected Set getPruneTagSet(CleanTimeValues cleanTimeValues) {
return cleanTimeValues.pruneTagSet;
}
protected Set getAllowTagSet(CleanTimeValues cleanTimeValues) {
return cleanTimeValues.allowTagSet;
}
protected void addPruneNode(TagNode node, CleanTimeValues cleanTimeValues) {
node.setPruned(true);
cleanTimeValues.pruneNodeSet.add(node);
}
/**
* Returns a TagInfo object for the specified tag name.
* If the tag is foreign markup, we leave it as null. This is because we may get
* name clashes, e.g. svg:title
*
* @param tagName
* @param cleanTimeValues
* @return a TagInfo object, or null if no matching TagInfo is found
*/
private TagInfo getTagInfo(String tagName, CleanTimeValues cleanTimeValues){
TagInfo tag = null;
if (!isAllowedAsForeignMarkup(tagName,cleanTimeValues)) tag = getTagInfoProvider().getTagInfo(tagName);
return tag;
}
private boolean addIfNeededToPruneSet(TagNode tagNode, CleanTimeValues cleanTimeValues) {
if ( cleanTimeValues.pruneTagSet != null ) {
for(ITagNodeCondition condition: cleanTimeValues.pruneTagSet) {
if ( condition.satisfy(tagNode)) {
addPruneNode(tagNode, cleanTimeValues);
properties.fireConditionModification(condition, tagNode);
return true;
}
}
}
if ( cleanTimeValues.allowTagSet != null && !cleanTimeValues.allowTagSet.isEmpty() ) {
for(ITagNodeCondition condition: cleanTimeValues.allowTagSet) {
if ( condition.satisfy(tagNode)) {
return false;
}
}
if (!tagNode.isAutoGenerated()) {
properties.fireUserDefinedModification(true, tagNode, ErrorType.NotAllowedTag);
}
addPruneNode(tagNode, cleanTimeValues);
return true;
}
return false;
}
protected Set getAllTags(CleanTimeValues cleanTimeValues) {
return cleanTimeValues.allTags;
}
/**
* @return ITagInfoProvider instance for this HtmlCleaner
*/
public ITagInfoProvider getTagInfoProvider() {
return this.properties.getTagInfoProvider();
}
/**
* @return Transformations defined for this instance of cleaner
*/
public CleanerTransformations getTransformations() {
return transformations;
}
/**
* For the specified node, returns it's content as string.
* @param node
* @return node's content as string
*/
public String getInnerHtml(TagNode node) {
if (node != null) {
String content = new SimpleXmlSerializer(properties).getAsString(node);
int index1 = content.indexOf("<" + node.getName());
index1 = content.indexOf('>', index1 + 1);
int index2 = content.lastIndexOf('<');
return index1 >= 0 && index1 <= index2 ? content.substring(index1 + 1, index2) : null;
} else {
throw new HtmlCleanerException("Cannot return inner html of the null node!");
}
}
/**
* For the specified tag node, defines it's html content. This causes cleaner to
* reclean given html portion and insert it inside the node instead of previous content.
* @param node
* @param content
*/
public void setInnerHtml(TagNode node, String content) {
if (node != null) {
String nodeName = node.getName();
StringBuilder html = new StringBuilder();
html.append("<").append(nodeName).append(" " +MARKER_ATTRIBUTE +"=''>").append(content).append("");
TagNode parent = node.getParent();
while (parent != null) {
String parentName = parent.getName();
html.insert(0, "<" + parentName + ">");
html.append("");
parent = parent.getParent();
}
TagNode innerRootNode = clean( html.toString() );
TagNode cleanedNode = innerRootNode.findElementHavingAttribute(MARKER_ATTRIBUTE, true);
if (cleanedNode != null) {
node.setChildren( cleanedNode.getAllChildren() );
}
}
}
/**
* @param transInfos
*/
public void initCleanerTransformations(Map transInfos) {
transformations = new CleanerTransformations(transInfos);
}
private OpenTags getOpenTags(CleanTimeValues cleanTimeValues) {
return cleanTimeValues.nestingStates.peek().getOpenTags();
}
private ChildBreaks getChildBreaks(CleanTimeValues cleanTimeValues) {
return cleanTimeValues.nestingStates.peek().getChildBreaks();
}
// TODO: better name
private NestingState pushNesting(CleanTimeValues cleanTimeValues) {
return cleanTimeValues.nestingStates.push(new NestingState());
}
private NestingState popNesting(CleanTimeValues cleanTimeValues) {
return cleanTimeValues.nestingStates.pop();
}
/**
* Called whenver the thread is interrupted. Currently this is a
* placeholder, but could hold cleanup methods and user interaction
*/
private void handleInterruption(){
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy