Skip to content

Commit

Permalink
🤖 refactor: Use ESM import syntax.
Browse files Browse the repository at this point in the history
These changes were automatically generated by a transform whose code can be found at:
  - https://github.com/aureooms/rejuvenate/blob/e086830dfe927964be93f46b8ecdacd2597eb487/src/transforms/codemod:use-esm-import-syntax.js
Please contact the author of the transform if you believe there was an error.
  • Loading branch information
a-flying-potato authored and make-github-pseudonymous-again committed Mar 25, 2021
1 parent d5b5f31 commit f5b3936
Show file tree
Hide file tree
Showing 18 changed files with 30 additions and 30 deletions.
2 changes: 1 addition & 1 deletion src/BasePairs.js
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
import {map, filter} from '@aureooms/js-itertools';
import {NotImplementedError} from '@aureooms/js-error';
import iterableFromMap from './iterableFromMap';
import iterableFromMap from "./iterableFromMap.js";

export default class BasePairs {
// Set-like
Expand Down
6 changes: 3 additions & 3 deletions src/EfficientlyInvertiblePairs.js
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
import BasePairs from './BasePairs';
import insert from './insert';
import remove from './remove';
import BasePairs from "./BasePairs.js";
import insert from "./insert.js";
import remove from "./remove.js";

export default class EfficientlyInvertiblePairs extends BasePairs {
static from(pairs) {
Expand Down
8 changes: 4 additions & 4 deletions src/MemoryEfficientPairs.js
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
import BasePairs from './BasePairs';
import insert from './insert';
import remove from './remove';
import invertIterable from './invertIterable';
import BasePairs from "./BasePairs.js";
import insert from "./insert.js";
import remove from "./remove.js";
import invertIterable from "./invertIterable.js";

export default class MemoryEfficientPairs extends BasePairs {
static from(pairs) {
Expand Down
16 changes: 8 additions & 8 deletions src/index.js
Original file line number Diff line number Diff line change
@@ -1,11 +1,11 @@
import BasePairs from './BasePairs';
import EfficientlyInvertiblePairs from './EfficientlyInvertiblePairs';
import MemoryEfficientPairs from './MemoryEfficientPairs';
import insert from './insert';
import invertIterable from './invertIterable';
import iterableFromMap from './iterableFromMap';
import remove from './remove';
import swap from './swap';
import BasePairs from "./BasePairs.js";
import EfficientlyInvertiblePairs from "./EfficientlyInvertiblePairs.js";
import MemoryEfficientPairs from "./MemoryEfficientPairs.js";
import insert from "./insert.js";
import invertIterable from "./invertIterable.js";
import iterableFromMap from "./iterableFromMap.js";
import remove from "./remove.js";
import swap from "./swap.js";

/* eslint import/no-anonymous-default-export: [2, {"allowObject": true}] */
export default {
Expand Down
2 changes: 1 addition & 1 deletion src/invertIterable.js
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
import {map} from '@aureooms/js-itertools';
import swap from './swap';
import swap from "./swap.js";

export default function invertIterable(iterable) {
return map(swap, iterable);
Expand Down
2 changes: 1 addition & 1 deletion test/src/Symbol.iterator.js
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@ import test from 'ava';
import {sorted, map, list, group} from '@aureooms/js-itertools';
import {lexicographical, increasing} from '@aureooms/js-compare';

import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from '../../src';
import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from "../../src/index.js";

const order = lexicographical(increasing);
const set = (x) =>
Expand Down
2 changes: 1 addition & 1 deletion test/src/clear.js
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
import test from 'ava';

import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from '../../src';
import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from "../../src/index.js";

const macro = (t, Pairs, input) => {
const result = Pairs.from(input);
Expand Down
2 changes: 1 addition & 1 deletion test/src/delete.js
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
import test from 'ava';

import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from '../../src';
import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from "../../src/index.js";

const macro = (t, Pairs, input, deleted) => {
const result = Pairs.from(input);
Expand Down
2 changes: 1 addition & 1 deletion test/src/entries.js
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@ import test from 'ava';
import {sorted, map, list, group} from '@aureooms/js-itertools';
import {lexicographical, increasing} from '@aureooms/js-compare';

import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from '../../src';
import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from "../../src/index.js";

const order = lexicographical(increasing);
const set = (x) =>
Expand Down
2 changes: 1 addition & 1 deletion test/src/forEach.js
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@ import test from 'ava';
import {sorted, map, list, group} from '@aureooms/js-itertools';
import {lexicographical, increasing} from '@aureooms/js-compare';

import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from '../../src';
import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from "../../src/index.js";

const order = lexicographical(increasing);
const set = (x) =>
Expand Down
2 changes: 1 addition & 1 deletion test/src/from.js
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@ import test from 'ava';
import {sorted, map, list, group} from '@aureooms/js-itertools';
import {lexicographical, increasing} from '@aureooms/js-compare';

import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from '../../src';
import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from "../../src/index.js";

const order = lexicographical(increasing);
const set = (x) =>
Expand Down
2 changes: 1 addition & 1 deletion test/src/invert.js
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@ import test from 'ava';
import {sorted, map, list, group} from '@aureooms/js-itertools';
import {lexicographical, increasing} from '@aureooms/js-compare';

import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from '../../src';
import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from "../../src/index.js";

const order = lexicographical(increasing);
const set = (x) =>
Expand Down
2 changes: 1 addition & 1 deletion test/src/keys.js
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@ import test from 'ava';
import {sorted, map, list, group} from '@aureooms/js-itertools';
import {lexicographical, increasing} from '@aureooms/js-compare';

import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from '../../src';
import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from "../../src/index.js";

const order = lexicographical(increasing);
const set = (x) =>
Expand Down
2 changes: 1 addition & 1 deletion test/src/left.js
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ import {
} from '@aureooms/js-itertools';
import {increasing} from '@aureooms/js-compare';

import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from '../../src';
import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from "../../src/index.js";

const set = (x) => sorted(increasing, new Set(x));
const left = (x) => map(([A, _B]) => A, x);
Expand Down
2 changes: 1 addition & 1 deletion test/src/leftOf.js
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ import {
} from '@aureooms/js-itertools';
import {increasing} from '@aureooms/js-compare';

import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from '../../src';
import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from "../../src/index.js";

const set = (x) => sorted(increasing, new Set(x));
const left = (x) => map(([A, _B]) => A, x);
Expand Down
2 changes: 1 addition & 1 deletion test/src/right.js
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ import {
} from '@aureooms/js-itertools';
import {increasing} from '@aureooms/js-compare';

import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from '../../src';
import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from "../../src/index.js";

const set = (x) => sorted(increasing, new Set(x));
const right = (x) => map(([_A, B]) => B, x);
Expand Down
2 changes: 1 addition & 1 deletion test/src/rightOf.js
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ import {
} from '@aureooms/js-itertools';
import {increasing} from '@aureooms/js-compare';

import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from '../../src';
import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from "../../src/index.js";

const set = (x) => sorted(increasing, new Set(x));
const right = (x) => map(([_A, B]) => B, x);
Expand Down
2 changes: 1 addition & 1 deletion test/src/size.js
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@ import test from 'ava';

import {enumerate} from '@aureooms/js-itertools';

import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from '../../src';
import {MemoryEfficientPairs, EfficientlyInvertiblePairs} from "../../src/index.js";

const macro = (t, Pairs, input) => {
const result = Pairs.from(input);
Expand Down

0 comments on commit f5b3936

Please sign in to comment.