feat:node-modules
This commit is contained in:
68
node_modules/mathjs/lib/cjs/function/set/setIsSubset.js
generated
vendored
Normal file
68
node_modules/mathjs/lib/cjs/function/set/setIsSubset.js
generated
vendored
Normal file
@@ -0,0 +1,68 @@
|
||||
"use strict";
|
||||
|
||||
Object.defineProperty(exports, "__esModule", {
|
||||
value: true
|
||||
});
|
||||
exports.createSetIsSubset = void 0;
|
||||
var _array = require("../../utils/array.js");
|
||||
var _factory = require("../../utils/factory.js");
|
||||
const name = 'setIsSubset';
|
||||
const dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
|
||||
const createSetIsSubset = exports.createSetIsSubset = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
|
||||
let {
|
||||
typed,
|
||||
size,
|
||||
subset,
|
||||
compareNatural,
|
||||
Index
|
||||
} = _ref;
|
||||
/**
|
||||
* Check whether a (multi)set is a subset of another (multi)set. (Every element of set1 is the element of set2.)
|
||||
* Multi-dimension arrays will be converted to single-dimension arrays before the operation.
|
||||
*
|
||||
* Syntax:
|
||||
*
|
||||
* math.setIsSubset(set1, set2)
|
||||
*
|
||||
* Examples:
|
||||
*
|
||||
* math.setIsSubset([1, 2], [3, 4, 5, 6]) // returns false
|
||||
* math.setIsSubset([3, 4], [3, 4, 5, 6]) // returns true
|
||||
*
|
||||
* See also:
|
||||
*
|
||||
* setUnion, setIntersect, setDifference
|
||||
*
|
||||
* @param {Array | Matrix} a1 A (multi)set
|
||||
* @param {Array | Matrix} a2 A (multi)set
|
||||
* @return {boolean} Returns true when a1 is a subset of a2, returns false otherwise
|
||||
*/
|
||||
return typed(name, {
|
||||
'Array | Matrix, Array | Matrix': function (a1, a2) {
|
||||
if (subset(size(a1), new Index(0)) === 0) {
|
||||
// empty is a subset of anything
|
||||
return true;
|
||||
} else if (subset(size(a2), new Index(0)) === 0) {
|
||||
// anything is not a subset of empty
|
||||
return false;
|
||||
}
|
||||
const b1 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
|
||||
const b2 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
|
||||
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 === false) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
});
|
||||
});
|
||||
Reference in New Issue
Block a user