@logto/connector-github 1.0.0 → 1.1.1

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 CHANGED
@@ -1,21 +1,373 @@
1
- MIT License
2
-
3
- Copyright (c) 2022 Silverhand
4
-
5
- Permission is hereby granted, free of charge, to any person obtaining a copy
6
- of this software and associated documentation files (the "Software"), to deal
7
- in the Software without restriction, including without limitation the rights
8
- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9
- copies of the Software, and to permit persons to whom the Software is
10
- furnished to do so, subject to the following conditions:
11
-
12
- The above copyright notice and this permission notice shall be included in all
13
- copies or substantial portions of the Software.
14
-
15
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16
- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17
- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18
- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19
- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20
- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21
- SOFTWARE.
1
+ Mozilla Public License Version 2.0
2
+ ==================================
3
+
4
+ 1. Definitions
5
+ --------------
6
+
7
+ 1.1. "Contributor"
8
+ means each individual or legal entity that creates, contributes to
9
+ the creation of, or owns Covered Software.
10
+
11
+ 1.2. "Contributor Version"
12
+ means the combination of the Contributions of others (if any) used
13
+ by a Contributor and that particular Contributor's Contribution.
14
+
15
+ 1.3. "Contribution"
16
+ means Covered Software of a particular Contributor.
17
+
18
+ 1.4. "Covered Software"
19
+ means Source Code Form to which the initial Contributor has attached
20
+ the notice in Exhibit A, the Executable Form of such Source Code
21
+ Form, and Modifications of such Source Code Form, in each case
22
+ including portions thereof.
23
+
24
+ 1.5. "Incompatible With Secondary Licenses"
25
+ means
26
+
27
+ (a) that the initial Contributor has attached the notice described
28
+ in Exhibit B to the Covered Software; or
29
+
30
+ (b) that the Covered Software was made available under the terms of
31
+ version 1.1 or earlier of the License, but not also under the
32
+ terms of a Secondary License.
33
+
34
+ 1.6. "Executable Form"
35
+ means any form of the work other than Source Code Form.
36
+
37
+ 1.7. "Larger Work"
38
+ means a work that combines Covered Software with other material, in
39
+ a separate file or files, that is not Covered Software.
40
+
41
+ 1.8. "License"
42
+ means this document.
43
+
44
+ 1.9. "Licensable"
45
+ means having the right to grant, to the maximum extent possible,
46
+ whether at the time of the initial grant or subsequently, any and
47
+ all of the rights conveyed by this License.
48
+
49
+ 1.10. "Modifications"
50
+ means any of the following:
51
+
52
+ (a) any file in Source Code Form that results from an addition to,
53
+ deletion from, or modification of the contents of Covered
54
+ Software; or
55
+
56
+ (b) any new file in Source Code Form that contains any Covered
57
+ Software.
58
+
59
+ 1.11. "Patent Claims" of a Contributor
60
+ means any patent claim(s), including without limitation, method,
61
+ process, and apparatus claims, in any patent Licensable by such
62
+ Contributor that would be infringed, but for the grant of the
63
+ License, by the making, using, selling, offering for sale, having
64
+ made, import, or transfer of either its Contributions or its
65
+ Contributor Version.
66
+
67
+ 1.12. "Secondary License"
68
+ means either the GNU General Public License, Version 2.0, the GNU
69
+ Lesser General Public License, Version 2.1, the GNU Affero General
70
+ Public License, Version 3.0, or any later versions of those
71
+ licenses.
72
+
73
+ 1.13. "Source Code Form"
74
+ means the form of the work preferred for making modifications.
75
+
76
+ 1.14. "You" (or "Your")
77
+ means an individual or a legal entity exercising rights under this
78
+ License. For legal entities, "You" includes any entity that
79
+ controls, is controlled by, or is under common control with You. For
80
+ purposes of this definition, "control" means (a) the power, direct
81
+ or indirect, to cause the direction or management of such entity,
82
+ whether by contract or otherwise, or (b) ownership of more than
83
+ fifty percent (50%) of the outstanding shares or beneficial
84
+ ownership of such entity.
85
+
86
+ 2. License Grants and Conditions
87
+ --------------------------------
88
+
89
+ 2.1. Grants
90
+
91
+ Each Contributor hereby grants You a world-wide, royalty-free,
92
+ non-exclusive license:
93
+
94
+ (a) under intellectual property rights (other than patent or trademark)
95
+ Licensable by such Contributor to use, reproduce, make available,
96
+ modify, display, perform, distribute, and otherwise exploit its
97
+ Contributions, either on an unmodified basis, with Modifications, or
98
+ as part of a Larger Work; and
99
+
100
+ (b) under Patent Claims of such Contributor to make, use, sell, offer
101
+ for sale, have made, import, and otherwise transfer either its
102
+ Contributions or its Contributor Version.
103
+
104
+ 2.2. Effective Date
105
+
106
+ The licenses granted in Section 2.1 with respect to any Contribution
107
+ become effective for each Contribution on the date the Contributor first
108
+ distributes such Contribution.
109
+
110
+ 2.3. Limitations on Grant Scope
111
+
112
+ The licenses granted in this Section 2 are the only rights granted under
113
+ this License. No additional rights or licenses will be implied from the
114
+ distribution or licensing of Covered Software under this License.
115
+ Notwithstanding Section 2.1(b) above, no patent license is granted by a
116
+ Contributor:
117
+
118
+ (a) for any code that a Contributor has removed from Covered Software;
119
+ or
120
+
121
+ (b) for infringements caused by: (i) Your and any other third party's
122
+ modifications of Covered Software, or (ii) the combination of its
123
+ Contributions with other software (except as part of its Contributor
124
+ Version); or
125
+
126
+ (c) under Patent Claims infringed by Covered Software in the absence of
127
+ its Contributions.
128
+
129
+ This License does not grant any rights in the trademarks, service marks,
130
+ or logos of any Contributor (except as may be necessary to comply with
131
+ the notice requirements in Section 3.4).
132
+
133
+ 2.4. Subsequent Licenses
134
+
135
+ No Contributor makes additional grants as a result of Your choice to
136
+ distribute the Covered Software under a subsequent version of this
137
+ License (see Section 10.2) or under the terms of a Secondary License (if
138
+ permitted under the terms of Section 3.3).
139
+
140
+ 2.5. Representation
141
+
142
+ Each Contributor represents that the Contributor believes its
143
+ Contributions are its original creation(s) or it has sufficient rights
144
+ to grant the rights to its Contributions conveyed by this License.
145
+
146
+ 2.6. Fair Use
147
+
148
+ This License is not intended to limit any rights You have under
149
+ applicable copyright doctrines of fair use, fair dealing, or other
150
+ equivalents.
151
+
152
+ 2.7. Conditions
153
+
154
+ Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted
155
+ in Section 2.1.
156
+
157
+ 3. Responsibilities
158
+ -------------------
159
+
160
+ 3.1. Distribution of Source Form
161
+
162
+ All distribution of Covered Software in Source Code Form, including any
163
+ Modifications that You create or to which You contribute, must be under
164
+ the terms of this License. You must inform recipients that the Source
165
+ Code Form of the Covered Software is governed by the terms of this
166
+ License, and how they can obtain a copy of this License. You may not
167
+ attempt to alter or restrict the recipients' rights in the Source Code
168
+ Form.
169
+
170
+ 3.2. Distribution of Executable Form
171
+
172
+ If You distribute Covered Software in Executable Form then:
173
+
174
+ (a) such Covered Software must also be made available in Source Code
175
+ Form, as described in Section 3.1, and You must inform recipients of
176
+ the Executable Form how they can obtain a copy of such Source Code
177
+ Form by reasonable means in a timely manner, at a charge no more
178
+ than the cost of distribution to the recipient; and
179
+
180
+ (b) You may distribute such Executable Form under the terms of this
181
+ License, or sublicense it under different terms, provided that the
182
+ license for the Executable Form does not attempt to limit or alter
183
+ the recipients' rights in the Source Code Form under this License.
184
+
185
+ 3.3. Distribution of a Larger Work
186
+
187
+ You may create and distribute a Larger Work under terms of Your choice,
188
+ provided that You also comply with the requirements of this License for
189
+ the Covered Software. If the Larger Work is a combination of Covered
190
+ Software with a work governed by one or more Secondary Licenses, and the
191
+ Covered Software is not Incompatible With Secondary Licenses, this
192
+ License permits You to additionally distribute such Covered Software
193
+ under the terms of such Secondary License(s), so that the recipient of
194
+ the Larger Work may, at their option, further distribute the Covered
195
+ Software under the terms of either this License or such Secondary
196
+ License(s).
197
+
198
+ 3.4. Notices
199
+
200
+ You may not remove or alter the substance of any license notices
201
+ (including copyright notices, patent notices, disclaimers of warranty,
202
+ or limitations of liability) contained within the Source Code Form of
203
+ the Covered Software, except that You may alter any license notices to
204
+ the extent required to remedy known factual inaccuracies.
205
+
206
+ 3.5. Application of Additional Terms
207
+
208
+ You may choose to offer, and to charge a fee for, warranty, support,
209
+ indemnity or liability obligations to one or more recipients of Covered
210
+ Software. However, You may do so only on Your own behalf, and not on
211
+ behalf of any Contributor. You must make it absolutely clear that any
212
+ such warranty, support, indemnity, or liability obligation is offered by
213
+ You alone, and You hereby agree to indemnify every Contributor for any
214
+ liability incurred by such Contributor as a result of warranty, support,
215
+ indemnity or liability terms You offer. You may include additional
216
+ disclaimers of warranty and limitations of liability specific to any
217
+ jurisdiction.
218
+
219
+ 4. Inability to Comply Due to Statute or Regulation
220
+ ---------------------------------------------------
221
+
222
+ If it is impossible for You to comply with any of the terms of this
223
+ License with respect to some or all of the Covered Software due to
224
+ statute, judicial order, or regulation then You must: (a) comply with
225
+ the terms of this License to the maximum extent possible; and (b)
226
+ describe the limitations and the code they affect. Such description must
227
+ be placed in a text file included with all distributions of the Covered
228
+ Software under this License. Except to the extent prohibited by statute
229
+ or regulation, such description must be sufficiently detailed for a
230
+ recipient of ordinary skill to be able to understand it.
231
+
232
+ 5. Termination
233
+ --------------
234
+
235
+ 5.1. The rights granted under this License will terminate automatically
236
+ if You fail to comply with any of its terms. However, if You become
237
+ compliant, then the rights granted under this License from a particular
238
+ Contributor are reinstated (a) provisionally, unless and until such
239
+ Contributor explicitly and finally terminates Your grants, and (b) on an
240
+ ongoing basis, if such Contributor fails to notify You of the
241
+ non-compliance by some reasonable means prior to 60 days after You have
242
+ come back into compliance. Moreover, Your grants from a particular
243
+ Contributor are reinstated on an ongoing basis if such Contributor
244
+ notifies You of the non-compliance by some reasonable means, this is the
245
+ first time You have received notice of non-compliance with this License
246
+ from such Contributor, and You become compliant prior to 30 days after
247
+ Your receipt of the notice.
248
+
249
+ 5.2. If You initiate litigation against any entity by asserting a patent
250
+ infringement claim (excluding declaratory judgment actions,
251
+ counter-claims, and cross-claims) alleging that a Contributor Version
252
+ directly or indirectly infringes any patent, then the rights granted to
253
+ You by any and all Contributors for the Covered Software under Section
254
+ 2.1 of this License shall terminate.
255
+
256
+ 5.3. In the event of termination under Sections 5.1 or 5.2 above, all
257
+ end user license agreements (excluding distributors and resellers) which
258
+ have been validly granted by You or Your distributors under this License
259
+ prior to termination shall survive termination.
260
+
261
+ ************************************************************************
262
+ * *
263
+ * 6. Disclaimer of Warranty *
264
+ * ------------------------- *
265
+ * *
266
+ * Covered Software is provided under this License on an "as is" *
267
+ * basis, without warranty of any kind, either expressed, implied, or *
268
+ * statutory, including, without limitation, warranties that the *
269
+ * Covered Software is free of defects, merchantable, fit for a *
270
+ * particular purpose or non-infringing. The entire risk as to the *
271
+ * quality and performance of the Covered Software is with You. *
272
+ * Should any Covered Software prove defective in any respect, You *
273
+ * (not any Contributor) assume the cost of any necessary servicing, *
274
+ * repair, or correction. This disclaimer of warranty constitutes an *
275
+ * essential part of this License. No use of any Covered Software is *
276
+ * authorized under this License except under this disclaimer. *
277
+ * *
278
+ ************************************************************************
279
+
280
+ ************************************************************************
281
+ * *
282
+ * 7. Limitation of Liability *
283
+ * -------------------------- *
284
+ * *
285
+ * Under no circumstances and under no legal theory, whether tort *
286
+ * (including negligence), contract, or otherwise, shall any *
287
+ * Contributor, or anyone who distributes Covered Software as *
288
+ * permitted above, be liable to You for any direct, indirect, *
289
+ * special, incidental, or consequential damages of any character *
290
+ * including, without limitation, damages for lost profits, loss of *
291
+ * goodwill, work stoppage, computer failure or malfunction, or any *
292
+ * and all other commercial damages or losses, even if such party *
293
+ * shall have been informed of the possibility of such damages. This *
294
+ * limitation of liability shall not apply to liability for death or *
295
+ * personal injury resulting from such party's negligence to the *
296
+ * extent applicable law prohibits such limitation. Some *
297
+ * jurisdictions do not allow the exclusion or limitation of *
298
+ * incidental or consequential damages, so this exclusion and *
299
+ * limitation may not apply to You. *
300
+ * *
301
+ ************************************************************************
302
+
303
+ 8. Litigation
304
+ -------------
305
+
306
+ Any litigation relating to this License may be brought only in the
307
+ courts of a jurisdiction where the defendant maintains its principal
308
+ place of business and such litigation shall be governed by laws of that
309
+ jurisdiction, without reference to its conflict-of-law provisions.
310
+ Nothing in this Section shall prevent a party's ability to bring
311
+ cross-claims or counter-claims.
312
+
313
+ 9. Miscellaneous
314
+ ----------------
315
+
316
+ This License represents the complete agreement concerning the subject
317
+ matter hereof. If any provision of this License is held to be
318
+ unenforceable, such provision shall be reformed only to the extent
319
+ necessary to make it enforceable. Any law or regulation which provides
320
+ that the language of a contract shall be construed against the drafter
321
+ shall not be used to construe this License against a Contributor.
322
+
323
+ 10. Versions of the License
324
+ ---------------------------
325
+
326
+ 10.1. New Versions
327
+
328
+ Mozilla Foundation is the license steward. Except as provided in Section
329
+ 10.3, no one other than the license steward has the right to modify or
330
+ publish new versions of this License. Each version will be given a
331
+ distinguishing version number.
332
+
333
+ 10.2. Effect of New Versions
334
+
335
+ You may distribute the Covered Software under the terms of the version
336
+ of the License under which You originally received the Covered Software,
337
+ or under the terms of any subsequent version published by the license
338
+ steward.
339
+
340
+ 10.3. Modified Versions
341
+
342
+ If you create software not governed by this License, and you want to
343
+ create a new license for such software, you may create and use a
344
+ modified version of this License if you rename the license and remove
345
+ any references to the name of the license steward (except to note that
346
+ such modified license differs from this License).
347
+
348
+ 10.4. Distributing Source Code Form that is Incompatible With Secondary
349
+ Licenses
350
+
351
+ If You choose to distribute Source Code Form that is Incompatible With
352
+ Secondary Licenses under the terms of this version of the License, the
353
+ notice described in Exhibit B of this License must be attached.
354
+
355
+ Exhibit A - Source Code Form License Notice
356
+ -------------------------------------------
357
+
358
+ This Source Code Form is subject to the terms of the Mozilla Public
359
+ License, v. 2.0. If a copy of the MPL was not distributed with this
360
+ file, You can obtain one at http://mozilla.org/MPL/2.0/.
361
+
362
+ If it is not possible or desirable to put the notice in a particular
363
+ file, then You may include the notice in a location (such as a LICENSE
364
+ file in a relevant directory) where a recipient would be likely to look
365
+ for such a notice.
366
+
367
+ You may add additional accurate notices of copyright ownership.
368
+
369
+ Exhibit B - "Incompatible With Secondary Licenses" Notice
370
+ ---------------------------------------------------------
371
+
372
+ This Source Code Form is "Incompatible With Secondary Licenses", as
373
+ defined by the Mozilla Public License, v. 2.0.
package/README.md CHANGED
@@ -42,17 +42,20 @@ You can also find `Client ID` and generate `Client secrets` in OAuth app detail
42
42
 
43
43
  Fill out the `clientId` and `clientSecret` field with _Client ID_ and _Client Secret_ you've got from OAuth app detail pages mentioned in the previous section.
44
44
 
45
+ `scope` is a space-delimited list of [scopes](https://docs.github.com/en/apps/oauth-apps/building-oauth-apps/scopes-for-oauth-apps). If not provided, scope defaults to be `read:user`.
46
+
45
47
  ### Config types
46
48
 
47
49
  | Name | Type |
48
50
  |--------------|--------|
49
51
  | clientId | string |
50
52
  | clientSecret | string |
53
+ | scope | string |
51
54
 
52
55
 
53
56
  ## Test GitHub connector
54
57
 
55
- That's it. The GitHub connector should be available now. Don't forget to [Enable connector in sign-in experience](https://docs.logto.io/docs/tutorials/get-started/enable-social-sign-in#enable-connector-in-sign-in-experience).
58
+ That's it. The GitHub connector should be available now. Don't forget to [Enable connector in sign-in experience](https://docs.logto.io/docs/tutorials/get-started/passwordless-sign-in-by-adding-connectors#enable-social-sign-in).
56
59
 
57
60
  ## Reference
58
61
 
package/lib/index.js CHANGED
@@ -1,5 +1,5 @@
1
- import { ConnectorPlatform, ConnectorConfigFormItemType, ConnectorError, ConnectorErrorCodes, ConnectorType, validateConfig, parseJson } from '@logto/connector-kit';
2
1
  import { got, HTTPError } from 'got';
2
+ import { ConnectorPlatform, ConnectorConfigFormItemType, ConnectorError, ConnectorErrorCodes, ConnectorType, validateConfig, parseJson } from '@logto/connector-kit';
3
3
  import { z } from 'zod';
4
4
 
5
5
  // https://github.com/facebook/jest/issues/7547
@@ -15,20 +15,30 @@ const assert = (value, error) => {
15
15
  // eslint-disable-next-line unicorn/prefer-native-coercion-functions
16
16
  const notFalsy = (value) => Boolean(value);
17
17
 
18
+ /**
19
+ * Conditional return the expression result when it's not {@link Falsy};
20
+ * otherwise return `undefined`.
21
+ *
22
+ * @example
23
+ * ```ts
24
+ * conditional(1 && '2') // '2'
25
+ * conditional(false && '1') // undefined
26
+ * ```
27
+ */
18
28
  const conditional = (exp) => (notFalsy(exp) ? exp : undefined);
19
29
 
20
- var queryString = {};
21
-
22
- var strictUriEncode = str => encodeURIComponent(str).replace(/[!'()*]/g, x => `%${x.charCodeAt(0).toString(16).toUpperCase()}`);
30
+ function getDefaultExportFromCjs (x) {
31
+ return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
32
+ }
23
33
 
24
34
  var token = '%[a-f0-9]{2}';
25
- var singleMatcher = new RegExp(token, 'gi');
35
+ var singleMatcher = new RegExp('(' + token + ')|([^%]+?)', 'gi');
26
36
  var multiMatcher = new RegExp('(' + token + ')+', 'gi');
27
37
 
28
38
  function decodeComponents(components, split) {
29
39
  try {
30
40
  // Try to decode the entire string first
31
- return decodeURIComponent(components.join(''));
41
+ return [decodeURIComponent(components.join(''))];
32
42
  } catch (err) {
33
43
  // Do nothing
34
44
  }
@@ -46,16 +56,16 @@ function decodeComponents(components, split) {
46
56
  return Array.prototype.concat.call([], decodeComponents(left), decodeComponents(right));
47
57
  }
48
58
 
49
- function decode(input) {
59
+ function decode$1(input) {
50
60
  try {
51
61
  return decodeURIComponent(input);
52
62
  } catch (err) {
53
- var tokens = input.match(singleMatcher);
63
+ var tokens = input.match(singleMatcher) || [];
54
64
 
55
65
  for (var i = 1; i < tokens.length; i++) {
56
66
  input = decodeComponents(tokens, i).join('');
57
67
 
58
- tokens = input.match(singleMatcher);
68
+ tokens = input.match(singleMatcher) || [];
59
69
  }
60
70
 
61
71
  return input;
@@ -75,7 +85,7 @@ function customDecodeURIComponent(input) {
75
85
  // Decode as big chunks as possible
76
86
  replaceMap[match[0]] = decodeURIComponent(match[0]);
77
87
  } catch (err) {
78
- var result = decode(match[0]);
88
+ var result = decode$1(match[0]);
79
89
 
80
90
  if (result !== match[0]) {
81
91
  replaceMap[match[0]] = result;
@@ -115,6 +125,8 @@ var decodeUriComponent = function (encodedURI) {
115
125
  }
116
126
  };
117
127
 
128
+ var decodeComponent = /*@__PURE__*/getDefaultExportFromCjs(decodeUriComponent);
129
+
118
130
  var splitOnFirst = (string, separator) => {
119
131
  if (!(typeof string === 'string' && typeof separator === 'string')) {
120
132
  throw new TypeError('Expected the arguments to be of type `string`');
@@ -136,506 +148,223 @@ var splitOnFirst = (string, separator) => {
136
148
  ];
137
149
  };
138
150
 
139
- var filterObj = function (obj, predicate) {
140
- var ret = {};
141
- var keys = Object.keys(obj);
142
- var isArr = Array.isArray(predicate);
143
-
144
- for (var i = 0; i < keys.length; i++) {
145
- var key = keys[i];
146
- var val = obj[key];
147
-
148
- if (isArr ? predicate.indexOf(key) !== -1 : predicate(key, val, obj)) {
149
- ret[key] = val;
150
- }
151
- }
152
-
153
- return ret;
154
- };
155
-
156
- (function (exports) {
157
- const strictUriEncode$1 = strictUriEncode;
158
- const decodeComponent = decodeUriComponent;
159
- const splitOnFirst$1 = splitOnFirst;
160
- const filterObject = filterObj;
161
-
162
- const isNullOrUndefined = value => value === null || value === undefined;
163
-
164
- const encodeFragmentIdentifier = Symbol('encodeFragmentIdentifier');
165
-
166
- function encoderForArrayFormat(options) {
167
- switch (options.arrayFormat) {
168
- case 'index':
169
- return key => (result, value) => {
170
- const index = result.length;
171
-
172
- if (
173
- value === undefined ||
174
- (options.skipNull && value === null) ||
175
- (options.skipEmptyString && value === '')
176
- ) {
177
- return result;
178
- }
179
-
180
- if (value === null) {
181
- return [...result, [encode(key, options), '[', index, ']'].join('')];
182
- }
183
-
184
- return [
185
- ...result,
186
- [encode(key, options), '[', encode(index, options), ']=', encode(value, options)].join('')
187
- ];
188
- };
189
-
190
- case 'bracket':
191
- return key => (result, value) => {
192
- if (
193
- value === undefined ||
194
- (options.skipNull && value === null) ||
195
- (options.skipEmptyString && value === '')
196
- ) {
197
- return result;
198
- }
199
-
200
- if (value === null) {
201
- return [...result, [encode(key, options), '[]'].join('')];
202
- }
203
-
204
- return [...result, [encode(key, options), '[]=', encode(value, options)].join('')];
205
- };
206
-
207
- case 'colon-list-separator':
208
- return key => (result, value) => {
209
- if (
210
- value === undefined ||
211
- (options.skipNull && value === null) ||
212
- (options.skipEmptyString && value === '')
213
- ) {
214
- return result;
215
- }
216
-
217
- if (value === null) {
218
- return [...result, [encode(key, options), ':list='].join('')];
219
- }
220
-
221
- return [...result, [encode(key, options), ':list=', encode(value, options)].join('')];
222
- };
223
-
224
- case 'comma':
225
- case 'separator':
226
- case 'bracket-separator': {
227
- const keyValueSep = options.arrayFormat === 'bracket-separator' ?
228
- '[]=' :
229
- '=';
230
-
231
- return key => (result, value) => {
232
- if (
233
- value === undefined ||
234
- (options.skipNull && value === null) ||
235
- (options.skipEmptyString && value === '')
236
- ) {
237
- return result;
238
- }
239
-
240
- // Translate null to an empty string so that it doesn't serialize as 'null'
241
- value = value === null ? '' : value;
242
-
243
- if (result.length === 0) {
244
- return [[encode(key, options), keyValueSep, encode(value, options)].join('')];
245
- }
246
-
247
- return [[result, encode(value, options)].join(options.arrayFormatSeparator)];
248
- };
249
- }
151
+ var splitOnFirst$1 = /*@__PURE__*/getDefaultExportFromCjs(splitOnFirst);
250
152
 
251
- default:
252
- return key => (result, value) => {
253
- if (
254
- value === undefined ||
255
- (options.skipNull && value === null) ||
256
- (options.skipEmptyString && value === '')
257
- ) {
258
- return result;
259
- }
260
-
261
- if (value === null) {
262
- return [...result, encode(key, options)];
263
- }
264
-
265
- return [...result, [encode(key, options), '=', encode(value, options)].join('')];
266
- };
267
- }
268
- }
153
+ function parserForArrayFormat(options) {
154
+ let result;
269
155
 
270
- function parserForArrayFormat(options) {
271
- let result;
272
-
273
- switch (options.arrayFormat) {
274
- case 'index':
275
- return (key, value, accumulator) => {
276
- result = /\[(\d*)\]$/.exec(key);
277
-
278
- key = key.replace(/\[\d*\]$/, '');
279
-
280
- if (!result) {
281
- accumulator[key] = value;
282
- return;
283
- }
284
-
285
- if (accumulator[key] === undefined) {
286
- accumulator[key] = {};
287
- }
288
-
289
- accumulator[key][result[1]] = value;
290
- };
291
-
292
- case 'bracket':
293
- return (key, value, accumulator) => {
294
- result = /(\[\])$/.exec(key);
295
- key = key.replace(/\[\]$/, '');
296
-
297
- if (!result) {
298
- accumulator[key] = value;
299
- return;
300
- }
301
-
302
- if (accumulator[key] === undefined) {
303
- accumulator[key] = [value];
304
- return;
305
- }
306
-
307
- accumulator[key] = [].concat(accumulator[key], value);
308
- };
309
-
310
- case 'colon-list-separator':
311
- return (key, value, accumulator) => {
312
- result = /(:list)$/.exec(key);
313
- key = key.replace(/:list$/, '');
314
-
315
- if (!result) {
316
- accumulator[key] = value;
317
- return;
318
- }
319
-
320
- if (accumulator[key] === undefined) {
321
- accumulator[key] = [value];
322
- return;
323
- }
324
-
325
- accumulator[key] = [].concat(accumulator[key], value);
326
- };
327
-
328
- case 'comma':
329
- case 'separator':
330
- return (key, value, accumulator) => {
331
- const isArray = typeof value === 'string' && value.includes(options.arrayFormatSeparator);
332
- const isEncodedArray = (typeof value === 'string' && !isArray && decode(value, options).includes(options.arrayFormatSeparator));
333
- value = isEncodedArray ? decode(value, options) : value;
334
- const newValue = isArray || isEncodedArray ? value.split(options.arrayFormatSeparator).map(item => decode(item, options)) : value === null ? value : decode(value, options);
335
- accumulator[key] = newValue;
336
- };
337
-
338
- case 'bracket-separator':
339
- return (key, value, accumulator) => {
340
- const isArray = /(\[\])$/.test(key);
341
- key = key.replace(/\[\]$/, '');
342
-
343
- if (!isArray) {
344
- accumulator[key] = value ? decode(value, options) : value;
345
- return;
346
- }
347
-
348
- const arrayValue = value === null ?
349
- [] :
350
- value.split(options.arrayFormatSeparator).map(item => decode(item, options));
351
-
352
- if (accumulator[key] === undefined) {
353
- accumulator[key] = arrayValue;
354
- return;
355
- }
356
-
357
- accumulator[key] = [].concat(accumulator[key], arrayValue);
358
- };
359
-
360
- default:
361
- return (key, value, accumulator) => {
362
- if (accumulator[key] === undefined) {
363
- accumulator[key] = value;
364
- return;
365
- }
366
-
367
- accumulator[key] = [].concat(accumulator[key], value);
368
- };
369
- }
370
- }
156
+ switch (options.arrayFormat) {
157
+ case 'index': {
158
+ return (key, value, accumulator) => {
159
+ result = /\[(\d*)]$/.exec(key);
371
160
 
372
- function validateArrayFormatSeparator(value) {
373
- if (typeof value !== 'string' || value.length !== 1) {
374
- throw new TypeError('arrayFormatSeparator must be single character string');
375
- }
376
- }
161
+ key = key.replace(/\[\d*]$/, '');
377
162
 
378
- function encode(value, options) {
379
- if (options.encode) {
380
- return options.strict ? strictUriEncode$1(value) : encodeURIComponent(value);
381
- }
163
+ if (!result) {
164
+ accumulator[key] = value;
165
+ return;
166
+ }
382
167
 
383
- return value;
384
- }
168
+ if (accumulator[key] === undefined) {
169
+ accumulator[key] = {};
170
+ }
385
171
 
386
- function decode(value, options) {
387
- if (options.decode) {
388
- return decodeComponent(value);
172
+ accumulator[key][result[1]] = value;
173
+ };
389
174
  }
390
175
 
391
- return value;
392
- }
393
-
394
- function keysSorter(input) {
395
- if (Array.isArray(input)) {
396
- return input.sort();
397
- }
176
+ case 'bracket': {
177
+ return (key, value, accumulator) => {
178
+ result = /(\[])$/.exec(key);
179
+ key = key.replace(/\[]$/, '');
398
180
 
399
- if (typeof input === 'object') {
400
- return keysSorter(Object.keys(input))
401
- .sort((a, b) => Number(a) - Number(b))
402
- .map(key => input[key]);
403
- }
181
+ if (!result) {
182
+ accumulator[key] = value;
183
+ return;
184
+ }
404
185
 
405
- return input;
406
- }
186
+ if (accumulator[key] === undefined) {
187
+ accumulator[key] = [value];
188
+ return;
189
+ }
407
190
 
408
- function removeHash(input) {
409
- const hashStart = input.indexOf('#');
410
- if (hashStart !== -1) {
411
- input = input.slice(0, hashStart);
191
+ accumulator[key] = [...accumulator[key], value];
192
+ };
412
193
  }
413
194
 
414
- return input;
415
- }
195
+ case 'colon-list-separator': {
196
+ return (key, value, accumulator) => {
197
+ result = /(:list)$/.exec(key);
198
+ key = key.replace(/:list$/, '');
416
199
 
417
- function getHash(url) {
418
- let hash = '';
419
- const hashStart = url.indexOf('#');
420
- if (hashStart !== -1) {
421
- hash = url.slice(hashStart);
422
- }
200
+ if (!result) {
201
+ accumulator[key] = value;
202
+ return;
203
+ }
423
204
 
424
- return hash;
425
- }
205
+ if (accumulator[key] === undefined) {
206
+ accumulator[key] = [value];
207
+ return;
208
+ }
426
209
 
427
- function extract(input) {
428
- input = removeHash(input);
429
- const queryStart = input.indexOf('?');
430
- if (queryStart === -1) {
431
- return '';
210
+ accumulator[key] = [...accumulator[key], value];
211
+ };
432
212
  }
433
213
 
434
- return input.slice(queryStart + 1);
435
- }
436
-
437
- function parseValue(value, options) {
438
- if (options.parseNumbers && !Number.isNaN(Number(value)) && (typeof value === 'string' && value.trim() !== '')) {
439
- value = Number(value);
440
- } else if (options.parseBooleans && value !== null && (value.toLowerCase() === 'true' || value.toLowerCase() === 'false')) {
441
- value = value.toLowerCase() === 'true';
214
+ case 'comma':
215
+ case 'separator': {
216
+ return (key, value, accumulator) => {
217
+ const isArray = typeof value === 'string' && value.includes(options.arrayFormatSeparator);
218
+ const isEncodedArray = (typeof value === 'string' && !isArray && decode(value, options).includes(options.arrayFormatSeparator));
219
+ value = isEncodedArray ? decode(value, options) : value;
220
+ const newValue = isArray || isEncodedArray ? value.split(options.arrayFormatSeparator).map(item => decode(item, options)) : (value === null ? value : decode(value, options));
221
+ accumulator[key] = newValue;
222
+ };
442
223
  }
443
224
 
444
- return value;
445
- }
446
-
447
- function parse(query, options) {
448
- options = Object.assign({
449
- decode: true,
450
- sort: true,
451
- arrayFormat: 'none',
452
- arrayFormatSeparator: ',',
453
- parseNumbers: false,
454
- parseBooleans: false
455
- }, options);
225
+ case 'bracket-separator': {
226
+ return (key, value, accumulator) => {
227
+ const isArray = /(\[])$/.test(key);
228
+ key = key.replace(/\[]$/, '');
456
229
 
457
- validateArrayFormatSeparator(options.arrayFormatSeparator);
230
+ if (!isArray) {
231
+ accumulator[key] = value ? decode(value, options) : value;
232
+ return;
233
+ }
458
234
 
459
- const formatter = parserForArrayFormat(options);
235
+ const arrayValue = value === null
236
+ ? []
237
+ : value.split(options.arrayFormatSeparator).map(item => decode(item, options));
460
238
 
461
- // Create an object with no prototype
462
- const ret = Object.create(null);
239
+ if (accumulator[key] === undefined) {
240
+ accumulator[key] = arrayValue;
241
+ return;
242
+ }
463
243
 
464
- if (typeof query !== 'string') {
465
- return ret;
244
+ accumulator[key] = [...accumulator[key], ...arrayValue];
245
+ };
466
246
  }
467
247
 
468
- query = query.trim().replace(/^[?#&]/, '');
248
+ default: {
249
+ return (key, value, accumulator) => {
250
+ if (accumulator[key] === undefined) {
251
+ accumulator[key] = value;
252
+ return;
253
+ }
469
254
 
470
- if (!query) {
471
- return ret;
255
+ accumulator[key] = [...[accumulator[key]].flat(), value];
256
+ };
472
257
  }
258
+ }
259
+ }
473
260
 
474
- for (const param of query.split('&')) {
475
- if (param === '') {
476
- continue;
477
- }
261
+ function validateArrayFormatSeparator(value) {
262
+ if (typeof value !== 'string' || value.length !== 1) {
263
+ throw new TypeError('arrayFormatSeparator must be single character string');
264
+ }
265
+ }
478
266
 
479
- let [key, value] = splitOnFirst$1(options.decode ? param.replace(/\+/g, ' ') : param, '=');
267
+ function decode(value, options) {
268
+ if (options.decode) {
269
+ return decodeComponent(value);
270
+ }
480
271
 
481
- // Missing `=` should be `null`:
482
- // http://w3.org/TR/2012/WD-url-20120524/#collect-url-parameters
483
- value = value === undefined ? null : ['comma', 'separator', 'bracket-separator'].includes(options.arrayFormat) ? value : decode(value, options);
484
- formatter(decode(key, options), value, ret);
485
- }
272
+ return value;
273
+ }
486
274
 
487
- for (const key of Object.keys(ret)) {
488
- const value = ret[key];
489
- if (typeof value === 'object' && value !== null) {
490
- for (const k of Object.keys(value)) {
491
- value[k] = parseValue(value[k], options);
492
- }
493
- } else {
494
- ret[key] = parseValue(value, options);
495
- }
496
- }
275
+ function keysSorter(input) {
276
+ if (Array.isArray(input)) {
277
+ return input.sort();
278
+ }
497
279
 
498
- if (options.sort === false) {
499
- return ret;
500
- }
280
+ if (typeof input === 'object') {
281
+ return keysSorter(Object.keys(input))
282
+ .sort((a, b) => Number(a) - Number(b))
283
+ .map(key => input[key]);
284
+ }
501
285
 
502
- return (options.sort === true ? Object.keys(ret).sort() : Object.keys(ret).sort(options.sort)).reduce((result, key) => {
503
- const value = ret[key];
504
- if (Boolean(value) && typeof value === 'object' && !Array.isArray(value)) {
505
- // Sort object keys, not values
506
- result[key] = keysSorter(value);
507
- } else {
508
- result[key] = value;
509
- }
286
+ return input;
287
+ }
510
288
 
511
- return result;
512
- }, Object.create(null));
289
+ function parseValue(value, options) {
290
+ if (options.parseNumbers && !Number.isNaN(Number(value)) && (typeof value === 'string' && value.trim() !== '')) {
291
+ value = Number(value);
292
+ } else if (options.parseBooleans && value !== null && (value.toLowerCase() === 'true' || value.toLowerCase() === 'false')) {
293
+ value = value.toLowerCase() === 'true';
513
294
  }
514
295
 
515
- exports.extract = extract;
516
- exports.parse = parse;
517
-
518
- exports.stringify = (object, options) => {
519
- if (!object) {
520
- return '';
521
- }
296
+ return value;
297
+ }
522
298
 
523
- options = Object.assign({
524
- encode: true,
525
- strict: true,
526
- arrayFormat: 'none',
527
- arrayFormatSeparator: ','
528
- }, options);
299
+ function parse(query, options) {
300
+ options = {
301
+ decode: true,
302
+ sort: true,
303
+ arrayFormat: 'none',
304
+ arrayFormatSeparator: ',',
305
+ parseNumbers: false,
306
+ parseBooleans: false,
307
+ ...options,
308
+ };
529
309
 
530
- validateArrayFormatSeparator(options.arrayFormatSeparator);
310
+ validateArrayFormatSeparator(options.arrayFormatSeparator);
531
311
 
532
- const shouldFilter = key => (
533
- (options.skipNull && isNullOrUndefined(object[key])) ||
534
- (options.skipEmptyString && object[key] === '')
535
- );
312
+ const formatter = parserForArrayFormat(options);
536
313
 
537
- const formatter = encoderForArrayFormat(options);
314
+ // Create an object with no prototype
315
+ const returnValue = Object.create(null);
538
316
 
539
- const objectCopy = {};
317
+ if (typeof query !== 'string') {
318
+ return returnValue;
319
+ }
540
320
 
541
- for (const key of Object.keys(object)) {
542
- if (!shouldFilter(key)) {
543
- objectCopy[key] = object[key];
544
- }
545
- }
321
+ query = query.trim().replace(/^[?#&]/, '');
546
322
 
547
- const keys = Object.keys(objectCopy);
323
+ if (!query) {
324
+ return returnValue;
325
+ }
548
326
 
549
- if (options.sort !== false) {
550
- keys.sort(options.sort);
327
+ for (const parameter of query.split('&')) {
328
+ if (parameter === '') {
329
+ continue;
551
330
  }
552
331
 
553
- return keys.map(key => {
554
- const value = object[key];
332
+ let [key, value] = splitOnFirst$1(options.decode ? parameter.replace(/\+/g, ' ') : parameter, '=');
555
333
 
556
- if (value === undefined) {
557
- return '';
558
- }
559
-
560
- if (value === null) {
561
- return encode(key, options);
562
- }
563
-
564
- if (Array.isArray(value)) {
565
- if (value.length === 0 && options.arrayFormat === 'bracket-separator') {
566
- return encode(key, options) + '[]';
567
- }
334
+ // Missing `=` should be `null`:
335
+ // http://w3.org/TR/2012/WD-url-20120524/#collect-url-parameters
336
+ value = value === undefined ? null : (['comma', 'separator', 'bracket-separator'].includes(options.arrayFormat) ? value : decode(value, options));
337
+ formatter(decode(key, options), value, returnValue);
338
+ }
568
339
 
569
- return value
570
- .reduce(formatter(key), [])
571
- .join('&');
340
+ for (const [key, value] of Object.entries(returnValue)) {
341
+ if (typeof value === 'object' && value !== null) {
342
+ for (const [key2, value2] of Object.entries(value)) {
343
+ value[key2] = parseValue(value2, options);
572
344
  }
573
-
574
- return encode(key, options) + '=' + encode(value, options);
575
- }).filter(x => x.length > 0).join('&');
576
- };
577
-
578
- exports.parseUrl = (url, options) => {
579
- options = Object.assign({
580
- decode: true
581
- }, options);
582
-
583
- const [url_, hash] = splitOnFirst$1(url, '#');
584
-
585
- return Object.assign(
586
- {
587
- url: url_.split('?')[0] || '',
588
- query: parse(extract(url), options)
589
- },
590
- options && options.parseFragmentIdentifier && hash ? {fragmentIdentifier: decode(hash, options)} : {}
591
- );
592
- };
593
-
594
- exports.stringifyUrl = (object, options) => {
595
- options = Object.assign({
596
- encode: true,
597
- strict: true,
598
- [encodeFragmentIdentifier]: true
599
- }, options);
600
-
601
- const url = removeHash(object.url).split('?')[0] || '';
602
- const queryFromUrl = exports.extract(object.url);
603
- const parsedQueryFromUrl = exports.parse(queryFromUrl, {sort: false});
604
-
605
- const query = Object.assign(parsedQueryFromUrl, object.query);
606
- let queryString = exports.stringify(query, options);
607
- if (queryString) {
608
- queryString = `?${queryString}`;
609
- }
610
-
611
- let hash = getHash(object.url);
612
- if (object.fragmentIdentifier) {
613
- hash = `#${options[encodeFragmentIdentifier] ? encode(object.fragmentIdentifier, options) : object.fragmentIdentifier}`;
345
+ } else {
346
+ returnValue[key] = parseValue(value, options);
614
347
  }
348
+ }
615
349
 
616
- return `${url}${queryString}${hash}`;
617
- };
618
-
619
- exports.pick = (input, filter, options) => {
620
- options = Object.assign({
621
- parseFragmentIdentifier: true,
622
- [encodeFragmentIdentifier]: false
623
- }, options);
624
-
625
- const {url, query, fragmentIdentifier} = exports.parseUrl(input, options);
626
- return exports.stringifyUrl({
627
- url,
628
- query: filterObject(query, filter),
629
- fragmentIdentifier
630
- }, options);
631
- };
350
+ if (options.sort === false) {
351
+ return returnValue;
352
+ }
632
353
 
633
- exports.exclude = (input, filter, options) => {
634
- const exclusionFilter = Array.isArray(filter) ? key => !filter.includes(key) : (key, value) => !filter(key, value);
354
+ // TODO: Remove the use of `reduce`.
355
+ // eslint-disable-next-line unicorn/no-array-reduce
356
+ return (options.sort === true ? Object.keys(returnValue).sort() : Object.keys(returnValue).sort(options.sort)).reduce((result, key) => {
357
+ const value = returnValue[key];
358
+ if (Boolean(value) && typeof value === 'object' && !Array.isArray(value)) {
359
+ // Sort object keys, not values
360
+ result[key] = keysSorter(value);
361
+ } else {
362
+ result[key] = value;
363
+ }
635
364
 
636
- return exports.pick(input, exclusionFilter, options);
637
- };
638
- } (queryString));
365
+ return result;
366
+ }, Object.create(null));
367
+ }
639
368
 
640
369
  const authorizationEndpoint = 'https://github.com/login/oauth/authorize';
641
370
  const scope = 'read:user';
@@ -675,6 +404,14 @@ const defaultMetadata = {
675
404
  required: true,
676
405
  placeholder: '<client-secret>',
677
406
  },
407
+ {
408
+ key: 'scope',
409
+ type: ConnectorConfigFormItemType.Text,
410
+ label: 'Scope',
411
+ required: false,
412
+ placeholder: '<scope>',
413
+ description: "The `scope` determines permissions granted by the user's authorization. If you are not sure what to enter, do not worry, just leave it blank.",
414
+ },
678
415
  ],
679
416
  };
680
417
  const defaultTimeout = 5000;
@@ -682,6 +419,7 @@ const defaultTimeout = 5000;
682
419
  const githubConfigGuard = z.object({
683
420
  clientId: z.string(),
684
421
  clientSecret: z.string(),
422
+ scope: z.string().optional(),
685
423
  });
686
424
  const accessTokenResponseGuard = z.object({
687
425
  access_token: z.string(),
@@ -708,7 +446,7 @@ const getAuthorizationUri = (getConfig) => async ({ state, redirectUri }) => {
708
446
  client_id: config.clientId,
709
447
  redirect_uri: redirectUri,
710
448
  state,
711
- scope, // Only support fixed scope for v1.
449
+ scope: config.scope ?? scope,
712
450
  });
713
451
  return `${authorizationEndpoint}?${queryParameters.toString()}`;
714
452
  };
@@ -743,7 +481,7 @@ const getAccessToken = async (config, codeObject) => {
743
481
  },
744
482
  timeout: { request: defaultTimeout },
745
483
  });
746
- const result = accessTokenResponseGuard.safeParse(queryString.parse(httpResponse.body));
484
+ const result = accessTokenResponseGuard.safeParse(parse(httpResponse.body));
747
485
  if (!result.success) {
748
486
  throw new ConnectorError(ConnectorErrorCodes.InvalidResponse, result.error);
749
487
  }
package/lib/types.d.ts CHANGED
@@ -2,12 +2,15 @@ import { z } from 'zod';
2
2
  export declare const githubConfigGuard: z.ZodObject<{
3
3
  clientId: z.ZodString;
4
4
  clientSecret: z.ZodString;
5
+ scope: z.ZodOptional<z.ZodString>;
5
6
  }, "strip", z.ZodTypeAny, {
6
7
  clientId: string;
7
8
  clientSecret: string;
9
+ scope?: string | undefined;
8
10
  }, {
9
11
  clientId: string;
10
12
  clientSecret: string;
13
+ scope?: string | undefined;
11
14
  }>;
12
15
  export type GithubConfig = z.infer<typeof githubConfigGuard>;
13
16
  export declare const accessTokenResponseGuard: z.ZodObject<{
@@ -15,12 +18,12 @@ export declare const accessTokenResponseGuard: z.ZodObject<{
15
18
  scope: z.ZodString;
16
19
  token_type: z.ZodString;
17
20
  }, "strip", z.ZodTypeAny, {
18
- access_token: string;
19
21
  scope: string;
22
+ access_token: string;
20
23
  token_type: string;
21
24
  }, {
22
- access_token: string;
23
25
  scope: string;
26
+ access_token: string;
24
27
  token_type: string;
25
28
  }>;
26
29
  export type AccessTokenResponse = z.infer<typeof accessTokenResponseGuard>;
@@ -30,15 +33,15 @@ export declare const userInfoResponseGuard: z.ZodObject<{
30
33
  email: z.ZodNullable<z.ZodOptional<z.ZodString>>;
31
34
  name: z.ZodNullable<z.ZodOptional<z.ZodString>>;
32
35
  }, "strip", z.ZodTypeAny, {
36
+ id: number;
33
37
  avatar_url?: string | null | undefined;
34
38
  email?: string | null | undefined;
35
39
  name?: string | null | undefined;
36
- id: number;
37
40
  }, {
41
+ id: number;
38
42
  avatar_url?: string | null | undefined;
39
43
  email?: string | null | undefined;
40
44
  name?: string | null | undefined;
41
- id: number;
42
45
  }>;
43
46
  export type UserInfoResponse = z.infer<typeof userInfoResponseGuard>;
44
47
  export declare const authorizationCallbackErrorGuard: z.ZodObject<{
package/package.json CHANGED
@@ -1,4 +1,12 @@
1
1
  {
2
+ "name": "@logto/connector-github",
3
+ "version": "1.1.1",
4
+ "description": "Github web connector implementation.",
5
+ "author": "Silverhand Inc. <contact@silverhand.io>",
6
+ "dependencies": {
7
+ "@logto/connector-kit": "^2.0.0",
8
+ "query-string": "^8.0.0"
9
+ },
2
10
  "main": "./lib/index.js",
3
11
  "module": "./lib/index.js",
4
12
  "exports": "./lib/index.js",
@@ -10,61 +18,34 @@
10
18
  "logo.svg",
11
19
  "logo-dark.svg"
12
20
  ],
13
- "dependencies": {
14
- "@logto/connector-kit": "^1.0.0",
15
- "@silverhand/essentials": "2.1.0",
16
- "got": "^12.5.3",
17
- "snakecase-keys": "^5.1.0",
18
- "zod": "^3.20.2",
19
- "query-string": "^7.0.1"
20
- },
21
- "devDependencies": {
22
- "@jest/types": "^29.3.1",
23
- "@rollup/plugin-commonjs": "^24.0.0",
24
- "@rollup/plugin-json": "^6.0.0",
25
- "@rollup/plugin-node-resolve": "^15.0.1",
26
- "@rollup/plugin-typescript": "^10.0.1",
27
- "@silverhand/eslint-config": "1.3.0",
28
- "@silverhand/ts-config": "1.2.1",
29
- "@silverhand/jest-config": "1.2.2",
30
- "@types/jest": "^29.2.4",
31
- "@types/node": "^16.3.1",
32
- "@types/supertest": "^2.0.11",
33
- "eslint": "^8.21.0",
34
- "jest": "^29.3.1",
35
- "jest-matcher-specific-error": "^1.0.0",
36
- "lint-staged": "^13.0.0",
37
- "nock": "^13.2.2",
38
- "prettier": "^2.8.1",
39
- "rollup": "^3.8.0",
40
- "rollup-plugin-summary": "^2.0.0",
41
- "supertest": "^6.2.2",
42
- "typescript": "^4.9.4"
43
- },
44
21
  "engines": {
45
- "node": "^16.13.0 || ^18.12.0"
22
+ "node": "^18.12.0"
46
23
  },
47
24
  "eslintConfig": {
48
- "extends": "@silverhand"
25
+ "extends": "@silverhand",
26
+ "settings": {
27
+ "import/core-modules": [
28
+ "@silverhand/essentials",
29
+ "got",
30
+ "nock",
31
+ "snakecase-keys",
32
+ "zod"
33
+ ]
34
+ }
49
35
  },
50
36
  "prettier": "@silverhand/eslint-config/.prettierrc",
51
37
  "publishConfig": {
52
38
  "access": "public"
53
39
  },
54
- "name": "@logto/connector-github",
55
- "version": "1.0.0",
56
- "description": "Github web connector implementation.",
57
- "author": "Silverhand Inc. <contact@silverhand.io>",
58
40
  "scripts": {
59
- "package:sync": "cd ../../ && pnpm package:sync",
60
- "package:update": "cd ../../ && pnpm package:update",
61
41
  "precommit": "lint-staged",
62
- "build:test": "rm -rf lib/ && tsc -p tsconfig.test.json",
42
+ "build:test": "rm -rf lib/ && tsc -p tsconfig.test.json --sourcemap",
63
43
  "build": "rm -rf lib/ && tsc -p tsconfig.build.json --noEmit && rollup -c",
64
44
  "dev": "tsc -p tsconfig.build.json --watch --preserveWatchOutput --incremental",
65
45
  "lint": "eslint --ext .ts src",
66
46
  "lint:report": "pnpm lint --format json --output-file report.json",
67
- "test": "pnpm build:test && NODE_OPTIONS=--experimental-vm-modules jest",
68
- "test:coverage": "pnpm run test --coverage --silent"
47
+ "test:only": "NODE_OPTIONS=--experimental-vm-modules jest",
48
+ "test": "pnpm build:test && pnpm test:only",
49
+ "test:ci": "pnpm test:only --silent --coverage"
69
50
  }
70
51
  }