New Case Study:See how Anthropic automated 95% of dependency reviews with Socket.Learn More
Socket
Sign inDemoInstall
Socket

aidly

Package Overview
Dependencies
Maintainers
0
Versions
57
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

aidly - npm Package Compare versions

Comparing version 1.1.6 to 1.2.0

dist/merge.d.ts

80

dist/aidly.cjs.js

@@ -205,36 +205,2 @@ 'use strict';

/**
* Give the current task one frame of time (default is 17ms).
* If it exceeds one frame, the remaining tasks will be put into the next frame.
*/
const loopSlice = (l, fn, taskTime = 17) => {
return new Promise((resolve) => {
if (l === 0) {
resolve();
return;
}
let i = -1;
let start = Date.now();
const run = () => {
while (++i < l) {
if (fn(i) === false) {
resolve();
break;
}
if (i === l - 1) {
resolve();
} else {
const t = Date.now();
if (t - start > taskTime) {
start = t;
raf(run);
break;
}
}
}
};
run();
});
};
const noCloneOrMerge = (val, set) => set && set.has(val);

@@ -250,6 +216,4 @@ const isMergeableObject = (val) => {

const cl = (val, set) => {
if (isMergeableObject(val)) {
return deepMerge(isArray(val) ? [] : {}, val, set);
}
return val;
if (!isMergeableObject(val)) return val;
return merge$1(isArray(val) ? [] : {}, val, set);
};

@@ -300,3 +264,3 @@ const mergeArray = (target, source, set) => {

} else {
res[key] = deepMerge(target[key], source[key], set);
res[key] = merge$1(target[key], source[key], set);
}

@@ -313,3 +277,3 @@ } else {

// This should not be a structure with circular references
const deepMerge = (target, source, filterSet) => {
const merge$1 = (target, source, filterSet) => {
const sourceIsArray = isArray(source);

@@ -326,2 +290,36 @@ const targetIsArray = isArray(target);

/**
* Give the current task one frame of time (default is 17ms).
* If it exceeds one frame, the remaining tasks will be put into the next frame.
*/
const loopSlice = (l, fn, taskTime = 17) => {
return new Promise((resolve) => {
if (l === 0) {
resolve();
return;
}
let i = -1;
let start = Date.now();
const run = () => {
while (++i < l) {
if (fn(i) === false) {
resolve();
break;
}
if (i === l - 1) {
resolve();
} else {
const t = Date.now();
if (t - start > taskTime) {
start = t;
raf(run);
break;
}
}
}
};
run();
});
};
const throttle = (delay, fn, _isDebounce) => {

@@ -987,3 +985,2 @@ let lastExec = 0;

exports.decimalPlaces = decimalPlaces;
exports.deepMerge = deepMerge;
exports.defered = defered;

@@ -1017,2 +1014,3 @@ exports.getExtname = getExtname;

exports.map = map;
exports.merge = merge$1;
exports.noop = noop;

@@ -1019,0 +1017,0 @@ exports.now = now;

@@ -201,36 +201,2 @@ export { Queue } from 'small-queue';

/**
* Give the current task one frame of time (default is 17ms).
* If it exceeds one frame, the remaining tasks will be put into the next frame.
*/
const loopSlice = (l, fn, taskTime = 17) => {
return new Promise((resolve) => {
if (l === 0) {
resolve();
return;
}
let i = -1;
let start = Date.now();
const run = () => {
while (++i < l) {
if (fn(i) === false) {
resolve();
break;
}
if (i === l - 1) {
resolve();
} else {
const t = Date.now();
if (t - start > taskTime) {
start = t;
raf(run);
break;
}
}
}
};
run();
});
};
const noCloneOrMerge = (val, set) => set && set.has(val);

@@ -246,6 +212,4 @@ const isMergeableObject = (val) => {

const cl = (val, set) => {
if (isMergeableObject(val)) {
return deepMerge(isArray(val) ? [] : {}, val, set);
}
return val;
if (!isMergeableObject(val)) return val;
return merge$1(isArray(val) ? [] : {}, val, set);
};

@@ -296,3 +260,3 @@ const mergeArray = (target, source, set) => {

} else {
res[key] = deepMerge(target[key], source[key], set);
res[key] = merge$1(target[key], source[key], set);
}

@@ -309,3 +273,3 @@ } else {

// This should not be a structure with circular references
const deepMerge = (target, source, filterSet) => {
const merge$1 = (target, source, filterSet) => {
const sourceIsArray = isArray(source);

@@ -322,2 +286,36 @@ const targetIsArray = isArray(target);

/**
* Give the current task one frame of time (default is 17ms).
* If it exceeds one frame, the remaining tasks will be put into the next frame.
*/
const loopSlice = (l, fn, taskTime = 17) => {
return new Promise((resolve) => {
if (l === 0) {
resolve();
return;
}
let i = -1;
let start = Date.now();
const run = () => {
while (++i < l) {
if (fn(i) === false) {
resolve();
break;
}
if (i === l - 1) {
resolve();
} else {
const t = Date.now();
if (t - start > taskTime) {
start = t;
raf(run);
break;
}
}
}
};
run();
});
};
const throttle = (delay, fn, _isDebounce) => {

@@ -983,3 +981,2 @@ let lastExec = 0;

decimalPlaces,
deepMerge,
defered,

@@ -1013,2 +1010,3 @@ getExtname,

map,
merge$1 as merge,
noop,

@@ -1015,0 +1013,0 @@ now,

@@ -255,36 +255,2 @@ (function (global, factory) {

/**
* Give the current task one frame of time (default is 17ms).
* If it exceeds one frame, the remaining tasks will be put into the next frame.
*/
const loopSlice = (l, fn, taskTime = 17) => {
return new Promise((resolve) => {
if (l === 0) {
resolve();
return;
}
let i = -1;
let start = Date.now();
const run = () => {
while (++i < l) {
if (fn(i) === false) {
resolve();
break;
}
if (i === l - 1) {
resolve();
} else {
const t = Date.now();
if (t - start > taskTime) {
start = t;
raf(run);
break;
}
}
}
};
run();
});
};
const noCloneOrMerge = (val, set) => set && set.has(val);

@@ -300,6 +266,4 @@ const isMergeableObject = (val) => {

const cl = (val, set) => {
if (isMergeableObject(val)) {
return deepMerge(isArray(val) ? [] : {}, val, set);
}
return val;
if (!isMergeableObject(val)) return val;
return merge$1(isArray(val) ? [] : {}, val, set);
};

@@ -350,3 +314,3 @@ const mergeArray = (target, source, set) => {

} else {
res[key] = deepMerge(target[key], source[key], set);
res[key] = merge$1(target[key], source[key], set);
}

@@ -363,3 +327,3 @@ } else {

// This should not be a structure with circular references
const deepMerge = (target, source, filterSet) => {
const merge$1 = (target, source, filterSet) => {
const sourceIsArray = isArray(source);

@@ -376,2 +340,36 @@ const targetIsArray = isArray(target);

/**
* Give the current task one frame of time (default is 17ms).
* If it exceeds one frame, the remaining tasks will be put into the next frame.
*/
const loopSlice = (l, fn, taskTime = 17) => {
return new Promise((resolve) => {
if (l === 0) {
resolve();
return;
}
let i = -1;
let start = Date.now();
const run = () => {
while (++i < l) {
if (fn(i) === false) {
resolve();
break;
}
if (i === l - 1) {
resolve();
} else {
const t = Date.now();
if (t - start > taskTime) {
start = t;
raf(run);
break;
}
}
}
};
run();
});
};
const throttle = (delay, fn, _isDebounce) => {

@@ -1041,3 +1039,2 @@ let lastExec = 0;

exports.decimalPlaces = decimalPlaces;
exports.deepMerge = deepMerge;
exports.defered = defered;

@@ -1071,2 +1068,3 @@ exports.getExtname = getExtname;

exports.map = map;
exports.merge = merge$1;
exports.noop = noop;

@@ -1073,0 +1071,0 @@ exports.now = now;

@@ -6,4 +6,4 @@ import type { TypedArray, PrimitiveType } from './types';

export { clone } from './clone';
export { merge } from './merge';
export { loopSlice } from './loopSlice';
export { deepMerge } from './deepMerge';
export { throttle, debounce } from './throttle';

@@ -10,0 +10,0 @@ export {

{
"name": "aidly",
"version": "1.1.6",
"version": "1.2.0",
"description": "Tool library.",

@@ -5,0 +5,0 @@ "main": "./dist/aidly.cjs.js",

@@ -0,0 +0,0 @@ <div align="center">

Sorry, the diff of this file is not supported yet

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap
  • Changelog

Packages

npm

Stay in touch

Get open source security insights delivered straight into your inbox.


  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc