FindAll recursively returns all matching nodes.
(predicate func(task Task) bool)
| 347 | |
| 348 | // FindAll recursively returns all matching nodes. |
| 349 | func (t *taskListImpl) FindAll(predicate func(task Task) bool) []Task { |
| 350 | return findAll(t, predicate) |
| 351 | } |
| 352 | |
| 353 | func findAll(node TaskNode, predicate func(task Task) bool) []Task { |
| 354 | out := []Task{} |