oak-domain 2.0.2 → 2.0.3
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/lib/actions/action.d.ts +16 -16
- package/lib/actions/action.js +17 -17
- package/lib/actions/relation.d.ts +1 -1
- package/lib/actions/relation.js +2 -2
- package/lib/base-app-domain/ActionDefDict.d.ts +5 -5
- package/lib/base-app-domain/ActionDefDict.js +7 -7
- package/lib/base-app-domain/EntityDict.d.ts +12 -12
- package/lib/base-app-domain/EntityDict.js +2 -2
- package/lib/base-app-domain/Modi/Action.d.ts +10 -10
- package/lib/base-app-domain/Modi/Action.js +14 -14
- package/lib/base-app-domain/Modi/Schema.d.ts +161 -161
- package/lib/base-app-domain/Modi/Schema.js +2 -2
- package/lib/base-app-domain/Modi/Storage.d.ts +3 -3
- package/lib/base-app-domain/Modi/Storage.js +60 -60
- package/lib/base-app-domain/ModiEntity/Schema.d.ts +176 -176
- package/lib/base-app-domain/ModiEntity/Schema.js +2 -2
- package/lib/base-app-domain/ModiEntity/Storage.d.ts +3 -3
- package/lib/base-app-domain/ModiEntity/Storage.js +26 -26
- package/lib/base-app-domain/Oper/Schema.d.ts +158 -158
- package/lib/base-app-domain/Oper/Schema.js +2 -2
- package/lib/base-app-domain/Oper/Storage.d.ts +3 -3
- package/lib/base-app-domain/Oper/Storage.js +29 -29
- package/lib/base-app-domain/OperEntity/Schema.d.ts +193 -193
- package/lib/base-app-domain/OperEntity/Schema.js +2 -2
- package/lib/base-app-domain/OperEntity/Storage.d.ts +3 -3
- package/lib/base-app-domain/OperEntity/Storage.js +26 -26
- package/lib/base-app-domain/Storage.d.ts +3 -3
- package/lib/base-app-domain/Storage.js +15 -15
- package/lib/base-app-domain/User/Schema.d.ts +137 -137
- package/lib/base-app-domain/User/Schema.js +2 -2
- package/lib/base-app-domain/User/Storage.d.ts +3 -3
- package/lib/base-app-domain/User/Storage.js +25 -25
- package/lib/base-app-domain/_SubQuery.d.ts +36 -36
- package/lib/base-app-domain/_SubQuery.js +2 -2
- package/lib/base-app-domain/index.d.ts +3 -3
- package/lib/base-app-domain/index.js +6 -6
- package/lib/checkers/index.d.ts +5 -5
- package/lib/checkers/index.js +8 -8
- package/lib/compiler/env.d.ts +11 -11
- package/lib/compiler/env.js +39 -39
- package/lib/compiler/schemalBuilder.d.ts +2 -2
- package/lib/compiler/schemalBuilder.js +3137 -3137
- package/lib/compiler/uiBuilder.d.ts +1 -1
- package/lib/compiler/uiBuilder.js +3 -3
- package/lib/entities/Modi.d.ts +11 -11
- package/lib/entities/Modi.js +46 -46
- package/lib/entities/ModiEntity.d.ts +8 -8
- package/lib/entities/ModiEntity.js +15 -15
- package/lib/entities/Oper.d.ts +10 -10
- package/lib/entities/Oper.js +17 -17
- package/lib/entities/OperEntity.d.ts +8 -8
- package/lib/entities/OperEntity.js +15 -15
- package/lib/entities/User.d.ts +7 -7
- package/lib/entities/User.js +12 -12
- package/lib/store/AsyncRowStore.d.ts +45 -45
- package/lib/store/AsyncRowStore.js +180 -180
- package/lib/store/CascadeStore.d.ts +89 -89
- package/lib/store/CascadeStore.js +1515 -1511
- package/lib/store/SyncRowStore.d.ts +26 -26
- package/lib/store/SyncRowStore.js +45 -45
- package/lib/store/TriggerExecutor.d.ts +32 -32
- package/lib/store/TriggerExecutor.js +470 -470
- package/lib/store/actionDef.d.ts +9 -9
- package/lib/store/actionDef.js +135 -135
- package/lib/store/checker.d.ts +6 -6
- package/lib/store/checker.js +218 -165
- package/lib/store/filter.d.ts +99 -99
- package/lib/store/filter.js +855 -855
- package/lib/store/modi.d.ts +13 -13
- package/lib/store/modi.js +172 -172
- package/lib/store/relation.d.ts +13 -13
- package/lib/store/relation.js +64 -64
- package/lib/store/selection.d.ts +7 -7
- package/lib/store/selection.js +228 -228
- package/lib/triggers/index.d.ts +6 -6
- package/lib/triggers/index.js +11 -11
- package/lib/triggers/modi.d.ts +5 -5
- package/lib/triggers/modi.js +72 -72
- package/lib/types/Action.d.ts +14 -14
- package/lib/types/Action.js +2 -2
- package/lib/types/AppLoader.d.ts +11 -11
- package/lib/types/AppLoader.js +10 -10
- package/lib/types/Aspect.d.ts +12 -12
- package/lib/types/Aspect.js +4 -4
- package/lib/types/Auth.d.ts +57 -31
- package/lib/types/Auth.js +2 -2
- package/lib/types/Connector.d.ts +26 -26
- package/lib/types/Connector.js +9 -9
- package/lib/types/Context.d.ts +6 -6
- package/lib/types/Context.js +3 -3
- package/lib/types/DataType.d.ts +18 -18
- package/lib/types/DataType.js +5 -5
- package/lib/types/Demand.d.ts +77 -77
- package/lib/types/Demand.js +9 -9
- package/lib/types/Entity.d.ts +159 -159
- package/lib/types/Entity.js +15 -15
- package/lib/types/Exception.d.ts +83 -83
- package/lib/types/Exception.js +252 -252
- package/lib/types/Expression.d.ts +141 -141
- package/lib/types/Expression.js +387 -387
- package/lib/types/Geo.d.ts +18 -18
- package/lib/types/Geo.js +2 -2
- package/lib/types/Locale.d.ts +24 -24
- package/lib/types/Locale.js +2 -2
- package/lib/types/Logger.d.ts +5 -5
- package/lib/types/Logger.js +3 -3
- package/lib/types/Polyfill.d.ts +23 -23
- package/lib/types/Polyfill.js +2 -2
- package/lib/types/RowStore.d.ts +12 -12
- package/lib/types/RowStore.js +34 -34
- package/lib/types/Storage.d.ts +55 -55
- package/lib/types/Storage.js +2 -2
- package/lib/types/Trigger.d.ts +88 -89
- package/lib/types/Trigger.js +39 -39
- package/lib/types/Txn.d.ts +2 -2
- package/lib/types/Txn.js +3 -3
- package/lib/types/Watcher.d.ts +19 -19
- package/lib/types/Watcher.js +4 -4
- package/lib/types/index.d.ts +18 -18
- package/lib/types/index.js +21 -21
- package/lib/types/schema/DataTypes.d.ts +32 -32
- package/lib/types/schema/DataTypes.js +3 -3
- package/lib/utils/SimpleConnector.d.ts +30 -30
- package/lib/utils/SimpleConnector.js +102 -102
- package/lib/utils/assert.d.ts +5 -5
- package/lib/utils/assert.js +9 -9
- package/lib/utils/concurrent.d.ts +15 -15
- package/lib/utils/concurrent.js +89 -89
- package/lib/utils/geo.d.ts +4 -4
- package/lib/utils/geo.js +24 -24
- package/lib/utils/lodash.d.ts +5 -5
- package/lib/utils/lodash.js +38 -38
- package/lib/utils/random/random.d.ts +1 -1
- package/lib/utils/random/random.js +24 -24
- package/lib/utils/random/random.mp.d.ts +1 -1
- package/lib/utils/random/random.mp.js +25 -25
- package/lib/utils/random/random.web.d.ts +1 -1
- package/lib/utils/random/random.web.js +17 -17
- package/lib/utils/string.d.ts +22 -22
- package/lib/utils/string.js +70 -70
- package/lib/utils/uuid.d.ts +12 -12
- package/lib/utils/uuid.js +182 -182
- package/lib/utils/validator.d.ts +23 -23
- package/lib/utils/validator.js +123 -123
- package/package.json +47 -47
- package/src/entities/Modi.ts +68 -68
- package/src/entities/ModiEntity.ts +24 -24
- package/src/entities/Oper.ts +28 -28
- package/src/entities/OperEntity.ts +24 -24
- package/src/entities/User.ts +19 -19
package/lib/utils/string.js
CHANGED
|
@@ -1,70 +1,70 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
exports.randomName = exports.random = exports.template = exports.firstLetterUpperCase = exports.firstLetterLowerCase = void 0;
|
|
4
|
-
function firstLetterLowerCase(s) {
|
|
5
|
-
return s.slice(0, 1).toLowerCase().concat(s.slice(1));
|
|
6
|
-
}
|
|
7
|
-
exports.firstLetterLowerCase = firstLetterLowerCase;
|
|
8
|
-
function firstLetterUpperCase(s) {
|
|
9
|
-
return s.slice(0, 1).toUpperCase().concat(s.slice(1));
|
|
10
|
-
}
|
|
11
|
-
exports.firstLetterUpperCase = firstLetterUpperCase;
|
|
12
|
-
/**
|
|
13
|
-
* 模板字符串 使用 定义const NotFilled = template`${0}未填写`; 调用NotFilled('姓名') 等于姓名未填写
|
|
14
|
-
* @param strings
|
|
15
|
-
* @param keys
|
|
16
|
-
* @returns {function(...[*]): string}
|
|
17
|
-
*/
|
|
18
|
-
var template = function (strings) {
|
|
19
|
-
var keys = [];
|
|
20
|
-
for (var _i = 1; _i < arguments.length; _i++) {
|
|
21
|
-
keys[_i - 1] = arguments[_i];
|
|
22
|
-
}
|
|
23
|
-
return (function () {
|
|
24
|
-
var values = [];
|
|
25
|
-
for (var _i = 0; _i < arguments.length; _i++) {
|
|
26
|
-
values[_i] = arguments[_i];
|
|
27
|
-
}
|
|
28
|
-
var dict = values[values.length - 1] || {};
|
|
29
|
-
var result = [strings[0]];
|
|
30
|
-
keys.forEach(function (key, i) {
|
|
31
|
-
var value = Number.isInteger(key) ? values[key] : dict[key];
|
|
32
|
-
result.push(value, strings[i + 1]);
|
|
33
|
-
});
|
|
34
|
-
return result.join('');
|
|
35
|
-
});
|
|
36
|
-
};
|
|
37
|
-
exports.template = template;
|
|
38
|
-
/**
|
|
39
|
-
* 随机生成字符串
|
|
40
|
-
* @param randomLength
|
|
41
|
-
* @returns
|
|
42
|
-
*/
|
|
43
|
-
var random = function (randomLength) {
|
|
44
|
-
if (randomLength === void 0) { randomLength = 16; }
|
|
45
|
-
// 默认去掉了容易混淆的字符oOLl,9gq,Vv,Uu,I1
|
|
46
|
-
var DICT = 'ABCDEFGHJKMNPQRSTWXYZabcdefhijkmnprstwxyz2345678';
|
|
47
|
-
var maxPos = DICT.length;
|
|
48
|
-
var pwd = '';
|
|
49
|
-
for (var i = 0; i < randomLength; i++) {
|
|
50
|
-
pwd += DICT.charAt(Math.floor(Math.random() * maxPos));
|
|
51
|
-
}
|
|
52
|
-
return pwd;
|
|
53
|
-
};
|
|
54
|
-
exports.random = random;
|
|
55
|
-
/**
|
|
56
|
-
* 随机生成带前缀的字符串
|
|
57
|
-
* @param prefix 第一个参数为你想生成的固定的文字开头比如: 微信用户xxxxx
|
|
58
|
-
* @param randomLength 第二个为你想生成出固定开头文字外的随机长度
|
|
59
|
-
* @returns
|
|
60
|
-
*/
|
|
61
|
-
var randomName = function (prefix, randomLength) {
|
|
62
|
-
if (randomLength === void 0) { randomLength = 8; }
|
|
63
|
-
// 默认去掉了容易混淆的字符oOLl,9gq,Vv,Uu,I1
|
|
64
|
-
var DICT = 'ABCDEFGHJKMNPQRSTWXYZabcdefhijkmnprstwxyz2345678';
|
|
65
|
-
var maxPos = DICT.length;
|
|
66
|
-
var name = prefix === undefined ? '' : prefix;
|
|
67
|
-
name += (0, exports.random)(randomLength);
|
|
68
|
-
return name;
|
|
69
|
-
};
|
|
70
|
-
exports.randomName = randomName;
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.randomName = exports.random = exports.template = exports.firstLetterUpperCase = exports.firstLetterLowerCase = void 0;
|
|
4
|
+
function firstLetterLowerCase(s) {
|
|
5
|
+
return s.slice(0, 1).toLowerCase().concat(s.slice(1));
|
|
6
|
+
}
|
|
7
|
+
exports.firstLetterLowerCase = firstLetterLowerCase;
|
|
8
|
+
function firstLetterUpperCase(s) {
|
|
9
|
+
return s.slice(0, 1).toUpperCase().concat(s.slice(1));
|
|
10
|
+
}
|
|
11
|
+
exports.firstLetterUpperCase = firstLetterUpperCase;
|
|
12
|
+
/**
|
|
13
|
+
* 模板字符串 使用 定义const NotFilled = template`${0}未填写`; 调用NotFilled('姓名') 等于姓名未填写
|
|
14
|
+
* @param strings
|
|
15
|
+
* @param keys
|
|
16
|
+
* @returns {function(...[*]): string}
|
|
17
|
+
*/
|
|
18
|
+
var template = function (strings) {
|
|
19
|
+
var keys = [];
|
|
20
|
+
for (var _i = 1; _i < arguments.length; _i++) {
|
|
21
|
+
keys[_i - 1] = arguments[_i];
|
|
22
|
+
}
|
|
23
|
+
return (function () {
|
|
24
|
+
var values = [];
|
|
25
|
+
for (var _i = 0; _i < arguments.length; _i++) {
|
|
26
|
+
values[_i] = arguments[_i];
|
|
27
|
+
}
|
|
28
|
+
var dict = values[values.length - 1] || {};
|
|
29
|
+
var result = [strings[0]];
|
|
30
|
+
keys.forEach(function (key, i) {
|
|
31
|
+
var value = Number.isInteger(key) ? values[key] : dict[key];
|
|
32
|
+
result.push(value, strings[i + 1]);
|
|
33
|
+
});
|
|
34
|
+
return result.join('');
|
|
35
|
+
});
|
|
36
|
+
};
|
|
37
|
+
exports.template = template;
|
|
38
|
+
/**
|
|
39
|
+
* 随机生成字符串
|
|
40
|
+
* @param randomLength
|
|
41
|
+
* @returns
|
|
42
|
+
*/
|
|
43
|
+
var random = function (randomLength) {
|
|
44
|
+
if (randomLength === void 0) { randomLength = 16; }
|
|
45
|
+
// 默认去掉了容易混淆的字符oOLl,9gq,Vv,Uu,I1
|
|
46
|
+
var DICT = 'ABCDEFGHJKMNPQRSTWXYZabcdefhijkmnprstwxyz2345678';
|
|
47
|
+
var maxPos = DICT.length;
|
|
48
|
+
var pwd = '';
|
|
49
|
+
for (var i = 0; i < randomLength; i++) {
|
|
50
|
+
pwd += DICT.charAt(Math.floor(Math.random() * maxPos));
|
|
51
|
+
}
|
|
52
|
+
return pwd;
|
|
53
|
+
};
|
|
54
|
+
exports.random = random;
|
|
55
|
+
/**
|
|
56
|
+
* 随机生成带前缀的字符串
|
|
57
|
+
* @param prefix 第一个参数为你想生成的固定的文字开头比如: 微信用户xxxxx
|
|
58
|
+
* @param randomLength 第二个为你想生成出固定开头文字外的随机长度
|
|
59
|
+
* @returns
|
|
60
|
+
*/
|
|
61
|
+
var randomName = function (prefix, randomLength) {
|
|
62
|
+
if (randomLength === void 0) { randomLength = 8; }
|
|
63
|
+
// 默认去掉了容易混淆的字符oOLl,9gq,Vv,Uu,I1
|
|
64
|
+
var DICT = 'ABCDEFGHJKMNPQRSTWXYZabcdefhijkmnprstwxyz2345678';
|
|
65
|
+
var maxPos = DICT.length;
|
|
66
|
+
var name = prefix === undefined ? '' : prefix;
|
|
67
|
+
name += (0, exports.random)(randomLength);
|
|
68
|
+
return name;
|
|
69
|
+
};
|
|
70
|
+
exports.randomName = randomName;
|
package/lib/utils/uuid.d.ts
CHANGED
|
@@ -1,12 +1,12 @@
|
|
|
1
|
-
export declare function sequentialUuid({ random }: {
|
|
2
|
-
random: Uint8Array;
|
|
3
|
-
}): string;
|
|
4
|
-
export declare function shrinkUuidTo32Bytes(uuid: string): string;
|
|
5
|
-
export declare function expandUuidTo36Bytes(uuidShrinked: string): string;
|
|
6
|
-
export declare type GenerateIdOption = {
|
|
7
|
-
shuffle?: boolean;
|
|
8
|
-
};
|
|
9
|
-
export declare function generateNewIdAsync(option?: GenerateIdOption): Promise<string>;
|
|
10
|
-
export declare function produceIds(): Promise<void>;
|
|
11
|
-
export declare function setGenerateIdOption(option: GenerateIdOption): Promise<void>;
|
|
12
|
-
export declare function generateNewId(): string;
|
|
1
|
+
export declare function sequentialUuid({ random }: {
|
|
2
|
+
random: Uint8Array;
|
|
3
|
+
}): string;
|
|
4
|
+
export declare function shrinkUuidTo32Bytes(uuid: string): string;
|
|
5
|
+
export declare function expandUuidTo36Bytes(uuidShrinked: string): string;
|
|
6
|
+
export declare type GenerateIdOption = {
|
|
7
|
+
shuffle?: boolean;
|
|
8
|
+
};
|
|
9
|
+
export declare function generateNewIdAsync(option?: GenerateIdOption): Promise<string>;
|
|
10
|
+
export declare function produceIds(): Promise<void>;
|
|
11
|
+
export declare function setGenerateIdOption(option: GenerateIdOption): Promise<void>;
|
|
12
|
+
export declare function generateNewId(): string;
|
package/lib/utils/uuid.js
CHANGED
|
@@ -1,182 +1,182 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
-
exports.generateNewId = exports.setGenerateIdOption = exports.produceIds = exports.generateNewIdAsync = exports.expandUuidTo36Bytes = exports.shrinkUuidTo32Bytes = exports.sequentialUuid = void 0;
|
|
4
|
-
var tslib_1 = require("tslib");
|
|
5
|
-
var assert_1 = tslib_1.__importDefault(require("assert"));
|
|
6
|
-
var uuid_1 = require("uuid");
|
|
7
|
-
var random_1 = require("./random/random");
|
|
8
|
-
var _nodeId;
|
|
9
|
-
var _clockseq;
|
|
10
|
-
// Previous uuid creation time
|
|
11
|
-
var _lastMSecs = 0;
|
|
12
|
-
var _lastNSecs = 0;
|
|
13
|
-
// 根据uuid v1改的,产生按时间顺序uuid的函数(更优于底层数据库的插入行为)
|
|
14
|
-
// **`v1()` - Generate time-based UUID**
|
|
15
|
-
//
|
|
16
|
-
// Inspired by https://github.com/LiosK/UUID.js
|
|
17
|
-
// and http://docs.python.org/library/uuid.html
|
|
18
|
-
var byteToHex = [];
|
|
19
|
-
for (var i = 0; i < 256; ++i) {
|
|
20
|
-
byteToHex.push((i + 0x100).toString(16).slice(1));
|
|
21
|
-
}
|
|
22
|
-
function unsafeStringify(arr, offset) {
|
|
23
|
-
if (offset === void 0) { offset = 0; }
|
|
24
|
-
// Note: Be careful editing this code! It's been tuned for performance
|
|
25
|
-
// and works in ways you may not expect. See https://github.com/uuidjs/uuid/pull/434
|
|
26
|
-
return (byteToHex[arr[offset + 0]] + byteToHex[arr[offset + 1]] + byteToHex[arr[offset + 2]] + byteToHex[arr[offset + 3]] + '-' + byteToHex[arr[offset + 4]] + byteToHex[arr[offset + 5]] + '-' + byteToHex[arr[offset + 6]] + byteToHex[arr[offset + 7]] + '-' + byteToHex[arr[offset + 8]] + byteToHex[arr[offset + 9]] + '-' + byteToHex[arr[offset + 10]] + byteToHex[arr[offset + 11]] + byteToHex[arr[offset + 12]] + byteToHex[arr[offset + 13]] + byteToHex[arr[offset + 14]] + byteToHex[arr[offset + 15]]).toLowerCase();
|
|
27
|
-
}
|
|
28
|
-
// See https://github.com/uuidjs/uuid for API details
|
|
29
|
-
function sequentialUuid(_a) {
|
|
30
|
-
var random = _a.random;
|
|
31
|
-
var i = 0;
|
|
32
|
-
var b = new Array(16);
|
|
33
|
-
var node = _nodeId;
|
|
34
|
-
var clockseq = _clockseq;
|
|
35
|
-
// node and clockseq need to be initialized to random values if they're not
|
|
36
|
-
// specified. We do this lazily to minimize issues related to insufficient
|
|
37
|
-
// system entropy. See #189
|
|
38
|
-
if (node == null || clockseq == null) {
|
|
39
|
-
var seedBytes = random;
|
|
40
|
-
if (node == null) {
|
|
41
|
-
// Per 4.5, create and 48-bit node id, (47 random bits + multicast bit = 1)
|
|
42
|
-
node = _nodeId = [
|
|
43
|
-
seedBytes[0] | 0x01,
|
|
44
|
-
seedBytes[1],
|
|
45
|
-
seedBytes[2],
|
|
46
|
-
seedBytes[3],
|
|
47
|
-
seedBytes[4],
|
|
48
|
-
seedBytes[5],
|
|
49
|
-
];
|
|
50
|
-
}
|
|
51
|
-
if (clockseq == null) {
|
|
52
|
-
// Per 4.2.2, randomize (14 bit) clockseq
|
|
53
|
-
clockseq = _clockseq = ((seedBytes[6] << 8) | seedBytes[7]) & 0x3fff;
|
|
54
|
-
}
|
|
55
|
-
}
|
|
56
|
-
// UUID timestamps are 100 nano-second units since the Gregorian epoch,
|
|
57
|
-
// (1582-10-15 00:00). JSNumbers aren't precise enough for this, so
|
|
58
|
-
// time is handled internally as 'msecs' (integer milliseconds) and 'nsecs'
|
|
59
|
-
// (100-nanoseconds offset from msecs) since unix epoch, 1970-01-01 00:00.
|
|
60
|
-
var msecs = Date.now();
|
|
61
|
-
// Per 4.2.1.2, use count of uuid's generated during the current clock
|
|
62
|
-
// cycle to simulate higher resolution clock
|
|
63
|
-
var nsecs = _lastNSecs + 1;
|
|
64
|
-
// Time since last uuid creation (in msecs)
|
|
65
|
-
var dt = msecs - _lastMSecs + (nsecs - _lastNSecs) / 10000;
|
|
66
|
-
// Per 4.2.1.2, Bump clockseq on clock regression
|
|
67
|
-
if (dt < 0) {
|
|
68
|
-
clockseq = (clockseq + 1) & 0x3fff;
|
|
69
|
-
}
|
|
70
|
-
// Reset nsecs if clock regresses (new clockseq) or we've moved onto a new
|
|
71
|
-
// time interval
|
|
72
|
-
if ((dt < 0 || msecs > _lastMSecs)) {
|
|
73
|
-
nsecs = 0;
|
|
74
|
-
}
|
|
75
|
-
// Per 4.2.1.2 Throw error if too many uuids are requested
|
|
76
|
-
if (nsecs >= 10000) {
|
|
77
|
-
throw new Error("uuid.v1(): Can't create more than 10M uuids/sec");
|
|
78
|
-
}
|
|
79
|
-
_lastMSecs = msecs;
|
|
80
|
-
_lastNSecs = nsecs;
|
|
81
|
-
_clockseq = clockseq;
|
|
82
|
-
// Per 4.1.4 - Convert from unix epoch to Gregorian epoch
|
|
83
|
-
msecs += 12219292800000;
|
|
84
|
-
// `time_high_and_version`
|
|
85
|
-
var tmh = ((msecs / 0x100000000) * 10000) & 0xfffffff;
|
|
86
|
-
b[i++] = ((tmh >>> 24) & 0xf) | 0x10; // include version
|
|
87
|
-
b[i++] = (tmh >>> 16) & 0xff;
|
|
88
|
-
// `time_mid`
|
|
89
|
-
b[i++] = (tmh >>> 8) & 0xff;
|
|
90
|
-
b[i++] = tmh & 0xff;
|
|
91
|
-
// `time_low`
|
|
92
|
-
var tl = ((msecs & 0xfffffff) * 10000 + nsecs) % 0x100000000;
|
|
93
|
-
b[i++] = (tl >>> 24) & 0xff;
|
|
94
|
-
b[i++] = (tl >>> 16) & 0xff;
|
|
95
|
-
b[i++] = (tl >>> 8) & 0xff;
|
|
96
|
-
b[i++] = tl & 0xff;
|
|
97
|
-
// `clock_seq_hi_and_reserved` (Per 4.2.2 - include variant)
|
|
98
|
-
b[i++] = (clockseq >>> 8) | 0x80;
|
|
99
|
-
// `clock_seq_low`
|
|
100
|
-
b[i++] = clockseq & 0xff;
|
|
101
|
-
// `node`
|
|
102
|
-
for (var n = 0; n < 6; ++n) {
|
|
103
|
-
b[i + n] = node[n];
|
|
104
|
-
}
|
|
105
|
-
return unsafeStringify(b);
|
|
106
|
-
}
|
|
107
|
-
exports.sequentialUuid = sequentialUuid;
|
|
108
|
-
function shrinkUuidTo32Bytes(uuid) {
|
|
109
|
-
return uuid.replaceAll('-', '');
|
|
110
|
-
}
|
|
111
|
-
exports.shrinkUuidTo32Bytes = shrinkUuidTo32Bytes;
|
|
112
|
-
function expandUuidTo36Bytes(uuidShrinked) {
|
|
113
|
-
return "".concat(uuidShrinked.slice(0, 8), "-").concat(uuidShrinked.slice(8, 12), "-").concat(uuidShrinked.slice(12, 16), "-").concat(uuidShrinked.slice(16, 20), "-").concat(uuidShrinked.slice(20));
|
|
114
|
-
}
|
|
115
|
-
exports.expandUuidTo36Bytes = expandUuidTo36Bytes;
|
|
116
|
-
// 直接生成uuid的接口,为了适配各种环境,写成异步
|
|
117
|
-
function generateNewIdAsync(option) {
|
|
118
|
-
return tslib_1.__awaiter(this, void 0, void 0, function () {
|
|
119
|
-
var option2, _a, _b;
|
|
120
|
-
var _c, _d;
|
|
121
|
-
return tslib_1.__generator(this, function (_e) {
|
|
122
|
-
switch (_e.label) {
|
|
123
|
-
case 0:
|
|
124
|
-
option2 = option || ID_OPTION;
|
|
125
|
-
if (!((option2 === null || option2 === void 0 ? void 0 : option2.shuffle) || process.env.NODE_ENV === 'development')) return [3 /*break*/, 2];
|
|
126
|
-
_a = uuid_1.v4;
|
|
127
|
-
_c = {};
|
|
128
|
-
return [4 /*yield*/, (0, random_1.getRandomValues)(16)];
|
|
129
|
-
case 1: return [2 /*return*/, _a.apply(void 0, [(_c.random = _e.sent(), _c)])];
|
|
130
|
-
case 2:
|
|
131
|
-
_b = sequentialUuid;
|
|
132
|
-
_d = {};
|
|
133
|
-
return [4 /*yield*/, (0, random_1.getRandomValues)(16)];
|
|
134
|
-
case 3: return [2 /*return*/, _b.apply(void 0, [(_d.random = _e.sent(), _d)])];
|
|
135
|
-
}
|
|
136
|
-
});
|
|
137
|
-
});
|
|
138
|
-
}
|
|
139
|
-
exports.generateNewIdAsync = generateNewIdAsync;
|
|
140
|
-
// 实现同步的id缓存接口,以便于前台使用
|
|
141
|
-
var ID_BUFFER = [];
|
|
142
|
-
var ID_OPTION = {};
|
|
143
|
-
function produceIds() {
|
|
144
|
-
return tslib_1.__awaiter(this, void 0, void 0, function () {
|
|
145
|
-
var iter, _a, _b;
|
|
146
|
-
return tslib_1.__generator(this, function (_c) {
|
|
147
|
-
switch (_c.label) {
|
|
148
|
-
case 0:
|
|
149
|
-
iter = 0;
|
|
150
|
-
_c.label = 1;
|
|
151
|
-
case 1:
|
|
152
|
-
if (!(iter < 128)) return [3 /*break*/, 4];
|
|
153
|
-
_b = (_a = ID_BUFFER).push;
|
|
154
|
-
return [4 /*yield*/, generateNewIdAsync()];
|
|
155
|
-
case 2:
|
|
156
|
-
_b.apply(_a, [_c.sent()]);
|
|
157
|
-
_c.label = 3;
|
|
158
|
-
case 3:
|
|
159
|
-
iter++;
|
|
160
|
-
return [3 /*break*/, 1];
|
|
161
|
-
case 4: return [2 /*return*/];
|
|
162
|
-
}
|
|
163
|
-
});
|
|
164
|
-
});
|
|
165
|
-
}
|
|
166
|
-
exports.produceIds = produceIds;
|
|
167
|
-
produceIds();
|
|
168
|
-
function setGenerateIdOption(option) {
|
|
169
|
-
ID_OPTION = option;
|
|
170
|
-
ID_BUFFER.splice(0, ID_BUFFER.length);
|
|
171
|
-
return produceIds();
|
|
172
|
-
}
|
|
173
|
-
exports.setGenerateIdOption = setGenerateIdOption;
|
|
174
|
-
function generateNewId() {
|
|
175
|
-
(0, assert_1.default)(ID_BUFFER.length > 0, '缓存的id已经用完,请提前调用produceIds以确保缓冲池中有足够的预分配id');
|
|
176
|
-
var id = ID_BUFFER.pop();
|
|
177
|
-
if (ID_BUFFER.length < 64) {
|
|
178
|
-
produceIds();
|
|
179
|
-
}
|
|
180
|
-
return id;
|
|
181
|
-
}
|
|
182
|
-
exports.generateNewId = generateNewId;
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.generateNewId = exports.setGenerateIdOption = exports.produceIds = exports.generateNewIdAsync = exports.expandUuidTo36Bytes = exports.shrinkUuidTo32Bytes = exports.sequentialUuid = void 0;
|
|
4
|
+
var tslib_1 = require("tslib");
|
|
5
|
+
var assert_1 = tslib_1.__importDefault(require("assert"));
|
|
6
|
+
var uuid_1 = require("uuid");
|
|
7
|
+
var random_1 = require("./random/random");
|
|
8
|
+
var _nodeId;
|
|
9
|
+
var _clockseq;
|
|
10
|
+
// Previous uuid creation time
|
|
11
|
+
var _lastMSecs = 0;
|
|
12
|
+
var _lastNSecs = 0;
|
|
13
|
+
// 根据uuid v1改的,产生按时间顺序uuid的函数(更优于底层数据库的插入行为)
|
|
14
|
+
// **`v1()` - Generate time-based UUID**
|
|
15
|
+
//
|
|
16
|
+
// Inspired by https://github.com/LiosK/UUID.js
|
|
17
|
+
// and http://docs.python.org/library/uuid.html
|
|
18
|
+
var byteToHex = [];
|
|
19
|
+
for (var i = 0; i < 256; ++i) {
|
|
20
|
+
byteToHex.push((i + 0x100).toString(16).slice(1));
|
|
21
|
+
}
|
|
22
|
+
function unsafeStringify(arr, offset) {
|
|
23
|
+
if (offset === void 0) { offset = 0; }
|
|
24
|
+
// Note: Be careful editing this code! It's been tuned for performance
|
|
25
|
+
// and works in ways you may not expect. See https://github.com/uuidjs/uuid/pull/434
|
|
26
|
+
return (byteToHex[arr[offset + 0]] + byteToHex[arr[offset + 1]] + byteToHex[arr[offset + 2]] + byteToHex[arr[offset + 3]] + '-' + byteToHex[arr[offset + 4]] + byteToHex[arr[offset + 5]] + '-' + byteToHex[arr[offset + 6]] + byteToHex[arr[offset + 7]] + '-' + byteToHex[arr[offset + 8]] + byteToHex[arr[offset + 9]] + '-' + byteToHex[arr[offset + 10]] + byteToHex[arr[offset + 11]] + byteToHex[arr[offset + 12]] + byteToHex[arr[offset + 13]] + byteToHex[arr[offset + 14]] + byteToHex[arr[offset + 15]]).toLowerCase();
|
|
27
|
+
}
|
|
28
|
+
// See https://github.com/uuidjs/uuid for API details
|
|
29
|
+
function sequentialUuid(_a) {
|
|
30
|
+
var random = _a.random;
|
|
31
|
+
var i = 0;
|
|
32
|
+
var b = new Array(16);
|
|
33
|
+
var node = _nodeId;
|
|
34
|
+
var clockseq = _clockseq;
|
|
35
|
+
// node and clockseq need to be initialized to random values if they're not
|
|
36
|
+
// specified. We do this lazily to minimize issues related to insufficient
|
|
37
|
+
// system entropy. See #189
|
|
38
|
+
if (node == null || clockseq == null) {
|
|
39
|
+
var seedBytes = random;
|
|
40
|
+
if (node == null) {
|
|
41
|
+
// Per 4.5, create and 48-bit node id, (47 random bits + multicast bit = 1)
|
|
42
|
+
node = _nodeId = [
|
|
43
|
+
seedBytes[0] | 0x01,
|
|
44
|
+
seedBytes[1],
|
|
45
|
+
seedBytes[2],
|
|
46
|
+
seedBytes[3],
|
|
47
|
+
seedBytes[4],
|
|
48
|
+
seedBytes[5],
|
|
49
|
+
];
|
|
50
|
+
}
|
|
51
|
+
if (clockseq == null) {
|
|
52
|
+
// Per 4.2.2, randomize (14 bit) clockseq
|
|
53
|
+
clockseq = _clockseq = ((seedBytes[6] << 8) | seedBytes[7]) & 0x3fff;
|
|
54
|
+
}
|
|
55
|
+
}
|
|
56
|
+
// UUID timestamps are 100 nano-second units since the Gregorian epoch,
|
|
57
|
+
// (1582-10-15 00:00). JSNumbers aren't precise enough for this, so
|
|
58
|
+
// time is handled internally as 'msecs' (integer milliseconds) and 'nsecs'
|
|
59
|
+
// (100-nanoseconds offset from msecs) since unix epoch, 1970-01-01 00:00.
|
|
60
|
+
var msecs = Date.now();
|
|
61
|
+
// Per 4.2.1.2, use count of uuid's generated during the current clock
|
|
62
|
+
// cycle to simulate higher resolution clock
|
|
63
|
+
var nsecs = _lastNSecs + 1;
|
|
64
|
+
// Time since last uuid creation (in msecs)
|
|
65
|
+
var dt = msecs - _lastMSecs + (nsecs - _lastNSecs) / 10000;
|
|
66
|
+
// Per 4.2.1.2, Bump clockseq on clock regression
|
|
67
|
+
if (dt < 0) {
|
|
68
|
+
clockseq = (clockseq + 1) & 0x3fff;
|
|
69
|
+
}
|
|
70
|
+
// Reset nsecs if clock regresses (new clockseq) or we've moved onto a new
|
|
71
|
+
// time interval
|
|
72
|
+
if ((dt < 0 || msecs > _lastMSecs)) {
|
|
73
|
+
nsecs = 0;
|
|
74
|
+
}
|
|
75
|
+
// Per 4.2.1.2 Throw error if too many uuids are requested
|
|
76
|
+
if (nsecs >= 10000) {
|
|
77
|
+
throw new Error("uuid.v1(): Can't create more than 10M uuids/sec");
|
|
78
|
+
}
|
|
79
|
+
_lastMSecs = msecs;
|
|
80
|
+
_lastNSecs = nsecs;
|
|
81
|
+
_clockseq = clockseq;
|
|
82
|
+
// Per 4.1.4 - Convert from unix epoch to Gregorian epoch
|
|
83
|
+
msecs += 12219292800000;
|
|
84
|
+
// `time_high_and_version`
|
|
85
|
+
var tmh = ((msecs / 0x100000000) * 10000) & 0xfffffff;
|
|
86
|
+
b[i++] = ((tmh >>> 24) & 0xf) | 0x10; // include version
|
|
87
|
+
b[i++] = (tmh >>> 16) & 0xff;
|
|
88
|
+
// `time_mid`
|
|
89
|
+
b[i++] = (tmh >>> 8) & 0xff;
|
|
90
|
+
b[i++] = tmh & 0xff;
|
|
91
|
+
// `time_low`
|
|
92
|
+
var tl = ((msecs & 0xfffffff) * 10000 + nsecs) % 0x100000000;
|
|
93
|
+
b[i++] = (tl >>> 24) & 0xff;
|
|
94
|
+
b[i++] = (tl >>> 16) & 0xff;
|
|
95
|
+
b[i++] = (tl >>> 8) & 0xff;
|
|
96
|
+
b[i++] = tl & 0xff;
|
|
97
|
+
// `clock_seq_hi_and_reserved` (Per 4.2.2 - include variant)
|
|
98
|
+
b[i++] = (clockseq >>> 8) | 0x80;
|
|
99
|
+
// `clock_seq_low`
|
|
100
|
+
b[i++] = clockseq & 0xff;
|
|
101
|
+
// `node`
|
|
102
|
+
for (var n = 0; n < 6; ++n) {
|
|
103
|
+
b[i + n] = node[n];
|
|
104
|
+
}
|
|
105
|
+
return unsafeStringify(b);
|
|
106
|
+
}
|
|
107
|
+
exports.sequentialUuid = sequentialUuid;
|
|
108
|
+
function shrinkUuidTo32Bytes(uuid) {
|
|
109
|
+
return uuid.replaceAll('-', '');
|
|
110
|
+
}
|
|
111
|
+
exports.shrinkUuidTo32Bytes = shrinkUuidTo32Bytes;
|
|
112
|
+
function expandUuidTo36Bytes(uuidShrinked) {
|
|
113
|
+
return "".concat(uuidShrinked.slice(0, 8), "-").concat(uuidShrinked.slice(8, 12), "-").concat(uuidShrinked.slice(12, 16), "-").concat(uuidShrinked.slice(16, 20), "-").concat(uuidShrinked.slice(20));
|
|
114
|
+
}
|
|
115
|
+
exports.expandUuidTo36Bytes = expandUuidTo36Bytes;
|
|
116
|
+
// 直接生成uuid的接口,为了适配各种环境,写成异步
|
|
117
|
+
function generateNewIdAsync(option) {
|
|
118
|
+
return tslib_1.__awaiter(this, void 0, void 0, function () {
|
|
119
|
+
var option2, _a, _b;
|
|
120
|
+
var _c, _d;
|
|
121
|
+
return tslib_1.__generator(this, function (_e) {
|
|
122
|
+
switch (_e.label) {
|
|
123
|
+
case 0:
|
|
124
|
+
option2 = option || ID_OPTION;
|
|
125
|
+
if (!((option2 === null || option2 === void 0 ? void 0 : option2.shuffle) || process.env.NODE_ENV === 'development')) return [3 /*break*/, 2];
|
|
126
|
+
_a = uuid_1.v4;
|
|
127
|
+
_c = {};
|
|
128
|
+
return [4 /*yield*/, (0, random_1.getRandomValues)(16)];
|
|
129
|
+
case 1: return [2 /*return*/, _a.apply(void 0, [(_c.random = _e.sent(), _c)])];
|
|
130
|
+
case 2:
|
|
131
|
+
_b = sequentialUuid;
|
|
132
|
+
_d = {};
|
|
133
|
+
return [4 /*yield*/, (0, random_1.getRandomValues)(16)];
|
|
134
|
+
case 3: return [2 /*return*/, _b.apply(void 0, [(_d.random = _e.sent(), _d)])];
|
|
135
|
+
}
|
|
136
|
+
});
|
|
137
|
+
});
|
|
138
|
+
}
|
|
139
|
+
exports.generateNewIdAsync = generateNewIdAsync;
|
|
140
|
+
// 实现同步的id缓存接口,以便于前台使用
|
|
141
|
+
var ID_BUFFER = [];
|
|
142
|
+
var ID_OPTION = {};
|
|
143
|
+
function produceIds() {
|
|
144
|
+
return tslib_1.__awaiter(this, void 0, void 0, function () {
|
|
145
|
+
var iter, _a, _b;
|
|
146
|
+
return tslib_1.__generator(this, function (_c) {
|
|
147
|
+
switch (_c.label) {
|
|
148
|
+
case 0:
|
|
149
|
+
iter = 0;
|
|
150
|
+
_c.label = 1;
|
|
151
|
+
case 1:
|
|
152
|
+
if (!(iter < 128)) return [3 /*break*/, 4];
|
|
153
|
+
_b = (_a = ID_BUFFER).push;
|
|
154
|
+
return [4 /*yield*/, generateNewIdAsync()];
|
|
155
|
+
case 2:
|
|
156
|
+
_b.apply(_a, [_c.sent()]);
|
|
157
|
+
_c.label = 3;
|
|
158
|
+
case 3:
|
|
159
|
+
iter++;
|
|
160
|
+
return [3 /*break*/, 1];
|
|
161
|
+
case 4: return [2 /*return*/];
|
|
162
|
+
}
|
|
163
|
+
});
|
|
164
|
+
});
|
|
165
|
+
}
|
|
166
|
+
exports.produceIds = produceIds;
|
|
167
|
+
produceIds();
|
|
168
|
+
function setGenerateIdOption(option) {
|
|
169
|
+
ID_OPTION = option;
|
|
170
|
+
ID_BUFFER.splice(0, ID_BUFFER.length);
|
|
171
|
+
return produceIds();
|
|
172
|
+
}
|
|
173
|
+
exports.setGenerateIdOption = setGenerateIdOption;
|
|
174
|
+
function generateNewId() {
|
|
175
|
+
(0, assert_1.default)(ID_BUFFER.length > 0, '缓存的id已经用完,请提前调用produceIds以确保缓冲池中有足够的预分配id');
|
|
176
|
+
var id = ID_BUFFER.pop();
|
|
177
|
+
if (ID_BUFFER.length < 64) {
|
|
178
|
+
produceIds();
|
|
179
|
+
}
|
|
180
|
+
return id;
|
|
181
|
+
}
|
|
182
|
+
exports.generateNewId = generateNewId;
|
package/lib/utils/validator.d.ts
CHANGED
|
@@ -1,23 +1,23 @@
|
|
|
1
|
-
declare type ValidatorFunction = (text: string, size?: number) => string | boolean;
|
|
2
|
-
declare type ValidatorMoneyFunction = (text: string, zero?: boolean) => string | boolean;
|
|
3
|
-
export declare const isMobile: ValidatorFunction;
|
|
4
|
-
export declare const isPassword: ValidatorFunction;
|
|
5
|
-
export declare const isCaptcha: ValidatorFunction;
|
|
6
|
-
export declare const isIdCardNumber: ValidatorFunction;
|
|
7
|
-
export declare const isPassportNumber: ValidatorFunction;
|
|
8
|
-
export declare const isHkCardNumber: ValidatorFunction;
|
|
9
|
-
export declare const isAmCardNumber: ValidatorFunction;
|
|
10
|
-
export declare const isTwCardNumber: ValidatorFunction;
|
|
11
|
-
export declare const isBirthNumber: ValidatorFunction;
|
|
12
|
-
export declare const isSoldierNumber: ValidatorFunction;
|
|
13
|
-
export declare const isUrl: ValidatorFunction;
|
|
14
|
-
export declare const isNickname: ValidatorFunction;
|
|
15
|
-
export declare const isSizedCaptcha: ValidatorFunction;
|
|
16
|
-
export declare const isDigital: ValidatorFunction;
|
|
17
|
-
export declare const isPhone: ValidatorFunction;
|
|
18
|
-
export declare const isNumber: ValidatorFunction;
|
|
19
|
-
export declare const isMoney: ValidatorMoneyFunction;
|
|
20
|
-
export declare const isVehicleNumber: ValidatorFunction;
|
|
21
|
-
export declare function checkAttributesNotNull<T extends Record<string, any>>(entity: string, data: T, attributes: Array<keyof T>, allowEmpty?: true): void;
|
|
22
|
-
export declare function checkAttributesScope<T extends Record<string, any>>(entity: string, data: T, attributes: Array<keyof T>): void;
|
|
23
|
-
export {};
|
|
1
|
+
declare type ValidatorFunction = (text: string, size?: number) => string | boolean;
|
|
2
|
+
declare type ValidatorMoneyFunction = (text: string, zero?: boolean) => string | boolean;
|
|
3
|
+
export declare const isMobile: ValidatorFunction;
|
|
4
|
+
export declare const isPassword: ValidatorFunction;
|
|
5
|
+
export declare const isCaptcha: ValidatorFunction;
|
|
6
|
+
export declare const isIdCardNumber: ValidatorFunction;
|
|
7
|
+
export declare const isPassportNumber: ValidatorFunction;
|
|
8
|
+
export declare const isHkCardNumber: ValidatorFunction;
|
|
9
|
+
export declare const isAmCardNumber: ValidatorFunction;
|
|
10
|
+
export declare const isTwCardNumber: ValidatorFunction;
|
|
11
|
+
export declare const isBirthNumber: ValidatorFunction;
|
|
12
|
+
export declare const isSoldierNumber: ValidatorFunction;
|
|
13
|
+
export declare const isUrl: ValidatorFunction;
|
|
14
|
+
export declare const isNickname: ValidatorFunction;
|
|
15
|
+
export declare const isSizedCaptcha: ValidatorFunction;
|
|
16
|
+
export declare const isDigital: ValidatorFunction;
|
|
17
|
+
export declare const isPhone: ValidatorFunction;
|
|
18
|
+
export declare const isNumber: ValidatorFunction;
|
|
19
|
+
export declare const isMoney: ValidatorMoneyFunction;
|
|
20
|
+
export declare const isVehicleNumber: ValidatorFunction;
|
|
21
|
+
export declare function checkAttributesNotNull<T extends Record<string, any>>(entity: string, data: T, attributes: Array<keyof T>, allowEmpty?: true): void;
|
|
22
|
+
export declare function checkAttributesScope<T extends Record<string, any>>(entity: string, data: T, attributes: Array<keyof T>): void;
|
|
23
|
+
export {};
|