pseudo-dom 0.4.0 → 0.5.0

package/dist/services/NodeService.js

@@ -1,5 +1,8 @@
 'use strict'
 
+require('core-js/modules/esnext.iterator.constructor.js')
+require('core-js/modules/esnext.iterator.every.js')
+require('core-js/modules/esnext.iterator.for-each.js')
 const __importDefault = void 0 && (void 0).__importDefault || function (mod) {
   return mod && mod.__esModule
     ? mod
@@ -10,7 +13,7 @@ const __importDefault = void 0 && (void 0).__importDefault || function (mod) {
 Object.defineProperty(exports, '__esModule', {
   value: true
 })
-exports.NodeService = void 0
+exports.CommentService = exports.TextService = exports.NodeService = void 0
 /**
  * @file Substitute for the DOM Node Class.
  * @author Joshua Heagle <joshuaheagle@gmail.com>
@@ -35,8 +38,9 @@ class NodeService extends EventTargetService_1.default {
    */
   constructor () {
     super()
-    this.nodeValueStore = ''
-    this.textContentStore = ''
+    this.nodeValueStore = null
+    this.ownerDocumentStore = null
+    this.nodeId = NodeService.nextNodeId++
     this.nodeNameValue = ''
     this.children = (0, generateNodeList_1.default)()
     this.parent = null
@@ -56,7 +60,8 @@ class NodeService extends EventTargetService_1.default {
   }
 
   get isConnected () {
-    return !!this.parent
+    // Connected means the tree the node is in has a document at the top
+    return this.getRootNode().nodeType === NodeService.DOCUMENT_NODE
   }
 
   get lastChild () {
@@ -84,7 +89,11 @@ class NodeService extends EventTargetService_1.default {
   }
 
   get ownerDocument () {
-    return null
+    if (this.nodeType === NodeService.DOCUMENT_NODE) {
+      return null
+    }
+    const root = this.getRootNode()
+    return root.nodeType === NodeService.DOCUMENT_NODE ? root : this.ownerDocumentStore
   }
 
   get parentNode () {
@@ -100,11 +109,34 @@ class NodeService extends EventTargetService_1.default {
   }
 
   get textContent () {
-    return this.textContentStore
+    if (this.nodeType === NodeService.DOCUMENT_NODE || this.nodeType === NodeService.DOCUMENT_TYPE_NODE) {
+      return null
+    }
+    // The text of everything below, in order (comments and the like do not count)
+    let text = ''
+    Array.from(this.childNodes).forEach(child => {
+      if (child.nodeType === NodeService.TEXT_NODE) {
+        text += child.nodeValue
+      } else if (child.nodeType !== NodeService.COMMENT_NODE) {
+        text += child.textContent
+      }
+    })
+    return text
   }
 
   set textContent (text) {
-    this.textContentStore = text
+    if (this.nodeType === NodeService.DOCUMENT_NODE || this.nodeType === NodeService.DOCUMENT_TYPE_NODE) {
+      return
+    }
+    // All the children are replaced by a single text node (or none for an empty text)
+    while (this.firstChild) {
+      this.removeChild(this.firstChild)
+    }
+    if (text !== null && typeof text !== 'undefined' && String(text) !== '') {
+      const textNode = new TextService(String(text))
+      textNode.ownerDocumentStore = this.ownerDocument
+      this.appendChild(textNode)
+    }
   }
 
   /**
@@ -116,6 +148,36 @@ class NodeService extends EventTargetService_1.default {
     return this.insertBefore(childNode, null)
   }
 
+  /**
+   * Whether this kind of node can have children (text, comments and attributes cannot).
+   * @returns {boolean}
+   */
+  get acceptsChildren () {
+    return true
+  }
+
+  /**
+   * Make a copy of this node without its children, its parent or its listeners, which is what cloneNode starts from.
+   * Kinds of node which are made with arguments override this to give them.
+   * @returns {NodeService}
+   */
+  cloneShallow () {
+    const copy = new this.constructor()
+    copy.nodeValue = this.nodeValue
+    copy.ownerDocumentStore = this.ownerDocumentStore
+    return copy
+  }
+
+  /**
+   * Whether another node of the same type is equal to this one apart from its children, which isEqualNode compares
+   * afterwards. Kinds of node with more to compare (an element has attributes) override this.
+   * @param {NodeService} other The node to compare with
+   * @returns {boolean}
+   */
+  equalsShallow (other) {
+    return this.nodeName === other.nodeName && this.nodeValue === other.nodeValue
+  }
+
   /**
    * Called each time a node has been inserted as a child of this node, so that nodes which need to react to children
    * (for example elements applying default events) can do so.
@@ -123,19 +185,62 @@ class NodeService extends EventTargetService_1.default {
    */
   childInserted (child) {}
   /**
-   * Not implemented yet.
-   * @throws {Error}
+   * Make a copy of this node (without its parent, and without its event listeners). With deep the children are copied
+   * too, all the way down.
+   * @param {boolean} [deep=false] Copy the children as well
+   * @returns {PseudoNode}
    */
   cloneNode (deep = false) {
-    throw new Error(`NodeService.cloneNode(${deep}) is not implemented yet.`)
+    const copy = this.cloneShallow()
+    if (deep) {
+      Array.from(this.childNodes).forEach(child => copy.appendChild(child.cloneNode(true)))
+    }
+    return copy
   }
 
   /**
-   * Not implemented yet.
-   * @throws {Error}
+   * Say where another node is in relation to this one, as the bits of NodeService.DOCUMENT_POSITION_*: 0 for this node
+   * itself, DISCONNECTED (with IMPLEMENTATION_SPECIFIC and a consistent PRECEDING or FOLLOWING) for a node in another tree,
+   * CONTAINS + PRECEDING when the other node is an ancestor, CONTAINED_BY + FOLLOWING when it is a descendant,
+   * otherwise PRECEDING or FOLLOWING by their order in the tree.
+   * @param {PseudoNode} otherNode The node to locate
+   * @returns {number}
    */
   compareDocumentPosition (otherNode) {
-    throw new Error('NodeService.compareDocumentPosition() is not implemented yet.')
+    if (otherNode === this) {
+      return 0
+    }
+    const pathFromRoot = node => {
+      const path = []
+      for (let current = node; current; current = current.parentNode) {
+        path.unshift(current)
+      }
+      return path
+    }
+    const mine = pathFromRoot(this)
+    const theirs = pathFromRoot(otherNode)
+    if (mine[0] !== theirs[0]) {
+      // Not in the same tree, so there is no real order: use a consistent one (the order the nodes were made in)
+      const before = otherNode.nodeId < this.nodeId ? NodeService.DOCUMENT_POSITION_PRECEDING : NodeService.DOCUMENT_POSITION_FOLLOWING
+      return NodeService.DOCUMENT_POSITION_DISCONNECTED | NodeService.DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC | before
+    }
+    if (theirs.length < mine.length && theirs.every((node, index) => mine[index] === node)) {
+      return NodeService.DOCUMENT_POSITION_CONTAINS | NodeService.DOCUMENT_POSITION_PRECEDING
+    }
+    if (mine.length < theirs.length && mine.every((node, index) => theirs[index] === node)) {
+      return NodeService.DOCUMENT_POSITION_CONTAINED_BY | NodeService.DOCUMENT_POSITION_FOLLOWING
+    }
+    // The paths part ways at siblings: whichever comes first among them is first in the tree
+    let depth = 0
+    while (mine[depth] === theirs[depth]) {
+      ++depth
+    }
+    for (let sibling = mine[depth].nextSibling; sibling; sibling = sibling.nextSibling) {
+      if (sibling === theirs[depth]) {
+        return NodeService.DOCUMENT_POSITION_FOLLOWING
+      }
+    }
+    return NodeService.DOCUMENT_POSITION_PRECEDING
   }
 
   /**
@@ -173,6 +278,9 @@ class NodeService extends EventTargetService_1.default {
    * @throws {Error} When the reference node is not a child of this node, or the new node is this node or contains it
    */
   insertBefore (newNode, referenceNode = null) {
+    if (!this.acceptsChildren) {
+      throw new Error('This kind of node cannot have children.')
+    }
     if (referenceNode !== null && referenceNode.parentNode !== this) {
       throw new Error('The node before which the new node is to be inserted is not a child of this node.')
     }
@@ -210,11 +318,18 @@ class NodeService extends EventTargetService_1.default {
   }
 
   /**
-   * Not implemented yet.
-   * @throws {Error}
+   * Whether another node is the same as this one, by what they hold: the same type, name and value (an element also
+   * needs the same attributes), and children which are equal in the same order.
+   * @param {PseudoNode|null} otherNode The node to compare with
+   * @returns {boolean}
    */
   isEqualNode (otherNode) {
-    throw new Error('NodeService.isEqualNode() is not implemented yet.')
+    if (!otherNode || otherNode.nodeType !== this.nodeType || !this.equalsShallow(otherNode)) {
+      return false
+    }
+    const mine = Array.from(this.childNodes)
+    const theirs = Array.from(otherNode.childNodes)
+    return mine.length === theirs.length && mine.every((child, index) => child.isEqualNode(theirs[index]))
   }
 
   isSameNode (otherNode) {
@@ -229,7 +344,34 @@ class NodeService extends EventTargetService_1.default {
     return null
   }
 
-  normalize () {}
+  /**
+   * Tidy the text below this node: neighbouring text nodes are joined into one and empty text nodes are removed.
+   */
+  normalize () {
+    let child = this.firstChild
+    while (child) {
+      if (child.nodeType === NodeService.TEXT_NODE) {
+        // Join the text nodes which follow into this one, and drop it when it is empty
+        let text = child.nodeValue
+        let following = child.nextSibling
+        while (following && following.nodeType === NodeService.TEXT_NODE) {
+          text += following.nodeValue
+          const after = following.nextSibling
+          this.removeChild(following)
+          following = after
+        }
+        child.nodeValue = text
+        if (text === '') {
+          this.removeChild(child)
+        }
+        child = following
+      } else {
+        child.normalize()
+        child = child.nextSibling
+      }
+    }
+  }
+
   /**
    * Remove a child from this node, it no longer has a parent or siblings afterwards.
    * @param {PseudoNode} childElement The child node to remove
@@ -285,3 +427,157 @@ NodeService.DOCUMENT_NODE = 9
 NodeService.DOCUMENT_TYPE_NODE = 10
 NodeService.DOCUMENT_FRAGMENT_NODE = 11
 NodeService.NOTATION_NODE = 12
+NodeService.DOCUMENT_POSITION_DISCONNECTED = 1
+NodeService.DOCUMENT_POSITION_PRECEDING = 2
+NodeService.DOCUMENT_POSITION_FOLLOWING = 4
+NodeService.DOCUMENT_POSITION_CONTAINS = 8
+NodeService.DOCUMENT_POSITION_CONTAINED_BY = 16
+NodeService.DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC = 32
+NodeService.nextNodeId = 1
+/**
+ * Simulate the behaviour of the Text Class when there is no DOM available: the text in an element.
+ * @author Joshua Heagle <joshuaheagle@gmail.com>
+ * @class
+ * @augments NodeService
+ * @property {string} data - The text
+ * @property {number} length - How many characters there are
+ * @property {string} wholeText - The text of this node and of the text nodes next to it
+ */
+class TextService extends NodeService {
+  /**
+   * @param {string} [data=''] The text
+   * @constructor
+   */
+  constructor (data = '') {
+    super()
+    this.nodeValue = String(data)
+  }
+
+  get acceptsChildren () {
+    return false
+  }
+
+  get nodeName () {
+    return '#text'
+  }
+
+  get nodeType () {
+    return NodeService.TEXT_NODE
+  }
+
+  get data () {
+    return this.nodeValue
+  }
+
+  set data (data) {
+    this.nodeValue = String(data)
+  }
+
+  get length () {
+    return this.data.length
+  }
+
+  get textContent () {
+    return this.data
+  }
+
+  set textContent (text) {
+    this.data = text === null ? '' : String(text)
+  }
+
+  get wholeText () {
+    let first = this
+    while (first.previousSibling && first.previousSibling.nodeType === NodeService.TEXT_NODE) {
+      first = first.previousSibling
+    }
+    let text = ''
+    for (let current = first; current && current.nodeType === NodeService.TEXT_NODE; current = current.nextSibling) {
+      text += current.nodeValue
+    }
+    return text
+  }
+
+  /**
+   * Break this text node in two at a position: this node keeps the text before it and a new node with the rest is put
+   * after this one.
+   * @param {number} offset How many characters stay in this node
+   * @returns {TextService} The new node
+   * @throws {Error} When the offset is beyond the end of the text
+   */
+  splitText (offset) {
+    if (offset < 0 || offset > this.length) {
+      throw new Error('The offset is beyond the end of the text.')
+    }
+    const rest = new TextService(this.data.slice(offset))
+    rest.ownerDocumentStore = this.ownerDocumentStore
+    this.data = this.data.slice(0, offset)
+    if (this.parentNode) {
+      this.parentNode.insertBefore(rest, this.nextSibling)
+    }
+    return rest
+  }
+
+  cloneShallow () {
+    const copy = new TextService(this.data)
+    copy.ownerDocumentStore = this.ownerDocumentStore
+    return copy
+  }
+}
+exports.TextService = TextService
+/**
+ * Simulate the behaviour of the Comment Class when there is no DOM available: a note in the markup which is not shown.
+ * @author Joshua Heagle <joshuaheagle@gmail.com>
+ * @class
+ * @augments NodeService
+ * @property {string} data - The comment
+ * @property {number} length - How many characters there are
+ */
+class CommentService extends NodeService {
+  /**
+   * @param {string} [data=''] The comment
+   * @constructor
+   */
+  constructor (data = '') {
+    super()
+    this.nodeValue = String(data)
+  }
+
+  get acceptsChildren () {
+    return false
+  }
+
+  get nodeName () {
+    return '#comment'
+  }
+
+  get nodeType () {
+    return NodeService.COMMENT_NODE
+  }
+
+  get data () {
+    return this.nodeValue
+  }
+
+  set data (data) {
+    this.nodeValue = String(data)
+  }
+
+  get length () {
+    return this.data.length
+  }
+
+  get textContent () {
+    return this.data
+  }
+
+  set textContent (text) {
+    this.data = text === null ? '' : String(text)
+  }
+
+  cloneShallow () {
+    const copy = new CommentService(this.data)
+    copy.ownerDocumentStore = this.ownerDocumentStore
+    return copy
+  }
+}
+exports.CommentService = CommentService

package/dist/services/NodeService.min.js

@@ -1 +1 @@
-"use strict";var __importDefault=function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(exports,"__esModule",{value:!0}),exports.NodeService=void 0;const generateNodeList_1=__importDefault(require("../factories/generateNodeList")),TreeLinker_1=require("collect-your-stuff/dist/collections/linked-tree-list/TreeLinker"),EventTargetService_1=__importDefault(require("./EventTargetService"));class NodeService extends EventTargetService_1.default{constructor(){super(),this.nodeValueStore="",this.textContentStore="",this.nodeNameValue="",this.children=(0,generateNodeList_1.default)(),this.parent=null,this.listLinker=null}get baseURI(){return window.location||"/"}get childNodes(){return this.children}get firstChild(){return this.children.first?this.children.first.data:null}get isConnected(){return!!this.parent}get lastChild(){return this.children.last?this.children.last.data:null}get nextSibling(){return this.listLinker&&this.listLinker.next?this.listLinker.next.data:null}get nodeName(){return this.nodeNameValue||""}get nodeType(){return NodeService.DEFAULT_NODE}get nodeValue(){return this.nodeValueStore}set nodeValue(e){this.nodeValueStore=e}get ownerDocument(){return null}get parentNode(){return this.parent}get parentElement(){return this.parent&&this.parent.nodeType===NodeService.ELEMENT_NODE?this.parent:null}get previousSibling(){return this.listLinker&&this.listLinker.prev?this.listLinker.prev.data:null}get textContent(){return this.textContentStore}set textContent(e){this.textContentStore=e}appendChild(e){return this.insertBefore(e,null)}childInserted(e){}cloneNode(e=!1){throw new Error(`NodeService.cloneNode(${e}) is not implemented yet.`)}compareDocumentPosition(e){throw new Error("NodeService.compareDocumentPosition() is not implemented yet.")}contains(e){let t=e;for(;t;){if(t===this)return!0;t=t.parentNode}return!1}getRootNode(e={composed:!1}){return this.parent?this.parent.getRootNode(e):this}hasChildNodes(){return this.children.length>0}insertBefore(e,t=null){if(null!==t&&t.parentNode!==this)throw new Error("The node before which the new node is to be inserted is not a child of this node.");if(e===t)return e;if("function"==typeof e.contains&&e.contains(this))throw new Error("The new node cannot be inserted into itself or one of its own descendants.");if(e.nodeType===NodeService.DOCUMENT_FRAGMENT_NODE){for(;e.firstChild;)this.insertBefore(e.firstChild,t);return e}e.parentNode&&e.parentNode.removeChild(e);const r=new TreeLinker_1.TreeLinker({data:e});this.children.insertBefore(t?t.listLinker:null,r);const i=e;return i.parent=this,i.listLinker=r,this.childInserted(i),e}isDefaultNamespace(e){return null===e}isEqualNode(e){throw new Error("NodeService.isEqualNode() is not implemented yet.")}isSameNode(e){return this===e}lookupPrefix(e){return null}lookupNamespaceURI(e){return null}normalize(){}removeChild(e){if(!e||e.parentNode!==this)throw new Error("The node to be removed is not a child of this node.");const t=e;return this.children.remove(t.listLinker),t.parent=null,t.listLinker=null,e}replaceChild(e,t){if(!t||t.parentNode!==this)throw new Error("The node to be replaced is not a child of this node.");if(e===t)return t;let r=t.nextSibling;return r===e&&(r=e.nextSibling),this.removeChild(t),this.insertBefore(e,r),t}}exports.NodeService=NodeService,NodeService.DEFAULT_NODE=0,NodeService.ELEMENT_NODE=1,NodeService.ATTRIBUTE_NODE=2,NodeService.TEXT_NODE=3,NodeService.CDATA_SECTION_NODE=4,NodeService.ENTITY_REFERENCE_NODE=5,NodeService.ENTITY_NODE=6,NodeService.PROCESSING_INSTRUCTION_NODE=7,NodeService.COMMENT_NODE=8,NodeService.DOCUMENT_NODE=9,NodeService.DOCUMENT_TYPE_NODE=10,NodeService.DOCUMENT_FRAGMENT_NODE=11,NodeService.NOTATION_NODE=12;
+"use strict";require("core-js/modules/esnext.iterator.constructor.js"),require("core-js/modules/esnext.iterator.every.js"),require("core-js/modules/esnext.iterator.for-each.js");var __importDefault=function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(exports,"__esModule",{value:!0}),exports.CommentService=exports.TextService=exports.NodeService=void 0;const generateNodeList_1=__importDefault(require("../factories/generateNodeList")),TreeLinker_1=require("collect-your-stuff/dist/collections/linked-tree-list/TreeLinker"),EventTargetService_1=__importDefault(require("./EventTargetService"));class NodeService extends EventTargetService_1.default{constructor(){super(),this.nodeValueStore=null,this.ownerDocumentStore=null,this.nodeId=NodeService.nextNodeId++,this.nodeNameValue="",this.children=(0,generateNodeList_1.default)(),this.parent=null,this.listLinker=null}get baseURI(){return window.location||"/"}get childNodes(){return this.children}get firstChild(){return this.children.first?this.children.first.data:null}get isConnected(){return this.getRootNode().nodeType===NodeService.DOCUMENT_NODE}get lastChild(){return this.children.last?this.children.last.data:null}get nextSibling(){return this.listLinker&&this.listLinker.next?this.listLinker.next.data:null}get nodeName(){return this.nodeNameValue||""}get nodeType(){return NodeService.DEFAULT_NODE}get nodeValue(){return this.nodeValueStore}set nodeValue(e){this.nodeValueStore=e}get ownerDocument(){if(this.nodeType===NodeService.DOCUMENT_NODE)return null;const e=this.getRootNode();return e.nodeType===NodeService.DOCUMENT_NODE?e:this.ownerDocumentStore}get parentNode(){return this.parent}get parentElement(){return this.parent&&this.parent.nodeType===NodeService.ELEMENT_NODE?this.parent:null}get previousSibling(){return this.listLinker&&this.listLinker.prev?this.listLinker.prev.data:null}get textContent(){if(this.nodeType===NodeService.DOCUMENT_NODE||this.nodeType===NodeService.DOCUMENT_TYPE_NODE)return null;let e="";return Array.from(this.childNodes).forEach(t=>{t.nodeType===NodeService.TEXT_NODE?e+=t.nodeValue:t.nodeType!==NodeService.COMMENT_NODE&&(e+=t.textContent)}),e}set textContent(e){if(this.nodeType!==NodeService.DOCUMENT_NODE&&this.nodeType!==NodeService.DOCUMENT_TYPE_NODE){for(;this.firstChild;)this.removeChild(this.firstChild);if(null!=e&&""!==String(e)){const t=new TextService(String(e));t.ownerDocumentStore=this.ownerDocument,this.appendChild(t)}}}appendChild(e){return this.insertBefore(e,null)}get acceptsChildren(){return!0}cloneShallow(){const e=new this.constructor;return e.nodeValue=this.nodeValue,e.ownerDocumentStore=this.ownerDocumentStore,e}equalsShallow(e){return this.nodeName===e.nodeName&&this.nodeValue===e.nodeValue}childInserted(e){}cloneNode(e=!1){const t=this.cloneShallow();return e&&Array.from(this.childNodes).forEach(e=>t.appendChild(e.cloneNode(!0))),t}compareDocumentPosition(e){if(e===this)return 0;const t=e=>{const t=[];for(let r=e;r;r=r.parentNode)t.unshift(r);return t},r=t(this),n=t(e);if(r[0]!==n[0]){const t=e.nodeId<this.nodeId?NodeService.DOCUMENT_POSITION_PRECEDING:NodeService.DOCUMENT_POSITION_FOLLOWING;return NodeService.DOCUMENT_POSITION_DISCONNECTED|NodeService.DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC|t}if(n.length<r.length&&n.every((e,t)=>r[t]===e))return NodeService.DOCUMENT_POSITION_CONTAINS|NodeService.DOCUMENT_POSITION_PRECEDING;if(r.length<n.length&&r.every((e,t)=>n[t]===e))return NodeService.DOCUMENT_POSITION_CONTAINED_BY|NodeService.DOCUMENT_POSITION_FOLLOWING;let i=0;for(;r[i]===n[i];)++i;for(let e=r[i].nextSibling;e;e=e.nextSibling)if(e===n[i])return NodeService.DOCUMENT_POSITION_FOLLOWING;return NodeService.DOCUMENT_POSITION_PRECEDING}contains(e){let t=e;for(;t;){if(t===this)return!0;t=t.parentNode}return!1}getRootNode(e={composed:!1}){return this.parent?this.parent.getRootNode(e):this}hasChildNodes(){return this.children.length>0}insertBefore(e,t=null){if(!this.acceptsChildren)throw new Error("This kind of node cannot have children.");if(null!==t&&t.parentNode!==this)throw new Error("The node before which the new node is to be inserted is not a child of this node.");if(e===t)return e;if("function"==typeof e.contains&&e.contains(this))throw new Error("The new node cannot be inserted into itself or one of its own descendants.");if(e.nodeType===NodeService.DOCUMENT_FRAGMENT_NODE){for(;e.firstChild;)this.insertBefore(e.firstChild,t);return e}e.parentNode&&e.parentNode.removeChild(e);const r=new TreeLinker_1.TreeLinker({data:e});this.children.insertBefore(t?t.listLinker:null,r);const n=e;return n.parent=this,n.listLinker=r,this.childInserted(n),e}isDefaultNamespace(e){return null===e}isEqualNode(e){if(!e||e.nodeType!==this.nodeType||!this.equalsShallow(e))return!1;const t=Array.from(this.childNodes),r=Array.from(e.childNodes);return t.length===r.length&&t.every((e,t)=>e.isEqualNode(r[t]))}isSameNode(e){return this===e}lookupPrefix(e){return null}lookupNamespaceURI(e){return null}normalize(){let e=this.firstChild;for(;e;)if(e.nodeType===NodeService.TEXT_NODE){let t=e.nodeValue,r=e.nextSibling;for(;r&&r.nodeType===NodeService.TEXT_NODE;){t+=r.nodeValue;const e=r.nextSibling;this.removeChild(r),r=e}e.nodeValue=t,""===t&&this.removeChild(e),e=r}else e.normalize(),e=e.nextSibling}removeChild(e){if(!e||e.parentNode!==this)throw new Error("The node to be removed is not a child of this node.");const t=e;return this.children.remove(t.listLinker),t.parent=null,t.listLinker=null,e}replaceChild(e,t){if(!t||t.parentNode!==this)throw new Error("The node to be replaced is not a child of this node.");if(e===t)return t;let r=t.nextSibling;return r===e&&(r=e.nextSibling),this.removeChild(t),this.insertBefore(e,r),t}}exports.NodeService=NodeService,NodeService.DEFAULT_NODE=0,NodeService.ELEMENT_NODE=1,NodeService.ATTRIBUTE_NODE=2,NodeService.TEXT_NODE=3,NodeService.CDATA_SECTION_NODE=4,NodeService.ENTITY_REFERENCE_NODE=5,NodeService.ENTITY_NODE=6,NodeService.PROCESSING_INSTRUCTION_NODE=7,NodeService.COMMENT_NODE=8,NodeService.DOCUMENT_NODE=9,NodeService.DOCUMENT_TYPE_NODE=10,NodeService.DOCUMENT_FRAGMENT_NODE=11,NodeService.NOTATION_NODE=12,NodeService.DOCUMENT_POSITION_DISCONNECTED=1,NodeService.DOCUMENT_POSITION_PRECEDING=2,NodeService.DOCUMENT_POSITION_FOLLOWING=4,NodeService.DOCUMENT_POSITION_CONTAINS=8,NodeService.DOCUMENT_POSITION_CONTAINED_BY=16,NodeService.DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC=32,NodeService.nextNodeId=1;class TextService extends NodeService{constructor(e=""){super(),this.nodeValue=String(e)}get acceptsChildren(){return!1}get nodeName(){return"#text"}get nodeType(){return NodeService.TEXT_NODE}get data(){return this.nodeValue}set data(e){this.nodeValue=String(e)}get length(){return this.data.length}get textContent(){return this.data}set textContent(e){this.data=null===e?"":String(e)}get wholeText(){let e=this;for(;e.previousSibling&&e.previousSibling.nodeType===NodeService.TEXT_NODE;)e=e.previousSibling;let t="";for(let r=e;r&&r.nodeType===NodeService.TEXT_NODE;r=r.nextSibling)t+=r.nodeValue;return t}splitText(e){if(e<0||e>this.length)throw new Error("The offset is beyond the end of the text.");const t=new TextService(this.data.slice(e));return t.ownerDocumentStore=this.ownerDocumentStore,this.data=this.data.slice(0,e),this.parentNode&&this.parentNode.insertBefore(t,this.nextSibling),t}cloneShallow(){const e=new TextService(this.data);return e.ownerDocumentStore=this.ownerDocumentStore,e}}exports.TextService=TextService;class CommentService extends NodeService{constructor(e=""){super(),this.nodeValue=String(e)}get acceptsChildren(){return!1}get nodeName(){return"#comment"}get nodeType(){return NodeService.COMMENT_NODE}get data(){return this.nodeValue}set data(e){this.nodeValue=String(e)}get length(){return this.data.length}get textContent(){return this.data}set textContent(e){this.data=null===e?"":String(e)}cloneShallow(){const e=new CommentService(this.data);return e.ownerDocumentStore=this.ownerDocumentStore,e}}exports.CommentService=CommentService;

package/dist/services/TextService.d.ts

@@ -0,0 +1 @@
+export { TextService } from './NodeService';

package/dist/services/TextService.js

@@ -0,0 +1,13 @@
+'use strict'
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+})
+exports.TextService = void 0
+const NodeService_1 = require('./NodeService')
+Object.defineProperty(exports, 'TextService', {
+  enumerable: true,
+  get: function () {
+    return NodeService_1.TextService
+  }
+})

package/dist/services/TextService.min.js

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.TextService=void 0;var NodeService_1=require("./NodeService");Object.defineProperty(exports,"TextService",{enumerable:!0,get:function(){return NodeService_1.TextService}});

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "pseudo-dom",
   "description": "Mock the DOM on the server side for managing state and testing",
-  "version": "0.4.0",
+  "version": "0.5.0",
   "main": "dist/main.js",
   "types": "dist/main.d.ts",
   "author": "Joshua Heagle",
@@ -19,7 +19,8 @@
   },
   "dependencies": {
     "collect-your-stuff": "^2.1.0",
-    "core-js": "^3.50.0"
+    "core-js": "^3.50.0",
+    "si-funciona": "^2.6.0"
   },
   "devDependencies": {
     "js-build-tools": "^5.0.0",