{"action":"closed","issue":{"url":"https://api.github.com/repos/Geal/nom/issues/323","repository_url":"https://api.github.com/repos/Geal/nom","labels_url":"https://api.github.com/repos/Geal/nom/issues/323/labels{/name}","comments_url":"https://api.github.com/repos/Geal/nom/issues/323/comments","events_url":"https://api.github.com/repos/Geal/nom/issues/323/events","html_url":"https://github.com/Geal/nom/issues/323","id":181823564,"number":323,"title":"nom 2.0 tracking issue","user":{"login":"Geal","id":119296,"avatar_url":"https://avatars.githubusercontent.com/u/119296?v=3","gravatar_id":"","url":"https://api.github.com/users/Geal","html_url":"https://github.com/Geal","followers_url":"https://api.github.com/users/Geal/followers","following_url":"https://api.github.com/users/Geal/following{/other_user}","gists_url":"https://api.github.com/users/Geal/gists{/gist_id}","starred_url":"https://api.github.com/users/Geal/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Geal/subscriptions","organizations_url":"https://api.github.com/users/Geal/orgs","repos_url":"https://api.github.com/users/Geal/repos","events_url":"https://api.github.com/users/Geal/events{/privacy}","received_events_url":"https://api.github.com/users/Geal/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":5,"created_at":"2016-10-08T12:29:33Z","updated_at":"2016-11-25T16:16:32Z","closed_at":"2016-11-25T16:16:32Z","body":"nom 2.0 is happening soon-ish, most of the work is done:\r\n- a compilation feature to deactivate error management and replace it with a simpler, faster version\r\n- there is now a list of traits to implement to get a new input type working with nom. Consequences:\r\n  - all of the `*_s` combinators are now using the byte combinators (there will be less type inference errors now)\r\n  - there's an example arithmetic expression parser using the `BlockBuf` structure from the \"bytes\" crate\r\n- #34 `ws` combinator to transform a normal parser into a parser for a whitespace separated format\r\n- `do_parse` replacement for `chain` (`chain` is not going away now, probably the following release). The syntax is a bit cleaner, and much simpler (no `mut` nor `?`).\r\n- #40 permutation combinator: successful if all of its child parsers were successful, independently of their order\r\n- `to_result` method for `IResult`\r\n- #169 _breaking change_ the `error` macro is removed, there will be no more conflict with the \"log\" crate\r\n\r\nThis is a lot of new features, and there will be some breaking changes, but I want to keep them to a minimum, so I need people to test their current nom parsers with the new code and report any issues.\r\n\r\nCode and bugfixes we need to get it ready for a release:\r\n- [x] #325 provide an example (in FAQ or elsewhere) of a parser fo floating point numbers using `digit` and `recognize`. This is something people often struggle with\r\n- [x] #310  Consistent method naming for AsChar\r\n- [x] #140 _breaking change_ use an enum instead of a boolean to indicate endianness\r\n- [x] #217 #226 _breaking change_ basic parsers like `alpha` and `digit` should return `Incomplete` instead of an error on empty inputs\r\n- [x] #252 #285 #307 #313 _breaking change_ make a single, definite version of the end of line parser. Basic token parsing is normally something that should be left to the user, but there are already a few issues and PR for this, and everybody has their own idea, let's fix this once and for all\r\n- [x] _breaking change_ simple error management is now the default (as of 6f36000 ). Verbose error management can be reactivated with the `verbose-errors` compilation feature\r\n- [x] #320 Implement whitespace parsing for do_parse and permutation\r\n- [x] #321 documentation for do_parse, permutation and whitespace parsing\r\n- [x] #322 documentation for simple VS verbose error management\r\n- [x] #301 add `many_till`\r\n- [x] #324 provide an example (in FAQ or elsewhere) or combinator for parsing a separated list of things until the end of data\r\n- [x] #96,#372,#373,#374,#375 cleaner version of length/value and tag/length/value combinators\r\n- [x] #369, #370 fix char indexing for `str` in tag\r\n- [x] #328 remove usages of `chain` from documentation and examples (PR at #341, merge just before release to avoid confusion in the README)\r\n- [x] #329 Document breaking changes and upgrade path\r\n\r\nNice to have (by which I mean I reaaaaally want to get those, but it could get into 2.1):\r\n- [x] #326 provide an example for parsing a simple programming language, now that space separated format are easier to deal with\r\n- [ ] #251 #289 #339 case insensitive tag for &str and &[u8]. Done in 6f6f80f3a008 but the `&str` version does not use proper case folding (cf commit  message)\r\n- [ ] #300 test that `escaped_*` work with `&str`\r\n- [ ] #327 provide an example for parsing indented languages\r\n- [ ] #309 provide an example for a parser tracking line numbers\r\n- [ ] #144 #145 provide an example for an input type that understands the difference between the end of current data and EOF\r\n- [ ] #337 more documentation examples. There's already a lot of code using those, it should be easy to extract and clean it up\r\n"}}
{"actor":{"display_login":"Geal"}}