@ksvedal/docs 0.1.0
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/README.md +74 -0
- package/dist/Starthjelp-CDnMsPRF.js +6 -0
- package/dist/Starthjelp-DTDqsiPb.js +6 -0
- package/dist/_baseUniq-FW_jgYGR.js +477 -0
- package/dist/access_policy-BV-cRgLX.js +17 -0
- package/dist/access_policy-pBOJMSEK.js +17 -0
- package/dist/access_token_lifetime-6ypKk6LU.js +31 -0
- package/dist/access_token_lifetime-CVau9UC3.js +31 -0
- package/dist/allowed_grant_types-BrnsQvWi.js +101 -0
- package/dist/allowed_grant_types-ovkxJeQq.js +101 -0
- package/dist/application_type-BAESO1T4.js +36 -0
- package/dist/application_type-BtouPPrt.js +39 -0
- package/dist/arc-zSbgd3Dl.js +83 -0
- package/dist/architecture-U656AL7Q-bG73RCfJ.js +5 -0
- package/dist/architectureDiagram-VXUJARFQ-DbJ1yKpS.js +4668 -0
- package/dist/authentication_method-B28p58-a.js +43 -0
- package/dist/authentication_method-D8EwmEki.js +43 -0
- package/dist/authorization_lifetime-CfhrWQ9Y.js +39 -0
- package/dist/authorization_lifetime-DrFRbscQ.js +39 -0
- package/dist/backchannel_logout_uri-BTceN7xq.js +33 -0
- package/dist/backchannel_logout_uri-CBdktUL7.js +33 -0
- package/dist/blockDiagram-VD42YOAC-CmPMJI6H.js +2265 -0
- package/dist/breadcrumbs.json +1202 -0
- package/dist/c4Diagram-YG6GDRKO-BtTnslb7.js +1581 -0
- package/dist/channel-B9C38GUl.js +5 -0
- package/dist/chunk-4BX2VUAB-BLcImAIn.js +9 -0
- package/dist/chunk-55IACEB6-Cd_NYMQ6.js +8 -0
- package/dist/chunk-B4BG7PRW-C5mt8tWU.js +1376 -0
- package/dist/chunk-DI55MBZ5-BliqH_si.js +1382 -0
- package/dist/chunk-FMBD7UC4-D8OxNP20.js +19 -0
- package/dist/chunk-QN33PNHL-DBPrGAkF.js +20 -0
- package/dist/chunk-QZHKN3VN-Ce2k3n1F.js +15 -0
- package/dist/chunk-TZMSLE5B-BB3w_n2J.js +64 -0
- package/dist/classDiagram-2ON5EDUG-BJg1PJs9.js +16 -0
- package/dist/classDiagram-v2-WZHVMYZB-BJg1PJs9.js +16 -0
- package/dist/client_types-BmacnRwO.js +17 -0
- package/dist/client_types-Cu_f02j7.js +17 -0
- package/dist/clone-DZF-mLM1.js +8 -0
- package/dist/components/Docs.d.ts +5 -0
- package/dist/components/DocsBreadcrumbs.d.ts +10 -0
- package/dist/components/DocsErrorBoundary.d.ts +21 -0
- package/dist/components/DocsPage.d.ts +10 -0
- package/dist/components/DocsSearch.d.ts +12 -0
- package/dist/components/DocsViewer.d.ts +11 -0
- package/dist/components/index.d.ts +6 -0
- package/dist/components/useDocsStyles.d.ts +1 -0
- package/dist/cose-bilkent-S5V4N54A-xEniAY-c.js +2608 -0
- package/dist/cytoscape.esm-CjI2IsL8.js +18735 -0
- package/dist/dagre-6UL2VRFP-DWEj74f8.js +446 -0
- package/dist/defaultLocale-BgPVtth8.js +171 -0
- package/dist/delegation_source-B8L65LAZ.js +17 -0
- package/dist/delegation_source-DBE0sh58.js +17 -0
- package/dist/diagram-PSM6KHXK-Z3KtWXiy.js +533 -0
- package/dist/diagram-QEK2KX5R-BVA9QmB8.js +221 -0
- package/dist/diagram-S2PKOQOG-BOmc_fL6.js +143 -0
- package/dist/docs/folder.d.ts +12 -0
- package/dist/docs/types.d.ts +12 -0
- package/dist/entraid-CPkATiHs.js +6 -0
- package/dist/entraid-CSwp8dMQ.js +6 -0
- package/dist/erDiagram-Q2GNP2WA-Blro_6F2.js +842 -0
- package/dist/faq-CqjYqwL1.js +8 -0
- package/dist/faq-TqD11_1a.js +8 -0
- package/dist/flowDiagram-NV44I4VS-BN9iLCEi.js +1627 -0
- package/dist/frontchannel_logout_uri-Bt6bvoBs.js +36 -0
- package/dist/frontchannel_logout_uri-DRGyFXRl.js +36 -0
- package/dist/ganttDiagram-JELNMOA3-CXLPJQlh.js +2670 -0
- package/dist/general--WqS-xp8.js +89 -0
- package/dist/general-B37q4SsA.js +63 -0
- package/dist/general-BCOYLf6V.js +152 -0
- package/dist/general-CQFRRoeE.js +63 -0
- package/dist/general-Dk7lWiBC.js +152 -0
- package/dist/general-QQfgnjEE.js +89 -0
- package/dist/gitGraph-F6HP7TQM-ChFlbGFG.js +5 -0
- package/dist/gitGraphDiagram-NY62KEGX-DXSPVlhd.js +712 -0
- package/dist/graph-dALvSPTP.js +381 -0
- package/dist/index-D_FT2Td-.js +25338 -0
- package/dist/index.d.ts +2 -0
- package/dist/index.js +9 -0
- package/dist/info-NVLQJR56-BSQ5ueiP.js +5 -0
- package/dist/infoDiagram-WHAUD3N6-D0hbJwWb.js +24 -0
- package/dist/init-DjUOC4st.js +16 -0
- package/dist/integration_guide-BXkM8zJ-.js +7 -0
- package/dist/integration_guide-CLABphnS.js +313 -0
- package/dist/integration_guide-Ci8Nz8oL.js +313 -0
- package/dist/integration_guide-Ct8RYoMV.js +6 -0
- package/dist/integration_guide-DWfjt6Qk.js +6 -0
- package/dist/integration_guide-DrKTpPnR.js +6 -0
- package/dist/journeyDiagram-XKPGCS4Q-DTU9EVLJ.js +834 -0
- package/dist/kanban-definition-3W4ZIXB7-CcKx9EnU.js +721 -0
- package/dist/katex-C6SjTJMZ.js +11690 -0
- package/dist/layout-DUskCdLZ.js +1441 -0
- package/dist/linear-RKbqvfvG.js +259 -0
- package/dist/mermaid-parser.core-C-16ojim.js +15189 -0
- package/dist/min-CsCJm_uR.js +38 -0
- package/dist/mindmap-definition-VGOIOE7T-LpgPu_oq.js +787 -0
- package/dist/on_behalf_of-EcHpNqmZ.js +36 -0
- package/dist/on_behalf_of-qrlvHfcG.js +36 -0
- package/dist/ordinal-DfAQgscy.js +61 -0
- package/dist/overview-Bw11cTNo.js +21 -0
- package/dist/overview-ZreyAEkN.js +21 -0
- package/dist/packet-BFZMPI3H-CwJrUCZn.js +5 -0
- package/dist/pie-7BOR55EZ-WUF72bRP.js +5 -0
- package/dist/pieDiagram-ADFJNKIX-BRjx2vS_.js +161 -0
- package/dist/pkce-BkSKWYmh.js +34 -0
- package/dist/pkce-C3U_jCxQ.js +33 -0
- package/dist/post_logout_redirect_uri-BSzuTRwg.js +33 -0
- package/dist/post_logout_redirect_uri-BnhzB1De.js +33 -0
- package/dist/pseudonymous_login-B3oa6s2f.js +17 -0
- package/dist/pseudonymous_login-x98obOlL.js +17 -0
- package/dist/quadrantDiagram-AYHSOK5B-BOwjGYKH.js +1024 -0
- package/dist/radar-NHE76QYJ-DRN4buPP.js +5 -0
- package/dist/redirect_uri-Cnlv_2rt.js +38 -0
- package/dist/redirect_uri-DgNidm8d.js +38 -0
- package/dist/refresh_token_lifetime-DCzCzIyu.js +34 -0
- package/dist/refresh_token_lifetime-QcGf0aOG.js +34 -0
- package/dist/refresh_token_usage-C2LdxQHa.js +33 -0
- package/dist/refresh_token_usage-DXI98e4O.js +33 -0
- package/dist/requirementDiagram-UZGBJVZJ-KRDecAgT.js +852 -0
- package/dist/sankeyDiagram-TZEHDZUN-MKxbwv35.js +810 -0
- package/dist/search-index.json +450 -0
- package/dist/sequenceDiagram-WL72ISMW-DEo0cUN3.js +2518 -0
- package/dist/sso-BuAlvelZ.js +79 -0
- package/dist/sso-DYMIpoUd.js +78 -0
- package/dist/stateDiagram-FKZM4ZOC-CaTGomRc.js +263 -0
- package/dist/stateDiagram-v2-4FDKWEC3-l4p7_3uG.js +16 -0
- package/dist/timeline-definition-IT6M3QCI-ChX0PfWC.js +799 -0
- package/dist/token_lifetimes-Cp22x6RM.js +17 -0
- package/dist/token_lifetimes-CwzcMEnb.js +17 -0
- package/dist/token_type-B8DCg80j.js +17 -0
- package/dist/token_type-C7Y04-Fc.js +17 -0
- package/dist/treemap-KMMF4GRG-DNEhU-LQ.js +5 -0
- package/dist/user_involvement-4nbn_fQ7.js +17 -0
- package/dist/user_involvement-COT572uK.js +17 -0
- package/dist/visibility-BSqCGXMv.js +17 -0
- package/dist/visibility-CidZ07d9.js +17 -0
- package/dist/xychartDiagram-PRI3JC2R-CBQAJ13t.js +1340 -0
- package/package.json +60 -0
package/README.md
ADDED
|
@@ -0,0 +1,74 @@
|
|
|
1
|
+
# `@kut/docs`
|
|
2
|
+
|
|
3
|
+
React components for browsing and rendering the bundled KUT documentation.
|
|
4
|
+
|
|
5
|
+
## Install
|
|
6
|
+
|
|
7
|
+
```bash
|
|
8
|
+
npm install @kut/docs react react-dom @navikt/aksel-icons
|
|
9
|
+
```
|
|
10
|
+
|
|
11
|
+
`@navikt/aksel-icons` is a peer dependency and must be installed by the consuming app.
|
|
12
|
+
|
|
13
|
+
The host app is expected to load the design system styles it already uses before rendering these components.
|
|
14
|
+
|
|
15
|
+
## Basic usage
|
|
16
|
+
|
|
17
|
+
`DocsPage` is the simplest way to render the bundled docs with search, breadcrumbs and navigation.
|
|
18
|
+
|
|
19
|
+
```tsx
|
|
20
|
+
import { DocsPage } from '@kut/docs';
|
|
21
|
+
|
|
22
|
+
export function App() {
|
|
23
|
+
return <DocsPage />;
|
|
24
|
+
}
|
|
25
|
+
```
|
|
26
|
+
|
|
27
|
+
## Controlled navigation
|
|
28
|
+
|
|
29
|
+
Use the controlled API if your app wants to keep the current docs path in state or sync it with a router.
|
|
30
|
+
|
|
31
|
+
```tsx
|
|
32
|
+
import { useState } from 'react';
|
|
33
|
+
import { DocsPage } from '@kut/docs';
|
|
34
|
+
|
|
35
|
+
export function DocsScreen() {
|
|
36
|
+
const [path, setPath] = useState('/nb/start');
|
|
37
|
+
|
|
38
|
+
return (
|
|
39
|
+
<DocsPage
|
|
40
|
+
currentPath={path}
|
|
41
|
+
onNavigate={setPath}
|
|
42
|
+
editable
|
|
43
|
+
startPageHeader="Kom i gang"
|
|
44
|
+
startPageParagraphs={[
|
|
45
|
+
'Velg et tema for å åpne dokumentasjon.',
|
|
46
|
+
'Du kan også bruke søket for å hoppe direkte til en side.',
|
|
47
|
+
]}
|
|
48
|
+
/>
|
|
49
|
+
);
|
|
50
|
+
}
|
|
51
|
+
```
|
|
52
|
+
|
|
53
|
+
## Render a single document
|
|
54
|
+
|
|
55
|
+
Use `Docs` if you only need the markdown renderer for one known document.
|
|
56
|
+
|
|
57
|
+
```tsx
|
|
58
|
+
import { Docs } from '@kut/docs';
|
|
59
|
+
|
|
60
|
+
export function FaqPage() {
|
|
61
|
+
return <Docs docPath="nb/start/faq" />;
|
|
62
|
+
}
|
|
63
|
+
```
|
|
64
|
+
|
|
65
|
+
## Build and publish
|
|
66
|
+
|
|
67
|
+
```bash
|
|
68
|
+
npm run typecheck
|
|
69
|
+
npm run build
|
|
70
|
+
npm pack --dry-run
|
|
71
|
+
npm publish
|
|
72
|
+
```
|
|
73
|
+
|
|
74
|
+
The package publishes the `dist` folder only, and scoped publishes are configured as public.
|
|
@@ -0,0 +1,477 @@
|
|
|
1
|
+
import { aV as L, bj as ln, aE as A, aT as P, bk as gn, bl as dn, aD as W, bm as hn, bn as z, bo as pn, bp as An, bq as m, aW as N, a$ as U, b2 as T, br as _n, aZ as on, bs as wn, bt as On, aF as V, bu as vn, bv as I } from "./index-D_FT2Td-.js";
|
|
2
|
+
var Pn = "[object Symbol]";
|
|
3
|
+
function x(n) {
|
|
4
|
+
return typeof n == "symbol" || L(n) && ln(n) == Pn;
|
|
5
|
+
}
|
|
6
|
+
function yn(n, r) {
|
|
7
|
+
for (var e = -1, i = n == null ? 0 : n.length, f = Array(i); ++e < i; )
|
|
8
|
+
f[e] = r(n[e], e, n);
|
|
9
|
+
return f;
|
|
10
|
+
}
|
|
11
|
+
var B = P ? P.prototype : void 0, K = B ? B.toString : void 0;
|
|
12
|
+
function k(n) {
|
|
13
|
+
if (typeof n == "string")
|
|
14
|
+
return n;
|
|
15
|
+
if (A(n))
|
|
16
|
+
return yn(n, k) + "";
|
|
17
|
+
if (x(n))
|
|
18
|
+
return K ? K.call(n) : "";
|
|
19
|
+
var r = n + "";
|
|
20
|
+
return r == "0" && 1 / n == -1 / 0 ? "-0" : r;
|
|
21
|
+
}
|
|
22
|
+
function En() {
|
|
23
|
+
}
|
|
24
|
+
function bn(n, r) {
|
|
25
|
+
for (var e = -1, i = n == null ? 0 : n.length; ++e < i && r(n[e], e, n) !== !1; )
|
|
26
|
+
;
|
|
27
|
+
return n;
|
|
28
|
+
}
|
|
29
|
+
function cn(n, r, e, i) {
|
|
30
|
+
for (var f = n.length, t = e + -1; ++t < f; )
|
|
31
|
+
if (r(n[t], t, n))
|
|
32
|
+
return t;
|
|
33
|
+
return -1;
|
|
34
|
+
}
|
|
35
|
+
function Tn(n) {
|
|
36
|
+
return n !== n;
|
|
37
|
+
}
|
|
38
|
+
function Rn(n, r, e) {
|
|
39
|
+
for (var i = e - 1, f = n.length; ++i < f; )
|
|
40
|
+
if (n[i] === r)
|
|
41
|
+
return i;
|
|
42
|
+
return -1;
|
|
43
|
+
}
|
|
44
|
+
function In(n, r, e) {
|
|
45
|
+
return r === r ? Rn(n, r, e) : cn(n, Tn, e);
|
|
46
|
+
}
|
|
47
|
+
function Sn(n, r) {
|
|
48
|
+
var e = n == null ? 0 : n.length;
|
|
49
|
+
return !!e && In(n, r, 0) > -1;
|
|
50
|
+
}
|
|
51
|
+
function M(n) {
|
|
52
|
+
return W(n) ? gn(n) : dn(n);
|
|
53
|
+
}
|
|
54
|
+
var Ln = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, xn = /^\w*$/;
|
|
55
|
+
function $(n, r) {
|
|
56
|
+
if (A(n))
|
|
57
|
+
return !1;
|
|
58
|
+
var e = typeof n;
|
|
59
|
+
return e == "number" || e == "symbol" || e == "boolean" || n == null || x(n) ? !0 : xn.test(n) || !Ln.test(n) || r != null && n in Object(r);
|
|
60
|
+
}
|
|
61
|
+
var Mn = 500;
|
|
62
|
+
function $n(n) {
|
|
63
|
+
var r = hn(n, function(i) {
|
|
64
|
+
return e.size === Mn && e.clear(), i;
|
|
65
|
+
}), e = r.cache;
|
|
66
|
+
return r;
|
|
67
|
+
}
|
|
68
|
+
var Cn = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, Dn = /\\(\\)?/g, Fn = $n(function(n) {
|
|
69
|
+
var r = [];
|
|
70
|
+
return n.charCodeAt(0) === 46 && r.push(""), n.replace(Cn, function(e, i, f, t) {
|
|
71
|
+
r.push(f ? t.replace(Dn, "$1") : i || e);
|
|
72
|
+
}), r;
|
|
73
|
+
});
|
|
74
|
+
function Gn(n) {
|
|
75
|
+
return n == null ? "" : k(n);
|
|
76
|
+
}
|
|
77
|
+
function j(n, r) {
|
|
78
|
+
return A(n) ? n : $(n, r) ? [n] : Fn(Gn(n));
|
|
79
|
+
}
|
|
80
|
+
function R(n) {
|
|
81
|
+
if (typeof n == "string" || x(n))
|
|
82
|
+
return n;
|
|
83
|
+
var r = n + "";
|
|
84
|
+
return r == "0" && 1 / n == -1 / 0 ? "-0" : r;
|
|
85
|
+
}
|
|
86
|
+
function nn(n, r) {
|
|
87
|
+
r = j(r, n);
|
|
88
|
+
for (var e = 0, i = r.length; n != null && e < i; )
|
|
89
|
+
n = n[R(r[e++])];
|
|
90
|
+
return e && e == i ? n : void 0;
|
|
91
|
+
}
|
|
92
|
+
function mn(n, r, e) {
|
|
93
|
+
var i = n == null ? void 0 : nn(n, r);
|
|
94
|
+
return i === void 0 ? e : i;
|
|
95
|
+
}
|
|
96
|
+
function rn(n, r) {
|
|
97
|
+
for (var e = -1, i = r.length, f = n.length; ++e < i; )
|
|
98
|
+
n[f + e] = r[e];
|
|
99
|
+
return n;
|
|
100
|
+
}
|
|
101
|
+
var H = P ? P.isConcatSpreadable : void 0;
|
|
102
|
+
function Nn(n) {
|
|
103
|
+
return A(n) || z(n) || !!(H && n && n[H]);
|
|
104
|
+
}
|
|
105
|
+
function Hr(n, r, e, i, f) {
|
|
106
|
+
var t = -1, s = n.length;
|
|
107
|
+
for (e || (e = Nn), f || (f = []); ++t < s; ) {
|
|
108
|
+
var u = n[t];
|
|
109
|
+
e(u) ? rn(f, u) : i || (f[f.length] = u);
|
|
110
|
+
}
|
|
111
|
+
return f;
|
|
112
|
+
}
|
|
113
|
+
function Un(n, r, e, i) {
|
|
114
|
+
var f = -1, t = n == null ? 0 : n.length;
|
|
115
|
+
for (i && t && (e = n[++f]); ++f < t; )
|
|
116
|
+
e = r(e, n[f], f, n);
|
|
117
|
+
return e;
|
|
118
|
+
}
|
|
119
|
+
function en(n, r) {
|
|
120
|
+
for (var e = -1, i = n == null ? 0 : n.length, f = 0, t = []; ++e < i; ) {
|
|
121
|
+
var s = n[e];
|
|
122
|
+
r(s, e, n) && (t[f++] = s);
|
|
123
|
+
}
|
|
124
|
+
return t;
|
|
125
|
+
}
|
|
126
|
+
function Bn() {
|
|
127
|
+
return [];
|
|
128
|
+
}
|
|
129
|
+
var Kn = Object.prototype, Hn = Kn.propertyIsEnumerable, q = Object.getOwnPropertySymbols, qn = q ? function(n) {
|
|
130
|
+
return n == null ? [] : (n = Object(n), en(q(n), function(r) {
|
|
131
|
+
return Hn.call(n, r);
|
|
132
|
+
}));
|
|
133
|
+
} : Bn;
|
|
134
|
+
function Zn(n, r, e) {
|
|
135
|
+
var i = r(n);
|
|
136
|
+
return A(n) ? i : rn(i, e(n));
|
|
137
|
+
}
|
|
138
|
+
function Z(n) {
|
|
139
|
+
return Zn(n, M, qn);
|
|
140
|
+
}
|
|
141
|
+
var Yn = "__lodash_hash_undefined__";
|
|
142
|
+
function Xn(n) {
|
|
143
|
+
return this.__data__.set(n, Yn), this;
|
|
144
|
+
}
|
|
145
|
+
function Jn(n) {
|
|
146
|
+
return this.__data__.has(n);
|
|
147
|
+
}
|
|
148
|
+
function y(n) {
|
|
149
|
+
var r = -1, e = n == null ? 0 : n.length;
|
|
150
|
+
for (this.__data__ = new pn(); ++r < e; )
|
|
151
|
+
this.add(n[r]);
|
|
152
|
+
}
|
|
153
|
+
y.prototype.add = y.prototype.push = Xn;
|
|
154
|
+
y.prototype.has = Jn;
|
|
155
|
+
function Qn(n, r) {
|
|
156
|
+
for (var e = -1, i = n == null ? 0 : n.length; ++e < i; )
|
|
157
|
+
if (r(n[e], e, n))
|
|
158
|
+
return !0;
|
|
159
|
+
return !1;
|
|
160
|
+
}
|
|
161
|
+
function tn(n, r) {
|
|
162
|
+
return n.has(r);
|
|
163
|
+
}
|
|
164
|
+
var Wn = 1, zn = 2;
|
|
165
|
+
function fn(n, r, e, i, f, t) {
|
|
166
|
+
var s = e & Wn, u = n.length, a = r.length;
|
|
167
|
+
if (u != a && !(s && a > u))
|
|
168
|
+
return !1;
|
|
169
|
+
var h = t.get(n), g = t.get(r);
|
|
170
|
+
if (h && g)
|
|
171
|
+
return h == r && g == n;
|
|
172
|
+
var l = -1, d = !0, o = e & zn ? new y() : void 0;
|
|
173
|
+
for (t.set(n, r), t.set(r, n); ++l < u; ) {
|
|
174
|
+
var p = n[l], _ = r[l];
|
|
175
|
+
if (i)
|
|
176
|
+
var w = s ? i(_, p, l, r, n, t) : i(p, _, l, n, r, t);
|
|
177
|
+
if (w !== void 0) {
|
|
178
|
+
if (w)
|
|
179
|
+
continue;
|
|
180
|
+
d = !1;
|
|
181
|
+
break;
|
|
182
|
+
}
|
|
183
|
+
if (o) {
|
|
184
|
+
if (!Qn(r, function(O, v) {
|
|
185
|
+
if (!tn(o, v) && (p === O || f(p, O, e, i, t)))
|
|
186
|
+
return o.push(v);
|
|
187
|
+
})) {
|
|
188
|
+
d = !1;
|
|
189
|
+
break;
|
|
190
|
+
}
|
|
191
|
+
} else if (!(p === _ || f(p, _, e, i, t))) {
|
|
192
|
+
d = !1;
|
|
193
|
+
break;
|
|
194
|
+
}
|
|
195
|
+
}
|
|
196
|
+
return t.delete(n), t.delete(r), d;
|
|
197
|
+
}
|
|
198
|
+
function Vn(n) {
|
|
199
|
+
var r = -1, e = Array(n.size);
|
|
200
|
+
return n.forEach(function(i, f) {
|
|
201
|
+
e[++r] = [f, i];
|
|
202
|
+
}), e;
|
|
203
|
+
}
|
|
204
|
+
function C(n) {
|
|
205
|
+
var r = -1, e = Array(n.size);
|
|
206
|
+
return n.forEach(function(i) {
|
|
207
|
+
e[++r] = i;
|
|
208
|
+
}), e;
|
|
209
|
+
}
|
|
210
|
+
var kn = 1, jn = 2, nr = "[object Boolean]", rr = "[object Date]", er = "[object Error]", ir = "[object Map]", tr = "[object Number]", fr = "[object RegExp]", sr = "[object Set]", ur = "[object String]", ar = "[object Symbol]", lr = "[object ArrayBuffer]", gr = "[object DataView]", Y = P ? P.prototype : void 0, S = Y ? Y.valueOf : void 0;
|
|
211
|
+
function dr(n, r, e, i, f, t, s) {
|
|
212
|
+
switch (e) {
|
|
213
|
+
case gr:
|
|
214
|
+
if (n.byteLength != r.byteLength || n.byteOffset != r.byteOffset)
|
|
215
|
+
return !1;
|
|
216
|
+
n = n.buffer, r = r.buffer;
|
|
217
|
+
case lr:
|
|
218
|
+
return !(n.byteLength != r.byteLength || !t(new m(n), new m(r)));
|
|
219
|
+
case nr:
|
|
220
|
+
case rr:
|
|
221
|
+
case tr:
|
|
222
|
+
return An(+n, +r);
|
|
223
|
+
case er:
|
|
224
|
+
return n.name == r.name && n.message == r.message;
|
|
225
|
+
case fr:
|
|
226
|
+
case ur:
|
|
227
|
+
return n == r + "";
|
|
228
|
+
case ir:
|
|
229
|
+
var u = Vn;
|
|
230
|
+
case sr:
|
|
231
|
+
var a = i & kn;
|
|
232
|
+
if (u || (u = C), n.size != r.size && !a)
|
|
233
|
+
return !1;
|
|
234
|
+
var h = s.get(n);
|
|
235
|
+
if (h)
|
|
236
|
+
return h == r;
|
|
237
|
+
i |= jn, s.set(n, r);
|
|
238
|
+
var g = fn(u(n), u(r), i, f, t, s);
|
|
239
|
+
return s.delete(n), g;
|
|
240
|
+
case ar:
|
|
241
|
+
if (S)
|
|
242
|
+
return S.call(n) == S.call(r);
|
|
243
|
+
}
|
|
244
|
+
return !1;
|
|
245
|
+
}
|
|
246
|
+
var hr = 1, pr = Object.prototype, Ar = pr.hasOwnProperty;
|
|
247
|
+
function _r(n, r, e, i, f, t) {
|
|
248
|
+
var s = e & hr, u = Z(n), a = u.length, h = Z(r), g = h.length;
|
|
249
|
+
if (a != g && !s)
|
|
250
|
+
return !1;
|
|
251
|
+
for (var l = a; l--; ) {
|
|
252
|
+
var d = u[l];
|
|
253
|
+
if (!(s ? d in r : Ar.call(r, d)))
|
|
254
|
+
return !1;
|
|
255
|
+
}
|
|
256
|
+
var o = t.get(n), p = t.get(r);
|
|
257
|
+
if (o && p)
|
|
258
|
+
return o == r && p == n;
|
|
259
|
+
var _ = !0;
|
|
260
|
+
t.set(n, r), t.set(r, n);
|
|
261
|
+
for (var w = s; ++l < a; ) {
|
|
262
|
+
d = u[l];
|
|
263
|
+
var O = n[d], v = r[d];
|
|
264
|
+
if (i)
|
|
265
|
+
var G = s ? i(v, O, d, r, n, t) : i(O, v, d, n, r, t);
|
|
266
|
+
if (!(G === void 0 ? O === v || f(O, v, e, i, t) : G)) {
|
|
267
|
+
_ = !1;
|
|
268
|
+
break;
|
|
269
|
+
}
|
|
270
|
+
w || (w = d == "constructor");
|
|
271
|
+
}
|
|
272
|
+
if (_ && !w) {
|
|
273
|
+
var E = n.constructor, b = r.constructor;
|
|
274
|
+
E != b && "constructor" in n && "constructor" in r && !(typeof E == "function" && E instanceof E && typeof b == "function" && b instanceof b) && (_ = !1);
|
|
275
|
+
}
|
|
276
|
+
return t.delete(n), t.delete(r), _;
|
|
277
|
+
}
|
|
278
|
+
var or = 1, X = "[object Arguments]", J = "[object Array]", c = "[object Object]", wr = Object.prototype, Q = wr.hasOwnProperty;
|
|
279
|
+
function Or(n, r, e, i, f, t) {
|
|
280
|
+
var s = A(n), u = A(r), a = s ? J : N(n), h = u ? J : N(r);
|
|
281
|
+
a = a == X ? c : a, h = h == X ? c : h;
|
|
282
|
+
var g = a == c, l = h == c, d = a == h;
|
|
283
|
+
if (d && U(n)) {
|
|
284
|
+
if (!U(r))
|
|
285
|
+
return !1;
|
|
286
|
+
s = !0, g = !1;
|
|
287
|
+
}
|
|
288
|
+
if (d && !g)
|
|
289
|
+
return t || (t = new T()), s || _n(n) ? fn(n, r, e, i, f, t) : dr(n, r, a, e, i, f, t);
|
|
290
|
+
if (!(e & or)) {
|
|
291
|
+
var o = g && Q.call(n, "__wrapped__"), p = l && Q.call(r, "__wrapped__");
|
|
292
|
+
if (o || p) {
|
|
293
|
+
var _ = o ? n.value() : n, w = p ? r.value() : r;
|
|
294
|
+
return t || (t = new T()), f(_, w, e, i, t);
|
|
295
|
+
}
|
|
296
|
+
}
|
|
297
|
+
return d ? (t || (t = new T()), _r(n, r, e, i, f, t)) : !1;
|
|
298
|
+
}
|
|
299
|
+
function D(n, r, e, i, f) {
|
|
300
|
+
return n === r ? !0 : n == null || r == null || !L(n) && !L(r) ? n !== n && r !== r : Or(n, r, e, i, D, f);
|
|
301
|
+
}
|
|
302
|
+
var vr = 1, Pr = 2;
|
|
303
|
+
function yr(n, r, e, i) {
|
|
304
|
+
var f = e.length, t = f;
|
|
305
|
+
if (n == null)
|
|
306
|
+
return !t;
|
|
307
|
+
for (n = Object(n); f--; ) {
|
|
308
|
+
var s = e[f];
|
|
309
|
+
if (s[2] ? s[1] !== n[s[0]] : !(s[0] in n))
|
|
310
|
+
return !1;
|
|
311
|
+
}
|
|
312
|
+
for (; ++f < t; ) {
|
|
313
|
+
s = e[f];
|
|
314
|
+
var u = s[0], a = n[u], h = s[1];
|
|
315
|
+
if (s[2]) {
|
|
316
|
+
if (a === void 0 && !(u in n))
|
|
317
|
+
return !1;
|
|
318
|
+
} else {
|
|
319
|
+
var g = new T(), l;
|
|
320
|
+
if (!(l === void 0 ? D(h, a, vr | Pr, i, g) : l))
|
|
321
|
+
return !1;
|
|
322
|
+
}
|
|
323
|
+
}
|
|
324
|
+
return !0;
|
|
325
|
+
}
|
|
326
|
+
function sn(n) {
|
|
327
|
+
return n === n && !on(n);
|
|
328
|
+
}
|
|
329
|
+
function Er(n) {
|
|
330
|
+
for (var r = M(n), e = r.length; e--; ) {
|
|
331
|
+
var i = r[e], f = n[i];
|
|
332
|
+
r[e] = [i, f, sn(f)];
|
|
333
|
+
}
|
|
334
|
+
return r;
|
|
335
|
+
}
|
|
336
|
+
function un(n, r) {
|
|
337
|
+
return function(e) {
|
|
338
|
+
return e == null ? !1 : e[n] === r && (r !== void 0 || n in Object(e));
|
|
339
|
+
};
|
|
340
|
+
}
|
|
341
|
+
function br(n) {
|
|
342
|
+
var r = Er(n);
|
|
343
|
+
return r.length == 1 && r[0][2] ? un(r[0][0], r[0][1]) : function(e) {
|
|
344
|
+
return e === n || yr(e, n, r);
|
|
345
|
+
};
|
|
346
|
+
}
|
|
347
|
+
function cr(n, r) {
|
|
348
|
+
return n != null && r in Object(n);
|
|
349
|
+
}
|
|
350
|
+
function Tr(n, r, e) {
|
|
351
|
+
r = j(r, n);
|
|
352
|
+
for (var i = -1, f = r.length, t = !1; ++i < f; ) {
|
|
353
|
+
var s = R(r[i]);
|
|
354
|
+
if (!(t = n != null && e(n, s)))
|
|
355
|
+
break;
|
|
356
|
+
n = n[s];
|
|
357
|
+
}
|
|
358
|
+
return t || ++i != f ? t : (f = n == null ? 0 : n.length, !!f && wn(f) && On(s, f) && (A(n) || z(n)));
|
|
359
|
+
}
|
|
360
|
+
function Rr(n, r) {
|
|
361
|
+
return n != null && Tr(n, r, cr);
|
|
362
|
+
}
|
|
363
|
+
var Ir = 1, Sr = 2;
|
|
364
|
+
function Lr(n, r) {
|
|
365
|
+
return $(n) && sn(r) ? un(R(n), r) : function(e) {
|
|
366
|
+
var i = mn(e, n);
|
|
367
|
+
return i === void 0 && i === r ? Rr(e, n) : D(r, i, Ir | Sr);
|
|
368
|
+
};
|
|
369
|
+
}
|
|
370
|
+
function xr(n) {
|
|
371
|
+
return function(r) {
|
|
372
|
+
return r == null ? void 0 : r[n];
|
|
373
|
+
};
|
|
374
|
+
}
|
|
375
|
+
function Mr(n) {
|
|
376
|
+
return function(r) {
|
|
377
|
+
return nn(r, n);
|
|
378
|
+
};
|
|
379
|
+
}
|
|
380
|
+
function $r(n) {
|
|
381
|
+
return $(n) ? xr(R(n)) : Mr(n);
|
|
382
|
+
}
|
|
383
|
+
function an(n) {
|
|
384
|
+
return typeof n == "function" ? n : n == null ? V : typeof n == "object" ? A(n) ? Lr(n[0], n[1]) : br(n) : $r(n);
|
|
385
|
+
}
|
|
386
|
+
function Cr(n, r) {
|
|
387
|
+
return n && vn(n, r, M);
|
|
388
|
+
}
|
|
389
|
+
function Dr(n, r) {
|
|
390
|
+
return function(e, i) {
|
|
391
|
+
if (e == null)
|
|
392
|
+
return e;
|
|
393
|
+
if (!W(e))
|
|
394
|
+
return n(e, i);
|
|
395
|
+
for (var f = e.length, t = -1, s = Object(e); ++t < f && i(s[t], t, s) !== !1; )
|
|
396
|
+
;
|
|
397
|
+
return e;
|
|
398
|
+
};
|
|
399
|
+
}
|
|
400
|
+
var F = Dr(Cr);
|
|
401
|
+
function Fr(n) {
|
|
402
|
+
return typeof n == "function" ? n : V;
|
|
403
|
+
}
|
|
404
|
+
function qr(n, r) {
|
|
405
|
+
var e = A(n) ? bn : F;
|
|
406
|
+
return e(n, Fr(r));
|
|
407
|
+
}
|
|
408
|
+
function Gr(n, r) {
|
|
409
|
+
var e = [];
|
|
410
|
+
return F(n, function(i, f, t) {
|
|
411
|
+
r(i, f, t) && e.push(i);
|
|
412
|
+
}), e;
|
|
413
|
+
}
|
|
414
|
+
function Zr(n, r) {
|
|
415
|
+
var e = A(n) ? en : Gr;
|
|
416
|
+
return e(n, an(r));
|
|
417
|
+
}
|
|
418
|
+
function mr(n, r, e, i, f) {
|
|
419
|
+
return f(n, function(t, s, u) {
|
|
420
|
+
e = i ? (i = !1, t) : r(e, t, s, u);
|
|
421
|
+
}), e;
|
|
422
|
+
}
|
|
423
|
+
function Yr(n, r, e) {
|
|
424
|
+
var i = A(n) ? Un : mr, f = arguments.length < 3;
|
|
425
|
+
return i(n, an(r), e, f, F);
|
|
426
|
+
}
|
|
427
|
+
var Nr = 1 / 0, Ur = I && 1 / C(new I([, -0]))[1] == Nr ? function(n) {
|
|
428
|
+
return new I(n);
|
|
429
|
+
} : En, Br = 200;
|
|
430
|
+
function Xr(n, r, e) {
|
|
431
|
+
var i = -1, f = Sn, t = n.length, s = !0, u = [], a = u;
|
|
432
|
+
if (t >= Br) {
|
|
433
|
+
var h = r ? null : Ur(n);
|
|
434
|
+
if (h)
|
|
435
|
+
return C(h);
|
|
436
|
+
s = !1, f = tn, a = new y();
|
|
437
|
+
} else
|
|
438
|
+
a = r ? [] : u;
|
|
439
|
+
n:
|
|
440
|
+
for (; ++i < t; ) {
|
|
441
|
+
var g = n[i], l = r ? r(g) : g;
|
|
442
|
+
if (g = g !== 0 ? g : 0, s && l === l) {
|
|
443
|
+
for (var d = a.length; d--; )
|
|
444
|
+
if (a[d] === l)
|
|
445
|
+
continue n;
|
|
446
|
+
r && a.push(l), u.push(g);
|
|
447
|
+
} else f(a, l, e) || (a !== u && a.push(l), u.push(g));
|
|
448
|
+
}
|
|
449
|
+
return u;
|
|
450
|
+
}
|
|
451
|
+
export {
|
|
452
|
+
F as a,
|
|
453
|
+
Hr as b,
|
|
454
|
+
yn as c,
|
|
455
|
+
an as d,
|
|
456
|
+
rn as e,
|
|
457
|
+
Zn as f,
|
|
458
|
+
qn as g,
|
|
459
|
+
Z as h,
|
|
460
|
+
x as i,
|
|
461
|
+
bn as j,
|
|
462
|
+
M as k,
|
|
463
|
+
Xr as l,
|
|
464
|
+
Zr as m,
|
|
465
|
+
qr as n,
|
|
466
|
+
cn as o,
|
|
467
|
+
Fr as p,
|
|
468
|
+
Cr as q,
|
|
469
|
+
Yr as r,
|
|
470
|
+
Bn as s,
|
|
471
|
+
Tr as t,
|
|
472
|
+
j as u,
|
|
473
|
+
R as v,
|
|
474
|
+
nn as w,
|
|
475
|
+
Rr as x,
|
|
476
|
+
Gn as y
|
|
477
|
+
};
|
|
@@ -0,0 +1,17 @@
|
|
|
1
|
+
const e = `# Tilgangsstyring
|
|
2
|
+
|
|
3
|
+
## Hva betyr "Tilgjengelig for alle"?
|
|
4
|
+
|
|
5
|
+
Valget \`Tilgjengelig for alle (Krever ingen godkjenning)\` betyr normalt at klienter kan be om tilgang uten en ekstra manuell eller eksplisitt godkjenningsprosess fra tilbyderen.
|
|
6
|
+
|
|
7
|
+
## Fordeler
|
|
8
|
+
|
|
9
|
+
Dette kan gi rask onboarding og lav terskel for bruk. Det passer ofte best for åpne eller standardiserte API-tilganger der risikoen ved feil bruk er begrenset.
|
|
10
|
+
|
|
11
|
+
## Ulemper
|
|
12
|
+
|
|
13
|
+
Når ingen godkjenning kreves, mister du et viktig kontrollpunkt. For mer sensitive API eller for tilgang som må avklares juridisk eller organisatorisk, er det ofte bedre med strengere tilgangsstyring.
|
|
14
|
+
`;
|
|
15
|
+
export {
|
|
16
|
+
e as default
|
|
17
|
+
};
|
|
@@ -0,0 +1,17 @@
|
|
|
1
|
+
const e = `# Access policy
|
|
2
|
+
|
|
3
|
+
## What does "Available to everyone" mean?
|
|
4
|
+
|
|
5
|
+
The option \`Tilgjengelig for alle (Krever ingen godkjenning)\` normally means that clients can request access without an extra manual or explicit approval step from the provider.
|
|
6
|
+
|
|
7
|
+
## Benefits
|
|
8
|
+
|
|
9
|
+
This can provide fast onboarding and a low barrier to use. It is often best suited for open or standardized API access where the risk of misuse is limited.
|
|
10
|
+
|
|
11
|
+
## Drawbacks
|
|
12
|
+
|
|
13
|
+
When no approval is required, you lose an important control point. For more sensitive APIs, or for access that depends on legal or organizational clarification, stricter access control is often a better fit.
|
|
14
|
+
`;
|
|
15
|
+
export {
|
|
16
|
+
e as default
|
|
17
|
+
};
|
|
@@ -0,0 +1,31 @@
|
|
|
1
|
+
const e = `# Access token levetid
|
|
2
|
+
|
|
3
|
+
## Formål
|
|
4
|
+
|
|
5
|
+
Access token levetid angir hvor lenge et access token er gyldig.
|
|
6
|
+
|
|
7
|
+
Når levetiden utløper, kan tokenet ikke lenger brukes mot beskyttede ressurser.
|
|
8
|
+
|
|
9
|
+
## Teknisk virkemåte
|
|
10
|
+
|
|
11
|
+
Et access token representerer en tidsbegrenset tilgang til API-er og ressurser innenfor gitte scopes og rettigheter. Levetiden avgjør hvor lenge denne tilgangen kan brukes uten fornyelse.
|
|
12
|
+
|
|
13
|
+
### Avveining
|
|
14
|
+
|
|
15
|
+
Kort levetid gir bedre sikkerhet fordi et lekket token kan misbrukes i kortere tid.
|
|
16
|
+
|
|
17
|
+
Lengre levetid gir færre tokenfornyelser og kan forenkle klientlogikken, men øker samtidig konsekvensen dersom tokenet kompromitteres.
|
|
18
|
+
|
|
19
|
+
## Bruk i OIDC-klienter
|
|
20
|
+
|
|
21
|
+
### ID-porten og Ansattporten
|
|
22
|
+
|
|
23
|
+
For brukerrettede OIDC-klienter bør access token levetid ses i sammenheng med om refresh tokens brukes. Kort access token levetid kombinert med kontrollert fornyelse er et vanlig mønster.
|
|
24
|
+
|
|
25
|
+
### Maskinporten
|
|
26
|
+
|
|
27
|
+
Maskinporten bygger også på tidsbegrensede tokens, og levetid er her tilsvarende viktig for å balansere sikkerhet og operativ bruk.
|
|
28
|
+
`;
|
|
29
|
+
export {
|
|
30
|
+
e as default
|
|
31
|
+
};
|
|
@@ -0,0 +1,31 @@
|
|
|
1
|
+
const e = `# Access token lifetime
|
|
2
|
+
|
|
3
|
+
## Purpose
|
|
4
|
+
|
|
5
|
+
Access token lifetime specifies how long an access token remains valid.
|
|
6
|
+
|
|
7
|
+
When the lifetime expires, the token can no longer be used against protected resources.
|
|
8
|
+
|
|
9
|
+
## Technical behavior
|
|
10
|
+
|
|
11
|
+
An access token represents time-limited access to APIs and resources within the granted scopes and permissions. The lifetime determines how long this access can be used without renewal.
|
|
12
|
+
|
|
13
|
+
### Trade-off
|
|
14
|
+
|
|
15
|
+
A short lifetime improves security because a leaked token can be misused for a shorter period of time.
|
|
16
|
+
|
|
17
|
+
A longer lifetime reduces how often tokens must be renewed and can simplify client logic, but it also increases the impact if the token is compromised.
|
|
18
|
+
|
|
19
|
+
## Use in OIDC clients
|
|
20
|
+
|
|
21
|
+
### ID-porten and Ansattporten
|
|
22
|
+
|
|
23
|
+
For user-facing OIDC clients, access token lifetime should be considered together with whether refresh tokens are used. A short access token lifetime combined with controlled renewal is a common pattern.
|
|
24
|
+
|
|
25
|
+
### Maskinporten
|
|
26
|
+
|
|
27
|
+
Maskinporten also relies on time-limited tokens, and lifetime is equally important there to balance security and operational use.
|
|
28
|
+
`;
|
|
29
|
+
export {
|
|
30
|
+
e as default
|
|
31
|
+
};
|