|
|
|
@ -1071,8 +1071,6 @@ Readability.prototype = {
|
|
|
|
|
if (this._debug)
|
|
|
|
|
this.log("Article content after paging: " + articleContent.innerHTML);
|
|
|
|
|
|
|
|
|
|
var parseSuccessful = true;
|
|
|
|
|
|
|
|
|
|
// Now that we've gone through the full algorithm, check to see if
|
|
|
|
|
// we got any meaningful content. If we didn't, we may need to re-run
|
|
|
|
|
// grabArticle with different flags set. This gives us a higher likelihood of
|
|
|
|
@ -1080,7 +1078,6 @@ Readability.prototype = {
|
|
|
|
|
// finding the -right- content.
|
|
|
|
|
var textLength = this._getInnerText(articleContent, true).length;
|
|
|
|
|
if (textLength < this._charThreshold) {
|
|
|
|
|
parseSuccessful = false;
|
|
|
|
|
page.innerHTML = pageCacheHtml;
|
|
|
|
|
|
|
|
|
|
if (this._flagIsActive(this.FLAG_STRIP_UNLIKELYS)) {
|
|
|
|
@ -1105,11 +1102,9 @@ Readability.prototype = {
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
articleContent = this._attempts[0].articleContent;
|
|
|
|
|
parseSuccessful = true;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (parseSuccessful) {
|
|
|
|
|
// Find out text direction from ancestors of final top candidate.
|
|
|
|
|
var ancestors = [parentOfTopCandidate, topCandidate].concat(this._getNodeAncestors(parentOfTopCandidate));
|
|
|
|
|
this._someNode(ancestors, function(ancestor) {
|
|
|
|
@ -1124,7 +1119,6 @@ Readability.prototype = {
|
|
|
|
|
});
|
|
|
|
|
return articleContent;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
},
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|