I have spent a few days trying to figure out a way to recursively search a category entity having parent and child identifiers; below is a sample (ID - Category - Parent ID)
For clarification, I can create a basic recursive search, however, it is limited to the depth of parent/child relationships (per the screenshot).
My objective, have a recursive search that is not limited to how deep the parent/child relationship goes and starts with a simple text search and find all branches of parent/child relationships based on the initial search. The results, category IDs, will be used to join on another aggregate, items entity, yielding all items having a category found in the list.
You need to make your search for the child categories an action that takes the parent ids as a parameter.
Run the first query and call the action, if there are no results exit. If there are results, append them to a list and call the action again, this time with the parents being the results you just got.
the algorithms (recurse) :
1. find the children of a parent
2. get the children of the children (doRecurse)
3. and the children becomes the parents
4. call the nomor 2 again
*********** here is the doRecurseAll:
*********** here is the doRecurse function (get children of the children):
========== here is the signature of the server actions:
========= here is the entity: