in other news, I just released a (consider it beta) NFT-SS2 that includes lazy search result processing (i.e. it empowers the elegant style of search result processing like NFT-SS1 does) So processing an arbitrary number of search results uses the same code. For example, this code automatically runs until either all results are processed or we're out of governance, and reads like it works, no?:

Seq(LazySearch.load('730'))
      .takeWhile(governanceRemains)
      .map(nsSearchResult2obj)
      .forEach( result => log.debug('result', result))

It automatically pages through results and performs all the chained operations lazily. As such it conserves both memory and processing.