var searchIndex = {};
searchIndex["fst"] = {"doc":"Crate `fst` is a library for efficiently storing and searching ordered sets or\nmaps where the keys are byte strings. A key design goal of this crate is to\nsupport storing and searching *very large* sets or maps (i.e., billions). This\nmeans that much effort has gone in to making sure that all operations are\nmemory efficient.","items":[[3,"Levenshtein","fst","A Unicode aware Levenshtein automaton for running efficient fuzzy queries.",null,null],[3,"Map","","Map is a lexicographically ordered map from byte strings to integers.",null,null],[3,"MapBuilder","","A builder for creating a map.",null,null],[3,"Regex","","A regular expression for searching FSTs with Unicode support.",null,null],[3,"Set","","Set is a lexicographically ordered set of byte strings.",null,null],[3,"SetBuilder","","A builder for creating a set.",null,null],[4,"Error","","An error that encapsulates all possible errors in this crate.",null,null],[13,"Fst","","An error that occurred while reading or writing a finite state\ntransducer.",0,null],[13,"Regex","","An error that occurred while compiling a regular expression.",0,null],[13,"Levenshtein","","An error that occurred while building a Levenshtein automaton.",0,null],[13,"Io","","An IO error that occurred while writing a finite state transducer.",0,null],[4,"LevenshteinError","","An error that occurred while building a Levenshtein automaton.",null,null],[13,"TooManyStates","","If construction of the automaton reaches some hard-coded limit\non the number of states, then this error is returned.",1,null],[4,"RegexError","","An error that occurred while compiling a regular expression.",null,null],[13,"Syntax","","A problem with the syntax of a regular expression.",2,null],[13,"CompiledTooBig","","Too many instructions resulting from the regular expression.",2,null],[13,"TooManyStates","","Too many automata states resulting from the regular expression.",2,null],[13,"NoLazy","","Lazy quantifiers are not allowed (because they have no useful\ninterpretation when used purely for automata intersection, as is the\ncase in this crate).",2,null],[13,"NoWordBoundary","","Word boundaries are currently not allowed.",2,null],[13,"NoEmpty","","Empty or "zero width assertions" such as `^` or `$` are currently\nnot allowed.",2,null],[11,"fmt","","",0,null],[11,"from","","",0,{"inputs":[{"name":"error"}],"output":{"name":"error"}}],[11,"from","","",0,{"inputs":[{"name":"regexerror"}],"output":{"name":"error"}}],[11,"from","","",0,{"inputs":[{"name":"levenshteinerror"}],"output":{"name":"error"}}],[11,"from","","",0,{"inputs":[{"name":"error"}],"output":{"name":"error"}}],[11,"from","","",0,{"inputs":[{"name":"error"}],"output":{"name":"error"}}],[11,"from","","",0,{"inputs":[{"name":"error"}],"output":{"name":"error"}}],[11,"fmt","","",0,null],[11,"description","","",0,null],[11,"cause","","",0,null],[11,"fmt","","",1,null],[11,"fmt","","",1,null],[11,"description","","",1,null],[11,"cause","","",1,null],[11,"new","","Create a new Levenshtein query.",3,{"inputs":[{"name":"str"},{"name":"u32"}],"output":{"name":"result"}}],[11,"fmt","","",3,null],[11,"start","","",3,null],[11,"is_match","","",3,null],[11,"can_match","","",3,null],[11,"accept","","",3,null],[11,"from_path","","Opens a map stored at the given file path via a memory map.",4,{"inputs":[{"name":"p"}],"output":{"name":"result"}}],[11,"from_bytes","","Creates a map from its representation as a raw byte sequence.",4,{"inputs":[{"name":"vec"}],"output":{"name":"result"}}],[11,"from_iter","","Create a `Map` from an iterator of lexicographically ordered byte\nstrings and associated values.",4,{"inputs":[{"name":"i"}],"output":{"name":"result"}}],[11,"contains_key","","Tests the membership of a single key.",4,null],[11,"get","","Retrieves the value associated with a key.",4,null],[11,"stream","","Return a lexicographically ordered stream of all key-value pairs in\nthis map.",4,null],[11,"keys","","Return a lexicographically ordered stream of all keys in this map.",4,null],[11,"values","","Return a stream of all values in this map ordered lexicographically\nby each value's corresponding key.",4,null],[11,"range","","Return a builder for range queries.",4,null],[11,"search","","Executes an automaton on the keys of this map.",4,null],[11,"len","","Returns the number of elements in this map.",4,null],[11,"is_empty","","Returns true if and only if this map is empty.",4,null],[11,"op","","Creates a new map operation with this map added to it.",4,null],[11,"as_fst","","Returns a reference to the underlying raw finite state transducer.",4,null],[11,"fmt","","",4,null],[11,"from","","",4,{"inputs":[{"name":"fst"}],"output":{"name":"map"}}],[11,"as_ref","","",4,null],[11,"memory","","Create a builder that builds a map in memory.",5,{"inputs":[],"output":{"name":"self"}}],[11,"new","","Create a builder that builds a map by writing it to `wtr` in a\nstreaming fashion.",5,{"inputs":[{"name":"w"}],"output":{"name":"result"}}],[11,"insert","","Insert a new key-value pair into the map.",5,null],[11,"extend_iter","","Calls insert on each item in the iterator.",5,null],[11,"extend_stream","","Calls insert on each item in the stream.",5,null],[11,"finish","","Finishes the construction of the map and flushes the underlying\nwriter. After completion, the data written to `W` may be read using\none of `Map`'s constructor methods.",5,null],[11,"into_inner","","Just like `finish`, except it returns the underlying writer after\nflushing it.",5,null],[0,"raw","","Operations on raw finite state transducers.",null,null],[3,"Builder","fst::raw","A builder for creating a finite state transducer.",null,null],[3,"Node","","Node represents a single state in a finite state transducer.",null,null],[3,"Transitions","","An iterator over all transitions in a node.",null,null],[3,"MmapReadOnly","","A read only view into a memory map.",null,null],[3,"IndexedValue","","A value indexed by a stream.",null,null],[12,"index","","The index of the stream that produced this value (starting at `0`).",6,null],[12,"value","","The value.",6,null],[3,"OpBuilder","","A builder for collecting fst streams on which to perform set operations\non the keys of fsts.",null,null],[3,"Intersection","","A stream of set intersection over multiple fst streams in lexicographic\norder.",null,null],[3,"Union","","A stream of set union over multiple fst streams in lexicographic order.",null,null],[3,"Difference","","A stream of set difference over multiple fst streams in lexicographic\norder.",null,null],[3,"SymmetricDifference","","A stream of set symmetric difference over multiple fst streams in\nlexicographic order.",null,null],[3,"Fst","","An acyclic deterministic finite state transducer.",null,null],[3,"StreamBuilder","","A builder for constructing range queries on streams.",null,null],[3,"Stream","","A lexicographically ordered stream of key-value pairs from an fst.",null,null],[3,"Output","","An output is a value that is associated with a key in a finite state\ntransducer.",null,null],[3,"Transition","","A transition from one note to another.",null,null],[12,"inp","","The byte input associated with this transition.",7,null],[12,"out","","The output associated with this transition.",7,null],[12,"addr","","The address of the node that this transition points to.",7,null],[4,"Error","","An error that occurred while using a finite state transducer.",null,null],[13,"Version","","A version mismatch occurred while reading a finite state transducer.",8,null],[12,"expected","fst::raw::Error","The expected version, which is hard-coded into the current version\nof this crate.",8,null],[12,"got","","The version read from the finite state transducer.",8,null],[13,"Format","fst::raw","An unexpected error occurred while reading a finite state transducer.\nUsually this occurs because the data is corrupted or is not actually\na finite state transducer serialized by this library.",8,null],[13,"DuplicateKey","","A duplicate key was inserted into a finite state transducer, which is\nnot allowed.",8,null],[12,"got","fst::raw::Error","The duplicate key.",8,null],[13,"OutOfOrder","fst::raw","A key was inserted out of order into a finite state transducer.",8,null],[12,"previous","fst::raw::Error","The last key successfully inserted.",8,null],[12,"got","","The key that caused this error to occur.",8,null],[13,"WrongType","fst::raw","A finite state transducer with an unexpected type was found.",8,null],[12,"expected","fst::raw::Error","The expected finite state transducer type.",8,null],[12,"got","","The type read from a finite state transducer.",8,null],[13,"FromUtf8","fst::raw","An error that occurred when trying to decode a UTF-8 byte key.",8,null],[11,"memory","","Create a builder that builds an fst in memory.",9,{"inputs":[],"output":{"name":"self"}}],[11,"new","","Create a builder that builds an fst by writing it to `wtr` in a\nstreaming fashion.",9,{"inputs":[{"name":"w"}],"output":{"name":"result"}}],[11,"new_type","","The same as `new`, except it sets the type of the fst to the type\ngiven.",9,{"inputs":[{"name":"w"},{"name":"fsttype"}],"output":{"name":"result"}}],[11,"add","","Adds a byte string to this FST with a zero output value.",9,null],[11,"insert","","Insert a new key-value pair into the fst.",9,null],[11,"extend_iter","","Calls insert on each item in the iterator.",9,null],[11,"extend_stream","","Calls insert on each item in the stream.",9,null],[11,"finish","","Finishes the construction of the fst and flushes the underlying\nwriter. After completion, the data written to `W` may be read using\none of `Fst`'s constructor methods.",9,null],[11,"into_inner","","Just like `finish`, except it returns the underlying writer after\nflushing it.",9,null],[11,"fmt","","",8,null],[11,"fmt","","",8,null],[11,"description","","",8,null],[11,"cause","","",8,null],[11,"from","","",8,{"inputs":[{"name":"fromutf8error"}],"output":{"name":"self"}}],[11,"open","","Create a new memory map from an existing file handle.",10,{"inputs":[{"name":"file"}],"output":{"name":"result"}}],[11,"open_path","","Open a new memory map from the path given.",10,{"inputs":[{"name":"p"}],"output":{"name":"result"}}],[11,"len","","Returns the size in byte of the memory map.",10,null],[11,"range","","Slice this memory map to a new `offset` and `len`.",10,null],[11,"as_slice","","Read the memory map as a `&[u8]`.",10,null],[11,"clone","","",10,null],[11,"from","","",10,{"inputs":[{"name":"mmap"}],"output":{"name":"mmapreadonly"}}],[11,"clone","","",11,null],[11,"fmt","","",11,null],[11,"transitions","","Returns an iterator over all transitions in this node in lexicographic\norder.",11,null],[11,"transition","","Returns the transition at index `i`.",11,null],[11,"transition_addr","","Returns the transition address of the `i`th transition.",11,null],[11,"find_input","","Finds the `i`th transition corresponding to the given input byte.",11,null],[11,"final_output","","If this node is final and has a terminal output value, then it is\nreturned. Otherwise, a zero output is returned.",11,null],[11,"is_final","","Returns true if and only if this node corresponds to a final or "match"\nstate in the finite state transducer.",11,null],[11,"len","","Returns the number of transitions in this node.",11,null],[11,"is_empty","","Returns true if and only if this node has zero transitions.",11,null],[11,"addr","","Return the address of this node.",11,null],[11,"next","","",12,null],[11,"partial_cmp","","",6,null],[11,"lt","","",6,null],[11,"le","","",6,null],[11,"gt","","",6,null],[11,"ge","","",6,null],[11,"eq","","",6,null],[11,"ne","","",6,null],[11,"cmp","","",6,null],[11,"hash","","",6,null],[11,"fmt","","",6,null],[11,"clone","","",6,null],[11,"new","","Create a new set operation builder.",13,{"inputs":[],"output":{"name":"self"}}],[11,"add","","Add a stream to this set operation.",13,null],[11,"push","","Add a stream to this set operation.",13,null],[11,"union","","Performs a union operation on all streams that have been added.",13,null],[11,"intersection","","Performs an intersection operation on all streams that have been added.",13,null],[11,"difference","","Performs a difference operation with respect to the first stream added.\nThat is, this returns a stream of all elements in the first stream\nthat don't exist in any other stream that has been added.",13,null],[11,"symmetric_difference","","Performs a symmetric difference operation on all of the streams that\nhave been added.",13,null],[11,"extend","","",13,null],[11,"from_iter","","",13,{"inputs":[{"name":"t"}],"output":{"name":"self"}}],[11,"next","","",14,null],[11,"next","","",15,null],[11,"next","","",16,null],[11,"next","","",17,null],[6,"FstType","","FstType is a convention used to indicate the type of the underlying\ntransducer.",null,null],[6,"CompiledAddr","","CompiledAddr is the type used to address nodes in a finite state\ntransducer.",null,null],[17,"VERSION","","The API version of this crate.",null,null],[11,"from_path","","Opens a transducer stored at the given file path via a memory map.",18,{"inputs":[{"name":"p"}],"output":{"name":"result"}}],[11,"from_mmap","","Opens a transducer from a `MmapReadOnly`.",18,{"inputs":[{"name":"mmapreadonly"}],"output":{"name":"result"}}],[11,"from_bytes","","Creates a transducer from its representation as a raw byte sequence.",18,{"inputs":[{"name":"vec"}],"output":{"name":"result"}}],[11,"from_static_slice","","Creates a transducer from its representation as a raw byte sequence.",18,null],[11,"get","","Retrieves the value associated with a key.",18,null],[11,"contains_key","","Returns true if and only if the given key is in this FST.",18,null],[11,"stream","","Return a lexicographically ordered stream of all key-value pairs in\nthis fst.",18,null],[11,"range","","Return a builder for range queries.",18,null],[11,"search","","Executes an automaton on the keys of this map.",18,null],[11,"len","","Returns the number of keys in this fst.",18,null],[11,"is_empty","","Returns true if and only if this fst has no keys.",18,null],[11,"size","","Returns the number of bytes used by this fst.",18,null],[11,"op","","Creates a new fst operation with this fst added to it.",18,null],[11,"is_disjoint","","Returns true if and only if the `self` fst is disjoint with the fst\n`stream`.",18,null],[11,"is_subset","","Returns true if and only if the `self` fst is a subset of the fst\n`stream`.",18,null],[11,"is_superset","","Returns true if and only if the `self` fst is a superset of the fst\n`stream`.",18,null],[11,"fst_type","","Returns the underlying type of this fst.",18,null],[11,"root","","Returns the root node of this fst.",18,null],[11,"node","","Returns the node at the given address.",18,null],[11,"ge","","Specify a greater-than-or-equal-to bound.",19,null],[11,"gt","","Specify a greater-than bound.",19,null],[11,"le","","Specify a less-than-or-equal-to bound.",19,null],[11,"lt","","Specify a less-than bound.",19,null],[11,"into_stream","","",19,null],[11,"into_byte_vec","","Convert this stream into a vector of byte strings and outputs.",20,null],[11,"into_str_vec","","Convert this stream into a vector of Unicode strings and outputs.",20,null],[11,"into_byte_keys","","Convert this stream into a vector of byte strings.",20,null],[11,"into_str_keys","","Convert this stream into a vector of Unicode strings.",20,null],[11,"into_values","","Convert this stream into a vector of outputs.",20,null],[11,"next","","",20,null],[11,"partial_cmp","","",21,null],[11,"lt","","",21,null],[11,"le","","",21,null],[11,"gt","","",21,null],[11,"ge","","",21,null],[11,"eq","","",21,null],[11,"ne","","",21,null],[11,"cmp","","",21,null],[11,"hash","","",21,null],[11,"fmt","","",21,null],[11,"clone","","",21,null],[11,"new","","Create a new output from a `u64`.",21,{"inputs":[{"name":"u64"}],"output":{"name":"output"}}],[11,"zero","","Create a zero output.",21,{"inputs":[],"output":{"name":"output"}}],[11,"value","","Retrieve the value inside this output.",21,null],[11,"is_zero","","Returns true if this is a zero output.",21,null],[11,"prefix","","Returns the prefix of this output and `o`.",21,null],[11,"cat","","Returns the concatenation of this output and `o`.",21,null],[11,"sub","","Returns the subtraction of `o` from this output.",21,null],[11,"eq","","",7,null],[11,"ne","","",7,null],[11,"hash","","",7,null],[11,"clone","","",7,null],[11,"default","","",7,{"inputs":[],"output":{"name":"self"}}],[11,"fmt","","",7,null],[11,"fmt","fst","",2,null],[11,"from","","",2,{"inputs":[{"name":"error"}],"output":{"name":"error"}}],[11,"fmt","","",2,null],[11,"description","","",2,null],[11,"cause","","",2,null],[11,"new","","Create a new regular expression query.",22,{"inputs":[{"name":"str"}],"output":{"name":"result"}}],[11,"start","","",22,null],[11,"is_match","","",22,null],[11,"can_match","","",22,null],[11,"accept","","",22,null],[11,"fmt","","",22,null],[11,"from_path","","Opens a set stored at the given file path via a memory map.",23,{"inputs":[{"name":"p"}],"output":{"name":"result"}}],[11,"from_bytes","","Creates a set from its representation as a raw byte sequence.",23,{"inputs":[{"name":"vec"}],"output":{"name":"result"}}],[11,"from_iter","","Create a `Set` from an iterator of lexicographically ordered byte\nstrings.",23,{"inputs":[{"name":"i"}],"output":{"name":"result"}}],[11,"contains","","Tests the membership of a single key.",23,null],[11,"stream","","Return a lexicographically ordered stream of all keys in this set.",23,null],[11,"range","","Return a builder for range queries.",23,null],[11,"search","","Executes an automaton on the keys of this set.",23,null],[11,"len","","Returns the number of elements in this set.",23,null],[11,"is_empty","","Returns true if and only if this set is empty.",23,null],[11,"op","","Creates a new set operation with this set added to it.",23,null],[11,"is_disjoint","","Returns true if and only if the `self` set is disjoint with the set\n`stream`.",23,null],[11,"is_subset","","Returns true if and only if the `self` set is a subset of `stream`.",23,null],[11,"is_superset","","Returns true if and only if the `self` set is a superset of `stream`.",23,null],[11,"as_fst","","Returns a reference to the underlying raw finite state transducer.",23,null],[11,"fmt","","",23,null],[11,"as_ref","","",23,null],[11,"from","","",23,{"inputs":[{"name":"fst"}],"output":{"name":"set"}}],[11,"memory","","Create a builder that builds a set in memory.",24,{"inputs":[],"output":{"name":"self"}}],[11,"new","","Create a builder that builds a set by writing it to `wtr` in a\nstreaming fashion.",24,{"inputs":[{"name":"w"}],"output":{"name":"result"}}],[11,"insert","","Insert a new key into the set.",24,null],[11,"extend_iter","","Calls insert on each item in the iterator.",24,null],[11,"extend_stream","","Calls insert on each item in the stream.",24,null],[11,"finish","","Finishes the construction of the set and flushes the underlying\nwriter. After completion, the data written to `W` may be read using\none of `Set`'s constructor methods.",24,null],[11,"into_inner","","Just like `finish`, except it returns the underlying writer after\nflushing it.",24,null],[0,"map","","Map operations implemented by finite state transducers.",null,null],[3,"IndexedValue","fst::map","A value indexed by a stream.",null,null],[12,"index","","The index of the stream that produced this value (starting at `0`).",6,null],[12,"value","","The value.",6,null],[3,"Map","","Map is a lexicographically ordered map from byte strings to integers.",null,null],[3,"MapBuilder","","A builder for creating a map.",null,null],[3,"Stream","","A lexicographically ordered stream of key-value pairs from a map.",null,null],[3,"Keys","","A lexicographically ordered stream of keys from a map.",null,null],[3,"Values","","A stream of values from a map, lexicographically ordered by each value's\ncorresponding key.",null,null],[3,"StreamBuilder","","A builder for constructing range queries on streams.",null,null],[3,"OpBuilder","","A builder for collecting map streams on which to perform set operations\non the keys of maps.",null,null],[3,"Union","","A stream of set union over multiple map streams in lexicographic order.",null,null],[3,"Intersection","","A stream of set intersection over multiple map streams in lexicographic\norder.",null,null],[3,"Difference","","A stream of set difference over multiple map streams in lexicographic\norder.",null,null],[3,"SymmetricDifference","","A stream of set symmetric difference over multiple map streams in\nlexicographic order.",null,null],[0,"set","fst","Set operations implemented by finite state transducers.",null,null],[3,"Set","fst::set","Set is a lexicographically ordered set of byte strings.",null,null],[3,"SetBuilder","","A builder for creating a set.",null,null],[3,"Stream","","A lexicographically ordered stream of keys from a set.",null,null],[3,"StreamBuilder","","A builder for constructing range queries on streams.",null,null],[3,"OpBuilder","","A builder for collecting set streams on which to perform set operations.",null,null],[3,"Union","","A stream of set union over multiple streams in lexicographic order.",null,null],[3,"Intersection","","A stream of set intersection over multiple streams in lexicographic order.",null,null],[3,"Difference","","A stream of set difference over multiple streams in lexicographic order.",null,null],[3,"SymmetricDifference","","A stream of set symmetric difference over multiple streams in lexicographic\norder.",null,null],[6,"Result","fst","A `Result` type alias for this crate's `Error` type.",null,null],[8,"Automaton","","Automaton describes types that behave as a finite automaton.",null,null],[16,"State","","The type of the state used in the automaton.",25,null],[10,"start","","Returns a single start state for this automaton.",25,null],[10,"is_match","","Returns true if and only if `state` is a match state.",25,null],[11,"can_match","","Returns true if and only if `state` can lead to a match in zero or more\nsteps.",25,null],[11,"will_always_match","","Returns true if and only if `state` matches and must match no matter what\nsteps are taken.",25,null],[10,"accept","","Return the next state given `state` and an input.",25,null],[11,"starts_with","","Returns an automaton that matches the strings that start with something\nthis automaton matches.",25,null],[11,"union","","Returns an automaton that matches the strings matched by either this or\nthe other automaton.",25,null],[11,"intersection","","Returns an automaton that matches the strings matched by both this and\nthe other automaton.",25,null],[11,"complement","","Returns an automaton that matches the strings not matched by this automaton.",25,null],[8,"IntoStreamer","","IntoStreamer describes types that can be converted to streams.",null,null],[16,"Item","","The type of the item emitted by the stream.",26,null],[16,"Into","","The type of the stream to be constructed.",26,null],[10,"into_stream","","Construct a stream from `Self`.",26,null],[8,"Streamer","","Streamer describes a "streaming iterator."",null,null],[16,"Item","","The type of the item emitted by this stream.",27,null],[10,"next","","Emits the next element in this stream, or `None` to indicate the stream\nhas been exhausted.",27,null],[11,"can_match","","Returns true if and only if `state` can lead to a match in zero or more\nsteps.",25,null],[11,"will_always_match","","Returns true if and only if `state` matches and must match no matter what\nsteps are taken.",25,null],[11,"starts_with","","Returns an automaton that matches the strings that start with something\nthis automaton matches.",25,null],[11,"union","","Returns an automaton that matches the strings matched by either this or\nthe other automaton.",25,null],[11,"intersection","","Returns an automaton that matches the strings matched by both this and\nthe other automaton.",25,null],[11,"complement","","Returns an automaton that matches the strings not matched by this automaton.",25,null],[11,"next","fst::map","",28,null],[11,"into_byte_vec","","Convert this stream into a vector of byte strings and outputs.",28,null],[11,"into_str_vec","","Convert this stream into a vector of Unicode strings and outputs.",28,null],[11,"into_byte_keys","","Convert this stream into a vector of byte strings.",28,null],[11,"into_str_keys","","Convert this stream into a vector of Unicode strings.",28,null],[11,"into_values","","Convert this stream into a vector of outputs.",28,null],[11,"next","","",29,null],[11,"next","","",30,null],[11,"ge","","Specify a greater-than-or-equal-to bound.",31,null],[11,"gt","","Specify a greater-than bound.",31,null],[11,"le","","Specify a less-than-or-equal-to bound.",31,null],[11,"lt","","Specify a less-than bound.",31,null],[11,"into_stream","","",31,null],[11,"new","","Create a new set operation builder.",32,{"inputs":[],"output":{"name":"self"}}],[11,"add","","Add a stream to this set operation.",32,null],[11,"push","","Add a stream to this set operation.",32,null],[11,"union","","Performs a union operation on all streams that have been added.",32,null],[11,"intersection","","Performs an intersection operation on all streams that have been added.",32,null],[11,"difference","","Performs a difference operation with respect to the first stream added.\nThat is, this returns a stream of all elements in the first stream\nthat don't exist in any other stream that has been added.",32,null],[11,"symmetric_difference","","Performs a symmetric difference operation on all of the streams that\nhave been added.",32,null],[11,"extend","","",32,null],[11,"from_iter","","",32,{"inputs":[{"name":"t"}],"output":{"name":"self"}}],[11,"next","","",33,null],[11,"next","","",34,null],[11,"next","","",35,null],[11,"next","","",36,null],[11,"into_strs","fst::set","Convert this stream into a vector of Unicode strings.",37,null],[11,"into_bytes","","Convert this stream into a vector of byte strings.",37,null],[11,"next","","",37,null],[11,"ge","","Specify a greater-than-or-equal-to bound.",38,null],[11,"gt","","Specify a greater-than bound.",38,null],[11,"le","","Specify a less-than-or-equal-to bound.",38,null],[11,"lt","","Specify a less-than bound.",38,null],[11,"into_stream","","",38,null],[11,"new","","Create a new set operation builder.",39,{"inputs":[],"output":{"name":"self"}}],[11,"add","","Add a stream to this set operation.",39,null],[11,"push","","Add a stream to this set operation.",39,null],[11,"union","","Performs a union operation on all streams that have been added.",39,null],[11,"intersection","","Performs an intersection operation on all streams that have been added.",39,null],[11,"difference","","Performs a difference operation with respect to the first stream added.\nThat is, this returns a stream of all elements in the first stream\nthat don't exist in any other stream that has been added.",39,null],[11,"symmetric_difference","","Performs a symmetric difference operation on all of the streams that\nhave been added.",39,null],[11,"extend","","",39,null],[11,"from_iter","","",39,{"inputs":[{"name":"t"}],"output":{"name":"self"}}],[11,"next","","",40,null],[11,"next","","",41,null],[11,"next","","",42,null],[11,"next","","",43,null]],"paths":[[4,"Error"],[4,"LevenshteinError"],[4,"RegexError"],[3,"Levenshtein"],[3,"Map"],[3,"MapBuilder"],[3,"IndexedValue"],[3,"Transition"],[4,"Error"],[3,"Builder"],[3,"MmapReadOnly"],[3,"Node"],[3,"Transitions"],[3,"OpBuilder"],[3,"Union"],[3,"Intersection"],[3,"Difference"],[3,"SymmetricDifference"],[3,"Fst"],[3,"StreamBuilder"],[3,"Stream"],[3,"Output"],[3,"Regex"],[3,"Set"],[3,"SetBuilder"],[8,"Automaton"],[8,"IntoStreamer"],[8,"Streamer"],[3,"Stream"],[3,"Keys"],[3,"Values"],[3,"StreamBuilder"],[3,"OpBuilder"],[3,"Union"],[3,"Intersection"],[3,"Difference"],[3,"SymmetricDifference"],[3,"Stream"],[3,"StreamBuilder"],[3,"OpBuilder"],[3,"Union"],[3,"Intersection"],[3,"Difference"],[3,"SymmetricDifference"]]};
initSearch(searchIndex);