bump version to 2.0

dten · Nov 25, 2016 · 18c4a2d · 18c4a2d
1 parent ad90462
commit 18c4a2d
Show file tree

Hide file tree

Showing 4 changed files with 8 additions and 8 deletions.
diff --git a/CHANGELOG.md b/CHANGELOG.md
@@ -4,7 +4,7 @@
 
 ### Changed
 
-## 2.0 - ??
+## 2.0 - 2016-11-25
 
 The 2.0 release is one of the biggest yet. It was a good opportunity to clean up some badly named combinators and fix invalid behaviours.
 

diff --git a/Cargo.toml b/Cargo.toml
@@ -1,7 +1,7 @@
 [package]
 
 name = "nom"
-version = "1.2.4"
+version = "2.0.0"
 authors = [ "[email protected]" ]
 description = "A byte-oriented, zero-copy, parser combinators library"
 license = "MIT"
@@ -34,7 +34,7 @@ version = "^0.1.56"
 optional = true
 
 [dependencies.lazy_static]
-version = "^0.2.1"
+version = "^0.2.2"
 optional = true
 
 [dev-dependencies.bytes]

diff --git a/LICENSE b/LICENSE
@@ -1,4 +1,4 @@
-Copyright (c) 2015 Geoffroy Couprie
+Copyright (c) 2015-2016 Geoffroy Couprie
 
 Permission is hereby granted, free of charge, to any person obtaining
 a copy of this software and associated documentation files (the

diff --git a/README.md b/README.md
@@ -43,7 +43,7 @@ nom is available on [crates.io](https://crates.io/crates/nom) and can be include
 
 ```toml
 [dependencies]
-nom = "^1.2.4"
+nom = "^2.0"
 ```
 
 Then include it in your code like this:
@@ -53,20 +53,20 @@ Then include it in your code like this:
 extern crate nom;
 ```
 
-**NOTE: if you have existing code using nom below the 1.0 version, please take a look at the [upgrading documentation](https://github.com/Geal/nom/wiki/Upgrading-to-nom-1.0) to
-handle the breaking changes.**
+**NOTE: if you have existing code using nom below the 2.0 version, please take a look at the [upgrade documentation](https://github.com/Geal/nom/blob/master/doc/upgrading_to_nom_2.md) to handle the breaking changes.**
 
 There are a few compilation features:
 
 * `core`: enables `no_std` builds
 * `regexp`: enables regular expression parsers with the `regex` crate
 * `regexp_macros`: enables regular expression parsers with the `regex` and `regex_macros` crates. Regular expressions can be defined at compile time, but it requires a nightly version of rustc
+* `verbose-errors`: accumulate error codes and input positions as you backtrack through the parser tree. This gives you precise information about which part of the parser was affected by which part of the input
 
 You can activate those features like this:
 
 ```toml
 [dependencies.nom]
-version = "^1.2.3"
+version = "^2.0"
 features = ["regexp"]
 ```