Skip to content

Commit a37497a

Browse files
make-github-pseudonymous-againmake-github-pseudonymous-again
committed
😒 chore: Rename package.
1 parent 2c787af commit a37497a

25 files changed

+2850
-4105
lines changed

‎.esdoc.json

+1-1
Original file line numberDiff line numberDiff line change
@@ -35,7 +35,7 @@
3535
"autoPrivate": true
3636
},
3737
"brand": {
38-
"title": "@aureooms/js-skip-list"
38+
"title": "@data-structure/skip-list"
3939
},
4040
"test": {
4141
"type": "ava",

‎README.md

+18-18
Original file line numberDiff line numberDiff line change
@@ -1,16 +1,16 @@
1-
:fast_forward: [@aureooms/js-skip-list](https://make-github-pseudonymous-again.github.io/js-skip-list)
1+
:fast_forward: [@data-structure/skip-list](https://data-structures-and-algorithms.github.io/skip-list)
22
==
33

44
Skip list data structure for JavaScript.
5-
See [docs](https://make-github-pseudonymous-again.github.io/js-skip-list/index.html).
5+
See [docs](https://data-structures-and-algorithms.github.io/skip-list/index.html).
66

77
> :warning: The code requires `regeneratorRuntime` to be defined, for instance by importing
88
> [regenerator-runtime/runtime](https://www.npmjs.com/package/regenerator-runtime).
99
1010
```js
11-
import {decreasing} from '@aureooms/js-compare';
12-
import {range} from '@aureooms/js-itertools';
13-
import SkipList from '@aureooms/js-skip-list';
11+
import {decreasing} from '@total-order/primitive';
12+
import {range} from '@iterable-iterator/range';
13+
import {SkipList} from '@data-structure/skip-list';
1414
const list = SkipList.from(decreasing, range(10000));
1515
[...list]; // [9999, 9998, ...]
1616
list.add(...)
@@ -19,17 +19,17 @@ list.has(...)
1919
list.remove(...)
2020
```
2121

22-
[![License](https://img.shields.io/github/license/make-github-pseudonymous-again/js-skip-list.svg)](https://raw.githubusercontent.com/make-github-pseudonymous-again/js-skip-list/main/LICENSE)
23-
[![Version](https://img.shields.io/npm/v/@aureooms/js-skip-list.svg)](https://www.npmjs.org/package/@aureooms/js-skip-list)
24-
[![Build](https://img.shields.io/travis/make-github-pseudonymous-again/js-skip-list/main.svg)](https://travis-ci.org/make-github-pseudonymous-again/js-skip-list/branches)
25-
[![Dependencies](https://img.shields.io/david/make-github-pseudonymous-again/js-skip-list.svg)](https://david-dm.org/make-github-pseudonymous-again/js-skip-list)
26-
[![Dev dependencies](https://img.shields.io/david/dev/make-github-pseudonymous-again/js-skip-list.svg)](https://david-dm.org/make-github-pseudonymous-again/js-skip-list?type=dev)
27-
[![GitHub issues](https://img.shields.io/github/issues/make-github-pseudonymous-again/js-skip-list.svg)](https://github.com/make-github-pseudonymous-again/js-skip-list/issues)
28-
[![Downloads](https://img.shields.io/npm/dm/@aureooms/js-skip-list.svg)](https://www.npmjs.org/package/@aureooms/js-skip-list)
22+
[![License](https://img.shields.io/github/license/data-structures-and-algorithms/skip-list.svg)](https://raw.githubusercontent.com/data-structures-and-algorithms/skip-list/main/LICENSE)
23+
[![Version](https://img.shields.io/npm/v/@data-structure/skip-list.svg)](https://www.npmjs.org/package/@data-structure/skip-list)
24+
[![Build](https://img.shields.io/travis/data-structures-and-algorithms/skip-list/main.svg)](https://travis-ci.org/data-structures-and-algorithms/skip-list/branches)
25+
[![Dependencies](https://img.shields.io/david/data-structures-and-algorithms/skip-list.svg)](https://david-dm.org/data-structures-and-algorithms/skip-list)
26+
[![Dev dependencies](https://img.shields.io/david/dev/data-structures-and-algorithms/skip-list.svg)](https://david-dm.org/data-structures-and-algorithms/skip-list?type=dev)
27+
[![GitHub issues](https://img.shields.io/github/issues/data-structures-and-algorithms/skip-list.svg)](https://github.com/data-structures-and-algorithms/skip-list/issues)
28+
[![Downloads](https://img.shields.io/npm/dm/@data-structure/skip-list.svg)](https://www.npmjs.org/package/@data-structure/skip-list)
2929

30-
[![Code issues](https://img.shields.io/codeclimate/issues/make-github-pseudonymous-again/js-skip-list.svg)](https://codeclimate.com/github/make-github-pseudonymous-again/js-skip-list/issues)
31-
[![Code maintainability](https://img.shields.io/codeclimate/maintainability/make-github-pseudonymous-again/js-skip-list.svg)](https://codeclimate.com/github/make-github-pseudonymous-again/js-skip-list/trends/churn)
32-
[![Code coverage (cov)](https://img.shields.io/codecov/c/gh/make-github-pseudonymous-again/js-skip-list/main.svg)](https://codecov.io/gh/make-github-pseudonymous-again/js-skip-list)
33-
[![Code technical debt](https://img.shields.io/codeclimate/tech-debt/make-github-pseudonymous-again/js-skip-list.svg)](https://codeclimate.com/github/make-github-pseudonymous-again/js-skip-list/trends/technical_debt)
34-
[![Documentation](https://make-github-pseudonymous-again.github.io/js-skip-list/badge.svg)](https://make-github-pseudonymous-again.github.io/js-skip-list/source.html)
35-
[![Package size](https://img.shields.io/bundlephobia/minzip/@aureooms/js-skip-list)](https://bundlephobia.com/result?p=@aureooms/js-skip-list)
30+
[![Code issues](https://img.shields.io/codeclimate/issues/data-structures-and-algorithms/skip-list.svg)](https://codeclimate.com/github/data-structures-and-algorithms/skip-list/issues)
31+
[![Code maintainability](https://img.shields.io/codeclimate/maintainability/data-structures-and-algorithms/skip-list.svg)](https://codeclimate.com/github/data-structures-and-algorithms/skip-list/trends/churn)
32+
[![Code coverage (cov)](https://img.shields.io/codecov/c/gh/data-structures-and-algorithms/skip-list/main.svg)](https://codecov.io/gh/data-structures-and-algorithms/skip-list)
33+
[![Code technical debt](https://img.shields.io/codeclimate/tech-debt/data-structures-and-algorithms/skip-list.svg)](https://codeclimate.com/github/data-structures-and-algorithms/skip-list/trends/technical_debt)
34+
[![Documentation](https://data-structures-and-algorithms.github.io/skip-list/badge.svg)](https://data-structures-and-algorithms.github.io/skip-list/source.html)
35+
[![Package size](https://img.shields.io/bundlephobia/minzip/@data-structure/skip-list)](https://bundlephobia.com/result?p=@data-structure/skip-list)

‎doc/manual/example.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
11
# Examples
22

3-
> More examples in [the test files](https://github.com/make-github-pseudonymous-again/js-skip-list/tree/main/test/src).
3+
> More examples in [the test files](https://github.com/data-structures-and-algorithms/skip-list/tree/main/test/src).

‎doc/manual/installation.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -8,15 +8,15 @@ or [jspm](https://jspm.org/docs).
88

99
### yarn
1010
```terminal
11-
yarn add @aureooms/js-skip-list
11+
yarn add @data-structure/skip-list
1212
```
1313

1414
### npm
1515
```terminal
16-
npm install @aureooms/js-skip-list --save
16+
npm install @data-structure/skip-list --save
1717
```
1818

1919
### jspm
2020
```terminal
21-
jspm install npm:@aureooms/js-skip-list
21+
jspm install npm:@data-structure/skip-list
2222
```

‎doc/manual/usage.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ import 'regenerator-runtime/runtime.js' ;
1212

1313
Then, import the library where needed
1414
```js
15-
const skiplist = require( '@aureooms/js-skip-list' ) ;
15+
const skiplist = require( '@data-structure/skip-list' ) ;
1616
// or
17-
import * as skiplist from '@aureooms/js-skip-list' ;
17+
import * as skiplist from '@data-structure/skip-list' ;
1818
```

‎doc/scripts/header.js

+2-2
Original file line numberDiff line numberDiff line change
@@ -13,14 +13,14 @@ domReady(function(){
1313

1414
var projectname = document.createElement('a');
1515
projectname.classList.add('project-name');
16-
projectname.text = 'aureooms/js-skip-list';
16+
projectname.text = 'data-structure/skip-list';
1717
projectname.href = './index.html' ;
1818

1919
var header = document.getElementsByTagName('header')[0] ;
2020
header.insertBefore(projectname,header.firstChild);
2121

2222
var testlink = document.querySelector('header > a[data-ice="testLink"]') ;
23-
testlink.href = 'https://coveralls.io/github/make-github-pseudonymous-again/js-skip-list' ;
23+
testlink.href = 'https://coveralls.io/github/data-structures-and-algorithms/skip-list' ;
2424
testlink.target = '_BLANK' ;
2525

2626
var searchBox = document.querySelector('.search-box');

‎package.json

+29-20
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
{
2-
"name": "@aureooms/js-skip-list",
2+
"name": "@data-structure/skip-list",
33
"description": "Skip list data structure for JavaScript",
44
"version": "0.0.1",
5-
"author": "aureooms",
5+
"author": "make-github-pseudonymous-again",
66
"ava": {
77
"files": [
88
"test/src/**/*"
@@ -74,38 +74,46 @@
7474
}
7575
},
7676
"bugs": {
77-
"url": "https://github.com/make-github-pseudonymous-again/js-skip-list/issues"
77+
"url": "https://github.com/data-structures-and-algorithms/skip-list/issues"
78+
},
79+
"dependencies": {
80+
"@iterable-iterator/cardinality": "^4.0.0",
81+
"@iterable-iterator/zip": "^1.0.1"
7882
},
79-
"dependencies": {},
8083
"devDependencies": {
81-
"@aureooms/js-cardinality": "2.0.0",
82-
"@aureooms/js-compare": "1.4.8",
83-
"@aureooms/js-itertools": "5.0.1",
84-
"@aureooms/js-random": "2.0.0",
85-
"@babel/cli": "7.13.10",
86-
"@babel/core": "7.13.10",
87-
"@babel/preset-env": "7.13.10",
88-
"@babel/register": "7.13.8",
84+
"@babel/cli": "7.19.3",
85+
"@babel/core": "7.19.6",
86+
"@babel/preset-env": "7.19.4",
87+
"@babel/register": "7.18.9",
88+
"@iterable-iterator/consume": "^1.0.1",
89+
"@iterable-iterator/iter": "^1.0.1",
90+
"@iterable-iterator/list": "^1.0.1",
91+
"@iterable-iterator/map": "^1.0.1",
92+
"@iterable-iterator/range": "^2.1.0",
93+
"@iterable-iterator/slice": "^1.0.2",
94+
"@iterable-iterator/sorted": "^1.0.0",
95+
"@randomized/random": "^4.1.0",
96+
"@total-order/primitive": "^1.0.1",
8997
"ava": "3.15.0",
9098
"babel-plugin-transform-remove-console": "6.9.4",
91-
"babel-plugin-unassert": "3.0.1",
99+
"babel-plugin-unassert": "3.2.0",
92100
"babel-preset-power-assert": "3.0.0",
93-
"coveralls": "3.1.0",
101+
"coveralls": "3.1.1",
94102
"esdoc": "1.1.0",
95103
"esdoc-ecmascript-proposal-plugin": "1.0.0",
96104
"esdoc-inject-script-plugin": "1.0.0",
97105
"esdoc-inject-style-plugin": "1.0.0",
98106
"esdoc-standard-plugin": "1.0.0",
99-
"np": "7.4.0",
107+
"np": "7.6.2",
100108
"nyc": "15.1.0",
101109
"power-assert": "1.6.1",
102-
"regenerator-runtime": "0.13.7",
103-
"xo": "0.36.1"
110+
"regenerator-runtime": "0.13.10",
111+
"xo": "0.52.4"
104112
},
105113
"files": [
106114
"lib"
107115
],
108-
"homepage": "https://make-github-pseudonymous-again.github.io/js-skip-list",
116+
"homepage": "https://data-structures-and-algorithms.github.io/skip-list",
109117
"keywords": [
110118
"data",
111119
"list",
@@ -122,7 +130,7 @@
122130
},
123131
"repository": {
124132
"type": "git",
125-
"url": "https://github.com/make-github-pseudonymous-again/js-skip-list"
133+
"url": "https://github.com/data-structures-and-algorithms/skip-list"
126134
},
127135
"scripts": {
128136
"build": "babel --delete-dir-on-start --env-name production src -d lib",
@@ -142,7 +150,8 @@
142150
"unicorn"
143151
],
144152
"rules": {
145-
"unicorn/filename-case": "off"
153+
"unicorn/filename-case": "off",
154+
"unicorn/prefer-node-protocol": "off"
146155
},
147156
"ignores": [
148157
"lib",

‎src/SkipList.js

+10-10
Original file line numberDiff line numberDiff line change
@@ -1,14 +1,14 @@
11
import assert from 'assert';
2-
import Node from './Node';
3-
import keys from './keys';
4-
import iter from './iter';
5-
import downMost from './downMost';
6-
import searchTopMost from './searchTopMost';
7-
import bottomMostPredecessor from './bottomMostPredecessor';
8-
import deleteFromTopMost from './deleteFromTopMost';
9-
import insertFromBottomMostPredecessor from './insertFromBottomMostPredecessor';
10-
import makeQuasiRandom from './makeQuasiRandom';
11-
import makeBottomLevel from './makeBottomLevel';
2+
import Node from './Node.js';
3+
import keys from './keys.js';
4+
import iter from './iter.js';
5+
import downMost from './downMost.js';
6+
import searchTopMost from './searchTopMost.js';
7+
import bottomMostPredecessor from './bottomMostPredecessor.js';
8+
import deleteFromTopMost from './deleteFromTopMost.js';
9+
import insertFromBottomMostPredecessor from './insertFromBottomMostPredecessor.js';
10+
import makeQuasiRandom from './makeQuasiRandom.js';
11+
import makeBottomLevel from './makeBottomLevel.js';
1212

1313
/**
1414
* @param {Number} p Promotion probability in (0,1).

‎src/debug.js

+5-4
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
1-
import iter from './iter';
2-
import iterDown from './iterDown';
3-
import {enumerate} from '@aureooms/js-itertools';
4-
import {count} from '@aureooms/js-cardinality';
1+
import {enumerate} from '@iterable-iterator/zip';
2+
import {count} from '@iterable-iterator/cardinality';
3+
4+
import iter from './iter.js';
5+
import iterDown from './iterDown.js';
56

67
export default function* debug(skiplist) {
78
for (const [k, sentinel] of enumerate(iterDown(skiplist.head))) {

‎src/index.js

+17-37
Original file line numberDiff line numberDiff line change
@@ -1,39 +1,19 @@
1-
import Node from './Node';
2-
import SkipList from './SkipList';
3-
import bottomMostPredecessor from './bottomMostPredecessor';
4-
import debug from './debug';
5-
import deleteFromTopMost from './deleteFromTopMost';
6-
import downMost from './downMost';
7-
import heads from './heads';
8-
import insertFromBottomMostPredecessor from './insertFromBottomMostPredecessor';
9-
import iter from './iter';
10-
import iterDown from './iterDown';
11-
import keys from './keys';
12-
import makeBottomLevel from './makeBottomLevel';
13-
import makeDeterministic from './makeDeterministic';
14-
import makeQuasiRandom from './makeQuasiRandom';
15-
import node from './node';
16-
import predecessorOnPreviousLevel from './predecessorOnPreviousLevel';
17-
import searchTopMost from './searchTopMost';
1+
export {default as SkipList} from './SkipList.js';
182

19-
export default SkipList;
3+
export {default as keys} from './keys.js';
4+
export {default as makeDeterministic} from './makeDeterministic.js';
5+
export {default as makeQuasiRandom} from './makeQuasiRandom.js';
6+
export {default as node} from './node.js';
7+
export {default as predecessorOnPreviousLevel} from './predecessorOnPreviousLevel.js';
8+
export {default as searchTopMost} from './searchTopMost.js';
209

21-
export {
22-
Node,
23-
SkipList,
24-
bottomMostPredecessor,
25-
debug,
26-
deleteFromTopMost,
27-
downMost,
28-
heads,
29-
insertFromBottomMostPredecessor,
30-
iter,
31-
iterDown,
32-
keys,
33-
makeBottomLevel,
34-
makeDeterministic,
35-
makeQuasiRandom,
36-
node,
37-
predecessorOnPreviousLevel,
38-
searchTopMost,
39-
};
10+
export {default as Node} from './Node.js';
11+
export {default as bottomMostPredecessor} from './bottomMostPredecessor.js';
12+
export {default as debug} from './debug.js';
13+
export {default as downMost} from './downMost.js';
14+
export {default as deleteFromTopMost} from './deleteFromTopMost.js';
15+
export {default as insertFromBottomMostPredecessor} from './insertFromBottomMostPredecessor.js';
16+
export {default as heads} from './heads.js';
17+
export {default as iterDown} from './iterDown.js';
18+
export {default as iter} from './iter.js';
19+
export {default as makeBottomLevel} from './makeBottomLevel.js';

‎src/insertFromBottomMostPredecessor.js

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
import assert from 'assert';
22

3-
import node from './node';
4-
import heads from './heads';
5-
import predecessorOnPreviousLevel from './predecessorOnPreviousLevel';
3+
import node from './node.js';
4+
import heads from './heads.js';
5+
import predecessorOnPreviousLevel from './predecessorOnPreviousLevel.js';
66

77
const insertFromBottomMostPredecessor = (p, pred, key) => {
88
assert(pred !== null);

‎src/keys.js

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
import iter from './iter';
1+
import iter from './iter.js';
22

33
export default function* keys(level) {
44
for (const node of iter(level)) yield node.key;

‎src/makeBottomLevel.js

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
import Node from './Node';
1+
import Node from './Node.js';
22

33
const makeBottomLevel = (compare, iterable) => {
44
const sorted = [...iterable].sort(compare);

‎src/makeDeterministic.js

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
import assert from 'assert';
2-
import Node from './Node';
2+
import Node from './Node.js';
33

44
/**
55
* Make a balanced Skip-list with p = 1/2.

‎src/makeQuasiRandom.js

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
import assert from 'assert';
2-
import Node from './Node';
3-
import heads from './heads';
2+
import Node from './Node.js';
3+
import heads from './heads.js';
44

55
/**
66
* Make a balanced Skip-list with p = 1/2 but randomizing the choice of

‎src/node.js

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
import Node from './Node';
1+
import Node from './Node.js';
22

33
const node = (
44
key = undefined,

‎src/predecessorOnPreviousLevel.js

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
import assert from 'assert';
22

3-
import Node from './Node';
3+
import Node from './Node.js';
44

55
const predecessorOnPreviousLevel = (node) => {
66
assert(node !== null);

‎test/src/SkipList/from.js

+8-5
Original file line numberDiff line numberDiff line change
@@ -1,20 +1,23 @@
11
import test from 'ava';
22

3-
import {increasing, decreasing} from '@aureooms/js-compare';
3+
import {increasing, decreasing} from '@total-order/primitive';
44

5-
import {list, range, sorted} from '@aureooms/js-itertools';
5+
import {list} from '@iterable-iterator/list';
6+
import {range} from '@iterable-iterator/range';
7+
import {sorted} from '@iterable-iterator/sorted';
68

7-
import {SkipList} from '../../../src';
9+
import {SkipList} from '../../../src/index.js';
810

911
const macro = (t, p, compare, n) => {
1012
const tree = SkipList.from(compare, range(n), p);
1113
t.deepEqual(sorted(compare, range(n)), list(tree));
1214
};
1315

1416
macro.title = (title, p, compare, n) =>
15-
title || `SkipList.from(${compare.name}, range(${n}), ${p})`;
17+
title ??
18+
`SkipList.from(${compare === increasing ? 'inc' : 'dec'}, range(${n}), ${p})`;
1619

17-
for (const n of [0, 1, 2, 3, 7, 36, 100, 1011, 4387, 10000]) {
20+
for (const n of [0, 1, 2, 3, 7, 36, 100, 1011, 4387, 10_000]) {
1821
for (const compare of [increasing, decreasing]) {
1922
for (const p of [1 / 4, 1 / 3, 1 / 2, 2 / 3, 3 / 4]) {
2023
test(macro, p, compare, n);

0 commit comments

Comments
 (0)