Yet another accomplishment: brick-list-search

[amano-kenji]

I just published https://hackage.haskell.org/package/brick-list-search which allows anyone to easily search forward or backward for a specific kind of element.

For example, you can skip list separators when you move up or down by searching for a list item that is not a separator.

Do you like it? Do you see yourself using it?

[jtdaugherty]

Congrats on a second release! I looked at the code and I noticed that it doesn't use listFindBy which might make some of your functions even more straightforward to implement. Did you consider using that function from the List module?

[amano-kenji]

I forgot about listFindBy. I just read listFindBy.

• It uses toList. I don't know how fast or slow it is.
• It adds 1 to the current index. In brick-list-search, adding 1 to the current index depends on whether the search includes the current index.
• brick-list-search either searches forward or backward for the first element that passes a test. listFindBy only searches forward in two partitions created by splitting at the current index.

[amano-kenji]

For searching forward or backward, I created Searchable type class.

[jtdaugherty]

Okay, cool. Thanks for the context.

[amano-kenji]

By the way, is there a way to scroll to the bottom or the top even if the current item is not at the bottom or the top?

If I scroll down and up, the first separator at the top is not shown.

[jtdaugherty]

By the way, is there a way to scroll to the bottom or the top even if the current item is not at the bottom or the top?

Yes; to do that you'll need to scroll the list's viewport in your event handler. You'll need to use vScrollToEnd.

[amano-kenji]

Okay.