var searchIndex = {};
searchIndex["rusty_peg"] = {"doc":"","items":[[3,"Input","rusty_peg","",null,null],[12,"text","","",0,null],[12,"offset","","",0,null],[3,"Error","","",null,null],[12,"expected","","",1,null],[12,"offset","","",1,null],[4,"Kind","","",null,null],[13,"Text","","",2,null],[13,"Option","","",2,null],[13,"Repeat","","",2,null],[13,"Elem","","",2,null],[13,"Group","","",2,null],[13,"Symbol","","",2,null],[0,"util","","",null,null],[3,"PhantomData","rusty_peg::util","`PhantomData<T>` allows you to describe that a type acts as if it stores a value of type `T`,\neven though it does not. This allows you to inform the compiler about certain safety properties\nof your code.",null,null],[3,"HashMap","","A hash map implementation which uses linear probing with Robin\nHood bucket stealing.",null,null],[3,"Rc","","A reference-counted pointer type over an immutable value.",null,null],[3,"Or","","",null,null],[12,"a","","",3,null],[12,"b","","",3,null],[3,"Join","","",null,null],[12,"first","","",4,null],[12,"second","","",4,null],[3,"Empty","","",null,null],[3,"Whitespace","","",null,null],[3,"Optional","","",null,null],[3,"Repeat","","",null,null],[12,"parser","","",5,null],[12,"separator","","",5,null],[12,"min","","",5,null],[3,"RegexNt","","",null,null],[5,"skip_whitespace","","",null,{"inputs":[{"name":"input"}],"output":{"name":"input"}}],[5,"memoize","","",null,{"inputs":[{"name":"p"},{"name":"cachefn"},{"name":"usize"},{"name":"computefn"}],"output":{"name":"parseresult"}}],[11,"fmt","","",3,null],[11,"pretty_print","","",3,null],[11,"parse","","",3,null],[11,"fmt","","",4,null],[11,"pretty_print","","",4,null],[11,"parse","","",4,null],[11,"fmt","","",6,null],[11,"pretty_print","","",6,null],[11,"parse","","",6,null],[11,"fmt","","",7,null],[11,"pretty_print","","",7,null],[11,"parse","","",7,null],[11,"fmt","","",8,null],[11,"pretty_print","","",8,null],[11,"parse","","",8,null],[11,"fmt","","",5,null],[11,"pretty_print","","",5,null],[11,"parse","","",5,null],[11,"fmt","","",9,null],[11,"new","","",9,{"inputs":[{"name":"str"},{"name":"hashset"}],"output":{"name":"regexnt"}}],[11,"pretty_print","","",9,null],[11,"parse","","",9,null],[0,"tree","rusty_peg","",null,null],[3,"ParseTree","rusty_peg::tree","",null,null],[12,"kind","","",10,null],[12,"span","","",10,null],[12,"child","","",10,null],[12,"sibling","","",10,null],[3,"Span","","",null,null],[12,"lo","","",11,null],[12,"hi","","",11,null],[3,"ChildIterator","","",null,null],[17,"DUMMY_SPAN","","",null,null],[11,"fmt","","",10,null],[11,"fmt","","",11,null],[11,"new","","",10,{"inputs":[{"name":"k"},{"name":"span"},{"name":"option"}],"output":{"name":"parsetree"}}],[11,"sibling_chain","","",10,{"inputs":[{"name":"vec"}],"output":{"name":"option"}}],[11,"add_child_front","","",10,null],[11,"children","","",10,null],[11,"next","","",12,null],[11,"new","","",11,{"inputs":[{"name":"usize"},{"name":"usize"}],"output":{"name":"span"}}],[6,"Cache","rusty_peg","",null,null],[6,"ParseResult","","",null,null],[8,"Symbol","","",null,null],[16,"Output","","",13,null],[10,"pretty_print","","",13,null],[11,"parse_complete","","",13,null],[11,"parse_prefix","","",13,null],[10,"parse","","",13,null],[11,"clone","","",0,null],[11,"fmt","","",1,null],[11,"clone","","",1,null],[14,"rusty_peg!","","",null,null],[11,"hash","rusty_peg::util","",14,null],[11,"eq","","",14,null],[11,"partial_cmp","","",14,null],[11,"cmp","","",14,null],[11,"clone","","",14,null],[11,"default","","",14,{"inputs":[],"output":{"name":"phantomdata"}}],[11,"fmt","","",14,null],[11,"new","","Creates an empty HashMap.",15,{"inputs":[],"output":{"name":"hashmap"}}],[11,"with_capacity","","Creates an empty hash map with the given initial capacity.",15,{"inputs":[{"name":"usize"}],"output":{"name":"hashmap"}}],[11,"with_hasher","","Creates an empty hashmap which will use the given hash builder to hash\nkeys.",15,{"inputs":[{"name":"s"}],"output":{"name":"hashmap"}}],[11,"with_capacity_and_hasher","","Creates an empty HashMap with space for at least `capacity`\nelements, using `hasher` to hash the keys.",15,{"inputs":[{"name":"usize"},{"name":"s"}],"output":{"name":"hashmap"}}],[11,"hasher","","Returns a reference to the map's hasher.",15,null],[11,"capacity","","Returns the number of elements the map can hold without reallocating.",15,null],[11,"reserve","","Reserves capacity for at least `additional` more elements to be inserted\nin the `HashMap`. The collection may reserve more space to avoid\nfrequent reallocations.",15,null],[11,"shrink_to_fit","","Shrinks the capacity of the map as much as possible. It will drop\ndown as much as possible while maintaining the internal rules\nand possibly leaving some space in accordance with the resize policy.",15,null],[11,"keys","","An iterator visiting all keys in arbitrary order.\nIterator element type is `&'a K`.",15,null],[11,"values","","An iterator visiting all values in arbitrary order.\nIterator element type is `&'a V`.",15,null],[11,"values_mut","","An iterator visiting all values mutably in arbitrary order.\nIterator element type is `&'a mut V`.",15,null],[11,"iter","","An iterator visiting all key-value pairs in arbitrary order.\nIterator element type is `(&'a K, &'a V)`.",15,null],[11,"iter_mut","","An iterator visiting all key-value pairs in arbitrary order,\nwith mutable references to the values.\nIterator element type is `(&'a K, &'a mut V)`.",15,null],[11,"entry","","Gets the given key's corresponding entry in the map for in-place manipulation.",15,null],[11,"len","","Returns the number of elements in the map.",15,null],[11,"is_empty","","Returns true if the map contains no elements.",15,null],[11,"drain","","Clears the map, returning all key-value pairs as an iterator. Keeps the\nallocated memory for reuse.",15,null],[11,"clear","","Clears the map, removing all key-value pairs. Keeps the allocated memory\nfor reuse.",15,null],[11,"get","","Returns a reference to the value corresponding to the key.",15,null],[11,"contains_key","","Returns true if the map contains a value for the specified key.",15,null],[11,"get_mut","","Returns a mutable reference to the value corresponding to the key.",15,null],[11,"insert","","Inserts a key-value pair into the map.",15,null],[11,"remove","","Removes a key from the map, returning the value at the key if the key\nwas previously in the map.",15,null],[11,"clone","","",15,null],[11,"eq","","",15,null],[11,"fmt","","",15,null],[11,"default","","",15,{"inputs":[],"output":{"name":"hashmap"}}],[11,"index","","",15,null],[11,"into_iter","","Creates a consuming iterator, that is, one that moves each key-value\npair out of the map in arbitrary order. The map cannot be used after\ncalling this.",15,null],[11,"from_iter","","",15,{"inputs":[{"name":"t"}],"output":{"name":"hashmap"}}],[11,"extend","","",15,null],[11,"extend","","",15,null],[11,"new","","Constructs a new `Rc<T>`.",16,{"inputs":[{"name":"t"}],"output":{"name":"rc"}}],[11,"try_unwrap","","Unwraps the contained value if the `Rc<T>` has exactly one strong reference.",16,{"inputs":[{"name":"rc"}],"output":{"name":"result"}}],[11,"would_unwrap","","Checks if `Rc::try_unwrap` would return `Ok`.",16,{"inputs":[{"name":"rc"}],"output":{"name":"bool"}}],[11,"downgrade","","Creates a new `Weak<T>` reference from this value.",16,{"inputs":[{"name":"rc"}],"output":{"name":"weak"}}],[11,"weak_count","","Get the number of weak references to this value.",16,{"inputs":[{"name":"rc"}],"output":{"name":"usize"}}],[11,"strong_count","","Get the number of strong references to this value.",16,{"inputs":[{"name":"rc"}],"output":{"name":"usize"}}],[11,"is_unique","","Returns true if there are no other `Rc` or `Weak<T>` values that share\nthe same inner value.",16,{"inputs":[{"name":"rc"}],"output":{"name":"bool"}}],[11,"get_mut","","Returns a mutable reference to the contained value if the `Rc<T>` has\none strong reference and no weak references.",16,{"inputs":[{"name":"rc"}],"output":{"name":"option"}}],[11,"make_mut","","Make a mutable reference into the given `Rc<T>` by cloning the inner\ndata if the `Rc<T>` doesn't have one strong reference and no weak\nreferences.",16,{"inputs":[{"name":"rc"}],"output":{"name":"t"}}],[11,"deref","","",16,null],[11,"drop","","Drops the `Rc<T>`.",16,null],[11,"clone","","Makes a clone of the `Rc<T>`.",16,null],[11,"default","","Creates a new `Rc<T>`, with the `Default` value for `T`.",16,{"inputs":[],"output":{"name":"rc"}}],[11,"eq","","Equality for two `Rc<T>`s.",16,null],[11,"ne","","Inequality for two `Rc<T>`s.",16,null],[11,"partial_cmp","","Partial comparison for two `Rc<T>`s.",16,null],[11,"lt","","Less-than comparison for two `Rc<T>`s.",16,null],[11,"le","","'Less-than or equal to' comparison for two `Rc<T>`s.",16,null],[11,"gt","","Greater-than comparison for two `Rc<T>`s.",16,null],[11,"ge","","'Greater-than or equal to' comparison for two `Rc<T>`s.",16,null],[11,"cmp","","Comparison for two `Rc<T>`s.",16,null],[11,"hash","","",16,null],[11,"fmt","","",16,null],[11,"fmt","","",16,null],[11,"fmt","","",16,null],[11,"from","","",16,{"inputs":[{"name":"t"}],"output":{"name":"rc"}}],[11,"borrow","","",16,null],[11,"as_ref","","",16,null]],"paths":[[3,"Input"],[3,"Error"],[4,"Kind"],[3,"Or"],[3,"Join"],[3,"Repeat"],[3,"Empty"],[3,"Whitespace"],[3,"Optional"],[3,"RegexNt"],[3,"ParseTree"],[3,"Span"],[3,"ChildIterator"],[8,"Symbol"],[3,"PhantomData"],[3,"HashMap"],[3,"Rc"]]};
initSearch(searchIndex);