| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| * | Code cleanups as suggested by Clippy |  Dirkjan Ochtman | 2017-09-06 | 1 | -4/+4 | |
| | | ||||||
| * | Stop mutating parsed AST for code generation | Dirkjan Ochtman | 2017-09-05 | 1 | -1/+0 | |
| | | ||||||
| * | Refactor handling of macros | Dirkjan Ochtman | 2017-09-05 | 1 | -5/+15 | |
| | | ||||||
| * | Clean up and tighten faster version of expr_prec_layer macro | Dirkjan Ochtman | 2017-09-04 | 1 | -15/+10 | |
| | | ||||||
| * | Changed implementation of precedence rules |  Lars Erik Rosengren | 2017-09-03 | 1 | -6/+12 | |
| | | | | | | | | | | | | | | | This implementation resolves djc/askama#44 by changing the precedence implementation. The previous solution was very slow because it had to try to parse all combinations of precedence layers leading to 2^9 iterations for each expr_any. This is solved by reusing the left operand instead of reparsing it when the operator isn't found. This implementation also solves another related issue that expressions with multiple operators couldn't be parsed, for example {{1 * 2 * 3}}. This is handled by using expr_any for the right operand instead of only using higher level precedence layers. | |||||
| * | Move most of the code into new askama_shared crate | Dirkjan Ochtman | 2017-08-27 | 1 | -0/+471 | |
| This makes it possible to share code between askama and askama_derive. | ||||||
 |
index : askama | |
| [no description] | git repository hosting |
| aboutsummaryrefslogtreecommitdiffstats |