OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	02/20/2020 05:44:43 AM	rwxr-xr-x
📄 CaretRangeFromPoint.ts	2.6 KB	02/20/2020 05:44:11 AM	rw-r--r--
📄 DetailsElement.ts	1.19 KB	02/20/2020 05:44:11 AM	rw-r--r--
📄 ElementSelection.ts	4.83 KB	02/20/2020 05:44:12 AM	rw-r--r--
📄 EventProcessRanges.ts	593 bytes	02/20/2020 05:44:12 AM	rw-r--r--
📄 FragmentReader.ts	3.82 KB	02/20/2020 05:44:13 AM	rw-r--r--
📄 GetSelectionContent.ts	2.12 KB	02/20/2020 05:44:15 AM	rw-r--r--
📄 MultiClickSelection.ts	1.64 KB	02/20/2020 05:44:16 AM	rw-r--r--
📄 MultiRange.ts	955 bytes	02/20/2020 05:44:17 AM	rw-r--r--
📄 NormalizeRange.ts	10.02 KB	02/20/2020 05:44:17 AM	rw-r--r--
📄 RangeCompare.ts	580 bytes	02/20/2020 05:44:18 AM	rw-r--r--
📄 RangeInsertNode.ts	1.52 KB	02/20/2020 05:44:18 AM	rw-r--r--
📄 RangeNodes.ts	946 bytes	02/20/2020 05:44:19 AM	rw-r--r--
📄 RangeNormalizer.ts	1.69 KB	02/20/2020 05:44:19 AM	rw-r--r--
📄 RangeWalk.ts	4.38 KB	02/20/2020 05:44:20 AM	rw-r--r--
📄 SelectionBookmark.ts	3.36 KB	02/20/2020 05:44:20 AM	rw-r--r--
📄 SelectionRestore.ts	1.98 KB	02/20/2020 05:44:21 AM	rw-r--r--
📄 SelectionUtils.ts	3.65 KB	02/20/2020 05:44:21 AM	rw-r--r--
📄 SetSelectionContent.ts	2.44 KB	02/20/2020 05:44:22 AM	rw-r--r--
📄 SimpleTableModel.ts	4.08 KB	02/20/2020 05:44:22 AM	rw-r--r--
📄 SplitRange.ts	1.94 KB	02/20/2020 05:44:23 AM	rw-r--r--
📄 TableCellSelection.ts	1.25 KB	02/20/2020 05:44:24 AM	rw-r--r--
📄 WordSelection.ts	1.47 KB	02/20/2020 05:44:24 AM	rw-r--r--

Editing: RangeWalk.ts

/**
 * Copyright (c) Tiny Technologies, Inc. All rights reserved.
 * Licensed under the LGPL or a commercial license.
 * For LGPL see License.txt in the project root for license information.
 * For commercial licenses see https://www.tiny.cloud/
 */

import Tools from '../api/util/Tools';

const each = Tools.each;

const getEndChild = function (container, index) {
  const childNodes = container.childNodes;

index--;

if (index > childNodes.length - 1) {
    index = childNodes.length - 1;
  } else if (index < 0) {
    index = 0;
  }

return childNodes[index] || container;
};

const walk = function (dom, rng, callback) {
  let startContainer = rng.startContainer;
  const startOffset = rng.startOffset;
  let endContainer = rng.endContainer;
  const endOffset = rng.endOffset;
  let ancestor;
  let startPoint;
  let endPoint;
  let node;
  let parent;
  let siblings;
  let nodes;

// Handle table cell selection the table plugin enables
  // you to fake select table cells and perform formatting actions on them
  nodes = dom.select('td[data-mce-selected],th[data-mce-selected]');
  if (nodes.length > 0) {
    each(nodes, function (node) {
      callback([node]);
    });

return;
  }

/**
   * Excludes start/end text node if they are out side the range
   *
   * @private
   * @param {Array} nodes Nodes to exclude items from.
   * @return {Array} Array with nodes excluding the start/end container if needed.
   */
  const exclude = function (nodes) {
    let node;

// First node is excluded
    node = nodes[0];
    if (node.nodeType === 3 && node === startContainer && startOffset >= node.nodeValue.length) {
      nodes.splice(0, 1);
    }

// Last node is excluded
    node = nodes[nodes.length - 1];
    if (endOffset === 0 && nodes.length > 0 && node === endContainer && node.nodeType === 3) {
      nodes.splice(nodes.length - 1, 1);
    }

return nodes;
  };

const collectSiblings = function (node, name, endNode?) {
    const siblings = [];

for (; node && node !== endNode; node = node[name]) {
      siblings.push(node);
    }

return siblings;
  };

const findEndPoint = function (node, root) {
    do {
      if (node.parentNode === root) {
        return node;
      }

node = node.parentNode;
    } while (node);
  };

const walkBoundary = function (startNode, endNode, next?) {
    const siblingName = next ? 'nextSibling' : 'previousSibling';

for (node = startNode, parent = node.parentNode; node && node !== endNode; node = parent) {
      parent = node.parentNode;
      siblings = collectSiblings(node === startNode ? node : node[siblingName], siblingName);

if (siblings.length) {
        if (!next) {
          siblings.reverse();
        }

callback(exclude(siblings));
      }
    }
  };

// If index based start position then resolve it
  if (startContainer.nodeType === 1 && startContainer.hasChildNodes()) {
    startContainer = startContainer.childNodes[startOffset];
  }

// If index based end position then resolve it
  if (endContainer.nodeType === 1 && endContainer.hasChildNodes()) {
    endContainer = getEndChild(endContainer, endOffset);
  }

// Same container
  if (startContainer === endContainer) {
    return callback(exclude([startContainer]));
  }

// Find common ancestor and end points
  ancestor = dom.findCommonAncestor(startContainer, endContainer);

// Process left side
  for (node = startContainer; node; node = node.parentNode) {
    if (node === endContainer) {
      return walkBoundary(startContainer, ancestor, true);
    }

if (node === ancestor) {
      break;
    }
  }

// Process right side
  for (node = endContainer; node; node = node.parentNode) {
    if (node === startContainer) {
      return walkBoundary(endContainer, ancestor);
    }

if (node === ancestor) {
      break;
    }
  }

// Find start/end point
  startPoint = findEndPoint(startContainer, ancestor) || startContainer;
  endPoint = findEndPoint(endContainer, ancestor) || endContainer;

// Walk left leaf
  walkBoundary(startContainer, startPoint, true);

// Walk the middle from start to end point
  siblings = collectSiblings(
    startPoint === startContainer ? startPoint : startPoint.nextSibling,
    'nextSibling',
    endPoint === endContainer ? endPoint.nextSibling : endPoint
  );

if (siblings.length) {
    callback(exclude(siblings));
  }

// Walk right leaf
  walkBoundary(endContainer, endPoint);
};

export default {
  walk
};