{"action":"created","issue":{"url":"https://api.github.com/repos/google/redgrep/issues/1","repository_url":"https://api.github.com/repos/google/redgrep","labels_url":"https://api.github.com/repos/google/redgrep/issues/1/labels{/name}","comments_url":"https://api.github.com/repos/google/redgrep/issues/1/comments","events_url":"https://api.github.com/repos/google/redgrep/issues/1/events","html_url":"https://github.com/google/redgrep/issues/1","id":183127642,"number":1,"title":"Zero width patterns","user":{"login":"rgrinberg","id":139003,"avatar_url":"https://avatars.githubusercontent.com/u/139003?v=3","gravatar_id":"","url":"https://api.github.com/users/rgrinberg","html_url":"https://github.com/rgrinberg","followers_url":"https://api.github.com/users/rgrinberg/followers","following_url":"https://api.github.com/users/rgrinberg/following{/other_user}","gists_url":"https://api.github.com/users/rgrinberg/gists{/gist_id}","starred_url":"https://api.github.com/users/rgrinberg/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/rgrinberg/subscriptions","organizations_url":"https://api.github.com/users/rgrinberg/orgs","repos_url":"https://api.github.com/users/rgrinberg/repos","events_url":"https://api.github.com/users/rgrinberg/events{/privacy}","received_events_url":"https://api.github.com/users/rgrinberg/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":1,"created_at":"2016-10-14T19:05:59Z","updated_at":"2016-10-15T03:08:13Z","closed_at":"2016-10-15T03:08:13Z","body":"E.g. stuff like:\r\n\r\n```\r\npat(?=xxx)\r\npat(?!yyy)\r\n```\r\n\r\nI assume these should be possibly with the current DFA engine with some restrictions on the patterns (e.g. width must be bounded, no grouping) but correct me I'm wrong."},"comment":{"url":"https://api.github.com/repos/google/redgrep/issues/comments/253958923","html_url":"https://github.com/google/redgrep/issues/1#issuecomment-253958923","issue_url":"https://api.github.com/repos/google/redgrep/issues/1","id":253958923,"user":{"login":"junyer","id":3593753,"avatar_url":"https://avatars.githubusercontent.com/u/3593753?v=3","gravatar_id":"","url":"https://api.github.com/users/junyer","html_url":"https://github.com/junyer","followers_url":"https://api.github.com/users/junyer/followers","following_url":"https://api.github.com/users/junyer/following{/other_user}","gists_url":"https://api.github.com/users/junyer/gists{/gist_id}","starred_url":"https://api.github.com/users/junyer/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/junyer/subscriptions","organizations_url":"https://api.github.com/users/junyer/orgs","repos_url":"https://api.github.com/users/junyer/repos","events_url":"https://api.github.com/users/junyer/events{/privacy}","received_events_url":"https://api.github.com/users/junyer/received_events","type":"User","site_admin":false},"created_at":"2016-10-15T03:08:13Z","updated_at":"2016-10-15T03:08:13Z","body":"As long as you can express the requirements in terms of sets of strings, you can use conjunction and complement to achieve a similar effect. redgrep actually implements `[^abc]` as `![abc]&.`, for example, because it's the intersection of the set of strings that are not `a`, `b` or `c` and the set of strings that are single characters."}}
{"actor":{"display_login":"junyer"}}