Including all the matching node's children in the search result about react-arborist HOT 5 OPEN

Yeah, I should at least put some docs up on how to perform these types of filtering. This has come up three times now.

from react-arborist.

Just realized this is a duplicate of #111 - though that one is already closed, so maybe it's worth to keep this discussion open. I did not try creating a matcher using the searchMatch option. If I'm able to, might be something to document here.

from react-arborist.

I've found a solution that works, potentially janky though:

searchMatch={(node, searchTerm) => {
  // If the node itself matches the search term
  if (searchMatch(node, searchTerm)) {
    trueMatches.add(node.id)
    return true
  }
  // If the node is the child of a matching element
  if (trueMatches.has(node.parent?.id)) {
    return true
  }
  // TODO: Grandchildren?
  return false
}}

I have some complicated logic for determining a match, so I extracted it into a function called searchMatch. If the node itself matches, I add its ID to a set, and return true. If the node itself doesn't match, but it's parent's ID is in the set, then it's the child of a match, and I return true.

This implementation only includes the first generation (which is fine for my application), but recursion should be able to find a child at any depth 👍

The inclusion of the set slightly complicates things too, like you'll have to clear your set every time you clear your search term, etc.

from react-arborist.

Hi, I had figured out a solution to do this, had posted at #177. You may consider the solution and modify yourself.

from react-arborist.

@lsfgrd Hi dear friend.
Can you help me? According to the tree structure that you have asked and placed in your question, you have used a check box. Please guide me with example how can I manage selected by putting check box?
I have opened a topic about the checkbox in the link below, please guide me there.

#190

from react-arborist.