and
uri in the given element to an absolute URI,
- * ignoring #ref URIs.
- *
- * @param Element
- * @return void
- */
- _fixRelativeUris: function(articleContent) {
- var baseURI = this._doc.baseURI;
- var documentURI = this._doc.documentURI;
- function toAbsoluteURI(uri) {
- // Leave hash links alone if the base URI matches the document URI:
- if (baseURI == documentURI && uri.charAt(0) == "#") {
- return uri;
- }
-
- // Otherwise, resolve against base URI:
- try {
- return new URL(uri, baseURI).href;
- } catch (ex) {
- // Something went wrong, just return the original:
- }
- return uri;
- }
-
- var links = this._getAllNodesWithTag(articleContent, ["a"]);
- this._forEachNode(links, function(link) {
- var href = link.getAttribute("href");
- if (href) {
- // Remove links with javascript: URIs, since
- // they won't work after scripts have been removed from the page.
- if (href.indexOf("javascript:") === 0) {
- // if the link only contains simple text content, it can be converted to a text node
- if (link.childNodes.length === 1 && link.childNodes[0].nodeType === this.TEXT_NODE) {
- var text = this._doc.createTextNode(link.textContent);
- link.parentNode.replaceChild(text, link);
- } else {
- // if the link has multiple children, they should all be preserved
- var container = this._doc.createElement("span");
- while (link.childNodes.length > 0) {
- container.appendChild(link.childNodes[0]);
- }
- link.parentNode.replaceChild(container, link);
- }
- } else {
- link.setAttribute("href", toAbsoluteURI(href));
- }
- }
- });
-
- var medias = this._getAllNodesWithTag(articleContent, [
- "img", "picture", "figure", "video", "audio", "source"
- ]);
-
- this._forEachNode(medias, function(media) {
- var src = media.getAttribute("src");
- var poster = media.getAttribute("poster");
- var srcset = media.getAttribute("srcset");
-
- if (src) {
- media.setAttribute("src", toAbsoluteURI(src));
- }
-
- if (poster) {
- media.setAttribute("poster", toAbsoluteURI(poster));
- }
-
- if (srcset) {
- var newSrcset = srcset.replace(this.REGEXPS.srcsetUrl, function(_, p1, p2, p3) {
- return toAbsoluteURI(p1) + (p2 || "") + p3;
- });
-
- media.setAttribute("srcset", newSrcset);
- }
- });
- },
-
- /**
- * Get the article title as an H1.
- *
- * @return void
- **/
- _getArticleTitle: function() {
- var doc = this._doc;
- var curTitle = "";
- var origTitle = "";
-
- try {
- curTitle = origTitle = doc.title.trim();
-
- // If they had an element with id "title" in their HTML
- if (typeof curTitle !== "string")
- curTitle = origTitle = this._getInnerText(doc.getElementsByTagName("title")[0]);
- } catch (e) {/* ignore exceptions setting the title. */}
-
- var titleHadHierarchicalSeparators = false;
- function wordCount(str) {
- return str.split(/\s+/).length;
- }
-
- // If there's a separator in the title, first remove the final part
- if ((/ [\|\-\\\/>»] /).test(curTitle)) {
- titleHadHierarchicalSeparators = / [\\\/>»] /.test(curTitle);
- curTitle = origTitle.replace(/(.*)[\|\-\\\/>»] .*/gi, "$1");
-
- // If the resulting title is too short (3 words or fewer), remove
- // the first part instead:
- if (wordCount(curTitle) < 3)
- curTitle = origTitle.replace(/[^\|\-\\\/>»]*[\|\-\\\/>»](.*)/gi, "$1");
- } else if (curTitle.indexOf(": ") !== -1) {
- // Check if we have an heading containing this exact string, so we
- // could assume it's the full title.
- var headings = this._concatNodeLists(
- doc.getElementsByTagName("h1"),
- doc.getElementsByTagName("h2")
- );
- var trimmedTitle = curTitle.trim();
- var match = this._someNode(headings, function(heading) {
- return heading.textContent.trim() === trimmedTitle;
- });
-
- // If we don't, let's extract the title out of the original title string.
- if (!match) {
- curTitle = origTitle.substring(origTitle.lastIndexOf(":") + 1);
-
- // If the title is now too short, try the first colon instead:
- if (wordCount(curTitle) < 3) {
- curTitle = origTitle.substring(origTitle.indexOf(":") + 1);
- // But if we have too many words before the colon there's something weird
- // with the titles and the H tags so let's just use the original title instead
- } else if (wordCount(origTitle.substr(0, origTitle.indexOf(":"))) > 5) {
- curTitle = origTitle;
- }
- }
- } else if (curTitle.length > 150 || curTitle.length < 15) {
- var hOnes = doc.getElementsByTagName("h1");
-
- if (hOnes.length === 1)
- curTitle = this._getInnerText(hOnes[0]);
- }
-
- curTitle = curTitle.trim().replace(this.REGEXPS.normalize, " ");
- // If we now have 4 words or fewer as our title, and either no
- // 'hierarchical' separators (\, /, > or ») were found in the original
- // title or we decreased the number of words by more than 1 word, use
- // the original title.
- var curTitleWordCount = wordCount(curTitle);
- if (curTitleWordCount <= 4 &&
- (!titleHadHierarchicalSeparators ||
- curTitleWordCount != wordCount(origTitle.replace(/[\|\-\\\/>»]+/g, "")) - 1)) {
- curTitle = origTitle;
- }
-
- return curTitle;
- },
-
- /**
- * Prepare the HTML document for readability to scrape it.
- * This includes things like stripping javascript, CSS, and handling terrible markup.
- *
- * @return void
- **/
- _prepDocument: function() {
- var doc = this._doc;
-
- // Remove all style tags in head
- this._removeNodes(this._getAllNodesWithTag(doc, ["style"]));
-
- if (doc.body) {
- this._replaceBrs(doc.body);
- }
-
- this._replaceNodeTags(this._getAllNodesWithTag(doc, ["font"]), "SPAN");
- },
-
- /**
- * Finds the next element, starting from the given node, and ignoring
- * whitespace in between. If the given node is an element, the same node is
- * returned.
- */
- _nextElement: function (node) {
- var next = node;
- while (next
- && (next.nodeType != this.ELEMENT_NODE)
- && this.REGEXPS.whitespace.test(next.textContent)) {
- next = next.nextSibling;
- }
- return next;
- },
-
- /**
- * Replaces 2 or more successive
elements with a single .
- * Whitespace between
elements are ignored. For example:
- *
foo
bar
abc
- * will become:
- *
- */
- _replaceBrs: function (elem) {
- this._forEachNode(this._getAllNodesWithTag(elem, ["br"]), function(br) {
- var next = br.nextSibling;
-
- // Whether 2 or more
elements have been found and replaced with a
- // block.
- var replaced = false;
-
- // If we find a
chain, remove the
s until we hit another element
- // or non-whitespace. This leaves behind the first
in the chain
- // (which will be replaced with a
later).
- while ((next = this._nextElement(next)) && (next.tagName == "BR")) {
- replaced = true;
- var brSibling = next.nextSibling;
- next.parentNode.removeChild(next);
- next = brSibling;
- }
-
- // If we removed a
chain, replace the remaining
with a
. Add
- // all sibling nodes as children of the
until we hit another
- // chain.
- if (replaced) {
- var p = this._doc.createElement("p");
- br.parentNode.replaceChild(p, br);
-
- next = p.nextSibling;
- while (next) {
- // If we've hit another
, we're done adding children to this
.
- if (next.tagName == "BR") {
- var nextElem = this._nextElement(next.nextSibling);
- if (nextElem && nextElem.tagName == "BR")
- break;
- }
-
- if (!this._isPhrasingContent(next))
- break;
-
- // Otherwise, make this node a child of the new
.
- var sibling = next.nextSibling;
- p.appendChild(next);
- next = sibling;
- }
-
- while (p.lastChild && this._isWhitespace(p.lastChild)) {
- p.removeChild(p.lastChild);
- }
-
- if (p.parentNode.tagName === "P")
- this._setNodeTag(p.parentNode, "DIV");
- }
- });
- },
-
- _setNodeTag: function (node, tag) {
- this.log("_setNodeTag", node, tag);
- if (this._docJSDOMParser) {
- node.localName = tag.toLowerCase();
- node.tagName = tag.toUpperCase();
- return node;
- }
-
- var replacement = node.ownerDocument.createElement(tag);
- while (node.firstChild) {
- replacement.appendChild(node.firstChild);
- }
- node.parentNode.replaceChild(replacement, node);
- if (node.readability)
- replacement.readability = node.readability;
-
- for (var i = 0; i < node.attributes.length; i++) {
- try {
- replacement.setAttribute(node.attributes[i].name, node.attributes[i].value);
- } catch (ex) {
- /* it's possible for setAttribute() to throw if the attribute name
- * isn't a valid XML Name. Such attributes can however be parsed from
- * source in HTML docs, see https://github.com/whatwg/html/issues/4275,
- * so we can hit them here and then throw. We don't care about such
- * attributes so we ignore them.
- */
- }
- }
- return replacement;
- },
-
- /**
- * Prepare the article node for display. Clean out any inline styles,
- * iframes, forms, strip extraneous
tags, etc.
- *
- * @param Element
- * @return void
- **/
- _prepArticle: function(articleContent) {
- this._cleanStyles(articleContent);
-
- // Check for data tables before we continue, to avoid removing items in
- // those tables, which will often be isolated even though they're
- // visually linked to other content-ful elements (text, images, etc.).
- this._markDataTables(articleContent);
-
- this._fixLazyImages(articleContent);
-
- // Clean out junk from the article content
- this._cleanConditionally(articleContent, "form");
- this._cleanConditionally(articleContent, "fieldset");
- this._clean(articleContent, "object");
- this._clean(articleContent, "embed");
- this._clean(articleContent, "h1");
- this._clean(articleContent, "footer");
- this._clean(articleContent, "link");
- this._clean(articleContent, "aside");
-
- // Clean out elements with little content that have "share" in their id/class combinations from final top candidates,
- // which means we don't remove the top candidates even they have "share".
-
- var shareElementThreshold = this.DEFAULT_CHAR_THRESHOLD;
-
- this._forEachNode(articleContent.children, function (topCandidate) {
- this._cleanMatchedNodes(topCandidate, function (node, matchString) {
- return this.REGEXPS.shareElements.test(matchString) && node.textContent.length < shareElementThreshold;
- });
- });
-
- // If there is only one h2 and its text content substantially equals article title,
- // they are probably using it as a header and not a subheader,
- // so remove it since we already extract the title separately.
- var h2 = articleContent.getElementsByTagName("h2");
- if (h2.length === 1) {
- var lengthSimilarRate = (h2[0].textContent.length - this._articleTitle.length) / this._articleTitle.length;
- if (Math.abs(lengthSimilarRate) < 0.5) {
- var titlesMatch = false;
- if (lengthSimilarRate > 0) {
- titlesMatch = h2[0].textContent.includes(this._articleTitle);
- } else {
- titlesMatch = this._articleTitle.includes(h2[0].textContent);
- }
- if (titlesMatch) {
- this._clean(articleContent, "h2");
- }
- }
- }
-
- this._clean(articleContent, "iframe");
- this._clean(articleContent, "input");
- this._clean(articleContent, "textarea");
- this._clean(articleContent, "select");
- this._clean(articleContent, "button");
- this._cleanHeaders(articleContent);
-
- // Do these last as the previous stuff may have removed junk
- // that will affect these
- this._cleanConditionally(articleContent, "table");
- this._cleanConditionally(articleContent, "ul");
- this._cleanConditionally(articleContent, "div");
-
- // Remove extra paragraphs
- this._removeNodes(this._getAllNodesWithTag(articleContent, ["p"]), function (paragraph) {
- var imgCount = paragraph.getElementsByTagName("img").length;
- var embedCount = paragraph.getElementsByTagName("embed").length;
- var objectCount = paragraph.getElementsByTagName("object").length;
- // At this point, nasty iframes have been removed, only remain embedded video ones.
- var iframeCount = paragraph.getElementsByTagName("iframe").length;
- var totalCount = imgCount + embedCount + objectCount + iframeCount;
-
- return totalCount === 0 && !this._getInnerText(paragraph, false);
- });
-
- this._forEachNode(this._getAllNodesWithTag(articleContent, ["br"]), function(br) {
- var next = this._nextElement(br.nextSibling);
- if (next && next.tagName == "P")
- br.parentNode.removeChild(br);
- });
-
- // Remove single-cell tables
- this._forEachNode(this._getAllNodesWithTag(articleContent, ["table"]), function(table) {
- var tbody = this._hasSingleTagInsideElement(table, "TBODY") ? table.firstElementChild : table;
- if (this._hasSingleTagInsideElement(tbody, "TR")) {
- var row = tbody.firstElementChild;
- if (this._hasSingleTagInsideElement(row, "TD")) {
- var cell = row.firstElementChild;
- cell = this._setNodeTag(cell, this._everyNode(cell.childNodes, this._isPhrasingContent) ? "P" : "DIV");
- table.parentNode.replaceChild(cell, table);
- }
- }
- });
- },
-
- /**
- * Initialize a node with the readability object. Also checks the
- * className/id for special names to add to its score.
- *
- * @param Element
- * @return void
- **/
- _initializeNode: function(node) {
- node.readability = {"contentScore": 0};
-
- switch (node.tagName) {
- case "DIV":
- node.readability.contentScore += 5;
- break;
-
- case "PRE":
- case "TD":
- case "BLOCKQUOTE":
- node.readability.contentScore += 3;
- break;
-
- case "ADDRESS":
- case "OL":
- case "UL":
- case "DL":
- case "DD":
- case "DT":
- case "LI":
- case "FORM":
- node.readability.contentScore -= 3;
- break;
-
- case "H1":
- case "H2":
- case "H3":
- case "H4":
- case "H5":
- case "H6":
- case "TH":
- node.readability.contentScore -= 5;
- break;
- }
-
- node.readability.contentScore += this._getClassWeight(node);
- },
-
- _removeAndGetNext: function(node) {
- var nextNode = this._getNextNode(node, true);
- node.parentNode.removeChild(node);
- return nextNode;
- },
-
- /**
- * Traverse the DOM from node to node, starting at the node passed in.
- * Pass true for the second parameter to indicate this node itself
- * (and its kids) are going away, and we want the next node over.
- *
- * Calling this in a loop will traverse the DOM depth-first.
- */
- _getNextNode: function(node, ignoreSelfAndKids) {
- // First check for kids if those aren't being ignored
- if (!ignoreSelfAndKids && node.firstElementChild) {
- return node.firstElementChild;
- }
- // Then for siblings...
- if (node.nextElementSibling) {
- return node.nextElementSibling;
- }
- // And finally, move up the parent chain *and* find a sibling
- // (because this is depth-first traversal, we will have already
- // seen the parent nodes themselves).
- do {
- node = node.parentNode;
- } while (node && !node.nextElementSibling);
- return node && node.nextElementSibling;
- },
-
- _checkByline: function(node, matchString) {
- if (this._articleByline) {
- return false;
- }
-
- if (node.getAttribute !== undefined) {
- var rel = node.getAttribute("rel");
- var itemprop = node.getAttribute("itemprop");
- }
-
- if ((rel === "author" || (itemprop && itemprop.indexOf("author") !== -1) || this.REGEXPS.byline.test(matchString)) && this._isValidByline(node.textContent)) {
- this._articleByline = node.textContent.trim();
- return true;
- }
-
- return false;
- },
-
- _getNodeAncestors: function(node, maxDepth) {
- maxDepth = maxDepth || 0;
- var i = 0, ancestors = [];
- while (node.parentNode) {
- ancestors.push(node.parentNode);
- if (maxDepth && ++i === maxDepth)
- break;
- node = node.parentNode;
- }
- return ancestors;
- },
-
- /***
- * grabArticle - Using a variety of metrics (content score, classname, element types), find the content that is
- * most likely to be the stuff a user wants to read. Then return it wrapped up in a div.
- *
- * @param page a document to run upon. Needs to be a full document, complete with body.
- * @return Element
- **/
- _grabArticle: function (page) {
- this.log("**** grabArticle ****");
- var doc = this._doc;
- var isPaging = (page !== null ? true: false);
- page = page ? page : this._doc.body;
-
- // We can't grab an article if we don't have a page!
- if (!page) {
- this.log("No body found in document. Abort.");
- return null;
- }
-
- var pageCacheHtml = page.innerHTML;
-
- while (true) {
- var stripUnlikelyCandidates = this._flagIsActive(this.FLAG_STRIP_UNLIKELYS);
-
- // First, node prepping. Trash nodes that look cruddy (like ones with the
- // class name "comment", etc), and turn divs into P tags where they have been
- // used inappropriately (as in, where they contain no other block level elements.)
- var elementsToScore = [];
- var node = this._doc.documentElement;
-
- while (node) {
- var matchString = node.className + " " + node.id;
-
- if (!this._isProbablyVisible(node)) {
- this.log("Removing hidden node - " + matchString);
- node = this._removeAndGetNext(node);
- continue;
- }
-
- // Check to see if this node is a byline, and remove it if it is.
- if (this._checkByline(node, matchString)) {
- node = this._removeAndGetNext(node);
- continue;
- }
-
- // Remove unlikely candidates
- if (stripUnlikelyCandidates) {
- if (this.REGEXPS.unlikelyCandidates.test(matchString) &&
- !this.REGEXPS.okMaybeItsACandidate.test(matchString) &&
- !this._hasAncestorTag(node, "table") &&
- node.tagName !== "BODY" &&
- node.tagName !== "A") {
- this.log("Removing unlikely candidate - " + matchString);
- node = this._removeAndGetNext(node);
- continue;
- }
-
- if (node.getAttribute("role") == "complementary") {
- this.log("Removing complementary content - " + matchString);
- node = this._removeAndGetNext(node);
- continue;
- }
- }
-
- // Remove DIV, SECTION, and HEADER nodes without any content(e.g. text, image, video, or iframe).
- if ((node.tagName === "DIV" || node.tagName === "SECTION" || node.tagName === "HEADER" ||
- node.tagName === "H1" || node.tagName === "H2" || node.tagName === "H3" ||
- node.tagName === "H4" || node.tagName === "H5" || node.tagName === "H6") &&
- this._isElementWithoutContent(node)) {
- node = this._removeAndGetNext(node);
- continue;
- }
-
- if (this.DEFAULT_TAGS_TO_SCORE.indexOf(node.tagName) !== -1) {
- elementsToScore.push(node);
- }
-
- // Turn all divs that don't have children block level elements into p's
- if (node.tagName === "DIV") {
- // Put phrasing content into paragraphs.
- var p = null;
- var childNode = node.firstChild;
- while (childNode) {
- var nextSibling = childNode.nextSibling;
- if (this._isPhrasingContent(childNode)) {
- if (p !== null) {
- p.appendChild(childNode);
- } else if (!this._isWhitespace(childNode)) {
- p = doc.createElement("p");
- node.replaceChild(p, childNode);
- p.appendChild(childNode);
- }
- } else if (p !== null) {
- while (p.lastChild && this._isWhitespace(p.lastChild)) {
- p.removeChild(p.lastChild);
- }
- p = null;
- }
- childNode = nextSibling;
- }
-
- // Sites like http://mobile.slate.com encloses each paragraph with a DIV
- // element. DIVs with only a P element inside and no text content can be
- // safely converted into plain P elements to avoid confusing the scoring
- // algorithm with DIVs with are, in practice, paragraphs.
- if (this._hasSingleTagInsideElement(node, "P") && this._getLinkDensity(node) < 0.25) {
- var newNode = node.children[0];
- node.parentNode.replaceChild(newNode, node);
- node = newNode;
- elementsToScore.push(node);
- } else if (!this._hasChildBlockElement(node)) {
- node = this._setNodeTag(node, "P");
- elementsToScore.push(node);
- }
- }
- node = this._getNextNode(node);
- }
-
- /**
- * Loop through all paragraphs, and assign a score to them based on how content-y they look.
- * Then add their score to their parent node.
- *
- * A score is determined by things like number of commas, class names, etc. Maybe eventually link density.
- **/
- var candidates = [];
- this._forEachNode(elementsToScore, function(elementToScore) {
- if (!elementToScore.parentNode || typeof(elementToScore.parentNode.tagName) === "undefined")
- return;
-
- // If this paragraph is less than 25 characters, don't even count it.
- var innerText = this._getInnerText(elementToScore);
- if (innerText.length < 25)
- return;
-
- // Exclude nodes with no ancestor.
- var ancestors = this._getNodeAncestors(elementToScore, 3);
- if (ancestors.length === 0)
- return;
-
- var contentScore = 0;
-
- // Add a point for the paragraph itself as a base.
- contentScore += 1;
-
- // Add points for any commas within this paragraph.
- contentScore += innerText.split(",").length;
-
- // For every 100 characters in this paragraph, add another point. Up to 3 points.
- contentScore += Math.min(Math.floor(innerText.length / 100), 3);
-
- // Initialize and score ancestors.
- this._forEachNode(ancestors, function(ancestor, level) {
- if (!ancestor.tagName || !ancestor.parentNode || typeof(ancestor.parentNode.tagName) === "undefined")
- return;
-
- if (typeof(ancestor.readability) === "undefined") {
- this._initializeNode(ancestor);
- candidates.push(ancestor);
- }
-
- // Node score divider:
- // - parent: 1 (no division)
- // - grandparent: 2
- // - great grandparent+: ancestor level * 3
- if (level === 0)
- var scoreDivider = 1;
- else if (level === 1)
- scoreDivider = 2;
- else
- scoreDivider = level * 3;
- ancestor.readability.contentScore += contentScore / scoreDivider;
- });
- });
-
- // After we've calculated scores, loop through all of the possible
- // candidate nodes we found and find the one with the highest score.
- var topCandidates = [];
- for (var c = 0, cl = candidates.length; c < cl; c += 1) {
- var candidate = candidates[c];
-
- // Scale the final candidates score based on link density. Good content
- // should have a relatively small link density (5% or less) and be mostly
- // unaffected by this operation.
- var candidateScore = candidate.readability.contentScore * (1 - this._getLinkDensity(candidate));
- candidate.readability.contentScore = candidateScore;
-
- this.log("Candidate:", candidate, "with score " + candidateScore);
-
- for (var t = 0; t < this._nbTopCandidates; t++) {
- var aTopCandidate = topCandidates[t];
-
- if (!aTopCandidate || candidateScore > aTopCandidate.readability.contentScore) {
- topCandidates.splice(t, 0, candidate);
- if (topCandidates.length > this._nbTopCandidates)
- topCandidates.pop();
- break;
- }
- }
- }
-
- var topCandidate = topCandidates[0] || null;
- var neededToCreateTopCandidate = false;
- var parentOfTopCandidate;
-
- // If we still have no top candidate, just use the body as a last resort.
- // We also have to copy the body node so it is something we can modify.
- if (topCandidate === null || topCandidate.tagName === "BODY") {
- // Move all of the page's children into topCandidate
- topCandidate = doc.createElement("DIV");
- neededToCreateTopCandidate = true;
- // Move everything (not just elements, also text nodes etc.) into the container
- // so we even include text directly in the body:
- var kids = page.childNodes;
- while (kids.length) {
- this.log("Moving child out:", kids[0]);
- topCandidate.appendChild(kids[0]);
- }
-
- page.appendChild(topCandidate);
-
- this._initializeNode(topCandidate);
- } else if (topCandidate) {
- // Find a better top candidate node if it contains (at least three) nodes which belong to `topCandidates` array
- // and whose scores are quite closed with current `topCandidate` node.
- var alternativeCandidateAncestors = [];
- for (var i = 1; i < topCandidates.length; i++) {
- if (topCandidates[i].readability.contentScore / topCandidate.readability.contentScore >= 0.75) {
- alternativeCandidateAncestors.push(this._getNodeAncestors(topCandidates[i]));
- }
- }
- var MINIMUM_TOPCANDIDATES = 3;
- if (alternativeCandidateAncestors.length >= MINIMUM_TOPCANDIDATES) {
- parentOfTopCandidate = topCandidate.parentNode;
- while (parentOfTopCandidate.tagName !== "BODY") {
- var listsContainingThisAncestor = 0;
- for (var ancestorIndex = 0; ancestorIndex < alternativeCandidateAncestors.length && listsContainingThisAncestor < MINIMUM_TOPCANDIDATES; ancestorIndex++) {
- listsContainingThisAncestor += Number(alternativeCandidateAncestors[ancestorIndex].includes(parentOfTopCandidate));
- }
- if (listsContainingThisAncestor >= MINIMUM_TOPCANDIDATES) {
- topCandidate = parentOfTopCandidate;
- break;
- }
- parentOfTopCandidate = parentOfTopCandidate.parentNode;
- }
- }
- if (!topCandidate.readability) {
- this._initializeNode(topCandidate);
- }
-
- // Because of our bonus system, parents of candidates might have scores
- // themselves. They get half of the node. There won't be nodes with higher
- // scores than our topCandidate, but if we see the score going *up* in the first
- // few steps up the tree, that's a decent sign that there might be more content
- // lurking in other places that we want to unify in. The sibling stuff
- // below does some of that - but only if we've looked high enough up the DOM
- // tree.
- parentOfTopCandidate = topCandidate.parentNode;
- var lastScore = topCandidate.readability.contentScore;
- // The scores shouldn't get too low.
- var scoreThreshold = lastScore / 3;
- while (parentOfTopCandidate.tagName !== "BODY") {
- if (!parentOfTopCandidate.readability) {
- parentOfTopCandidate = parentOfTopCandidate.parentNode;
- continue;
- }
- var parentScore = parentOfTopCandidate.readability.contentScore;
- if (parentScore < scoreThreshold)
- break;
- if (parentScore > lastScore) {
- // Alright! We found a better parent to use.
- topCandidate = parentOfTopCandidate;
- break;
- }
- lastScore = parentOfTopCandidate.readability.contentScore;
- parentOfTopCandidate = parentOfTopCandidate.parentNode;
- }
-
- // If the top candidate is the only child, use parent instead. This will help sibling
- // joining logic when adjacent content is actually located in parent's sibling node.
- parentOfTopCandidate = topCandidate.parentNode;
- while (parentOfTopCandidate.tagName != "BODY" && parentOfTopCandidate.children.length == 1) {
- topCandidate = parentOfTopCandidate;
- parentOfTopCandidate = topCandidate.parentNode;
- }
- if (!topCandidate.readability) {
- this._initializeNode(topCandidate);
- }
- }
-
- // Now that we have the top candidate, look through its siblings for content
- // that might also be related. Things like preambles, content split by ads
- // that we removed, etc.
- var articleContent = doc.createElement("DIV");
- if (isPaging)
- articleContent.id = "readability-content";
-
- var siblingScoreThreshold = Math.max(10, topCandidate.readability.contentScore * 0.2);
- // Keep potential top candidate's parent node to try to get text direction of it later.
- parentOfTopCandidate = topCandidate.parentNode;
- var siblings = parentOfTopCandidate.children;
-
- for (var s = 0, sl = siblings.length; s < sl; s++) {
- var sibling = siblings[s];
- var append = false;
-
- this.log("Looking at sibling node:", sibling, sibling.readability ? ("with score " + sibling.readability.contentScore) : "");
- this.log("Sibling has score", sibling.readability ? sibling.readability.contentScore : "Unknown");
-
- if (sibling === topCandidate) {
- append = true;
- } else {
- var contentBonus = 0;
-
- // Give a bonus if sibling nodes and top candidates have the example same classname
- if (sibling.className === topCandidate.className && topCandidate.className !== "")
- contentBonus += topCandidate.readability.contentScore * 0.2;
-
- if (sibling.readability &&
- ((sibling.readability.contentScore + contentBonus) >= siblingScoreThreshold)) {
- append = true;
- } else if (sibling.nodeName === "P") {
- var linkDensity = this._getLinkDensity(sibling);
- var nodeContent = this._getInnerText(sibling);
- var nodeLength = nodeContent.length;
-
- if (nodeLength > 80 && linkDensity < 0.25) {
- append = true;
- } else if (nodeLength < 80 && nodeLength > 0 && linkDensity === 0 &&
- nodeContent.search(/\.( |$)/) !== -1) {
- append = true;
- }
- }
- }
-
- if (append) {
- this.log("Appending node:", sibling);
-
- if (this.ALTER_TO_DIV_EXCEPTIONS.indexOf(sibling.nodeName) === -1) {
- // We have a node that isn't a common block level element, like a form or td tag.
- // Turn it into a div so it doesn't get filtered out later by accident.
- this.log("Altering sibling:", sibling, "to div.");
-
- sibling = this._setNodeTag(sibling, "DIV");
- }
-
- articleContent.appendChild(sibling);
- // siblings is a reference to the children array, and
- // sibling is removed from the array when we call appendChild().
- // As a result, we must revisit this index since the nodes
- // have been shifted.
- s -= 1;
- sl -= 1;
- }
- }
-
- if (this._debug)
- this.log("Article content pre-prep: " + articleContent.innerHTML);
- // So we have all of the content that we need. Now we clean it up for presentation.
- this._prepArticle(articleContent);
- if (this._debug)
- this.log("Article content post-prep: " + articleContent.innerHTML);
-
- if (neededToCreateTopCandidate) {
- // We already created a fake div thing, and there wouldn't have been any siblings left
- // for the previous loop, so there's no point trying to create a new div, and then
- // move all the children over. Just assign IDs and class names here. No need to append
- // because that already happened anyway.
- topCandidate.id = "readability-page-1";
- topCandidate.className = "page";
- } else {
- var div = doc.createElement("DIV");
- div.id = "readability-page-1";
- div.className = "page";
- var children = articleContent.childNodes;
- while (children.length) {
- div.appendChild(children[0]);
- }
- articleContent.appendChild(div);
- }
-
- 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
- // finding the content, and the sieve approach gives us a higher likelihood of
- // 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)) {
- this._removeFlag(this.FLAG_STRIP_UNLIKELYS);
- this._attempts.push({articleContent: articleContent, textLength: textLength});
- } else if (this._flagIsActive(this.FLAG_WEIGHT_CLASSES)) {
- this._removeFlag(this.FLAG_WEIGHT_CLASSES);
- this._attempts.push({articleContent: articleContent, textLength: textLength});
- } else if (this._flagIsActive(this.FLAG_CLEAN_CONDITIONALLY)) {
- this._removeFlag(this.FLAG_CLEAN_CONDITIONALLY);
- this._attempts.push({articleContent: articleContent, textLength: textLength});
- } else {
- this._attempts.push({articleContent: articleContent, textLength: textLength});
- // No luck after removing flags, just return the longest text we found during the different loops
- this._attempts.sort(function (a, b) {
- return b.textLength - a.textLength;
- });
-
- // But first check if we actually have something
- if (!this._attempts[0].textLength) {
- return null;
- }
-
- 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) {
- if (!ancestor.tagName)
- return false;
- var articleDir = ancestor.getAttribute("dir");
- if (articleDir) {
- this._articleDir = articleDir;
- return true;
- }
- return false;
- });
- return articleContent;
- }
- }
- },
-
- /**
- * Check whether the input string could be a byline.
- * This verifies that the input is a string, and that the length
- * is less than 100 chars.
- *
- * @param possibleByline {string} - a string to check whether its a byline.
- * @return Boolean - whether the input string is a byline.
- */
- _isValidByline: function(byline) {
- if (typeof byline == "string" || byline instanceof String) {
- byline = byline.trim();
- return (byline.length > 0) && (byline.length < 100);
- }
- return false;
- },
-
- /**
- * Converts some of the common HTML entities in string to their corresponding characters.
- *
- * @param str {string} - a string to unescape.
- * @return string without HTML entity.
- */
- _unescapeHtmlEntities: function(str) {
- if (!str) {
- return str;
- }
-
- var htmlEscapeMap = this.HTML_ESCAPE_MAP;
- return str.replace(/&(quot|amp|apos|lt|gt);/g, function(_, tag) {
- return htmlEscapeMap[tag];
- }).replace(/(?:x([0-9a-z]{1,4})|([0-9]{1,4}));/gi, function(_, hex, numStr) {
- var num = parseInt(hex || numStr, hex ? 16 : 10);
- return String.fromCharCode(num);
- });
- },
-
- /**
- * Attempts to get excerpt and byline metadata for the article.
- *
- * @return Object with optional "excerpt" and "byline" properties
- */
- _getArticleMetadata: function() {
- var metadata = {};
- var values = {};
- var metaElements = this._doc.getElementsByTagName("meta");
-
- // property is a space-separated list of values
- var propertyPattern = /\s*(dc|dcterm|og|twitter)\s*:\s*(author|creator|description|title|site_name)\s*/gi;
-
- // name is a single value
- var namePattern = /^\s*(?:(dc|dcterm|og|twitter|weibo:(article|webpage))\s*[\.:]\s*)?(author|creator|description|title|site_name)\s*$/i;
-
- // Find description tags.
- this._forEachNode(metaElements, function(element) {
- var elementName = element.getAttribute("name");
- var elementProperty = element.getAttribute("property");
- var content = element.getAttribute("content");
- if (!content) {
- return;
- }
- var matches = null;
- var name = null;
-
- if (elementProperty) {
- matches = elementProperty.match(propertyPattern);
- if (matches) {
- for (var i = matches.length - 1; i >= 0; i--) {
- // Convert to lowercase, and remove any whitespace
- // so we can match below.
- name = matches[i].toLowerCase().replace(/\s/g, "");
- // multiple authors
- values[name] = content.trim();
- }
- }
- }
- if (!matches && elementName && namePattern.test(elementName)) {
- name = elementName;
- if (content) {
- // Convert to lowercase, remove any whitespace, and convert dots
- // to colons so we can match below.
- name = name.toLowerCase().replace(/\s/g, "").replace(/\./g, ":");
- values[name] = content.trim();
- }
- }
- });
-
- // get title
- metadata.title = values["dc:title"] ||
- values["dcterm:title"] ||
- values["og:title"] ||
- values["weibo:article:title"] ||
- values["weibo:webpage:title"] ||
- values["title"] ||
- values["twitter:title"];
-
- if (!metadata.title) {
- metadata.title = this._getArticleTitle();
- }
-
- // get author
- metadata.byline = values["dc:creator"] ||
- values["dcterm:creator"] ||
- values["author"];
-
- // get description
- metadata.excerpt = values["dc:description"] ||
- values["dcterm:description"] ||
- values["og:description"] ||
- values["weibo:article:description"] ||
- values["weibo:webpage:description"] ||
- values["description"] ||
- values["twitter:description"];
-
- // get site name
- metadata.siteName = values["og:site_name"];
-
- // in many sites the meta value is escaped with HTML entities,
- // so here we need to unescape it
- metadata.title = this._unescapeHtmlEntities(metadata.title);
- metadata.byline = this._unescapeHtmlEntities(metadata.byline);
- metadata.excerpt = this._unescapeHtmlEntities(metadata.excerpt);
- metadata.siteName = this._unescapeHtmlEntities(metadata.siteName);
-
- return metadata;
- },
-
- /**
- * Check if node is image, or if node contains exactly only one image
- * whether as a direct child or as its descendants.
- *
- * @param Element
- **/
- _isSingleImage: function(node) {
- if (node.tagName === "IMG") {
- return true;
- }
-
- if (node.children.length !== 1 || node.textContent.trim() !== "") {
- return false;
- }
-
- return this._isSingleImage(node.children[0]);
- },
-
- /**
- * Find all