Range set data structure for the CodeMirror code editor. 

Range set data structure for the CodeMirror code editor

marijn

adrianheine

@codemirror/rangeset

Error

Ignore

Warn

License

Maintenance

Miscellaneous

Quality

Supply chain risk

Vulnerability

Admins only

Organization members

Dashboard

<upgradeLink>Upgrade</upgradeLink> to access this feature

About

Blog

Socket CLI

Customers

Socket Dependency Search

Docs

Socket for GitHub

Love

Impersonation Mode Active

Update your browser to the latest version for the best experience.

Your web browser is outdated

Use another browser for the best experience.

Your web browser is unsupported

{{count, number}} commits last two months

{{count, number}} critical severity alert

{{count, number}} critical severity alerts

{{count, number}} dependency vulnerability

{{count, number}} dependency vulnerabilities

{{count, number}} development dependencies

{{count, number}} transitive dependencies

{{count, number}} version published last month

{{count, number}} versions published last month

{{count, number}} version published in last two months

{{count, number}} versions published in last two months

{{count, number}} version published last week

{{count, number}} versions published last week

{{count, number}} version published last year

{{count, number}} versions published last year

Socket undergoes annual SOC2 Type II audits. Socket customers can request a copy of the full SOC2 Type II report.

Allows organization owners and admins to access detailed records of actions taken by members of their organization, complete with timestamps.

Prevent compromised packages from infiltrating your supply chain by monitoring for changes in real-time.

Join our Discord community to get help from Socket engineers and other Socket users.

Compare millions of open source packages on socket.dev

Detect malicious code and risky behavior (e.g. network) in your dependencies using "deep package inspection"

All data is encrypted in transit and at rest using industry standard encryption algorithms.

Get a dedicated Socket account manager and access to Socket’s Customer Success team.

Get dedicated support from Socket engineers via email and Slack.

"Shift left" with the Socket Chrome extension and give intervene early, before developers choose risky or low quality dependencies.

Catch developers using risky dependencies and give them a "speed bump" to encourage good behavior

Install the Socket GitHub app to receive real-time dependency scanning and reports with every pull request.

Integrate Socket into your GitHub SCM to prevent risky dependencies from being installed.

Socket scans for vulnerabilities in your dependencies, including CVEs, security advisories, and more.

Socket supports dependencies in many languages, with most popular ecosystems coming in 2024. We've got you covered no matter what languages you use.

Enforce license policies across your organization

Receive a Microsoft Teams message to the channel of your choice anytime Socket runs a new analysis, has a new finding, or a policy has changed.

Get help migrating from Socket's free plan to Socket's paid plans.

Run Socket on-premises or in your own cloud environment.

Query for any dependency (at any version) across your entire organization

Integrate Socket into your CI/CD pipeline to prevent risky dependencies from being deployed to production.

Analyze an entire project to find supply chain risks

Tag projects to organize and filter your projects

Restrict access based on the roles of individual users within an organization.

Receive a Slack message to the channel of your choice anytime Socket runs a new analysis, has a new finding, or a policy has changed.

Socket is SOC2 Type II compliant and undergoes annual audits.

The Socket CLI allows teams to prevent risky dependencies from being installed, and to get dependency insights from the command line.

Socket supports SAML SSO for single sign-on and identity management.

Integrate Socket into your VS Code IDE to prevent risky dependencies from being installed.

Get a POST request anytime Socket runs a new analysis, has a new finding, or a policy has changed.

Socket will analyzed your SBOMs up to a maximum number of dependencies.

API that allows you to analyze a project, lookup package scores and alerts, and more.

Create API tokens to authenticate with the Socket API and CLI.

The number of developers in your team. A developer is someone who made a commit to your organization's repositories scanned by Socket in the past month.

Use Socket to protect your private repositories.

Socket is always free for open source projects.

Socket retains all reporting data for 3 months, 1 year, or a custom term of your choice.

Access the threat feed that powers Socket.

Unlimited scale, self-hosting, and priority support for large teams.

For open-source projects, individuals, and small teams.

For growing teams with enhanced scale, security, and support.

There is a package with a similar name that is downloaded much more often.

There are packages with similar names that are downloaded much more often.

This may not be the package you want!

Instance

Alert Locations

Package

The {{ecosystem}} package {{- packageName}} receives a total of <strong>{{numWeeklyDownloadCount, number}}</strong> weekly downloads. As such, {{- packageName}} popularity was classified as <strong>{{popularity}}</strong>.

Is {{- packageName}} popular?

Is {{- packageName}} safe to use?

Is {{- packageName}} well maintained?

What is {{- packageName}}?

{{packageDescription}}Version: {{versionString}} was published by {{publisherName}}. Start using Socket to analyze {{- packageName}} and its {{dependencyCount, number}} dependencies to secure your app from supply chain attacks.

Sorry, it seems this package was removed from the registry

Package was removed

This package version has been unpublished, mostly likely due to security reasons

Package version was removed

Provide a detailed description of the malware...

Socket fights vulnerabilities and provides visibility, defense-in-depth, and proactive supply chain protection for JavaScript, Python, and Go dependencies.

Socket - Secure your dependencies. Ship with confidence.

Compare versions

{{- packageName}} - npm Package Compare versions

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.

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.

The package now also exports a CommonJS module.

import { MapMode } from '@codemirror/state';

Each range is associated with a value, which must inherit from

    Compare this value with another value. The default

    Create a [range](https://codemirror.net/6/docs/ref/#rangeset.Range) with this value.

    range(from, to = from) { return new Range(from, to, this); }

RangeValue.prototype.startSide = RangeValue.prototype.endSide = 0;

RangeValue.prototype.mapMode = MapMode.TrackDel;

A range associates a value with a range of positions.

    The value associated with this range.

    return a.from - b.from || a.value.startSide - b.value.startSide;

    // Chunks are marked with the largest point that occurs

    // in them (or -1 for no points), so that scans that are

    // only interested in points (such as the

    // heightmap-related logic) can skip range-only chunks.

    get length() { return this.to[this.to.length - 1]; }

    // Find the index of the given position and side. Use the ranges'

    // `from` pos when `end == false`, `to` when `end == true`.

    findIndex(pos, side, end, startAt = 0) {

        let arr = end ? this.to : this.from;

        for (let lo = startAt, hi = arr.length;;) {

            let diff = arr[mid] - pos || (end ? this.value[mid].endSide : this.value[mid].startSide) - side;

                return diff >= 0 ? lo : hi;

        for (let i = this.findIndex(from, -1000000000 /* Far */, true), e = this.findIndex(to, 1000000000 /* Far */, false, i); i < e; i++)

            if (f(this.from[i] + offset, this.to[i] + offset, this.value[i]) === false)

        let value = [], from = [], to = [], newPos = -1, maxPoint = -1;

        for (let i = 0; i < this.value.length; i++) {

            let val = this.value[i], curFrom = this.from[i] + offset, curTo = this.to[i] + offset, newFrom, newTo;

                let mapped = changes.mapPos(curFrom, val.startSide, val.mapMode);

                newFrom = newTo = mapped;

                if (val.startSide != val.endSide) {

                    newTo = changes.mapPos(curFrom, val.endSide);

                newFrom = changes.mapPos(curFrom, val.startSide);

        if (changes.length == 0 || this.isEmpty)

        if (changes.empty || this.isEmpty)

        let chunks = [], chunkPos = [], maxPoint = -1;

        for (let i = 0; i < this.chunk.length; i++) {

            let start = this.chunkPos[i], chunk = this.chunk[i];

            let touch = changes.touchesRange(start, start + chunk.length);

                maxPoint = Math.max(maxPoint, chunk.maxPoint);

                chunkPos.push(changes.mapPos(start));

                let { mapped, pos } = chunk.map(start, changes);

                    maxPoint = Math.max(maxPoint, mapped.maxPoint);

        let next = this.nextLayer.map(changes);

        return chunks.length == 0 ? next : new RangeSet(chunkPos, chunks, next, maxPoint);

    Iterate over the ranges that touch the region `from` to `to`,

    calling `f` for each. There is no guarantee that the ranges will

    be reported in any specific order. When the callback returns

            if (to >= start && from <= start + chunk.length &&

                chunk.between(start, from - start, to - start, f) === false)

        this.nextLayer.between(from, to, f);

    Iterate over the ranges in this set, in order, including all

        return HeapCursor.from([this]).goto(from);

    get isEmpty() { return this.nextLayer == this; }

    Iterate over the ranges in a collection of sets, in order,

        return HeapCursor.from(sets).goto(from);

    Iterate over two groups of sets, calling methods on `comparator`

    to notify it of possible differences.

    This indicates how the underlying data changed between these

    ranges, and is needed to synchronize the iteration. `from` and

    `to` are coordinates in the _new_ space, after these changes.

    Can be used to ignore all non-point ranges, and points below

    the given size. When -1, all ranges are compared.

        let a = oldSets.filter(set => set.maxPoint > 0 || !set.isEmpty && set.maxPoint >= minPointSize);

        let b = newSets.filter(set => set.maxPoint > 0 || !set.isEmpty && set.maxPoint >= minPointSize);

        let sharedChunks = findSharedChunks(a, b, textDiff);

        let sideA = new SpanCursor(a, sharedChunks, minPointSize);

        let sideB = new SpanCursor(b, sharedChunks, minPointSize);

        textDiff.iterGaps((fromA, fromB, length) => compare(sideA, fromA, sideB, fromB, length, comparator));

        if (textDiff.empty && textDiff.length == 0)

            compare(sideA, 0, sideB, 0, 0, comparator);

    Compare the contents of two groups of range sets, returning true

    if they are equivalent in the given range.

    static eq(oldSets, newSets, from = 0, to) {

        let a = oldSets.filter(set => !set.isEmpty && newSets.indexOf(set) < 0);

        let b = newSets.filter(set => !set.isEmpty && oldSets.indexOf(set) < 0);

        let sharedChunks = findSharedChunks(a, b);

        let sideA = new SpanCursor(a, sharedChunks, 0).goto(from), sideB = new SpanCursor(b, sharedChunks, 0).goto(from);

		@@ -0,1 +1,7 @@
		## 0.19.8 (2022-02-19)

		### Bug fixes

		Fix a bug where mapping a changeset through an empty set of changes would produce a new value.

		## 0.19.7 (2022-02-15)
		@@ -2,0 +8,0 @@

		@@ -221,3 +221,3 @@ import { MapMode } from '@codemirror/state';
		map(changes) {
		if (changes.length == 0 \|\| this.isEmpty)
		if (changes.empty \|\| this.isEmpty)
		return this;
		@@ -224,0 +224,0 @@ let chunks = [], chunkPos = [], maxPoint = -1;

		{
		"name": "@codemirror/rangeset",
		"version": "0.19.7",
		"version": "0.19.8",
		"description": "Range set data structure for the CodeMirror code editor",
		@@ -5,0 +5,0 @@ "scripts": {

Improved metrics