planetazuzu
5d7a6500fe
- ✅ Ticket 1.1: Estructura Clean Architecture en backend - ✅ Ticket 1.2: Schemas Zod compartidos - ✅ Ticket 1.3: Refactorización drugs.ts (1362 → 8 archivos modulares) - ✅ Ticket 1.4: Refactorización procedures.ts (3583 → 6 archivos modulares) - ✅ Ticket 1.5: Eliminación de duplicidades (~50 líneas) Cambios principales: - Creada estructura Clean Architecture en backend/src/ - Schemas Zod compartidos en backend/src/shared/schemas/ - Refactorización modular de drugs y procedures - Utilidades genéricas en src/utils/ (filter, validation) - Eliminados scripts obsoletos y documentación antigua - Corregidos errores: QueryClient, import test-error-handling - Build verificado y funcionando correctamente
88 lines
3.5 KiB
JavaScript
88 lines
3.5 KiB
JavaScript
import DOMException from '../exception/DOMException.js';
|
|
import * as PropertySymbol from '../PropertySymbol.js';
|
|
import DOMExceptionNameEnum from '../exception/DOMExceptionNameEnum.js';
|
|
import NodeTypeEnum from '../nodes/node/NodeTypeEnum.js';
|
|
import NodeUtility from '../nodes/node/NodeUtility.js';
|
|
/**
|
|
* Range utility.
|
|
*
|
|
* Based on:
|
|
* https://github.com/jsdom/jsdom/blob/master/lib/jsdom/living/range/boundary-point.js.
|
|
*/
|
|
export default class RangeUtility {
|
|
/**
|
|
* Compares boundary points.
|
|
*
|
|
* Based on logic from:
|
|
* https://github.com/jsdom/jsdom/blob/master/lib/jsdom/living/range/boundary-point.js
|
|
*
|
|
* @see https://dom.spec.whatwg.org/#concept-range-bp-after
|
|
* @param pointA Point A.
|
|
* @param pointB Point B.
|
|
* @returns A number, -1, 0, or 1, indicating whether the corresponding boundary-point of the Range is respectively before, equal to, or after the corresponding boundary-point of sourceRange.
|
|
*/
|
|
static compareBoundaryPointsPosition(pointA, pointB) {
|
|
if (pointA.node === pointB.node) {
|
|
if (pointA.offset === pointB.offset) {
|
|
return 0;
|
|
}
|
|
else if (pointA.offset < pointB.offset) {
|
|
return -1;
|
|
}
|
|
return 1;
|
|
}
|
|
if (NodeUtility.isFollowing(pointA.node, pointB.node)) {
|
|
return this.compareBoundaryPointsPosition(pointB, pointA) === -1 ? 1 : -1;
|
|
}
|
|
if (NodeUtility.isInclusiveAncestor(pointA.node, pointB.node)) {
|
|
let child = pointB.node;
|
|
while (child[PropertySymbol.parentNode] !== pointA.node) {
|
|
child = child[PropertySymbol.parentNode];
|
|
}
|
|
if (child[PropertySymbol.parentNode][PropertySymbol.nodeArray].indexOf(child) <
|
|
pointA.offset) {
|
|
return 1;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
/**
|
|
* Validates a boundary point.
|
|
*
|
|
* @throws DOMException
|
|
* @param point Boundary point.
|
|
*/
|
|
static validateBoundaryPoint(point) {
|
|
if (point.node[PropertySymbol.nodeType] === NodeTypeEnum.documentTypeNode) {
|
|
throw new DOMException(`DocumentType Node can't be used as boundary point.`, DOMExceptionNameEnum.invalidNodeTypeError);
|
|
}
|
|
if (point.offset > NodeUtility.getNodeLength(point.node)) {
|
|
throw new DOMException(`Offset out of bound.`, DOMExceptionNameEnum.indexSizeError);
|
|
}
|
|
}
|
|
/**
|
|
* Returns "true" if contained.
|
|
*
|
|
* @param node Node.
|
|
* @param range Range.
|
|
* @returns "true" if contained.
|
|
*/
|
|
static isContained(node, range) {
|
|
return (this.compareBoundaryPointsPosition({ node, offset: 0 }, { node: range.startContainer, offset: range.startOffset }) === 1 &&
|
|
this.compareBoundaryPointsPosition({ node, offset: NodeUtility.getNodeLength(node) }, { node: range.endContainer, offset: range.endOffset }) === -1);
|
|
}
|
|
/**
|
|
* Returns "true" if partially contained.
|
|
*
|
|
* @param node Node.
|
|
* @param range Range.
|
|
* @returns "true" if partially contained.
|
|
*/
|
|
static isPartiallyContained(node, range) {
|
|
return ((NodeUtility.isInclusiveAncestor(node, range.startContainer) &&
|
|
!NodeUtility.isInclusiveAncestor(node, range.endContainer)) ||
|
|
(!NodeUtility.isInclusiveAncestor(node, range.startContainer) &&
|
|
NodeUtility.isInclusiveAncestor(node, range.endContainer)));
|
|
}
|
|
}
|
|
//# sourceMappingURL=RangeUtility.js.map
|