As of 0.20.0, this package has been merged into @codemirror/state
Range set data structure for the CodeMirror code editor
[ WEBSITE | DOCS | ISSUES | FORUM | CHANGELOG ]
This package implements the range set data structure for the CodeMirror code editor.
The project page has more information, a number of examples and the documentation.
This code is released under an MIT license.
We aim to be an inclusive, welcoming community. To make that explicit, we have a code of conduct that applies to communication around the project.
Fix an issue where points that are entirely covered by a point coming before them could be returend by a span iterator when it started directly at the point's position.
Fix a bug where mapping a changeset through an empty set of changes would produce a new value.
Fix an issue that caused the sort option to RangeSet.update to have no effect.
Fix an issue where range sets that weren't mapped could cause RangeSet.compare to miss changes.
Fix a bug where a zero-length range, even when inclusive, was never mapped to cover any content.
RangeSet.spans now allows the iterator to have a filterPoint method, which can determine which point ranges are ignored.
Make sure non-empty point ranges at the end of another point range are covered by the bigger range.
Fix an issue in RangeSet.compare where the interaction between spans and points sometimes caused points that had their wrapping spans changed to not be reported.
Fix a bug in RangeSet.compare that would cause it miss changes when range sets were identical but the content under them moved.
Fix an issue where RangeSet.eq would consider rangesets equal even if they had a differing point range at the end of the compared range.
Fix a bug in range set iteration that would sometimes cause ranges to report their position as NaN, breaking downstream code.
Update dependencies to 0.19.0
Fix a problem in rangeset comparison that caused changes in the covering of point decorations by other decorations to be missed.
Fix an issue that caused RangeSet.between to incorrectly ignore ranges entirely at the start of the iterated region.
The new static RangeSet.eq method can be used to efficiently check whether two groups of change sets differ in a given range.
Adjust the logic for tracking open ranges to agree with the change in how precedence is handled in the view package.
When iterating spans and points, don't emit point ranges when they are entirely covered by a previous point.
Update dependencies to 0.18.
The package now also exports a CommonJS module.
First numbered release.
codemirror