mirror of
https://github.com/ankitects/anki.git
synced 2025-11-07 13:17:12 -05:00
* Clarify some comments
* Don't destructure insertion trigger
* Make superscript and subscript use domlib/surround
* Create new {Text,Highlight}ColorButton
* Use domlib/surround for textcolor
- However there's still a crucial bug, when you're breaking existing
colored span when unsurrounding, their color is not restored
* Add underline format to removeFormats
* Simplify type of ElementMatcher and ElementClearer for end users
* Add some comments for normalize-insertion-ranges
* Split normalize-insertion-ranges into remove-adjacent and remove-within
* Factor out find-remove from unsurround.ts
* Rename merge-mach, simplify remove-within
* Clarify some comments
* Refactor first reduce
* Refactor reduceRight
* Flatten functions in merge-ranges
* Move some functionality to merge-ranges and do not export
* Refactor merge-ranges
* Remove createInitialMergeMatch
* Finish refactoring of merge-ranges
* Refactor merge-ranges to minimal-ranges and add some unit testing
* Move more logic into text-node
* Remove most most of the logic from remove-adjacent
- remove-adjacent is still part of the "merging" logic, as it increases
the scope of the child node ranges
* Add some tests for edge cases
* Merge remove-adjacent logic into minimal-ranges
* Refactor unnecessary list destructuring
* Add some TODOs
* Put removing nodes and adding new nodes into sequence
* Refactor MatchResult to MatchType and return clear from matcher
* Inline surround/helpers
* Shorten name of param
* Add another edge case test
* Add an example where commonAncestorContainer != normalization level
* Fix bug in find-adjacent when find more than one nested nodes
* Allow comments for Along type
* Simplify find-adjacent by removing intermediate and/or curried functions
* Remove extend-adjacent
* Add more tests when find-adjacent finds by descension
* Fix find-adjacent descending into block-level elements
* Add clarifying comment to refusing to descend into block-level elements
* Move shifting logic into find-adjacent
* Rename file matcher to match-type
* Give a first implemention of TreeVertex
* Remove MatchType.ALONG
- findAdjacent now directly modifies the range
* Rename MatchType.MATCH into MatchType.REMOVE
* Implement a version of find-within that utilizies match-tree
* Turn child node range into a class
* Fix bug in new find-adjacent function
* Make all find-adjacent tests test for ranges
* Surrounding within farthestMatchingAncestor when available
* Fix an issue with negligable elements
- also rename "along" elements to "negligable"
* Add two TODOs to SurroundFormat interface
* Have a messy first implementation of the new tree-node algorithm
* Maintain whether formatting nodes are covered or within user selection
* Move covered and insideRange into TreeNode superclass
* Reimplement findAdjacent logic
* Add extension logic
* Add an evaluate method to nodes
* Introduce BlockNode
* Add a first evaluate implementation
* Add left shift and inner shift logic
* Implement SurroundFormatUser
* Allow pass in formatter, ascender and merger from outside
* Fix insideRange and covered switch-up
* Fix MatchNode.prototype.isAscendable
* Fix another switch-up of covered and insideRange...
* Remove a lot of old code
* Have surround functions only return the range
- I still cannot think of a good reason why we should return addedNodes
and removedNodes, except for testing.
* Create formatting-tree directory
* Create build-tree directory + Move find-above up to /domlib
* Remove range-anchors
* Move unsurround logic into no-splitting
* Fix extend-merge
* Fix inner shift being eroneusly returned as left shift
* Fix oversight in SplitRange
* Redefine how ranges are recreated
* Rename covered to insideMatch and put as fourth parameter instead of third
* Keep track of match holes and match leaves
* Rename ChildNodeRange to FlatRange
* Change signature of matcher
* Fix bug in extend-merge
* Improve Match class
* Utilize cache in TextColorButton
* Implement getBaseSurrounder for TextColorButton
* Add matchAncestors field to FormattingNode
* Introduce matchAncestors and getCache
* Do clearing during parsing already
- This way, you know whether elements will be removed before getting to
Formatting nodes
* Make HighlightColorButton use our surround mechanism
* Fix a bug with calling .removeAttribute and .hasAttribute
* Add side button to RemoveFormat button
* Add disabled to remove format side button
* Expose remove formats on RemoveFormat button
* Reinvent editor/surround as Surrounder class
* Fix split-text when working with insert trigger
* Try counteracting the contenteditable's auto surrounding
* Remove matching elements before normalizing
* Rewrite match-type
* Move setting match leaves into build
* Change editing strings
- So that color strings match bold/italic strings better
* Fix border radius of List options menu
* Implement extensions functionality
* Remove some unnecessary code
* Fix split range endOffset
* Type MatchType
* Reformat MatchType + add docs
* Fix domlib/surround/apply
* Satisfy last tests
* Register Surrounder as package
* Clarify some comments
* Correctly implement reformat
* Reformat with inactive eraser formats
* Clear empty spans with RemoveFormatButton
* Fix Super/Subscript button
* Use ftl string for hardcoded tooltip
* Adjust wording
212 lines
7.1 KiB
TypeScript
212 lines
7.1 KiB
TypeScript
// Copyright: Ankitects Pty Ltd and contributors
|
|
// License: GNU AGPL, version 3 or later; http://www.gnu.org/licenses/agpl.html
|
|
|
|
import { nodeIsElement } from "../../../lib/dom";
|
|
import { FlatRange } from "../flat-range";
|
|
import type { Match } from "../match-type";
|
|
import { ElementNode } from "./element-node";
|
|
import { TreeNode } from "./tree-node";
|
|
|
|
/**
|
|
* Represents a potential insertion point for a tag or, more generally, a point for starting a format procedure.
|
|
*/
|
|
export class FormattingNode<T = never> extends TreeNode {
|
|
private constructor(
|
|
public readonly range: FlatRange,
|
|
public readonly insideRange: boolean,
|
|
/**
|
|
* Match ancestors are all matching matches that are direct ancestors
|
|
* of `this`. This is important for deciding whether a text node is
|
|
* turned into a FormattingNode or into a BlockNode, if it is outside
|
|
* the initial DOM range.
|
|
*/
|
|
public readonly matchAncestors: Match<T>[],
|
|
) {
|
|
super(insideRange);
|
|
}
|
|
|
|
private static make<T>(
|
|
range: FlatRange,
|
|
insideRange: boolean,
|
|
matchAncestors: Match<T>[],
|
|
): FormattingNode<T> {
|
|
return new FormattingNode(range, insideRange, matchAncestors);
|
|
}
|
|
|
|
static fromText<T>(
|
|
text: Text,
|
|
insideRange: boolean,
|
|
matchAncestors: Match<T>[],
|
|
): FormattingNode<T> {
|
|
return FormattingNode.make(
|
|
FlatRange.fromNode(text),
|
|
insideRange,
|
|
matchAncestors,
|
|
);
|
|
}
|
|
|
|
/**
|
|
* A merge is combinging two formatting nodes into a single one.
|
|
* The merged node will take over their children, their match leaves, and
|
|
* their match holes, but will drop their extensions.
|
|
*
|
|
* @example
|
|
* Practically speaking, it is what happens, when you combine:
|
|
* `<b>before</b><b>after</b>` into `<b>beforeafter</b>`, or
|
|
* `<b>before</b><img src="image.jpg"><b>after</b>` into
|
|
* `<b>before<img src="image.jpg">after</b>` (negligible nodes inbetween).
|
|
*/
|
|
static merge<T>(
|
|
before: FormattingNode<T>,
|
|
after: FormattingNode<T>,
|
|
): FormattingNode<T> {
|
|
const node = FormattingNode.make(
|
|
FlatRange.merge(before.range, after.range),
|
|
before.insideRange && after.insideRange,
|
|
before.matchAncestors,
|
|
);
|
|
|
|
node.replaceChildren(...before.children, ...after.children);
|
|
node.matchLeaves.push(...before.matchLeaves, ...after.matchLeaves);
|
|
node.hasMatchHoles = before.hasMatchHoles || after.hasMatchHoles;
|
|
|
|
return node;
|
|
}
|
|
|
|
toString(): string {
|
|
return this.range.toString();
|
|
}
|
|
|
|
/**
|
|
* An ascent is placing a FormattingNode above an ElementNode.
|
|
* This happens, when the element node is an extension to the formatting node.
|
|
*
|
|
* @param elementNode: Its children will be discarded in favor of `this`s
|
|
* children.
|
|
*
|
|
* @example
|
|
* Practically speaking, it is what happens, when you turn:
|
|
* `<u><b>inside</b></u>` into `<b><u>inside</u></b>`, or
|
|
* `<u><b>inside</b><img src="image.jpg"></u>` into `<b><u>inside<img src="image.jpg"></u></b>
|
|
*/
|
|
ascendAbove(elementNode: ElementNode): void {
|
|
this.range.select(elementNode.element);
|
|
this.extensions.push(elementNode.element as HTMLElement | SVGElement);
|
|
|
|
if (!this.hasChildren()) {
|
|
// Drop elementNode, as it has no effect
|
|
return;
|
|
}
|
|
|
|
elementNode.replaceChildren(...this.replaceChildren(elementNode));
|
|
}
|
|
|
|
/**
|
|
* Extending only makes sense, if it is following by a FormattingNode
|
|
* ascending above it.
|
|
* Which is why if the match node is not ascendable, we might as well
|
|
* stop extending.
|
|
*
|
|
* @returns Whether formatting node ascended at least one level
|
|
*/
|
|
getExtension(): ElementNode | null {
|
|
const node = this.range.parent;
|
|
|
|
if (nodeIsElement(node)) {
|
|
return ElementNode.make(node, this.insideRange);
|
|
}
|
|
|
|
return null;
|
|
}
|
|
|
|
// The following methods are meant for users when specifying their surround
|
|
// formats and is not vital to the algorithm itself
|
|
|
|
/**
|
|
* Match leaves are the matching elements that are/were descendants of
|
|
* `this`. This makes them the element nodes, which actually affect text
|
|
* nodes located inside `this`.
|
|
*
|
|
* @example
|
|
* If we are surrounding with bold, then in this case:
|
|
* `<b><b>first</b><b>second</b></b>
|
|
* The inner b tags are match leaves, but the outer b tag is not, because
|
|
* it does affect any text nodes.
|
|
*
|
|
* @remarks
|
|
* These are important for mergers.
|
|
*/
|
|
matchLeaves: Match<T>[] = [];
|
|
|
|
get firstLeaf(): Match<T> | null {
|
|
if (this.matchLeaves.length === 0) {
|
|
return null;
|
|
}
|
|
|
|
return this.matchLeaves[0];
|
|
}
|
|
|
|
/**
|
|
* Match holes are text nodes which are descendants of `this`, but are not
|
|
* descendants of any match leaves of `this`.
|
|
*/
|
|
hasMatchHoles = true;
|
|
|
|
get closestAncestor(): Match<T> | null {
|
|
if (this.matchAncestors.length === 0) {
|
|
return null;
|
|
}
|
|
|
|
return this.matchAncestors[this.matchAncestors.length - 1];
|
|
}
|
|
|
|
/**
|
|
* Extensions of formatting nodes with a single element contained in their
|
|
* range are direct exclusive descendant elements of this element.
|
|
* Extensions are sorted in tree order.
|
|
*
|
|
* @example
|
|
* When surrounding "inside" with a bold format in the following case:
|
|
* `<span class="myclass"><em>inside</em></span>`
|
|
* The formatting node would sit above the span (it ascends above both
|
|
* the span and the em tag), and both tags are extensions to this node.
|
|
*
|
|
* @example
|
|
* When a format only wants to add a class, it would typically look for an
|
|
* extension first. When applying class="myclass" to "inside" in the
|
|
* following case:
|
|
* `<em><span style="color: rgb(255, 0, 0)"><b>inside</b></span></em>`
|
|
* It would typically become:
|
|
* `<em><span class="myclass" style="color: rgb(255, 0, 0)"><b>inside</b></span></em>`
|
|
*/
|
|
extensions: (HTMLElement | SVGElement)[] = [];
|
|
|
|
/**
|
|
* @param insideValue: The value that should be returned, if the formatting
|
|
* node is inside the original range. If the node is not inside the original
|
|
* range, the cache of the first leaf, or the closest match ancestor will be
|
|
* returned.
|
|
*/
|
|
getCache(insideValue: T): T | null {
|
|
if (this.insideRange) {
|
|
return insideValue;
|
|
} else if (this.firstLeaf) {
|
|
return this.firstLeaf.cache;
|
|
} else if (this.closestAncestor) {
|
|
return this.closestAncestor.cache;
|
|
}
|
|
|
|
// Should never happen, as a formatting node is always either
|
|
// inside a range or inside a match
|
|
return null;
|
|
}
|
|
|
|
/**
|
|
* Whether the text nodes in this formatting node are affected by any match.
|
|
* This can only be false, if `insideRange` is true (otherwise it would have
|
|
* become a BlockNode).
|
|
*/
|
|
get hasMatch(): boolean {
|
|
return this.matchLeaves.length > 0 || this.matchAncestors.length > 0;
|
|
}
|
|
}
|