@firecms/schema_inference 3.0.0-canary.7 → 3.0.0-canary.70
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/LICENSE +113 -21
- package/dist/collection_builder.d.ts +3 -2
- package/dist/index.es.js +139 -99
- package/dist/index.es.js.map +1 -1
- package/dist/index.umd.js +1 -1
- package/dist/index.umd.js.map +1 -1
- package/package.json +7 -8
- package/src/builders/string_property_builder.ts +1 -2
- package/src/collection_builder.ts +127 -38
- package/src/strings.ts +1 -1
- package/src/test_schemas/pop_products.json +948 -0
- package/src/test_schemas/test_schema.ts +5 -1
package/LICENSE
CHANGED
@@ -1,21 +1,113 @@
|
|
1
|
-
|
2
|
-
|
3
|
-
|
4
|
-
|
5
|
-
|
6
|
-
|
7
|
-
|
8
|
-
|
9
|
-
|
10
|
-
|
11
|
-
|
12
|
-
|
13
|
-
|
14
|
-
|
15
|
-
|
16
|
-
|
17
|
-
|
18
|
-
|
19
|
-
|
20
|
-
|
21
|
-
|
1
|
+
Business Source License 1.1
|
2
|
+
|
3
|
+
Parameters
|
4
|
+
|
5
|
+
Licensor: Firecms S.L.
|
6
|
+
Licensed Work: Firecms CMS packages:
|
7
|
+
cli
|
8
|
+
collection_editor
|
9
|
+
collection_editor_firebase
|
10
|
+
data_enhancement
|
11
|
+
data_import_export
|
12
|
+
editor
|
13
|
+
firecms_cloud
|
14
|
+
schema_inference
|
15
|
+
user_management
|
16
|
+
|
17
|
+
The Licensed Work is (c) 2024 Firecms S.L
|
18
|
+
Additional Use Grant: You may make use of the Licensed Work, provided that
|
19
|
+
you may not use the Licensed Work for a CMS Data Enhancement
|
20
|
+
Service.
|
21
|
+
|
22
|
+
A “CMS package” is a commercial offering that
|
23
|
+
allows third parties (other than your employees and
|
24
|
+
contractors) to access the functionality of the
|
25
|
+
Licensed Work by using software to extend the base features of
|
26
|
+
content management system controlled by such third parties.
|
27
|
+
|
28
|
+
Change Date: Four years from the date the Licensed Work is published.
|
29
|
+
|
30
|
+
Change License: MIT
|
31
|
+
|
32
|
+
For information about alternative licensing arrangements for the Software,
|
33
|
+
please visit: https://firecms.co
|
34
|
+
|
35
|
+
Notice
|
36
|
+
|
37
|
+
The Business Source License (this document, or the “License”) is not an Open
|
38
|
+
Source license. However, the Licensed Work will eventually be made available
|
39
|
+
under an Open Source License, as stated in this License.
|
40
|
+
|
41
|
+
License text copyright (c) 2017 MariaDB Corporation Ab, All Rights Reserved.
|
42
|
+
“Business Source License” is a trademark of MariaDB Corporation Ab.
|
43
|
+
|
44
|
+
-----------------------------------------------------------------------------
|
45
|
+
|
46
|
+
Business Source License 1.1
|
47
|
+
|
48
|
+
Terms
|
49
|
+
|
50
|
+
The Licensor hereby grants you the right to copy, modify, create derivative
|
51
|
+
works, redistribute, and make non-production use of the Licensed Work. The
|
52
|
+
Licensor may make an Additional Use Grant, above, permitting limited
|
53
|
+
production use.
|
54
|
+
|
55
|
+
Effective on the Change Date, or the fourth anniversary of the first publicly
|
56
|
+
available distribution of a specific version of the Licensed Work under this
|
57
|
+
License, whichever comes first, the Licensor hereby grants you rights under
|
58
|
+
the terms of the Change License, and the rights granted in the paragraph
|
59
|
+
above terminate.
|
60
|
+
|
61
|
+
If your use of the Licensed Work does not comply with the requirements
|
62
|
+
currently in effect as described in this License, you must purchase a
|
63
|
+
commercial license from the Licensor, its affiliated entities, or authorized
|
64
|
+
resellers, or you must refrain from using the Licensed Work.
|
65
|
+
|
66
|
+
All copies of the original and modified Licensed Work, and derivative works
|
67
|
+
of the Licensed Work, are subject to this License. This License applies
|
68
|
+
separately for each version of the Licensed Work and the Change Date may vary
|
69
|
+
for each version of the Licensed Work released by Licensor.
|
70
|
+
|
71
|
+
You must conspicuously display this License on each original or modified copy
|
72
|
+
of the Licensed Work. If you receive the Licensed Work in original or
|
73
|
+
modified form from a third party, the terms and conditions set forth in this
|
74
|
+
License apply to your use of that work.
|
75
|
+
|
76
|
+
Any use of the Licensed Work in violation of this License will automatically
|
77
|
+
terminate your rights under this License for the current and all other
|
78
|
+
versions of the Licensed Work.
|
79
|
+
|
80
|
+
This License does not grant you any right in any trademark or logo of
|
81
|
+
Licensor or its affiliates (provided that you may use a trademark or logo of
|
82
|
+
Licensor as expressly required by this License).
|
83
|
+
|
84
|
+
TO THE EXTENT PERMITTED BY APPLICABLE LAW, THE LICENSED WORK IS PROVIDED ON
|
85
|
+
AN “AS IS” BASIS. LICENSOR HEREBY DISCLAIMS ALL WARRANTIES AND CONDITIONS,
|
86
|
+
EXPRESS OR IMPLIED, INCLUDING (WITHOUT LIMITATION) WARRANTIES OF
|
87
|
+
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NON-INFRINGEMENT, AND
|
88
|
+
TITLE.
|
89
|
+
|
90
|
+
MariaDB hereby grants you permission to use this License’s text to license
|
91
|
+
your works, and to refer to it using the trademark “Business Source License”,
|
92
|
+
as long as you comply with the Covenants of Licensor below.
|
93
|
+
|
94
|
+
Covenants of Licensor
|
95
|
+
|
96
|
+
In consideration of the right to use this License’s text and the “Business
|
97
|
+
Source License” name and trademark, Licensor covenants to MariaDB, and to all
|
98
|
+
other recipients of the licensed work to be provided by Licensor:
|
99
|
+
|
100
|
+
1. To specify as the Change License the GPL Version 2.0 or any later version,
|
101
|
+
or a license that is compatible with GPL Version 2.0 or a later version,
|
102
|
+
where “compatible” means that software provided under the Change License can
|
103
|
+
be included in a program with software provided under GPL Version 2.0 or a
|
104
|
+
later version. Licensor may specify additional Change Licenses without
|
105
|
+
limitation.
|
106
|
+
|
107
|
+
2. To either: (a) specify an additional grant of rights to use that does not
|
108
|
+
impose any additional restriction on the right granted in this License, as
|
109
|
+
the Additional Use Grant; or (b) insert the text “None”.
|
110
|
+
|
111
|
+
3. To specify a Change Date.
|
112
|
+
|
113
|
+
4. Not to modify this License in any other way.
|
@@ -1,5 +1,6 @@
|
|
1
|
-
import { DataType, Properties, Property } from "@firecms/core";
|
1
|
+
import { DataType, Properties, PropertiesOrBuilders, Property } from "@firecms/core";
|
2
2
|
export type InferenceTypeBuilder = (value: any) => DataType;
|
3
3
|
export declare function buildEntityPropertiesFromData(data: object[], getType: InferenceTypeBuilder): Promise<Properties>;
|
4
4
|
export declare function buildPropertyFromData(data: any[], property: Property, getType: InferenceTypeBuilder): Property;
|
5
|
-
export declare function buildPropertiesOrder(properties:
|
5
|
+
export declare function buildPropertiesOrder(properties: PropertiesOrBuilders, propertiesOrder?: string[], priorityKeys?: string[]): string[];
|
6
|
+
export declare function inferTypeFromValue(value: any): DataType;
|
package/dist/index.es.js
CHANGED
@@ -1,28 +1,28 @@
|
|
1
|
-
import { unslugify as
|
2
|
-
import { DocumentReference as
|
3
|
-
function
|
1
|
+
import { unslugify as O, resolveEnumValues as T, mergeDeep as j } from "@firecms/core";
|
2
|
+
import { DocumentReference as C } from "@firebase/firestore";
|
3
|
+
function b(r) {
|
4
4
|
if (!r)
|
5
5
|
return;
|
6
|
-
function e(
|
7
|
-
return typeof
|
6
|
+
function e(n) {
|
7
|
+
return typeof n == "string" ? n : n instanceof C ? n.path : void 0;
|
8
8
|
}
|
9
|
-
const s = r.values.map((
|
9
|
+
const s = r.values.map((n) => e(n)).filter((n) => !!n).find((n) => n.includes("/"));
|
10
10
|
if (!s)
|
11
11
|
return;
|
12
|
-
const
|
13
|
-
return r.values.filter((
|
14
|
-
const a = e(
|
15
|
-
return a ? a.startsWith(
|
16
|
-
}).length > r.values.length / 3 * 2 ?
|
12
|
+
const i = s.substr(0, s.lastIndexOf("/"));
|
13
|
+
return r.values.filter((n) => {
|
14
|
+
const a = e(n);
|
15
|
+
return a ? a.startsWith(i) : !1;
|
16
|
+
}).length > r.values.length / 3 * 2 ? i : void 0;
|
17
17
|
}
|
18
18
|
function d(r) {
|
19
19
|
if (!Array.isArray(r))
|
20
20
|
return [];
|
21
|
-
const e = r.map((t) => typeof t == "string" ? { id: t, label:
|
21
|
+
const e = r.map((t) => typeof t == "string" ? { id: t, label: O(t) } : null).filter(Boolean);
|
22
22
|
return e.sort((t, s) => t.label.localeCompare(s.label)), e;
|
23
23
|
}
|
24
|
-
const
|
25
|
-
function
|
24
|
+
const P = [".jpg", ".jpeg", ".png", ".webp", ".gif", ".avif"], S = [".mp3", ".ogg", ".opus", ".aac"], I = [".avi", ".mp4"], M = /^[a-zA-Z0-9.!#$%&'*+/=?^_`{|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*$/;
|
25
|
+
function w({
|
26
26
|
totalDocsCount: r,
|
27
27
|
valuesResult: e
|
28
28
|
}) {
|
@@ -30,20 +30,20 @@ function C({
|
|
30
30
|
dataType: "string"
|
31
31
|
};
|
32
32
|
if (e) {
|
33
|
-
const s = e.values.length,
|
34
|
-
|
35
|
-
const a = e.values.filter((f) => typeof f == "string" &&
|
33
|
+
const s = e.values.length, i = Array.from(e.valuesCount.keys()).length, o = {}, n = e.values.filter((f) => typeof f == "string" && f.toString().startsWith("http")).length > r / 3 * 2;
|
34
|
+
n && (o.url = !0);
|
35
|
+
const a = e.values.filter((f) => typeof f == "string" && M.test(f)).length > r / 3 * 2;
|
36
36
|
a && (o.email = !0);
|
37
37
|
const c = e.values.filter((f) => typeof f == "string" && f.length === 28 && !f.includes(" ")).length > r / 3 * 2;
|
38
|
-
if (c && (o.readOnly = !0), !a && !
|
38
|
+
if (c && (o.readOnly = !0), !a && !n && !c && !n && i < s / 3) {
|
39
39
|
const f = d(Array.from(e.valuesCount.keys()));
|
40
40
|
Object.keys(f).length > 1 && (o.enumValues = f);
|
41
41
|
}
|
42
|
-
if (!a && !
|
43
|
-
const f =
|
42
|
+
if (!a && !n && !c && !n && !o.enumValues) {
|
43
|
+
const f = z(e, r);
|
44
44
|
f && (o.storage = {
|
45
45
|
acceptedFiles: [f],
|
46
|
-
storagePath:
|
46
|
+
storagePath: b(e) ?? "/"
|
47
47
|
});
|
48
48
|
}
|
49
49
|
Object.keys(o).length > 0 && (t = {
|
@@ -54,11 +54,11 @@ function C({
|
|
54
54
|
}
|
55
55
|
return t;
|
56
56
|
}
|
57
|
-
function
|
58
|
-
const t = r.values.filter((
|
59
|
-
return t ? "image/*" : s ? "audio/*" :
|
57
|
+
function z(r, e) {
|
58
|
+
const t = r.values.filter((n) => typeof n == "string" && P.some((a) => n.toString().endsWith(a))).length > e / 3 * 2, s = r.values.filter((n) => typeof n == "string" && S.some((a) => n.toString().endsWith(a))).length > e / 3 * 2, i = r.values.filter((n) => typeof n == "string" && I.some((a) => n.toString().endsWith(a))).length > e / 3 * 2;
|
59
|
+
return t ? "image/*" : s ? "audio/*" : i ? "video/*" : !1;
|
60
60
|
}
|
61
|
-
function
|
61
|
+
function F({
|
62
62
|
totalDocsCount: r,
|
63
63
|
valuesResult: e
|
64
64
|
}) {
|
@@ -76,169 +76,209 @@ function _({
|
|
76
76
|
}) {
|
77
77
|
return {
|
78
78
|
dataType: "reference",
|
79
|
-
path:
|
79
|
+
path: b(e) ?? "!!!FIX_ME!!!",
|
80
80
|
editable: !0
|
81
81
|
};
|
82
82
|
}
|
83
83
|
async function k(r, e) {
|
84
84
|
const t = {}, s = {};
|
85
|
-
return r && r.forEach((
|
86
|
-
|
87
|
-
|
85
|
+
return r && r.forEach((i) => {
|
86
|
+
i && Object.entries(i).forEach(([o, n]) => {
|
87
|
+
u(t, o, n, e), m(s, o, n, e);
|
88
88
|
});
|
89
|
-
}),
|
89
|
+
}), A(r.length, t, s);
|
90
90
|
}
|
91
|
-
function
|
92
|
-
const s = {},
|
91
|
+
function L(r, e, t) {
|
92
|
+
const s = {}, i = {};
|
93
93
|
r && r.forEach((a) => {
|
94
|
-
|
94
|
+
p(e.dataType, s, a, t), m(i, "inferred_prop", a, t);
|
95
95
|
});
|
96
96
|
const o = "enumValues" in e ? T(e.enumValues) : void 0;
|
97
97
|
if (o) {
|
98
|
-
const a = d(Array.from(
|
98
|
+
const a = d(Array.from(i.inferred_prop.valuesCount.keys()));
|
99
99
|
return {
|
100
100
|
...e,
|
101
101
|
enumValues: [...a, ...o]
|
102
102
|
};
|
103
103
|
}
|
104
|
-
const
|
105
|
-
|
104
|
+
const n = y(
|
105
|
+
"inferred_prop",
|
106
|
+
r.length,
|
107
|
+
e.dataType,
|
108
|
+
s,
|
109
|
+
i.inferred_prop
|
110
|
+
);
|
111
|
+
return j(n, e);
|
106
112
|
}
|
107
|
-
function U(r) {
|
108
|
-
|
109
|
-
|
110
|
-
|
113
|
+
function U(r, e, t) {
|
114
|
+
const s = (t ?? []).map((n) => n.toLowerCase());
|
115
|
+
function i(n) {
|
116
|
+
const a = n.toLowerCase();
|
117
|
+
return s.includes(a) ? 4 : a === "title" || a === "name" ? 3 : a.includes("title") || a.includes("name") ? 2 : a.includes("image") || a.includes("picture") ? 1 : 0;
|
111
118
|
}
|
112
|
-
const
|
113
|
-
return
|
119
|
+
const o = e ?? Object.keys(r);
|
120
|
+
return o.sort(), o.sort((n, a) => i(a) - i(n)), o;
|
114
121
|
}
|
115
|
-
function
|
122
|
+
function p(r, e, t, s) {
|
116
123
|
if (r === "map") {
|
117
124
|
if (t) {
|
118
|
-
let
|
119
|
-
|
120
|
-
|
125
|
+
let i = e[r];
|
126
|
+
i || (i = {}, e[r] = i), Object.entries(t).forEach(([o, n]) => {
|
127
|
+
u(i, o, n, s);
|
121
128
|
});
|
122
129
|
}
|
123
130
|
} else if (r === "array") {
|
124
|
-
let
|
125
|
-
if (
|
126
|
-
const o =
|
127
|
-
|
131
|
+
let i = e[r];
|
132
|
+
if (i || (i = {}, e[r] = i), t && Array.isArray(t) && t.length > 0) {
|
133
|
+
const o = x(t, s);
|
134
|
+
if (o === "map") {
|
135
|
+
let n = i[o];
|
136
|
+
n || (n = {}), t.forEach((a) => {
|
137
|
+
Object.entries(a).forEach(
|
138
|
+
([c, f]) => u(n, c, f, s)
|
139
|
+
);
|
140
|
+
}), i[o] = n;
|
141
|
+
} else
|
142
|
+
i[o] ? i[o]++ : i[o] = 1;
|
128
143
|
}
|
129
144
|
} else
|
130
145
|
e[r] ? e[r]++ : e[r] = 1;
|
131
146
|
}
|
132
|
-
function
|
133
|
-
let
|
134
|
-
if (
|
147
|
+
function u(r, e, t, s) {
|
148
|
+
let i = r[e];
|
149
|
+
if (i || (i = {}, r[e] = i), t != null) {
|
135
150
|
const o = s(t);
|
136
|
-
|
151
|
+
p(o, i, t, s);
|
137
152
|
}
|
138
153
|
}
|
139
|
-
function
|
140
|
-
const
|
154
|
+
function m(r, e, t, s) {
|
155
|
+
const i = s(t);
|
141
156
|
let o = r[e];
|
142
157
|
if (o || (o = {
|
143
158
|
values: [],
|
144
159
|
valuesCount: /* @__PURE__ */ new Map()
|
145
|
-
}, r[e] = o),
|
146
|
-
let
|
147
|
-
|
160
|
+
}, r[e] = o), i === "map") {
|
161
|
+
let n = o.map;
|
162
|
+
n || (n = {}, o.map = n), t && Object.entries(t).forEach(
|
163
|
+
([a, c]) => m(n, a, c, s)
|
164
|
+
);
|
148
165
|
} else
|
149
|
-
|
150
|
-
o.values.push(
|
166
|
+
i === "array" ? Array.isArray(t) && t.forEach((n) => {
|
167
|
+
o.values.push(n), o.valuesCount.set(n, (o.valuesCount.get(n) ?? 0) + 1);
|
151
168
|
}) : t && (o.values.push(t), o.valuesCount.set(t, (o.valuesCount.get(t) ?? 0) + 1));
|
152
169
|
}
|
153
|
-
function
|
170
|
+
function h(r) {
|
154
171
|
let e = 0;
|
155
172
|
return Object.entries(r).forEach(([t, s]) => {
|
156
|
-
let
|
157
|
-
t === "map" ?
|
173
|
+
let i = 0;
|
174
|
+
t === "map" ? i = E(s) : t === "array" ? i = h(s) : i = s, i > e && (e = i);
|
158
175
|
}), e;
|
159
176
|
}
|
160
|
-
function
|
161
|
-
return Object.entries(r).map(([e, t]) =>
|
177
|
+
function E(r) {
|
178
|
+
return Object.entries(r).map(([e, t]) => h(t)).reduce((e, t) => Math.max(e, t), 0);
|
162
179
|
}
|
163
|
-
function
|
180
|
+
function g(r) {
|
164
181
|
let e = -1, t = "string";
|
165
|
-
return Object.entries(r).forEach(([s,
|
182
|
+
return Object.entries(r).forEach(([s, i]) => {
|
166
183
|
let o;
|
167
|
-
s === "map" ? o =
|
184
|
+
s === "map" ? o = E(i) : s === "array" ? o = h(i) : o = i, o > e && (e = o, t = s);
|
168
185
|
}), t;
|
169
186
|
}
|
170
|
-
function
|
187
|
+
function y(r, e, t, s, i) {
|
171
188
|
let o;
|
172
|
-
r && (o =
|
173
|
-
let
|
189
|
+
r && (o = Z(r.toLowerCase()));
|
190
|
+
let n;
|
174
191
|
if (t === "map") {
|
175
|
-
|
192
|
+
V(s) && (n = {
|
176
193
|
dataType: "map",
|
177
194
|
name: o,
|
178
195
|
keyValue: !0,
|
179
196
|
properties: {}
|
180
197
|
});
|
181
|
-
const c =
|
182
|
-
|
198
|
+
const c = A(
|
199
|
+
e,
|
200
|
+
s.map,
|
201
|
+
i ? i.mapValues : void 0
|
202
|
+
);
|
203
|
+
n = {
|
183
204
|
dataType: "map",
|
184
205
|
name: o,
|
185
206
|
properties: c
|
186
207
|
};
|
187
208
|
} else if (t === "array") {
|
188
|
-
const a = s.array, c =
|
189
|
-
|
209
|
+
const a = s.array, c = g(a), f = y(
|
210
|
+
r,
|
211
|
+
e,
|
212
|
+
c,
|
213
|
+
a,
|
214
|
+
i
|
215
|
+
);
|
216
|
+
n = {
|
190
217
|
dataType: "array",
|
191
218
|
name: o,
|
192
219
|
of: f
|
193
220
|
};
|
194
221
|
}
|
195
|
-
if (!
|
222
|
+
if (!n) {
|
196
223
|
const a = {
|
197
224
|
name: r,
|
198
225
|
totalDocsCount: e,
|
199
|
-
valuesResult:
|
226
|
+
valuesResult: i
|
200
227
|
};
|
201
|
-
t === "string" ?
|
228
|
+
t === "string" ? n = w(a) : t === "reference" ? n = _(a) : n = {
|
202
229
|
dataType: t
|
203
|
-
}, o && (
|
204
|
-
const c =
|
205
|
-
c && (
|
230
|
+
}, o && (n.name = o);
|
231
|
+
const c = F(a);
|
232
|
+
c && (n.validation = c);
|
206
233
|
}
|
207
234
|
return {
|
208
|
-
...
|
235
|
+
...n,
|
209
236
|
editable: !0
|
210
237
|
};
|
211
238
|
}
|
212
|
-
function
|
239
|
+
function A(r, e, t) {
|
213
240
|
const s = {};
|
214
|
-
return Object.entries(e).forEach(([
|
215
|
-
const
|
216
|
-
s[
|
241
|
+
return Object.entries(e).forEach(([i, o]) => {
|
242
|
+
const n = g(o);
|
243
|
+
s[i] = y(
|
244
|
+
i,
|
245
|
+
r,
|
246
|
+
n,
|
247
|
+
o,
|
248
|
+
t ? t[i] : void 0
|
249
|
+
);
|
217
250
|
}), s;
|
218
251
|
}
|
219
|
-
function
|
252
|
+
function l(r) {
|
220
253
|
let e = 0;
|
221
254
|
return Object.entries(r).forEach(([t, s]) => {
|
222
|
-
typeof s == "object" ? e = Math.max(e,
|
255
|
+
typeof s == "object" ? e = Math.max(e, l(s)) : e = Math.max(e, s);
|
223
256
|
}), e;
|
224
257
|
}
|
225
|
-
function
|
258
|
+
function x(r, e) {
|
226
259
|
let t = {};
|
227
260
|
return r.forEach((s) => {
|
228
|
-
|
229
|
-
}),
|
261
|
+
p(e(s), t, s, e);
|
262
|
+
}), g(t);
|
230
263
|
}
|
231
|
-
function
|
232
|
-
const e =
|
264
|
+
function V(r) {
|
265
|
+
const e = l(r);
|
233
266
|
let t = 0;
|
234
|
-
return Object.entries(r.map ?? {}).forEach(([s,
|
235
|
-
|
267
|
+
return Object.entries(r.map ?? {}).forEach(([s, i]) => {
|
268
|
+
l(i) < e / 3 && t++;
|
236
269
|
}), t / Object.entries(r.map ?? {}).length > 0.5;
|
237
270
|
}
|
271
|
+
function Z(r) {
|
272
|
+
return r.replace(/[_\-]+/g, " ").replace(/([a-z])([A-Z])/g, "$1 $2").toLowerCase().split(" ").map((i) => i.charAt(0).toUpperCase() + i.slice(1)).join(" ");
|
273
|
+
}
|
274
|
+
function X(r) {
|
275
|
+
return typeof r == "string" ? "string" : typeof r == "number" ? "number" : typeof r == "boolean" ? "boolean" : Array.isArray(r) ? "array" : typeof r == "object" ? "map" : "string";
|
276
|
+
}
|
238
277
|
export {
|
239
278
|
k as buildEntityPropertiesFromData,
|
240
279
|
U as buildPropertiesOrder,
|
241
|
-
|
242
|
-
d as extractEnumFromValues
|
280
|
+
L as buildPropertyFromData,
|
281
|
+
d as extractEnumFromValues,
|
282
|
+
X as inferTypeFromValue
|
243
283
|
};
|
244
284
|
//# sourceMappingURL=index.es.js.map
|