Felix S. Klock II c8ae44682d O(n*k) code-size deriving on enums (better than previous O(n^k)). ... In the above formulas, `n` is the number of variants, and `k` is the number of self-args fed into deriving. In the particular case of interest (namely `PartialOrd` and `Ord`), `k` is always 2, so we are basically comparing `O(n)` versus `O(n^2)`. Also, the stage is set for having *all* enum deriving codes go through `build_enum_match_tuple` and getting rid of `build_enum_match`. Also, seriously attempted to clean up the code itself. Added a bunch of comments attempting to document what I learned as I worked through the original code and adapted it to this new strategy.		2014-07-11 17:32:18 +02:00
..
mod.rs	O(n*k) code-size deriving on enums (better than previous O(n^k)).	2014-07-11 17:32:18 +02:00
ty.rs	syntax: doc comments all the things	2014-07-09 00:06:27 -07:00