Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Pass `Node` parsing level to expressions | 2023-09-28 | 2 | -16/+16 | |
| | |||||
* | Limit nesting in parser nodes, too | 2023-09-28 | 2 | -4/+23 | |
| | |||||
* | Require Expr::parse() callers to supply Level | 2023-09-28 | 2 | -16/+18 | |
| | |||||
* | Move Level into the crate root | 2023-09-28 | 3 | -18/+17 | |
| | |||||
* | Yield a parser error when defining a macro named 'super' | 2023-09-28 | 2 | -4/+11 | |
| | |||||
* | Limit expression nesting level to avoid stack overflows | 2023-09-28 | 2 | -34/+83 | |
| | |||||
* | fuzz: remove input limit | 2023-09-18 | 1 | -4/+2 | |
| | | | | | While working on https://github.com/djc/askama/pull/862 fuzz_parser was crashing and failing oss-fuzz build_checks. so a limit of 500 was placed, this pr removes that. | ||||
* | fuzz: Add fuzz for askama_parser | 2023-09-13 | 4 | -0/+58 | |
| | |||||
* | Use char_indices() to get byte indices for characters | 2023-09-11 | 2 | -1/+8 | |
| | |||||
* | Rename some variables | 2023-09-11 | 1 | -7/+7 | |
| | |||||
* | Optimize parsing boolean literals, too | 2023-08-03 | 1 | -9/+5 | |
| | |||||
* | Parse paths and identifiers only once | 2023-08-03 | 3 | -37/+53 | |
| | | | | | | | | | | | | | | In the old implementation each variable in an expression would be parsed up to three times: * Try to parse a path because it contains a leading double colon, or infix double colons. * Try to parse it as path again by scanning for an identifier that contains an upper case character. * Fall back to scanning for any identifier. This PR turns all three steps into one, without the need for backtracking. | ||||
* | parser: fix white space issues in macro parsing | 2023-08-02 | 1 | -2/+2 | |
| | |||||
* | parser: allow negative numbers in patterns | 2023-08-02 | 1 | -1/+5 | |
| | |||||
* | parser: don't truncates whitespaces after arrays | 2023-08-02 | 1 | -1/+1 | |
| | |||||
* | parser: better error message for unknown nodes | 2023-08-02 | 2 | -9/+8 | |
| | |||||
* | parser: import `parser::{Expr, Node}` | 2023-08-01 | 2 | -5/+4 | |
| | |||||
* | parser: `node::Loop` is much bigger than the other variants | 2023-08-01 | 1 | -2/+2 | |
| | |||||
* | parser: move test for completeness | 2023-08-01 | 1 | -6/+6 | |
| | |||||
* | parser: add type for `Node::Comment` | 2023-08-01 | 2 | -146/+109 | |
| | |||||
* | parser: add `expr::Loop::parse()` | 2023-08-01 | 1 | -68/+70 | |
| | |||||
* | parser: remove re-exports `parser::{node,expr}::*` | 2023-08-01 | 3 | -13/+12 | |
| | |||||
* | parser: add type for `Node::Extends` | 2023-08-01 | 2 | -9/+16 | |
| | |||||
* | parser: add type for `Node::Include` | 2023-08-01 | 2 | -14/+28 | |
| | |||||
* | parser: rename `Node::Cond` into `If` and add type | 2023-08-01 | 2 | -35/+49 | |
| | |||||
* | parser: add type for `Node::Let` | 2023-08-01 | 2 | -26/+34 | |
| | |||||
* | parser: add type for `Node::Raw` | 2023-08-01 | 2 | -29/+38 | |
| | |||||
* | parser: add type for `Node::Lit` | 2023-08-01 | 3 | -49/+54 | |
| | |||||
* | parser: add type for `Node::BlockDef` | 2023-08-01 | 2 | -30/+45 | |
| | |||||
* | parser: add type for `Node::Match` | 2023-08-01 | 2 | -36/+54 | |
| | |||||
* | parser: add type for `Node::Call` | 2023-08-01 | 2 | -20/+40 | |
| | |||||
* | parser: add type for `Node::Import` | 2023-08-01 | 2 | -17/+33 | |
| | |||||
* | parser: let `Macro` know its name | 2023-08-01 | 1 | -52/+53 | |
| | |||||
* | parser: add `Ast::nodes()` method | 2023-08-01 | 1 | -0/+4 | |
| | |||||
* | parser: impement `PartialEq` for `Ast` | 2023-08-01 | 1 | -0/+7 | |
| | |||||
* | parser: implement `Debug` for `Parsed` | 2023-08-01 | 1 | -1/+9 | |
| | |||||
* | parser: use `?` | 2023-08-01 | 1 | -5/+1 | |
| | |||||
* | parser: ensure correct drop order for `Parsed` | 2023-08-01 | 1 | -2/+3 | |
| | | | | | | | | | | | | | | | According to [RFC 1857] the fields of a struct are dropped in the same order as they are declared. For `struct S { a: A, b: B }` field `a` is dropped before field `b`. Our struct `Parsed` is self referencial. Its field `ast` depends on `source`, so `source` must outlife `ast`. This PR changes the order of the fields to reflect this requirement. In practice it should not matter, because we know that the variant of `Node` won't access the string data during their `Drop`, but better safe than sorry - maybe `Node` changes in the future. [RFC 1857]: https://rust-lang.github.io/rfcs/1857-stabilize-drop-order.html | ||||
* | parser: remove panicking `From<&str> for Whitespace` | 2023-08-01 | 1 | -12/+5 | |
| | |||||
* | Fix parsing arrays | 2023-07-31 | 2 | -5/+90 | |
| | | | | | | | | | | | | | | | | This change * allows using empty arrays `[]` in expessions, * adds a cut when the leading `[` was encountered, and * fixes the interaction between arrays and boolean OR. IMO the restriction that you couldn't use empty arrays is not needed. The missing cut made error messages slictly worse if you forget to add the closing `]`. Filter expressions must not have white spaces before the pipe `|`. The white space is used to tell a filter expressions, and `std::ops::Or` apart. | ||||
* | Fix parsing calls | 2023-07-31 | 2 | -4/+31 | |
| | | | | | | | This change: * adds a cut when the leading `(` was encountered, and * fixed the interaction between call expressions and boolean OR. | ||||
* | parser: rename block to nodes | 2023-07-31 | 1 | -12/+13 | |
| | |||||
* | parser: reorder items in node module | 2023-07-31 | 1 | -50/+50 | |
| | |||||
* | parser: move Expr parser helpers into callers | 2023-07-31 | 1 | -53/+54 | |
| | |||||
* | parser: move single expr parsers into Expr impl | 2023-07-31 | 1 | -63/+63 | |
| | |||||
* | parser: move binary operator parsers into Expr impl | 2023-07-31 | 1 | -71/+71 | |
| | |||||
* | parser: flatten top-level Expr interface | 2023-07-31 | 2 | -36/+28 | |
| | |||||
* | parser: move suffix parsers into impl block | 2023-07-31 | 1 | -53/+61 | |
| | |||||
* | parser: move cond parsers into type impls | 2023-07-31 | 1 | -39/+43 | |
| | |||||
* | parser: move parser helpers into callers | 2023-07-31 | 1 | -35/+35 | |
| |