MCPcopy Create free account
hub / github.com/TanStack/query / visit

Function visit

packages/query-devtools/src/explorerSearch.ts:163–197  ·  view source on GitHub ↗

* Visits one original path with its current ancestors. * @param value - The entry value. * @param label - The entry label; absent for the synthetic root. * @param accessor - Whether reading the entry would invoke a getter. * @param depth - The current nesting depth. * @returns The ent

(
    value: unknown,
    label?: string,
    accessor = false,
    depth = 0,
  )

Source from the content-addressed store, hash-verified

161 * @returns The entry's match metadata.
162 */
163 function visit(
164 value: unknown,
165 label?: string,
166 accessor = false,
167 depth = 0,
168 ): SearchMatch {
169 const labelMatch = label?.toLowerCase().includes(term) ?? false
170 const text = accessor ? undefined : primitiveText(value)
171 const valueMatch = text?.toLowerCase().includes(term) ?? false
172 const children = new Map<unknown, SearchMatch>()
173 const match: SearchMatch = {
174 label: labelMatch,
175 value: valueMatch,
176 hasMatch: labelMatch || valueMatch,
177 kind: accessor ? 'accessor' : text !== undefined ? 'value' : 'opaque',
178 children,
179 }
180 if (accessor || text !== undefined) return match
181 if (depth > 500) return match
182 if (ancestors.has(value)) {
183 match.kind = 'circular'
184 return match
185 }
186 const entries = searchEntries(value)
187 if (!entries) return match
188 match.kind = 'branch'
189 ancestors.add(value)
190 for (const entry of entries) {
191 const child = visit(entry.value, entry.label, entry.accessor, depth + 1)
192 children.set(entry.key, child)
193 match.hasMatch ||= child.hasMatch
194 }
195 ancestors.delete(value)
196 return match
197 }
198 return visit(rootValue)
199}

Callers 1

searchExplorerFunction · 0.70

Calls 3

primitiveTextFunction · 0.85
searchEntriesFunction · 0.85
addMethod · 0.45

Tested by

no test coverage detected