Gecko [ gandhischool.edu.np ]

Name	Size	Permission
feeds.d.ts	1.16 KB	-rw-rw-rw-
feeds.d.ts.map	1.26 KB	-rw-rw-rw-
feeds.js	6.22 KB	-rw-rw-rw-
helpers.d.ts	2.12 KB	-rw-rw-rw-
helpers.d.ts.map	537 B	-rw-rw-rw-
helpers.js	4.41 KB	-rw-rw-rw-
index.d.ts	386 B	-rw-rw-rw-
index.d.ts.map	355 B	-rw-rw-rw-
index.js	1.8 KB	-rw-rw-rw-
legacy.d.ts	2.13 KB	-rw-rw-rw-
legacy.d.ts.map	1.3 KB	-rw-rw-rw-
legacy.js	4.72 KB	-rw-rw-rw-
manipulation.d.ts	1.22 KB	-rw-rw-rw-
manipulation.d.ts.map	677 B	-rw-rw-rw-
manipulation.js	3.25 KB	-rw-rw-rw-
querying.d.ts	2.26 KB	-rw-rw-rw-
querying.d.ts.map	1016 B	-rw-rw-rw-
querying.js	4.06 KB	-rw-rw-rw-
stringify.d.ts	1.48 KB	-rw-rw-rw-
stringify.d.ts.map	653 B	-rw-rw-rw-
stringify.js	2.94 KB	-rw-rw-rw-
traversal.d.ts	1.99 KB	-rw-rw-rw-
traversal.d.ts.map	864 B	-rw-rw-rw-
traversal.js	3.35 KB	-rw-rw-rw-

Code Editor : helpers.d.ts

import { Node } from "domhandler";
/**
 * Given an array of nodes, remove any member that is contained by another.
 *
 * @param nodes Nodes to filter.
 * @returns Remaining nodes that aren't subtrees of each other.
 */
export declare function removeSubsets(nodes: Node[]): Node[];
export declare const enum DocumentPosition {
    DISCONNECTED = 1,
    PRECEDING = 2,
    FOLLOWING = 4,
    CONTAINS = 8,
    CONTAINED_BY = 16
}
/**
 * Compare the position of one node against another node in any other document.
 * The return value is a bitmask with the following values:
 *
 * Document order:
 * > There is an ordering, document order, defined on all the nodes in the
 * > document corresponding to the order in which the first character of the
 * > XML representation of each node occurs in the XML representation of the
 * > document after expansion of general entities. Thus, the document element
 * > node will be the first node. Element nodes occur before their children.
 * > Thus, document order orders element nodes in order of the occurrence of
 * > their start-tag in the XML (after expansion of entities). The attribute
 * > nodes of an element occur after the element and before its children. The
 * > relative order of attribute nodes is implementation-dependent./
 *
 * Source:
 * http://www.w3.org/TR/DOM-Level-3-Core/glossary.html#dt-document-order
 *
 * @param nodeA The first node to use in the comparison
 * @param nodeB The second node to use in the comparison
 * @returns A bitmask describing the input nodes' relative position.
 *
 * See http://dom.spec.whatwg.org/#dom-node-comparedocumentposition for
 * a description of these values.
 */
export declare function compareDocumentPosition(nodeA: Node, nodeB: Node): number;
/**
 * Sort an array of nodes based on their relative position in the document and
 * remove any duplicate nodes. If the array contains nodes that do not belong
 * to the same document, sort order is unspecified.
 *
 * @param nodes Array of DOM nodes.
 * @returns Collection of unique nodes, sorted in document order.
 */
export declare function uniqueSort<T extends Node>(nodes: T[]): T[];
//# sourceMappingURL=helpers.d.ts.map

${this.title}

Code Editor : helpers.d.ts