@@ -48,7 +48,7 @@ export type VisitorKeyMap<KindToNode> = $ObjMap<
48
48
< T > (T) => $ReadOnlyArray < $Keys < T >> ,
49
49
> ;
50
50
51
- export const QueryDocumentKeys = {
51
+ export const QueryDocumentKeys : VisitorKeyMap < ASTKindToNode > = {
52
52
Name : [ ] ,
53
53
54
54
Document : [ 'definitions' ] ,
@@ -135,7 +135,7 @@ export const QueryDocumentKeys = {
135
135
InputObjectTypeExtension : [ 'name' , 'directives' , 'fields' ] ,
136
136
} ;
137
137
138
- export const BREAK = Object . freeze ( { } ) ;
138
+ export const BREAK : { ... } = Object . freeze ( { } ) ;
139
139
140
140
/**
141
141
* visit() will walk through an AST using a depth first traversal, calling
@@ -363,7 +363,7 @@ export function visitInParallel(
363
363
return {
364
364
enter ( node ) {
365
365
for ( let i = 0 ; i < visitors . length ; i ++ ) {
366
- if ( ! skipping [ i ] ) {
366
+ if ( skipping [ i ] == null ) {
367
367
const fn = getVisitFn ( visitors [ i ] , node . kind , /* isLeaving */ false ) ;
368
368
if ( fn ) {
369
369
const result = fn . apply ( visitors [ i ] , arguments ) ;
@@ -380,7 +380,7 @@ export function visitInParallel(
380
380
} ,
381
381
leave ( node ) {
382
382
for ( let i = 0 ; i < visitors . length ; i ++ ) {
383
- if ( ! skipping [ i ] ) {
383
+ if ( skipping [ i ] == null ) {
384
384
const fn = getVisitFn ( visitors [ i ] , node . kind , /* isLeaving */ true ) ;
385
385
if ( fn ) {
386
386
const result = fn . apply ( visitors [ i ] , arguments ) ;
0 commit comments