var searchIndex = {};
searchIndex["pest"] = {"doc":"# pest. Smart PEGs in Rust","items":[[3,"StringInput","pest","A `struct` useful for matching in-memory `String`s.",null,null],[3,"Queues","","A `struct` which caches `VecDeque`s.",null,null],[11,"fmt","","",0,null],[11,"new","","Creates a new `Queues` `struct`.",0,{"inputs":[],"output":{"name":"queues"}}],[11,"last","","Returns the last `VecDeque` if size is greater than 1, else `None`.",0,null],[11,"last_mut","","Returns the last `VecDeque` as mutable if size is greater than 1, else `None`.",0,null],[11,"push","","Pushes a new `VecDeque` at the end of a `Queues` `struct`.",0,null],[11,"pop","","Pops the last `VecDeque` from a `Queues` `struct`.",0,null],[11,"pour","","Pours all elements from the last `VecDeque` into the one that comes before it, and pops it.",0,null],[11,"new","","Creates a new `StringInput` from a `&str`.",1,{"inputs":[{"name":"str"}],"output":{"name":"stringinput"}}],[11,"len","","",1,null],[11,"pos","","",1,null],[11,"set_pos","","",1,null],[11,"matches","","",1,null],[11,"between","","",1,null],[8,"Input","","A `trait` that defines an input for a `Parser`.",null,null],[10,"len","","Returns length of an `Input`.",2,null],[10,"pos","","Returns current position of an `Input`.",2,null],[10,"set_pos","","Set current position of an `Input`.",2,null],[10,"matches","","Matches `string` to an `Input`, returns whether it matched, and advances the position with\n`string.len()` in case it did.",2,null],[10,"between","","Matches if an `Input`'s current `char` is between `left` and `right`, and advances the\nposition with one `char` in case it did.",2,null],[8,"Parser","","A `trait` that defines a parser.",null,null],[16,"Rules","","",3,null],[10,"matches","","Matches `string`, returns whether it matched, and advances a parser with `string.len()` in\ncase it did.",3,null],[10,"between","","Matches `char` between `left` and `right`, and advances a parser with one `char` in case\nit did.",3,null],[10,"try","","Tries to match `rule`, returns whether it matched, and advances a parser with in case it\ndid. If `revert` is `true`, the parser will not advance.",3,null],[10,"pos","","Returns the current position of a `Parser`.",3,null],[10,"set_pos","","Sets the position of a `Parser`.",3,null],[10,"end","","Returns whether a `Parser` has reached it end.",3,null],[10,"reset","","Reset a `Parser`.",3,null],[10,"queue","","Returns the queue of all matched `Rules`.",3,null],[10,"skip_ws","","Skips white-space.",3,null],[14,"grammar!","","A `macro` that defines each rule as a method on a `Parser`. Rules starting with an uderscore\nwill not be placed into the queue.",null,null],[14,"impl_rdp!","","A `macro` useful for implementing the `Parser` `trait` as a recursive descent parser.",null,null]],"paths":[[3,"Queues"],[3,"StringInput"],[8,"Input"],[8,"Parser"]]};
initSearch(searchIndex);