Rather than walking the entire object to get all keys up front, consider implementing the search logic using a generator function, where each yield returns a [key, value] entry (similar to Object.entries()). This will allow callers to control how many results they get and at what velocity. (E.g. if caller only needs the first result, there's no reason to crawl the whole object. E.g. if caller wants to paginate results or pause scanning while waiting for user input or whatever). 'Will be a much more useful and performant.

[wise-introvert]

No description provided.