{"action":"opened","issue":{"url":"https://api.github.com/repos/BramVermaas/tree/issues/9","repository_url":"https://api.github.com/repos/BramVermaas/tree","labels_url":"https://api.github.com/repos/BramVermaas/tree/issues/9/labels{/name}","comments_url":"https://api.github.com/repos/BramVermaas/tree/issues/9/comments","events_url":"https://api.github.com/repos/BramVermaas/tree/issues/9/events","html_url":"https://github.com/BramVermaas/tree/issues/9","id":146905476,"number":9,"title":"Usage note filter function and how to use it","user":{"login":"BramVermaas","id":9746387,"avatar_url":"https://avatars.githubusercontent.com/u/9746387?v=3","gravatar_id":"","url":"https://api.github.com/users/BramVermaas","html_url":"https://github.com/BramVermaas","followers_url":"https://api.github.com/users/BramVermaas/followers","following_url":"https://api.github.com/users/BramVermaas/following{/other_user}","gists_url":"https://api.github.com/users/BramVermaas/gists{/gist_id}","starred_url":"https://api.github.com/users/BramVermaas/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/BramVermaas/subscriptions","organizations_url":"https://api.github.com/users/BramVermaas/orgs","repos_url":"https://api.github.com/users/BramVermaas/repos","events_url":"https://api.github.com/users/BramVermaas/events{/privacy}","received_events_url":"https://api.github.com/users/BramVermaas/received_events","type":"User","site_admin":false},"labels":[{"url":"https://api.github.com/repos/BramVermaas/tree/labels/documentation","name":"documentation","color":"fbca04"}],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2016-04-08T11:42:47Z","updated_at":"2016-04-08T11:42:47Z","closed_at":null,"body":"# Different traversal opperators (traversers and filters):\r\n    # node_traverser:       children / descendants / ancestors\r\n    # ordered_traverser:    width / depth\r\n    #\r\n    # name_filter:          'koos' / 'herbert' / ['koos', 'herbert'] / ...\r\n    #       TreeIterator(self, 'children', name = 'koos')\r\n    # rank_filter:          root / leaf / branch\r\n    #       TreeIterator(self, 'descendants', rank = 'leaf')\r\n    # depth_filter:         1 / 2 / 3 / [1, 2, 4]\r\n    #       TreeIterator(self, 'descendats', depth = 2)\r\n    # height_filter:        1 / 2 / 3 / [1, 2, 4]\r\n    #       TreeIterator(self, 'ancestors', height = 3)\r\n    # distance_filter:      1 / 2 / 3 / [1, 2, 4]\r\n    #       TreeIterator(self, 'ancestors', distance = 4)\r\n    # exclude_filter:       Tree / [Tree1, Tree2]\r\n    # relative_path_filter: ['child_name', 'grandchild_name'] /\r\n    #                       [ ['child_name1', 'grandchild_name1'], ['child_name2', 'grandchild_name2'] ]\r\n    # absolute_path_filter: ['root', 'child1'] /\r\n    #                       [ ['root', 'child1'], ['root', 'child2'] ]\r\n    # predicate_filter:     lambda a: '_' in a.name\r\n    # set_filter            ['union', Tree] / ex: [1,2,3] [1,2,4] >> [1,2,3,4]\r\n    #                       ['self-other', Tree] / ex: [1,2,3] [1,2,4] >> [3]\r\n    #                       ['other-self', Tree] / ex: [1,2,3] [1,2,4] >> [4]\r\n    #                       ['intersection', Tree] / ex: [1,2,3] [1,2,4] >> [1,2]\r\n"}}