Run results for: 121312312312

Test name	Executions per second
✓ 2312312	695,837,376 Ops/sec
1213123123	0 Ops/sec
Script Preparation code:
function nextNode(node) {
    if (node.hasChildNodes()) {
        return node.firstChild;
    } else {
        while (node && !node.nextSibling) {
            node = node.parentNode;
        }
        if (!node) {
            return null;
        }
        return node.nextSibling;
    }
}
function getRangeSelectedNodes(range) {
    var node = range.startContainer;
    var endNode = range.endContainer;
    // Special case for a range that is contained within a single node
    if (node == endNode) {
        return [node];
    }
    // Iterate nodes until we hit the end container
    var rangeNodes = [];
    while (node && node != endNode) {
        rangeNodes.push( node = nextNode(node) );
    }
    // Add partially selected nodes at the start of the range
    node = range.startContainer;
    while (node && node != range.commonAncestorContainer) {
        rangeNodes.unshift(node);
        node = node.parentNode;
    }
    return rangeNodes;
}
function getSelectedNodes() {
    if (window.getSelection) {
        var sel = window.getSelection();
//      console.log(window.getSelection())
        if (!sel.isCollapsed) {
            return getRangeSelectedNodes(sel.getRangeAt(0));
        }
    }
    return [];
}
function getSel(){
  var result=[];
  var selection=window.getSelection();
  for (var i=0; i<selection.rangeCount; i++) result.push(selection.getRangeAt(i).cloneContents());
  return result;
}



function sel2(){
var selcRange = window.getSelection().getRangeAt(0);
        var containerElement = selcRange.commonAncestorContainer;
        if (containerElement.nodeType != 1) {
            containerElement = containerElement.parentNode;
        }
        var walk = document.createTreeWalker(containerElement, NodeFilter.SHOW_ALL,
            { acceptNode: function(node) {
                  return selcRange.intersectsNode(node) ? NodeFilter.FILTER_ACCEPT : NodeFilter.FILTER_SKIP;
                }
            }, false);
        var n = walk.nextNode();
  var s=[];
        while (n) {
            s.push(n);
            n = walk.nextNode();
        }
        return s;
}