payload: {"action":"opened","issue":{"url":"https://api.github.com/repos/STEllAR-GROUP/hpx/issues/3646","repository_url":"https://api.github.com/repos/STEllAR-GROUP/hpx","labels_url":"https://api.github.com/repos/STEllAR-GROUP/hpx/issues/3646/labels{/name}","comments_url":"https://api.github.com/repos/STEllAR-GROUP/hpx/issues/3646/comments","events_url":"https://api.github.com/repos/STEllAR-GROUP/hpx/issues/3646/events","html_url":"https://github.com/STEllAR-GROUP/hpx/issues/3646","id":405916025,"node_id":"MDU6SXNzdWU0MDU5MTYwMjU=","number":3646,"title":"Parallel algorithms should accept iterator/sentinel pairs","user":{"login":"hkaiser","id":568063,"node_id":"MDQ6VXNlcjU2ODA2Mw==","avatar_url":"https://avatars1.githubusercontent.com/u/568063?v=4","gravatar_id":"","url":"https://api.github.com/users/hkaiser","html_url":"https://github.com/hkaiser","followers_url":"https://api.github.com/users/hkaiser/followers","following_url":"https://api.github.com/users/hkaiser/following{/other_user}","gists_url":"https://api.github.com/users/hkaiser/gists{/gist_id}","starred_url":"https://api.github.com/users/hkaiser/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/hkaiser/subscriptions","organizations_url":"https://api.github.com/users/hkaiser/orgs","repos_url":"https://api.github.com/users/hkaiser/repos","events_url":"https://api.github.com/users/hkaiser/events{/privacy}","received_events_url":"https://api.github.com/users/hkaiser/received_events","type":"User","site_admin":false},"labels":[{"id":145781965,"node_id":"MDU6TGFiZWwxNDU3ODE5NjU=","url":"https://api.github.com/repos/STEllAR-GROUP/hpx/labels/category:%20algorithms","name":"category: algorithms","color":"02e10c","default":false},{"id":12923282,"node_id":"MDU6TGFiZWwxMjkyMzI4Mg==","url":"https://api.github.com/repos/STEllAR-GROUP/hpx/labels/type:%20compatibility%20issue","name":"type: compatibility issue","color":"e10c02","default":false},{"id":108836426,"node_id":"MDU6TGFiZWwxMDg4MzY0MjY=","url":"https://api.github.com/repos/STEllAR-GROUP/hpx/labels/type:%20feature%20request","name":"type: feature request","color":"e11d21","default":false}],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2019-02-01T23:44:11Z","updated_at":"2019-02-01T23:44:11Z","closed_at":null,"author_association":"MEMBER","body":"Our parallel algorithms currently expect for the begin/end iterator pairs to be of the same type. This is an unnecessary limitation. We should relax that. \r\n\r\nHere is the list of algorithms that need to be adapted:\r\n- [ ] `adjacent_difference` `inner_product`\r\n- [ ] `adjacent_find`\r\n- [ ] `all_of` `any_of` `none_of`\r\n- [ ] `copy` `copy_if` `copy_n` `move`\r\n- [ ] `count` `count_if`\r\n- [ ] `equal` `mismatch` \r\n- [ ] `exclusive_scan` `inclusive_scan` \r\n- [ ] `reduce` \r\n- [ ] `transform` \r\n- [ ] `fill` `fill_n`\r\n- [ ] `find` `find_end` `find_first_of` `find_if` `find_if_not`\r\n- [ ] `for_each` `for_each_n`, `for_loop`, `for_loop_strided`\r\n- [ ] `generate` `generate_n`\r\n- [ ] `is_heap` `is_heap_until`\r\n- [ ] `is_partitioned` `is_sorted` `is_sorted_until` \r\n- [ ] `lexicographical_compare` \r\n- [ ] `max_element` `min_element` `minmax_element` \r\n- [ ] `sort` `partial_sort` `partial_sort_copy` `nth_element` `stable_sort`\r\n- [ ] `partition` `partition_copy`, `stable_partition` \r\n- [ ] `remove` `remove_if` `remove_copy` `remove_copy_if`\r\n- [ ] `replace` `replace_copy` `replace_copy_if` `replace_if`\r\n- [ ] `reverse` `reverse_copy`\r\n- [ ] `rotate` `rotate_copy`\r\n- [ ] `search` `search_n` \r\n- [ ] `set_difference` `set_intersection` `set_symmetric_difference` `set_union` `includes` \r\n- [ ] `inplace_merge` \r\n- [ ] `swap_ranges`\r\n- [ ] `uninitialized_copy` `uninitialized_copy_n` \r\n- [ ] `uninitialized_fill` `uninitialized_fill_n` \r\n- [ ] `unique` `unique_copy` \r\n- [ ] `transform_reduce` `transform_exclusive_scan` `transform_inclusive_scan` \r\n"}}
other: {"actor":{"display_login":"hkaiser"}}