diff --git a/extra/PERF.md b/extra/PERF.md
index 2583e6076..5a6e52e32 100644
--- a/extra/PERF.md
+++ b/extra/PERF.md
@@ -61,6 +61,7 @@ and Scalaz classes `\/` and `\&/`. For all other types, you'll need to teach it
 * `Reusability.by_==[A]` uses universal equality (ie. `a == b`)
 * `Reusability.byEqual[A]` uses a Scalaz `Equal` typeclass
 * `Reusability.caseClass[A]` for case classes of your own.
+* `Reusability.caseClassDebug[A]` as above, but shows you the code that the macro generates.
 * `Reusability.by(A => B)` to use a subset (`B`) of the subject data (`A`).
 * `Reusability.fn((A, B) => Boolean)` to hand-write custom logic.
 
diff --git a/extra/ROUTER2.md b/extra/ROUTER2.md
index e74970854..82f22a65f 100644
--- a/extra/ROUTER2.md
+++ b/extra/ROUTER2.md
@@ -189,7 +189,8 @@ and is automatically converted to a finalised `Route` when used.
   * `.filter(A => Boolean)` causes the route to ignore parsed values which don't satisfy the given filter.
   * `.option` makes this subject portion of the route optional and turns a `RouteB[A]` into a `RouteB[Option[A]]`. Forms an isomorphism between `None` and an empty path.
   * `.xmap[B](A => B)(B => A)` allows you to map the route type from an `A` to a `B`.
-  * `.caseClass[A]` maps the route type to a case class.
+  * `.caseClass[A]` maps the route type(s) to a case class.
+  * `.caseClassDebug[A]` as above, but shows you the code that the macro generates.
 
 * Combinators on `RouteB[Option[A]]`
   * `.withDefault(A)` - Specify a default value. Returns a `RouteB[A]`. Uses `==` to compare `A`s to the given default.