mirror of
https://github.com/josdejong/mathjs.git
synced 2026-01-18 14:59:29 +00:00
* Add `.js` extension to source file imports * Specify package `exports` in `package.json` Specify package type as `commonjs` (It's good to be specific) * Move all compiled scripts into `lib` directory Remove ./number.js (You can use the compiled ones in `./lib/*`) Tell node that the `esm` directory is type `module` and enable tree shaking. Remove unused files from packages `files` property * Allow importing of package.json * Make library ESM first * - Fix merge conflicts - Refactor `bundleAny` into `defaultInstance.js` and `browserBundle.cjs` - Refactor unit tests to be able to run with plain nodejs (no transpiling) - Fix browser examples * Fix browser and browserstack tests * Fix running unit tests on Node 10 (which has no support for modules) * Fix node.js examples (those are still commonjs) * Remove the need for `browserBundle.cjs` * Generate minified bundle only * [Security] Bump node-fetch from 2.6.0 to 2.6.1 (#1963) Bumps [node-fetch](https://github.com/bitinn/node-fetch) from 2.6.0 to 2.6.1. **This update includes a security fix.** - [Release notes](https://github.com/bitinn/node-fetch/releases) - [Changelog](https://github.com/node-fetch/node-fetch/blob/master/docs/CHANGELOG.md) - [Commits](https://github.com/bitinn/node-fetch/compare/v2.6.0...v2.6.1) Signed-off-by: dependabot-preview[bot] <support@dependabot.com> Co-authored-by: dependabot-preview[bot] <27856297+dependabot-preview[bot]@users.noreply.github.com> * Cleanup console.log * Add integration tests to test the entry points (commonjs/esm, full/number only) * Create backward compatibility error messages in the files moved/removed since v8 * Describe breaking changes in HISTORY.md * Bump karma from 5.2.1 to 5.2.2 (#1965) Bumps [karma](https://github.com/karma-runner/karma) from 5.2.1 to 5.2.2. - [Release notes](https://github.com/karma-runner/karma/releases) - [Changelog](https://github.com/karma-runner/karma/blob/master/CHANGELOG.md) - [Commits](https://github.com/karma-runner/karma/compare/v5.2.1...v5.2.2) Signed-off-by: dependabot-preview[bot] <support@dependabot.com> Co-authored-by: dependabot-preview[bot] <27856297+dependabot-preview[bot]@users.noreply.github.com> Co-authored-by: Lee Langley-Rees <lee@greenimp.co.uk> Co-authored-by: dependabot-preview[bot] <27856297+dependabot-preview[bot]@users.noreply.github.com>
63 lines
2.3 KiB
JavaScript
63 lines
2.3 KiB
JavaScript
import { flatten, generalize, identify } from '../../utils/array.js'
|
|
import { factory } from '../../utils/factory.js'
|
|
|
|
const name = 'setDifference'
|
|
const dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix']
|
|
|
|
export const createSetDifference = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, subset, compareNatural, Index, DenseMatrix }) => {
|
|
/**
|
|
* Create the difference of two (multi)sets: every element of set1, that is not the element of set2.
|
|
* Multi-dimension arrays will be converted to single-dimension arrays before the operation.
|
|
*
|
|
* Syntax:
|
|
*
|
|
* math.setDifference(set1, set2)
|
|
*
|
|
* Examples:
|
|
*
|
|
* math.setDifference([1, 2, 3, 4], [3, 4, 5, 6]) // returns [1, 2]
|
|
* math.setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]]) // returns [1, 2]
|
|
*
|
|
* See also:
|
|
*
|
|
* setUnion, setIntersect, setSymDifference
|
|
*
|
|
* @param {Array | Matrix} a1 A (multi)set
|
|
* @param {Array | Matrix} a2 A (multi)set
|
|
* @return {Array | Matrix} The difference of two (multi)sets
|
|
*/
|
|
return typed(name, {
|
|
'Array | Matrix, Array | Matrix': function (a1, a2) {
|
|
let result
|
|
if (subset(size(a1), new Index(0)) === 0) { // empty-anything=empty
|
|
result = []
|
|
} else if (subset(size(a2), new Index(0)) === 0) { // anything-empty=anything
|
|
return flatten(a1.toArray())
|
|
} else {
|
|
const b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural))
|
|
const b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural))
|
|
result = []
|
|
let inb2
|
|
for (let i = 0; i < b1.length; i++) {
|
|
inb2 = false
|
|
for (let j = 0; j < b2.length; j++) {
|
|
if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) { // the identifier is always a decimal int
|
|
inb2 = true
|
|
break
|
|
}
|
|
}
|
|
if (!inb2) {
|
|
result.push(b1[i])
|
|
}
|
|
}
|
|
}
|
|
// return an array, if both inputs were arrays
|
|
if (Array.isArray(a1) && Array.isArray(a2)) {
|
|
return generalize(result)
|
|
}
|
|
// return a matrix otherwise
|
|
return new DenseMatrix(generalize(result))
|
|
}
|
|
})
|
|
})
|