@onelinecode/onelinecode - npm Package Compare versions

Comparing version 1.14.1 to 1.14.2

src/array/merge-array.js

+/**
+ * Returns a new Array which contains all items of the two Arrays.
+ * @param {Array} a 
+ * @param {Array} b 
+ * @returns {Array}
+ */
+const fn = (a, b) => [...a, ...b];
+
+export default fn;

test/array/merge-array.spec.js

+import { mergeArray } from '../../src/array';
+const test = require('ava');
+
+
+test('returns an array with all entries of the two sources', t => {
+    let input1 = ['foo', 'bar', 0, true, false];
+    let input2 = ['baz', 'foobar'];
+    let expectation = ['foo', 'bar', 0, true, false, 'baz', 'foobar'];
+    t.deepEqual(mergeArray(input1, input2), expectation);
+});
+
+
+
+test('returns an array with all entries of the two sources with all the duplicates', t => {
+    let input1 = ['foo', 'bar', 0, true, false,];
+    let input2 = ['baz', 'foobar', 0, true, false];
+    let expectation = ['foo', 'bar', 0, true, false, 'baz', 'foobar', 0, true, false];
+    t.deepEqual(mergeArray(input1, input2), expectation);
+});

CHANGELOG.md

@@ -0,1 +1,8 @@
+## [1.14.2](https://github.com/martinkr/onelinecode/compare/v1.14.1...v1.14.2) (2021-11-15)
+
+
+### Bug Fixes
+
+* **Array/mergeArray:** performance improvements ([88b5356](https://github.com/martinkr/onelinecode/commit/88b53567425cae4cfb2352128cf9882a89872c92))
+
 ## [1.14.1](https://github.com/martinkr/onelinecode/compare/v1.14.0...v1.14.1) (2021-11-11)
@@ -2,0 +9,0 @@

dist/index.cjs.js

 // ! onelinecode vv1.5.5
-"use strict";Object.defineProperty(exports,"__esModule",{value:!0});var e=Object.freeze({__proto__:null,isEmpty:({length:e})=>0===e,removeDuplicates:e=>[...new Set(e)],occurrenceMap:e=>e.reduce(((e,t)=>(e[t]=(e[t]||0)+1,e)),{}),shallowClone:e=>e.slice(0),lowestNumber:e=>Math.min(...e),highestNumber:e=>Math.max(...e),closestNumber:(e,t)=>e.reduce(((e,l)=>Math.abs(l-t)<Math.abs(e-t)?l:e)),indexOfLowestNumber:e=>e.indexOf(Math.min.apply(null,e)),indexOfHighestNumber:e=>e.indexOf(Math.max.apply(null,e)),splitInHalf:e=>[e.slice(0,Math.ceil(e.length/2)),e.slice(Math.ceil(e.length/2))],longestString:e=>e.reduce(((e,t)=>e.length>t.length?e:t)),shortestString:e=>e.reduce(((e,t)=>e.length<t.length?e:t)),shortestStringLength:(e,t=1/0)=>(e.forEach((e=>{e.length<t&&(t=e.length)})),t),longestStringLength:(e,t=0)=>(e.forEach((e=>{e.length>t&&(t=e.length)})),t),oddItems:e=>e.filter(((e,t)=>!0&t)),evenItems:e=>e.filter(((e,t)=>t%2==0)),mergeArrayUnique:(e,t)=>[...new Set([...e,...t])]});exports.arr=e;
+"use strict";Object.defineProperty(exports,"__esModule",{value:!0});var e=Object.freeze({__proto__:null,isEmpty:({length:e})=>0===e,removeDuplicates:e=>[...new Set(e)],occurrenceMap:e=>e.reduce(((e,t)=>(e[t]=(e[t]||0)+1,e)),{}),shallowClone:e=>e.slice(0),lowestNumber:e=>Math.min(...e),highestNumber:e=>Math.max(...e),closestNumber:(e,t)=>e.reduce(((e,l)=>Math.abs(l-t)<Math.abs(e-t)?l:e)),indexOfLowestNumber:e=>e.indexOf(Math.min.apply(null,e)),indexOfHighestNumber:e=>e.indexOf(Math.max.apply(null,e)),splitInHalf:e=>[e.slice(0,Math.ceil(e.length/2)),e.slice(Math.ceil(e.length/2))],longestString:e=>e.reduce(((e,t)=>e.length>t.length?e:t)),shortestString:e=>e.reduce(((e,t)=>e.length<t.length?e:t)),shortestStringLength:(e,t=1/0)=>(e.forEach((e=>{e.length<t&&(t=e.length)})),t),longestStringLength:(e,t=0)=>(e.forEach((e=>{e.length>t&&(t=e.length)})),t),oddItems:e=>e.filter(((e,t)=>!0&t)),evenItems:e=>e.filter(((e,t)=>t%2==0)),mergeArrayUnique:(e,t)=>[...new Set([...e,...t])],mergeArray:(e,t)=>[...e,...t]});exports.arr=e;

dist/index.esm.js

 // ! onelinecode vv1.5.5
-var e=Object.freeze({__proto__:null,isEmpty:({length:e})=>0===e,removeDuplicates:e=>[...new Set(e)],occurrenceMap:e=>e.reduce(((e,t)=>(e[t]=(e[t]||0)+1,e)),{}),shallowClone:e=>e.slice(0),lowestNumber:e=>Math.min(...e),highestNumber:e=>Math.max(...e),closestNumber:(e,t)=>e.reduce(((e,l)=>Math.abs(l-t)<Math.abs(e-t)?l:e)),indexOfLowestNumber:e=>e.indexOf(Math.min.apply(null,e)),indexOfHighestNumber:e=>e.indexOf(Math.max.apply(null,e)),splitInHalf:e=>[e.slice(0,Math.ceil(e.length/2)),e.slice(Math.ceil(e.length/2))],longestString:e=>e.reduce(((e,t)=>e.length>t.length?e:t)),shortestString:e=>e.reduce(((e,t)=>e.length<t.length?e:t)),shortestStringLength:(e,t=1/0)=>(e.forEach((e=>{e.length<t&&(t=e.length)})),t),longestStringLength:(e,t=0)=>(e.forEach((e=>{e.length>t&&(t=e.length)})),t),oddItems:e=>e.filter(((e,t)=>!0&t)),evenItems:e=>e.filter(((e,t)=>t%2==0)),mergeArrayUnique:(e,t)=>[...new Set([...e,...t])]});export{e as arr};
+var e=Object.freeze({__proto__:null,isEmpty:({length:e})=>0===e,removeDuplicates:e=>[...new Set(e)],occurrenceMap:e=>e.reduce(((e,t)=>(e[t]=(e[t]||0)+1,e)),{}),shallowClone:e=>e.slice(0),lowestNumber:e=>Math.min(...e),highestNumber:e=>Math.max(...e),closestNumber:(e,t)=>e.reduce(((e,l)=>Math.abs(l-t)<Math.abs(e-t)?l:e)),indexOfLowestNumber:e=>e.indexOf(Math.min.apply(null,e)),indexOfHighestNumber:e=>e.indexOf(Math.max.apply(null,e)),splitInHalf:e=>[e.slice(0,Math.ceil(e.length/2)),e.slice(Math.ceil(e.length/2))],longestString:e=>e.reduce(((e,t)=>e.length>t.length?e:t)),shortestString:e=>e.reduce(((e,t)=>e.length<t.length?e:t)),shortestStringLength:(e,t=1/0)=>(e.forEach((e=>{e.length<t&&(t=e.length)})),t),longestStringLength:(e,t=0)=>(e.forEach((e=>{e.length>t&&(t=e.length)})),t),oddItems:e=>e.filter(((e,t)=>!0&t)),evenItems:e=>e.filter(((e,t)=>t%2==0)),mergeArrayUnique:(e,t)=>[...new Set([...e,...t])],mergeArray:(e,t)=>[...e,...t]});export{e as arr};

dist/index.js

 // ! onelinecode vv1.5.5
-!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).onelinecode={})}(this,(function(e){"use strict";var t=Object.freeze({__proto__:null,isEmpty:({length:e})=>0===e,removeDuplicates:e=>[...new Set(e)],occurrenceMap:e=>e.reduce(((e,t)=>(e[t]=(e[t]||0)+1,e)),{}),shallowClone:e=>e.slice(0),lowestNumber:e=>Math.min(...e),highestNumber:e=>Math.max(...e),closestNumber:(e,t)=>e.reduce(((e,n)=>Math.abs(n-t)<Math.abs(e-t)?n:e)),indexOfLowestNumber:e=>e.indexOf(Math.min.apply(null,e)),indexOfHighestNumber:e=>e.indexOf(Math.max.apply(null,e)),splitInHalf:e=>[e.slice(0,Math.ceil(e.length/2)),e.slice(Math.ceil(e.length/2))],longestString:e=>e.reduce(((e,t)=>e.length>t.length?e:t)),shortestString:e=>e.reduce(((e,t)=>e.length<t.length?e:t)),shortestStringLength:(e,t=1/0)=>(e.forEach((e=>{e.length<t&&(t=e.length)})),t),longestStringLength:(e,t=0)=>(e.forEach((e=>{e.length>t&&(t=e.length)})),t),oddItems:e=>e.filter(((e,t)=>!0&t)),evenItems:e=>e.filter(((e,t)=>t%2==0)),mergeArrayUnique:(e,t)=>[...new Set([...e,...t])]});e.arr=t,Object.defineProperty(e,"__esModule",{value:!0})}));
+!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).onelinecode={})}(this,(function(e){"use strict";var t=Object.freeze({__proto__:null,isEmpty:({length:e})=>0===e,removeDuplicates:e=>[...new Set(e)],occurrenceMap:e=>e.reduce(((e,t)=>(e[t]=(e[t]||0)+1,e)),{}),shallowClone:e=>e.slice(0),lowestNumber:e=>Math.min(...e),highestNumber:e=>Math.max(...e),closestNumber:(e,t)=>e.reduce(((e,n)=>Math.abs(n-t)<Math.abs(e-t)?n:e)),indexOfLowestNumber:e=>e.indexOf(Math.min.apply(null,e)),indexOfHighestNumber:e=>e.indexOf(Math.max.apply(null,e)),splitInHalf:e=>[e.slice(0,Math.ceil(e.length/2)),e.slice(Math.ceil(e.length/2))],longestString:e=>e.reduce(((e,t)=>e.length>t.length?e:t)),shortestString:e=>e.reduce(((e,t)=>e.length<t.length?e:t)),shortestStringLength:(e,t=1/0)=>(e.forEach((e=>{e.length<t&&(t=e.length)})),t),longestStringLength:(e,t=0)=>(e.forEach((e=>{e.length>t&&(t=e.length)})),t),oddItems:e=>e.filter(((e,t)=>!0&t)),evenItems:e=>e.filter(((e,t)=>t%2==0)),mergeArrayUnique:(e,t)=>[...new Set([...e,...t])],mergeArray:(e,t)=>[...e,...t]});e.arr=t,Object.defineProperty(e,"__esModule",{value:!0})}));

doc/array.md

@@ -26,2 +26,4 @@ ![Awesome JavaScript in one line of code written above a picture of Mt. Fuji's peak](ajsioloc.png)
 Returns a new Array which contains all the values of the two Arrays. Ensures that the new array contains only unique values. 
+### `mergeArray`
+Returns a new Array which contains all items of the two Arrays.
 ### `oddItems``
@@ -28,0 +30,0 @@ Returns an array which contains every odd (second) item of the original array.

package.json

 {
   "name": "@onelinecode/onelinecode",
-  "version": "1.14.1",
+  "version": "1.14.2",
   "description": "Awesome javascript in one line of code",
@@ -5,0 +5,0 @@ "main": "./dist/index.js",

src/array/index.js

@@ -17,2 +17,3 @@ export { default as isEmpty } from './is-empty';
 export { default as evenItems } from './even-items.js';
-export { default as mergeArrayUnique } from './merge-array-unique.js';
+export { default as mergeArrayUnique } from './merge-array-unique.js';
+export { default as mergeArray } from './merge-array.js';

src/array/merge-array-unique.js

@@ -5,3 +5,3 @@ /**
  * @param {Array} b 
- * @returns {Number}
+ * @returns {Array}
  */
@@ -8,0 +8,0 @@ const fn = (a, b) => [...new Set([...a, ...b])];

test/array/index.spec.js

@@ -65,4 +65,9 @@ import * as Array from '../../src/array';
 });
+
 test('exports a function "(Array.)mergeArrayUnique"', t => {
     t.true(typeof (Array.mergeArrayUnique) === 'function')
 });
+
+test('exports a function "(Array.)mergeArray"', t => {
+    t.true(typeof (Array.mergeArray) === 'function')
+});

test/index.spec.js

@@ -70,1 +70,5 @@ import { arr } from '../src';
 });
+
+test('exports a function "(arr.)mergeArray"', t => {
+    t.true(typeof (arr.mergeArray) === 'function')
+});

No alert changes

Improved metrics

Total package byte prevSize

769157

0.21%

Number of package files

63

3.28%

Lines of code

673

4.5%

No dependency changes