From 0cb052fbff2c03dc62d180b177ccaaac30815501 Mon Sep 17 00:00:00 2001 From: Josh Holmer Date: Thu, 14 Jul 2016 20:09:21 -0400 Subject: [PATCH] Remove documentation from master branch [ci skip] --- doc/.lock | 0 doc/COPYRIGHT.txt | 64 - doc/FiraSans-LICENSE.txt | 99 - doc/FiraSans-Medium.woff | Bin 89883 -> 0 bytes doc/FiraSans-Regular.woff | Bin 91946 -> 0 bytes doc/Heuristica-Italic.woff | Bin 119956 -> 0 bytes doc/Heuristica-LICENSE.txt | 101 - doc/LICENSE-APACHE.txt | 201 - doc/LICENSE-MIT.txt | 23 - doc/SourceCodePro-LICENSE.txt | 93 - doc/SourceCodePro-Regular.woff | Bin 55472 -> 0 bytes doc/SourceCodePro-Semibold.woff | Bin 55360 -> 0 bytes doc/SourceSerifPro-Bold.woff | Bin 48720 -> 0 bytes doc/SourceSerifPro-LICENSE.txt | 93 - doc/SourceSerifPro-Regular.woff | Bin 49960 -> 0 bytes doc/aho_corasick/autiter/index.html | 0 doc/aho_corasick/autiter/sidebar-items.js | 1 - doc/aho_corasick/autiter/struct.Match.html | 10 - doc/aho_corasick/autiter/struct.Matches.html | 10 - .../autiter/struct.MatchesOverlapping.html | 10 - .../autiter/struct.StreamMatches.html | 10 - .../struct.StreamMatchesOverlapping.html | 10 - doc/aho_corasick/autiter/trait.Automaton.html | 10 - doc/aho_corasick/full/index.html | 0 doc/aho_corasick/full/sidebar-items.js | 1 - .../full/struct.FullAcAutomaton.html | 10 - doc/aho_corasick/index.html | 311 - doc/aho_corasick/sidebar-items.js | 1 - doc/aho_corasick/struct.AcAutomaton.html | 152 - doc/aho_corasick/struct.Dense.html | 122 - doc/aho_corasick/struct.FullAcAutomaton.html | 140 - doc/aho_corasick/struct.Match.html | 137 - doc/aho_corasick/struct.Matches.html | 169 - .../struct.MatchesOverlapping.html | 169 - doc/aho_corasick/struct.Sparse.html | 123 - doc/aho_corasick/struct.StreamMatches.html | 169 - .../struct.StreamMatchesOverlapping.html | 169 - doc/aho_corasick/trait.Automaton.html | 161 - doc/aho_corasick/trait.Transitions.html | 138 - doc/aho_corasick/type.StateIdx.html | 116 - doc/ansi_term/enum.Colour.html | 185 - doc/ansi_term/index.html | 274 - doc/ansi_term/sidebar-items.js | 1 - doc/ansi_term/struct.ANSIString.html | 1367 -- doc/ansi_term/struct.ANSIStrings.html | 115 - doc/ansi_term/struct.Style.html | 142 - doc/bit_vec/index.html | 199 - doc/bit_vec/sidebar-items.js | 1 - doc/bit_vec/struct.BitVec.html | 538 - doc/bit_vec/struct.Blocks.html | 167 - doc/bit_vec/struct.IntoIter.html | 164 - doc/bit_vec/struct.Iter.html | 167 - doc/bit_vec/trait.BitBlock.html | 143 - doc/bitflags/__core/__rand/fn.thread_rng.html | 10 - doc/bitflags/__core/__rand/index.html | 10 - doc/bitflags/__core/__rand/sidebar-items.js | 1 - .../__core/__rand/struct.ThreadRng.html | 10 - doc/bitflags/__core/__rand/trait.Rng.html | 10 - doc/bitflags/__core/any/index.html | 184 - doc/bitflags/__core/any/sidebar-items.js | 1 - doc/bitflags/__core/any/struct.TypeId.html | 132 - doc/bitflags/__core/any/trait.Any.html | 145 - .../__core/ascii/fn.escape_default.html | 137 - doc/bitflags/__core/ascii/index.html | 138 - doc/bitflags/__core/ascii/sidebar-items.js | 1 - .../__core/ascii/struct.EscapeDefault.html | 166 - doc/bitflags/__core/ascii/trait.AsciiExt.html | 237 - doc/bitflags/__core/borrow/enum.Cow.html | 293 - doc/bitflags/__core/borrow/index.html | 143 - doc/bitflags/__core/borrow/sidebar-items.js | 1 - doc/bitflags/__core/borrow/trait.Borrow.html | 201 - .../__core/borrow/trait.BorrowMut.html | 175 - doc/bitflags/__core/borrow/trait.ToOwned.html | 149 - doc/bitflags/__core/boxed/constant.HEAP.html | 128 - doc/bitflags/__core/boxed/index.html | 195 - doc/bitflags/__core/boxed/sidebar-items.js | 1 - doc/bitflags/__core/boxed/struct.Box.html | 287 - .../boxed/struct.ExchangeHeapSingleton.html | 123 - .../__core/boxed/struct.IntermediateBox.html | 143 - doc/bitflags/__core/boxed/trait.FnBox.html | 164 - .../__core/cell/enum.BorrowState.html | 126 - doc/bitflags/__core/cell/index.html | 281 - doc/bitflags/__core/cell/sidebar-items.js | 1 - doc/bitflags/__core/cell/struct.Cell.html | 163 - doc/bitflags/__core/cell/struct.Ref.html | 168 - doc/bitflags/__core/cell/struct.RefCell.html | 217 - doc/bitflags/__core/cell/struct.RefMut.html | 169 - .../__core/cell/struct.UnsafeCell.html | 170 - doc/bitflags/__core/char/constant.MAX.html | 117 - .../char/constant.REPLACEMENT_CHARACTER.html | 117 - .../__core/char/constant.UNICODE_VERSION.html | 114 - doc/bitflags/__core/char/fn.decode_utf16.html | 153 - doc/bitflags/__core/char/fn.from_digit.html | 161 - doc/bitflags/__core/char/fn.from_u32.html | 148 - .../__core/char/fn.from_u32_unchecked.html | 141 - doc/bitflags/__core/char/index.html | 240 - doc/bitflags/__core/char/sidebar-items.js | 1 - .../__core/char/struct.DecodeUtf16.html | 165 - .../__core/char/struct.DecodeUtf16Error.html | 125 - .../__core/char/struct.EncodeUtf16.html | 169 - .../__core/char/struct.EncodeUtf8.html | 169 - .../__core/char/struct.EscapeDefault.html | 169 - .../__core/char/struct.EscapeUnicode.html | 170 - .../__core/char/struct.ToLowercase.html | 164 - .../__core/char/struct.ToUppercase.html | 164 - doc/bitflags/__core/clone/index.html | 151 - doc/bitflags/__core/clone/sidebar-items.js | 1 - doc/bitflags/__core/clone/trait.Clone.html | 495 - doc/bitflags/__core/cmp/enum.Ordering.html | 176 - doc/bitflags/__core/cmp/fn.max.html | 122 - doc/bitflags/__core/cmp/fn.min.html | 122 - doc/bitflags/__core/cmp/index.html | 184 - doc/bitflags/__core/cmp/sidebar-items.js | 1 - doc/bitflags/__core/cmp/trait.Eq.html | 317 - doc/bitflags/__core/cmp/trait.Ord.html | 295 - doc/bitflags/__core/cmp/trait.PartialEq.html | 690 - doc/bitflags/__core/cmp/trait.PartialOrd.html | 418 - .../__core/collections/binary_heap/index.html | 273 - .../collections/binary_heap/sidebar-items.js | 1 - .../binary_heap/struct.BinaryHeap.html | 491 - .../collections/binary_heap/struct.Drain.html | 165 - .../binary_heap/struct.IntoIter.html | 167 - .../collections/binary_heap/struct.Iter.html | 167 - .../collections/btree_map/enum.Entry.html | 125 - .../__core/collections/btree_map/index.html | 198 - .../collections/btree_map/sidebar-items.js | 1 - .../btree_map/struct.BTreeMap.html | 588 - .../btree_map/struct.IntoIter.html | 172 - .../collections/btree_map/struct.Iter.html | 173 - .../collections/btree_map/struct.IterMut.html | 170 - .../collections/btree_map/struct.Keys.html | 173 - .../btree_map/struct.OccupiedEntry.html | 128 - .../collections/btree_map/struct.Range.html | 171 - .../btree_map/struct.RangeMut.html | 168 - .../btree_map/struct.VacantEntry.html | 121 - .../collections/btree_map/struct.Values.html | 173 - .../btree_map/struct.ValuesMut.html | 171 - .../__core/collections/btree_set/index.html | 169 - .../collections/btree_set/sidebar-items.js | 1 - .../btree_set/struct.BTreeSet.html | 524 - .../btree_set/struct.Difference.html | 166 - .../btree_set/struct.Intersection.html | 166 - .../btree_set/struct.IntoIter.html | 165 - .../collections/btree_set/struct.Iter.html | 168 - .../collections/btree_set/struct.Range.html | 171 - .../btree_set/struct.SymmetricDifference.html | 166 - .../collections/btree_set/struct.Union.html | 166 - .../__core/collections/enum.Bound.html | 128 - .../collections/hash_map/enum.Entry.html | 125 - .../__core/collections/hash_map/index.html | 200 - .../collections/hash_map/sidebar-items.js | 1 - .../collections/hash_map/struct.Drain.html | 164 - .../collections/hash_map/struct.HashMap.html | 615 - .../collections/hash_map/struct.IntoIter.html | 164 - .../collections/hash_map/struct.Iter.html | 166 - .../collections/hash_map/struct.IterMut.html | 164 - .../collections/hash_map/struct.Keys.html | 166 - .../hash_map/struct.OccupiedEntry.html | 128 - .../hash_map/struct.RandomState.html | 126 - .../hash_map/struct.VacantEntry.html | 121 - .../collections/hash_map/struct.Values.html | 166 - .../hash_map/struct.ValuesMut.html | 169 - .../__core/collections/hash_set/index.html | 171 - .../collections/hash_set/sidebar-items.js | 1 - .../hash_set/struct.Difference.html | 165 - .../collections/hash_set/struct.Drain.html | 164 - .../collections/hash_set/struct.HashSet.html | 618 - .../hash_set/struct.Intersection.html | 165 - .../collections/hash_set/struct.IntoIter.html | 164 - .../collections/hash_set/struct.Iter.html | 166 - .../hash_set/struct.SymmetricDifference.html | 165 - .../collections/hash_set/struct.Union.html | 165 - doc/bitflags/__core/collections/index.html | 678 - .../__core/collections/linked_list/index.html | 159 - .../collections/linked_list/sidebar-items.js | 1 - .../linked_list/struct.BackPlace.html | 129 - .../linked_list/struct.FrontPlace.html | 129 - .../linked_list/struct.IntoIter.html | 167 - .../collections/linked_list/struct.Iter.html | 167 - .../linked_list/struct.IterMut.html | 205 - .../linked_list/struct.LinkedList.html | 418 - .../__core/collections/sidebar-items.js | 1 - .../__core/collections/struct.BTreeMap.html | 588 - .../__core/collections/struct.BTreeSet.html | 524 - .../__core/collections/struct.BinaryHeap.html | 491 - .../__core/collections/struct.HashMap.html | 615 - .../__core/collections/struct.HashSet.html | 618 - .../__core/collections/struct.LinkedList.html | 418 - .../__core/collections/struct.VecDeque.html | 643 - .../__core/collections/vec_deque/index.html | 156 - .../collections/vec_deque/sidebar-items.js | 1 - .../collections/vec_deque/struct.Drain.html | 166 - .../vec_deque/struct.IntoIter.html | 167 - .../collections/vec_deque/struct.Iter.html | 167 - .../collections/vec_deque/struct.IterMut.html | 165 - .../vec_deque/struct.VecDeque.html | 643 - doc/bitflags/__core/convert/index.html | 172 - doc/bitflags/__core/convert/sidebar-items.js | 1 - doc/bitflags/__core/convert/trait.AsMut.html | 171 - doc/bitflags/__core/convert/trait.AsRef.html | 216 - doc/bitflags/__core/convert/trait.From.html | 211 - doc/bitflags/__core/convert/trait.Into.html | 152 - doc/bitflags/__core/default/index.html | 178 - doc/bitflags/__core/default/sidebar-items.js | 1 - .../__core/default/trait.Default.html | 256 - .../__core/env/consts/constant.ARCH.html | 126 - .../env/consts/constant.DLL_EXTENSION.html | 122 - .../env/consts/constant.DLL_PREFIX.html | 121 - .../env/consts/constant.DLL_SUFFIX.html | 122 - .../env/consts/constant.EXE_EXTENSION.html | 121 - .../env/consts/constant.EXE_SUFFIX.html | 123 - .../__core/env/consts/constant.FAMILY.html | 120 - .../__core/env/consts/constant.OS.html | 130 - doc/bitflags/__core/env/consts/index.html | 177 - .../__core/env/consts/sidebar-items.js | 1 - doc/bitflags/__core/env/enum.VarError.html | 130 - doc/bitflags/__core/env/fn.args.html | 132 - doc/bitflags/__core/env/fn.args_os.html | 127 - doc/bitflags/__core/env/fn.current_dir.html | 130 - doc/bitflags/__core/env/fn.current_exe.html | 131 - doc/bitflags/__core/env/fn.home_dir.html | 135 - doc/bitflags/__core/env/fn.join_paths.html | 132 - doc/bitflags/__core/env/fn.remove_var.html | 142 - .../__core/env/fn.set_current_dir.html | 123 - doc/bitflags/__core/env/fn.set_var.html | 140 - doc/bitflags/__core/env/fn.split_paths.html | 130 - doc/bitflags/__core/env/fn.temp_dir.html | 133 - doc/bitflags/__core/env/fn.var.html | 127 - doc/bitflags/__core/env/fn.var_os.html | 124 - doc/bitflags/__core/env/fn.vars.html | 133 - doc/bitflags/__core/env/fn.vars_os.html | 128 - doc/bitflags/__core/env/index.html | 295 - doc/bitflags/__core/env/sidebar-items.js | 1 - doc/bitflags/__core/env/struct.Args.html | 167 - doc/bitflags/__core/env/struct.ArgsOs.html | 167 - .../__core/env/struct.JoinPathsError.html | 120 - .../__core/env/struct.SplitPaths.html | 166 - doc/bitflags/__core/env/struct.Vars.html | 165 - doc/bitflags/__core/env/struct.VarsOs.html | 166 - doc/bitflags/__core/error/index.html | 144 - doc/bitflags/__core/error/sidebar-items.js | 1 - doc/bitflags/__core/error/trait.Error.html | 185 - doc/bitflags/__core/f32/constant.DIGITS.html | 112 - doc/bitflags/__core/f32/constant.EPSILON.html | 112 - .../__core/f32/constant.INFINITY.html | 112 - .../__core/f32/constant.MANTISSA_DIGITS.html | 112 - doc/bitflags/__core/f32/constant.MAX.html | 113 - .../__core/f32/constant.MAX_10_EXP.html | 112 - doc/bitflags/__core/f32/constant.MAX_EXP.html | 112 - doc/bitflags/__core/f32/constant.MIN.html | 113 - .../__core/f32/constant.MIN_10_EXP.html | 112 - doc/bitflags/__core/f32/constant.MIN_EXP.html | 112 - .../__core/f32/constant.MIN_POSITIVE.html | 113 - doc/bitflags/__core/f32/constant.NAN.html | 112 - .../__core/f32/constant.NEG_INFINITY.html | 112 - doc/bitflags/__core/f32/constant.RADIX.html | 112 - .../__core/f32/consts/constant.E.html | 113 - .../__core/f32/consts/constant.FRAC_1_PI.html | 113 - .../f32/consts/constant.FRAC_1_SQRT_2.html | 113 - .../__core/f32/consts/constant.FRAC_2_PI.html | 113 - .../f32/consts/constant.FRAC_2_SQRT_PI.html | 113 - .../__core/f32/consts/constant.FRAC_PI_2.html | 113 - .../__core/f32/consts/constant.FRAC_PI_3.html | 113 - .../__core/f32/consts/constant.FRAC_PI_4.html | 113 - .../__core/f32/consts/constant.FRAC_PI_6.html | 113 - .../__core/f32/consts/constant.FRAC_PI_8.html | 113 - .../__core/f32/consts/constant.LN_10.html | 113 - .../__core/f32/consts/constant.LN_2.html | 113 - .../__core/f32/consts/constant.LOG10_E.html | 113 - .../__core/f32/consts/constant.LOG2_E.html | 113 - .../__core/f32/consts/constant.PI.html | 113 - .../__core/f32/consts/constant.SQRT_2.html | 113 - doc/bitflags/__core/f32/consts/index.html | 226 - .../__core/f32/consts/sidebar-items.js | 1 - doc/bitflags/__core/f32/index.html | 222 - doc/bitflags/__core/f32/sidebar-items.js | 1 - doc/bitflags/__core/f64/constant.DIGITS.html | 112 - doc/bitflags/__core/f64/constant.EPSILON.html | 112 - .../__core/f64/constant.INFINITY.html | 112 - .../__core/f64/constant.MANTISSA_DIGITS.html | 112 - doc/bitflags/__core/f64/constant.MAX.html | 113 - .../__core/f64/constant.MAX_10_EXP.html | 112 - doc/bitflags/__core/f64/constant.MAX_EXP.html | 112 - doc/bitflags/__core/f64/constant.MIN.html | 113 - .../__core/f64/constant.MIN_10_EXP.html | 112 - doc/bitflags/__core/f64/constant.MIN_EXP.html | 112 - .../__core/f64/constant.MIN_POSITIVE.html | 113 - doc/bitflags/__core/f64/constant.NAN.html | 112 - .../__core/f64/constant.NEG_INFINITY.html | 112 - doc/bitflags/__core/f64/constant.RADIX.html | 112 - .../__core/f64/consts/constant.E.html | 113 - .../__core/f64/consts/constant.FRAC_1_PI.html | 113 - .../f64/consts/constant.FRAC_1_SQRT_2.html | 113 - .../__core/f64/consts/constant.FRAC_2_PI.html | 113 - .../f64/consts/constant.FRAC_2_SQRT_PI.html | 113 - .../__core/f64/consts/constant.FRAC_PI_2.html | 113 - .../__core/f64/consts/constant.FRAC_PI_3.html | 113 - .../__core/f64/consts/constant.FRAC_PI_4.html | 113 - .../__core/f64/consts/constant.FRAC_PI_6.html | 113 - .../__core/f64/consts/constant.FRAC_PI_8.html | 113 - .../__core/f64/consts/constant.LN_10.html | 113 - .../__core/f64/consts/constant.LN_2.html | 113 - .../__core/f64/consts/constant.LOG10_E.html | 113 - .../__core/f64/consts/constant.LOG2_E.html | 113 - .../__core/f64/consts/constant.PI.html | 113 - .../__core/f64/consts/constant.SQRT_2.html | 113 - doc/bitflags/__core/f64/consts/index.html | 226 - .../__core/f64/consts/sidebar-items.js | 1 - doc/bitflags/__core/f64/index.html | 222 - doc/bitflags/__core/f64/sidebar-items.js | 1 - doc/bitflags/__core/ffi/index.html | 159 - doc/bitflags/__core/ffi/sidebar-items.js | 1 - doc/bitflags/__core/ffi/struct.CStr.html | 312 - doc/bitflags/__core/ffi/struct.CString.html | 295 - .../__core/ffi/struct.IntoStringError.html | 129 - doc/bitflags/__core/ffi/struct.NulError.html | 128 - doc/bitflags/__core/ffi/struct.OsStr.html | 240 - doc/bitflags/__core/ffi/struct.OsString.html | 269 - doc/bitflags/__core/fmt/fn.format.html | 126 - doc/bitflags/__core/fmt/fn.write.html | 121 - doc/bitflags/__core/fmt/index.html | 702 - doc/bitflags/__core/fmt/rt/index.html | 10 - doc/bitflags/__core/fmt/rt/sidebar-items.js | 1 - .../__core/fmt/rt/v1/enum.Alignment.html | 10 - doc/bitflags/__core/fmt/rt/v1/enum.Count.html | 10 - .../__core/fmt/rt/v1/enum.Position.html | 10 - doc/bitflags/__core/fmt/rt/v1/index.html | 10 - .../__core/fmt/rt/v1/sidebar-items.js | 1 - .../__core/fmt/rt/v1/struct.Argument.html | 10 - .../__core/fmt/rt/v1/struct.FormatSpec.html | 10 - doc/bitflags/__core/fmt/sidebar-items.js | 1 - doc/bitflags/__core/fmt/struct.Arguments.html | 127 - doc/bitflags/__core/fmt/struct.DebugList.html | 124 - doc/bitflags/__core/fmt/struct.DebugMap.html | 124 - doc/bitflags/__core/fmt/struct.DebugSet.html | 124 - .../__core/fmt/struct.DebugStruct.html | 122 - .../__core/fmt/struct.DebugTuple.html | 122 - doc/bitflags/__core/fmt/struct.Error.html | 132 - doc/bitflags/__core/fmt/struct.Formatter.html | 272 - doc/bitflags/__core/fmt/trait.Binary.html | 170 - doc/bitflags/__core/fmt/trait.Debug.html | 504 - doc/bitflags/__core/fmt/trait.Display.html | 207 - doc/bitflags/__core/fmt/trait.LowerExp.html | 158 - doc/bitflags/__core/fmt/trait.LowerHex.html | 171 - doc/bitflags/__core/fmt/trait.Octal.html | 170 - doc/bitflags/__core/fmt/trait.Pointer.html | 217 - doc/bitflags/__core/fmt/trait.UpperExp.html | 158 - doc/bitflags/__core/fmt/trait.UpperHex.html | 171 - doc/bitflags/__core/fmt/trait.Write.html | 162 - doc/bitflags/__core/fmt/type.Result.html | 112 - doc/bitflags/__core/fs/fn.canonicalize.html | 134 - doc/bitflags/__core/fs/fn.copy.html | 145 - doc/bitflags/__core/fs/fn.create_dir.html | 133 - doc/bitflags/__core/fs/fn.create_dir_all.html | 136 - doc/bitflags/__core/fs/fn.hard_link.html | 135 - doc/bitflags/__core/fs/fn.metadata.html | 138 - doc/bitflags/__core/fs/fn.read_dir.html | 152 - doc/bitflags/__core/fs/fn.read_link.html | 134 - doc/bitflags/__core/fs/fn.remove_dir.html | 133 - doc/bitflags/__core/fs/fn.remove_dir_all.html | 132 - doc/bitflags/__core/fs/fn.remove_file.html | 137 - doc/bitflags/__core/fs/fn.rename.html | 143 - .../__core/fs/fn.set_permissions.html | 135 - doc/bitflags/__core/fs/fn.soft_link.html | 126 - .../__core/fs/fn.symlink_metadata.html | 134 - doc/bitflags/__core/fs/index.html | 287 - doc/bitflags/__core/fs/sidebar-items.js | 1 - doc/bitflags/__core/fs/struct.DirBuilder.html | 141 - doc/bitflags/__core/fs/struct.DirEntry.html | 163 - doc/bitflags/__core/fs/struct.File.html | 261 - doc/bitflags/__core/fs/struct.FileType.html | 129 - doc/bitflags/__core/fs/struct.Metadata.html | 231 - .../__core/fs/struct.OpenOptions.html | 285 - .../__core/fs/struct.Permissions.html | 158 - doc/bitflags/__core/fs/struct.ReadDir.html | 170 - doc/bitflags/__core/hash/index.html | 207 - doc/bitflags/__core/hash/sidebar-items.js | 1 - .../hash/struct.BuildHasherDefault.html | 122 - .../__core/hash/struct.SipHasher.html | 149 - .../__core/hash/trait.BuildHasher.html | 136 - doc/bitflags/__core/hash/trait.Hash.html | 298 - doc/bitflags/__core/hash/trait.Hasher.html | 151 - doc/bitflags/__core/i16/constant.MAX.html | 112 - doc/bitflags/__core/i16/constant.MIN.html | 112 - doc/bitflags/__core/i16/index.html | 130 - doc/bitflags/__core/i16/sidebar-items.js | 1 - doc/bitflags/__core/i32/constant.MAX.html | 112 - doc/bitflags/__core/i32/constant.MIN.html | 112 - doc/bitflags/__core/i32/index.html | 130 - doc/bitflags/__core/i32/sidebar-items.js | 1 - doc/bitflags/__core/i64/constant.MAX.html | 112 - doc/bitflags/__core/i64/constant.MIN.html | 112 - doc/bitflags/__core/i64/index.html | 130 - doc/bitflags/__core/i64/sidebar-items.js | 1 - doc/bitflags/__core/i8/constant.MAX.html | 112 - doc/bitflags/__core/i8/constant.MIN.html | 112 - doc/bitflags/__core/i8/index.html | 130 - doc/bitflags/__core/i8/sidebar-items.js | 1 - doc/bitflags/__core/index.html | 493 - doc/bitflags/__core/intrinsics/fn.abort.html | 114 - .../intrinsics/fn.add_with_overflow.html | 114 - .../__core/intrinsics/fn.arith_offset.html | 123 - doc/bitflags/__core/intrinsics/fn.assume.html | 121 - .../__core/intrinsics/fn.atomic_and.html | 113 - .../__core/intrinsics/fn.atomic_and_acq.html | 113 - .../intrinsics/fn.atomic_and_acqrel.html | 113 - .../__core/intrinsics/fn.atomic_and_rel.html | 113 - .../intrinsics/fn.atomic_and_relaxed.html | 113 - .../__core/intrinsics/fn.atomic_cxchg.html | 113 - .../intrinsics/fn.atomic_cxchg_acq.html | 113 - .../fn.atomic_cxchg_acq_failrelaxed.html | 113 - .../intrinsics/fn.atomic_cxchg_acqrel.html | 113 - .../fn.atomic_cxchg_acqrel_failrelaxed.html | 113 - .../intrinsics/fn.atomic_cxchg_failacq.html | 113 - .../fn.atomic_cxchg_failrelaxed.html | 113 - .../intrinsics/fn.atomic_cxchg_rel.html | 113 - .../intrinsics/fn.atomic_cxchg_relaxed.html | 113 - .../intrinsics/fn.atomic_cxchgweak.html | 113 - .../intrinsics/fn.atomic_cxchgweak_acq.html | 113 - .../fn.atomic_cxchgweak_acq_failrelaxed.html | 113 - .../fn.atomic_cxchgweak_acqrel.html | 113 - ...n.atomic_cxchgweak_acqrel_failrelaxed.html | 113 - .../fn.atomic_cxchgweak_failacq.html | 113 - .../fn.atomic_cxchgweak_failrelaxed.html | 113 - .../intrinsics/fn.atomic_cxchgweak_rel.html | 113 - .../fn.atomic_cxchgweak_relaxed.html | 113 - .../__core/intrinsics/fn.atomic_fence.html | 113 - .../intrinsics/fn.atomic_fence_acq.html | 113 - .../intrinsics/fn.atomic_fence_acqrel.html | 113 - .../intrinsics/fn.atomic_fence_rel.html | 113 - .../__core/intrinsics/fn.atomic_load.html | 113 - .../__core/intrinsics/fn.atomic_load_acq.html | 113 - .../intrinsics/fn.atomic_load_relaxed.html | 113 - .../intrinsics/fn.atomic_load_unordered.html | 113 - .../__core/intrinsics/fn.atomic_max.html | 113 - .../__core/intrinsics/fn.atomic_max_acq.html | 113 - .../intrinsics/fn.atomic_max_acqrel.html | 113 - .../__core/intrinsics/fn.atomic_max_rel.html | 113 - .../intrinsics/fn.atomic_max_relaxed.html | 113 - .../__core/intrinsics/fn.atomic_min.html | 113 - .../__core/intrinsics/fn.atomic_min_acq.html | 113 - .../intrinsics/fn.atomic_min_acqrel.html | 113 - .../__core/intrinsics/fn.atomic_min_rel.html | 113 - .../intrinsics/fn.atomic_min_relaxed.html | 113 - .../__core/intrinsics/fn.atomic_nand.html | 113 - .../__core/intrinsics/fn.atomic_nand_acq.html | 113 - .../intrinsics/fn.atomic_nand_acqrel.html | 113 - .../__core/intrinsics/fn.atomic_nand_rel.html | 113 - .../intrinsics/fn.atomic_nand_relaxed.html | 113 - .../__core/intrinsics/fn.atomic_or.html | 113 - .../__core/intrinsics/fn.atomic_or_acq.html | 113 - .../intrinsics/fn.atomic_or_acqrel.html | 113 - .../__core/intrinsics/fn.atomic_or_rel.html | 113 - .../intrinsics/fn.atomic_or_relaxed.html | 113 - .../fn.atomic_singlethreadfence.html | 119 - .../fn.atomic_singlethreadfence_acq.html | 113 - .../fn.atomic_singlethreadfence_acqrel.html | 113 - .../fn.atomic_singlethreadfence_rel.html | 113 - .../__core/intrinsics/fn.atomic_store.html | 113 - .../intrinsics/fn.atomic_store_rel.html | 113 - .../intrinsics/fn.atomic_store_relaxed.html | 113 - .../intrinsics/fn.atomic_store_unordered.html | 113 - .../__core/intrinsics/fn.atomic_umax.html | 113 - .../__core/intrinsics/fn.atomic_umax_acq.html | 113 - .../intrinsics/fn.atomic_umax_acqrel.html | 113 - .../__core/intrinsics/fn.atomic_umax_rel.html | 113 - .../intrinsics/fn.atomic_umax_relaxed.html | 113 - .../__core/intrinsics/fn.atomic_umin.html | 113 - .../__core/intrinsics/fn.atomic_umin_acq.html | 113 - .../intrinsics/fn.atomic_umin_acqrel.html | 113 - .../__core/intrinsics/fn.atomic_umin_rel.html | 113 - .../intrinsics/fn.atomic_umin_relaxed.html | 113 - .../__core/intrinsics/fn.atomic_xadd.html | 113 - .../__core/intrinsics/fn.atomic_xadd_acq.html | 113 - .../intrinsics/fn.atomic_xadd_acqrel.html | 113 - .../__core/intrinsics/fn.atomic_xadd_rel.html | 113 - .../intrinsics/fn.atomic_xadd_relaxed.html | 113 - .../__core/intrinsics/fn.atomic_xchg.html | 113 - .../__core/intrinsics/fn.atomic_xchg_acq.html | 113 - .../intrinsics/fn.atomic_xchg_acqrel.html | 113 - .../__core/intrinsics/fn.atomic_xchg_rel.html | 113 - .../intrinsics/fn.atomic_xchg_relaxed.html | 113 - .../__core/intrinsics/fn.atomic_xor.html | 113 - .../__core/intrinsics/fn.atomic_xor_acq.html | 113 - .../intrinsics/fn.atomic_xor_acqrel.html | 113 - .../__core/intrinsics/fn.atomic_xor_rel.html | 113 - .../intrinsics/fn.atomic_xor_relaxed.html | 113 - .../__core/intrinsics/fn.atomic_xsub.html | 113 - .../__core/intrinsics/fn.atomic_xsub_acq.html | 113 - .../intrinsics/fn.atomic_xsub_acqrel.html | 113 - .../__core/intrinsics/fn.atomic_xsub_rel.html | 113 - .../intrinsics/fn.atomic_xsub_relaxed.html | 113 - .../__core/intrinsics/fn.breakpoint.html | 114 - doc/bitflags/__core/intrinsics/fn.bswap.html | 114 - .../__core/intrinsics/fn.ceilf32.html | 114 - .../__core/intrinsics/fn.ceilf64.html | 114 - doc/bitflags/__core/intrinsics/fn.copy.html | 135 - .../intrinsics/fn.copy_nonoverlapping.html | 147 - .../__core/intrinsics/fn.copysignf32.html | 114 - .../__core/intrinsics/fn.copysignf64.html | 114 - doc/bitflags/__core/intrinsics/fn.cosf32.html | 114 - doc/bitflags/__core/intrinsics/fn.cosf64.html | 114 - doc/bitflags/__core/intrinsics/fn.ctlz.html | 114 - doc/bitflags/__core/intrinsics/fn.ctpop.html | 114 - doc/bitflags/__core/intrinsics/fn.cttz.html | 114 - .../intrinsics/fn.discriminant_value.html | 115 - .../__core/intrinsics/fn.drop_in_place.html | 129 - .../__core/intrinsics/fn.exp2f32.html | 114 - .../__core/intrinsics/fn.exp2f64.html | 114 - doc/bitflags/__core/intrinsics/fn.expf32.html | 114 - doc/bitflags/__core/intrinsics/fn.expf64.html | 114 - .../__core/intrinsics/fn.fabsf32.html | 114 - .../__core/intrinsics/fn.fabsf64.html | 114 - .../__core/intrinsics/fn.fadd_fast.html | 115 - .../__core/intrinsics/fn.fdiv_fast.html | 115 - .../__core/intrinsics/fn.floorf32.html | 114 - .../__core/intrinsics/fn.floorf64.html | 114 - doc/bitflags/__core/intrinsics/fn.fmaf32.html | 114 - doc/bitflags/__core/intrinsics/fn.fmaf64.html | 114 - .../__core/intrinsics/fn.fmul_fast.html | 115 - doc/bitflags/__core/intrinsics/fn.forget.html | 114 - .../__core/intrinsics/fn.frem_fast.html | 115 - .../__core/intrinsics/fn.fsub_fast.html | 115 - doc/bitflags/__core/intrinsics/fn.init.html | 119 - .../__core/intrinsics/fn.init_dropped.html | 124 - .../__core/intrinsics/fn.log10f32.html | 114 - .../__core/intrinsics/fn.log10f64.html | 114 - .../__core/intrinsics/fn.log2f32.html | 114 - .../__core/intrinsics/fn.log2f64.html | 114 - doc/bitflags/__core/intrinsics/fn.logf32.html | 114 - doc/bitflags/__core/intrinsics/fn.logf64.html | 114 - .../__core/intrinsics/fn.min_align_of.html | 113 - .../intrinsics/fn.min_align_of_val.html | 113 - .../__core/intrinsics/fn.move_val_init.html | 116 - .../intrinsics/fn.mul_with_overflow.html | 114 - .../__core/intrinsics/fn.nearbyintf32.html | 114 - .../__core/intrinsics/fn.nearbyintf64.html | 114 - .../__core/intrinsics/fn.needs_drop.html | 119 - doc/bitflags/__core/intrinsics/fn.offset.html | 123 - .../__core/intrinsics/fn.overflowing_add.html | 114 - .../__core/intrinsics/fn.overflowing_mul.html | 114 - .../__core/intrinsics/fn.overflowing_sub.html | 114 - doc/bitflags/__core/intrinsics/fn.powf32.html | 114 - doc/bitflags/__core/intrinsics/fn.powf64.html | 114 - .../__core/intrinsics/fn.powif32.html | 114 - .../__core/intrinsics/fn.powif64.html | 114 - .../__core/intrinsics/fn.pref_align_of.html | 113 - .../__core/intrinsics/fn.return_address.html | 117 - .../__core/intrinsics/fn.rintf32.html | 115 - .../__core/intrinsics/fn.rintf64.html | 115 - .../__core/intrinsics/fn.roundf32.html | 114 - .../__core/intrinsics/fn.roundf64.html | 114 - doc/bitflags/__core/intrinsics/fn.sinf32.html | 114 - doc/bitflags/__core/intrinsics/fn.sinf64.html | 114 - .../__core/intrinsics/fn.size_of.html | 120 - .../__core/intrinsics/fn.size_of_val.html | 113 - .../__core/intrinsics/fn.sqrtf32.html | 114 - .../__core/intrinsics/fn.sqrtf64.html | 114 - .../intrinsics/fn.sub_with_overflow.html | 114 - .../__core/intrinsics/fn.transmute.html | 122 - .../__core/intrinsics/fn.truncf32.html | 114 - .../__core/intrinsics/fn.truncf64.html | 114 - doc/bitflags/__core/intrinsics/fn.try.html | 121 - .../__core/intrinsics/fn.type_id.html | 116 - .../__core/intrinsics/fn.type_name.html | 114 - .../__core/intrinsics/fn.unchecked_div.html | 115 - .../__core/intrinsics/fn.unchecked_rem.html | 115 - doc/bitflags/__core/intrinsics/fn.uninit.html | 120 - .../__core/intrinsics/fn.unreachable.html | 117 - .../intrinsics/fn.volatile_copy_memory.html | 118 - ...n.volatile_copy_nonoverlapping_memory.html | 118 - .../__core/intrinsics/fn.volatile_load.html | 114 - .../intrinsics/fn.volatile_set_memory.html | 118 - .../__core/intrinsics/fn.volatile_store.html | 114 - .../__core/intrinsics/fn.write_bytes.html | 114 - doc/bitflags/__core/intrinsics/index.html | 1399 -- .../__core/intrinsics/sidebar-items.js | 1 - doc/bitflags/__core/io/enum.CharsError.html | 132 - doc/bitflags/__core/io/enum.ErrorKind.html | 182 - doc/bitflags/__core/io/enum.SeekFrom.html | 134 - doc/bitflags/__core/io/fn.copy.html | 136 - doc/bitflags/__core/io/fn.empty.html | 125 - doc/bitflags/__core/io/fn.repeat.html | 116 - doc/bitflags/__core/io/fn.sink.html | 116 - doc/bitflags/__core/io/fn.stderr.html | 135 - doc/bitflags/__core/io/fn.stdin.html | 137 - doc/bitflags/__core/io/fn.stdout.html | 137 - doc/bitflags/__core/io/index.html | 571 - doc/bitflags/__core/io/prelude/index.html | 150 - .../__core/io/prelude/sidebar-items.js | 1 - .../__core/io/prelude/trait.BufRead.html | 343 - .../__core/io/prelude/trait.Read.html | 447 - .../__core/io/prelude/trait.Seek.html | 159 - .../__core/io/prelude/trait.Write.html | 287 - doc/bitflags/__core/io/sidebar-items.js | 1 - doc/bitflags/__core/io/struct.BufReader.html | 232 - doc/bitflags/__core/io/struct.BufWriter.html | 226 - doc/bitflags/__core/io/struct.Bytes.html | 166 - doc/bitflags/__core/io/struct.Chain.html | 133 - doc/bitflags/__core/io/struct.Chars.html | 169 - doc/bitflags/__core/io/struct.Cursor.html | 275 - doc/bitflags/__core/io/struct.Empty.html | 133 - doc/bitflags/__core/io/struct.Error.html | 175 - .../__core/io/struct.IntoInnerError.html | 194 - doc/bitflags/__core/io/struct.LineWriter.html | 225 - doc/bitflags/__core/io/struct.Lines.html | 166 - doc/bitflags/__core/io/struct.Repeat.html | 127 - doc/bitflags/__core/io/struct.Sink.html | 123 - doc/bitflags/__core/io/struct.Split.html | 167 - doc/bitflags/__core/io/struct.Stderr.html | 128 - doc/bitflags/__core/io/struct.StderrLock.html | 123 - doc/bitflags/__core/io/struct.Stdin.html | 168 - doc/bitflags/__core/io/struct.StdinLock.html | 133 - doc/bitflags/__core/io/struct.Stdout.html | 132 - doc/bitflags/__core/io/struct.StdoutLock.html | 123 - doc/bitflags/__core/io/struct.Take.html | 140 - doc/bitflags/__core/io/trait.BufRead.html | 343 - doc/bitflags/__core/io/trait.Read.html | 447 - doc/bitflags/__core/io/trait.Seek.html | 159 - doc/bitflags/__core/io/trait.Write.html | 287 - doc/bitflags/__core/io/type.Result.html | 112 - doc/bitflags/__core/isize/constant.MAX.html | 112 - doc/bitflags/__core/isize/constant.MIN.html | 112 - doc/bitflags/__core/isize/index.html | 130 - doc/bitflags/__core/isize/sidebar-items.js | 1 - doc/bitflags/__core/iter/fn.empty.html | 124 - doc/bitflags/__core/iter/fn.once.html | 158 - doc/bitflags/__core/iter/fn.repeat.html | 153 - doc/bitflags/__core/iter/index.html | 596 - doc/bitflags/__core/iter/sidebar-items.js | 1 - doc/bitflags/__core/iter/struct.Chain.html | 171 - doc/bitflags/__core/iter/struct.Cloned.html | 172 - doc/bitflags/__core/iter/struct.Cycle.html | 170 - doc/bitflags/__core/iter/struct.Empty.html | 169 - .../__core/iter/struct.Enumerate.html | 180 - doc/bitflags/__core/iter/struct.Filter.html | 171 - .../__core/iter/struct.FilterMap.html | 171 - doc/bitflags/__core/iter/struct.FlatMap.html | 172 - doc/bitflags/__core/iter/struct.Fuse.html | 173 - doc/bitflags/__core/iter/struct.Inspect.html | 173 - doc/bitflags/__core/iter/struct.Map.html | 209 - doc/bitflags/__core/iter/struct.Once.html | 170 - doc/bitflags/__core/iter/struct.Peekable.html | 233 - doc/bitflags/__core/iter/struct.Repeat.html | 169 - doc/bitflags/__core/iter/struct.Rev.html | 172 - doc/bitflags/__core/iter/struct.Scan.html | 170 - doc/bitflags/__core/iter/struct.Skip.html | 172 - .../__core/iter/struct.SkipWhile.html | 170 - doc/bitflags/__core/iter/struct.StepBy.html | 272 - doc/bitflags/__core/iter/struct.Take.html | 171 - .../__core/iter/struct.TakeWhile.html | 170 - doc/bitflags/__core/iter/struct.Zip.html | 172 - .../iter/trait.DoubleEndedIterator.html | 240 - .../__core/iter/trait.ExactSizeIterator.html | 255 - doc/bitflags/__core/iter/trait.Extend.html | 223 - .../__core/iter/trait.FromIterator.html | 234 - .../__core/iter/trait.IntoIterator.html | 326 - doc/bitflags/__core/iter/trait.Iterator.html | 1671 --- doc/bitflags/__core/iter/trait.Step.html | 146 - doc/bitflags/__core/marker/index.html | 170 - doc/bitflags/__core/marker/sidebar-items.js | 1 - .../__core/marker/struct.PhantomData.html | 216 - doc/bitflags/__core/marker/trait.Copy.html | 316 - doc/bitflags/__core/marker/trait.Reflect.html | 148 - doc/bitflags/__core/marker/trait.Send.html | 149 - doc/bitflags/__core/marker/trait.Sized.html | 128 - doc/bitflags/__core/marker/trait.Sync.html | 190 - doc/bitflags/__core/marker/trait.Unsize.html | 118 - .../__core/mem/constant.POST_DROP_U32.html | 113 - .../__core/mem/constant.POST_DROP_U64.html | 115 - .../__core/mem/constant.POST_DROP_U8.html | 112 - .../__core/mem/constant.POST_DROP_USIZE.html | 112 - doc/bitflags/__core/mem/fn.align_of.html | 121 - doc/bitflags/__core/mem/fn.align_of_val.html | 119 - doc/bitflags/__core/mem/fn.drop.html | 182 - doc/bitflags/__core/mem/fn.dropped.html | 124 - doc/bitflags/__core/mem/fn.forget.html | 194 - doc/bitflags/__core/mem/fn.min_align_of.html | 122 - .../__core/mem/fn.min_align_of_val.html | 120 - doc/bitflags/__core/mem/fn.replace.html | 154 - doc/bitflags/__core/mem/fn.size_of.html | 119 - doc/bitflags/__core/mem/fn.size_of_val.html | 119 - doc/bitflags/__core/mem/fn.swap.html | 126 - doc/bitflags/__core/mem/fn.transmute.html | 122 - .../__core/mem/fn.transmute_copy.html | 148 - doc/bitflags/__core/mem/fn.uninitialized.html | 187 - doc/bitflags/__core/mem/fn.zeroed.html | 128 - doc/bitflags/__core/mem/index.html | 256 - doc/bitflags/__core/mem/sidebar-items.js | 1 - doc/bitflags/__core/net/enum.IpAddr.html | 135 - .../__core/net/enum.Ipv6MulticastScope.html | 140 - doc/bitflags/__core/net/enum.Shutdown.html | 130 - doc/bitflags/__core/net/enum.SocketAddr.html | 145 - doc/bitflags/__core/net/fn.lookup_host.html | 127 - doc/bitflags/__core/net/index.html | 231 - doc/bitflags/__core/net/sidebar-items.js | 1 - .../__core/net/struct.AddrParseError.html | 121 - doc/bitflags/__core/net/struct.Incoming.html | 166 - doc/bitflags/__core/net/struct.Ipv4Addr.html | 202 - doc/bitflags/__core/net/struct.Ipv6Addr.html | 203 - .../__core/net/struct.LookupHost.html | 164 - .../__core/net/struct.SocketAddrV4.html | 137 - .../__core/net/struct.SocketAddrV6.html | 148 - .../__core/net/struct.TcpListener.html | 209 - doc/bitflags/__core/net/struct.TcpStream.html | 254 - doc/bitflags/__core/net/struct.UdpSocket.html | 292 - .../__core/net/trait.ToSocketAddrs.html | 200 - doc/bitflags/__core/num/enum.FpCategory.html | 133 - doc/bitflags/__core/num/index.html | 161 - doc/bitflags/__core/num/sidebar-items.js | 1 - .../__core/num/struct.ParseFloatError.html | 126 - .../__core/num/struct.ParseIntError.html | 126 - doc/bitflags/__core/num/struct.Wrapping.html | 459 - doc/bitflags/__core/num/trait.One.html | 141 - doc/bitflags/__core/num/trait.Zero.html | 141 - .../__core/ops/enum.RangeInclusive.html | 261 - doc/bitflags/__core/ops/index.html | 477 - doc/bitflags/__core/ops/sidebar-items.js | 1 - doc/bitflags/__core/ops/struct.Range.html | 242 - doc/bitflags/__core/ops/struct.RangeFrom.html | 219 - doc/bitflags/__core/ops/struct.RangeFull.html | 133 - doc/bitflags/__core/ops/struct.RangeTo.html | 154 - .../__core/ops/struct.RangeToInclusive.html | 156 - doc/bitflags/__core/ops/trait.Add.html | 213 - doc/bitflags/__core/ops/trait.AddAssign.html | 169 - doc/bitflags/__core/ops/trait.BitAnd.html | 208 - .../__core/ops/trait.BitAndAssign.html | 165 - doc/bitflags/__core/ops/trait.BitOr.html | 208 - .../__core/ops/trait.BitOrAssign.html | 165 - doc/bitflags/__core/ops/trait.BitXor.html | 208 - .../__core/ops/trait.BitXorAssign.html | 165 - doc/bitflags/__core/ops/trait.BoxPlace.html | 125 - doc/bitflags/__core/ops/trait.Boxed.html | 152 - .../__core/ops/trait.CoerceUnsized.html | 138 - doc/bitflags/__core/ops/trait.Deref.html | 177 - doc/bitflags/__core/ops/trait.DerefMut.html | 167 - doc/bitflags/__core/ops/trait.Div.html | 210 - doc/bitflags/__core/ops/trait.DivAssign.html | 167 - doc/bitflags/__core/ops/trait.Drop.html | 178 - doc/bitflags/__core/ops/trait.Fn.html | 125 - doc/bitflags/__core/ops/trait.FnMut.html | 126 - doc/bitflags/__core/ops/trait.FnOnce.html | 135 - doc/bitflags/__core/ops/trait.InPlace.html | 140 - doc/bitflags/__core/ops/trait.Index.html | 185 - doc/bitflags/__core/ops/trait.IndexMut.html | 182 - doc/bitflags/__core/ops/trait.Mul.html | 210 - doc/bitflags/__core/ops/trait.MulAssign.html | 167 - doc/bitflags/__core/ops/trait.Neg.html | 165 - doc/bitflags/__core/ops/trait.Not.html | 183 - doc/bitflags/__core/ops/trait.Place.html | 146 - doc/bitflags/__core/ops/trait.Placer.html | 154 - doc/bitflags/__core/ops/trait.Rem.html | 209 - doc/bitflags/__core/ops/trait.RemAssign.html | 166 - doc/bitflags/__core/ops/trait.Shl.html | 561 - doc/bitflags/__core/ops/trait.ShlAssign.html | 254 - doc/bitflags/__core/ops/trait.Shr.html | 561 - doc/bitflags/__core/ops/trait.ShrAssign.html | 254 - doc/bitflags/__core/ops/trait.Sub.html | 216 - doc/bitflags/__core/ops/trait.SubAssign.html | 169 - doc/bitflags/__core/option/enum.Option.html | 450 - doc/bitflags/__core/option/index.html | 263 - doc/bitflags/__core/option/sidebar-items.js | 1 - .../__core/option/struct.IntoIter.html | 168 - doc/bitflags/__core/option/struct.Iter.html | 168 - .../__core/option/struct.IterMut.html | 166 - doc/bitflags/__core/os/ext/ffi/index.html | 128 - .../__core/os/ext/ffi/sidebar-items.js | 1 - .../__core/os/ext/ffi/trait.OsStrExt.html | 126 - .../__core/os/ext/ffi/trait.OsStringExt.html | 127 - doc/bitflags/__core/os/ext/fs/fn.symlink.html | 129 - doc/bitflags/__core/os/ext/fs/index.html | 164 - .../__core/os/ext/fs/sidebar-items.js | 1 - .../__core/os/ext/fs/trait.DirBuilderExt.html | 126 - .../__core/os/ext/fs/trait.DirEntryExt.html | 126 - .../__core/os/ext/fs/trait.FileTypeExt.html | 131 - .../__core/os/ext/fs/trait.MetadataExt.html | 138 - .../os/ext/fs/trait.OpenOptionsExt.html | 153 - .../os/ext/fs/trait.PermissionsExt.html | 131 - doc/bitflags/__core/os/ext/index.html | 185 - doc/bitflags/__core/os/ext/io/index.html | 146 - .../__core/os/ext/io/sidebar-items.js | 1 - .../__core/os/ext/io/trait.AsRawFd.html | 143 - .../__core/os/ext/io/trait.FromRawFd.html | 144 - .../__core/os/ext/io/trait.IntoRawFd.html | 139 - doc/bitflags/__core/os/ext/io/type.RawFd.html | 112 - doc/bitflags/__core/os/ext/net/index.html | 150 - .../__core/os/ext/net/sidebar-items.js | 1 - .../__core/os/ext/net/struct.Incoming.html | 171 - .../__core/os/ext/net/struct.SocketAddr.html | 127 - .../os/ext/net/struct.UnixDatagram.html | 223 - .../os/ext/net/struct.UnixListener.html | 190 - .../__core/os/ext/net/struct.UnixStream.html | 226 - doc/bitflags/__core/os/ext/prelude/index.html | 218 - .../__core/os/ext/prelude/sidebar-items.js | 1 - .../__core/os/ext/prelude/trait.AsRawFd.html | 143 - .../os/ext/prelude/trait.CommandExt.html | 185 - .../os/ext/prelude/trait.DirEntryExt.html | 126 - .../os/ext/prelude/trait.ExitStatusExt.html | 125 - .../os/ext/prelude/trait.FileTypeExt.html | 131 - .../os/ext/prelude/trait.FromRawFd.html | 144 - .../os/ext/prelude/trait.IntoRawFd.html | 139 - .../os/ext/prelude/trait.JoinHandleExt.html | 131 - .../os/ext/prelude/trait.MetadataExt.html | 138 - .../os/ext/prelude/trait.OpenOptionsExt.html | 153 - .../__core/os/ext/prelude/trait.OsStrExt.html | 126 - .../os/ext/prelude/trait.OsStringExt.html | 127 - .../os/ext/prelude/trait.PermissionsExt.html | 131 - .../__core/os/ext/prelude/type.RawFd.html | 112 - doc/bitflags/__core/os/ext/process/index.html | 128 - .../__core/os/ext/process/sidebar-items.js | 1 - .../os/ext/process/trait.CommandExt.html | 185 - .../os/ext/process/trait.ExitStatusExt.html | 125 - doc/bitflags/__core/os/ext/raw/index.html | 199 - .../__core/os/ext/raw/sidebar-items.js | 1 - .../__core/os/ext/raw/type.blkcnt_t.html | 113 - .../__core/os/ext/raw/type.blksize_t.html | 113 - .../__core/os/ext/raw/type.dev_t.html | 113 - .../__core/os/ext/raw/type.gid_t.html | 113 - .../__core/os/ext/raw/type.ino_t.html | 113 - .../__core/os/ext/raw/type.mode_t.html | 113 - .../__core/os/ext/raw/type.nlink_t.html | 113 - .../__core/os/ext/raw/type.off_t.html | 113 - .../__core/os/ext/raw/type.pid_t.html | 113 - .../__core/os/ext/raw/type.pthread_t.html | 114 - .../__core/os/ext/raw/type.time_t.html | 113 - .../__core/os/ext/raw/type.uid_t.html | 113 - doc/bitflags/__core/os/ext/sidebar-items.js | 1 - doc/bitflags/__core/os/ext/thread/index.html | 129 - .../__core/os/ext/thread/sidebar-items.js | 1 - .../os/ext/thread/trait.JoinHandleExt.html | 131 - .../__core/os/ext/thread/type.RawPthread.html | 112 - doc/bitflags/__core/os/index.html | 135 - doc/bitflags/__core/os/macos/fs/index.html | 120 - .../__core/os/macos/fs/sidebar-items.js | 1 - .../__core/os/macos/fs/trait.MetadataExt.html | 153 - doc/bitflags/__core/os/macos/index.html | 128 - doc/bitflags/__core/os/macos/raw/index.html | 186 - .../__core/os/macos/raw/sidebar-items.js | 1 - .../__core/os/macos/raw/struct.stat.html | 183 - .../__core/os/macos/raw/type.blkcnt_t.html | 113 - .../__core/os/macos/raw/type.blksize_t.html | 113 - .../__core/os/macos/raw/type.dev_t.html | 113 - .../__core/os/macos/raw/type.ino_t.html | 113 - .../__core/os/macos/raw/type.mode_t.html | 113 - .../__core/os/macos/raw/type.nlink_t.html | 113 - .../__core/os/macos/raw/type.off_t.html | 113 - .../__core/os/macos/raw/type.pthread_t.html | 114 - .../__core/os/macos/raw/type.time_t.html | 113 - doc/bitflags/__core/os/macos/sidebar-items.js | 1 - doc/bitflags/__core/os/raw/enum.c_void.html | 119 - doc/bitflags/__core/os/raw/index.html | 213 - doc/bitflags/__core/os/raw/sidebar-items.js | 1 - doc/bitflags/__core/os/raw/type.c_char.html | 112 - doc/bitflags/__core/os/raw/type.c_double.html | 112 - doc/bitflags/__core/os/raw/type.c_float.html | 112 - doc/bitflags/__core/os/raw/type.c_int.html | 112 - doc/bitflags/__core/os/raw/type.c_long.html | 112 - .../__core/os/raw/type.c_longlong.html | 112 - doc/bitflags/__core/os/raw/type.c_schar.html | 112 - doc/bitflags/__core/os/raw/type.c_short.html | 112 - doc/bitflags/__core/os/raw/type.c_uchar.html | 112 - doc/bitflags/__core/os/raw/type.c_uint.html | 112 - doc/bitflags/__core/os/raw/type.c_ulong.html | 112 - .../__core/os/raw/type.c_ulonglong.html | 112 - doc/bitflags/__core/os/raw/type.c_ushort.html | 112 - doc/bitflags/__core/os/sidebar-items.js | 1 - .../__core/panic/fn.catch_unwind.html | 156 - doc/bitflags/__core/panic/fn.propagate.html | 115 - doc/bitflags/__core/panic/fn.recover.html | 115 - .../__core/panic/fn.resume_unwind.html | 134 - doc/bitflags/__core/panic/fn.set_handler.html | 114 - doc/bitflags/__core/panic/fn.set_hook.html | 128 - .../__core/panic/fn.take_handler.html | 114 - doc/bitflags/__core/panic/fn.take_hook.html | 119 - doc/bitflags/__core/panic/index.html | 222 - doc/bitflags/__core/panic/sidebar-items.js | 1 - .../panic/struct.AssertRecoverSafe.html | 128 - .../__core/panic/struct.AssertUnwindSafe.html | 171 - .../__core/panic/struct.Location.html | 122 - .../__core/panic/struct.PanicInfo.html | 128 - .../__core/panic/trait.RecoverSafe.html | 121 - .../__core/panic/trait.RefUnwindSafe.html | 128 - .../__core/panic/trait.UnwindSafe.html | 198 - .../__core/path/constant.MAIN_SEPARATOR.html | 113 - doc/bitflags/__core/path/enum.Component.html | 146 - doc/bitflags/__core/path/enum.Prefix.html | 148 - doc/bitflags/__core/path/fn.is_separator.html | 121 - doc/bitflags/__core/path/index.html | 280 - doc/bitflags/__core/path/sidebar-items.js | 1 - .../__core/path/struct.Components.html | 201 - doc/bitflags/__core/path/struct.Display.html | 117 - doc/bitflags/__core/path/struct.Iter.html | 170 - doc/bitflags/__core/path/struct.Path.html | 561 - doc/bitflags/__core/path/struct.PathBuf.html | 580 - .../__core/path/struct.PrefixComponent.html | 134 - .../__core/path/struct.StripPrefixError.html | 122 - doc/bitflags/__core/prelude/index.html | 193 - doc/bitflags/__core/prelude/sidebar-items.js | 1 - .../__core/prelude/v1/enum.Option.html | 450 - .../__core/prelude/v1/enum.Result.html | 475 - doc/bitflags/__core/prelude/v1/fn.drop.html | 182 - doc/bitflags/__core/prelude/v1/index.html | 345 - .../__core/prelude/v1/sidebar-items.js | 1 - .../__core/prelude/v1/struct.Box.html | 287 - .../__core/prelude/v1/struct.String.html | 2118 --- .../__core/prelude/v1/struct.Vec.html | 1330 -- .../__core/prelude/v1/trait.AsMut.html | 171 - .../__core/prelude/v1/trait.AsRef.html | 216 - .../__core/prelude/v1/trait.Clone.html | 495 - .../__core/prelude/v1/trait.Copy.html | 316 - .../__core/prelude/v1/trait.Default.html | 256 - .../prelude/v1/trait.DoubleEndedIterator.html | 240 - .../__core/prelude/v1/trait.Drop.html | 178 - doc/bitflags/__core/prelude/v1/trait.Eq.html | 317 - .../prelude/v1/trait.ExactSizeIterator.html | 255 - .../__core/prelude/v1/trait.Extend.html | 223 - doc/bitflags/__core/prelude/v1/trait.Fn.html | 125 - .../__core/prelude/v1/trait.FnMut.html | 126 - .../__core/prelude/v1/trait.FnOnce.html | 135 - .../__core/prelude/v1/trait.From.html | 211 - .../__core/prelude/v1/trait.Into.html | 152 - .../__core/prelude/v1/trait.IntoIterator.html | 326 - .../__core/prelude/v1/trait.Iterator.html | 1671 --- doc/bitflags/__core/prelude/v1/trait.Ord.html | 295 - .../__core/prelude/v1/trait.PartialEq.html | 690 - .../__core/prelude/v1/trait.PartialOrd.html | 418 - .../__core/prelude/v1/trait.Send.html | 149 - .../__core/prelude/v1/trait.Sized.html | 128 - .../prelude/v1/trait.SliceConcatExt.html | 146 - .../__core/prelude/v1/trait.Sync.html | 190 - .../__core/prelude/v1/trait.ToOwned.html | 149 - .../__core/prelude/v1/trait.ToString.html | 140 - doc/bitflags/__core/process/fn.exit.html | 123 - doc/bitflags/__core/process/index.html | 182 - doc/bitflags/__core/process/sidebar-items.js | 1 - doc/bitflags/__core/process/struct.Child.html | 195 - .../__core/process/struct.ChildStderr.html | 126 - .../__core/process/struct.ChildStdin.html | 122 - .../__core/process/struct.ChildStdout.html | 126 - .../__core/process/struct.Command.html | 211 - .../__core/process/struct.ExitStatus.html | 129 - .../__core/process/struct.Output.html | 129 - doc/bitflags/__core/process/struct.Stdio.html | 121 - doc/bitflags/__core/ptr/fn.copy.html | 135 - .../__core/ptr/fn.copy_nonoverlapping.html | 147 - doc/bitflags/__core/ptr/fn.drop_in_place.html | 129 - doc/bitflags/__core/ptr/fn.null.html | 120 - doc/bitflags/__core/ptr/fn.null_mut.html | 120 - doc/bitflags/__core/ptr/fn.read.html | 131 - doc/bitflags/__core/ptr/fn.read_and_drop.html | 113 - doc/bitflags/__core/ptr/fn.read_volatile.html | 141 - doc/bitflags/__core/ptr/fn.replace.html | 118 - doc/bitflags/__core/ptr/fn.swap.html | 118 - doc/bitflags/__core/ptr/fn.write.html | 137 - doc/bitflags/__core/ptr/fn.write_bytes.html | 114 - .../__core/ptr/fn.write_volatile.html | 147 - doc/bitflags/__core/ptr/index.html | 242 - doc/bitflags/__core/ptr/sidebar-items.js | 1 - doc/bitflags/__core/ptr/struct.Shared.html | 258 - doc/bitflags/__core/ptr/struct.Unique.html | 270 - doc/bitflags/__core/raw/index.html | 142 - doc/bitflags/__core/raw/sidebar-items.js | 1 - doc/bitflags/__core/raw/struct.Slice.html | 162 - .../__core/raw/struct.TraitObject.html | 188 - doc/bitflags/__core/raw/trait.Repr.html | 134 - doc/bitflags/__core/rc/index.html | 261 - doc/bitflags/__core/rc/sidebar-items.js | 1 - doc/bitflags/__core/rc/struct.Rc.html | 366 - doc/bitflags/__core/rc/struct.Weak.html | 189 - doc/bitflags/__core/result/enum.Result.html | 475 - doc/bitflags/__core/result/index.html | 340 - doc/bitflags/__core/result/sidebar-items.js | 1 - .../__core/result/struct.IntoIter.html | 166 - doc/bitflags/__core/result/struct.Iter.html | 168 - .../__core/result/struct.IterMut.html | 166 - doc/bitflags/__core/rt/fn.begin_unwind.html | 10 - .../__core/rt/fn.begin_unwind_fmt.html | 10 - doc/bitflags/__core/rt/index.html | 10 - doc/bitflags/__core/rt/sidebar-items.js | 1 - doc/bitflags/__core/sidebar-items.js | 1 - .../__core/slice/fn.from_raw_parts.html | 140 - .../__core/slice/fn.from_raw_parts_mut.html | 118 - doc/bitflags/__core/slice/index.html | 293 - doc/bitflags/__core/slice/sidebar-items.js | 1 - doc/bitflags/__core/slice/struct.Chunks.html | 172 - .../__core/slice/struct.ChunksMut.html | 168 - doc/bitflags/__core/slice/struct.Iter.html | 203 - doc/bitflags/__core/slice/struct.IterMut.html | 216 - doc/bitflags/__core/slice/struct.RSplitN.html | 166 - .../__core/slice/struct.RSplitNMut.html | 166 - doc/bitflags/__core/slice/struct.Split.html | 168 - .../__core/slice/struct.SplitMut.html | 166 - doc/bitflags/__core/slice/struct.SplitN.html | 165 - .../__core/slice/struct.SplitNMut.html | 165 - doc/bitflags/__core/slice/struct.Windows.html | 168 - .../__core/slice/trait.SliceConcatExt.html | 146 - doc/bitflags/__core/str/fn.from_utf8.html | 175 - .../__core/str/fn.from_utf8_unchecked.html | 136 - doc/bitflags/__core/str/index.html | 302 - .../__core/str/pattern/enum.SearchStep.html | 140 - doc/bitflags/__core/str/pattern/index.html | 184 - .../__core/str/pattern/sidebar-items.js | 1 - .../pattern/struct.CharPredicateSearcher.html | 133 - .../str/pattern/struct.CharSearcher.html | 133 - .../str/pattern/struct.CharSliceSearcher.html | 133 - .../str/pattern/struct.StrSearcher.html | 133 - .../pattern/trait.DoubleEndedSearcher.html | 143 - .../__core/str/pattern/trait.Pattern.html | 162 - .../str/pattern/trait.ReverseSearcher.html | 172 - .../__core/str/pattern/trait.Searcher.html | 175 - doc/bitflags/__core/str/sidebar-items.js | 1 - doc/bitflags/__core/str/struct.Bytes.html | 169 - .../__core/str/struct.CharIndices.html | 172 - doc/bitflags/__core/str/struct.CharRange.html | 131 - doc/bitflags/__core/str/struct.Chars.html | 174 - .../__core/str/struct.EncodeUtf16.html | 167 - doc/bitflags/__core/str/struct.Lines.html | 165 - doc/bitflags/__core/str/struct.LinesAny.html | 166 - .../__core/str/struct.MatchIndices.html | 165 - doc/bitflags/__core/str/struct.Matches.html | 165 - .../__core/str/struct.ParseBoolError.html | 123 - .../__core/str/struct.RMatchIndices.html | 165 - doc/bitflags/__core/str/struct.RMatches.html | 165 - doc/bitflags/__core/str/struct.RSplit.html | 165 - doc/bitflags/__core/str/struct.RSplitN.html | 164 - .../__core/str/struct.RSplitTerminator.html | 165 - doc/bitflags/__core/str/struct.Split.html | 165 - doc/bitflags/__core/str/struct.SplitN.html | 164 - .../__core/str/struct.SplitTerminator.html | 165 - .../__core/str/struct.SplitWhitespace.html | 165 - doc/bitflags/__core/str/struct.Utf8Error.html | 148 - doc/bitflags/__core/str/trait.FromStr.html | 168 - doc/bitflags/__core/str/type.Utf16Units.html | 114 - .../__core/string/enum.ParseError.html | 128 - doc/bitflags/__core/string/index.html | 194 - doc/bitflags/__core/string/sidebar-items.js | 1 - doc/bitflags/__core/string/struct.Drain.html | 168 - .../__core/string/struct.FromUtf16Error.html | 129 - .../__core/string/struct.FromUtf8Error.html | 177 - doc/bitflags/__core/string/struct.String.html | 2118 --- .../__core/string/trait.ToString.html | 140 - .../atomic/constant.ATOMIC_BOOL_INIT.html | 113 - .../atomic/constant.ATOMIC_ISIZE_INIT.html | 113 - .../atomic/constant.ATOMIC_USIZE_INIT.html | 113 - .../__core/sync/atomic/enum.Ordering.html | 144 - doc/bitflags/__core/sync/atomic/fn.fence.html | 131 - doc/bitflags/__core/sync/atomic/index.html | 232 - .../__core/sync/atomic/sidebar-items.js | 1 - .../__core/sync/atomic/struct.AtomicBool.html | 342 - .../sync/atomic/struct.AtomicIsize.html | 296 - .../__core/sync/atomic/struct.AtomicPtr.html | 248 - .../sync/atomic/struct.AtomicUsize.html | 297 - .../__core/sync/constant.CONDVAR_INIT.html | 114 - .../__core/sync/constant.MUTEX_INIT.html | 115 - .../__core/sync/constant.ONCE_INIT.html | 113 - .../__core/sync/constant.RW_LOCK_INIT.html | 114 - .../__core/sync/enum.TryLockError.html | 127 - doc/bitflags/__core/sync/index.html | 308 - .../__core/sync/mpsc/enum.TryRecvError.html | 130 - .../__core/sync/mpsc/enum.TrySendError.html | 134 - doc/bitflags/__core/sync/mpsc/fn.channel.html | 135 - .../__core/sync/mpsc/fn.sync_channel.html | 144 - doc/bitflags/__core/sync/mpsc/index.html | 319 - .../__core/sync/mpsc/sidebar-items.js | 1 - .../__core/sync/mpsc/struct.Handle.html | 142 - .../__core/sync/mpsc/struct.IntoIter.html | 165 - .../__core/sync/mpsc/struct.Iter.html | 165 - .../__core/sync/mpsc/struct.Receiver.html | 187 - .../__core/sync/mpsc/struct.RecvError.html | 124 - .../__core/sync/mpsc/struct.Select.html | 147 - .../__core/sync/mpsc/struct.SendError.html | 125 - .../__core/sync/mpsc/struct.Sender.html | 146 - .../__core/sync/mpsc/struct.SyncSender.html | 145 - doc/bitflags/__core/sync/sidebar-items.js | 1 - doc/bitflags/__core/sync/struct.Arc.html | 353 - doc/bitflags/__core/sync/struct.Barrier.html | 152 - .../__core/sync/struct.BarrierWaitResult.html | 121 - doc/bitflags/__core/sync/struct.Condvar.html | 230 - doc/bitflags/__core/sync/struct.Mutex.html | 261 - .../__core/sync/struct.MutexGuard.html | 124 - doc/bitflags/__core/sync/struct.Once.html | 189 - .../__core/sync/struct.PoisonError.html | 135 - doc/bitflags/__core/sync/struct.RwLock.html | 258 - .../__core/sync/struct.RwLockReadGuard.html | 134 - .../__core/sync/struct.RwLockWriteGuard.html | 141 - .../__core/sync/struct.StaticCondvar.html | 169 - .../__core/sync/struct.StaticMutex.html | 157 - .../__core/sync/struct.StaticRwLock.html | 171 - .../__core/sync/struct.WaitTimeoutResult.html | 121 - doc/bitflags/__core/sync/struct.Weak.html | 187 - doc/bitflags/__core/sync/type.LockResult.html | 112 - .../__core/sync/type.TryLockResult.html | 112 - .../__core/thread/enum.LocalKeyState.html | 147 - doc/bitflags/__core/thread/fn.current.html | 113 - doc/bitflags/__core/thread/fn.panicking.html | 113 - doc/bitflags/__core/thread/fn.park.html | 127 - .../__core/thread/fn.park_timeout.html | 126 - .../__core/thread/fn.park_timeout_ms.html | 123 - doc/bitflags/__core/thread/fn.sleep.html | 122 - doc/bitflags/__core/thread/fn.sleep_ms.html | 119 - doc/bitflags/__core/thread/fn.spawn.html | 125 - doc/bitflags/__core/thread/fn.yield_now.html | 113 - doc/bitflags/__core/thread/index.html | 397 - doc/bitflags/__core/thread/sidebar-items.js | 1 - .../__core/thread/struct.Builder.html | 136 - .../__core/thread/struct.JoinHandle.html | 128 - doc/bitflags/__core/thread/struct.Key.html | 116 - .../__core/thread/struct.KeyInner.html | 117 - .../__core/thread/struct.LocalKey.html | 205 - .../__core/thread/struct.ScopedKey.html | 178 - doc/bitflags/__core/thread/struct.Thread.html | 124 - doc/bitflags/__core/thread/type.Result.html | 112 - .../__core/time/constant.UNIX_EPOCH.html | 120 - doc/bitflags/__core/time/index.html | 164 - doc/bitflags/__core/time/sidebar-items.js | 1 - doc/bitflags/__core/time/struct.Duration.html | 182 - doc/bitflags/__core/time/struct.Instant.html | 184 - .../__core/time/struct.SystemTime.html | 200 - .../__core/time/struct.SystemTimeError.html | 127 - doc/bitflags/__core/u16/constant.MAX.html | 112 - doc/bitflags/__core/u16/constant.MIN.html | 112 - doc/bitflags/__core/u16/index.html | 130 - doc/bitflags/__core/u16/sidebar-items.js | 1 - doc/bitflags/__core/u32/constant.MAX.html | 112 - doc/bitflags/__core/u32/constant.MIN.html | 112 - doc/bitflags/__core/u32/index.html | 130 - doc/bitflags/__core/u32/sidebar-items.js | 1 - doc/bitflags/__core/u64/constant.MAX.html | 112 - doc/bitflags/__core/u64/constant.MIN.html | 112 - doc/bitflags/__core/u64/index.html | 130 - doc/bitflags/__core/u64/sidebar-items.js | 1 - doc/bitflags/__core/u8/constant.MAX.html | 112 - doc/bitflags/__core/u8/constant.MIN.html | 112 - doc/bitflags/__core/u8/index.html | 130 - doc/bitflags/__core/u8/sidebar-items.js | 1 - doc/bitflags/__core/usize/constant.MAX.html | 112 - doc/bitflags/__core/usize/constant.MIN.html | 112 - doc/bitflags/__core/usize/index.html | 130 - doc/bitflags/__core/usize/sidebar-items.js | 1 - doc/bitflags/__core/vec/index.html | 176 - doc/bitflags/__core/vec/sidebar-items.js | 1 - doc/bitflags/__core/vec/struct.Drain.html | 166 - doc/bitflags/__core/vec/struct.IntoIter.html | 168 - doc/bitflags/__core/vec/struct.Vec.html | 1330 -- doc/bitflags/index.html | 130 - doc/bitflags/macro.bitflags!.html | 278 - doc/bitflags/sidebar-items.js | 1 - doc/byteorder/enum.BigEndian.html | 136 - doc/byteorder/enum.LittleEndian.html | 136 - doc/byteorder/index.html | 196 - doc/byteorder/new/index.html | 0 doc/byteorder/new/sidebar-items.js | 1 - doc/byteorder/new/trait.ReadBytesExt.html | 10 - doc/byteorder/new/trait.WriteBytesExt.html | 10 - doc/byteorder/sidebar-items.js | 1 - doc/byteorder/trait.ByteOrder.html | 238 - doc/byteorder/trait.ReadBytesExt.html | 169 - doc/byteorder/trait.WriteBytesExt.html | 175 - doc/byteorder/type.NativeEndian.html | 116 - doc/byteorder/type.NetworkEndian.html | 120 - doc/clap/app/enum.AppSettings.html | 10 - doc/clap/app/help/index.html | 0 doc/clap/app/help/sidebar-items.js | 1 - doc/clap/app/index.html | 0 doc/clap/app/macros/index.html | 0 doc/clap/app/macros/sidebar-items.js | 1 - doc/clap/app/meta/index.html | 0 doc/clap/app/meta/sidebar-items.js | 1 - doc/clap/app/parser/index.html | 0 doc/clap/app/parser/sidebar-items.js | 1 - doc/clap/app/settings/enum.AppSettings.html | 10 - doc/clap/app/settings/index.html | 0 doc/clap/app/settings/sidebar-items.js | 1 - doc/clap/app/sidebar-items.js | 1 - doc/clap/app/struct.App.html | 10 - doc/clap/args/any_arg/index.html | 0 doc/clap/args/any_arg/sidebar-items.js | 1 - doc/clap/args/arg/index.html | 0 doc/clap/args/arg/sidebar-items.js | 1 - doc/clap/args/arg/struct.Arg.html | 10 - doc/clap/args/arg_builder/flag/index.html | 0 .../args/arg_builder/flag/sidebar-items.js | 1 - doc/clap/args/arg_builder/index.html | 0 doc/clap/args/arg_builder/option/index.html | 0 .../args/arg_builder/option/sidebar-items.js | 1 - .../args/arg_builder/positional/index.html | 0 .../arg_builder/positional/sidebar-items.js | 1 - doc/clap/args/arg_builder/sidebar-items.js | 1 - doc/clap/args/arg_matcher/index.html | 0 doc/clap/args/arg_matcher/sidebar-items.js | 1 - doc/clap/args/arg_matches/index.html | 0 doc/clap/args/arg_matches/sidebar-items.js | 1 - .../args/arg_matches/struct.ArgMatches.html | 10 - doc/clap/args/group/index.html | 0 doc/clap/args/group/sidebar-items.js | 1 - doc/clap/args/group/struct.ArgGroup.html | 10 - doc/clap/args/index.html | 0 doc/clap/args/matched_arg/index.html | 0 doc/clap/args/matched_arg/sidebar-items.js | 1 - doc/clap/args/settings/index.html | 0 doc/clap/args/settings/sidebar-items.js | 1 - doc/clap/args/sidebar-items.js | 1 - doc/clap/args/struct.Arg.html | 10 - doc/clap/args/struct.ArgGroup.html | 10 - doc/clap/args/struct.ArgMatches.html | 10 - doc/clap/args/struct.SubCommand.html | 10 - doc/clap/args/subcommand/index.html | 0 doc/clap/args/subcommand/sidebar-items.js | 1 - .../args/subcommand/struct.SubCommand.html | 10 - doc/clap/enum.AppSettings.html | 441 - doc/clap/enum.ErrorKind.html | 369 - doc/clap/errors/enum.ErrorKind.html | 10 - doc/clap/errors/index.html | 0 doc/clap/errors/sidebar-items.js | 1 - doc/clap/errors/struct.Error.html | 10 - doc/clap/errors/type.Result.html | 10 - doc/clap/fmt/index.html | 0 doc/clap/fmt/sidebar-items.js | 1 - doc/clap/index.html | 603 - doc/clap/macro._clap_count_exprs!.html | 125 - doc/clap/macro.arg_enum!.html | 152 - doc/clap/macro.crate_version!.html | 124 - doc/clap/macro.value_t!.html | 133 - doc/clap/macro.value_t_or_exit!.html | 133 - doc/clap/macro.values_t!.html | 136 - doc/clap/macro.values_t_or_exit!.html | 139 - doc/clap/macros/debug_macros/index.html | 0 doc/clap/macros/debug_macros/sidebar-items.js | 1 - doc/clap/macros/index.html | 0 doc/clap/macros/sidebar-items.js | 1 - doc/clap/osstringext/index.html | 0 doc/clap/osstringext/sidebar-items.js | 1 - doc/clap/sidebar-items.js | 1 - doc/clap/strext/index.html | 0 doc/clap/strext/sidebar-items.js | 1 - doc/clap/struct.App.html | 599 - doc/clap/struct.Arg.html | 1564 --- doc/clap/struct.ArgGroup.html | 269 - doc/clap/struct.ArgMatches.html | 455 - doc/clap/struct.Error.html | 134 - doc/clap/struct.SubCommand.html | 141 - doc/clap/suggestions/index.html | 0 doc/clap/suggestions/sidebar-items.js | 1 - doc/clap/term/index.html | 0 doc/clap/term/sidebar-items.js | 1 - doc/clap/type.Result.html | 113 - doc/clap/usage_parser/index.html | 0 doc/clap/usage_parser/sidebar-items.js | 1 - doc/crc/crc32/constant.CASTAGNOLI.html | 112 - doc/crc/crc32/constant.IEEE.html | 112 - doc/crc/crc32/constant.KOOPMAN.html | 112 - doc/crc/crc32/fn.checksum_castagnoli.html | 112 - doc/crc/crc32/fn.checksum_ieee.html | 112 - doc/crc/crc32/fn.checksum_koopman.html | 112 - doc/crc/crc32/fn.make_table.html | 112 - doc/crc/crc32/fn.update.html | 112 - doc/crc/crc32/index.html | 207 - doc/crc/crc32/sidebar-items.js | 1 - doc/crc/crc32/struct.CASTAGNOLI_TABLE.html | 116 - doc/crc/crc32/struct.Digest.html | 119 - doc/crc/crc32/struct.IEEE_TABLE.html | 116 - doc/crc/crc32/struct.KOOPMAN_TABLE.html | 116 - doc/crc/crc32/trait.Hasher32.html | 125 - doc/crc/crc64/constant.ECMA.html | 112 - doc/crc/crc64/constant.ISO.html | 112 - doc/crc/crc64/fn.checksum_ecma.html | 112 - doc/crc/crc64/fn.checksum_iso.html | 112 - doc/crc/crc64/fn.make_table.html | 112 - doc/crc/crc64/fn.update.html | 112 - doc/crc/crc64/index.html | 186 - doc/crc/crc64/sidebar-items.js | 1 - doc/crc/crc64/struct.Digest.html | 119 - doc/crc/crc64/struct.ECMA_TABLE.html | 116 - doc/crc/crc64/struct.ISO_TABLE.html | 116 - doc/crc/crc64/trait.Hasher64.html | 125 - doc/crc/index.html | 170 - doc/crc/sidebar-items.js | 1 - doc/crossbeam/fn.scope.html | 125 - doc/crossbeam/fn.spawn_unsafe.html | 113 - doc/crossbeam/index.html | 179 - doc/crossbeam/mem/cache_padded/index.html | 0 .../mem/cache_padded/sidebar-items.js | 1 - .../mem/cache_padded/struct.CachePadded.html | 10 - .../mem/cache_padded/trait.ZerosValid.html | 10 - doc/crossbeam/mem/epoch/atomic/index.html | 0 .../mem/epoch/atomic/sidebar-items.js | 1 - .../mem/epoch/atomic/struct.Atomic.html | 10 - doc/crossbeam/mem/epoch/fn.pin.html | 120 - doc/crossbeam/mem/epoch/garbage/index.html | 0 .../mem/epoch/garbage/sidebar-items.js | 1 - doc/crossbeam/mem/epoch/global/imp/index.html | 0 .../mem/epoch/global/imp/sidebar-items.js | 1 - doc/crossbeam/mem/epoch/global/index.html | 0 .../mem/epoch/global/sidebar-items.js | 1 - doc/crossbeam/mem/epoch/guard/fn.pin.html | 10 - doc/crossbeam/mem/epoch/guard/index.html | 0 .../mem/epoch/guard/sidebar-items.js | 1 - .../mem/epoch/guard/struct.Guard.html | 10 - doc/crossbeam/mem/epoch/index.html | 274 - doc/crossbeam/mem/epoch/local/index.html | 0 .../mem/epoch/local/sidebar-items.js | 1 - .../mem/epoch/participant/index.html | 0 .../mem/epoch/participant/sidebar-items.js | 1 - .../mem/epoch/participants/index.html | 0 .../mem/epoch/participants/sidebar-items.js | 1 - doc/crossbeam/mem/epoch/sidebar-items.js | 1 - doc/crossbeam/mem/epoch/struct.Atomic.html | 180 - doc/crossbeam/mem/epoch/struct.Guard.html | 125 - doc/crossbeam/mem/epoch/struct.Owned.html | 122 - doc/crossbeam/mem/epoch/struct.Shared.html | 122 - doc/crossbeam/mem/index.html | 140 - doc/crossbeam/mem/sidebar-items.js | 1 - doc/crossbeam/mem/struct.CachePadded.html | 136 - doc/crossbeam/mem/trait.ZerosValid.html | 133 - doc/crossbeam/scoped/fn.scope.html | 10 - doc/crossbeam/scoped/index.html | 0 doc/crossbeam/scoped/sidebar-items.js | 1 - doc/crossbeam/scoped/struct.Scope.html | 10 - .../scoped/struct.ScopedJoinHandle.html | 10 - doc/crossbeam/sidebar-items.js | 1 - doc/crossbeam/struct.Scope.html | 228 - doc/crossbeam/struct.ScopedJoinHandle.html | 119 - doc/crossbeam/sync/arc_cell/index.html | 0 doc/crossbeam/sync/arc_cell/sidebar-items.js | 1 - .../sync/arc_cell/struct.ArcCell.html | 10 - doc/crossbeam/sync/atomic_option/index.html | 0 .../sync/atomic_option/sidebar-items.js | 1 - .../atomic_option/struct.AtomicOption.html | 10 - doc/crossbeam/sync/chase_lev/enum.Steal.html | 125 - doc/crossbeam/sync/chase_lev/fn.deque.html | 113 - doc/crossbeam/sync/chase_lev/index.html | 170 - doc/crossbeam/sync/chase_lev/sidebar-items.js | 1 - .../sync/chase_lev/struct.Stealer.html | 123 - .../sync/chase_lev/struct.Worker.html | 124 - doc/crossbeam/sync/index.html | 158 - doc/crossbeam/sync/ms_queue/index.html | 0 doc/crossbeam/sync/ms_queue/sidebar-items.js | 1 - .../sync/ms_queue/struct.MsQueue.html | 10 - doc/crossbeam/sync/seg_queue/index.html | 0 doc/crossbeam/sync/seg_queue/sidebar-items.js | 1 - .../sync/seg_queue/struct.SegQueue.html | 10 - doc/crossbeam/sync/sidebar-items.js | 1 - doc/crossbeam/sync/struct.ArcCell.html | 121 - doc/crossbeam/sync/struct.AtomicOption.html | 118 - doc/crossbeam/sync/struct.MsQueue.html | 131 - doc/crossbeam/sync/struct.SegQueue.html | 126 - doc/crossbeam/sync/struct.TreiberStack.html | 127 - doc/crossbeam/sync/treiber_stack/index.html | 0 .../sync/treiber_stack/sidebar-items.js | 1 - .../treiber_stack/struct.TreiberStack.html | 10 - .../aho_corasick/trait.Automaton.js | 10 - .../aho_corasick/trait.Transitions.js | 10 - doc/implementors/alloc/boxed/trait.FnBox.js | 10 - doc/implementors/bit_vec/trait.BitBlock.js | 10 - .../bitflags/__core/any/trait.Any.js | 10 - .../bitflags/__core/ascii/trait.AsciiExt.js | 10 - .../bitflags/__core/borrow/trait.Borrow.js | 10 - .../bitflags/__core/borrow/trait.BorrowMut.js | 10 - .../bitflags/__core/borrow/trait.ToOwned.js | 10 - .../bitflags/__core/boxed/trait.FnBox.js | 10 - .../bitflags/__core/clone/trait.Clone.js | 10 - .../bitflags/__core/cmp/trait.Eq.js | 10 - .../bitflags/__core/cmp/trait.Ord.js | 10 - .../bitflags/__core/cmp/trait.PartialEq.js | 10 - .../bitflags/__core/cmp/trait.PartialOrd.js | 10 - .../bitflags/__core/convert/trait.AsMut.js | 10 - .../bitflags/__core/convert/trait.AsRef.js | 10 - .../bitflags/__core/convert/trait.From.js | 10 - .../bitflags/__core/convert/trait.Into.js | 10 - .../bitflags/__core/default/trait.Default.js | 10 - .../bitflags/__core/error/trait.Error.js | 10 - .../bitflags/__core/fmt/trait.Binary.js | 10 - .../bitflags/__core/fmt/trait.Debug.js | 10 - .../bitflags/__core/fmt/trait.Display.js | 10 - .../bitflags/__core/fmt/trait.LowerExp.js | 10 - .../bitflags/__core/fmt/trait.LowerHex.js | 10 - .../bitflags/__core/fmt/trait.Octal.js | 10 - .../bitflags/__core/fmt/trait.Pointer.js | 10 - .../bitflags/__core/fmt/trait.UpperExp.js | 10 - .../bitflags/__core/fmt/trait.UpperHex.js | 10 - .../bitflags/__core/fmt/trait.Write.js | 10 - .../bitflags/__core/hash/trait.BuildHasher.js | 10 - .../bitflags/__core/hash/trait.Hash.js | 10 - .../bitflags/__core/hash/trait.Hasher.js | 10 - .../bitflags/__core/io/trait.BufRead.js | 10 - .../bitflags/__core/io/trait.Read.js | 10 - .../bitflags/__core/io/trait.Seek.js | 10 - .../bitflags/__core/io/trait.Write.js | 10 - .../__core/iter/trait.DoubleEndedIterator.js | 10 - .../__core/iter/trait.ExactSizeIterator.js | 10 - .../bitflags/__core/iter/trait.Extend.js | 10 - .../__core/iter/trait.FromIterator.js | 10 - .../__core/iter/trait.IntoIterator.js | 10 - .../bitflags/__core/iter/trait.Iterator.js | 10 - .../bitflags/__core/iter/trait.Step.js | 10 - .../bitflags/__core/marker/trait.Copy.js | 10 - .../bitflags/__core/marker/trait.Send.js | 10 - .../bitflags/__core/marker/trait.Sync.js | 10 - .../__core/net/trait.ToSocketAddrs.js | 10 - .../bitflags/__core/num/trait.One.js | 10 - .../bitflags/__core/num/trait.Zero.js | 10 - .../bitflags/__core/ops/trait.Add.js | 10 - .../bitflags/__core/ops/trait.AddAssign.js | 10 - .../bitflags/__core/ops/trait.BitAnd.js | 10 - .../bitflags/__core/ops/trait.BitAndAssign.js | 10 - .../bitflags/__core/ops/trait.BitOr.js | 10 - .../bitflags/__core/ops/trait.BitOrAssign.js | 10 - .../bitflags/__core/ops/trait.BitXor.js | 10 - .../bitflags/__core/ops/trait.BitXorAssign.js | 10 - .../bitflags/__core/ops/trait.BoxPlace.js | 10 - .../bitflags/__core/ops/trait.Boxed.js | 10 - .../__core/ops/trait.CoerceUnsized.js | 10 - .../bitflags/__core/ops/trait.Deref.js | 10 - .../bitflags/__core/ops/trait.DerefMut.js | 10 - .../bitflags/__core/ops/trait.Div.js | 10 - .../bitflags/__core/ops/trait.DivAssign.js | 10 - .../bitflags/__core/ops/trait.Drop.js | 10 - .../bitflags/__core/ops/trait.Fn.js | 10 - .../bitflags/__core/ops/trait.FnMut.js | 10 - .../bitflags/__core/ops/trait.FnOnce.js | 10 - .../bitflags/__core/ops/trait.InPlace.js | 10 - .../bitflags/__core/ops/trait.Index.js | 10 - .../bitflags/__core/ops/trait.IndexMut.js | 10 - .../bitflags/__core/ops/trait.Mul.js | 10 - .../bitflags/__core/ops/trait.MulAssign.js | 10 - .../bitflags/__core/ops/trait.Neg.js | 10 - .../bitflags/__core/ops/trait.Not.js | 10 - .../bitflags/__core/ops/trait.Place.js | 10 - .../bitflags/__core/ops/trait.Placer.js | 10 - .../bitflags/__core/ops/trait.Rem.js | 10 - .../bitflags/__core/ops/trait.RemAssign.js | 10 - .../bitflags/__core/ops/trait.Shl.js | 10 - .../bitflags/__core/ops/trait.ShlAssign.js | 10 - .../bitflags/__core/ops/trait.Shr.js | 10 - .../bitflags/__core/ops/trait.ShrAssign.js | 10 - .../bitflags/__core/ops/trait.Sub.js | 10 - .../bitflags/__core/ops/trait.SubAssign.js | 10 - .../__core/os/ext/fs/trait.DirBuilderExt.js | 10 - .../__core/os/ext/prelude/trait.AsRawFd.js | 10 - .../__core/os/ext/prelude/trait.CommandExt.js | 10 - .../os/ext/prelude/trait.DirEntryExt.js | 10 - .../os/ext/prelude/trait.ExitStatusExt.js | 10 - .../os/ext/prelude/trait.FileTypeExt.js | 10 - .../__core/os/ext/prelude/trait.FromRawFd.js | 10 - .../__core/os/ext/prelude/trait.IntoRawFd.js | 10 - .../os/ext/prelude/trait.JoinHandleExt.js | 10 - .../os/ext/prelude/trait.MetadataExt.js | 10 - .../os/ext/prelude/trait.OpenOptionsExt.js | 10 - .../__core/os/ext/prelude/trait.OsStrExt.js | 10 - .../os/ext/prelude/trait.OsStringExt.js | 10 - .../os/ext/prelude/trait.PermissionsExt.js | 10 - .../__core/os/macos/fs/trait.MetadataExt.js | 10 - .../__core/panic/trait.RecoverSafe.js | 10 - .../__core/panic/trait.RefUnwindSafe.js | 10 - .../bitflags/__core/panic/trait.UnwindSafe.js | 10 - .../bitflags/__core/raw/trait.Repr.js | 10 - .../__core/slice/trait.SliceConcatExt.js | 10 - .../str/pattern/trait.DoubleEndedSearcher.js | 10 - .../__core/str/pattern/trait.Pattern.js | 10 - .../str/pattern/trait.ReverseSearcher.js | 10 - .../__core/str/pattern/trait.Searcher.js | 10 - .../bitflags/__core/str/trait.FromStr.js | 10 - .../bitflags/__core/string/trait.ToString.js | 10 - doc/implementors/byteorder/trait.ByteOrder.js | 10 - .../collections/borrow/trait.ToOwned.js | 10 - .../collections/range/trait.RangeArgument.js | 10 - .../collections/slice/trait.SliceConcatExt.js | 10 - .../collections/string/trait.ToString.js | 10 - doc/implementors/core/any/trait.Any.js | 10 - .../core/array/trait.FixedSizeArray.js | 10 - doc/implementors/core/borrow/trait.Borrow.js | 10 - .../core/borrow/trait.BorrowMut.js | 10 - doc/implementors/core/clone/trait.Clone.js | 10 - doc/implementors/core/cmp/trait.Eq.js | 10 - doc/implementors/core/cmp/trait.Ord.js | 10 - doc/implementors/core/cmp/trait.PartialEq.js | 10 - doc/implementors/core/cmp/trait.PartialOrd.js | 10 - doc/implementors/core/convert/trait.AsMut.js | 10 - doc/implementors/core/convert/trait.AsRef.js | 10 - doc/implementors/core/convert/trait.From.js | 10 - doc/implementors/core/convert/trait.Into.js | 10 - .../core/default/trait.Default.js | 10 - doc/implementors/core/fmt/trait.Binary.js | 10 - doc/implementors/core/fmt/trait.Debug.js | 10 - doc/implementors/core/fmt/trait.Display.js | 10 - doc/implementors/core/fmt/trait.LowerExp.js | 10 - doc/implementors/core/fmt/trait.LowerHex.js | 10 - doc/implementors/core/fmt/trait.Octal.js | 10 - doc/implementors/core/fmt/trait.Pointer.js | 10 - doc/implementors/core/fmt/trait.UpperExp.js | 10 - doc/implementors/core/fmt/trait.UpperHex.js | 10 - doc/implementors/core/fmt/trait.Write.js | 10 - .../core/hash/trait.BuildHasher.js | 10 - doc/implementors/core/hash/trait.Hash.js | 10 - doc/implementors/core/hash/trait.Hasher.js | 10 - .../core/iter/iterator/trait.Iterator.js | 10 - .../core/iter/range/trait.Step.js | 10 - .../iter/traits/trait.DoubleEndedIterator.js | 10 - .../iter/traits/trait.ExactSizeIterator.js | 10 - .../core/iter/traits/trait.Extend.js | 10 - .../core/iter/traits/trait.FromIterator.js | 10 - .../core/iter/traits/trait.IntoIterator.js | 10 - doc/implementors/core/marker/trait.Copy.js | 10 - doc/implementors/core/marker/trait.Send.js | 10 - doc/implementors/core/marker/trait.Sync.js | 10 - .../core/nonzero/trait.Zeroable.js | 10 - doc/implementors/core/num/trait.One.js | 10 - doc/implementors/core/num/trait.Zero.js | 10 - doc/implementors/core/ops/trait.Add.js | 10 - doc/implementors/core/ops/trait.AddAssign.js | 10 - doc/implementors/core/ops/trait.BitAnd.js | 10 - .../core/ops/trait.BitAndAssign.js | 10 - doc/implementors/core/ops/trait.BitOr.js | 10 - .../core/ops/trait.BitOrAssign.js | 10 - doc/implementors/core/ops/trait.BitXor.js | 10 - .../core/ops/trait.BitXorAssign.js | 10 - doc/implementors/core/ops/trait.BoxPlace.js | 10 - doc/implementors/core/ops/trait.Boxed.js | 10 - .../core/ops/trait.CoerceUnsized.js | 10 - doc/implementors/core/ops/trait.Deref.js | 10 - doc/implementors/core/ops/trait.DerefMut.js | 10 - doc/implementors/core/ops/trait.Div.js | 10 - doc/implementors/core/ops/trait.DivAssign.js | 10 - doc/implementors/core/ops/trait.Drop.js | 10 - doc/implementors/core/ops/trait.Fn.js | 10 - doc/implementors/core/ops/trait.FnMut.js | 10 - doc/implementors/core/ops/trait.FnOnce.js | 10 - doc/implementors/core/ops/trait.InPlace.js | 10 - doc/implementors/core/ops/trait.Index.js | 10 - doc/implementors/core/ops/trait.IndexMut.js | 10 - doc/implementors/core/ops/trait.Mul.js | 10 - doc/implementors/core/ops/trait.MulAssign.js | 10 - doc/implementors/core/ops/trait.Neg.js | 10 - doc/implementors/core/ops/trait.Not.js | 10 - doc/implementors/core/ops/trait.Place.js | 10 - doc/implementors/core/ops/trait.Placer.js | 10 - doc/implementors/core/ops/trait.Rem.js | 10 - doc/implementors/core/ops/trait.RemAssign.js | 10 - doc/implementors/core/ops/trait.Shl.js | 10 - doc/implementors/core/ops/trait.ShlAssign.js | 10 - doc/implementors/core/ops/trait.Shr.js | 10 - doc/implementors/core/ops/trait.ShrAssign.js | 10 - doc/implementors/core/ops/trait.Sub.js | 10 - doc/implementors/core/ops/trait.SubAssign.js | 10 - doc/implementors/core/raw/trait.Repr.js | 10 - doc/implementors/core/slice/trait.SliceExt.js | 10 - .../str/pattern/trait.DoubleEndedSearcher.js | 10 - .../core/str/pattern/trait.Pattern.js | 10 - .../core/str/pattern/trait.ReverseSearcher.js | 10 - .../core/str/pattern/trait.Searcher.js | 10 - doc/implementors/core/str/trait.FromStr.js | 10 - doc/implementors/crc/crc32/trait.Hasher32.js | 10 - doc/implementors/crc/crc64/trait.Hasher64.js | 10 - .../crossbeam/mem/trait.ZerosValid.js | 10 - .../distributions/trait.IndependentSample.js | 10 - .../rand/distributions/trait.Sample.js | 10 - .../rand/reseeding/trait.Reseeder.js | 10 - doc/implementors/rand/trait.Rng.js | 10 - doc/implementors/rand/trait.SeedableRng.js | 10 - .../regex/bytes/trait.Replacer.js | 10 - doc/implementors/regex/trait.Replacer.js | 10 - .../rustc_unicode/u_str/trait.UnicodeStr.js | 10 - doc/implementors/std/error/trait.Error.js | 10 - .../unicode_width/trait.UnicodeWidthChar.js | 10 - .../unicode_width/trait.UnicodeWidthStr.js | 10 - doc/jquery.js | 4 - doc/kernel32/index.html | 112 - doc/kernel32/sidebar-items.js | 1 - doc/lazy_static/index.html | 180 - doc/lazy_static/macro.lazy_static!.html | 121 - doc/lazy_static/sidebar-items.js | 1 - .../apple/b64/constant.TIOCDCDTIMESTAMP.html | 0 .../apple/b64/constant.TIOCTIMESTAMP.html | 0 .../b64/constant.__PTHREAD_COND_SIZE__.html | 0 .../b64/constant.__PTHREAD_MUTEX_SIZE__.html | 0 .../b64/constant.__PTHREAD_RWLOCK_SIZE__.html | 0 doc/libc/apple/b64/index.html | 0 doc/libc/apple/b64/sidebar-items.js | 1 - doc/libc/apple/b64/struct.pthread_attr_t.html | 10 - doc/libc/apple/b64/type.c_long.html | 10 - doc/libc/apple/b64/type.c_ulong.html | 10 - doc/libc/apple/constant.ABDAY_1.html | 0 doc/libc/apple/constant.ABDAY_2.html | 0 doc/libc/apple/constant.ABDAY_3.html | 0 doc/libc/apple/constant.ABDAY_4.html | 0 doc/libc/apple/constant.ABDAY_5.html | 0 doc/libc/apple/constant.ABDAY_6.html | 0 doc/libc/apple/constant.ABDAY_7.html | 0 doc/libc/apple/constant.ABMON_1.html | 0 doc/libc/apple/constant.ABMON_10.html | 0 doc/libc/apple/constant.ABMON_11.html | 0 doc/libc/apple/constant.ABMON_12.html | 0 doc/libc/apple/constant.ABMON_2.html | 0 doc/libc/apple/constant.ABMON_3.html | 0 doc/libc/apple/constant.ABMON_4.html | 0 doc/libc/apple/constant.ABMON_5.html | 0 doc/libc/apple/constant.ABMON_6.html | 0 doc/libc/apple/constant.ABMON_7.html | 0 doc/libc/apple/constant.ABMON_8.html | 0 doc/libc/apple/constant.ABMON_9.html | 0 doc/libc/apple/constant.AF_INET.html | 0 doc/libc/apple/constant.AF_INET6.html | 0 doc/libc/apple/constant.AF_UNIX.html | 0 doc/libc/apple/constant.ALT_DIGITS.html | 0 doc/libc/apple/constant.AM_STR.html | 0 doc/libc/apple/constant.BS0.html | 0 doc/libc/apple/constant.BS1.html | 0 doc/libc/apple/constant.BUFSIZ.html | 0 doc/libc/apple/constant.CODESET.html | 0 doc/libc/apple/constant.CR0.html | 0 doc/libc/apple/constant.CR1.html | 0 doc/libc/apple/constant.CR2.html | 0 doc/libc/apple/constant.CR3.html | 0 doc/libc/apple/constant.CRNCYSTR.html | 0 doc/libc/apple/constant.CRTSCTS.html | 0 doc/libc/apple/constant.DAY_1.html | 0 doc/libc/apple/constant.DAY_2.html | 0 doc/libc/apple/constant.DAY_3.html | 0 doc/libc/apple/constant.DAY_4.html | 0 doc/libc/apple/constant.DAY_5.html | 0 doc/libc/apple/constant.DAY_6.html | 0 doc/libc/apple/constant.DAY_7.html | 0 doc/libc/apple/constant.D_FMT.html | 0 doc/libc/apple/constant.D_MD_ORDER.html | 0 doc/libc/apple/constant.D_T_FMT.html | 0 doc/libc/apple/constant.E2BIG.html | 0 doc/libc/apple/constant.EACCES.html | 0 doc/libc/apple/constant.EADDRINUSE.html | 0 doc/libc/apple/constant.EADDRNOTAVAIL.html | 0 doc/libc/apple/constant.EAFNOSUPPORT.html | 0 doc/libc/apple/constant.EAGAIN.html | 0 doc/libc/apple/constant.EALREADY.html | 0 doc/libc/apple/constant.EAUTH.html | 0 doc/libc/apple/constant.EBADARCH.html | 0 doc/libc/apple/constant.EBADEXEC.html | 0 doc/libc/apple/constant.EBADF.html | 0 doc/libc/apple/constant.EBADMACHO.html | 0 doc/libc/apple/constant.EBADMSG.html | 0 doc/libc/apple/constant.EBADRPC.html | 0 doc/libc/apple/constant.EBUSY.html | 0 doc/libc/apple/constant.ECANCELED.html | 0 doc/libc/apple/constant.ECHILD.html | 0 doc/libc/apple/constant.ECONNABORTED.html | 0 doc/libc/apple/constant.ECONNREFUSED.html | 0 doc/libc/apple/constant.ECONNRESET.html | 0 doc/libc/apple/constant.EDEADLK.html | 0 doc/libc/apple/constant.EDESTADDRREQ.html | 0 doc/libc/apple/constant.EDEVERR.html | 0 doc/libc/apple/constant.EDOM.html | 0 doc/libc/apple/constant.EDQUOT.html | 0 doc/libc/apple/constant.EEXIST.html | 0 doc/libc/apple/constant.EFAULT.html | 0 doc/libc/apple/constant.EFBIG.html | 0 doc/libc/apple/constant.EFTYPE.html | 0 doc/libc/apple/constant.EHOSTDOWN.html | 0 doc/libc/apple/constant.EHOSTUNREACH.html | 0 doc/libc/apple/constant.EIDRM.html | 0 doc/libc/apple/constant.EILSEQ.html | 0 doc/libc/apple/constant.EINPROGRESS.html | 0 doc/libc/apple/constant.EINTR.html | 0 doc/libc/apple/constant.EINVAL.html | 0 doc/libc/apple/constant.EIO.html | 0 doc/libc/apple/constant.EISCONN.html | 0 doc/libc/apple/constant.EISDIR.html | 0 doc/libc/apple/constant.ELAST.html | 0 doc/libc/apple/constant.ELOOP.html | 0 doc/libc/apple/constant.EMFILE.html | 0 doc/libc/apple/constant.EMLINK.html | 0 doc/libc/apple/constant.EMSGSIZE.html | 0 doc/libc/apple/constant.EMULTIHOP.html | 0 doc/libc/apple/constant.ENAMETOOLONG.html | 0 doc/libc/apple/constant.ENEEDAUTH.html | 0 doc/libc/apple/constant.ENETDOWN.html | 0 doc/libc/apple/constant.ENETRESET.html | 0 doc/libc/apple/constant.ENETUNREACH.html | 0 doc/libc/apple/constant.ENFILE.html | 0 doc/libc/apple/constant.ENOATTR.html | 0 doc/libc/apple/constant.ENOBUFS.html | 0 doc/libc/apple/constant.ENODATA.html | 0 doc/libc/apple/constant.ENODEV.html | 0 doc/libc/apple/constant.ENOENT.html | 0 doc/libc/apple/constant.ENOEXEC.html | 0 doc/libc/apple/constant.ENOLCK.html | 0 doc/libc/apple/constant.ENOLINK.html | 0 doc/libc/apple/constant.ENOMEM.html | 0 doc/libc/apple/constant.ENOMSG.html | 0 doc/libc/apple/constant.ENOPOLICY.html | 0 doc/libc/apple/constant.ENOPROTOOPT.html | 0 doc/libc/apple/constant.ENOSPC.html | 0 doc/libc/apple/constant.ENOSR.html | 0 doc/libc/apple/constant.ENOSTR.html | 0 doc/libc/apple/constant.ENOSYS.html | 0 doc/libc/apple/constant.ENOTBLK.html | 0 doc/libc/apple/constant.ENOTCONN.html | 0 doc/libc/apple/constant.ENOTDIR.html | 0 doc/libc/apple/constant.ENOTEMPTY.html | 0 doc/libc/apple/constant.ENOTRECOVERABLE.html | 0 doc/libc/apple/constant.ENOTSOCK.html | 0 doc/libc/apple/constant.ENOTSUP.html | 0 doc/libc/apple/constant.ENOTTY.html | 0 doc/libc/apple/constant.ENXIO.html | 0 doc/libc/apple/constant.EOF.html | 0 doc/libc/apple/constant.EOPNOTSUPP.html | 0 doc/libc/apple/constant.EOVERFLOW.html | 0 doc/libc/apple/constant.EOWNERDEAD.html | 0 doc/libc/apple/constant.EPERM.html | 0 doc/libc/apple/constant.EPFNOSUPPORT.html | 0 doc/libc/apple/constant.EPIPE.html | 0 doc/libc/apple/constant.EPROCLIM.html | 0 doc/libc/apple/constant.EPROCUNAVAIL.html | 0 doc/libc/apple/constant.EPROGMISMATCH.html | 0 doc/libc/apple/constant.EPROGUNAVAIL.html | 0 doc/libc/apple/constant.EPROTO.html | 0 doc/libc/apple/constant.EPROTONOSUPPORT.html | 0 doc/libc/apple/constant.EPROTOTYPE.html | 0 doc/libc/apple/constant.EPWROFF.html | 0 doc/libc/apple/constant.EQFULL.html | 0 doc/libc/apple/constant.ERA.html | 0 doc/libc/apple/constant.ERANGE.html | 0 doc/libc/apple/constant.ERA_D_FMT.html | 0 doc/libc/apple/constant.ERA_D_T_FMT.html | 0 doc/libc/apple/constant.ERA_T_FMT.html | 0 doc/libc/apple/constant.EREMOTE.html | 0 doc/libc/apple/constant.EROFS.html | 0 doc/libc/apple/constant.ERPCMISMATCH.html | 0 doc/libc/apple/constant.ESHLIBVERS.html | 0 doc/libc/apple/constant.ESHUTDOWN.html | 0 doc/libc/apple/constant.ESOCKTNOSUPPORT.html | 0 doc/libc/apple/constant.ESPIPE.html | 0 doc/libc/apple/constant.ESRCH.html | 0 doc/libc/apple/constant.ESTALE.html | 0 doc/libc/apple/constant.ETIME.html | 0 doc/libc/apple/constant.ETIMEDOUT.html | 0 doc/libc/apple/constant.ETOOMANYREFS.html | 0 doc/libc/apple/constant.ETXTBSY.html | 0 doc/libc/apple/constant.EUSERS.html | 0 doc/libc/apple/constant.EVFILT_AIO.html | 0 doc/libc/apple/constant.EVFILT_FS.html | 0 doc/libc/apple/constant.EVFILT_MACHPORT.html | 0 doc/libc/apple/constant.EVFILT_PROC.html | 0 doc/libc/apple/constant.EVFILT_READ.html | 0 doc/libc/apple/constant.EVFILT_SIGNAL.html | 0 doc/libc/apple/constant.EVFILT_SYSCOUNT.html | 0 doc/libc/apple/constant.EVFILT_TIMER.html | 0 doc/libc/apple/constant.EVFILT_USER.html | 0 doc/libc/apple/constant.EVFILT_VM.html | 0 doc/libc/apple/constant.EVFILT_VNODE.html | 0 doc/libc/apple/constant.EVFILT_WRITE.html | 0 doc/libc/apple/constant.EV_DISPATCH.html | 0 doc/libc/apple/constant.EV_FLAG0.html | 0 doc/libc/apple/constant.EV_OOBAND.html | 0 doc/libc/apple/constant.EV_POLL.html | 0 doc/libc/apple/constant.EV_RECEIPT.html | 0 doc/libc/apple/constant.EWOULDBLOCK.html | 0 doc/libc/apple/constant.EXDEV.html | 0 doc/libc/apple/constant.EXIT_FAILURE.html | 0 doc/libc/apple/constant.EXIT_SUCCESS.html | 0 doc/libc/apple/constant.FD_SETSIZE.html | 0 doc/libc/apple/constant.FF0.html | 0 doc/libc/apple/constant.FF1.html | 0 doc/libc/apple/constant.FILENAME_MAX.html | 0 doc/libc/apple/constant.FOPEN_MAX.html | 0 doc/libc/apple/constant.F_ALLOCATEALL.html | 0 doc/libc/apple/constant.F_ALLOCATECONTIG.html | 0 doc/libc/apple/constant.F_DUPFD.html | 0 doc/libc/apple/constant.F_DUPFD_CLOEXEC.html | 0 doc/libc/apple/constant.F_FREEZE_FS.html | 0 doc/libc/apple/constant.F_FULLFSYNC.html | 0 doc/libc/apple/constant.F_GETFD.html | 0 doc/libc/apple/constant.F_GETFL.html | 0 doc/libc/apple/constant.F_GETLK.html | 0 doc/libc/apple/constant.F_GETPATH.html | 0 doc/libc/apple/constant.F_GLOBAL_NOCACHE.html | 0 doc/libc/apple/constant.F_LOCK.html | 0 doc/libc/apple/constant.F_NOCACHE.html | 0 doc/libc/apple/constant.F_NODIRECT.html | 0 doc/libc/apple/constant.F_OK.html | 0 doc/libc/apple/constant.F_PEOFPOSMODE.html | 0 doc/libc/apple/constant.F_PREALLOCATE.html | 0 doc/libc/apple/constant.F_RDADVISE.html | 0 doc/libc/apple/constant.F_RDAHEAD.html | 0 doc/libc/apple/constant.F_SETFD.html | 0 doc/libc/apple/constant.F_SETFL.html | 0 doc/libc/apple/constant.F_SETLK.html | 0 doc/libc/apple/constant.F_SETLKW.html | 0 doc/libc/apple/constant.F_TEST.html | 0 doc/libc/apple/constant.F_THAW_FS.html | 0 doc/libc/apple/constant.F_TLOCK.html | 0 doc/libc/apple/constant.F_ULOCK.html | 0 doc/libc/apple/constant.F_VOLPOSMODE.html | 0 doc/libc/apple/constant.GLOB_ABORTED.html | 0 doc/libc/apple/constant.GLOB_APPEND.html | 0 doc/libc/apple/constant.GLOB_DOOFFS.html | 0 doc/libc/apple/constant.GLOB_ERR.html | 0 doc/libc/apple/constant.GLOB_MARK.html | 0 doc/libc/apple/constant.GLOB_NOCHECK.html | 0 doc/libc/apple/constant.GLOB_NOESCAPE.html | 0 doc/libc/apple/constant.GLOB_NOMATCH.html | 0 doc/libc/apple/constant.GLOB_NOSORT.html | 0 doc/libc/apple/constant.GLOB_NOSPACE.html | 0 doc/libc/apple/constant.HW_AVAILCPU.html | 0 doc/libc/apple/constant.IFF_LOOPBACK.html | 0 doc/libc/apple/constant.IPPROTO_IP.html | 0 doc/libc/apple/constant.IPPROTO_IPV6.html | 0 doc/libc/apple/constant.IPPROTO_RAW.html | 0 doc/libc/apple/constant.IPPROTO_TCP.html | 0 doc/libc/apple/constant.IPV6_JOIN_GROUP.html | 0 doc/libc/apple/constant.IPV6_LEAVE_GROUP.html | 0 .../apple/constant.IP_ADD_MEMBERSHIP.html | 0 .../apple/constant.IP_DROP_MEMBERSHIP.html | 0 doc/libc/apple/constant.IP_HDRINCL.html | 0 .../apple/constant.IP_MULTICAST_LOOP.html | 0 doc/libc/apple/constant.IP_MULTICAST_TTL.html | 0 doc/libc/apple/constant.IP_TTL.html | 0 doc/libc/apple/constant.IUTF8.html | 0 doc/libc/apple/constant.LC_ALL_MASK.html | 0 doc/libc/apple/constant.LC_COLLATE_MASK.html | 0 doc/libc/apple/constant.LC_CTYPE_MASK.html | 0 doc/libc/apple/constant.LC_MESSAGES_MASK.html | 0 doc/libc/apple/constant.LC_MONETARY_MASK.html | 0 doc/libc/apple/constant.LC_NUMERIC_MASK.html | 0 doc/libc/apple/constant.LC_TIME_MASK.html | 0 doc/libc/apple/constant.LOCK_EX.html | 0 doc/libc/apple/constant.LOCK_NB.html | 0 doc/libc/apple/constant.LOCK_SH.html | 0 doc/libc/apple/constant.LOCK_UN.html | 0 doc/libc/apple/constant.L_tmpnam.html | 0 doc/libc/apple/constant.MADV_CAN_REUSE.html | 0 doc/libc/apple/constant.MADV_DONTNEED.html | 0 doc/libc/apple/constant.MADV_FREE.html | 0 .../apple/constant.MADV_FREE_REUSABLE.html | 0 doc/libc/apple/constant.MADV_FREE_REUSE.html | 0 doc/libc/apple/constant.MADV_NORMAL.html | 0 doc/libc/apple/constant.MADV_RANDOM.html | 0 doc/libc/apple/constant.MADV_SEQUENTIAL.html | 0 doc/libc/apple/constant.MADV_WILLNEED.html | 0 .../apple/constant.MADV_ZERO_WIRED_PAGES.html | 0 doc/libc/apple/constant.MAP_ANON.html | 0 doc/libc/apple/constant.MAP_COPY.html | 0 doc/libc/apple/constant.MAP_FAILED.html | 0 doc/libc/apple/constant.MAP_FILE.html | 0 doc/libc/apple/constant.MAP_FIXED.html | 0 doc/libc/apple/constant.MAP_HASSEMAPHORE.html | 0 doc/libc/apple/constant.MAP_JIT.html | 0 doc/libc/apple/constant.MAP_NOCACHE.html | 0 doc/libc/apple/constant.MAP_NOEXTEND.html | 0 doc/libc/apple/constant.MAP_NORESERVE.html | 0 doc/libc/apple/constant.MAP_PRIVATE.html | 0 doc/libc/apple/constant.MAP_RENAME.html | 0 doc/libc/apple/constant.MAP_SHARED.html | 0 doc/libc/apple/constant.MCL_CURRENT.html | 0 doc/libc/apple/constant.MCL_FUTURE.html | 0 doc/libc/apple/constant.MINCORE_INCORE.html | 0 doc/libc/apple/constant.MINCORE_MODIFIED.html | 0 .../constant.MINCORE_MODIFIED_OTHER.html | 0 .../apple/constant.MINCORE_REFERENCED.html | 0 .../constant.MINCORE_REFERENCED_OTHER.html | 0 doc/libc/apple/constant.MON_1.html | 0 doc/libc/apple/constant.MON_10.html | 0 doc/libc/apple/constant.MON_11.html | 0 doc/libc/apple/constant.MON_12.html | 0 doc/libc/apple/constant.MON_2.html | 0 doc/libc/apple/constant.MON_3.html | 0 doc/libc/apple/constant.MON_4.html | 0 doc/libc/apple/constant.MON_5.html | 0 doc/libc/apple/constant.MON_6.html | 0 doc/libc/apple/constant.MON_7.html | 0 doc/libc/apple/constant.MON_8.html | 0 doc/libc/apple/constant.MON_9.html | 0 doc/libc/apple/constant.MS_ASYNC.html | 0 doc/libc/apple/constant.MS_DEACTIVATE.html | 0 doc/libc/apple/constant.MS_INVALIDATE.html | 0 doc/libc/apple/constant.MS_KILLPAGES.html | 0 doc/libc/apple/constant.MS_SYNC.html | 0 doc/libc/apple/constant.NI_MAXHOST.html | 0 doc/libc/apple/constant.NL0.html | 0 doc/libc/apple/constant.NL1.html | 0 doc/libc/apple/constant.NOEXPR.html | 0 doc/libc/apple/constant.NOSTR.html | 0 doc/libc/apple/constant.NOTE_ABSOLUTE.html | 0 doc/libc/apple/constant.NOTE_EXITSTATUS.html | 0 .../apple/constant.NOTE_EXIT_REPARENTED.html | 0 doc/libc/apple/constant.NOTE_FFAND.html | 0 doc/libc/apple/constant.NOTE_FFCOPY.html | 0 doc/libc/apple/constant.NOTE_FFCTRLMASK.html | 0 doc/libc/apple/constant.NOTE_FFLAGSMASK.html | 0 doc/libc/apple/constant.NOTE_FFNOP.html | 0 doc/libc/apple/constant.NOTE_FFOR.html | 0 doc/libc/apple/constant.NOTE_NONE.html | 0 doc/libc/apple/constant.NOTE_NSECONDS.html | 0 doc/libc/apple/constant.NOTE_PCTRLMASK.html | 0 doc/libc/apple/constant.NOTE_REAP.html | 0 doc/libc/apple/constant.NOTE_SECONDS.html | 0 doc/libc/apple/constant.NOTE_SIGNAL.html | 0 doc/libc/apple/constant.NOTE_TRIGGER.html | 0 doc/libc/apple/constant.NOTE_USECONDS.html | 0 doc/libc/apple/constant.NOTE_VM_ERROR.html | 0 doc/libc/apple/constant.NOTE_VM_PRESSURE.html | 0 ...ant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html | 0 .../constant.NOTE_VM_PRESSURE_TERMINATE.html | 0 doc/libc/apple/constant.O_ACCMODE.html | 0 doc/libc/apple/constant.O_APPEND.html | 0 doc/libc/apple/constant.O_CLOEXEC.html | 0 doc/libc/apple/constant.O_CREAT.html | 0 doc/libc/apple/constant.O_DIRECTORY.html | 0 doc/libc/apple/constant.O_DSYNC.html | 0 doc/libc/apple/constant.O_EXCL.html | 0 doc/libc/apple/constant.O_NOCTTY.html | 0 doc/libc/apple/constant.O_NONBLOCK.html | 0 doc/libc/apple/constant.O_RDONLY.html | 0 doc/libc/apple/constant.O_RDWR.html | 0 doc/libc/apple/constant.O_SYNC.html | 0 doc/libc/apple/constant.O_TRUNC.html | 0 doc/libc/apple/constant.O_WRONLY.html | 0 doc/libc/apple/constant.PM_STR.html | 0 .../apple/constant.POSIX_MADV_DONTNEED.html | 0 .../apple/constant.POSIX_MADV_NORMAL.html | 0 .../apple/constant.POSIX_MADV_RANDOM.html | 0 .../apple/constant.POSIX_MADV_SEQUENTIAL.html | 0 .../apple/constant.POSIX_MADV_WILLNEED.html | 0 doc/libc/apple/constant.PROT_EXEC.html | 0 doc/libc/apple/constant.PROT_NONE.html | 0 doc/libc/apple/constant.PROT_READ.html | 0 doc/libc/apple/constant.PROT_WRITE.html | 0 .../constant.PTHREAD_COND_INITIALIZER.html | 0 .../constant.PTHREAD_CREATE_DETACHED.html | 0 .../constant.PTHREAD_CREATE_JOINABLE.html | 0 .../constant.PTHREAD_MUTEX_INITIALIZER.html | 0 .../constant.PTHREAD_MUTEX_RECURSIVE.html | 0 .../constant.PTHREAD_RWLOCK_INITIALIZER.html | 0 .../apple/constant.PTHREAD_STACK_MIN.html | 0 doc/libc/apple/constant.Q_GETQUOTA.html | 0 doc/libc/apple/constant.Q_SETQUOTA.html | 0 doc/libc/apple/constant.RADIXCHAR.html | 0 doc/libc/apple/constant.RAND_MAX.html | 0 doc/libc/apple/constant.RLIMIT_AS.html | 0 doc/libc/apple/constant.RLIMIT_CORE.html | 0 doc/libc/apple/constant.RLIMIT_CPU.html | 0 doc/libc/apple/constant.RLIMIT_DATA.html | 0 doc/libc/apple/constant.RLIMIT_FSIZE.html | 0 doc/libc/apple/constant.RLIMIT_MEMLOCK.html | 0 doc/libc/apple/constant.RLIMIT_NOFILE.html | 0 doc/libc/apple/constant.RLIMIT_NPROC.html | 0 doc/libc/apple/constant.RLIMIT_RSS.html | 0 doc/libc/apple/constant.RLIMIT_STACK.html | 0 doc/libc/apple/constant.RLIM_INFINITY.html | 0 doc/libc/apple/constant.RLIM_NLIMITS.html | 0 doc/libc/apple/constant.RTLD_FIRST.html | 0 doc/libc/apple/constant.RTLD_GLOBAL.html | 0 doc/libc/apple/constant.RTLD_LOCAL.html | 0 doc/libc/apple/constant.RTLD_NODELETE.html | 0 doc/libc/apple/constant.RTLD_NOLOAD.html | 0 doc/libc/apple/constant.RUSAGE_CHILDREN.html | 0 doc/libc/apple/constant.RUSAGE_SELF.html | 0 doc/libc/apple/constant.R_OK.html | 0 doc/libc/apple/constant.SEEK_CUR.html | 0 doc/libc/apple/constant.SEEK_END.html | 0 doc/libc/apple/constant.SEEK_SET.html | 0 doc/libc/apple/constant.SHUT_RD.html | 0 doc/libc/apple/constant.SHUT_RDWR.html | 0 doc/libc/apple/constant.SHUT_WR.html | 0 doc/libc/apple/constant.SIGABRT.html | 0 doc/libc/apple/constant.SIGALRM.html | 0 doc/libc/apple/constant.SIGEMT.html | 0 doc/libc/apple/constant.SIGFPE.html | 0 doc/libc/apple/constant.SIGHUP.html | 0 doc/libc/apple/constant.SIGILL.html | 0 doc/libc/apple/constant.SIGINT.html | 0 doc/libc/apple/constant.SIGKILL.html | 0 doc/libc/apple/constant.SIGPIPE.html | 0 doc/libc/apple/constant.SIGQUIT.html | 0 doc/libc/apple/constant.SIGSEGV.html | 0 doc/libc/apple/constant.SIGSTKSZ.html | 0 doc/libc/apple/constant.SIGTERM.html | 0 doc/libc/apple/constant.SIGTRAP.html | 0 doc/libc/apple/constant.SOCK_DGRAM.html | 0 doc/libc/apple/constant.SOCK_RAW.html | 0 doc/libc/apple/constant.SOCK_STREAM.html | 0 doc/libc/apple/constant.SOL_SOCKET.html | 0 doc/libc/apple/constant.SO_ACCEPTCONN.html | 0 doc/libc/apple/constant.SO_BROADCAST.html | 0 doc/libc/apple/constant.SO_DEBUG.html | 0 doc/libc/apple/constant.SO_DONTROUTE.html | 0 doc/libc/apple/constant.SO_DONTTRUNC.html | 0 doc/libc/apple/constant.SO_ERROR.html | 0 doc/libc/apple/constant.SO_KEEPALIVE.html | 0 doc/libc/apple/constant.SO_LINGER.html | 0 doc/libc/apple/constant.SO_NKE.html | 0 doc/libc/apple/constant.SO_NOADDRERR.html | 0 doc/libc/apple/constant.SO_NOSIGPIPE.html | 0 doc/libc/apple/constant.SO_NREAD.html | 0 doc/libc/apple/constant.SO_NWRITE.html | 0 doc/libc/apple/constant.SO_OOBINLINE.html | 0 doc/libc/apple/constant.SO_RCVBUF.html | 0 doc/libc/apple/constant.SO_RCVLOWAT.html | 0 doc/libc/apple/constant.SO_RCVTIMEO.html | 0 doc/libc/apple/constant.SO_REUSEADDR.html | 0 doc/libc/apple/constant.SO_REUSEPORT.html | 0 doc/libc/apple/constant.SO_SNDBUF.html | 0 doc/libc/apple/constant.SO_SNDLOWAT.html | 0 doc/libc/apple/constant.SO_SNDTIMEO.html | 0 doc/libc/apple/constant.SO_TYPE.html | 0 doc/libc/apple/constant.SO_USELOOPBACK.html | 0 doc/libc/apple/constant.SO_WANTMORE.html | 0 doc/libc/apple/constant.SO_WANTOOBFLAG.html | 0 doc/libc/apple/constant.STDERR_FILENO.html | 0 doc/libc/apple/constant.STDIN_FILENO.html | 0 doc/libc/apple/constant.STDOUT_FILENO.html | 0 doc/libc/apple/constant.ST_NOSUID.html | 0 doc/libc/apple/constant.S_IEXEC.html | 0 doc/libc/apple/constant.S_IFBLK.html | 0 doc/libc/apple/constant.S_IFCHR.html | 0 doc/libc/apple/constant.S_IFDIR.html | 0 doc/libc/apple/constant.S_IFIFO.html | 0 doc/libc/apple/constant.S_IFLNK.html | 0 doc/libc/apple/constant.S_IFMT.html | 0 doc/libc/apple/constant.S_IFREG.html | 0 doc/libc/apple/constant.S_IFSOCK.html | 0 doc/libc/apple/constant.S_IREAD.html | 0 doc/libc/apple/constant.S_IRGRP.html | 0 doc/libc/apple/constant.S_IROTH.html | 0 doc/libc/apple/constant.S_IRUSR.html | 0 doc/libc/apple/constant.S_IRWXG.html | 0 doc/libc/apple/constant.S_IRWXO.html | 0 doc/libc/apple/constant.S_IRWXU.html | 0 doc/libc/apple/constant.S_IWGRP.html | 0 doc/libc/apple/constant.S_IWOTH.html | 0 doc/libc/apple/constant.S_IWRITE.html | 0 doc/libc/apple/constant.S_IWUSR.html | 0 doc/libc/apple/constant.S_IXGRP.html | 0 doc/libc/apple/constant.S_IXOTH.html | 0 doc/libc/apple/constant.S_IXUSR.html | 0 doc/libc/apple/constant.TAB0.html | 0 doc/libc/apple/constant.TAB1.html | 0 doc/libc/apple/constant.TAB2.html | 0 doc/libc/apple/constant.TAB3.html | 0 doc/libc/apple/constant.TCP_KEEPALIVE.html | 0 doc/libc/apple/constant.TCP_NODELAY.html | 0 doc/libc/apple/constant.THOUSEP.html | 0 doc/libc/apple/constant.TIOCCBRK.html | 0 doc/libc/apple/constant.TIOCCDTR.html | 0 doc/libc/apple/constant.TIOCCONS.html | 0 doc/libc/apple/constant.TIOCDCDTIMESTAMP.html | 0 doc/libc/apple/constant.TIOCDRAIN.html | 0 doc/libc/apple/constant.TIOCDSIMICROCODE.html | 0 doc/libc/apple/constant.TIOCEXCL.html | 0 doc/libc/apple/constant.TIOCEXT.html | 0 doc/libc/apple/constant.TIOCFLUSH.html | 0 doc/libc/apple/constant.TIOCGDRAINWAIT.html | 0 doc/libc/apple/constant.TIOCGETD.html | 0 doc/libc/apple/constant.TIOCGPGRP.html | 0 doc/libc/apple/constant.TIOCGWINSZ.html | 0 doc/libc/apple/constant.TIOCIXOFF.html | 0 doc/libc/apple/constant.TIOCIXON.html | 0 doc/libc/apple/constant.TIOCMBIC.html | 0 doc/libc/apple/constant.TIOCMBIS.html | 0 doc/libc/apple/constant.TIOCMGDTRWAIT.html | 0 doc/libc/apple/constant.TIOCMGET.html | 0 doc/libc/apple/constant.TIOCMODG.html | 0 doc/libc/apple/constant.TIOCMODS.html | 0 doc/libc/apple/constant.TIOCMSDTRWAIT.html | 0 doc/libc/apple/constant.TIOCMSET.html | 0 doc/libc/apple/constant.TIOCM_CAR.html | 0 doc/libc/apple/constant.TIOCM_CD.html | 0 doc/libc/apple/constant.TIOCM_CTS.html | 0 doc/libc/apple/constant.TIOCM_DSR.html | 0 doc/libc/apple/constant.TIOCM_DTR.html | 0 doc/libc/apple/constant.TIOCM_LE.html | 0 doc/libc/apple/constant.TIOCM_RI.html | 0 doc/libc/apple/constant.TIOCM_RNG.html | 0 doc/libc/apple/constant.TIOCM_RTS.html | 0 doc/libc/apple/constant.TIOCM_SR.html | 0 doc/libc/apple/constant.TIOCM_ST.html | 0 doc/libc/apple/constant.TIOCNOTTY.html | 0 doc/libc/apple/constant.TIOCNXCL.html | 0 doc/libc/apple/constant.TIOCOUTQ.html | 0 doc/libc/apple/constant.TIOCPKT.html | 0 doc/libc/apple/constant.TIOCPKT_DATA.html | 0 doc/libc/apple/constant.TIOCPKT_DOSTOP.html | 0 .../apple/constant.TIOCPKT_FLUSHREAD.html | 0 .../apple/constant.TIOCPKT_FLUSHWRITE.html | 0 doc/libc/apple/constant.TIOCPKT_IOCTL.html | 0 doc/libc/apple/constant.TIOCPKT_NOSTOP.html | 0 doc/libc/apple/constant.TIOCPKT_START.html | 0 doc/libc/apple/constant.TIOCPKT_STOP.html | 0 doc/libc/apple/constant.TIOCPTYGNAME.html | 0 doc/libc/apple/constant.TIOCPTYGRANT.html | 0 doc/libc/apple/constant.TIOCPTYUNLK.html | 0 doc/libc/apple/constant.TIOCREMOTE.html | 0 doc/libc/apple/constant.TIOCSBRK.html | 0 doc/libc/apple/constant.TIOCSCONS.html | 0 doc/libc/apple/constant.TIOCSCTTY.html | 0 doc/libc/apple/constant.TIOCSDRAINWAIT.html | 0 doc/libc/apple/constant.TIOCSDTR.html | 0 doc/libc/apple/constant.TIOCSETD.html | 0 doc/libc/apple/constant.TIOCSIG.html | 0 doc/libc/apple/constant.TIOCSPGRP.html | 0 doc/libc/apple/constant.TIOCSTART.html | 0 doc/libc/apple/constant.TIOCSTAT.html | 0 doc/libc/apple/constant.TIOCSTI.html | 0 doc/libc/apple/constant.TIOCSTOP.html | 0 doc/libc/apple/constant.TIOCSWINSZ.html | 0 doc/libc/apple/constant.TIOCTIMESTAMP.html | 0 doc/libc/apple/constant.TIOCUCNTL.html | 0 doc/libc/apple/constant.TMP_MAX.html | 0 doc/libc/apple/constant.T_FMT.html | 0 doc/libc/apple/constant.T_FMT_AMPM.html | 0 doc/libc/apple/constant.VT0.html | 0 doc/libc/apple/constant.VT1.html | 0 doc/libc/apple/constant.W_OK.html | 0 doc/libc/apple/constant.X_OK.html | 0 doc/libc/apple/constant.YESEXPR.html | 0 doc/libc/apple/constant.YESSTR.html | 0 doc/libc/apple/constant._IOFBF.html | 0 doc/libc/apple/constant._IOLBF.html | 0 doc/libc/apple/constant._IONBF.html | 0 doc/libc/apple/constant._PC_NAME_MAX.html | 0 .../constant._PTHREAD_COND_SIG_init.html | 0 .../constant._PTHREAD_MUTEX_SIG_init.html | 0 .../constant._PTHREAD_RWLOCK_SIG_init.html | 0 .../apple/constant._RLIMIT_POSIX_FLAG.html | 0 doc/libc/apple/constant._SC_2_CHAR_TERM.html | 0 doc/libc/apple/constant._SC_2_C_BIND.html | 0 doc/libc/apple/constant._SC_2_C_DEV.html | 0 doc/libc/apple/constant._SC_2_FORT_DEV.html | 0 doc/libc/apple/constant._SC_2_FORT_RUN.html | 0 doc/libc/apple/constant._SC_2_LOCALEDEF.html | 0 doc/libc/apple/constant._SC_2_PBS.html | 0 .../apple/constant._SC_2_PBS_ACCOUNTING.html | 0 .../apple/constant._SC_2_PBS_CHECKPOINT.html | 0 doc/libc/apple/constant._SC_2_PBS_LOCATE.html | 0 .../apple/constant._SC_2_PBS_MESSAGE.html | 0 doc/libc/apple/constant._SC_2_PBS_TRACK.html | 0 doc/libc/apple/constant._SC_2_SW_DEV.html | 0 doc/libc/apple/constant._SC_2_UPE.html | 0 doc/libc/apple/constant._SC_2_VERSION.html | 0 .../apple/constant._SC_ADVISORY_INFO.html | 0 .../apple/constant._SC_AIO_LISTIO_MAX.html | 0 doc/libc/apple/constant._SC_AIO_MAX.html | 0 .../constant._SC_AIO_PRIO_DELTA_MAX.html | 0 doc/libc/apple/constant._SC_ARG_MAX.html | 0 .../apple/constant._SC_ASYNCHRONOUS_IO.html | 0 doc/libc/apple/constant._SC_ATEXIT_MAX.html | 0 doc/libc/apple/constant._SC_BARRIERS.html | 0 doc/libc/apple/constant._SC_BC_BASE_MAX.html | 0 doc/libc/apple/constant._SC_BC_DIM_MAX.html | 0 doc/libc/apple/constant._SC_BC_SCALE_MAX.html | 0 .../apple/constant._SC_BC_STRING_MAX.html | 0 doc/libc/apple/constant._SC_CHILD_MAX.html | 0 doc/libc/apple/constant._SC_CLK_TCK.html | 0 .../apple/constant._SC_CLOCK_SELECTION.html | 0 .../apple/constant._SC_COLL_WEIGHTS_MAX.html | 0 doc/libc/apple/constant._SC_CPUTIME.html | 0 .../apple/constant._SC_DELAYTIMER_MAX.html | 0 .../apple/constant._SC_EXPR_NEST_MAX.html | 0 doc/libc/apple/constant._SC_FILE_LOCKING.html | 0 doc/libc/apple/constant._SC_FSYNC.html | 0 .../apple/constant._SC_GETGR_R_SIZE_MAX.html | 0 .../apple/constant._SC_GETPW_R_SIZE_MAX.html | 0 .../apple/constant._SC_HOST_NAME_MAX.html | 0 doc/libc/apple/constant._SC_IOV_MAX.html | 0 doc/libc/apple/constant._SC_IPV6.html | 0 doc/libc/apple/constant._SC_JOB_CONTROL.html | 0 doc/libc/apple/constant._SC_LINE_MAX.html | 0 .../apple/constant._SC_LOGIN_NAME_MAX.html | 0 doc/libc/apple/constant._SC_MAPPED_FILES.html | 0 doc/libc/apple/constant._SC_MEMLOCK.html | 0 .../apple/constant._SC_MEMLOCK_RANGE.html | 0 .../apple/constant._SC_MEMORY_PROTECTION.html | 0 .../apple/constant._SC_MESSAGE_PASSING.html | 0 .../apple/constant._SC_MONOTONIC_CLOCK.html | 0 doc/libc/apple/constant._SC_MQ_OPEN_MAX.html | 0 doc/libc/apple/constant._SC_MQ_PRIO_MAX.html | 0 doc/libc/apple/constant._SC_NGROUPS_MAX.html | 0 .../apple/constant._SC_NPROCESSORS_CONF.html | 0 .../apple/constant._SC_NPROCESSORS_ONLN.html | 0 doc/libc/apple/constant._SC_OPEN_MAX.html | 0 doc/libc/apple/constant._SC_PAGESIZE.html | 0 doc/libc/apple/constant._SC_PAGE_SIZE.html | 0 doc/libc/apple/constant._SC_PASS_MAX.html | 0 .../apple/constant._SC_PRIORITIZED_IO.html | 0 .../constant._SC_PRIORITY_SCHEDULING.html | 0 doc/libc/apple/constant._SC_RAW_SOCKETS.html | 0 .../constant._SC_READER_WRITER_LOCKS.html | 0 .../apple/constant._SC_REALTIME_SIGNALS.html | 0 doc/libc/apple/constant._SC_REGEXP.html | 0 doc/libc/apple/constant._SC_RE_DUP_MAX.html | 0 doc/libc/apple/constant._SC_RTSIG_MAX.html | 0 doc/libc/apple/constant._SC_SAVED_IDS.html | 0 doc/libc/apple/constant._SC_SEMAPHORES.html | 0 .../apple/constant._SC_SEM_NSEMS_MAX.html | 0 .../apple/constant._SC_SEM_VALUE_MAX.html | 0 .../constant._SC_SHARED_MEMORY_OBJECTS.html | 0 doc/libc/apple/constant._SC_SHELL.html | 0 doc/libc/apple/constant._SC_SIGQUEUE_MAX.html | 0 doc/libc/apple/constant._SC_SPAWN.html | 0 doc/libc/apple/constant._SC_SPIN_LOCKS.html | 0 .../apple/constant._SC_SPORADIC_SERVER.html | 0 doc/libc/apple/constant._SC_SS_REPL_MAX.html | 0 doc/libc/apple/constant._SC_STREAM_MAX.html | 0 doc/libc/apple/constant._SC_SYMLOOP_MAX.html | 0 .../apple/constant._SC_SYNCHRONIZED_IO.html | 0 doc/libc/apple/constant._SC_THREADS.html | 0 .../constant._SC_THREAD_ATTR_STACKADDR.html | 0 .../constant._SC_THREAD_ATTR_STACKSIZE.html | 0 .../apple/constant._SC_THREAD_CPUTIME.html | 0 ...tant._SC_THREAD_DESTRUCTOR_ITERATIONS.html | 0 .../apple/constant._SC_THREAD_KEYS_MAX.html | 0 ...nstant._SC_THREAD_PRIORITY_SCHEDULING.html | 0 .../constant._SC_THREAD_PRIO_INHERIT.html | 0 .../constant._SC_THREAD_PRIO_PROTECT.html | 0 .../constant._SC_THREAD_PROCESS_SHARED.html | 0 .../constant._SC_THREAD_SAFE_FUNCTIONS.html | 0 .../constant._SC_THREAD_SPORADIC_SERVER.html | 0 .../apple/constant._SC_THREAD_STACK_MIN.html | 0 .../constant._SC_THREAD_THREADS_MAX.html | 0 doc/libc/apple/constant._SC_TIMEOUTS.html | 0 doc/libc/apple/constant._SC_TIMERS.html | 0 doc/libc/apple/constant._SC_TIMER_MAX.html | 0 doc/libc/apple/constant._SC_TRACE.html | 0 .../constant._SC_TRACE_EVENT_FILTER.html | 0 .../constant._SC_TRACE_EVENT_NAME_MAX.html | 0 .../apple/constant._SC_TRACE_INHERIT.html | 0 doc/libc/apple/constant._SC_TRACE_LOG.html | 0 .../apple/constant._SC_TRACE_NAME_MAX.html | 0 .../apple/constant._SC_TRACE_SYS_MAX.html | 0 .../constant._SC_TRACE_USER_EVENT_MAX.html | 0 doc/libc/apple/constant._SC_TTY_NAME_MAX.html | 0 .../constant._SC_TYPED_MEMORY_OBJECTS.html | 0 doc/libc/apple/constant._SC_TZNAME_MAX.html | 0 .../apple/constant._SC_V6_ILP32_OFF32.html | 0 .../apple/constant._SC_V6_ILP32_OFFBIG.html | 0 .../apple/constant._SC_V6_LP64_OFF64.html | 0 .../apple/constant._SC_V6_LPBIG_OFFBIG.html | 0 doc/libc/apple/constant._SC_VERSION.html | 0 .../apple/constant._SC_XBS5_ILP32_OFF32.html | 0 .../apple/constant._SC_XBS5_ILP32_OFFBIG.html | 0 .../apple/constant._SC_XBS5_LP64_OFF64.html | 0 .../apple/constant._SC_XBS5_LPBIG_OFFBIG.html | 0 doc/libc/apple/constant._SC_XOPEN_CRYPT.html | 0 .../apple/constant._SC_XOPEN_ENH_I18N.html | 0 doc/libc/apple/constant._SC_XOPEN_LEGACY.html | 0 .../apple/constant._SC_XOPEN_REALTIME.html | 0 .../constant._SC_XOPEN_REALTIME_THREADS.html | 0 doc/libc/apple/constant._SC_XOPEN_SHM.html | 0 .../apple/constant._SC_XOPEN_STREAMS.html | 0 doc/libc/apple/constant._SC_XOPEN_UNIX.html | 0 .../apple/constant._SC_XOPEN_VERSION.html | 0 .../apple/constant._SC_XOPEN_XCU_VERSION.html | 0 doc/libc/apple/constant._WSTOPPED.html | 0 .../apple/constant.__PTHREAD_COND_SIZE__.html | 0 .../constant.__PTHREAD_MUTEX_SIZE__.html | 0 .../constant.__PTHREAD_RWLOCK_SIZE__.html | 0 doc/libc/apple/enum.timezone.html | 10 - doc/libc/apple/fn.WIFCONTINUED.html | 10 - doc/libc/apple/fn.WIFSIGNALED.html | 10 - doc/libc/apple/fn.WIFSTOPPED.html | 10 - doc/libc/apple/fn.WSTOPSIG.html | 10 - doc/libc/apple/fn._WSTATUS.html | 10 - doc/libc/apple/fn.__error.html | 10 - doc/libc/apple/fn.backtrace.html | 10 - doc/libc/apple/fn.duplocale.html | 10 - doc/libc/apple/fn.forkpty.html | 10 - doc/libc/apple/fn.freelocale.html | 10 - doc/libc/apple/fn.fstatfs.html | 10 - doc/libc/apple/fn.getnameinfo.html | 10 - doc/libc/apple/fn.kevent.html | 10 - doc/libc/apple/fn.kevent64.html | 10 - doc/libc/apple/fn.localeconv_l.html | 10 - doc/libc/apple/fn.mach_absolute_time.html | 10 - doc/libc/apple/fn.mach_timebase_info.html | 10 - doc/libc/apple/fn.mincore.html | 10 - doc/libc/apple/fn.mount.html | 10 - doc/libc/apple/fn.mprotect.html | 10 - doc/libc/apple/fn.newlocale.html | 10 - doc/libc/apple/fn.openpty.html | 10 - .../apple/fn.pthread_get_stackaddr_np.html | 10 - .../apple/fn.pthread_get_stacksize_np.html | 10 - doc/libc/apple/fn.pthread_setname_np.html | 10 - doc/libc/apple/fn.ptrace.html | 10 - doc/libc/apple/fn.querylocale.html | 10 - doc/libc/apple/fn.quotactl.html | 10 - doc/libc/apple/fn.sendfile.html | 10 - doc/libc/apple/fn.sethostname.html | 10 - doc/libc/apple/fn.shm_open.html | 10 - doc/libc/apple/fn.statfs.html | 10 - doc/libc/apple/fn.sysctl.html | 10 - doc/libc/apple/fn.sysctlbyname.html | 10 - doc/libc/apple/fn.sysctlnametomib.html | 10 - doc/libc/apple/fn.uselocale.html | 10 - doc/libc/apple/index.html | 0 doc/libc/apple/sidebar-items.js | 1 - doc/libc/apple/struct.Dl_info.html | 10 - doc/libc/apple/struct.addrinfo.html | 10 - doc/libc/apple/struct.dirent.html | 10 - doc/libc/apple/struct.dqblk.html | 10 - doc/libc/apple/struct.flock.html | 10 - doc/libc/apple/struct.fstore_t.html | 10 - doc/libc/apple/struct.glob_t.html | 10 - doc/libc/apple/struct.kevent.html | 10 - doc/libc/apple/struct.kevent64_s.html | 10 - doc/libc/apple/struct.lconv.html | 10 - doc/libc/apple/struct.mach_timebase_info.html | 10 - doc/libc/apple/struct.pthread_attr_t.html | 10 - doc/libc/apple/struct.pthread_cond_t.html | 10 - doc/libc/apple/struct.pthread_mutex_t.html | 10 - .../apple/struct.pthread_mutexattr_t.html | 10 - doc/libc/apple/struct.pthread_rwlock_t.html | 10 - doc/libc/apple/struct.radvisory.html | 10 - doc/libc/apple/struct.sf_hdtr.html | 10 - doc/libc/apple/struct.sigaction.html | 10 - doc/libc/apple/struct.siginfo_t.html | 10 - doc/libc/apple/struct.sockaddr_in.html | 10 - doc/libc/apple/struct.sockaddr_storage.html | 10 - doc/libc/apple/struct.stack_t.html | 10 - doc/libc/apple/struct.stat.html | 10 - doc/libc/apple/struct.statfs.html | 10 - doc/libc/apple/struct.statvfs.html | 10 - doc/libc/apple/struct.termios.html | 10 - doc/libc/apple/type.blksize_t.html | 10 - doc/libc/apple/type.c_long.html | 10 - doc/libc/apple/type.c_ulong.html | 10 - doc/libc/apple/type.clock_t.html | 10 - doc/libc/apple/type.dev_t.html | 10 - doc/libc/apple/type.fsblkcnt_t.html | 10 - doc/libc/apple/type.fsfilcnt_t.html | 10 - doc/libc/apple/type.ino_t.html | 10 - .../apple/type.mach_timebase_info_data_t.html | 10 - doc/libc/apple/type.mode_t.html | 10 - doc/libc/apple/type.nl_item.html | 10 - doc/libc/apple/type.nlink_t.html | 10 - doc/libc/apple/type.pthread_key_t.html | 10 - doc/libc/apple/type.rlim_t.html | 10 - doc/libc/apple/type.sigset_t.html | 10 - doc/libc/apple/type.speed_t.html | 10 - doc/libc/apple/type.suseconds_t.html | 10 - doc/libc/apple/type.tcflag_t.html | 10 - doc/libc/apple/type.time_t.html | 10 - doc/libc/b64/constant.TIOCDCDTIMESTAMP.html | 0 doc/libc/b64/constant.TIOCTIMESTAMP.html | 0 .../b64/constant.__PTHREAD_COND_SIZE__.html | 0 .../b64/constant.__PTHREAD_MUTEX_SIZE__.html | 0 .../b64/constant.__PTHREAD_RWLOCK_SIZE__.html | 0 doc/libc/b64/index.html | 0 doc/libc/b64/sidebar-items.js | 1 - doc/libc/b64/struct.pthread_attr_t.html | 10 - doc/libc/b64/type.c_long.html | 10 - doc/libc/b64/type.c_ulong.html | 10 - .../apple/b64/constant.TIOCDCDTIMESTAMP.html | 0 .../bsd/apple/b64/constant.TIOCTIMESTAMP.html | 0 .../b64/constant.__PTHREAD_COND_SIZE__.html | 0 .../b64/constant.__PTHREAD_MUTEX_SIZE__.html | 0 .../b64/constant.__PTHREAD_RWLOCK_SIZE__.html | 0 doc/libc/bsd/apple/b64/index.html | 0 doc/libc/bsd/apple/b64/sidebar-items.js | 1 - .../bsd/apple/b64/struct.pthread_attr_t.html | 10 - doc/libc/bsd/apple/b64/type.c_long.html | 10 - doc/libc/bsd/apple/b64/type.c_ulong.html | 10 - doc/libc/bsd/apple/constant.ABDAY_1.html | 0 doc/libc/bsd/apple/constant.ABDAY_2.html | 0 doc/libc/bsd/apple/constant.ABDAY_3.html | 0 doc/libc/bsd/apple/constant.ABDAY_4.html | 0 doc/libc/bsd/apple/constant.ABDAY_5.html | 0 doc/libc/bsd/apple/constant.ABDAY_6.html | 0 doc/libc/bsd/apple/constant.ABDAY_7.html | 0 doc/libc/bsd/apple/constant.ABMON_1.html | 0 doc/libc/bsd/apple/constant.ABMON_10.html | 0 doc/libc/bsd/apple/constant.ABMON_11.html | 0 doc/libc/bsd/apple/constant.ABMON_12.html | 0 doc/libc/bsd/apple/constant.ABMON_2.html | 0 doc/libc/bsd/apple/constant.ABMON_3.html | 0 doc/libc/bsd/apple/constant.ABMON_4.html | 0 doc/libc/bsd/apple/constant.ABMON_5.html | 0 doc/libc/bsd/apple/constant.ABMON_6.html | 0 doc/libc/bsd/apple/constant.ABMON_7.html | 0 doc/libc/bsd/apple/constant.ABMON_8.html | 0 doc/libc/bsd/apple/constant.ABMON_9.html | 0 doc/libc/bsd/apple/constant.AF_INET.html | 0 doc/libc/bsd/apple/constant.AF_INET6.html | 0 doc/libc/bsd/apple/constant.AF_UNIX.html | 0 doc/libc/bsd/apple/constant.ALT_DIGITS.html | 0 doc/libc/bsd/apple/constant.AM_STR.html | 0 doc/libc/bsd/apple/constant.BS0.html | 0 doc/libc/bsd/apple/constant.BS1.html | 0 doc/libc/bsd/apple/constant.BUFSIZ.html | 0 doc/libc/bsd/apple/constant.CODESET.html | 0 doc/libc/bsd/apple/constant.CR0.html | 0 doc/libc/bsd/apple/constant.CR1.html | 0 doc/libc/bsd/apple/constant.CR2.html | 0 doc/libc/bsd/apple/constant.CR3.html | 0 doc/libc/bsd/apple/constant.CRNCYSTR.html | 0 doc/libc/bsd/apple/constant.CRTSCTS.html | 0 doc/libc/bsd/apple/constant.DAY_1.html | 0 doc/libc/bsd/apple/constant.DAY_2.html | 0 doc/libc/bsd/apple/constant.DAY_3.html | 0 doc/libc/bsd/apple/constant.DAY_4.html | 0 doc/libc/bsd/apple/constant.DAY_5.html | 0 doc/libc/bsd/apple/constant.DAY_6.html | 0 doc/libc/bsd/apple/constant.DAY_7.html | 0 doc/libc/bsd/apple/constant.D_FMT.html | 0 doc/libc/bsd/apple/constant.D_MD_ORDER.html | 0 doc/libc/bsd/apple/constant.D_T_FMT.html | 0 doc/libc/bsd/apple/constant.E2BIG.html | 0 doc/libc/bsd/apple/constant.EACCES.html | 0 doc/libc/bsd/apple/constant.EADDRINUSE.html | 0 .../bsd/apple/constant.EADDRNOTAVAIL.html | 0 doc/libc/bsd/apple/constant.EAFNOSUPPORT.html | 0 doc/libc/bsd/apple/constant.EAGAIN.html | 0 doc/libc/bsd/apple/constant.EALREADY.html | 0 doc/libc/bsd/apple/constant.EAUTH.html | 0 doc/libc/bsd/apple/constant.EBADARCH.html | 0 doc/libc/bsd/apple/constant.EBADEXEC.html | 0 doc/libc/bsd/apple/constant.EBADF.html | 0 doc/libc/bsd/apple/constant.EBADMACHO.html | 0 doc/libc/bsd/apple/constant.EBADMSG.html | 0 doc/libc/bsd/apple/constant.EBADRPC.html | 0 doc/libc/bsd/apple/constant.EBUSY.html | 0 doc/libc/bsd/apple/constant.ECANCELED.html | 0 doc/libc/bsd/apple/constant.ECHILD.html | 0 doc/libc/bsd/apple/constant.ECONNABORTED.html | 0 doc/libc/bsd/apple/constant.ECONNREFUSED.html | 0 doc/libc/bsd/apple/constant.ECONNRESET.html | 0 doc/libc/bsd/apple/constant.EDEADLK.html | 0 doc/libc/bsd/apple/constant.EDESTADDRREQ.html | 0 doc/libc/bsd/apple/constant.EDEVERR.html | 0 doc/libc/bsd/apple/constant.EDOM.html | 0 doc/libc/bsd/apple/constant.EDQUOT.html | 0 doc/libc/bsd/apple/constant.EEXIST.html | 0 doc/libc/bsd/apple/constant.EFAULT.html | 0 doc/libc/bsd/apple/constant.EFBIG.html | 0 doc/libc/bsd/apple/constant.EFTYPE.html | 0 doc/libc/bsd/apple/constant.EHOSTDOWN.html | 0 doc/libc/bsd/apple/constant.EHOSTUNREACH.html | 0 doc/libc/bsd/apple/constant.EIDRM.html | 0 doc/libc/bsd/apple/constant.EILSEQ.html | 0 doc/libc/bsd/apple/constant.EINPROGRESS.html | 0 doc/libc/bsd/apple/constant.EINTR.html | 0 doc/libc/bsd/apple/constant.EINVAL.html | 0 doc/libc/bsd/apple/constant.EIO.html | 0 doc/libc/bsd/apple/constant.EISCONN.html | 0 doc/libc/bsd/apple/constant.EISDIR.html | 0 doc/libc/bsd/apple/constant.ELAST.html | 0 doc/libc/bsd/apple/constant.ELOOP.html | 0 doc/libc/bsd/apple/constant.EMFILE.html | 0 doc/libc/bsd/apple/constant.EMLINK.html | 0 doc/libc/bsd/apple/constant.EMSGSIZE.html | 0 doc/libc/bsd/apple/constant.EMULTIHOP.html | 0 doc/libc/bsd/apple/constant.ENAMETOOLONG.html | 0 doc/libc/bsd/apple/constant.ENEEDAUTH.html | 0 doc/libc/bsd/apple/constant.ENETDOWN.html | 0 doc/libc/bsd/apple/constant.ENETRESET.html | 0 doc/libc/bsd/apple/constant.ENETUNREACH.html | 0 doc/libc/bsd/apple/constant.ENFILE.html | 0 doc/libc/bsd/apple/constant.ENOATTR.html | 0 doc/libc/bsd/apple/constant.ENOBUFS.html | 0 doc/libc/bsd/apple/constant.ENODATA.html | 0 doc/libc/bsd/apple/constant.ENODEV.html | 0 doc/libc/bsd/apple/constant.ENOENT.html | 0 doc/libc/bsd/apple/constant.ENOEXEC.html | 0 doc/libc/bsd/apple/constant.ENOLCK.html | 0 doc/libc/bsd/apple/constant.ENOLINK.html | 0 doc/libc/bsd/apple/constant.ENOMEM.html | 0 doc/libc/bsd/apple/constant.ENOMSG.html | 0 doc/libc/bsd/apple/constant.ENOPOLICY.html | 0 doc/libc/bsd/apple/constant.ENOPROTOOPT.html | 0 doc/libc/bsd/apple/constant.ENOSPC.html | 0 doc/libc/bsd/apple/constant.ENOSR.html | 0 doc/libc/bsd/apple/constant.ENOSTR.html | 0 doc/libc/bsd/apple/constant.ENOSYS.html | 0 doc/libc/bsd/apple/constant.ENOTBLK.html | 0 doc/libc/bsd/apple/constant.ENOTCONN.html | 0 doc/libc/bsd/apple/constant.ENOTDIR.html | 0 doc/libc/bsd/apple/constant.ENOTEMPTY.html | 0 .../bsd/apple/constant.ENOTRECOVERABLE.html | 0 doc/libc/bsd/apple/constant.ENOTSOCK.html | 0 doc/libc/bsd/apple/constant.ENOTSUP.html | 0 doc/libc/bsd/apple/constant.ENOTTY.html | 0 doc/libc/bsd/apple/constant.ENXIO.html | 0 doc/libc/bsd/apple/constant.EOF.html | 0 doc/libc/bsd/apple/constant.EOPNOTSUPP.html | 0 doc/libc/bsd/apple/constant.EOVERFLOW.html | 0 doc/libc/bsd/apple/constant.EOWNERDEAD.html | 0 doc/libc/bsd/apple/constant.EPERM.html | 0 doc/libc/bsd/apple/constant.EPFNOSUPPORT.html | 0 doc/libc/bsd/apple/constant.EPIPE.html | 0 doc/libc/bsd/apple/constant.EPROCLIM.html | 0 doc/libc/bsd/apple/constant.EPROCUNAVAIL.html | 0 .../bsd/apple/constant.EPROGMISMATCH.html | 0 doc/libc/bsd/apple/constant.EPROGUNAVAIL.html | 0 doc/libc/bsd/apple/constant.EPROTO.html | 0 .../bsd/apple/constant.EPROTONOSUPPORT.html | 0 doc/libc/bsd/apple/constant.EPROTOTYPE.html | 0 doc/libc/bsd/apple/constant.EPWROFF.html | 0 doc/libc/bsd/apple/constant.EQFULL.html | 0 doc/libc/bsd/apple/constant.ERA.html | 0 doc/libc/bsd/apple/constant.ERANGE.html | 0 doc/libc/bsd/apple/constant.ERA_D_FMT.html | 0 doc/libc/bsd/apple/constant.ERA_D_T_FMT.html | 0 doc/libc/bsd/apple/constant.ERA_T_FMT.html | 0 doc/libc/bsd/apple/constant.EREMOTE.html | 0 doc/libc/bsd/apple/constant.EROFS.html | 0 doc/libc/bsd/apple/constant.ERPCMISMATCH.html | 0 doc/libc/bsd/apple/constant.ESHLIBVERS.html | 0 doc/libc/bsd/apple/constant.ESHUTDOWN.html | 0 .../bsd/apple/constant.ESOCKTNOSUPPORT.html | 0 doc/libc/bsd/apple/constant.ESPIPE.html | 0 doc/libc/bsd/apple/constant.ESRCH.html | 0 doc/libc/bsd/apple/constant.ESTALE.html | 0 doc/libc/bsd/apple/constant.ETIME.html | 0 doc/libc/bsd/apple/constant.ETIMEDOUT.html | 0 doc/libc/bsd/apple/constant.ETOOMANYREFS.html | 0 doc/libc/bsd/apple/constant.ETXTBSY.html | 0 doc/libc/bsd/apple/constant.EUSERS.html | 0 doc/libc/bsd/apple/constant.EVFILT_AIO.html | 0 doc/libc/bsd/apple/constant.EVFILT_FS.html | 0 .../bsd/apple/constant.EVFILT_MACHPORT.html | 0 doc/libc/bsd/apple/constant.EVFILT_PROC.html | 0 doc/libc/bsd/apple/constant.EVFILT_READ.html | 0 .../bsd/apple/constant.EVFILT_SIGNAL.html | 0 .../bsd/apple/constant.EVFILT_SYSCOUNT.html | 0 doc/libc/bsd/apple/constant.EVFILT_TIMER.html | 0 doc/libc/bsd/apple/constant.EVFILT_USER.html | 0 doc/libc/bsd/apple/constant.EVFILT_VM.html | 0 doc/libc/bsd/apple/constant.EVFILT_VNODE.html | 0 doc/libc/bsd/apple/constant.EVFILT_WRITE.html | 0 doc/libc/bsd/apple/constant.EV_DISPATCH.html | 0 doc/libc/bsd/apple/constant.EV_FLAG0.html | 0 doc/libc/bsd/apple/constant.EV_OOBAND.html | 0 doc/libc/bsd/apple/constant.EV_POLL.html | 0 doc/libc/bsd/apple/constant.EV_RECEIPT.html | 0 doc/libc/bsd/apple/constant.EWOULDBLOCK.html | 0 doc/libc/bsd/apple/constant.EXDEV.html | 0 doc/libc/bsd/apple/constant.EXIT_FAILURE.html | 0 doc/libc/bsd/apple/constant.EXIT_SUCCESS.html | 0 doc/libc/bsd/apple/constant.FD_SETSIZE.html | 0 doc/libc/bsd/apple/constant.FF0.html | 0 doc/libc/bsd/apple/constant.FF1.html | 0 doc/libc/bsd/apple/constant.FILENAME_MAX.html | 0 doc/libc/bsd/apple/constant.FOPEN_MAX.html | 0 .../bsd/apple/constant.F_ALLOCATEALL.html | 0 .../bsd/apple/constant.F_ALLOCATECONTIG.html | 0 doc/libc/bsd/apple/constant.F_DUPFD.html | 0 .../bsd/apple/constant.F_DUPFD_CLOEXEC.html | 0 doc/libc/bsd/apple/constant.F_FREEZE_FS.html | 0 doc/libc/bsd/apple/constant.F_FULLFSYNC.html | 0 doc/libc/bsd/apple/constant.F_GETFD.html | 0 doc/libc/bsd/apple/constant.F_GETFL.html | 0 doc/libc/bsd/apple/constant.F_GETLK.html | 0 doc/libc/bsd/apple/constant.F_GETPATH.html | 0 .../bsd/apple/constant.F_GLOBAL_NOCACHE.html | 0 doc/libc/bsd/apple/constant.F_LOCK.html | 0 doc/libc/bsd/apple/constant.F_NOCACHE.html | 0 doc/libc/bsd/apple/constant.F_NODIRECT.html | 0 doc/libc/bsd/apple/constant.F_OK.html | 0 .../bsd/apple/constant.F_PEOFPOSMODE.html | 0 .../bsd/apple/constant.F_PREALLOCATE.html | 0 doc/libc/bsd/apple/constant.F_RDADVISE.html | 0 doc/libc/bsd/apple/constant.F_RDAHEAD.html | 0 doc/libc/bsd/apple/constant.F_SETFD.html | 0 doc/libc/bsd/apple/constant.F_SETFL.html | 0 doc/libc/bsd/apple/constant.F_SETLK.html | 0 doc/libc/bsd/apple/constant.F_SETLKW.html | 0 doc/libc/bsd/apple/constant.F_TEST.html | 0 doc/libc/bsd/apple/constant.F_THAW_FS.html | 0 doc/libc/bsd/apple/constant.F_TLOCK.html | 0 doc/libc/bsd/apple/constant.F_ULOCK.html | 0 doc/libc/bsd/apple/constant.F_VOLPOSMODE.html | 0 doc/libc/bsd/apple/constant.GLOB_ABORTED.html | 0 doc/libc/bsd/apple/constant.GLOB_APPEND.html | 0 doc/libc/bsd/apple/constant.GLOB_DOOFFS.html | 0 doc/libc/bsd/apple/constant.GLOB_ERR.html | 0 doc/libc/bsd/apple/constant.GLOB_MARK.html | 0 doc/libc/bsd/apple/constant.GLOB_NOCHECK.html | 0 .../bsd/apple/constant.GLOB_NOESCAPE.html | 0 doc/libc/bsd/apple/constant.GLOB_NOMATCH.html | 0 doc/libc/bsd/apple/constant.GLOB_NOSORT.html | 0 doc/libc/bsd/apple/constant.GLOB_NOSPACE.html | 0 doc/libc/bsd/apple/constant.HW_AVAILCPU.html | 0 doc/libc/bsd/apple/constant.IFF_LOOPBACK.html | 0 doc/libc/bsd/apple/constant.IPPROTO_IP.html | 0 doc/libc/bsd/apple/constant.IPPROTO_IPV6.html | 0 doc/libc/bsd/apple/constant.IPPROTO_RAW.html | 0 doc/libc/bsd/apple/constant.IPPROTO_TCP.html | 0 .../bsd/apple/constant.IPV6_JOIN_GROUP.html | 0 .../bsd/apple/constant.IPV6_LEAVE_GROUP.html | 0 .../bsd/apple/constant.IP_ADD_MEMBERSHIP.html | 0 .../apple/constant.IP_DROP_MEMBERSHIP.html | 0 doc/libc/bsd/apple/constant.IP_HDRINCL.html | 0 .../bsd/apple/constant.IP_MULTICAST_LOOP.html | 0 .../bsd/apple/constant.IP_MULTICAST_TTL.html | 0 doc/libc/bsd/apple/constant.IP_TTL.html | 0 doc/libc/bsd/apple/constant.IUTF8.html | 0 doc/libc/bsd/apple/constant.LC_ALL_MASK.html | 0 .../bsd/apple/constant.LC_COLLATE_MASK.html | 0 .../bsd/apple/constant.LC_CTYPE_MASK.html | 0 .../bsd/apple/constant.LC_MESSAGES_MASK.html | 0 .../bsd/apple/constant.LC_MONETARY_MASK.html | 0 .../bsd/apple/constant.LC_NUMERIC_MASK.html | 0 doc/libc/bsd/apple/constant.LC_TIME_MASK.html | 0 doc/libc/bsd/apple/constant.LOCK_EX.html | 0 doc/libc/bsd/apple/constant.LOCK_NB.html | 0 doc/libc/bsd/apple/constant.LOCK_SH.html | 0 doc/libc/bsd/apple/constant.LOCK_UN.html | 0 doc/libc/bsd/apple/constant.L_tmpnam.html | 0 .../bsd/apple/constant.MADV_CAN_REUSE.html | 0 .../bsd/apple/constant.MADV_DONTNEED.html | 0 doc/libc/bsd/apple/constant.MADV_FREE.html | 0 .../apple/constant.MADV_FREE_REUSABLE.html | 0 .../bsd/apple/constant.MADV_FREE_REUSE.html | 0 doc/libc/bsd/apple/constant.MADV_NORMAL.html | 0 doc/libc/bsd/apple/constant.MADV_RANDOM.html | 0 .../bsd/apple/constant.MADV_SEQUENTIAL.html | 0 .../bsd/apple/constant.MADV_WILLNEED.html | 0 .../apple/constant.MADV_ZERO_WIRED_PAGES.html | 0 doc/libc/bsd/apple/constant.MAP_ANON.html | 0 doc/libc/bsd/apple/constant.MAP_COPY.html | 0 doc/libc/bsd/apple/constant.MAP_FAILED.html | 0 doc/libc/bsd/apple/constant.MAP_FILE.html | 0 doc/libc/bsd/apple/constant.MAP_FIXED.html | 0 .../bsd/apple/constant.MAP_HASSEMAPHORE.html | 0 doc/libc/bsd/apple/constant.MAP_JIT.html | 0 doc/libc/bsd/apple/constant.MAP_NOCACHE.html | 0 doc/libc/bsd/apple/constant.MAP_NOEXTEND.html | 0 .../bsd/apple/constant.MAP_NORESERVE.html | 0 doc/libc/bsd/apple/constant.MAP_PRIVATE.html | 0 doc/libc/bsd/apple/constant.MAP_RENAME.html | 0 doc/libc/bsd/apple/constant.MAP_SHARED.html | 0 doc/libc/bsd/apple/constant.MCL_CURRENT.html | 0 doc/libc/bsd/apple/constant.MCL_FUTURE.html | 0 .../bsd/apple/constant.MINCORE_INCORE.html | 0 .../bsd/apple/constant.MINCORE_MODIFIED.html | 0 .../constant.MINCORE_MODIFIED_OTHER.html | 0 .../apple/constant.MINCORE_REFERENCED.html | 0 .../constant.MINCORE_REFERENCED_OTHER.html | 0 doc/libc/bsd/apple/constant.MON_1.html | 0 doc/libc/bsd/apple/constant.MON_10.html | 0 doc/libc/bsd/apple/constant.MON_11.html | 0 doc/libc/bsd/apple/constant.MON_12.html | 0 doc/libc/bsd/apple/constant.MON_2.html | 0 doc/libc/bsd/apple/constant.MON_3.html | 0 doc/libc/bsd/apple/constant.MON_4.html | 0 doc/libc/bsd/apple/constant.MON_5.html | 0 doc/libc/bsd/apple/constant.MON_6.html | 0 doc/libc/bsd/apple/constant.MON_7.html | 0 doc/libc/bsd/apple/constant.MON_8.html | 0 doc/libc/bsd/apple/constant.MON_9.html | 0 doc/libc/bsd/apple/constant.MS_ASYNC.html | 0 .../bsd/apple/constant.MS_DEACTIVATE.html | 0 .../bsd/apple/constant.MS_INVALIDATE.html | 0 doc/libc/bsd/apple/constant.MS_KILLPAGES.html | 0 doc/libc/bsd/apple/constant.MS_SYNC.html | 0 doc/libc/bsd/apple/constant.NI_MAXHOST.html | 0 doc/libc/bsd/apple/constant.NL0.html | 0 doc/libc/bsd/apple/constant.NL1.html | 0 doc/libc/bsd/apple/constant.NOEXPR.html | 0 doc/libc/bsd/apple/constant.NOSTR.html | 0 .../bsd/apple/constant.NOTE_ABSOLUTE.html | 0 .../bsd/apple/constant.NOTE_EXITSTATUS.html | 0 .../apple/constant.NOTE_EXIT_REPARENTED.html | 0 doc/libc/bsd/apple/constant.NOTE_FFAND.html | 0 doc/libc/bsd/apple/constant.NOTE_FFCOPY.html | 0 .../bsd/apple/constant.NOTE_FFCTRLMASK.html | 0 .../bsd/apple/constant.NOTE_FFLAGSMASK.html | 0 doc/libc/bsd/apple/constant.NOTE_FFNOP.html | 0 doc/libc/bsd/apple/constant.NOTE_FFOR.html | 0 doc/libc/bsd/apple/constant.NOTE_NONE.html | 0 .../bsd/apple/constant.NOTE_NSECONDS.html | 0 .../bsd/apple/constant.NOTE_PCTRLMASK.html | 0 doc/libc/bsd/apple/constant.NOTE_REAP.html | 0 doc/libc/bsd/apple/constant.NOTE_SECONDS.html | 0 doc/libc/bsd/apple/constant.NOTE_SIGNAL.html | 0 doc/libc/bsd/apple/constant.NOTE_TRIGGER.html | 0 .../bsd/apple/constant.NOTE_USECONDS.html | 0 .../bsd/apple/constant.NOTE_VM_ERROR.html | 0 .../bsd/apple/constant.NOTE_VM_PRESSURE.html | 0 ...ant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html | 0 .../constant.NOTE_VM_PRESSURE_TERMINATE.html | 0 doc/libc/bsd/apple/constant.O_ACCMODE.html | 0 doc/libc/bsd/apple/constant.O_APPEND.html | 0 doc/libc/bsd/apple/constant.O_CLOEXEC.html | 0 doc/libc/bsd/apple/constant.O_CREAT.html | 0 doc/libc/bsd/apple/constant.O_DIRECTORY.html | 0 doc/libc/bsd/apple/constant.O_DSYNC.html | 0 doc/libc/bsd/apple/constant.O_EXCL.html | 0 doc/libc/bsd/apple/constant.O_NOCTTY.html | 0 doc/libc/bsd/apple/constant.O_NONBLOCK.html | 0 doc/libc/bsd/apple/constant.O_RDONLY.html | 0 doc/libc/bsd/apple/constant.O_RDWR.html | 0 doc/libc/bsd/apple/constant.O_SYNC.html | 0 doc/libc/bsd/apple/constant.O_TRUNC.html | 0 doc/libc/bsd/apple/constant.O_WRONLY.html | 0 doc/libc/bsd/apple/constant.PM_STR.html | 0 .../apple/constant.POSIX_MADV_DONTNEED.html | 0 .../bsd/apple/constant.POSIX_MADV_NORMAL.html | 0 .../bsd/apple/constant.POSIX_MADV_RANDOM.html | 0 .../apple/constant.POSIX_MADV_SEQUENTIAL.html | 0 .../apple/constant.POSIX_MADV_WILLNEED.html | 0 doc/libc/bsd/apple/constant.PROT_EXEC.html | 0 doc/libc/bsd/apple/constant.PROT_NONE.html | 0 doc/libc/bsd/apple/constant.PROT_READ.html | 0 doc/libc/bsd/apple/constant.PROT_WRITE.html | 0 .../constant.PTHREAD_COND_INITIALIZER.html | 0 .../constant.PTHREAD_CREATE_DETACHED.html | 0 .../constant.PTHREAD_CREATE_JOINABLE.html | 0 .../constant.PTHREAD_MUTEX_INITIALIZER.html | 0 .../constant.PTHREAD_MUTEX_RECURSIVE.html | 0 .../constant.PTHREAD_RWLOCK_INITIALIZER.html | 0 .../bsd/apple/constant.PTHREAD_STACK_MIN.html | 0 doc/libc/bsd/apple/constant.Q_GETQUOTA.html | 0 doc/libc/bsd/apple/constant.Q_SETQUOTA.html | 0 doc/libc/bsd/apple/constant.RADIXCHAR.html | 0 doc/libc/bsd/apple/constant.RAND_MAX.html | 0 doc/libc/bsd/apple/constant.RLIMIT_AS.html | 0 doc/libc/bsd/apple/constant.RLIMIT_CORE.html | 0 doc/libc/bsd/apple/constant.RLIMIT_CPU.html | 0 doc/libc/bsd/apple/constant.RLIMIT_DATA.html | 0 doc/libc/bsd/apple/constant.RLIMIT_FSIZE.html | 0 .../bsd/apple/constant.RLIMIT_MEMLOCK.html | 0 .../bsd/apple/constant.RLIMIT_NOFILE.html | 0 doc/libc/bsd/apple/constant.RLIMIT_NPROC.html | 0 doc/libc/bsd/apple/constant.RLIMIT_RSS.html | 0 doc/libc/bsd/apple/constant.RLIMIT_STACK.html | 0 .../bsd/apple/constant.RLIM_INFINITY.html | 0 doc/libc/bsd/apple/constant.RLIM_NLIMITS.html | 0 doc/libc/bsd/apple/constant.RTLD_FIRST.html | 0 doc/libc/bsd/apple/constant.RTLD_GLOBAL.html | 0 doc/libc/bsd/apple/constant.RTLD_LOCAL.html | 0 .../bsd/apple/constant.RTLD_NODELETE.html | 0 doc/libc/bsd/apple/constant.RTLD_NOLOAD.html | 0 .../bsd/apple/constant.RUSAGE_CHILDREN.html | 0 doc/libc/bsd/apple/constant.RUSAGE_SELF.html | 0 doc/libc/bsd/apple/constant.R_OK.html | 0 doc/libc/bsd/apple/constant.SEEK_CUR.html | 0 doc/libc/bsd/apple/constant.SEEK_END.html | 0 doc/libc/bsd/apple/constant.SEEK_SET.html | 0 doc/libc/bsd/apple/constant.SHUT_RD.html | 0 doc/libc/bsd/apple/constant.SHUT_RDWR.html | 0 doc/libc/bsd/apple/constant.SHUT_WR.html | 0 doc/libc/bsd/apple/constant.SIGABRT.html | 0 doc/libc/bsd/apple/constant.SIGALRM.html | 0 doc/libc/bsd/apple/constant.SIGEMT.html | 0 doc/libc/bsd/apple/constant.SIGFPE.html | 0 doc/libc/bsd/apple/constant.SIGHUP.html | 0 doc/libc/bsd/apple/constant.SIGILL.html | 0 doc/libc/bsd/apple/constant.SIGINT.html | 0 doc/libc/bsd/apple/constant.SIGKILL.html | 0 doc/libc/bsd/apple/constant.SIGPIPE.html | 0 doc/libc/bsd/apple/constant.SIGQUIT.html | 0 doc/libc/bsd/apple/constant.SIGSEGV.html | 0 doc/libc/bsd/apple/constant.SIGSTKSZ.html | 0 doc/libc/bsd/apple/constant.SIGTERM.html | 0 doc/libc/bsd/apple/constant.SIGTRAP.html | 0 doc/libc/bsd/apple/constant.SOCK_DGRAM.html | 0 doc/libc/bsd/apple/constant.SOCK_RAW.html | 0 doc/libc/bsd/apple/constant.SOCK_STREAM.html | 0 doc/libc/bsd/apple/constant.SOL_SOCKET.html | 0 .../bsd/apple/constant.SO_ACCEPTCONN.html | 0 doc/libc/bsd/apple/constant.SO_BROADCAST.html | 0 doc/libc/bsd/apple/constant.SO_DEBUG.html | 0 doc/libc/bsd/apple/constant.SO_DONTROUTE.html | 0 doc/libc/bsd/apple/constant.SO_DONTTRUNC.html | 0 doc/libc/bsd/apple/constant.SO_ERROR.html | 0 doc/libc/bsd/apple/constant.SO_KEEPALIVE.html | 0 doc/libc/bsd/apple/constant.SO_LINGER.html | 0 doc/libc/bsd/apple/constant.SO_NKE.html | 0 doc/libc/bsd/apple/constant.SO_NOADDRERR.html | 0 doc/libc/bsd/apple/constant.SO_NOSIGPIPE.html | 0 doc/libc/bsd/apple/constant.SO_NREAD.html | 0 doc/libc/bsd/apple/constant.SO_NWRITE.html | 0 doc/libc/bsd/apple/constant.SO_OOBINLINE.html | 0 doc/libc/bsd/apple/constant.SO_RCVBUF.html | 0 doc/libc/bsd/apple/constant.SO_RCVLOWAT.html | 0 doc/libc/bsd/apple/constant.SO_RCVTIMEO.html | 0 doc/libc/bsd/apple/constant.SO_REUSEADDR.html | 0 doc/libc/bsd/apple/constant.SO_REUSEPORT.html | 0 doc/libc/bsd/apple/constant.SO_SNDBUF.html | 0 doc/libc/bsd/apple/constant.SO_SNDLOWAT.html | 0 doc/libc/bsd/apple/constant.SO_SNDTIMEO.html | 0 doc/libc/bsd/apple/constant.SO_TYPE.html | 0 .../bsd/apple/constant.SO_USELOOPBACK.html | 0 doc/libc/bsd/apple/constant.SO_WANTMORE.html | 0 .../bsd/apple/constant.SO_WANTOOBFLAG.html | 0 .../bsd/apple/constant.STDERR_FILENO.html | 0 doc/libc/bsd/apple/constant.STDIN_FILENO.html | 0 .../bsd/apple/constant.STDOUT_FILENO.html | 0 doc/libc/bsd/apple/constant.ST_NOSUID.html | 0 doc/libc/bsd/apple/constant.S_IEXEC.html | 0 doc/libc/bsd/apple/constant.S_IFBLK.html | 0 doc/libc/bsd/apple/constant.S_IFCHR.html | 0 doc/libc/bsd/apple/constant.S_IFDIR.html | 0 doc/libc/bsd/apple/constant.S_IFIFO.html | 0 doc/libc/bsd/apple/constant.S_IFLNK.html | 0 doc/libc/bsd/apple/constant.S_IFMT.html | 0 doc/libc/bsd/apple/constant.S_IFREG.html | 0 doc/libc/bsd/apple/constant.S_IFSOCK.html | 0 doc/libc/bsd/apple/constant.S_IREAD.html | 0 doc/libc/bsd/apple/constant.S_IRGRP.html | 0 doc/libc/bsd/apple/constant.S_IROTH.html | 0 doc/libc/bsd/apple/constant.S_IRUSR.html | 0 doc/libc/bsd/apple/constant.S_IRWXG.html | 0 doc/libc/bsd/apple/constant.S_IRWXO.html | 0 doc/libc/bsd/apple/constant.S_IRWXU.html | 0 doc/libc/bsd/apple/constant.S_IWGRP.html | 0 doc/libc/bsd/apple/constant.S_IWOTH.html | 0 doc/libc/bsd/apple/constant.S_IWRITE.html | 0 doc/libc/bsd/apple/constant.S_IWUSR.html | 0 doc/libc/bsd/apple/constant.S_IXGRP.html | 0 doc/libc/bsd/apple/constant.S_IXOTH.html | 0 doc/libc/bsd/apple/constant.S_IXUSR.html | 0 doc/libc/bsd/apple/constant.TAB0.html | 0 doc/libc/bsd/apple/constant.TAB1.html | 0 doc/libc/bsd/apple/constant.TAB2.html | 0 doc/libc/bsd/apple/constant.TAB3.html | 0 .../bsd/apple/constant.TCP_KEEPALIVE.html | 0 doc/libc/bsd/apple/constant.TCP_NODELAY.html | 0 doc/libc/bsd/apple/constant.THOUSEP.html | 0 doc/libc/bsd/apple/constant.TIOCCBRK.html | 0 doc/libc/bsd/apple/constant.TIOCCDTR.html | 0 doc/libc/bsd/apple/constant.TIOCCONS.html | 0 .../bsd/apple/constant.TIOCDCDTIMESTAMP.html | 0 doc/libc/bsd/apple/constant.TIOCDRAIN.html | 0 .../bsd/apple/constant.TIOCDSIMICROCODE.html | 0 doc/libc/bsd/apple/constant.TIOCEXCL.html | 0 doc/libc/bsd/apple/constant.TIOCEXT.html | 0 doc/libc/bsd/apple/constant.TIOCFLUSH.html | 0 .../bsd/apple/constant.TIOCGDRAINWAIT.html | 0 doc/libc/bsd/apple/constant.TIOCGETD.html | 0 doc/libc/bsd/apple/constant.TIOCGPGRP.html | 0 doc/libc/bsd/apple/constant.TIOCGWINSZ.html | 0 doc/libc/bsd/apple/constant.TIOCIXOFF.html | 0 doc/libc/bsd/apple/constant.TIOCIXON.html | 0 doc/libc/bsd/apple/constant.TIOCMBIC.html | 0 doc/libc/bsd/apple/constant.TIOCMBIS.html | 0 .../bsd/apple/constant.TIOCMGDTRWAIT.html | 0 doc/libc/bsd/apple/constant.TIOCMGET.html | 0 doc/libc/bsd/apple/constant.TIOCMODG.html | 0 doc/libc/bsd/apple/constant.TIOCMODS.html | 0 .../bsd/apple/constant.TIOCMSDTRWAIT.html | 0 doc/libc/bsd/apple/constant.TIOCMSET.html | 0 doc/libc/bsd/apple/constant.TIOCM_CAR.html | 0 doc/libc/bsd/apple/constant.TIOCM_CD.html | 0 doc/libc/bsd/apple/constant.TIOCM_CTS.html | 0 doc/libc/bsd/apple/constant.TIOCM_DSR.html | 0 doc/libc/bsd/apple/constant.TIOCM_DTR.html | 0 doc/libc/bsd/apple/constant.TIOCM_LE.html | 0 doc/libc/bsd/apple/constant.TIOCM_RI.html | 0 doc/libc/bsd/apple/constant.TIOCM_RNG.html | 0 doc/libc/bsd/apple/constant.TIOCM_RTS.html | 0 doc/libc/bsd/apple/constant.TIOCM_SR.html | 0 doc/libc/bsd/apple/constant.TIOCM_ST.html | 0 doc/libc/bsd/apple/constant.TIOCNOTTY.html | 0 doc/libc/bsd/apple/constant.TIOCNXCL.html | 0 doc/libc/bsd/apple/constant.TIOCOUTQ.html | 0 doc/libc/bsd/apple/constant.TIOCPKT.html | 0 doc/libc/bsd/apple/constant.TIOCPKT_DATA.html | 0 .../bsd/apple/constant.TIOCPKT_DOSTOP.html | 0 .../bsd/apple/constant.TIOCPKT_FLUSHREAD.html | 0 .../apple/constant.TIOCPKT_FLUSHWRITE.html | 0 .../bsd/apple/constant.TIOCPKT_IOCTL.html | 0 .../bsd/apple/constant.TIOCPKT_NOSTOP.html | 0 .../bsd/apple/constant.TIOCPKT_START.html | 0 doc/libc/bsd/apple/constant.TIOCPKT_STOP.html | 0 doc/libc/bsd/apple/constant.TIOCPTYGNAME.html | 0 doc/libc/bsd/apple/constant.TIOCPTYGRANT.html | 0 doc/libc/bsd/apple/constant.TIOCPTYUNLK.html | 0 doc/libc/bsd/apple/constant.TIOCREMOTE.html | 0 doc/libc/bsd/apple/constant.TIOCSBRK.html | 0 doc/libc/bsd/apple/constant.TIOCSCONS.html | 0 doc/libc/bsd/apple/constant.TIOCSCTTY.html | 0 .../bsd/apple/constant.TIOCSDRAINWAIT.html | 0 doc/libc/bsd/apple/constant.TIOCSDTR.html | 0 doc/libc/bsd/apple/constant.TIOCSETD.html | 0 doc/libc/bsd/apple/constant.TIOCSIG.html | 0 doc/libc/bsd/apple/constant.TIOCSPGRP.html | 0 doc/libc/bsd/apple/constant.TIOCSTART.html | 0 doc/libc/bsd/apple/constant.TIOCSTAT.html | 0 doc/libc/bsd/apple/constant.TIOCSTI.html | 0 doc/libc/bsd/apple/constant.TIOCSTOP.html | 0 doc/libc/bsd/apple/constant.TIOCSWINSZ.html | 0 .../bsd/apple/constant.TIOCTIMESTAMP.html | 0 doc/libc/bsd/apple/constant.TIOCUCNTL.html | 0 doc/libc/bsd/apple/constant.TMP_MAX.html | 0 doc/libc/bsd/apple/constant.T_FMT.html | 0 doc/libc/bsd/apple/constant.T_FMT_AMPM.html | 0 doc/libc/bsd/apple/constant.VT0.html | 0 doc/libc/bsd/apple/constant.VT1.html | 0 doc/libc/bsd/apple/constant.W_OK.html | 0 doc/libc/bsd/apple/constant.X_OK.html | 0 doc/libc/bsd/apple/constant.YESEXPR.html | 0 doc/libc/bsd/apple/constant.YESSTR.html | 0 doc/libc/bsd/apple/constant._IOFBF.html | 0 doc/libc/bsd/apple/constant._IOLBF.html | 0 doc/libc/bsd/apple/constant._IONBF.html | 0 doc/libc/bsd/apple/constant._PC_NAME_MAX.html | 0 .../constant._PTHREAD_COND_SIG_init.html | 0 .../constant._PTHREAD_MUTEX_SIG_init.html | 0 .../constant._PTHREAD_RWLOCK_SIG_init.html | 0 .../apple/constant._RLIMIT_POSIX_FLAG.html | 0 .../bsd/apple/constant._SC_2_CHAR_TERM.html | 0 doc/libc/bsd/apple/constant._SC_2_C_BIND.html | 0 doc/libc/bsd/apple/constant._SC_2_C_DEV.html | 0 .../bsd/apple/constant._SC_2_FORT_DEV.html | 0 .../bsd/apple/constant._SC_2_FORT_RUN.html | 0 .../bsd/apple/constant._SC_2_LOCALEDEF.html | 0 doc/libc/bsd/apple/constant._SC_2_PBS.html | 0 .../apple/constant._SC_2_PBS_ACCOUNTING.html | 0 .../apple/constant._SC_2_PBS_CHECKPOINT.html | 0 .../bsd/apple/constant._SC_2_PBS_LOCATE.html | 0 .../bsd/apple/constant._SC_2_PBS_MESSAGE.html | 0 .../bsd/apple/constant._SC_2_PBS_TRACK.html | 0 doc/libc/bsd/apple/constant._SC_2_SW_DEV.html | 0 doc/libc/bsd/apple/constant._SC_2_UPE.html | 0 .../bsd/apple/constant._SC_2_VERSION.html | 0 .../bsd/apple/constant._SC_ADVISORY_INFO.html | 0 .../apple/constant._SC_AIO_LISTIO_MAX.html | 0 doc/libc/bsd/apple/constant._SC_AIO_MAX.html | 0 .../constant._SC_AIO_PRIO_DELTA_MAX.html | 0 doc/libc/bsd/apple/constant._SC_ARG_MAX.html | 0 .../apple/constant._SC_ASYNCHRONOUS_IO.html | 0 .../bsd/apple/constant._SC_ATEXIT_MAX.html | 0 doc/libc/bsd/apple/constant._SC_BARRIERS.html | 0 .../bsd/apple/constant._SC_BC_BASE_MAX.html | 0 .../bsd/apple/constant._SC_BC_DIM_MAX.html | 0 .../bsd/apple/constant._SC_BC_SCALE_MAX.html | 0 .../bsd/apple/constant._SC_BC_STRING_MAX.html | 0 .../bsd/apple/constant._SC_CHILD_MAX.html | 0 doc/libc/bsd/apple/constant._SC_CLK_TCK.html | 0 .../apple/constant._SC_CLOCK_SELECTION.html | 0 .../apple/constant._SC_COLL_WEIGHTS_MAX.html | 0 doc/libc/bsd/apple/constant._SC_CPUTIME.html | 0 .../apple/constant._SC_DELAYTIMER_MAX.html | 0 .../bsd/apple/constant._SC_EXPR_NEST_MAX.html | 0 .../bsd/apple/constant._SC_FILE_LOCKING.html | 0 doc/libc/bsd/apple/constant._SC_FSYNC.html | 0 .../apple/constant._SC_GETGR_R_SIZE_MAX.html | 0 .../apple/constant._SC_GETPW_R_SIZE_MAX.html | 0 .../bsd/apple/constant._SC_HOST_NAME_MAX.html | 0 doc/libc/bsd/apple/constant._SC_IOV_MAX.html | 0 doc/libc/bsd/apple/constant._SC_IPV6.html | 0 .../bsd/apple/constant._SC_JOB_CONTROL.html | 0 doc/libc/bsd/apple/constant._SC_LINE_MAX.html | 0 .../apple/constant._SC_LOGIN_NAME_MAX.html | 0 .../bsd/apple/constant._SC_MAPPED_FILES.html | 0 doc/libc/bsd/apple/constant._SC_MEMLOCK.html | 0 .../bsd/apple/constant._SC_MEMLOCK_RANGE.html | 0 .../apple/constant._SC_MEMORY_PROTECTION.html | 0 .../apple/constant._SC_MESSAGE_PASSING.html | 0 .../apple/constant._SC_MONOTONIC_CLOCK.html | 0 .../bsd/apple/constant._SC_MQ_OPEN_MAX.html | 0 .../bsd/apple/constant._SC_MQ_PRIO_MAX.html | 0 .../bsd/apple/constant._SC_NGROUPS_MAX.html | 0 .../apple/constant._SC_NPROCESSORS_CONF.html | 0 .../apple/constant._SC_NPROCESSORS_ONLN.html | 0 doc/libc/bsd/apple/constant._SC_OPEN_MAX.html | 0 doc/libc/bsd/apple/constant._SC_PAGESIZE.html | 0 .../bsd/apple/constant._SC_PAGE_SIZE.html | 0 doc/libc/bsd/apple/constant._SC_PASS_MAX.html | 0 .../apple/constant._SC_PRIORITIZED_IO.html | 0 .../constant._SC_PRIORITY_SCHEDULING.html | 0 .../bsd/apple/constant._SC_RAW_SOCKETS.html | 0 .../constant._SC_READER_WRITER_LOCKS.html | 0 .../apple/constant._SC_REALTIME_SIGNALS.html | 0 doc/libc/bsd/apple/constant._SC_REGEXP.html | 0 .../bsd/apple/constant._SC_RE_DUP_MAX.html | 0 .../bsd/apple/constant._SC_RTSIG_MAX.html | 0 .../bsd/apple/constant._SC_SAVED_IDS.html | 0 .../bsd/apple/constant._SC_SEMAPHORES.html | 0 .../bsd/apple/constant._SC_SEM_NSEMS_MAX.html | 0 .../bsd/apple/constant._SC_SEM_VALUE_MAX.html | 0 .../constant._SC_SHARED_MEMORY_OBJECTS.html | 0 doc/libc/bsd/apple/constant._SC_SHELL.html | 0 .../bsd/apple/constant._SC_SIGQUEUE_MAX.html | 0 doc/libc/bsd/apple/constant._SC_SPAWN.html | 0 .../bsd/apple/constant._SC_SPIN_LOCKS.html | 0 .../apple/constant._SC_SPORADIC_SERVER.html | 0 .../bsd/apple/constant._SC_SS_REPL_MAX.html | 0 .../bsd/apple/constant._SC_STREAM_MAX.html | 0 .../bsd/apple/constant._SC_SYMLOOP_MAX.html | 0 .../apple/constant._SC_SYNCHRONIZED_IO.html | 0 doc/libc/bsd/apple/constant._SC_THREADS.html | 0 .../constant._SC_THREAD_ATTR_STACKADDR.html | 0 .../constant._SC_THREAD_ATTR_STACKSIZE.html | 0 .../apple/constant._SC_THREAD_CPUTIME.html | 0 ...tant._SC_THREAD_DESTRUCTOR_ITERATIONS.html | 0 .../apple/constant._SC_THREAD_KEYS_MAX.html | 0 ...nstant._SC_THREAD_PRIORITY_SCHEDULING.html | 0 .../constant._SC_THREAD_PRIO_INHERIT.html | 0 .../constant._SC_THREAD_PRIO_PROTECT.html | 0 .../constant._SC_THREAD_PROCESS_SHARED.html | 0 .../constant._SC_THREAD_SAFE_FUNCTIONS.html | 0 .../constant._SC_THREAD_SPORADIC_SERVER.html | 0 .../apple/constant._SC_THREAD_STACK_MIN.html | 0 .../constant._SC_THREAD_THREADS_MAX.html | 0 doc/libc/bsd/apple/constant._SC_TIMEOUTS.html | 0 doc/libc/bsd/apple/constant._SC_TIMERS.html | 0 .../bsd/apple/constant._SC_TIMER_MAX.html | 0 doc/libc/bsd/apple/constant._SC_TRACE.html | 0 .../constant._SC_TRACE_EVENT_FILTER.html | 0 .../constant._SC_TRACE_EVENT_NAME_MAX.html | 0 .../bsd/apple/constant._SC_TRACE_INHERIT.html | 0 .../bsd/apple/constant._SC_TRACE_LOG.html | 0 .../apple/constant._SC_TRACE_NAME_MAX.html | 0 .../bsd/apple/constant._SC_TRACE_SYS_MAX.html | 0 .../constant._SC_TRACE_USER_EVENT_MAX.html | 0 .../bsd/apple/constant._SC_TTY_NAME_MAX.html | 0 .../constant._SC_TYPED_MEMORY_OBJECTS.html | 0 .../bsd/apple/constant._SC_TZNAME_MAX.html | 0 .../apple/constant._SC_V6_ILP32_OFF32.html | 0 .../apple/constant._SC_V6_ILP32_OFFBIG.html | 0 .../bsd/apple/constant._SC_V6_LP64_OFF64.html | 0 .../apple/constant._SC_V6_LPBIG_OFFBIG.html | 0 doc/libc/bsd/apple/constant._SC_VERSION.html | 0 .../apple/constant._SC_XBS5_ILP32_OFF32.html | 0 .../apple/constant._SC_XBS5_ILP32_OFFBIG.html | 0 .../apple/constant._SC_XBS5_LP64_OFF64.html | 0 .../apple/constant._SC_XBS5_LPBIG_OFFBIG.html | 0 .../bsd/apple/constant._SC_XOPEN_CRYPT.html | 0 .../apple/constant._SC_XOPEN_ENH_I18N.html | 0 .../bsd/apple/constant._SC_XOPEN_LEGACY.html | 0 .../apple/constant._SC_XOPEN_REALTIME.html | 0 .../constant._SC_XOPEN_REALTIME_THREADS.html | 0 .../bsd/apple/constant._SC_XOPEN_SHM.html | 0 .../bsd/apple/constant._SC_XOPEN_STREAMS.html | 0 .../bsd/apple/constant._SC_XOPEN_UNIX.html | 0 .../bsd/apple/constant._SC_XOPEN_VERSION.html | 0 .../apple/constant._SC_XOPEN_XCU_VERSION.html | 0 doc/libc/bsd/apple/constant._WSTOPPED.html | 0 .../apple/constant.__PTHREAD_COND_SIZE__.html | 0 .../constant.__PTHREAD_MUTEX_SIZE__.html | 0 .../constant.__PTHREAD_RWLOCK_SIZE__.html | 0 doc/libc/bsd/apple/enum.timezone.html | 10 - doc/libc/bsd/apple/fn.WIFCONTINUED.html | 10 - doc/libc/bsd/apple/fn.WIFSIGNALED.html | 10 - doc/libc/bsd/apple/fn.WIFSTOPPED.html | 10 - doc/libc/bsd/apple/fn.WSTOPSIG.html | 10 - doc/libc/bsd/apple/fn._WSTATUS.html | 10 - doc/libc/bsd/apple/fn.__error.html | 10 - doc/libc/bsd/apple/fn.backtrace.html | 10 - doc/libc/bsd/apple/fn.duplocale.html | 10 - doc/libc/bsd/apple/fn.forkpty.html | 10 - doc/libc/bsd/apple/fn.freelocale.html | 10 - doc/libc/bsd/apple/fn.fstatfs.html | 10 - doc/libc/bsd/apple/fn.getnameinfo.html | 10 - doc/libc/bsd/apple/fn.kevent.html | 10 - doc/libc/bsd/apple/fn.kevent64.html | 10 - doc/libc/bsd/apple/fn.localeconv_l.html | 10 - doc/libc/bsd/apple/fn.mach_absolute_time.html | 10 - doc/libc/bsd/apple/fn.mach_timebase_info.html | 10 - doc/libc/bsd/apple/fn.mincore.html | 10 - doc/libc/bsd/apple/fn.mount.html | 10 - doc/libc/bsd/apple/fn.mprotect.html | 10 - doc/libc/bsd/apple/fn.newlocale.html | 10 - doc/libc/bsd/apple/fn.openpty.html | 10 - .../apple/fn.pthread_get_stackaddr_np.html | 10 - .../apple/fn.pthread_get_stacksize_np.html | 10 - doc/libc/bsd/apple/fn.pthread_setname_np.html | 10 - doc/libc/bsd/apple/fn.ptrace.html | 10 - doc/libc/bsd/apple/fn.querylocale.html | 10 - doc/libc/bsd/apple/fn.quotactl.html | 10 - doc/libc/bsd/apple/fn.sendfile.html | 10 - doc/libc/bsd/apple/fn.sethostname.html | 10 - doc/libc/bsd/apple/fn.shm_open.html | 10 - doc/libc/bsd/apple/fn.statfs.html | 10 - doc/libc/bsd/apple/fn.sysctl.html | 10 - doc/libc/bsd/apple/fn.sysctlbyname.html | 10 - doc/libc/bsd/apple/fn.sysctlnametomib.html | 10 - doc/libc/bsd/apple/fn.uselocale.html | 10 - doc/libc/bsd/apple/index.html | 0 doc/libc/bsd/apple/sidebar-items.js | 1 - doc/libc/bsd/apple/struct.Dl_info.html | 10 - doc/libc/bsd/apple/struct.addrinfo.html | 10 - doc/libc/bsd/apple/struct.dirent.html | 10 - doc/libc/bsd/apple/struct.dqblk.html | 10 - doc/libc/bsd/apple/struct.flock.html | 10 - doc/libc/bsd/apple/struct.fstore_t.html | 10 - doc/libc/bsd/apple/struct.glob_t.html | 10 - doc/libc/bsd/apple/struct.kevent.html | 10 - doc/libc/bsd/apple/struct.kevent64_s.html | 10 - doc/libc/bsd/apple/struct.lconv.html | 10 - .../bsd/apple/struct.mach_timebase_info.html | 10 - doc/libc/bsd/apple/struct.pthread_attr_t.html | 10 - doc/libc/bsd/apple/struct.pthread_cond_t.html | 10 - .../bsd/apple/struct.pthread_mutex_t.html | 10 - .../bsd/apple/struct.pthread_mutexattr_t.html | 10 - .../bsd/apple/struct.pthread_rwlock_t.html | 10 - doc/libc/bsd/apple/struct.radvisory.html | 10 - doc/libc/bsd/apple/struct.sf_hdtr.html | 10 - doc/libc/bsd/apple/struct.sigaction.html | 10 - doc/libc/bsd/apple/struct.siginfo_t.html | 10 - doc/libc/bsd/apple/struct.sockaddr_in.html | 10 - .../bsd/apple/struct.sockaddr_storage.html | 10 - doc/libc/bsd/apple/struct.stack_t.html | 10 - doc/libc/bsd/apple/struct.stat.html | 10 - doc/libc/bsd/apple/struct.statfs.html | 10 - doc/libc/bsd/apple/struct.statvfs.html | 10 - doc/libc/bsd/apple/struct.termios.html | 10 - doc/libc/bsd/apple/type.blksize_t.html | 10 - doc/libc/bsd/apple/type.c_long.html | 10 - doc/libc/bsd/apple/type.c_ulong.html | 10 - doc/libc/bsd/apple/type.clock_t.html | 10 - doc/libc/bsd/apple/type.dev_t.html | 10 - doc/libc/bsd/apple/type.fsblkcnt_t.html | 10 - doc/libc/bsd/apple/type.fsfilcnt_t.html | 10 - doc/libc/bsd/apple/type.ino_t.html | 10 - .../apple/type.mach_timebase_info_data_t.html | 10 - doc/libc/bsd/apple/type.mode_t.html | 10 - doc/libc/bsd/apple/type.nl_item.html | 10 - doc/libc/bsd/apple/type.nlink_t.html | 10 - doc/libc/bsd/apple/type.pthread_key_t.html | 10 - doc/libc/bsd/apple/type.rlim_t.html | 10 - doc/libc/bsd/apple/type.sigset_t.html | 10 - doc/libc/bsd/apple/type.speed_t.html | 10 - doc/libc/bsd/apple/type.suseconds_t.html | 10 - doc/libc/bsd/apple/type.tcflag_t.html | 10 - doc/libc/bsd/apple/type.time_t.html | 10 - .../bsd/b64/constant.TIOCDCDTIMESTAMP.html | 0 doc/libc/bsd/b64/constant.TIOCTIMESTAMP.html | 0 .../b64/constant.__PTHREAD_COND_SIZE__.html | 0 .../b64/constant.__PTHREAD_MUTEX_SIZE__.html | 0 .../b64/constant.__PTHREAD_RWLOCK_SIZE__.html | 0 doc/libc/bsd/b64/index.html | 0 doc/libc/bsd/b64/sidebar-items.js | 1 - doc/libc/bsd/b64/struct.pthread_attr_t.html | 10 - doc/libc/bsd/b64/type.c_long.html | 10 - doc/libc/bsd/b64/type.c_ulong.html | 10 - doc/libc/bsd/constant.ABDAY_1.html | 0 doc/libc/bsd/constant.ABDAY_2.html | 0 doc/libc/bsd/constant.ABDAY_3.html | 0 doc/libc/bsd/constant.ABDAY_4.html | 0 doc/libc/bsd/constant.ABDAY_5.html | 0 doc/libc/bsd/constant.ABDAY_6.html | 0 doc/libc/bsd/constant.ABDAY_7.html | 0 doc/libc/bsd/constant.ABMON_1.html | 0 doc/libc/bsd/constant.ABMON_10.html | 0 doc/libc/bsd/constant.ABMON_11.html | 0 doc/libc/bsd/constant.ABMON_12.html | 0 doc/libc/bsd/constant.ABMON_2.html | 0 doc/libc/bsd/constant.ABMON_3.html | 0 doc/libc/bsd/constant.ABMON_4.html | 0 doc/libc/bsd/constant.ABMON_5.html | 0 doc/libc/bsd/constant.ABMON_6.html | 0 doc/libc/bsd/constant.ABMON_7.html | 0 doc/libc/bsd/constant.ABMON_8.html | 0 doc/libc/bsd/constant.ABMON_9.html | 0 doc/libc/bsd/constant.AF_INET.html | 0 doc/libc/bsd/constant.AF_INET6.html | 0 doc/libc/bsd/constant.AF_UNIX.html | 0 doc/libc/bsd/constant.ALT_DIGITS.html | 0 doc/libc/bsd/constant.AM_STR.html | 0 doc/libc/bsd/constant.BRKINT.html | 0 doc/libc/bsd/constant.BS0.html | 0 doc/libc/bsd/constant.BS1.html | 0 doc/libc/bsd/constant.BUFSIZ.html | 0 doc/libc/bsd/constant.CLOCAL.html | 0 doc/libc/bsd/constant.CODESET.html | 0 doc/libc/bsd/constant.CR0.html | 0 doc/libc/bsd/constant.CR1.html | 0 doc/libc/bsd/constant.CR2.html | 0 doc/libc/bsd/constant.CR3.html | 0 doc/libc/bsd/constant.CREAD.html | 0 doc/libc/bsd/constant.CRNCYSTR.html | 0 doc/libc/bsd/constant.CRTSCTS.html | 0 doc/libc/bsd/constant.CS5.html | 0 doc/libc/bsd/constant.CS6.html | 0 doc/libc/bsd/constant.CS7.html | 0 doc/libc/bsd/constant.CS8.html | 0 doc/libc/bsd/constant.CSIZE.html | 0 doc/libc/bsd/constant.CSTOPB.html | 0 doc/libc/bsd/constant.CTL_HW.html | 0 doc/libc/bsd/constant.DAY_1.html | 0 doc/libc/bsd/constant.DAY_2.html | 0 doc/libc/bsd/constant.DAY_3.html | 0 doc/libc/bsd/constant.DAY_4.html | 0 doc/libc/bsd/constant.DAY_5.html | 0 doc/libc/bsd/constant.DAY_6.html | 0 doc/libc/bsd/constant.DAY_7.html | 0 doc/libc/bsd/constant.D_FMT.html | 0 doc/libc/bsd/constant.D_MD_ORDER.html | 0 doc/libc/bsd/constant.D_T_FMT.html | 0 doc/libc/bsd/constant.E2BIG.html | 0 doc/libc/bsd/constant.EACCES.html | 0 doc/libc/bsd/constant.EADDRINUSE.html | 0 doc/libc/bsd/constant.EADDRNOTAVAIL.html | 0 doc/libc/bsd/constant.EAFNOSUPPORT.html | 0 doc/libc/bsd/constant.EAGAIN.html | 0 doc/libc/bsd/constant.EALREADY.html | 0 doc/libc/bsd/constant.EAUTH.html | 0 doc/libc/bsd/constant.EBADARCH.html | 0 doc/libc/bsd/constant.EBADEXEC.html | 0 doc/libc/bsd/constant.EBADF.html | 0 doc/libc/bsd/constant.EBADMACHO.html | 0 doc/libc/bsd/constant.EBADMSG.html | 0 doc/libc/bsd/constant.EBADRPC.html | 0 doc/libc/bsd/constant.EBUSY.html | 0 doc/libc/bsd/constant.ECANCELED.html | 0 doc/libc/bsd/constant.ECHILD.html | 0 doc/libc/bsd/constant.ECHO.html | 0 doc/libc/bsd/constant.ECHOCTL.html | 0 doc/libc/bsd/constant.ECHOE.html | 0 doc/libc/bsd/constant.ECHOK.html | 0 doc/libc/bsd/constant.ECHOKE.html | 0 doc/libc/bsd/constant.ECHONL.html | 0 doc/libc/bsd/constant.ECHOPRT.html | 0 doc/libc/bsd/constant.ECONNABORTED.html | 0 doc/libc/bsd/constant.ECONNREFUSED.html | 0 doc/libc/bsd/constant.ECONNRESET.html | 0 doc/libc/bsd/constant.EDEADLK.html | 0 doc/libc/bsd/constant.EDESTADDRREQ.html | 0 doc/libc/bsd/constant.EDEVERR.html | 0 doc/libc/bsd/constant.EDOM.html | 0 doc/libc/bsd/constant.EDQUOT.html | 0 doc/libc/bsd/constant.EEXIST.html | 0 doc/libc/bsd/constant.EFAULT.html | 0 doc/libc/bsd/constant.EFBIG.html | 0 doc/libc/bsd/constant.EFTYPE.html | 0 doc/libc/bsd/constant.EHOSTDOWN.html | 0 doc/libc/bsd/constant.EHOSTUNREACH.html | 0 doc/libc/bsd/constant.EIDRM.html | 0 doc/libc/bsd/constant.EILSEQ.html | 0 doc/libc/bsd/constant.EINPROGRESS.html | 0 doc/libc/bsd/constant.EINTR.html | 0 doc/libc/bsd/constant.EINVAL.html | 0 doc/libc/bsd/constant.EIO.html | 0 doc/libc/bsd/constant.EISCONN.html | 0 doc/libc/bsd/constant.EISDIR.html | 0 doc/libc/bsd/constant.ELAST.html | 0 doc/libc/bsd/constant.ELOOP.html | 0 doc/libc/bsd/constant.EMFILE.html | 0 doc/libc/bsd/constant.EMLINK.html | 0 doc/libc/bsd/constant.EMSGSIZE.html | 0 doc/libc/bsd/constant.EMULTIHOP.html | 0 doc/libc/bsd/constant.ENAMETOOLONG.html | 0 doc/libc/bsd/constant.ENEEDAUTH.html | 0 doc/libc/bsd/constant.ENETDOWN.html | 0 doc/libc/bsd/constant.ENETRESET.html | 0 doc/libc/bsd/constant.ENETUNREACH.html | 0 doc/libc/bsd/constant.ENFILE.html | 0 doc/libc/bsd/constant.ENOATTR.html | 0 doc/libc/bsd/constant.ENOBUFS.html | 0 doc/libc/bsd/constant.ENODATA.html | 0 doc/libc/bsd/constant.ENODEV.html | 0 doc/libc/bsd/constant.ENOENT.html | 0 doc/libc/bsd/constant.ENOEXEC.html | 0 doc/libc/bsd/constant.ENOLCK.html | 0 doc/libc/bsd/constant.ENOLINK.html | 0 doc/libc/bsd/constant.ENOMEM.html | 0 doc/libc/bsd/constant.ENOMSG.html | 0 doc/libc/bsd/constant.ENOPOLICY.html | 0 doc/libc/bsd/constant.ENOPROTOOPT.html | 0 doc/libc/bsd/constant.ENOSPC.html | 0 doc/libc/bsd/constant.ENOSR.html | 0 doc/libc/bsd/constant.ENOSTR.html | 0 doc/libc/bsd/constant.ENOSYS.html | 0 doc/libc/bsd/constant.ENOTBLK.html | 0 doc/libc/bsd/constant.ENOTCONN.html | 0 doc/libc/bsd/constant.ENOTDIR.html | 0 doc/libc/bsd/constant.ENOTEMPTY.html | 0 doc/libc/bsd/constant.ENOTRECOVERABLE.html | 0 doc/libc/bsd/constant.ENOTSOCK.html | 0 doc/libc/bsd/constant.ENOTSUP.html | 0 doc/libc/bsd/constant.ENOTTY.html | 0 doc/libc/bsd/constant.ENXIO.html | 0 doc/libc/bsd/constant.EOF.html | 0 doc/libc/bsd/constant.EOPNOTSUPP.html | 0 doc/libc/bsd/constant.EOVERFLOW.html | 0 doc/libc/bsd/constant.EOWNERDEAD.html | 0 doc/libc/bsd/constant.EPERM.html | 0 doc/libc/bsd/constant.EPFNOSUPPORT.html | 0 doc/libc/bsd/constant.EPIPE.html | 0 doc/libc/bsd/constant.EPROCLIM.html | 0 doc/libc/bsd/constant.EPROCUNAVAIL.html | 0 doc/libc/bsd/constant.EPROGMISMATCH.html | 0 doc/libc/bsd/constant.EPROGUNAVAIL.html | 0 doc/libc/bsd/constant.EPROTO.html | 0 doc/libc/bsd/constant.EPROTONOSUPPORT.html | 0 doc/libc/bsd/constant.EPROTOTYPE.html | 0 doc/libc/bsd/constant.EPWROFF.html | 0 doc/libc/bsd/constant.EQFULL.html | 0 doc/libc/bsd/constant.ERA.html | 0 doc/libc/bsd/constant.ERANGE.html | 0 doc/libc/bsd/constant.ERA_D_FMT.html | 0 doc/libc/bsd/constant.ERA_D_T_FMT.html | 0 doc/libc/bsd/constant.ERA_T_FMT.html | 0 doc/libc/bsd/constant.EREMOTE.html | 0 doc/libc/bsd/constant.EROFS.html | 0 doc/libc/bsd/constant.ERPCMISMATCH.html | 0 doc/libc/bsd/constant.ESHLIBVERS.html | 0 doc/libc/bsd/constant.ESHUTDOWN.html | 0 doc/libc/bsd/constant.ESOCKTNOSUPPORT.html | 0 doc/libc/bsd/constant.ESPIPE.html | 0 doc/libc/bsd/constant.ESRCH.html | 0 doc/libc/bsd/constant.ESTALE.html | 0 doc/libc/bsd/constant.ETIME.html | 0 doc/libc/bsd/constant.ETIMEDOUT.html | 0 doc/libc/bsd/constant.ETOOMANYREFS.html | 0 doc/libc/bsd/constant.ETXTBSY.html | 0 doc/libc/bsd/constant.EUSERS.html | 0 doc/libc/bsd/constant.EVFILT_AIO.html | 0 doc/libc/bsd/constant.EVFILT_FS.html | 0 doc/libc/bsd/constant.EVFILT_MACHPORT.html | 0 doc/libc/bsd/constant.EVFILT_PROC.html | 0 doc/libc/bsd/constant.EVFILT_READ.html | 0 doc/libc/bsd/constant.EVFILT_SIGNAL.html | 0 doc/libc/bsd/constant.EVFILT_SYSCOUNT.html | 0 doc/libc/bsd/constant.EVFILT_TIMER.html | 0 doc/libc/bsd/constant.EVFILT_USER.html | 0 doc/libc/bsd/constant.EVFILT_VM.html | 0 doc/libc/bsd/constant.EVFILT_VNODE.html | 0 doc/libc/bsd/constant.EVFILT_WRITE.html | 0 doc/libc/bsd/constant.EV_ADD.html | 0 doc/libc/bsd/constant.EV_CLEAR.html | 0 doc/libc/bsd/constant.EV_DELETE.html | 0 doc/libc/bsd/constant.EV_DISABLE.html | 0 doc/libc/bsd/constant.EV_DISPATCH.html | 0 doc/libc/bsd/constant.EV_ENABLE.html | 0 doc/libc/bsd/constant.EV_EOF.html | 0 doc/libc/bsd/constant.EV_ERROR.html | 0 doc/libc/bsd/constant.EV_FLAG0.html | 0 doc/libc/bsd/constant.EV_FLAG1.html | 0 doc/libc/bsd/constant.EV_ONESHOT.html | 0 doc/libc/bsd/constant.EV_OOBAND.html | 0 doc/libc/bsd/constant.EV_POLL.html | 0 doc/libc/bsd/constant.EV_RECEIPT.html | 0 doc/libc/bsd/constant.EV_SYSFLAGS.html | 0 doc/libc/bsd/constant.EWOULDBLOCK.html | 0 doc/libc/bsd/constant.EXDEV.html | 0 doc/libc/bsd/constant.EXIT_FAILURE.html | 0 doc/libc/bsd/constant.EXIT_SUCCESS.html | 0 doc/libc/bsd/constant.EXTPROC.html | 0 doc/libc/bsd/constant.FD_SETSIZE.html | 0 doc/libc/bsd/constant.FF0.html | 0 doc/libc/bsd/constant.FF1.html | 0 doc/libc/bsd/constant.FILENAME_MAX.html | 0 doc/libc/bsd/constant.FIOCLEX.html | 0 doc/libc/bsd/constant.FIONBIO.html | 0 doc/libc/bsd/constant.FLUSHO.html | 0 doc/libc/bsd/constant.FOPEN_MAX.html | 0 doc/libc/bsd/constant.F_ALLOCATEALL.html | 0 doc/libc/bsd/constant.F_ALLOCATECONTIG.html | 0 doc/libc/bsd/constant.F_DUPFD.html | 0 doc/libc/bsd/constant.F_DUPFD_CLOEXEC.html | 0 doc/libc/bsd/constant.F_FREEZE_FS.html | 0 doc/libc/bsd/constant.F_FULLFSYNC.html | 0 doc/libc/bsd/constant.F_GETFD.html | 0 doc/libc/bsd/constant.F_GETFL.html | 0 doc/libc/bsd/constant.F_GETLK.html | 0 doc/libc/bsd/constant.F_GETOWN.html | 0 doc/libc/bsd/constant.F_GETPATH.html | 0 doc/libc/bsd/constant.F_GLOBAL_NOCACHE.html | 0 doc/libc/bsd/constant.F_LOCK.html | 0 doc/libc/bsd/constant.F_NOCACHE.html | 0 doc/libc/bsd/constant.F_NODIRECT.html | 0 doc/libc/bsd/constant.F_OK.html | 0 doc/libc/bsd/constant.F_PEOFPOSMODE.html | 0 doc/libc/bsd/constant.F_PREALLOCATE.html | 0 doc/libc/bsd/constant.F_RDADVISE.html | 0 doc/libc/bsd/constant.F_RDAHEAD.html | 0 doc/libc/bsd/constant.F_SETFD.html | 0 doc/libc/bsd/constant.F_SETFL.html | 0 doc/libc/bsd/constant.F_SETLK.html | 0 doc/libc/bsd/constant.F_SETLKW.html | 0 doc/libc/bsd/constant.F_SETOWN.html | 0 doc/libc/bsd/constant.F_TEST.html | 0 doc/libc/bsd/constant.F_THAW_FS.html | 0 doc/libc/bsd/constant.F_TLOCK.html | 0 doc/libc/bsd/constant.F_ULOCK.html | 0 doc/libc/bsd/constant.F_VOLPOSMODE.html | 0 doc/libc/bsd/constant.GLOB_ABORTED.html | 0 doc/libc/bsd/constant.GLOB_APPEND.html | 0 doc/libc/bsd/constant.GLOB_DOOFFS.html | 0 doc/libc/bsd/constant.GLOB_ERR.html | 0 doc/libc/bsd/constant.GLOB_MARK.html | 0 doc/libc/bsd/constant.GLOB_NOCHECK.html | 0 doc/libc/bsd/constant.GLOB_NOESCAPE.html | 0 doc/libc/bsd/constant.GLOB_NOMATCH.html | 0 doc/libc/bsd/constant.GLOB_NOSORT.html | 0 doc/libc/bsd/constant.GLOB_NOSPACE.html | 0 doc/libc/bsd/constant.HUPCL.html | 0 doc/libc/bsd/constant.HW_AVAILCPU.html | 0 doc/libc/bsd/constant.HW_NCPU.html | 0 doc/libc/bsd/constant.ICANON.html | 0 doc/libc/bsd/constant.ICRNL.html | 0 doc/libc/bsd/constant.IEXTEN.html | 0 doc/libc/bsd/constant.IFF_LOOPBACK.html | 0 doc/libc/bsd/constant.IGNBRK.html | 0 doc/libc/bsd/constant.IGNCR.html | 0 doc/libc/bsd/constant.IGNPAR.html | 0 doc/libc/bsd/constant.IMAXBEL.html | 0 doc/libc/bsd/constant.INLCR.html | 0 doc/libc/bsd/constant.INPCK.html | 0 doc/libc/bsd/constant.IPPROTO_IP.html | 0 doc/libc/bsd/constant.IPPROTO_IPV6.html | 0 doc/libc/bsd/constant.IPPROTO_RAW.html | 0 doc/libc/bsd/constant.IPPROTO_TCP.html | 0 doc/libc/bsd/constant.IPV6_JOIN_GROUP.html | 0 doc/libc/bsd/constant.IPV6_LEAVE_GROUP.html | 0 .../bsd/constant.IPV6_MULTICAST_LOOP.html | 0 doc/libc/bsd/constant.IPV6_V6ONLY.html | 0 doc/libc/bsd/constant.IP_ADD_MEMBERSHIP.html | 0 doc/libc/bsd/constant.IP_DROP_MEMBERSHIP.html | 0 doc/libc/bsd/constant.IP_HDRINCL.html | 0 doc/libc/bsd/constant.IP_MULTICAST_LOOP.html | 0 doc/libc/bsd/constant.IP_MULTICAST_TTL.html | 0 doc/libc/bsd/constant.IP_TTL.html | 0 doc/libc/bsd/constant.ISIG.html | 0 doc/libc/bsd/constant.ISTRIP.html | 0 doc/libc/bsd/constant.IUTF8.html | 0 doc/libc/bsd/constant.IXANY.html | 0 doc/libc/bsd/constant.IXOFF.html | 0 doc/libc/bsd/constant.IXON.html | 0 doc/libc/bsd/constant.LC_ALL.html | 0 doc/libc/bsd/constant.LC_ALL_MASK.html | 0 doc/libc/bsd/constant.LC_COLLATE.html | 0 doc/libc/bsd/constant.LC_COLLATE_MASK.html | 0 doc/libc/bsd/constant.LC_CTYPE.html | 0 doc/libc/bsd/constant.LC_CTYPE_MASK.html | 0 doc/libc/bsd/constant.LC_MESSAGES.html | 0 doc/libc/bsd/constant.LC_MESSAGES_MASK.html | 0 doc/libc/bsd/constant.LC_MONETARY.html | 0 doc/libc/bsd/constant.LC_MONETARY_MASK.html | 0 doc/libc/bsd/constant.LC_NUMERIC.html | 0 doc/libc/bsd/constant.LC_NUMERIC_MASK.html | 0 doc/libc/bsd/constant.LC_TIME.html | 0 doc/libc/bsd/constant.LC_TIME_MASK.html | 0 doc/libc/bsd/constant.LOCK_EX.html | 0 doc/libc/bsd/constant.LOCK_NB.html | 0 doc/libc/bsd/constant.LOCK_SH.html | 0 doc/libc/bsd/constant.LOCK_UN.html | 0 doc/libc/bsd/constant.L_tmpnam.html | 0 doc/libc/bsd/constant.MADV_CAN_REUSE.html | 0 doc/libc/bsd/constant.MADV_DONTNEED.html | 0 doc/libc/bsd/constant.MADV_FREE.html | 0 doc/libc/bsd/constant.MADV_FREE_REUSABLE.html | 0 doc/libc/bsd/constant.MADV_FREE_REUSE.html | 0 doc/libc/bsd/constant.MADV_NORMAL.html | 0 doc/libc/bsd/constant.MADV_RANDOM.html | 0 doc/libc/bsd/constant.MADV_SEQUENTIAL.html | 0 doc/libc/bsd/constant.MADV_WILLNEED.html | 0 .../bsd/constant.MADV_ZERO_WIRED_PAGES.html | 0 doc/libc/bsd/constant.MAP_ANON.html | 0 doc/libc/bsd/constant.MAP_COPY.html | 0 doc/libc/bsd/constant.MAP_FAILED.html | 0 doc/libc/bsd/constant.MAP_FILE.html | 0 doc/libc/bsd/constant.MAP_FIXED.html | 0 doc/libc/bsd/constant.MAP_HASSEMAPHORE.html | 0 doc/libc/bsd/constant.MAP_JIT.html | 0 doc/libc/bsd/constant.MAP_NOCACHE.html | 0 doc/libc/bsd/constant.MAP_NOEXTEND.html | 0 doc/libc/bsd/constant.MAP_NORESERVE.html | 0 doc/libc/bsd/constant.MAP_PRIVATE.html | 0 doc/libc/bsd/constant.MAP_RENAME.html | 0 doc/libc/bsd/constant.MAP_SHARED.html | 0 doc/libc/bsd/constant.MCL_CURRENT.html | 0 doc/libc/bsd/constant.MCL_FUTURE.html | 0 doc/libc/bsd/constant.MINCORE_INCORE.html | 0 doc/libc/bsd/constant.MINCORE_MODIFIED.html | 0 .../bsd/constant.MINCORE_MODIFIED_OTHER.html | 0 doc/libc/bsd/constant.MINCORE_REFERENCED.html | 0 .../constant.MINCORE_REFERENCED_OTHER.html | 0 doc/libc/bsd/constant.MNT_FORCE.html | 0 doc/libc/bsd/constant.MON_1.html | 0 doc/libc/bsd/constant.MON_10.html | 0 doc/libc/bsd/constant.MON_11.html | 0 doc/libc/bsd/constant.MON_12.html | 0 doc/libc/bsd/constant.MON_2.html | 0 doc/libc/bsd/constant.MON_3.html | 0 doc/libc/bsd/constant.MON_4.html | 0 doc/libc/bsd/constant.MON_5.html | 0 doc/libc/bsd/constant.MON_6.html | 0 doc/libc/bsd/constant.MON_7.html | 0 doc/libc/bsd/constant.MON_8.html | 0 doc/libc/bsd/constant.MON_9.html | 0 doc/libc/bsd/constant.MS_ASYNC.html | 0 doc/libc/bsd/constant.MS_DEACTIVATE.html | 0 doc/libc/bsd/constant.MS_INVALIDATE.html | 0 doc/libc/bsd/constant.MS_KILLPAGES.html | 0 doc/libc/bsd/constant.MS_SYNC.html | 0 doc/libc/bsd/constant.NCCS.html | 0 doc/libc/bsd/constant.NI_MAXHOST.html | 0 doc/libc/bsd/constant.NL0.html | 0 doc/libc/bsd/constant.NL1.html | 0 doc/libc/bsd/constant.NOEXPR.html | 0 doc/libc/bsd/constant.NOFLSH.html | 0 doc/libc/bsd/constant.NOSTR.html | 0 doc/libc/bsd/constant.NOTE_ABSOLUTE.html | 0 doc/libc/bsd/constant.NOTE_ATTRIB.html | 0 doc/libc/bsd/constant.NOTE_CHILD.html | 0 doc/libc/bsd/constant.NOTE_DELETE.html | 0 doc/libc/bsd/constant.NOTE_EXEC.html | 0 doc/libc/bsd/constant.NOTE_EXIT.html | 0 doc/libc/bsd/constant.NOTE_EXITSTATUS.html | 0 .../bsd/constant.NOTE_EXIT_REPARENTED.html | 0 doc/libc/bsd/constant.NOTE_EXTEND.html | 0 doc/libc/bsd/constant.NOTE_FFAND.html | 0 doc/libc/bsd/constant.NOTE_FFCOPY.html | 0 doc/libc/bsd/constant.NOTE_FFCTRLMASK.html | 0 doc/libc/bsd/constant.NOTE_FFLAGSMASK.html | 0 doc/libc/bsd/constant.NOTE_FFNOP.html | 0 doc/libc/bsd/constant.NOTE_FFOR.html | 0 doc/libc/bsd/constant.NOTE_FORK.html | 0 doc/libc/bsd/constant.NOTE_LINK.html | 0 doc/libc/bsd/constant.NOTE_LOWAT.html | 0 doc/libc/bsd/constant.NOTE_NONE.html | 0 doc/libc/bsd/constant.NOTE_NSECONDS.html | 0 doc/libc/bsd/constant.NOTE_PCTRLMASK.html | 0 doc/libc/bsd/constant.NOTE_PDATAMASK.html | 0 doc/libc/bsd/constant.NOTE_REAP.html | 0 doc/libc/bsd/constant.NOTE_RENAME.html | 0 doc/libc/bsd/constant.NOTE_REVOKE.html | 0 doc/libc/bsd/constant.NOTE_SECONDS.html | 0 doc/libc/bsd/constant.NOTE_SIGNAL.html | 0 doc/libc/bsd/constant.NOTE_TRACK.html | 0 doc/libc/bsd/constant.NOTE_TRACKERR.html | 0 doc/libc/bsd/constant.NOTE_TRIGGER.html | 0 doc/libc/bsd/constant.NOTE_USECONDS.html | 0 doc/libc/bsd/constant.NOTE_VM_ERROR.html | 0 doc/libc/bsd/constant.NOTE_VM_PRESSURE.html | 0 ...ant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html | 0 .../constant.NOTE_VM_PRESSURE_TERMINATE.html | 0 doc/libc/bsd/constant.NOTE_WRITE.html | 0 doc/libc/bsd/constant.ONLCR.html | 0 doc/libc/bsd/constant.OPOST.html | 0 doc/libc/bsd/constant.O_ACCMODE.html | 0 doc/libc/bsd/constant.O_APPEND.html | 0 doc/libc/bsd/constant.O_ASYNC.html | 0 doc/libc/bsd/constant.O_CLOEXEC.html | 0 doc/libc/bsd/constant.O_CREAT.html | 0 doc/libc/bsd/constant.O_DIRECTORY.html | 0 doc/libc/bsd/constant.O_DSYNC.html | 0 doc/libc/bsd/constant.O_EXCL.html | 0 doc/libc/bsd/constant.O_FSYNC.html | 0 doc/libc/bsd/constant.O_NDELAY.html | 0 doc/libc/bsd/constant.O_NOCTTY.html | 0 doc/libc/bsd/constant.O_NOFOLLOW.html | 0 doc/libc/bsd/constant.O_NONBLOCK.html | 0 doc/libc/bsd/constant.O_RDONLY.html | 0 doc/libc/bsd/constant.O_RDWR.html | 0 doc/libc/bsd/constant.O_SYNC.html | 0 doc/libc/bsd/constant.O_TRUNC.html | 0 doc/libc/bsd/constant.O_WRONLY.html | 0 doc/libc/bsd/constant.PARENB.html | 0 doc/libc/bsd/constant.PARMRK.html | 0 doc/libc/bsd/constant.PARODD.html | 0 doc/libc/bsd/constant.PATH_MAX.html | 0 doc/libc/bsd/constant.PENDIN.html | 0 doc/libc/bsd/constant.PM_STR.html | 0 .../bsd/constant.POSIX_MADV_DONTNEED.html | 0 doc/libc/bsd/constant.POSIX_MADV_NORMAL.html | 0 doc/libc/bsd/constant.POSIX_MADV_RANDOM.html | 0 .../bsd/constant.POSIX_MADV_SEQUENTIAL.html | 0 .../bsd/constant.POSIX_MADV_WILLNEED.html | 0 doc/libc/bsd/constant.PROT_EXEC.html | 0 doc/libc/bsd/constant.PROT_NONE.html | 0 doc/libc/bsd/constant.PROT_READ.html | 0 doc/libc/bsd/constant.PROT_WRITE.html | 0 .../constant.PTHREAD_COND_INITIALIZER.html | 0 .../bsd/constant.PTHREAD_CREATE_DETACHED.html | 0 .../bsd/constant.PTHREAD_CREATE_JOINABLE.html | 0 .../constant.PTHREAD_MUTEX_INITIALIZER.html | 0 .../bsd/constant.PTHREAD_MUTEX_RECURSIVE.html | 0 .../constant.PTHREAD_RWLOCK_INITIALIZER.html | 0 doc/libc/bsd/constant.PTHREAD_STACK_MIN.html | 0 doc/libc/bsd/constant.Q_GETQUOTA.html | 0 doc/libc/bsd/constant.Q_QUOTAOFF.html | 0 doc/libc/bsd/constant.Q_QUOTAON.html | 0 doc/libc/bsd/constant.Q_SETQUOTA.html | 0 doc/libc/bsd/constant.Q_SYNC.html | 0 doc/libc/bsd/constant.RADIXCHAR.html | 0 doc/libc/bsd/constant.RAND_MAX.html | 0 doc/libc/bsd/constant.RLIMIT_AS.html | 0 doc/libc/bsd/constant.RLIMIT_CORE.html | 0 doc/libc/bsd/constant.RLIMIT_CPU.html | 0 doc/libc/bsd/constant.RLIMIT_DATA.html | 0 doc/libc/bsd/constant.RLIMIT_FSIZE.html | 0 doc/libc/bsd/constant.RLIMIT_MEMLOCK.html | 0 doc/libc/bsd/constant.RLIMIT_NOFILE.html | 0 doc/libc/bsd/constant.RLIMIT_NPROC.html | 0 doc/libc/bsd/constant.RLIMIT_RSS.html | 0 doc/libc/bsd/constant.RLIMIT_STACK.html | 0 doc/libc/bsd/constant.RLIM_INFINITY.html | 0 doc/libc/bsd/constant.RLIM_NLIMITS.html | 0 doc/libc/bsd/constant.RTLD_DEFAULT.html | 0 doc/libc/bsd/constant.RTLD_FIRST.html | 0 doc/libc/bsd/constant.RTLD_GLOBAL.html | 0 doc/libc/bsd/constant.RTLD_LOCAL.html | 0 doc/libc/bsd/constant.RTLD_NODELETE.html | 0 doc/libc/bsd/constant.RTLD_NOLOAD.html | 0 doc/libc/bsd/constant.RTLD_NOW.html | 0 doc/libc/bsd/constant.RUSAGE_CHILDREN.html | 0 doc/libc/bsd/constant.RUSAGE_SELF.html | 0 doc/libc/bsd/constant.R_OK.html | 0 doc/libc/bsd/constant.SA_NOCLDSTOP.html | 0 doc/libc/bsd/constant.SA_NOCLDWAIT.html | 0 doc/libc/bsd/constant.SA_NODEFER.html | 0 doc/libc/bsd/constant.SA_ONSTACK.html | 0 doc/libc/bsd/constant.SA_RESETHAND.html | 0 doc/libc/bsd/constant.SA_RESTART.html | 0 doc/libc/bsd/constant.SA_SIGINFO.html | 0 doc/libc/bsd/constant.SEEK_CUR.html | 0 doc/libc/bsd/constant.SEEK_END.html | 0 doc/libc/bsd/constant.SEEK_SET.html | 0 doc/libc/bsd/constant.SHUT_RD.html | 0 doc/libc/bsd/constant.SHUT_RDWR.html | 0 doc/libc/bsd/constant.SHUT_WR.html | 0 doc/libc/bsd/constant.SIGABRT.html | 0 doc/libc/bsd/constant.SIGALRM.html | 0 doc/libc/bsd/constant.SIGBUS.html | 0 doc/libc/bsd/constant.SIGCHLD.html | 0 doc/libc/bsd/constant.SIGCONT.html | 0 doc/libc/bsd/constant.SIGEMT.html | 0 doc/libc/bsd/constant.SIGFPE.html | 0 doc/libc/bsd/constant.SIGHUP.html | 0 doc/libc/bsd/constant.SIGILL.html | 0 doc/libc/bsd/constant.SIGINFO.html | 0 doc/libc/bsd/constant.SIGINT.html | 0 doc/libc/bsd/constant.SIGIO.html | 0 doc/libc/bsd/constant.SIGKILL.html | 0 doc/libc/bsd/constant.SIGPIPE.html | 0 doc/libc/bsd/constant.SIGPROF.html | 0 doc/libc/bsd/constant.SIGQUIT.html | 0 doc/libc/bsd/constant.SIGSEGV.html | 0 doc/libc/bsd/constant.SIGSTKSZ.html | 0 doc/libc/bsd/constant.SIGSTOP.html | 0 doc/libc/bsd/constant.SIGSYS.html | 0 doc/libc/bsd/constant.SIGTERM.html | 0 doc/libc/bsd/constant.SIGTRAP.html | 0 doc/libc/bsd/constant.SIGTSTP.html | 0 doc/libc/bsd/constant.SIGTTIN.html | 0 doc/libc/bsd/constant.SIGTTOU.html | 0 doc/libc/bsd/constant.SIGURG.html | 0 doc/libc/bsd/constant.SIGUSR1.html | 0 doc/libc/bsd/constant.SIGUSR2.html | 0 doc/libc/bsd/constant.SIGVTALRM.html | 0 doc/libc/bsd/constant.SIGWINCH.html | 0 doc/libc/bsd/constant.SIGXCPU.html | 0 doc/libc/bsd/constant.SIGXFSZ.html | 0 doc/libc/bsd/constant.SIG_BLOCK.html | 0 doc/libc/bsd/constant.SIG_SETMASK.html | 0 doc/libc/bsd/constant.SIG_UNBLOCK.html | 0 doc/libc/bsd/constant.SOCK_DGRAM.html | 0 doc/libc/bsd/constant.SOCK_RAW.html | 0 doc/libc/bsd/constant.SOCK_STREAM.html | 0 doc/libc/bsd/constant.SOL_SOCKET.html | 0 doc/libc/bsd/constant.SO_ACCEPTCONN.html | 0 doc/libc/bsd/constant.SO_BROADCAST.html | 0 doc/libc/bsd/constant.SO_DEBUG.html | 0 doc/libc/bsd/constant.SO_DONTROUTE.html | 0 doc/libc/bsd/constant.SO_DONTTRUNC.html | 0 doc/libc/bsd/constant.SO_ERROR.html | 0 doc/libc/bsd/constant.SO_KEEPALIVE.html | 0 doc/libc/bsd/constant.SO_LINGER.html | 0 doc/libc/bsd/constant.SO_NKE.html | 0 doc/libc/bsd/constant.SO_NOADDRERR.html | 0 doc/libc/bsd/constant.SO_NOSIGPIPE.html | 0 doc/libc/bsd/constant.SO_NREAD.html | 0 doc/libc/bsd/constant.SO_NWRITE.html | 0 doc/libc/bsd/constant.SO_OOBINLINE.html | 0 doc/libc/bsd/constant.SO_RCVBUF.html | 0 doc/libc/bsd/constant.SO_RCVLOWAT.html | 0 doc/libc/bsd/constant.SO_RCVTIMEO.html | 0 doc/libc/bsd/constant.SO_REUSEADDR.html | 0 doc/libc/bsd/constant.SO_REUSEPORT.html | 0 doc/libc/bsd/constant.SO_SNDBUF.html | 0 doc/libc/bsd/constant.SO_SNDLOWAT.html | 0 doc/libc/bsd/constant.SO_SNDTIMEO.html | 0 doc/libc/bsd/constant.SO_TYPE.html | 0 doc/libc/bsd/constant.SO_USELOOPBACK.html | 0 doc/libc/bsd/constant.SO_WANTMORE.html | 0 doc/libc/bsd/constant.SO_WANTOOBFLAG.html | 0 doc/libc/bsd/constant.SS_DISABLE.html | 0 doc/libc/bsd/constant.SS_ONSTACK.html | 0 doc/libc/bsd/constant.STDERR_FILENO.html | 0 doc/libc/bsd/constant.STDIN_FILENO.html | 0 doc/libc/bsd/constant.STDOUT_FILENO.html | 0 doc/libc/bsd/constant.ST_NOSUID.html | 0 doc/libc/bsd/constant.ST_RDONLY.html | 0 doc/libc/bsd/constant.S_IEXEC.html | 0 doc/libc/bsd/constant.S_IFBLK.html | 0 doc/libc/bsd/constant.S_IFCHR.html | 0 doc/libc/bsd/constant.S_IFDIR.html | 0 doc/libc/bsd/constant.S_IFIFO.html | 0 doc/libc/bsd/constant.S_IFLNK.html | 0 doc/libc/bsd/constant.S_IFMT.html | 0 doc/libc/bsd/constant.S_IFREG.html | 0 doc/libc/bsd/constant.S_IFSOCK.html | 0 doc/libc/bsd/constant.S_IREAD.html | 0 doc/libc/bsd/constant.S_IRGRP.html | 0 doc/libc/bsd/constant.S_IROTH.html | 0 doc/libc/bsd/constant.S_IRUSR.html | 0 doc/libc/bsd/constant.S_IRWXG.html | 0 doc/libc/bsd/constant.S_IRWXO.html | 0 doc/libc/bsd/constant.S_IRWXU.html | 0 doc/libc/bsd/constant.S_IWGRP.html | 0 doc/libc/bsd/constant.S_IWOTH.html | 0 doc/libc/bsd/constant.S_IWRITE.html | 0 doc/libc/bsd/constant.S_IWUSR.html | 0 doc/libc/bsd/constant.S_IXGRP.html | 0 doc/libc/bsd/constant.S_IXOTH.html | 0 doc/libc/bsd/constant.S_IXUSR.html | 0 doc/libc/bsd/constant.TAB0.html | 0 doc/libc/bsd/constant.TAB1.html | 0 doc/libc/bsd/constant.TAB2.html | 0 doc/libc/bsd/constant.TAB3.html | 0 doc/libc/bsd/constant.TCIFLUSH.html | 0 doc/libc/bsd/constant.TCIOFF.html | 0 doc/libc/bsd/constant.TCIOFLUSH.html | 0 doc/libc/bsd/constant.TCION.html | 0 doc/libc/bsd/constant.TCOFLUSH.html | 0 doc/libc/bsd/constant.TCOOFF.html | 0 doc/libc/bsd/constant.TCOON.html | 0 doc/libc/bsd/constant.TCP_KEEPALIVE.html | 0 doc/libc/bsd/constant.TCP_NODELAY.html | 0 doc/libc/bsd/constant.TCSADRAIN.html | 0 doc/libc/bsd/constant.TCSAFLUSH.html | 0 doc/libc/bsd/constant.TCSANOW.html | 0 doc/libc/bsd/constant.THOUSEP.html | 0 doc/libc/bsd/constant.TIOCCBRK.html | 0 doc/libc/bsd/constant.TIOCCDTR.html | 0 doc/libc/bsd/constant.TIOCCONS.html | 0 doc/libc/bsd/constant.TIOCDCDTIMESTAMP.html | 0 doc/libc/bsd/constant.TIOCDRAIN.html | 0 doc/libc/bsd/constant.TIOCDSIMICROCODE.html | 0 doc/libc/bsd/constant.TIOCEXCL.html | 0 doc/libc/bsd/constant.TIOCEXT.html | 0 doc/libc/bsd/constant.TIOCFLUSH.html | 0 doc/libc/bsd/constant.TIOCGDRAINWAIT.html | 0 doc/libc/bsd/constant.TIOCGETD.html | 0 doc/libc/bsd/constant.TIOCGPGRP.html | 0 doc/libc/bsd/constant.TIOCGWINSZ.html | 0 doc/libc/bsd/constant.TIOCIXOFF.html | 0 doc/libc/bsd/constant.TIOCIXON.html | 0 doc/libc/bsd/constant.TIOCMBIC.html | 0 doc/libc/bsd/constant.TIOCMBIS.html | 0 doc/libc/bsd/constant.TIOCMGDTRWAIT.html | 0 doc/libc/bsd/constant.TIOCMGET.html | 0 doc/libc/bsd/constant.TIOCMODG.html | 0 doc/libc/bsd/constant.TIOCMODS.html | 0 doc/libc/bsd/constant.TIOCMSDTRWAIT.html | 0 doc/libc/bsd/constant.TIOCMSET.html | 0 doc/libc/bsd/constant.TIOCM_CAR.html | 0 doc/libc/bsd/constant.TIOCM_CD.html | 0 doc/libc/bsd/constant.TIOCM_CTS.html | 0 doc/libc/bsd/constant.TIOCM_DSR.html | 0 doc/libc/bsd/constant.TIOCM_DTR.html | 0 doc/libc/bsd/constant.TIOCM_LE.html | 0 doc/libc/bsd/constant.TIOCM_RI.html | 0 doc/libc/bsd/constant.TIOCM_RNG.html | 0 doc/libc/bsd/constant.TIOCM_RTS.html | 0 doc/libc/bsd/constant.TIOCM_SR.html | 0 doc/libc/bsd/constant.TIOCM_ST.html | 0 doc/libc/bsd/constant.TIOCNOTTY.html | 0 doc/libc/bsd/constant.TIOCNXCL.html | 0 doc/libc/bsd/constant.TIOCOUTQ.html | 0 doc/libc/bsd/constant.TIOCPKT.html | 0 doc/libc/bsd/constant.TIOCPKT_DATA.html | 0 doc/libc/bsd/constant.TIOCPKT_DOSTOP.html | 0 doc/libc/bsd/constant.TIOCPKT_FLUSHREAD.html | 0 doc/libc/bsd/constant.TIOCPKT_FLUSHWRITE.html | 0 doc/libc/bsd/constant.TIOCPKT_IOCTL.html | 0 doc/libc/bsd/constant.TIOCPKT_NOSTOP.html | 0 doc/libc/bsd/constant.TIOCPKT_START.html | 0 doc/libc/bsd/constant.TIOCPKT_STOP.html | 0 doc/libc/bsd/constant.TIOCPTYGNAME.html | 0 doc/libc/bsd/constant.TIOCPTYGRANT.html | 0 doc/libc/bsd/constant.TIOCPTYUNLK.html | 0 doc/libc/bsd/constant.TIOCREMOTE.html | 0 doc/libc/bsd/constant.TIOCSBRK.html | 0 doc/libc/bsd/constant.TIOCSCONS.html | 0 doc/libc/bsd/constant.TIOCSCTTY.html | 0 doc/libc/bsd/constant.TIOCSDRAINWAIT.html | 0 doc/libc/bsd/constant.TIOCSDTR.html | 0 doc/libc/bsd/constant.TIOCSETD.html | 0 doc/libc/bsd/constant.TIOCSIG.html | 0 doc/libc/bsd/constant.TIOCSPGRP.html | 0 doc/libc/bsd/constant.TIOCSTART.html | 0 doc/libc/bsd/constant.TIOCSTAT.html | 0 doc/libc/bsd/constant.TIOCSTI.html | 0 doc/libc/bsd/constant.TIOCSTOP.html | 0 doc/libc/bsd/constant.TIOCSWINSZ.html | 0 doc/libc/bsd/constant.TIOCTIMESTAMP.html | 0 doc/libc/bsd/constant.TIOCUCNTL.html | 0 doc/libc/bsd/constant.TMP_MAX.html | 0 doc/libc/bsd/constant.TOSTOP.html | 0 doc/libc/bsd/constant.T_FMT.html | 0 doc/libc/bsd/constant.T_FMT_AMPM.html | 0 doc/libc/bsd/constant.VDISCARD.html | 0 doc/libc/bsd/constant.VEOF.html | 0 doc/libc/bsd/constant.VEOL.html | 0 doc/libc/bsd/constant.VEOL2.html | 0 doc/libc/bsd/constant.VERASE.html | 0 doc/libc/bsd/constant.VINTR.html | 0 doc/libc/bsd/constant.VKILL.html | 0 doc/libc/bsd/constant.VLNEXT.html | 0 doc/libc/bsd/constant.VMIN.html | 0 doc/libc/bsd/constant.VQUIT.html | 0 doc/libc/bsd/constant.VREPRINT.html | 0 doc/libc/bsd/constant.VSTART.html | 0 doc/libc/bsd/constant.VSTOP.html | 0 doc/libc/bsd/constant.VSUSP.html | 0 doc/libc/bsd/constant.VT0.html | 0 doc/libc/bsd/constant.VT1.html | 0 doc/libc/bsd/constant.VTIME.html | 0 doc/libc/bsd/constant.VWERASE.html | 0 doc/libc/bsd/constant.WNOHANG.html | 0 doc/libc/bsd/constant.W_OK.html | 0 doc/libc/bsd/constant.X_OK.html | 0 doc/libc/bsd/constant.YESEXPR.html | 0 doc/libc/bsd/constant.YESSTR.html | 0 doc/libc/bsd/constant._IOFBF.html | 0 doc/libc/bsd/constant._IOLBF.html | 0 doc/libc/bsd/constant._IONBF.html | 0 doc/libc/bsd/constant._PC_NAME_MAX.html | 0 .../bsd/constant._PTHREAD_COND_SIG_init.html | 0 .../bsd/constant._PTHREAD_MUTEX_SIG_init.html | 0 .../constant._PTHREAD_RWLOCK_SIG_init.html | 0 doc/libc/bsd/constant._RLIMIT_POSIX_FLAG.html | 0 doc/libc/bsd/constant._SC_2_CHAR_TERM.html | 0 doc/libc/bsd/constant._SC_2_C_BIND.html | 0 doc/libc/bsd/constant._SC_2_C_DEV.html | 0 doc/libc/bsd/constant._SC_2_FORT_DEV.html | 0 doc/libc/bsd/constant._SC_2_FORT_RUN.html | 0 doc/libc/bsd/constant._SC_2_LOCALEDEF.html | 0 doc/libc/bsd/constant._SC_2_PBS.html | 0 .../bsd/constant._SC_2_PBS_ACCOUNTING.html | 0 .../bsd/constant._SC_2_PBS_CHECKPOINT.html | 0 doc/libc/bsd/constant._SC_2_PBS_LOCATE.html | 0 doc/libc/bsd/constant._SC_2_PBS_MESSAGE.html | 0 doc/libc/bsd/constant._SC_2_PBS_TRACK.html | 0 doc/libc/bsd/constant._SC_2_SW_DEV.html | 0 doc/libc/bsd/constant._SC_2_UPE.html | 0 doc/libc/bsd/constant._SC_2_VERSION.html | 0 doc/libc/bsd/constant._SC_ADVISORY_INFO.html | 0 doc/libc/bsd/constant._SC_AIO_LISTIO_MAX.html | 0 doc/libc/bsd/constant._SC_AIO_MAX.html | 0 .../bsd/constant._SC_AIO_PRIO_DELTA_MAX.html | 0 doc/libc/bsd/constant._SC_ARG_MAX.html | 0 .../bsd/constant._SC_ASYNCHRONOUS_IO.html | 0 doc/libc/bsd/constant._SC_ATEXIT_MAX.html | 0 doc/libc/bsd/constant._SC_BARRIERS.html | 0 doc/libc/bsd/constant._SC_BC_BASE_MAX.html | 0 doc/libc/bsd/constant._SC_BC_DIM_MAX.html | 0 doc/libc/bsd/constant._SC_BC_SCALE_MAX.html | 0 doc/libc/bsd/constant._SC_BC_STRING_MAX.html | 0 doc/libc/bsd/constant._SC_CHILD_MAX.html | 0 doc/libc/bsd/constant._SC_CLK_TCK.html | 0 .../bsd/constant._SC_CLOCK_SELECTION.html | 0 .../bsd/constant._SC_COLL_WEIGHTS_MAX.html | 0 doc/libc/bsd/constant._SC_CPUTIME.html | 0 doc/libc/bsd/constant._SC_DELAYTIMER_MAX.html | 0 doc/libc/bsd/constant._SC_EXPR_NEST_MAX.html | 0 doc/libc/bsd/constant._SC_FILE_LOCKING.html | 0 doc/libc/bsd/constant._SC_FSYNC.html | 0 .../bsd/constant._SC_GETGR_R_SIZE_MAX.html | 0 .../bsd/constant._SC_GETPW_R_SIZE_MAX.html | 0 doc/libc/bsd/constant._SC_HOST_NAME_MAX.html | 0 doc/libc/bsd/constant._SC_IOV_MAX.html | 0 doc/libc/bsd/constant._SC_IPV6.html | 0 doc/libc/bsd/constant._SC_JOB_CONTROL.html | 0 doc/libc/bsd/constant._SC_LINE_MAX.html | 0 doc/libc/bsd/constant._SC_LOGIN_NAME_MAX.html | 0 doc/libc/bsd/constant._SC_MAPPED_FILES.html | 0 doc/libc/bsd/constant._SC_MEMLOCK.html | 0 doc/libc/bsd/constant._SC_MEMLOCK_RANGE.html | 0 .../bsd/constant._SC_MEMORY_PROTECTION.html | 0 .../bsd/constant._SC_MESSAGE_PASSING.html | 0 .../bsd/constant._SC_MONOTONIC_CLOCK.html | 0 doc/libc/bsd/constant._SC_MQ_OPEN_MAX.html | 0 doc/libc/bsd/constant._SC_MQ_PRIO_MAX.html | 0 doc/libc/bsd/constant._SC_NGROUPS_MAX.html | 0 .../bsd/constant._SC_NPROCESSORS_CONF.html | 0 .../bsd/constant._SC_NPROCESSORS_ONLN.html | 0 doc/libc/bsd/constant._SC_OPEN_MAX.html | 0 doc/libc/bsd/constant._SC_PAGESIZE.html | 0 doc/libc/bsd/constant._SC_PAGE_SIZE.html | 0 doc/libc/bsd/constant._SC_PASS_MAX.html | 0 doc/libc/bsd/constant._SC_PRIORITIZED_IO.html | 0 .../bsd/constant._SC_PRIORITY_SCHEDULING.html | 0 doc/libc/bsd/constant._SC_RAW_SOCKETS.html | 0 .../bsd/constant._SC_READER_WRITER_LOCKS.html | 0 .../bsd/constant._SC_REALTIME_SIGNALS.html | 0 doc/libc/bsd/constant._SC_REGEXP.html | 0 doc/libc/bsd/constant._SC_RE_DUP_MAX.html | 0 doc/libc/bsd/constant._SC_RTSIG_MAX.html | 0 doc/libc/bsd/constant._SC_SAVED_IDS.html | 0 doc/libc/bsd/constant._SC_SEMAPHORES.html | 0 doc/libc/bsd/constant._SC_SEM_NSEMS_MAX.html | 0 doc/libc/bsd/constant._SC_SEM_VALUE_MAX.html | 0 .../constant._SC_SHARED_MEMORY_OBJECTS.html | 0 doc/libc/bsd/constant._SC_SHELL.html | 0 doc/libc/bsd/constant._SC_SIGQUEUE_MAX.html | 0 doc/libc/bsd/constant._SC_SPAWN.html | 0 doc/libc/bsd/constant._SC_SPIN_LOCKS.html | 0 .../bsd/constant._SC_SPORADIC_SERVER.html | 0 doc/libc/bsd/constant._SC_SS_REPL_MAX.html | 0 doc/libc/bsd/constant._SC_STREAM_MAX.html | 0 doc/libc/bsd/constant._SC_SYMLOOP_MAX.html | 0 .../bsd/constant._SC_SYNCHRONIZED_IO.html | 0 doc/libc/bsd/constant._SC_THREADS.html | 0 .../constant._SC_THREAD_ATTR_STACKADDR.html | 0 .../constant._SC_THREAD_ATTR_STACKSIZE.html | 0 doc/libc/bsd/constant._SC_THREAD_CPUTIME.html | 0 ...tant._SC_THREAD_DESTRUCTOR_ITERATIONS.html | 0 .../bsd/constant._SC_THREAD_KEYS_MAX.html | 0 ...nstant._SC_THREAD_PRIORITY_SCHEDULING.html | 0 .../bsd/constant._SC_THREAD_PRIO_INHERIT.html | 0 .../bsd/constant._SC_THREAD_PRIO_PROTECT.html | 0 .../constant._SC_THREAD_PROCESS_SHARED.html | 0 .../constant._SC_THREAD_SAFE_FUNCTIONS.html | 0 .../constant._SC_THREAD_SPORADIC_SERVER.html | 0 .../bsd/constant._SC_THREAD_STACK_MIN.html | 0 .../bsd/constant._SC_THREAD_THREADS_MAX.html | 0 doc/libc/bsd/constant._SC_TIMEOUTS.html | 0 doc/libc/bsd/constant._SC_TIMERS.html | 0 doc/libc/bsd/constant._SC_TIMER_MAX.html | 0 doc/libc/bsd/constant._SC_TRACE.html | 0 .../bsd/constant._SC_TRACE_EVENT_FILTER.html | 0 .../constant._SC_TRACE_EVENT_NAME_MAX.html | 0 doc/libc/bsd/constant._SC_TRACE_INHERIT.html | 0 doc/libc/bsd/constant._SC_TRACE_LOG.html | 0 doc/libc/bsd/constant._SC_TRACE_NAME_MAX.html | 0 doc/libc/bsd/constant._SC_TRACE_SYS_MAX.html | 0 .../constant._SC_TRACE_USER_EVENT_MAX.html | 0 doc/libc/bsd/constant._SC_TTY_NAME_MAX.html | 0 .../constant._SC_TYPED_MEMORY_OBJECTS.html | 0 doc/libc/bsd/constant._SC_TZNAME_MAX.html | 0 doc/libc/bsd/constant._SC_V6_ILP32_OFF32.html | 0 .../bsd/constant._SC_V6_ILP32_OFFBIG.html | 0 doc/libc/bsd/constant._SC_V6_LP64_OFF64.html | 0 .../bsd/constant._SC_V6_LPBIG_OFFBIG.html | 0 doc/libc/bsd/constant._SC_VERSION.html | 0 .../bsd/constant._SC_XBS5_ILP32_OFF32.html | 0 .../bsd/constant._SC_XBS5_ILP32_OFFBIG.html | 0 .../bsd/constant._SC_XBS5_LP64_OFF64.html | 0 .../bsd/constant._SC_XBS5_LPBIG_OFFBIG.html | 0 doc/libc/bsd/constant._SC_XOPEN_CRYPT.html | 0 doc/libc/bsd/constant._SC_XOPEN_ENH_I18N.html | 0 doc/libc/bsd/constant._SC_XOPEN_LEGACY.html | 0 doc/libc/bsd/constant._SC_XOPEN_REALTIME.html | 0 .../constant._SC_XOPEN_REALTIME_THREADS.html | 0 doc/libc/bsd/constant._SC_XOPEN_SHM.html | 0 doc/libc/bsd/constant._SC_XOPEN_STREAMS.html | 0 doc/libc/bsd/constant._SC_XOPEN_UNIX.html | 0 doc/libc/bsd/constant._SC_XOPEN_VERSION.html | 0 .../bsd/constant._SC_XOPEN_XCU_VERSION.html | 0 doc/libc/bsd/constant._WSTOPPED.html | 0 .../bsd/constant.__PTHREAD_COND_SIZE__.html | 0 .../bsd/constant.__PTHREAD_MUTEX_SIZE__.html | 0 .../bsd/constant.__PTHREAD_RWLOCK_SIZE__.html | 0 doc/libc/bsd/enum.timezone.html | 10 - doc/libc/bsd/fn.FD_CLR.html | 10 - doc/libc/bsd/fn.FD_ISSET.html | 10 - doc/libc/bsd/fn.FD_SET.html | 10 - doc/libc/bsd/fn.FD_ZERO.html | 10 - doc/libc/bsd/fn.WCOREDUMP.html | 10 - doc/libc/bsd/fn.WEXITSTATUS.html | 10 - doc/libc/bsd/fn.WIFCONTINUED.html | 10 - doc/libc/bsd/fn.WIFEXITED.html | 10 - doc/libc/bsd/fn.WIFSIGNALED.html | 10 - doc/libc/bsd/fn.WIFSTOPPED.html | 10 - doc/libc/bsd/fn.WSTOPSIG.html | 10 - doc/libc/bsd/fn.WTERMSIG.html | 10 - doc/libc/bsd/fn._WSTATUS.html | 10 - doc/libc/bsd/fn.__error.html | 10 - doc/libc/bsd/fn.backtrace.html | 10 - doc/libc/bsd/fn.duplocale.html | 10 - doc/libc/bsd/fn.forkpty.html | 10 - doc/libc/bsd/fn.freelocale.html | 10 - doc/libc/bsd/fn.fstatfs.html | 10 - doc/libc/bsd/fn.getnameinfo.html | 10 - doc/libc/bsd/fn.getpwuid_r.html | 10 - doc/libc/bsd/fn.ioctl.html | 10 - doc/libc/bsd/fn.kevent.html | 10 - doc/libc/bsd/fn.kevent64.html | 10 - doc/libc/bsd/fn.kqueue.html | 10 - doc/libc/bsd/fn.localeconv_l.html | 10 - doc/libc/bsd/fn.mach_absolute_time.html | 10 - doc/libc/bsd/fn.mach_timebase_info.html | 10 - doc/libc/bsd/fn.mincore.html | 10 - doc/libc/bsd/fn.mount.html | 10 - doc/libc/bsd/fn.mprotect.html | 10 - doc/libc/bsd/fn.newlocale.html | 10 - doc/libc/bsd/fn.openpty.html | 10 - doc/libc/bsd/fn.pthread_get_stackaddr_np.html | 10 - doc/libc/bsd/fn.pthread_get_stacksize_np.html | 10 - doc/libc/bsd/fn.pthread_setname_np.html | 10 - doc/libc/bsd/fn.ptrace.html | 10 - doc/libc/bsd/fn.querylocale.html | 10 - doc/libc/bsd/fn.quotactl.html | 10 - doc/libc/bsd/fn.sendfile.html | 10 - doc/libc/bsd/fn.setgroups.html | 10 - doc/libc/bsd/fn.sethostname.html | 10 - doc/libc/bsd/fn.shm_open.html | 10 - doc/libc/bsd/fn.statfs.html | 10 - doc/libc/bsd/fn.syscall.html | 10 - doc/libc/bsd/fn.sysctl.html | 10 - doc/libc/bsd/fn.sysctlbyname.html | 10 - doc/libc/bsd/fn.sysctlnametomib.html | 10 - doc/libc/bsd/fn.unmount.html | 10 - doc/libc/bsd/fn.uselocale.html | 10 - doc/libc/bsd/index.html | 0 doc/libc/bsd/sidebar-items.js | 1 - doc/libc/bsd/struct.Dl_info.html | 10 - doc/libc/bsd/struct.addrinfo.html | 10 - doc/libc/bsd/struct.dirent.html | 10 - doc/libc/bsd/struct.dqblk.html | 10 - doc/libc/bsd/struct.fd_set.html | 10 - doc/libc/bsd/struct.flock.html | 10 - doc/libc/bsd/struct.fsid_t.html | 10 - doc/libc/bsd/struct.fstore_t.html | 10 - doc/libc/bsd/struct.glob_t.html | 10 - doc/libc/bsd/struct.ifaddrs.html | 10 - doc/libc/bsd/struct.kevent.html | 10 - doc/libc/bsd/struct.kevent64_s.html | 10 - doc/libc/bsd/struct.lconv.html | 10 - doc/libc/bsd/struct.mach_timebase_info.html | 10 - doc/libc/bsd/struct.msghdr.html | 10 - doc/libc/bsd/struct.passwd.html | 10 - doc/libc/bsd/struct.pthread_attr_t.html | 10 - doc/libc/bsd/struct.pthread_cond_t.html | 10 - doc/libc/bsd/struct.pthread_mutex_t.html | 10 - doc/libc/bsd/struct.pthread_mutexattr_t.html | 10 - doc/libc/bsd/struct.pthread_rwlock_t.html | 10 - doc/libc/bsd/struct.radvisory.html | 10 - doc/libc/bsd/struct.sf_hdtr.html | 10 - doc/libc/bsd/struct.sigaction.html | 10 - doc/libc/bsd/struct.siginfo_t.html | 10 - doc/libc/bsd/struct.sockaddr.html | 10 - doc/libc/bsd/struct.sockaddr_in.html | 10 - doc/libc/bsd/struct.sockaddr_in6.html | 10 - doc/libc/bsd/struct.sockaddr_storage.html | 10 - doc/libc/bsd/struct.sockaddr_un.html | 10 - doc/libc/bsd/struct.stack_t.html | 10 - doc/libc/bsd/struct.stat.html | 10 - doc/libc/bsd/struct.statfs.html | 10 - doc/libc/bsd/struct.statvfs.html | 10 - doc/libc/bsd/struct.termios.html | 10 - doc/libc/bsd/struct.tm.html | 10 - doc/libc/bsd/struct.utsname.html | 10 - doc/libc/bsd/type.blkcnt_t.html | 10 - doc/libc/bsd/type.blksize_t.html | 10 - doc/libc/bsd/type.c_char.html | 10 - doc/libc/bsd/type.c_long.html | 10 - doc/libc/bsd/type.c_ulong.html | 10 - doc/libc/bsd/type.clock_t.html | 10 - doc/libc/bsd/type.dev_t.html | 10 - doc/libc/bsd/type.fsblkcnt_t.html | 10 - doc/libc/bsd/type.fsfilcnt_t.html | 10 - doc/libc/bsd/type.ino_t.html | 10 - .../bsd/type.mach_timebase_info_data_t.html | 10 - doc/libc/bsd/type.mode_t.html | 10 - doc/libc/bsd/type.nfds_t.html | 10 - doc/libc/bsd/type.nl_item.html | 10 - doc/libc/bsd/type.nlink_t.html | 10 - doc/libc/bsd/type.off_t.html | 10 - doc/libc/bsd/type.pthread_key_t.html | 10 - doc/libc/bsd/type.pthread_t.html | 10 - doc/libc/bsd/type.rlim_t.html | 10 - doc/libc/bsd/type.sa_family_t.html | 10 - doc/libc/bsd/type.sigset_t.html | 10 - doc/libc/bsd/type.socklen_t.html | 10 - doc/libc/bsd/type.speed_t.html | 10 - doc/libc/bsd/type.suseconds_t.html | 10 - doc/libc/bsd/type.tcflag_t.html | 10 - doc/libc/bsd/type.time_t.html | 10 - doc/libc/bsd/type.useconds_t.html | 10 - doc/libc/bsd/type.wchar_t.html | 10 - doc/libc/constant.ABDAY_1.html | 112 - doc/libc/constant.ABDAY_2.html | 112 - doc/libc/constant.ABDAY_3.html | 112 - doc/libc/constant.ABDAY_4.html | 112 - doc/libc/constant.ABDAY_5.html | 112 - doc/libc/constant.ABDAY_6.html | 112 - doc/libc/constant.ABDAY_7.html | 112 - doc/libc/constant.ABMON_1.html | 112 - doc/libc/constant.ABMON_10.html | 112 - doc/libc/constant.ABMON_11.html | 112 - doc/libc/constant.ABMON_12.html | 112 - doc/libc/constant.ABMON_2.html | 112 - doc/libc/constant.ABMON_3.html | 112 - doc/libc/constant.ABMON_4.html | 112 - doc/libc/constant.ABMON_5.html | 112 - doc/libc/constant.ABMON_6.html | 112 - doc/libc/constant.ABMON_7.html | 112 - doc/libc/constant.ABMON_8.html | 112 - doc/libc/constant.ABMON_9.html | 112 - doc/libc/constant.AF_INET.html | 112 - doc/libc/constant.AF_INET6.html | 112 - doc/libc/constant.AF_UNIX.html | 112 - doc/libc/constant.ALT_DIGITS.html | 112 - doc/libc/constant.AM_STR.html | 112 - doc/libc/constant.BRKINT.html | 112 - doc/libc/constant.BS0.html | 112 - doc/libc/constant.BS1.html | 112 - doc/libc/constant.BUFSIZ.html | 112 - doc/libc/constant.CLOCAL.html | 112 - doc/libc/constant.CODESET.html | 112 - doc/libc/constant.CR0.html | 112 - doc/libc/constant.CR1.html | 112 - doc/libc/constant.CR2.html | 112 - doc/libc/constant.CR3.html | 112 - doc/libc/constant.CREAD.html | 112 - doc/libc/constant.CRNCYSTR.html | 112 - doc/libc/constant.CRTSCTS.html | 112 - doc/libc/constant.CS5.html | 112 - doc/libc/constant.CS6.html | 112 - doc/libc/constant.CS7.html | 112 - doc/libc/constant.CS8.html | 112 - doc/libc/constant.CSIZE.html | 112 - doc/libc/constant.CSTOPB.html | 112 - doc/libc/constant.CTL_HW.html | 112 - doc/libc/constant.DAY_1.html | 112 - doc/libc/constant.DAY_2.html | 112 - doc/libc/constant.DAY_3.html | 112 - doc/libc/constant.DAY_4.html | 112 - doc/libc/constant.DAY_5.html | 112 - doc/libc/constant.DAY_6.html | 112 - doc/libc/constant.DAY_7.html | 112 - doc/libc/constant.DT_BLK.html | 112 - doc/libc/constant.DT_CHR.html | 112 - doc/libc/constant.DT_DIR.html | 112 - doc/libc/constant.DT_FIFO.html | 112 - doc/libc/constant.DT_LNK.html | 112 - doc/libc/constant.DT_REG.html | 112 - doc/libc/constant.DT_SOCK.html | 112 - doc/libc/constant.D_FMT.html | 112 - doc/libc/constant.D_MD_ORDER.html | 112 - doc/libc/constant.D_T_FMT.html | 112 - doc/libc/constant.E2BIG.html | 112 - doc/libc/constant.EACCES.html | 112 - doc/libc/constant.EADDRINUSE.html | 112 - doc/libc/constant.EADDRNOTAVAIL.html | 112 - doc/libc/constant.EAFNOSUPPORT.html | 112 - doc/libc/constant.EAGAIN.html | 112 - doc/libc/constant.EALREADY.html | 112 - doc/libc/constant.EAUTH.html | 112 - doc/libc/constant.EBADARCH.html | 112 - doc/libc/constant.EBADEXEC.html | 112 - doc/libc/constant.EBADF.html | 112 - doc/libc/constant.EBADMACHO.html | 112 - doc/libc/constant.EBADMSG.html | 112 - doc/libc/constant.EBADRPC.html | 112 - doc/libc/constant.EBUSY.html | 112 - doc/libc/constant.ECANCELED.html | 112 - doc/libc/constant.ECHILD.html | 112 - doc/libc/constant.ECHO.html | 112 - doc/libc/constant.ECHOCTL.html | 112 - doc/libc/constant.ECHOE.html | 112 - doc/libc/constant.ECHOK.html | 112 - doc/libc/constant.ECHOKE.html | 112 - doc/libc/constant.ECHONL.html | 112 - doc/libc/constant.ECHOPRT.html | 112 - doc/libc/constant.ECONNABORTED.html | 112 - doc/libc/constant.ECONNREFUSED.html | 112 - doc/libc/constant.ECONNRESET.html | 112 - doc/libc/constant.EDEADLK.html | 112 - doc/libc/constant.EDESTADDRREQ.html | 112 - doc/libc/constant.EDEVERR.html | 112 - doc/libc/constant.EDOM.html | 112 - doc/libc/constant.EDQUOT.html | 112 - doc/libc/constant.EEXIST.html | 112 - doc/libc/constant.EFAULT.html | 112 - doc/libc/constant.EFBIG.html | 112 - doc/libc/constant.EFTYPE.html | 112 - doc/libc/constant.EHOSTDOWN.html | 112 - doc/libc/constant.EHOSTUNREACH.html | 112 - doc/libc/constant.EIDRM.html | 112 - doc/libc/constant.EILSEQ.html | 112 - doc/libc/constant.EINPROGRESS.html | 112 - doc/libc/constant.EINTR.html | 112 - doc/libc/constant.EINVAL.html | 112 - doc/libc/constant.EIO.html | 112 - doc/libc/constant.EISCONN.html | 112 - doc/libc/constant.EISDIR.html | 112 - doc/libc/constant.ELAST.html | 112 - doc/libc/constant.ELOOP.html | 112 - doc/libc/constant.EMFILE.html | 112 - doc/libc/constant.EMLINK.html | 112 - doc/libc/constant.EMSGSIZE.html | 112 - doc/libc/constant.EMULTIHOP.html | 112 - doc/libc/constant.ENAMETOOLONG.html | 112 - doc/libc/constant.ENEEDAUTH.html | 112 - doc/libc/constant.ENETDOWN.html | 112 - doc/libc/constant.ENETRESET.html | 112 - doc/libc/constant.ENETUNREACH.html | 112 - doc/libc/constant.ENFILE.html | 112 - doc/libc/constant.ENOATTR.html | 112 - doc/libc/constant.ENOBUFS.html | 112 - doc/libc/constant.ENODATA.html | 112 - doc/libc/constant.ENODEV.html | 112 - doc/libc/constant.ENOENT.html | 112 - doc/libc/constant.ENOEXEC.html | 112 - doc/libc/constant.ENOLCK.html | 112 - doc/libc/constant.ENOLINK.html | 112 - doc/libc/constant.ENOMEM.html | 112 - doc/libc/constant.ENOMSG.html | 112 - doc/libc/constant.ENOPOLICY.html | 112 - doc/libc/constant.ENOPROTOOPT.html | 112 - doc/libc/constant.ENOSPC.html | 112 - doc/libc/constant.ENOSR.html | 112 - doc/libc/constant.ENOSTR.html | 112 - doc/libc/constant.ENOSYS.html | 112 - doc/libc/constant.ENOTBLK.html | 112 - doc/libc/constant.ENOTCONN.html | 112 - doc/libc/constant.ENOTDIR.html | 112 - doc/libc/constant.ENOTEMPTY.html | 112 - doc/libc/constant.ENOTRECOVERABLE.html | 112 - doc/libc/constant.ENOTSOCK.html | 112 - doc/libc/constant.ENOTSUP.html | 112 - doc/libc/constant.ENOTTY.html | 112 - doc/libc/constant.ENXIO.html | 112 - doc/libc/constant.EOF.html | 112 - doc/libc/constant.EOPNOTSUPP.html | 112 - doc/libc/constant.EOVERFLOW.html | 112 - doc/libc/constant.EOWNERDEAD.html | 112 - doc/libc/constant.EPERM.html | 112 - doc/libc/constant.EPFNOSUPPORT.html | 112 - doc/libc/constant.EPIPE.html | 112 - doc/libc/constant.EPROCLIM.html | 112 - doc/libc/constant.EPROCUNAVAIL.html | 112 - doc/libc/constant.EPROGMISMATCH.html | 112 - doc/libc/constant.EPROGUNAVAIL.html | 112 - doc/libc/constant.EPROTO.html | 112 - doc/libc/constant.EPROTONOSUPPORT.html | 112 - doc/libc/constant.EPROTOTYPE.html | 112 - doc/libc/constant.EPWROFF.html | 112 - doc/libc/constant.EQFULL.html | 112 - doc/libc/constant.ERA.html | 112 - doc/libc/constant.ERANGE.html | 112 - doc/libc/constant.ERA_D_FMT.html | 112 - doc/libc/constant.ERA_D_T_FMT.html | 112 - doc/libc/constant.ERA_T_FMT.html | 112 - doc/libc/constant.EREMOTE.html | 112 - doc/libc/constant.EROFS.html | 112 - doc/libc/constant.ERPCMISMATCH.html | 112 - doc/libc/constant.ESHLIBVERS.html | 112 - doc/libc/constant.ESHUTDOWN.html | 112 - doc/libc/constant.ESOCKTNOSUPPORT.html | 112 - doc/libc/constant.ESPIPE.html | 112 - doc/libc/constant.ESRCH.html | 112 - doc/libc/constant.ESTALE.html | 112 - doc/libc/constant.ETIME.html | 112 - doc/libc/constant.ETIMEDOUT.html | 112 - doc/libc/constant.ETOOMANYREFS.html | 112 - doc/libc/constant.ETXTBSY.html | 112 - doc/libc/constant.EUSERS.html | 112 - doc/libc/constant.EVFILT_AIO.html | 112 - doc/libc/constant.EVFILT_FS.html | 112 - doc/libc/constant.EVFILT_MACHPORT.html | 112 - doc/libc/constant.EVFILT_PROC.html | 112 - doc/libc/constant.EVFILT_READ.html | 112 - doc/libc/constant.EVFILT_SIGNAL.html | 112 - doc/libc/constant.EVFILT_SYSCOUNT.html | 112 - doc/libc/constant.EVFILT_TIMER.html | 112 - doc/libc/constant.EVFILT_USER.html | 112 - doc/libc/constant.EVFILT_VM.html | 112 - doc/libc/constant.EVFILT_VNODE.html | 112 - doc/libc/constant.EVFILT_WRITE.html | 112 - doc/libc/constant.EV_ADD.html | 112 - doc/libc/constant.EV_CLEAR.html | 112 - doc/libc/constant.EV_DELETE.html | 112 - doc/libc/constant.EV_DISABLE.html | 112 - doc/libc/constant.EV_DISPATCH.html | 112 - doc/libc/constant.EV_ENABLE.html | 112 - doc/libc/constant.EV_EOF.html | 112 - doc/libc/constant.EV_ERROR.html | 112 - doc/libc/constant.EV_FLAG0.html | 112 - doc/libc/constant.EV_FLAG1.html | 112 - doc/libc/constant.EV_ONESHOT.html | 112 - doc/libc/constant.EV_OOBAND.html | 112 - doc/libc/constant.EV_POLL.html | 112 - doc/libc/constant.EV_RECEIPT.html | 112 - doc/libc/constant.EV_SYSFLAGS.html | 112 - doc/libc/constant.EWOULDBLOCK.html | 112 - doc/libc/constant.EXDEV.html | 112 - doc/libc/constant.EXIT_FAILURE.html | 112 - doc/libc/constant.EXIT_SUCCESS.html | 112 - doc/libc/constant.EXTPROC.html | 112 - doc/libc/constant.FD_CLOEXEC.html | 112 - doc/libc/constant.FD_SETSIZE.html | 112 - doc/libc/constant.FF0.html | 112 - doc/libc/constant.FF1.html | 112 - doc/libc/constant.FILENAME_MAX.html | 112 - doc/libc/constant.FIOCLEX.html | 112 - doc/libc/constant.FIONBIO.html | 112 - doc/libc/constant.FLUSHO.html | 112 - doc/libc/constant.FOPEN_MAX.html | 112 - doc/libc/constant.F_ALLOCATEALL.html | 112 - doc/libc/constant.F_ALLOCATECONTIG.html | 112 - doc/libc/constant.F_DUPFD.html | 112 - doc/libc/constant.F_DUPFD_CLOEXEC.html | 112 - doc/libc/constant.F_FREEZE_FS.html | 112 - doc/libc/constant.F_FULLFSYNC.html | 112 - doc/libc/constant.F_GETFD.html | 112 - doc/libc/constant.F_GETFL.html | 112 - doc/libc/constant.F_GETLK.html | 112 - doc/libc/constant.F_GETOWN.html | 112 - doc/libc/constant.F_GETPATH.html | 112 - doc/libc/constant.F_GLOBAL_NOCACHE.html | 112 - doc/libc/constant.F_LOCK.html | 112 - doc/libc/constant.F_NOCACHE.html | 112 - doc/libc/constant.F_NODIRECT.html | 112 - doc/libc/constant.F_OK.html | 112 - doc/libc/constant.F_PEOFPOSMODE.html | 112 - doc/libc/constant.F_PREALLOCATE.html | 112 - doc/libc/constant.F_RDADVISE.html | 112 - doc/libc/constant.F_RDAHEAD.html | 112 - doc/libc/constant.F_SETFD.html | 112 - doc/libc/constant.F_SETFL.html | 112 - doc/libc/constant.F_SETLK.html | 112 - doc/libc/constant.F_SETLKW.html | 112 - doc/libc/constant.F_SETOWN.html | 112 - doc/libc/constant.F_TEST.html | 112 - doc/libc/constant.F_THAW_FS.html | 112 - doc/libc/constant.F_TLOCK.html | 112 - doc/libc/constant.F_ULOCK.html | 112 - doc/libc/constant.F_VOLPOSMODE.html | 112 - doc/libc/constant.GLOB_ABORTED.html | 112 - doc/libc/constant.GLOB_APPEND.html | 112 - doc/libc/constant.GLOB_DOOFFS.html | 112 - doc/libc/constant.GLOB_ERR.html | 112 - doc/libc/constant.GLOB_MARK.html | 112 - doc/libc/constant.GLOB_NOCHECK.html | 112 - doc/libc/constant.GLOB_NOESCAPE.html | 112 - doc/libc/constant.GLOB_NOMATCH.html | 112 - doc/libc/constant.GLOB_NOSORT.html | 112 - doc/libc/constant.GLOB_NOSPACE.html | 112 - doc/libc/constant.GRPQUOTA.html | 112 - doc/libc/constant.HUPCL.html | 112 - doc/libc/constant.HW_AVAILCPU.html | 112 - doc/libc/constant.HW_NCPU.html | 112 - doc/libc/constant.ICANON.html | 112 - doc/libc/constant.ICRNL.html | 112 - doc/libc/constant.IEXTEN.html | 112 - doc/libc/constant.IFF_LOOPBACK.html | 112 - doc/libc/constant.IF_NAMESIZE.html | 112 - doc/libc/constant.IGNBRK.html | 112 - doc/libc/constant.IGNCR.html | 112 - doc/libc/constant.IGNPAR.html | 112 - doc/libc/constant.IMAXBEL.html | 112 - doc/libc/constant.INLCR.html | 112 - doc/libc/constant.INPCK.html | 112 - doc/libc/constant.IPPROTO_IP.html | 112 - doc/libc/constant.IPPROTO_IPV6.html | 112 - doc/libc/constant.IPPROTO_RAW.html | 112 - doc/libc/constant.IPPROTO_TCP.html | 112 - doc/libc/constant.IPV6_JOIN_GROUP.html | 112 - doc/libc/constant.IPV6_LEAVE_GROUP.html | 112 - doc/libc/constant.IPV6_MULTICAST_LOOP.html | 112 - doc/libc/constant.IPV6_V6ONLY.html | 112 - doc/libc/constant.IP_ADD_MEMBERSHIP.html | 112 - doc/libc/constant.IP_DROP_MEMBERSHIP.html | 112 - doc/libc/constant.IP_HDRINCL.html | 112 - doc/libc/constant.IP_MULTICAST_LOOP.html | 112 - doc/libc/constant.IP_MULTICAST_TTL.html | 112 - doc/libc/constant.IP_TTL.html | 112 - doc/libc/constant.ISIG.html | 112 - doc/libc/constant.ISTRIP.html | 112 - doc/libc/constant.IUTF8.html | 112 - doc/libc/constant.IXANY.html | 112 - doc/libc/constant.IXOFF.html | 112 - doc/libc/constant.IXON.html | 112 - doc/libc/constant.LC_ALL.html | 112 - doc/libc/constant.LC_ALL_MASK.html | 117 - doc/libc/constant.LC_COLLATE.html | 112 - doc/libc/constant.LC_COLLATE_MASK.html | 112 - doc/libc/constant.LC_CTYPE.html | 112 - doc/libc/constant.LC_CTYPE_MASK.html | 112 - doc/libc/constant.LC_MESSAGES.html | 112 - doc/libc/constant.LC_MESSAGES_MASK.html | 112 - doc/libc/constant.LC_MONETARY.html | 112 - doc/libc/constant.LC_MONETARY_MASK.html | 112 - doc/libc/constant.LC_NUMERIC.html | 112 - doc/libc/constant.LC_NUMERIC_MASK.html | 112 - doc/libc/constant.LC_TIME.html | 112 - doc/libc/constant.LC_TIME_MASK.html | 112 - doc/libc/constant.LOCK_EX.html | 112 - doc/libc/constant.LOCK_NB.html | 112 - doc/libc/constant.LOCK_SH.html | 112 - doc/libc/constant.LOCK_UN.html | 112 - doc/libc/constant.L_tmpnam.html | 112 - doc/libc/constant.MADV_CAN_REUSE.html | 112 - doc/libc/constant.MADV_DONTNEED.html | 112 - doc/libc/constant.MADV_FREE.html | 112 - doc/libc/constant.MADV_FREE_REUSABLE.html | 112 - doc/libc/constant.MADV_FREE_REUSE.html | 112 - doc/libc/constant.MADV_NORMAL.html | 112 - doc/libc/constant.MADV_RANDOM.html | 112 - doc/libc/constant.MADV_SEQUENTIAL.html | 112 - doc/libc/constant.MADV_WILLNEED.html | 112 - doc/libc/constant.MADV_ZERO_WIRED_PAGES.html | 112 - doc/libc/constant.MAP_ANON.html | 112 - doc/libc/constant.MAP_COPY.html | 112 - doc/libc/constant.MAP_FAILED.html | 112 - doc/libc/constant.MAP_FILE.html | 112 - doc/libc/constant.MAP_FIXED.html | 112 - doc/libc/constant.MAP_HASSEMAPHORE.html | 112 - doc/libc/constant.MAP_JIT.html | 112 - doc/libc/constant.MAP_NOCACHE.html | 112 - doc/libc/constant.MAP_NOEXTEND.html | 112 - doc/libc/constant.MAP_NORESERVE.html | 112 - doc/libc/constant.MAP_PRIVATE.html | 112 - doc/libc/constant.MAP_RENAME.html | 112 - doc/libc/constant.MAP_SHARED.html | 112 - doc/libc/constant.MCL_CURRENT.html | 112 - doc/libc/constant.MCL_FUTURE.html | 112 - doc/libc/constant.MINCORE_INCORE.html | 112 - doc/libc/constant.MINCORE_MODIFIED.html | 112 - doc/libc/constant.MINCORE_MODIFIED_OTHER.html | 112 - doc/libc/constant.MINCORE_REFERENCED.html | 112 - .../constant.MINCORE_REFERENCED_OTHER.html | 112 - doc/libc/constant.MNT_FORCE.html | 112 - doc/libc/constant.MON_1.html | 112 - doc/libc/constant.MON_10.html | 112 - doc/libc/constant.MON_11.html | 112 - doc/libc/constant.MON_12.html | 112 - doc/libc/constant.MON_2.html | 112 - doc/libc/constant.MON_3.html | 112 - doc/libc/constant.MON_4.html | 112 - doc/libc/constant.MON_5.html | 112 - doc/libc/constant.MON_6.html | 112 - doc/libc/constant.MON_7.html | 112 - doc/libc/constant.MON_8.html | 112 - doc/libc/constant.MON_9.html | 112 - doc/libc/constant.MS_ASYNC.html | 112 - doc/libc/constant.MS_DEACTIVATE.html | 112 - doc/libc/constant.MS_INVALIDATE.html | 112 - doc/libc/constant.MS_KILLPAGES.html | 112 - doc/libc/constant.MS_SYNC.html | 112 - doc/libc/constant.NCCS.html | 112 - doc/libc/constant.NI_MAXHOST.html | 112 - doc/libc/constant.NL0.html | 112 - doc/libc/constant.NL1.html | 112 - doc/libc/constant.NOEXPR.html | 112 - doc/libc/constant.NOFLSH.html | 112 - doc/libc/constant.NOSTR.html | 112 - doc/libc/constant.NOTE_ABSOLUTE.html | 112 - doc/libc/constant.NOTE_ATTRIB.html | 112 - doc/libc/constant.NOTE_CHILD.html | 112 - doc/libc/constant.NOTE_DELETE.html | 112 - doc/libc/constant.NOTE_EXEC.html | 112 - doc/libc/constant.NOTE_EXIT.html | 112 - doc/libc/constant.NOTE_EXITSTATUS.html | 112 - doc/libc/constant.NOTE_EXIT_REPARENTED.html | 112 - doc/libc/constant.NOTE_EXTEND.html | 112 - doc/libc/constant.NOTE_FFAND.html | 112 - doc/libc/constant.NOTE_FFCOPY.html | 112 - doc/libc/constant.NOTE_FFCTRLMASK.html | 112 - doc/libc/constant.NOTE_FFLAGSMASK.html | 112 - doc/libc/constant.NOTE_FFNOP.html | 112 - doc/libc/constant.NOTE_FFOR.html | 112 - doc/libc/constant.NOTE_FORK.html | 112 - doc/libc/constant.NOTE_LINK.html | 112 - doc/libc/constant.NOTE_LOWAT.html | 112 - doc/libc/constant.NOTE_NONE.html | 112 - doc/libc/constant.NOTE_NSECONDS.html | 112 - doc/libc/constant.NOTE_PCTRLMASK.html | 112 - doc/libc/constant.NOTE_PDATAMASK.html | 112 - doc/libc/constant.NOTE_REAP.html | 112 - doc/libc/constant.NOTE_RENAME.html | 112 - doc/libc/constant.NOTE_REVOKE.html | 112 - doc/libc/constant.NOTE_SECONDS.html | 112 - doc/libc/constant.NOTE_SIGNAL.html | 112 - doc/libc/constant.NOTE_TRACK.html | 112 - doc/libc/constant.NOTE_TRACKERR.html | 112 - doc/libc/constant.NOTE_TRIGGER.html | 112 - doc/libc/constant.NOTE_USECONDS.html | 112 - doc/libc/constant.NOTE_VM_ERROR.html | 112 - doc/libc/constant.NOTE_VM_PRESSURE.html | 112 - ...ant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html | 112 - .../constant.NOTE_VM_PRESSURE_TERMINATE.html | 112 - doc/libc/constant.NOTE_WRITE.html | 112 - doc/libc/constant.ONLCR.html | 112 - doc/libc/constant.OPOST.html | 112 - doc/libc/constant.O_ACCMODE.html | 112 - doc/libc/constant.O_APPEND.html | 112 - doc/libc/constant.O_ASYNC.html | 112 - doc/libc/constant.O_CLOEXEC.html | 112 - doc/libc/constant.O_CREAT.html | 112 - doc/libc/constant.O_DIRECTORY.html | 112 - doc/libc/constant.O_DSYNC.html | 112 - doc/libc/constant.O_EXCL.html | 112 - doc/libc/constant.O_FSYNC.html | 112 - doc/libc/constant.O_NDELAY.html | 112 - doc/libc/constant.O_NOCTTY.html | 112 - doc/libc/constant.O_NOFOLLOW.html | 112 - doc/libc/constant.O_NONBLOCK.html | 112 - doc/libc/constant.O_RDONLY.html | 112 - doc/libc/constant.O_RDWR.html | 112 - doc/libc/constant.O_SYNC.html | 112 - doc/libc/constant.O_TRUNC.html | 112 - doc/libc/constant.O_WRONLY.html | 112 - doc/libc/constant.PARENB.html | 112 - doc/libc/constant.PARMRK.html | 112 - doc/libc/constant.PARODD.html | 112 - doc/libc/constant.PATH_MAX.html | 112 - doc/libc/constant.PENDIN.html | 112 - doc/libc/constant.PM_STR.html | 112 - doc/libc/constant.POLLERR.html | 112 - doc/libc/constant.POLLHUP.html | 112 - doc/libc/constant.POLLIN.html | 112 - doc/libc/constant.POLLNVAL.html | 112 - doc/libc/constant.POLLOUT.html | 112 - doc/libc/constant.POLLPRI.html | 112 - doc/libc/constant.POSIX_MADV_DONTNEED.html | 112 - doc/libc/constant.POSIX_MADV_NORMAL.html | 112 - doc/libc/constant.POSIX_MADV_RANDOM.html | 112 - doc/libc/constant.POSIX_MADV_SEQUENTIAL.html | 112 - doc/libc/constant.POSIX_MADV_WILLNEED.html | 112 - doc/libc/constant.PROT_EXEC.html | 112 - doc/libc/constant.PROT_NONE.html | 112 - doc/libc/constant.PROT_READ.html | 112 - doc/libc/constant.PROT_WRITE.html | 112 - .../constant.PTHREAD_COND_INITIALIZER.html | 115 - .../constant.PTHREAD_CREATE_DETACHED.html | 112 - .../constant.PTHREAD_CREATE_JOINABLE.html | 112 - .../constant.PTHREAD_MUTEX_INITIALIZER.html | 115 - .../constant.PTHREAD_MUTEX_RECURSIVE.html | 112 - .../constant.PTHREAD_RWLOCK_INITIALIZER.html | 115 - doc/libc/constant.PTHREAD_STACK_MIN.html | 112 - doc/libc/constant.Q_GETQUOTA.html | 112 - doc/libc/constant.Q_QUOTAOFF.html | 112 - doc/libc/constant.Q_QUOTAON.html | 112 - doc/libc/constant.Q_SETQUOTA.html | 112 - doc/libc/constant.Q_SYNC.html | 112 - doc/libc/constant.RADIXCHAR.html | 112 - doc/libc/constant.RAND_MAX.html | 112 - doc/libc/constant.RLIMIT_AS.html | 112 - doc/libc/constant.RLIMIT_CORE.html | 112 - doc/libc/constant.RLIMIT_CPU.html | 112 - doc/libc/constant.RLIMIT_DATA.html | 112 - doc/libc/constant.RLIMIT_FSIZE.html | 112 - doc/libc/constant.RLIMIT_MEMLOCK.html | 112 - doc/libc/constant.RLIMIT_NOFILE.html | 112 - doc/libc/constant.RLIMIT_NPROC.html | 112 - doc/libc/constant.RLIMIT_RSS.html | 112 - doc/libc/constant.RLIMIT_STACK.html | 112 - doc/libc/constant.RLIM_INFINITY.html | 112 - doc/libc/constant.RLIM_NLIMITS.html | 112 - doc/libc/constant.RTLD_DEFAULT.html | 112 - doc/libc/constant.RTLD_FIRST.html | 112 - doc/libc/constant.RTLD_GLOBAL.html | 112 - doc/libc/constant.RTLD_LAZY.html | 112 - doc/libc/constant.RTLD_LOCAL.html | 112 - doc/libc/constant.RTLD_NODELETE.html | 112 - doc/libc/constant.RTLD_NOLOAD.html | 112 - doc/libc/constant.RTLD_NOW.html | 112 - doc/libc/constant.RUSAGE_CHILDREN.html | 112 - doc/libc/constant.RUSAGE_SELF.html | 112 - doc/libc/constant.R_OK.html | 112 - doc/libc/constant.SA_NOCLDSTOP.html | 112 - doc/libc/constant.SA_NOCLDWAIT.html | 112 - doc/libc/constant.SA_NODEFER.html | 112 - doc/libc/constant.SA_ONSTACK.html | 112 - doc/libc/constant.SA_RESETHAND.html | 112 - doc/libc/constant.SA_RESTART.html | 112 - doc/libc/constant.SA_SIGINFO.html | 112 - doc/libc/constant.SEEK_CUR.html | 112 - doc/libc/constant.SEEK_END.html | 112 - doc/libc/constant.SEEK_SET.html | 112 - doc/libc/constant.SHUT_RD.html | 112 - doc/libc/constant.SHUT_RDWR.html | 112 - doc/libc/constant.SHUT_WR.html | 112 - doc/libc/constant.SIGABRT.html | 112 - doc/libc/constant.SIGALRM.html | 112 - doc/libc/constant.SIGBUS.html | 112 - doc/libc/constant.SIGCHLD.html | 112 - doc/libc/constant.SIGCONT.html | 112 - doc/libc/constant.SIGEMT.html | 112 - doc/libc/constant.SIGFPE.html | 112 - doc/libc/constant.SIGHUP.html | 112 - doc/libc/constant.SIGILL.html | 112 - doc/libc/constant.SIGINFO.html | 112 - doc/libc/constant.SIGINT.html | 112 - doc/libc/constant.SIGIO.html | 112 - doc/libc/constant.SIGIOT.html | 112 - doc/libc/constant.SIGKILL.html | 112 - doc/libc/constant.SIGPIPE.html | 112 - doc/libc/constant.SIGPROF.html | 112 - doc/libc/constant.SIGQUIT.html | 112 - doc/libc/constant.SIGSEGV.html | 112 - doc/libc/constant.SIGSTKSZ.html | 112 - doc/libc/constant.SIGSTOP.html | 112 - doc/libc/constant.SIGSYS.html | 112 - doc/libc/constant.SIGTERM.html | 112 - doc/libc/constant.SIGTRAP.html | 112 - doc/libc/constant.SIGTSTP.html | 112 - doc/libc/constant.SIGTTIN.html | 112 - doc/libc/constant.SIGTTOU.html | 112 - doc/libc/constant.SIGURG.html | 112 - doc/libc/constant.SIGUSR1.html | 112 - doc/libc/constant.SIGUSR2.html | 112 - doc/libc/constant.SIGVTALRM.html | 112 - doc/libc/constant.SIGWINCH.html | 112 - doc/libc/constant.SIGXCPU.html | 112 - doc/libc/constant.SIGXFSZ.html | 112 - doc/libc/constant.SIG_BLOCK.html | 112 - doc/libc/constant.SIG_DFL.html | 112 - doc/libc/constant.SIG_ERR.html | 112 - doc/libc/constant.SIG_IGN.html | 112 - doc/libc/constant.SIG_SETMASK.html | 112 - doc/libc/constant.SIG_UNBLOCK.html | 112 - doc/libc/constant.SOCK_DGRAM.html | 112 - doc/libc/constant.SOCK_RAW.html | 112 - doc/libc/constant.SOCK_STREAM.html | 112 - doc/libc/constant.SOL_SOCKET.html | 112 - doc/libc/constant.SO_ACCEPTCONN.html | 112 - doc/libc/constant.SO_BROADCAST.html | 112 - doc/libc/constant.SO_DEBUG.html | 112 - doc/libc/constant.SO_DONTROUTE.html | 112 - doc/libc/constant.SO_DONTTRUNC.html | 112 - doc/libc/constant.SO_ERROR.html | 112 - doc/libc/constant.SO_KEEPALIVE.html | 112 - doc/libc/constant.SO_LINGER.html | 112 - doc/libc/constant.SO_NKE.html | 112 - doc/libc/constant.SO_NOADDRERR.html | 112 - doc/libc/constant.SO_NOSIGPIPE.html | 112 - doc/libc/constant.SO_NREAD.html | 112 - doc/libc/constant.SO_NWRITE.html | 112 - doc/libc/constant.SO_OOBINLINE.html | 112 - doc/libc/constant.SO_RCVBUF.html | 112 - doc/libc/constant.SO_RCVLOWAT.html | 112 - doc/libc/constant.SO_RCVTIMEO.html | 112 - doc/libc/constant.SO_REUSEADDR.html | 112 - doc/libc/constant.SO_REUSEPORT.html | 112 - doc/libc/constant.SO_SNDBUF.html | 112 - doc/libc/constant.SO_SNDLOWAT.html | 112 - doc/libc/constant.SO_SNDTIMEO.html | 112 - doc/libc/constant.SO_TYPE.html | 112 - doc/libc/constant.SO_USELOOPBACK.html | 112 - doc/libc/constant.SO_WANTMORE.html | 112 - doc/libc/constant.SO_WANTOOBFLAG.html | 112 - doc/libc/constant.SS_DISABLE.html | 112 - doc/libc/constant.SS_ONSTACK.html | 112 - doc/libc/constant.STDERR_FILENO.html | 112 - doc/libc/constant.STDIN_FILENO.html | 112 - doc/libc/constant.STDOUT_FILENO.html | 112 - doc/libc/constant.ST_NOSUID.html | 112 - doc/libc/constant.ST_RDONLY.html | 112 - doc/libc/constant.S_IEXEC.html | 112 - doc/libc/constant.S_IFBLK.html | 112 - doc/libc/constant.S_IFCHR.html | 112 - doc/libc/constant.S_IFDIR.html | 112 - doc/libc/constant.S_IFIFO.html | 112 - doc/libc/constant.S_IFLNK.html | 112 - doc/libc/constant.S_IFMT.html | 112 - doc/libc/constant.S_IFREG.html | 112 - doc/libc/constant.S_IFSOCK.html | 112 - doc/libc/constant.S_IREAD.html | 112 - doc/libc/constant.S_IRGRP.html | 112 - doc/libc/constant.S_IROTH.html | 112 - doc/libc/constant.S_IRUSR.html | 112 - doc/libc/constant.S_IRWXG.html | 112 - doc/libc/constant.S_IRWXO.html | 112 - doc/libc/constant.S_IRWXU.html | 112 - doc/libc/constant.S_ISGID.html | 112 - doc/libc/constant.S_ISUID.html | 112 - doc/libc/constant.S_ISVTX.html | 112 - doc/libc/constant.S_IWGRP.html | 112 - doc/libc/constant.S_IWOTH.html | 112 - doc/libc/constant.S_IWRITE.html | 112 - doc/libc/constant.S_IWUSR.html | 112 - doc/libc/constant.S_IXGRP.html | 112 - doc/libc/constant.S_IXOTH.html | 112 - doc/libc/constant.S_IXUSR.html | 112 - doc/libc/constant.TAB0.html | 112 - doc/libc/constant.TAB1.html | 112 - doc/libc/constant.TAB2.html | 112 - doc/libc/constant.TAB3.html | 112 - doc/libc/constant.TCIFLUSH.html | 112 - doc/libc/constant.TCIOFF.html | 112 - doc/libc/constant.TCIOFLUSH.html | 112 - doc/libc/constant.TCION.html | 112 - doc/libc/constant.TCOFLUSH.html | 112 - doc/libc/constant.TCOOFF.html | 112 - doc/libc/constant.TCOON.html | 112 - doc/libc/constant.TCP_KEEPALIVE.html | 112 - doc/libc/constant.TCP_NODELAY.html | 112 - doc/libc/constant.TCSADRAIN.html | 112 - doc/libc/constant.TCSAFLUSH.html | 112 - doc/libc/constant.TCSANOW.html | 112 - doc/libc/constant.THOUSEP.html | 112 - doc/libc/constant.TIOCCBRK.html | 112 - doc/libc/constant.TIOCCDTR.html | 112 - doc/libc/constant.TIOCCONS.html | 112 - doc/libc/constant.TIOCDCDTIMESTAMP.html | 112 - doc/libc/constant.TIOCDRAIN.html | 112 - doc/libc/constant.TIOCDSIMICROCODE.html | 112 - doc/libc/constant.TIOCEXCL.html | 112 - doc/libc/constant.TIOCEXT.html | 112 - doc/libc/constant.TIOCFLUSH.html | 112 - doc/libc/constant.TIOCGDRAINWAIT.html | 112 - doc/libc/constant.TIOCGETD.html | 112 - doc/libc/constant.TIOCGPGRP.html | 112 - doc/libc/constant.TIOCGWINSZ.html | 112 - doc/libc/constant.TIOCIXOFF.html | 112 - doc/libc/constant.TIOCIXON.html | 112 - doc/libc/constant.TIOCMBIC.html | 112 - doc/libc/constant.TIOCMBIS.html | 112 - doc/libc/constant.TIOCMGDTRWAIT.html | 112 - doc/libc/constant.TIOCMGET.html | 112 - doc/libc/constant.TIOCMODG.html | 112 - doc/libc/constant.TIOCMODS.html | 112 - doc/libc/constant.TIOCMSDTRWAIT.html | 112 - doc/libc/constant.TIOCMSET.html | 112 - doc/libc/constant.TIOCM_CAR.html | 112 - doc/libc/constant.TIOCM_CD.html | 112 - doc/libc/constant.TIOCM_CTS.html | 112 - doc/libc/constant.TIOCM_DSR.html | 112 - doc/libc/constant.TIOCM_DTR.html | 112 - doc/libc/constant.TIOCM_LE.html | 112 - doc/libc/constant.TIOCM_RI.html | 112 - doc/libc/constant.TIOCM_RNG.html | 112 - doc/libc/constant.TIOCM_RTS.html | 112 - doc/libc/constant.TIOCM_SR.html | 112 - doc/libc/constant.TIOCM_ST.html | 112 - doc/libc/constant.TIOCNOTTY.html | 112 - doc/libc/constant.TIOCNXCL.html | 112 - doc/libc/constant.TIOCOUTQ.html | 112 - doc/libc/constant.TIOCPKT.html | 112 - doc/libc/constant.TIOCPKT_DATA.html | 112 - doc/libc/constant.TIOCPKT_DOSTOP.html | 112 - doc/libc/constant.TIOCPKT_FLUSHREAD.html | 112 - doc/libc/constant.TIOCPKT_FLUSHWRITE.html | 112 - doc/libc/constant.TIOCPKT_IOCTL.html | 112 - doc/libc/constant.TIOCPKT_NOSTOP.html | 112 - doc/libc/constant.TIOCPKT_START.html | 112 - doc/libc/constant.TIOCPKT_STOP.html | 112 - doc/libc/constant.TIOCPTYGNAME.html | 112 - doc/libc/constant.TIOCPTYGRANT.html | 112 - doc/libc/constant.TIOCPTYUNLK.html | 112 - doc/libc/constant.TIOCREMOTE.html | 112 - doc/libc/constant.TIOCSBRK.html | 112 - doc/libc/constant.TIOCSCONS.html | 112 - doc/libc/constant.TIOCSCTTY.html | 112 - doc/libc/constant.TIOCSDRAINWAIT.html | 112 - doc/libc/constant.TIOCSDTR.html | 112 - doc/libc/constant.TIOCSETD.html | 112 - doc/libc/constant.TIOCSIG.html | 112 - doc/libc/constant.TIOCSPGRP.html | 112 - doc/libc/constant.TIOCSTART.html | 112 - doc/libc/constant.TIOCSTAT.html | 112 - doc/libc/constant.TIOCSTI.html | 112 - doc/libc/constant.TIOCSTOP.html | 112 - doc/libc/constant.TIOCSWINSZ.html | 112 - doc/libc/constant.TIOCTIMESTAMP.html | 112 - doc/libc/constant.TIOCUCNTL.html | 112 - doc/libc/constant.TMP_MAX.html | 112 - doc/libc/constant.TOSTOP.html | 112 - doc/libc/constant.T_FMT.html | 112 - doc/libc/constant.T_FMT_AMPM.html | 112 - doc/libc/constant.USRQUOTA.html | 112 - doc/libc/constant.VDISCARD.html | 112 - doc/libc/constant.VEOF.html | 112 - doc/libc/constant.VEOL.html | 112 - doc/libc/constant.VEOL2.html | 112 - doc/libc/constant.VERASE.html | 112 - doc/libc/constant.VINTR.html | 112 - doc/libc/constant.VKILL.html | 112 - doc/libc/constant.VLNEXT.html | 112 - doc/libc/constant.VMIN.html | 112 - doc/libc/constant.VQUIT.html | 112 - doc/libc/constant.VREPRINT.html | 112 - doc/libc/constant.VSTART.html | 112 - doc/libc/constant.VSTOP.html | 112 - doc/libc/constant.VSUSP.html | 112 - doc/libc/constant.VT0.html | 112 - doc/libc/constant.VT1.html | 112 - doc/libc/constant.VTIME.html | 112 - doc/libc/constant.VWERASE.html | 112 - doc/libc/constant.WNOHANG.html | 112 - doc/libc/constant.W_OK.html | 112 - doc/libc/constant.X_OK.html | 112 - doc/libc/constant.YESEXPR.html | 112 - doc/libc/constant.YESSTR.html | 112 - doc/libc/constant._IOFBF.html | 112 - doc/libc/constant._IOLBF.html | 112 - doc/libc/constant._IONBF.html | 112 - doc/libc/constant._PC_NAME_MAX.html | 112 - doc/libc/constant._PTHREAD_COND_SIG_init.html | 112 - .../constant._PTHREAD_MUTEX_SIG_init.html | 112 - .../constant._PTHREAD_RWLOCK_SIG_init.html | 112 - doc/libc/constant._RLIMIT_POSIX_FLAG.html | 112 - doc/libc/constant._SC_2_CHAR_TERM.html | 112 - doc/libc/constant._SC_2_C_BIND.html | 112 - doc/libc/constant._SC_2_C_DEV.html | 112 - doc/libc/constant._SC_2_FORT_DEV.html | 112 - doc/libc/constant._SC_2_FORT_RUN.html | 112 - doc/libc/constant._SC_2_LOCALEDEF.html | 112 - doc/libc/constant._SC_2_PBS.html | 112 - doc/libc/constant._SC_2_PBS_ACCOUNTING.html | 112 - doc/libc/constant._SC_2_PBS_CHECKPOINT.html | 112 - doc/libc/constant._SC_2_PBS_LOCATE.html | 112 - doc/libc/constant._SC_2_PBS_MESSAGE.html | 112 - doc/libc/constant._SC_2_PBS_TRACK.html | 112 - doc/libc/constant._SC_2_SW_DEV.html | 112 - doc/libc/constant._SC_2_UPE.html | 112 - doc/libc/constant._SC_2_VERSION.html | 112 - doc/libc/constant._SC_ADVISORY_INFO.html | 112 - doc/libc/constant._SC_AIO_LISTIO_MAX.html | 112 - doc/libc/constant._SC_AIO_MAX.html | 112 - doc/libc/constant._SC_AIO_PRIO_DELTA_MAX.html | 112 - doc/libc/constant._SC_ARG_MAX.html | 112 - doc/libc/constant._SC_ASYNCHRONOUS_IO.html | 112 - doc/libc/constant._SC_ATEXIT_MAX.html | 112 - doc/libc/constant._SC_BARRIERS.html | 112 - doc/libc/constant._SC_BC_BASE_MAX.html | 112 - doc/libc/constant._SC_BC_DIM_MAX.html | 112 - doc/libc/constant._SC_BC_SCALE_MAX.html | 112 - doc/libc/constant._SC_BC_STRING_MAX.html | 112 - doc/libc/constant._SC_CHILD_MAX.html | 112 - doc/libc/constant._SC_CLK_TCK.html | 112 - doc/libc/constant._SC_CLOCK_SELECTION.html | 112 - doc/libc/constant._SC_COLL_WEIGHTS_MAX.html | 112 - doc/libc/constant._SC_CPUTIME.html | 112 - doc/libc/constant._SC_DELAYTIMER_MAX.html | 112 - doc/libc/constant._SC_EXPR_NEST_MAX.html | 112 - doc/libc/constant._SC_FILE_LOCKING.html | 112 - doc/libc/constant._SC_FSYNC.html | 112 - doc/libc/constant._SC_GETGR_R_SIZE_MAX.html | 112 - doc/libc/constant._SC_GETPW_R_SIZE_MAX.html | 112 - doc/libc/constant._SC_HOST_NAME_MAX.html | 112 - doc/libc/constant._SC_IOV_MAX.html | 112 - doc/libc/constant._SC_IPV6.html | 112 - doc/libc/constant._SC_JOB_CONTROL.html | 112 - doc/libc/constant._SC_LINE_MAX.html | 112 - doc/libc/constant._SC_LOGIN_NAME_MAX.html | 112 - doc/libc/constant._SC_MAPPED_FILES.html | 112 - doc/libc/constant._SC_MEMLOCK.html | 112 - doc/libc/constant._SC_MEMLOCK_RANGE.html | 112 - doc/libc/constant._SC_MEMORY_PROTECTION.html | 112 - doc/libc/constant._SC_MESSAGE_PASSING.html | 112 - doc/libc/constant._SC_MONOTONIC_CLOCK.html | 112 - doc/libc/constant._SC_MQ_OPEN_MAX.html | 112 - doc/libc/constant._SC_MQ_PRIO_MAX.html | 112 - doc/libc/constant._SC_NGROUPS_MAX.html | 112 - doc/libc/constant._SC_NPROCESSORS_CONF.html | 112 - doc/libc/constant._SC_NPROCESSORS_ONLN.html | 112 - doc/libc/constant._SC_OPEN_MAX.html | 112 - doc/libc/constant._SC_PAGESIZE.html | 112 - doc/libc/constant._SC_PAGE_SIZE.html | 112 - doc/libc/constant._SC_PASS_MAX.html | 112 - doc/libc/constant._SC_PRIORITIZED_IO.html | 112 - .../constant._SC_PRIORITY_SCHEDULING.html | 112 - doc/libc/constant._SC_RAW_SOCKETS.html | 112 - .../constant._SC_READER_WRITER_LOCKS.html | 112 - doc/libc/constant._SC_REALTIME_SIGNALS.html | 112 - doc/libc/constant._SC_REGEXP.html | 112 - doc/libc/constant._SC_RE_DUP_MAX.html | 112 - doc/libc/constant._SC_RTSIG_MAX.html | 112 - doc/libc/constant._SC_SAVED_IDS.html | 112 - doc/libc/constant._SC_SEMAPHORES.html | 112 - doc/libc/constant._SC_SEM_NSEMS_MAX.html | 112 - doc/libc/constant._SC_SEM_VALUE_MAX.html | 112 - .../constant._SC_SHARED_MEMORY_OBJECTS.html | 112 - doc/libc/constant._SC_SHELL.html | 112 - doc/libc/constant._SC_SIGQUEUE_MAX.html | 112 - doc/libc/constant._SC_SPAWN.html | 112 - doc/libc/constant._SC_SPIN_LOCKS.html | 112 - doc/libc/constant._SC_SPORADIC_SERVER.html | 112 - doc/libc/constant._SC_SS_REPL_MAX.html | 112 - doc/libc/constant._SC_STREAM_MAX.html | 112 - doc/libc/constant._SC_SYMLOOP_MAX.html | 112 - doc/libc/constant._SC_SYNCHRONIZED_IO.html | 112 - doc/libc/constant._SC_THREADS.html | 112 - .../constant._SC_THREAD_ATTR_STACKADDR.html | 112 - .../constant._SC_THREAD_ATTR_STACKSIZE.html | 112 - doc/libc/constant._SC_THREAD_CPUTIME.html | 112 - ...tant._SC_THREAD_DESTRUCTOR_ITERATIONS.html | 112 - doc/libc/constant._SC_THREAD_KEYS_MAX.html | 112 - ...nstant._SC_THREAD_PRIORITY_SCHEDULING.html | 112 - .../constant._SC_THREAD_PRIO_INHERIT.html | 112 - .../constant._SC_THREAD_PRIO_PROTECT.html | 112 - .../constant._SC_THREAD_PROCESS_SHARED.html | 112 - .../constant._SC_THREAD_SAFE_FUNCTIONS.html | 112 - .../constant._SC_THREAD_SPORADIC_SERVER.html | 112 - doc/libc/constant._SC_THREAD_STACK_MIN.html | 112 - doc/libc/constant._SC_THREAD_THREADS_MAX.html | 112 - doc/libc/constant._SC_TIMEOUTS.html | 112 - doc/libc/constant._SC_TIMERS.html | 112 - doc/libc/constant._SC_TIMER_MAX.html | 112 - doc/libc/constant._SC_TRACE.html | 112 - doc/libc/constant._SC_TRACE_EVENT_FILTER.html | 112 - .../constant._SC_TRACE_EVENT_NAME_MAX.html | 112 - doc/libc/constant._SC_TRACE_INHERIT.html | 112 - doc/libc/constant._SC_TRACE_LOG.html | 112 - doc/libc/constant._SC_TRACE_NAME_MAX.html | 112 - doc/libc/constant._SC_TRACE_SYS_MAX.html | 112 - .../constant._SC_TRACE_USER_EVENT_MAX.html | 112 - doc/libc/constant._SC_TTY_NAME_MAX.html | 112 - .../constant._SC_TYPED_MEMORY_OBJECTS.html | 112 - doc/libc/constant._SC_TZNAME_MAX.html | 112 - doc/libc/constant._SC_V6_ILP32_OFF32.html | 112 - doc/libc/constant._SC_V6_ILP32_OFFBIG.html | 112 - doc/libc/constant._SC_V6_LP64_OFF64.html | 112 - doc/libc/constant._SC_V6_LPBIG_OFFBIG.html | 112 - doc/libc/constant._SC_VERSION.html | 112 - doc/libc/constant._SC_XBS5_ILP32_OFF32.html | 112 - doc/libc/constant._SC_XBS5_ILP32_OFFBIG.html | 112 - doc/libc/constant._SC_XBS5_LP64_OFF64.html | 112 - doc/libc/constant._SC_XBS5_LPBIG_OFFBIG.html | 112 - doc/libc/constant._SC_XOPEN_CRYPT.html | 112 - doc/libc/constant._SC_XOPEN_ENH_I18N.html | 112 - doc/libc/constant._SC_XOPEN_LEGACY.html | 112 - doc/libc/constant._SC_XOPEN_REALTIME.html | 112 - .../constant._SC_XOPEN_REALTIME_THREADS.html | 112 - doc/libc/constant._SC_XOPEN_SHM.html | 112 - doc/libc/constant._SC_XOPEN_STREAMS.html | 112 - doc/libc/constant._SC_XOPEN_UNIX.html | 112 - doc/libc/constant._SC_XOPEN_VERSION.html | 112 - doc/libc/constant._SC_XOPEN_XCU_VERSION.html | 112 - doc/libc/constant._WSTOPPED.html | 112 - doc/libc/constant.__PTHREAD_COND_SIZE__.html | 112 - doc/libc/constant.__PTHREAD_MUTEX_SIZE__.html | 112 - .../constant.__PTHREAD_RWLOCK_SIZE__.html | 112 - doc/libc/dox/enum.Option.html | 10 - doc/libc/dox/imp/enum.Option.html | 10 - doc/libc/dox/imp/index.html | 0 .../dox/imp/mem/constant.POST_DROP_U32.html | 10 - .../dox/imp/mem/constant.POST_DROP_U64.html | 10 - .../dox/imp/mem/constant.POST_DROP_U8.html | 10 - .../dox/imp/mem/constant.POST_DROP_USIZE.html | 10 - doc/libc/dox/imp/mem/fn.align_of.html | 10 - doc/libc/dox/imp/mem/fn.align_of_val.html | 10 - doc/libc/dox/imp/mem/fn.drop.html | 10 - doc/libc/dox/imp/mem/fn.dropped.html | 10 - doc/libc/dox/imp/mem/fn.forget.html | 10 - doc/libc/dox/imp/mem/fn.min_align_of.html | 10 - doc/libc/dox/imp/mem/fn.min_align_of_val.html | 10 - doc/libc/dox/imp/mem/fn.replace.html | 10 - doc/libc/dox/imp/mem/fn.size_of.html | 10 - doc/libc/dox/imp/mem/fn.size_of_val.html | 10 - doc/libc/dox/imp/mem/fn.swap.html | 10 - doc/libc/dox/imp/mem/fn.transmute.html | 10 - doc/libc/dox/imp/mem/fn.transmute_copy.html | 10 - doc/libc/dox/imp/mem/fn.uninitialized.html | 10 - doc/libc/dox/imp/mem/fn.zeroed.html | 10 - doc/libc/dox/imp/mem/index.html | 10 - doc/libc/dox/imp/mem/sidebar-items.js | 1 - doc/libc/dox/imp/sidebar-items.js | 1 - doc/libc/dox/imp/trait.Clone.html | 10 - doc/libc/dox/imp/trait.Copy.html | 10 - doc/libc/dox/index.html | 0 doc/libc/dox/mem/constant.POST_DROP_U32.html | 10 - doc/libc/dox/mem/constant.POST_DROP_U64.html | 10 - doc/libc/dox/mem/constant.POST_DROP_U8.html | 10 - .../dox/mem/constant.POST_DROP_USIZE.html | 10 - doc/libc/dox/mem/fn.align_of.html | 10 - doc/libc/dox/mem/fn.align_of_val.html | 10 - doc/libc/dox/mem/fn.drop.html | 10 - doc/libc/dox/mem/fn.dropped.html | 10 - doc/libc/dox/mem/fn.forget.html | 10 - doc/libc/dox/mem/fn.min_align_of.html | 10 - doc/libc/dox/mem/fn.min_align_of_val.html | 10 - doc/libc/dox/mem/fn.replace.html | 10 - doc/libc/dox/mem/fn.size_of.html | 10 - doc/libc/dox/mem/fn.size_of_val.html | 10 - doc/libc/dox/mem/fn.swap.html | 10 - doc/libc/dox/mem/fn.transmute.html | 10 - doc/libc/dox/mem/fn.transmute_copy.html | 10 - doc/libc/dox/mem/fn.uninitialized.html | 10 - doc/libc/dox/mem/fn.zeroed.html | 10 - doc/libc/dox/mem/index.html | 10 - doc/libc/dox/mem/sidebar-items.js | 1 - doc/libc/dox/sidebar-items.js | 1 - doc/libc/dox/trait.Clone.html | 10 - doc/libc/dox/trait.Copy.html | 10 - doc/libc/enum.DIR.html | 112 - doc/libc/enum.FILE.html | 112 - doc/libc/enum.c_void.html | 114 - doc/libc/enum.fpos_t.html | 112 - doc/libc/enum.locale_t.html | 112 - doc/libc/enum.timezone.html | 112 - doc/libc/fn.FD_CLR.html | 112 - doc/libc/fn.FD_ISSET.html | 112 - doc/libc/fn.FD_SET.html | 112 - doc/libc/fn.FD_ZERO.html | 112 - doc/libc/fn.WCOREDUMP.html | 112 - doc/libc/fn.WEXITSTATUS.html | 112 - doc/libc/fn.WIFCONTINUED.html | 112 - doc/libc/fn.WIFEXITED.html | 112 - doc/libc/fn.WIFSIGNALED.html | 112 - doc/libc/fn.WIFSTOPPED.html | 112 - doc/libc/fn.WSTOPSIG.html | 112 - doc/libc/fn.WTERMSIG.html | 112 - doc/libc/fn._WSTATUS.html | 112 - doc/libc/fn.__error.html | 112 - doc/libc/fn._exit.html | 112 - doc/libc/fn.abort.html | 112 - doc/libc/fn.abs.html | 112 - doc/libc/fn.accept.html | 112 - doc/libc/fn.access.html | 112 - doc/libc/fn.alarm.html | 112 - doc/libc/fn.atexit.html | 112 - doc/libc/fn.atof.html | 112 - doc/libc/fn.atoi.html | 112 - doc/libc/fn.backtrace.html | 112 - doc/libc/fn.bind.html | 112 - doc/libc/fn.calloc.html | 112 - doc/libc/fn.cfgetispeed.html | 112 - doc/libc/fn.cfgetospeed.html | 112 - doc/libc/fn.cfsetispeed.html | 112 - doc/libc/fn.cfsetospeed.html | 112 - doc/libc/fn.chdir.html | 112 - doc/libc/fn.chmod.html | 112 - doc/libc/fn.chown.html | 112 - doc/libc/fn.chroot.html | 112 - doc/libc/fn.close.html | 112 - doc/libc/fn.closedir.html | 112 - doc/libc/fn.connect.html | 112 - doc/libc/fn.creat.html | 112 - doc/libc/fn.daemon.html | 112 - doc/libc/fn.dladdr.html | 112 - doc/libc/fn.dlclose.html | 112 - doc/libc/fn.dlerror.html | 112 - doc/libc/fn.dlopen.html | 112 - doc/libc/fn.dlsym.html | 112 - doc/libc/fn.dup.html | 112 - doc/libc/fn.dup2.html | 112 - doc/libc/fn.duplocale.html | 112 - doc/libc/fn.execv.html | 112 - doc/libc/fn.execve.html | 112 - doc/libc/fn.execvp.html | 112 - doc/libc/fn.exit.html | 112 - doc/libc/fn.fchmod.html | 112 - doc/libc/fn.fclose.html | 112 - doc/libc/fn.fcntl.html | 112 - doc/libc/fn.fdopen.html | 112 - doc/libc/fn.feof.html | 112 - doc/libc/fn.ferror.html | 112 - doc/libc/fn.fflush.html | 112 - doc/libc/fn.fgetc.html | 112 - doc/libc/fn.fgetpos.html | 112 - doc/libc/fn.fgets.html | 112 - doc/libc/fn.fileno.html | 112 - doc/libc/fn.flock.html | 112 - doc/libc/fn.fopen.html | 112 - doc/libc/fn.fork.html | 112 - doc/libc/fn.forkpty.html | 112 - doc/libc/fn.fpathconf.html | 112 - doc/libc/fn.fprintf.html | 112 - doc/libc/fn.fputc.html | 112 - doc/libc/fn.fputs.html | 112 - doc/libc/fn.fread.html | 112 - doc/libc/fn.free.html | 112 - doc/libc/fn.freeaddrinfo.html | 112 - doc/libc/fn.freeifaddrs.html | 112 - doc/libc/fn.freelocale.html | 112 - doc/libc/fn.freopen.html | 112 - doc/libc/fn.fscanf.html | 112 - doc/libc/fn.fseek.html | 112 - doc/libc/fn.fseeko.html | 112 - doc/libc/fn.fsetpos.html | 112 - doc/libc/fn.fstat.html | 112 - doc/libc/fn.fstatfs.html | 112 - doc/libc/fn.fstatvfs.html | 112 - doc/libc/fn.fsync.html | 112 - doc/libc/fn.ftell.html | 112 - doc/libc/fn.ftello.html | 112 - doc/libc/fn.ftruncate.html | 112 - doc/libc/fn.futimes.html | 112 - doc/libc/fn.fwrite.html | 112 - doc/libc/fn.gai_strerror.html | 112 - doc/libc/fn.getaddrinfo.html | 112 - doc/libc/fn.getcwd.html | 112 - doc/libc/fn.getdtablesize.html | 112 - doc/libc/fn.getegid.html | 112 - doc/libc/fn.getenv.html | 112 - doc/libc/fn.geteuid.html | 112 - doc/libc/fn.getgid.html | 112 - doc/libc/fn.getgroups.html | 112 - doc/libc/fn.gethostname.html | 112 - doc/libc/fn.getifaddrs.html | 112 - doc/libc/fn.getlogin.html | 112 - doc/libc/fn.getnameinfo.html | 112 - doc/libc/fn.getopt.html | 112 - doc/libc/fn.getpeername.html | 112 - doc/libc/fn.getpgrp.html | 112 - doc/libc/fn.getpid.html | 112 - doc/libc/fn.getppid.html | 112 - doc/libc/fn.getpwuid_r.html | 112 - doc/libc/fn.getrlimit.html | 112 - doc/libc/fn.getrusage.html | 112 - doc/libc/fn.getsid.html | 112 - doc/libc/fn.getsockname.html | 112 - doc/libc/fn.getsockopt.html | 112 - doc/libc/fn.gettimeofday.html | 112 - doc/libc/fn.getuid.html | 112 - doc/libc/fn.glob.html | 112 - doc/libc/fn.globfree.html | 112 - doc/libc/fn.gmtime_r.html | 112 - doc/libc/fn.if_indextoname.html | 112 - doc/libc/fn.if_nametoindex.html | 112 - doc/libc/fn.ioctl.html | 112 - doc/libc/fn.isalnum.html | 112 - doc/libc/fn.isalpha.html | 112 - doc/libc/fn.isatty.html | 112 - doc/libc/fn.iscntrl.html | 112 - doc/libc/fn.isdigit.html | 112 - doc/libc/fn.isgraph.html | 112 - doc/libc/fn.islower.html | 112 - doc/libc/fn.isprint.html | 112 - doc/libc/fn.ispunct.html | 112 - doc/libc/fn.isspace.html | 112 - doc/libc/fn.isupper.html | 112 - doc/libc/fn.isxdigit.html | 112 - doc/libc/fn.kevent.html | 112 - doc/libc/fn.kevent64.html | 112 - doc/libc/fn.kill.html | 112 - doc/libc/fn.kqueue.html | 112 - doc/libc/fn.labs.html | 112 - doc/libc/fn.link.html | 112 - doc/libc/fn.listen.html | 112 - doc/libc/fn.localeconv.html | 112 - doc/libc/fn.localeconv_l.html | 112 - doc/libc/fn.localtime_r.html | 112 - doc/libc/fn.lseek.html | 112 - doc/libc/fn.lstat.html | 112 - doc/libc/fn.mach_absolute_time.html | 112 - doc/libc/fn.mach_timebase_info.html | 112 - doc/libc/fn.madvise.html | 112 - doc/libc/fn.malloc.html | 112 - doc/libc/fn.memchr.html | 112 - doc/libc/fn.memcmp.html | 112 - doc/libc/fn.mincore.html | 112 - doc/libc/fn.mkdir.html | 112 - doc/libc/fn.mkdtemp.html | 112 - doc/libc/fn.mkfifo.html | 112 - doc/libc/fn.mknod.html | 112 - doc/libc/fn.mkstemp.html | 112 - doc/libc/fn.mkstemps.html | 112 - doc/libc/fn.mktime.html | 112 - doc/libc/fn.mlock.html | 112 - doc/libc/fn.mlockall.html | 112 - doc/libc/fn.mmap.html | 112 - doc/libc/fn.mount.html | 112 - doc/libc/fn.mprotect.html | 112 - doc/libc/fn.msync.html | 112 - doc/libc/fn.munlock.html | 112 - doc/libc/fn.munlockall.html | 112 - doc/libc/fn.munmap.html | 112 - doc/libc/fn.nanosleep.html | 112 - doc/libc/fn.newlocale.html | 112 - doc/libc/fn.nl_langinfo.html | 112 - doc/libc/fn.open.html | 112 - doc/libc/fn.opendir.html | 112 - doc/libc/fn.openpty.html | 112 - doc/libc/fn.pathconf.html | 112 - doc/libc/fn.pause.html | 112 - doc/libc/fn.pclose.html | 112 - doc/libc/fn.perror.html | 112 - doc/libc/fn.pipe.html | 112 - doc/libc/fn.poll.html | 112 - doc/libc/fn.popen.html | 112 - doc/libc/fn.posix_madvise.html | 112 - doc/libc/fn.posix_memalign.html | 112 - doc/libc/fn.pread.html | 112 - doc/libc/fn.printf.html | 112 - doc/libc/fn.pselect.html | 112 - doc/libc/fn.pthread_attr_destroy.html | 112 - doc/libc/fn.pthread_attr_init.html | 112 - doc/libc/fn.pthread_attr_setdetachstate.html | 112 - doc/libc/fn.pthread_attr_setstacksize.html | 112 - doc/libc/fn.pthread_cond_broadcast.html | 112 - doc/libc/fn.pthread_cond_destroy.html | 112 - doc/libc/fn.pthread_cond_signal.html | 112 - doc/libc/fn.pthread_cond_timedwait.html | 112 - doc/libc/fn.pthread_cond_wait.html | 112 - doc/libc/fn.pthread_create.html | 112 - doc/libc/fn.pthread_detach.html | 112 - doc/libc/fn.pthread_get_stackaddr_np.html | 112 - doc/libc/fn.pthread_get_stacksize_np.html | 112 - doc/libc/fn.pthread_getspecific.html | 112 - doc/libc/fn.pthread_join.html | 112 - doc/libc/fn.pthread_key_create.html | 112 - doc/libc/fn.pthread_key_delete.html | 112 - doc/libc/fn.pthread_kill.html | 112 - doc/libc/fn.pthread_mutex_destroy.html | 112 - doc/libc/fn.pthread_mutex_init.html | 112 - doc/libc/fn.pthread_mutex_lock.html | 112 - doc/libc/fn.pthread_mutex_trylock.html | 112 - doc/libc/fn.pthread_mutex_unlock.html | 112 - doc/libc/fn.pthread_mutexattr_destroy.html | 112 - doc/libc/fn.pthread_mutexattr_init.html | 112 - doc/libc/fn.pthread_mutexattr_settype.html | 112 - doc/libc/fn.pthread_rwlock_destroy.html | 112 - doc/libc/fn.pthread_rwlock_rdlock.html | 112 - doc/libc/fn.pthread_rwlock_tryrdlock.html | 112 - doc/libc/fn.pthread_rwlock_trywrlock.html | 112 - doc/libc/fn.pthread_rwlock_unlock.html | 112 - doc/libc/fn.pthread_rwlock_wrlock.html | 112 - doc/libc/fn.pthread_self.html | 112 - doc/libc/fn.pthread_setname_np.html | 112 - doc/libc/fn.pthread_setspecific.html | 112 - doc/libc/fn.pthread_sigmask.html | 112 - doc/libc/fn.ptrace.html | 112 - doc/libc/fn.putenv.html | 112 - doc/libc/fn.puts.html | 112 - doc/libc/fn.pwrite.html | 112 - doc/libc/fn.querylocale.html | 112 - doc/libc/fn.quotactl.html | 112 - doc/libc/fn.raise.html | 112 - doc/libc/fn.rand.html | 112 - doc/libc/fn.read.html | 112 - doc/libc/fn.readdir_r.html | 112 - doc/libc/fn.readlink.html | 112 - doc/libc/fn.readv.html | 112 - doc/libc/fn.realloc.html | 112 - doc/libc/fn.realpath.html | 112 - doc/libc/fn.recv.html | 112 - doc/libc/fn.recvfrom.html | 112 - doc/libc/fn.recvmsg.html | 112 - doc/libc/fn.remove.html | 112 - doc/libc/fn.rename.html | 112 - doc/libc/fn.rewind.html | 112 - doc/libc/fn.rewinddir.html | 112 - doc/libc/fn.rmdir.html | 112 - doc/libc/fn.scanf.html | 112 - doc/libc/fn.sched_yield.html | 112 - doc/libc/fn.seekdir.html | 112 - doc/libc/fn.select.html | 112 - doc/libc/fn.send.html | 112 - doc/libc/fn.sendfile.html | 112 - doc/libc/fn.sendmsg.html | 112 - doc/libc/fn.sendto.html | 112 - doc/libc/fn.setbuf.html | 112 - doc/libc/fn.setenv.html | 112 - doc/libc/fn.setgid.html | 112 - doc/libc/fn.setgroups.html | 112 - doc/libc/fn.sethostname.html | 112 - doc/libc/fn.setlocale.html | 112 - doc/libc/fn.setpgid.html | 112 - doc/libc/fn.setrlimit.html | 112 - doc/libc/fn.setsid.html | 112 - doc/libc/fn.setsockopt.html | 112 - doc/libc/fn.setuid.html | 112 - doc/libc/fn.setvbuf.html | 112 - doc/libc/fn.shm_open.html | 112 - doc/libc/fn.shm_unlink.html | 112 - doc/libc/fn.shutdown.html | 112 - doc/libc/fn.sigaction.html | 112 - doc/libc/fn.sigaddset.html | 112 - doc/libc/fn.sigaltstack.html | 112 - doc/libc/fn.sigdelset.html | 112 - doc/libc/fn.sigemptyset.html | 112 - doc/libc/fn.sigfillset.html | 112 - doc/libc/fn.sigismember.html | 112 - doc/libc/fn.signal.html | 112 - doc/libc/fn.sigwait.html | 112 - doc/libc/fn.sleep.html | 112 - doc/libc/fn.snprintf.html | 112 - doc/libc/fn.socket.html | 112 - doc/libc/fn.socketpair.html | 112 - doc/libc/fn.sprintf.html | 112 - doc/libc/fn.srand.html | 112 - doc/libc/fn.sscanf.html | 112 - doc/libc/fn.stat.html | 112 - doc/libc/fn.statfs.html | 112 - doc/libc/fn.statvfs.html | 112 - doc/libc/fn.strcat.html | 112 - doc/libc/fn.strchr.html | 112 - doc/libc/fn.strcmp.html | 112 - doc/libc/fn.strcoll.html | 112 - doc/libc/fn.strcpy.html | 112 - doc/libc/fn.strcspn.html | 112 - doc/libc/fn.strerror.html | 112 - doc/libc/fn.strerror_r.html | 112 - doc/libc/fn.strlen.html | 112 - doc/libc/fn.strncat.html | 112 - doc/libc/fn.strncmp.html | 112 - doc/libc/fn.strncpy.html | 112 - doc/libc/fn.strpbrk.html | 112 - doc/libc/fn.strrchr.html | 112 - doc/libc/fn.strspn.html | 112 - doc/libc/fn.strstr.html | 112 - doc/libc/fn.strtod.html | 112 - doc/libc/fn.strtok.html | 112 - doc/libc/fn.strtol.html | 112 - doc/libc/fn.strtoul.html | 112 - doc/libc/fn.strxfrm.html | 112 - doc/libc/fn.symlink.html | 112 - doc/libc/fn.syscall.html | 112 - doc/libc/fn.sysconf.html | 112 - doc/libc/fn.sysctl.html | 112 - doc/libc/fn.sysctlbyname.html | 112 - doc/libc/fn.sysctlnametomib.html | 112 - doc/libc/fn.system.html | 112 - doc/libc/fn.tcdrain.html | 112 - doc/libc/fn.tcflow.html | 112 - doc/libc/fn.tcflush.html | 112 - doc/libc/fn.tcgetattr.html | 112 - doc/libc/fn.tcgetpgrp.html | 112 - doc/libc/fn.tcsendbreak.html | 112 - doc/libc/fn.tcsetattr.html | 112 - doc/libc/fn.telldir.html | 112 - doc/libc/fn.timegm.html | 112 - doc/libc/fn.tmpfile.html | 112 - doc/libc/fn.tolower.html | 112 - doc/libc/fn.toupper.html | 112 - doc/libc/fn.ttyname.html | 112 - doc/libc/fn.umask.html | 112 - doc/libc/fn.uname.html | 112 - doc/libc/fn.ungetc.html | 112 - doc/libc/fn.unlink.html | 112 - doc/libc/fn.unmount.html | 112 - doc/libc/fn.unsetenv.html | 112 - doc/libc/fn.uselocale.html | 112 - doc/libc/fn.usleep.html | 112 - doc/libc/fn.utime.html | 112 - doc/libc/fn.utimes.html | 112 - doc/libc/fn.wait.html | 112 - doc/libc/fn.waitpid.html | 112 - doc/libc/fn.wcslen.html | 112 - doc/libc/fn.write.html | 112 - doc/libc/fn.writev.html | 112 - doc/libc/index.html | 9260 ------------- doc/libc/macros/index.html | 0 doc/libc/macros/sidebar-items.js | 1 - doc/libc/sidebar-items.js | 1 - doc/libc/struct.Dl_info.html | 124 - doc/libc/struct.addrinfo.html | 132 - doc/libc/struct.dirent.html | 128 - doc/libc/struct.dqblk.html | 136 - doc/libc/struct.fd_set.html | 116 - doc/libc/struct.flock.html | 126 - doc/libc/struct.fsid_t.html | 116 - doc/libc/struct.fstore_t.html | 126 - doc/libc/struct.glob_t.html | 123 - doc/libc/struct.hostent.html | 126 - doc/libc/struct.ifaddrs.html | 130 - doc/libc/struct.in6_addr.html | 119 - doc/libc/struct.in_addr.html | 118 - doc/libc/struct.iovec.html | 120 - doc/libc/struct.ip_mreq.html | 120 - doc/libc/struct.ipv6_mreq.html | 120 - doc/libc/struct.kevent.html | 128 - doc/libc/struct.kevent64_s.html | 130 - doc/libc/struct.lconv.html | 164 - doc/libc/struct.mach_timebase_info.html | 120 - doc/libc/struct.msghdr.html | 130 - doc/libc/struct.passwd.html | 136 - doc/libc/struct.pollfd.html | 122 - doc/libc/struct.pthread_attr_t.html | 116 - doc/libc/struct.pthread_cond_t.html | 116 - doc/libc/struct.pthread_mutex_t.html | 116 - doc/libc/struct.pthread_mutexattr_t.html | 116 - doc/libc/struct.pthread_rwlock_t.html | 116 - doc/libc/struct.radvisory.html | 120 - doc/libc/struct.rlimit.html | 120 - doc/libc/struct.rusage.html | 148 - doc/libc/struct.sf_hdtr.html | 124 - doc/libc/struct.sigaction.html | 122 - doc/libc/struct.siginfo_t.html | 131 - doc/libc/struct.sockaddr.html | 122 - doc/libc/struct.sockaddr_in.html | 126 - doc/libc/struct.sockaddr_in6.html | 128 - doc/libc/struct.sockaddr_storage.html | 121 - doc/libc/struct.sockaddr_un.html | 122 - doc/libc/struct.stack_t.html | 122 - doc/libc/struct.stat.html | 160 - doc/libc/struct.statfs.html | 148 - doc/libc/struct.statvfs.html | 138 - doc/libc/struct.termios.html | 130 - doc/libc/struct.timespec.html | 120 - doc/libc/struct.timeval.html | 120 - doc/libc/struct.tm.html | 138 - doc/libc/struct.utimbuf.html | 120 - doc/libc/struct.utsname.html | 126 - doc/libc/struct.winsize.html | 124 - doc/libc/type.blkcnt_t.html | 112 - doc/libc/type.blksize_t.html | 112 - doc/libc/type.c_char.html | 112 - doc/libc/type.c_double.html | 112 - doc/libc/type.c_float.html | 112 - doc/libc/type.c_int.html | 112 - doc/libc/type.c_long.html | 112 - doc/libc/type.c_longlong.html | 112 - doc/libc/type.c_schar.html | 112 - doc/libc/type.c_short.html | 112 - doc/libc/type.c_uchar.html | 112 - doc/libc/type.c_uint.html | 112 - doc/libc/type.c_ulong.html | 112 - doc/libc/type.c_ulonglong.html | 112 - doc/libc/type.c_ushort.html | 112 - doc/libc/type.cc_t.html | 112 - doc/libc/type.clock_t.html | 112 - doc/libc/type.dev_t.html | 112 - doc/libc/type.fsblkcnt_t.html | 112 - doc/libc/type.fsfilcnt_t.html | 112 - doc/libc/type.gid_t.html | 112 - doc/libc/type.in_addr_t.html | 112 - doc/libc/type.in_port_t.html | 112 - doc/libc/type.ino_t.html | 112 - doc/libc/type.int16_t.html | 112 - doc/libc/type.int32_t.html | 112 - doc/libc/type.int64_t.html | 112 - doc/libc/type.int8_t.html | 112 - doc/libc/type.intmax_t.html | 112 - doc/libc/type.intptr_t.html | 112 - doc/libc/type.mach_timebase_info_data_t.html | 112 - doc/libc/type.mode_t.html | 112 - doc/libc/type.nfds_t.html | 112 - doc/libc/type.nl_item.html | 112 - doc/libc/type.nlink_t.html | 112 - doc/libc/type.off_t.html | 112 - doc/libc/type.pid_t.html | 112 - doc/libc/type.pthread_key_t.html | 112 - doc/libc/type.pthread_t.html | 112 - doc/libc/type.ptrdiff_t.html | 112 - doc/libc/type.rlim_t.html | 112 - doc/libc/type.sa_family_t.html | 112 - doc/libc/type.sighandler_t.html | 112 - doc/libc/type.sigset_t.html | 112 - doc/libc/type.size_t.html | 112 - doc/libc/type.socklen_t.html | 112 - doc/libc/type.speed_t.html | 112 - doc/libc/type.ssize_t.html | 112 - doc/libc/type.suseconds_t.html | 112 - doc/libc/type.tcflag_t.html | 112 - doc/libc/type.time_t.html | 112 - doc/libc/type.uid_t.html | 112 - doc/libc/type.uint16_t.html | 112 - doc/libc/type.uint32_t.html | 112 - doc/libc/type.uint64_t.html | 112 - doc/libc/type.uint8_t.html | 112 - doc/libc/type.uintmax_t.html | 112 - doc/libc/type.uintptr_t.html | 112 - doc/libc/type.useconds_t.html | 112 - doc/libc/type.wchar_t.html | 112 - .../apple/b64/constant.TIOCDCDTIMESTAMP.html | 0 .../apple/b64/constant.TIOCTIMESTAMP.html | 0 .../b64/constant.__PTHREAD_COND_SIZE__.html | 0 .../b64/constant.__PTHREAD_MUTEX_SIZE__.html | 0 .../b64/constant.__PTHREAD_RWLOCK_SIZE__.html | 0 doc/libc/unix/apple/b64/index.html | 0 doc/libc/unix/apple/b64/sidebar-items.js | 1 - .../unix/apple/b64/struct.pthread_attr_t.html | 10 - doc/libc/unix/apple/b64/type.c_long.html | 10 - doc/libc/unix/apple/b64/type.c_ulong.html | 10 - doc/libc/unix/apple/constant.ABDAY_1.html | 0 doc/libc/unix/apple/constant.ABDAY_2.html | 0 doc/libc/unix/apple/constant.ABDAY_3.html | 0 doc/libc/unix/apple/constant.ABDAY_4.html | 0 doc/libc/unix/apple/constant.ABDAY_5.html | 0 doc/libc/unix/apple/constant.ABDAY_6.html | 0 doc/libc/unix/apple/constant.ABDAY_7.html | 0 doc/libc/unix/apple/constant.ABMON_1.html | 0 doc/libc/unix/apple/constant.ABMON_10.html | 0 doc/libc/unix/apple/constant.ABMON_11.html | 0 doc/libc/unix/apple/constant.ABMON_12.html | 0 doc/libc/unix/apple/constant.ABMON_2.html | 0 doc/libc/unix/apple/constant.ABMON_3.html | 0 doc/libc/unix/apple/constant.ABMON_4.html | 0 doc/libc/unix/apple/constant.ABMON_5.html | 0 doc/libc/unix/apple/constant.ABMON_6.html | 0 doc/libc/unix/apple/constant.ABMON_7.html | 0 doc/libc/unix/apple/constant.ABMON_8.html | 0 doc/libc/unix/apple/constant.ABMON_9.html | 0 doc/libc/unix/apple/constant.AF_INET.html | 0 doc/libc/unix/apple/constant.AF_INET6.html | 0 doc/libc/unix/apple/constant.AF_UNIX.html | 0 doc/libc/unix/apple/constant.ALT_DIGITS.html | 0 doc/libc/unix/apple/constant.AM_STR.html | 0 doc/libc/unix/apple/constant.BS0.html | 0 doc/libc/unix/apple/constant.BS1.html | 0 doc/libc/unix/apple/constant.BUFSIZ.html | 0 doc/libc/unix/apple/constant.CODESET.html | 0 doc/libc/unix/apple/constant.CR0.html | 0 doc/libc/unix/apple/constant.CR1.html | 0 doc/libc/unix/apple/constant.CR2.html | 0 doc/libc/unix/apple/constant.CR3.html | 0 doc/libc/unix/apple/constant.CRNCYSTR.html | 0 doc/libc/unix/apple/constant.CRTSCTS.html | 0 doc/libc/unix/apple/constant.DAY_1.html | 0 doc/libc/unix/apple/constant.DAY_2.html | 0 doc/libc/unix/apple/constant.DAY_3.html | 0 doc/libc/unix/apple/constant.DAY_4.html | 0 doc/libc/unix/apple/constant.DAY_5.html | 0 doc/libc/unix/apple/constant.DAY_6.html | 0 doc/libc/unix/apple/constant.DAY_7.html | 0 doc/libc/unix/apple/constant.D_FMT.html | 0 doc/libc/unix/apple/constant.D_MD_ORDER.html | 0 doc/libc/unix/apple/constant.D_T_FMT.html | 0 doc/libc/unix/apple/constant.E2BIG.html | 0 doc/libc/unix/apple/constant.EACCES.html | 0 doc/libc/unix/apple/constant.EADDRINUSE.html | 0 .../unix/apple/constant.EADDRNOTAVAIL.html | 0 .../unix/apple/constant.EAFNOSUPPORT.html | 0 doc/libc/unix/apple/constant.EAGAIN.html | 0 doc/libc/unix/apple/constant.EALREADY.html | 0 doc/libc/unix/apple/constant.EAUTH.html | 0 doc/libc/unix/apple/constant.EBADARCH.html | 0 doc/libc/unix/apple/constant.EBADEXEC.html | 0 doc/libc/unix/apple/constant.EBADF.html | 0 doc/libc/unix/apple/constant.EBADMACHO.html | 0 doc/libc/unix/apple/constant.EBADMSG.html | 0 doc/libc/unix/apple/constant.EBADRPC.html | 0 doc/libc/unix/apple/constant.EBUSY.html | 0 doc/libc/unix/apple/constant.ECANCELED.html | 0 doc/libc/unix/apple/constant.ECHILD.html | 0 .../unix/apple/constant.ECONNABORTED.html | 0 .../unix/apple/constant.ECONNREFUSED.html | 0 doc/libc/unix/apple/constant.ECONNRESET.html | 0 doc/libc/unix/apple/constant.EDEADLK.html | 0 .../unix/apple/constant.EDESTADDRREQ.html | 0 doc/libc/unix/apple/constant.EDEVERR.html | 0 doc/libc/unix/apple/constant.EDOM.html | 0 doc/libc/unix/apple/constant.EDQUOT.html | 0 doc/libc/unix/apple/constant.EEXIST.html | 0 doc/libc/unix/apple/constant.EFAULT.html | 0 doc/libc/unix/apple/constant.EFBIG.html | 0 doc/libc/unix/apple/constant.EFTYPE.html | 0 doc/libc/unix/apple/constant.EHOSTDOWN.html | 0 .../unix/apple/constant.EHOSTUNREACH.html | 0 doc/libc/unix/apple/constant.EIDRM.html | 0 doc/libc/unix/apple/constant.EILSEQ.html | 0 doc/libc/unix/apple/constant.EINPROGRESS.html | 0 doc/libc/unix/apple/constant.EINTR.html | 0 doc/libc/unix/apple/constant.EINVAL.html | 0 doc/libc/unix/apple/constant.EIO.html | 0 doc/libc/unix/apple/constant.EISCONN.html | 0 doc/libc/unix/apple/constant.EISDIR.html | 0 doc/libc/unix/apple/constant.ELAST.html | 0 doc/libc/unix/apple/constant.ELOOP.html | 0 doc/libc/unix/apple/constant.EMFILE.html | 0 doc/libc/unix/apple/constant.EMLINK.html | 0 doc/libc/unix/apple/constant.EMSGSIZE.html | 0 doc/libc/unix/apple/constant.EMULTIHOP.html | 0 .../unix/apple/constant.ENAMETOOLONG.html | 0 doc/libc/unix/apple/constant.ENEEDAUTH.html | 0 doc/libc/unix/apple/constant.ENETDOWN.html | 0 doc/libc/unix/apple/constant.ENETRESET.html | 0 doc/libc/unix/apple/constant.ENETUNREACH.html | 0 doc/libc/unix/apple/constant.ENFILE.html | 0 doc/libc/unix/apple/constant.ENOATTR.html | 0 doc/libc/unix/apple/constant.ENOBUFS.html | 0 doc/libc/unix/apple/constant.ENODATA.html | 0 doc/libc/unix/apple/constant.ENODEV.html | 0 doc/libc/unix/apple/constant.ENOENT.html | 0 doc/libc/unix/apple/constant.ENOEXEC.html | 0 doc/libc/unix/apple/constant.ENOLCK.html | 0 doc/libc/unix/apple/constant.ENOLINK.html | 0 doc/libc/unix/apple/constant.ENOMEM.html | 0 doc/libc/unix/apple/constant.ENOMSG.html | 0 doc/libc/unix/apple/constant.ENOPOLICY.html | 0 doc/libc/unix/apple/constant.ENOPROTOOPT.html | 0 doc/libc/unix/apple/constant.ENOSPC.html | 0 doc/libc/unix/apple/constant.ENOSR.html | 0 doc/libc/unix/apple/constant.ENOSTR.html | 0 doc/libc/unix/apple/constant.ENOSYS.html | 0 doc/libc/unix/apple/constant.ENOTBLK.html | 0 doc/libc/unix/apple/constant.ENOTCONN.html | 0 doc/libc/unix/apple/constant.ENOTDIR.html | 0 doc/libc/unix/apple/constant.ENOTEMPTY.html | 0 .../unix/apple/constant.ENOTRECOVERABLE.html | 0 doc/libc/unix/apple/constant.ENOTSOCK.html | 0 doc/libc/unix/apple/constant.ENOTSUP.html | 0 doc/libc/unix/apple/constant.ENOTTY.html | 0 doc/libc/unix/apple/constant.ENXIO.html | 0 doc/libc/unix/apple/constant.EOF.html | 0 doc/libc/unix/apple/constant.EOPNOTSUPP.html | 0 doc/libc/unix/apple/constant.EOVERFLOW.html | 0 doc/libc/unix/apple/constant.EOWNERDEAD.html | 0 doc/libc/unix/apple/constant.EPERM.html | 0 .../unix/apple/constant.EPFNOSUPPORT.html | 0 doc/libc/unix/apple/constant.EPIPE.html | 0 doc/libc/unix/apple/constant.EPROCLIM.html | 0 .../unix/apple/constant.EPROCUNAVAIL.html | 0 .../unix/apple/constant.EPROGMISMATCH.html | 0 .../unix/apple/constant.EPROGUNAVAIL.html | 0 doc/libc/unix/apple/constant.EPROTO.html | 0 .../unix/apple/constant.EPROTONOSUPPORT.html | 0 doc/libc/unix/apple/constant.EPROTOTYPE.html | 0 doc/libc/unix/apple/constant.EPWROFF.html | 0 doc/libc/unix/apple/constant.EQFULL.html | 0 doc/libc/unix/apple/constant.ERA.html | 0 doc/libc/unix/apple/constant.ERANGE.html | 0 doc/libc/unix/apple/constant.ERA_D_FMT.html | 0 doc/libc/unix/apple/constant.ERA_D_T_FMT.html | 0 doc/libc/unix/apple/constant.ERA_T_FMT.html | 0 doc/libc/unix/apple/constant.EREMOTE.html | 0 doc/libc/unix/apple/constant.EROFS.html | 0 .../unix/apple/constant.ERPCMISMATCH.html | 0 doc/libc/unix/apple/constant.ESHLIBVERS.html | 0 doc/libc/unix/apple/constant.ESHUTDOWN.html | 0 .../unix/apple/constant.ESOCKTNOSUPPORT.html | 0 doc/libc/unix/apple/constant.ESPIPE.html | 0 doc/libc/unix/apple/constant.ESRCH.html | 0 doc/libc/unix/apple/constant.ESTALE.html | 0 doc/libc/unix/apple/constant.ETIME.html | 0 doc/libc/unix/apple/constant.ETIMEDOUT.html | 0 .../unix/apple/constant.ETOOMANYREFS.html | 0 doc/libc/unix/apple/constant.ETXTBSY.html | 0 doc/libc/unix/apple/constant.EUSERS.html | 0 doc/libc/unix/apple/constant.EVFILT_AIO.html | 0 doc/libc/unix/apple/constant.EVFILT_FS.html | 0 .../unix/apple/constant.EVFILT_MACHPORT.html | 0 doc/libc/unix/apple/constant.EVFILT_PROC.html | 0 doc/libc/unix/apple/constant.EVFILT_READ.html | 0 .../unix/apple/constant.EVFILT_SIGNAL.html | 0 .../unix/apple/constant.EVFILT_SYSCOUNT.html | 0 .../unix/apple/constant.EVFILT_TIMER.html | 0 doc/libc/unix/apple/constant.EVFILT_USER.html | 0 doc/libc/unix/apple/constant.EVFILT_VM.html | 0 .../unix/apple/constant.EVFILT_VNODE.html | 0 .../unix/apple/constant.EVFILT_WRITE.html | 0 doc/libc/unix/apple/constant.EV_DISPATCH.html | 0 doc/libc/unix/apple/constant.EV_FLAG0.html | 0 doc/libc/unix/apple/constant.EV_OOBAND.html | 0 doc/libc/unix/apple/constant.EV_POLL.html | 0 doc/libc/unix/apple/constant.EV_RECEIPT.html | 0 doc/libc/unix/apple/constant.EWOULDBLOCK.html | 0 doc/libc/unix/apple/constant.EXDEV.html | 0 .../unix/apple/constant.EXIT_FAILURE.html | 0 .../unix/apple/constant.EXIT_SUCCESS.html | 0 doc/libc/unix/apple/constant.FD_SETSIZE.html | 0 doc/libc/unix/apple/constant.FF0.html | 0 doc/libc/unix/apple/constant.FF1.html | 0 .../unix/apple/constant.FILENAME_MAX.html | 0 doc/libc/unix/apple/constant.FOPEN_MAX.html | 0 .../unix/apple/constant.F_ALLOCATEALL.html | 0 .../unix/apple/constant.F_ALLOCATECONTIG.html | 0 doc/libc/unix/apple/constant.F_DUPFD.html | 0 .../unix/apple/constant.F_DUPFD_CLOEXEC.html | 0 doc/libc/unix/apple/constant.F_FREEZE_FS.html | 0 doc/libc/unix/apple/constant.F_FULLFSYNC.html | 0 doc/libc/unix/apple/constant.F_GETFD.html | 0 doc/libc/unix/apple/constant.F_GETFL.html | 0 doc/libc/unix/apple/constant.F_GETLK.html | 0 doc/libc/unix/apple/constant.F_GETPATH.html | 0 .../unix/apple/constant.F_GLOBAL_NOCACHE.html | 0 doc/libc/unix/apple/constant.F_LOCK.html | 0 doc/libc/unix/apple/constant.F_NOCACHE.html | 0 doc/libc/unix/apple/constant.F_NODIRECT.html | 0 doc/libc/unix/apple/constant.F_OK.html | 0 .../unix/apple/constant.F_PEOFPOSMODE.html | 0 .../unix/apple/constant.F_PREALLOCATE.html | 0 doc/libc/unix/apple/constant.F_RDADVISE.html | 0 doc/libc/unix/apple/constant.F_RDAHEAD.html | 0 doc/libc/unix/apple/constant.F_SETFD.html | 0 doc/libc/unix/apple/constant.F_SETFL.html | 0 doc/libc/unix/apple/constant.F_SETLK.html | 0 doc/libc/unix/apple/constant.F_SETLKW.html | 0 doc/libc/unix/apple/constant.F_TEST.html | 0 doc/libc/unix/apple/constant.F_THAW_FS.html | 0 doc/libc/unix/apple/constant.F_TLOCK.html | 0 doc/libc/unix/apple/constant.F_ULOCK.html | 0 .../unix/apple/constant.F_VOLPOSMODE.html | 0 .../unix/apple/constant.GLOB_ABORTED.html | 0 doc/libc/unix/apple/constant.GLOB_APPEND.html | 0 doc/libc/unix/apple/constant.GLOB_DOOFFS.html | 0 doc/libc/unix/apple/constant.GLOB_ERR.html | 0 doc/libc/unix/apple/constant.GLOB_MARK.html | 0 .../unix/apple/constant.GLOB_NOCHECK.html | 0 .../unix/apple/constant.GLOB_NOESCAPE.html | 0 .../unix/apple/constant.GLOB_NOMATCH.html | 0 doc/libc/unix/apple/constant.GLOB_NOSORT.html | 0 .../unix/apple/constant.GLOB_NOSPACE.html | 0 doc/libc/unix/apple/constant.HW_AVAILCPU.html | 0 .../unix/apple/constant.IFF_LOOPBACK.html | 0 doc/libc/unix/apple/constant.IPPROTO_IP.html | 0 .../unix/apple/constant.IPPROTO_IPV6.html | 0 doc/libc/unix/apple/constant.IPPROTO_RAW.html | 0 doc/libc/unix/apple/constant.IPPROTO_TCP.html | 0 .../unix/apple/constant.IPV6_JOIN_GROUP.html | 0 .../unix/apple/constant.IPV6_LEAVE_GROUP.html | 0 .../apple/constant.IP_ADD_MEMBERSHIP.html | 0 .../apple/constant.IP_DROP_MEMBERSHIP.html | 0 doc/libc/unix/apple/constant.IP_HDRINCL.html | 0 .../apple/constant.IP_MULTICAST_LOOP.html | 0 .../unix/apple/constant.IP_MULTICAST_TTL.html | 0 doc/libc/unix/apple/constant.IP_TTL.html | 0 doc/libc/unix/apple/constant.IUTF8.html | 0 doc/libc/unix/apple/constant.LC_ALL_MASK.html | 0 .../unix/apple/constant.LC_COLLATE_MASK.html | 0 .../unix/apple/constant.LC_CTYPE_MASK.html | 0 .../unix/apple/constant.LC_MESSAGES_MASK.html | 0 .../unix/apple/constant.LC_MONETARY_MASK.html | 0 .../unix/apple/constant.LC_NUMERIC_MASK.html | 0 .../unix/apple/constant.LC_TIME_MASK.html | 0 doc/libc/unix/apple/constant.LOCK_EX.html | 0 doc/libc/unix/apple/constant.LOCK_NB.html | 0 doc/libc/unix/apple/constant.LOCK_SH.html | 0 doc/libc/unix/apple/constant.LOCK_UN.html | 0 doc/libc/unix/apple/constant.L_tmpnam.html | 0 .../unix/apple/constant.MADV_CAN_REUSE.html | 0 .../unix/apple/constant.MADV_DONTNEED.html | 0 doc/libc/unix/apple/constant.MADV_FREE.html | 0 .../apple/constant.MADV_FREE_REUSABLE.html | 0 .../unix/apple/constant.MADV_FREE_REUSE.html | 0 doc/libc/unix/apple/constant.MADV_NORMAL.html | 0 doc/libc/unix/apple/constant.MADV_RANDOM.html | 0 .../unix/apple/constant.MADV_SEQUENTIAL.html | 0 .../unix/apple/constant.MADV_WILLNEED.html | 0 .../apple/constant.MADV_ZERO_WIRED_PAGES.html | 0 doc/libc/unix/apple/constant.MAP_ANON.html | 0 doc/libc/unix/apple/constant.MAP_COPY.html | 0 doc/libc/unix/apple/constant.MAP_FAILED.html | 0 doc/libc/unix/apple/constant.MAP_FILE.html | 0 doc/libc/unix/apple/constant.MAP_FIXED.html | 0 .../unix/apple/constant.MAP_HASSEMAPHORE.html | 0 doc/libc/unix/apple/constant.MAP_JIT.html | 0 doc/libc/unix/apple/constant.MAP_NOCACHE.html | 0 .../unix/apple/constant.MAP_NOEXTEND.html | 0 .../unix/apple/constant.MAP_NORESERVE.html | 0 doc/libc/unix/apple/constant.MAP_PRIVATE.html | 0 doc/libc/unix/apple/constant.MAP_RENAME.html | 0 doc/libc/unix/apple/constant.MAP_SHARED.html | 0 doc/libc/unix/apple/constant.MCL_CURRENT.html | 0 doc/libc/unix/apple/constant.MCL_FUTURE.html | 0 .../unix/apple/constant.MINCORE_INCORE.html | 0 .../unix/apple/constant.MINCORE_MODIFIED.html | 0 .../constant.MINCORE_MODIFIED_OTHER.html | 0 .../apple/constant.MINCORE_REFERENCED.html | 0 .../constant.MINCORE_REFERENCED_OTHER.html | 0 doc/libc/unix/apple/constant.MON_1.html | 0 doc/libc/unix/apple/constant.MON_10.html | 0 doc/libc/unix/apple/constant.MON_11.html | 0 doc/libc/unix/apple/constant.MON_12.html | 0 doc/libc/unix/apple/constant.MON_2.html | 0 doc/libc/unix/apple/constant.MON_3.html | 0 doc/libc/unix/apple/constant.MON_4.html | 0 doc/libc/unix/apple/constant.MON_5.html | 0 doc/libc/unix/apple/constant.MON_6.html | 0 doc/libc/unix/apple/constant.MON_7.html | 0 doc/libc/unix/apple/constant.MON_8.html | 0 doc/libc/unix/apple/constant.MON_9.html | 0 doc/libc/unix/apple/constant.MS_ASYNC.html | 0 .../unix/apple/constant.MS_DEACTIVATE.html | 0 .../unix/apple/constant.MS_INVALIDATE.html | 0 .../unix/apple/constant.MS_KILLPAGES.html | 0 doc/libc/unix/apple/constant.MS_SYNC.html | 0 doc/libc/unix/apple/constant.NI_MAXHOST.html | 0 doc/libc/unix/apple/constant.NL0.html | 0 doc/libc/unix/apple/constant.NL1.html | 0 doc/libc/unix/apple/constant.NOEXPR.html | 0 doc/libc/unix/apple/constant.NOSTR.html | 0 .../unix/apple/constant.NOTE_ABSOLUTE.html | 0 .../unix/apple/constant.NOTE_EXITSTATUS.html | 0 .../apple/constant.NOTE_EXIT_REPARENTED.html | 0 doc/libc/unix/apple/constant.NOTE_FFAND.html | 0 doc/libc/unix/apple/constant.NOTE_FFCOPY.html | 0 .../unix/apple/constant.NOTE_FFCTRLMASK.html | 0 .../unix/apple/constant.NOTE_FFLAGSMASK.html | 0 doc/libc/unix/apple/constant.NOTE_FFNOP.html | 0 doc/libc/unix/apple/constant.NOTE_FFOR.html | 0 doc/libc/unix/apple/constant.NOTE_NONE.html | 0 .../unix/apple/constant.NOTE_NSECONDS.html | 0 .../unix/apple/constant.NOTE_PCTRLMASK.html | 0 doc/libc/unix/apple/constant.NOTE_REAP.html | 0 .../unix/apple/constant.NOTE_SECONDS.html | 0 doc/libc/unix/apple/constant.NOTE_SIGNAL.html | 0 .../unix/apple/constant.NOTE_TRIGGER.html | 0 .../unix/apple/constant.NOTE_USECONDS.html | 0 .../unix/apple/constant.NOTE_VM_ERROR.html | 0 .../unix/apple/constant.NOTE_VM_PRESSURE.html | 0 ...ant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html | 0 .../constant.NOTE_VM_PRESSURE_TERMINATE.html | 0 doc/libc/unix/apple/constant.O_ACCMODE.html | 0 doc/libc/unix/apple/constant.O_APPEND.html | 0 doc/libc/unix/apple/constant.O_CLOEXEC.html | 0 doc/libc/unix/apple/constant.O_CREAT.html | 0 doc/libc/unix/apple/constant.O_DIRECTORY.html | 0 doc/libc/unix/apple/constant.O_DSYNC.html | 0 doc/libc/unix/apple/constant.O_EXCL.html | 0 doc/libc/unix/apple/constant.O_NOCTTY.html | 0 doc/libc/unix/apple/constant.O_NONBLOCK.html | 0 doc/libc/unix/apple/constant.O_RDONLY.html | 0 doc/libc/unix/apple/constant.O_RDWR.html | 0 doc/libc/unix/apple/constant.O_SYNC.html | 0 doc/libc/unix/apple/constant.O_TRUNC.html | 0 doc/libc/unix/apple/constant.O_WRONLY.html | 0 doc/libc/unix/apple/constant.PM_STR.html | 0 .../apple/constant.POSIX_MADV_DONTNEED.html | 0 .../apple/constant.POSIX_MADV_NORMAL.html | 0 .../apple/constant.POSIX_MADV_RANDOM.html | 0 .../apple/constant.POSIX_MADV_SEQUENTIAL.html | 0 .../apple/constant.POSIX_MADV_WILLNEED.html | 0 doc/libc/unix/apple/constant.PROT_EXEC.html | 0 doc/libc/unix/apple/constant.PROT_NONE.html | 0 doc/libc/unix/apple/constant.PROT_READ.html | 0 doc/libc/unix/apple/constant.PROT_WRITE.html | 0 .../constant.PTHREAD_COND_INITIALIZER.html | 0 .../constant.PTHREAD_CREATE_DETACHED.html | 0 .../constant.PTHREAD_CREATE_JOINABLE.html | 0 .../constant.PTHREAD_MUTEX_INITIALIZER.html | 0 .../constant.PTHREAD_MUTEX_RECURSIVE.html | 0 .../constant.PTHREAD_RWLOCK_INITIALIZER.html | 0 .../apple/constant.PTHREAD_STACK_MIN.html | 0 doc/libc/unix/apple/constant.Q_GETQUOTA.html | 0 doc/libc/unix/apple/constant.Q_SETQUOTA.html | 0 doc/libc/unix/apple/constant.RADIXCHAR.html | 0 doc/libc/unix/apple/constant.RAND_MAX.html | 0 doc/libc/unix/apple/constant.RLIMIT_AS.html | 0 doc/libc/unix/apple/constant.RLIMIT_CORE.html | 0 doc/libc/unix/apple/constant.RLIMIT_CPU.html | 0 doc/libc/unix/apple/constant.RLIMIT_DATA.html | 0 .../unix/apple/constant.RLIMIT_FSIZE.html | 0 .../unix/apple/constant.RLIMIT_MEMLOCK.html | 0 .../unix/apple/constant.RLIMIT_NOFILE.html | 0 .../unix/apple/constant.RLIMIT_NPROC.html | 0 doc/libc/unix/apple/constant.RLIMIT_RSS.html | 0 .../unix/apple/constant.RLIMIT_STACK.html | 0 .../unix/apple/constant.RLIM_INFINITY.html | 0 .../unix/apple/constant.RLIM_NLIMITS.html | 0 doc/libc/unix/apple/constant.RTLD_FIRST.html | 0 doc/libc/unix/apple/constant.RTLD_GLOBAL.html | 0 doc/libc/unix/apple/constant.RTLD_LOCAL.html | 0 .../unix/apple/constant.RTLD_NODELETE.html | 0 doc/libc/unix/apple/constant.RTLD_NOLOAD.html | 0 .../unix/apple/constant.RUSAGE_CHILDREN.html | 0 doc/libc/unix/apple/constant.RUSAGE_SELF.html | 0 doc/libc/unix/apple/constant.R_OK.html | 0 doc/libc/unix/apple/constant.SEEK_CUR.html | 0 doc/libc/unix/apple/constant.SEEK_END.html | 0 doc/libc/unix/apple/constant.SEEK_SET.html | 0 doc/libc/unix/apple/constant.SHUT_RD.html | 0 doc/libc/unix/apple/constant.SHUT_RDWR.html | 0 doc/libc/unix/apple/constant.SHUT_WR.html | 0 doc/libc/unix/apple/constant.SIGABRT.html | 0 doc/libc/unix/apple/constant.SIGALRM.html | 0 doc/libc/unix/apple/constant.SIGEMT.html | 0 doc/libc/unix/apple/constant.SIGFPE.html | 0 doc/libc/unix/apple/constant.SIGHUP.html | 0 doc/libc/unix/apple/constant.SIGILL.html | 0 doc/libc/unix/apple/constant.SIGINT.html | 0 doc/libc/unix/apple/constant.SIGKILL.html | 0 doc/libc/unix/apple/constant.SIGPIPE.html | 0 doc/libc/unix/apple/constant.SIGQUIT.html | 0 doc/libc/unix/apple/constant.SIGSEGV.html | 0 doc/libc/unix/apple/constant.SIGSTKSZ.html | 0 doc/libc/unix/apple/constant.SIGTERM.html | 0 doc/libc/unix/apple/constant.SIGTRAP.html | 0 doc/libc/unix/apple/constant.SOCK_DGRAM.html | 0 doc/libc/unix/apple/constant.SOCK_RAW.html | 0 doc/libc/unix/apple/constant.SOCK_STREAM.html | 0 doc/libc/unix/apple/constant.SOL_SOCKET.html | 0 .../unix/apple/constant.SO_ACCEPTCONN.html | 0 .../unix/apple/constant.SO_BROADCAST.html | 0 doc/libc/unix/apple/constant.SO_DEBUG.html | 0 .../unix/apple/constant.SO_DONTROUTE.html | 0 .../unix/apple/constant.SO_DONTTRUNC.html | 0 doc/libc/unix/apple/constant.SO_ERROR.html | 0 .../unix/apple/constant.SO_KEEPALIVE.html | 0 doc/libc/unix/apple/constant.SO_LINGER.html | 0 doc/libc/unix/apple/constant.SO_NKE.html | 0 .../unix/apple/constant.SO_NOADDRERR.html | 0 .../unix/apple/constant.SO_NOSIGPIPE.html | 0 doc/libc/unix/apple/constant.SO_NREAD.html | 0 doc/libc/unix/apple/constant.SO_NWRITE.html | 0 .../unix/apple/constant.SO_OOBINLINE.html | 0 doc/libc/unix/apple/constant.SO_RCVBUF.html | 0 doc/libc/unix/apple/constant.SO_RCVLOWAT.html | 0 doc/libc/unix/apple/constant.SO_RCVTIMEO.html | 0 .../unix/apple/constant.SO_REUSEADDR.html | 0 .../unix/apple/constant.SO_REUSEPORT.html | 0 doc/libc/unix/apple/constant.SO_SNDBUF.html | 0 doc/libc/unix/apple/constant.SO_SNDLOWAT.html | 0 doc/libc/unix/apple/constant.SO_SNDTIMEO.html | 0 doc/libc/unix/apple/constant.SO_TYPE.html | 0 .../unix/apple/constant.SO_USELOOPBACK.html | 0 doc/libc/unix/apple/constant.SO_WANTMORE.html | 0 .../unix/apple/constant.SO_WANTOOBFLAG.html | 0 .../unix/apple/constant.STDERR_FILENO.html | 0 .../unix/apple/constant.STDIN_FILENO.html | 0 .../unix/apple/constant.STDOUT_FILENO.html | 0 doc/libc/unix/apple/constant.ST_NOSUID.html | 0 doc/libc/unix/apple/constant.S_IEXEC.html | 0 doc/libc/unix/apple/constant.S_IFBLK.html | 0 doc/libc/unix/apple/constant.S_IFCHR.html | 0 doc/libc/unix/apple/constant.S_IFDIR.html | 0 doc/libc/unix/apple/constant.S_IFIFO.html | 0 doc/libc/unix/apple/constant.S_IFLNK.html | 0 doc/libc/unix/apple/constant.S_IFMT.html | 0 doc/libc/unix/apple/constant.S_IFREG.html | 0 doc/libc/unix/apple/constant.S_IFSOCK.html | 0 doc/libc/unix/apple/constant.S_IREAD.html | 0 doc/libc/unix/apple/constant.S_IRGRP.html | 0 doc/libc/unix/apple/constant.S_IROTH.html | 0 doc/libc/unix/apple/constant.S_IRUSR.html | 0 doc/libc/unix/apple/constant.S_IRWXG.html | 0 doc/libc/unix/apple/constant.S_IRWXO.html | 0 doc/libc/unix/apple/constant.S_IRWXU.html | 0 doc/libc/unix/apple/constant.S_IWGRP.html | 0 doc/libc/unix/apple/constant.S_IWOTH.html | 0 doc/libc/unix/apple/constant.S_IWRITE.html | 0 doc/libc/unix/apple/constant.S_IWUSR.html | 0 doc/libc/unix/apple/constant.S_IXGRP.html | 0 doc/libc/unix/apple/constant.S_IXOTH.html | 0 doc/libc/unix/apple/constant.S_IXUSR.html | 0 doc/libc/unix/apple/constant.TAB0.html | 0 doc/libc/unix/apple/constant.TAB1.html | 0 doc/libc/unix/apple/constant.TAB2.html | 0 doc/libc/unix/apple/constant.TAB3.html | 0 .../unix/apple/constant.TCP_KEEPALIVE.html | 0 doc/libc/unix/apple/constant.TCP_NODELAY.html | 0 doc/libc/unix/apple/constant.THOUSEP.html | 0 doc/libc/unix/apple/constant.TIOCCBRK.html | 0 doc/libc/unix/apple/constant.TIOCCDTR.html | 0 doc/libc/unix/apple/constant.TIOCCONS.html | 0 .../unix/apple/constant.TIOCDCDTIMESTAMP.html | 0 doc/libc/unix/apple/constant.TIOCDRAIN.html | 0 .../unix/apple/constant.TIOCDSIMICROCODE.html | 0 doc/libc/unix/apple/constant.TIOCEXCL.html | 0 doc/libc/unix/apple/constant.TIOCEXT.html | 0 doc/libc/unix/apple/constant.TIOCFLUSH.html | 0 .../unix/apple/constant.TIOCGDRAINWAIT.html | 0 doc/libc/unix/apple/constant.TIOCGETD.html | 0 doc/libc/unix/apple/constant.TIOCGPGRP.html | 0 doc/libc/unix/apple/constant.TIOCGWINSZ.html | 0 doc/libc/unix/apple/constant.TIOCIXOFF.html | 0 doc/libc/unix/apple/constant.TIOCIXON.html | 0 doc/libc/unix/apple/constant.TIOCMBIC.html | 0 doc/libc/unix/apple/constant.TIOCMBIS.html | 0 .../unix/apple/constant.TIOCMGDTRWAIT.html | 0 doc/libc/unix/apple/constant.TIOCMGET.html | 0 doc/libc/unix/apple/constant.TIOCMODG.html | 0 doc/libc/unix/apple/constant.TIOCMODS.html | 0 .../unix/apple/constant.TIOCMSDTRWAIT.html | 0 doc/libc/unix/apple/constant.TIOCMSET.html | 0 doc/libc/unix/apple/constant.TIOCM_CAR.html | 0 doc/libc/unix/apple/constant.TIOCM_CD.html | 0 doc/libc/unix/apple/constant.TIOCM_CTS.html | 0 doc/libc/unix/apple/constant.TIOCM_DSR.html | 0 doc/libc/unix/apple/constant.TIOCM_DTR.html | 0 doc/libc/unix/apple/constant.TIOCM_LE.html | 0 doc/libc/unix/apple/constant.TIOCM_RI.html | 0 doc/libc/unix/apple/constant.TIOCM_RNG.html | 0 doc/libc/unix/apple/constant.TIOCM_RTS.html | 0 doc/libc/unix/apple/constant.TIOCM_SR.html | 0 doc/libc/unix/apple/constant.TIOCM_ST.html | 0 doc/libc/unix/apple/constant.TIOCNOTTY.html | 0 doc/libc/unix/apple/constant.TIOCNXCL.html | 0 doc/libc/unix/apple/constant.TIOCOUTQ.html | 0 doc/libc/unix/apple/constant.TIOCPKT.html | 0 .../unix/apple/constant.TIOCPKT_DATA.html | 0 .../unix/apple/constant.TIOCPKT_DOSTOP.html | 0 .../apple/constant.TIOCPKT_FLUSHREAD.html | 0 .../apple/constant.TIOCPKT_FLUSHWRITE.html | 0 .../unix/apple/constant.TIOCPKT_IOCTL.html | 0 .../unix/apple/constant.TIOCPKT_NOSTOP.html | 0 .../unix/apple/constant.TIOCPKT_START.html | 0 .../unix/apple/constant.TIOCPKT_STOP.html | 0 .../unix/apple/constant.TIOCPTYGNAME.html | 0 .../unix/apple/constant.TIOCPTYGRANT.html | 0 doc/libc/unix/apple/constant.TIOCPTYUNLK.html | 0 doc/libc/unix/apple/constant.TIOCREMOTE.html | 0 doc/libc/unix/apple/constant.TIOCSBRK.html | 0 doc/libc/unix/apple/constant.TIOCSCONS.html | 0 doc/libc/unix/apple/constant.TIOCSCTTY.html | 0 .../unix/apple/constant.TIOCSDRAINWAIT.html | 0 doc/libc/unix/apple/constant.TIOCSDTR.html | 0 doc/libc/unix/apple/constant.TIOCSETD.html | 0 doc/libc/unix/apple/constant.TIOCSIG.html | 0 doc/libc/unix/apple/constant.TIOCSPGRP.html | 0 doc/libc/unix/apple/constant.TIOCSTART.html | 0 doc/libc/unix/apple/constant.TIOCSTAT.html | 0 doc/libc/unix/apple/constant.TIOCSTI.html | 0 doc/libc/unix/apple/constant.TIOCSTOP.html | 0 doc/libc/unix/apple/constant.TIOCSWINSZ.html | 0 .../unix/apple/constant.TIOCTIMESTAMP.html | 0 doc/libc/unix/apple/constant.TIOCUCNTL.html | 0 doc/libc/unix/apple/constant.TMP_MAX.html | 0 doc/libc/unix/apple/constant.T_FMT.html | 0 doc/libc/unix/apple/constant.T_FMT_AMPM.html | 0 doc/libc/unix/apple/constant.VT0.html | 0 doc/libc/unix/apple/constant.VT1.html | 0 doc/libc/unix/apple/constant.W_OK.html | 0 doc/libc/unix/apple/constant.X_OK.html | 0 doc/libc/unix/apple/constant.YESEXPR.html | 0 doc/libc/unix/apple/constant.YESSTR.html | 0 doc/libc/unix/apple/constant._IOFBF.html | 0 doc/libc/unix/apple/constant._IOLBF.html | 0 doc/libc/unix/apple/constant._IONBF.html | 0 .../unix/apple/constant._PC_NAME_MAX.html | 0 .../constant._PTHREAD_COND_SIG_init.html | 0 .../constant._PTHREAD_MUTEX_SIG_init.html | 0 .../constant._PTHREAD_RWLOCK_SIG_init.html | 0 .../apple/constant._RLIMIT_POSIX_FLAG.html | 0 .../unix/apple/constant._SC_2_CHAR_TERM.html | 0 .../unix/apple/constant._SC_2_C_BIND.html | 0 doc/libc/unix/apple/constant._SC_2_C_DEV.html | 0 .../unix/apple/constant._SC_2_FORT_DEV.html | 0 .../unix/apple/constant._SC_2_FORT_RUN.html | 0 .../unix/apple/constant._SC_2_LOCALEDEF.html | 0 doc/libc/unix/apple/constant._SC_2_PBS.html | 0 .../apple/constant._SC_2_PBS_ACCOUNTING.html | 0 .../apple/constant._SC_2_PBS_CHECKPOINT.html | 0 .../unix/apple/constant._SC_2_PBS_LOCATE.html | 0 .../apple/constant._SC_2_PBS_MESSAGE.html | 0 .../unix/apple/constant._SC_2_PBS_TRACK.html | 0 .../unix/apple/constant._SC_2_SW_DEV.html | 0 doc/libc/unix/apple/constant._SC_2_UPE.html | 0 .../unix/apple/constant._SC_2_VERSION.html | 0 .../apple/constant._SC_ADVISORY_INFO.html | 0 .../apple/constant._SC_AIO_LISTIO_MAX.html | 0 doc/libc/unix/apple/constant._SC_AIO_MAX.html | 0 .../constant._SC_AIO_PRIO_DELTA_MAX.html | 0 doc/libc/unix/apple/constant._SC_ARG_MAX.html | 0 .../apple/constant._SC_ASYNCHRONOUS_IO.html | 0 .../unix/apple/constant._SC_ATEXIT_MAX.html | 0 .../unix/apple/constant._SC_BARRIERS.html | 0 .../unix/apple/constant._SC_BC_BASE_MAX.html | 0 .../unix/apple/constant._SC_BC_DIM_MAX.html | 0 .../unix/apple/constant._SC_BC_SCALE_MAX.html | 0 .../apple/constant._SC_BC_STRING_MAX.html | 0 .../unix/apple/constant._SC_CHILD_MAX.html | 0 doc/libc/unix/apple/constant._SC_CLK_TCK.html | 0 .../apple/constant._SC_CLOCK_SELECTION.html | 0 .../apple/constant._SC_COLL_WEIGHTS_MAX.html | 0 doc/libc/unix/apple/constant._SC_CPUTIME.html | 0 .../apple/constant._SC_DELAYTIMER_MAX.html | 0 .../apple/constant._SC_EXPR_NEST_MAX.html | 0 .../unix/apple/constant._SC_FILE_LOCKING.html | 0 doc/libc/unix/apple/constant._SC_FSYNC.html | 0 .../apple/constant._SC_GETGR_R_SIZE_MAX.html | 0 .../apple/constant._SC_GETPW_R_SIZE_MAX.html | 0 .../apple/constant._SC_HOST_NAME_MAX.html | 0 doc/libc/unix/apple/constant._SC_IOV_MAX.html | 0 doc/libc/unix/apple/constant._SC_IPV6.html | 0 .../unix/apple/constant._SC_JOB_CONTROL.html | 0 .../unix/apple/constant._SC_LINE_MAX.html | 0 .../apple/constant._SC_LOGIN_NAME_MAX.html | 0 .../unix/apple/constant._SC_MAPPED_FILES.html | 0 doc/libc/unix/apple/constant._SC_MEMLOCK.html | 0 .../apple/constant._SC_MEMLOCK_RANGE.html | 0 .../apple/constant._SC_MEMORY_PROTECTION.html | 0 .../apple/constant._SC_MESSAGE_PASSING.html | 0 .../apple/constant._SC_MONOTONIC_CLOCK.html | 0 .../unix/apple/constant._SC_MQ_OPEN_MAX.html | 0 .../unix/apple/constant._SC_MQ_PRIO_MAX.html | 0 .../unix/apple/constant._SC_NGROUPS_MAX.html | 0 .../apple/constant._SC_NPROCESSORS_CONF.html | 0 .../apple/constant._SC_NPROCESSORS_ONLN.html | 0 .../unix/apple/constant._SC_OPEN_MAX.html | 0 .../unix/apple/constant._SC_PAGESIZE.html | 0 .../unix/apple/constant._SC_PAGE_SIZE.html | 0 .../unix/apple/constant._SC_PASS_MAX.html | 0 .../apple/constant._SC_PRIORITIZED_IO.html | 0 .../constant._SC_PRIORITY_SCHEDULING.html | 0 .../unix/apple/constant._SC_RAW_SOCKETS.html | 0 .../constant._SC_READER_WRITER_LOCKS.html | 0 .../apple/constant._SC_REALTIME_SIGNALS.html | 0 doc/libc/unix/apple/constant._SC_REGEXP.html | 0 .../unix/apple/constant._SC_RE_DUP_MAX.html | 0 .../unix/apple/constant._SC_RTSIG_MAX.html | 0 .../unix/apple/constant._SC_SAVED_IDS.html | 0 .../unix/apple/constant._SC_SEMAPHORES.html | 0 .../apple/constant._SC_SEM_NSEMS_MAX.html | 0 .../apple/constant._SC_SEM_VALUE_MAX.html | 0 .../constant._SC_SHARED_MEMORY_OBJECTS.html | 0 doc/libc/unix/apple/constant._SC_SHELL.html | 0 .../unix/apple/constant._SC_SIGQUEUE_MAX.html | 0 doc/libc/unix/apple/constant._SC_SPAWN.html | 0 .../unix/apple/constant._SC_SPIN_LOCKS.html | 0 .../apple/constant._SC_SPORADIC_SERVER.html | 0 .../unix/apple/constant._SC_SS_REPL_MAX.html | 0 .../unix/apple/constant._SC_STREAM_MAX.html | 0 .../unix/apple/constant._SC_SYMLOOP_MAX.html | 0 .../apple/constant._SC_SYNCHRONIZED_IO.html | 0 doc/libc/unix/apple/constant._SC_THREADS.html | 0 .../constant._SC_THREAD_ATTR_STACKADDR.html | 0 .../constant._SC_THREAD_ATTR_STACKSIZE.html | 0 .../apple/constant._SC_THREAD_CPUTIME.html | 0 ...tant._SC_THREAD_DESTRUCTOR_ITERATIONS.html | 0 .../apple/constant._SC_THREAD_KEYS_MAX.html | 0 ...nstant._SC_THREAD_PRIORITY_SCHEDULING.html | 0 .../constant._SC_THREAD_PRIO_INHERIT.html | 0 .../constant._SC_THREAD_PRIO_PROTECT.html | 0 .../constant._SC_THREAD_PROCESS_SHARED.html | 0 .../constant._SC_THREAD_SAFE_FUNCTIONS.html | 0 .../constant._SC_THREAD_SPORADIC_SERVER.html | 0 .../apple/constant._SC_THREAD_STACK_MIN.html | 0 .../constant._SC_THREAD_THREADS_MAX.html | 0 .../unix/apple/constant._SC_TIMEOUTS.html | 0 doc/libc/unix/apple/constant._SC_TIMERS.html | 0 .../unix/apple/constant._SC_TIMER_MAX.html | 0 doc/libc/unix/apple/constant._SC_TRACE.html | 0 .../constant._SC_TRACE_EVENT_FILTER.html | 0 .../constant._SC_TRACE_EVENT_NAME_MAX.html | 0 .../apple/constant._SC_TRACE_INHERIT.html | 0 .../unix/apple/constant._SC_TRACE_LOG.html | 0 .../apple/constant._SC_TRACE_NAME_MAX.html | 0 .../apple/constant._SC_TRACE_SYS_MAX.html | 0 .../constant._SC_TRACE_USER_EVENT_MAX.html | 0 .../unix/apple/constant._SC_TTY_NAME_MAX.html | 0 .../constant._SC_TYPED_MEMORY_OBJECTS.html | 0 .../unix/apple/constant._SC_TZNAME_MAX.html | 0 .../apple/constant._SC_V6_ILP32_OFF32.html | 0 .../apple/constant._SC_V6_ILP32_OFFBIG.html | 0 .../apple/constant._SC_V6_LP64_OFF64.html | 0 .../apple/constant._SC_V6_LPBIG_OFFBIG.html | 0 doc/libc/unix/apple/constant._SC_VERSION.html | 0 .../apple/constant._SC_XBS5_ILP32_OFF32.html | 0 .../apple/constant._SC_XBS5_ILP32_OFFBIG.html | 0 .../apple/constant._SC_XBS5_LP64_OFF64.html | 0 .../apple/constant._SC_XBS5_LPBIG_OFFBIG.html | 0 .../unix/apple/constant._SC_XOPEN_CRYPT.html | 0 .../apple/constant._SC_XOPEN_ENH_I18N.html | 0 .../unix/apple/constant._SC_XOPEN_LEGACY.html | 0 .../apple/constant._SC_XOPEN_REALTIME.html | 0 .../constant._SC_XOPEN_REALTIME_THREADS.html | 0 .../unix/apple/constant._SC_XOPEN_SHM.html | 0 .../apple/constant._SC_XOPEN_STREAMS.html | 0 .../unix/apple/constant._SC_XOPEN_UNIX.html | 0 .../apple/constant._SC_XOPEN_VERSION.html | 0 .../apple/constant._SC_XOPEN_XCU_VERSION.html | 0 doc/libc/unix/apple/constant._WSTOPPED.html | 0 .../apple/constant.__PTHREAD_COND_SIZE__.html | 0 .../constant.__PTHREAD_MUTEX_SIZE__.html | 0 .../constant.__PTHREAD_RWLOCK_SIZE__.html | 0 doc/libc/unix/apple/enum.timezone.html | 10 - doc/libc/unix/apple/fn.WIFCONTINUED.html | 10 - doc/libc/unix/apple/fn.WIFSIGNALED.html | 10 - doc/libc/unix/apple/fn.WIFSTOPPED.html | 10 - doc/libc/unix/apple/fn.WSTOPSIG.html | 10 - doc/libc/unix/apple/fn._WSTATUS.html | 10 - doc/libc/unix/apple/fn.__error.html | 10 - doc/libc/unix/apple/fn.backtrace.html | 10 - doc/libc/unix/apple/fn.duplocale.html | 10 - doc/libc/unix/apple/fn.forkpty.html | 10 - doc/libc/unix/apple/fn.freelocale.html | 10 - doc/libc/unix/apple/fn.fstatfs.html | 10 - doc/libc/unix/apple/fn.getnameinfo.html | 10 - doc/libc/unix/apple/fn.kevent.html | 10 - doc/libc/unix/apple/fn.kevent64.html | 10 - doc/libc/unix/apple/fn.localeconv_l.html | 10 - .../unix/apple/fn.mach_absolute_time.html | 10 - .../unix/apple/fn.mach_timebase_info.html | 10 - doc/libc/unix/apple/fn.mincore.html | 10 - doc/libc/unix/apple/fn.mount.html | 10 - doc/libc/unix/apple/fn.mprotect.html | 10 - doc/libc/unix/apple/fn.newlocale.html | 10 - doc/libc/unix/apple/fn.openpty.html | 10 - .../apple/fn.pthread_get_stackaddr_np.html | 10 - .../apple/fn.pthread_get_stacksize_np.html | 10 - .../unix/apple/fn.pthread_setname_np.html | 10 - doc/libc/unix/apple/fn.ptrace.html | 10 - doc/libc/unix/apple/fn.querylocale.html | 10 - doc/libc/unix/apple/fn.quotactl.html | 10 - doc/libc/unix/apple/fn.sendfile.html | 10 - doc/libc/unix/apple/fn.sethostname.html | 10 - doc/libc/unix/apple/fn.shm_open.html | 10 - doc/libc/unix/apple/fn.statfs.html | 10 - doc/libc/unix/apple/fn.sysctl.html | 10 - doc/libc/unix/apple/fn.sysctlbyname.html | 10 - doc/libc/unix/apple/fn.sysctlnametomib.html | 10 - doc/libc/unix/apple/fn.uselocale.html | 10 - doc/libc/unix/apple/index.html | 0 doc/libc/unix/apple/sidebar-items.js | 1 - doc/libc/unix/apple/struct.Dl_info.html | 10 - doc/libc/unix/apple/struct.addrinfo.html | 10 - doc/libc/unix/apple/struct.dirent.html | 10 - doc/libc/unix/apple/struct.dqblk.html | 10 - doc/libc/unix/apple/struct.flock.html | 10 - doc/libc/unix/apple/struct.fstore_t.html | 10 - doc/libc/unix/apple/struct.glob_t.html | 10 - doc/libc/unix/apple/struct.kevent.html | 10 - doc/libc/unix/apple/struct.kevent64_s.html | 10 - doc/libc/unix/apple/struct.lconv.html | 10 - .../unix/apple/struct.mach_timebase_info.html | 10 - .../unix/apple/struct.pthread_attr_t.html | 10 - .../unix/apple/struct.pthread_cond_t.html | 10 - .../unix/apple/struct.pthread_mutex_t.html | 10 - .../apple/struct.pthread_mutexattr_t.html | 10 - .../unix/apple/struct.pthread_rwlock_t.html | 10 - doc/libc/unix/apple/struct.radvisory.html | 10 - doc/libc/unix/apple/struct.sf_hdtr.html | 10 - doc/libc/unix/apple/struct.sigaction.html | 10 - doc/libc/unix/apple/struct.siginfo_t.html | 10 - doc/libc/unix/apple/struct.sockaddr_in.html | 10 - .../unix/apple/struct.sockaddr_storage.html | 10 - doc/libc/unix/apple/struct.stack_t.html | 10 - doc/libc/unix/apple/struct.stat.html | 10 - doc/libc/unix/apple/struct.statfs.html | 10 - doc/libc/unix/apple/struct.statvfs.html | 10 - doc/libc/unix/apple/struct.termios.html | 10 - doc/libc/unix/apple/type.blksize_t.html | 10 - doc/libc/unix/apple/type.c_long.html | 10 - doc/libc/unix/apple/type.c_ulong.html | 10 - doc/libc/unix/apple/type.clock_t.html | 10 - doc/libc/unix/apple/type.dev_t.html | 10 - doc/libc/unix/apple/type.fsblkcnt_t.html | 10 - doc/libc/unix/apple/type.fsfilcnt_t.html | 10 - doc/libc/unix/apple/type.ino_t.html | 10 - .../apple/type.mach_timebase_info_data_t.html | 10 - doc/libc/unix/apple/type.mode_t.html | 10 - doc/libc/unix/apple/type.nl_item.html | 10 - doc/libc/unix/apple/type.nlink_t.html | 10 - doc/libc/unix/apple/type.pthread_key_t.html | 10 - doc/libc/unix/apple/type.rlim_t.html | 10 - doc/libc/unix/apple/type.sigset_t.html | 10 - doc/libc/unix/apple/type.speed_t.html | 10 - doc/libc/unix/apple/type.suseconds_t.html | 10 - doc/libc/unix/apple/type.tcflag_t.html | 10 - doc/libc/unix/apple/type.time_t.html | 10 - .../unix/b64/constant.TIOCDCDTIMESTAMP.html | 0 doc/libc/unix/b64/constant.TIOCTIMESTAMP.html | 0 .../b64/constant.__PTHREAD_COND_SIZE__.html | 0 .../b64/constant.__PTHREAD_MUTEX_SIZE__.html | 0 .../b64/constant.__PTHREAD_RWLOCK_SIZE__.html | 0 doc/libc/unix/b64/index.html | 0 doc/libc/unix/b64/sidebar-items.js | 1 - doc/libc/unix/b64/struct.pthread_attr_t.html | 10 - doc/libc/unix/b64/type.c_long.html | 10 - doc/libc/unix/b64/type.c_ulong.html | 10 - .../apple/b64/constant.TIOCDCDTIMESTAMP.html | 0 .../bsd/apple/b64/constant.TIOCTIMESTAMP.html | 0 .../b64/constant.__PTHREAD_COND_SIZE__.html | 0 .../b64/constant.__PTHREAD_MUTEX_SIZE__.html | 0 .../b64/constant.__PTHREAD_RWLOCK_SIZE__.html | 0 doc/libc/unix/bsd/apple/b64/index.html | 0 doc/libc/unix/bsd/apple/b64/sidebar-items.js | 1 - .../bsd/apple/b64/struct.pthread_attr_t.html | 10 - doc/libc/unix/bsd/apple/b64/type.c_long.html | 10 - doc/libc/unix/bsd/apple/b64/type.c_ulong.html | 10 - doc/libc/unix/bsd/apple/constant.ABDAY_1.html | 0 doc/libc/unix/bsd/apple/constant.ABDAY_2.html | 0 doc/libc/unix/bsd/apple/constant.ABDAY_3.html | 0 doc/libc/unix/bsd/apple/constant.ABDAY_4.html | 0 doc/libc/unix/bsd/apple/constant.ABDAY_5.html | 0 doc/libc/unix/bsd/apple/constant.ABDAY_6.html | 0 doc/libc/unix/bsd/apple/constant.ABDAY_7.html | 0 doc/libc/unix/bsd/apple/constant.ABMON_1.html | 0 .../unix/bsd/apple/constant.ABMON_10.html | 0 .../unix/bsd/apple/constant.ABMON_11.html | 0 .../unix/bsd/apple/constant.ABMON_12.html | 0 doc/libc/unix/bsd/apple/constant.ABMON_2.html | 0 doc/libc/unix/bsd/apple/constant.ABMON_3.html | 0 doc/libc/unix/bsd/apple/constant.ABMON_4.html | 0 doc/libc/unix/bsd/apple/constant.ABMON_5.html | 0 doc/libc/unix/bsd/apple/constant.ABMON_6.html | 0 doc/libc/unix/bsd/apple/constant.ABMON_7.html | 0 doc/libc/unix/bsd/apple/constant.ABMON_8.html | 0 doc/libc/unix/bsd/apple/constant.ABMON_9.html | 0 doc/libc/unix/bsd/apple/constant.AF_INET.html | 0 .../unix/bsd/apple/constant.AF_INET6.html | 0 doc/libc/unix/bsd/apple/constant.AF_UNIX.html | 0 .../unix/bsd/apple/constant.ALT_DIGITS.html | 0 doc/libc/unix/bsd/apple/constant.AM_STR.html | 0 doc/libc/unix/bsd/apple/constant.BS0.html | 0 doc/libc/unix/bsd/apple/constant.BS1.html | 0 doc/libc/unix/bsd/apple/constant.BUFSIZ.html | 0 doc/libc/unix/bsd/apple/constant.CODESET.html | 0 doc/libc/unix/bsd/apple/constant.CR0.html | 0 doc/libc/unix/bsd/apple/constant.CR1.html | 0 doc/libc/unix/bsd/apple/constant.CR2.html | 0 doc/libc/unix/bsd/apple/constant.CR3.html | 0 .../unix/bsd/apple/constant.CRNCYSTR.html | 0 doc/libc/unix/bsd/apple/constant.CRTSCTS.html | 0 doc/libc/unix/bsd/apple/constant.DAY_1.html | 0 doc/libc/unix/bsd/apple/constant.DAY_2.html | 0 doc/libc/unix/bsd/apple/constant.DAY_3.html | 0 doc/libc/unix/bsd/apple/constant.DAY_4.html | 0 doc/libc/unix/bsd/apple/constant.DAY_5.html | 0 doc/libc/unix/bsd/apple/constant.DAY_6.html | 0 doc/libc/unix/bsd/apple/constant.DAY_7.html | 0 doc/libc/unix/bsd/apple/constant.D_FMT.html | 0 .../unix/bsd/apple/constant.D_MD_ORDER.html | 0 doc/libc/unix/bsd/apple/constant.D_T_FMT.html | 0 doc/libc/unix/bsd/apple/constant.E2BIG.html | 0 doc/libc/unix/bsd/apple/constant.EACCES.html | 0 .../unix/bsd/apple/constant.EADDRINUSE.html | 0 .../bsd/apple/constant.EADDRNOTAVAIL.html | 0 .../unix/bsd/apple/constant.EAFNOSUPPORT.html | 0 doc/libc/unix/bsd/apple/constant.EAGAIN.html | 0 .../unix/bsd/apple/constant.EALREADY.html | 0 doc/libc/unix/bsd/apple/constant.EAUTH.html | 0 .../unix/bsd/apple/constant.EBADARCH.html | 0 .../unix/bsd/apple/constant.EBADEXEC.html | 0 doc/libc/unix/bsd/apple/constant.EBADF.html | 0 .../unix/bsd/apple/constant.EBADMACHO.html | 0 doc/libc/unix/bsd/apple/constant.EBADMSG.html | 0 doc/libc/unix/bsd/apple/constant.EBADRPC.html | 0 doc/libc/unix/bsd/apple/constant.EBUSY.html | 0 .../unix/bsd/apple/constant.ECANCELED.html | 0 doc/libc/unix/bsd/apple/constant.ECHILD.html | 0 .../unix/bsd/apple/constant.ECONNABORTED.html | 0 .../unix/bsd/apple/constant.ECONNREFUSED.html | 0 .../unix/bsd/apple/constant.ECONNRESET.html | 0 doc/libc/unix/bsd/apple/constant.EDEADLK.html | 0 .../unix/bsd/apple/constant.EDESTADDRREQ.html | 0 doc/libc/unix/bsd/apple/constant.EDEVERR.html | 0 doc/libc/unix/bsd/apple/constant.EDOM.html | 0 doc/libc/unix/bsd/apple/constant.EDQUOT.html | 0 doc/libc/unix/bsd/apple/constant.EEXIST.html | 0 doc/libc/unix/bsd/apple/constant.EFAULT.html | 0 doc/libc/unix/bsd/apple/constant.EFBIG.html | 0 doc/libc/unix/bsd/apple/constant.EFTYPE.html | 0 .../unix/bsd/apple/constant.EHOSTDOWN.html | 0 .../unix/bsd/apple/constant.EHOSTUNREACH.html | 0 doc/libc/unix/bsd/apple/constant.EIDRM.html | 0 doc/libc/unix/bsd/apple/constant.EILSEQ.html | 0 .../unix/bsd/apple/constant.EINPROGRESS.html | 0 doc/libc/unix/bsd/apple/constant.EINTR.html | 0 doc/libc/unix/bsd/apple/constant.EINVAL.html | 0 doc/libc/unix/bsd/apple/constant.EIO.html | 0 doc/libc/unix/bsd/apple/constant.EISCONN.html | 0 doc/libc/unix/bsd/apple/constant.EISDIR.html | 0 doc/libc/unix/bsd/apple/constant.ELAST.html | 0 doc/libc/unix/bsd/apple/constant.ELOOP.html | 0 doc/libc/unix/bsd/apple/constant.EMFILE.html | 0 doc/libc/unix/bsd/apple/constant.EMLINK.html | 0 .../unix/bsd/apple/constant.EMSGSIZE.html | 0 .../unix/bsd/apple/constant.EMULTIHOP.html | 0 .../unix/bsd/apple/constant.ENAMETOOLONG.html | 0 .../unix/bsd/apple/constant.ENEEDAUTH.html | 0 .../unix/bsd/apple/constant.ENETDOWN.html | 0 .../unix/bsd/apple/constant.ENETRESET.html | 0 .../unix/bsd/apple/constant.ENETUNREACH.html | 0 doc/libc/unix/bsd/apple/constant.ENFILE.html | 0 doc/libc/unix/bsd/apple/constant.ENOATTR.html | 0 doc/libc/unix/bsd/apple/constant.ENOBUFS.html | 0 doc/libc/unix/bsd/apple/constant.ENODATA.html | 0 doc/libc/unix/bsd/apple/constant.ENODEV.html | 0 doc/libc/unix/bsd/apple/constant.ENOENT.html | 0 doc/libc/unix/bsd/apple/constant.ENOEXEC.html | 0 doc/libc/unix/bsd/apple/constant.ENOLCK.html | 0 doc/libc/unix/bsd/apple/constant.ENOLINK.html | 0 doc/libc/unix/bsd/apple/constant.ENOMEM.html | 0 doc/libc/unix/bsd/apple/constant.ENOMSG.html | 0 .../unix/bsd/apple/constant.ENOPOLICY.html | 0 .../unix/bsd/apple/constant.ENOPROTOOPT.html | 0 doc/libc/unix/bsd/apple/constant.ENOSPC.html | 0 doc/libc/unix/bsd/apple/constant.ENOSR.html | 0 doc/libc/unix/bsd/apple/constant.ENOSTR.html | 0 doc/libc/unix/bsd/apple/constant.ENOSYS.html | 0 doc/libc/unix/bsd/apple/constant.ENOTBLK.html | 0 .../unix/bsd/apple/constant.ENOTCONN.html | 0 doc/libc/unix/bsd/apple/constant.ENOTDIR.html | 0 .../unix/bsd/apple/constant.ENOTEMPTY.html | 0 .../bsd/apple/constant.ENOTRECOVERABLE.html | 0 .../unix/bsd/apple/constant.ENOTSOCK.html | 0 doc/libc/unix/bsd/apple/constant.ENOTSUP.html | 0 doc/libc/unix/bsd/apple/constant.ENOTTY.html | 0 doc/libc/unix/bsd/apple/constant.ENXIO.html | 0 doc/libc/unix/bsd/apple/constant.EOF.html | 0 .../unix/bsd/apple/constant.EOPNOTSUPP.html | 0 .../unix/bsd/apple/constant.EOVERFLOW.html | 0 .../unix/bsd/apple/constant.EOWNERDEAD.html | 0 doc/libc/unix/bsd/apple/constant.EPERM.html | 0 .../unix/bsd/apple/constant.EPFNOSUPPORT.html | 0 doc/libc/unix/bsd/apple/constant.EPIPE.html | 0 .../unix/bsd/apple/constant.EPROCLIM.html | 0 .../unix/bsd/apple/constant.EPROCUNAVAIL.html | 0 .../bsd/apple/constant.EPROGMISMATCH.html | 0 .../unix/bsd/apple/constant.EPROGUNAVAIL.html | 0 doc/libc/unix/bsd/apple/constant.EPROTO.html | 0 .../bsd/apple/constant.EPROTONOSUPPORT.html | 0 .../unix/bsd/apple/constant.EPROTOTYPE.html | 0 doc/libc/unix/bsd/apple/constant.EPWROFF.html | 0 doc/libc/unix/bsd/apple/constant.EQFULL.html | 0 doc/libc/unix/bsd/apple/constant.ERA.html | 0 doc/libc/unix/bsd/apple/constant.ERANGE.html | 0 .../unix/bsd/apple/constant.ERA_D_FMT.html | 0 .../unix/bsd/apple/constant.ERA_D_T_FMT.html | 0 .../unix/bsd/apple/constant.ERA_T_FMT.html | 0 doc/libc/unix/bsd/apple/constant.EREMOTE.html | 0 doc/libc/unix/bsd/apple/constant.EROFS.html | 0 .../unix/bsd/apple/constant.ERPCMISMATCH.html | 0 .../unix/bsd/apple/constant.ESHLIBVERS.html | 0 .../unix/bsd/apple/constant.ESHUTDOWN.html | 0 .../bsd/apple/constant.ESOCKTNOSUPPORT.html | 0 doc/libc/unix/bsd/apple/constant.ESPIPE.html | 0 doc/libc/unix/bsd/apple/constant.ESRCH.html | 0 doc/libc/unix/bsd/apple/constant.ESTALE.html | 0 doc/libc/unix/bsd/apple/constant.ETIME.html | 0 .../unix/bsd/apple/constant.ETIMEDOUT.html | 0 .../unix/bsd/apple/constant.ETOOMANYREFS.html | 0 doc/libc/unix/bsd/apple/constant.ETXTBSY.html | 0 doc/libc/unix/bsd/apple/constant.EUSERS.html | 0 .../unix/bsd/apple/constant.EVFILT_AIO.html | 0 .../unix/bsd/apple/constant.EVFILT_FS.html | 0 .../bsd/apple/constant.EVFILT_MACHPORT.html | 0 .../unix/bsd/apple/constant.EVFILT_PROC.html | 0 .../unix/bsd/apple/constant.EVFILT_READ.html | 0 .../bsd/apple/constant.EVFILT_SIGNAL.html | 0 .../bsd/apple/constant.EVFILT_SYSCOUNT.html | 0 .../unix/bsd/apple/constant.EVFILT_TIMER.html | 0 .../unix/bsd/apple/constant.EVFILT_USER.html | 0 .../unix/bsd/apple/constant.EVFILT_VM.html | 0 .../unix/bsd/apple/constant.EVFILT_VNODE.html | 0 .../unix/bsd/apple/constant.EVFILT_WRITE.html | 0 .../unix/bsd/apple/constant.EV_DISPATCH.html | 0 .../unix/bsd/apple/constant.EV_FLAG0.html | 0 .../unix/bsd/apple/constant.EV_OOBAND.html | 0 doc/libc/unix/bsd/apple/constant.EV_POLL.html | 0 .../unix/bsd/apple/constant.EV_RECEIPT.html | 0 .../unix/bsd/apple/constant.EWOULDBLOCK.html | 0 doc/libc/unix/bsd/apple/constant.EXDEV.html | 0 .../unix/bsd/apple/constant.EXIT_FAILURE.html | 0 .../unix/bsd/apple/constant.EXIT_SUCCESS.html | 0 .../unix/bsd/apple/constant.FD_SETSIZE.html | 0 doc/libc/unix/bsd/apple/constant.FF0.html | 0 doc/libc/unix/bsd/apple/constant.FF1.html | 0 .../unix/bsd/apple/constant.FILENAME_MAX.html | 0 .../unix/bsd/apple/constant.FOPEN_MAX.html | 0 .../bsd/apple/constant.F_ALLOCATEALL.html | 0 .../bsd/apple/constant.F_ALLOCATECONTIG.html | 0 doc/libc/unix/bsd/apple/constant.F_DUPFD.html | 0 .../bsd/apple/constant.F_DUPFD_CLOEXEC.html | 0 .../unix/bsd/apple/constant.F_FREEZE_FS.html | 0 .../unix/bsd/apple/constant.F_FULLFSYNC.html | 0 doc/libc/unix/bsd/apple/constant.F_GETFD.html | 0 doc/libc/unix/bsd/apple/constant.F_GETFL.html | 0 doc/libc/unix/bsd/apple/constant.F_GETLK.html | 0 .../unix/bsd/apple/constant.F_GETPATH.html | 0 .../bsd/apple/constant.F_GLOBAL_NOCACHE.html | 0 doc/libc/unix/bsd/apple/constant.F_LOCK.html | 0 .../unix/bsd/apple/constant.F_NOCACHE.html | 0 .../unix/bsd/apple/constant.F_NODIRECT.html | 0 doc/libc/unix/bsd/apple/constant.F_OK.html | 0 .../bsd/apple/constant.F_PEOFPOSMODE.html | 0 .../bsd/apple/constant.F_PREALLOCATE.html | 0 .../unix/bsd/apple/constant.F_RDADVISE.html | 0 .../unix/bsd/apple/constant.F_RDAHEAD.html | 0 doc/libc/unix/bsd/apple/constant.F_SETFD.html | 0 doc/libc/unix/bsd/apple/constant.F_SETFL.html | 0 doc/libc/unix/bsd/apple/constant.F_SETLK.html | 0 .../unix/bsd/apple/constant.F_SETLKW.html | 0 doc/libc/unix/bsd/apple/constant.F_TEST.html | 0 .../unix/bsd/apple/constant.F_THAW_FS.html | 0 doc/libc/unix/bsd/apple/constant.F_TLOCK.html | 0 doc/libc/unix/bsd/apple/constant.F_ULOCK.html | 0 .../unix/bsd/apple/constant.F_VOLPOSMODE.html | 0 .../unix/bsd/apple/constant.GLOB_ABORTED.html | 0 .../unix/bsd/apple/constant.GLOB_APPEND.html | 0 .../unix/bsd/apple/constant.GLOB_DOOFFS.html | 0 .../unix/bsd/apple/constant.GLOB_ERR.html | 0 .../unix/bsd/apple/constant.GLOB_MARK.html | 0 .../unix/bsd/apple/constant.GLOB_NOCHECK.html | 0 .../bsd/apple/constant.GLOB_NOESCAPE.html | 0 .../unix/bsd/apple/constant.GLOB_NOMATCH.html | 0 .../unix/bsd/apple/constant.GLOB_NOSORT.html | 0 .../unix/bsd/apple/constant.GLOB_NOSPACE.html | 0 .../unix/bsd/apple/constant.HW_AVAILCPU.html | 0 .../unix/bsd/apple/constant.IFF_LOOPBACK.html | 0 .../unix/bsd/apple/constant.IPPROTO_IP.html | 0 .../unix/bsd/apple/constant.IPPROTO_IPV6.html | 0 .../unix/bsd/apple/constant.IPPROTO_RAW.html | 0 .../unix/bsd/apple/constant.IPPROTO_TCP.html | 0 .../bsd/apple/constant.IPV6_JOIN_GROUP.html | 0 .../bsd/apple/constant.IPV6_LEAVE_GROUP.html | 0 .../bsd/apple/constant.IP_ADD_MEMBERSHIP.html | 0 .../apple/constant.IP_DROP_MEMBERSHIP.html | 0 .../unix/bsd/apple/constant.IP_HDRINCL.html | 0 .../bsd/apple/constant.IP_MULTICAST_LOOP.html | 0 .../bsd/apple/constant.IP_MULTICAST_TTL.html | 0 doc/libc/unix/bsd/apple/constant.IP_TTL.html | 0 doc/libc/unix/bsd/apple/constant.IUTF8.html | 0 .../unix/bsd/apple/constant.LC_ALL_MASK.html | 0 .../bsd/apple/constant.LC_COLLATE_MASK.html | 0 .../bsd/apple/constant.LC_CTYPE_MASK.html | 0 .../bsd/apple/constant.LC_MESSAGES_MASK.html | 0 .../bsd/apple/constant.LC_MONETARY_MASK.html | 0 .../bsd/apple/constant.LC_NUMERIC_MASK.html | 0 .../unix/bsd/apple/constant.LC_TIME_MASK.html | 0 doc/libc/unix/bsd/apple/constant.LOCK_EX.html | 0 doc/libc/unix/bsd/apple/constant.LOCK_NB.html | 0 doc/libc/unix/bsd/apple/constant.LOCK_SH.html | 0 doc/libc/unix/bsd/apple/constant.LOCK_UN.html | 0 .../unix/bsd/apple/constant.L_tmpnam.html | 0 .../bsd/apple/constant.MADV_CAN_REUSE.html | 0 .../bsd/apple/constant.MADV_DONTNEED.html | 0 .../unix/bsd/apple/constant.MADV_FREE.html | 0 .../apple/constant.MADV_FREE_REUSABLE.html | 0 .../bsd/apple/constant.MADV_FREE_REUSE.html | 0 .../unix/bsd/apple/constant.MADV_NORMAL.html | 0 .../unix/bsd/apple/constant.MADV_RANDOM.html | 0 .../bsd/apple/constant.MADV_SEQUENTIAL.html | 0 .../bsd/apple/constant.MADV_WILLNEED.html | 0 .../apple/constant.MADV_ZERO_WIRED_PAGES.html | 0 .../unix/bsd/apple/constant.MAP_ANON.html | 0 .../unix/bsd/apple/constant.MAP_COPY.html | 0 .../unix/bsd/apple/constant.MAP_FAILED.html | 0 .../unix/bsd/apple/constant.MAP_FILE.html | 0 .../unix/bsd/apple/constant.MAP_FIXED.html | 0 .../bsd/apple/constant.MAP_HASSEMAPHORE.html | 0 doc/libc/unix/bsd/apple/constant.MAP_JIT.html | 0 .../unix/bsd/apple/constant.MAP_NOCACHE.html | 0 .../unix/bsd/apple/constant.MAP_NOEXTEND.html | 0 .../bsd/apple/constant.MAP_NORESERVE.html | 0 .../unix/bsd/apple/constant.MAP_PRIVATE.html | 0 .../unix/bsd/apple/constant.MAP_RENAME.html | 0 .../unix/bsd/apple/constant.MAP_SHARED.html | 0 .../unix/bsd/apple/constant.MCL_CURRENT.html | 0 .../unix/bsd/apple/constant.MCL_FUTURE.html | 0 .../bsd/apple/constant.MINCORE_INCORE.html | 0 .../bsd/apple/constant.MINCORE_MODIFIED.html | 0 .../constant.MINCORE_MODIFIED_OTHER.html | 0 .../apple/constant.MINCORE_REFERENCED.html | 0 .../constant.MINCORE_REFERENCED_OTHER.html | 0 doc/libc/unix/bsd/apple/constant.MON_1.html | 0 doc/libc/unix/bsd/apple/constant.MON_10.html | 0 doc/libc/unix/bsd/apple/constant.MON_11.html | 0 doc/libc/unix/bsd/apple/constant.MON_12.html | 0 doc/libc/unix/bsd/apple/constant.MON_2.html | 0 doc/libc/unix/bsd/apple/constant.MON_3.html | 0 doc/libc/unix/bsd/apple/constant.MON_4.html | 0 doc/libc/unix/bsd/apple/constant.MON_5.html | 0 doc/libc/unix/bsd/apple/constant.MON_6.html | 0 doc/libc/unix/bsd/apple/constant.MON_7.html | 0 doc/libc/unix/bsd/apple/constant.MON_8.html | 0 doc/libc/unix/bsd/apple/constant.MON_9.html | 0 .../unix/bsd/apple/constant.MS_ASYNC.html | 0 .../bsd/apple/constant.MS_DEACTIVATE.html | 0 .../bsd/apple/constant.MS_INVALIDATE.html | 0 .../unix/bsd/apple/constant.MS_KILLPAGES.html | 0 doc/libc/unix/bsd/apple/constant.MS_SYNC.html | 0 .../unix/bsd/apple/constant.NI_MAXHOST.html | 0 doc/libc/unix/bsd/apple/constant.NL0.html | 0 doc/libc/unix/bsd/apple/constant.NL1.html | 0 doc/libc/unix/bsd/apple/constant.NOEXPR.html | 0 doc/libc/unix/bsd/apple/constant.NOSTR.html | 0 .../bsd/apple/constant.NOTE_ABSOLUTE.html | 0 .../bsd/apple/constant.NOTE_EXITSTATUS.html | 0 .../apple/constant.NOTE_EXIT_REPARENTED.html | 0 .../unix/bsd/apple/constant.NOTE_FFAND.html | 0 .../unix/bsd/apple/constant.NOTE_FFCOPY.html | 0 .../bsd/apple/constant.NOTE_FFCTRLMASK.html | 0 .../bsd/apple/constant.NOTE_FFLAGSMASK.html | 0 .../unix/bsd/apple/constant.NOTE_FFNOP.html | 0 .../unix/bsd/apple/constant.NOTE_FFOR.html | 0 .../unix/bsd/apple/constant.NOTE_NONE.html | 0 .../bsd/apple/constant.NOTE_NSECONDS.html | 0 .../bsd/apple/constant.NOTE_PCTRLMASK.html | 0 .../unix/bsd/apple/constant.NOTE_REAP.html | 0 .../unix/bsd/apple/constant.NOTE_SECONDS.html | 0 .../unix/bsd/apple/constant.NOTE_SIGNAL.html | 0 .../unix/bsd/apple/constant.NOTE_TRIGGER.html | 0 .../bsd/apple/constant.NOTE_USECONDS.html | 0 .../bsd/apple/constant.NOTE_VM_ERROR.html | 0 .../bsd/apple/constant.NOTE_VM_PRESSURE.html | 0 ...ant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html | 0 .../constant.NOTE_VM_PRESSURE_TERMINATE.html | 0 .../unix/bsd/apple/constant.O_ACCMODE.html | 0 .../unix/bsd/apple/constant.O_APPEND.html | 0 .../unix/bsd/apple/constant.O_CLOEXEC.html | 0 doc/libc/unix/bsd/apple/constant.O_CREAT.html | 0 .../unix/bsd/apple/constant.O_DIRECTORY.html | 0 doc/libc/unix/bsd/apple/constant.O_DSYNC.html | 0 doc/libc/unix/bsd/apple/constant.O_EXCL.html | 0 .../unix/bsd/apple/constant.O_NOCTTY.html | 0 .../unix/bsd/apple/constant.O_NONBLOCK.html | 0 .../unix/bsd/apple/constant.O_RDONLY.html | 0 doc/libc/unix/bsd/apple/constant.O_RDWR.html | 0 doc/libc/unix/bsd/apple/constant.O_SYNC.html | 0 doc/libc/unix/bsd/apple/constant.O_TRUNC.html | 0 .../unix/bsd/apple/constant.O_WRONLY.html | 0 doc/libc/unix/bsd/apple/constant.PM_STR.html | 0 .../apple/constant.POSIX_MADV_DONTNEED.html | 0 .../bsd/apple/constant.POSIX_MADV_NORMAL.html | 0 .../bsd/apple/constant.POSIX_MADV_RANDOM.html | 0 .../apple/constant.POSIX_MADV_SEQUENTIAL.html | 0 .../apple/constant.POSIX_MADV_WILLNEED.html | 0 .../unix/bsd/apple/constant.PROT_EXEC.html | 0 .../unix/bsd/apple/constant.PROT_NONE.html | 0 .../unix/bsd/apple/constant.PROT_READ.html | 0 .../unix/bsd/apple/constant.PROT_WRITE.html | 0 .../constant.PTHREAD_COND_INITIALIZER.html | 0 .../constant.PTHREAD_CREATE_DETACHED.html | 0 .../constant.PTHREAD_CREATE_JOINABLE.html | 0 .../constant.PTHREAD_MUTEX_INITIALIZER.html | 0 .../constant.PTHREAD_MUTEX_RECURSIVE.html | 0 .../constant.PTHREAD_RWLOCK_INITIALIZER.html | 0 .../bsd/apple/constant.PTHREAD_STACK_MIN.html | 0 .../unix/bsd/apple/constant.Q_GETQUOTA.html | 0 .../unix/bsd/apple/constant.Q_SETQUOTA.html | 0 .../unix/bsd/apple/constant.RADIXCHAR.html | 0 .../unix/bsd/apple/constant.RAND_MAX.html | 0 .../unix/bsd/apple/constant.RLIMIT_AS.html | 0 .../unix/bsd/apple/constant.RLIMIT_CORE.html | 0 .../unix/bsd/apple/constant.RLIMIT_CPU.html | 0 .../unix/bsd/apple/constant.RLIMIT_DATA.html | 0 .../unix/bsd/apple/constant.RLIMIT_FSIZE.html | 0 .../bsd/apple/constant.RLIMIT_MEMLOCK.html | 0 .../bsd/apple/constant.RLIMIT_NOFILE.html | 0 .../unix/bsd/apple/constant.RLIMIT_NPROC.html | 0 .../unix/bsd/apple/constant.RLIMIT_RSS.html | 0 .../unix/bsd/apple/constant.RLIMIT_STACK.html | 0 .../bsd/apple/constant.RLIM_INFINITY.html | 0 .../unix/bsd/apple/constant.RLIM_NLIMITS.html | 0 .../unix/bsd/apple/constant.RTLD_FIRST.html | 0 .../unix/bsd/apple/constant.RTLD_GLOBAL.html | 0 .../unix/bsd/apple/constant.RTLD_LOCAL.html | 0 .../bsd/apple/constant.RTLD_NODELETE.html | 0 .../unix/bsd/apple/constant.RTLD_NOLOAD.html | 0 .../bsd/apple/constant.RUSAGE_CHILDREN.html | 0 .../unix/bsd/apple/constant.RUSAGE_SELF.html | 0 doc/libc/unix/bsd/apple/constant.R_OK.html | 0 .../unix/bsd/apple/constant.SEEK_CUR.html | 0 .../unix/bsd/apple/constant.SEEK_END.html | 0 .../unix/bsd/apple/constant.SEEK_SET.html | 0 doc/libc/unix/bsd/apple/constant.SHUT_RD.html | 0 .../unix/bsd/apple/constant.SHUT_RDWR.html | 0 doc/libc/unix/bsd/apple/constant.SHUT_WR.html | 0 doc/libc/unix/bsd/apple/constant.SIGABRT.html | 0 doc/libc/unix/bsd/apple/constant.SIGALRM.html | 0 doc/libc/unix/bsd/apple/constant.SIGEMT.html | 0 doc/libc/unix/bsd/apple/constant.SIGFPE.html | 0 doc/libc/unix/bsd/apple/constant.SIGHUP.html | 0 doc/libc/unix/bsd/apple/constant.SIGILL.html | 0 doc/libc/unix/bsd/apple/constant.SIGINT.html | 0 doc/libc/unix/bsd/apple/constant.SIGKILL.html | 0 doc/libc/unix/bsd/apple/constant.SIGPIPE.html | 0 doc/libc/unix/bsd/apple/constant.SIGQUIT.html | 0 doc/libc/unix/bsd/apple/constant.SIGSEGV.html | 0 .../unix/bsd/apple/constant.SIGSTKSZ.html | 0 doc/libc/unix/bsd/apple/constant.SIGTERM.html | 0 doc/libc/unix/bsd/apple/constant.SIGTRAP.html | 0 .../unix/bsd/apple/constant.SOCK_DGRAM.html | 0 .../unix/bsd/apple/constant.SOCK_RAW.html | 0 .../unix/bsd/apple/constant.SOCK_STREAM.html | 0 .../unix/bsd/apple/constant.SOL_SOCKET.html | 0 .../bsd/apple/constant.SO_ACCEPTCONN.html | 0 .../unix/bsd/apple/constant.SO_BROADCAST.html | 0 .../unix/bsd/apple/constant.SO_DEBUG.html | 0 .../unix/bsd/apple/constant.SO_DONTROUTE.html | 0 .../unix/bsd/apple/constant.SO_DONTTRUNC.html | 0 .../unix/bsd/apple/constant.SO_ERROR.html | 0 .../unix/bsd/apple/constant.SO_KEEPALIVE.html | 0 .../unix/bsd/apple/constant.SO_LINGER.html | 0 doc/libc/unix/bsd/apple/constant.SO_NKE.html | 0 .../unix/bsd/apple/constant.SO_NOADDRERR.html | 0 .../unix/bsd/apple/constant.SO_NOSIGPIPE.html | 0 .../unix/bsd/apple/constant.SO_NREAD.html | 0 .../unix/bsd/apple/constant.SO_NWRITE.html | 0 .../unix/bsd/apple/constant.SO_OOBINLINE.html | 0 .../unix/bsd/apple/constant.SO_RCVBUF.html | 0 .../unix/bsd/apple/constant.SO_RCVLOWAT.html | 0 .../unix/bsd/apple/constant.SO_RCVTIMEO.html | 0 .../unix/bsd/apple/constant.SO_REUSEADDR.html | 0 .../unix/bsd/apple/constant.SO_REUSEPORT.html | 0 .../unix/bsd/apple/constant.SO_SNDBUF.html | 0 .../unix/bsd/apple/constant.SO_SNDLOWAT.html | 0 .../unix/bsd/apple/constant.SO_SNDTIMEO.html | 0 doc/libc/unix/bsd/apple/constant.SO_TYPE.html | 0 .../bsd/apple/constant.SO_USELOOPBACK.html | 0 .../unix/bsd/apple/constant.SO_WANTMORE.html | 0 .../bsd/apple/constant.SO_WANTOOBFLAG.html | 0 .../bsd/apple/constant.STDERR_FILENO.html | 0 .../unix/bsd/apple/constant.STDIN_FILENO.html | 0 .../bsd/apple/constant.STDOUT_FILENO.html | 0 .../unix/bsd/apple/constant.ST_NOSUID.html | 0 doc/libc/unix/bsd/apple/constant.S_IEXEC.html | 0 doc/libc/unix/bsd/apple/constant.S_IFBLK.html | 0 doc/libc/unix/bsd/apple/constant.S_IFCHR.html | 0 doc/libc/unix/bsd/apple/constant.S_IFDIR.html | 0 doc/libc/unix/bsd/apple/constant.S_IFIFO.html | 0 doc/libc/unix/bsd/apple/constant.S_IFLNK.html | 0 doc/libc/unix/bsd/apple/constant.S_IFMT.html | 0 doc/libc/unix/bsd/apple/constant.S_IFREG.html | 0 .../unix/bsd/apple/constant.S_IFSOCK.html | 0 doc/libc/unix/bsd/apple/constant.S_IREAD.html | 0 doc/libc/unix/bsd/apple/constant.S_IRGRP.html | 0 doc/libc/unix/bsd/apple/constant.S_IROTH.html | 0 doc/libc/unix/bsd/apple/constant.S_IRUSR.html | 0 doc/libc/unix/bsd/apple/constant.S_IRWXG.html | 0 doc/libc/unix/bsd/apple/constant.S_IRWXO.html | 0 doc/libc/unix/bsd/apple/constant.S_IRWXU.html | 0 doc/libc/unix/bsd/apple/constant.S_IWGRP.html | 0 doc/libc/unix/bsd/apple/constant.S_IWOTH.html | 0 .../unix/bsd/apple/constant.S_IWRITE.html | 0 doc/libc/unix/bsd/apple/constant.S_IWUSR.html | 0 doc/libc/unix/bsd/apple/constant.S_IXGRP.html | 0 doc/libc/unix/bsd/apple/constant.S_IXOTH.html | 0 doc/libc/unix/bsd/apple/constant.S_IXUSR.html | 0 doc/libc/unix/bsd/apple/constant.TAB0.html | 0 doc/libc/unix/bsd/apple/constant.TAB1.html | 0 doc/libc/unix/bsd/apple/constant.TAB2.html | 0 doc/libc/unix/bsd/apple/constant.TAB3.html | 0 .../bsd/apple/constant.TCP_KEEPALIVE.html | 0 .../unix/bsd/apple/constant.TCP_NODELAY.html | 0 doc/libc/unix/bsd/apple/constant.THOUSEP.html | 0 .../unix/bsd/apple/constant.TIOCCBRK.html | 0 .../unix/bsd/apple/constant.TIOCCDTR.html | 0 .../unix/bsd/apple/constant.TIOCCONS.html | 0 .../bsd/apple/constant.TIOCDCDTIMESTAMP.html | 0 .../unix/bsd/apple/constant.TIOCDRAIN.html | 0 .../bsd/apple/constant.TIOCDSIMICROCODE.html | 0 .../unix/bsd/apple/constant.TIOCEXCL.html | 0 doc/libc/unix/bsd/apple/constant.TIOCEXT.html | 0 .../unix/bsd/apple/constant.TIOCFLUSH.html | 0 .../bsd/apple/constant.TIOCGDRAINWAIT.html | 0 .../unix/bsd/apple/constant.TIOCGETD.html | 0 .../unix/bsd/apple/constant.TIOCGPGRP.html | 0 .../unix/bsd/apple/constant.TIOCGWINSZ.html | 0 .../unix/bsd/apple/constant.TIOCIXOFF.html | 0 .../unix/bsd/apple/constant.TIOCIXON.html | 0 .../unix/bsd/apple/constant.TIOCMBIC.html | 0 .../unix/bsd/apple/constant.TIOCMBIS.html | 0 .../bsd/apple/constant.TIOCMGDTRWAIT.html | 0 .../unix/bsd/apple/constant.TIOCMGET.html | 0 .../unix/bsd/apple/constant.TIOCMODG.html | 0 .../unix/bsd/apple/constant.TIOCMODS.html | 0 .../bsd/apple/constant.TIOCMSDTRWAIT.html | 0 .../unix/bsd/apple/constant.TIOCMSET.html | 0 .../unix/bsd/apple/constant.TIOCM_CAR.html | 0 .../unix/bsd/apple/constant.TIOCM_CD.html | 0 .../unix/bsd/apple/constant.TIOCM_CTS.html | 0 .../unix/bsd/apple/constant.TIOCM_DSR.html | 0 .../unix/bsd/apple/constant.TIOCM_DTR.html | 0 .../unix/bsd/apple/constant.TIOCM_LE.html | 0 .../unix/bsd/apple/constant.TIOCM_RI.html | 0 .../unix/bsd/apple/constant.TIOCM_RNG.html | 0 .../unix/bsd/apple/constant.TIOCM_RTS.html | 0 .../unix/bsd/apple/constant.TIOCM_SR.html | 0 .../unix/bsd/apple/constant.TIOCM_ST.html | 0 .../unix/bsd/apple/constant.TIOCNOTTY.html | 0 .../unix/bsd/apple/constant.TIOCNXCL.html | 0 .../unix/bsd/apple/constant.TIOCOUTQ.html | 0 doc/libc/unix/bsd/apple/constant.TIOCPKT.html | 0 .../unix/bsd/apple/constant.TIOCPKT_DATA.html | 0 .../bsd/apple/constant.TIOCPKT_DOSTOP.html | 0 .../bsd/apple/constant.TIOCPKT_FLUSHREAD.html | 0 .../apple/constant.TIOCPKT_FLUSHWRITE.html | 0 .../bsd/apple/constant.TIOCPKT_IOCTL.html | 0 .../bsd/apple/constant.TIOCPKT_NOSTOP.html | 0 .../bsd/apple/constant.TIOCPKT_START.html | 0 .../unix/bsd/apple/constant.TIOCPKT_STOP.html | 0 .../unix/bsd/apple/constant.TIOCPTYGNAME.html | 0 .../unix/bsd/apple/constant.TIOCPTYGRANT.html | 0 .../unix/bsd/apple/constant.TIOCPTYUNLK.html | 0 .../unix/bsd/apple/constant.TIOCREMOTE.html | 0 .../unix/bsd/apple/constant.TIOCSBRK.html | 0 .../unix/bsd/apple/constant.TIOCSCONS.html | 0 .../unix/bsd/apple/constant.TIOCSCTTY.html | 0 .../bsd/apple/constant.TIOCSDRAINWAIT.html | 0 .../unix/bsd/apple/constant.TIOCSDTR.html | 0 .../unix/bsd/apple/constant.TIOCSETD.html | 0 doc/libc/unix/bsd/apple/constant.TIOCSIG.html | 0 .../unix/bsd/apple/constant.TIOCSPGRP.html | 0 .../unix/bsd/apple/constant.TIOCSTART.html | 0 .../unix/bsd/apple/constant.TIOCSTAT.html | 0 doc/libc/unix/bsd/apple/constant.TIOCSTI.html | 0 .../unix/bsd/apple/constant.TIOCSTOP.html | 0 .../unix/bsd/apple/constant.TIOCSWINSZ.html | 0 .../bsd/apple/constant.TIOCTIMESTAMP.html | 0 .../unix/bsd/apple/constant.TIOCUCNTL.html | 0 doc/libc/unix/bsd/apple/constant.TMP_MAX.html | 0 doc/libc/unix/bsd/apple/constant.T_FMT.html | 0 .../unix/bsd/apple/constant.T_FMT_AMPM.html | 0 doc/libc/unix/bsd/apple/constant.VT0.html | 0 doc/libc/unix/bsd/apple/constant.VT1.html | 0 doc/libc/unix/bsd/apple/constant.W_OK.html | 0 doc/libc/unix/bsd/apple/constant.X_OK.html | 0 doc/libc/unix/bsd/apple/constant.YESEXPR.html | 0 doc/libc/unix/bsd/apple/constant.YESSTR.html | 0 doc/libc/unix/bsd/apple/constant._IOFBF.html | 0 doc/libc/unix/bsd/apple/constant._IOLBF.html | 0 doc/libc/unix/bsd/apple/constant._IONBF.html | 0 .../unix/bsd/apple/constant._PC_NAME_MAX.html | 0 .../constant._PTHREAD_COND_SIG_init.html | 0 .../constant._PTHREAD_MUTEX_SIG_init.html | 0 .../constant._PTHREAD_RWLOCK_SIG_init.html | 0 .../apple/constant._RLIMIT_POSIX_FLAG.html | 0 .../bsd/apple/constant._SC_2_CHAR_TERM.html | 0 .../unix/bsd/apple/constant._SC_2_C_BIND.html | 0 .../unix/bsd/apple/constant._SC_2_C_DEV.html | 0 .../bsd/apple/constant._SC_2_FORT_DEV.html | 0 .../bsd/apple/constant._SC_2_FORT_RUN.html | 0 .../bsd/apple/constant._SC_2_LOCALEDEF.html | 0 .../unix/bsd/apple/constant._SC_2_PBS.html | 0 .../apple/constant._SC_2_PBS_ACCOUNTING.html | 0 .../apple/constant._SC_2_PBS_CHECKPOINT.html | 0 .../bsd/apple/constant._SC_2_PBS_LOCATE.html | 0 .../bsd/apple/constant._SC_2_PBS_MESSAGE.html | 0 .../bsd/apple/constant._SC_2_PBS_TRACK.html | 0 .../unix/bsd/apple/constant._SC_2_SW_DEV.html | 0 .../unix/bsd/apple/constant._SC_2_UPE.html | 0 .../bsd/apple/constant._SC_2_VERSION.html | 0 .../bsd/apple/constant._SC_ADVISORY_INFO.html | 0 .../apple/constant._SC_AIO_LISTIO_MAX.html | 0 .../unix/bsd/apple/constant._SC_AIO_MAX.html | 0 .../constant._SC_AIO_PRIO_DELTA_MAX.html | 0 .../unix/bsd/apple/constant._SC_ARG_MAX.html | 0 .../apple/constant._SC_ASYNCHRONOUS_IO.html | 0 .../bsd/apple/constant._SC_ATEXIT_MAX.html | 0 .../unix/bsd/apple/constant._SC_BARRIERS.html | 0 .../bsd/apple/constant._SC_BC_BASE_MAX.html | 0 .../bsd/apple/constant._SC_BC_DIM_MAX.html | 0 .../bsd/apple/constant._SC_BC_SCALE_MAX.html | 0 .../bsd/apple/constant._SC_BC_STRING_MAX.html | 0 .../bsd/apple/constant._SC_CHILD_MAX.html | 0 .../unix/bsd/apple/constant._SC_CLK_TCK.html | 0 .../apple/constant._SC_CLOCK_SELECTION.html | 0 .../apple/constant._SC_COLL_WEIGHTS_MAX.html | 0 .../unix/bsd/apple/constant._SC_CPUTIME.html | 0 .../apple/constant._SC_DELAYTIMER_MAX.html | 0 .../bsd/apple/constant._SC_EXPR_NEST_MAX.html | 0 .../bsd/apple/constant._SC_FILE_LOCKING.html | 0 .../unix/bsd/apple/constant._SC_FSYNC.html | 0 .../apple/constant._SC_GETGR_R_SIZE_MAX.html | 0 .../apple/constant._SC_GETPW_R_SIZE_MAX.html | 0 .../bsd/apple/constant._SC_HOST_NAME_MAX.html | 0 .../unix/bsd/apple/constant._SC_IOV_MAX.html | 0 .../unix/bsd/apple/constant._SC_IPV6.html | 0 .../bsd/apple/constant._SC_JOB_CONTROL.html | 0 .../unix/bsd/apple/constant._SC_LINE_MAX.html | 0 .../apple/constant._SC_LOGIN_NAME_MAX.html | 0 .../bsd/apple/constant._SC_MAPPED_FILES.html | 0 .../unix/bsd/apple/constant._SC_MEMLOCK.html | 0 .../bsd/apple/constant._SC_MEMLOCK_RANGE.html | 0 .../apple/constant._SC_MEMORY_PROTECTION.html | 0 .../apple/constant._SC_MESSAGE_PASSING.html | 0 .../apple/constant._SC_MONOTONIC_CLOCK.html | 0 .../bsd/apple/constant._SC_MQ_OPEN_MAX.html | 0 .../bsd/apple/constant._SC_MQ_PRIO_MAX.html | 0 .../bsd/apple/constant._SC_NGROUPS_MAX.html | 0 .../apple/constant._SC_NPROCESSORS_CONF.html | 0 .../apple/constant._SC_NPROCESSORS_ONLN.html | 0 .../unix/bsd/apple/constant._SC_OPEN_MAX.html | 0 .../unix/bsd/apple/constant._SC_PAGESIZE.html | 0 .../bsd/apple/constant._SC_PAGE_SIZE.html | 0 .../unix/bsd/apple/constant._SC_PASS_MAX.html | 0 .../apple/constant._SC_PRIORITIZED_IO.html | 0 .../constant._SC_PRIORITY_SCHEDULING.html | 0 .../bsd/apple/constant._SC_RAW_SOCKETS.html | 0 .../constant._SC_READER_WRITER_LOCKS.html | 0 .../apple/constant._SC_REALTIME_SIGNALS.html | 0 .../unix/bsd/apple/constant._SC_REGEXP.html | 0 .../bsd/apple/constant._SC_RE_DUP_MAX.html | 0 .../bsd/apple/constant._SC_RTSIG_MAX.html | 0 .../bsd/apple/constant._SC_SAVED_IDS.html | 0 .../bsd/apple/constant._SC_SEMAPHORES.html | 0 .../bsd/apple/constant._SC_SEM_NSEMS_MAX.html | 0 .../bsd/apple/constant._SC_SEM_VALUE_MAX.html | 0 .../constant._SC_SHARED_MEMORY_OBJECTS.html | 0 .../unix/bsd/apple/constant._SC_SHELL.html | 0 .../bsd/apple/constant._SC_SIGQUEUE_MAX.html | 0 .../unix/bsd/apple/constant._SC_SPAWN.html | 0 .../bsd/apple/constant._SC_SPIN_LOCKS.html | 0 .../apple/constant._SC_SPORADIC_SERVER.html | 0 .../bsd/apple/constant._SC_SS_REPL_MAX.html | 0 .../bsd/apple/constant._SC_STREAM_MAX.html | 0 .../bsd/apple/constant._SC_SYMLOOP_MAX.html | 0 .../apple/constant._SC_SYNCHRONIZED_IO.html | 0 .../unix/bsd/apple/constant._SC_THREADS.html | 0 .../constant._SC_THREAD_ATTR_STACKADDR.html | 0 .../constant._SC_THREAD_ATTR_STACKSIZE.html | 0 .../apple/constant._SC_THREAD_CPUTIME.html | 0 ...tant._SC_THREAD_DESTRUCTOR_ITERATIONS.html | 0 .../apple/constant._SC_THREAD_KEYS_MAX.html | 0 ...nstant._SC_THREAD_PRIORITY_SCHEDULING.html | 0 .../constant._SC_THREAD_PRIO_INHERIT.html | 0 .../constant._SC_THREAD_PRIO_PROTECT.html | 0 .../constant._SC_THREAD_PROCESS_SHARED.html | 0 .../constant._SC_THREAD_SAFE_FUNCTIONS.html | 0 .../constant._SC_THREAD_SPORADIC_SERVER.html | 0 .../apple/constant._SC_THREAD_STACK_MIN.html | 0 .../constant._SC_THREAD_THREADS_MAX.html | 0 .../unix/bsd/apple/constant._SC_TIMEOUTS.html | 0 .../unix/bsd/apple/constant._SC_TIMERS.html | 0 .../bsd/apple/constant._SC_TIMER_MAX.html | 0 .../unix/bsd/apple/constant._SC_TRACE.html | 0 .../constant._SC_TRACE_EVENT_FILTER.html | 0 .../constant._SC_TRACE_EVENT_NAME_MAX.html | 0 .../bsd/apple/constant._SC_TRACE_INHERIT.html | 0 .../bsd/apple/constant._SC_TRACE_LOG.html | 0 .../apple/constant._SC_TRACE_NAME_MAX.html | 0 .../bsd/apple/constant._SC_TRACE_SYS_MAX.html | 0 .../constant._SC_TRACE_USER_EVENT_MAX.html | 0 .../bsd/apple/constant._SC_TTY_NAME_MAX.html | 0 .../constant._SC_TYPED_MEMORY_OBJECTS.html | 0 .../bsd/apple/constant._SC_TZNAME_MAX.html | 0 .../apple/constant._SC_V6_ILP32_OFF32.html | 0 .../apple/constant._SC_V6_ILP32_OFFBIG.html | 0 .../bsd/apple/constant._SC_V6_LP64_OFF64.html | 0 .../apple/constant._SC_V6_LPBIG_OFFBIG.html | 0 .../unix/bsd/apple/constant._SC_VERSION.html | 0 .../apple/constant._SC_XBS5_ILP32_OFF32.html | 0 .../apple/constant._SC_XBS5_ILP32_OFFBIG.html | 0 .../apple/constant._SC_XBS5_LP64_OFF64.html | 0 .../apple/constant._SC_XBS5_LPBIG_OFFBIG.html | 0 .../bsd/apple/constant._SC_XOPEN_CRYPT.html | 0 .../apple/constant._SC_XOPEN_ENH_I18N.html | 0 .../bsd/apple/constant._SC_XOPEN_LEGACY.html | 0 .../apple/constant._SC_XOPEN_REALTIME.html | 0 .../constant._SC_XOPEN_REALTIME_THREADS.html | 0 .../bsd/apple/constant._SC_XOPEN_SHM.html | 0 .../bsd/apple/constant._SC_XOPEN_STREAMS.html | 0 .../bsd/apple/constant._SC_XOPEN_UNIX.html | 0 .../bsd/apple/constant._SC_XOPEN_VERSION.html | 0 .../apple/constant._SC_XOPEN_XCU_VERSION.html | 0 .../unix/bsd/apple/constant._WSTOPPED.html | 0 .../apple/constant.__PTHREAD_COND_SIZE__.html | 0 .../constant.__PTHREAD_MUTEX_SIZE__.html | 0 .../constant.__PTHREAD_RWLOCK_SIZE__.html | 0 doc/libc/unix/bsd/apple/enum.timezone.html | 10 - doc/libc/unix/bsd/apple/fn.WIFCONTINUED.html | 10 - doc/libc/unix/bsd/apple/fn.WIFSIGNALED.html | 10 - doc/libc/unix/bsd/apple/fn.WIFSTOPPED.html | 10 - doc/libc/unix/bsd/apple/fn.WSTOPSIG.html | 10 - doc/libc/unix/bsd/apple/fn._WSTATUS.html | 10 - doc/libc/unix/bsd/apple/fn.__error.html | 10 - doc/libc/unix/bsd/apple/fn.backtrace.html | 10 - doc/libc/unix/bsd/apple/fn.duplocale.html | 10 - doc/libc/unix/bsd/apple/fn.forkpty.html | 10 - doc/libc/unix/bsd/apple/fn.freelocale.html | 10 - doc/libc/unix/bsd/apple/fn.fstatfs.html | 10 - doc/libc/unix/bsd/apple/fn.getnameinfo.html | 10 - doc/libc/unix/bsd/apple/fn.kevent.html | 10 - doc/libc/unix/bsd/apple/fn.kevent64.html | 10 - doc/libc/unix/bsd/apple/fn.localeconv_l.html | 10 - .../unix/bsd/apple/fn.mach_absolute_time.html | 10 - .../unix/bsd/apple/fn.mach_timebase_info.html | 10 - doc/libc/unix/bsd/apple/fn.mincore.html | 10 - doc/libc/unix/bsd/apple/fn.mount.html | 10 - doc/libc/unix/bsd/apple/fn.mprotect.html | 10 - doc/libc/unix/bsd/apple/fn.newlocale.html | 10 - doc/libc/unix/bsd/apple/fn.openpty.html | 10 - .../apple/fn.pthread_get_stackaddr_np.html | 10 - .../apple/fn.pthread_get_stacksize_np.html | 10 - .../unix/bsd/apple/fn.pthread_setname_np.html | 10 - doc/libc/unix/bsd/apple/fn.ptrace.html | 10 - doc/libc/unix/bsd/apple/fn.querylocale.html | 10 - doc/libc/unix/bsd/apple/fn.quotactl.html | 10 - doc/libc/unix/bsd/apple/fn.sendfile.html | 10 - doc/libc/unix/bsd/apple/fn.sethostname.html | 10 - doc/libc/unix/bsd/apple/fn.shm_open.html | 10 - doc/libc/unix/bsd/apple/fn.statfs.html | 10 - doc/libc/unix/bsd/apple/fn.sysctl.html | 10 - doc/libc/unix/bsd/apple/fn.sysctlbyname.html | 10 - .../unix/bsd/apple/fn.sysctlnametomib.html | 10 - doc/libc/unix/bsd/apple/fn.uselocale.html | 10 - doc/libc/unix/bsd/apple/index.html | 0 doc/libc/unix/bsd/apple/sidebar-items.js | 1 - doc/libc/unix/bsd/apple/struct.Dl_info.html | 10 - doc/libc/unix/bsd/apple/struct.addrinfo.html | 10 - doc/libc/unix/bsd/apple/struct.dirent.html | 10 - doc/libc/unix/bsd/apple/struct.dqblk.html | 10 - doc/libc/unix/bsd/apple/struct.flock.html | 10 - doc/libc/unix/bsd/apple/struct.fstore_t.html | 10 - doc/libc/unix/bsd/apple/struct.glob_t.html | 10 - doc/libc/unix/bsd/apple/struct.kevent.html | 10 - .../unix/bsd/apple/struct.kevent64_s.html | 10 - doc/libc/unix/bsd/apple/struct.lconv.html | 10 - .../bsd/apple/struct.mach_timebase_info.html | 10 - .../unix/bsd/apple/struct.pthread_attr_t.html | 10 - .../unix/bsd/apple/struct.pthread_cond_t.html | 10 - .../bsd/apple/struct.pthread_mutex_t.html | 10 - .../bsd/apple/struct.pthread_mutexattr_t.html | 10 - .../bsd/apple/struct.pthread_rwlock_t.html | 10 - doc/libc/unix/bsd/apple/struct.radvisory.html | 10 - doc/libc/unix/bsd/apple/struct.sf_hdtr.html | 10 - doc/libc/unix/bsd/apple/struct.sigaction.html | 10 - doc/libc/unix/bsd/apple/struct.siginfo_t.html | 10 - .../unix/bsd/apple/struct.sockaddr_in.html | 10 - .../bsd/apple/struct.sockaddr_storage.html | 10 - doc/libc/unix/bsd/apple/struct.stack_t.html | 10 - doc/libc/unix/bsd/apple/struct.stat.html | 10 - doc/libc/unix/bsd/apple/struct.statfs.html | 10 - doc/libc/unix/bsd/apple/struct.statvfs.html | 10 - doc/libc/unix/bsd/apple/struct.termios.html | 10 - doc/libc/unix/bsd/apple/type.blksize_t.html | 10 - doc/libc/unix/bsd/apple/type.c_long.html | 10 - doc/libc/unix/bsd/apple/type.c_ulong.html | 10 - doc/libc/unix/bsd/apple/type.clock_t.html | 10 - doc/libc/unix/bsd/apple/type.dev_t.html | 10 - doc/libc/unix/bsd/apple/type.fsblkcnt_t.html | 10 - doc/libc/unix/bsd/apple/type.fsfilcnt_t.html | 10 - doc/libc/unix/bsd/apple/type.ino_t.html | 10 - .../apple/type.mach_timebase_info_data_t.html | 10 - doc/libc/unix/bsd/apple/type.mode_t.html | 10 - doc/libc/unix/bsd/apple/type.nl_item.html | 10 - doc/libc/unix/bsd/apple/type.nlink_t.html | 10 - .../unix/bsd/apple/type.pthread_key_t.html | 10 - doc/libc/unix/bsd/apple/type.rlim_t.html | 10 - doc/libc/unix/bsd/apple/type.sigset_t.html | 10 - doc/libc/unix/bsd/apple/type.speed_t.html | 10 - doc/libc/unix/bsd/apple/type.suseconds_t.html | 10 - doc/libc/unix/bsd/apple/type.tcflag_t.html | 10 - doc/libc/unix/bsd/apple/type.time_t.html | 10 - .../bsd/b64/constant.TIOCDCDTIMESTAMP.html | 0 .../unix/bsd/b64/constant.TIOCTIMESTAMP.html | 0 .../b64/constant.__PTHREAD_COND_SIZE__.html | 0 .../b64/constant.__PTHREAD_MUTEX_SIZE__.html | 0 .../b64/constant.__PTHREAD_RWLOCK_SIZE__.html | 0 doc/libc/unix/bsd/b64/index.html | 0 doc/libc/unix/bsd/b64/sidebar-items.js | 1 - .../unix/bsd/b64/struct.pthread_attr_t.html | 10 - doc/libc/unix/bsd/b64/type.c_long.html | 10 - doc/libc/unix/bsd/b64/type.c_ulong.html | 10 - doc/libc/unix/bsd/constant.ABDAY_1.html | 0 doc/libc/unix/bsd/constant.ABDAY_2.html | 0 doc/libc/unix/bsd/constant.ABDAY_3.html | 0 doc/libc/unix/bsd/constant.ABDAY_4.html | 0 doc/libc/unix/bsd/constant.ABDAY_5.html | 0 doc/libc/unix/bsd/constant.ABDAY_6.html | 0 doc/libc/unix/bsd/constant.ABDAY_7.html | 0 doc/libc/unix/bsd/constant.ABMON_1.html | 0 doc/libc/unix/bsd/constant.ABMON_10.html | 0 doc/libc/unix/bsd/constant.ABMON_11.html | 0 doc/libc/unix/bsd/constant.ABMON_12.html | 0 doc/libc/unix/bsd/constant.ABMON_2.html | 0 doc/libc/unix/bsd/constant.ABMON_3.html | 0 doc/libc/unix/bsd/constant.ABMON_4.html | 0 doc/libc/unix/bsd/constant.ABMON_5.html | 0 doc/libc/unix/bsd/constant.ABMON_6.html | 0 doc/libc/unix/bsd/constant.ABMON_7.html | 0 doc/libc/unix/bsd/constant.ABMON_8.html | 0 doc/libc/unix/bsd/constant.ABMON_9.html | 0 doc/libc/unix/bsd/constant.AF_INET.html | 0 doc/libc/unix/bsd/constant.AF_INET6.html | 0 doc/libc/unix/bsd/constant.AF_UNIX.html | 0 doc/libc/unix/bsd/constant.ALT_DIGITS.html | 0 doc/libc/unix/bsd/constant.AM_STR.html | 0 doc/libc/unix/bsd/constant.BRKINT.html | 0 doc/libc/unix/bsd/constant.BS0.html | 0 doc/libc/unix/bsd/constant.BS1.html | 0 doc/libc/unix/bsd/constant.BUFSIZ.html | 0 doc/libc/unix/bsd/constant.CLOCAL.html | 0 doc/libc/unix/bsd/constant.CODESET.html | 0 doc/libc/unix/bsd/constant.CR0.html | 0 doc/libc/unix/bsd/constant.CR1.html | 0 doc/libc/unix/bsd/constant.CR2.html | 0 doc/libc/unix/bsd/constant.CR3.html | 0 doc/libc/unix/bsd/constant.CREAD.html | 0 doc/libc/unix/bsd/constant.CRNCYSTR.html | 0 doc/libc/unix/bsd/constant.CRTSCTS.html | 0 doc/libc/unix/bsd/constant.CS5.html | 0 doc/libc/unix/bsd/constant.CS6.html | 0 doc/libc/unix/bsd/constant.CS7.html | 0 doc/libc/unix/bsd/constant.CS8.html | 0 doc/libc/unix/bsd/constant.CSIZE.html | 0 doc/libc/unix/bsd/constant.CSTOPB.html | 0 doc/libc/unix/bsd/constant.CTL_HW.html | 0 doc/libc/unix/bsd/constant.DAY_1.html | 0 doc/libc/unix/bsd/constant.DAY_2.html | 0 doc/libc/unix/bsd/constant.DAY_3.html | 0 doc/libc/unix/bsd/constant.DAY_4.html | 0 doc/libc/unix/bsd/constant.DAY_5.html | 0 doc/libc/unix/bsd/constant.DAY_6.html | 0 doc/libc/unix/bsd/constant.DAY_7.html | 0 doc/libc/unix/bsd/constant.D_FMT.html | 0 doc/libc/unix/bsd/constant.D_MD_ORDER.html | 0 doc/libc/unix/bsd/constant.D_T_FMT.html | 0 doc/libc/unix/bsd/constant.E2BIG.html | 0 doc/libc/unix/bsd/constant.EACCES.html | 0 doc/libc/unix/bsd/constant.EADDRINUSE.html | 0 doc/libc/unix/bsd/constant.EADDRNOTAVAIL.html | 0 doc/libc/unix/bsd/constant.EAFNOSUPPORT.html | 0 doc/libc/unix/bsd/constant.EAGAIN.html | 0 doc/libc/unix/bsd/constant.EALREADY.html | 0 doc/libc/unix/bsd/constant.EAUTH.html | 0 doc/libc/unix/bsd/constant.EBADARCH.html | 0 doc/libc/unix/bsd/constant.EBADEXEC.html | 0 doc/libc/unix/bsd/constant.EBADF.html | 0 doc/libc/unix/bsd/constant.EBADMACHO.html | 0 doc/libc/unix/bsd/constant.EBADMSG.html | 0 doc/libc/unix/bsd/constant.EBADRPC.html | 0 doc/libc/unix/bsd/constant.EBUSY.html | 0 doc/libc/unix/bsd/constant.ECANCELED.html | 0 doc/libc/unix/bsd/constant.ECHILD.html | 0 doc/libc/unix/bsd/constant.ECHO.html | 0 doc/libc/unix/bsd/constant.ECHOCTL.html | 0 doc/libc/unix/bsd/constant.ECHOE.html | 0 doc/libc/unix/bsd/constant.ECHOK.html | 0 doc/libc/unix/bsd/constant.ECHOKE.html | 0 doc/libc/unix/bsd/constant.ECHONL.html | 0 doc/libc/unix/bsd/constant.ECHOPRT.html | 0 doc/libc/unix/bsd/constant.ECONNABORTED.html | 0 doc/libc/unix/bsd/constant.ECONNREFUSED.html | 0 doc/libc/unix/bsd/constant.ECONNRESET.html | 0 doc/libc/unix/bsd/constant.EDEADLK.html | 0 doc/libc/unix/bsd/constant.EDESTADDRREQ.html | 0 doc/libc/unix/bsd/constant.EDEVERR.html | 0 doc/libc/unix/bsd/constant.EDOM.html | 0 doc/libc/unix/bsd/constant.EDQUOT.html | 0 doc/libc/unix/bsd/constant.EEXIST.html | 0 doc/libc/unix/bsd/constant.EFAULT.html | 0 doc/libc/unix/bsd/constant.EFBIG.html | 0 doc/libc/unix/bsd/constant.EFTYPE.html | 0 doc/libc/unix/bsd/constant.EHOSTDOWN.html | 0 doc/libc/unix/bsd/constant.EHOSTUNREACH.html | 0 doc/libc/unix/bsd/constant.EIDRM.html | 0 doc/libc/unix/bsd/constant.EILSEQ.html | 0 doc/libc/unix/bsd/constant.EINPROGRESS.html | 0 doc/libc/unix/bsd/constant.EINTR.html | 0 doc/libc/unix/bsd/constant.EINVAL.html | 0 doc/libc/unix/bsd/constant.EIO.html | 0 doc/libc/unix/bsd/constant.EISCONN.html | 0 doc/libc/unix/bsd/constant.EISDIR.html | 0 doc/libc/unix/bsd/constant.ELAST.html | 0 doc/libc/unix/bsd/constant.ELOOP.html | 0 doc/libc/unix/bsd/constant.EMFILE.html | 0 doc/libc/unix/bsd/constant.EMLINK.html | 0 doc/libc/unix/bsd/constant.EMSGSIZE.html | 0 doc/libc/unix/bsd/constant.EMULTIHOP.html | 0 doc/libc/unix/bsd/constant.ENAMETOOLONG.html | 0 doc/libc/unix/bsd/constant.ENEEDAUTH.html | 0 doc/libc/unix/bsd/constant.ENETDOWN.html | 0 doc/libc/unix/bsd/constant.ENETRESET.html | 0 doc/libc/unix/bsd/constant.ENETUNREACH.html | 0 doc/libc/unix/bsd/constant.ENFILE.html | 0 doc/libc/unix/bsd/constant.ENOATTR.html | 0 doc/libc/unix/bsd/constant.ENOBUFS.html | 0 doc/libc/unix/bsd/constant.ENODATA.html | 0 doc/libc/unix/bsd/constant.ENODEV.html | 0 doc/libc/unix/bsd/constant.ENOENT.html | 0 doc/libc/unix/bsd/constant.ENOEXEC.html | 0 doc/libc/unix/bsd/constant.ENOLCK.html | 0 doc/libc/unix/bsd/constant.ENOLINK.html | 0 doc/libc/unix/bsd/constant.ENOMEM.html | 0 doc/libc/unix/bsd/constant.ENOMSG.html | 0 doc/libc/unix/bsd/constant.ENOPOLICY.html | 0 doc/libc/unix/bsd/constant.ENOPROTOOPT.html | 0 doc/libc/unix/bsd/constant.ENOSPC.html | 0 doc/libc/unix/bsd/constant.ENOSR.html | 0 doc/libc/unix/bsd/constant.ENOSTR.html | 0 doc/libc/unix/bsd/constant.ENOSYS.html | 0 doc/libc/unix/bsd/constant.ENOTBLK.html | 0 doc/libc/unix/bsd/constant.ENOTCONN.html | 0 doc/libc/unix/bsd/constant.ENOTDIR.html | 0 doc/libc/unix/bsd/constant.ENOTEMPTY.html | 0 .../unix/bsd/constant.ENOTRECOVERABLE.html | 0 doc/libc/unix/bsd/constant.ENOTSOCK.html | 0 doc/libc/unix/bsd/constant.ENOTSUP.html | 0 doc/libc/unix/bsd/constant.ENOTTY.html | 0 doc/libc/unix/bsd/constant.ENXIO.html | 0 doc/libc/unix/bsd/constant.EOF.html | 0 doc/libc/unix/bsd/constant.EOPNOTSUPP.html | 0 doc/libc/unix/bsd/constant.EOVERFLOW.html | 0 doc/libc/unix/bsd/constant.EOWNERDEAD.html | 0 doc/libc/unix/bsd/constant.EPERM.html | 0 doc/libc/unix/bsd/constant.EPFNOSUPPORT.html | 0 doc/libc/unix/bsd/constant.EPIPE.html | 0 doc/libc/unix/bsd/constant.EPROCLIM.html | 0 doc/libc/unix/bsd/constant.EPROCUNAVAIL.html | 0 doc/libc/unix/bsd/constant.EPROGMISMATCH.html | 0 doc/libc/unix/bsd/constant.EPROGUNAVAIL.html | 0 doc/libc/unix/bsd/constant.EPROTO.html | 0 .../unix/bsd/constant.EPROTONOSUPPORT.html | 0 doc/libc/unix/bsd/constant.EPROTOTYPE.html | 0 doc/libc/unix/bsd/constant.EPWROFF.html | 0 doc/libc/unix/bsd/constant.EQFULL.html | 0 doc/libc/unix/bsd/constant.ERA.html | 0 doc/libc/unix/bsd/constant.ERANGE.html | 0 doc/libc/unix/bsd/constant.ERA_D_FMT.html | 0 doc/libc/unix/bsd/constant.ERA_D_T_FMT.html | 0 doc/libc/unix/bsd/constant.ERA_T_FMT.html | 0 doc/libc/unix/bsd/constant.EREMOTE.html | 0 doc/libc/unix/bsd/constant.EROFS.html | 0 doc/libc/unix/bsd/constant.ERPCMISMATCH.html | 0 doc/libc/unix/bsd/constant.ESHLIBVERS.html | 0 doc/libc/unix/bsd/constant.ESHUTDOWN.html | 0 .../unix/bsd/constant.ESOCKTNOSUPPORT.html | 0 doc/libc/unix/bsd/constant.ESPIPE.html | 0 doc/libc/unix/bsd/constant.ESRCH.html | 0 doc/libc/unix/bsd/constant.ESTALE.html | 0 doc/libc/unix/bsd/constant.ETIME.html | 0 doc/libc/unix/bsd/constant.ETIMEDOUT.html | 0 doc/libc/unix/bsd/constant.ETOOMANYREFS.html | 0 doc/libc/unix/bsd/constant.ETXTBSY.html | 0 doc/libc/unix/bsd/constant.EUSERS.html | 0 doc/libc/unix/bsd/constant.EVFILT_AIO.html | 0 doc/libc/unix/bsd/constant.EVFILT_FS.html | 0 .../unix/bsd/constant.EVFILT_MACHPORT.html | 0 doc/libc/unix/bsd/constant.EVFILT_PROC.html | 0 doc/libc/unix/bsd/constant.EVFILT_READ.html | 0 doc/libc/unix/bsd/constant.EVFILT_SIGNAL.html | 0 .../unix/bsd/constant.EVFILT_SYSCOUNT.html | 0 doc/libc/unix/bsd/constant.EVFILT_TIMER.html | 0 doc/libc/unix/bsd/constant.EVFILT_USER.html | 0 doc/libc/unix/bsd/constant.EVFILT_VM.html | 0 doc/libc/unix/bsd/constant.EVFILT_VNODE.html | 0 doc/libc/unix/bsd/constant.EVFILT_WRITE.html | 0 doc/libc/unix/bsd/constant.EV_ADD.html | 0 doc/libc/unix/bsd/constant.EV_CLEAR.html | 0 doc/libc/unix/bsd/constant.EV_DELETE.html | 0 doc/libc/unix/bsd/constant.EV_DISABLE.html | 0 doc/libc/unix/bsd/constant.EV_DISPATCH.html | 0 doc/libc/unix/bsd/constant.EV_ENABLE.html | 0 doc/libc/unix/bsd/constant.EV_EOF.html | 0 doc/libc/unix/bsd/constant.EV_ERROR.html | 0 doc/libc/unix/bsd/constant.EV_FLAG0.html | 0 doc/libc/unix/bsd/constant.EV_FLAG1.html | 0 doc/libc/unix/bsd/constant.EV_ONESHOT.html | 0 doc/libc/unix/bsd/constant.EV_OOBAND.html | 0 doc/libc/unix/bsd/constant.EV_POLL.html | 0 doc/libc/unix/bsd/constant.EV_RECEIPT.html | 0 doc/libc/unix/bsd/constant.EV_SYSFLAGS.html | 0 doc/libc/unix/bsd/constant.EWOULDBLOCK.html | 0 doc/libc/unix/bsd/constant.EXDEV.html | 0 doc/libc/unix/bsd/constant.EXIT_FAILURE.html | 0 doc/libc/unix/bsd/constant.EXIT_SUCCESS.html | 0 doc/libc/unix/bsd/constant.EXTPROC.html | 0 doc/libc/unix/bsd/constant.FD_SETSIZE.html | 0 doc/libc/unix/bsd/constant.FF0.html | 0 doc/libc/unix/bsd/constant.FF1.html | 0 doc/libc/unix/bsd/constant.FILENAME_MAX.html | 0 doc/libc/unix/bsd/constant.FIOCLEX.html | 0 doc/libc/unix/bsd/constant.FIONBIO.html | 0 doc/libc/unix/bsd/constant.FLUSHO.html | 0 doc/libc/unix/bsd/constant.FOPEN_MAX.html | 0 doc/libc/unix/bsd/constant.F_ALLOCATEALL.html | 0 .../unix/bsd/constant.F_ALLOCATECONTIG.html | 0 doc/libc/unix/bsd/constant.F_DUPFD.html | 0 .../unix/bsd/constant.F_DUPFD_CLOEXEC.html | 0 doc/libc/unix/bsd/constant.F_FREEZE_FS.html | 0 doc/libc/unix/bsd/constant.F_FULLFSYNC.html | 0 doc/libc/unix/bsd/constant.F_GETFD.html | 0 doc/libc/unix/bsd/constant.F_GETFL.html | 0 doc/libc/unix/bsd/constant.F_GETLK.html | 0 doc/libc/unix/bsd/constant.F_GETOWN.html | 0 doc/libc/unix/bsd/constant.F_GETPATH.html | 0 .../unix/bsd/constant.F_GLOBAL_NOCACHE.html | 0 doc/libc/unix/bsd/constant.F_LOCK.html | 0 doc/libc/unix/bsd/constant.F_NOCACHE.html | 0 doc/libc/unix/bsd/constant.F_NODIRECT.html | 0 doc/libc/unix/bsd/constant.F_OK.html | 0 doc/libc/unix/bsd/constant.F_PEOFPOSMODE.html | 0 doc/libc/unix/bsd/constant.F_PREALLOCATE.html | 0 doc/libc/unix/bsd/constant.F_RDADVISE.html | 0 doc/libc/unix/bsd/constant.F_RDAHEAD.html | 0 doc/libc/unix/bsd/constant.F_SETFD.html | 0 doc/libc/unix/bsd/constant.F_SETFL.html | 0 doc/libc/unix/bsd/constant.F_SETLK.html | 0 doc/libc/unix/bsd/constant.F_SETLKW.html | 0 doc/libc/unix/bsd/constant.F_SETOWN.html | 0 doc/libc/unix/bsd/constant.F_TEST.html | 0 doc/libc/unix/bsd/constant.F_THAW_FS.html | 0 doc/libc/unix/bsd/constant.F_TLOCK.html | 0 doc/libc/unix/bsd/constant.F_ULOCK.html | 0 doc/libc/unix/bsd/constant.F_VOLPOSMODE.html | 0 doc/libc/unix/bsd/constant.GLOB_ABORTED.html | 0 doc/libc/unix/bsd/constant.GLOB_APPEND.html | 0 doc/libc/unix/bsd/constant.GLOB_DOOFFS.html | 0 doc/libc/unix/bsd/constant.GLOB_ERR.html | 0 doc/libc/unix/bsd/constant.GLOB_MARK.html | 0 doc/libc/unix/bsd/constant.GLOB_NOCHECK.html | 0 doc/libc/unix/bsd/constant.GLOB_NOESCAPE.html | 0 doc/libc/unix/bsd/constant.GLOB_NOMATCH.html | 0 doc/libc/unix/bsd/constant.GLOB_NOSORT.html | 0 doc/libc/unix/bsd/constant.GLOB_NOSPACE.html | 0 doc/libc/unix/bsd/constant.HUPCL.html | 0 doc/libc/unix/bsd/constant.HW_AVAILCPU.html | 0 doc/libc/unix/bsd/constant.HW_NCPU.html | 0 doc/libc/unix/bsd/constant.ICANON.html | 0 doc/libc/unix/bsd/constant.ICRNL.html | 0 doc/libc/unix/bsd/constant.IEXTEN.html | 0 doc/libc/unix/bsd/constant.IFF_LOOPBACK.html | 0 doc/libc/unix/bsd/constant.IGNBRK.html | 0 doc/libc/unix/bsd/constant.IGNCR.html | 0 doc/libc/unix/bsd/constant.IGNPAR.html | 0 doc/libc/unix/bsd/constant.IMAXBEL.html | 0 doc/libc/unix/bsd/constant.INLCR.html | 0 doc/libc/unix/bsd/constant.INPCK.html | 0 doc/libc/unix/bsd/constant.IPPROTO_IP.html | 0 doc/libc/unix/bsd/constant.IPPROTO_IPV6.html | 0 doc/libc/unix/bsd/constant.IPPROTO_RAW.html | 0 doc/libc/unix/bsd/constant.IPPROTO_TCP.html | 0 .../unix/bsd/constant.IPV6_JOIN_GROUP.html | 0 .../unix/bsd/constant.IPV6_LEAVE_GROUP.html | 0 .../bsd/constant.IPV6_MULTICAST_LOOP.html | 0 doc/libc/unix/bsd/constant.IPV6_V6ONLY.html | 0 .../unix/bsd/constant.IP_ADD_MEMBERSHIP.html | 0 .../unix/bsd/constant.IP_DROP_MEMBERSHIP.html | 0 doc/libc/unix/bsd/constant.IP_HDRINCL.html | 0 .../unix/bsd/constant.IP_MULTICAST_LOOP.html | 0 .../unix/bsd/constant.IP_MULTICAST_TTL.html | 0 doc/libc/unix/bsd/constant.IP_TTL.html | 0 doc/libc/unix/bsd/constant.ISIG.html | 0 doc/libc/unix/bsd/constant.ISTRIP.html | 0 doc/libc/unix/bsd/constant.IUTF8.html | 0 doc/libc/unix/bsd/constant.IXANY.html | 0 doc/libc/unix/bsd/constant.IXOFF.html | 0 doc/libc/unix/bsd/constant.IXON.html | 0 doc/libc/unix/bsd/constant.LC_ALL.html | 0 doc/libc/unix/bsd/constant.LC_ALL_MASK.html | 0 doc/libc/unix/bsd/constant.LC_COLLATE.html | 0 .../unix/bsd/constant.LC_COLLATE_MASK.html | 0 doc/libc/unix/bsd/constant.LC_CTYPE.html | 0 doc/libc/unix/bsd/constant.LC_CTYPE_MASK.html | 0 doc/libc/unix/bsd/constant.LC_MESSAGES.html | 0 .../unix/bsd/constant.LC_MESSAGES_MASK.html | 0 doc/libc/unix/bsd/constant.LC_MONETARY.html | 0 .../unix/bsd/constant.LC_MONETARY_MASK.html | 0 doc/libc/unix/bsd/constant.LC_NUMERIC.html | 0 .../unix/bsd/constant.LC_NUMERIC_MASK.html | 0 doc/libc/unix/bsd/constant.LC_TIME.html | 0 doc/libc/unix/bsd/constant.LC_TIME_MASK.html | 0 doc/libc/unix/bsd/constant.LOCK_EX.html | 0 doc/libc/unix/bsd/constant.LOCK_NB.html | 0 doc/libc/unix/bsd/constant.LOCK_SH.html | 0 doc/libc/unix/bsd/constant.LOCK_UN.html | 0 doc/libc/unix/bsd/constant.L_tmpnam.html | 0 .../unix/bsd/constant.MADV_CAN_REUSE.html | 0 doc/libc/unix/bsd/constant.MADV_DONTNEED.html | 0 doc/libc/unix/bsd/constant.MADV_FREE.html | 0 .../unix/bsd/constant.MADV_FREE_REUSABLE.html | 0 .../unix/bsd/constant.MADV_FREE_REUSE.html | 0 doc/libc/unix/bsd/constant.MADV_NORMAL.html | 0 doc/libc/unix/bsd/constant.MADV_RANDOM.html | 0 .../unix/bsd/constant.MADV_SEQUENTIAL.html | 0 doc/libc/unix/bsd/constant.MADV_WILLNEED.html | 0 .../bsd/constant.MADV_ZERO_WIRED_PAGES.html | 0 doc/libc/unix/bsd/constant.MAP_ANON.html | 0 doc/libc/unix/bsd/constant.MAP_COPY.html | 0 doc/libc/unix/bsd/constant.MAP_FAILED.html | 0 doc/libc/unix/bsd/constant.MAP_FILE.html | 0 doc/libc/unix/bsd/constant.MAP_FIXED.html | 0 .../unix/bsd/constant.MAP_HASSEMAPHORE.html | 0 doc/libc/unix/bsd/constant.MAP_JIT.html | 0 doc/libc/unix/bsd/constant.MAP_NOCACHE.html | 0 doc/libc/unix/bsd/constant.MAP_NOEXTEND.html | 0 doc/libc/unix/bsd/constant.MAP_NORESERVE.html | 0 doc/libc/unix/bsd/constant.MAP_PRIVATE.html | 0 doc/libc/unix/bsd/constant.MAP_RENAME.html | 0 doc/libc/unix/bsd/constant.MAP_SHARED.html | 0 doc/libc/unix/bsd/constant.MCL_CURRENT.html | 0 doc/libc/unix/bsd/constant.MCL_FUTURE.html | 0 .../unix/bsd/constant.MINCORE_INCORE.html | 0 .../unix/bsd/constant.MINCORE_MODIFIED.html | 0 .../bsd/constant.MINCORE_MODIFIED_OTHER.html | 0 .../unix/bsd/constant.MINCORE_REFERENCED.html | 0 .../constant.MINCORE_REFERENCED_OTHER.html | 0 doc/libc/unix/bsd/constant.MNT_FORCE.html | 0 doc/libc/unix/bsd/constant.MON_1.html | 0 doc/libc/unix/bsd/constant.MON_10.html | 0 doc/libc/unix/bsd/constant.MON_11.html | 0 doc/libc/unix/bsd/constant.MON_12.html | 0 doc/libc/unix/bsd/constant.MON_2.html | 0 doc/libc/unix/bsd/constant.MON_3.html | 0 doc/libc/unix/bsd/constant.MON_4.html | 0 doc/libc/unix/bsd/constant.MON_5.html | 0 doc/libc/unix/bsd/constant.MON_6.html | 0 doc/libc/unix/bsd/constant.MON_7.html | 0 doc/libc/unix/bsd/constant.MON_8.html | 0 doc/libc/unix/bsd/constant.MON_9.html | 0 doc/libc/unix/bsd/constant.MS_ASYNC.html | 0 doc/libc/unix/bsd/constant.MS_DEACTIVATE.html | 0 doc/libc/unix/bsd/constant.MS_INVALIDATE.html | 0 doc/libc/unix/bsd/constant.MS_KILLPAGES.html | 0 doc/libc/unix/bsd/constant.MS_SYNC.html | 0 doc/libc/unix/bsd/constant.NCCS.html | 0 doc/libc/unix/bsd/constant.NI_MAXHOST.html | 0 doc/libc/unix/bsd/constant.NL0.html | 0 doc/libc/unix/bsd/constant.NL1.html | 0 doc/libc/unix/bsd/constant.NOEXPR.html | 0 doc/libc/unix/bsd/constant.NOFLSH.html | 0 doc/libc/unix/bsd/constant.NOSTR.html | 0 doc/libc/unix/bsd/constant.NOTE_ABSOLUTE.html | 0 doc/libc/unix/bsd/constant.NOTE_ATTRIB.html | 0 doc/libc/unix/bsd/constant.NOTE_CHILD.html | 0 doc/libc/unix/bsd/constant.NOTE_DELETE.html | 0 doc/libc/unix/bsd/constant.NOTE_EXEC.html | 0 doc/libc/unix/bsd/constant.NOTE_EXIT.html | 0 .../unix/bsd/constant.NOTE_EXITSTATUS.html | 0 .../bsd/constant.NOTE_EXIT_REPARENTED.html | 0 doc/libc/unix/bsd/constant.NOTE_EXTEND.html | 0 doc/libc/unix/bsd/constant.NOTE_FFAND.html | 0 doc/libc/unix/bsd/constant.NOTE_FFCOPY.html | 0 .../unix/bsd/constant.NOTE_FFCTRLMASK.html | 0 .../unix/bsd/constant.NOTE_FFLAGSMASK.html | 0 doc/libc/unix/bsd/constant.NOTE_FFNOP.html | 0 doc/libc/unix/bsd/constant.NOTE_FFOR.html | 0 doc/libc/unix/bsd/constant.NOTE_FORK.html | 0 doc/libc/unix/bsd/constant.NOTE_LINK.html | 0 doc/libc/unix/bsd/constant.NOTE_LOWAT.html | 0 doc/libc/unix/bsd/constant.NOTE_NONE.html | 0 doc/libc/unix/bsd/constant.NOTE_NSECONDS.html | 0 .../unix/bsd/constant.NOTE_PCTRLMASK.html | 0 .../unix/bsd/constant.NOTE_PDATAMASK.html | 0 doc/libc/unix/bsd/constant.NOTE_REAP.html | 0 doc/libc/unix/bsd/constant.NOTE_RENAME.html | 0 doc/libc/unix/bsd/constant.NOTE_REVOKE.html | 0 doc/libc/unix/bsd/constant.NOTE_SECONDS.html | 0 doc/libc/unix/bsd/constant.NOTE_SIGNAL.html | 0 doc/libc/unix/bsd/constant.NOTE_TRACK.html | 0 doc/libc/unix/bsd/constant.NOTE_TRACKERR.html | 0 doc/libc/unix/bsd/constant.NOTE_TRIGGER.html | 0 doc/libc/unix/bsd/constant.NOTE_USECONDS.html | 0 doc/libc/unix/bsd/constant.NOTE_VM_ERROR.html | 0 .../unix/bsd/constant.NOTE_VM_PRESSURE.html | 0 ...ant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html | 0 .../constant.NOTE_VM_PRESSURE_TERMINATE.html | 0 doc/libc/unix/bsd/constant.NOTE_WRITE.html | 0 doc/libc/unix/bsd/constant.ONLCR.html | 0 doc/libc/unix/bsd/constant.OPOST.html | 0 doc/libc/unix/bsd/constant.O_ACCMODE.html | 0 doc/libc/unix/bsd/constant.O_APPEND.html | 0 doc/libc/unix/bsd/constant.O_ASYNC.html | 0 doc/libc/unix/bsd/constant.O_CLOEXEC.html | 0 doc/libc/unix/bsd/constant.O_CREAT.html | 0 doc/libc/unix/bsd/constant.O_DIRECTORY.html | 0 doc/libc/unix/bsd/constant.O_DSYNC.html | 0 doc/libc/unix/bsd/constant.O_EXCL.html | 0 doc/libc/unix/bsd/constant.O_FSYNC.html | 0 doc/libc/unix/bsd/constant.O_NDELAY.html | 0 doc/libc/unix/bsd/constant.O_NOCTTY.html | 0 doc/libc/unix/bsd/constant.O_NOFOLLOW.html | 0 doc/libc/unix/bsd/constant.O_NONBLOCK.html | 0 doc/libc/unix/bsd/constant.O_RDONLY.html | 0 doc/libc/unix/bsd/constant.O_RDWR.html | 0 doc/libc/unix/bsd/constant.O_SYNC.html | 0 doc/libc/unix/bsd/constant.O_TRUNC.html | 0 doc/libc/unix/bsd/constant.O_WRONLY.html | 0 doc/libc/unix/bsd/constant.PARENB.html | 0 doc/libc/unix/bsd/constant.PARMRK.html | 0 doc/libc/unix/bsd/constant.PARODD.html | 0 doc/libc/unix/bsd/constant.PATH_MAX.html | 0 doc/libc/unix/bsd/constant.PENDIN.html | 0 doc/libc/unix/bsd/constant.PM_STR.html | 0 .../bsd/constant.POSIX_MADV_DONTNEED.html | 0 .../unix/bsd/constant.POSIX_MADV_NORMAL.html | 0 .../unix/bsd/constant.POSIX_MADV_RANDOM.html | 0 .../bsd/constant.POSIX_MADV_SEQUENTIAL.html | 0 .../bsd/constant.POSIX_MADV_WILLNEED.html | 0 doc/libc/unix/bsd/constant.PROT_EXEC.html | 0 doc/libc/unix/bsd/constant.PROT_NONE.html | 0 doc/libc/unix/bsd/constant.PROT_READ.html | 0 doc/libc/unix/bsd/constant.PROT_WRITE.html | 0 .../constant.PTHREAD_COND_INITIALIZER.html | 0 .../bsd/constant.PTHREAD_CREATE_DETACHED.html | 0 .../bsd/constant.PTHREAD_CREATE_JOINABLE.html | 0 .../constant.PTHREAD_MUTEX_INITIALIZER.html | 0 .../bsd/constant.PTHREAD_MUTEX_RECURSIVE.html | 0 .../constant.PTHREAD_RWLOCK_INITIALIZER.html | 0 .../unix/bsd/constant.PTHREAD_STACK_MIN.html | 0 doc/libc/unix/bsd/constant.Q_GETQUOTA.html | 0 doc/libc/unix/bsd/constant.Q_QUOTAOFF.html | 0 doc/libc/unix/bsd/constant.Q_QUOTAON.html | 0 doc/libc/unix/bsd/constant.Q_SETQUOTA.html | 0 doc/libc/unix/bsd/constant.Q_SYNC.html | 0 doc/libc/unix/bsd/constant.RADIXCHAR.html | 0 doc/libc/unix/bsd/constant.RAND_MAX.html | 0 doc/libc/unix/bsd/constant.RLIMIT_AS.html | 0 doc/libc/unix/bsd/constant.RLIMIT_CORE.html | 0 doc/libc/unix/bsd/constant.RLIMIT_CPU.html | 0 doc/libc/unix/bsd/constant.RLIMIT_DATA.html | 0 doc/libc/unix/bsd/constant.RLIMIT_FSIZE.html | 0 .../unix/bsd/constant.RLIMIT_MEMLOCK.html | 0 doc/libc/unix/bsd/constant.RLIMIT_NOFILE.html | 0 doc/libc/unix/bsd/constant.RLIMIT_NPROC.html | 0 doc/libc/unix/bsd/constant.RLIMIT_RSS.html | 0 doc/libc/unix/bsd/constant.RLIMIT_STACK.html | 0 doc/libc/unix/bsd/constant.RLIM_INFINITY.html | 0 doc/libc/unix/bsd/constant.RLIM_NLIMITS.html | 0 doc/libc/unix/bsd/constant.RTLD_DEFAULT.html | 0 doc/libc/unix/bsd/constant.RTLD_FIRST.html | 0 doc/libc/unix/bsd/constant.RTLD_GLOBAL.html | 0 doc/libc/unix/bsd/constant.RTLD_LOCAL.html | 0 doc/libc/unix/bsd/constant.RTLD_NODELETE.html | 0 doc/libc/unix/bsd/constant.RTLD_NOLOAD.html | 0 doc/libc/unix/bsd/constant.RTLD_NOW.html | 0 .../unix/bsd/constant.RUSAGE_CHILDREN.html | 0 doc/libc/unix/bsd/constant.RUSAGE_SELF.html | 0 doc/libc/unix/bsd/constant.R_OK.html | 0 doc/libc/unix/bsd/constant.SA_NOCLDSTOP.html | 0 doc/libc/unix/bsd/constant.SA_NOCLDWAIT.html | 0 doc/libc/unix/bsd/constant.SA_NODEFER.html | 0 doc/libc/unix/bsd/constant.SA_ONSTACK.html | 0 doc/libc/unix/bsd/constant.SA_RESETHAND.html | 0 doc/libc/unix/bsd/constant.SA_RESTART.html | 0 doc/libc/unix/bsd/constant.SA_SIGINFO.html | 0 doc/libc/unix/bsd/constant.SEEK_CUR.html | 0 doc/libc/unix/bsd/constant.SEEK_END.html | 0 doc/libc/unix/bsd/constant.SEEK_SET.html | 0 doc/libc/unix/bsd/constant.SHUT_RD.html | 0 doc/libc/unix/bsd/constant.SHUT_RDWR.html | 0 doc/libc/unix/bsd/constant.SHUT_WR.html | 0 doc/libc/unix/bsd/constant.SIGABRT.html | 0 doc/libc/unix/bsd/constant.SIGALRM.html | 0 doc/libc/unix/bsd/constant.SIGBUS.html | 0 doc/libc/unix/bsd/constant.SIGCHLD.html | 0 doc/libc/unix/bsd/constant.SIGCONT.html | 0 doc/libc/unix/bsd/constant.SIGEMT.html | 0 doc/libc/unix/bsd/constant.SIGFPE.html | 0 doc/libc/unix/bsd/constant.SIGHUP.html | 0 doc/libc/unix/bsd/constant.SIGILL.html | 0 doc/libc/unix/bsd/constant.SIGINFO.html | 0 doc/libc/unix/bsd/constant.SIGINT.html | 0 doc/libc/unix/bsd/constant.SIGIO.html | 0 doc/libc/unix/bsd/constant.SIGKILL.html | 0 doc/libc/unix/bsd/constant.SIGPIPE.html | 0 doc/libc/unix/bsd/constant.SIGPROF.html | 0 doc/libc/unix/bsd/constant.SIGQUIT.html | 0 doc/libc/unix/bsd/constant.SIGSEGV.html | 0 doc/libc/unix/bsd/constant.SIGSTKSZ.html | 0 doc/libc/unix/bsd/constant.SIGSTOP.html | 0 doc/libc/unix/bsd/constant.SIGSYS.html | 0 doc/libc/unix/bsd/constant.SIGTERM.html | 0 doc/libc/unix/bsd/constant.SIGTRAP.html | 0 doc/libc/unix/bsd/constant.SIGTSTP.html | 0 doc/libc/unix/bsd/constant.SIGTTIN.html | 0 doc/libc/unix/bsd/constant.SIGTTOU.html | 0 doc/libc/unix/bsd/constant.SIGURG.html | 0 doc/libc/unix/bsd/constant.SIGUSR1.html | 0 doc/libc/unix/bsd/constant.SIGUSR2.html | 0 doc/libc/unix/bsd/constant.SIGVTALRM.html | 0 doc/libc/unix/bsd/constant.SIGWINCH.html | 0 doc/libc/unix/bsd/constant.SIGXCPU.html | 0 doc/libc/unix/bsd/constant.SIGXFSZ.html | 0 doc/libc/unix/bsd/constant.SIG_BLOCK.html | 0 doc/libc/unix/bsd/constant.SIG_SETMASK.html | 0 doc/libc/unix/bsd/constant.SIG_UNBLOCK.html | 0 doc/libc/unix/bsd/constant.SOCK_DGRAM.html | 0 doc/libc/unix/bsd/constant.SOCK_RAW.html | 0 doc/libc/unix/bsd/constant.SOCK_STREAM.html | 0 doc/libc/unix/bsd/constant.SOL_SOCKET.html | 0 doc/libc/unix/bsd/constant.SO_ACCEPTCONN.html | 0 doc/libc/unix/bsd/constant.SO_BROADCAST.html | 0 doc/libc/unix/bsd/constant.SO_DEBUG.html | 0 doc/libc/unix/bsd/constant.SO_DONTROUTE.html | 0 doc/libc/unix/bsd/constant.SO_DONTTRUNC.html | 0 doc/libc/unix/bsd/constant.SO_ERROR.html | 0 doc/libc/unix/bsd/constant.SO_KEEPALIVE.html | 0 doc/libc/unix/bsd/constant.SO_LINGER.html | 0 doc/libc/unix/bsd/constant.SO_NKE.html | 0 doc/libc/unix/bsd/constant.SO_NOADDRERR.html | 0 doc/libc/unix/bsd/constant.SO_NOSIGPIPE.html | 0 doc/libc/unix/bsd/constant.SO_NREAD.html | 0 doc/libc/unix/bsd/constant.SO_NWRITE.html | 0 doc/libc/unix/bsd/constant.SO_OOBINLINE.html | 0 doc/libc/unix/bsd/constant.SO_RCVBUF.html | 0 doc/libc/unix/bsd/constant.SO_RCVLOWAT.html | 0 doc/libc/unix/bsd/constant.SO_RCVTIMEO.html | 0 doc/libc/unix/bsd/constant.SO_REUSEADDR.html | 0 doc/libc/unix/bsd/constant.SO_REUSEPORT.html | 0 doc/libc/unix/bsd/constant.SO_SNDBUF.html | 0 doc/libc/unix/bsd/constant.SO_SNDLOWAT.html | 0 doc/libc/unix/bsd/constant.SO_SNDTIMEO.html | 0 doc/libc/unix/bsd/constant.SO_TYPE.html | 0 .../unix/bsd/constant.SO_USELOOPBACK.html | 0 doc/libc/unix/bsd/constant.SO_WANTMORE.html | 0 .../unix/bsd/constant.SO_WANTOOBFLAG.html | 0 doc/libc/unix/bsd/constant.SS_DISABLE.html | 0 doc/libc/unix/bsd/constant.SS_ONSTACK.html | 0 doc/libc/unix/bsd/constant.STDERR_FILENO.html | 0 doc/libc/unix/bsd/constant.STDIN_FILENO.html | 0 doc/libc/unix/bsd/constant.STDOUT_FILENO.html | 0 doc/libc/unix/bsd/constant.ST_NOSUID.html | 0 doc/libc/unix/bsd/constant.ST_RDONLY.html | 0 doc/libc/unix/bsd/constant.S_IEXEC.html | 0 doc/libc/unix/bsd/constant.S_IFBLK.html | 0 doc/libc/unix/bsd/constant.S_IFCHR.html | 0 doc/libc/unix/bsd/constant.S_IFDIR.html | 0 doc/libc/unix/bsd/constant.S_IFIFO.html | 0 doc/libc/unix/bsd/constant.S_IFLNK.html | 0 doc/libc/unix/bsd/constant.S_IFMT.html | 0 doc/libc/unix/bsd/constant.S_IFREG.html | 0 doc/libc/unix/bsd/constant.S_IFSOCK.html | 0 doc/libc/unix/bsd/constant.S_IREAD.html | 0 doc/libc/unix/bsd/constant.S_IRGRP.html | 0 doc/libc/unix/bsd/constant.S_IROTH.html | 0 doc/libc/unix/bsd/constant.S_IRUSR.html | 0 doc/libc/unix/bsd/constant.S_IRWXG.html | 0 doc/libc/unix/bsd/constant.S_IRWXO.html | 0 doc/libc/unix/bsd/constant.S_IRWXU.html | 0 doc/libc/unix/bsd/constant.S_IWGRP.html | 0 doc/libc/unix/bsd/constant.S_IWOTH.html | 0 doc/libc/unix/bsd/constant.S_IWRITE.html | 0 doc/libc/unix/bsd/constant.S_IWUSR.html | 0 doc/libc/unix/bsd/constant.S_IXGRP.html | 0 doc/libc/unix/bsd/constant.S_IXOTH.html | 0 doc/libc/unix/bsd/constant.S_IXUSR.html | 0 doc/libc/unix/bsd/constant.TAB0.html | 0 doc/libc/unix/bsd/constant.TAB1.html | 0 doc/libc/unix/bsd/constant.TAB2.html | 0 doc/libc/unix/bsd/constant.TAB3.html | 0 doc/libc/unix/bsd/constant.TCIFLUSH.html | 0 doc/libc/unix/bsd/constant.TCIOFF.html | 0 doc/libc/unix/bsd/constant.TCIOFLUSH.html | 0 doc/libc/unix/bsd/constant.TCION.html | 0 doc/libc/unix/bsd/constant.TCOFLUSH.html | 0 doc/libc/unix/bsd/constant.TCOOFF.html | 0 doc/libc/unix/bsd/constant.TCOON.html | 0 doc/libc/unix/bsd/constant.TCP_KEEPALIVE.html | 0 doc/libc/unix/bsd/constant.TCP_NODELAY.html | 0 doc/libc/unix/bsd/constant.TCSADRAIN.html | 0 doc/libc/unix/bsd/constant.TCSAFLUSH.html | 0 doc/libc/unix/bsd/constant.TCSANOW.html | 0 doc/libc/unix/bsd/constant.THOUSEP.html | 0 doc/libc/unix/bsd/constant.TIOCCBRK.html | 0 doc/libc/unix/bsd/constant.TIOCCDTR.html | 0 doc/libc/unix/bsd/constant.TIOCCONS.html | 0 .../unix/bsd/constant.TIOCDCDTIMESTAMP.html | 0 doc/libc/unix/bsd/constant.TIOCDRAIN.html | 0 .../unix/bsd/constant.TIOCDSIMICROCODE.html | 0 doc/libc/unix/bsd/constant.TIOCEXCL.html | 0 doc/libc/unix/bsd/constant.TIOCEXT.html | 0 doc/libc/unix/bsd/constant.TIOCFLUSH.html | 0 .../unix/bsd/constant.TIOCGDRAINWAIT.html | 0 doc/libc/unix/bsd/constant.TIOCGETD.html | 0 doc/libc/unix/bsd/constant.TIOCGPGRP.html | 0 doc/libc/unix/bsd/constant.TIOCGWINSZ.html | 0 doc/libc/unix/bsd/constant.TIOCIXOFF.html | 0 doc/libc/unix/bsd/constant.TIOCIXON.html | 0 doc/libc/unix/bsd/constant.TIOCMBIC.html | 0 doc/libc/unix/bsd/constant.TIOCMBIS.html | 0 doc/libc/unix/bsd/constant.TIOCMGDTRWAIT.html | 0 doc/libc/unix/bsd/constant.TIOCMGET.html | 0 doc/libc/unix/bsd/constant.TIOCMODG.html | 0 doc/libc/unix/bsd/constant.TIOCMODS.html | 0 doc/libc/unix/bsd/constant.TIOCMSDTRWAIT.html | 0 doc/libc/unix/bsd/constant.TIOCMSET.html | 0 doc/libc/unix/bsd/constant.TIOCM_CAR.html | 0 doc/libc/unix/bsd/constant.TIOCM_CD.html | 0 doc/libc/unix/bsd/constant.TIOCM_CTS.html | 0 doc/libc/unix/bsd/constant.TIOCM_DSR.html | 0 doc/libc/unix/bsd/constant.TIOCM_DTR.html | 0 doc/libc/unix/bsd/constant.TIOCM_LE.html | 0 doc/libc/unix/bsd/constant.TIOCM_RI.html | 0 doc/libc/unix/bsd/constant.TIOCM_RNG.html | 0 doc/libc/unix/bsd/constant.TIOCM_RTS.html | 0 doc/libc/unix/bsd/constant.TIOCM_SR.html | 0 doc/libc/unix/bsd/constant.TIOCM_ST.html | 0 doc/libc/unix/bsd/constant.TIOCNOTTY.html | 0 doc/libc/unix/bsd/constant.TIOCNXCL.html | 0 doc/libc/unix/bsd/constant.TIOCOUTQ.html | 0 doc/libc/unix/bsd/constant.TIOCPKT.html | 0 doc/libc/unix/bsd/constant.TIOCPKT_DATA.html | 0 .../unix/bsd/constant.TIOCPKT_DOSTOP.html | 0 .../unix/bsd/constant.TIOCPKT_FLUSHREAD.html | 0 .../unix/bsd/constant.TIOCPKT_FLUSHWRITE.html | 0 doc/libc/unix/bsd/constant.TIOCPKT_IOCTL.html | 0 .../unix/bsd/constant.TIOCPKT_NOSTOP.html | 0 doc/libc/unix/bsd/constant.TIOCPKT_START.html | 0 doc/libc/unix/bsd/constant.TIOCPKT_STOP.html | 0 doc/libc/unix/bsd/constant.TIOCPTYGNAME.html | 0 doc/libc/unix/bsd/constant.TIOCPTYGRANT.html | 0 doc/libc/unix/bsd/constant.TIOCPTYUNLK.html | 0 doc/libc/unix/bsd/constant.TIOCREMOTE.html | 0 doc/libc/unix/bsd/constant.TIOCSBRK.html | 0 doc/libc/unix/bsd/constant.TIOCSCONS.html | 0 doc/libc/unix/bsd/constant.TIOCSCTTY.html | 0 .../unix/bsd/constant.TIOCSDRAINWAIT.html | 0 doc/libc/unix/bsd/constant.TIOCSDTR.html | 0 doc/libc/unix/bsd/constant.TIOCSETD.html | 0 doc/libc/unix/bsd/constant.TIOCSIG.html | 0 doc/libc/unix/bsd/constant.TIOCSPGRP.html | 0 doc/libc/unix/bsd/constant.TIOCSTART.html | 0 doc/libc/unix/bsd/constant.TIOCSTAT.html | 0 doc/libc/unix/bsd/constant.TIOCSTI.html | 0 doc/libc/unix/bsd/constant.TIOCSTOP.html | 0 doc/libc/unix/bsd/constant.TIOCSWINSZ.html | 0 doc/libc/unix/bsd/constant.TIOCTIMESTAMP.html | 0 doc/libc/unix/bsd/constant.TIOCUCNTL.html | 0 doc/libc/unix/bsd/constant.TMP_MAX.html | 0 doc/libc/unix/bsd/constant.TOSTOP.html | 0 doc/libc/unix/bsd/constant.T_FMT.html | 0 doc/libc/unix/bsd/constant.T_FMT_AMPM.html | 0 doc/libc/unix/bsd/constant.VDISCARD.html | 0 doc/libc/unix/bsd/constant.VEOF.html | 0 doc/libc/unix/bsd/constant.VEOL.html | 0 doc/libc/unix/bsd/constant.VEOL2.html | 0 doc/libc/unix/bsd/constant.VERASE.html | 0 doc/libc/unix/bsd/constant.VINTR.html | 0 doc/libc/unix/bsd/constant.VKILL.html | 0 doc/libc/unix/bsd/constant.VLNEXT.html | 0 doc/libc/unix/bsd/constant.VMIN.html | 0 doc/libc/unix/bsd/constant.VQUIT.html | 0 doc/libc/unix/bsd/constant.VREPRINT.html | 0 doc/libc/unix/bsd/constant.VSTART.html | 0 doc/libc/unix/bsd/constant.VSTOP.html | 0 doc/libc/unix/bsd/constant.VSUSP.html | 0 doc/libc/unix/bsd/constant.VT0.html | 0 doc/libc/unix/bsd/constant.VT1.html | 0 doc/libc/unix/bsd/constant.VTIME.html | 0 doc/libc/unix/bsd/constant.VWERASE.html | 0 doc/libc/unix/bsd/constant.WNOHANG.html | 0 doc/libc/unix/bsd/constant.W_OK.html | 0 doc/libc/unix/bsd/constant.X_OK.html | 0 doc/libc/unix/bsd/constant.YESEXPR.html | 0 doc/libc/unix/bsd/constant.YESSTR.html | 0 doc/libc/unix/bsd/constant._IOFBF.html | 0 doc/libc/unix/bsd/constant._IOLBF.html | 0 doc/libc/unix/bsd/constant._IONBF.html | 0 doc/libc/unix/bsd/constant._PC_NAME_MAX.html | 0 .../bsd/constant._PTHREAD_COND_SIG_init.html | 0 .../bsd/constant._PTHREAD_MUTEX_SIG_init.html | 0 .../constant._PTHREAD_RWLOCK_SIG_init.html | 0 .../unix/bsd/constant._RLIMIT_POSIX_FLAG.html | 0 .../unix/bsd/constant._SC_2_CHAR_TERM.html | 0 doc/libc/unix/bsd/constant._SC_2_C_BIND.html | 0 doc/libc/unix/bsd/constant._SC_2_C_DEV.html | 0 .../unix/bsd/constant._SC_2_FORT_DEV.html | 0 .../unix/bsd/constant._SC_2_FORT_RUN.html | 0 .../unix/bsd/constant._SC_2_LOCALEDEF.html | 0 doc/libc/unix/bsd/constant._SC_2_PBS.html | 0 .../bsd/constant._SC_2_PBS_ACCOUNTING.html | 0 .../bsd/constant._SC_2_PBS_CHECKPOINT.html | 0 .../unix/bsd/constant._SC_2_PBS_LOCATE.html | 0 .../unix/bsd/constant._SC_2_PBS_MESSAGE.html | 0 .../unix/bsd/constant._SC_2_PBS_TRACK.html | 0 doc/libc/unix/bsd/constant._SC_2_SW_DEV.html | 0 doc/libc/unix/bsd/constant._SC_2_UPE.html | 0 doc/libc/unix/bsd/constant._SC_2_VERSION.html | 0 .../unix/bsd/constant._SC_ADVISORY_INFO.html | 0 .../unix/bsd/constant._SC_AIO_LISTIO_MAX.html | 0 doc/libc/unix/bsd/constant._SC_AIO_MAX.html | 0 .../bsd/constant._SC_AIO_PRIO_DELTA_MAX.html | 0 doc/libc/unix/bsd/constant._SC_ARG_MAX.html | 0 .../bsd/constant._SC_ASYNCHRONOUS_IO.html | 0 .../unix/bsd/constant._SC_ATEXIT_MAX.html | 0 doc/libc/unix/bsd/constant._SC_BARRIERS.html | 0 .../unix/bsd/constant._SC_BC_BASE_MAX.html | 0 .../unix/bsd/constant._SC_BC_DIM_MAX.html | 0 .../unix/bsd/constant._SC_BC_SCALE_MAX.html | 0 .../unix/bsd/constant._SC_BC_STRING_MAX.html | 0 doc/libc/unix/bsd/constant._SC_CHILD_MAX.html | 0 doc/libc/unix/bsd/constant._SC_CLK_TCK.html | 0 .../bsd/constant._SC_CLOCK_SELECTION.html | 0 .../bsd/constant._SC_COLL_WEIGHTS_MAX.html | 0 doc/libc/unix/bsd/constant._SC_CPUTIME.html | 0 .../unix/bsd/constant._SC_DELAYTIMER_MAX.html | 0 .../unix/bsd/constant._SC_EXPR_NEST_MAX.html | 0 .../unix/bsd/constant._SC_FILE_LOCKING.html | 0 doc/libc/unix/bsd/constant._SC_FSYNC.html | 0 .../bsd/constant._SC_GETGR_R_SIZE_MAX.html | 0 .../bsd/constant._SC_GETPW_R_SIZE_MAX.html | 0 .../unix/bsd/constant._SC_HOST_NAME_MAX.html | 0 doc/libc/unix/bsd/constant._SC_IOV_MAX.html | 0 doc/libc/unix/bsd/constant._SC_IPV6.html | 0 .../unix/bsd/constant._SC_JOB_CONTROL.html | 0 doc/libc/unix/bsd/constant._SC_LINE_MAX.html | 0 .../unix/bsd/constant._SC_LOGIN_NAME_MAX.html | 0 .../unix/bsd/constant._SC_MAPPED_FILES.html | 0 doc/libc/unix/bsd/constant._SC_MEMLOCK.html | 0 .../unix/bsd/constant._SC_MEMLOCK_RANGE.html | 0 .../bsd/constant._SC_MEMORY_PROTECTION.html | 0 .../bsd/constant._SC_MESSAGE_PASSING.html | 0 .../bsd/constant._SC_MONOTONIC_CLOCK.html | 0 .../unix/bsd/constant._SC_MQ_OPEN_MAX.html | 0 .../unix/bsd/constant._SC_MQ_PRIO_MAX.html | 0 .../unix/bsd/constant._SC_NGROUPS_MAX.html | 0 .../bsd/constant._SC_NPROCESSORS_CONF.html | 0 .../bsd/constant._SC_NPROCESSORS_ONLN.html | 0 doc/libc/unix/bsd/constant._SC_OPEN_MAX.html | 0 doc/libc/unix/bsd/constant._SC_PAGESIZE.html | 0 doc/libc/unix/bsd/constant._SC_PAGE_SIZE.html | 0 doc/libc/unix/bsd/constant._SC_PASS_MAX.html | 0 .../unix/bsd/constant._SC_PRIORITIZED_IO.html | 0 .../bsd/constant._SC_PRIORITY_SCHEDULING.html | 0 .../unix/bsd/constant._SC_RAW_SOCKETS.html | 0 .../bsd/constant._SC_READER_WRITER_LOCKS.html | 0 .../bsd/constant._SC_REALTIME_SIGNALS.html | 0 doc/libc/unix/bsd/constant._SC_REGEXP.html | 0 .../unix/bsd/constant._SC_RE_DUP_MAX.html | 0 doc/libc/unix/bsd/constant._SC_RTSIG_MAX.html | 0 doc/libc/unix/bsd/constant._SC_SAVED_IDS.html | 0 .../unix/bsd/constant._SC_SEMAPHORES.html | 0 .../unix/bsd/constant._SC_SEM_NSEMS_MAX.html | 0 .../unix/bsd/constant._SC_SEM_VALUE_MAX.html | 0 .../constant._SC_SHARED_MEMORY_OBJECTS.html | 0 doc/libc/unix/bsd/constant._SC_SHELL.html | 0 .../unix/bsd/constant._SC_SIGQUEUE_MAX.html | 0 doc/libc/unix/bsd/constant._SC_SPAWN.html | 0 .../unix/bsd/constant._SC_SPIN_LOCKS.html | 0 .../bsd/constant._SC_SPORADIC_SERVER.html | 0 .../unix/bsd/constant._SC_SS_REPL_MAX.html | 0 .../unix/bsd/constant._SC_STREAM_MAX.html | 0 .../unix/bsd/constant._SC_SYMLOOP_MAX.html | 0 .../bsd/constant._SC_SYNCHRONIZED_IO.html | 0 doc/libc/unix/bsd/constant._SC_THREADS.html | 0 .../constant._SC_THREAD_ATTR_STACKADDR.html | 0 .../constant._SC_THREAD_ATTR_STACKSIZE.html | 0 .../unix/bsd/constant._SC_THREAD_CPUTIME.html | 0 ...tant._SC_THREAD_DESTRUCTOR_ITERATIONS.html | 0 .../bsd/constant._SC_THREAD_KEYS_MAX.html | 0 ...nstant._SC_THREAD_PRIORITY_SCHEDULING.html | 0 .../bsd/constant._SC_THREAD_PRIO_INHERIT.html | 0 .../bsd/constant._SC_THREAD_PRIO_PROTECT.html | 0 .../constant._SC_THREAD_PROCESS_SHARED.html | 0 .../constant._SC_THREAD_SAFE_FUNCTIONS.html | 0 .../constant._SC_THREAD_SPORADIC_SERVER.html | 0 .../bsd/constant._SC_THREAD_STACK_MIN.html | 0 .../bsd/constant._SC_THREAD_THREADS_MAX.html | 0 doc/libc/unix/bsd/constant._SC_TIMEOUTS.html | 0 doc/libc/unix/bsd/constant._SC_TIMERS.html | 0 doc/libc/unix/bsd/constant._SC_TIMER_MAX.html | 0 doc/libc/unix/bsd/constant._SC_TRACE.html | 0 .../bsd/constant._SC_TRACE_EVENT_FILTER.html | 0 .../constant._SC_TRACE_EVENT_NAME_MAX.html | 0 .../unix/bsd/constant._SC_TRACE_INHERIT.html | 0 doc/libc/unix/bsd/constant._SC_TRACE_LOG.html | 0 .../unix/bsd/constant._SC_TRACE_NAME_MAX.html | 0 .../unix/bsd/constant._SC_TRACE_SYS_MAX.html | 0 .../constant._SC_TRACE_USER_EVENT_MAX.html | 0 .../unix/bsd/constant._SC_TTY_NAME_MAX.html | 0 .../constant._SC_TYPED_MEMORY_OBJECTS.html | 0 .../unix/bsd/constant._SC_TZNAME_MAX.html | 0 .../unix/bsd/constant._SC_V6_ILP32_OFF32.html | 0 .../bsd/constant._SC_V6_ILP32_OFFBIG.html | 0 .../unix/bsd/constant._SC_V6_LP64_OFF64.html | 0 .../bsd/constant._SC_V6_LPBIG_OFFBIG.html | 0 doc/libc/unix/bsd/constant._SC_VERSION.html | 0 .../bsd/constant._SC_XBS5_ILP32_OFF32.html | 0 .../bsd/constant._SC_XBS5_ILP32_OFFBIG.html | 0 .../bsd/constant._SC_XBS5_LP64_OFF64.html | 0 .../bsd/constant._SC_XBS5_LPBIG_OFFBIG.html | 0 .../unix/bsd/constant._SC_XOPEN_CRYPT.html | 0 .../unix/bsd/constant._SC_XOPEN_ENH_I18N.html | 0 .../unix/bsd/constant._SC_XOPEN_LEGACY.html | 0 .../unix/bsd/constant._SC_XOPEN_REALTIME.html | 0 .../constant._SC_XOPEN_REALTIME_THREADS.html | 0 doc/libc/unix/bsd/constant._SC_XOPEN_SHM.html | 0 .../unix/bsd/constant._SC_XOPEN_STREAMS.html | 0 .../unix/bsd/constant._SC_XOPEN_UNIX.html | 0 .../unix/bsd/constant._SC_XOPEN_VERSION.html | 0 .../bsd/constant._SC_XOPEN_XCU_VERSION.html | 0 doc/libc/unix/bsd/constant._WSTOPPED.html | 0 .../bsd/constant.__PTHREAD_COND_SIZE__.html | 0 .../bsd/constant.__PTHREAD_MUTEX_SIZE__.html | 0 .../bsd/constant.__PTHREAD_RWLOCK_SIZE__.html | 0 doc/libc/unix/bsd/enum.timezone.html | 10 - doc/libc/unix/bsd/fn.FD_CLR.html | 10 - doc/libc/unix/bsd/fn.FD_ISSET.html | 10 - doc/libc/unix/bsd/fn.FD_SET.html | 10 - doc/libc/unix/bsd/fn.FD_ZERO.html | 10 - doc/libc/unix/bsd/fn.WCOREDUMP.html | 10 - doc/libc/unix/bsd/fn.WEXITSTATUS.html | 10 - doc/libc/unix/bsd/fn.WIFCONTINUED.html | 10 - doc/libc/unix/bsd/fn.WIFEXITED.html | 10 - doc/libc/unix/bsd/fn.WIFSIGNALED.html | 10 - doc/libc/unix/bsd/fn.WIFSTOPPED.html | 10 - doc/libc/unix/bsd/fn.WSTOPSIG.html | 10 - doc/libc/unix/bsd/fn.WTERMSIG.html | 10 - doc/libc/unix/bsd/fn._WSTATUS.html | 10 - doc/libc/unix/bsd/fn.__error.html | 10 - doc/libc/unix/bsd/fn.backtrace.html | 10 - doc/libc/unix/bsd/fn.duplocale.html | 10 - doc/libc/unix/bsd/fn.forkpty.html | 10 - doc/libc/unix/bsd/fn.freelocale.html | 10 - doc/libc/unix/bsd/fn.fstatfs.html | 10 - doc/libc/unix/bsd/fn.getnameinfo.html | 10 - doc/libc/unix/bsd/fn.getpwuid_r.html | 10 - doc/libc/unix/bsd/fn.ioctl.html | 10 - doc/libc/unix/bsd/fn.kevent.html | 10 - doc/libc/unix/bsd/fn.kevent64.html | 10 - doc/libc/unix/bsd/fn.kqueue.html | 10 - doc/libc/unix/bsd/fn.localeconv_l.html | 10 - doc/libc/unix/bsd/fn.mach_absolute_time.html | 10 - doc/libc/unix/bsd/fn.mach_timebase_info.html | 10 - doc/libc/unix/bsd/fn.mincore.html | 10 - doc/libc/unix/bsd/fn.mount.html | 10 - doc/libc/unix/bsd/fn.mprotect.html | 10 - doc/libc/unix/bsd/fn.newlocale.html | 10 - doc/libc/unix/bsd/fn.openpty.html | 10 - .../unix/bsd/fn.pthread_get_stackaddr_np.html | 10 - .../unix/bsd/fn.pthread_get_stacksize_np.html | 10 - doc/libc/unix/bsd/fn.pthread_setname_np.html | 10 - doc/libc/unix/bsd/fn.ptrace.html | 10 - doc/libc/unix/bsd/fn.querylocale.html | 10 - doc/libc/unix/bsd/fn.quotactl.html | 10 - doc/libc/unix/bsd/fn.sendfile.html | 10 - doc/libc/unix/bsd/fn.setgroups.html | 10 - doc/libc/unix/bsd/fn.sethostname.html | 10 - doc/libc/unix/bsd/fn.shm_open.html | 10 - doc/libc/unix/bsd/fn.statfs.html | 10 - doc/libc/unix/bsd/fn.syscall.html | 10 - doc/libc/unix/bsd/fn.sysctl.html | 10 - doc/libc/unix/bsd/fn.sysctlbyname.html | 10 - doc/libc/unix/bsd/fn.sysctlnametomib.html | 10 - doc/libc/unix/bsd/fn.unmount.html | 10 - doc/libc/unix/bsd/fn.uselocale.html | 10 - doc/libc/unix/bsd/index.html | 0 doc/libc/unix/bsd/sidebar-items.js | 1 - doc/libc/unix/bsd/struct.Dl_info.html | 10 - doc/libc/unix/bsd/struct.addrinfo.html | 10 - doc/libc/unix/bsd/struct.dirent.html | 10 - doc/libc/unix/bsd/struct.dqblk.html | 10 - doc/libc/unix/bsd/struct.fd_set.html | 10 - doc/libc/unix/bsd/struct.flock.html | 10 - doc/libc/unix/bsd/struct.fsid_t.html | 10 - doc/libc/unix/bsd/struct.fstore_t.html | 10 - doc/libc/unix/bsd/struct.glob_t.html | 10 - doc/libc/unix/bsd/struct.ifaddrs.html | 10 - doc/libc/unix/bsd/struct.kevent.html | 10 - doc/libc/unix/bsd/struct.kevent64_s.html | 10 - doc/libc/unix/bsd/struct.lconv.html | 10 - .../unix/bsd/struct.mach_timebase_info.html | 10 - doc/libc/unix/bsd/struct.msghdr.html | 10 - doc/libc/unix/bsd/struct.passwd.html | 10 - doc/libc/unix/bsd/struct.pthread_attr_t.html | 10 - doc/libc/unix/bsd/struct.pthread_cond_t.html | 10 - doc/libc/unix/bsd/struct.pthread_mutex_t.html | 10 - .../unix/bsd/struct.pthread_mutexattr_t.html | 10 - .../unix/bsd/struct.pthread_rwlock_t.html | 10 - doc/libc/unix/bsd/struct.radvisory.html | 10 - doc/libc/unix/bsd/struct.sf_hdtr.html | 10 - doc/libc/unix/bsd/struct.sigaction.html | 10 - doc/libc/unix/bsd/struct.siginfo_t.html | 10 - doc/libc/unix/bsd/struct.sockaddr.html | 10 - doc/libc/unix/bsd/struct.sockaddr_in.html | 10 - doc/libc/unix/bsd/struct.sockaddr_in6.html | 10 - .../unix/bsd/struct.sockaddr_storage.html | 10 - doc/libc/unix/bsd/struct.sockaddr_un.html | 10 - doc/libc/unix/bsd/struct.stack_t.html | 10 - doc/libc/unix/bsd/struct.stat.html | 10 - doc/libc/unix/bsd/struct.statfs.html | 10 - doc/libc/unix/bsd/struct.statvfs.html | 10 - doc/libc/unix/bsd/struct.termios.html | 10 - doc/libc/unix/bsd/struct.tm.html | 10 - doc/libc/unix/bsd/struct.utsname.html | 10 - doc/libc/unix/bsd/type.blkcnt_t.html | 10 - doc/libc/unix/bsd/type.blksize_t.html | 10 - doc/libc/unix/bsd/type.c_char.html | 10 - doc/libc/unix/bsd/type.c_long.html | 10 - doc/libc/unix/bsd/type.c_ulong.html | 10 - doc/libc/unix/bsd/type.clock_t.html | 10 - doc/libc/unix/bsd/type.dev_t.html | 10 - doc/libc/unix/bsd/type.fsblkcnt_t.html | 10 - doc/libc/unix/bsd/type.fsfilcnt_t.html | 10 - doc/libc/unix/bsd/type.ino_t.html | 10 - .../bsd/type.mach_timebase_info_data_t.html | 10 - doc/libc/unix/bsd/type.mode_t.html | 10 - doc/libc/unix/bsd/type.nfds_t.html | 10 - doc/libc/unix/bsd/type.nl_item.html | 10 - doc/libc/unix/bsd/type.nlink_t.html | 10 - doc/libc/unix/bsd/type.off_t.html | 10 - doc/libc/unix/bsd/type.pthread_key_t.html | 10 - doc/libc/unix/bsd/type.pthread_t.html | 10 - doc/libc/unix/bsd/type.rlim_t.html | 10 - doc/libc/unix/bsd/type.sa_family_t.html | 10 - doc/libc/unix/bsd/type.sigset_t.html | 10 - doc/libc/unix/bsd/type.socklen_t.html | 10 - doc/libc/unix/bsd/type.speed_t.html | 10 - doc/libc/unix/bsd/type.suseconds_t.html | 10 - doc/libc/unix/bsd/type.tcflag_t.html | 10 - doc/libc/unix/bsd/type.time_t.html | 10 - doc/libc/unix/bsd/type.useconds_t.html | 10 - doc/libc/unix/bsd/type.wchar_t.html | 10 - doc/libc/unix/constant.ABDAY_1.html | 0 doc/libc/unix/constant.ABDAY_2.html | 0 doc/libc/unix/constant.ABDAY_3.html | 0 doc/libc/unix/constant.ABDAY_4.html | 0 doc/libc/unix/constant.ABDAY_5.html | 0 doc/libc/unix/constant.ABDAY_6.html | 0 doc/libc/unix/constant.ABDAY_7.html | 0 doc/libc/unix/constant.ABMON_1.html | 0 doc/libc/unix/constant.ABMON_10.html | 0 doc/libc/unix/constant.ABMON_11.html | 0 doc/libc/unix/constant.ABMON_12.html | 0 doc/libc/unix/constant.ABMON_2.html | 0 doc/libc/unix/constant.ABMON_3.html | 0 doc/libc/unix/constant.ABMON_4.html | 0 doc/libc/unix/constant.ABMON_5.html | 0 doc/libc/unix/constant.ABMON_6.html | 0 doc/libc/unix/constant.ABMON_7.html | 0 doc/libc/unix/constant.ABMON_8.html | 0 doc/libc/unix/constant.ABMON_9.html | 0 doc/libc/unix/constant.AF_INET.html | 0 doc/libc/unix/constant.AF_INET6.html | 0 doc/libc/unix/constant.AF_UNIX.html | 0 doc/libc/unix/constant.ALT_DIGITS.html | 0 doc/libc/unix/constant.AM_STR.html | 0 doc/libc/unix/constant.BRKINT.html | 0 doc/libc/unix/constant.BS0.html | 0 doc/libc/unix/constant.BS1.html | 0 doc/libc/unix/constant.BUFSIZ.html | 0 doc/libc/unix/constant.CLOCAL.html | 0 doc/libc/unix/constant.CODESET.html | 0 doc/libc/unix/constant.CR0.html | 0 doc/libc/unix/constant.CR1.html | 0 doc/libc/unix/constant.CR2.html | 0 doc/libc/unix/constant.CR3.html | 0 doc/libc/unix/constant.CREAD.html | 0 doc/libc/unix/constant.CRNCYSTR.html | 0 doc/libc/unix/constant.CRTSCTS.html | 0 doc/libc/unix/constant.CS5.html | 0 doc/libc/unix/constant.CS6.html | 0 doc/libc/unix/constant.CS7.html | 0 doc/libc/unix/constant.CS8.html | 0 doc/libc/unix/constant.CSIZE.html | 0 doc/libc/unix/constant.CSTOPB.html | 0 doc/libc/unix/constant.CTL_HW.html | 0 doc/libc/unix/constant.DAY_1.html | 0 doc/libc/unix/constant.DAY_2.html | 0 doc/libc/unix/constant.DAY_3.html | 0 doc/libc/unix/constant.DAY_4.html | 0 doc/libc/unix/constant.DAY_5.html | 0 doc/libc/unix/constant.DAY_6.html | 0 doc/libc/unix/constant.DAY_7.html | 0 doc/libc/unix/constant.DT_BLK.html | 0 doc/libc/unix/constant.DT_CHR.html | 0 doc/libc/unix/constant.DT_DIR.html | 0 doc/libc/unix/constant.DT_FIFO.html | 0 doc/libc/unix/constant.DT_LNK.html | 0 doc/libc/unix/constant.DT_REG.html | 0 doc/libc/unix/constant.DT_SOCK.html | 0 doc/libc/unix/constant.D_FMT.html | 0 doc/libc/unix/constant.D_MD_ORDER.html | 0 doc/libc/unix/constant.D_T_FMT.html | 0 doc/libc/unix/constant.E2BIG.html | 0 doc/libc/unix/constant.EACCES.html | 0 doc/libc/unix/constant.EADDRINUSE.html | 0 doc/libc/unix/constant.EADDRNOTAVAIL.html | 0 doc/libc/unix/constant.EAFNOSUPPORT.html | 0 doc/libc/unix/constant.EAGAIN.html | 0 doc/libc/unix/constant.EALREADY.html | 0 doc/libc/unix/constant.EAUTH.html | 0 doc/libc/unix/constant.EBADARCH.html | 0 doc/libc/unix/constant.EBADEXEC.html | 0 doc/libc/unix/constant.EBADF.html | 0 doc/libc/unix/constant.EBADMACHO.html | 0 doc/libc/unix/constant.EBADMSG.html | 0 doc/libc/unix/constant.EBADRPC.html | 0 doc/libc/unix/constant.EBUSY.html | 0 doc/libc/unix/constant.ECANCELED.html | 0 doc/libc/unix/constant.ECHILD.html | 0 doc/libc/unix/constant.ECHO.html | 0 doc/libc/unix/constant.ECHOCTL.html | 0 doc/libc/unix/constant.ECHOE.html | 0 doc/libc/unix/constant.ECHOK.html | 0 doc/libc/unix/constant.ECHOKE.html | 0 doc/libc/unix/constant.ECHONL.html | 0 doc/libc/unix/constant.ECHOPRT.html | 0 doc/libc/unix/constant.ECONNABORTED.html | 0 doc/libc/unix/constant.ECONNREFUSED.html | 0 doc/libc/unix/constant.ECONNRESET.html | 0 doc/libc/unix/constant.EDEADLK.html | 0 doc/libc/unix/constant.EDESTADDRREQ.html | 0 doc/libc/unix/constant.EDEVERR.html | 0 doc/libc/unix/constant.EDOM.html | 0 doc/libc/unix/constant.EDQUOT.html | 0 doc/libc/unix/constant.EEXIST.html | 0 doc/libc/unix/constant.EFAULT.html | 0 doc/libc/unix/constant.EFBIG.html | 0 doc/libc/unix/constant.EFTYPE.html | 0 doc/libc/unix/constant.EHOSTDOWN.html | 0 doc/libc/unix/constant.EHOSTUNREACH.html | 0 doc/libc/unix/constant.EIDRM.html | 0 doc/libc/unix/constant.EILSEQ.html | 0 doc/libc/unix/constant.EINPROGRESS.html | 0 doc/libc/unix/constant.EINTR.html | 0 doc/libc/unix/constant.EINVAL.html | 0 doc/libc/unix/constant.EIO.html | 0 doc/libc/unix/constant.EISCONN.html | 0 doc/libc/unix/constant.EISDIR.html | 0 doc/libc/unix/constant.ELAST.html | 0 doc/libc/unix/constant.ELOOP.html | 0 doc/libc/unix/constant.EMFILE.html | 0 doc/libc/unix/constant.EMLINK.html | 0 doc/libc/unix/constant.EMSGSIZE.html | 0 doc/libc/unix/constant.EMULTIHOP.html | 0 doc/libc/unix/constant.ENAMETOOLONG.html | 0 doc/libc/unix/constant.ENEEDAUTH.html | 0 doc/libc/unix/constant.ENETDOWN.html | 0 doc/libc/unix/constant.ENETRESET.html | 0 doc/libc/unix/constant.ENETUNREACH.html | 0 doc/libc/unix/constant.ENFILE.html | 0 doc/libc/unix/constant.ENOATTR.html | 0 doc/libc/unix/constant.ENOBUFS.html | 0 doc/libc/unix/constant.ENODATA.html | 0 doc/libc/unix/constant.ENODEV.html | 0 doc/libc/unix/constant.ENOENT.html | 0 doc/libc/unix/constant.ENOEXEC.html | 0 doc/libc/unix/constant.ENOLCK.html | 0 doc/libc/unix/constant.ENOLINK.html | 0 doc/libc/unix/constant.ENOMEM.html | 0 doc/libc/unix/constant.ENOMSG.html | 0 doc/libc/unix/constant.ENOPOLICY.html | 0 doc/libc/unix/constant.ENOPROTOOPT.html | 0 doc/libc/unix/constant.ENOSPC.html | 0 doc/libc/unix/constant.ENOSR.html | 0 doc/libc/unix/constant.ENOSTR.html | 0 doc/libc/unix/constant.ENOSYS.html | 0 doc/libc/unix/constant.ENOTBLK.html | 0 doc/libc/unix/constant.ENOTCONN.html | 0 doc/libc/unix/constant.ENOTDIR.html | 0 doc/libc/unix/constant.ENOTEMPTY.html | 0 doc/libc/unix/constant.ENOTRECOVERABLE.html | 0 doc/libc/unix/constant.ENOTSOCK.html | 0 doc/libc/unix/constant.ENOTSUP.html | 0 doc/libc/unix/constant.ENOTTY.html | 0 doc/libc/unix/constant.ENXIO.html | 0 doc/libc/unix/constant.EOF.html | 0 doc/libc/unix/constant.EOPNOTSUPP.html | 0 doc/libc/unix/constant.EOVERFLOW.html | 0 doc/libc/unix/constant.EOWNERDEAD.html | 0 doc/libc/unix/constant.EPERM.html | 0 doc/libc/unix/constant.EPFNOSUPPORT.html | 0 doc/libc/unix/constant.EPIPE.html | 0 doc/libc/unix/constant.EPROCLIM.html | 0 doc/libc/unix/constant.EPROCUNAVAIL.html | 0 doc/libc/unix/constant.EPROGMISMATCH.html | 0 doc/libc/unix/constant.EPROGUNAVAIL.html | 0 doc/libc/unix/constant.EPROTO.html | 0 doc/libc/unix/constant.EPROTONOSUPPORT.html | 0 doc/libc/unix/constant.EPROTOTYPE.html | 0 doc/libc/unix/constant.EPWROFF.html | 0 doc/libc/unix/constant.EQFULL.html | 0 doc/libc/unix/constant.ERA.html | 0 doc/libc/unix/constant.ERANGE.html | 0 doc/libc/unix/constant.ERA_D_FMT.html | 0 doc/libc/unix/constant.ERA_D_T_FMT.html | 0 doc/libc/unix/constant.ERA_T_FMT.html | 0 doc/libc/unix/constant.EREMOTE.html | 0 doc/libc/unix/constant.EROFS.html | 0 doc/libc/unix/constant.ERPCMISMATCH.html | 0 doc/libc/unix/constant.ESHLIBVERS.html | 0 doc/libc/unix/constant.ESHUTDOWN.html | 0 doc/libc/unix/constant.ESOCKTNOSUPPORT.html | 0 doc/libc/unix/constant.ESPIPE.html | 0 doc/libc/unix/constant.ESRCH.html | 0 doc/libc/unix/constant.ESTALE.html | 0 doc/libc/unix/constant.ETIME.html | 0 doc/libc/unix/constant.ETIMEDOUT.html | 0 doc/libc/unix/constant.ETOOMANYREFS.html | 0 doc/libc/unix/constant.ETXTBSY.html | 0 doc/libc/unix/constant.EUSERS.html | 0 doc/libc/unix/constant.EVFILT_AIO.html | 0 doc/libc/unix/constant.EVFILT_FS.html | 0 doc/libc/unix/constant.EVFILT_MACHPORT.html | 0 doc/libc/unix/constant.EVFILT_PROC.html | 0 doc/libc/unix/constant.EVFILT_READ.html | 0 doc/libc/unix/constant.EVFILT_SIGNAL.html | 0 doc/libc/unix/constant.EVFILT_SYSCOUNT.html | 0 doc/libc/unix/constant.EVFILT_TIMER.html | 0 doc/libc/unix/constant.EVFILT_USER.html | 0 doc/libc/unix/constant.EVFILT_VM.html | 0 doc/libc/unix/constant.EVFILT_VNODE.html | 0 doc/libc/unix/constant.EVFILT_WRITE.html | 0 doc/libc/unix/constant.EV_ADD.html | 0 doc/libc/unix/constant.EV_CLEAR.html | 0 doc/libc/unix/constant.EV_DELETE.html | 0 doc/libc/unix/constant.EV_DISABLE.html | 0 doc/libc/unix/constant.EV_DISPATCH.html | 0 doc/libc/unix/constant.EV_ENABLE.html | 0 doc/libc/unix/constant.EV_EOF.html | 0 doc/libc/unix/constant.EV_ERROR.html | 0 doc/libc/unix/constant.EV_FLAG0.html | 0 doc/libc/unix/constant.EV_FLAG1.html | 0 doc/libc/unix/constant.EV_ONESHOT.html | 0 doc/libc/unix/constant.EV_OOBAND.html | 0 doc/libc/unix/constant.EV_POLL.html | 0 doc/libc/unix/constant.EV_RECEIPT.html | 0 doc/libc/unix/constant.EV_SYSFLAGS.html | 0 doc/libc/unix/constant.EWOULDBLOCK.html | 0 doc/libc/unix/constant.EXDEV.html | 0 doc/libc/unix/constant.EXIT_FAILURE.html | 0 doc/libc/unix/constant.EXIT_SUCCESS.html | 0 doc/libc/unix/constant.EXTPROC.html | 0 doc/libc/unix/constant.FD_CLOEXEC.html | 0 doc/libc/unix/constant.FD_SETSIZE.html | 0 doc/libc/unix/constant.FF0.html | 0 doc/libc/unix/constant.FF1.html | 0 doc/libc/unix/constant.FILENAME_MAX.html | 0 doc/libc/unix/constant.FIOCLEX.html | 0 doc/libc/unix/constant.FIONBIO.html | 0 doc/libc/unix/constant.FLUSHO.html | 0 doc/libc/unix/constant.FOPEN_MAX.html | 0 doc/libc/unix/constant.F_ALLOCATEALL.html | 0 doc/libc/unix/constant.F_ALLOCATECONTIG.html | 0 doc/libc/unix/constant.F_DUPFD.html | 0 doc/libc/unix/constant.F_DUPFD_CLOEXEC.html | 0 doc/libc/unix/constant.F_FREEZE_FS.html | 0 doc/libc/unix/constant.F_FULLFSYNC.html | 0 doc/libc/unix/constant.F_GETFD.html | 0 doc/libc/unix/constant.F_GETFL.html | 0 doc/libc/unix/constant.F_GETLK.html | 0 doc/libc/unix/constant.F_GETOWN.html | 0 doc/libc/unix/constant.F_GETPATH.html | 0 doc/libc/unix/constant.F_GLOBAL_NOCACHE.html | 0 doc/libc/unix/constant.F_LOCK.html | 0 doc/libc/unix/constant.F_NOCACHE.html | 0 doc/libc/unix/constant.F_NODIRECT.html | 0 doc/libc/unix/constant.F_OK.html | 0 doc/libc/unix/constant.F_PEOFPOSMODE.html | 0 doc/libc/unix/constant.F_PREALLOCATE.html | 0 doc/libc/unix/constant.F_RDADVISE.html | 0 doc/libc/unix/constant.F_RDAHEAD.html | 0 doc/libc/unix/constant.F_SETFD.html | 0 doc/libc/unix/constant.F_SETFL.html | 0 doc/libc/unix/constant.F_SETLK.html | 0 doc/libc/unix/constant.F_SETLKW.html | 0 doc/libc/unix/constant.F_SETOWN.html | 0 doc/libc/unix/constant.F_TEST.html | 0 doc/libc/unix/constant.F_THAW_FS.html | 0 doc/libc/unix/constant.F_TLOCK.html | 0 doc/libc/unix/constant.F_ULOCK.html | 0 doc/libc/unix/constant.F_VOLPOSMODE.html | 0 doc/libc/unix/constant.GLOB_ABORTED.html | 0 doc/libc/unix/constant.GLOB_APPEND.html | 0 doc/libc/unix/constant.GLOB_DOOFFS.html | 0 doc/libc/unix/constant.GLOB_ERR.html | 0 doc/libc/unix/constant.GLOB_MARK.html | 0 doc/libc/unix/constant.GLOB_NOCHECK.html | 0 doc/libc/unix/constant.GLOB_NOESCAPE.html | 0 doc/libc/unix/constant.GLOB_NOMATCH.html | 0 doc/libc/unix/constant.GLOB_NOSORT.html | 0 doc/libc/unix/constant.GLOB_NOSPACE.html | 0 doc/libc/unix/constant.GRPQUOTA.html | 0 doc/libc/unix/constant.HUPCL.html | 0 doc/libc/unix/constant.HW_AVAILCPU.html | 0 doc/libc/unix/constant.HW_NCPU.html | 0 doc/libc/unix/constant.ICANON.html | 0 doc/libc/unix/constant.ICRNL.html | 0 doc/libc/unix/constant.IEXTEN.html | 0 doc/libc/unix/constant.IFF_LOOPBACK.html | 0 doc/libc/unix/constant.IF_NAMESIZE.html | 0 doc/libc/unix/constant.IGNBRK.html | 0 doc/libc/unix/constant.IGNCR.html | 0 doc/libc/unix/constant.IGNPAR.html | 0 doc/libc/unix/constant.IMAXBEL.html | 0 doc/libc/unix/constant.INLCR.html | 0 doc/libc/unix/constant.INPCK.html | 0 doc/libc/unix/constant.IPPROTO_IP.html | 0 doc/libc/unix/constant.IPPROTO_IPV6.html | 0 doc/libc/unix/constant.IPPROTO_RAW.html | 0 doc/libc/unix/constant.IPPROTO_TCP.html | 0 doc/libc/unix/constant.IPV6_JOIN_GROUP.html | 0 doc/libc/unix/constant.IPV6_LEAVE_GROUP.html | 0 .../unix/constant.IPV6_MULTICAST_LOOP.html | 0 doc/libc/unix/constant.IPV6_V6ONLY.html | 0 doc/libc/unix/constant.IP_ADD_MEMBERSHIP.html | 0 .../unix/constant.IP_DROP_MEMBERSHIP.html | 0 doc/libc/unix/constant.IP_HDRINCL.html | 0 doc/libc/unix/constant.IP_MULTICAST_LOOP.html | 0 doc/libc/unix/constant.IP_MULTICAST_TTL.html | 0 doc/libc/unix/constant.IP_TTL.html | 0 doc/libc/unix/constant.ISIG.html | 0 doc/libc/unix/constant.ISTRIP.html | 0 doc/libc/unix/constant.IUTF8.html | 0 doc/libc/unix/constant.IXANY.html | 0 doc/libc/unix/constant.IXOFF.html | 0 doc/libc/unix/constant.IXON.html | 0 doc/libc/unix/constant.LC_ALL.html | 0 doc/libc/unix/constant.LC_ALL_MASK.html | 0 doc/libc/unix/constant.LC_COLLATE.html | 0 doc/libc/unix/constant.LC_COLLATE_MASK.html | 0 doc/libc/unix/constant.LC_CTYPE.html | 0 doc/libc/unix/constant.LC_CTYPE_MASK.html | 0 doc/libc/unix/constant.LC_MESSAGES.html | 0 doc/libc/unix/constant.LC_MESSAGES_MASK.html | 0 doc/libc/unix/constant.LC_MONETARY.html | 0 doc/libc/unix/constant.LC_MONETARY_MASK.html | 0 doc/libc/unix/constant.LC_NUMERIC.html | 0 doc/libc/unix/constant.LC_NUMERIC_MASK.html | 0 doc/libc/unix/constant.LC_TIME.html | 0 doc/libc/unix/constant.LC_TIME_MASK.html | 0 doc/libc/unix/constant.LOCK_EX.html | 0 doc/libc/unix/constant.LOCK_NB.html | 0 doc/libc/unix/constant.LOCK_SH.html | 0 doc/libc/unix/constant.LOCK_UN.html | 0 doc/libc/unix/constant.L_tmpnam.html | 0 doc/libc/unix/constant.MADV_CAN_REUSE.html | 0 doc/libc/unix/constant.MADV_DONTNEED.html | 0 doc/libc/unix/constant.MADV_FREE.html | 0 .../unix/constant.MADV_FREE_REUSABLE.html | 0 doc/libc/unix/constant.MADV_FREE_REUSE.html | 0 doc/libc/unix/constant.MADV_NORMAL.html | 0 doc/libc/unix/constant.MADV_RANDOM.html | 0 doc/libc/unix/constant.MADV_SEQUENTIAL.html | 0 doc/libc/unix/constant.MADV_WILLNEED.html | 0 .../unix/constant.MADV_ZERO_WIRED_PAGES.html | 0 doc/libc/unix/constant.MAP_ANON.html | 0 doc/libc/unix/constant.MAP_COPY.html | 0 doc/libc/unix/constant.MAP_FAILED.html | 0 doc/libc/unix/constant.MAP_FILE.html | 0 doc/libc/unix/constant.MAP_FIXED.html | 0 doc/libc/unix/constant.MAP_HASSEMAPHORE.html | 0 doc/libc/unix/constant.MAP_JIT.html | 0 doc/libc/unix/constant.MAP_NOCACHE.html | 0 doc/libc/unix/constant.MAP_NOEXTEND.html | 0 doc/libc/unix/constant.MAP_NORESERVE.html | 0 doc/libc/unix/constant.MAP_PRIVATE.html | 0 doc/libc/unix/constant.MAP_RENAME.html | 0 doc/libc/unix/constant.MAP_SHARED.html | 0 doc/libc/unix/constant.MCL_CURRENT.html | 0 doc/libc/unix/constant.MCL_FUTURE.html | 0 doc/libc/unix/constant.MINCORE_INCORE.html | 0 doc/libc/unix/constant.MINCORE_MODIFIED.html | 0 .../unix/constant.MINCORE_MODIFIED_OTHER.html | 0 .../unix/constant.MINCORE_REFERENCED.html | 0 .../constant.MINCORE_REFERENCED_OTHER.html | 0 doc/libc/unix/constant.MNT_FORCE.html | 0 doc/libc/unix/constant.MON_1.html | 0 doc/libc/unix/constant.MON_10.html | 0 doc/libc/unix/constant.MON_11.html | 0 doc/libc/unix/constant.MON_12.html | 0 doc/libc/unix/constant.MON_2.html | 0 doc/libc/unix/constant.MON_3.html | 0 doc/libc/unix/constant.MON_4.html | 0 doc/libc/unix/constant.MON_5.html | 0 doc/libc/unix/constant.MON_6.html | 0 doc/libc/unix/constant.MON_7.html | 0 doc/libc/unix/constant.MON_8.html | 0 doc/libc/unix/constant.MON_9.html | 0 doc/libc/unix/constant.MS_ASYNC.html | 0 doc/libc/unix/constant.MS_DEACTIVATE.html | 0 doc/libc/unix/constant.MS_INVALIDATE.html | 0 doc/libc/unix/constant.MS_KILLPAGES.html | 0 doc/libc/unix/constant.MS_SYNC.html | 0 doc/libc/unix/constant.NCCS.html | 0 doc/libc/unix/constant.NI_MAXHOST.html | 0 doc/libc/unix/constant.NL0.html | 0 doc/libc/unix/constant.NL1.html | 0 doc/libc/unix/constant.NOEXPR.html | 0 doc/libc/unix/constant.NOFLSH.html | 0 doc/libc/unix/constant.NOSTR.html | 0 doc/libc/unix/constant.NOTE_ABSOLUTE.html | 0 doc/libc/unix/constant.NOTE_ATTRIB.html | 0 doc/libc/unix/constant.NOTE_CHILD.html | 0 doc/libc/unix/constant.NOTE_DELETE.html | 0 doc/libc/unix/constant.NOTE_EXEC.html | 0 doc/libc/unix/constant.NOTE_EXIT.html | 0 doc/libc/unix/constant.NOTE_EXITSTATUS.html | 0 .../unix/constant.NOTE_EXIT_REPARENTED.html | 0 doc/libc/unix/constant.NOTE_EXTEND.html | 0 doc/libc/unix/constant.NOTE_FFAND.html | 0 doc/libc/unix/constant.NOTE_FFCOPY.html | 0 doc/libc/unix/constant.NOTE_FFCTRLMASK.html | 0 doc/libc/unix/constant.NOTE_FFLAGSMASK.html | 0 doc/libc/unix/constant.NOTE_FFNOP.html | 0 doc/libc/unix/constant.NOTE_FFOR.html | 0 doc/libc/unix/constant.NOTE_FORK.html | 0 doc/libc/unix/constant.NOTE_LINK.html | 0 doc/libc/unix/constant.NOTE_LOWAT.html | 0 doc/libc/unix/constant.NOTE_NONE.html | 0 doc/libc/unix/constant.NOTE_NSECONDS.html | 0 doc/libc/unix/constant.NOTE_PCTRLMASK.html | 0 doc/libc/unix/constant.NOTE_PDATAMASK.html | 0 doc/libc/unix/constant.NOTE_REAP.html | 0 doc/libc/unix/constant.NOTE_RENAME.html | 0 doc/libc/unix/constant.NOTE_REVOKE.html | 0 doc/libc/unix/constant.NOTE_SECONDS.html | 0 doc/libc/unix/constant.NOTE_SIGNAL.html | 0 doc/libc/unix/constant.NOTE_TRACK.html | 0 doc/libc/unix/constant.NOTE_TRACKERR.html | 0 doc/libc/unix/constant.NOTE_TRIGGER.html | 0 doc/libc/unix/constant.NOTE_USECONDS.html | 0 doc/libc/unix/constant.NOTE_VM_ERROR.html | 0 doc/libc/unix/constant.NOTE_VM_PRESSURE.html | 0 ...ant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html | 0 .../constant.NOTE_VM_PRESSURE_TERMINATE.html | 0 doc/libc/unix/constant.NOTE_WRITE.html | 0 doc/libc/unix/constant.ONLCR.html | 0 doc/libc/unix/constant.OPOST.html | 0 doc/libc/unix/constant.O_ACCMODE.html | 0 doc/libc/unix/constant.O_APPEND.html | 0 doc/libc/unix/constant.O_ASYNC.html | 0 doc/libc/unix/constant.O_CLOEXEC.html | 0 doc/libc/unix/constant.O_CREAT.html | 0 doc/libc/unix/constant.O_DIRECTORY.html | 0 doc/libc/unix/constant.O_DSYNC.html | 0 doc/libc/unix/constant.O_EXCL.html | 0 doc/libc/unix/constant.O_FSYNC.html | 0 doc/libc/unix/constant.O_NDELAY.html | 0 doc/libc/unix/constant.O_NOCTTY.html | 0 doc/libc/unix/constant.O_NOFOLLOW.html | 0 doc/libc/unix/constant.O_NONBLOCK.html | 0 doc/libc/unix/constant.O_RDONLY.html | 0 doc/libc/unix/constant.O_RDWR.html | 0 doc/libc/unix/constant.O_SYNC.html | 0 doc/libc/unix/constant.O_TRUNC.html | 0 doc/libc/unix/constant.O_WRONLY.html | 0 doc/libc/unix/constant.PARENB.html | 0 doc/libc/unix/constant.PARMRK.html | 0 doc/libc/unix/constant.PARODD.html | 0 doc/libc/unix/constant.PATH_MAX.html | 0 doc/libc/unix/constant.PENDIN.html | 0 doc/libc/unix/constant.PM_STR.html | 0 doc/libc/unix/constant.POLLERR.html | 0 doc/libc/unix/constant.POLLHUP.html | 0 doc/libc/unix/constant.POLLIN.html | 0 doc/libc/unix/constant.POLLNVAL.html | 0 doc/libc/unix/constant.POLLOUT.html | 0 doc/libc/unix/constant.POLLPRI.html | 0 .../unix/constant.POSIX_MADV_DONTNEED.html | 0 doc/libc/unix/constant.POSIX_MADV_NORMAL.html | 0 doc/libc/unix/constant.POSIX_MADV_RANDOM.html | 0 .../unix/constant.POSIX_MADV_SEQUENTIAL.html | 0 .../unix/constant.POSIX_MADV_WILLNEED.html | 0 doc/libc/unix/constant.PROT_EXEC.html | 0 doc/libc/unix/constant.PROT_NONE.html | 0 doc/libc/unix/constant.PROT_READ.html | 0 doc/libc/unix/constant.PROT_WRITE.html | 0 .../constant.PTHREAD_COND_INITIALIZER.html | 0 .../constant.PTHREAD_CREATE_DETACHED.html | 0 .../constant.PTHREAD_CREATE_JOINABLE.html | 0 .../constant.PTHREAD_MUTEX_INITIALIZER.html | 0 .../constant.PTHREAD_MUTEX_RECURSIVE.html | 0 .../constant.PTHREAD_RWLOCK_INITIALIZER.html | 0 doc/libc/unix/constant.PTHREAD_STACK_MIN.html | 0 doc/libc/unix/constant.Q_GETQUOTA.html | 0 doc/libc/unix/constant.Q_QUOTAOFF.html | 0 doc/libc/unix/constant.Q_QUOTAON.html | 0 doc/libc/unix/constant.Q_SETQUOTA.html | 0 doc/libc/unix/constant.Q_SYNC.html | 0 doc/libc/unix/constant.RADIXCHAR.html | 0 doc/libc/unix/constant.RAND_MAX.html | 0 doc/libc/unix/constant.RLIMIT_AS.html | 0 doc/libc/unix/constant.RLIMIT_CORE.html | 0 doc/libc/unix/constant.RLIMIT_CPU.html | 0 doc/libc/unix/constant.RLIMIT_DATA.html | 0 doc/libc/unix/constant.RLIMIT_FSIZE.html | 0 doc/libc/unix/constant.RLIMIT_MEMLOCK.html | 0 doc/libc/unix/constant.RLIMIT_NOFILE.html | 0 doc/libc/unix/constant.RLIMIT_NPROC.html | 0 doc/libc/unix/constant.RLIMIT_RSS.html | 0 doc/libc/unix/constant.RLIMIT_STACK.html | 0 doc/libc/unix/constant.RLIM_INFINITY.html | 0 doc/libc/unix/constant.RLIM_NLIMITS.html | 0 doc/libc/unix/constant.RTLD_DEFAULT.html | 0 doc/libc/unix/constant.RTLD_FIRST.html | 0 doc/libc/unix/constant.RTLD_GLOBAL.html | 0 doc/libc/unix/constant.RTLD_LAZY.html | 0 doc/libc/unix/constant.RTLD_LOCAL.html | 0 doc/libc/unix/constant.RTLD_NODELETE.html | 0 doc/libc/unix/constant.RTLD_NOLOAD.html | 0 doc/libc/unix/constant.RTLD_NOW.html | 0 doc/libc/unix/constant.RUSAGE_CHILDREN.html | 0 doc/libc/unix/constant.RUSAGE_SELF.html | 0 doc/libc/unix/constant.R_OK.html | 0 doc/libc/unix/constant.SA_NOCLDSTOP.html | 0 doc/libc/unix/constant.SA_NOCLDWAIT.html | 0 doc/libc/unix/constant.SA_NODEFER.html | 0 doc/libc/unix/constant.SA_ONSTACK.html | 0 doc/libc/unix/constant.SA_RESETHAND.html | 0 doc/libc/unix/constant.SA_RESTART.html | 0 doc/libc/unix/constant.SA_SIGINFO.html | 0 doc/libc/unix/constant.SEEK_CUR.html | 0 doc/libc/unix/constant.SEEK_END.html | 0 doc/libc/unix/constant.SEEK_SET.html | 0 doc/libc/unix/constant.SHUT_RD.html | 0 doc/libc/unix/constant.SHUT_RDWR.html | 0 doc/libc/unix/constant.SHUT_WR.html | 0 doc/libc/unix/constant.SIGABRT.html | 0 doc/libc/unix/constant.SIGALRM.html | 0 doc/libc/unix/constant.SIGBUS.html | 0 doc/libc/unix/constant.SIGCHLD.html | 0 doc/libc/unix/constant.SIGCONT.html | 0 doc/libc/unix/constant.SIGEMT.html | 0 doc/libc/unix/constant.SIGFPE.html | 0 doc/libc/unix/constant.SIGHUP.html | 0 doc/libc/unix/constant.SIGILL.html | 0 doc/libc/unix/constant.SIGINFO.html | 0 doc/libc/unix/constant.SIGINT.html | 0 doc/libc/unix/constant.SIGIO.html | 0 doc/libc/unix/constant.SIGIOT.html | 0 doc/libc/unix/constant.SIGKILL.html | 0 doc/libc/unix/constant.SIGPIPE.html | 0 doc/libc/unix/constant.SIGPROF.html | 0 doc/libc/unix/constant.SIGQUIT.html | 0 doc/libc/unix/constant.SIGSEGV.html | 0 doc/libc/unix/constant.SIGSTKSZ.html | 0 doc/libc/unix/constant.SIGSTOP.html | 0 doc/libc/unix/constant.SIGSYS.html | 0 doc/libc/unix/constant.SIGTERM.html | 0 doc/libc/unix/constant.SIGTRAP.html | 0 doc/libc/unix/constant.SIGTSTP.html | 0 doc/libc/unix/constant.SIGTTIN.html | 0 doc/libc/unix/constant.SIGTTOU.html | 0 doc/libc/unix/constant.SIGURG.html | 0 doc/libc/unix/constant.SIGUSR1.html | 0 doc/libc/unix/constant.SIGUSR2.html | 0 doc/libc/unix/constant.SIGVTALRM.html | 0 doc/libc/unix/constant.SIGWINCH.html | 0 doc/libc/unix/constant.SIGXCPU.html | 0 doc/libc/unix/constant.SIGXFSZ.html | 0 doc/libc/unix/constant.SIG_BLOCK.html | 0 doc/libc/unix/constant.SIG_DFL.html | 0 doc/libc/unix/constant.SIG_ERR.html | 0 doc/libc/unix/constant.SIG_IGN.html | 0 doc/libc/unix/constant.SIG_SETMASK.html | 0 doc/libc/unix/constant.SIG_UNBLOCK.html | 0 doc/libc/unix/constant.SOCK_DGRAM.html | 0 doc/libc/unix/constant.SOCK_RAW.html | 0 doc/libc/unix/constant.SOCK_STREAM.html | 0 doc/libc/unix/constant.SOL_SOCKET.html | 0 doc/libc/unix/constant.SO_ACCEPTCONN.html | 0 doc/libc/unix/constant.SO_BROADCAST.html | 0 doc/libc/unix/constant.SO_DEBUG.html | 0 doc/libc/unix/constant.SO_DONTROUTE.html | 0 doc/libc/unix/constant.SO_DONTTRUNC.html | 0 doc/libc/unix/constant.SO_ERROR.html | 0 doc/libc/unix/constant.SO_KEEPALIVE.html | 0 doc/libc/unix/constant.SO_LINGER.html | 0 doc/libc/unix/constant.SO_NKE.html | 0 doc/libc/unix/constant.SO_NOADDRERR.html | 0 doc/libc/unix/constant.SO_NOSIGPIPE.html | 0 doc/libc/unix/constant.SO_NREAD.html | 0 doc/libc/unix/constant.SO_NWRITE.html | 0 doc/libc/unix/constant.SO_OOBINLINE.html | 0 doc/libc/unix/constant.SO_RCVBUF.html | 0 doc/libc/unix/constant.SO_RCVLOWAT.html | 0 doc/libc/unix/constant.SO_RCVTIMEO.html | 0 doc/libc/unix/constant.SO_REUSEADDR.html | 0 doc/libc/unix/constant.SO_REUSEPORT.html | 0 doc/libc/unix/constant.SO_SNDBUF.html | 0 doc/libc/unix/constant.SO_SNDLOWAT.html | 0 doc/libc/unix/constant.SO_SNDTIMEO.html | 0 doc/libc/unix/constant.SO_TYPE.html | 0 doc/libc/unix/constant.SO_USELOOPBACK.html | 0 doc/libc/unix/constant.SO_WANTMORE.html | 0 doc/libc/unix/constant.SO_WANTOOBFLAG.html | 0 doc/libc/unix/constant.SS_DISABLE.html | 0 doc/libc/unix/constant.SS_ONSTACK.html | 0 doc/libc/unix/constant.STDERR_FILENO.html | 0 doc/libc/unix/constant.STDIN_FILENO.html | 0 doc/libc/unix/constant.STDOUT_FILENO.html | 0 doc/libc/unix/constant.ST_NOSUID.html | 0 doc/libc/unix/constant.ST_RDONLY.html | 0 doc/libc/unix/constant.S_IEXEC.html | 0 doc/libc/unix/constant.S_IFBLK.html | 0 doc/libc/unix/constant.S_IFCHR.html | 0 doc/libc/unix/constant.S_IFDIR.html | 0 doc/libc/unix/constant.S_IFIFO.html | 0 doc/libc/unix/constant.S_IFLNK.html | 0 doc/libc/unix/constant.S_IFMT.html | 0 doc/libc/unix/constant.S_IFREG.html | 0 doc/libc/unix/constant.S_IFSOCK.html | 0 doc/libc/unix/constant.S_IREAD.html | 0 doc/libc/unix/constant.S_IRGRP.html | 0 doc/libc/unix/constant.S_IROTH.html | 0 doc/libc/unix/constant.S_IRUSR.html | 0 doc/libc/unix/constant.S_IRWXG.html | 0 doc/libc/unix/constant.S_IRWXO.html | 0 doc/libc/unix/constant.S_IRWXU.html | 0 doc/libc/unix/constant.S_ISGID.html | 0 doc/libc/unix/constant.S_ISUID.html | 0 doc/libc/unix/constant.S_ISVTX.html | 0 doc/libc/unix/constant.S_IWGRP.html | 0 doc/libc/unix/constant.S_IWOTH.html | 0 doc/libc/unix/constant.S_IWRITE.html | 0 doc/libc/unix/constant.S_IWUSR.html | 0 doc/libc/unix/constant.S_IXGRP.html | 0 doc/libc/unix/constant.S_IXOTH.html | 0 doc/libc/unix/constant.S_IXUSR.html | 0 doc/libc/unix/constant.TAB0.html | 0 doc/libc/unix/constant.TAB1.html | 0 doc/libc/unix/constant.TAB2.html | 0 doc/libc/unix/constant.TAB3.html | 0 doc/libc/unix/constant.TCIFLUSH.html | 0 doc/libc/unix/constant.TCIOFF.html | 0 doc/libc/unix/constant.TCIOFLUSH.html | 0 doc/libc/unix/constant.TCION.html | 0 doc/libc/unix/constant.TCOFLUSH.html | 0 doc/libc/unix/constant.TCOOFF.html | 0 doc/libc/unix/constant.TCOON.html | 0 doc/libc/unix/constant.TCP_KEEPALIVE.html | 0 doc/libc/unix/constant.TCP_NODELAY.html | 0 doc/libc/unix/constant.TCSADRAIN.html | 0 doc/libc/unix/constant.TCSAFLUSH.html | 0 doc/libc/unix/constant.TCSANOW.html | 0 doc/libc/unix/constant.THOUSEP.html | 0 doc/libc/unix/constant.TIOCCBRK.html | 0 doc/libc/unix/constant.TIOCCDTR.html | 0 doc/libc/unix/constant.TIOCCONS.html | 0 doc/libc/unix/constant.TIOCDCDTIMESTAMP.html | 0 doc/libc/unix/constant.TIOCDRAIN.html | 0 doc/libc/unix/constant.TIOCDSIMICROCODE.html | 0 doc/libc/unix/constant.TIOCEXCL.html | 0 doc/libc/unix/constant.TIOCEXT.html | 0 doc/libc/unix/constant.TIOCFLUSH.html | 0 doc/libc/unix/constant.TIOCGDRAINWAIT.html | 0 doc/libc/unix/constant.TIOCGETD.html | 0 doc/libc/unix/constant.TIOCGPGRP.html | 0 doc/libc/unix/constant.TIOCGWINSZ.html | 0 doc/libc/unix/constant.TIOCIXOFF.html | 0 doc/libc/unix/constant.TIOCIXON.html | 0 doc/libc/unix/constant.TIOCMBIC.html | 0 doc/libc/unix/constant.TIOCMBIS.html | 0 doc/libc/unix/constant.TIOCMGDTRWAIT.html | 0 doc/libc/unix/constant.TIOCMGET.html | 0 doc/libc/unix/constant.TIOCMODG.html | 0 doc/libc/unix/constant.TIOCMODS.html | 0 doc/libc/unix/constant.TIOCMSDTRWAIT.html | 0 doc/libc/unix/constant.TIOCMSET.html | 0 doc/libc/unix/constant.TIOCM_CAR.html | 0 doc/libc/unix/constant.TIOCM_CD.html | 0 doc/libc/unix/constant.TIOCM_CTS.html | 0 doc/libc/unix/constant.TIOCM_DSR.html | 0 doc/libc/unix/constant.TIOCM_DTR.html | 0 doc/libc/unix/constant.TIOCM_LE.html | 0 doc/libc/unix/constant.TIOCM_RI.html | 0 doc/libc/unix/constant.TIOCM_RNG.html | 0 doc/libc/unix/constant.TIOCM_RTS.html | 0 doc/libc/unix/constant.TIOCM_SR.html | 0 doc/libc/unix/constant.TIOCM_ST.html | 0 doc/libc/unix/constant.TIOCNOTTY.html | 0 doc/libc/unix/constant.TIOCNXCL.html | 0 doc/libc/unix/constant.TIOCOUTQ.html | 0 doc/libc/unix/constant.TIOCPKT.html | 0 doc/libc/unix/constant.TIOCPKT_DATA.html | 0 doc/libc/unix/constant.TIOCPKT_DOSTOP.html | 0 doc/libc/unix/constant.TIOCPKT_FLUSHREAD.html | 0 .../unix/constant.TIOCPKT_FLUSHWRITE.html | 0 doc/libc/unix/constant.TIOCPKT_IOCTL.html | 0 doc/libc/unix/constant.TIOCPKT_NOSTOP.html | 0 doc/libc/unix/constant.TIOCPKT_START.html | 0 doc/libc/unix/constant.TIOCPKT_STOP.html | 0 doc/libc/unix/constant.TIOCPTYGNAME.html | 0 doc/libc/unix/constant.TIOCPTYGRANT.html | 0 doc/libc/unix/constant.TIOCPTYUNLK.html | 0 doc/libc/unix/constant.TIOCREMOTE.html | 0 doc/libc/unix/constant.TIOCSBRK.html | 0 doc/libc/unix/constant.TIOCSCONS.html | 0 doc/libc/unix/constant.TIOCSCTTY.html | 0 doc/libc/unix/constant.TIOCSDRAINWAIT.html | 0 doc/libc/unix/constant.TIOCSDTR.html | 0 doc/libc/unix/constant.TIOCSETD.html | 0 doc/libc/unix/constant.TIOCSIG.html | 0 doc/libc/unix/constant.TIOCSPGRP.html | 0 doc/libc/unix/constant.TIOCSTART.html | 0 doc/libc/unix/constant.TIOCSTAT.html | 0 doc/libc/unix/constant.TIOCSTI.html | 0 doc/libc/unix/constant.TIOCSTOP.html | 0 doc/libc/unix/constant.TIOCSWINSZ.html | 0 doc/libc/unix/constant.TIOCTIMESTAMP.html | 0 doc/libc/unix/constant.TIOCUCNTL.html | 0 doc/libc/unix/constant.TMP_MAX.html | 0 doc/libc/unix/constant.TOSTOP.html | 0 doc/libc/unix/constant.T_FMT.html | 0 doc/libc/unix/constant.T_FMT_AMPM.html | 0 doc/libc/unix/constant.USRQUOTA.html | 0 doc/libc/unix/constant.VDISCARD.html | 0 doc/libc/unix/constant.VEOF.html | 0 doc/libc/unix/constant.VEOL.html | 0 doc/libc/unix/constant.VEOL2.html | 0 doc/libc/unix/constant.VERASE.html | 0 doc/libc/unix/constant.VINTR.html | 0 doc/libc/unix/constant.VKILL.html | 0 doc/libc/unix/constant.VLNEXT.html | 0 doc/libc/unix/constant.VMIN.html | 0 doc/libc/unix/constant.VQUIT.html | 0 doc/libc/unix/constant.VREPRINT.html | 0 doc/libc/unix/constant.VSTART.html | 0 doc/libc/unix/constant.VSTOP.html | 0 doc/libc/unix/constant.VSUSP.html | 0 doc/libc/unix/constant.VT0.html | 0 doc/libc/unix/constant.VT1.html | 0 doc/libc/unix/constant.VTIME.html | 0 doc/libc/unix/constant.VWERASE.html | 0 doc/libc/unix/constant.WNOHANG.html | 0 doc/libc/unix/constant.W_OK.html | 0 doc/libc/unix/constant.X_OK.html | 0 doc/libc/unix/constant.YESEXPR.html | 0 doc/libc/unix/constant.YESSTR.html | 0 doc/libc/unix/constant._IOFBF.html | 0 doc/libc/unix/constant._IOLBF.html | 0 doc/libc/unix/constant._IONBF.html | 0 doc/libc/unix/constant._PC_NAME_MAX.html | 0 .../unix/constant._PTHREAD_COND_SIG_init.html | 0 .../constant._PTHREAD_MUTEX_SIG_init.html | 0 .../constant._PTHREAD_RWLOCK_SIG_init.html | 0 .../unix/constant._RLIMIT_POSIX_FLAG.html | 0 doc/libc/unix/constant._SC_2_CHAR_TERM.html | 0 doc/libc/unix/constant._SC_2_C_BIND.html | 0 doc/libc/unix/constant._SC_2_C_DEV.html | 0 doc/libc/unix/constant._SC_2_FORT_DEV.html | 0 doc/libc/unix/constant._SC_2_FORT_RUN.html | 0 doc/libc/unix/constant._SC_2_LOCALEDEF.html | 0 doc/libc/unix/constant._SC_2_PBS.html | 0 .../unix/constant._SC_2_PBS_ACCOUNTING.html | 0 .../unix/constant._SC_2_PBS_CHECKPOINT.html | 0 doc/libc/unix/constant._SC_2_PBS_LOCATE.html | 0 doc/libc/unix/constant._SC_2_PBS_MESSAGE.html | 0 doc/libc/unix/constant._SC_2_PBS_TRACK.html | 0 doc/libc/unix/constant._SC_2_SW_DEV.html | 0 doc/libc/unix/constant._SC_2_UPE.html | 0 doc/libc/unix/constant._SC_2_VERSION.html | 0 doc/libc/unix/constant._SC_ADVISORY_INFO.html | 0 .../unix/constant._SC_AIO_LISTIO_MAX.html | 0 doc/libc/unix/constant._SC_AIO_MAX.html | 0 .../unix/constant._SC_AIO_PRIO_DELTA_MAX.html | 0 doc/libc/unix/constant._SC_ARG_MAX.html | 0 .../unix/constant._SC_ASYNCHRONOUS_IO.html | 0 doc/libc/unix/constant._SC_ATEXIT_MAX.html | 0 doc/libc/unix/constant._SC_BARRIERS.html | 0 doc/libc/unix/constant._SC_BC_BASE_MAX.html | 0 doc/libc/unix/constant._SC_BC_DIM_MAX.html | 0 doc/libc/unix/constant._SC_BC_SCALE_MAX.html | 0 doc/libc/unix/constant._SC_BC_STRING_MAX.html | 0 doc/libc/unix/constant._SC_CHILD_MAX.html | 0 doc/libc/unix/constant._SC_CLK_TCK.html | 0 .../unix/constant._SC_CLOCK_SELECTION.html | 0 .../unix/constant._SC_COLL_WEIGHTS_MAX.html | 0 doc/libc/unix/constant._SC_CPUTIME.html | 0 .../unix/constant._SC_DELAYTIMER_MAX.html | 0 doc/libc/unix/constant._SC_EXPR_NEST_MAX.html | 0 doc/libc/unix/constant._SC_FILE_LOCKING.html | 0 doc/libc/unix/constant._SC_FSYNC.html | 0 .../unix/constant._SC_GETGR_R_SIZE_MAX.html | 0 .../unix/constant._SC_GETPW_R_SIZE_MAX.html | 0 doc/libc/unix/constant._SC_HOST_NAME_MAX.html | 0 doc/libc/unix/constant._SC_IOV_MAX.html | 0 doc/libc/unix/constant._SC_IPV6.html | 0 doc/libc/unix/constant._SC_JOB_CONTROL.html | 0 doc/libc/unix/constant._SC_LINE_MAX.html | 0 .../unix/constant._SC_LOGIN_NAME_MAX.html | 0 doc/libc/unix/constant._SC_MAPPED_FILES.html | 0 doc/libc/unix/constant._SC_MEMLOCK.html | 0 doc/libc/unix/constant._SC_MEMLOCK_RANGE.html | 0 .../unix/constant._SC_MEMORY_PROTECTION.html | 0 .../unix/constant._SC_MESSAGE_PASSING.html | 0 .../unix/constant._SC_MONOTONIC_CLOCK.html | 0 doc/libc/unix/constant._SC_MQ_OPEN_MAX.html | 0 doc/libc/unix/constant._SC_MQ_PRIO_MAX.html | 0 doc/libc/unix/constant._SC_NGROUPS_MAX.html | 0 .../unix/constant._SC_NPROCESSORS_CONF.html | 0 .../unix/constant._SC_NPROCESSORS_ONLN.html | 0 doc/libc/unix/constant._SC_OPEN_MAX.html | 0 doc/libc/unix/constant._SC_PAGESIZE.html | 0 doc/libc/unix/constant._SC_PAGE_SIZE.html | 0 doc/libc/unix/constant._SC_PASS_MAX.html | 0 .../unix/constant._SC_PRIORITIZED_IO.html | 0 .../constant._SC_PRIORITY_SCHEDULING.html | 0 doc/libc/unix/constant._SC_RAW_SOCKETS.html | 0 .../constant._SC_READER_WRITER_LOCKS.html | 0 .../unix/constant._SC_REALTIME_SIGNALS.html | 0 doc/libc/unix/constant._SC_REGEXP.html | 0 doc/libc/unix/constant._SC_RE_DUP_MAX.html | 0 doc/libc/unix/constant._SC_RTSIG_MAX.html | 0 doc/libc/unix/constant._SC_SAVED_IDS.html | 0 doc/libc/unix/constant._SC_SEMAPHORES.html | 0 doc/libc/unix/constant._SC_SEM_NSEMS_MAX.html | 0 doc/libc/unix/constant._SC_SEM_VALUE_MAX.html | 0 .../constant._SC_SHARED_MEMORY_OBJECTS.html | 0 doc/libc/unix/constant._SC_SHELL.html | 0 doc/libc/unix/constant._SC_SIGQUEUE_MAX.html | 0 doc/libc/unix/constant._SC_SPAWN.html | 0 doc/libc/unix/constant._SC_SPIN_LOCKS.html | 0 .../unix/constant._SC_SPORADIC_SERVER.html | 0 doc/libc/unix/constant._SC_SS_REPL_MAX.html | 0 doc/libc/unix/constant._SC_STREAM_MAX.html | 0 doc/libc/unix/constant._SC_SYMLOOP_MAX.html | 0 .../unix/constant._SC_SYNCHRONIZED_IO.html | 0 doc/libc/unix/constant._SC_THREADS.html | 0 .../constant._SC_THREAD_ATTR_STACKADDR.html | 0 .../constant._SC_THREAD_ATTR_STACKSIZE.html | 0 .../unix/constant._SC_THREAD_CPUTIME.html | 0 ...tant._SC_THREAD_DESTRUCTOR_ITERATIONS.html | 0 .../unix/constant._SC_THREAD_KEYS_MAX.html | 0 ...nstant._SC_THREAD_PRIORITY_SCHEDULING.html | 0 .../constant._SC_THREAD_PRIO_INHERIT.html | 0 .../constant._SC_THREAD_PRIO_PROTECT.html | 0 .../constant._SC_THREAD_PROCESS_SHARED.html | 0 .../constant._SC_THREAD_SAFE_FUNCTIONS.html | 0 .../constant._SC_THREAD_SPORADIC_SERVER.html | 0 .../unix/constant._SC_THREAD_STACK_MIN.html | 0 .../unix/constant._SC_THREAD_THREADS_MAX.html | 0 doc/libc/unix/constant._SC_TIMEOUTS.html | 0 doc/libc/unix/constant._SC_TIMERS.html | 0 doc/libc/unix/constant._SC_TIMER_MAX.html | 0 doc/libc/unix/constant._SC_TRACE.html | 0 .../unix/constant._SC_TRACE_EVENT_FILTER.html | 0 .../constant._SC_TRACE_EVENT_NAME_MAX.html | 0 doc/libc/unix/constant._SC_TRACE_INHERIT.html | 0 doc/libc/unix/constant._SC_TRACE_LOG.html | 0 .../unix/constant._SC_TRACE_NAME_MAX.html | 0 doc/libc/unix/constant._SC_TRACE_SYS_MAX.html | 0 .../constant._SC_TRACE_USER_EVENT_MAX.html | 0 doc/libc/unix/constant._SC_TTY_NAME_MAX.html | 0 .../constant._SC_TYPED_MEMORY_OBJECTS.html | 0 doc/libc/unix/constant._SC_TZNAME_MAX.html | 0 .../unix/constant._SC_V6_ILP32_OFF32.html | 0 .../unix/constant._SC_V6_ILP32_OFFBIG.html | 0 doc/libc/unix/constant._SC_V6_LP64_OFF64.html | 0 .../unix/constant._SC_V6_LPBIG_OFFBIG.html | 0 doc/libc/unix/constant._SC_VERSION.html | 0 .../unix/constant._SC_XBS5_ILP32_OFF32.html | 0 .../unix/constant._SC_XBS5_ILP32_OFFBIG.html | 0 .../unix/constant._SC_XBS5_LP64_OFF64.html | 0 .../unix/constant._SC_XBS5_LPBIG_OFFBIG.html | 0 doc/libc/unix/constant._SC_XOPEN_CRYPT.html | 0 .../unix/constant._SC_XOPEN_ENH_I18N.html | 0 doc/libc/unix/constant._SC_XOPEN_LEGACY.html | 0 .../unix/constant._SC_XOPEN_REALTIME.html | 0 .../constant._SC_XOPEN_REALTIME_THREADS.html | 0 doc/libc/unix/constant._SC_XOPEN_SHM.html | 0 doc/libc/unix/constant._SC_XOPEN_STREAMS.html | 0 doc/libc/unix/constant._SC_XOPEN_UNIX.html | 0 doc/libc/unix/constant._SC_XOPEN_VERSION.html | 0 .../unix/constant._SC_XOPEN_XCU_VERSION.html | 0 doc/libc/unix/constant._WSTOPPED.html | 0 .../unix/constant.__PTHREAD_COND_SIZE__.html | 0 .../unix/constant.__PTHREAD_MUTEX_SIZE__.html | 0 .../constant.__PTHREAD_RWLOCK_SIZE__.html | 0 doc/libc/unix/enum.DIR.html | 10 - doc/libc/unix/enum.locale_t.html | 10 - doc/libc/unix/enum.timezone.html | 10 - doc/libc/unix/fn.FD_CLR.html | 10 - doc/libc/unix/fn.FD_ISSET.html | 10 - doc/libc/unix/fn.FD_SET.html | 10 - doc/libc/unix/fn.FD_ZERO.html | 10 - doc/libc/unix/fn.WCOREDUMP.html | 10 - doc/libc/unix/fn.WEXITSTATUS.html | 10 - doc/libc/unix/fn.WIFCONTINUED.html | 10 - doc/libc/unix/fn.WIFEXITED.html | 10 - doc/libc/unix/fn.WIFSIGNALED.html | 10 - doc/libc/unix/fn.WIFSTOPPED.html | 10 - doc/libc/unix/fn.WSTOPSIG.html | 10 - doc/libc/unix/fn.WTERMSIG.html | 10 - doc/libc/unix/fn._WSTATUS.html | 10 - doc/libc/unix/fn.__error.html | 10 - doc/libc/unix/fn.accept.html | 10 - doc/libc/unix/fn.access.html | 10 - doc/libc/unix/fn.alarm.html | 10 - doc/libc/unix/fn.backtrace.html | 10 - doc/libc/unix/fn.bind.html | 10 - doc/libc/unix/fn.cfgetispeed.html | 10 - doc/libc/unix/fn.cfgetospeed.html | 10 - doc/libc/unix/fn.cfsetispeed.html | 10 - doc/libc/unix/fn.cfsetospeed.html | 10 - doc/libc/unix/fn.chdir.html | 10 - doc/libc/unix/fn.chmod.html | 10 - doc/libc/unix/fn.chown.html | 10 - doc/libc/unix/fn.chroot.html | 10 - doc/libc/unix/fn.close.html | 10 - doc/libc/unix/fn.closedir.html | 10 - doc/libc/unix/fn.connect.html | 10 - doc/libc/unix/fn.creat.html | 10 - doc/libc/unix/fn.daemon.html | 10 - doc/libc/unix/fn.dladdr.html | 10 - doc/libc/unix/fn.dlclose.html | 10 - doc/libc/unix/fn.dlerror.html | 10 - doc/libc/unix/fn.dlopen.html | 10 - doc/libc/unix/fn.dlsym.html | 10 - doc/libc/unix/fn.dup.html | 10 - doc/libc/unix/fn.dup2.html | 10 - doc/libc/unix/fn.duplocale.html | 10 - doc/libc/unix/fn.execv.html | 10 - doc/libc/unix/fn.execve.html | 10 - doc/libc/unix/fn.execvp.html | 10 - doc/libc/unix/fn.fchmod.html | 10 - doc/libc/unix/fn.fcntl.html | 10 - doc/libc/unix/fn.fdopen.html | 10 - doc/libc/unix/fn.fileno.html | 10 - doc/libc/unix/fn.flock.html | 10 - doc/libc/unix/fn.fork.html | 10 - doc/libc/unix/fn.forkpty.html | 10 - doc/libc/unix/fn.fpathconf.html | 10 - doc/libc/unix/fn.fprintf.html | 10 - doc/libc/unix/fn.freeaddrinfo.html | 10 - doc/libc/unix/fn.freeifaddrs.html | 10 - doc/libc/unix/fn.freelocale.html | 10 - doc/libc/unix/fn.fscanf.html | 10 - doc/libc/unix/fn.fseeko.html | 10 - doc/libc/unix/fn.fstat.html | 10 - doc/libc/unix/fn.fstatfs.html | 10 - doc/libc/unix/fn.fstatvfs.html | 10 - doc/libc/unix/fn.fsync.html | 10 - doc/libc/unix/fn.ftello.html | 10 - doc/libc/unix/fn.ftruncate.html | 10 - doc/libc/unix/fn.futimes.html | 10 - doc/libc/unix/fn.gai_strerror.html | 10 - doc/libc/unix/fn.getaddrinfo.html | 10 - doc/libc/unix/fn.getcwd.html | 10 - doc/libc/unix/fn.getdtablesize.html | 10 - doc/libc/unix/fn.getegid.html | 10 - doc/libc/unix/fn.geteuid.html | 10 - doc/libc/unix/fn.getgid.html | 10 - doc/libc/unix/fn.getgroups.html | 10 - doc/libc/unix/fn.gethostname.html | 10 - doc/libc/unix/fn.getifaddrs.html | 10 - doc/libc/unix/fn.getlogin.html | 10 - doc/libc/unix/fn.getnameinfo.html | 10 - doc/libc/unix/fn.getopt.html | 10 - doc/libc/unix/fn.getpeername.html | 10 - doc/libc/unix/fn.getpgrp.html | 10 - doc/libc/unix/fn.getpid.html | 10 - doc/libc/unix/fn.getppid.html | 10 - doc/libc/unix/fn.getpwuid_r.html | 10 - doc/libc/unix/fn.getrlimit.html | 10 - doc/libc/unix/fn.getrusage.html | 10 - doc/libc/unix/fn.getsid.html | 10 - doc/libc/unix/fn.getsockname.html | 10 - doc/libc/unix/fn.getsockopt.html | 10 - doc/libc/unix/fn.gettimeofday.html | 10 - doc/libc/unix/fn.getuid.html | 10 - doc/libc/unix/fn.glob.html | 10 - doc/libc/unix/fn.globfree.html | 10 - doc/libc/unix/fn.gmtime_r.html | 10 - doc/libc/unix/fn.if_indextoname.html | 10 - doc/libc/unix/fn.if_nametoindex.html | 10 - doc/libc/unix/fn.ioctl.html | 10 - doc/libc/unix/fn.isatty.html | 10 - doc/libc/unix/fn.kevent.html | 10 - doc/libc/unix/fn.kevent64.html | 10 - doc/libc/unix/fn.kill.html | 10 - doc/libc/unix/fn.kqueue.html | 10 - doc/libc/unix/fn.link.html | 10 - doc/libc/unix/fn.listen.html | 10 - doc/libc/unix/fn.localeconv.html | 10 - doc/libc/unix/fn.localeconv_l.html | 10 - doc/libc/unix/fn.localtime_r.html | 10 - doc/libc/unix/fn.lseek.html | 10 - doc/libc/unix/fn.lstat.html | 10 - doc/libc/unix/fn.mach_absolute_time.html | 10 - doc/libc/unix/fn.mach_timebase_info.html | 10 - doc/libc/unix/fn.madvise.html | 10 - doc/libc/unix/fn.mincore.html | 10 - doc/libc/unix/fn.mkdir.html | 10 - doc/libc/unix/fn.mkdtemp.html | 10 - doc/libc/unix/fn.mkfifo.html | 10 - doc/libc/unix/fn.mknod.html | 10 - doc/libc/unix/fn.mkstemp.html | 10 - doc/libc/unix/fn.mkstemps.html | 10 - doc/libc/unix/fn.mktime.html | 10 - doc/libc/unix/fn.mlock.html | 10 - doc/libc/unix/fn.mlockall.html | 10 - doc/libc/unix/fn.mmap.html | 10 - doc/libc/unix/fn.mount.html | 10 - doc/libc/unix/fn.mprotect.html | 10 - doc/libc/unix/fn.msync.html | 10 - doc/libc/unix/fn.munlock.html | 10 - doc/libc/unix/fn.munlockall.html | 10 - doc/libc/unix/fn.munmap.html | 10 - doc/libc/unix/fn.nanosleep.html | 10 - doc/libc/unix/fn.newlocale.html | 10 - doc/libc/unix/fn.nl_langinfo.html | 10 - doc/libc/unix/fn.open.html | 10 - doc/libc/unix/fn.opendir.html | 10 - doc/libc/unix/fn.openpty.html | 10 - doc/libc/unix/fn.pathconf.html | 10 - doc/libc/unix/fn.pause.html | 10 - doc/libc/unix/fn.pclose.html | 10 - doc/libc/unix/fn.pipe.html | 10 - doc/libc/unix/fn.poll.html | 10 - doc/libc/unix/fn.popen.html | 10 - doc/libc/unix/fn.posix_madvise.html | 10 - doc/libc/unix/fn.posix_memalign.html | 10 - doc/libc/unix/fn.pread.html | 10 - doc/libc/unix/fn.printf.html | 10 - doc/libc/unix/fn.pselect.html | 10 - doc/libc/unix/fn.pthread_attr_destroy.html | 10 - doc/libc/unix/fn.pthread_attr_init.html | 10 - .../unix/fn.pthread_attr_setdetachstate.html | 10 - .../unix/fn.pthread_attr_setstacksize.html | 10 - doc/libc/unix/fn.pthread_cond_broadcast.html | 10 - doc/libc/unix/fn.pthread_cond_destroy.html | 10 - doc/libc/unix/fn.pthread_cond_signal.html | 10 - doc/libc/unix/fn.pthread_cond_timedwait.html | 10 - doc/libc/unix/fn.pthread_cond_wait.html | 10 - doc/libc/unix/fn.pthread_create.html | 10 - doc/libc/unix/fn.pthread_detach.html | 10 - .../unix/fn.pthread_get_stackaddr_np.html | 10 - .../unix/fn.pthread_get_stacksize_np.html | 10 - doc/libc/unix/fn.pthread_getspecific.html | 10 - doc/libc/unix/fn.pthread_join.html | 10 - doc/libc/unix/fn.pthread_key_create.html | 10 - doc/libc/unix/fn.pthread_key_delete.html | 10 - doc/libc/unix/fn.pthread_kill.html | 10 - doc/libc/unix/fn.pthread_mutex_destroy.html | 10 - doc/libc/unix/fn.pthread_mutex_init.html | 10 - doc/libc/unix/fn.pthread_mutex_lock.html | 10 - doc/libc/unix/fn.pthread_mutex_trylock.html | 10 - doc/libc/unix/fn.pthread_mutex_unlock.html | 10 - .../unix/fn.pthread_mutexattr_destroy.html | 10 - doc/libc/unix/fn.pthread_mutexattr_init.html | 10 - .../unix/fn.pthread_mutexattr_settype.html | 10 - doc/libc/unix/fn.pthread_rwlock_destroy.html | 10 - doc/libc/unix/fn.pthread_rwlock_rdlock.html | 10 - .../unix/fn.pthread_rwlock_tryrdlock.html | 10 - .../unix/fn.pthread_rwlock_trywrlock.html | 10 - doc/libc/unix/fn.pthread_rwlock_unlock.html | 10 - doc/libc/unix/fn.pthread_rwlock_wrlock.html | 10 - doc/libc/unix/fn.pthread_self.html | 10 - doc/libc/unix/fn.pthread_setname_np.html | 10 - doc/libc/unix/fn.pthread_setspecific.html | 10 - doc/libc/unix/fn.pthread_sigmask.html | 10 - doc/libc/unix/fn.ptrace.html | 10 - doc/libc/unix/fn.putenv.html | 10 - doc/libc/unix/fn.pwrite.html | 10 - doc/libc/unix/fn.querylocale.html | 10 - doc/libc/unix/fn.quotactl.html | 10 - doc/libc/unix/fn.raise.html | 10 - doc/libc/unix/fn.read.html | 10 - doc/libc/unix/fn.readdir_r.html | 10 - doc/libc/unix/fn.readlink.html | 10 - doc/libc/unix/fn.readv.html | 10 - doc/libc/unix/fn.realpath.html | 10 - doc/libc/unix/fn.recv.html | 10 - doc/libc/unix/fn.recvfrom.html | 10 - doc/libc/unix/fn.recvmsg.html | 10 - doc/libc/unix/fn.rewinddir.html | 10 - doc/libc/unix/fn.rmdir.html | 10 - doc/libc/unix/fn.scanf.html | 10 - doc/libc/unix/fn.sched_yield.html | 10 - doc/libc/unix/fn.seekdir.html | 10 - doc/libc/unix/fn.select.html | 10 - doc/libc/unix/fn.send.html | 10 - doc/libc/unix/fn.sendfile.html | 10 - doc/libc/unix/fn.sendmsg.html | 10 - doc/libc/unix/fn.sendto.html | 10 - doc/libc/unix/fn.setenv.html | 10 - doc/libc/unix/fn.setgid.html | 10 - doc/libc/unix/fn.setgroups.html | 10 - doc/libc/unix/fn.sethostname.html | 10 - doc/libc/unix/fn.setlocale.html | 10 - doc/libc/unix/fn.setpgid.html | 10 - doc/libc/unix/fn.setrlimit.html | 10 - doc/libc/unix/fn.setsid.html | 10 - doc/libc/unix/fn.setsockopt.html | 10 - doc/libc/unix/fn.setuid.html | 10 - doc/libc/unix/fn.shm_open.html | 10 - doc/libc/unix/fn.shm_unlink.html | 10 - doc/libc/unix/fn.shutdown.html | 10 - doc/libc/unix/fn.sigaction.html | 10 - doc/libc/unix/fn.sigaddset.html | 10 - doc/libc/unix/fn.sigaltstack.html | 10 - doc/libc/unix/fn.sigdelset.html | 10 - doc/libc/unix/fn.sigemptyset.html | 10 - doc/libc/unix/fn.sigfillset.html | 10 - doc/libc/unix/fn.sigismember.html | 10 - doc/libc/unix/fn.signal.html | 10 - doc/libc/unix/fn.sigwait.html | 10 - doc/libc/unix/fn.sleep.html | 10 - doc/libc/unix/fn.snprintf.html | 10 - doc/libc/unix/fn.socket.html | 10 - doc/libc/unix/fn.socketpair.html | 10 - doc/libc/unix/fn.sprintf.html | 10 - doc/libc/unix/fn.sscanf.html | 10 - doc/libc/unix/fn.stat.html | 10 - doc/libc/unix/fn.statfs.html | 10 - doc/libc/unix/fn.statvfs.html | 10 - doc/libc/unix/fn.strerror_r.html | 10 - doc/libc/unix/fn.symlink.html | 10 - doc/libc/unix/fn.syscall.html | 10 - doc/libc/unix/fn.sysconf.html | 10 - doc/libc/unix/fn.sysctl.html | 10 - doc/libc/unix/fn.sysctlbyname.html | 10 - doc/libc/unix/fn.sysctlnametomib.html | 10 - doc/libc/unix/fn.tcdrain.html | 10 - doc/libc/unix/fn.tcflow.html | 10 - doc/libc/unix/fn.tcflush.html | 10 - doc/libc/unix/fn.tcgetattr.html | 10 - doc/libc/unix/fn.tcgetpgrp.html | 10 - doc/libc/unix/fn.tcsendbreak.html | 10 - doc/libc/unix/fn.tcsetattr.html | 10 - doc/libc/unix/fn.telldir.html | 10 - doc/libc/unix/fn.timegm.html | 10 - doc/libc/unix/fn.ttyname.html | 10 - doc/libc/unix/fn.umask.html | 10 - doc/libc/unix/fn.uname.html | 10 - doc/libc/unix/fn.unlink.html | 10 - doc/libc/unix/fn.unmount.html | 10 - doc/libc/unix/fn.unsetenv.html | 10 - doc/libc/unix/fn.uselocale.html | 10 - doc/libc/unix/fn.usleep.html | 10 - doc/libc/unix/fn.utime.html | 10 - doc/libc/unix/fn.utimes.html | 10 - doc/libc/unix/fn.wait.html | 10 - doc/libc/unix/fn.waitpid.html | 10 - doc/libc/unix/fn.write.html | 10 - doc/libc/unix/fn.writev.html | 10 - doc/libc/unix/index.html | 0 doc/libc/unix/sidebar-items.js | 1 - doc/libc/unix/struct.Dl_info.html | 10 - doc/libc/unix/struct.addrinfo.html | 10 - doc/libc/unix/struct.dirent.html | 10 - doc/libc/unix/struct.dqblk.html | 10 - doc/libc/unix/struct.fd_set.html | 10 - doc/libc/unix/struct.flock.html | 10 - doc/libc/unix/struct.fsid_t.html | 10 - doc/libc/unix/struct.fstore_t.html | 10 - doc/libc/unix/struct.glob_t.html | 10 - doc/libc/unix/struct.hostent.html | 10 - doc/libc/unix/struct.ifaddrs.html | 10 - doc/libc/unix/struct.in6_addr.html | 10 - doc/libc/unix/struct.in_addr.html | 10 - doc/libc/unix/struct.iovec.html | 10 - doc/libc/unix/struct.ip_mreq.html | 10 - doc/libc/unix/struct.ipv6_mreq.html | 10 - doc/libc/unix/struct.kevent.html | 10 - doc/libc/unix/struct.kevent64_s.html | 10 - doc/libc/unix/struct.lconv.html | 10 - doc/libc/unix/struct.mach_timebase_info.html | 10 - doc/libc/unix/struct.msghdr.html | 10 - doc/libc/unix/struct.passwd.html | 10 - doc/libc/unix/struct.pollfd.html | 10 - doc/libc/unix/struct.pthread_attr_t.html | 10 - doc/libc/unix/struct.pthread_cond_t.html | 10 - doc/libc/unix/struct.pthread_mutex_t.html | 10 - doc/libc/unix/struct.pthread_mutexattr_t.html | 10 - doc/libc/unix/struct.pthread_rwlock_t.html | 10 - doc/libc/unix/struct.radvisory.html | 10 - doc/libc/unix/struct.rlimit.html | 10 - doc/libc/unix/struct.rusage.html | 10 - doc/libc/unix/struct.sf_hdtr.html | 10 - doc/libc/unix/struct.sigaction.html | 10 - doc/libc/unix/struct.siginfo_t.html | 10 - doc/libc/unix/struct.sockaddr.html | 10 - doc/libc/unix/struct.sockaddr_in.html | 10 - doc/libc/unix/struct.sockaddr_in6.html | 10 - doc/libc/unix/struct.sockaddr_storage.html | 10 - doc/libc/unix/struct.sockaddr_un.html | 10 - doc/libc/unix/struct.stack_t.html | 10 - doc/libc/unix/struct.stat.html | 10 - doc/libc/unix/struct.statfs.html | 10 - doc/libc/unix/struct.statvfs.html | 10 - doc/libc/unix/struct.termios.html | 10 - doc/libc/unix/struct.timespec.html | 10 - doc/libc/unix/struct.timeval.html | 10 - doc/libc/unix/struct.tm.html | 10 - doc/libc/unix/struct.utimbuf.html | 10 - doc/libc/unix/struct.utsname.html | 10 - doc/libc/unix/struct.winsize.html | 10 - doc/libc/unix/type.blkcnt_t.html | 10 - doc/libc/unix/type.blksize_t.html | 10 - doc/libc/unix/type.c_char.html | 10 - doc/libc/unix/type.c_long.html | 10 - doc/libc/unix/type.c_ulong.html | 10 - doc/libc/unix/type.cc_t.html | 10 - doc/libc/unix/type.clock_t.html | 10 - doc/libc/unix/type.dev_t.html | 10 - doc/libc/unix/type.fsblkcnt_t.html | 10 - doc/libc/unix/type.fsfilcnt_t.html | 10 - doc/libc/unix/type.gid_t.html | 10 - doc/libc/unix/type.in_addr_t.html | 10 - doc/libc/unix/type.in_port_t.html | 10 - doc/libc/unix/type.ino_t.html | 10 - .../unix/type.mach_timebase_info_data_t.html | 10 - doc/libc/unix/type.mode_t.html | 10 - doc/libc/unix/type.nfds_t.html | 10 - doc/libc/unix/type.nl_item.html | 10 - doc/libc/unix/type.nlink_t.html | 10 - doc/libc/unix/type.off_t.html | 10 - doc/libc/unix/type.pid_t.html | 10 - doc/libc/unix/type.pthread_key_t.html | 10 - doc/libc/unix/type.pthread_t.html | 10 - doc/libc/unix/type.rlim_t.html | 10 - doc/libc/unix/type.sa_family_t.html | 10 - doc/libc/unix/type.sighandler_t.html | 10 - doc/libc/unix/type.sigset_t.html | 10 - doc/libc/unix/type.socklen_t.html | 10 - doc/libc/unix/type.speed_t.html | 10 - doc/libc/unix/type.suseconds_t.html | 10 - doc/libc/unix/type.tcflag_t.html | 10 - doc/libc/unix/type.time_t.html | 10 - doc/libc/unix/type.uid_t.html | 10 - doc/libc/unix/type.useconds_t.html | 10 - doc/libc/unix/type.wchar_t.html | 10 - doc/libz_sys/constant.Z_ASCII.html | 112 - doc/libz_sys/constant.Z_BEST_COMPRESSION.html | 112 - doc/libz_sys/constant.Z_BEST_SPEED.html | 112 - doc/libz_sys/constant.Z_BINARY.html | 112 - doc/libz_sys/constant.Z_BLOCK.html | 112 - doc/libz_sys/constant.Z_BUF_ERROR.html | 112 - doc/libz_sys/constant.Z_DATA_ERROR.html | 112 - .../constant.Z_DEFAULT_COMPRESSION.html | 112 - doc/libz_sys/constant.Z_DEFAULT_STRATEGY.html | 112 - doc/libz_sys/constant.Z_DEFLATED.html | 112 - doc/libz_sys/constant.Z_ERRNO.html | 112 - doc/libz_sys/constant.Z_FILTERED.html | 112 - doc/libz_sys/constant.Z_FINISH.html | 112 - doc/libz_sys/constant.Z_FIXED.html | 112 - doc/libz_sys/constant.Z_FULL_FLUSH.html | 112 - doc/libz_sys/constant.Z_HUFFMAN_ONLY.html | 112 - doc/libz_sys/constant.Z_MEM_ERROR.html | 112 - doc/libz_sys/constant.Z_NEED_DICT.html | 112 - doc/libz_sys/constant.Z_NO_COMPRESSION.html | 112 - doc/libz_sys/constant.Z_NO_FLUSH.html | 112 - doc/libz_sys/constant.Z_OK.html | 112 - doc/libz_sys/constant.Z_PARTIAL_FLUSH.html | 112 - doc/libz_sys/constant.Z_RLE.html | 112 - doc/libz_sys/constant.Z_STREAM_END.html | 112 - doc/libz_sys/constant.Z_STREAM_ERROR.html | 112 - doc/libz_sys/constant.Z_SYNC_FLUSH.html | 112 - doc/libz_sys/constant.Z_TEXT.html | 112 - doc/libz_sys/constant.Z_TREES.html | 112 - doc/libz_sys/constant.Z_UNKNOWN.html | 112 - doc/libz_sys/constant.Z_VERSION_ERROR.html | 112 - doc/libz_sys/enum.gzFile_s.html | 112 - doc/libz_sys/enum.internal_state.html | 112 - doc/libz_sys/fn.adler32.html | 112 - doc/libz_sys/fn.adler32_combine.html | 112 - doc/libz_sys/fn.compress.html | 112 - doc/libz_sys/fn.compress2.html | 112 - doc/libz_sys/fn.compressBound.html | 112 - doc/libz_sys/fn.crc32.html | 112 - doc/libz_sys/fn.crc32_combine.html | 112 - doc/libz_sys/fn.deflate.html | 112 - doc/libz_sys/fn.deflateBound.html | 112 - doc/libz_sys/fn.deflateCopy.html | 112 - doc/libz_sys/fn.deflateEnd.html | 112 - doc/libz_sys/fn.deflateInit2_.html | 112 - doc/libz_sys/fn.deflateInit_.html | 112 - doc/libz_sys/fn.deflateParams.html | 112 - doc/libz_sys/fn.deflatePrime.html | 112 - doc/libz_sys/fn.deflateReset.html | 112 - doc/libz_sys/fn.deflateSetDictionary.html | 112 - doc/libz_sys/fn.deflateSetHeader.html | 112 - doc/libz_sys/fn.deflateTune.html | 112 - doc/libz_sys/fn.gzclearerr.html | 112 - doc/libz_sys/fn.gzclose.html | 112 - doc/libz_sys/fn.gzdirect.html | 112 - doc/libz_sys/fn.gzdopen.html | 112 - doc/libz_sys/fn.gzeof.html | 112 - doc/libz_sys/fn.gzerror.html | 112 - doc/libz_sys/fn.gzflush.html | 112 - doc/libz_sys/fn.gzgetc.html | 112 - doc/libz_sys/fn.gzgets.html | 112 - doc/libz_sys/fn.gzopen.html | 112 - doc/libz_sys/fn.gzputc.html | 112 - doc/libz_sys/fn.gzputs.html | 112 - doc/libz_sys/fn.gzread.html | 112 - doc/libz_sys/fn.gzrewind.html | 112 - doc/libz_sys/fn.gzseek.html | 112 - doc/libz_sys/fn.gzsetparams.html | 112 - doc/libz_sys/fn.gztell.html | 112 - doc/libz_sys/fn.gzungetc.html | 112 - doc/libz_sys/fn.gzwrite.html | 112 - doc/libz_sys/fn.inflate.html | 112 - doc/libz_sys/fn.inflateBack.html | 112 - doc/libz_sys/fn.inflateBackEnd.html | 112 - doc/libz_sys/fn.inflateBackInit_.html | 112 - doc/libz_sys/fn.inflateCopy.html | 112 - doc/libz_sys/fn.inflateEnd.html | 112 - doc/libz_sys/fn.inflateGetHeader.html | 112 - doc/libz_sys/fn.inflateInit2_.html | 112 - doc/libz_sys/fn.inflateInit_.html | 112 - doc/libz_sys/fn.inflateMark.html | 112 - doc/libz_sys/fn.inflatePrime.html | 112 - doc/libz_sys/fn.inflateReset.html | 112 - doc/libz_sys/fn.inflateReset2.html | 112 - doc/libz_sys/fn.inflateSetDictionary.html | 112 - doc/libz_sys/fn.inflateSync.html | 112 - doc/libz_sys/fn.uncompress.html | 112 - doc/libz_sys/fn.zlibCompileFlags.html | 112 - doc/libz_sys/fn.zlibVersion.html | 112 - doc/libz_sys/index.html | 852 -- doc/libz_sys/sidebar-items.js | 1 - doc/libz_sys/struct.gz_header.html | 140 - doc/libz_sys/struct.z_stream.html | 142 - doc/libz_sys/type.Bytef.html | 112 - doc/libz_sys/type.alloc_func.html | 112 - doc/libz_sys/type.free_func.html | 112 - doc/libz_sys/type.gzFile.html | 112 - doc/libz_sys/type.gz_headerp.html | 112 - doc/libz_sys/type.in_func.html | 112 - doc/libz_sys/type.out_func.html | 112 - doc/libz_sys/type.uInt.html | 112 - doc/libz_sys/type.uLong.html | 112 - doc/libz_sys/type.uLongf.html | 112 - doc/libz_sys/type.voidp.html | 112 - doc/libz_sys/type.voidpc.html | 112 - doc/libz_sys/type.voidpf.html | 112 - doc/libz_sys/type.z_off_t.html | 112 - doc/libz_sys/type.z_streamp.html | 112 - doc/main.css | 125 - doc/main.js | 1033 -- doc/memchr/fallback/index.html | 0 doc/memchr/fallback/sidebar-items.js | 1 - doc/memchr/fn.memchr.html | 129 - doc/memchr/fn.memchr2.html | 113 - doc/memchr/fn.memchr3.html | 113 - doc/memchr/fn.memrchr.html | 125 - doc/memchr/index.html | 143 - doc/memchr/sidebar-items.js | 1 - doc/miniz_sys/constant.MZ_BLOCK.html | 112 - doc/miniz_sys/constant.MZ_BUF_ERROR.html | 112 - doc/miniz_sys/constant.MZ_DATA_ERROR.html | 112 - .../constant.MZ_DEFAULT_STRATEGY.html | 112 - .../constant.MZ_DEFAULT_WINDOW_BITS.html | 112 - doc/miniz_sys/constant.MZ_DEFLATED.html | 112 - doc/miniz_sys/constant.MZ_ERRNO.html | 112 - doc/miniz_sys/constant.MZ_FINISH.html | 112 - doc/miniz_sys/constant.MZ_FULL_FLUSH.html | 112 - doc/miniz_sys/constant.MZ_MEM_ERROR.html | 112 - doc/miniz_sys/constant.MZ_NEED_DICT.html | 112 - doc/miniz_sys/constant.MZ_NO_FLUSH.html | 112 - doc/miniz_sys/constant.MZ_OK.html | 112 - doc/miniz_sys/constant.MZ_PARAM_ERROR.html | 112 - doc/miniz_sys/constant.MZ_PARTIAL_FLUSH.html | 112 - doc/miniz_sys/constant.MZ_STREAM_END.html | 112 - doc/miniz_sys/constant.MZ_STREAM_ERROR.html | 112 - doc/miniz_sys/constant.MZ_SYNC_FLUSH.html | 112 - doc/miniz_sys/constant.MZ_VERSION_ERROR.html | 112 - doc/miniz_sys/enum.mz_internal_state.html | 112 - doc/miniz_sys/fn.mz_crc32.html | 112 - doc/miniz_sys/fn.mz_deflate.html | 112 - doc/miniz_sys/fn.mz_deflateEnd.html | 112 - doc/miniz_sys/fn.mz_deflateInit2.html | 112 - doc/miniz_sys/fn.mz_deflateReset.html | 112 - doc/miniz_sys/fn.mz_inflate.html | 112 - doc/miniz_sys/fn.mz_inflateEnd.html | 112 - doc/miniz_sys/fn.mz_inflateInit2.html | 112 - doc/miniz_sys/index.html | 334 - doc/miniz_sys/sidebar-items.js | 1 - doc/miniz_sys/struct.mz_stream.html | 142 - doc/miniz_sys/type.mz_alloc_func.html | 112 - doc/miniz_sys/type.mz_free_func.html | 112 - doc/normalize.css | 1 - doc/num_cpus/fn.get.html | 113 - doc/num_cpus/index.html | 121 - doc/num_cpus/sidebar-items.js | 1 - doc/oxipng/deflate/deflate/fn.deflate.html | 113 - doc/oxipng/deflate/deflate/fn.inflate.html | 113 - doc/oxipng/deflate/deflate/index.html | 127 - doc/oxipng/deflate/deflate/sidebar-items.js | 1 - doc/oxipng/deflate/index.html | 134 - .../deflate/libz_stream/enum.Compress.html | 112 - .../deflate/libz_stream/enum.Decompress.html | 112 - doc/oxipng/deflate/libz_stream/index.html | 135 - .../deflate/libz_stream/sidebar-items.js | 1 - .../deflate/libz_stream/struct.Stream.html | 122 - .../deflate/miniz_stream/enum.Compress.html | 112 - .../deflate/miniz_stream/enum.Decompress.html | 112 - doc/oxipng/deflate/miniz_stream/index.html | 135 - .../deflate/miniz_stream/sidebar-items.js | 1 - .../deflate/miniz_stream/struct.Stream.html | 122 - doc/oxipng/deflate/sidebar-items.js | 1 - doc/oxipng/fn.optimize.html | 113 - doc/oxipng/fn.optimize_from_memory.html | 114 - doc/oxipng/index.html | 151 - doc/oxipng/png/enum.BitDepth.html | 135 - doc/oxipng/png/enum.ColorType.html | 131 - doc/oxipng/png/enum.Headers.html | 128 - doc/oxipng/png/index.html | 163 - doc/oxipng/png/sidebar-items.js | 1 - doc/oxipng/png/struct.IhdrData.html | 139 - doc/oxipng/png/struct.PngData.html | 174 - doc/oxipng/png/struct.ScanLine.html | 127 - doc/oxipng/png/struct.ScanLines.html | 170 - doc/oxipng/sidebar-items.js | 1 - doc/oxipng/struct.Options.html | 223 - doc/playpen.js | 56 - doc/regex/backtrack/index.html | 0 doc/regex/backtrack/sidebar-items.js | 1 - doc/regex/bytes/index.html | 317 - doc/regex/bytes/sidebar-items.js | 1 - doc/regex/bytes/struct.CaptureNames.html | 166 - doc/regex/bytes/struct.Captures.html | 196 - doc/regex/bytes/struct.FindCaptures.html | 167 - doc/regex/bytes/struct.FindMatches.html | 168 - doc/regex/bytes/struct.NoExpand.html | 122 - doc/regex/bytes/struct.Regex.html | 400 - doc/regex/bytes/struct.RegexBuilder.html | 160 - doc/regex/bytes/struct.RegexSet.html | 263 - doc/regex/bytes/struct.SetMatches.html | 138 - .../bytes/struct.SetMatchesIntoIter.html | 161 - doc/regex/bytes/struct.SetMatchesIter.html | 165 - doc/regex/bytes/struct.Splits.html | 166 - doc/regex/bytes/struct.SplitsN.html | 168 - doc/regex/bytes/struct.SubCaptures.html | 167 - doc/regex/bytes/struct.SubCapturesNamed.html | 167 - doc/regex/bytes/struct.SubCapturesPos.html | 168 - doc/regex/bytes/trait.Replacer.html | 149 - doc/regex/compile/index.html | 0 doc/regex/compile/sidebar-items.js | 1 - doc/regex/compile/struct.Compiler.html | 0 doc/regex/dfa/index.html | 0 doc/regex/dfa/sidebar-items.js | 1 - doc/regex/enum.Error.html | 131 - doc/regex/error/enum.Error.html | 10 - doc/regex/error/index.html | 0 doc/regex/error/sidebar-items.js | 1 - doc/regex/exec/index.html | 0 doc/regex/exec/sidebar-items.js | 1 - doc/regex/exec/struct.Exec.html | 0 doc/regex/exec/struct.ExecBuilder.html | 0 doc/regex/expand/index.html | 0 doc/regex/expand/sidebar-items.js | 1 - doc/regex/fn.is_match.html | 119 - doc/regex/fn.quote.html | 116 - doc/regex/freqs/index.html | 0 doc/regex/freqs/sidebar-items.js | 1 - doc/regex/index.html | 701 - doc/regex/input/index.html | 0 doc/regex/input/sidebar-items.js | 1 - doc/regex/input/struct.Char.html | 0 doc/regex/input/struct.CharInput.html | 0 doc/regex/input/struct.InputAt.html | 0 doc/regex/input/trait.Input.html | 0 doc/regex/internal/enum.EmptyLook.html | 0 doc/regex/internal/enum.Inst.html | 0 doc/regex/internal/enum._Regex.html | 0 doc/regex/internal/index.html | 0 doc/regex/internal/sidebar-items.js | 1 - doc/regex/internal/struct.Char.html | 0 doc/regex/internal/struct.CharInput.html | 0 doc/regex/internal/struct.Compiler.html | 0 doc/regex/internal/struct.Exec.html | 0 doc/regex/internal/struct.ExecBuilder.html | 0 doc/regex/internal/struct.InputAt.html | 0 doc/regex/internal/struct.InstRanges.html | 0 .../internal/struct.LiteralSearcher.html | 0 doc/regex/internal/struct.Plugin.html | 0 doc/regex/internal/struct.Program.html | 0 doc/regex/internal/trait.Input.html | 0 doc/regex/literals/index.html | 0 doc/regex/literals/sidebar-items.js | 1 - .../literals/struct.LiteralSearcher.html | 0 doc/regex/pikevm/index.html | 0 doc/regex/pikevm/sidebar-items.js | 1 - doc/regex/prog/enum.EmptyLook.html | 0 doc/regex/prog/enum.Inst.html | 0 doc/regex/prog/index.html | 0 doc/regex/prog/sidebar-items.js | 1 - doc/regex/prog/struct.InstRanges.html | 0 doc/regex/prog/struct.Program.html | 0 doc/regex/re_builder/bytes/index.html | 0 doc/regex/re_builder/bytes/sidebar-items.js | 1 - .../re_builder/bytes/struct.RegexBuilder.html | 10 - doc/regex/re_builder/index.html | 0 doc/regex/re_builder/sidebar-items.js | 1 - doc/regex/re_builder/unicode/index.html | 0 doc/regex/re_builder/unicode/sidebar-items.js | 1 - .../unicode/struct.RegexBuilder.html | 10 - doc/regex/re_bytes/index.html | 0 doc/regex/re_bytes/sidebar-items.js | 1 - doc/regex/re_bytes/struct.CaptureNames.html | 10 - doc/regex/re_bytes/struct.Captures.html | 10 - doc/regex/re_bytes/struct.FindCaptures.html | 10 - doc/regex/re_bytes/struct.FindMatches.html | 10 - doc/regex/re_bytes/struct.NoExpand.html | 10 - doc/regex/re_bytes/struct.Regex.html | 10 - doc/regex/re_bytes/struct.Splits.html | 10 - doc/regex/re_bytes/struct.SplitsN.html | 10 - doc/regex/re_bytes/struct.SubCaptures.html | 10 - .../re_bytes/struct.SubCapturesNamed.html | 10 - doc/regex/re_bytes/struct.SubCapturesPos.html | 10 - doc/regex/re_bytes/trait.Replacer.html | 10 - doc/regex/re_plugin/index.html | 0 doc/regex/re_plugin/sidebar-items.js | 1 - doc/regex/re_set/bytes/index.html | 0 doc/regex/re_set/bytes/sidebar-items.js | 1 - doc/regex/re_set/bytes/struct.RegexSet.html | 10 - doc/regex/re_set/bytes/struct.SetMatches.html | 10 - .../bytes/struct.SetMatchesIntoIter.html | 10 - .../re_set/bytes/struct.SetMatchesIter.html | 10 - doc/regex/re_set/index.html | 0 doc/regex/re_set/sidebar-items.js | 1 - doc/regex/re_set/unicode/index.html | 0 doc/regex/re_set/unicode/sidebar-items.js | 1 - doc/regex/re_set/unicode/struct.RegexSet.html | 10 - .../re_set/unicode/struct.SetMatches.html | 10 - .../unicode/struct.SetMatchesIntoIter.html | 10 - .../re_set/unicode/struct.SetMatchesIter.html | 10 - doc/regex/re_trait/index.html | 0 doc/regex/re_trait/sidebar-items.js | 1 - doc/regex/re_unicode/fn.is_match.html | 10 - doc/regex/re_unicode/fn.quote.html | 10 - doc/regex/re_unicode/index.html | 0 doc/regex/re_unicode/sidebar-items.js | 1 - doc/regex/re_unicode/struct.CaptureNames.html | 10 - doc/regex/re_unicode/struct.Captures.html | 10 - doc/regex/re_unicode/struct.FindCaptures.html | 10 - doc/regex/re_unicode/struct.FindMatches.html | 10 - doc/regex/re_unicode/struct.NoExpand.html | 10 - doc/regex/re_unicode/struct.Regex.html | 10 - doc/regex/re_unicode/struct.RegexSplits.html | 10 - doc/regex/re_unicode/struct.RegexSplitsN.html | 10 - doc/regex/re_unicode/struct.SubCaptures.html | 10 - .../re_unicode/struct.SubCapturesNamed.html | 10 - .../re_unicode/struct.SubCapturesPos.html | 10 - doc/regex/re_unicode/trait.Replacer.html | 10 - doc/regex/sidebar-items.js | 1 - doc/regex/sparse/index.html | 0 doc/regex/sparse/sidebar-items.js | 1 - doc/regex/struct.CaptureNames.html | 166 - doc/regex/struct.Captures.html | 192 - doc/regex/struct.FindCaptures.html | 167 - doc/regex/struct.FindMatches.html | 168 - doc/regex/struct.NoExpand.html | 121 - doc/regex/struct.Regex.html | 431 - doc/regex/struct.RegexBuilder.html | 160 - doc/regex/struct.RegexSet.html | 263 - doc/regex/struct.RegexSplits.html | 166 - doc/regex/struct.RegexSplitsN.html | 168 - doc/regex/struct.SetMatches.html | 138 - doc/regex/struct.SetMatchesIntoIter.html | 161 - doc/regex/struct.SetMatchesIter.html | 165 - doc/regex/struct.SubCaptures.html | 166 - doc/regex/struct.SubCapturesNamed.html | 166 - doc/regex/struct.SubCapturesPos.html | 168 - doc/regex/trait.Replacer.html | 136 - doc/regex/utf8/index.html | 0 doc/regex/utf8/sidebar-items.js | 1 - doc/regex_syntax/enum.ErrorKind.html | 211 - doc/regex_syntax/enum.Expr.html | 233 - doc/regex_syntax/enum.Repeater.html | 138 - doc/regex_syntax/fn.quote.html | 116 - doc/regex_syntax/index.html | 251 - doc/regex_syntax/literals/index.html | 0 doc/regex_syntax/literals/sidebar-items.js | 1 - doc/regex_syntax/literals/struct.Lit.html | 10 - .../literals/struct.Literals.html | 10 - doc/regex_syntax/parser/index.html | 0 doc/regex_syntax/parser/sidebar-items.js | 1 - doc/regex_syntax/sidebar-items.js | 1 - doc/regex_syntax/struct.ByteClass.html | 461 - doc/regex_syntax/struct.ByteRange.html | 147 - doc/regex_syntax/struct.CharClass.html | 460 - doc/regex_syntax/struct.ClassRange.html | 151 - doc/regex_syntax/struct.Error.html | 134 - doc/regex_syntax/struct.ExprBuilder.html | 152 - doc/regex_syntax/struct.Lit.html | 431 - doc/regex_syntax/struct.Literals.html | 257 - doc/regex_syntax/type.Result.html | 113 - .../unicode/case_folding/index.html | 0 .../unicode/case_folding/sidebar-items.js | 1 - .../unicode/derived_property/index.html | 0 .../unicode/derived_property/sidebar-items.js | 1 - .../unicode/general_category/index.html | 0 .../unicode/general_category/sidebar-items.js | 1 - doc/regex_syntax/unicode/index.html | 0 doc/regex_syntax/unicode/property/index.html | 0 .../unicode/property/sidebar-items.js | 1 - doc/regex_syntax/unicode/regex/index.html | 0 .../unicode/regex/sidebar-items.js | 1 - doc/regex_syntax/unicode/script/index.html | 0 .../unicode/script/sidebar-items.js | 1 - doc/regex_syntax/unicode/sidebar-items.js | 1 - doc/rustdoc.css | 672 - doc/scoped_pool/index.html | 137 - doc/scoped_pool/sidebar-items.js | 1 - doc/scoped_pool/struct.Pool.html | 165 - doc/scoped_pool/struct.Scope.html | 153 - doc/scoped_pool/struct.WaitGroup.html | 138 - doc/scopeguard/fn.guard.html | 113 - doc/scopeguard/index.html | 136 - doc/scopeguard/macro.defer!.html | 121 - doc/scopeguard/sidebar-items.js | 1 - doc/scopeguard/struct.Guard.html | 128 - doc/search-index.js | 30 - doc/src/aho_corasick/autiter.rs.html | 1114 -- doc/src/aho_corasick/full.rs.html | 380 - doc/src/aho_corasick/lib.rs.html | 1946 --- doc/src/ansi_term/lib.rs.html | 1754 --- doc/src/bit_vec/lib.rs.html | 4286 ------ doc/src/bitflags/lib.rs.html | 1650 --- doc/src/byteorder/lib.rs.html | 1690 --- doc/src/byteorder/new.rs.html | 646 - doc/src/clap/app/help.rs.html | 1722 --- doc/src/clap/app/macros.rs.html | 328 - doc/src/clap/app/meta.rs.html | 236 - doc/src/clap/app/mod.rs.html | 2070 --- doc/src/clap/app/parser.rs.html | 3122 ----- doc/src/clap/app/settings.rs.html | 1170 -- doc/src/clap/args/any_arg.rs.html | 176 - doc/src/clap/args/arg.rs.html | 4444 ------ doc/src/clap/args/arg_builder/flag.rs.html | 412 - doc/src/clap/args/arg_builder/mod.rs.html | 128 - doc/src/clap/args/arg_builder/option.rs.html | 604 - .../clap/args/arg_builder/positional.rs.html | 574 - doc/src/clap/args/arg_matcher.rs.html | 364 - doc/src/clap/args/arg_matches.rs.html | 1262 -- doc/src/clap/args/group.rs.html | 1110 -- doc/src/clap/args/matched_arg.rs.html | 158 - doc/src/clap/args/mod.rs.html | 148 - doc/src/clap/args/settings.rs.html | 282 - doc/src/clap/args/subcommand.rs.html | 236 - doc/src/clap/errors.rs.html | 1518 -- doc/src/clap/fmt.rs.html | 256 - doc/src/clap/lib.rs.html | 984 -- doc/src/clap/macros.rs.html | 1400 -- doc/src/clap/osstringext.rs.html | 364 - doc/src/clap/strext.rs.html | 135 - doc/src/clap/suggestions.rs.html | 316 - doc/src/clap/term.rs.html | 272 - doc/src/clap/usage_parser.rs.html | 2402 ---- doc/src/crc/crc32.rs.html | 282 - doc/src/crc/crc64.rs.html | 270 - doc/src/crc/lib.rs.html | 208 - doc/src/crossbeam/lib.rs.html | 216 - doc/src/crossbeam/mem/cache_padded.rs.html | 390 - doc/src/crossbeam/mem/epoch/atomic.rs.html | 468 - doc/src/crossbeam/mem/epoch/garbage.rs.html | 386 - doc/src/crossbeam/mem/epoch/global.rs.html | 296 - doc/src/crossbeam/mem/epoch/guard.rs.html | 218 - doc/src/crossbeam/mem/epoch/local.rs.html | 182 - doc/src/crossbeam/mem/epoch/mod.rs.html | 634 - .../crossbeam/mem/epoch/participant.rs.html | 360 - .../crossbeam/mem/epoch/participants.rs.html | 342 - doc/src/crossbeam/mem/mod.rs.html | 126 - doc/src/crossbeam/scoped.rs.html | 632 - doc/src/crossbeam/sync/arc_cell.rs.html | 286 - doc/src/crossbeam/sync/atomic_option.rs.html | 182 - doc/src/crossbeam/sync/chase_lev.rs.html | 1292 -- doc/src/crossbeam/sync/mod.rs.html | 136 - doc/src/crossbeam/sync/ms_queue.rs.html | 1122 -- doc/src/crossbeam/sync/seg_queue.rs.html | 594 - doc/src/crossbeam/sync/treiber_stack.rs.html | 286 - doc/src/kernel32/lib.rs.html | 5616 -------- doc/src/lazy_static/lib.rs.html | 422 - doc/src/libc/dox.rs.html | 376 - doc/src/libc/lib.rs.html | 642 - doc/src/libc/macros.rs.html | 324 - doc/src/libc/unix/bsd/apple/b64.rs.html | 144 - doc/src/libc/unix/bsd/apple/mod.rs.html | 2426 ---- doc/src/libc/unix/bsd/mod.rs.html | 848 -- doc/src/libc/unix/mod.rs.html | 1624 --- doc/src/libz_sys/lib.rs.html | 576 - doc/src/memchr/lib.rs.html | 1334 -- doc/src/miniz_sys/lib.rs.html | 262 - doc/src/num_cpus/lib.rs.html | 338 - doc/src/oxipng/src/deflate/deflate.rs.html | 228 - .../oxipng/src/deflate/libz_stream.rs.html | 368 - .../oxipng/src/deflate/miniz_stream.rs.html | 358 - doc/src/oxipng/src/lib.rs.html | 1250 -- doc/src/oxipng/src/png.rs.html | 3466 ----- doc/src/regex/backtrack.rs.html | 716 - doc/src/regex/compile.rs.html | 2284 --- doc/src/regex/dfa.rs.html | 3586 ----- doc/src/regex/error.rs.html | 262 - doc/src/regex/exec.rs.html | 2226 --- doc/src/regex/expand.rs.html | 290 - doc/src/regex/freqs.rs.html | 650 - doc/src/regex/input.rs.html | 760 - doc/src/regex/lib.rs.html | 1406 -- doc/src/regex/literals.rs.html | 1042 -- doc/src/regex/pikevm.rs.html | 866 -- doc/src/regex/prog.rs.html | 1000 -- doc/src/regex/re_builder.rs.html | 408 - doc/src/regex/re_bytes.rs.html | 2142 --- doc/src/regex/re_plugin.rs.html | 284 - doc/src/regex/re_set.rs.html | 770 -- doc/src/regex/re_trait.rs.html | 492 - doc/src/regex/re_unicode.rs.html | 2520 ---- doc/src/regex/sparse.rs.html | 272 - doc/src/regex/utf8.rs.html | 648 - doc/src/regex_syntax/lib.rs.html | 4004 ------ doc/src/regex_syntax/literals.rs.html | 2878 ---- doc/src/regex_syntax/parser.rs.html | 5538 -------- doc/src/regex_syntax/unicode.rs.html | 11538 ---------------- doc/src/scoped_pool/lib.rs.html | 1370 -- doc/src/scopeguard/lib.rs.html | 258 - doc/src/strsim/lib.rs.html | 1502 -- doc/src/thread_id/lib.rs.html | 242 - doc/src/thread_local/lib.rs.html | 1050 -- doc/src/unicode_width/lib.rs.html | 380 - doc/src/unicode_width/tables.rs.html | 584 - doc/src/utf8_ranges/char_utf8.rs.html | 180 - doc/src/utf8_ranges/lib.rs.html | 1130 -- doc/src/variance/lib.rs.html | 346 - doc/src/vec_map/lib.rs.html | 3068 ---- doc/src/winapi/lib.rs.html | 964 -- doc/strsim/enum.StrSimError.html | 118 - doc/strsim/fn.damerau_levenshtein.html | 118 - .../fn.damerau_levenshtein_against_vec.html | 122 - doc/strsim/fn.hamming.html | 122 - doc/strsim/fn.jaro.html | 120 - doc/strsim/fn.jaro_against_vec.html | 127 - doc/strsim/fn.jaro_winkler.html | 119 - doc/strsim/fn.jaro_winkler_against_vec.html | 126 - doc/strsim/fn.levenshtein.html | 119 - doc/strsim/fn.levenshtein_against_vec.html | 122 - doc/strsim/index.html | 202 - doc/strsim/sidebar-items.js | 1 - doc/strsim/type.HammingResult.html | 112 - doc/thread_id/fn.get.html | 117 - doc/thread_id/index.html | 135 - doc/thread_id/sidebar-items.js | 1 - doc/thread_local/index.html | 153 - doc/thread_local/sidebar-items.js | 1 - .../struct.CachedThreadLocal.html | 130 - doc/thread_local/struct.ThreadLocal.html | 129 - .../constant.UNICODE_VERSION.html | 114 - doc/unicode_width/index.html | 165 - doc/unicode_width/sidebar-items.js | 1 - doc/unicode_width/tables/charwidth/index.html | 0 .../tables/charwidth/sidebar-items.js | 1 - .../tables/constant.UNICODE_VERSION.html | 0 doc/unicode_width/tables/index.html | 0 doc/unicode_width/tables/sidebar-items.js | 1 - doc/unicode_width/trait.UnicodeWidthChar.html | 139 - doc/unicode_width/trait.UnicodeWidthStr.html | 141 - doc/utf8_ranges/char_utf8/index.html | 0 doc/utf8_ranges/char_utf8/sidebar-items.js | 1 - doc/utf8_ranges/enum.Utf8Sequence.html | 146 - doc/utf8_ranges/index.html | 214 - doc/utf8_ranges/sidebar-items.js | 1 - doc/utf8_ranges/struct.Utf8Range.html | 128 - doc/utf8_ranges/struct.Utf8Sequences.html | 213 - doc/variance/index.html | 130 - doc/variance/sidebar-items.js | 1 - doc/variance/struct.Invariant.html | 131 - doc/variance/struct.InvariantLifetime.html | 131 - doc/vec_map/enum.Entry.html | 126 - doc/vec_map/index.html | 187 - doc/vec_map/sidebar-items.js | 1 - doc/vec_map/struct.Drain.html | 164 - doc/vec_map/struct.IntoIter.html | 164 - doc/vec_map/struct.Iter.html | 166 - doc/vec_map/struct.IterMut.html | 165 - doc/vec_map/struct.Keys.html | 166 - doc/vec_map/struct.OccupiedEntry.html | 126 - doc/vec_map/struct.VacantEntry.html | 118 - doc/vec_map/struct.Values.html | 166 - doc/vec_map/struct.VecMap.html | 463 - doc/winapi/index.html | 112 - doc/winapi/sidebar-items.js | 1 - 9677 files changed, 531148 deletions(-) delete mode 100755 doc/.lock delete mode 100644 doc/COPYRIGHT.txt delete mode 100644 doc/FiraSans-LICENSE.txt delete mode 100644 doc/FiraSans-Medium.woff delete mode 100644 doc/FiraSans-Regular.woff delete mode 100644 doc/Heuristica-Italic.woff delete mode 100644 doc/Heuristica-LICENSE.txt delete mode 100644 doc/LICENSE-APACHE.txt delete mode 100644 doc/LICENSE-MIT.txt delete mode 100644 doc/SourceCodePro-LICENSE.txt delete mode 100644 doc/SourceCodePro-Regular.woff delete mode 100644 doc/SourceCodePro-Semibold.woff delete mode 100644 doc/SourceSerifPro-Bold.woff delete mode 100644 doc/SourceSerifPro-LICENSE.txt delete mode 100644 doc/SourceSerifPro-Regular.woff delete mode 100644 doc/aho_corasick/autiter/index.html delete mode 100644 doc/aho_corasick/autiter/sidebar-items.js delete mode 100644 doc/aho_corasick/autiter/struct.Match.html delete mode 100644 doc/aho_corasick/autiter/struct.Matches.html delete mode 100644 doc/aho_corasick/autiter/struct.MatchesOverlapping.html delete mode 100644 doc/aho_corasick/autiter/struct.StreamMatches.html delete mode 100644 doc/aho_corasick/autiter/struct.StreamMatchesOverlapping.html delete mode 100644 doc/aho_corasick/autiter/trait.Automaton.html delete mode 100644 doc/aho_corasick/full/index.html delete mode 100644 doc/aho_corasick/full/sidebar-items.js delete mode 100644 doc/aho_corasick/full/struct.FullAcAutomaton.html delete mode 100644 doc/aho_corasick/index.html delete mode 100644 doc/aho_corasick/sidebar-items.js delete mode 100644 doc/aho_corasick/struct.AcAutomaton.html delete mode 100644 doc/aho_corasick/struct.Dense.html delete mode 100644 doc/aho_corasick/struct.FullAcAutomaton.html delete mode 100644 doc/aho_corasick/struct.Match.html delete mode 100644 doc/aho_corasick/struct.Matches.html delete mode 100644 doc/aho_corasick/struct.MatchesOverlapping.html delete mode 100644 doc/aho_corasick/struct.Sparse.html delete mode 100644 doc/aho_corasick/struct.StreamMatches.html delete mode 100644 doc/aho_corasick/struct.StreamMatchesOverlapping.html delete mode 100644 doc/aho_corasick/trait.Automaton.html delete mode 100644 doc/aho_corasick/trait.Transitions.html delete mode 100644 doc/aho_corasick/type.StateIdx.html delete mode 100644 doc/ansi_term/enum.Colour.html delete mode 100644 doc/ansi_term/index.html delete mode 100644 doc/ansi_term/sidebar-items.js delete mode 100644 doc/ansi_term/struct.ANSIString.html delete mode 100644 doc/ansi_term/struct.ANSIStrings.html delete mode 100644 doc/ansi_term/struct.Style.html delete mode 100644 doc/bit_vec/index.html delete mode 100644 doc/bit_vec/sidebar-items.js delete mode 100644 doc/bit_vec/struct.BitVec.html delete mode 100644 doc/bit_vec/struct.Blocks.html delete mode 100644 doc/bit_vec/struct.IntoIter.html delete mode 100644 doc/bit_vec/struct.Iter.html delete mode 100644 doc/bit_vec/trait.BitBlock.html delete mode 100644 doc/bitflags/__core/__rand/fn.thread_rng.html delete mode 100644 doc/bitflags/__core/__rand/index.html delete mode 100644 doc/bitflags/__core/__rand/sidebar-items.js delete mode 100644 doc/bitflags/__core/__rand/struct.ThreadRng.html delete mode 100644 doc/bitflags/__core/__rand/trait.Rng.html delete mode 100644 doc/bitflags/__core/any/index.html delete mode 100644 doc/bitflags/__core/any/sidebar-items.js delete mode 100644 doc/bitflags/__core/any/struct.TypeId.html delete mode 100644 doc/bitflags/__core/any/trait.Any.html delete mode 100644 doc/bitflags/__core/ascii/fn.escape_default.html delete mode 100644 doc/bitflags/__core/ascii/index.html delete mode 100644 doc/bitflags/__core/ascii/sidebar-items.js delete mode 100644 doc/bitflags/__core/ascii/struct.EscapeDefault.html delete mode 100644 doc/bitflags/__core/ascii/trait.AsciiExt.html delete mode 100644 doc/bitflags/__core/borrow/enum.Cow.html delete mode 100644 doc/bitflags/__core/borrow/index.html delete mode 100644 doc/bitflags/__core/borrow/sidebar-items.js delete mode 100644 doc/bitflags/__core/borrow/trait.Borrow.html delete mode 100644 doc/bitflags/__core/borrow/trait.BorrowMut.html delete mode 100644 doc/bitflags/__core/borrow/trait.ToOwned.html delete mode 100644 doc/bitflags/__core/boxed/constant.HEAP.html delete mode 100644 doc/bitflags/__core/boxed/index.html delete mode 100644 doc/bitflags/__core/boxed/sidebar-items.js delete mode 100644 doc/bitflags/__core/boxed/struct.Box.html delete mode 100644 doc/bitflags/__core/boxed/struct.ExchangeHeapSingleton.html delete mode 100644 doc/bitflags/__core/boxed/struct.IntermediateBox.html delete mode 100644 doc/bitflags/__core/boxed/trait.FnBox.html delete mode 100644 doc/bitflags/__core/cell/enum.BorrowState.html delete mode 100644 doc/bitflags/__core/cell/index.html delete mode 100644 doc/bitflags/__core/cell/sidebar-items.js delete mode 100644 doc/bitflags/__core/cell/struct.Cell.html delete mode 100644 doc/bitflags/__core/cell/struct.Ref.html delete mode 100644 doc/bitflags/__core/cell/struct.RefCell.html delete mode 100644 doc/bitflags/__core/cell/struct.RefMut.html delete mode 100644 doc/bitflags/__core/cell/struct.UnsafeCell.html delete mode 100644 doc/bitflags/__core/char/constant.MAX.html delete mode 100644 doc/bitflags/__core/char/constant.REPLACEMENT_CHARACTER.html delete mode 100644 doc/bitflags/__core/char/constant.UNICODE_VERSION.html delete mode 100644 doc/bitflags/__core/char/fn.decode_utf16.html delete mode 100644 doc/bitflags/__core/char/fn.from_digit.html delete mode 100644 doc/bitflags/__core/char/fn.from_u32.html delete mode 100644 doc/bitflags/__core/char/fn.from_u32_unchecked.html delete mode 100644 doc/bitflags/__core/char/index.html delete mode 100644 doc/bitflags/__core/char/sidebar-items.js delete mode 100644 doc/bitflags/__core/char/struct.DecodeUtf16.html delete mode 100644 doc/bitflags/__core/char/struct.DecodeUtf16Error.html delete mode 100644 doc/bitflags/__core/char/struct.EncodeUtf16.html delete mode 100644 doc/bitflags/__core/char/struct.EncodeUtf8.html delete mode 100644 doc/bitflags/__core/char/struct.EscapeDefault.html delete mode 100644 doc/bitflags/__core/char/struct.EscapeUnicode.html delete mode 100644 doc/bitflags/__core/char/struct.ToLowercase.html delete mode 100644 doc/bitflags/__core/char/struct.ToUppercase.html delete mode 100644 doc/bitflags/__core/clone/index.html delete mode 100644 doc/bitflags/__core/clone/sidebar-items.js delete mode 100644 doc/bitflags/__core/clone/trait.Clone.html delete mode 100644 doc/bitflags/__core/cmp/enum.Ordering.html delete mode 100644 doc/bitflags/__core/cmp/fn.max.html delete mode 100644 doc/bitflags/__core/cmp/fn.min.html delete mode 100644 doc/bitflags/__core/cmp/index.html delete mode 100644 doc/bitflags/__core/cmp/sidebar-items.js delete mode 100644 doc/bitflags/__core/cmp/trait.Eq.html delete mode 100644 doc/bitflags/__core/cmp/trait.Ord.html delete mode 100644 doc/bitflags/__core/cmp/trait.PartialEq.html delete mode 100644 doc/bitflags/__core/cmp/trait.PartialOrd.html delete mode 100644 doc/bitflags/__core/collections/binary_heap/index.html delete mode 100644 doc/bitflags/__core/collections/binary_heap/sidebar-items.js delete mode 100644 doc/bitflags/__core/collections/binary_heap/struct.BinaryHeap.html delete mode 100644 doc/bitflags/__core/collections/binary_heap/struct.Drain.html delete mode 100644 doc/bitflags/__core/collections/binary_heap/struct.IntoIter.html delete mode 100644 doc/bitflags/__core/collections/binary_heap/struct.Iter.html delete mode 100644 doc/bitflags/__core/collections/btree_map/enum.Entry.html delete mode 100644 doc/bitflags/__core/collections/btree_map/index.html delete mode 100644 doc/bitflags/__core/collections/btree_map/sidebar-items.js delete mode 100644 doc/bitflags/__core/collections/btree_map/struct.BTreeMap.html delete mode 100644 doc/bitflags/__core/collections/btree_map/struct.IntoIter.html delete mode 100644 doc/bitflags/__core/collections/btree_map/struct.Iter.html delete mode 100644 doc/bitflags/__core/collections/btree_map/struct.IterMut.html delete mode 100644 doc/bitflags/__core/collections/btree_map/struct.Keys.html delete mode 100644 doc/bitflags/__core/collections/btree_map/struct.OccupiedEntry.html delete mode 100644 doc/bitflags/__core/collections/btree_map/struct.Range.html delete mode 100644 doc/bitflags/__core/collections/btree_map/struct.RangeMut.html delete mode 100644 doc/bitflags/__core/collections/btree_map/struct.VacantEntry.html delete mode 100644 doc/bitflags/__core/collections/btree_map/struct.Values.html delete mode 100644 doc/bitflags/__core/collections/btree_map/struct.ValuesMut.html delete mode 100644 doc/bitflags/__core/collections/btree_set/index.html delete mode 100644 doc/bitflags/__core/collections/btree_set/sidebar-items.js delete mode 100644 doc/bitflags/__core/collections/btree_set/struct.BTreeSet.html delete mode 100644 doc/bitflags/__core/collections/btree_set/struct.Difference.html delete mode 100644 doc/bitflags/__core/collections/btree_set/struct.Intersection.html delete mode 100644 doc/bitflags/__core/collections/btree_set/struct.IntoIter.html delete mode 100644 doc/bitflags/__core/collections/btree_set/struct.Iter.html delete mode 100644 doc/bitflags/__core/collections/btree_set/struct.Range.html delete mode 100644 doc/bitflags/__core/collections/btree_set/struct.SymmetricDifference.html delete mode 100644 doc/bitflags/__core/collections/btree_set/struct.Union.html delete mode 100644 doc/bitflags/__core/collections/enum.Bound.html delete mode 100644 doc/bitflags/__core/collections/hash_map/enum.Entry.html delete mode 100644 doc/bitflags/__core/collections/hash_map/index.html delete mode 100644 doc/bitflags/__core/collections/hash_map/sidebar-items.js delete mode 100644 doc/bitflags/__core/collections/hash_map/struct.Drain.html delete mode 100644 doc/bitflags/__core/collections/hash_map/struct.HashMap.html delete mode 100644 doc/bitflags/__core/collections/hash_map/struct.IntoIter.html delete mode 100644 doc/bitflags/__core/collections/hash_map/struct.Iter.html delete mode 100644 doc/bitflags/__core/collections/hash_map/struct.IterMut.html delete mode 100644 doc/bitflags/__core/collections/hash_map/struct.Keys.html delete mode 100644 doc/bitflags/__core/collections/hash_map/struct.OccupiedEntry.html delete mode 100644 doc/bitflags/__core/collections/hash_map/struct.RandomState.html delete mode 100644 doc/bitflags/__core/collections/hash_map/struct.VacantEntry.html delete mode 100644 doc/bitflags/__core/collections/hash_map/struct.Values.html delete mode 100644 doc/bitflags/__core/collections/hash_map/struct.ValuesMut.html delete mode 100644 doc/bitflags/__core/collections/hash_set/index.html delete mode 100644 doc/bitflags/__core/collections/hash_set/sidebar-items.js delete mode 100644 doc/bitflags/__core/collections/hash_set/struct.Difference.html delete mode 100644 doc/bitflags/__core/collections/hash_set/struct.Drain.html delete mode 100644 doc/bitflags/__core/collections/hash_set/struct.HashSet.html delete mode 100644 doc/bitflags/__core/collections/hash_set/struct.Intersection.html delete mode 100644 doc/bitflags/__core/collections/hash_set/struct.IntoIter.html delete mode 100644 doc/bitflags/__core/collections/hash_set/struct.Iter.html delete mode 100644 doc/bitflags/__core/collections/hash_set/struct.SymmetricDifference.html delete mode 100644 doc/bitflags/__core/collections/hash_set/struct.Union.html delete mode 100644 doc/bitflags/__core/collections/index.html delete mode 100644 doc/bitflags/__core/collections/linked_list/index.html delete mode 100644 doc/bitflags/__core/collections/linked_list/sidebar-items.js delete mode 100644 doc/bitflags/__core/collections/linked_list/struct.BackPlace.html delete mode 100644 doc/bitflags/__core/collections/linked_list/struct.FrontPlace.html delete mode 100644 doc/bitflags/__core/collections/linked_list/struct.IntoIter.html delete mode 100644 doc/bitflags/__core/collections/linked_list/struct.Iter.html delete mode 100644 doc/bitflags/__core/collections/linked_list/struct.IterMut.html delete mode 100644 doc/bitflags/__core/collections/linked_list/struct.LinkedList.html delete mode 100644 doc/bitflags/__core/collections/sidebar-items.js delete mode 100644 doc/bitflags/__core/collections/struct.BTreeMap.html delete mode 100644 doc/bitflags/__core/collections/struct.BTreeSet.html delete mode 100644 doc/bitflags/__core/collections/struct.BinaryHeap.html delete mode 100644 doc/bitflags/__core/collections/struct.HashMap.html delete mode 100644 doc/bitflags/__core/collections/struct.HashSet.html delete mode 100644 doc/bitflags/__core/collections/struct.LinkedList.html delete mode 100644 doc/bitflags/__core/collections/struct.VecDeque.html delete mode 100644 doc/bitflags/__core/collections/vec_deque/index.html delete mode 100644 doc/bitflags/__core/collections/vec_deque/sidebar-items.js delete mode 100644 doc/bitflags/__core/collections/vec_deque/struct.Drain.html delete mode 100644 doc/bitflags/__core/collections/vec_deque/struct.IntoIter.html delete mode 100644 doc/bitflags/__core/collections/vec_deque/struct.Iter.html delete mode 100644 doc/bitflags/__core/collections/vec_deque/struct.IterMut.html delete mode 100644 doc/bitflags/__core/collections/vec_deque/struct.VecDeque.html delete mode 100644 doc/bitflags/__core/convert/index.html delete mode 100644 doc/bitflags/__core/convert/sidebar-items.js delete mode 100644 doc/bitflags/__core/convert/trait.AsMut.html delete mode 100644 doc/bitflags/__core/convert/trait.AsRef.html delete mode 100644 doc/bitflags/__core/convert/trait.From.html delete mode 100644 doc/bitflags/__core/convert/trait.Into.html delete mode 100644 doc/bitflags/__core/default/index.html delete mode 100644 doc/bitflags/__core/default/sidebar-items.js delete mode 100644 doc/bitflags/__core/default/trait.Default.html delete mode 100644 doc/bitflags/__core/env/consts/constant.ARCH.html delete mode 100644 doc/bitflags/__core/env/consts/constant.DLL_EXTENSION.html delete mode 100644 doc/bitflags/__core/env/consts/constant.DLL_PREFIX.html delete mode 100644 doc/bitflags/__core/env/consts/constant.DLL_SUFFIX.html delete mode 100644 doc/bitflags/__core/env/consts/constant.EXE_EXTENSION.html delete mode 100644 doc/bitflags/__core/env/consts/constant.EXE_SUFFIX.html delete mode 100644 doc/bitflags/__core/env/consts/constant.FAMILY.html delete mode 100644 doc/bitflags/__core/env/consts/constant.OS.html delete mode 100644 doc/bitflags/__core/env/consts/index.html delete mode 100644 doc/bitflags/__core/env/consts/sidebar-items.js delete mode 100644 doc/bitflags/__core/env/enum.VarError.html delete mode 100644 doc/bitflags/__core/env/fn.args.html delete mode 100644 doc/bitflags/__core/env/fn.args_os.html delete mode 100644 doc/bitflags/__core/env/fn.current_dir.html delete mode 100644 doc/bitflags/__core/env/fn.current_exe.html delete mode 100644 doc/bitflags/__core/env/fn.home_dir.html delete mode 100644 doc/bitflags/__core/env/fn.join_paths.html delete mode 100644 doc/bitflags/__core/env/fn.remove_var.html delete mode 100644 doc/bitflags/__core/env/fn.set_current_dir.html delete mode 100644 doc/bitflags/__core/env/fn.set_var.html delete mode 100644 doc/bitflags/__core/env/fn.split_paths.html delete mode 100644 doc/bitflags/__core/env/fn.temp_dir.html delete mode 100644 doc/bitflags/__core/env/fn.var.html delete mode 100644 doc/bitflags/__core/env/fn.var_os.html delete mode 100644 doc/bitflags/__core/env/fn.vars.html delete mode 100644 doc/bitflags/__core/env/fn.vars_os.html delete mode 100644 doc/bitflags/__core/env/index.html delete mode 100644 doc/bitflags/__core/env/sidebar-items.js delete mode 100644 doc/bitflags/__core/env/struct.Args.html delete mode 100644 doc/bitflags/__core/env/struct.ArgsOs.html delete mode 100644 doc/bitflags/__core/env/struct.JoinPathsError.html delete mode 100644 doc/bitflags/__core/env/struct.SplitPaths.html delete mode 100644 doc/bitflags/__core/env/struct.Vars.html delete mode 100644 doc/bitflags/__core/env/struct.VarsOs.html delete mode 100644 doc/bitflags/__core/error/index.html delete mode 100644 doc/bitflags/__core/error/sidebar-items.js delete mode 100644 doc/bitflags/__core/error/trait.Error.html delete mode 100644 doc/bitflags/__core/f32/constant.DIGITS.html delete mode 100644 doc/bitflags/__core/f32/constant.EPSILON.html delete mode 100644 doc/bitflags/__core/f32/constant.INFINITY.html delete mode 100644 doc/bitflags/__core/f32/constant.MANTISSA_DIGITS.html delete mode 100644 doc/bitflags/__core/f32/constant.MAX.html delete mode 100644 doc/bitflags/__core/f32/constant.MAX_10_EXP.html delete mode 100644 doc/bitflags/__core/f32/constant.MAX_EXP.html delete mode 100644 doc/bitflags/__core/f32/constant.MIN.html delete mode 100644 doc/bitflags/__core/f32/constant.MIN_10_EXP.html delete mode 100644 doc/bitflags/__core/f32/constant.MIN_EXP.html delete mode 100644 doc/bitflags/__core/f32/constant.MIN_POSITIVE.html delete mode 100644 doc/bitflags/__core/f32/constant.NAN.html delete mode 100644 doc/bitflags/__core/f32/constant.NEG_INFINITY.html delete mode 100644 doc/bitflags/__core/f32/constant.RADIX.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.E.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.FRAC_1_PI.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.FRAC_1_SQRT_2.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.FRAC_2_PI.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.FRAC_2_SQRT_PI.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.FRAC_PI_2.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.FRAC_PI_3.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.FRAC_PI_4.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.FRAC_PI_6.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.FRAC_PI_8.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.LN_10.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.LN_2.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.LOG10_E.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.LOG2_E.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.PI.html delete mode 100644 doc/bitflags/__core/f32/consts/constant.SQRT_2.html delete mode 100644 doc/bitflags/__core/f32/consts/index.html delete mode 100644 doc/bitflags/__core/f32/consts/sidebar-items.js delete mode 100644 doc/bitflags/__core/f32/index.html delete mode 100644 doc/bitflags/__core/f32/sidebar-items.js delete mode 100644 doc/bitflags/__core/f64/constant.DIGITS.html delete mode 100644 doc/bitflags/__core/f64/constant.EPSILON.html delete mode 100644 doc/bitflags/__core/f64/constant.INFINITY.html delete mode 100644 doc/bitflags/__core/f64/constant.MANTISSA_DIGITS.html delete mode 100644 doc/bitflags/__core/f64/constant.MAX.html delete mode 100644 doc/bitflags/__core/f64/constant.MAX_10_EXP.html delete mode 100644 doc/bitflags/__core/f64/constant.MAX_EXP.html delete mode 100644 doc/bitflags/__core/f64/constant.MIN.html delete mode 100644 doc/bitflags/__core/f64/constant.MIN_10_EXP.html delete mode 100644 doc/bitflags/__core/f64/constant.MIN_EXP.html delete mode 100644 doc/bitflags/__core/f64/constant.MIN_POSITIVE.html delete mode 100644 doc/bitflags/__core/f64/constant.NAN.html delete mode 100644 doc/bitflags/__core/f64/constant.NEG_INFINITY.html delete mode 100644 doc/bitflags/__core/f64/constant.RADIX.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.E.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.FRAC_1_PI.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.FRAC_1_SQRT_2.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.FRAC_2_PI.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.FRAC_2_SQRT_PI.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.FRAC_PI_2.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.FRAC_PI_3.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.FRAC_PI_4.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.FRAC_PI_6.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.FRAC_PI_8.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.LN_10.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.LN_2.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.LOG10_E.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.LOG2_E.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.PI.html delete mode 100644 doc/bitflags/__core/f64/consts/constant.SQRT_2.html delete mode 100644 doc/bitflags/__core/f64/consts/index.html delete mode 100644 doc/bitflags/__core/f64/consts/sidebar-items.js delete mode 100644 doc/bitflags/__core/f64/index.html delete mode 100644 doc/bitflags/__core/f64/sidebar-items.js delete mode 100644 doc/bitflags/__core/ffi/index.html delete mode 100644 doc/bitflags/__core/ffi/sidebar-items.js delete mode 100644 doc/bitflags/__core/ffi/struct.CStr.html delete mode 100644 doc/bitflags/__core/ffi/struct.CString.html delete mode 100644 doc/bitflags/__core/ffi/struct.IntoStringError.html delete mode 100644 doc/bitflags/__core/ffi/struct.NulError.html delete mode 100644 doc/bitflags/__core/ffi/struct.OsStr.html delete mode 100644 doc/bitflags/__core/ffi/struct.OsString.html delete mode 100644 doc/bitflags/__core/fmt/fn.format.html delete mode 100644 doc/bitflags/__core/fmt/fn.write.html delete mode 100644 doc/bitflags/__core/fmt/index.html delete mode 100644 doc/bitflags/__core/fmt/rt/index.html delete mode 100644 doc/bitflags/__core/fmt/rt/sidebar-items.js delete mode 100644 doc/bitflags/__core/fmt/rt/v1/enum.Alignment.html delete mode 100644 doc/bitflags/__core/fmt/rt/v1/enum.Count.html delete mode 100644 doc/bitflags/__core/fmt/rt/v1/enum.Position.html delete mode 100644 doc/bitflags/__core/fmt/rt/v1/index.html delete mode 100644 doc/bitflags/__core/fmt/rt/v1/sidebar-items.js delete mode 100644 doc/bitflags/__core/fmt/rt/v1/struct.Argument.html delete mode 100644 doc/bitflags/__core/fmt/rt/v1/struct.FormatSpec.html delete mode 100644 doc/bitflags/__core/fmt/sidebar-items.js delete mode 100644 doc/bitflags/__core/fmt/struct.Arguments.html delete mode 100644 doc/bitflags/__core/fmt/struct.DebugList.html delete mode 100644 doc/bitflags/__core/fmt/struct.DebugMap.html delete mode 100644 doc/bitflags/__core/fmt/struct.DebugSet.html delete mode 100644 doc/bitflags/__core/fmt/struct.DebugStruct.html delete mode 100644 doc/bitflags/__core/fmt/struct.DebugTuple.html delete mode 100644 doc/bitflags/__core/fmt/struct.Error.html delete mode 100644 doc/bitflags/__core/fmt/struct.Formatter.html delete mode 100644 doc/bitflags/__core/fmt/trait.Binary.html delete mode 100644 doc/bitflags/__core/fmt/trait.Debug.html delete mode 100644 doc/bitflags/__core/fmt/trait.Display.html delete mode 100644 doc/bitflags/__core/fmt/trait.LowerExp.html delete mode 100644 doc/bitflags/__core/fmt/trait.LowerHex.html delete mode 100644 doc/bitflags/__core/fmt/trait.Octal.html delete mode 100644 doc/bitflags/__core/fmt/trait.Pointer.html delete mode 100644 doc/bitflags/__core/fmt/trait.UpperExp.html delete mode 100644 doc/bitflags/__core/fmt/trait.UpperHex.html delete mode 100644 doc/bitflags/__core/fmt/trait.Write.html delete mode 100644 doc/bitflags/__core/fmt/type.Result.html delete mode 100644 doc/bitflags/__core/fs/fn.canonicalize.html delete mode 100644 doc/bitflags/__core/fs/fn.copy.html delete mode 100644 doc/bitflags/__core/fs/fn.create_dir.html delete mode 100644 doc/bitflags/__core/fs/fn.create_dir_all.html delete mode 100644 doc/bitflags/__core/fs/fn.hard_link.html delete mode 100644 doc/bitflags/__core/fs/fn.metadata.html delete mode 100644 doc/bitflags/__core/fs/fn.read_dir.html delete mode 100644 doc/bitflags/__core/fs/fn.read_link.html delete mode 100644 doc/bitflags/__core/fs/fn.remove_dir.html delete mode 100644 doc/bitflags/__core/fs/fn.remove_dir_all.html delete mode 100644 doc/bitflags/__core/fs/fn.remove_file.html delete mode 100644 doc/bitflags/__core/fs/fn.rename.html delete mode 100644 doc/bitflags/__core/fs/fn.set_permissions.html delete mode 100644 doc/bitflags/__core/fs/fn.soft_link.html delete mode 100644 doc/bitflags/__core/fs/fn.symlink_metadata.html delete mode 100644 doc/bitflags/__core/fs/index.html delete mode 100644 doc/bitflags/__core/fs/sidebar-items.js delete mode 100644 doc/bitflags/__core/fs/struct.DirBuilder.html delete mode 100644 doc/bitflags/__core/fs/struct.DirEntry.html delete mode 100644 doc/bitflags/__core/fs/struct.File.html delete mode 100644 doc/bitflags/__core/fs/struct.FileType.html delete mode 100644 doc/bitflags/__core/fs/struct.Metadata.html delete mode 100644 doc/bitflags/__core/fs/struct.OpenOptions.html delete mode 100644 doc/bitflags/__core/fs/struct.Permissions.html delete mode 100644 doc/bitflags/__core/fs/struct.ReadDir.html delete mode 100644 doc/bitflags/__core/hash/index.html delete mode 100644 doc/bitflags/__core/hash/sidebar-items.js delete mode 100644 doc/bitflags/__core/hash/struct.BuildHasherDefault.html delete mode 100644 doc/bitflags/__core/hash/struct.SipHasher.html delete mode 100644 doc/bitflags/__core/hash/trait.BuildHasher.html delete mode 100644 doc/bitflags/__core/hash/trait.Hash.html delete mode 100644 doc/bitflags/__core/hash/trait.Hasher.html delete mode 100644 doc/bitflags/__core/i16/constant.MAX.html delete mode 100644 doc/bitflags/__core/i16/constant.MIN.html delete mode 100644 doc/bitflags/__core/i16/index.html delete mode 100644 doc/bitflags/__core/i16/sidebar-items.js delete mode 100644 doc/bitflags/__core/i32/constant.MAX.html delete mode 100644 doc/bitflags/__core/i32/constant.MIN.html delete mode 100644 doc/bitflags/__core/i32/index.html delete mode 100644 doc/bitflags/__core/i32/sidebar-items.js delete mode 100644 doc/bitflags/__core/i64/constant.MAX.html delete mode 100644 doc/bitflags/__core/i64/constant.MIN.html delete mode 100644 doc/bitflags/__core/i64/index.html delete mode 100644 doc/bitflags/__core/i64/sidebar-items.js delete mode 100644 doc/bitflags/__core/i8/constant.MAX.html delete mode 100644 doc/bitflags/__core/i8/constant.MIN.html delete mode 100644 doc/bitflags/__core/i8/index.html delete mode 100644 doc/bitflags/__core/i8/sidebar-items.js delete mode 100644 doc/bitflags/__core/index.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.abort.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.add_with_overflow.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.arith_offset.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.assume.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_and.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_and_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_and_acqrel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_and_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_and_relaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchg.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acq_failrelaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acqrel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acqrel_failrelaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchg_failacq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchg_failrelaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchg_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchg_relaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acq_failrelaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acqrel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acqrel_failrelaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_failacq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_failrelaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_relaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_fence.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_fence_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_fence_acqrel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_fence_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_load.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_load_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_load_relaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_load_unordered.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_max.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_max_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_max_acqrel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_max_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_max_relaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_min.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_min_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_min_acqrel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_min_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_min_relaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_nand.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_nand_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_nand_acqrel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_nand_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_nand_relaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_or.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_or_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_or_acqrel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_or_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_or_relaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence_acqrel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_store.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_store_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_store_relaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_store_unordered.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_umax.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_umax_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_umax_acqrel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_umax_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_umax_relaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_umin.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_umin_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_umin_acqrel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_umin_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_umin_relaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xadd.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xadd_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xadd_acqrel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xadd_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xadd_relaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xchg.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xchg_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xchg_acqrel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xchg_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xchg_relaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xor.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xor_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xor_acqrel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xor_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xor_relaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xsub.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xsub_acq.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xsub_acqrel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xsub_rel.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.atomic_xsub_relaxed.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.breakpoint.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.bswap.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.ceilf32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.ceilf64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.copy.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.copy_nonoverlapping.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.copysignf32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.copysignf64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.cosf32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.cosf64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.ctlz.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.ctpop.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.cttz.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.discriminant_value.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.drop_in_place.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.exp2f32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.exp2f64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.expf32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.expf64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.fabsf32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.fabsf64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.fadd_fast.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.fdiv_fast.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.floorf32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.floorf64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.fmaf32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.fmaf64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.fmul_fast.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.forget.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.frem_fast.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.fsub_fast.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.init.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.init_dropped.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.log10f32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.log10f64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.log2f32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.log2f64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.logf32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.logf64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.min_align_of.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.min_align_of_val.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.move_val_init.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.mul_with_overflow.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.nearbyintf32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.nearbyintf64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.needs_drop.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.offset.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.overflowing_add.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.overflowing_mul.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.overflowing_sub.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.powf32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.powf64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.powif32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.powif64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.pref_align_of.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.return_address.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.rintf32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.rintf64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.roundf32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.roundf64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.sinf32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.sinf64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.size_of.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.size_of_val.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.sqrtf32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.sqrtf64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.sub_with_overflow.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.transmute.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.truncf32.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.truncf64.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.try.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.type_id.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.type_name.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.unchecked_div.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.unchecked_rem.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.uninit.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.unreachable.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.volatile_copy_memory.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.volatile_copy_nonoverlapping_memory.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.volatile_load.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.volatile_set_memory.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.volatile_store.html delete mode 100644 doc/bitflags/__core/intrinsics/fn.write_bytes.html delete mode 100644 doc/bitflags/__core/intrinsics/index.html delete mode 100644 doc/bitflags/__core/intrinsics/sidebar-items.js delete mode 100644 doc/bitflags/__core/io/enum.CharsError.html delete mode 100644 doc/bitflags/__core/io/enum.ErrorKind.html delete mode 100644 doc/bitflags/__core/io/enum.SeekFrom.html delete mode 100644 doc/bitflags/__core/io/fn.copy.html delete mode 100644 doc/bitflags/__core/io/fn.empty.html delete mode 100644 doc/bitflags/__core/io/fn.repeat.html delete mode 100644 doc/bitflags/__core/io/fn.sink.html delete mode 100644 doc/bitflags/__core/io/fn.stderr.html delete mode 100644 doc/bitflags/__core/io/fn.stdin.html delete mode 100644 doc/bitflags/__core/io/fn.stdout.html delete mode 100644 doc/bitflags/__core/io/index.html delete mode 100644 doc/bitflags/__core/io/prelude/index.html delete mode 100644 doc/bitflags/__core/io/prelude/sidebar-items.js delete mode 100644 doc/bitflags/__core/io/prelude/trait.BufRead.html delete mode 100644 doc/bitflags/__core/io/prelude/trait.Read.html delete mode 100644 doc/bitflags/__core/io/prelude/trait.Seek.html delete mode 100644 doc/bitflags/__core/io/prelude/trait.Write.html delete mode 100644 doc/bitflags/__core/io/sidebar-items.js delete mode 100644 doc/bitflags/__core/io/struct.BufReader.html delete mode 100644 doc/bitflags/__core/io/struct.BufWriter.html delete mode 100644 doc/bitflags/__core/io/struct.Bytes.html delete mode 100644 doc/bitflags/__core/io/struct.Chain.html delete mode 100644 doc/bitflags/__core/io/struct.Chars.html delete mode 100644 doc/bitflags/__core/io/struct.Cursor.html delete mode 100644 doc/bitflags/__core/io/struct.Empty.html delete mode 100644 doc/bitflags/__core/io/struct.Error.html delete mode 100644 doc/bitflags/__core/io/struct.IntoInnerError.html delete mode 100644 doc/bitflags/__core/io/struct.LineWriter.html delete mode 100644 doc/bitflags/__core/io/struct.Lines.html delete mode 100644 doc/bitflags/__core/io/struct.Repeat.html delete mode 100644 doc/bitflags/__core/io/struct.Sink.html delete mode 100644 doc/bitflags/__core/io/struct.Split.html delete mode 100644 doc/bitflags/__core/io/struct.Stderr.html delete mode 100644 doc/bitflags/__core/io/struct.StderrLock.html delete mode 100644 doc/bitflags/__core/io/struct.Stdin.html delete mode 100644 doc/bitflags/__core/io/struct.StdinLock.html delete mode 100644 doc/bitflags/__core/io/struct.Stdout.html delete mode 100644 doc/bitflags/__core/io/struct.StdoutLock.html delete mode 100644 doc/bitflags/__core/io/struct.Take.html delete mode 100644 doc/bitflags/__core/io/trait.BufRead.html delete mode 100644 doc/bitflags/__core/io/trait.Read.html delete mode 100644 doc/bitflags/__core/io/trait.Seek.html delete mode 100644 doc/bitflags/__core/io/trait.Write.html delete mode 100644 doc/bitflags/__core/io/type.Result.html delete mode 100644 doc/bitflags/__core/isize/constant.MAX.html delete mode 100644 doc/bitflags/__core/isize/constant.MIN.html delete mode 100644 doc/bitflags/__core/isize/index.html delete mode 100644 doc/bitflags/__core/isize/sidebar-items.js delete mode 100644 doc/bitflags/__core/iter/fn.empty.html delete mode 100644 doc/bitflags/__core/iter/fn.once.html delete mode 100644 doc/bitflags/__core/iter/fn.repeat.html delete mode 100644 doc/bitflags/__core/iter/index.html delete mode 100644 doc/bitflags/__core/iter/sidebar-items.js delete mode 100644 doc/bitflags/__core/iter/struct.Chain.html delete mode 100644 doc/bitflags/__core/iter/struct.Cloned.html delete mode 100644 doc/bitflags/__core/iter/struct.Cycle.html delete mode 100644 doc/bitflags/__core/iter/struct.Empty.html delete mode 100644 doc/bitflags/__core/iter/struct.Enumerate.html delete mode 100644 doc/bitflags/__core/iter/struct.Filter.html delete mode 100644 doc/bitflags/__core/iter/struct.FilterMap.html delete mode 100644 doc/bitflags/__core/iter/struct.FlatMap.html delete mode 100644 doc/bitflags/__core/iter/struct.Fuse.html delete mode 100644 doc/bitflags/__core/iter/struct.Inspect.html delete mode 100644 doc/bitflags/__core/iter/struct.Map.html delete mode 100644 doc/bitflags/__core/iter/struct.Once.html delete mode 100644 doc/bitflags/__core/iter/struct.Peekable.html delete mode 100644 doc/bitflags/__core/iter/struct.Repeat.html delete mode 100644 doc/bitflags/__core/iter/struct.Rev.html delete mode 100644 doc/bitflags/__core/iter/struct.Scan.html delete mode 100644 doc/bitflags/__core/iter/struct.Skip.html delete mode 100644 doc/bitflags/__core/iter/struct.SkipWhile.html delete mode 100644 doc/bitflags/__core/iter/struct.StepBy.html delete mode 100644 doc/bitflags/__core/iter/struct.Take.html delete mode 100644 doc/bitflags/__core/iter/struct.TakeWhile.html delete mode 100644 doc/bitflags/__core/iter/struct.Zip.html delete mode 100644 doc/bitflags/__core/iter/trait.DoubleEndedIterator.html delete mode 100644 doc/bitflags/__core/iter/trait.ExactSizeIterator.html delete mode 100644 doc/bitflags/__core/iter/trait.Extend.html delete mode 100644 doc/bitflags/__core/iter/trait.FromIterator.html delete mode 100644 doc/bitflags/__core/iter/trait.IntoIterator.html delete mode 100644 doc/bitflags/__core/iter/trait.Iterator.html delete mode 100644 doc/bitflags/__core/iter/trait.Step.html delete mode 100644 doc/bitflags/__core/marker/index.html delete mode 100644 doc/bitflags/__core/marker/sidebar-items.js delete mode 100644 doc/bitflags/__core/marker/struct.PhantomData.html delete mode 100644 doc/bitflags/__core/marker/trait.Copy.html delete mode 100644 doc/bitflags/__core/marker/trait.Reflect.html delete mode 100644 doc/bitflags/__core/marker/trait.Send.html delete mode 100644 doc/bitflags/__core/marker/trait.Sized.html delete mode 100644 doc/bitflags/__core/marker/trait.Sync.html delete mode 100644 doc/bitflags/__core/marker/trait.Unsize.html delete mode 100644 doc/bitflags/__core/mem/constant.POST_DROP_U32.html delete mode 100644 doc/bitflags/__core/mem/constant.POST_DROP_U64.html delete mode 100644 doc/bitflags/__core/mem/constant.POST_DROP_U8.html delete mode 100644 doc/bitflags/__core/mem/constant.POST_DROP_USIZE.html delete mode 100644 doc/bitflags/__core/mem/fn.align_of.html delete mode 100644 doc/bitflags/__core/mem/fn.align_of_val.html delete mode 100644 doc/bitflags/__core/mem/fn.drop.html delete mode 100644 doc/bitflags/__core/mem/fn.dropped.html delete mode 100644 doc/bitflags/__core/mem/fn.forget.html delete mode 100644 doc/bitflags/__core/mem/fn.min_align_of.html delete mode 100644 doc/bitflags/__core/mem/fn.min_align_of_val.html delete mode 100644 doc/bitflags/__core/mem/fn.replace.html delete mode 100644 doc/bitflags/__core/mem/fn.size_of.html delete mode 100644 doc/bitflags/__core/mem/fn.size_of_val.html delete mode 100644 doc/bitflags/__core/mem/fn.swap.html delete mode 100644 doc/bitflags/__core/mem/fn.transmute.html delete mode 100644 doc/bitflags/__core/mem/fn.transmute_copy.html delete mode 100644 doc/bitflags/__core/mem/fn.uninitialized.html delete mode 100644 doc/bitflags/__core/mem/fn.zeroed.html delete mode 100644 doc/bitflags/__core/mem/index.html delete mode 100644 doc/bitflags/__core/mem/sidebar-items.js delete mode 100644 doc/bitflags/__core/net/enum.IpAddr.html delete mode 100644 doc/bitflags/__core/net/enum.Ipv6MulticastScope.html delete mode 100644 doc/bitflags/__core/net/enum.Shutdown.html delete mode 100644 doc/bitflags/__core/net/enum.SocketAddr.html delete mode 100644 doc/bitflags/__core/net/fn.lookup_host.html delete mode 100644 doc/bitflags/__core/net/index.html delete mode 100644 doc/bitflags/__core/net/sidebar-items.js delete mode 100644 doc/bitflags/__core/net/struct.AddrParseError.html delete mode 100644 doc/bitflags/__core/net/struct.Incoming.html delete mode 100644 doc/bitflags/__core/net/struct.Ipv4Addr.html delete mode 100644 doc/bitflags/__core/net/struct.Ipv6Addr.html delete mode 100644 doc/bitflags/__core/net/struct.LookupHost.html delete mode 100644 doc/bitflags/__core/net/struct.SocketAddrV4.html delete mode 100644 doc/bitflags/__core/net/struct.SocketAddrV6.html delete mode 100644 doc/bitflags/__core/net/struct.TcpListener.html delete mode 100644 doc/bitflags/__core/net/struct.TcpStream.html delete mode 100644 doc/bitflags/__core/net/struct.UdpSocket.html delete mode 100644 doc/bitflags/__core/net/trait.ToSocketAddrs.html delete mode 100644 doc/bitflags/__core/num/enum.FpCategory.html delete mode 100644 doc/bitflags/__core/num/index.html delete mode 100644 doc/bitflags/__core/num/sidebar-items.js delete mode 100644 doc/bitflags/__core/num/struct.ParseFloatError.html delete mode 100644 doc/bitflags/__core/num/struct.ParseIntError.html delete mode 100644 doc/bitflags/__core/num/struct.Wrapping.html delete mode 100644 doc/bitflags/__core/num/trait.One.html delete mode 100644 doc/bitflags/__core/num/trait.Zero.html delete mode 100644 doc/bitflags/__core/ops/enum.RangeInclusive.html delete mode 100644 doc/bitflags/__core/ops/index.html delete mode 100644 doc/bitflags/__core/ops/sidebar-items.js delete mode 100644 doc/bitflags/__core/ops/struct.Range.html delete mode 100644 doc/bitflags/__core/ops/struct.RangeFrom.html delete mode 100644 doc/bitflags/__core/ops/struct.RangeFull.html delete mode 100644 doc/bitflags/__core/ops/struct.RangeTo.html delete mode 100644 doc/bitflags/__core/ops/struct.RangeToInclusive.html delete mode 100644 doc/bitflags/__core/ops/trait.Add.html delete mode 100644 doc/bitflags/__core/ops/trait.AddAssign.html delete mode 100644 doc/bitflags/__core/ops/trait.BitAnd.html delete mode 100644 doc/bitflags/__core/ops/trait.BitAndAssign.html delete mode 100644 doc/bitflags/__core/ops/trait.BitOr.html delete mode 100644 doc/bitflags/__core/ops/trait.BitOrAssign.html delete mode 100644 doc/bitflags/__core/ops/trait.BitXor.html delete mode 100644 doc/bitflags/__core/ops/trait.BitXorAssign.html delete mode 100644 doc/bitflags/__core/ops/trait.BoxPlace.html delete mode 100644 doc/bitflags/__core/ops/trait.Boxed.html delete mode 100644 doc/bitflags/__core/ops/trait.CoerceUnsized.html delete mode 100644 doc/bitflags/__core/ops/trait.Deref.html delete mode 100644 doc/bitflags/__core/ops/trait.DerefMut.html delete mode 100644 doc/bitflags/__core/ops/trait.Div.html delete mode 100644 doc/bitflags/__core/ops/trait.DivAssign.html delete mode 100644 doc/bitflags/__core/ops/trait.Drop.html delete mode 100644 doc/bitflags/__core/ops/trait.Fn.html delete mode 100644 doc/bitflags/__core/ops/trait.FnMut.html delete mode 100644 doc/bitflags/__core/ops/trait.FnOnce.html delete mode 100644 doc/bitflags/__core/ops/trait.InPlace.html delete mode 100644 doc/bitflags/__core/ops/trait.Index.html delete mode 100644 doc/bitflags/__core/ops/trait.IndexMut.html delete mode 100644 doc/bitflags/__core/ops/trait.Mul.html delete mode 100644 doc/bitflags/__core/ops/trait.MulAssign.html delete mode 100644 doc/bitflags/__core/ops/trait.Neg.html delete mode 100644 doc/bitflags/__core/ops/trait.Not.html delete mode 100644 doc/bitflags/__core/ops/trait.Place.html delete mode 100644 doc/bitflags/__core/ops/trait.Placer.html delete mode 100644 doc/bitflags/__core/ops/trait.Rem.html delete mode 100644 doc/bitflags/__core/ops/trait.RemAssign.html delete mode 100644 doc/bitflags/__core/ops/trait.Shl.html delete mode 100644 doc/bitflags/__core/ops/trait.ShlAssign.html delete mode 100644 doc/bitflags/__core/ops/trait.Shr.html delete mode 100644 doc/bitflags/__core/ops/trait.ShrAssign.html delete mode 100644 doc/bitflags/__core/ops/trait.Sub.html delete mode 100644 doc/bitflags/__core/ops/trait.SubAssign.html delete mode 100644 doc/bitflags/__core/option/enum.Option.html delete mode 100644 doc/bitflags/__core/option/index.html delete mode 100644 doc/bitflags/__core/option/sidebar-items.js delete mode 100644 doc/bitflags/__core/option/struct.IntoIter.html delete mode 100644 doc/bitflags/__core/option/struct.Iter.html delete mode 100644 doc/bitflags/__core/option/struct.IterMut.html delete mode 100644 doc/bitflags/__core/os/ext/ffi/index.html delete mode 100644 doc/bitflags/__core/os/ext/ffi/sidebar-items.js delete mode 100644 doc/bitflags/__core/os/ext/ffi/trait.OsStrExt.html delete mode 100644 doc/bitflags/__core/os/ext/ffi/trait.OsStringExt.html delete mode 100644 doc/bitflags/__core/os/ext/fs/fn.symlink.html delete mode 100644 doc/bitflags/__core/os/ext/fs/index.html delete mode 100644 doc/bitflags/__core/os/ext/fs/sidebar-items.js delete mode 100644 doc/bitflags/__core/os/ext/fs/trait.DirBuilderExt.html delete mode 100644 doc/bitflags/__core/os/ext/fs/trait.DirEntryExt.html delete mode 100644 doc/bitflags/__core/os/ext/fs/trait.FileTypeExt.html delete mode 100644 doc/bitflags/__core/os/ext/fs/trait.MetadataExt.html delete mode 100644 doc/bitflags/__core/os/ext/fs/trait.OpenOptionsExt.html delete mode 100644 doc/bitflags/__core/os/ext/fs/trait.PermissionsExt.html delete mode 100644 doc/bitflags/__core/os/ext/index.html delete mode 100644 doc/bitflags/__core/os/ext/io/index.html delete mode 100644 doc/bitflags/__core/os/ext/io/sidebar-items.js delete mode 100644 doc/bitflags/__core/os/ext/io/trait.AsRawFd.html delete mode 100644 doc/bitflags/__core/os/ext/io/trait.FromRawFd.html delete mode 100644 doc/bitflags/__core/os/ext/io/trait.IntoRawFd.html delete mode 100644 doc/bitflags/__core/os/ext/io/type.RawFd.html delete mode 100644 doc/bitflags/__core/os/ext/net/index.html delete mode 100644 doc/bitflags/__core/os/ext/net/sidebar-items.js delete mode 100644 doc/bitflags/__core/os/ext/net/struct.Incoming.html delete mode 100644 doc/bitflags/__core/os/ext/net/struct.SocketAddr.html delete mode 100644 doc/bitflags/__core/os/ext/net/struct.UnixDatagram.html delete mode 100644 doc/bitflags/__core/os/ext/net/struct.UnixListener.html delete mode 100644 doc/bitflags/__core/os/ext/net/struct.UnixStream.html delete mode 100644 doc/bitflags/__core/os/ext/prelude/index.html delete mode 100644 doc/bitflags/__core/os/ext/prelude/sidebar-items.js delete mode 100644 doc/bitflags/__core/os/ext/prelude/trait.AsRawFd.html delete mode 100644 doc/bitflags/__core/os/ext/prelude/trait.CommandExt.html delete mode 100644 doc/bitflags/__core/os/ext/prelude/trait.DirEntryExt.html delete mode 100644 doc/bitflags/__core/os/ext/prelude/trait.ExitStatusExt.html delete mode 100644 doc/bitflags/__core/os/ext/prelude/trait.FileTypeExt.html delete mode 100644 doc/bitflags/__core/os/ext/prelude/trait.FromRawFd.html delete mode 100644 doc/bitflags/__core/os/ext/prelude/trait.IntoRawFd.html delete mode 100644 doc/bitflags/__core/os/ext/prelude/trait.JoinHandleExt.html delete mode 100644 doc/bitflags/__core/os/ext/prelude/trait.MetadataExt.html delete mode 100644 doc/bitflags/__core/os/ext/prelude/trait.OpenOptionsExt.html delete mode 100644 doc/bitflags/__core/os/ext/prelude/trait.OsStrExt.html delete mode 100644 doc/bitflags/__core/os/ext/prelude/trait.OsStringExt.html delete mode 100644 doc/bitflags/__core/os/ext/prelude/trait.PermissionsExt.html delete mode 100644 doc/bitflags/__core/os/ext/prelude/type.RawFd.html delete mode 100644 doc/bitflags/__core/os/ext/process/index.html delete mode 100644 doc/bitflags/__core/os/ext/process/sidebar-items.js delete mode 100644 doc/bitflags/__core/os/ext/process/trait.CommandExt.html delete mode 100644 doc/bitflags/__core/os/ext/process/trait.ExitStatusExt.html delete mode 100644 doc/bitflags/__core/os/ext/raw/index.html delete mode 100644 doc/bitflags/__core/os/ext/raw/sidebar-items.js delete mode 100644 doc/bitflags/__core/os/ext/raw/type.blkcnt_t.html delete mode 100644 doc/bitflags/__core/os/ext/raw/type.blksize_t.html delete mode 100644 doc/bitflags/__core/os/ext/raw/type.dev_t.html delete mode 100644 doc/bitflags/__core/os/ext/raw/type.gid_t.html delete mode 100644 doc/bitflags/__core/os/ext/raw/type.ino_t.html delete mode 100644 doc/bitflags/__core/os/ext/raw/type.mode_t.html delete mode 100644 doc/bitflags/__core/os/ext/raw/type.nlink_t.html delete mode 100644 doc/bitflags/__core/os/ext/raw/type.off_t.html delete mode 100644 doc/bitflags/__core/os/ext/raw/type.pid_t.html delete mode 100644 doc/bitflags/__core/os/ext/raw/type.pthread_t.html delete mode 100644 doc/bitflags/__core/os/ext/raw/type.time_t.html delete mode 100644 doc/bitflags/__core/os/ext/raw/type.uid_t.html delete mode 100644 doc/bitflags/__core/os/ext/sidebar-items.js delete mode 100644 doc/bitflags/__core/os/ext/thread/index.html delete mode 100644 doc/bitflags/__core/os/ext/thread/sidebar-items.js delete mode 100644 doc/bitflags/__core/os/ext/thread/trait.JoinHandleExt.html delete mode 100644 doc/bitflags/__core/os/ext/thread/type.RawPthread.html delete mode 100644 doc/bitflags/__core/os/index.html delete mode 100644 doc/bitflags/__core/os/macos/fs/index.html delete mode 100644 doc/bitflags/__core/os/macos/fs/sidebar-items.js delete mode 100644 doc/bitflags/__core/os/macos/fs/trait.MetadataExt.html delete mode 100644 doc/bitflags/__core/os/macos/index.html delete mode 100644 doc/bitflags/__core/os/macos/raw/index.html delete mode 100644 doc/bitflags/__core/os/macos/raw/sidebar-items.js delete mode 100644 doc/bitflags/__core/os/macos/raw/struct.stat.html delete mode 100644 doc/bitflags/__core/os/macos/raw/type.blkcnt_t.html delete mode 100644 doc/bitflags/__core/os/macos/raw/type.blksize_t.html delete mode 100644 doc/bitflags/__core/os/macos/raw/type.dev_t.html delete mode 100644 doc/bitflags/__core/os/macos/raw/type.ino_t.html delete mode 100644 doc/bitflags/__core/os/macos/raw/type.mode_t.html delete mode 100644 doc/bitflags/__core/os/macos/raw/type.nlink_t.html delete mode 100644 doc/bitflags/__core/os/macos/raw/type.off_t.html delete mode 100644 doc/bitflags/__core/os/macos/raw/type.pthread_t.html delete mode 100644 doc/bitflags/__core/os/macos/raw/type.time_t.html delete mode 100644 doc/bitflags/__core/os/macos/sidebar-items.js delete mode 100644 doc/bitflags/__core/os/raw/enum.c_void.html delete mode 100644 doc/bitflags/__core/os/raw/index.html delete mode 100644 doc/bitflags/__core/os/raw/sidebar-items.js delete mode 100644 doc/bitflags/__core/os/raw/type.c_char.html delete mode 100644 doc/bitflags/__core/os/raw/type.c_double.html delete mode 100644 doc/bitflags/__core/os/raw/type.c_float.html delete mode 100644 doc/bitflags/__core/os/raw/type.c_int.html delete mode 100644 doc/bitflags/__core/os/raw/type.c_long.html delete mode 100644 doc/bitflags/__core/os/raw/type.c_longlong.html delete mode 100644 doc/bitflags/__core/os/raw/type.c_schar.html delete mode 100644 doc/bitflags/__core/os/raw/type.c_short.html delete mode 100644 doc/bitflags/__core/os/raw/type.c_uchar.html delete mode 100644 doc/bitflags/__core/os/raw/type.c_uint.html delete mode 100644 doc/bitflags/__core/os/raw/type.c_ulong.html delete mode 100644 doc/bitflags/__core/os/raw/type.c_ulonglong.html delete mode 100644 doc/bitflags/__core/os/raw/type.c_ushort.html delete mode 100644 doc/bitflags/__core/os/sidebar-items.js delete mode 100644 doc/bitflags/__core/panic/fn.catch_unwind.html delete mode 100644 doc/bitflags/__core/panic/fn.propagate.html delete mode 100644 doc/bitflags/__core/panic/fn.recover.html delete mode 100644 doc/bitflags/__core/panic/fn.resume_unwind.html delete mode 100644 doc/bitflags/__core/panic/fn.set_handler.html delete mode 100644 doc/bitflags/__core/panic/fn.set_hook.html delete mode 100644 doc/bitflags/__core/panic/fn.take_handler.html delete mode 100644 doc/bitflags/__core/panic/fn.take_hook.html delete mode 100644 doc/bitflags/__core/panic/index.html delete mode 100644 doc/bitflags/__core/panic/sidebar-items.js delete mode 100644 doc/bitflags/__core/panic/struct.AssertRecoverSafe.html delete mode 100644 doc/bitflags/__core/panic/struct.AssertUnwindSafe.html delete mode 100644 doc/bitflags/__core/panic/struct.Location.html delete mode 100644 doc/bitflags/__core/panic/struct.PanicInfo.html delete mode 100644 doc/bitflags/__core/panic/trait.RecoverSafe.html delete mode 100644 doc/bitflags/__core/panic/trait.RefUnwindSafe.html delete mode 100644 doc/bitflags/__core/panic/trait.UnwindSafe.html delete mode 100644 doc/bitflags/__core/path/constant.MAIN_SEPARATOR.html delete mode 100644 doc/bitflags/__core/path/enum.Component.html delete mode 100644 doc/bitflags/__core/path/enum.Prefix.html delete mode 100644 doc/bitflags/__core/path/fn.is_separator.html delete mode 100644 doc/bitflags/__core/path/index.html delete mode 100644 doc/bitflags/__core/path/sidebar-items.js delete mode 100644 doc/bitflags/__core/path/struct.Components.html delete mode 100644 doc/bitflags/__core/path/struct.Display.html delete mode 100644 doc/bitflags/__core/path/struct.Iter.html delete mode 100644 doc/bitflags/__core/path/struct.Path.html delete mode 100644 doc/bitflags/__core/path/struct.PathBuf.html delete mode 100644 doc/bitflags/__core/path/struct.PrefixComponent.html delete mode 100644 doc/bitflags/__core/path/struct.StripPrefixError.html delete mode 100644 doc/bitflags/__core/prelude/index.html delete mode 100644 doc/bitflags/__core/prelude/sidebar-items.js delete mode 100644 doc/bitflags/__core/prelude/v1/enum.Option.html delete mode 100644 doc/bitflags/__core/prelude/v1/enum.Result.html delete mode 100644 doc/bitflags/__core/prelude/v1/fn.drop.html delete mode 100644 doc/bitflags/__core/prelude/v1/index.html delete mode 100644 doc/bitflags/__core/prelude/v1/sidebar-items.js delete mode 100644 doc/bitflags/__core/prelude/v1/struct.Box.html delete mode 100644 doc/bitflags/__core/prelude/v1/struct.String.html delete mode 100644 doc/bitflags/__core/prelude/v1/struct.Vec.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.AsMut.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.AsRef.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.Clone.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.Copy.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.Default.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.DoubleEndedIterator.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.Drop.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.Eq.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.ExactSizeIterator.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.Extend.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.Fn.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.FnMut.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.FnOnce.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.From.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.Into.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.IntoIterator.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.Iterator.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.Ord.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.PartialEq.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.PartialOrd.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.Send.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.Sized.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.SliceConcatExt.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.Sync.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.ToOwned.html delete mode 100644 doc/bitflags/__core/prelude/v1/trait.ToString.html delete mode 100644 doc/bitflags/__core/process/fn.exit.html delete mode 100644 doc/bitflags/__core/process/index.html delete mode 100644 doc/bitflags/__core/process/sidebar-items.js delete mode 100644 doc/bitflags/__core/process/struct.Child.html delete mode 100644 doc/bitflags/__core/process/struct.ChildStderr.html delete mode 100644 doc/bitflags/__core/process/struct.ChildStdin.html delete mode 100644 doc/bitflags/__core/process/struct.ChildStdout.html delete mode 100644 doc/bitflags/__core/process/struct.Command.html delete mode 100644 doc/bitflags/__core/process/struct.ExitStatus.html delete mode 100644 doc/bitflags/__core/process/struct.Output.html delete mode 100644 doc/bitflags/__core/process/struct.Stdio.html delete mode 100644 doc/bitflags/__core/ptr/fn.copy.html delete mode 100644 doc/bitflags/__core/ptr/fn.copy_nonoverlapping.html delete mode 100644 doc/bitflags/__core/ptr/fn.drop_in_place.html delete mode 100644 doc/bitflags/__core/ptr/fn.null.html delete mode 100644 doc/bitflags/__core/ptr/fn.null_mut.html delete mode 100644 doc/bitflags/__core/ptr/fn.read.html delete mode 100644 doc/bitflags/__core/ptr/fn.read_and_drop.html delete mode 100644 doc/bitflags/__core/ptr/fn.read_volatile.html delete mode 100644 doc/bitflags/__core/ptr/fn.replace.html delete mode 100644 doc/bitflags/__core/ptr/fn.swap.html delete mode 100644 doc/bitflags/__core/ptr/fn.write.html delete mode 100644 doc/bitflags/__core/ptr/fn.write_bytes.html delete mode 100644 doc/bitflags/__core/ptr/fn.write_volatile.html delete mode 100644 doc/bitflags/__core/ptr/index.html delete mode 100644 doc/bitflags/__core/ptr/sidebar-items.js delete mode 100644 doc/bitflags/__core/ptr/struct.Shared.html delete mode 100644 doc/bitflags/__core/ptr/struct.Unique.html delete mode 100644 doc/bitflags/__core/raw/index.html delete mode 100644 doc/bitflags/__core/raw/sidebar-items.js delete mode 100644 doc/bitflags/__core/raw/struct.Slice.html delete mode 100644 doc/bitflags/__core/raw/struct.TraitObject.html delete mode 100644 doc/bitflags/__core/raw/trait.Repr.html delete mode 100644 doc/bitflags/__core/rc/index.html delete mode 100644 doc/bitflags/__core/rc/sidebar-items.js delete mode 100644 doc/bitflags/__core/rc/struct.Rc.html delete mode 100644 doc/bitflags/__core/rc/struct.Weak.html delete mode 100644 doc/bitflags/__core/result/enum.Result.html delete mode 100644 doc/bitflags/__core/result/index.html delete mode 100644 doc/bitflags/__core/result/sidebar-items.js delete mode 100644 doc/bitflags/__core/result/struct.IntoIter.html delete mode 100644 doc/bitflags/__core/result/struct.Iter.html delete mode 100644 doc/bitflags/__core/result/struct.IterMut.html delete mode 100644 doc/bitflags/__core/rt/fn.begin_unwind.html delete mode 100644 doc/bitflags/__core/rt/fn.begin_unwind_fmt.html delete mode 100644 doc/bitflags/__core/rt/index.html delete mode 100644 doc/bitflags/__core/rt/sidebar-items.js delete mode 100644 doc/bitflags/__core/sidebar-items.js delete mode 100644 doc/bitflags/__core/slice/fn.from_raw_parts.html delete mode 100644 doc/bitflags/__core/slice/fn.from_raw_parts_mut.html delete mode 100644 doc/bitflags/__core/slice/index.html delete mode 100644 doc/bitflags/__core/slice/sidebar-items.js delete mode 100644 doc/bitflags/__core/slice/struct.Chunks.html delete mode 100644 doc/bitflags/__core/slice/struct.ChunksMut.html delete mode 100644 doc/bitflags/__core/slice/struct.Iter.html delete mode 100644 doc/bitflags/__core/slice/struct.IterMut.html delete mode 100644 doc/bitflags/__core/slice/struct.RSplitN.html delete mode 100644 doc/bitflags/__core/slice/struct.RSplitNMut.html delete mode 100644 doc/bitflags/__core/slice/struct.Split.html delete mode 100644 doc/bitflags/__core/slice/struct.SplitMut.html delete mode 100644 doc/bitflags/__core/slice/struct.SplitN.html delete mode 100644 doc/bitflags/__core/slice/struct.SplitNMut.html delete mode 100644 doc/bitflags/__core/slice/struct.Windows.html delete mode 100644 doc/bitflags/__core/slice/trait.SliceConcatExt.html delete mode 100644 doc/bitflags/__core/str/fn.from_utf8.html delete mode 100644 doc/bitflags/__core/str/fn.from_utf8_unchecked.html delete mode 100644 doc/bitflags/__core/str/index.html delete mode 100644 doc/bitflags/__core/str/pattern/enum.SearchStep.html delete mode 100644 doc/bitflags/__core/str/pattern/index.html delete mode 100644 doc/bitflags/__core/str/pattern/sidebar-items.js delete mode 100644 doc/bitflags/__core/str/pattern/struct.CharPredicateSearcher.html delete mode 100644 doc/bitflags/__core/str/pattern/struct.CharSearcher.html delete mode 100644 doc/bitflags/__core/str/pattern/struct.CharSliceSearcher.html delete mode 100644 doc/bitflags/__core/str/pattern/struct.StrSearcher.html delete mode 100644 doc/bitflags/__core/str/pattern/trait.DoubleEndedSearcher.html delete mode 100644 doc/bitflags/__core/str/pattern/trait.Pattern.html delete mode 100644 doc/bitflags/__core/str/pattern/trait.ReverseSearcher.html delete mode 100644 doc/bitflags/__core/str/pattern/trait.Searcher.html delete mode 100644 doc/bitflags/__core/str/sidebar-items.js delete mode 100644 doc/bitflags/__core/str/struct.Bytes.html delete mode 100644 doc/bitflags/__core/str/struct.CharIndices.html delete mode 100644 doc/bitflags/__core/str/struct.CharRange.html delete mode 100644 doc/bitflags/__core/str/struct.Chars.html delete mode 100644 doc/bitflags/__core/str/struct.EncodeUtf16.html delete mode 100644 doc/bitflags/__core/str/struct.Lines.html delete mode 100644 doc/bitflags/__core/str/struct.LinesAny.html delete mode 100644 doc/bitflags/__core/str/struct.MatchIndices.html delete mode 100644 doc/bitflags/__core/str/struct.Matches.html delete mode 100644 doc/bitflags/__core/str/struct.ParseBoolError.html delete mode 100644 doc/bitflags/__core/str/struct.RMatchIndices.html delete mode 100644 doc/bitflags/__core/str/struct.RMatches.html delete mode 100644 doc/bitflags/__core/str/struct.RSplit.html delete mode 100644 doc/bitflags/__core/str/struct.RSplitN.html delete mode 100644 doc/bitflags/__core/str/struct.RSplitTerminator.html delete mode 100644 doc/bitflags/__core/str/struct.Split.html delete mode 100644 doc/bitflags/__core/str/struct.SplitN.html delete mode 100644 doc/bitflags/__core/str/struct.SplitTerminator.html delete mode 100644 doc/bitflags/__core/str/struct.SplitWhitespace.html delete mode 100644 doc/bitflags/__core/str/struct.Utf8Error.html delete mode 100644 doc/bitflags/__core/str/trait.FromStr.html delete mode 100644 doc/bitflags/__core/str/type.Utf16Units.html delete mode 100644 doc/bitflags/__core/string/enum.ParseError.html delete mode 100644 doc/bitflags/__core/string/index.html delete mode 100644 doc/bitflags/__core/string/sidebar-items.js delete mode 100644 doc/bitflags/__core/string/struct.Drain.html delete mode 100644 doc/bitflags/__core/string/struct.FromUtf16Error.html delete mode 100644 doc/bitflags/__core/string/struct.FromUtf8Error.html delete mode 100644 doc/bitflags/__core/string/struct.String.html delete mode 100644 doc/bitflags/__core/string/trait.ToString.html delete mode 100644 doc/bitflags/__core/sync/atomic/constant.ATOMIC_BOOL_INIT.html delete mode 100644 doc/bitflags/__core/sync/atomic/constant.ATOMIC_ISIZE_INIT.html delete mode 100644 doc/bitflags/__core/sync/atomic/constant.ATOMIC_USIZE_INIT.html delete mode 100644 doc/bitflags/__core/sync/atomic/enum.Ordering.html delete mode 100644 doc/bitflags/__core/sync/atomic/fn.fence.html delete mode 100644 doc/bitflags/__core/sync/atomic/index.html delete mode 100644 doc/bitflags/__core/sync/atomic/sidebar-items.js delete mode 100644 doc/bitflags/__core/sync/atomic/struct.AtomicBool.html delete mode 100644 doc/bitflags/__core/sync/atomic/struct.AtomicIsize.html delete mode 100644 doc/bitflags/__core/sync/atomic/struct.AtomicPtr.html delete mode 100644 doc/bitflags/__core/sync/atomic/struct.AtomicUsize.html delete mode 100644 doc/bitflags/__core/sync/constant.CONDVAR_INIT.html delete mode 100644 doc/bitflags/__core/sync/constant.MUTEX_INIT.html delete mode 100644 doc/bitflags/__core/sync/constant.ONCE_INIT.html delete mode 100644 doc/bitflags/__core/sync/constant.RW_LOCK_INIT.html delete mode 100644 doc/bitflags/__core/sync/enum.TryLockError.html delete mode 100644 doc/bitflags/__core/sync/index.html delete mode 100644 doc/bitflags/__core/sync/mpsc/enum.TryRecvError.html delete mode 100644 doc/bitflags/__core/sync/mpsc/enum.TrySendError.html delete mode 100644 doc/bitflags/__core/sync/mpsc/fn.channel.html delete mode 100644 doc/bitflags/__core/sync/mpsc/fn.sync_channel.html delete mode 100644 doc/bitflags/__core/sync/mpsc/index.html delete mode 100644 doc/bitflags/__core/sync/mpsc/sidebar-items.js delete mode 100644 doc/bitflags/__core/sync/mpsc/struct.Handle.html delete mode 100644 doc/bitflags/__core/sync/mpsc/struct.IntoIter.html delete mode 100644 doc/bitflags/__core/sync/mpsc/struct.Iter.html delete mode 100644 doc/bitflags/__core/sync/mpsc/struct.Receiver.html delete mode 100644 doc/bitflags/__core/sync/mpsc/struct.RecvError.html delete mode 100644 doc/bitflags/__core/sync/mpsc/struct.Select.html delete mode 100644 doc/bitflags/__core/sync/mpsc/struct.SendError.html delete mode 100644 doc/bitflags/__core/sync/mpsc/struct.Sender.html delete mode 100644 doc/bitflags/__core/sync/mpsc/struct.SyncSender.html delete mode 100644 doc/bitflags/__core/sync/sidebar-items.js delete mode 100644 doc/bitflags/__core/sync/struct.Arc.html delete mode 100644 doc/bitflags/__core/sync/struct.Barrier.html delete mode 100644 doc/bitflags/__core/sync/struct.BarrierWaitResult.html delete mode 100644 doc/bitflags/__core/sync/struct.Condvar.html delete mode 100644 doc/bitflags/__core/sync/struct.Mutex.html delete mode 100644 doc/bitflags/__core/sync/struct.MutexGuard.html delete mode 100644 doc/bitflags/__core/sync/struct.Once.html delete mode 100644 doc/bitflags/__core/sync/struct.PoisonError.html delete mode 100644 doc/bitflags/__core/sync/struct.RwLock.html delete mode 100644 doc/bitflags/__core/sync/struct.RwLockReadGuard.html delete mode 100644 doc/bitflags/__core/sync/struct.RwLockWriteGuard.html delete mode 100644 doc/bitflags/__core/sync/struct.StaticCondvar.html delete mode 100644 doc/bitflags/__core/sync/struct.StaticMutex.html delete mode 100644 doc/bitflags/__core/sync/struct.StaticRwLock.html delete mode 100644 doc/bitflags/__core/sync/struct.WaitTimeoutResult.html delete mode 100644 doc/bitflags/__core/sync/struct.Weak.html delete mode 100644 doc/bitflags/__core/sync/type.LockResult.html delete mode 100644 doc/bitflags/__core/sync/type.TryLockResult.html delete mode 100644 doc/bitflags/__core/thread/enum.LocalKeyState.html delete mode 100644 doc/bitflags/__core/thread/fn.current.html delete mode 100644 doc/bitflags/__core/thread/fn.panicking.html delete mode 100644 doc/bitflags/__core/thread/fn.park.html delete mode 100644 doc/bitflags/__core/thread/fn.park_timeout.html delete mode 100644 doc/bitflags/__core/thread/fn.park_timeout_ms.html delete mode 100644 doc/bitflags/__core/thread/fn.sleep.html delete mode 100644 doc/bitflags/__core/thread/fn.sleep_ms.html delete mode 100644 doc/bitflags/__core/thread/fn.spawn.html delete mode 100644 doc/bitflags/__core/thread/fn.yield_now.html delete mode 100644 doc/bitflags/__core/thread/index.html delete mode 100644 doc/bitflags/__core/thread/sidebar-items.js delete mode 100644 doc/bitflags/__core/thread/struct.Builder.html delete mode 100644 doc/bitflags/__core/thread/struct.JoinHandle.html delete mode 100644 doc/bitflags/__core/thread/struct.Key.html delete mode 100644 doc/bitflags/__core/thread/struct.KeyInner.html delete mode 100644 doc/bitflags/__core/thread/struct.LocalKey.html delete mode 100644 doc/bitflags/__core/thread/struct.ScopedKey.html delete mode 100644 doc/bitflags/__core/thread/struct.Thread.html delete mode 100644 doc/bitflags/__core/thread/type.Result.html delete mode 100644 doc/bitflags/__core/time/constant.UNIX_EPOCH.html delete mode 100644 doc/bitflags/__core/time/index.html delete mode 100644 doc/bitflags/__core/time/sidebar-items.js delete mode 100644 doc/bitflags/__core/time/struct.Duration.html delete mode 100644 doc/bitflags/__core/time/struct.Instant.html delete mode 100644 doc/bitflags/__core/time/struct.SystemTime.html delete mode 100644 doc/bitflags/__core/time/struct.SystemTimeError.html delete mode 100644 doc/bitflags/__core/u16/constant.MAX.html delete mode 100644 doc/bitflags/__core/u16/constant.MIN.html delete mode 100644 doc/bitflags/__core/u16/index.html delete mode 100644 doc/bitflags/__core/u16/sidebar-items.js delete mode 100644 doc/bitflags/__core/u32/constant.MAX.html delete mode 100644 doc/bitflags/__core/u32/constant.MIN.html delete mode 100644 doc/bitflags/__core/u32/index.html delete mode 100644 doc/bitflags/__core/u32/sidebar-items.js delete mode 100644 doc/bitflags/__core/u64/constant.MAX.html delete mode 100644 doc/bitflags/__core/u64/constant.MIN.html delete mode 100644 doc/bitflags/__core/u64/index.html delete mode 100644 doc/bitflags/__core/u64/sidebar-items.js delete mode 100644 doc/bitflags/__core/u8/constant.MAX.html delete mode 100644 doc/bitflags/__core/u8/constant.MIN.html delete mode 100644 doc/bitflags/__core/u8/index.html delete mode 100644 doc/bitflags/__core/u8/sidebar-items.js delete mode 100644 doc/bitflags/__core/usize/constant.MAX.html delete mode 100644 doc/bitflags/__core/usize/constant.MIN.html delete mode 100644 doc/bitflags/__core/usize/index.html delete mode 100644 doc/bitflags/__core/usize/sidebar-items.js delete mode 100644 doc/bitflags/__core/vec/index.html delete mode 100644 doc/bitflags/__core/vec/sidebar-items.js delete mode 100644 doc/bitflags/__core/vec/struct.Drain.html delete mode 100644 doc/bitflags/__core/vec/struct.IntoIter.html delete mode 100644 doc/bitflags/__core/vec/struct.Vec.html delete mode 100644 doc/bitflags/index.html delete mode 100644 doc/bitflags/macro.bitflags!.html delete mode 100644 doc/bitflags/sidebar-items.js delete mode 100644 doc/byteorder/enum.BigEndian.html delete mode 100644 doc/byteorder/enum.LittleEndian.html delete mode 100644 doc/byteorder/index.html delete mode 100644 doc/byteorder/new/index.html delete mode 100644 doc/byteorder/new/sidebar-items.js delete mode 100644 doc/byteorder/new/trait.ReadBytesExt.html delete mode 100644 doc/byteorder/new/trait.WriteBytesExt.html delete mode 100644 doc/byteorder/sidebar-items.js delete mode 100644 doc/byteorder/trait.ByteOrder.html delete mode 100644 doc/byteorder/trait.ReadBytesExt.html delete mode 100644 doc/byteorder/trait.WriteBytesExt.html delete mode 100644 doc/byteorder/type.NativeEndian.html delete mode 100644 doc/byteorder/type.NetworkEndian.html delete mode 100644 doc/clap/app/enum.AppSettings.html delete mode 100644 doc/clap/app/help/index.html delete mode 100644 doc/clap/app/help/sidebar-items.js delete mode 100644 doc/clap/app/index.html delete mode 100644 doc/clap/app/macros/index.html delete mode 100644 doc/clap/app/macros/sidebar-items.js delete mode 100644 doc/clap/app/meta/index.html delete mode 100644 doc/clap/app/meta/sidebar-items.js delete mode 100644 doc/clap/app/parser/index.html delete mode 100644 doc/clap/app/parser/sidebar-items.js delete mode 100644 doc/clap/app/settings/enum.AppSettings.html delete mode 100644 doc/clap/app/settings/index.html delete mode 100644 doc/clap/app/settings/sidebar-items.js delete mode 100644 doc/clap/app/sidebar-items.js delete mode 100644 doc/clap/app/struct.App.html delete mode 100644 doc/clap/args/any_arg/index.html delete mode 100644 doc/clap/args/any_arg/sidebar-items.js delete mode 100644 doc/clap/args/arg/index.html delete mode 100644 doc/clap/args/arg/sidebar-items.js delete mode 100644 doc/clap/args/arg/struct.Arg.html delete mode 100644 doc/clap/args/arg_builder/flag/index.html delete mode 100644 doc/clap/args/arg_builder/flag/sidebar-items.js delete mode 100644 doc/clap/args/arg_builder/index.html delete mode 100644 doc/clap/args/arg_builder/option/index.html delete mode 100644 doc/clap/args/arg_builder/option/sidebar-items.js delete mode 100644 doc/clap/args/arg_builder/positional/index.html delete mode 100644 doc/clap/args/arg_builder/positional/sidebar-items.js delete mode 100644 doc/clap/args/arg_builder/sidebar-items.js delete mode 100644 doc/clap/args/arg_matcher/index.html delete mode 100644 doc/clap/args/arg_matcher/sidebar-items.js delete mode 100644 doc/clap/args/arg_matches/index.html delete mode 100644 doc/clap/args/arg_matches/sidebar-items.js delete mode 100644 doc/clap/args/arg_matches/struct.ArgMatches.html delete mode 100644 doc/clap/args/group/index.html delete mode 100644 doc/clap/args/group/sidebar-items.js delete mode 100644 doc/clap/args/group/struct.ArgGroup.html delete mode 100644 doc/clap/args/index.html delete mode 100644 doc/clap/args/matched_arg/index.html delete mode 100644 doc/clap/args/matched_arg/sidebar-items.js delete mode 100644 doc/clap/args/settings/index.html delete mode 100644 doc/clap/args/settings/sidebar-items.js delete mode 100644 doc/clap/args/sidebar-items.js delete mode 100644 doc/clap/args/struct.Arg.html delete mode 100644 doc/clap/args/struct.ArgGroup.html delete mode 100644 doc/clap/args/struct.ArgMatches.html delete mode 100644 doc/clap/args/struct.SubCommand.html delete mode 100644 doc/clap/args/subcommand/index.html delete mode 100644 doc/clap/args/subcommand/sidebar-items.js delete mode 100644 doc/clap/args/subcommand/struct.SubCommand.html delete mode 100644 doc/clap/enum.AppSettings.html delete mode 100644 doc/clap/enum.ErrorKind.html delete mode 100644 doc/clap/errors/enum.ErrorKind.html delete mode 100644 doc/clap/errors/index.html delete mode 100644 doc/clap/errors/sidebar-items.js delete mode 100644 doc/clap/errors/struct.Error.html delete mode 100644 doc/clap/errors/type.Result.html delete mode 100644 doc/clap/fmt/index.html delete mode 100644 doc/clap/fmt/sidebar-items.js delete mode 100644 doc/clap/index.html delete mode 100644 doc/clap/macro._clap_count_exprs!.html delete mode 100644 doc/clap/macro.arg_enum!.html delete mode 100644 doc/clap/macro.crate_version!.html delete mode 100644 doc/clap/macro.value_t!.html delete mode 100644 doc/clap/macro.value_t_or_exit!.html delete mode 100644 doc/clap/macro.values_t!.html delete mode 100644 doc/clap/macro.values_t_or_exit!.html delete mode 100644 doc/clap/macros/debug_macros/index.html delete mode 100644 doc/clap/macros/debug_macros/sidebar-items.js delete mode 100644 doc/clap/macros/index.html delete mode 100644 doc/clap/macros/sidebar-items.js delete mode 100644 doc/clap/osstringext/index.html delete mode 100644 doc/clap/osstringext/sidebar-items.js delete mode 100644 doc/clap/sidebar-items.js delete mode 100644 doc/clap/strext/index.html delete mode 100644 doc/clap/strext/sidebar-items.js delete mode 100644 doc/clap/struct.App.html delete mode 100644 doc/clap/struct.Arg.html delete mode 100644 doc/clap/struct.ArgGroup.html delete mode 100644 doc/clap/struct.ArgMatches.html delete mode 100644 doc/clap/struct.Error.html delete mode 100644 doc/clap/struct.SubCommand.html delete mode 100644 doc/clap/suggestions/index.html delete mode 100644 doc/clap/suggestions/sidebar-items.js delete mode 100644 doc/clap/term/index.html delete mode 100644 doc/clap/term/sidebar-items.js delete mode 100644 doc/clap/type.Result.html delete mode 100644 doc/clap/usage_parser/index.html delete mode 100644 doc/clap/usage_parser/sidebar-items.js delete mode 100644 doc/crc/crc32/constant.CASTAGNOLI.html delete mode 100644 doc/crc/crc32/constant.IEEE.html delete mode 100644 doc/crc/crc32/constant.KOOPMAN.html delete mode 100644 doc/crc/crc32/fn.checksum_castagnoli.html delete mode 100644 doc/crc/crc32/fn.checksum_ieee.html delete mode 100644 doc/crc/crc32/fn.checksum_koopman.html delete mode 100644 doc/crc/crc32/fn.make_table.html delete mode 100644 doc/crc/crc32/fn.update.html delete mode 100644 doc/crc/crc32/index.html delete mode 100644 doc/crc/crc32/sidebar-items.js delete mode 100644 doc/crc/crc32/struct.CASTAGNOLI_TABLE.html delete mode 100644 doc/crc/crc32/struct.Digest.html delete mode 100644 doc/crc/crc32/struct.IEEE_TABLE.html delete mode 100644 doc/crc/crc32/struct.KOOPMAN_TABLE.html delete mode 100644 doc/crc/crc32/trait.Hasher32.html delete mode 100644 doc/crc/crc64/constant.ECMA.html delete mode 100644 doc/crc/crc64/constant.ISO.html delete mode 100644 doc/crc/crc64/fn.checksum_ecma.html delete mode 100644 doc/crc/crc64/fn.checksum_iso.html delete mode 100644 doc/crc/crc64/fn.make_table.html delete mode 100644 doc/crc/crc64/fn.update.html delete mode 100644 doc/crc/crc64/index.html delete mode 100644 doc/crc/crc64/sidebar-items.js delete mode 100644 doc/crc/crc64/struct.Digest.html delete mode 100644 doc/crc/crc64/struct.ECMA_TABLE.html delete mode 100644 doc/crc/crc64/struct.ISO_TABLE.html delete mode 100644 doc/crc/crc64/trait.Hasher64.html delete mode 100644 doc/crc/index.html delete mode 100644 doc/crc/sidebar-items.js delete mode 100644 doc/crossbeam/fn.scope.html delete mode 100644 doc/crossbeam/fn.spawn_unsafe.html delete mode 100644 doc/crossbeam/index.html delete mode 100644 doc/crossbeam/mem/cache_padded/index.html delete mode 100644 doc/crossbeam/mem/cache_padded/sidebar-items.js delete mode 100644 doc/crossbeam/mem/cache_padded/struct.CachePadded.html delete mode 100644 doc/crossbeam/mem/cache_padded/trait.ZerosValid.html delete mode 100644 doc/crossbeam/mem/epoch/atomic/index.html delete mode 100644 doc/crossbeam/mem/epoch/atomic/sidebar-items.js delete mode 100644 doc/crossbeam/mem/epoch/atomic/struct.Atomic.html delete mode 100644 doc/crossbeam/mem/epoch/fn.pin.html delete mode 100644 doc/crossbeam/mem/epoch/garbage/index.html delete mode 100644 doc/crossbeam/mem/epoch/garbage/sidebar-items.js delete mode 100644 doc/crossbeam/mem/epoch/global/imp/index.html delete mode 100644 doc/crossbeam/mem/epoch/global/imp/sidebar-items.js delete mode 100644 doc/crossbeam/mem/epoch/global/index.html delete mode 100644 doc/crossbeam/mem/epoch/global/sidebar-items.js delete mode 100644 doc/crossbeam/mem/epoch/guard/fn.pin.html delete mode 100644 doc/crossbeam/mem/epoch/guard/index.html delete mode 100644 doc/crossbeam/mem/epoch/guard/sidebar-items.js delete mode 100644 doc/crossbeam/mem/epoch/guard/struct.Guard.html delete mode 100644 doc/crossbeam/mem/epoch/index.html delete mode 100644 doc/crossbeam/mem/epoch/local/index.html delete mode 100644 doc/crossbeam/mem/epoch/local/sidebar-items.js delete mode 100644 doc/crossbeam/mem/epoch/participant/index.html delete mode 100644 doc/crossbeam/mem/epoch/participant/sidebar-items.js delete mode 100644 doc/crossbeam/mem/epoch/participants/index.html delete mode 100644 doc/crossbeam/mem/epoch/participants/sidebar-items.js delete mode 100644 doc/crossbeam/mem/epoch/sidebar-items.js delete mode 100644 doc/crossbeam/mem/epoch/struct.Atomic.html delete mode 100644 doc/crossbeam/mem/epoch/struct.Guard.html delete mode 100644 doc/crossbeam/mem/epoch/struct.Owned.html delete mode 100644 doc/crossbeam/mem/epoch/struct.Shared.html delete mode 100644 doc/crossbeam/mem/index.html delete mode 100644 doc/crossbeam/mem/sidebar-items.js delete mode 100644 doc/crossbeam/mem/struct.CachePadded.html delete mode 100644 doc/crossbeam/mem/trait.ZerosValid.html delete mode 100644 doc/crossbeam/scoped/fn.scope.html delete mode 100644 doc/crossbeam/scoped/index.html delete mode 100644 doc/crossbeam/scoped/sidebar-items.js delete mode 100644 doc/crossbeam/scoped/struct.Scope.html delete mode 100644 doc/crossbeam/scoped/struct.ScopedJoinHandle.html delete mode 100644 doc/crossbeam/sidebar-items.js delete mode 100644 doc/crossbeam/struct.Scope.html delete mode 100644 doc/crossbeam/struct.ScopedJoinHandle.html delete mode 100644 doc/crossbeam/sync/arc_cell/index.html delete mode 100644 doc/crossbeam/sync/arc_cell/sidebar-items.js delete mode 100644 doc/crossbeam/sync/arc_cell/struct.ArcCell.html delete mode 100644 doc/crossbeam/sync/atomic_option/index.html delete mode 100644 doc/crossbeam/sync/atomic_option/sidebar-items.js delete mode 100644 doc/crossbeam/sync/atomic_option/struct.AtomicOption.html delete mode 100644 doc/crossbeam/sync/chase_lev/enum.Steal.html delete mode 100644 doc/crossbeam/sync/chase_lev/fn.deque.html delete mode 100644 doc/crossbeam/sync/chase_lev/index.html delete mode 100644 doc/crossbeam/sync/chase_lev/sidebar-items.js delete mode 100644 doc/crossbeam/sync/chase_lev/struct.Stealer.html delete mode 100644 doc/crossbeam/sync/chase_lev/struct.Worker.html delete mode 100644 doc/crossbeam/sync/index.html delete mode 100644 doc/crossbeam/sync/ms_queue/index.html delete mode 100644 doc/crossbeam/sync/ms_queue/sidebar-items.js delete mode 100644 doc/crossbeam/sync/ms_queue/struct.MsQueue.html delete mode 100644 doc/crossbeam/sync/seg_queue/index.html delete mode 100644 doc/crossbeam/sync/seg_queue/sidebar-items.js delete mode 100644 doc/crossbeam/sync/seg_queue/struct.SegQueue.html delete mode 100644 doc/crossbeam/sync/sidebar-items.js delete mode 100644 doc/crossbeam/sync/struct.ArcCell.html delete mode 100644 doc/crossbeam/sync/struct.AtomicOption.html delete mode 100644 doc/crossbeam/sync/struct.MsQueue.html delete mode 100644 doc/crossbeam/sync/struct.SegQueue.html delete mode 100644 doc/crossbeam/sync/struct.TreiberStack.html delete mode 100644 doc/crossbeam/sync/treiber_stack/index.html delete mode 100644 doc/crossbeam/sync/treiber_stack/sidebar-items.js delete mode 100644 doc/crossbeam/sync/treiber_stack/struct.TreiberStack.html delete mode 100644 doc/implementors/aho_corasick/trait.Automaton.js delete mode 100644 doc/implementors/aho_corasick/trait.Transitions.js delete mode 100644 doc/implementors/alloc/boxed/trait.FnBox.js delete mode 100644 doc/implementors/bit_vec/trait.BitBlock.js delete mode 100644 doc/implementors/bitflags/__core/any/trait.Any.js delete mode 100644 doc/implementors/bitflags/__core/ascii/trait.AsciiExt.js delete mode 100644 doc/implementors/bitflags/__core/borrow/trait.Borrow.js delete mode 100644 doc/implementors/bitflags/__core/borrow/trait.BorrowMut.js delete mode 100644 doc/implementors/bitflags/__core/borrow/trait.ToOwned.js delete mode 100644 doc/implementors/bitflags/__core/boxed/trait.FnBox.js delete mode 100644 doc/implementors/bitflags/__core/clone/trait.Clone.js delete mode 100644 doc/implementors/bitflags/__core/cmp/trait.Eq.js delete mode 100644 doc/implementors/bitflags/__core/cmp/trait.Ord.js delete mode 100644 doc/implementors/bitflags/__core/cmp/trait.PartialEq.js delete mode 100644 doc/implementors/bitflags/__core/cmp/trait.PartialOrd.js delete mode 100644 doc/implementors/bitflags/__core/convert/trait.AsMut.js delete mode 100644 doc/implementors/bitflags/__core/convert/trait.AsRef.js delete mode 100644 doc/implementors/bitflags/__core/convert/trait.From.js delete mode 100644 doc/implementors/bitflags/__core/convert/trait.Into.js delete mode 100644 doc/implementors/bitflags/__core/default/trait.Default.js delete mode 100644 doc/implementors/bitflags/__core/error/trait.Error.js delete mode 100644 doc/implementors/bitflags/__core/fmt/trait.Binary.js delete mode 100644 doc/implementors/bitflags/__core/fmt/trait.Debug.js delete mode 100644 doc/implementors/bitflags/__core/fmt/trait.Display.js delete mode 100644 doc/implementors/bitflags/__core/fmt/trait.LowerExp.js delete mode 100644 doc/implementors/bitflags/__core/fmt/trait.LowerHex.js delete mode 100644 doc/implementors/bitflags/__core/fmt/trait.Octal.js delete mode 100644 doc/implementors/bitflags/__core/fmt/trait.Pointer.js delete mode 100644 doc/implementors/bitflags/__core/fmt/trait.UpperExp.js delete mode 100644 doc/implementors/bitflags/__core/fmt/trait.UpperHex.js delete mode 100644 doc/implementors/bitflags/__core/fmt/trait.Write.js delete mode 100644 doc/implementors/bitflags/__core/hash/trait.BuildHasher.js delete mode 100644 doc/implementors/bitflags/__core/hash/trait.Hash.js delete mode 100644 doc/implementors/bitflags/__core/hash/trait.Hasher.js delete mode 100644 doc/implementors/bitflags/__core/io/trait.BufRead.js delete mode 100644 doc/implementors/bitflags/__core/io/trait.Read.js delete mode 100644 doc/implementors/bitflags/__core/io/trait.Seek.js delete mode 100644 doc/implementors/bitflags/__core/io/trait.Write.js delete mode 100644 doc/implementors/bitflags/__core/iter/trait.DoubleEndedIterator.js delete mode 100644 doc/implementors/bitflags/__core/iter/trait.ExactSizeIterator.js delete mode 100644 doc/implementors/bitflags/__core/iter/trait.Extend.js delete mode 100644 doc/implementors/bitflags/__core/iter/trait.FromIterator.js delete mode 100644 doc/implementors/bitflags/__core/iter/trait.IntoIterator.js delete mode 100644 doc/implementors/bitflags/__core/iter/trait.Iterator.js delete mode 100644 doc/implementors/bitflags/__core/iter/trait.Step.js delete mode 100644 doc/implementors/bitflags/__core/marker/trait.Copy.js delete mode 100644 doc/implementors/bitflags/__core/marker/trait.Send.js delete mode 100644 doc/implementors/bitflags/__core/marker/trait.Sync.js delete mode 100644 doc/implementors/bitflags/__core/net/trait.ToSocketAddrs.js delete mode 100644 doc/implementors/bitflags/__core/num/trait.One.js delete mode 100644 doc/implementors/bitflags/__core/num/trait.Zero.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Add.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.AddAssign.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.BitAnd.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.BitAndAssign.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.BitOr.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.BitOrAssign.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.BitXor.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.BitXorAssign.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.BoxPlace.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Boxed.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.CoerceUnsized.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Deref.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.DerefMut.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Div.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.DivAssign.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Drop.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Fn.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.FnMut.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.FnOnce.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.InPlace.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Index.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.IndexMut.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Mul.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.MulAssign.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Neg.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Not.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Place.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Placer.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Rem.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.RemAssign.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Shl.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.ShlAssign.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Shr.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.ShrAssign.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.Sub.js delete mode 100644 doc/implementors/bitflags/__core/ops/trait.SubAssign.js delete mode 100644 doc/implementors/bitflags/__core/os/ext/fs/trait.DirBuilderExt.js delete mode 100644 doc/implementors/bitflags/__core/os/ext/prelude/trait.AsRawFd.js delete mode 100644 doc/implementors/bitflags/__core/os/ext/prelude/trait.CommandExt.js delete mode 100644 doc/implementors/bitflags/__core/os/ext/prelude/trait.DirEntryExt.js delete mode 100644 doc/implementors/bitflags/__core/os/ext/prelude/trait.ExitStatusExt.js delete mode 100644 doc/implementors/bitflags/__core/os/ext/prelude/trait.FileTypeExt.js delete mode 100644 doc/implementors/bitflags/__core/os/ext/prelude/trait.FromRawFd.js delete mode 100644 doc/implementors/bitflags/__core/os/ext/prelude/trait.IntoRawFd.js delete mode 100644 doc/implementors/bitflags/__core/os/ext/prelude/trait.JoinHandleExt.js delete mode 100644 doc/implementors/bitflags/__core/os/ext/prelude/trait.MetadataExt.js delete mode 100644 doc/implementors/bitflags/__core/os/ext/prelude/trait.OpenOptionsExt.js delete mode 100644 doc/implementors/bitflags/__core/os/ext/prelude/trait.OsStrExt.js delete mode 100644 doc/implementors/bitflags/__core/os/ext/prelude/trait.OsStringExt.js delete mode 100644 doc/implementors/bitflags/__core/os/ext/prelude/trait.PermissionsExt.js delete mode 100644 doc/implementors/bitflags/__core/os/macos/fs/trait.MetadataExt.js delete mode 100644 doc/implementors/bitflags/__core/panic/trait.RecoverSafe.js delete mode 100644 doc/implementors/bitflags/__core/panic/trait.RefUnwindSafe.js delete mode 100644 doc/implementors/bitflags/__core/panic/trait.UnwindSafe.js delete mode 100644 doc/implementors/bitflags/__core/raw/trait.Repr.js delete mode 100644 doc/implementors/bitflags/__core/slice/trait.SliceConcatExt.js delete mode 100644 doc/implementors/bitflags/__core/str/pattern/trait.DoubleEndedSearcher.js delete mode 100644 doc/implementors/bitflags/__core/str/pattern/trait.Pattern.js delete mode 100644 doc/implementors/bitflags/__core/str/pattern/trait.ReverseSearcher.js delete mode 100644 doc/implementors/bitflags/__core/str/pattern/trait.Searcher.js delete mode 100644 doc/implementors/bitflags/__core/str/trait.FromStr.js delete mode 100644 doc/implementors/bitflags/__core/string/trait.ToString.js delete mode 100644 doc/implementors/byteorder/trait.ByteOrder.js delete mode 100644 doc/implementors/collections/borrow/trait.ToOwned.js delete mode 100644 doc/implementors/collections/range/trait.RangeArgument.js delete mode 100644 doc/implementors/collections/slice/trait.SliceConcatExt.js delete mode 100644 doc/implementors/collections/string/trait.ToString.js delete mode 100644 doc/implementors/core/any/trait.Any.js delete mode 100644 doc/implementors/core/array/trait.FixedSizeArray.js delete mode 100644 doc/implementors/core/borrow/trait.Borrow.js delete mode 100644 doc/implementors/core/borrow/trait.BorrowMut.js delete mode 100644 doc/implementors/core/clone/trait.Clone.js delete mode 100644 doc/implementors/core/cmp/trait.Eq.js delete mode 100644 doc/implementors/core/cmp/trait.Ord.js delete mode 100644 doc/implementors/core/cmp/trait.PartialEq.js delete mode 100644 doc/implementors/core/cmp/trait.PartialOrd.js delete mode 100644 doc/implementors/core/convert/trait.AsMut.js delete mode 100644 doc/implementors/core/convert/trait.AsRef.js delete mode 100644 doc/implementors/core/convert/trait.From.js delete mode 100644 doc/implementors/core/convert/trait.Into.js delete mode 100644 doc/implementors/core/default/trait.Default.js delete mode 100644 doc/implementors/core/fmt/trait.Binary.js delete mode 100644 doc/implementors/core/fmt/trait.Debug.js delete mode 100644 doc/implementors/core/fmt/trait.Display.js delete mode 100644 doc/implementors/core/fmt/trait.LowerExp.js delete mode 100644 doc/implementors/core/fmt/trait.LowerHex.js delete mode 100644 doc/implementors/core/fmt/trait.Octal.js delete mode 100644 doc/implementors/core/fmt/trait.Pointer.js delete mode 100644 doc/implementors/core/fmt/trait.UpperExp.js delete mode 100644 doc/implementors/core/fmt/trait.UpperHex.js delete mode 100644 doc/implementors/core/fmt/trait.Write.js delete mode 100644 doc/implementors/core/hash/trait.BuildHasher.js delete mode 100644 doc/implementors/core/hash/trait.Hash.js delete mode 100644 doc/implementors/core/hash/trait.Hasher.js delete mode 100644 doc/implementors/core/iter/iterator/trait.Iterator.js delete mode 100644 doc/implementors/core/iter/range/trait.Step.js delete mode 100644 doc/implementors/core/iter/traits/trait.DoubleEndedIterator.js delete mode 100644 doc/implementors/core/iter/traits/trait.ExactSizeIterator.js delete mode 100644 doc/implementors/core/iter/traits/trait.Extend.js delete mode 100644 doc/implementors/core/iter/traits/trait.FromIterator.js delete mode 100644 doc/implementors/core/iter/traits/trait.IntoIterator.js delete mode 100644 doc/implementors/core/marker/trait.Copy.js delete mode 100644 doc/implementors/core/marker/trait.Send.js delete mode 100644 doc/implementors/core/marker/trait.Sync.js delete mode 100644 doc/implementors/core/nonzero/trait.Zeroable.js delete mode 100644 doc/implementors/core/num/trait.One.js delete mode 100644 doc/implementors/core/num/trait.Zero.js delete mode 100644 doc/implementors/core/ops/trait.Add.js delete mode 100644 doc/implementors/core/ops/trait.AddAssign.js delete mode 100644 doc/implementors/core/ops/trait.BitAnd.js delete mode 100644 doc/implementors/core/ops/trait.BitAndAssign.js delete mode 100644 doc/implementors/core/ops/trait.BitOr.js delete mode 100644 doc/implementors/core/ops/trait.BitOrAssign.js delete mode 100644 doc/implementors/core/ops/trait.BitXor.js delete mode 100644 doc/implementors/core/ops/trait.BitXorAssign.js delete mode 100644 doc/implementors/core/ops/trait.BoxPlace.js delete mode 100644 doc/implementors/core/ops/trait.Boxed.js delete mode 100644 doc/implementors/core/ops/trait.CoerceUnsized.js delete mode 100644 doc/implementors/core/ops/trait.Deref.js delete mode 100644 doc/implementors/core/ops/trait.DerefMut.js delete mode 100644 doc/implementors/core/ops/trait.Div.js delete mode 100644 doc/implementors/core/ops/trait.DivAssign.js delete mode 100644 doc/implementors/core/ops/trait.Drop.js delete mode 100644 doc/implementors/core/ops/trait.Fn.js delete mode 100644 doc/implementors/core/ops/trait.FnMut.js delete mode 100644 doc/implementors/core/ops/trait.FnOnce.js delete mode 100644 doc/implementors/core/ops/trait.InPlace.js delete mode 100644 doc/implementors/core/ops/trait.Index.js delete mode 100644 doc/implementors/core/ops/trait.IndexMut.js delete mode 100644 doc/implementors/core/ops/trait.Mul.js delete mode 100644 doc/implementors/core/ops/trait.MulAssign.js delete mode 100644 doc/implementors/core/ops/trait.Neg.js delete mode 100644 doc/implementors/core/ops/trait.Not.js delete mode 100644 doc/implementors/core/ops/trait.Place.js delete mode 100644 doc/implementors/core/ops/trait.Placer.js delete mode 100644 doc/implementors/core/ops/trait.Rem.js delete mode 100644 doc/implementors/core/ops/trait.RemAssign.js delete mode 100644 doc/implementors/core/ops/trait.Shl.js delete mode 100644 doc/implementors/core/ops/trait.ShlAssign.js delete mode 100644 doc/implementors/core/ops/trait.Shr.js delete mode 100644 doc/implementors/core/ops/trait.ShrAssign.js delete mode 100644 doc/implementors/core/ops/trait.Sub.js delete mode 100644 doc/implementors/core/ops/trait.SubAssign.js delete mode 100644 doc/implementors/core/raw/trait.Repr.js delete mode 100644 doc/implementors/core/slice/trait.SliceExt.js delete mode 100644 doc/implementors/core/str/pattern/trait.DoubleEndedSearcher.js delete mode 100644 doc/implementors/core/str/pattern/trait.Pattern.js delete mode 100644 doc/implementors/core/str/pattern/trait.ReverseSearcher.js delete mode 100644 doc/implementors/core/str/pattern/trait.Searcher.js delete mode 100644 doc/implementors/core/str/trait.FromStr.js delete mode 100644 doc/implementors/crc/crc32/trait.Hasher32.js delete mode 100644 doc/implementors/crc/crc64/trait.Hasher64.js delete mode 100644 doc/implementors/crossbeam/mem/trait.ZerosValid.js delete mode 100644 doc/implementors/rand/distributions/trait.IndependentSample.js delete mode 100644 doc/implementors/rand/distributions/trait.Sample.js delete mode 100644 doc/implementors/rand/reseeding/trait.Reseeder.js delete mode 100644 doc/implementors/rand/trait.Rng.js delete mode 100644 doc/implementors/rand/trait.SeedableRng.js delete mode 100644 doc/implementors/regex/bytes/trait.Replacer.js delete mode 100644 doc/implementors/regex/trait.Replacer.js delete mode 100644 doc/implementors/rustc_unicode/u_str/trait.UnicodeStr.js delete mode 100644 doc/implementors/std/error/trait.Error.js delete mode 100644 doc/implementors/unicode_width/trait.UnicodeWidthChar.js delete mode 100644 doc/implementors/unicode_width/trait.UnicodeWidthStr.js delete mode 100644 doc/jquery.js delete mode 100644 doc/kernel32/index.html delete mode 100644 doc/kernel32/sidebar-items.js delete mode 100644 doc/lazy_static/index.html delete mode 100644 doc/lazy_static/macro.lazy_static!.html delete mode 100644 doc/lazy_static/sidebar-items.js delete mode 100644 doc/libc/apple/b64/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/apple/b64/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/apple/b64/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/apple/b64/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/apple/b64/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/apple/b64/index.html delete mode 100644 doc/libc/apple/b64/sidebar-items.js delete mode 100644 doc/libc/apple/b64/struct.pthread_attr_t.html delete mode 100644 doc/libc/apple/b64/type.c_long.html delete mode 100644 doc/libc/apple/b64/type.c_ulong.html delete mode 100644 doc/libc/apple/constant.ABDAY_1.html delete mode 100644 doc/libc/apple/constant.ABDAY_2.html delete mode 100644 doc/libc/apple/constant.ABDAY_3.html delete mode 100644 doc/libc/apple/constant.ABDAY_4.html delete mode 100644 doc/libc/apple/constant.ABDAY_5.html delete mode 100644 doc/libc/apple/constant.ABDAY_6.html delete mode 100644 doc/libc/apple/constant.ABDAY_7.html delete mode 100644 doc/libc/apple/constant.ABMON_1.html delete mode 100644 doc/libc/apple/constant.ABMON_10.html delete mode 100644 doc/libc/apple/constant.ABMON_11.html delete mode 100644 doc/libc/apple/constant.ABMON_12.html delete mode 100644 doc/libc/apple/constant.ABMON_2.html delete mode 100644 doc/libc/apple/constant.ABMON_3.html delete mode 100644 doc/libc/apple/constant.ABMON_4.html delete mode 100644 doc/libc/apple/constant.ABMON_5.html delete mode 100644 doc/libc/apple/constant.ABMON_6.html delete mode 100644 doc/libc/apple/constant.ABMON_7.html delete mode 100644 doc/libc/apple/constant.ABMON_8.html delete mode 100644 doc/libc/apple/constant.ABMON_9.html delete mode 100644 doc/libc/apple/constant.AF_INET.html delete mode 100644 doc/libc/apple/constant.AF_INET6.html delete mode 100644 doc/libc/apple/constant.AF_UNIX.html delete mode 100644 doc/libc/apple/constant.ALT_DIGITS.html delete mode 100644 doc/libc/apple/constant.AM_STR.html delete mode 100644 doc/libc/apple/constant.BS0.html delete mode 100644 doc/libc/apple/constant.BS1.html delete mode 100644 doc/libc/apple/constant.BUFSIZ.html delete mode 100644 doc/libc/apple/constant.CODESET.html delete mode 100644 doc/libc/apple/constant.CR0.html delete mode 100644 doc/libc/apple/constant.CR1.html delete mode 100644 doc/libc/apple/constant.CR2.html delete mode 100644 doc/libc/apple/constant.CR3.html delete mode 100644 doc/libc/apple/constant.CRNCYSTR.html delete mode 100644 doc/libc/apple/constant.CRTSCTS.html delete mode 100644 doc/libc/apple/constant.DAY_1.html delete mode 100644 doc/libc/apple/constant.DAY_2.html delete mode 100644 doc/libc/apple/constant.DAY_3.html delete mode 100644 doc/libc/apple/constant.DAY_4.html delete mode 100644 doc/libc/apple/constant.DAY_5.html delete mode 100644 doc/libc/apple/constant.DAY_6.html delete mode 100644 doc/libc/apple/constant.DAY_7.html delete mode 100644 doc/libc/apple/constant.D_FMT.html delete mode 100644 doc/libc/apple/constant.D_MD_ORDER.html delete mode 100644 doc/libc/apple/constant.D_T_FMT.html delete mode 100644 doc/libc/apple/constant.E2BIG.html delete mode 100644 doc/libc/apple/constant.EACCES.html delete mode 100644 doc/libc/apple/constant.EADDRINUSE.html delete mode 100644 doc/libc/apple/constant.EADDRNOTAVAIL.html delete mode 100644 doc/libc/apple/constant.EAFNOSUPPORT.html delete mode 100644 doc/libc/apple/constant.EAGAIN.html delete mode 100644 doc/libc/apple/constant.EALREADY.html delete mode 100644 doc/libc/apple/constant.EAUTH.html delete mode 100644 doc/libc/apple/constant.EBADARCH.html delete mode 100644 doc/libc/apple/constant.EBADEXEC.html delete mode 100644 doc/libc/apple/constant.EBADF.html delete mode 100644 doc/libc/apple/constant.EBADMACHO.html delete mode 100644 doc/libc/apple/constant.EBADMSG.html delete mode 100644 doc/libc/apple/constant.EBADRPC.html delete mode 100644 doc/libc/apple/constant.EBUSY.html delete mode 100644 doc/libc/apple/constant.ECANCELED.html delete mode 100644 doc/libc/apple/constant.ECHILD.html delete mode 100644 doc/libc/apple/constant.ECONNABORTED.html delete mode 100644 doc/libc/apple/constant.ECONNREFUSED.html delete mode 100644 doc/libc/apple/constant.ECONNRESET.html delete mode 100644 doc/libc/apple/constant.EDEADLK.html delete mode 100644 doc/libc/apple/constant.EDESTADDRREQ.html delete mode 100644 doc/libc/apple/constant.EDEVERR.html delete mode 100644 doc/libc/apple/constant.EDOM.html delete mode 100644 doc/libc/apple/constant.EDQUOT.html delete mode 100644 doc/libc/apple/constant.EEXIST.html delete mode 100644 doc/libc/apple/constant.EFAULT.html delete mode 100644 doc/libc/apple/constant.EFBIG.html delete mode 100644 doc/libc/apple/constant.EFTYPE.html delete mode 100644 doc/libc/apple/constant.EHOSTDOWN.html delete mode 100644 doc/libc/apple/constant.EHOSTUNREACH.html delete mode 100644 doc/libc/apple/constant.EIDRM.html delete mode 100644 doc/libc/apple/constant.EILSEQ.html delete mode 100644 doc/libc/apple/constant.EINPROGRESS.html delete mode 100644 doc/libc/apple/constant.EINTR.html delete mode 100644 doc/libc/apple/constant.EINVAL.html delete mode 100644 doc/libc/apple/constant.EIO.html delete mode 100644 doc/libc/apple/constant.EISCONN.html delete mode 100644 doc/libc/apple/constant.EISDIR.html delete mode 100644 doc/libc/apple/constant.ELAST.html delete mode 100644 doc/libc/apple/constant.ELOOP.html delete mode 100644 doc/libc/apple/constant.EMFILE.html delete mode 100644 doc/libc/apple/constant.EMLINK.html delete mode 100644 doc/libc/apple/constant.EMSGSIZE.html delete mode 100644 doc/libc/apple/constant.EMULTIHOP.html delete mode 100644 doc/libc/apple/constant.ENAMETOOLONG.html delete mode 100644 doc/libc/apple/constant.ENEEDAUTH.html delete mode 100644 doc/libc/apple/constant.ENETDOWN.html delete mode 100644 doc/libc/apple/constant.ENETRESET.html delete mode 100644 doc/libc/apple/constant.ENETUNREACH.html delete mode 100644 doc/libc/apple/constant.ENFILE.html delete mode 100644 doc/libc/apple/constant.ENOATTR.html delete mode 100644 doc/libc/apple/constant.ENOBUFS.html delete mode 100644 doc/libc/apple/constant.ENODATA.html delete mode 100644 doc/libc/apple/constant.ENODEV.html delete mode 100644 doc/libc/apple/constant.ENOENT.html delete mode 100644 doc/libc/apple/constant.ENOEXEC.html delete mode 100644 doc/libc/apple/constant.ENOLCK.html delete mode 100644 doc/libc/apple/constant.ENOLINK.html delete mode 100644 doc/libc/apple/constant.ENOMEM.html delete mode 100644 doc/libc/apple/constant.ENOMSG.html delete mode 100644 doc/libc/apple/constant.ENOPOLICY.html delete mode 100644 doc/libc/apple/constant.ENOPROTOOPT.html delete mode 100644 doc/libc/apple/constant.ENOSPC.html delete mode 100644 doc/libc/apple/constant.ENOSR.html delete mode 100644 doc/libc/apple/constant.ENOSTR.html delete mode 100644 doc/libc/apple/constant.ENOSYS.html delete mode 100644 doc/libc/apple/constant.ENOTBLK.html delete mode 100644 doc/libc/apple/constant.ENOTCONN.html delete mode 100644 doc/libc/apple/constant.ENOTDIR.html delete mode 100644 doc/libc/apple/constant.ENOTEMPTY.html delete mode 100644 doc/libc/apple/constant.ENOTRECOVERABLE.html delete mode 100644 doc/libc/apple/constant.ENOTSOCK.html delete mode 100644 doc/libc/apple/constant.ENOTSUP.html delete mode 100644 doc/libc/apple/constant.ENOTTY.html delete mode 100644 doc/libc/apple/constant.ENXIO.html delete mode 100644 doc/libc/apple/constant.EOF.html delete mode 100644 doc/libc/apple/constant.EOPNOTSUPP.html delete mode 100644 doc/libc/apple/constant.EOVERFLOW.html delete mode 100644 doc/libc/apple/constant.EOWNERDEAD.html delete mode 100644 doc/libc/apple/constant.EPERM.html delete mode 100644 doc/libc/apple/constant.EPFNOSUPPORT.html delete mode 100644 doc/libc/apple/constant.EPIPE.html delete mode 100644 doc/libc/apple/constant.EPROCLIM.html delete mode 100644 doc/libc/apple/constant.EPROCUNAVAIL.html delete mode 100644 doc/libc/apple/constant.EPROGMISMATCH.html delete mode 100644 doc/libc/apple/constant.EPROGUNAVAIL.html delete mode 100644 doc/libc/apple/constant.EPROTO.html delete mode 100644 doc/libc/apple/constant.EPROTONOSUPPORT.html delete mode 100644 doc/libc/apple/constant.EPROTOTYPE.html delete mode 100644 doc/libc/apple/constant.EPWROFF.html delete mode 100644 doc/libc/apple/constant.EQFULL.html delete mode 100644 doc/libc/apple/constant.ERA.html delete mode 100644 doc/libc/apple/constant.ERANGE.html delete mode 100644 doc/libc/apple/constant.ERA_D_FMT.html delete mode 100644 doc/libc/apple/constant.ERA_D_T_FMT.html delete mode 100644 doc/libc/apple/constant.ERA_T_FMT.html delete mode 100644 doc/libc/apple/constant.EREMOTE.html delete mode 100644 doc/libc/apple/constant.EROFS.html delete mode 100644 doc/libc/apple/constant.ERPCMISMATCH.html delete mode 100644 doc/libc/apple/constant.ESHLIBVERS.html delete mode 100644 doc/libc/apple/constant.ESHUTDOWN.html delete mode 100644 doc/libc/apple/constant.ESOCKTNOSUPPORT.html delete mode 100644 doc/libc/apple/constant.ESPIPE.html delete mode 100644 doc/libc/apple/constant.ESRCH.html delete mode 100644 doc/libc/apple/constant.ESTALE.html delete mode 100644 doc/libc/apple/constant.ETIME.html delete mode 100644 doc/libc/apple/constant.ETIMEDOUT.html delete mode 100644 doc/libc/apple/constant.ETOOMANYREFS.html delete mode 100644 doc/libc/apple/constant.ETXTBSY.html delete mode 100644 doc/libc/apple/constant.EUSERS.html delete mode 100644 doc/libc/apple/constant.EVFILT_AIO.html delete mode 100644 doc/libc/apple/constant.EVFILT_FS.html delete mode 100644 doc/libc/apple/constant.EVFILT_MACHPORT.html delete mode 100644 doc/libc/apple/constant.EVFILT_PROC.html delete mode 100644 doc/libc/apple/constant.EVFILT_READ.html delete mode 100644 doc/libc/apple/constant.EVFILT_SIGNAL.html delete mode 100644 doc/libc/apple/constant.EVFILT_SYSCOUNT.html delete mode 100644 doc/libc/apple/constant.EVFILT_TIMER.html delete mode 100644 doc/libc/apple/constant.EVFILT_USER.html delete mode 100644 doc/libc/apple/constant.EVFILT_VM.html delete mode 100644 doc/libc/apple/constant.EVFILT_VNODE.html delete mode 100644 doc/libc/apple/constant.EVFILT_WRITE.html delete mode 100644 doc/libc/apple/constant.EV_DISPATCH.html delete mode 100644 doc/libc/apple/constant.EV_FLAG0.html delete mode 100644 doc/libc/apple/constant.EV_OOBAND.html delete mode 100644 doc/libc/apple/constant.EV_POLL.html delete mode 100644 doc/libc/apple/constant.EV_RECEIPT.html delete mode 100644 doc/libc/apple/constant.EWOULDBLOCK.html delete mode 100644 doc/libc/apple/constant.EXDEV.html delete mode 100644 doc/libc/apple/constant.EXIT_FAILURE.html delete mode 100644 doc/libc/apple/constant.EXIT_SUCCESS.html delete mode 100644 doc/libc/apple/constant.FD_SETSIZE.html delete mode 100644 doc/libc/apple/constant.FF0.html delete mode 100644 doc/libc/apple/constant.FF1.html delete mode 100644 doc/libc/apple/constant.FILENAME_MAX.html delete mode 100644 doc/libc/apple/constant.FOPEN_MAX.html delete mode 100644 doc/libc/apple/constant.F_ALLOCATEALL.html delete mode 100644 doc/libc/apple/constant.F_ALLOCATECONTIG.html delete mode 100644 doc/libc/apple/constant.F_DUPFD.html delete mode 100644 doc/libc/apple/constant.F_DUPFD_CLOEXEC.html delete mode 100644 doc/libc/apple/constant.F_FREEZE_FS.html delete mode 100644 doc/libc/apple/constant.F_FULLFSYNC.html delete mode 100644 doc/libc/apple/constant.F_GETFD.html delete mode 100644 doc/libc/apple/constant.F_GETFL.html delete mode 100644 doc/libc/apple/constant.F_GETLK.html delete mode 100644 doc/libc/apple/constant.F_GETPATH.html delete mode 100644 doc/libc/apple/constant.F_GLOBAL_NOCACHE.html delete mode 100644 doc/libc/apple/constant.F_LOCK.html delete mode 100644 doc/libc/apple/constant.F_NOCACHE.html delete mode 100644 doc/libc/apple/constant.F_NODIRECT.html delete mode 100644 doc/libc/apple/constant.F_OK.html delete mode 100644 doc/libc/apple/constant.F_PEOFPOSMODE.html delete mode 100644 doc/libc/apple/constant.F_PREALLOCATE.html delete mode 100644 doc/libc/apple/constant.F_RDADVISE.html delete mode 100644 doc/libc/apple/constant.F_RDAHEAD.html delete mode 100644 doc/libc/apple/constant.F_SETFD.html delete mode 100644 doc/libc/apple/constant.F_SETFL.html delete mode 100644 doc/libc/apple/constant.F_SETLK.html delete mode 100644 doc/libc/apple/constant.F_SETLKW.html delete mode 100644 doc/libc/apple/constant.F_TEST.html delete mode 100644 doc/libc/apple/constant.F_THAW_FS.html delete mode 100644 doc/libc/apple/constant.F_TLOCK.html delete mode 100644 doc/libc/apple/constant.F_ULOCK.html delete mode 100644 doc/libc/apple/constant.F_VOLPOSMODE.html delete mode 100644 doc/libc/apple/constant.GLOB_ABORTED.html delete mode 100644 doc/libc/apple/constant.GLOB_APPEND.html delete mode 100644 doc/libc/apple/constant.GLOB_DOOFFS.html delete mode 100644 doc/libc/apple/constant.GLOB_ERR.html delete mode 100644 doc/libc/apple/constant.GLOB_MARK.html delete mode 100644 doc/libc/apple/constant.GLOB_NOCHECK.html delete mode 100644 doc/libc/apple/constant.GLOB_NOESCAPE.html delete mode 100644 doc/libc/apple/constant.GLOB_NOMATCH.html delete mode 100644 doc/libc/apple/constant.GLOB_NOSORT.html delete mode 100644 doc/libc/apple/constant.GLOB_NOSPACE.html delete mode 100644 doc/libc/apple/constant.HW_AVAILCPU.html delete mode 100644 doc/libc/apple/constant.IFF_LOOPBACK.html delete mode 100644 doc/libc/apple/constant.IPPROTO_IP.html delete mode 100644 doc/libc/apple/constant.IPPROTO_IPV6.html delete mode 100644 doc/libc/apple/constant.IPPROTO_RAW.html delete mode 100644 doc/libc/apple/constant.IPPROTO_TCP.html delete mode 100644 doc/libc/apple/constant.IPV6_JOIN_GROUP.html delete mode 100644 doc/libc/apple/constant.IPV6_LEAVE_GROUP.html delete mode 100644 doc/libc/apple/constant.IP_ADD_MEMBERSHIP.html delete mode 100644 doc/libc/apple/constant.IP_DROP_MEMBERSHIP.html delete mode 100644 doc/libc/apple/constant.IP_HDRINCL.html delete mode 100644 doc/libc/apple/constant.IP_MULTICAST_LOOP.html delete mode 100644 doc/libc/apple/constant.IP_MULTICAST_TTL.html delete mode 100644 doc/libc/apple/constant.IP_TTL.html delete mode 100644 doc/libc/apple/constant.IUTF8.html delete mode 100644 doc/libc/apple/constant.LC_ALL_MASK.html delete mode 100644 doc/libc/apple/constant.LC_COLLATE_MASK.html delete mode 100644 doc/libc/apple/constant.LC_CTYPE_MASK.html delete mode 100644 doc/libc/apple/constant.LC_MESSAGES_MASK.html delete mode 100644 doc/libc/apple/constant.LC_MONETARY_MASK.html delete mode 100644 doc/libc/apple/constant.LC_NUMERIC_MASK.html delete mode 100644 doc/libc/apple/constant.LC_TIME_MASK.html delete mode 100644 doc/libc/apple/constant.LOCK_EX.html delete mode 100644 doc/libc/apple/constant.LOCK_NB.html delete mode 100644 doc/libc/apple/constant.LOCK_SH.html delete mode 100644 doc/libc/apple/constant.LOCK_UN.html delete mode 100644 doc/libc/apple/constant.L_tmpnam.html delete mode 100644 doc/libc/apple/constant.MADV_CAN_REUSE.html delete mode 100644 doc/libc/apple/constant.MADV_DONTNEED.html delete mode 100644 doc/libc/apple/constant.MADV_FREE.html delete mode 100644 doc/libc/apple/constant.MADV_FREE_REUSABLE.html delete mode 100644 doc/libc/apple/constant.MADV_FREE_REUSE.html delete mode 100644 doc/libc/apple/constant.MADV_NORMAL.html delete mode 100644 doc/libc/apple/constant.MADV_RANDOM.html delete mode 100644 doc/libc/apple/constant.MADV_SEQUENTIAL.html delete mode 100644 doc/libc/apple/constant.MADV_WILLNEED.html delete mode 100644 doc/libc/apple/constant.MADV_ZERO_WIRED_PAGES.html delete mode 100644 doc/libc/apple/constant.MAP_ANON.html delete mode 100644 doc/libc/apple/constant.MAP_COPY.html delete mode 100644 doc/libc/apple/constant.MAP_FAILED.html delete mode 100644 doc/libc/apple/constant.MAP_FILE.html delete mode 100644 doc/libc/apple/constant.MAP_FIXED.html delete mode 100644 doc/libc/apple/constant.MAP_HASSEMAPHORE.html delete mode 100644 doc/libc/apple/constant.MAP_JIT.html delete mode 100644 doc/libc/apple/constant.MAP_NOCACHE.html delete mode 100644 doc/libc/apple/constant.MAP_NOEXTEND.html delete mode 100644 doc/libc/apple/constant.MAP_NORESERVE.html delete mode 100644 doc/libc/apple/constant.MAP_PRIVATE.html delete mode 100644 doc/libc/apple/constant.MAP_RENAME.html delete mode 100644 doc/libc/apple/constant.MAP_SHARED.html delete mode 100644 doc/libc/apple/constant.MCL_CURRENT.html delete mode 100644 doc/libc/apple/constant.MCL_FUTURE.html delete mode 100644 doc/libc/apple/constant.MINCORE_INCORE.html delete mode 100644 doc/libc/apple/constant.MINCORE_MODIFIED.html delete mode 100644 doc/libc/apple/constant.MINCORE_MODIFIED_OTHER.html delete mode 100644 doc/libc/apple/constant.MINCORE_REFERENCED.html delete mode 100644 doc/libc/apple/constant.MINCORE_REFERENCED_OTHER.html delete mode 100644 doc/libc/apple/constant.MON_1.html delete mode 100644 doc/libc/apple/constant.MON_10.html delete mode 100644 doc/libc/apple/constant.MON_11.html delete mode 100644 doc/libc/apple/constant.MON_12.html delete mode 100644 doc/libc/apple/constant.MON_2.html delete mode 100644 doc/libc/apple/constant.MON_3.html delete mode 100644 doc/libc/apple/constant.MON_4.html delete mode 100644 doc/libc/apple/constant.MON_5.html delete mode 100644 doc/libc/apple/constant.MON_6.html delete mode 100644 doc/libc/apple/constant.MON_7.html delete mode 100644 doc/libc/apple/constant.MON_8.html delete mode 100644 doc/libc/apple/constant.MON_9.html delete mode 100644 doc/libc/apple/constant.MS_ASYNC.html delete mode 100644 doc/libc/apple/constant.MS_DEACTIVATE.html delete mode 100644 doc/libc/apple/constant.MS_INVALIDATE.html delete mode 100644 doc/libc/apple/constant.MS_KILLPAGES.html delete mode 100644 doc/libc/apple/constant.MS_SYNC.html delete mode 100644 doc/libc/apple/constant.NI_MAXHOST.html delete mode 100644 doc/libc/apple/constant.NL0.html delete mode 100644 doc/libc/apple/constant.NL1.html delete mode 100644 doc/libc/apple/constant.NOEXPR.html delete mode 100644 doc/libc/apple/constant.NOSTR.html delete mode 100644 doc/libc/apple/constant.NOTE_ABSOLUTE.html delete mode 100644 doc/libc/apple/constant.NOTE_EXITSTATUS.html delete mode 100644 doc/libc/apple/constant.NOTE_EXIT_REPARENTED.html delete mode 100644 doc/libc/apple/constant.NOTE_FFAND.html delete mode 100644 doc/libc/apple/constant.NOTE_FFCOPY.html delete mode 100644 doc/libc/apple/constant.NOTE_FFCTRLMASK.html delete mode 100644 doc/libc/apple/constant.NOTE_FFLAGSMASK.html delete mode 100644 doc/libc/apple/constant.NOTE_FFNOP.html delete mode 100644 doc/libc/apple/constant.NOTE_FFOR.html delete mode 100644 doc/libc/apple/constant.NOTE_NONE.html delete mode 100644 doc/libc/apple/constant.NOTE_NSECONDS.html delete mode 100644 doc/libc/apple/constant.NOTE_PCTRLMASK.html delete mode 100644 doc/libc/apple/constant.NOTE_REAP.html delete mode 100644 doc/libc/apple/constant.NOTE_SECONDS.html delete mode 100644 doc/libc/apple/constant.NOTE_SIGNAL.html delete mode 100644 doc/libc/apple/constant.NOTE_TRIGGER.html delete mode 100644 doc/libc/apple/constant.NOTE_USECONDS.html delete mode 100644 doc/libc/apple/constant.NOTE_VM_ERROR.html delete mode 100644 doc/libc/apple/constant.NOTE_VM_PRESSURE.html delete mode 100644 doc/libc/apple/constant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html delete mode 100644 doc/libc/apple/constant.NOTE_VM_PRESSURE_TERMINATE.html delete mode 100644 doc/libc/apple/constant.O_ACCMODE.html delete mode 100644 doc/libc/apple/constant.O_APPEND.html delete mode 100644 doc/libc/apple/constant.O_CLOEXEC.html delete mode 100644 doc/libc/apple/constant.O_CREAT.html delete mode 100644 doc/libc/apple/constant.O_DIRECTORY.html delete mode 100644 doc/libc/apple/constant.O_DSYNC.html delete mode 100644 doc/libc/apple/constant.O_EXCL.html delete mode 100644 doc/libc/apple/constant.O_NOCTTY.html delete mode 100644 doc/libc/apple/constant.O_NONBLOCK.html delete mode 100644 doc/libc/apple/constant.O_RDONLY.html delete mode 100644 doc/libc/apple/constant.O_RDWR.html delete mode 100644 doc/libc/apple/constant.O_SYNC.html delete mode 100644 doc/libc/apple/constant.O_TRUNC.html delete mode 100644 doc/libc/apple/constant.O_WRONLY.html delete mode 100644 doc/libc/apple/constant.PM_STR.html delete mode 100644 doc/libc/apple/constant.POSIX_MADV_DONTNEED.html delete mode 100644 doc/libc/apple/constant.POSIX_MADV_NORMAL.html delete mode 100644 doc/libc/apple/constant.POSIX_MADV_RANDOM.html delete mode 100644 doc/libc/apple/constant.POSIX_MADV_SEQUENTIAL.html delete mode 100644 doc/libc/apple/constant.POSIX_MADV_WILLNEED.html delete mode 100644 doc/libc/apple/constant.PROT_EXEC.html delete mode 100644 doc/libc/apple/constant.PROT_NONE.html delete mode 100644 doc/libc/apple/constant.PROT_READ.html delete mode 100644 doc/libc/apple/constant.PROT_WRITE.html delete mode 100644 doc/libc/apple/constant.PTHREAD_COND_INITIALIZER.html delete mode 100644 doc/libc/apple/constant.PTHREAD_CREATE_DETACHED.html delete mode 100644 doc/libc/apple/constant.PTHREAD_CREATE_JOINABLE.html delete mode 100644 doc/libc/apple/constant.PTHREAD_MUTEX_INITIALIZER.html delete mode 100644 doc/libc/apple/constant.PTHREAD_MUTEX_RECURSIVE.html delete mode 100644 doc/libc/apple/constant.PTHREAD_RWLOCK_INITIALIZER.html delete mode 100644 doc/libc/apple/constant.PTHREAD_STACK_MIN.html delete mode 100644 doc/libc/apple/constant.Q_GETQUOTA.html delete mode 100644 doc/libc/apple/constant.Q_SETQUOTA.html delete mode 100644 doc/libc/apple/constant.RADIXCHAR.html delete mode 100644 doc/libc/apple/constant.RAND_MAX.html delete mode 100644 doc/libc/apple/constant.RLIMIT_AS.html delete mode 100644 doc/libc/apple/constant.RLIMIT_CORE.html delete mode 100644 doc/libc/apple/constant.RLIMIT_CPU.html delete mode 100644 doc/libc/apple/constant.RLIMIT_DATA.html delete mode 100644 doc/libc/apple/constant.RLIMIT_FSIZE.html delete mode 100644 doc/libc/apple/constant.RLIMIT_MEMLOCK.html delete mode 100644 doc/libc/apple/constant.RLIMIT_NOFILE.html delete mode 100644 doc/libc/apple/constant.RLIMIT_NPROC.html delete mode 100644 doc/libc/apple/constant.RLIMIT_RSS.html delete mode 100644 doc/libc/apple/constant.RLIMIT_STACK.html delete mode 100644 doc/libc/apple/constant.RLIM_INFINITY.html delete mode 100644 doc/libc/apple/constant.RLIM_NLIMITS.html delete mode 100644 doc/libc/apple/constant.RTLD_FIRST.html delete mode 100644 doc/libc/apple/constant.RTLD_GLOBAL.html delete mode 100644 doc/libc/apple/constant.RTLD_LOCAL.html delete mode 100644 doc/libc/apple/constant.RTLD_NODELETE.html delete mode 100644 doc/libc/apple/constant.RTLD_NOLOAD.html delete mode 100644 doc/libc/apple/constant.RUSAGE_CHILDREN.html delete mode 100644 doc/libc/apple/constant.RUSAGE_SELF.html delete mode 100644 doc/libc/apple/constant.R_OK.html delete mode 100644 doc/libc/apple/constant.SEEK_CUR.html delete mode 100644 doc/libc/apple/constant.SEEK_END.html delete mode 100644 doc/libc/apple/constant.SEEK_SET.html delete mode 100644 doc/libc/apple/constant.SHUT_RD.html delete mode 100644 doc/libc/apple/constant.SHUT_RDWR.html delete mode 100644 doc/libc/apple/constant.SHUT_WR.html delete mode 100644 doc/libc/apple/constant.SIGABRT.html delete mode 100644 doc/libc/apple/constant.SIGALRM.html delete mode 100644 doc/libc/apple/constant.SIGEMT.html delete mode 100644 doc/libc/apple/constant.SIGFPE.html delete mode 100644 doc/libc/apple/constant.SIGHUP.html delete mode 100644 doc/libc/apple/constant.SIGILL.html delete mode 100644 doc/libc/apple/constant.SIGINT.html delete mode 100644 doc/libc/apple/constant.SIGKILL.html delete mode 100644 doc/libc/apple/constant.SIGPIPE.html delete mode 100644 doc/libc/apple/constant.SIGQUIT.html delete mode 100644 doc/libc/apple/constant.SIGSEGV.html delete mode 100644 doc/libc/apple/constant.SIGSTKSZ.html delete mode 100644 doc/libc/apple/constant.SIGTERM.html delete mode 100644 doc/libc/apple/constant.SIGTRAP.html delete mode 100644 doc/libc/apple/constant.SOCK_DGRAM.html delete mode 100644 doc/libc/apple/constant.SOCK_RAW.html delete mode 100644 doc/libc/apple/constant.SOCK_STREAM.html delete mode 100644 doc/libc/apple/constant.SOL_SOCKET.html delete mode 100644 doc/libc/apple/constant.SO_ACCEPTCONN.html delete mode 100644 doc/libc/apple/constant.SO_BROADCAST.html delete mode 100644 doc/libc/apple/constant.SO_DEBUG.html delete mode 100644 doc/libc/apple/constant.SO_DONTROUTE.html delete mode 100644 doc/libc/apple/constant.SO_DONTTRUNC.html delete mode 100644 doc/libc/apple/constant.SO_ERROR.html delete mode 100644 doc/libc/apple/constant.SO_KEEPALIVE.html delete mode 100644 doc/libc/apple/constant.SO_LINGER.html delete mode 100644 doc/libc/apple/constant.SO_NKE.html delete mode 100644 doc/libc/apple/constant.SO_NOADDRERR.html delete mode 100644 doc/libc/apple/constant.SO_NOSIGPIPE.html delete mode 100644 doc/libc/apple/constant.SO_NREAD.html delete mode 100644 doc/libc/apple/constant.SO_NWRITE.html delete mode 100644 doc/libc/apple/constant.SO_OOBINLINE.html delete mode 100644 doc/libc/apple/constant.SO_RCVBUF.html delete mode 100644 doc/libc/apple/constant.SO_RCVLOWAT.html delete mode 100644 doc/libc/apple/constant.SO_RCVTIMEO.html delete mode 100644 doc/libc/apple/constant.SO_REUSEADDR.html delete mode 100644 doc/libc/apple/constant.SO_REUSEPORT.html delete mode 100644 doc/libc/apple/constant.SO_SNDBUF.html delete mode 100644 doc/libc/apple/constant.SO_SNDLOWAT.html delete mode 100644 doc/libc/apple/constant.SO_SNDTIMEO.html delete mode 100644 doc/libc/apple/constant.SO_TYPE.html delete mode 100644 doc/libc/apple/constant.SO_USELOOPBACK.html delete mode 100644 doc/libc/apple/constant.SO_WANTMORE.html delete mode 100644 doc/libc/apple/constant.SO_WANTOOBFLAG.html delete mode 100644 doc/libc/apple/constant.STDERR_FILENO.html delete mode 100644 doc/libc/apple/constant.STDIN_FILENO.html delete mode 100644 doc/libc/apple/constant.STDOUT_FILENO.html delete mode 100644 doc/libc/apple/constant.ST_NOSUID.html delete mode 100644 doc/libc/apple/constant.S_IEXEC.html delete mode 100644 doc/libc/apple/constant.S_IFBLK.html delete mode 100644 doc/libc/apple/constant.S_IFCHR.html delete mode 100644 doc/libc/apple/constant.S_IFDIR.html delete mode 100644 doc/libc/apple/constant.S_IFIFO.html delete mode 100644 doc/libc/apple/constant.S_IFLNK.html delete mode 100644 doc/libc/apple/constant.S_IFMT.html delete mode 100644 doc/libc/apple/constant.S_IFREG.html delete mode 100644 doc/libc/apple/constant.S_IFSOCK.html delete mode 100644 doc/libc/apple/constant.S_IREAD.html delete mode 100644 doc/libc/apple/constant.S_IRGRP.html delete mode 100644 doc/libc/apple/constant.S_IROTH.html delete mode 100644 doc/libc/apple/constant.S_IRUSR.html delete mode 100644 doc/libc/apple/constant.S_IRWXG.html delete mode 100644 doc/libc/apple/constant.S_IRWXO.html delete mode 100644 doc/libc/apple/constant.S_IRWXU.html delete mode 100644 doc/libc/apple/constant.S_IWGRP.html delete mode 100644 doc/libc/apple/constant.S_IWOTH.html delete mode 100644 doc/libc/apple/constant.S_IWRITE.html delete mode 100644 doc/libc/apple/constant.S_IWUSR.html delete mode 100644 doc/libc/apple/constant.S_IXGRP.html delete mode 100644 doc/libc/apple/constant.S_IXOTH.html delete mode 100644 doc/libc/apple/constant.S_IXUSR.html delete mode 100644 doc/libc/apple/constant.TAB0.html delete mode 100644 doc/libc/apple/constant.TAB1.html delete mode 100644 doc/libc/apple/constant.TAB2.html delete mode 100644 doc/libc/apple/constant.TAB3.html delete mode 100644 doc/libc/apple/constant.TCP_KEEPALIVE.html delete mode 100644 doc/libc/apple/constant.TCP_NODELAY.html delete mode 100644 doc/libc/apple/constant.THOUSEP.html delete mode 100644 doc/libc/apple/constant.TIOCCBRK.html delete mode 100644 doc/libc/apple/constant.TIOCCDTR.html delete mode 100644 doc/libc/apple/constant.TIOCCONS.html delete mode 100644 doc/libc/apple/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/apple/constant.TIOCDRAIN.html delete mode 100644 doc/libc/apple/constant.TIOCDSIMICROCODE.html delete mode 100644 doc/libc/apple/constant.TIOCEXCL.html delete mode 100644 doc/libc/apple/constant.TIOCEXT.html delete mode 100644 doc/libc/apple/constant.TIOCFLUSH.html delete mode 100644 doc/libc/apple/constant.TIOCGDRAINWAIT.html delete mode 100644 doc/libc/apple/constant.TIOCGETD.html delete mode 100644 doc/libc/apple/constant.TIOCGPGRP.html delete mode 100644 doc/libc/apple/constant.TIOCGWINSZ.html delete mode 100644 doc/libc/apple/constant.TIOCIXOFF.html delete mode 100644 doc/libc/apple/constant.TIOCIXON.html delete mode 100644 doc/libc/apple/constant.TIOCMBIC.html delete mode 100644 doc/libc/apple/constant.TIOCMBIS.html delete mode 100644 doc/libc/apple/constant.TIOCMGDTRWAIT.html delete mode 100644 doc/libc/apple/constant.TIOCMGET.html delete mode 100644 doc/libc/apple/constant.TIOCMODG.html delete mode 100644 doc/libc/apple/constant.TIOCMODS.html delete mode 100644 doc/libc/apple/constant.TIOCMSDTRWAIT.html delete mode 100644 doc/libc/apple/constant.TIOCMSET.html delete mode 100644 doc/libc/apple/constant.TIOCM_CAR.html delete mode 100644 doc/libc/apple/constant.TIOCM_CD.html delete mode 100644 doc/libc/apple/constant.TIOCM_CTS.html delete mode 100644 doc/libc/apple/constant.TIOCM_DSR.html delete mode 100644 doc/libc/apple/constant.TIOCM_DTR.html delete mode 100644 doc/libc/apple/constant.TIOCM_LE.html delete mode 100644 doc/libc/apple/constant.TIOCM_RI.html delete mode 100644 doc/libc/apple/constant.TIOCM_RNG.html delete mode 100644 doc/libc/apple/constant.TIOCM_RTS.html delete mode 100644 doc/libc/apple/constant.TIOCM_SR.html delete mode 100644 doc/libc/apple/constant.TIOCM_ST.html delete mode 100644 doc/libc/apple/constant.TIOCNOTTY.html delete mode 100644 doc/libc/apple/constant.TIOCNXCL.html delete mode 100644 doc/libc/apple/constant.TIOCOUTQ.html delete mode 100644 doc/libc/apple/constant.TIOCPKT.html delete mode 100644 doc/libc/apple/constant.TIOCPKT_DATA.html delete mode 100644 doc/libc/apple/constant.TIOCPKT_DOSTOP.html delete mode 100644 doc/libc/apple/constant.TIOCPKT_FLUSHREAD.html delete mode 100644 doc/libc/apple/constant.TIOCPKT_FLUSHWRITE.html delete mode 100644 doc/libc/apple/constant.TIOCPKT_IOCTL.html delete mode 100644 doc/libc/apple/constant.TIOCPKT_NOSTOP.html delete mode 100644 doc/libc/apple/constant.TIOCPKT_START.html delete mode 100644 doc/libc/apple/constant.TIOCPKT_STOP.html delete mode 100644 doc/libc/apple/constant.TIOCPTYGNAME.html delete mode 100644 doc/libc/apple/constant.TIOCPTYGRANT.html delete mode 100644 doc/libc/apple/constant.TIOCPTYUNLK.html delete mode 100644 doc/libc/apple/constant.TIOCREMOTE.html delete mode 100644 doc/libc/apple/constant.TIOCSBRK.html delete mode 100644 doc/libc/apple/constant.TIOCSCONS.html delete mode 100644 doc/libc/apple/constant.TIOCSCTTY.html delete mode 100644 doc/libc/apple/constant.TIOCSDRAINWAIT.html delete mode 100644 doc/libc/apple/constant.TIOCSDTR.html delete mode 100644 doc/libc/apple/constant.TIOCSETD.html delete mode 100644 doc/libc/apple/constant.TIOCSIG.html delete mode 100644 doc/libc/apple/constant.TIOCSPGRP.html delete mode 100644 doc/libc/apple/constant.TIOCSTART.html delete mode 100644 doc/libc/apple/constant.TIOCSTAT.html delete mode 100644 doc/libc/apple/constant.TIOCSTI.html delete mode 100644 doc/libc/apple/constant.TIOCSTOP.html delete mode 100644 doc/libc/apple/constant.TIOCSWINSZ.html delete mode 100644 doc/libc/apple/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/apple/constant.TIOCUCNTL.html delete mode 100644 doc/libc/apple/constant.TMP_MAX.html delete mode 100644 doc/libc/apple/constant.T_FMT.html delete mode 100644 doc/libc/apple/constant.T_FMT_AMPM.html delete mode 100644 doc/libc/apple/constant.VT0.html delete mode 100644 doc/libc/apple/constant.VT1.html delete mode 100644 doc/libc/apple/constant.W_OK.html delete mode 100644 doc/libc/apple/constant.X_OK.html delete mode 100644 doc/libc/apple/constant.YESEXPR.html delete mode 100644 doc/libc/apple/constant.YESSTR.html delete mode 100644 doc/libc/apple/constant._IOFBF.html delete mode 100644 doc/libc/apple/constant._IOLBF.html delete mode 100644 doc/libc/apple/constant._IONBF.html delete mode 100644 doc/libc/apple/constant._PC_NAME_MAX.html delete mode 100644 doc/libc/apple/constant._PTHREAD_COND_SIG_init.html delete mode 100644 doc/libc/apple/constant._PTHREAD_MUTEX_SIG_init.html delete mode 100644 doc/libc/apple/constant._PTHREAD_RWLOCK_SIG_init.html delete mode 100644 doc/libc/apple/constant._RLIMIT_POSIX_FLAG.html delete mode 100644 doc/libc/apple/constant._SC_2_CHAR_TERM.html delete mode 100644 doc/libc/apple/constant._SC_2_C_BIND.html delete mode 100644 doc/libc/apple/constant._SC_2_C_DEV.html delete mode 100644 doc/libc/apple/constant._SC_2_FORT_DEV.html delete mode 100644 doc/libc/apple/constant._SC_2_FORT_RUN.html delete mode 100644 doc/libc/apple/constant._SC_2_LOCALEDEF.html delete mode 100644 doc/libc/apple/constant._SC_2_PBS.html delete mode 100644 doc/libc/apple/constant._SC_2_PBS_ACCOUNTING.html delete mode 100644 doc/libc/apple/constant._SC_2_PBS_CHECKPOINT.html delete mode 100644 doc/libc/apple/constant._SC_2_PBS_LOCATE.html delete mode 100644 doc/libc/apple/constant._SC_2_PBS_MESSAGE.html delete mode 100644 doc/libc/apple/constant._SC_2_PBS_TRACK.html delete mode 100644 doc/libc/apple/constant._SC_2_SW_DEV.html delete mode 100644 doc/libc/apple/constant._SC_2_UPE.html delete mode 100644 doc/libc/apple/constant._SC_2_VERSION.html delete mode 100644 doc/libc/apple/constant._SC_ADVISORY_INFO.html delete mode 100644 doc/libc/apple/constant._SC_AIO_LISTIO_MAX.html delete mode 100644 doc/libc/apple/constant._SC_AIO_MAX.html delete mode 100644 doc/libc/apple/constant._SC_AIO_PRIO_DELTA_MAX.html delete mode 100644 doc/libc/apple/constant._SC_ARG_MAX.html delete mode 100644 doc/libc/apple/constant._SC_ASYNCHRONOUS_IO.html delete mode 100644 doc/libc/apple/constant._SC_ATEXIT_MAX.html delete mode 100644 doc/libc/apple/constant._SC_BARRIERS.html delete mode 100644 doc/libc/apple/constant._SC_BC_BASE_MAX.html delete mode 100644 doc/libc/apple/constant._SC_BC_DIM_MAX.html delete mode 100644 doc/libc/apple/constant._SC_BC_SCALE_MAX.html delete mode 100644 doc/libc/apple/constant._SC_BC_STRING_MAX.html delete mode 100644 doc/libc/apple/constant._SC_CHILD_MAX.html delete mode 100644 doc/libc/apple/constant._SC_CLK_TCK.html delete mode 100644 doc/libc/apple/constant._SC_CLOCK_SELECTION.html delete mode 100644 doc/libc/apple/constant._SC_COLL_WEIGHTS_MAX.html delete mode 100644 doc/libc/apple/constant._SC_CPUTIME.html delete mode 100644 doc/libc/apple/constant._SC_DELAYTIMER_MAX.html delete mode 100644 doc/libc/apple/constant._SC_EXPR_NEST_MAX.html delete mode 100644 doc/libc/apple/constant._SC_FILE_LOCKING.html delete mode 100644 doc/libc/apple/constant._SC_FSYNC.html delete mode 100644 doc/libc/apple/constant._SC_GETGR_R_SIZE_MAX.html delete mode 100644 doc/libc/apple/constant._SC_GETPW_R_SIZE_MAX.html delete mode 100644 doc/libc/apple/constant._SC_HOST_NAME_MAX.html delete mode 100644 doc/libc/apple/constant._SC_IOV_MAX.html delete mode 100644 doc/libc/apple/constant._SC_IPV6.html delete mode 100644 doc/libc/apple/constant._SC_JOB_CONTROL.html delete mode 100644 doc/libc/apple/constant._SC_LINE_MAX.html delete mode 100644 doc/libc/apple/constant._SC_LOGIN_NAME_MAX.html delete mode 100644 doc/libc/apple/constant._SC_MAPPED_FILES.html delete mode 100644 doc/libc/apple/constant._SC_MEMLOCK.html delete mode 100644 doc/libc/apple/constant._SC_MEMLOCK_RANGE.html delete mode 100644 doc/libc/apple/constant._SC_MEMORY_PROTECTION.html delete mode 100644 doc/libc/apple/constant._SC_MESSAGE_PASSING.html delete mode 100644 doc/libc/apple/constant._SC_MONOTONIC_CLOCK.html delete mode 100644 doc/libc/apple/constant._SC_MQ_OPEN_MAX.html delete mode 100644 doc/libc/apple/constant._SC_MQ_PRIO_MAX.html delete mode 100644 doc/libc/apple/constant._SC_NGROUPS_MAX.html delete mode 100644 doc/libc/apple/constant._SC_NPROCESSORS_CONF.html delete mode 100644 doc/libc/apple/constant._SC_NPROCESSORS_ONLN.html delete mode 100644 doc/libc/apple/constant._SC_OPEN_MAX.html delete mode 100644 doc/libc/apple/constant._SC_PAGESIZE.html delete mode 100644 doc/libc/apple/constant._SC_PAGE_SIZE.html delete mode 100644 doc/libc/apple/constant._SC_PASS_MAX.html delete mode 100644 doc/libc/apple/constant._SC_PRIORITIZED_IO.html delete mode 100644 doc/libc/apple/constant._SC_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/apple/constant._SC_RAW_SOCKETS.html delete mode 100644 doc/libc/apple/constant._SC_READER_WRITER_LOCKS.html delete mode 100644 doc/libc/apple/constant._SC_REALTIME_SIGNALS.html delete mode 100644 doc/libc/apple/constant._SC_REGEXP.html delete mode 100644 doc/libc/apple/constant._SC_RE_DUP_MAX.html delete mode 100644 doc/libc/apple/constant._SC_RTSIG_MAX.html delete mode 100644 doc/libc/apple/constant._SC_SAVED_IDS.html delete mode 100644 doc/libc/apple/constant._SC_SEMAPHORES.html delete mode 100644 doc/libc/apple/constant._SC_SEM_NSEMS_MAX.html delete mode 100644 doc/libc/apple/constant._SC_SEM_VALUE_MAX.html delete mode 100644 doc/libc/apple/constant._SC_SHARED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/apple/constant._SC_SHELL.html delete mode 100644 doc/libc/apple/constant._SC_SIGQUEUE_MAX.html delete mode 100644 doc/libc/apple/constant._SC_SPAWN.html delete mode 100644 doc/libc/apple/constant._SC_SPIN_LOCKS.html delete mode 100644 doc/libc/apple/constant._SC_SPORADIC_SERVER.html delete mode 100644 doc/libc/apple/constant._SC_SS_REPL_MAX.html delete mode 100644 doc/libc/apple/constant._SC_STREAM_MAX.html delete mode 100644 doc/libc/apple/constant._SC_SYMLOOP_MAX.html delete mode 100644 doc/libc/apple/constant._SC_SYNCHRONIZED_IO.html delete mode 100644 doc/libc/apple/constant._SC_THREADS.html delete mode 100644 doc/libc/apple/constant._SC_THREAD_ATTR_STACKADDR.html delete mode 100644 doc/libc/apple/constant._SC_THREAD_ATTR_STACKSIZE.html delete mode 100644 doc/libc/apple/constant._SC_THREAD_CPUTIME.html delete mode 100644 doc/libc/apple/constant._SC_THREAD_DESTRUCTOR_ITERATIONS.html delete mode 100644 doc/libc/apple/constant._SC_THREAD_KEYS_MAX.html delete mode 100644 doc/libc/apple/constant._SC_THREAD_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/apple/constant._SC_THREAD_PRIO_INHERIT.html delete mode 100644 doc/libc/apple/constant._SC_THREAD_PRIO_PROTECT.html delete mode 100644 doc/libc/apple/constant._SC_THREAD_PROCESS_SHARED.html delete mode 100644 doc/libc/apple/constant._SC_THREAD_SAFE_FUNCTIONS.html delete mode 100644 doc/libc/apple/constant._SC_THREAD_SPORADIC_SERVER.html delete mode 100644 doc/libc/apple/constant._SC_THREAD_STACK_MIN.html delete mode 100644 doc/libc/apple/constant._SC_THREAD_THREADS_MAX.html delete mode 100644 doc/libc/apple/constant._SC_TIMEOUTS.html delete mode 100644 doc/libc/apple/constant._SC_TIMERS.html delete mode 100644 doc/libc/apple/constant._SC_TIMER_MAX.html delete mode 100644 doc/libc/apple/constant._SC_TRACE.html delete mode 100644 doc/libc/apple/constant._SC_TRACE_EVENT_FILTER.html delete mode 100644 doc/libc/apple/constant._SC_TRACE_EVENT_NAME_MAX.html delete mode 100644 doc/libc/apple/constant._SC_TRACE_INHERIT.html delete mode 100644 doc/libc/apple/constant._SC_TRACE_LOG.html delete mode 100644 doc/libc/apple/constant._SC_TRACE_NAME_MAX.html delete mode 100644 doc/libc/apple/constant._SC_TRACE_SYS_MAX.html delete mode 100644 doc/libc/apple/constant._SC_TRACE_USER_EVENT_MAX.html delete mode 100644 doc/libc/apple/constant._SC_TTY_NAME_MAX.html delete mode 100644 doc/libc/apple/constant._SC_TYPED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/apple/constant._SC_TZNAME_MAX.html delete mode 100644 doc/libc/apple/constant._SC_V6_ILP32_OFF32.html delete mode 100644 doc/libc/apple/constant._SC_V6_ILP32_OFFBIG.html delete mode 100644 doc/libc/apple/constant._SC_V6_LP64_OFF64.html delete mode 100644 doc/libc/apple/constant._SC_V6_LPBIG_OFFBIG.html delete mode 100644 doc/libc/apple/constant._SC_VERSION.html delete mode 100644 doc/libc/apple/constant._SC_XBS5_ILP32_OFF32.html delete mode 100644 doc/libc/apple/constant._SC_XBS5_ILP32_OFFBIG.html delete mode 100644 doc/libc/apple/constant._SC_XBS5_LP64_OFF64.html delete mode 100644 doc/libc/apple/constant._SC_XBS5_LPBIG_OFFBIG.html delete mode 100644 doc/libc/apple/constant._SC_XOPEN_CRYPT.html delete mode 100644 doc/libc/apple/constant._SC_XOPEN_ENH_I18N.html delete mode 100644 doc/libc/apple/constant._SC_XOPEN_LEGACY.html delete mode 100644 doc/libc/apple/constant._SC_XOPEN_REALTIME.html delete mode 100644 doc/libc/apple/constant._SC_XOPEN_REALTIME_THREADS.html delete mode 100644 doc/libc/apple/constant._SC_XOPEN_SHM.html delete mode 100644 doc/libc/apple/constant._SC_XOPEN_STREAMS.html delete mode 100644 doc/libc/apple/constant._SC_XOPEN_UNIX.html delete mode 100644 doc/libc/apple/constant._SC_XOPEN_VERSION.html delete mode 100644 doc/libc/apple/constant._SC_XOPEN_XCU_VERSION.html delete mode 100644 doc/libc/apple/constant._WSTOPPED.html delete mode 100644 doc/libc/apple/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/apple/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/apple/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/apple/enum.timezone.html delete mode 100644 doc/libc/apple/fn.WIFCONTINUED.html delete mode 100644 doc/libc/apple/fn.WIFSIGNALED.html delete mode 100644 doc/libc/apple/fn.WIFSTOPPED.html delete mode 100644 doc/libc/apple/fn.WSTOPSIG.html delete mode 100644 doc/libc/apple/fn._WSTATUS.html delete mode 100644 doc/libc/apple/fn.__error.html delete mode 100644 doc/libc/apple/fn.backtrace.html delete mode 100644 doc/libc/apple/fn.duplocale.html delete mode 100644 doc/libc/apple/fn.forkpty.html delete mode 100644 doc/libc/apple/fn.freelocale.html delete mode 100644 doc/libc/apple/fn.fstatfs.html delete mode 100644 doc/libc/apple/fn.getnameinfo.html delete mode 100644 doc/libc/apple/fn.kevent.html delete mode 100644 doc/libc/apple/fn.kevent64.html delete mode 100644 doc/libc/apple/fn.localeconv_l.html delete mode 100644 doc/libc/apple/fn.mach_absolute_time.html delete mode 100644 doc/libc/apple/fn.mach_timebase_info.html delete mode 100644 doc/libc/apple/fn.mincore.html delete mode 100644 doc/libc/apple/fn.mount.html delete mode 100644 doc/libc/apple/fn.mprotect.html delete mode 100644 doc/libc/apple/fn.newlocale.html delete mode 100644 doc/libc/apple/fn.openpty.html delete mode 100644 doc/libc/apple/fn.pthread_get_stackaddr_np.html delete mode 100644 doc/libc/apple/fn.pthread_get_stacksize_np.html delete mode 100644 doc/libc/apple/fn.pthread_setname_np.html delete mode 100644 doc/libc/apple/fn.ptrace.html delete mode 100644 doc/libc/apple/fn.querylocale.html delete mode 100644 doc/libc/apple/fn.quotactl.html delete mode 100644 doc/libc/apple/fn.sendfile.html delete mode 100644 doc/libc/apple/fn.sethostname.html delete mode 100644 doc/libc/apple/fn.shm_open.html delete mode 100644 doc/libc/apple/fn.statfs.html delete mode 100644 doc/libc/apple/fn.sysctl.html delete mode 100644 doc/libc/apple/fn.sysctlbyname.html delete mode 100644 doc/libc/apple/fn.sysctlnametomib.html delete mode 100644 doc/libc/apple/fn.uselocale.html delete mode 100644 doc/libc/apple/index.html delete mode 100644 doc/libc/apple/sidebar-items.js delete mode 100644 doc/libc/apple/struct.Dl_info.html delete mode 100644 doc/libc/apple/struct.addrinfo.html delete mode 100644 doc/libc/apple/struct.dirent.html delete mode 100644 doc/libc/apple/struct.dqblk.html delete mode 100644 doc/libc/apple/struct.flock.html delete mode 100644 doc/libc/apple/struct.fstore_t.html delete mode 100644 doc/libc/apple/struct.glob_t.html delete mode 100644 doc/libc/apple/struct.kevent.html delete mode 100644 doc/libc/apple/struct.kevent64_s.html delete mode 100644 doc/libc/apple/struct.lconv.html delete mode 100644 doc/libc/apple/struct.mach_timebase_info.html delete mode 100644 doc/libc/apple/struct.pthread_attr_t.html delete mode 100644 doc/libc/apple/struct.pthread_cond_t.html delete mode 100644 doc/libc/apple/struct.pthread_mutex_t.html delete mode 100644 doc/libc/apple/struct.pthread_mutexattr_t.html delete mode 100644 doc/libc/apple/struct.pthread_rwlock_t.html delete mode 100644 doc/libc/apple/struct.radvisory.html delete mode 100644 doc/libc/apple/struct.sf_hdtr.html delete mode 100644 doc/libc/apple/struct.sigaction.html delete mode 100644 doc/libc/apple/struct.siginfo_t.html delete mode 100644 doc/libc/apple/struct.sockaddr_in.html delete mode 100644 doc/libc/apple/struct.sockaddr_storage.html delete mode 100644 doc/libc/apple/struct.stack_t.html delete mode 100644 doc/libc/apple/struct.stat.html delete mode 100644 doc/libc/apple/struct.statfs.html delete mode 100644 doc/libc/apple/struct.statvfs.html delete mode 100644 doc/libc/apple/struct.termios.html delete mode 100644 doc/libc/apple/type.blksize_t.html delete mode 100644 doc/libc/apple/type.c_long.html delete mode 100644 doc/libc/apple/type.c_ulong.html delete mode 100644 doc/libc/apple/type.clock_t.html delete mode 100644 doc/libc/apple/type.dev_t.html delete mode 100644 doc/libc/apple/type.fsblkcnt_t.html delete mode 100644 doc/libc/apple/type.fsfilcnt_t.html delete mode 100644 doc/libc/apple/type.ino_t.html delete mode 100644 doc/libc/apple/type.mach_timebase_info_data_t.html delete mode 100644 doc/libc/apple/type.mode_t.html delete mode 100644 doc/libc/apple/type.nl_item.html delete mode 100644 doc/libc/apple/type.nlink_t.html delete mode 100644 doc/libc/apple/type.pthread_key_t.html delete mode 100644 doc/libc/apple/type.rlim_t.html delete mode 100644 doc/libc/apple/type.sigset_t.html delete mode 100644 doc/libc/apple/type.speed_t.html delete mode 100644 doc/libc/apple/type.suseconds_t.html delete mode 100644 doc/libc/apple/type.tcflag_t.html delete mode 100644 doc/libc/apple/type.time_t.html delete mode 100644 doc/libc/b64/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/b64/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/b64/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/b64/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/b64/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/b64/index.html delete mode 100644 doc/libc/b64/sidebar-items.js delete mode 100644 doc/libc/b64/struct.pthread_attr_t.html delete mode 100644 doc/libc/b64/type.c_long.html delete mode 100644 doc/libc/b64/type.c_ulong.html delete mode 100644 doc/libc/bsd/apple/b64/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/bsd/apple/b64/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/bsd/apple/b64/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/bsd/apple/b64/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/bsd/apple/b64/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/bsd/apple/b64/index.html delete mode 100644 doc/libc/bsd/apple/b64/sidebar-items.js delete mode 100644 doc/libc/bsd/apple/b64/struct.pthread_attr_t.html delete mode 100644 doc/libc/bsd/apple/b64/type.c_long.html delete mode 100644 doc/libc/bsd/apple/b64/type.c_ulong.html delete mode 100644 doc/libc/bsd/apple/constant.ABDAY_1.html delete mode 100644 doc/libc/bsd/apple/constant.ABDAY_2.html delete mode 100644 doc/libc/bsd/apple/constant.ABDAY_3.html delete mode 100644 doc/libc/bsd/apple/constant.ABDAY_4.html delete mode 100644 doc/libc/bsd/apple/constant.ABDAY_5.html delete mode 100644 doc/libc/bsd/apple/constant.ABDAY_6.html delete mode 100644 doc/libc/bsd/apple/constant.ABDAY_7.html delete mode 100644 doc/libc/bsd/apple/constant.ABMON_1.html delete mode 100644 doc/libc/bsd/apple/constant.ABMON_10.html delete mode 100644 doc/libc/bsd/apple/constant.ABMON_11.html delete mode 100644 doc/libc/bsd/apple/constant.ABMON_12.html delete mode 100644 doc/libc/bsd/apple/constant.ABMON_2.html delete mode 100644 doc/libc/bsd/apple/constant.ABMON_3.html delete mode 100644 doc/libc/bsd/apple/constant.ABMON_4.html delete mode 100644 doc/libc/bsd/apple/constant.ABMON_5.html delete mode 100644 doc/libc/bsd/apple/constant.ABMON_6.html delete mode 100644 doc/libc/bsd/apple/constant.ABMON_7.html delete mode 100644 doc/libc/bsd/apple/constant.ABMON_8.html delete mode 100644 doc/libc/bsd/apple/constant.ABMON_9.html delete mode 100644 doc/libc/bsd/apple/constant.AF_INET.html delete mode 100644 doc/libc/bsd/apple/constant.AF_INET6.html delete mode 100644 doc/libc/bsd/apple/constant.AF_UNIX.html delete mode 100644 doc/libc/bsd/apple/constant.ALT_DIGITS.html delete mode 100644 doc/libc/bsd/apple/constant.AM_STR.html delete mode 100644 doc/libc/bsd/apple/constant.BS0.html delete mode 100644 doc/libc/bsd/apple/constant.BS1.html delete mode 100644 doc/libc/bsd/apple/constant.BUFSIZ.html delete mode 100644 doc/libc/bsd/apple/constant.CODESET.html delete mode 100644 doc/libc/bsd/apple/constant.CR0.html delete mode 100644 doc/libc/bsd/apple/constant.CR1.html delete mode 100644 doc/libc/bsd/apple/constant.CR2.html delete mode 100644 doc/libc/bsd/apple/constant.CR3.html delete mode 100644 doc/libc/bsd/apple/constant.CRNCYSTR.html delete mode 100644 doc/libc/bsd/apple/constant.CRTSCTS.html delete mode 100644 doc/libc/bsd/apple/constant.DAY_1.html delete mode 100644 doc/libc/bsd/apple/constant.DAY_2.html delete mode 100644 doc/libc/bsd/apple/constant.DAY_3.html delete mode 100644 doc/libc/bsd/apple/constant.DAY_4.html delete mode 100644 doc/libc/bsd/apple/constant.DAY_5.html delete mode 100644 doc/libc/bsd/apple/constant.DAY_6.html delete mode 100644 doc/libc/bsd/apple/constant.DAY_7.html delete mode 100644 doc/libc/bsd/apple/constant.D_FMT.html delete mode 100644 doc/libc/bsd/apple/constant.D_MD_ORDER.html delete mode 100644 doc/libc/bsd/apple/constant.D_T_FMT.html delete mode 100644 doc/libc/bsd/apple/constant.E2BIG.html delete mode 100644 doc/libc/bsd/apple/constant.EACCES.html delete mode 100644 doc/libc/bsd/apple/constant.EADDRINUSE.html delete mode 100644 doc/libc/bsd/apple/constant.EADDRNOTAVAIL.html delete mode 100644 doc/libc/bsd/apple/constant.EAFNOSUPPORT.html delete mode 100644 doc/libc/bsd/apple/constant.EAGAIN.html delete mode 100644 doc/libc/bsd/apple/constant.EALREADY.html delete mode 100644 doc/libc/bsd/apple/constant.EAUTH.html delete mode 100644 doc/libc/bsd/apple/constant.EBADARCH.html delete mode 100644 doc/libc/bsd/apple/constant.EBADEXEC.html delete mode 100644 doc/libc/bsd/apple/constant.EBADF.html delete mode 100644 doc/libc/bsd/apple/constant.EBADMACHO.html delete mode 100644 doc/libc/bsd/apple/constant.EBADMSG.html delete mode 100644 doc/libc/bsd/apple/constant.EBADRPC.html delete mode 100644 doc/libc/bsd/apple/constant.EBUSY.html delete mode 100644 doc/libc/bsd/apple/constant.ECANCELED.html delete mode 100644 doc/libc/bsd/apple/constant.ECHILD.html delete mode 100644 doc/libc/bsd/apple/constant.ECONNABORTED.html delete mode 100644 doc/libc/bsd/apple/constant.ECONNREFUSED.html delete mode 100644 doc/libc/bsd/apple/constant.ECONNRESET.html delete mode 100644 doc/libc/bsd/apple/constant.EDEADLK.html delete mode 100644 doc/libc/bsd/apple/constant.EDESTADDRREQ.html delete mode 100644 doc/libc/bsd/apple/constant.EDEVERR.html delete mode 100644 doc/libc/bsd/apple/constant.EDOM.html delete mode 100644 doc/libc/bsd/apple/constant.EDQUOT.html delete mode 100644 doc/libc/bsd/apple/constant.EEXIST.html delete mode 100644 doc/libc/bsd/apple/constant.EFAULT.html delete mode 100644 doc/libc/bsd/apple/constant.EFBIG.html delete mode 100644 doc/libc/bsd/apple/constant.EFTYPE.html delete mode 100644 doc/libc/bsd/apple/constant.EHOSTDOWN.html delete mode 100644 doc/libc/bsd/apple/constant.EHOSTUNREACH.html delete mode 100644 doc/libc/bsd/apple/constant.EIDRM.html delete mode 100644 doc/libc/bsd/apple/constant.EILSEQ.html delete mode 100644 doc/libc/bsd/apple/constant.EINPROGRESS.html delete mode 100644 doc/libc/bsd/apple/constant.EINTR.html delete mode 100644 doc/libc/bsd/apple/constant.EINVAL.html delete mode 100644 doc/libc/bsd/apple/constant.EIO.html delete mode 100644 doc/libc/bsd/apple/constant.EISCONN.html delete mode 100644 doc/libc/bsd/apple/constant.EISDIR.html delete mode 100644 doc/libc/bsd/apple/constant.ELAST.html delete mode 100644 doc/libc/bsd/apple/constant.ELOOP.html delete mode 100644 doc/libc/bsd/apple/constant.EMFILE.html delete mode 100644 doc/libc/bsd/apple/constant.EMLINK.html delete mode 100644 doc/libc/bsd/apple/constant.EMSGSIZE.html delete mode 100644 doc/libc/bsd/apple/constant.EMULTIHOP.html delete mode 100644 doc/libc/bsd/apple/constant.ENAMETOOLONG.html delete mode 100644 doc/libc/bsd/apple/constant.ENEEDAUTH.html delete mode 100644 doc/libc/bsd/apple/constant.ENETDOWN.html delete mode 100644 doc/libc/bsd/apple/constant.ENETRESET.html delete mode 100644 doc/libc/bsd/apple/constant.ENETUNREACH.html delete mode 100644 doc/libc/bsd/apple/constant.ENFILE.html delete mode 100644 doc/libc/bsd/apple/constant.ENOATTR.html delete mode 100644 doc/libc/bsd/apple/constant.ENOBUFS.html delete mode 100644 doc/libc/bsd/apple/constant.ENODATA.html delete mode 100644 doc/libc/bsd/apple/constant.ENODEV.html delete mode 100644 doc/libc/bsd/apple/constant.ENOENT.html delete mode 100644 doc/libc/bsd/apple/constant.ENOEXEC.html delete mode 100644 doc/libc/bsd/apple/constant.ENOLCK.html delete mode 100644 doc/libc/bsd/apple/constant.ENOLINK.html delete mode 100644 doc/libc/bsd/apple/constant.ENOMEM.html delete mode 100644 doc/libc/bsd/apple/constant.ENOMSG.html delete mode 100644 doc/libc/bsd/apple/constant.ENOPOLICY.html delete mode 100644 doc/libc/bsd/apple/constant.ENOPROTOOPT.html delete mode 100644 doc/libc/bsd/apple/constant.ENOSPC.html delete mode 100644 doc/libc/bsd/apple/constant.ENOSR.html delete mode 100644 doc/libc/bsd/apple/constant.ENOSTR.html delete mode 100644 doc/libc/bsd/apple/constant.ENOSYS.html delete mode 100644 doc/libc/bsd/apple/constant.ENOTBLK.html delete mode 100644 doc/libc/bsd/apple/constant.ENOTCONN.html delete mode 100644 doc/libc/bsd/apple/constant.ENOTDIR.html delete mode 100644 doc/libc/bsd/apple/constant.ENOTEMPTY.html delete mode 100644 doc/libc/bsd/apple/constant.ENOTRECOVERABLE.html delete mode 100644 doc/libc/bsd/apple/constant.ENOTSOCK.html delete mode 100644 doc/libc/bsd/apple/constant.ENOTSUP.html delete mode 100644 doc/libc/bsd/apple/constant.ENOTTY.html delete mode 100644 doc/libc/bsd/apple/constant.ENXIO.html delete mode 100644 doc/libc/bsd/apple/constant.EOF.html delete mode 100644 doc/libc/bsd/apple/constant.EOPNOTSUPP.html delete mode 100644 doc/libc/bsd/apple/constant.EOVERFLOW.html delete mode 100644 doc/libc/bsd/apple/constant.EOWNERDEAD.html delete mode 100644 doc/libc/bsd/apple/constant.EPERM.html delete mode 100644 doc/libc/bsd/apple/constant.EPFNOSUPPORT.html delete mode 100644 doc/libc/bsd/apple/constant.EPIPE.html delete mode 100644 doc/libc/bsd/apple/constant.EPROCLIM.html delete mode 100644 doc/libc/bsd/apple/constant.EPROCUNAVAIL.html delete mode 100644 doc/libc/bsd/apple/constant.EPROGMISMATCH.html delete mode 100644 doc/libc/bsd/apple/constant.EPROGUNAVAIL.html delete mode 100644 doc/libc/bsd/apple/constant.EPROTO.html delete mode 100644 doc/libc/bsd/apple/constant.EPROTONOSUPPORT.html delete mode 100644 doc/libc/bsd/apple/constant.EPROTOTYPE.html delete mode 100644 doc/libc/bsd/apple/constant.EPWROFF.html delete mode 100644 doc/libc/bsd/apple/constant.EQFULL.html delete mode 100644 doc/libc/bsd/apple/constant.ERA.html delete mode 100644 doc/libc/bsd/apple/constant.ERANGE.html delete mode 100644 doc/libc/bsd/apple/constant.ERA_D_FMT.html delete mode 100644 doc/libc/bsd/apple/constant.ERA_D_T_FMT.html delete mode 100644 doc/libc/bsd/apple/constant.ERA_T_FMT.html delete mode 100644 doc/libc/bsd/apple/constant.EREMOTE.html delete mode 100644 doc/libc/bsd/apple/constant.EROFS.html delete mode 100644 doc/libc/bsd/apple/constant.ERPCMISMATCH.html delete mode 100644 doc/libc/bsd/apple/constant.ESHLIBVERS.html delete mode 100644 doc/libc/bsd/apple/constant.ESHUTDOWN.html delete mode 100644 doc/libc/bsd/apple/constant.ESOCKTNOSUPPORT.html delete mode 100644 doc/libc/bsd/apple/constant.ESPIPE.html delete mode 100644 doc/libc/bsd/apple/constant.ESRCH.html delete mode 100644 doc/libc/bsd/apple/constant.ESTALE.html delete mode 100644 doc/libc/bsd/apple/constant.ETIME.html delete mode 100644 doc/libc/bsd/apple/constant.ETIMEDOUT.html delete mode 100644 doc/libc/bsd/apple/constant.ETOOMANYREFS.html delete mode 100644 doc/libc/bsd/apple/constant.ETXTBSY.html delete mode 100644 doc/libc/bsd/apple/constant.EUSERS.html delete mode 100644 doc/libc/bsd/apple/constant.EVFILT_AIO.html delete mode 100644 doc/libc/bsd/apple/constant.EVFILT_FS.html delete mode 100644 doc/libc/bsd/apple/constant.EVFILT_MACHPORT.html delete mode 100644 doc/libc/bsd/apple/constant.EVFILT_PROC.html delete mode 100644 doc/libc/bsd/apple/constant.EVFILT_READ.html delete mode 100644 doc/libc/bsd/apple/constant.EVFILT_SIGNAL.html delete mode 100644 doc/libc/bsd/apple/constant.EVFILT_SYSCOUNT.html delete mode 100644 doc/libc/bsd/apple/constant.EVFILT_TIMER.html delete mode 100644 doc/libc/bsd/apple/constant.EVFILT_USER.html delete mode 100644 doc/libc/bsd/apple/constant.EVFILT_VM.html delete mode 100644 doc/libc/bsd/apple/constant.EVFILT_VNODE.html delete mode 100644 doc/libc/bsd/apple/constant.EVFILT_WRITE.html delete mode 100644 doc/libc/bsd/apple/constant.EV_DISPATCH.html delete mode 100644 doc/libc/bsd/apple/constant.EV_FLAG0.html delete mode 100644 doc/libc/bsd/apple/constant.EV_OOBAND.html delete mode 100644 doc/libc/bsd/apple/constant.EV_POLL.html delete mode 100644 doc/libc/bsd/apple/constant.EV_RECEIPT.html delete mode 100644 doc/libc/bsd/apple/constant.EWOULDBLOCK.html delete mode 100644 doc/libc/bsd/apple/constant.EXDEV.html delete mode 100644 doc/libc/bsd/apple/constant.EXIT_FAILURE.html delete mode 100644 doc/libc/bsd/apple/constant.EXIT_SUCCESS.html delete mode 100644 doc/libc/bsd/apple/constant.FD_SETSIZE.html delete mode 100644 doc/libc/bsd/apple/constant.FF0.html delete mode 100644 doc/libc/bsd/apple/constant.FF1.html delete mode 100644 doc/libc/bsd/apple/constant.FILENAME_MAX.html delete mode 100644 doc/libc/bsd/apple/constant.FOPEN_MAX.html delete mode 100644 doc/libc/bsd/apple/constant.F_ALLOCATEALL.html delete mode 100644 doc/libc/bsd/apple/constant.F_ALLOCATECONTIG.html delete mode 100644 doc/libc/bsd/apple/constant.F_DUPFD.html delete mode 100644 doc/libc/bsd/apple/constant.F_DUPFD_CLOEXEC.html delete mode 100644 doc/libc/bsd/apple/constant.F_FREEZE_FS.html delete mode 100644 doc/libc/bsd/apple/constant.F_FULLFSYNC.html delete mode 100644 doc/libc/bsd/apple/constant.F_GETFD.html delete mode 100644 doc/libc/bsd/apple/constant.F_GETFL.html delete mode 100644 doc/libc/bsd/apple/constant.F_GETLK.html delete mode 100644 doc/libc/bsd/apple/constant.F_GETPATH.html delete mode 100644 doc/libc/bsd/apple/constant.F_GLOBAL_NOCACHE.html delete mode 100644 doc/libc/bsd/apple/constant.F_LOCK.html delete mode 100644 doc/libc/bsd/apple/constant.F_NOCACHE.html delete mode 100644 doc/libc/bsd/apple/constant.F_NODIRECT.html delete mode 100644 doc/libc/bsd/apple/constant.F_OK.html delete mode 100644 doc/libc/bsd/apple/constant.F_PEOFPOSMODE.html delete mode 100644 doc/libc/bsd/apple/constant.F_PREALLOCATE.html delete mode 100644 doc/libc/bsd/apple/constant.F_RDADVISE.html delete mode 100644 doc/libc/bsd/apple/constant.F_RDAHEAD.html delete mode 100644 doc/libc/bsd/apple/constant.F_SETFD.html delete mode 100644 doc/libc/bsd/apple/constant.F_SETFL.html delete mode 100644 doc/libc/bsd/apple/constant.F_SETLK.html delete mode 100644 doc/libc/bsd/apple/constant.F_SETLKW.html delete mode 100644 doc/libc/bsd/apple/constant.F_TEST.html delete mode 100644 doc/libc/bsd/apple/constant.F_THAW_FS.html delete mode 100644 doc/libc/bsd/apple/constant.F_TLOCK.html delete mode 100644 doc/libc/bsd/apple/constant.F_ULOCK.html delete mode 100644 doc/libc/bsd/apple/constant.F_VOLPOSMODE.html delete mode 100644 doc/libc/bsd/apple/constant.GLOB_ABORTED.html delete mode 100644 doc/libc/bsd/apple/constant.GLOB_APPEND.html delete mode 100644 doc/libc/bsd/apple/constant.GLOB_DOOFFS.html delete mode 100644 doc/libc/bsd/apple/constant.GLOB_ERR.html delete mode 100644 doc/libc/bsd/apple/constant.GLOB_MARK.html delete mode 100644 doc/libc/bsd/apple/constant.GLOB_NOCHECK.html delete mode 100644 doc/libc/bsd/apple/constant.GLOB_NOESCAPE.html delete mode 100644 doc/libc/bsd/apple/constant.GLOB_NOMATCH.html delete mode 100644 doc/libc/bsd/apple/constant.GLOB_NOSORT.html delete mode 100644 doc/libc/bsd/apple/constant.GLOB_NOSPACE.html delete mode 100644 doc/libc/bsd/apple/constant.HW_AVAILCPU.html delete mode 100644 doc/libc/bsd/apple/constant.IFF_LOOPBACK.html delete mode 100644 doc/libc/bsd/apple/constant.IPPROTO_IP.html delete mode 100644 doc/libc/bsd/apple/constant.IPPROTO_IPV6.html delete mode 100644 doc/libc/bsd/apple/constant.IPPROTO_RAW.html delete mode 100644 doc/libc/bsd/apple/constant.IPPROTO_TCP.html delete mode 100644 doc/libc/bsd/apple/constant.IPV6_JOIN_GROUP.html delete mode 100644 doc/libc/bsd/apple/constant.IPV6_LEAVE_GROUP.html delete mode 100644 doc/libc/bsd/apple/constant.IP_ADD_MEMBERSHIP.html delete mode 100644 doc/libc/bsd/apple/constant.IP_DROP_MEMBERSHIP.html delete mode 100644 doc/libc/bsd/apple/constant.IP_HDRINCL.html delete mode 100644 doc/libc/bsd/apple/constant.IP_MULTICAST_LOOP.html delete mode 100644 doc/libc/bsd/apple/constant.IP_MULTICAST_TTL.html delete mode 100644 doc/libc/bsd/apple/constant.IP_TTL.html delete mode 100644 doc/libc/bsd/apple/constant.IUTF8.html delete mode 100644 doc/libc/bsd/apple/constant.LC_ALL_MASK.html delete mode 100644 doc/libc/bsd/apple/constant.LC_COLLATE_MASK.html delete mode 100644 doc/libc/bsd/apple/constant.LC_CTYPE_MASK.html delete mode 100644 doc/libc/bsd/apple/constant.LC_MESSAGES_MASK.html delete mode 100644 doc/libc/bsd/apple/constant.LC_MONETARY_MASK.html delete mode 100644 doc/libc/bsd/apple/constant.LC_NUMERIC_MASK.html delete mode 100644 doc/libc/bsd/apple/constant.LC_TIME_MASK.html delete mode 100644 doc/libc/bsd/apple/constant.LOCK_EX.html delete mode 100644 doc/libc/bsd/apple/constant.LOCK_NB.html delete mode 100644 doc/libc/bsd/apple/constant.LOCK_SH.html delete mode 100644 doc/libc/bsd/apple/constant.LOCK_UN.html delete mode 100644 doc/libc/bsd/apple/constant.L_tmpnam.html delete mode 100644 doc/libc/bsd/apple/constant.MADV_CAN_REUSE.html delete mode 100644 doc/libc/bsd/apple/constant.MADV_DONTNEED.html delete mode 100644 doc/libc/bsd/apple/constant.MADV_FREE.html delete mode 100644 doc/libc/bsd/apple/constant.MADV_FREE_REUSABLE.html delete mode 100644 doc/libc/bsd/apple/constant.MADV_FREE_REUSE.html delete mode 100644 doc/libc/bsd/apple/constant.MADV_NORMAL.html delete mode 100644 doc/libc/bsd/apple/constant.MADV_RANDOM.html delete mode 100644 doc/libc/bsd/apple/constant.MADV_SEQUENTIAL.html delete mode 100644 doc/libc/bsd/apple/constant.MADV_WILLNEED.html delete mode 100644 doc/libc/bsd/apple/constant.MADV_ZERO_WIRED_PAGES.html delete mode 100644 doc/libc/bsd/apple/constant.MAP_ANON.html delete mode 100644 doc/libc/bsd/apple/constant.MAP_COPY.html delete mode 100644 doc/libc/bsd/apple/constant.MAP_FAILED.html delete mode 100644 doc/libc/bsd/apple/constant.MAP_FILE.html delete mode 100644 doc/libc/bsd/apple/constant.MAP_FIXED.html delete mode 100644 doc/libc/bsd/apple/constant.MAP_HASSEMAPHORE.html delete mode 100644 doc/libc/bsd/apple/constant.MAP_JIT.html delete mode 100644 doc/libc/bsd/apple/constant.MAP_NOCACHE.html delete mode 100644 doc/libc/bsd/apple/constant.MAP_NOEXTEND.html delete mode 100644 doc/libc/bsd/apple/constant.MAP_NORESERVE.html delete mode 100644 doc/libc/bsd/apple/constant.MAP_PRIVATE.html delete mode 100644 doc/libc/bsd/apple/constant.MAP_RENAME.html delete mode 100644 doc/libc/bsd/apple/constant.MAP_SHARED.html delete mode 100644 doc/libc/bsd/apple/constant.MCL_CURRENT.html delete mode 100644 doc/libc/bsd/apple/constant.MCL_FUTURE.html delete mode 100644 doc/libc/bsd/apple/constant.MINCORE_INCORE.html delete mode 100644 doc/libc/bsd/apple/constant.MINCORE_MODIFIED.html delete mode 100644 doc/libc/bsd/apple/constant.MINCORE_MODIFIED_OTHER.html delete mode 100644 doc/libc/bsd/apple/constant.MINCORE_REFERENCED.html delete mode 100644 doc/libc/bsd/apple/constant.MINCORE_REFERENCED_OTHER.html delete mode 100644 doc/libc/bsd/apple/constant.MON_1.html delete mode 100644 doc/libc/bsd/apple/constant.MON_10.html delete mode 100644 doc/libc/bsd/apple/constant.MON_11.html delete mode 100644 doc/libc/bsd/apple/constant.MON_12.html delete mode 100644 doc/libc/bsd/apple/constant.MON_2.html delete mode 100644 doc/libc/bsd/apple/constant.MON_3.html delete mode 100644 doc/libc/bsd/apple/constant.MON_4.html delete mode 100644 doc/libc/bsd/apple/constant.MON_5.html delete mode 100644 doc/libc/bsd/apple/constant.MON_6.html delete mode 100644 doc/libc/bsd/apple/constant.MON_7.html delete mode 100644 doc/libc/bsd/apple/constant.MON_8.html delete mode 100644 doc/libc/bsd/apple/constant.MON_9.html delete mode 100644 doc/libc/bsd/apple/constant.MS_ASYNC.html delete mode 100644 doc/libc/bsd/apple/constant.MS_DEACTIVATE.html delete mode 100644 doc/libc/bsd/apple/constant.MS_INVALIDATE.html delete mode 100644 doc/libc/bsd/apple/constant.MS_KILLPAGES.html delete mode 100644 doc/libc/bsd/apple/constant.MS_SYNC.html delete mode 100644 doc/libc/bsd/apple/constant.NI_MAXHOST.html delete mode 100644 doc/libc/bsd/apple/constant.NL0.html delete mode 100644 doc/libc/bsd/apple/constant.NL1.html delete mode 100644 doc/libc/bsd/apple/constant.NOEXPR.html delete mode 100644 doc/libc/bsd/apple/constant.NOSTR.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_ABSOLUTE.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_EXITSTATUS.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_EXIT_REPARENTED.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_FFAND.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_FFCOPY.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_FFCTRLMASK.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_FFLAGSMASK.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_FFNOP.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_FFOR.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_NONE.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_NSECONDS.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_PCTRLMASK.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_REAP.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_SECONDS.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_SIGNAL.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_TRIGGER.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_USECONDS.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_VM_ERROR.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_VM_PRESSURE.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html delete mode 100644 doc/libc/bsd/apple/constant.NOTE_VM_PRESSURE_TERMINATE.html delete mode 100644 doc/libc/bsd/apple/constant.O_ACCMODE.html delete mode 100644 doc/libc/bsd/apple/constant.O_APPEND.html delete mode 100644 doc/libc/bsd/apple/constant.O_CLOEXEC.html delete mode 100644 doc/libc/bsd/apple/constant.O_CREAT.html delete mode 100644 doc/libc/bsd/apple/constant.O_DIRECTORY.html delete mode 100644 doc/libc/bsd/apple/constant.O_DSYNC.html delete mode 100644 doc/libc/bsd/apple/constant.O_EXCL.html delete mode 100644 doc/libc/bsd/apple/constant.O_NOCTTY.html delete mode 100644 doc/libc/bsd/apple/constant.O_NONBLOCK.html delete mode 100644 doc/libc/bsd/apple/constant.O_RDONLY.html delete mode 100644 doc/libc/bsd/apple/constant.O_RDWR.html delete mode 100644 doc/libc/bsd/apple/constant.O_SYNC.html delete mode 100644 doc/libc/bsd/apple/constant.O_TRUNC.html delete mode 100644 doc/libc/bsd/apple/constant.O_WRONLY.html delete mode 100644 doc/libc/bsd/apple/constant.PM_STR.html delete mode 100644 doc/libc/bsd/apple/constant.POSIX_MADV_DONTNEED.html delete mode 100644 doc/libc/bsd/apple/constant.POSIX_MADV_NORMAL.html delete mode 100644 doc/libc/bsd/apple/constant.POSIX_MADV_RANDOM.html delete mode 100644 doc/libc/bsd/apple/constant.POSIX_MADV_SEQUENTIAL.html delete mode 100644 doc/libc/bsd/apple/constant.POSIX_MADV_WILLNEED.html delete mode 100644 doc/libc/bsd/apple/constant.PROT_EXEC.html delete mode 100644 doc/libc/bsd/apple/constant.PROT_NONE.html delete mode 100644 doc/libc/bsd/apple/constant.PROT_READ.html delete mode 100644 doc/libc/bsd/apple/constant.PROT_WRITE.html delete mode 100644 doc/libc/bsd/apple/constant.PTHREAD_COND_INITIALIZER.html delete mode 100644 doc/libc/bsd/apple/constant.PTHREAD_CREATE_DETACHED.html delete mode 100644 doc/libc/bsd/apple/constant.PTHREAD_CREATE_JOINABLE.html delete mode 100644 doc/libc/bsd/apple/constant.PTHREAD_MUTEX_INITIALIZER.html delete mode 100644 doc/libc/bsd/apple/constant.PTHREAD_MUTEX_RECURSIVE.html delete mode 100644 doc/libc/bsd/apple/constant.PTHREAD_RWLOCK_INITIALIZER.html delete mode 100644 doc/libc/bsd/apple/constant.PTHREAD_STACK_MIN.html delete mode 100644 doc/libc/bsd/apple/constant.Q_GETQUOTA.html delete mode 100644 doc/libc/bsd/apple/constant.Q_SETQUOTA.html delete mode 100644 doc/libc/bsd/apple/constant.RADIXCHAR.html delete mode 100644 doc/libc/bsd/apple/constant.RAND_MAX.html delete mode 100644 doc/libc/bsd/apple/constant.RLIMIT_AS.html delete mode 100644 doc/libc/bsd/apple/constant.RLIMIT_CORE.html delete mode 100644 doc/libc/bsd/apple/constant.RLIMIT_CPU.html delete mode 100644 doc/libc/bsd/apple/constant.RLIMIT_DATA.html delete mode 100644 doc/libc/bsd/apple/constant.RLIMIT_FSIZE.html delete mode 100644 doc/libc/bsd/apple/constant.RLIMIT_MEMLOCK.html delete mode 100644 doc/libc/bsd/apple/constant.RLIMIT_NOFILE.html delete mode 100644 doc/libc/bsd/apple/constant.RLIMIT_NPROC.html delete mode 100644 doc/libc/bsd/apple/constant.RLIMIT_RSS.html delete mode 100644 doc/libc/bsd/apple/constant.RLIMIT_STACK.html delete mode 100644 doc/libc/bsd/apple/constant.RLIM_INFINITY.html delete mode 100644 doc/libc/bsd/apple/constant.RLIM_NLIMITS.html delete mode 100644 doc/libc/bsd/apple/constant.RTLD_FIRST.html delete mode 100644 doc/libc/bsd/apple/constant.RTLD_GLOBAL.html delete mode 100644 doc/libc/bsd/apple/constant.RTLD_LOCAL.html delete mode 100644 doc/libc/bsd/apple/constant.RTLD_NODELETE.html delete mode 100644 doc/libc/bsd/apple/constant.RTLD_NOLOAD.html delete mode 100644 doc/libc/bsd/apple/constant.RUSAGE_CHILDREN.html delete mode 100644 doc/libc/bsd/apple/constant.RUSAGE_SELF.html delete mode 100644 doc/libc/bsd/apple/constant.R_OK.html delete mode 100644 doc/libc/bsd/apple/constant.SEEK_CUR.html delete mode 100644 doc/libc/bsd/apple/constant.SEEK_END.html delete mode 100644 doc/libc/bsd/apple/constant.SEEK_SET.html delete mode 100644 doc/libc/bsd/apple/constant.SHUT_RD.html delete mode 100644 doc/libc/bsd/apple/constant.SHUT_RDWR.html delete mode 100644 doc/libc/bsd/apple/constant.SHUT_WR.html delete mode 100644 doc/libc/bsd/apple/constant.SIGABRT.html delete mode 100644 doc/libc/bsd/apple/constant.SIGALRM.html delete mode 100644 doc/libc/bsd/apple/constant.SIGEMT.html delete mode 100644 doc/libc/bsd/apple/constant.SIGFPE.html delete mode 100644 doc/libc/bsd/apple/constant.SIGHUP.html delete mode 100644 doc/libc/bsd/apple/constant.SIGILL.html delete mode 100644 doc/libc/bsd/apple/constant.SIGINT.html delete mode 100644 doc/libc/bsd/apple/constant.SIGKILL.html delete mode 100644 doc/libc/bsd/apple/constant.SIGPIPE.html delete mode 100644 doc/libc/bsd/apple/constant.SIGQUIT.html delete mode 100644 doc/libc/bsd/apple/constant.SIGSEGV.html delete mode 100644 doc/libc/bsd/apple/constant.SIGSTKSZ.html delete mode 100644 doc/libc/bsd/apple/constant.SIGTERM.html delete mode 100644 doc/libc/bsd/apple/constant.SIGTRAP.html delete mode 100644 doc/libc/bsd/apple/constant.SOCK_DGRAM.html delete mode 100644 doc/libc/bsd/apple/constant.SOCK_RAW.html delete mode 100644 doc/libc/bsd/apple/constant.SOCK_STREAM.html delete mode 100644 doc/libc/bsd/apple/constant.SOL_SOCKET.html delete mode 100644 doc/libc/bsd/apple/constant.SO_ACCEPTCONN.html delete mode 100644 doc/libc/bsd/apple/constant.SO_BROADCAST.html delete mode 100644 doc/libc/bsd/apple/constant.SO_DEBUG.html delete mode 100644 doc/libc/bsd/apple/constant.SO_DONTROUTE.html delete mode 100644 doc/libc/bsd/apple/constant.SO_DONTTRUNC.html delete mode 100644 doc/libc/bsd/apple/constant.SO_ERROR.html delete mode 100644 doc/libc/bsd/apple/constant.SO_KEEPALIVE.html delete mode 100644 doc/libc/bsd/apple/constant.SO_LINGER.html delete mode 100644 doc/libc/bsd/apple/constant.SO_NKE.html delete mode 100644 doc/libc/bsd/apple/constant.SO_NOADDRERR.html delete mode 100644 doc/libc/bsd/apple/constant.SO_NOSIGPIPE.html delete mode 100644 doc/libc/bsd/apple/constant.SO_NREAD.html delete mode 100644 doc/libc/bsd/apple/constant.SO_NWRITE.html delete mode 100644 doc/libc/bsd/apple/constant.SO_OOBINLINE.html delete mode 100644 doc/libc/bsd/apple/constant.SO_RCVBUF.html delete mode 100644 doc/libc/bsd/apple/constant.SO_RCVLOWAT.html delete mode 100644 doc/libc/bsd/apple/constant.SO_RCVTIMEO.html delete mode 100644 doc/libc/bsd/apple/constant.SO_REUSEADDR.html delete mode 100644 doc/libc/bsd/apple/constant.SO_REUSEPORT.html delete mode 100644 doc/libc/bsd/apple/constant.SO_SNDBUF.html delete mode 100644 doc/libc/bsd/apple/constant.SO_SNDLOWAT.html delete mode 100644 doc/libc/bsd/apple/constant.SO_SNDTIMEO.html delete mode 100644 doc/libc/bsd/apple/constant.SO_TYPE.html delete mode 100644 doc/libc/bsd/apple/constant.SO_USELOOPBACK.html delete mode 100644 doc/libc/bsd/apple/constant.SO_WANTMORE.html delete mode 100644 doc/libc/bsd/apple/constant.SO_WANTOOBFLAG.html delete mode 100644 doc/libc/bsd/apple/constant.STDERR_FILENO.html delete mode 100644 doc/libc/bsd/apple/constant.STDIN_FILENO.html delete mode 100644 doc/libc/bsd/apple/constant.STDOUT_FILENO.html delete mode 100644 doc/libc/bsd/apple/constant.ST_NOSUID.html delete mode 100644 doc/libc/bsd/apple/constant.S_IEXEC.html delete mode 100644 doc/libc/bsd/apple/constant.S_IFBLK.html delete mode 100644 doc/libc/bsd/apple/constant.S_IFCHR.html delete mode 100644 doc/libc/bsd/apple/constant.S_IFDIR.html delete mode 100644 doc/libc/bsd/apple/constant.S_IFIFO.html delete mode 100644 doc/libc/bsd/apple/constant.S_IFLNK.html delete mode 100644 doc/libc/bsd/apple/constant.S_IFMT.html delete mode 100644 doc/libc/bsd/apple/constant.S_IFREG.html delete mode 100644 doc/libc/bsd/apple/constant.S_IFSOCK.html delete mode 100644 doc/libc/bsd/apple/constant.S_IREAD.html delete mode 100644 doc/libc/bsd/apple/constant.S_IRGRP.html delete mode 100644 doc/libc/bsd/apple/constant.S_IROTH.html delete mode 100644 doc/libc/bsd/apple/constant.S_IRUSR.html delete mode 100644 doc/libc/bsd/apple/constant.S_IRWXG.html delete mode 100644 doc/libc/bsd/apple/constant.S_IRWXO.html delete mode 100644 doc/libc/bsd/apple/constant.S_IRWXU.html delete mode 100644 doc/libc/bsd/apple/constant.S_IWGRP.html delete mode 100644 doc/libc/bsd/apple/constant.S_IWOTH.html delete mode 100644 doc/libc/bsd/apple/constant.S_IWRITE.html delete mode 100644 doc/libc/bsd/apple/constant.S_IWUSR.html delete mode 100644 doc/libc/bsd/apple/constant.S_IXGRP.html delete mode 100644 doc/libc/bsd/apple/constant.S_IXOTH.html delete mode 100644 doc/libc/bsd/apple/constant.S_IXUSR.html delete mode 100644 doc/libc/bsd/apple/constant.TAB0.html delete mode 100644 doc/libc/bsd/apple/constant.TAB1.html delete mode 100644 doc/libc/bsd/apple/constant.TAB2.html delete mode 100644 doc/libc/bsd/apple/constant.TAB3.html delete mode 100644 doc/libc/bsd/apple/constant.TCP_KEEPALIVE.html delete mode 100644 doc/libc/bsd/apple/constant.TCP_NODELAY.html delete mode 100644 doc/libc/bsd/apple/constant.THOUSEP.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCCBRK.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCCDTR.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCCONS.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCDRAIN.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCDSIMICROCODE.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCEXCL.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCEXT.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCFLUSH.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCGDRAINWAIT.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCGETD.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCGPGRP.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCGWINSZ.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCIXOFF.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCIXON.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCMBIC.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCMBIS.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCMGDTRWAIT.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCMGET.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCMODG.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCMODS.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCMSDTRWAIT.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCMSET.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCM_CAR.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCM_CD.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCM_CTS.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCM_DSR.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCM_DTR.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCM_LE.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCM_RI.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCM_RNG.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCM_RTS.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCM_SR.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCM_ST.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCNOTTY.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCNXCL.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCOUTQ.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCPKT.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCPKT_DATA.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCPKT_DOSTOP.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCPKT_FLUSHREAD.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCPKT_FLUSHWRITE.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCPKT_IOCTL.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCPKT_NOSTOP.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCPKT_START.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCPKT_STOP.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCPTYGNAME.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCPTYGRANT.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCPTYUNLK.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCREMOTE.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCSBRK.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCSCONS.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCSCTTY.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCSDRAINWAIT.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCSDTR.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCSETD.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCSIG.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCSPGRP.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCSTART.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCSTAT.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCSTI.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCSTOP.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCSWINSZ.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/bsd/apple/constant.TIOCUCNTL.html delete mode 100644 doc/libc/bsd/apple/constant.TMP_MAX.html delete mode 100644 doc/libc/bsd/apple/constant.T_FMT.html delete mode 100644 doc/libc/bsd/apple/constant.T_FMT_AMPM.html delete mode 100644 doc/libc/bsd/apple/constant.VT0.html delete mode 100644 doc/libc/bsd/apple/constant.VT1.html delete mode 100644 doc/libc/bsd/apple/constant.W_OK.html delete mode 100644 doc/libc/bsd/apple/constant.X_OK.html delete mode 100644 doc/libc/bsd/apple/constant.YESEXPR.html delete mode 100644 doc/libc/bsd/apple/constant.YESSTR.html delete mode 100644 doc/libc/bsd/apple/constant._IOFBF.html delete mode 100644 doc/libc/bsd/apple/constant._IOLBF.html delete mode 100644 doc/libc/bsd/apple/constant._IONBF.html delete mode 100644 doc/libc/bsd/apple/constant._PC_NAME_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._PTHREAD_COND_SIG_init.html delete mode 100644 doc/libc/bsd/apple/constant._PTHREAD_MUTEX_SIG_init.html delete mode 100644 doc/libc/bsd/apple/constant._PTHREAD_RWLOCK_SIG_init.html delete mode 100644 doc/libc/bsd/apple/constant._RLIMIT_POSIX_FLAG.html delete mode 100644 doc/libc/bsd/apple/constant._SC_2_CHAR_TERM.html delete mode 100644 doc/libc/bsd/apple/constant._SC_2_C_BIND.html delete mode 100644 doc/libc/bsd/apple/constant._SC_2_C_DEV.html delete mode 100644 doc/libc/bsd/apple/constant._SC_2_FORT_DEV.html delete mode 100644 doc/libc/bsd/apple/constant._SC_2_FORT_RUN.html delete mode 100644 doc/libc/bsd/apple/constant._SC_2_LOCALEDEF.html delete mode 100644 doc/libc/bsd/apple/constant._SC_2_PBS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_2_PBS_ACCOUNTING.html delete mode 100644 doc/libc/bsd/apple/constant._SC_2_PBS_CHECKPOINT.html delete mode 100644 doc/libc/bsd/apple/constant._SC_2_PBS_LOCATE.html delete mode 100644 doc/libc/bsd/apple/constant._SC_2_PBS_MESSAGE.html delete mode 100644 doc/libc/bsd/apple/constant._SC_2_PBS_TRACK.html delete mode 100644 doc/libc/bsd/apple/constant._SC_2_SW_DEV.html delete mode 100644 doc/libc/bsd/apple/constant._SC_2_UPE.html delete mode 100644 doc/libc/bsd/apple/constant._SC_2_VERSION.html delete mode 100644 doc/libc/bsd/apple/constant._SC_ADVISORY_INFO.html delete mode 100644 doc/libc/bsd/apple/constant._SC_AIO_LISTIO_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_AIO_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_AIO_PRIO_DELTA_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_ARG_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_ASYNCHRONOUS_IO.html delete mode 100644 doc/libc/bsd/apple/constant._SC_ATEXIT_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_BARRIERS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_BC_BASE_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_BC_DIM_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_BC_SCALE_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_BC_STRING_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_CHILD_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_CLK_TCK.html delete mode 100644 doc/libc/bsd/apple/constant._SC_CLOCK_SELECTION.html delete mode 100644 doc/libc/bsd/apple/constant._SC_COLL_WEIGHTS_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_CPUTIME.html delete mode 100644 doc/libc/bsd/apple/constant._SC_DELAYTIMER_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_EXPR_NEST_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_FILE_LOCKING.html delete mode 100644 doc/libc/bsd/apple/constant._SC_FSYNC.html delete mode 100644 doc/libc/bsd/apple/constant._SC_GETGR_R_SIZE_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_GETPW_R_SIZE_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_HOST_NAME_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_IOV_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_IPV6.html delete mode 100644 doc/libc/bsd/apple/constant._SC_JOB_CONTROL.html delete mode 100644 doc/libc/bsd/apple/constant._SC_LINE_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_LOGIN_NAME_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_MAPPED_FILES.html delete mode 100644 doc/libc/bsd/apple/constant._SC_MEMLOCK.html delete mode 100644 doc/libc/bsd/apple/constant._SC_MEMLOCK_RANGE.html delete mode 100644 doc/libc/bsd/apple/constant._SC_MEMORY_PROTECTION.html delete mode 100644 doc/libc/bsd/apple/constant._SC_MESSAGE_PASSING.html delete mode 100644 doc/libc/bsd/apple/constant._SC_MONOTONIC_CLOCK.html delete mode 100644 doc/libc/bsd/apple/constant._SC_MQ_OPEN_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_MQ_PRIO_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_NGROUPS_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_NPROCESSORS_CONF.html delete mode 100644 doc/libc/bsd/apple/constant._SC_NPROCESSORS_ONLN.html delete mode 100644 doc/libc/bsd/apple/constant._SC_OPEN_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_PAGESIZE.html delete mode 100644 doc/libc/bsd/apple/constant._SC_PAGE_SIZE.html delete mode 100644 doc/libc/bsd/apple/constant._SC_PASS_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_PRIORITIZED_IO.html delete mode 100644 doc/libc/bsd/apple/constant._SC_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/bsd/apple/constant._SC_RAW_SOCKETS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_READER_WRITER_LOCKS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_REALTIME_SIGNALS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_REGEXP.html delete mode 100644 doc/libc/bsd/apple/constant._SC_RE_DUP_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_RTSIG_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_SAVED_IDS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_SEMAPHORES.html delete mode 100644 doc/libc/bsd/apple/constant._SC_SEM_NSEMS_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_SEM_VALUE_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_SHARED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_SHELL.html delete mode 100644 doc/libc/bsd/apple/constant._SC_SIGQUEUE_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_SPAWN.html delete mode 100644 doc/libc/bsd/apple/constant._SC_SPIN_LOCKS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_SPORADIC_SERVER.html delete mode 100644 doc/libc/bsd/apple/constant._SC_SS_REPL_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_STREAM_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_SYMLOOP_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_SYNCHRONIZED_IO.html delete mode 100644 doc/libc/bsd/apple/constant._SC_THREADS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_THREAD_ATTR_STACKADDR.html delete mode 100644 doc/libc/bsd/apple/constant._SC_THREAD_ATTR_STACKSIZE.html delete mode 100644 doc/libc/bsd/apple/constant._SC_THREAD_CPUTIME.html delete mode 100644 doc/libc/bsd/apple/constant._SC_THREAD_DESTRUCTOR_ITERATIONS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_THREAD_KEYS_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_THREAD_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/bsd/apple/constant._SC_THREAD_PRIO_INHERIT.html delete mode 100644 doc/libc/bsd/apple/constant._SC_THREAD_PRIO_PROTECT.html delete mode 100644 doc/libc/bsd/apple/constant._SC_THREAD_PROCESS_SHARED.html delete mode 100644 doc/libc/bsd/apple/constant._SC_THREAD_SAFE_FUNCTIONS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_THREAD_SPORADIC_SERVER.html delete mode 100644 doc/libc/bsd/apple/constant._SC_THREAD_STACK_MIN.html delete mode 100644 doc/libc/bsd/apple/constant._SC_THREAD_THREADS_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_TIMEOUTS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_TIMERS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_TIMER_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_TRACE.html delete mode 100644 doc/libc/bsd/apple/constant._SC_TRACE_EVENT_FILTER.html delete mode 100644 doc/libc/bsd/apple/constant._SC_TRACE_EVENT_NAME_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_TRACE_INHERIT.html delete mode 100644 doc/libc/bsd/apple/constant._SC_TRACE_LOG.html delete mode 100644 doc/libc/bsd/apple/constant._SC_TRACE_NAME_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_TRACE_SYS_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_TRACE_USER_EVENT_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_TTY_NAME_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_TYPED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_TZNAME_MAX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_V6_ILP32_OFF32.html delete mode 100644 doc/libc/bsd/apple/constant._SC_V6_ILP32_OFFBIG.html delete mode 100644 doc/libc/bsd/apple/constant._SC_V6_LP64_OFF64.html delete mode 100644 doc/libc/bsd/apple/constant._SC_V6_LPBIG_OFFBIG.html delete mode 100644 doc/libc/bsd/apple/constant._SC_VERSION.html delete mode 100644 doc/libc/bsd/apple/constant._SC_XBS5_ILP32_OFF32.html delete mode 100644 doc/libc/bsd/apple/constant._SC_XBS5_ILP32_OFFBIG.html delete mode 100644 doc/libc/bsd/apple/constant._SC_XBS5_LP64_OFF64.html delete mode 100644 doc/libc/bsd/apple/constant._SC_XBS5_LPBIG_OFFBIG.html delete mode 100644 doc/libc/bsd/apple/constant._SC_XOPEN_CRYPT.html delete mode 100644 doc/libc/bsd/apple/constant._SC_XOPEN_ENH_I18N.html delete mode 100644 doc/libc/bsd/apple/constant._SC_XOPEN_LEGACY.html delete mode 100644 doc/libc/bsd/apple/constant._SC_XOPEN_REALTIME.html delete mode 100644 doc/libc/bsd/apple/constant._SC_XOPEN_REALTIME_THREADS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_XOPEN_SHM.html delete mode 100644 doc/libc/bsd/apple/constant._SC_XOPEN_STREAMS.html delete mode 100644 doc/libc/bsd/apple/constant._SC_XOPEN_UNIX.html delete mode 100644 doc/libc/bsd/apple/constant._SC_XOPEN_VERSION.html delete mode 100644 doc/libc/bsd/apple/constant._SC_XOPEN_XCU_VERSION.html delete mode 100644 doc/libc/bsd/apple/constant._WSTOPPED.html delete mode 100644 doc/libc/bsd/apple/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/bsd/apple/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/bsd/apple/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/bsd/apple/enum.timezone.html delete mode 100644 doc/libc/bsd/apple/fn.WIFCONTINUED.html delete mode 100644 doc/libc/bsd/apple/fn.WIFSIGNALED.html delete mode 100644 doc/libc/bsd/apple/fn.WIFSTOPPED.html delete mode 100644 doc/libc/bsd/apple/fn.WSTOPSIG.html delete mode 100644 doc/libc/bsd/apple/fn._WSTATUS.html delete mode 100644 doc/libc/bsd/apple/fn.__error.html delete mode 100644 doc/libc/bsd/apple/fn.backtrace.html delete mode 100644 doc/libc/bsd/apple/fn.duplocale.html delete mode 100644 doc/libc/bsd/apple/fn.forkpty.html delete mode 100644 doc/libc/bsd/apple/fn.freelocale.html delete mode 100644 doc/libc/bsd/apple/fn.fstatfs.html delete mode 100644 doc/libc/bsd/apple/fn.getnameinfo.html delete mode 100644 doc/libc/bsd/apple/fn.kevent.html delete mode 100644 doc/libc/bsd/apple/fn.kevent64.html delete mode 100644 doc/libc/bsd/apple/fn.localeconv_l.html delete mode 100644 doc/libc/bsd/apple/fn.mach_absolute_time.html delete mode 100644 doc/libc/bsd/apple/fn.mach_timebase_info.html delete mode 100644 doc/libc/bsd/apple/fn.mincore.html delete mode 100644 doc/libc/bsd/apple/fn.mount.html delete mode 100644 doc/libc/bsd/apple/fn.mprotect.html delete mode 100644 doc/libc/bsd/apple/fn.newlocale.html delete mode 100644 doc/libc/bsd/apple/fn.openpty.html delete mode 100644 doc/libc/bsd/apple/fn.pthread_get_stackaddr_np.html delete mode 100644 doc/libc/bsd/apple/fn.pthread_get_stacksize_np.html delete mode 100644 doc/libc/bsd/apple/fn.pthread_setname_np.html delete mode 100644 doc/libc/bsd/apple/fn.ptrace.html delete mode 100644 doc/libc/bsd/apple/fn.querylocale.html delete mode 100644 doc/libc/bsd/apple/fn.quotactl.html delete mode 100644 doc/libc/bsd/apple/fn.sendfile.html delete mode 100644 doc/libc/bsd/apple/fn.sethostname.html delete mode 100644 doc/libc/bsd/apple/fn.shm_open.html delete mode 100644 doc/libc/bsd/apple/fn.statfs.html delete mode 100644 doc/libc/bsd/apple/fn.sysctl.html delete mode 100644 doc/libc/bsd/apple/fn.sysctlbyname.html delete mode 100644 doc/libc/bsd/apple/fn.sysctlnametomib.html delete mode 100644 doc/libc/bsd/apple/fn.uselocale.html delete mode 100644 doc/libc/bsd/apple/index.html delete mode 100644 doc/libc/bsd/apple/sidebar-items.js delete mode 100644 doc/libc/bsd/apple/struct.Dl_info.html delete mode 100644 doc/libc/bsd/apple/struct.addrinfo.html delete mode 100644 doc/libc/bsd/apple/struct.dirent.html delete mode 100644 doc/libc/bsd/apple/struct.dqblk.html delete mode 100644 doc/libc/bsd/apple/struct.flock.html delete mode 100644 doc/libc/bsd/apple/struct.fstore_t.html delete mode 100644 doc/libc/bsd/apple/struct.glob_t.html delete mode 100644 doc/libc/bsd/apple/struct.kevent.html delete mode 100644 doc/libc/bsd/apple/struct.kevent64_s.html delete mode 100644 doc/libc/bsd/apple/struct.lconv.html delete mode 100644 doc/libc/bsd/apple/struct.mach_timebase_info.html delete mode 100644 doc/libc/bsd/apple/struct.pthread_attr_t.html delete mode 100644 doc/libc/bsd/apple/struct.pthread_cond_t.html delete mode 100644 doc/libc/bsd/apple/struct.pthread_mutex_t.html delete mode 100644 doc/libc/bsd/apple/struct.pthread_mutexattr_t.html delete mode 100644 doc/libc/bsd/apple/struct.pthread_rwlock_t.html delete mode 100644 doc/libc/bsd/apple/struct.radvisory.html delete mode 100644 doc/libc/bsd/apple/struct.sf_hdtr.html delete mode 100644 doc/libc/bsd/apple/struct.sigaction.html delete mode 100644 doc/libc/bsd/apple/struct.siginfo_t.html delete mode 100644 doc/libc/bsd/apple/struct.sockaddr_in.html delete mode 100644 doc/libc/bsd/apple/struct.sockaddr_storage.html delete mode 100644 doc/libc/bsd/apple/struct.stack_t.html delete mode 100644 doc/libc/bsd/apple/struct.stat.html delete mode 100644 doc/libc/bsd/apple/struct.statfs.html delete mode 100644 doc/libc/bsd/apple/struct.statvfs.html delete mode 100644 doc/libc/bsd/apple/struct.termios.html delete mode 100644 doc/libc/bsd/apple/type.blksize_t.html delete mode 100644 doc/libc/bsd/apple/type.c_long.html delete mode 100644 doc/libc/bsd/apple/type.c_ulong.html delete mode 100644 doc/libc/bsd/apple/type.clock_t.html delete mode 100644 doc/libc/bsd/apple/type.dev_t.html delete mode 100644 doc/libc/bsd/apple/type.fsblkcnt_t.html delete mode 100644 doc/libc/bsd/apple/type.fsfilcnt_t.html delete mode 100644 doc/libc/bsd/apple/type.ino_t.html delete mode 100644 doc/libc/bsd/apple/type.mach_timebase_info_data_t.html delete mode 100644 doc/libc/bsd/apple/type.mode_t.html delete mode 100644 doc/libc/bsd/apple/type.nl_item.html delete mode 100644 doc/libc/bsd/apple/type.nlink_t.html delete mode 100644 doc/libc/bsd/apple/type.pthread_key_t.html delete mode 100644 doc/libc/bsd/apple/type.rlim_t.html delete mode 100644 doc/libc/bsd/apple/type.sigset_t.html delete mode 100644 doc/libc/bsd/apple/type.speed_t.html delete mode 100644 doc/libc/bsd/apple/type.suseconds_t.html delete mode 100644 doc/libc/bsd/apple/type.tcflag_t.html delete mode 100644 doc/libc/bsd/apple/type.time_t.html delete mode 100644 doc/libc/bsd/b64/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/bsd/b64/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/bsd/b64/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/bsd/b64/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/bsd/b64/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/bsd/b64/index.html delete mode 100644 doc/libc/bsd/b64/sidebar-items.js delete mode 100644 doc/libc/bsd/b64/struct.pthread_attr_t.html delete mode 100644 doc/libc/bsd/b64/type.c_long.html delete mode 100644 doc/libc/bsd/b64/type.c_ulong.html delete mode 100644 doc/libc/bsd/constant.ABDAY_1.html delete mode 100644 doc/libc/bsd/constant.ABDAY_2.html delete mode 100644 doc/libc/bsd/constant.ABDAY_3.html delete mode 100644 doc/libc/bsd/constant.ABDAY_4.html delete mode 100644 doc/libc/bsd/constant.ABDAY_5.html delete mode 100644 doc/libc/bsd/constant.ABDAY_6.html delete mode 100644 doc/libc/bsd/constant.ABDAY_7.html delete mode 100644 doc/libc/bsd/constant.ABMON_1.html delete mode 100644 doc/libc/bsd/constant.ABMON_10.html delete mode 100644 doc/libc/bsd/constant.ABMON_11.html delete mode 100644 doc/libc/bsd/constant.ABMON_12.html delete mode 100644 doc/libc/bsd/constant.ABMON_2.html delete mode 100644 doc/libc/bsd/constant.ABMON_3.html delete mode 100644 doc/libc/bsd/constant.ABMON_4.html delete mode 100644 doc/libc/bsd/constant.ABMON_5.html delete mode 100644 doc/libc/bsd/constant.ABMON_6.html delete mode 100644 doc/libc/bsd/constant.ABMON_7.html delete mode 100644 doc/libc/bsd/constant.ABMON_8.html delete mode 100644 doc/libc/bsd/constant.ABMON_9.html delete mode 100644 doc/libc/bsd/constant.AF_INET.html delete mode 100644 doc/libc/bsd/constant.AF_INET6.html delete mode 100644 doc/libc/bsd/constant.AF_UNIX.html delete mode 100644 doc/libc/bsd/constant.ALT_DIGITS.html delete mode 100644 doc/libc/bsd/constant.AM_STR.html delete mode 100644 doc/libc/bsd/constant.BRKINT.html delete mode 100644 doc/libc/bsd/constant.BS0.html delete mode 100644 doc/libc/bsd/constant.BS1.html delete mode 100644 doc/libc/bsd/constant.BUFSIZ.html delete mode 100644 doc/libc/bsd/constant.CLOCAL.html delete mode 100644 doc/libc/bsd/constant.CODESET.html delete mode 100644 doc/libc/bsd/constant.CR0.html delete mode 100644 doc/libc/bsd/constant.CR1.html delete mode 100644 doc/libc/bsd/constant.CR2.html delete mode 100644 doc/libc/bsd/constant.CR3.html delete mode 100644 doc/libc/bsd/constant.CREAD.html delete mode 100644 doc/libc/bsd/constant.CRNCYSTR.html delete mode 100644 doc/libc/bsd/constant.CRTSCTS.html delete mode 100644 doc/libc/bsd/constant.CS5.html delete mode 100644 doc/libc/bsd/constant.CS6.html delete mode 100644 doc/libc/bsd/constant.CS7.html delete mode 100644 doc/libc/bsd/constant.CS8.html delete mode 100644 doc/libc/bsd/constant.CSIZE.html delete mode 100644 doc/libc/bsd/constant.CSTOPB.html delete mode 100644 doc/libc/bsd/constant.CTL_HW.html delete mode 100644 doc/libc/bsd/constant.DAY_1.html delete mode 100644 doc/libc/bsd/constant.DAY_2.html delete mode 100644 doc/libc/bsd/constant.DAY_3.html delete mode 100644 doc/libc/bsd/constant.DAY_4.html delete mode 100644 doc/libc/bsd/constant.DAY_5.html delete mode 100644 doc/libc/bsd/constant.DAY_6.html delete mode 100644 doc/libc/bsd/constant.DAY_7.html delete mode 100644 doc/libc/bsd/constant.D_FMT.html delete mode 100644 doc/libc/bsd/constant.D_MD_ORDER.html delete mode 100644 doc/libc/bsd/constant.D_T_FMT.html delete mode 100644 doc/libc/bsd/constant.E2BIG.html delete mode 100644 doc/libc/bsd/constant.EACCES.html delete mode 100644 doc/libc/bsd/constant.EADDRINUSE.html delete mode 100644 doc/libc/bsd/constant.EADDRNOTAVAIL.html delete mode 100644 doc/libc/bsd/constant.EAFNOSUPPORT.html delete mode 100644 doc/libc/bsd/constant.EAGAIN.html delete mode 100644 doc/libc/bsd/constant.EALREADY.html delete mode 100644 doc/libc/bsd/constant.EAUTH.html delete mode 100644 doc/libc/bsd/constant.EBADARCH.html delete mode 100644 doc/libc/bsd/constant.EBADEXEC.html delete mode 100644 doc/libc/bsd/constant.EBADF.html delete mode 100644 doc/libc/bsd/constant.EBADMACHO.html delete mode 100644 doc/libc/bsd/constant.EBADMSG.html delete mode 100644 doc/libc/bsd/constant.EBADRPC.html delete mode 100644 doc/libc/bsd/constant.EBUSY.html delete mode 100644 doc/libc/bsd/constant.ECANCELED.html delete mode 100644 doc/libc/bsd/constant.ECHILD.html delete mode 100644 doc/libc/bsd/constant.ECHO.html delete mode 100644 doc/libc/bsd/constant.ECHOCTL.html delete mode 100644 doc/libc/bsd/constant.ECHOE.html delete mode 100644 doc/libc/bsd/constant.ECHOK.html delete mode 100644 doc/libc/bsd/constant.ECHOKE.html delete mode 100644 doc/libc/bsd/constant.ECHONL.html delete mode 100644 doc/libc/bsd/constant.ECHOPRT.html delete mode 100644 doc/libc/bsd/constant.ECONNABORTED.html delete mode 100644 doc/libc/bsd/constant.ECONNREFUSED.html delete mode 100644 doc/libc/bsd/constant.ECONNRESET.html delete mode 100644 doc/libc/bsd/constant.EDEADLK.html delete mode 100644 doc/libc/bsd/constant.EDESTADDRREQ.html delete mode 100644 doc/libc/bsd/constant.EDEVERR.html delete mode 100644 doc/libc/bsd/constant.EDOM.html delete mode 100644 doc/libc/bsd/constant.EDQUOT.html delete mode 100644 doc/libc/bsd/constant.EEXIST.html delete mode 100644 doc/libc/bsd/constant.EFAULT.html delete mode 100644 doc/libc/bsd/constant.EFBIG.html delete mode 100644 doc/libc/bsd/constant.EFTYPE.html delete mode 100644 doc/libc/bsd/constant.EHOSTDOWN.html delete mode 100644 doc/libc/bsd/constant.EHOSTUNREACH.html delete mode 100644 doc/libc/bsd/constant.EIDRM.html delete mode 100644 doc/libc/bsd/constant.EILSEQ.html delete mode 100644 doc/libc/bsd/constant.EINPROGRESS.html delete mode 100644 doc/libc/bsd/constant.EINTR.html delete mode 100644 doc/libc/bsd/constant.EINVAL.html delete mode 100644 doc/libc/bsd/constant.EIO.html delete mode 100644 doc/libc/bsd/constant.EISCONN.html delete mode 100644 doc/libc/bsd/constant.EISDIR.html delete mode 100644 doc/libc/bsd/constant.ELAST.html delete mode 100644 doc/libc/bsd/constant.ELOOP.html delete mode 100644 doc/libc/bsd/constant.EMFILE.html delete mode 100644 doc/libc/bsd/constant.EMLINK.html delete mode 100644 doc/libc/bsd/constant.EMSGSIZE.html delete mode 100644 doc/libc/bsd/constant.EMULTIHOP.html delete mode 100644 doc/libc/bsd/constant.ENAMETOOLONG.html delete mode 100644 doc/libc/bsd/constant.ENEEDAUTH.html delete mode 100644 doc/libc/bsd/constant.ENETDOWN.html delete mode 100644 doc/libc/bsd/constant.ENETRESET.html delete mode 100644 doc/libc/bsd/constant.ENETUNREACH.html delete mode 100644 doc/libc/bsd/constant.ENFILE.html delete mode 100644 doc/libc/bsd/constant.ENOATTR.html delete mode 100644 doc/libc/bsd/constant.ENOBUFS.html delete mode 100644 doc/libc/bsd/constant.ENODATA.html delete mode 100644 doc/libc/bsd/constant.ENODEV.html delete mode 100644 doc/libc/bsd/constant.ENOENT.html delete mode 100644 doc/libc/bsd/constant.ENOEXEC.html delete mode 100644 doc/libc/bsd/constant.ENOLCK.html delete mode 100644 doc/libc/bsd/constant.ENOLINK.html delete mode 100644 doc/libc/bsd/constant.ENOMEM.html delete mode 100644 doc/libc/bsd/constant.ENOMSG.html delete mode 100644 doc/libc/bsd/constant.ENOPOLICY.html delete mode 100644 doc/libc/bsd/constant.ENOPROTOOPT.html delete mode 100644 doc/libc/bsd/constant.ENOSPC.html delete mode 100644 doc/libc/bsd/constant.ENOSR.html delete mode 100644 doc/libc/bsd/constant.ENOSTR.html delete mode 100644 doc/libc/bsd/constant.ENOSYS.html delete mode 100644 doc/libc/bsd/constant.ENOTBLK.html delete mode 100644 doc/libc/bsd/constant.ENOTCONN.html delete mode 100644 doc/libc/bsd/constant.ENOTDIR.html delete mode 100644 doc/libc/bsd/constant.ENOTEMPTY.html delete mode 100644 doc/libc/bsd/constant.ENOTRECOVERABLE.html delete mode 100644 doc/libc/bsd/constant.ENOTSOCK.html delete mode 100644 doc/libc/bsd/constant.ENOTSUP.html delete mode 100644 doc/libc/bsd/constant.ENOTTY.html delete mode 100644 doc/libc/bsd/constant.ENXIO.html delete mode 100644 doc/libc/bsd/constant.EOF.html delete mode 100644 doc/libc/bsd/constant.EOPNOTSUPP.html delete mode 100644 doc/libc/bsd/constant.EOVERFLOW.html delete mode 100644 doc/libc/bsd/constant.EOWNERDEAD.html delete mode 100644 doc/libc/bsd/constant.EPERM.html delete mode 100644 doc/libc/bsd/constant.EPFNOSUPPORT.html delete mode 100644 doc/libc/bsd/constant.EPIPE.html delete mode 100644 doc/libc/bsd/constant.EPROCLIM.html delete mode 100644 doc/libc/bsd/constant.EPROCUNAVAIL.html delete mode 100644 doc/libc/bsd/constant.EPROGMISMATCH.html delete mode 100644 doc/libc/bsd/constant.EPROGUNAVAIL.html delete mode 100644 doc/libc/bsd/constant.EPROTO.html delete mode 100644 doc/libc/bsd/constant.EPROTONOSUPPORT.html delete mode 100644 doc/libc/bsd/constant.EPROTOTYPE.html delete mode 100644 doc/libc/bsd/constant.EPWROFF.html delete mode 100644 doc/libc/bsd/constant.EQFULL.html delete mode 100644 doc/libc/bsd/constant.ERA.html delete mode 100644 doc/libc/bsd/constant.ERANGE.html delete mode 100644 doc/libc/bsd/constant.ERA_D_FMT.html delete mode 100644 doc/libc/bsd/constant.ERA_D_T_FMT.html delete mode 100644 doc/libc/bsd/constant.ERA_T_FMT.html delete mode 100644 doc/libc/bsd/constant.EREMOTE.html delete mode 100644 doc/libc/bsd/constant.EROFS.html delete mode 100644 doc/libc/bsd/constant.ERPCMISMATCH.html delete mode 100644 doc/libc/bsd/constant.ESHLIBVERS.html delete mode 100644 doc/libc/bsd/constant.ESHUTDOWN.html delete mode 100644 doc/libc/bsd/constant.ESOCKTNOSUPPORT.html delete mode 100644 doc/libc/bsd/constant.ESPIPE.html delete mode 100644 doc/libc/bsd/constant.ESRCH.html delete mode 100644 doc/libc/bsd/constant.ESTALE.html delete mode 100644 doc/libc/bsd/constant.ETIME.html delete mode 100644 doc/libc/bsd/constant.ETIMEDOUT.html delete mode 100644 doc/libc/bsd/constant.ETOOMANYREFS.html delete mode 100644 doc/libc/bsd/constant.ETXTBSY.html delete mode 100644 doc/libc/bsd/constant.EUSERS.html delete mode 100644 doc/libc/bsd/constant.EVFILT_AIO.html delete mode 100644 doc/libc/bsd/constant.EVFILT_FS.html delete mode 100644 doc/libc/bsd/constant.EVFILT_MACHPORT.html delete mode 100644 doc/libc/bsd/constant.EVFILT_PROC.html delete mode 100644 doc/libc/bsd/constant.EVFILT_READ.html delete mode 100644 doc/libc/bsd/constant.EVFILT_SIGNAL.html delete mode 100644 doc/libc/bsd/constant.EVFILT_SYSCOUNT.html delete mode 100644 doc/libc/bsd/constant.EVFILT_TIMER.html delete mode 100644 doc/libc/bsd/constant.EVFILT_USER.html delete mode 100644 doc/libc/bsd/constant.EVFILT_VM.html delete mode 100644 doc/libc/bsd/constant.EVFILT_VNODE.html delete mode 100644 doc/libc/bsd/constant.EVFILT_WRITE.html delete mode 100644 doc/libc/bsd/constant.EV_ADD.html delete mode 100644 doc/libc/bsd/constant.EV_CLEAR.html delete mode 100644 doc/libc/bsd/constant.EV_DELETE.html delete mode 100644 doc/libc/bsd/constant.EV_DISABLE.html delete mode 100644 doc/libc/bsd/constant.EV_DISPATCH.html delete mode 100644 doc/libc/bsd/constant.EV_ENABLE.html delete mode 100644 doc/libc/bsd/constant.EV_EOF.html delete mode 100644 doc/libc/bsd/constant.EV_ERROR.html delete mode 100644 doc/libc/bsd/constant.EV_FLAG0.html delete mode 100644 doc/libc/bsd/constant.EV_FLAG1.html delete mode 100644 doc/libc/bsd/constant.EV_ONESHOT.html delete mode 100644 doc/libc/bsd/constant.EV_OOBAND.html delete mode 100644 doc/libc/bsd/constant.EV_POLL.html delete mode 100644 doc/libc/bsd/constant.EV_RECEIPT.html delete mode 100644 doc/libc/bsd/constant.EV_SYSFLAGS.html delete mode 100644 doc/libc/bsd/constant.EWOULDBLOCK.html delete mode 100644 doc/libc/bsd/constant.EXDEV.html delete mode 100644 doc/libc/bsd/constant.EXIT_FAILURE.html delete mode 100644 doc/libc/bsd/constant.EXIT_SUCCESS.html delete mode 100644 doc/libc/bsd/constant.EXTPROC.html delete mode 100644 doc/libc/bsd/constant.FD_SETSIZE.html delete mode 100644 doc/libc/bsd/constant.FF0.html delete mode 100644 doc/libc/bsd/constant.FF1.html delete mode 100644 doc/libc/bsd/constant.FILENAME_MAX.html delete mode 100644 doc/libc/bsd/constant.FIOCLEX.html delete mode 100644 doc/libc/bsd/constant.FIONBIO.html delete mode 100644 doc/libc/bsd/constant.FLUSHO.html delete mode 100644 doc/libc/bsd/constant.FOPEN_MAX.html delete mode 100644 doc/libc/bsd/constant.F_ALLOCATEALL.html delete mode 100644 doc/libc/bsd/constant.F_ALLOCATECONTIG.html delete mode 100644 doc/libc/bsd/constant.F_DUPFD.html delete mode 100644 doc/libc/bsd/constant.F_DUPFD_CLOEXEC.html delete mode 100644 doc/libc/bsd/constant.F_FREEZE_FS.html delete mode 100644 doc/libc/bsd/constant.F_FULLFSYNC.html delete mode 100644 doc/libc/bsd/constant.F_GETFD.html delete mode 100644 doc/libc/bsd/constant.F_GETFL.html delete mode 100644 doc/libc/bsd/constant.F_GETLK.html delete mode 100644 doc/libc/bsd/constant.F_GETOWN.html delete mode 100644 doc/libc/bsd/constant.F_GETPATH.html delete mode 100644 doc/libc/bsd/constant.F_GLOBAL_NOCACHE.html delete mode 100644 doc/libc/bsd/constant.F_LOCK.html delete mode 100644 doc/libc/bsd/constant.F_NOCACHE.html delete mode 100644 doc/libc/bsd/constant.F_NODIRECT.html delete mode 100644 doc/libc/bsd/constant.F_OK.html delete mode 100644 doc/libc/bsd/constant.F_PEOFPOSMODE.html delete mode 100644 doc/libc/bsd/constant.F_PREALLOCATE.html delete mode 100644 doc/libc/bsd/constant.F_RDADVISE.html delete mode 100644 doc/libc/bsd/constant.F_RDAHEAD.html delete mode 100644 doc/libc/bsd/constant.F_SETFD.html delete mode 100644 doc/libc/bsd/constant.F_SETFL.html delete mode 100644 doc/libc/bsd/constant.F_SETLK.html delete mode 100644 doc/libc/bsd/constant.F_SETLKW.html delete mode 100644 doc/libc/bsd/constant.F_SETOWN.html delete mode 100644 doc/libc/bsd/constant.F_TEST.html delete mode 100644 doc/libc/bsd/constant.F_THAW_FS.html delete mode 100644 doc/libc/bsd/constant.F_TLOCK.html delete mode 100644 doc/libc/bsd/constant.F_ULOCK.html delete mode 100644 doc/libc/bsd/constant.F_VOLPOSMODE.html delete mode 100644 doc/libc/bsd/constant.GLOB_ABORTED.html delete mode 100644 doc/libc/bsd/constant.GLOB_APPEND.html delete mode 100644 doc/libc/bsd/constant.GLOB_DOOFFS.html delete mode 100644 doc/libc/bsd/constant.GLOB_ERR.html delete mode 100644 doc/libc/bsd/constant.GLOB_MARK.html delete mode 100644 doc/libc/bsd/constant.GLOB_NOCHECK.html delete mode 100644 doc/libc/bsd/constant.GLOB_NOESCAPE.html delete mode 100644 doc/libc/bsd/constant.GLOB_NOMATCH.html delete mode 100644 doc/libc/bsd/constant.GLOB_NOSORT.html delete mode 100644 doc/libc/bsd/constant.GLOB_NOSPACE.html delete mode 100644 doc/libc/bsd/constant.HUPCL.html delete mode 100644 doc/libc/bsd/constant.HW_AVAILCPU.html delete mode 100644 doc/libc/bsd/constant.HW_NCPU.html delete mode 100644 doc/libc/bsd/constant.ICANON.html delete mode 100644 doc/libc/bsd/constant.ICRNL.html delete mode 100644 doc/libc/bsd/constant.IEXTEN.html delete mode 100644 doc/libc/bsd/constant.IFF_LOOPBACK.html delete mode 100644 doc/libc/bsd/constant.IGNBRK.html delete mode 100644 doc/libc/bsd/constant.IGNCR.html delete mode 100644 doc/libc/bsd/constant.IGNPAR.html delete mode 100644 doc/libc/bsd/constant.IMAXBEL.html delete mode 100644 doc/libc/bsd/constant.INLCR.html delete mode 100644 doc/libc/bsd/constant.INPCK.html delete mode 100644 doc/libc/bsd/constant.IPPROTO_IP.html delete mode 100644 doc/libc/bsd/constant.IPPROTO_IPV6.html delete mode 100644 doc/libc/bsd/constant.IPPROTO_RAW.html delete mode 100644 doc/libc/bsd/constant.IPPROTO_TCP.html delete mode 100644 doc/libc/bsd/constant.IPV6_JOIN_GROUP.html delete mode 100644 doc/libc/bsd/constant.IPV6_LEAVE_GROUP.html delete mode 100644 doc/libc/bsd/constant.IPV6_MULTICAST_LOOP.html delete mode 100644 doc/libc/bsd/constant.IPV6_V6ONLY.html delete mode 100644 doc/libc/bsd/constant.IP_ADD_MEMBERSHIP.html delete mode 100644 doc/libc/bsd/constant.IP_DROP_MEMBERSHIP.html delete mode 100644 doc/libc/bsd/constant.IP_HDRINCL.html delete mode 100644 doc/libc/bsd/constant.IP_MULTICAST_LOOP.html delete mode 100644 doc/libc/bsd/constant.IP_MULTICAST_TTL.html delete mode 100644 doc/libc/bsd/constant.IP_TTL.html delete mode 100644 doc/libc/bsd/constant.ISIG.html delete mode 100644 doc/libc/bsd/constant.ISTRIP.html delete mode 100644 doc/libc/bsd/constant.IUTF8.html delete mode 100644 doc/libc/bsd/constant.IXANY.html delete mode 100644 doc/libc/bsd/constant.IXOFF.html delete mode 100644 doc/libc/bsd/constant.IXON.html delete mode 100644 doc/libc/bsd/constant.LC_ALL.html delete mode 100644 doc/libc/bsd/constant.LC_ALL_MASK.html delete mode 100644 doc/libc/bsd/constant.LC_COLLATE.html delete mode 100644 doc/libc/bsd/constant.LC_COLLATE_MASK.html delete mode 100644 doc/libc/bsd/constant.LC_CTYPE.html delete mode 100644 doc/libc/bsd/constant.LC_CTYPE_MASK.html delete mode 100644 doc/libc/bsd/constant.LC_MESSAGES.html delete mode 100644 doc/libc/bsd/constant.LC_MESSAGES_MASK.html delete mode 100644 doc/libc/bsd/constant.LC_MONETARY.html delete mode 100644 doc/libc/bsd/constant.LC_MONETARY_MASK.html delete mode 100644 doc/libc/bsd/constant.LC_NUMERIC.html delete mode 100644 doc/libc/bsd/constant.LC_NUMERIC_MASK.html delete mode 100644 doc/libc/bsd/constant.LC_TIME.html delete mode 100644 doc/libc/bsd/constant.LC_TIME_MASK.html delete mode 100644 doc/libc/bsd/constant.LOCK_EX.html delete mode 100644 doc/libc/bsd/constant.LOCK_NB.html delete mode 100644 doc/libc/bsd/constant.LOCK_SH.html delete mode 100644 doc/libc/bsd/constant.LOCK_UN.html delete mode 100644 doc/libc/bsd/constant.L_tmpnam.html delete mode 100644 doc/libc/bsd/constant.MADV_CAN_REUSE.html delete mode 100644 doc/libc/bsd/constant.MADV_DONTNEED.html delete mode 100644 doc/libc/bsd/constant.MADV_FREE.html delete mode 100644 doc/libc/bsd/constant.MADV_FREE_REUSABLE.html delete mode 100644 doc/libc/bsd/constant.MADV_FREE_REUSE.html delete mode 100644 doc/libc/bsd/constant.MADV_NORMAL.html delete mode 100644 doc/libc/bsd/constant.MADV_RANDOM.html delete mode 100644 doc/libc/bsd/constant.MADV_SEQUENTIAL.html delete mode 100644 doc/libc/bsd/constant.MADV_WILLNEED.html delete mode 100644 doc/libc/bsd/constant.MADV_ZERO_WIRED_PAGES.html delete mode 100644 doc/libc/bsd/constant.MAP_ANON.html delete mode 100644 doc/libc/bsd/constant.MAP_COPY.html delete mode 100644 doc/libc/bsd/constant.MAP_FAILED.html delete mode 100644 doc/libc/bsd/constant.MAP_FILE.html delete mode 100644 doc/libc/bsd/constant.MAP_FIXED.html delete mode 100644 doc/libc/bsd/constant.MAP_HASSEMAPHORE.html delete mode 100644 doc/libc/bsd/constant.MAP_JIT.html delete mode 100644 doc/libc/bsd/constant.MAP_NOCACHE.html delete mode 100644 doc/libc/bsd/constant.MAP_NOEXTEND.html delete mode 100644 doc/libc/bsd/constant.MAP_NORESERVE.html delete mode 100644 doc/libc/bsd/constant.MAP_PRIVATE.html delete mode 100644 doc/libc/bsd/constant.MAP_RENAME.html delete mode 100644 doc/libc/bsd/constant.MAP_SHARED.html delete mode 100644 doc/libc/bsd/constant.MCL_CURRENT.html delete mode 100644 doc/libc/bsd/constant.MCL_FUTURE.html delete mode 100644 doc/libc/bsd/constant.MINCORE_INCORE.html delete mode 100644 doc/libc/bsd/constant.MINCORE_MODIFIED.html delete mode 100644 doc/libc/bsd/constant.MINCORE_MODIFIED_OTHER.html delete mode 100644 doc/libc/bsd/constant.MINCORE_REFERENCED.html delete mode 100644 doc/libc/bsd/constant.MINCORE_REFERENCED_OTHER.html delete mode 100644 doc/libc/bsd/constant.MNT_FORCE.html delete mode 100644 doc/libc/bsd/constant.MON_1.html delete mode 100644 doc/libc/bsd/constant.MON_10.html delete mode 100644 doc/libc/bsd/constant.MON_11.html delete mode 100644 doc/libc/bsd/constant.MON_12.html delete mode 100644 doc/libc/bsd/constant.MON_2.html delete mode 100644 doc/libc/bsd/constant.MON_3.html delete mode 100644 doc/libc/bsd/constant.MON_4.html delete mode 100644 doc/libc/bsd/constant.MON_5.html delete mode 100644 doc/libc/bsd/constant.MON_6.html delete mode 100644 doc/libc/bsd/constant.MON_7.html delete mode 100644 doc/libc/bsd/constant.MON_8.html delete mode 100644 doc/libc/bsd/constant.MON_9.html delete mode 100644 doc/libc/bsd/constant.MS_ASYNC.html delete mode 100644 doc/libc/bsd/constant.MS_DEACTIVATE.html delete mode 100644 doc/libc/bsd/constant.MS_INVALIDATE.html delete mode 100644 doc/libc/bsd/constant.MS_KILLPAGES.html delete mode 100644 doc/libc/bsd/constant.MS_SYNC.html delete mode 100644 doc/libc/bsd/constant.NCCS.html delete mode 100644 doc/libc/bsd/constant.NI_MAXHOST.html delete mode 100644 doc/libc/bsd/constant.NL0.html delete mode 100644 doc/libc/bsd/constant.NL1.html delete mode 100644 doc/libc/bsd/constant.NOEXPR.html delete mode 100644 doc/libc/bsd/constant.NOFLSH.html delete mode 100644 doc/libc/bsd/constant.NOSTR.html delete mode 100644 doc/libc/bsd/constant.NOTE_ABSOLUTE.html delete mode 100644 doc/libc/bsd/constant.NOTE_ATTRIB.html delete mode 100644 doc/libc/bsd/constant.NOTE_CHILD.html delete mode 100644 doc/libc/bsd/constant.NOTE_DELETE.html delete mode 100644 doc/libc/bsd/constant.NOTE_EXEC.html delete mode 100644 doc/libc/bsd/constant.NOTE_EXIT.html delete mode 100644 doc/libc/bsd/constant.NOTE_EXITSTATUS.html delete mode 100644 doc/libc/bsd/constant.NOTE_EXIT_REPARENTED.html delete mode 100644 doc/libc/bsd/constant.NOTE_EXTEND.html delete mode 100644 doc/libc/bsd/constant.NOTE_FFAND.html delete mode 100644 doc/libc/bsd/constant.NOTE_FFCOPY.html delete mode 100644 doc/libc/bsd/constant.NOTE_FFCTRLMASK.html delete mode 100644 doc/libc/bsd/constant.NOTE_FFLAGSMASK.html delete mode 100644 doc/libc/bsd/constant.NOTE_FFNOP.html delete mode 100644 doc/libc/bsd/constant.NOTE_FFOR.html delete mode 100644 doc/libc/bsd/constant.NOTE_FORK.html delete mode 100644 doc/libc/bsd/constant.NOTE_LINK.html delete mode 100644 doc/libc/bsd/constant.NOTE_LOWAT.html delete mode 100644 doc/libc/bsd/constant.NOTE_NONE.html delete mode 100644 doc/libc/bsd/constant.NOTE_NSECONDS.html delete mode 100644 doc/libc/bsd/constant.NOTE_PCTRLMASK.html delete mode 100644 doc/libc/bsd/constant.NOTE_PDATAMASK.html delete mode 100644 doc/libc/bsd/constant.NOTE_REAP.html delete mode 100644 doc/libc/bsd/constant.NOTE_RENAME.html delete mode 100644 doc/libc/bsd/constant.NOTE_REVOKE.html delete mode 100644 doc/libc/bsd/constant.NOTE_SECONDS.html delete mode 100644 doc/libc/bsd/constant.NOTE_SIGNAL.html delete mode 100644 doc/libc/bsd/constant.NOTE_TRACK.html delete mode 100644 doc/libc/bsd/constant.NOTE_TRACKERR.html delete mode 100644 doc/libc/bsd/constant.NOTE_TRIGGER.html delete mode 100644 doc/libc/bsd/constant.NOTE_USECONDS.html delete mode 100644 doc/libc/bsd/constant.NOTE_VM_ERROR.html delete mode 100644 doc/libc/bsd/constant.NOTE_VM_PRESSURE.html delete mode 100644 doc/libc/bsd/constant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html delete mode 100644 doc/libc/bsd/constant.NOTE_VM_PRESSURE_TERMINATE.html delete mode 100644 doc/libc/bsd/constant.NOTE_WRITE.html delete mode 100644 doc/libc/bsd/constant.ONLCR.html delete mode 100644 doc/libc/bsd/constant.OPOST.html delete mode 100644 doc/libc/bsd/constant.O_ACCMODE.html delete mode 100644 doc/libc/bsd/constant.O_APPEND.html delete mode 100644 doc/libc/bsd/constant.O_ASYNC.html delete mode 100644 doc/libc/bsd/constant.O_CLOEXEC.html delete mode 100644 doc/libc/bsd/constant.O_CREAT.html delete mode 100644 doc/libc/bsd/constant.O_DIRECTORY.html delete mode 100644 doc/libc/bsd/constant.O_DSYNC.html delete mode 100644 doc/libc/bsd/constant.O_EXCL.html delete mode 100644 doc/libc/bsd/constant.O_FSYNC.html delete mode 100644 doc/libc/bsd/constant.O_NDELAY.html delete mode 100644 doc/libc/bsd/constant.O_NOCTTY.html delete mode 100644 doc/libc/bsd/constant.O_NOFOLLOW.html delete mode 100644 doc/libc/bsd/constant.O_NONBLOCK.html delete mode 100644 doc/libc/bsd/constant.O_RDONLY.html delete mode 100644 doc/libc/bsd/constant.O_RDWR.html delete mode 100644 doc/libc/bsd/constant.O_SYNC.html delete mode 100644 doc/libc/bsd/constant.O_TRUNC.html delete mode 100644 doc/libc/bsd/constant.O_WRONLY.html delete mode 100644 doc/libc/bsd/constant.PARENB.html delete mode 100644 doc/libc/bsd/constant.PARMRK.html delete mode 100644 doc/libc/bsd/constant.PARODD.html delete mode 100644 doc/libc/bsd/constant.PATH_MAX.html delete mode 100644 doc/libc/bsd/constant.PENDIN.html delete mode 100644 doc/libc/bsd/constant.PM_STR.html delete mode 100644 doc/libc/bsd/constant.POSIX_MADV_DONTNEED.html delete mode 100644 doc/libc/bsd/constant.POSIX_MADV_NORMAL.html delete mode 100644 doc/libc/bsd/constant.POSIX_MADV_RANDOM.html delete mode 100644 doc/libc/bsd/constant.POSIX_MADV_SEQUENTIAL.html delete mode 100644 doc/libc/bsd/constant.POSIX_MADV_WILLNEED.html delete mode 100644 doc/libc/bsd/constant.PROT_EXEC.html delete mode 100644 doc/libc/bsd/constant.PROT_NONE.html delete mode 100644 doc/libc/bsd/constant.PROT_READ.html delete mode 100644 doc/libc/bsd/constant.PROT_WRITE.html delete mode 100644 doc/libc/bsd/constant.PTHREAD_COND_INITIALIZER.html delete mode 100644 doc/libc/bsd/constant.PTHREAD_CREATE_DETACHED.html delete mode 100644 doc/libc/bsd/constant.PTHREAD_CREATE_JOINABLE.html delete mode 100644 doc/libc/bsd/constant.PTHREAD_MUTEX_INITIALIZER.html delete mode 100644 doc/libc/bsd/constant.PTHREAD_MUTEX_RECURSIVE.html delete mode 100644 doc/libc/bsd/constant.PTHREAD_RWLOCK_INITIALIZER.html delete mode 100644 doc/libc/bsd/constant.PTHREAD_STACK_MIN.html delete mode 100644 doc/libc/bsd/constant.Q_GETQUOTA.html delete mode 100644 doc/libc/bsd/constant.Q_QUOTAOFF.html delete mode 100644 doc/libc/bsd/constant.Q_QUOTAON.html delete mode 100644 doc/libc/bsd/constant.Q_SETQUOTA.html delete mode 100644 doc/libc/bsd/constant.Q_SYNC.html delete mode 100644 doc/libc/bsd/constant.RADIXCHAR.html delete mode 100644 doc/libc/bsd/constant.RAND_MAX.html delete mode 100644 doc/libc/bsd/constant.RLIMIT_AS.html delete mode 100644 doc/libc/bsd/constant.RLIMIT_CORE.html delete mode 100644 doc/libc/bsd/constant.RLIMIT_CPU.html delete mode 100644 doc/libc/bsd/constant.RLIMIT_DATA.html delete mode 100644 doc/libc/bsd/constant.RLIMIT_FSIZE.html delete mode 100644 doc/libc/bsd/constant.RLIMIT_MEMLOCK.html delete mode 100644 doc/libc/bsd/constant.RLIMIT_NOFILE.html delete mode 100644 doc/libc/bsd/constant.RLIMIT_NPROC.html delete mode 100644 doc/libc/bsd/constant.RLIMIT_RSS.html delete mode 100644 doc/libc/bsd/constant.RLIMIT_STACK.html delete mode 100644 doc/libc/bsd/constant.RLIM_INFINITY.html delete mode 100644 doc/libc/bsd/constant.RLIM_NLIMITS.html delete mode 100644 doc/libc/bsd/constant.RTLD_DEFAULT.html delete mode 100644 doc/libc/bsd/constant.RTLD_FIRST.html delete mode 100644 doc/libc/bsd/constant.RTLD_GLOBAL.html delete mode 100644 doc/libc/bsd/constant.RTLD_LOCAL.html delete mode 100644 doc/libc/bsd/constant.RTLD_NODELETE.html delete mode 100644 doc/libc/bsd/constant.RTLD_NOLOAD.html delete mode 100644 doc/libc/bsd/constant.RTLD_NOW.html delete mode 100644 doc/libc/bsd/constant.RUSAGE_CHILDREN.html delete mode 100644 doc/libc/bsd/constant.RUSAGE_SELF.html delete mode 100644 doc/libc/bsd/constant.R_OK.html delete mode 100644 doc/libc/bsd/constant.SA_NOCLDSTOP.html delete mode 100644 doc/libc/bsd/constant.SA_NOCLDWAIT.html delete mode 100644 doc/libc/bsd/constant.SA_NODEFER.html delete mode 100644 doc/libc/bsd/constant.SA_ONSTACK.html delete mode 100644 doc/libc/bsd/constant.SA_RESETHAND.html delete mode 100644 doc/libc/bsd/constant.SA_RESTART.html delete mode 100644 doc/libc/bsd/constant.SA_SIGINFO.html delete mode 100644 doc/libc/bsd/constant.SEEK_CUR.html delete mode 100644 doc/libc/bsd/constant.SEEK_END.html delete mode 100644 doc/libc/bsd/constant.SEEK_SET.html delete mode 100644 doc/libc/bsd/constant.SHUT_RD.html delete mode 100644 doc/libc/bsd/constant.SHUT_RDWR.html delete mode 100644 doc/libc/bsd/constant.SHUT_WR.html delete mode 100644 doc/libc/bsd/constant.SIGABRT.html delete mode 100644 doc/libc/bsd/constant.SIGALRM.html delete mode 100644 doc/libc/bsd/constant.SIGBUS.html delete mode 100644 doc/libc/bsd/constant.SIGCHLD.html delete mode 100644 doc/libc/bsd/constant.SIGCONT.html delete mode 100644 doc/libc/bsd/constant.SIGEMT.html delete mode 100644 doc/libc/bsd/constant.SIGFPE.html delete mode 100644 doc/libc/bsd/constant.SIGHUP.html delete mode 100644 doc/libc/bsd/constant.SIGILL.html delete mode 100644 doc/libc/bsd/constant.SIGINFO.html delete mode 100644 doc/libc/bsd/constant.SIGINT.html delete mode 100644 doc/libc/bsd/constant.SIGIO.html delete mode 100644 doc/libc/bsd/constant.SIGKILL.html delete mode 100644 doc/libc/bsd/constant.SIGPIPE.html delete mode 100644 doc/libc/bsd/constant.SIGPROF.html delete mode 100644 doc/libc/bsd/constant.SIGQUIT.html delete mode 100644 doc/libc/bsd/constant.SIGSEGV.html delete mode 100644 doc/libc/bsd/constant.SIGSTKSZ.html delete mode 100644 doc/libc/bsd/constant.SIGSTOP.html delete mode 100644 doc/libc/bsd/constant.SIGSYS.html delete mode 100644 doc/libc/bsd/constant.SIGTERM.html delete mode 100644 doc/libc/bsd/constant.SIGTRAP.html delete mode 100644 doc/libc/bsd/constant.SIGTSTP.html delete mode 100644 doc/libc/bsd/constant.SIGTTIN.html delete mode 100644 doc/libc/bsd/constant.SIGTTOU.html delete mode 100644 doc/libc/bsd/constant.SIGURG.html delete mode 100644 doc/libc/bsd/constant.SIGUSR1.html delete mode 100644 doc/libc/bsd/constant.SIGUSR2.html delete mode 100644 doc/libc/bsd/constant.SIGVTALRM.html delete mode 100644 doc/libc/bsd/constant.SIGWINCH.html delete mode 100644 doc/libc/bsd/constant.SIGXCPU.html delete mode 100644 doc/libc/bsd/constant.SIGXFSZ.html delete mode 100644 doc/libc/bsd/constant.SIG_BLOCK.html delete mode 100644 doc/libc/bsd/constant.SIG_SETMASK.html delete mode 100644 doc/libc/bsd/constant.SIG_UNBLOCK.html delete mode 100644 doc/libc/bsd/constant.SOCK_DGRAM.html delete mode 100644 doc/libc/bsd/constant.SOCK_RAW.html delete mode 100644 doc/libc/bsd/constant.SOCK_STREAM.html delete mode 100644 doc/libc/bsd/constant.SOL_SOCKET.html delete mode 100644 doc/libc/bsd/constant.SO_ACCEPTCONN.html delete mode 100644 doc/libc/bsd/constant.SO_BROADCAST.html delete mode 100644 doc/libc/bsd/constant.SO_DEBUG.html delete mode 100644 doc/libc/bsd/constant.SO_DONTROUTE.html delete mode 100644 doc/libc/bsd/constant.SO_DONTTRUNC.html delete mode 100644 doc/libc/bsd/constant.SO_ERROR.html delete mode 100644 doc/libc/bsd/constant.SO_KEEPALIVE.html delete mode 100644 doc/libc/bsd/constant.SO_LINGER.html delete mode 100644 doc/libc/bsd/constant.SO_NKE.html delete mode 100644 doc/libc/bsd/constant.SO_NOADDRERR.html delete mode 100644 doc/libc/bsd/constant.SO_NOSIGPIPE.html delete mode 100644 doc/libc/bsd/constant.SO_NREAD.html delete mode 100644 doc/libc/bsd/constant.SO_NWRITE.html delete mode 100644 doc/libc/bsd/constant.SO_OOBINLINE.html delete mode 100644 doc/libc/bsd/constant.SO_RCVBUF.html delete mode 100644 doc/libc/bsd/constant.SO_RCVLOWAT.html delete mode 100644 doc/libc/bsd/constant.SO_RCVTIMEO.html delete mode 100644 doc/libc/bsd/constant.SO_REUSEADDR.html delete mode 100644 doc/libc/bsd/constant.SO_REUSEPORT.html delete mode 100644 doc/libc/bsd/constant.SO_SNDBUF.html delete mode 100644 doc/libc/bsd/constant.SO_SNDLOWAT.html delete mode 100644 doc/libc/bsd/constant.SO_SNDTIMEO.html delete mode 100644 doc/libc/bsd/constant.SO_TYPE.html delete mode 100644 doc/libc/bsd/constant.SO_USELOOPBACK.html delete mode 100644 doc/libc/bsd/constant.SO_WANTMORE.html delete mode 100644 doc/libc/bsd/constant.SO_WANTOOBFLAG.html delete mode 100644 doc/libc/bsd/constant.SS_DISABLE.html delete mode 100644 doc/libc/bsd/constant.SS_ONSTACK.html delete mode 100644 doc/libc/bsd/constant.STDERR_FILENO.html delete mode 100644 doc/libc/bsd/constant.STDIN_FILENO.html delete mode 100644 doc/libc/bsd/constant.STDOUT_FILENO.html delete mode 100644 doc/libc/bsd/constant.ST_NOSUID.html delete mode 100644 doc/libc/bsd/constant.ST_RDONLY.html delete mode 100644 doc/libc/bsd/constant.S_IEXEC.html delete mode 100644 doc/libc/bsd/constant.S_IFBLK.html delete mode 100644 doc/libc/bsd/constant.S_IFCHR.html delete mode 100644 doc/libc/bsd/constant.S_IFDIR.html delete mode 100644 doc/libc/bsd/constant.S_IFIFO.html delete mode 100644 doc/libc/bsd/constant.S_IFLNK.html delete mode 100644 doc/libc/bsd/constant.S_IFMT.html delete mode 100644 doc/libc/bsd/constant.S_IFREG.html delete mode 100644 doc/libc/bsd/constant.S_IFSOCK.html delete mode 100644 doc/libc/bsd/constant.S_IREAD.html delete mode 100644 doc/libc/bsd/constant.S_IRGRP.html delete mode 100644 doc/libc/bsd/constant.S_IROTH.html delete mode 100644 doc/libc/bsd/constant.S_IRUSR.html delete mode 100644 doc/libc/bsd/constant.S_IRWXG.html delete mode 100644 doc/libc/bsd/constant.S_IRWXO.html delete mode 100644 doc/libc/bsd/constant.S_IRWXU.html delete mode 100644 doc/libc/bsd/constant.S_IWGRP.html delete mode 100644 doc/libc/bsd/constant.S_IWOTH.html delete mode 100644 doc/libc/bsd/constant.S_IWRITE.html delete mode 100644 doc/libc/bsd/constant.S_IWUSR.html delete mode 100644 doc/libc/bsd/constant.S_IXGRP.html delete mode 100644 doc/libc/bsd/constant.S_IXOTH.html delete mode 100644 doc/libc/bsd/constant.S_IXUSR.html delete mode 100644 doc/libc/bsd/constant.TAB0.html delete mode 100644 doc/libc/bsd/constant.TAB1.html delete mode 100644 doc/libc/bsd/constant.TAB2.html delete mode 100644 doc/libc/bsd/constant.TAB3.html delete mode 100644 doc/libc/bsd/constant.TCIFLUSH.html delete mode 100644 doc/libc/bsd/constant.TCIOFF.html delete mode 100644 doc/libc/bsd/constant.TCIOFLUSH.html delete mode 100644 doc/libc/bsd/constant.TCION.html delete mode 100644 doc/libc/bsd/constant.TCOFLUSH.html delete mode 100644 doc/libc/bsd/constant.TCOOFF.html delete mode 100644 doc/libc/bsd/constant.TCOON.html delete mode 100644 doc/libc/bsd/constant.TCP_KEEPALIVE.html delete mode 100644 doc/libc/bsd/constant.TCP_NODELAY.html delete mode 100644 doc/libc/bsd/constant.TCSADRAIN.html delete mode 100644 doc/libc/bsd/constant.TCSAFLUSH.html delete mode 100644 doc/libc/bsd/constant.TCSANOW.html delete mode 100644 doc/libc/bsd/constant.THOUSEP.html delete mode 100644 doc/libc/bsd/constant.TIOCCBRK.html delete mode 100644 doc/libc/bsd/constant.TIOCCDTR.html delete mode 100644 doc/libc/bsd/constant.TIOCCONS.html delete mode 100644 doc/libc/bsd/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/bsd/constant.TIOCDRAIN.html delete mode 100644 doc/libc/bsd/constant.TIOCDSIMICROCODE.html delete mode 100644 doc/libc/bsd/constant.TIOCEXCL.html delete mode 100644 doc/libc/bsd/constant.TIOCEXT.html delete mode 100644 doc/libc/bsd/constant.TIOCFLUSH.html delete mode 100644 doc/libc/bsd/constant.TIOCGDRAINWAIT.html delete mode 100644 doc/libc/bsd/constant.TIOCGETD.html delete mode 100644 doc/libc/bsd/constant.TIOCGPGRP.html delete mode 100644 doc/libc/bsd/constant.TIOCGWINSZ.html delete mode 100644 doc/libc/bsd/constant.TIOCIXOFF.html delete mode 100644 doc/libc/bsd/constant.TIOCIXON.html delete mode 100644 doc/libc/bsd/constant.TIOCMBIC.html delete mode 100644 doc/libc/bsd/constant.TIOCMBIS.html delete mode 100644 doc/libc/bsd/constant.TIOCMGDTRWAIT.html delete mode 100644 doc/libc/bsd/constant.TIOCMGET.html delete mode 100644 doc/libc/bsd/constant.TIOCMODG.html delete mode 100644 doc/libc/bsd/constant.TIOCMODS.html delete mode 100644 doc/libc/bsd/constant.TIOCMSDTRWAIT.html delete mode 100644 doc/libc/bsd/constant.TIOCMSET.html delete mode 100644 doc/libc/bsd/constant.TIOCM_CAR.html delete mode 100644 doc/libc/bsd/constant.TIOCM_CD.html delete mode 100644 doc/libc/bsd/constant.TIOCM_CTS.html delete mode 100644 doc/libc/bsd/constant.TIOCM_DSR.html delete mode 100644 doc/libc/bsd/constant.TIOCM_DTR.html delete mode 100644 doc/libc/bsd/constant.TIOCM_LE.html delete mode 100644 doc/libc/bsd/constant.TIOCM_RI.html delete mode 100644 doc/libc/bsd/constant.TIOCM_RNG.html delete mode 100644 doc/libc/bsd/constant.TIOCM_RTS.html delete mode 100644 doc/libc/bsd/constant.TIOCM_SR.html delete mode 100644 doc/libc/bsd/constant.TIOCM_ST.html delete mode 100644 doc/libc/bsd/constant.TIOCNOTTY.html delete mode 100644 doc/libc/bsd/constant.TIOCNXCL.html delete mode 100644 doc/libc/bsd/constant.TIOCOUTQ.html delete mode 100644 doc/libc/bsd/constant.TIOCPKT.html delete mode 100644 doc/libc/bsd/constant.TIOCPKT_DATA.html delete mode 100644 doc/libc/bsd/constant.TIOCPKT_DOSTOP.html delete mode 100644 doc/libc/bsd/constant.TIOCPKT_FLUSHREAD.html delete mode 100644 doc/libc/bsd/constant.TIOCPKT_FLUSHWRITE.html delete mode 100644 doc/libc/bsd/constant.TIOCPKT_IOCTL.html delete mode 100644 doc/libc/bsd/constant.TIOCPKT_NOSTOP.html delete mode 100644 doc/libc/bsd/constant.TIOCPKT_START.html delete mode 100644 doc/libc/bsd/constant.TIOCPKT_STOP.html delete mode 100644 doc/libc/bsd/constant.TIOCPTYGNAME.html delete mode 100644 doc/libc/bsd/constant.TIOCPTYGRANT.html delete mode 100644 doc/libc/bsd/constant.TIOCPTYUNLK.html delete mode 100644 doc/libc/bsd/constant.TIOCREMOTE.html delete mode 100644 doc/libc/bsd/constant.TIOCSBRK.html delete mode 100644 doc/libc/bsd/constant.TIOCSCONS.html delete mode 100644 doc/libc/bsd/constant.TIOCSCTTY.html delete mode 100644 doc/libc/bsd/constant.TIOCSDRAINWAIT.html delete mode 100644 doc/libc/bsd/constant.TIOCSDTR.html delete mode 100644 doc/libc/bsd/constant.TIOCSETD.html delete mode 100644 doc/libc/bsd/constant.TIOCSIG.html delete mode 100644 doc/libc/bsd/constant.TIOCSPGRP.html delete mode 100644 doc/libc/bsd/constant.TIOCSTART.html delete mode 100644 doc/libc/bsd/constant.TIOCSTAT.html delete mode 100644 doc/libc/bsd/constant.TIOCSTI.html delete mode 100644 doc/libc/bsd/constant.TIOCSTOP.html delete mode 100644 doc/libc/bsd/constant.TIOCSWINSZ.html delete mode 100644 doc/libc/bsd/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/bsd/constant.TIOCUCNTL.html delete mode 100644 doc/libc/bsd/constant.TMP_MAX.html delete mode 100644 doc/libc/bsd/constant.TOSTOP.html delete mode 100644 doc/libc/bsd/constant.T_FMT.html delete mode 100644 doc/libc/bsd/constant.T_FMT_AMPM.html delete mode 100644 doc/libc/bsd/constant.VDISCARD.html delete mode 100644 doc/libc/bsd/constant.VEOF.html delete mode 100644 doc/libc/bsd/constant.VEOL.html delete mode 100644 doc/libc/bsd/constant.VEOL2.html delete mode 100644 doc/libc/bsd/constant.VERASE.html delete mode 100644 doc/libc/bsd/constant.VINTR.html delete mode 100644 doc/libc/bsd/constant.VKILL.html delete mode 100644 doc/libc/bsd/constant.VLNEXT.html delete mode 100644 doc/libc/bsd/constant.VMIN.html delete mode 100644 doc/libc/bsd/constant.VQUIT.html delete mode 100644 doc/libc/bsd/constant.VREPRINT.html delete mode 100644 doc/libc/bsd/constant.VSTART.html delete mode 100644 doc/libc/bsd/constant.VSTOP.html delete mode 100644 doc/libc/bsd/constant.VSUSP.html delete mode 100644 doc/libc/bsd/constant.VT0.html delete mode 100644 doc/libc/bsd/constant.VT1.html delete mode 100644 doc/libc/bsd/constant.VTIME.html delete mode 100644 doc/libc/bsd/constant.VWERASE.html delete mode 100644 doc/libc/bsd/constant.WNOHANG.html delete mode 100644 doc/libc/bsd/constant.W_OK.html delete mode 100644 doc/libc/bsd/constant.X_OK.html delete mode 100644 doc/libc/bsd/constant.YESEXPR.html delete mode 100644 doc/libc/bsd/constant.YESSTR.html delete mode 100644 doc/libc/bsd/constant._IOFBF.html delete mode 100644 doc/libc/bsd/constant._IOLBF.html delete mode 100644 doc/libc/bsd/constant._IONBF.html delete mode 100644 doc/libc/bsd/constant._PC_NAME_MAX.html delete mode 100644 doc/libc/bsd/constant._PTHREAD_COND_SIG_init.html delete mode 100644 doc/libc/bsd/constant._PTHREAD_MUTEX_SIG_init.html delete mode 100644 doc/libc/bsd/constant._PTHREAD_RWLOCK_SIG_init.html delete mode 100644 doc/libc/bsd/constant._RLIMIT_POSIX_FLAG.html delete mode 100644 doc/libc/bsd/constant._SC_2_CHAR_TERM.html delete mode 100644 doc/libc/bsd/constant._SC_2_C_BIND.html delete mode 100644 doc/libc/bsd/constant._SC_2_C_DEV.html delete mode 100644 doc/libc/bsd/constant._SC_2_FORT_DEV.html delete mode 100644 doc/libc/bsd/constant._SC_2_FORT_RUN.html delete mode 100644 doc/libc/bsd/constant._SC_2_LOCALEDEF.html delete mode 100644 doc/libc/bsd/constant._SC_2_PBS.html delete mode 100644 doc/libc/bsd/constant._SC_2_PBS_ACCOUNTING.html delete mode 100644 doc/libc/bsd/constant._SC_2_PBS_CHECKPOINT.html delete mode 100644 doc/libc/bsd/constant._SC_2_PBS_LOCATE.html delete mode 100644 doc/libc/bsd/constant._SC_2_PBS_MESSAGE.html delete mode 100644 doc/libc/bsd/constant._SC_2_PBS_TRACK.html delete mode 100644 doc/libc/bsd/constant._SC_2_SW_DEV.html delete mode 100644 doc/libc/bsd/constant._SC_2_UPE.html delete mode 100644 doc/libc/bsd/constant._SC_2_VERSION.html delete mode 100644 doc/libc/bsd/constant._SC_ADVISORY_INFO.html delete mode 100644 doc/libc/bsd/constant._SC_AIO_LISTIO_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_AIO_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_AIO_PRIO_DELTA_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_ARG_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_ASYNCHRONOUS_IO.html delete mode 100644 doc/libc/bsd/constant._SC_ATEXIT_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_BARRIERS.html delete mode 100644 doc/libc/bsd/constant._SC_BC_BASE_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_BC_DIM_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_BC_SCALE_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_BC_STRING_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_CHILD_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_CLK_TCK.html delete mode 100644 doc/libc/bsd/constant._SC_CLOCK_SELECTION.html delete mode 100644 doc/libc/bsd/constant._SC_COLL_WEIGHTS_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_CPUTIME.html delete mode 100644 doc/libc/bsd/constant._SC_DELAYTIMER_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_EXPR_NEST_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_FILE_LOCKING.html delete mode 100644 doc/libc/bsd/constant._SC_FSYNC.html delete mode 100644 doc/libc/bsd/constant._SC_GETGR_R_SIZE_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_GETPW_R_SIZE_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_HOST_NAME_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_IOV_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_IPV6.html delete mode 100644 doc/libc/bsd/constant._SC_JOB_CONTROL.html delete mode 100644 doc/libc/bsd/constant._SC_LINE_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_LOGIN_NAME_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_MAPPED_FILES.html delete mode 100644 doc/libc/bsd/constant._SC_MEMLOCK.html delete mode 100644 doc/libc/bsd/constant._SC_MEMLOCK_RANGE.html delete mode 100644 doc/libc/bsd/constant._SC_MEMORY_PROTECTION.html delete mode 100644 doc/libc/bsd/constant._SC_MESSAGE_PASSING.html delete mode 100644 doc/libc/bsd/constant._SC_MONOTONIC_CLOCK.html delete mode 100644 doc/libc/bsd/constant._SC_MQ_OPEN_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_MQ_PRIO_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_NGROUPS_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_NPROCESSORS_CONF.html delete mode 100644 doc/libc/bsd/constant._SC_NPROCESSORS_ONLN.html delete mode 100644 doc/libc/bsd/constant._SC_OPEN_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_PAGESIZE.html delete mode 100644 doc/libc/bsd/constant._SC_PAGE_SIZE.html delete mode 100644 doc/libc/bsd/constant._SC_PASS_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_PRIORITIZED_IO.html delete mode 100644 doc/libc/bsd/constant._SC_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/bsd/constant._SC_RAW_SOCKETS.html delete mode 100644 doc/libc/bsd/constant._SC_READER_WRITER_LOCKS.html delete mode 100644 doc/libc/bsd/constant._SC_REALTIME_SIGNALS.html delete mode 100644 doc/libc/bsd/constant._SC_REGEXP.html delete mode 100644 doc/libc/bsd/constant._SC_RE_DUP_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_RTSIG_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_SAVED_IDS.html delete mode 100644 doc/libc/bsd/constant._SC_SEMAPHORES.html delete mode 100644 doc/libc/bsd/constant._SC_SEM_NSEMS_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_SEM_VALUE_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_SHARED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/bsd/constant._SC_SHELL.html delete mode 100644 doc/libc/bsd/constant._SC_SIGQUEUE_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_SPAWN.html delete mode 100644 doc/libc/bsd/constant._SC_SPIN_LOCKS.html delete mode 100644 doc/libc/bsd/constant._SC_SPORADIC_SERVER.html delete mode 100644 doc/libc/bsd/constant._SC_SS_REPL_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_STREAM_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_SYMLOOP_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_SYNCHRONIZED_IO.html delete mode 100644 doc/libc/bsd/constant._SC_THREADS.html delete mode 100644 doc/libc/bsd/constant._SC_THREAD_ATTR_STACKADDR.html delete mode 100644 doc/libc/bsd/constant._SC_THREAD_ATTR_STACKSIZE.html delete mode 100644 doc/libc/bsd/constant._SC_THREAD_CPUTIME.html delete mode 100644 doc/libc/bsd/constant._SC_THREAD_DESTRUCTOR_ITERATIONS.html delete mode 100644 doc/libc/bsd/constant._SC_THREAD_KEYS_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_THREAD_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/bsd/constant._SC_THREAD_PRIO_INHERIT.html delete mode 100644 doc/libc/bsd/constant._SC_THREAD_PRIO_PROTECT.html delete mode 100644 doc/libc/bsd/constant._SC_THREAD_PROCESS_SHARED.html delete mode 100644 doc/libc/bsd/constant._SC_THREAD_SAFE_FUNCTIONS.html delete mode 100644 doc/libc/bsd/constant._SC_THREAD_SPORADIC_SERVER.html delete mode 100644 doc/libc/bsd/constant._SC_THREAD_STACK_MIN.html delete mode 100644 doc/libc/bsd/constant._SC_THREAD_THREADS_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_TIMEOUTS.html delete mode 100644 doc/libc/bsd/constant._SC_TIMERS.html delete mode 100644 doc/libc/bsd/constant._SC_TIMER_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_TRACE.html delete mode 100644 doc/libc/bsd/constant._SC_TRACE_EVENT_FILTER.html delete mode 100644 doc/libc/bsd/constant._SC_TRACE_EVENT_NAME_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_TRACE_INHERIT.html delete mode 100644 doc/libc/bsd/constant._SC_TRACE_LOG.html delete mode 100644 doc/libc/bsd/constant._SC_TRACE_NAME_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_TRACE_SYS_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_TRACE_USER_EVENT_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_TTY_NAME_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_TYPED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/bsd/constant._SC_TZNAME_MAX.html delete mode 100644 doc/libc/bsd/constant._SC_V6_ILP32_OFF32.html delete mode 100644 doc/libc/bsd/constant._SC_V6_ILP32_OFFBIG.html delete mode 100644 doc/libc/bsd/constant._SC_V6_LP64_OFF64.html delete mode 100644 doc/libc/bsd/constant._SC_V6_LPBIG_OFFBIG.html delete mode 100644 doc/libc/bsd/constant._SC_VERSION.html delete mode 100644 doc/libc/bsd/constant._SC_XBS5_ILP32_OFF32.html delete mode 100644 doc/libc/bsd/constant._SC_XBS5_ILP32_OFFBIG.html delete mode 100644 doc/libc/bsd/constant._SC_XBS5_LP64_OFF64.html delete mode 100644 doc/libc/bsd/constant._SC_XBS5_LPBIG_OFFBIG.html delete mode 100644 doc/libc/bsd/constant._SC_XOPEN_CRYPT.html delete mode 100644 doc/libc/bsd/constant._SC_XOPEN_ENH_I18N.html delete mode 100644 doc/libc/bsd/constant._SC_XOPEN_LEGACY.html delete mode 100644 doc/libc/bsd/constant._SC_XOPEN_REALTIME.html delete mode 100644 doc/libc/bsd/constant._SC_XOPEN_REALTIME_THREADS.html delete mode 100644 doc/libc/bsd/constant._SC_XOPEN_SHM.html delete mode 100644 doc/libc/bsd/constant._SC_XOPEN_STREAMS.html delete mode 100644 doc/libc/bsd/constant._SC_XOPEN_UNIX.html delete mode 100644 doc/libc/bsd/constant._SC_XOPEN_VERSION.html delete mode 100644 doc/libc/bsd/constant._SC_XOPEN_XCU_VERSION.html delete mode 100644 doc/libc/bsd/constant._WSTOPPED.html delete mode 100644 doc/libc/bsd/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/bsd/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/bsd/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/bsd/enum.timezone.html delete mode 100644 doc/libc/bsd/fn.FD_CLR.html delete mode 100644 doc/libc/bsd/fn.FD_ISSET.html delete mode 100644 doc/libc/bsd/fn.FD_SET.html delete mode 100644 doc/libc/bsd/fn.FD_ZERO.html delete mode 100644 doc/libc/bsd/fn.WCOREDUMP.html delete mode 100644 doc/libc/bsd/fn.WEXITSTATUS.html delete mode 100644 doc/libc/bsd/fn.WIFCONTINUED.html delete mode 100644 doc/libc/bsd/fn.WIFEXITED.html delete mode 100644 doc/libc/bsd/fn.WIFSIGNALED.html delete mode 100644 doc/libc/bsd/fn.WIFSTOPPED.html delete mode 100644 doc/libc/bsd/fn.WSTOPSIG.html delete mode 100644 doc/libc/bsd/fn.WTERMSIG.html delete mode 100644 doc/libc/bsd/fn._WSTATUS.html delete mode 100644 doc/libc/bsd/fn.__error.html delete mode 100644 doc/libc/bsd/fn.backtrace.html delete mode 100644 doc/libc/bsd/fn.duplocale.html delete mode 100644 doc/libc/bsd/fn.forkpty.html delete mode 100644 doc/libc/bsd/fn.freelocale.html delete mode 100644 doc/libc/bsd/fn.fstatfs.html delete mode 100644 doc/libc/bsd/fn.getnameinfo.html delete mode 100644 doc/libc/bsd/fn.getpwuid_r.html delete mode 100644 doc/libc/bsd/fn.ioctl.html delete mode 100644 doc/libc/bsd/fn.kevent.html delete mode 100644 doc/libc/bsd/fn.kevent64.html delete mode 100644 doc/libc/bsd/fn.kqueue.html delete mode 100644 doc/libc/bsd/fn.localeconv_l.html delete mode 100644 doc/libc/bsd/fn.mach_absolute_time.html delete mode 100644 doc/libc/bsd/fn.mach_timebase_info.html delete mode 100644 doc/libc/bsd/fn.mincore.html delete mode 100644 doc/libc/bsd/fn.mount.html delete mode 100644 doc/libc/bsd/fn.mprotect.html delete mode 100644 doc/libc/bsd/fn.newlocale.html delete mode 100644 doc/libc/bsd/fn.openpty.html delete mode 100644 doc/libc/bsd/fn.pthread_get_stackaddr_np.html delete mode 100644 doc/libc/bsd/fn.pthread_get_stacksize_np.html delete mode 100644 doc/libc/bsd/fn.pthread_setname_np.html delete mode 100644 doc/libc/bsd/fn.ptrace.html delete mode 100644 doc/libc/bsd/fn.querylocale.html delete mode 100644 doc/libc/bsd/fn.quotactl.html delete mode 100644 doc/libc/bsd/fn.sendfile.html delete mode 100644 doc/libc/bsd/fn.setgroups.html delete mode 100644 doc/libc/bsd/fn.sethostname.html delete mode 100644 doc/libc/bsd/fn.shm_open.html delete mode 100644 doc/libc/bsd/fn.statfs.html delete mode 100644 doc/libc/bsd/fn.syscall.html delete mode 100644 doc/libc/bsd/fn.sysctl.html delete mode 100644 doc/libc/bsd/fn.sysctlbyname.html delete mode 100644 doc/libc/bsd/fn.sysctlnametomib.html delete mode 100644 doc/libc/bsd/fn.unmount.html delete mode 100644 doc/libc/bsd/fn.uselocale.html delete mode 100644 doc/libc/bsd/index.html delete mode 100644 doc/libc/bsd/sidebar-items.js delete mode 100644 doc/libc/bsd/struct.Dl_info.html delete mode 100644 doc/libc/bsd/struct.addrinfo.html delete mode 100644 doc/libc/bsd/struct.dirent.html delete mode 100644 doc/libc/bsd/struct.dqblk.html delete mode 100644 doc/libc/bsd/struct.fd_set.html delete mode 100644 doc/libc/bsd/struct.flock.html delete mode 100644 doc/libc/bsd/struct.fsid_t.html delete mode 100644 doc/libc/bsd/struct.fstore_t.html delete mode 100644 doc/libc/bsd/struct.glob_t.html delete mode 100644 doc/libc/bsd/struct.ifaddrs.html delete mode 100644 doc/libc/bsd/struct.kevent.html delete mode 100644 doc/libc/bsd/struct.kevent64_s.html delete mode 100644 doc/libc/bsd/struct.lconv.html delete mode 100644 doc/libc/bsd/struct.mach_timebase_info.html delete mode 100644 doc/libc/bsd/struct.msghdr.html delete mode 100644 doc/libc/bsd/struct.passwd.html delete mode 100644 doc/libc/bsd/struct.pthread_attr_t.html delete mode 100644 doc/libc/bsd/struct.pthread_cond_t.html delete mode 100644 doc/libc/bsd/struct.pthread_mutex_t.html delete mode 100644 doc/libc/bsd/struct.pthread_mutexattr_t.html delete mode 100644 doc/libc/bsd/struct.pthread_rwlock_t.html delete mode 100644 doc/libc/bsd/struct.radvisory.html delete mode 100644 doc/libc/bsd/struct.sf_hdtr.html delete mode 100644 doc/libc/bsd/struct.sigaction.html delete mode 100644 doc/libc/bsd/struct.siginfo_t.html delete mode 100644 doc/libc/bsd/struct.sockaddr.html delete mode 100644 doc/libc/bsd/struct.sockaddr_in.html delete mode 100644 doc/libc/bsd/struct.sockaddr_in6.html delete mode 100644 doc/libc/bsd/struct.sockaddr_storage.html delete mode 100644 doc/libc/bsd/struct.sockaddr_un.html delete mode 100644 doc/libc/bsd/struct.stack_t.html delete mode 100644 doc/libc/bsd/struct.stat.html delete mode 100644 doc/libc/bsd/struct.statfs.html delete mode 100644 doc/libc/bsd/struct.statvfs.html delete mode 100644 doc/libc/bsd/struct.termios.html delete mode 100644 doc/libc/bsd/struct.tm.html delete mode 100644 doc/libc/bsd/struct.utsname.html delete mode 100644 doc/libc/bsd/type.blkcnt_t.html delete mode 100644 doc/libc/bsd/type.blksize_t.html delete mode 100644 doc/libc/bsd/type.c_char.html delete mode 100644 doc/libc/bsd/type.c_long.html delete mode 100644 doc/libc/bsd/type.c_ulong.html delete mode 100644 doc/libc/bsd/type.clock_t.html delete mode 100644 doc/libc/bsd/type.dev_t.html delete mode 100644 doc/libc/bsd/type.fsblkcnt_t.html delete mode 100644 doc/libc/bsd/type.fsfilcnt_t.html delete mode 100644 doc/libc/bsd/type.ino_t.html delete mode 100644 doc/libc/bsd/type.mach_timebase_info_data_t.html delete mode 100644 doc/libc/bsd/type.mode_t.html delete mode 100644 doc/libc/bsd/type.nfds_t.html delete mode 100644 doc/libc/bsd/type.nl_item.html delete mode 100644 doc/libc/bsd/type.nlink_t.html delete mode 100644 doc/libc/bsd/type.off_t.html delete mode 100644 doc/libc/bsd/type.pthread_key_t.html delete mode 100644 doc/libc/bsd/type.pthread_t.html delete mode 100644 doc/libc/bsd/type.rlim_t.html delete mode 100644 doc/libc/bsd/type.sa_family_t.html delete mode 100644 doc/libc/bsd/type.sigset_t.html delete mode 100644 doc/libc/bsd/type.socklen_t.html delete mode 100644 doc/libc/bsd/type.speed_t.html delete mode 100644 doc/libc/bsd/type.suseconds_t.html delete mode 100644 doc/libc/bsd/type.tcflag_t.html delete mode 100644 doc/libc/bsd/type.time_t.html delete mode 100644 doc/libc/bsd/type.useconds_t.html delete mode 100644 doc/libc/bsd/type.wchar_t.html delete mode 100644 doc/libc/constant.ABDAY_1.html delete mode 100644 doc/libc/constant.ABDAY_2.html delete mode 100644 doc/libc/constant.ABDAY_3.html delete mode 100644 doc/libc/constant.ABDAY_4.html delete mode 100644 doc/libc/constant.ABDAY_5.html delete mode 100644 doc/libc/constant.ABDAY_6.html delete mode 100644 doc/libc/constant.ABDAY_7.html delete mode 100644 doc/libc/constant.ABMON_1.html delete mode 100644 doc/libc/constant.ABMON_10.html delete mode 100644 doc/libc/constant.ABMON_11.html delete mode 100644 doc/libc/constant.ABMON_12.html delete mode 100644 doc/libc/constant.ABMON_2.html delete mode 100644 doc/libc/constant.ABMON_3.html delete mode 100644 doc/libc/constant.ABMON_4.html delete mode 100644 doc/libc/constant.ABMON_5.html delete mode 100644 doc/libc/constant.ABMON_6.html delete mode 100644 doc/libc/constant.ABMON_7.html delete mode 100644 doc/libc/constant.ABMON_8.html delete mode 100644 doc/libc/constant.ABMON_9.html delete mode 100644 doc/libc/constant.AF_INET.html delete mode 100644 doc/libc/constant.AF_INET6.html delete mode 100644 doc/libc/constant.AF_UNIX.html delete mode 100644 doc/libc/constant.ALT_DIGITS.html delete mode 100644 doc/libc/constant.AM_STR.html delete mode 100644 doc/libc/constant.BRKINT.html delete mode 100644 doc/libc/constant.BS0.html delete mode 100644 doc/libc/constant.BS1.html delete mode 100644 doc/libc/constant.BUFSIZ.html delete mode 100644 doc/libc/constant.CLOCAL.html delete mode 100644 doc/libc/constant.CODESET.html delete mode 100644 doc/libc/constant.CR0.html delete mode 100644 doc/libc/constant.CR1.html delete mode 100644 doc/libc/constant.CR2.html delete mode 100644 doc/libc/constant.CR3.html delete mode 100644 doc/libc/constant.CREAD.html delete mode 100644 doc/libc/constant.CRNCYSTR.html delete mode 100644 doc/libc/constant.CRTSCTS.html delete mode 100644 doc/libc/constant.CS5.html delete mode 100644 doc/libc/constant.CS6.html delete mode 100644 doc/libc/constant.CS7.html delete mode 100644 doc/libc/constant.CS8.html delete mode 100644 doc/libc/constant.CSIZE.html delete mode 100644 doc/libc/constant.CSTOPB.html delete mode 100644 doc/libc/constant.CTL_HW.html delete mode 100644 doc/libc/constant.DAY_1.html delete mode 100644 doc/libc/constant.DAY_2.html delete mode 100644 doc/libc/constant.DAY_3.html delete mode 100644 doc/libc/constant.DAY_4.html delete mode 100644 doc/libc/constant.DAY_5.html delete mode 100644 doc/libc/constant.DAY_6.html delete mode 100644 doc/libc/constant.DAY_7.html delete mode 100644 doc/libc/constant.DT_BLK.html delete mode 100644 doc/libc/constant.DT_CHR.html delete mode 100644 doc/libc/constant.DT_DIR.html delete mode 100644 doc/libc/constant.DT_FIFO.html delete mode 100644 doc/libc/constant.DT_LNK.html delete mode 100644 doc/libc/constant.DT_REG.html delete mode 100644 doc/libc/constant.DT_SOCK.html delete mode 100644 doc/libc/constant.D_FMT.html delete mode 100644 doc/libc/constant.D_MD_ORDER.html delete mode 100644 doc/libc/constant.D_T_FMT.html delete mode 100644 doc/libc/constant.E2BIG.html delete mode 100644 doc/libc/constant.EACCES.html delete mode 100644 doc/libc/constant.EADDRINUSE.html delete mode 100644 doc/libc/constant.EADDRNOTAVAIL.html delete mode 100644 doc/libc/constant.EAFNOSUPPORT.html delete mode 100644 doc/libc/constant.EAGAIN.html delete mode 100644 doc/libc/constant.EALREADY.html delete mode 100644 doc/libc/constant.EAUTH.html delete mode 100644 doc/libc/constant.EBADARCH.html delete mode 100644 doc/libc/constant.EBADEXEC.html delete mode 100644 doc/libc/constant.EBADF.html delete mode 100644 doc/libc/constant.EBADMACHO.html delete mode 100644 doc/libc/constant.EBADMSG.html delete mode 100644 doc/libc/constant.EBADRPC.html delete mode 100644 doc/libc/constant.EBUSY.html delete mode 100644 doc/libc/constant.ECANCELED.html delete mode 100644 doc/libc/constant.ECHILD.html delete mode 100644 doc/libc/constant.ECHO.html delete mode 100644 doc/libc/constant.ECHOCTL.html delete mode 100644 doc/libc/constant.ECHOE.html delete mode 100644 doc/libc/constant.ECHOK.html delete mode 100644 doc/libc/constant.ECHOKE.html delete mode 100644 doc/libc/constant.ECHONL.html delete mode 100644 doc/libc/constant.ECHOPRT.html delete mode 100644 doc/libc/constant.ECONNABORTED.html delete mode 100644 doc/libc/constant.ECONNREFUSED.html delete mode 100644 doc/libc/constant.ECONNRESET.html delete mode 100644 doc/libc/constant.EDEADLK.html delete mode 100644 doc/libc/constant.EDESTADDRREQ.html delete mode 100644 doc/libc/constant.EDEVERR.html delete mode 100644 doc/libc/constant.EDOM.html delete mode 100644 doc/libc/constant.EDQUOT.html delete mode 100644 doc/libc/constant.EEXIST.html delete mode 100644 doc/libc/constant.EFAULT.html delete mode 100644 doc/libc/constant.EFBIG.html delete mode 100644 doc/libc/constant.EFTYPE.html delete mode 100644 doc/libc/constant.EHOSTDOWN.html delete mode 100644 doc/libc/constant.EHOSTUNREACH.html delete mode 100644 doc/libc/constant.EIDRM.html delete mode 100644 doc/libc/constant.EILSEQ.html delete mode 100644 doc/libc/constant.EINPROGRESS.html delete mode 100644 doc/libc/constant.EINTR.html delete mode 100644 doc/libc/constant.EINVAL.html delete mode 100644 doc/libc/constant.EIO.html delete mode 100644 doc/libc/constant.EISCONN.html delete mode 100644 doc/libc/constant.EISDIR.html delete mode 100644 doc/libc/constant.ELAST.html delete mode 100644 doc/libc/constant.ELOOP.html delete mode 100644 doc/libc/constant.EMFILE.html delete mode 100644 doc/libc/constant.EMLINK.html delete mode 100644 doc/libc/constant.EMSGSIZE.html delete mode 100644 doc/libc/constant.EMULTIHOP.html delete mode 100644 doc/libc/constant.ENAMETOOLONG.html delete mode 100644 doc/libc/constant.ENEEDAUTH.html delete mode 100644 doc/libc/constant.ENETDOWN.html delete mode 100644 doc/libc/constant.ENETRESET.html delete mode 100644 doc/libc/constant.ENETUNREACH.html delete mode 100644 doc/libc/constant.ENFILE.html delete mode 100644 doc/libc/constant.ENOATTR.html delete mode 100644 doc/libc/constant.ENOBUFS.html delete mode 100644 doc/libc/constant.ENODATA.html delete mode 100644 doc/libc/constant.ENODEV.html delete mode 100644 doc/libc/constant.ENOENT.html delete mode 100644 doc/libc/constant.ENOEXEC.html delete mode 100644 doc/libc/constant.ENOLCK.html delete mode 100644 doc/libc/constant.ENOLINK.html delete mode 100644 doc/libc/constant.ENOMEM.html delete mode 100644 doc/libc/constant.ENOMSG.html delete mode 100644 doc/libc/constant.ENOPOLICY.html delete mode 100644 doc/libc/constant.ENOPROTOOPT.html delete mode 100644 doc/libc/constant.ENOSPC.html delete mode 100644 doc/libc/constant.ENOSR.html delete mode 100644 doc/libc/constant.ENOSTR.html delete mode 100644 doc/libc/constant.ENOSYS.html delete mode 100644 doc/libc/constant.ENOTBLK.html delete mode 100644 doc/libc/constant.ENOTCONN.html delete mode 100644 doc/libc/constant.ENOTDIR.html delete mode 100644 doc/libc/constant.ENOTEMPTY.html delete mode 100644 doc/libc/constant.ENOTRECOVERABLE.html delete mode 100644 doc/libc/constant.ENOTSOCK.html delete mode 100644 doc/libc/constant.ENOTSUP.html delete mode 100644 doc/libc/constant.ENOTTY.html delete mode 100644 doc/libc/constant.ENXIO.html delete mode 100644 doc/libc/constant.EOF.html delete mode 100644 doc/libc/constant.EOPNOTSUPP.html delete mode 100644 doc/libc/constant.EOVERFLOW.html delete mode 100644 doc/libc/constant.EOWNERDEAD.html delete mode 100644 doc/libc/constant.EPERM.html delete mode 100644 doc/libc/constant.EPFNOSUPPORT.html delete mode 100644 doc/libc/constant.EPIPE.html delete mode 100644 doc/libc/constant.EPROCLIM.html delete mode 100644 doc/libc/constant.EPROCUNAVAIL.html delete mode 100644 doc/libc/constant.EPROGMISMATCH.html delete mode 100644 doc/libc/constant.EPROGUNAVAIL.html delete mode 100644 doc/libc/constant.EPROTO.html delete mode 100644 doc/libc/constant.EPROTONOSUPPORT.html delete mode 100644 doc/libc/constant.EPROTOTYPE.html delete mode 100644 doc/libc/constant.EPWROFF.html delete mode 100644 doc/libc/constant.EQFULL.html delete mode 100644 doc/libc/constant.ERA.html delete mode 100644 doc/libc/constant.ERANGE.html delete mode 100644 doc/libc/constant.ERA_D_FMT.html delete mode 100644 doc/libc/constant.ERA_D_T_FMT.html delete mode 100644 doc/libc/constant.ERA_T_FMT.html delete mode 100644 doc/libc/constant.EREMOTE.html delete mode 100644 doc/libc/constant.EROFS.html delete mode 100644 doc/libc/constant.ERPCMISMATCH.html delete mode 100644 doc/libc/constant.ESHLIBVERS.html delete mode 100644 doc/libc/constant.ESHUTDOWN.html delete mode 100644 doc/libc/constant.ESOCKTNOSUPPORT.html delete mode 100644 doc/libc/constant.ESPIPE.html delete mode 100644 doc/libc/constant.ESRCH.html delete mode 100644 doc/libc/constant.ESTALE.html delete mode 100644 doc/libc/constant.ETIME.html delete mode 100644 doc/libc/constant.ETIMEDOUT.html delete mode 100644 doc/libc/constant.ETOOMANYREFS.html delete mode 100644 doc/libc/constant.ETXTBSY.html delete mode 100644 doc/libc/constant.EUSERS.html delete mode 100644 doc/libc/constant.EVFILT_AIO.html delete mode 100644 doc/libc/constant.EVFILT_FS.html delete mode 100644 doc/libc/constant.EVFILT_MACHPORT.html delete mode 100644 doc/libc/constant.EVFILT_PROC.html delete mode 100644 doc/libc/constant.EVFILT_READ.html delete mode 100644 doc/libc/constant.EVFILT_SIGNAL.html delete mode 100644 doc/libc/constant.EVFILT_SYSCOUNT.html delete mode 100644 doc/libc/constant.EVFILT_TIMER.html delete mode 100644 doc/libc/constant.EVFILT_USER.html delete mode 100644 doc/libc/constant.EVFILT_VM.html delete mode 100644 doc/libc/constant.EVFILT_VNODE.html delete mode 100644 doc/libc/constant.EVFILT_WRITE.html delete mode 100644 doc/libc/constant.EV_ADD.html delete mode 100644 doc/libc/constant.EV_CLEAR.html delete mode 100644 doc/libc/constant.EV_DELETE.html delete mode 100644 doc/libc/constant.EV_DISABLE.html delete mode 100644 doc/libc/constant.EV_DISPATCH.html delete mode 100644 doc/libc/constant.EV_ENABLE.html delete mode 100644 doc/libc/constant.EV_EOF.html delete mode 100644 doc/libc/constant.EV_ERROR.html delete mode 100644 doc/libc/constant.EV_FLAG0.html delete mode 100644 doc/libc/constant.EV_FLAG1.html delete mode 100644 doc/libc/constant.EV_ONESHOT.html delete mode 100644 doc/libc/constant.EV_OOBAND.html delete mode 100644 doc/libc/constant.EV_POLL.html delete mode 100644 doc/libc/constant.EV_RECEIPT.html delete mode 100644 doc/libc/constant.EV_SYSFLAGS.html delete mode 100644 doc/libc/constant.EWOULDBLOCK.html delete mode 100644 doc/libc/constant.EXDEV.html delete mode 100644 doc/libc/constant.EXIT_FAILURE.html delete mode 100644 doc/libc/constant.EXIT_SUCCESS.html delete mode 100644 doc/libc/constant.EXTPROC.html delete mode 100644 doc/libc/constant.FD_CLOEXEC.html delete mode 100644 doc/libc/constant.FD_SETSIZE.html delete mode 100644 doc/libc/constant.FF0.html delete mode 100644 doc/libc/constant.FF1.html delete mode 100644 doc/libc/constant.FILENAME_MAX.html delete mode 100644 doc/libc/constant.FIOCLEX.html delete mode 100644 doc/libc/constant.FIONBIO.html delete mode 100644 doc/libc/constant.FLUSHO.html delete mode 100644 doc/libc/constant.FOPEN_MAX.html delete mode 100644 doc/libc/constant.F_ALLOCATEALL.html delete mode 100644 doc/libc/constant.F_ALLOCATECONTIG.html delete mode 100644 doc/libc/constant.F_DUPFD.html delete mode 100644 doc/libc/constant.F_DUPFD_CLOEXEC.html delete mode 100644 doc/libc/constant.F_FREEZE_FS.html delete mode 100644 doc/libc/constant.F_FULLFSYNC.html delete mode 100644 doc/libc/constant.F_GETFD.html delete mode 100644 doc/libc/constant.F_GETFL.html delete mode 100644 doc/libc/constant.F_GETLK.html delete mode 100644 doc/libc/constant.F_GETOWN.html delete mode 100644 doc/libc/constant.F_GETPATH.html delete mode 100644 doc/libc/constant.F_GLOBAL_NOCACHE.html delete mode 100644 doc/libc/constant.F_LOCK.html delete mode 100644 doc/libc/constant.F_NOCACHE.html delete mode 100644 doc/libc/constant.F_NODIRECT.html delete mode 100644 doc/libc/constant.F_OK.html delete mode 100644 doc/libc/constant.F_PEOFPOSMODE.html delete mode 100644 doc/libc/constant.F_PREALLOCATE.html delete mode 100644 doc/libc/constant.F_RDADVISE.html delete mode 100644 doc/libc/constant.F_RDAHEAD.html delete mode 100644 doc/libc/constant.F_SETFD.html delete mode 100644 doc/libc/constant.F_SETFL.html delete mode 100644 doc/libc/constant.F_SETLK.html delete mode 100644 doc/libc/constant.F_SETLKW.html delete mode 100644 doc/libc/constant.F_SETOWN.html delete mode 100644 doc/libc/constant.F_TEST.html delete mode 100644 doc/libc/constant.F_THAW_FS.html delete mode 100644 doc/libc/constant.F_TLOCK.html delete mode 100644 doc/libc/constant.F_ULOCK.html delete mode 100644 doc/libc/constant.F_VOLPOSMODE.html delete mode 100644 doc/libc/constant.GLOB_ABORTED.html delete mode 100644 doc/libc/constant.GLOB_APPEND.html delete mode 100644 doc/libc/constant.GLOB_DOOFFS.html delete mode 100644 doc/libc/constant.GLOB_ERR.html delete mode 100644 doc/libc/constant.GLOB_MARK.html delete mode 100644 doc/libc/constant.GLOB_NOCHECK.html delete mode 100644 doc/libc/constant.GLOB_NOESCAPE.html delete mode 100644 doc/libc/constant.GLOB_NOMATCH.html delete mode 100644 doc/libc/constant.GLOB_NOSORT.html delete mode 100644 doc/libc/constant.GLOB_NOSPACE.html delete mode 100644 doc/libc/constant.GRPQUOTA.html delete mode 100644 doc/libc/constant.HUPCL.html delete mode 100644 doc/libc/constant.HW_AVAILCPU.html delete mode 100644 doc/libc/constant.HW_NCPU.html delete mode 100644 doc/libc/constant.ICANON.html delete mode 100644 doc/libc/constant.ICRNL.html delete mode 100644 doc/libc/constant.IEXTEN.html delete mode 100644 doc/libc/constant.IFF_LOOPBACK.html delete mode 100644 doc/libc/constant.IF_NAMESIZE.html delete mode 100644 doc/libc/constant.IGNBRK.html delete mode 100644 doc/libc/constant.IGNCR.html delete mode 100644 doc/libc/constant.IGNPAR.html delete mode 100644 doc/libc/constant.IMAXBEL.html delete mode 100644 doc/libc/constant.INLCR.html delete mode 100644 doc/libc/constant.INPCK.html delete mode 100644 doc/libc/constant.IPPROTO_IP.html delete mode 100644 doc/libc/constant.IPPROTO_IPV6.html delete mode 100644 doc/libc/constant.IPPROTO_RAW.html delete mode 100644 doc/libc/constant.IPPROTO_TCP.html delete mode 100644 doc/libc/constant.IPV6_JOIN_GROUP.html delete mode 100644 doc/libc/constant.IPV6_LEAVE_GROUP.html delete mode 100644 doc/libc/constant.IPV6_MULTICAST_LOOP.html delete mode 100644 doc/libc/constant.IPV6_V6ONLY.html delete mode 100644 doc/libc/constant.IP_ADD_MEMBERSHIP.html delete mode 100644 doc/libc/constant.IP_DROP_MEMBERSHIP.html delete mode 100644 doc/libc/constant.IP_HDRINCL.html delete mode 100644 doc/libc/constant.IP_MULTICAST_LOOP.html delete mode 100644 doc/libc/constant.IP_MULTICAST_TTL.html delete mode 100644 doc/libc/constant.IP_TTL.html delete mode 100644 doc/libc/constant.ISIG.html delete mode 100644 doc/libc/constant.ISTRIP.html delete mode 100644 doc/libc/constant.IUTF8.html delete mode 100644 doc/libc/constant.IXANY.html delete mode 100644 doc/libc/constant.IXOFF.html delete mode 100644 doc/libc/constant.IXON.html delete mode 100644 doc/libc/constant.LC_ALL.html delete mode 100644 doc/libc/constant.LC_ALL_MASK.html delete mode 100644 doc/libc/constant.LC_COLLATE.html delete mode 100644 doc/libc/constant.LC_COLLATE_MASK.html delete mode 100644 doc/libc/constant.LC_CTYPE.html delete mode 100644 doc/libc/constant.LC_CTYPE_MASK.html delete mode 100644 doc/libc/constant.LC_MESSAGES.html delete mode 100644 doc/libc/constant.LC_MESSAGES_MASK.html delete mode 100644 doc/libc/constant.LC_MONETARY.html delete mode 100644 doc/libc/constant.LC_MONETARY_MASK.html delete mode 100644 doc/libc/constant.LC_NUMERIC.html delete mode 100644 doc/libc/constant.LC_NUMERIC_MASK.html delete mode 100644 doc/libc/constant.LC_TIME.html delete mode 100644 doc/libc/constant.LC_TIME_MASK.html delete mode 100644 doc/libc/constant.LOCK_EX.html delete mode 100644 doc/libc/constant.LOCK_NB.html delete mode 100644 doc/libc/constant.LOCK_SH.html delete mode 100644 doc/libc/constant.LOCK_UN.html delete mode 100644 doc/libc/constant.L_tmpnam.html delete mode 100644 doc/libc/constant.MADV_CAN_REUSE.html delete mode 100644 doc/libc/constant.MADV_DONTNEED.html delete mode 100644 doc/libc/constant.MADV_FREE.html delete mode 100644 doc/libc/constant.MADV_FREE_REUSABLE.html delete mode 100644 doc/libc/constant.MADV_FREE_REUSE.html delete mode 100644 doc/libc/constant.MADV_NORMAL.html delete mode 100644 doc/libc/constant.MADV_RANDOM.html delete mode 100644 doc/libc/constant.MADV_SEQUENTIAL.html delete mode 100644 doc/libc/constant.MADV_WILLNEED.html delete mode 100644 doc/libc/constant.MADV_ZERO_WIRED_PAGES.html delete mode 100644 doc/libc/constant.MAP_ANON.html delete mode 100644 doc/libc/constant.MAP_COPY.html delete mode 100644 doc/libc/constant.MAP_FAILED.html delete mode 100644 doc/libc/constant.MAP_FILE.html delete mode 100644 doc/libc/constant.MAP_FIXED.html delete mode 100644 doc/libc/constant.MAP_HASSEMAPHORE.html delete mode 100644 doc/libc/constant.MAP_JIT.html delete mode 100644 doc/libc/constant.MAP_NOCACHE.html delete mode 100644 doc/libc/constant.MAP_NOEXTEND.html delete mode 100644 doc/libc/constant.MAP_NORESERVE.html delete mode 100644 doc/libc/constant.MAP_PRIVATE.html delete mode 100644 doc/libc/constant.MAP_RENAME.html delete mode 100644 doc/libc/constant.MAP_SHARED.html delete mode 100644 doc/libc/constant.MCL_CURRENT.html delete mode 100644 doc/libc/constant.MCL_FUTURE.html delete mode 100644 doc/libc/constant.MINCORE_INCORE.html delete mode 100644 doc/libc/constant.MINCORE_MODIFIED.html delete mode 100644 doc/libc/constant.MINCORE_MODIFIED_OTHER.html delete mode 100644 doc/libc/constant.MINCORE_REFERENCED.html delete mode 100644 doc/libc/constant.MINCORE_REFERENCED_OTHER.html delete mode 100644 doc/libc/constant.MNT_FORCE.html delete mode 100644 doc/libc/constant.MON_1.html delete mode 100644 doc/libc/constant.MON_10.html delete mode 100644 doc/libc/constant.MON_11.html delete mode 100644 doc/libc/constant.MON_12.html delete mode 100644 doc/libc/constant.MON_2.html delete mode 100644 doc/libc/constant.MON_3.html delete mode 100644 doc/libc/constant.MON_4.html delete mode 100644 doc/libc/constant.MON_5.html delete mode 100644 doc/libc/constant.MON_6.html delete mode 100644 doc/libc/constant.MON_7.html delete mode 100644 doc/libc/constant.MON_8.html delete mode 100644 doc/libc/constant.MON_9.html delete mode 100644 doc/libc/constant.MS_ASYNC.html delete mode 100644 doc/libc/constant.MS_DEACTIVATE.html delete mode 100644 doc/libc/constant.MS_INVALIDATE.html delete mode 100644 doc/libc/constant.MS_KILLPAGES.html delete mode 100644 doc/libc/constant.MS_SYNC.html delete mode 100644 doc/libc/constant.NCCS.html delete mode 100644 doc/libc/constant.NI_MAXHOST.html delete mode 100644 doc/libc/constant.NL0.html delete mode 100644 doc/libc/constant.NL1.html delete mode 100644 doc/libc/constant.NOEXPR.html delete mode 100644 doc/libc/constant.NOFLSH.html delete mode 100644 doc/libc/constant.NOSTR.html delete mode 100644 doc/libc/constant.NOTE_ABSOLUTE.html delete mode 100644 doc/libc/constant.NOTE_ATTRIB.html delete mode 100644 doc/libc/constant.NOTE_CHILD.html delete mode 100644 doc/libc/constant.NOTE_DELETE.html delete mode 100644 doc/libc/constant.NOTE_EXEC.html delete mode 100644 doc/libc/constant.NOTE_EXIT.html delete mode 100644 doc/libc/constant.NOTE_EXITSTATUS.html delete mode 100644 doc/libc/constant.NOTE_EXIT_REPARENTED.html delete mode 100644 doc/libc/constant.NOTE_EXTEND.html delete mode 100644 doc/libc/constant.NOTE_FFAND.html delete mode 100644 doc/libc/constant.NOTE_FFCOPY.html delete mode 100644 doc/libc/constant.NOTE_FFCTRLMASK.html delete mode 100644 doc/libc/constant.NOTE_FFLAGSMASK.html delete mode 100644 doc/libc/constant.NOTE_FFNOP.html delete mode 100644 doc/libc/constant.NOTE_FFOR.html delete mode 100644 doc/libc/constant.NOTE_FORK.html delete mode 100644 doc/libc/constant.NOTE_LINK.html delete mode 100644 doc/libc/constant.NOTE_LOWAT.html delete mode 100644 doc/libc/constant.NOTE_NONE.html delete mode 100644 doc/libc/constant.NOTE_NSECONDS.html delete mode 100644 doc/libc/constant.NOTE_PCTRLMASK.html delete mode 100644 doc/libc/constant.NOTE_PDATAMASK.html delete mode 100644 doc/libc/constant.NOTE_REAP.html delete mode 100644 doc/libc/constant.NOTE_RENAME.html delete mode 100644 doc/libc/constant.NOTE_REVOKE.html delete mode 100644 doc/libc/constant.NOTE_SECONDS.html delete mode 100644 doc/libc/constant.NOTE_SIGNAL.html delete mode 100644 doc/libc/constant.NOTE_TRACK.html delete mode 100644 doc/libc/constant.NOTE_TRACKERR.html delete mode 100644 doc/libc/constant.NOTE_TRIGGER.html delete mode 100644 doc/libc/constant.NOTE_USECONDS.html delete mode 100644 doc/libc/constant.NOTE_VM_ERROR.html delete mode 100644 doc/libc/constant.NOTE_VM_PRESSURE.html delete mode 100644 doc/libc/constant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html delete mode 100644 doc/libc/constant.NOTE_VM_PRESSURE_TERMINATE.html delete mode 100644 doc/libc/constant.NOTE_WRITE.html delete mode 100644 doc/libc/constant.ONLCR.html delete mode 100644 doc/libc/constant.OPOST.html delete mode 100644 doc/libc/constant.O_ACCMODE.html delete mode 100644 doc/libc/constant.O_APPEND.html delete mode 100644 doc/libc/constant.O_ASYNC.html delete mode 100644 doc/libc/constant.O_CLOEXEC.html delete mode 100644 doc/libc/constant.O_CREAT.html delete mode 100644 doc/libc/constant.O_DIRECTORY.html delete mode 100644 doc/libc/constant.O_DSYNC.html delete mode 100644 doc/libc/constant.O_EXCL.html delete mode 100644 doc/libc/constant.O_FSYNC.html delete mode 100644 doc/libc/constant.O_NDELAY.html delete mode 100644 doc/libc/constant.O_NOCTTY.html delete mode 100644 doc/libc/constant.O_NOFOLLOW.html delete mode 100644 doc/libc/constant.O_NONBLOCK.html delete mode 100644 doc/libc/constant.O_RDONLY.html delete mode 100644 doc/libc/constant.O_RDWR.html delete mode 100644 doc/libc/constant.O_SYNC.html delete mode 100644 doc/libc/constant.O_TRUNC.html delete mode 100644 doc/libc/constant.O_WRONLY.html delete mode 100644 doc/libc/constant.PARENB.html delete mode 100644 doc/libc/constant.PARMRK.html delete mode 100644 doc/libc/constant.PARODD.html delete mode 100644 doc/libc/constant.PATH_MAX.html delete mode 100644 doc/libc/constant.PENDIN.html delete mode 100644 doc/libc/constant.PM_STR.html delete mode 100644 doc/libc/constant.POLLERR.html delete mode 100644 doc/libc/constant.POLLHUP.html delete mode 100644 doc/libc/constant.POLLIN.html delete mode 100644 doc/libc/constant.POLLNVAL.html delete mode 100644 doc/libc/constant.POLLOUT.html delete mode 100644 doc/libc/constant.POLLPRI.html delete mode 100644 doc/libc/constant.POSIX_MADV_DONTNEED.html delete mode 100644 doc/libc/constant.POSIX_MADV_NORMAL.html delete mode 100644 doc/libc/constant.POSIX_MADV_RANDOM.html delete mode 100644 doc/libc/constant.POSIX_MADV_SEQUENTIAL.html delete mode 100644 doc/libc/constant.POSIX_MADV_WILLNEED.html delete mode 100644 doc/libc/constant.PROT_EXEC.html delete mode 100644 doc/libc/constant.PROT_NONE.html delete mode 100644 doc/libc/constant.PROT_READ.html delete mode 100644 doc/libc/constant.PROT_WRITE.html delete mode 100644 doc/libc/constant.PTHREAD_COND_INITIALIZER.html delete mode 100644 doc/libc/constant.PTHREAD_CREATE_DETACHED.html delete mode 100644 doc/libc/constant.PTHREAD_CREATE_JOINABLE.html delete mode 100644 doc/libc/constant.PTHREAD_MUTEX_INITIALIZER.html delete mode 100644 doc/libc/constant.PTHREAD_MUTEX_RECURSIVE.html delete mode 100644 doc/libc/constant.PTHREAD_RWLOCK_INITIALIZER.html delete mode 100644 doc/libc/constant.PTHREAD_STACK_MIN.html delete mode 100644 doc/libc/constant.Q_GETQUOTA.html delete mode 100644 doc/libc/constant.Q_QUOTAOFF.html delete mode 100644 doc/libc/constant.Q_QUOTAON.html delete mode 100644 doc/libc/constant.Q_SETQUOTA.html delete mode 100644 doc/libc/constant.Q_SYNC.html delete mode 100644 doc/libc/constant.RADIXCHAR.html delete mode 100644 doc/libc/constant.RAND_MAX.html delete mode 100644 doc/libc/constant.RLIMIT_AS.html delete mode 100644 doc/libc/constant.RLIMIT_CORE.html delete mode 100644 doc/libc/constant.RLIMIT_CPU.html delete mode 100644 doc/libc/constant.RLIMIT_DATA.html delete mode 100644 doc/libc/constant.RLIMIT_FSIZE.html delete mode 100644 doc/libc/constant.RLIMIT_MEMLOCK.html delete mode 100644 doc/libc/constant.RLIMIT_NOFILE.html delete mode 100644 doc/libc/constant.RLIMIT_NPROC.html delete mode 100644 doc/libc/constant.RLIMIT_RSS.html delete mode 100644 doc/libc/constant.RLIMIT_STACK.html delete mode 100644 doc/libc/constant.RLIM_INFINITY.html delete mode 100644 doc/libc/constant.RLIM_NLIMITS.html delete mode 100644 doc/libc/constant.RTLD_DEFAULT.html delete mode 100644 doc/libc/constant.RTLD_FIRST.html delete mode 100644 doc/libc/constant.RTLD_GLOBAL.html delete mode 100644 doc/libc/constant.RTLD_LAZY.html delete mode 100644 doc/libc/constant.RTLD_LOCAL.html delete mode 100644 doc/libc/constant.RTLD_NODELETE.html delete mode 100644 doc/libc/constant.RTLD_NOLOAD.html delete mode 100644 doc/libc/constant.RTLD_NOW.html delete mode 100644 doc/libc/constant.RUSAGE_CHILDREN.html delete mode 100644 doc/libc/constant.RUSAGE_SELF.html delete mode 100644 doc/libc/constant.R_OK.html delete mode 100644 doc/libc/constant.SA_NOCLDSTOP.html delete mode 100644 doc/libc/constant.SA_NOCLDWAIT.html delete mode 100644 doc/libc/constant.SA_NODEFER.html delete mode 100644 doc/libc/constant.SA_ONSTACK.html delete mode 100644 doc/libc/constant.SA_RESETHAND.html delete mode 100644 doc/libc/constant.SA_RESTART.html delete mode 100644 doc/libc/constant.SA_SIGINFO.html delete mode 100644 doc/libc/constant.SEEK_CUR.html delete mode 100644 doc/libc/constant.SEEK_END.html delete mode 100644 doc/libc/constant.SEEK_SET.html delete mode 100644 doc/libc/constant.SHUT_RD.html delete mode 100644 doc/libc/constant.SHUT_RDWR.html delete mode 100644 doc/libc/constant.SHUT_WR.html delete mode 100644 doc/libc/constant.SIGABRT.html delete mode 100644 doc/libc/constant.SIGALRM.html delete mode 100644 doc/libc/constant.SIGBUS.html delete mode 100644 doc/libc/constant.SIGCHLD.html delete mode 100644 doc/libc/constant.SIGCONT.html delete mode 100644 doc/libc/constant.SIGEMT.html delete mode 100644 doc/libc/constant.SIGFPE.html delete mode 100644 doc/libc/constant.SIGHUP.html delete mode 100644 doc/libc/constant.SIGILL.html delete mode 100644 doc/libc/constant.SIGINFO.html delete mode 100644 doc/libc/constant.SIGINT.html delete mode 100644 doc/libc/constant.SIGIO.html delete mode 100644 doc/libc/constant.SIGIOT.html delete mode 100644 doc/libc/constant.SIGKILL.html delete mode 100644 doc/libc/constant.SIGPIPE.html delete mode 100644 doc/libc/constant.SIGPROF.html delete mode 100644 doc/libc/constant.SIGQUIT.html delete mode 100644 doc/libc/constant.SIGSEGV.html delete mode 100644 doc/libc/constant.SIGSTKSZ.html delete mode 100644 doc/libc/constant.SIGSTOP.html delete mode 100644 doc/libc/constant.SIGSYS.html delete mode 100644 doc/libc/constant.SIGTERM.html delete mode 100644 doc/libc/constant.SIGTRAP.html delete mode 100644 doc/libc/constant.SIGTSTP.html delete mode 100644 doc/libc/constant.SIGTTIN.html delete mode 100644 doc/libc/constant.SIGTTOU.html delete mode 100644 doc/libc/constant.SIGURG.html delete mode 100644 doc/libc/constant.SIGUSR1.html delete mode 100644 doc/libc/constant.SIGUSR2.html delete mode 100644 doc/libc/constant.SIGVTALRM.html delete mode 100644 doc/libc/constant.SIGWINCH.html delete mode 100644 doc/libc/constant.SIGXCPU.html delete mode 100644 doc/libc/constant.SIGXFSZ.html delete mode 100644 doc/libc/constant.SIG_BLOCK.html delete mode 100644 doc/libc/constant.SIG_DFL.html delete mode 100644 doc/libc/constant.SIG_ERR.html delete mode 100644 doc/libc/constant.SIG_IGN.html delete mode 100644 doc/libc/constant.SIG_SETMASK.html delete mode 100644 doc/libc/constant.SIG_UNBLOCK.html delete mode 100644 doc/libc/constant.SOCK_DGRAM.html delete mode 100644 doc/libc/constant.SOCK_RAW.html delete mode 100644 doc/libc/constant.SOCK_STREAM.html delete mode 100644 doc/libc/constant.SOL_SOCKET.html delete mode 100644 doc/libc/constant.SO_ACCEPTCONN.html delete mode 100644 doc/libc/constant.SO_BROADCAST.html delete mode 100644 doc/libc/constant.SO_DEBUG.html delete mode 100644 doc/libc/constant.SO_DONTROUTE.html delete mode 100644 doc/libc/constant.SO_DONTTRUNC.html delete mode 100644 doc/libc/constant.SO_ERROR.html delete mode 100644 doc/libc/constant.SO_KEEPALIVE.html delete mode 100644 doc/libc/constant.SO_LINGER.html delete mode 100644 doc/libc/constant.SO_NKE.html delete mode 100644 doc/libc/constant.SO_NOADDRERR.html delete mode 100644 doc/libc/constant.SO_NOSIGPIPE.html delete mode 100644 doc/libc/constant.SO_NREAD.html delete mode 100644 doc/libc/constant.SO_NWRITE.html delete mode 100644 doc/libc/constant.SO_OOBINLINE.html delete mode 100644 doc/libc/constant.SO_RCVBUF.html delete mode 100644 doc/libc/constant.SO_RCVLOWAT.html delete mode 100644 doc/libc/constant.SO_RCVTIMEO.html delete mode 100644 doc/libc/constant.SO_REUSEADDR.html delete mode 100644 doc/libc/constant.SO_REUSEPORT.html delete mode 100644 doc/libc/constant.SO_SNDBUF.html delete mode 100644 doc/libc/constant.SO_SNDLOWAT.html delete mode 100644 doc/libc/constant.SO_SNDTIMEO.html delete mode 100644 doc/libc/constant.SO_TYPE.html delete mode 100644 doc/libc/constant.SO_USELOOPBACK.html delete mode 100644 doc/libc/constant.SO_WANTMORE.html delete mode 100644 doc/libc/constant.SO_WANTOOBFLAG.html delete mode 100644 doc/libc/constant.SS_DISABLE.html delete mode 100644 doc/libc/constant.SS_ONSTACK.html delete mode 100644 doc/libc/constant.STDERR_FILENO.html delete mode 100644 doc/libc/constant.STDIN_FILENO.html delete mode 100644 doc/libc/constant.STDOUT_FILENO.html delete mode 100644 doc/libc/constant.ST_NOSUID.html delete mode 100644 doc/libc/constant.ST_RDONLY.html delete mode 100644 doc/libc/constant.S_IEXEC.html delete mode 100644 doc/libc/constant.S_IFBLK.html delete mode 100644 doc/libc/constant.S_IFCHR.html delete mode 100644 doc/libc/constant.S_IFDIR.html delete mode 100644 doc/libc/constant.S_IFIFO.html delete mode 100644 doc/libc/constant.S_IFLNK.html delete mode 100644 doc/libc/constant.S_IFMT.html delete mode 100644 doc/libc/constant.S_IFREG.html delete mode 100644 doc/libc/constant.S_IFSOCK.html delete mode 100644 doc/libc/constant.S_IREAD.html delete mode 100644 doc/libc/constant.S_IRGRP.html delete mode 100644 doc/libc/constant.S_IROTH.html delete mode 100644 doc/libc/constant.S_IRUSR.html delete mode 100644 doc/libc/constant.S_IRWXG.html delete mode 100644 doc/libc/constant.S_IRWXO.html delete mode 100644 doc/libc/constant.S_IRWXU.html delete mode 100644 doc/libc/constant.S_ISGID.html delete mode 100644 doc/libc/constant.S_ISUID.html delete mode 100644 doc/libc/constant.S_ISVTX.html delete mode 100644 doc/libc/constant.S_IWGRP.html delete mode 100644 doc/libc/constant.S_IWOTH.html delete mode 100644 doc/libc/constant.S_IWRITE.html delete mode 100644 doc/libc/constant.S_IWUSR.html delete mode 100644 doc/libc/constant.S_IXGRP.html delete mode 100644 doc/libc/constant.S_IXOTH.html delete mode 100644 doc/libc/constant.S_IXUSR.html delete mode 100644 doc/libc/constant.TAB0.html delete mode 100644 doc/libc/constant.TAB1.html delete mode 100644 doc/libc/constant.TAB2.html delete mode 100644 doc/libc/constant.TAB3.html delete mode 100644 doc/libc/constant.TCIFLUSH.html delete mode 100644 doc/libc/constant.TCIOFF.html delete mode 100644 doc/libc/constant.TCIOFLUSH.html delete mode 100644 doc/libc/constant.TCION.html delete mode 100644 doc/libc/constant.TCOFLUSH.html delete mode 100644 doc/libc/constant.TCOOFF.html delete mode 100644 doc/libc/constant.TCOON.html delete mode 100644 doc/libc/constant.TCP_KEEPALIVE.html delete mode 100644 doc/libc/constant.TCP_NODELAY.html delete mode 100644 doc/libc/constant.TCSADRAIN.html delete mode 100644 doc/libc/constant.TCSAFLUSH.html delete mode 100644 doc/libc/constant.TCSANOW.html delete mode 100644 doc/libc/constant.THOUSEP.html delete mode 100644 doc/libc/constant.TIOCCBRK.html delete mode 100644 doc/libc/constant.TIOCCDTR.html delete mode 100644 doc/libc/constant.TIOCCONS.html delete mode 100644 doc/libc/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/constant.TIOCDRAIN.html delete mode 100644 doc/libc/constant.TIOCDSIMICROCODE.html delete mode 100644 doc/libc/constant.TIOCEXCL.html delete mode 100644 doc/libc/constant.TIOCEXT.html delete mode 100644 doc/libc/constant.TIOCFLUSH.html delete mode 100644 doc/libc/constant.TIOCGDRAINWAIT.html delete mode 100644 doc/libc/constant.TIOCGETD.html delete mode 100644 doc/libc/constant.TIOCGPGRP.html delete mode 100644 doc/libc/constant.TIOCGWINSZ.html delete mode 100644 doc/libc/constant.TIOCIXOFF.html delete mode 100644 doc/libc/constant.TIOCIXON.html delete mode 100644 doc/libc/constant.TIOCMBIC.html delete mode 100644 doc/libc/constant.TIOCMBIS.html delete mode 100644 doc/libc/constant.TIOCMGDTRWAIT.html delete mode 100644 doc/libc/constant.TIOCMGET.html delete mode 100644 doc/libc/constant.TIOCMODG.html delete mode 100644 doc/libc/constant.TIOCMODS.html delete mode 100644 doc/libc/constant.TIOCMSDTRWAIT.html delete mode 100644 doc/libc/constant.TIOCMSET.html delete mode 100644 doc/libc/constant.TIOCM_CAR.html delete mode 100644 doc/libc/constant.TIOCM_CD.html delete mode 100644 doc/libc/constant.TIOCM_CTS.html delete mode 100644 doc/libc/constant.TIOCM_DSR.html delete mode 100644 doc/libc/constant.TIOCM_DTR.html delete mode 100644 doc/libc/constant.TIOCM_LE.html delete mode 100644 doc/libc/constant.TIOCM_RI.html delete mode 100644 doc/libc/constant.TIOCM_RNG.html delete mode 100644 doc/libc/constant.TIOCM_RTS.html delete mode 100644 doc/libc/constant.TIOCM_SR.html delete mode 100644 doc/libc/constant.TIOCM_ST.html delete mode 100644 doc/libc/constant.TIOCNOTTY.html delete mode 100644 doc/libc/constant.TIOCNXCL.html delete mode 100644 doc/libc/constant.TIOCOUTQ.html delete mode 100644 doc/libc/constant.TIOCPKT.html delete mode 100644 doc/libc/constant.TIOCPKT_DATA.html delete mode 100644 doc/libc/constant.TIOCPKT_DOSTOP.html delete mode 100644 doc/libc/constant.TIOCPKT_FLUSHREAD.html delete mode 100644 doc/libc/constant.TIOCPKT_FLUSHWRITE.html delete mode 100644 doc/libc/constant.TIOCPKT_IOCTL.html delete mode 100644 doc/libc/constant.TIOCPKT_NOSTOP.html delete mode 100644 doc/libc/constant.TIOCPKT_START.html delete mode 100644 doc/libc/constant.TIOCPKT_STOP.html delete mode 100644 doc/libc/constant.TIOCPTYGNAME.html delete mode 100644 doc/libc/constant.TIOCPTYGRANT.html delete mode 100644 doc/libc/constant.TIOCPTYUNLK.html delete mode 100644 doc/libc/constant.TIOCREMOTE.html delete mode 100644 doc/libc/constant.TIOCSBRK.html delete mode 100644 doc/libc/constant.TIOCSCONS.html delete mode 100644 doc/libc/constant.TIOCSCTTY.html delete mode 100644 doc/libc/constant.TIOCSDRAINWAIT.html delete mode 100644 doc/libc/constant.TIOCSDTR.html delete mode 100644 doc/libc/constant.TIOCSETD.html delete mode 100644 doc/libc/constant.TIOCSIG.html delete mode 100644 doc/libc/constant.TIOCSPGRP.html delete mode 100644 doc/libc/constant.TIOCSTART.html delete mode 100644 doc/libc/constant.TIOCSTAT.html delete mode 100644 doc/libc/constant.TIOCSTI.html delete mode 100644 doc/libc/constant.TIOCSTOP.html delete mode 100644 doc/libc/constant.TIOCSWINSZ.html delete mode 100644 doc/libc/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/constant.TIOCUCNTL.html delete mode 100644 doc/libc/constant.TMP_MAX.html delete mode 100644 doc/libc/constant.TOSTOP.html delete mode 100644 doc/libc/constant.T_FMT.html delete mode 100644 doc/libc/constant.T_FMT_AMPM.html delete mode 100644 doc/libc/constant.USRQUOTA.html delete mode 100644 doc/libc/constant.VDISCARD.html delete mode 100644 doc/libc/constant.VEOF.html delete mode 100644 doc/libc/constant.VEOL.html delete mode 100644 doc/libc/constant.VEOL2.html delete mode 100644 doc/libc/constant.VERASE.html delete mode 100644 doc/libc/constant.VINTR.html delete mode 100644 doc/libc/constant.VKILL.html delete mode 100644 doc/libc/constant.VLNEXT.html delete mode 100644 doc/libc/constant.VMIN.html delete mode 100644 doc/libc/constant.VQUIT.html delete mode 100644 doc/libc/constant.VREPRINT.html delete mode 100644 doc/libc/constant.VSTART.html delete mode 100644 doc/libc/constant.VSTOP.html delete mode 100644 doc/libc/constant.VSUSP.html delete mode 100644 doc/libc/constant.VT0.html delete mode 100644 doc/libc/constant.VT1.html delete mode 100644 doc/libc/constant.VTIME.html delete mode 100644 doc/libc/constant.VWERASE.html delete mode 100644 doc/libc/constant.WNOHANG.html delete mode 100644 doc/libc/constant.W_OK.html delete mode 100644 doc/libc/constant.X_OK.html delete mode 100644 doc/libc/constant.YESEXPR.html delete mode 100644 doc/libc/constant.YESSTR.html delete mode 100644 doc/libc/constant._IOFBF.html delete mode 100644 doc/libc/constant._IOLBF.html delete mode 100644 doc/libc/constant._IONBF.html delete mode 100644 doc/libc/constant._PC_NAME_MAX.html delete mode 100644 doc/libc/constant._PTHREAD_COND_SIG_init.html delete mode 100644 doc/libc/constant._PTHREAD_MUTEX_SIG_init.html delete mode 100644 doc/libc/constant._PTHREAD_RWLOCK_SIG_init.html delete mode 100644 doc/libc/constant._RLIMIT_POSIX_FLAG.html delete mode 100644 doc/libc/constant._SC_2_CHAR_TERM.html delete mode 100644 doc/libc/constant._SC_2_C_BIND.html delete mode 100644 doc/libc/constant._SC_2_C_DEV.html delete mode 100644 doc/libc/constant._SC_2_FORT_DEV.html delete mode 100644 doc/libc/constant._SC_2_FORT_RUN.html delete mode 100644 doc/libc/constant._SC_2_LOCALEDEF.html delete mode 100644 doc/libc/constant._SC_2_PBS.html delete mode 100644 doc/libc/constant._SC_2_PBS_ACCOUNTING.html delete mode 100644 doc/libc/constant._SC_2_PBS_CHECKPOINT.html delete mode 100644 doc/libc/constant._SC_2_PBS_LOCATE.html delete mode 100644 doc/libc/constant._SC_2_PBS_MESSAGE.html delete mode 100644 doc/libc/constant._SC_2_PBS_TRACK.html delete mode 100644 doc/libc/constant._SC_2_SW_DEV.html delete mode 100644 doc/libc/constant._SC_2_UPE.html delete mode 100644 doc/libc/constant._SC_2_VERSION.html delete mode 100644 doc/libc/constant._SC_ADVISORY_INFO.html delete mode 100644 doc/libc/constant._SC_AIO_LISTIO_MAX.html delete mode 100644 doc/libc/constant._SC_AIO_MAX.html delete mode 100644 doc/libc/constant._SC_AIO_PRIO_DELTA_MAX.html delete mode 100644 doc/libc/constant._SC_ARG_MAX.html delete mode 100644 doc/libc/constant._SC_ASYNCHRONOUS_IO.html delete mode 100644 doc/libc/constant._SC_ATEXIT_MAX.html delete mode 100644 doc/libc/constant._SC_BARRIERS.html delete mode 100644 doc/libc/constant._SC_BC_BASE_MAX.html delete mode 100644 doc/libc/constant._SC_BC_DIM_MAX.html delete mode 100644 doc/libc/constant._SC_BC_SCALE_MAX.html delete mode 100644 doc/libc/constant._SC_BC_STRING_MAX.html delete mode 100644 doc/libc/constant._SC_CHILD_MAX.html delete mode 100644 doc/libc/constant._SC_CLK_TCK.html delete mode 100644 doc/libc/constant._SC_CLOCK_SELECTION.html delete mode 100644 doc/libc/constant._SC_COLL_WEIGHTS_MAX.html delete mode 100644 doc/libc/constant._SC_CPUTIME.html delete mode 100644 doc/libc/constant._SC_DELAYTIMER_MAX.html delete mode 100644 doc/libc/constant._SC_EXPR_NEST_MAX.html delete mode 100644 doc/libc/constant._SC_FILE_LOCKING.html delete mode 100644 doc/libc/constant._SC_FSYNC.html delete mode 100644 doc/libc/constant._SC_GETGR_R_SIZE_MAX.html delete mode 100644 doc/libc/constant._SC_GETPW_R_SIZE_MAX.html delete mode 100644 doc/libc/constant._SC_HOST_NAME_MAX.html delete mode 100644 doc/libc/constant._SC_IOV_MAX.html delete mode 100644 doc/libc/constant._SC_IPV6.html delete mode 100644 doc/libc/constant._SC_JOB_CONTROL.html delete mode 100644 doc/libc/constant._SC_LINE_MAX.html delete mode 100644 doc/libc/constant._SC_LOGIN_NAME_MAX.html delete mode 100644 doc/libc/constant._SC_MAPPED_FILES.html delete mode 100644 doc/libc/constant._SC_MEMLOCK.html delete mode 100644 doc/libc/constant._SC_MEMLOCK_RANGE.html delete mode 100644 doc/libc/constant._SC_MEMORY_PROTECTION.html delete mode 100644 doc/libc/constant._SC_MESSAGE_PASSING.html delete mode 100644 doc/libc/constant._SC_MONOTONIC_CLOCK.html delete mode 100644 doc/libc/constant._SC_MQ_OPEN_MAX.html delete mode 100644 doc/libc/constant._SC_MQ_PRIO_MAX.html delete mode 100644 doc/libc/constant._SC_NGROUPS_MAX.html delete mode 100644 doc/libc/constant._SC_NPROCESSORS_CONF.html delete mode 100644 doc/libc/constant._SC_NPROCESSORS_ONLN.html delete mode 100644 doc/libc/constant._SC_OPEN_MAX.html delete mode 100644 doc/libc/constant._SC_PAGESIZE.html delete mode 100644 doc/libc/constant._SC_PAGE_SIZE.html delete mode 100644 doc/libc/constant._SC_PASS_MAX.html delete mode 100644 doc/libc/constant._SC_PRIORITIZED_IO.html delete mode 100644 doc/libc/constant._SC_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/constant._SC_RAW_SOCKETS.html delete mode 100644 doc/libc/constant._SC_READER_WRITER_LOCKS.html delete mode 100644 doc/libc/constant._SC_REALTIME_SIGNALS.html delete mode 100644 doc/libc/constant._SC_REGEXP.html delete mode 100644 doc/libc/constant._SC_RE_DUP_MAX.html delete mode 100644 doc/libc/constant._SC_RTSIG_MAX.html delete mode 100644 doc/libc/constant._SC_SAVED_IDS.html delete mode 100644 doc/libc/constant._SC_SEMAPHORES.html delete mode 100644 doc/libc/constant._SC_SEM_NSEMS_MAX.html delete mode 100644 doc/libc/constant._SC_SEM_VALUE_MAX.html delete mode 100644 doc/libc/constant._SC_SHARED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/constant._SC_SHELL.html delete mode 100644 doc/libc/constant._SC_SIGQUEUE_MAX.html delete mode 100644 doc/libc/constant._SC_SPAWN.html delete mode 100644 doc/libc/constant._SC_SPIN_LOCKS.html delete mode 100644 doc/libc/constant._SC_SPORADIC_SERVER.html delete mode 100644 doc/libc/constant._SC_SS_REPL_MAX.html delete mode 100644 doc/libc/constant._SC_STREAM_MAX.html delete mode 100644 doc/libc/constant._SC_SYMLOOP_MAX.html delete mode 100644 doc/libc/constant._SC_SYNCHRONIZED_IO.html delete mode 100644 doc/libc/constant._SC_THREADS.html delete mode 100644 doc/libc/constant._SC_THREAD_ATTR_STACKADDR.html delete mode 100644 doc/libc/constant._SC_THREAD_ATTR_STACKSIZE.html delete mode 100644 doc/libc/constant._SC_THREAD_CPUTIME.html delete mode 100644 doc/libc/constant._SC_THREAD_DESTRUCTOR_ITERATIONS.html delete mode 100644 doc/libc/constant._SC_THREAD_KEYS_MAX.html delete mode 100644 doc/libc/constant._SC_THREAD_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/constant._SC_THREAD_PRIO_INHERIT.html delete mode 100644 doc/libc/constant._SC_THREAD_PRIO_PROTECT.html delete mode 100644 doc/libc/constant._SC_THREAD_PROCESS_SHARED.html delete mode 100644 doc/libc/constant._SC_THREAD_SAFE_FUNCTIONS.html delete mode 100644 doc/libc/constant._SC_THREAD_SPORADIC_SERVER.html delete mode 100644 doc/libc/constant._SC_THREAD_STACK_MIN.html delete mode 100644 doc/libc/constant._SC_THREAD_THREADS_MAX.html delete mode 100644 doc/libc/constant._SC_TIMEOUTS.html delete mode 100644 doc/libc/constant._SC_TIMERS.html delete mode 100644 doc/libc/constant._SC_TIMER_MAX.html delete mode 100644 doc/libc/constant._SC_TRACE.html delete mode 100644 doc/libc/constant._SC_TRACE_EVENT_FILTER.html delete mode 100644 doc/libc/constant._SC_TRACE_EVENT_NAME_MAX.html delete mode 100644 doc/libc/constant._SC_TRACE_INHERIT.html delete mode 100644 doc/libc/constant._SC_TRACE_LOG.html delete mode 100644 doc/libc/constant._SC_TRACE_NAME_MAX.html delete mode 100644 doc/libc/constant._SC_TRACE_SYS_MAX.html delete mode 100644 doc/libc/constant._SC_TRACE_USER_EVENT_MAX.html delete mode 100644 doc/libc/constant._SC_TTY_NAME_MAX.html delete mode 100644 doc/libc/constant._SC_TYPED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/constant._SC_TZNAME_MAX.html delete mode 100644 doc/libc/constant._SC_V6_ILP32_OFF32.html delete mode 100644 doc/libc/constant._SC_V6_ILP32_OFFBIG.html delete mode 100644 doc/libc/constant._SC_V6_LP64_OFF64.html delete mode 100644 doc/libc/constant._SC_V6_LPBIG_OFFBIG.html delete mode 100644 doc/libc/constant._SC_VERSION.html delete mode 100644 doc/libc/constant._SC_XBS5_ILP32_OFF32.html delete mode 100644 doc/libc/constant._SC_XBS5_ILP32_OFFBIG.html delete mode 100644 doc/libc/constant._SC_XBS5_LP64_OFF64.html delete mode 100644 doc/libc/constant._SC_XBS5_LPBIG_OFFBIG.html delete mode 100644 doc/libc/constant._SC_XOPEN_CRYPT.html delete mode 100644 doc/libc/constant._SC_XOPEN_ENH_I18N.html delete mode 100644 doc/libc/constant._SC_XOPEN_LEGACY.html delete mode 100644 doc/libc/constant._SC_XOPEN_REALTIME.html delete mode 100644 doc/libc/constant._SC_XOPEN_REALTIME_THREADS.html delete mode 100644 doc/libc/constant._SC_XOPEN_SHM.html delete mode 100644 doc/libc/constant._SC_XOPEN_STREAMS.html delete mode 100644 doc/libc/constant._SC_XOPEN_UNIX.html delete mode 100644 doc/libc/constant._SC_XOPEN_VERSION.html delete mode 100644 doc/libc/constant._SC_XOPEN_XCU_VERSION.html delete mode 100644 doc/libc/constant._WSTOPPED.html delete mode 100644 doc/libc/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/dox/enum.Option.html delete mode 100644 doc/libc/dox/imp/enum.Option.html delete mode 100644 doc/libc/dox/imp/index.html delete mode 100644 doc/libc/dox/imp/mem/constant.POST_DROP_U32.html delete mode 100644 doc/libc/dox/imp/mem/constant.POST_DROP_U64.html delete mode 100644 doc/libc/dox/imp/mem/constant.POST_DROP_U8.html delete mode 100644 doc/libc/dox/imp/mem/constant.POST_DROP_USIZE.html delete mode 100644 doc/libc/dox/imp/mem/fn.align_of.html delete mode 100644 doc/libc/dox/imp/mem/fn.align_of_val.html delete mode 100644 doc/libc/dox/imp/mem/fn.drop.html delete mode 100644 doc/libc/dox/imp/mem/fn.dropped.html delete mode 100644 doc/libc/dox/imp/mem/fn.forget.html delete mode 100644 doc/libc/dox/imp/mem/fn.min_align_of.html delete mode 100644 doc/libc/dox/imp/mem/fn.min_align_of_val.html delete mode 100644 doc/libc/dox/imp/mem/fn.replace.html delete mode 100644 doc/libc/dox/imp/mem/fn.size_of.html delete mode 100644 doc/libc/dox/imp/mem/fn.size_of_val.html delete mode 100644 doc/libc/dox/imp/mem/fn.swap.html delete mode 100644 doc/libc/dox/imp/mem/fn.transmute.html delete mode 100644 doc/libc/dox/imp/mem/fn.transmute_copy.html delete mode 100644 doc/libc/dox/imp/mem/fn.uninitialized.html delete mode 100644 doc/libc/dox/imp/mem/fn.zeroed.html delete mode 100644 doc/libc/dox/imp/mem/index.html delete mode 100644 doc/libc/dox/imp/mem/sidebar-items.js delete mode 100644 doc/libc/dox/imp/sidebar-items.js delete mode 100644 doc/libc/dox/imp/trait.Clone.html delete mode 100644 doc/libc/dox/imp/trait.Copy.html delete mode 100644 doc/libc/dox/index.html delete mode 100644 doc/libc/dox/mem/constant.POST_DROP_U32.html delete mode 100644 doc/libc/dox/mem/constant.POST_DROP_U64.html delete mode 100644 doc/libc/dox/mem/constant.POST_DROP_U8.html delete mode 100644 doc/libc/dox/mem/constant.POST_DROP_USIZE.html delete mode 100644 doc/libc/dox/mem/fn.align_of.html delete mode 100644 doc/libc/dox/mem/fn.align_of_val.html delete mode 100644 doc/libc/dox/mem/fn.drop.html delete mode 100644 doc/libc/dox/mem/fn.dropped.html delete mode 100644 doc/libc/dox/mem/fn.forget.html delete mode 100644 doc/libc/dox/mem/fn.min_align_of.html delete mode 100644 doc/libc/dox/mem/fn.min_align_of_val.html delete mode 100644 doc/libc/dox/mem/fn.replace.html delete mode 100644 doc/libc/dox/mem/fn.size_of.html delete mode 100644 doc/libc/dox/mem/fn.size_of_val.html delete mode 100644 doc/libc/dox/mem/fn.swap.html delete mode 100644 doc/libc/dox/mem/fn.transmute.html delete mode 100644 doc/libc/dox/mem/fn.transmute_copy.html delete mode 100644 doc/libc/dox/mem/fn.uninitialized.html delete mode 100644 doc/libc/dox/mem/fn.zeroed.html delete mode 100644 doc/libc/dox/mem/index.html delete mode 100644 doc/libc/dox/mem/sidebar-items.js delete mode 100644 doc/libc/dox/sidebar-items.js delete mode 100644 doc/libc/dox/trait.Clone.html delete mode 100644 doc/libc/dox/trait.Copy.html delete mode 100644 doc/libc/enum.DIR.html delete mode 100644 doc/libc/enum.FILE.html delete mode 100644 doc/libc/enum.c_void.html delete mode 100644 doc/libc/enum.fpos_t.html delete mode 100644 doc/libc/enum.locale_t.html delete mode 100644 doc/libc/enum.timezone.html delete mode 100644 doc/libc/fn.FD_CLR.html delete mode 100644 doc/libc/fn.FD_ISSET.html delete mode 100644 doc/libc/fn.FD_SET.html delete mode 100644 doc/libc/fn.FD_ZERO.html delete mode 100644 doc/libc/fn.WCOREDUMP.html delete mode 100644 doc/libc/fn.WEXITSTATUS.html delete mode 100644 doc/libc/fn.WIFCONTINUED.html delete mode 100644 doc/libc/fn.WIFEXITED.html delete mode 100644 doc/libc/fn.WIFSIGNALED.html delete mode 100644 doc/libc/fn.WIFSTOPPED.html delete mode 100644 doc/libc/fn.WSTOPSIG.html delete mode 100644 doc/libc/fn.WTERMSIG.html delete mode 100644 doc/libc/fn._WSTATUS.html delete mode 100644 doc/libc/fn.__error.html delete mode 100644 doc/libc/fn._exit.html delete mode 100644 doc/libc/fn.abort.html delete mode 100644 doc/libc/fn.abs.html delete mode 100644 doc/libc/fn.accept.html delete mode 100644 doc/libc/fn.access.html delete mode 100644 doc/libc/fn.alarm.html delete mode 100644 doc/libc/fn.atexit.html delete mode 100644 doc/libc/fn.atof.html delete mode 100644 doc/libc/fn.atoi.html delete mode 100644 doc/libc/fn.backtrace.html delete mode 100644 doc/libc/fn.bind.html delete mode 100644 doc/libc/fn.calloc.html delete mode 100644 doc/libc/fn.cfgetispeed.html delete mode 100644 doc/libc/fn.cfgetospeed.html delete mode 100644 doc/libc/fn.cfsetispeed.html delete mode 100644 doc/libc/fn.cfsetospeed.html delete mode 100644 doc/libc/fn.chdir.html delete mode 100644 doc/libc/fn.chmod.html delete mode 100644 doc/libc/fn.chown.html delete mode 100644 doc/libc/fn.chroot.html delete mode 100644 doc/libc/fn.close.html delete mode 100644 doc/libc/fn.closedir.html delete mode 100644 doc/libc/fn.connect.html delete mode 100644 doc/libc/fn.creat.html delete mode 100644 doc/libc/fn.daemon.html delete mode 100644 doc/libc/fn.dladdr.html delete mode 100644 doc/libc/fn.dlclose.html delete mode 100644 doc/libc/fn.dlerror.html delete mode 100644 doc/libc/fn.dlopen.html delete mode 100644 doc/libc/fn.dlsym.html delete mode 100644 doc/libc/fn.dup.html delete mode 100644 doc/libc/fn.dup2.html delete mode 100644 doc/libc/fn.duplocale.html delete mode 100644 doc/libc/fn.execv.html delete mode 100644 doc/libc/fn.execve.html delete mode 100644 doc/libc/fn.execvp.html delete mode 100644 doc/libc/fn.exit.html delete mode 100644 doc/libc/fn.fchmod.html delete mode 100644 doc/libc/fn.fclose.html delete mode 100644 doc/libc/fn.fcntl.html delete mode 100644 doc/libc/fn.fdopen.html delete mode 100644 doc/libc/fn.feof.html delete mode 100644 doc/libc/fn.ferror.html delete mode 100644 doc/libc/fn.fflush.html delete mode 100644 doc/libc/fn.fgetc.html delete mode 100644 doc/libc/fn.fgetpos.html delete mode 100644 doc/libc/fn.fgets.html delete mode 100644 doc/libc/fn.fileno.html delete mode 100644 doc/libc/fn.flock.html delete mode 100644 doc/libc/fn.fopen.html delete mode 100644 doc/libc/fn.fork.html delete mode 100644 doc/libc/fn.forkpty.html delete mode 100644 doc/libc/fn.fpathconf.html delete mode 100644 doc/libc/fn.fprintf.html delete mode 100644 doc/libc/fn.fputc.html delete mode 100644 doc/libc/fn.fputs.html delete mode 100644 doc/libc/fn.fread.html delete mode 100644 doc/libc/fn.free.html delete mode 100644 doc/libc/fn.freeaddrinfo.html delete mode 100644 doc/libc/fn.freeifaddrs.html delete mode 100644 doc/libc/fn.freelocale.html delete mode 100644 doc/libc/fn.freopen.html delete mode 100644 doc/libc/fn.fscanf.html delete mode 100644 doc/libc/fn.fseek.html delete mode 100644 doc/libc/fn.fseeko.html delete mode 100644 doc/libc/fn.fsetpos.html delete mode 100644 doc/libc/fn.fstat.html delete mode 100644 doc/libc/fn.fstatfs.html delete mode 100644 doc/libc/fn.fstatvfs.html delete mode 100644 doc/libc/fn.fsync.html delete mode 100644 doc/libc/fn.ftell.html delete mode 100644 doc/libc/fn.ftello.html delete mode 100644 doc/libc/fn.ftruncate.html delete mode 100644 doc/libc/fn.futimes.html delete mode 100644 doc/libc/fn.fwrite.html delete mode 100644 doc/libc/fn.gai_strerror.html delete mode 100644 doc/libc/fn.getaddrinfo.html delete mode 100644 doc/libc/fn.getcwd.html delete mode 100644 doc/libc/fn.getdtablesize.html delete mode 100644 doc/libc/fn.getegid.html delete mode 100644 doc/libc/fn.getenv.html delete mode 100644 doc/libc/fn.geteuid.html delete mode 100644 doc/libc/fn.getgid.html delete mode 100644 doc/libc/fn.getgroups.html delete mode 100644 doc/libc/fn.gethostname.html delete mode 100644 doc/libc/fn.getifaddrs.html delete mode 100644 doc/libc/fn.getlogin.html delete mode 100644 doc/libc/fn.getnameinfo.html delete mode 100644 doc/libc/fn.getopt.html delete mode 100644 doc/libc/fn.getpeername.html delete mode 100644 doc/libc/fn.getpgrp.html delete mode 100644 doc/libc/fn.getpid.html delete mode 100644 doc/libc/fn.getppid.html delete mode 100644 doc/libc/fn.getpwuid_r.html delete mode 100644 doc/libc/fn.getrlimit.html delete mode 100644 doc/libc/fn.getrusage.html delete mode 100644 doc/libc/fn.getsid.html delete mode 100644 doc/libc/fn.getsockname.html delete mode 100644 doc/libc/fn.getsockopt.html delete mode 100644 doc/libc/fn.gettimeofday.html delete mode 100644 doc/libc/fn.getuid.html delete mode 100644 doc/libc/fn.glob.html delete mode 100644 doc/libc/fn.globfree.html delete mode 100644 doc/libc/fn.gmtime_r.html delete mode 100644 doc/libc/fn.if_indextoname.html delete mode 100644 doc/libc/fn.if_nametoindex.html delete mode 100644 doc/libc/fn.ioctl.html delete mode 100644 doc/libc/fn.isalnum.html delete mode 100644 doc/libc/fn.isalpha.html delete mode 100644 doc/libc/fn.isatty.html delete mode 100644 doc/libc/fn.iscntrl.html delete mode 100644 doc/libc/fn.isdigit.html delete mode 100644 doc/libc/fn.isgraph.html delete mode 100644 doc/libc/fn.islower.html delete mode 100644 doc/libc/fn.isprint.html delete mode 100644 doc/libc/fn.ispunct.html delete mode 100644 doc/libc/fn.isspace.html delete mode 100644 doc/libc/fn.isupper.html delete mode 100644 doc/libc/fn.isxdigit.html delete mode 100644 doc/libc/fn.kevent.html delete mode 100644 doc/libc/fn.kevent64.html delete mode 100644 doc/libc/fn.kill.html delete mode 100644 doc/libc/fn.kqueue.html delete mode 100644 doc/libc/fn.labs.html delete mode 100644 doc/libc/fn.link.html delete mode 100644 doc/libc/fn.listen.html delete mode 100644 doc/libc/fn.localeconv.html delete mode 100644 doc/libc/fn.localeconv_l.html delete mode 100644 doc/libc/fn.localtime_r.html delete mode 100644 doc/libc/fn.lseek.html delete mode 100644 doc/libc/fn.lstat.html delete mode 100644 doc/libc/fn.mach_absolute_time.html delete mode 100644 doc/libc/fn.mach_timebase_info.html delete mode 100644 doc/libc/fn.madvise.html delete mode 100644 doc/libc/fn.malloc.html delete mode 100644 doc/libc/fn.memchr.html delete mode 100644 doc/libc/fn.memcmp.html delete mode 100644 doc/libc/fn.mincore.html delete mode 100644 doc/libc/fn.mkdir.html delete mode 100644 doc/libc/fn.mkdtemp.html delete mode 100644 doc/libc/fn.mkfifo.html delete mode 100644 doc/libc/fn.mknod.html delete mode 100644 doc/libc/fn.mkstemp.html delete mode 100644 doc/libc/fn.mkstemps.html delete mode 100644 doc/libc/fn.mktime.html delete mode 100644 doc/libc/fn.mlock.html delete mode 100644 doc/libc/fn.mlockall.html delete mode 100644 doc/libc/fn.mmap.html delete mode 100644 doc/libc/fn.mount.html delete mode 100644 doc/libc/fn.mprotect.html delete mode 100644 doc/libc/fn.msync.html delete mode 100644 doc/libc/fn.munlock.html delete mode 100644 doc/libc/fn.munlockall.html delete mode 100644 doc/libc/fn.munmap.html delete mode 100644 doc/libc/fn.nanosleep.html delete mode 100644 doc/libc/fn.newlocale.html delete mode 100644 doc/libc/fn.nl_langinfo.html delete mode 100644 doc/libc/fn.open.html delete mode 100644 doc/libc/fn.opendir.html delete mode 100644 doc/libc/fn.openpty.html delete mode 100644 doc/libc/fn.pathconf.html delete mode 100644 doc/libc/fn.pause.html delete mode 100644 doc/libc/fn.pclose.html delete mode 100644 doc/libc/fn.perror.html delete mode 100644 doc/libc/fn.pipe.html delete mode 100644 doc/libc/fn.poll.html delete mode 100644 doc/libc/fn.popen.html delete mode 100644 doc/libc/fn.posix_madvise.html delete mode 100644 doc/libc/fn.posix_memalign.html delete mode 100644 doc/libc/fn.pread.html delete mode 100644 doc/libc/fn.printf.html delete mode 100644 doc/libc/fn.pselect.html delete mode 100644 doc/libc/fn.pthread_attr_destroy.html delete mode 100644 doc/libc/fn.pthread_attr_init.html delete mode 100644 doc/libc/fn.pthread_attr_setdetachstate.html delete mode 100644 doc/libc/fn.pthread_attr_setstacksize.html delete mode 100644 doc/libc/fn.pthread_cond_broadcast.html delete mode 100644 doc/libc/fn.pthread_cond_destroy.html delete mode 100644 doc/libc/fn.pthread_cond_signal.html delete mode 100644 doc/libc/fn.pthread_cond_timedwait.html delete mode 100644 doc/libc/fn.pthread_cond_wait.html delete mode 100644 doc/libc/fn.pthread_create.html delete mode 100644 doc/libc/fn.pthread_detach.html delete mode 100644 doc/libc/fn.pthread_get_stackaddr_np.html delete mode 100644 doc/libc/fn.pthread_get_stacksize_np.html delete mode 100644 doc/libc/fn.pthread_getspecific.html delete mode 100644 doc/libc/fn.pthread_join.html delete mode 100644 doc/libc/fn.pthread_key_create.html delete mode 100644 doc/libc/fn.pthread_key_delete.html delete mode 100644 doc/libc/fn.pthread_kill.html delete mode 100644 doc/libc/fn.pthread_mutex_destroy.html delete mode 100644 doc/libc/fn.pthread_mutex_init.html delete mode 100644 doc/libc/fn.pthread_mutex_lock.html delete mode 100644 doc/libc/fn.pthread_mutex_trylock.html delete mode 100644 doc/libc/fn.pthread_mutex_unlock.html delete mode 100644 doc/libc/fn.pthread_mutexattr_destroy.html delete mode 100644 doc/libc/fn.pthread_mutexattr_init.html delete mode 100644 doc/libc/fn.pthread_mutexattr_settype.html delete mode 100644 doc/libc/fn.pthread_rwlock_destroy.html delete mode 100644 doc/libc/fn.pthread_rwlock_rdlock.html delete mode 100644 doc/libc/fn.pthread_rwlock_tryrdlock.html delete mode 100644 doc/libc/fn.pthread_rwlock_trywrlock.html delete mode 100644 doc/libc/fn.pthread_rwlock_unlock.html delete mode 100644 doc/libc/fn.pthread_rwlock_wrlock.html delete mode 100644 doc/libc/fn.pthread_self.html delete mode 100644 doc/libc/fn.pthread_setname_np.html delete mode 100644 doc/libc/fn.pthread_setspecific.html delete mode 100644 doc/libc/fn.pthread_sigmask.html delete mode 100644 doc/libc/fn.ptrace.html delete mode 100644 doc/libc/fn.putenv.html delete mode 100644 doc/libc/fn.puts.html delete mode 100644 doc/libc/fn.pwrite.html delete mode 100644 doc/libc/fn.querylocale.html delete mode 100644 doc/libc/fn.quotactl.html delete mode 100644 doc/libc/fn.raise.html delete mode 100644 doc/libc/fn.rand.html delete mode 100644 doc/libc/fn.read.html delete mode 100644 doc/libc/fn.readdir_r.html delete mode 100644 doc/libc/fn.readlink.html delete mode 100644 doc/libc/fn.readv.html delete mode 100644 doc/libc/fn.realloc.html delete mode 100644 doc/libc/fn.realpath.html delete mode 100644 doc/libc/fn.recv.html delete mode 100644 doc/libc/fn.recvfrom.html delete mode 100644 doc/libc/fn.recvmsg.html delete mode 100644 doc/libc/fn.remove.html delete mode 100644 doc/libc/fn.rename.html delete mode 100644 doc/libc/fn.rewind.html delete mode 100644 doc/libc/fn.rewinddir.html delete mode 100644 doc/libc/fn.rmdir.html delete mode 100644 doc/libc/fn.scanf.html delete mode 100644 doc/libc/fn.sched_yield.html delete mode 100644 doc/libc/fn.seekdir.html delete mode 100644 doc/libc/fn.select.html delete mode 100644 doc/libc/fn.send.html delete mode 100644 doc/libc/fn.sendfile.html delete mode 100644 doc/libc/fn.sendmsg.html delete mode 100644 doc/libc/fn.sendto.html delete mode 100644 doc/libc/fn.setbuf.html delete mode 100644 doc/libc/fn.setenv.html delete mode 100644 doc/libc/fn.setgid.html delete mode 100644 doc/libc/fn.setgroups.html delete mode 100644 doc/libc/fn.sethostname.html delete mode 100644 doc/libc/fn.setlocale.html delete mode 100644 doc/libc/fn.setpgid.html delete mode 100644 doc/libc/fn.setrlimit.html delete mode 100644 doc/libc/fn.setsid.html delete mode 100644 doc/libc/fn.setsockopt.html delete mode 100644 doc/libc/fn.setuid.html delete mode 100644 doc/libc/fn.setvbuf.html delete mode 100644 doc/libc/fn.shm_open.html delete mode 100644 doc/libc/fn.shm_unlink.html delete mode 100644 doc/libc/fn.shutdown.html delete mode 100644 doc/libc/fn.sigaction.html delete mode 100644 doc/libc/fn.sigaddset.html delete mode 100644 doc/libc/fn.sigaltstack.html delete mode 100644 doc/libc/fn.sigdelset.html delete mode 100644 doc/libc/fn.sigemptyset.html delete mode 100644 doc/libc/fn.sigfillset.html delete mode 100644 doc/libc/fn.sigismember.html delete mode 100644 doc/libc/fn.signal.html delete mode 100644 doc/libc/fn.sigwait.html delete mode 100644 doc/libc/fn.sleep.html delete mode 100644 doc/libc/fn.snprintf.html delete mode 100644 doc/libc/fn.socket.html delete mode 100644 doc/libc/fn.socketpair.html delete mode 100644 doc/libc/fn.sprintf.html delete mode 100644 doc/libc/fn.srand.html delete mode 100644 doc/libc/fn.sscanf.html delete mode 100644 doc/libc/fn.stat.html delete mode 100644 doc/libc/fn.statfs.html delete mode 100644 doc/libc/fn.statvfs.html delete mode 100644 doc/libc/fn.strcat.html delete mode 100644 doc/libc/fn.strchr.html delete mode 100644 doc/libc/fn.strcmp.html delete mode 100644 doc/libc/fn.strcoll.html delete mode 100644 doc/libc/fn.strcpy.html delete mode 100644 doc/libc/fn.strcspn.html delete mode 100644 doc/libc/fn.strerror.html delete mode 100644 doc/libc/fn.strerror_r.html delete mode 100644 doc/libc/fn.strlen.html delete mode 100644 doc/libc/fn.strncat.html delete mode 100644 doc/libc/fn.strncmp.html delete mode 100644 doc/libc/fn.strncpy.html delete mode 100644 doc/libc/fn.strpbrk.html delete mode 100644 doc/libc/fn.strrchr.html delete mode 100644 doc/libc/fn.strspn.html delete mode 100644 doc/libc/fn.strstr.html delete mode 100644 doc/libc/fn.strtod.html delete mode 100644 doc/libc/fn.strtok.html delete mode 100644 doc/libc/fn.strtol.html delete mode 100644 doc/libc/fn.strtoul.html delete mode 100644 doc/libc/fn.strxfrm.html delete mode 100644 doc/libc/fn.symlink.html delete mode 100644 doc/libc/fn.syscall.html delete mode 100644 doc/libc/fn.sysconf.html delete mode 100644 doc/libc/fn.sysctl.html delete mode 100644 doc/libc/fn.sysctlbyname.html delete mode 100644 doc/libc/fn.sysctlnametomib.html delete mode 100644 doc/libc/fn.system.html delete mode 100644 doc/libc/fn.tcdrain.html delete mode 100644 doc/libc/fn.tcflow.html delete mode 100644 doc/libc/fn.tcflush.html delete mode 100644 doc/libc/fn.tcgetattr.html delete mode 100644 doc/libc/fn.tcgetpgrp.html delete mode 100644 doc/libc/fn.tcsendbreak.html delete mode 100644 doc/libc/fn.tcsetattr.html delete mode 100644 doc/libc/fn.telldir.html delete mode 100644 doc/libc/fn.timegm.html delete mode 100644 doc/libc/fn.tmpfile.html delete mode 100644 doc/libc/fn.tolower.html delete mode 100644 doc/libc/fn.toupper.html delete mode 100644 doc/libc/fn.ttyname.html delete mode 100644 doc/libc/fn.umask.html delete mode 100644 doc/libc/fn.uname.html delete mode 100644 doc/libc/fn.ungetc.html delete mode 100644 doc/libc/fn.unlink.html delete mode 100644 doc/libc/fn.unmount.html delete mode 100644 doc/libc/fn.unsetenv.html delete mode 100644 doc/libc/fn.uselocale.html delete mode 100644 doc/libc/fn.usleep.html delete mode 100644 doc/libc/fn.utime.html delete mode 100644 doc/libc/fn.utimes.html delete mode 100644 doc/libc/fn.wait.html delete mode 100644 doc/libc/fn.waitpid.html delete mode 100644 doc/libc/fn.wcslen.html delete mode 100644 doc/libc/fn.write.html delete mode 100644 doc/libc/fn.writev.html delete mode 100644 doc/libc/index.html delete mode 100644 doc/libc/macros/index.html delete mode 100644 doc/libc/macros/sidebar-items.js delete mode 100644 doc/libc/sidebar-items.js delete mode 100644 doc/libc/struct.Dl_info.html delete mode 100644 doc/libc/struct.addrinfo.html delete mode 100644 doc/libc/struct.dirent.html delete mode 100644 doc/libc/struct.dqblk.html delete mode 100644 doc/libc/struct.fd_set.html delete mode 100644 doc/libc/struct.flock.html delete mode 100644 doc/libc/struct.fsid_t.html delete mode 100644 doc/libc/struct.fstore_t.html delete mode 100644 doc/libc/struct.glob_t.html delete mode 100644 doc/libc/struct.hostent.html delete mode 100644 doc/libc/struct.ifaddrs.html delete mode 100644 doc/libc/struct.in6_addr.html delete mode 100644 doc/libc/struct.in_addr.html delete mode 100644 doc/libc/struct.iovec.html delete mode 100644 doc/libc/struct.ip_mreq.html delete mode 100644 doc/libc/struct.ipv6_mreq.html delete mode 100644 doc/libc/struct.kevent.html delete mode 100644 doc/libc/struct.kevent64_s.html delete mode 100644 doc/libc/struct.lconv.html delete mode 100644 doc/libc/struct.mach_timebase_info.html delete mode 100644 doc/libc/struct.msghdr.html delete mode 100644 doc/libc/struct.passwd.html delete mode 100644 doc/libc/struct.pollfd.html delete mode 100644 doc/libc/struct.pthread_attr_t.html delete mode 100644 doc/libc/struct.pthread_cond_t.html delete mode 100644 doc/libc/struct.pthread_mutex_t.html delete mode 100644 doc/libc/struct.pthread_mutexattr_t.html delete mode 100644 doc/libc/struct.pthread_rwlock_t.html delete mode 100644 doc/libc/struct.radvisory.html delete mode 100644 doc/libc/struct.rlimit.html delete mode 100644 doc/libc/struct.rusage.html delete mode 100644 doc/libc/struct.sf_hdtr.html delete mode 100644 doc/libc/struct.sigaction.html delete mode 100644 doc/libc/struct.siginfo_t.html delete mode 100644 doc/libc/struct.sockaddr.html delete mode 100644 doc/libc/struct.sockaddr_in.html delete mode 100644 doc/libc/struct.sockaddr_in6.html delete mode 100644 doc/libc/struct.sockaddr_storage.html delete mode 100644 doc/libc/struct.sockaddr_un.html delete mode 100644 doc/libc/struct.stack_t.html delete mode 100644 doc/libc/struct.stat.html delete mode 100644 doc/libc/struct.statfs.html delete mode 100644 doc/libc/struct.statvfs.html delete mode 100644 doc/libc/struct.termios.html delete mode 100644 doc/libc/struct.timespec.html delete mode 100644 doc/libc/struct.timeval.html delete mode 100644 doc/libc/struct.tm.html delete mode 100644 doc/libc/struct.utimbuf.html delete mode 100644 doc/libc/struct.utsname.html delete mode 100644 doc/libc/struct.winsize.html delete mode 100644 doc/libc/type.blkcnt_t.html delete mode 100644 doc/libc/type.blksize_t.html delete mode 100644 doc/libc/type.c_char.html delete mode 100644 doc/libc/type.c_double.html delete mode 100644 doc/libc/type.c_float.html delete mode 100644 doc/libc/type.c_int.html delete mode 100644 doc/libc/type.c_long.html delete mode 100644 doc/libc/type.c_longlong.html delete mode 100644 doc/libc/type.c_schar.html delete mode 100644 doc/libc/type.c_short.html delete mode 100644 doc/libc/type.c_uchar.html delete mode 100644 doc/libc/type.c_uint.html delete mode 100644 doc/libc/type.c_ulong.html delete mode 100644 doc/libc/type.c_ulonglong.html delete mode 100644 doc/libc/type.c_ushort.html delete mode 100644 doc/libc/type.cc_t.html delete mode 100644 doc/libc/type.clock_t.html delete mode 100644 doc/libc/type.dev_t.html delete mode 100644 doc/libc/type.fsblkcnt_t.html delete mode 100644 doc/libc/type.fsfilcnt_t.html delete mode 100644 doc/libc/type.gid_t.html delete mode 100644 doc/libc/type.in_addr_t.html delete mode 100644 doc/libc/type.in_port_t.html delete mode 100644 doc/libc/type.ino_t.html delete mode 100644 doc/libc/type.int16_t.html delete mode 100644 doc/libc/type.int32_t.html delete mode 100644 doc/libc/type.int64_t.html delete mode 100644 doc/libc/type.int8_t.html delete mode 100644 doc/libc/type.intmax_t.html delete mode 100644 doc/libc/type.intptr_t.html delete mode 100644 doc/libc/type.mach_timebase_info_data_t.html delete mode 100644 doc/libc/type.mode_t.html delete mode 100644 doc/libc/type.nfds_t.html delete mode 100644 doc/libc/type.nl_item.html delete mode 100644 doc/libc/type.nlink_t.html delete mode 100644 doc/libc/type.off_t.html delete mode 100644 doc/libc/type.pid_t.html delete mode 100644 doc/libc/type.pthread_key_t.html delete mode 100644 doc/libc/type.pthread_t.html delete mode 100644 doc/libc/type.ptrdiff_t.html delete mode 100644 doc/libc/type.rlim_t.html delete mode 100644 doc/libc/type.sa_family_t.html delete mode 100644 doc/libc/type.sighandler_t.html delete mode 100644 doc/libc/type.sigset_t.html delete mode 100644 doc/libc/type.size_t.html delete mode 100644 doc/libc/type.socklen_t.html delete mode 100644 doc/libc/type.speed_t.html delete mode 100644 doc/libc/type.ssize_t.html delete mode 100644 doc/libc/type.suseconds_t.html delete mode 100644 doc/libc/type.tcflag_t.html delete mode 100644 doc/libc/type.time_t.html delete mode 100644 doc/libc/type.uid_t.html delete mode 100644 doc/libc/type.uint16_t.html delete mode 100644 doc/libc/type.uint32_t.html delete mode 100644 doc/libc/type.uint64_t.html delete mode 100644 doc/libc/type.uint8_t.html delete mode 100644 doc/libc/type.uintmax_t.html delete mode 100644 doc/libc/type.uintptr_t.html delete mode 100644 doc/libc/type.useconds_t.html delete mode 100644 doc/libc/type.wchar_t.html delete mode 100644 doc/libc/unix/apple/b64/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/unix/apple/b64/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/unix/apple/b64/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/unix/apple/b64/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/unix/apple/b64/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/unix/apple/b64/index.html delete mode 100644 doc/libc/unix/apple/b64/sidebar-items.js delete mode 100644 doc/libc/unix/apple/b64/struct.pthread_attr_t.html delete mode 100644 doc/libc/unix/apple/b64/type.c_long.html delete mode 100644 doc/libc/unix/apple/b64/type.c_ulong.html delete mode 100644 doc/libc/unix/apple/constant.ABDAY_1.html delete mode 100644 doc/libc/unix/apple/constant.ABDAY_2.html delete mode 100644 doc/libc/unix/apple/constant.ABDAY_3.html delete mode 100644 doc/libc/unix/apple/constant.ABDAY_4.html delete mode 100644 doc/libc/unix/apple/constant.ABDAY_5.html delete mode 100644 doc/libc/unix/apple/constant.ABDAY_6.html delete mode 100644 doc/libc/unix/apple/constant.ABDAY_7.html delete mode 100644 doc/libc/unix/apple/constant.ABMON_1.html delete mode 100644 doc/libc/unix/apple/constant.ABMON_10.html delete mode 100644 doc/libc/unix/apple/constant.ABMON_11.html delete mode 100644 doc/libc/unix/apple/constant.ABMON_12.html delete mode 100644 doc/libc/unix/apple/constant.ABMON_2.html delete mode 100644 doc/libc/unix/apple/constant.ABMON_3.html delete mode 100644 doc/libc/unix/apple/constant.ABMON_4.html delete mode 100644 doc/libc/unix/apple/constant.ABMON_5.html delete mode 100644 doc/libc/unix/apple/constant.ABMON_6.html delete mode 100644 doc/libc/unix/apple/constant.ABMON_7.html delete mode 100644 doc/libc/unix/apple/constant.ABMON_8.html delete mode 100644 doc/libc/unix/apple/constant.ABMON_9.html delete mode 100644 doc/libc/unix/apple/constant.AF_INET.html delete mode 100644 doc/libc/unix/apple/constant.AF_INET6.html delete mode 100644 doc/libc/unix/apple/constant.AF_UNIX.html delete mode 100644 doc/libc/unix/apple/constant.ALT_DIGITS.html delete mode 100644 doc/libc/unix/apple/constant.AM_STR.html delete mode 100644 doc/libc/unix/apple/constant.BS0.html delete mode 100644 doc/libc/unix/apple/constant.BS1.html delete mode 100644 doc/libc/unix/apple/constant.BUFSIZ.html delete mode 100644 doc/libc/unix/apple/constant.CODESET.html delete mode 100644 doc/libc/unix/apple/constant.CR0.html delete mode 100644 doc/libc/unix/apple/constant.CR1.html delete mode 100644 doc/libc/unix/apple/constant.CR2.html delete mode 100644 doc/libc/unix/apple/constant.CR3.html delete mode 100644 doc/libc/unix/apple/constant.CRNCYSTR.html delete mode 100644 doc/libc/unix/apple/constant.CRTSCTS.html delete mode 100644 doc/libc/unix/apple/constant.DAY_1.html delete mode 100644 doc/libc/unix/apple/constant.DAY_2.html delete mode 100644 doc/libc/unix/apple/constant.DAY_3.html delete mode 100644 doc/libc/unix/apple/constant.DAY_4.html delete mode 100644 doc/libc/unix/apple/constant.DAY_5.html delete mode 100644 doc/libc/unix/apple/constant.DAY_6.html delete mode 100644 doc/libc/unix/apple/constant.DAY_7.html delete mode 100644 doc/libc/unix/apple/constant.D_FMT.html delete mode 100644 doc/libc/unix/apple/constant.D_MD_ORDER.html delete mode 100644 doc/libc/unix/apple/constant.D_T_FMT.html delete mode 100644 doc/libc/unix/apple/constant.E2BIG.html delete mode 100644 doc/libc/unix/apple/constant.EACCES.html delete mode 100644 doc/libc/unix/apple/constant.EADDRINUSE.html delete mode 100644 doc/libc/unix/apple/constant.EADDRNOTAVAIL.html delete mode 100644 doc/libc/unix/apple/constant.EAFNOSUPPORT.html delete mode 100644 doc/libc/unix/apple/constant.EAGAIN.html delete mode 100644 doc/libc/unix/apple/constant.EALREADY.html delete mode 100644 doc/libc/unix/apple/constant.EAUTH.html delete mode 100644 doc/libc/unix/apple/constant.EBADARCH.html delete mode 100644 doc/libc/unix/apple/constant.EBADEXEC.html delete mode 100644 doc/libc/unix/apple/constant.EBADF.html delete mode 100644 doc/libc/unix/apple/constant.EBADMACHO.html delete mode 100644 doc/libc/unix/apple/constant.EBADMSG.html delete mode 100644 doc/libc/unix/apple/constant.EBADRPC.html delete mode 100644 doc/libc/unix/apple/constant.EBUSY.html delete mode 100644 doc/libc/unix/apple/constant.ECANCELED.html delete mode 100644 doc/libc/unix/apple/constant.ECHILD.html delete mode 100644 doc/libc/unix/apple/constant.ECONNABORTED.html delete mode 100644 doc/libc/unix/apple/constant.ECONNREFUSED.html delete mode 100644 doc/libc/unix/apple/constant.ECONNRESET.html delete mode 100644 doc/libc/unix/apple/constant.EDEADLK.html delete mode 100644 doc/libc/unix/apple/constant.EDESTADDRREQ.html delete mode 100644 doc/libc/unix/apple/constant.EDEVERR.html delete mode 100644 doc/libc/unix/apple/constant.EDOM.html delete mode 100644 doc/libc/unix/apple/constant.EDQUOT.html delete mode 100644 doc/libc/unix/apple/constant.EEXIST.html delete mode 100644 doc/libc/unix/apple/constant.EFAULT.html delete mode 100644 doc/libc/unix/apple/constant.EFBIG.html delete mode 100644 doc/libc/unix/apple/constant.EFTYPE.html delete mode 100644 doc/libc/unix/apple/constant.EHOSTDOWN.html delete mode 100644 doc/libc/unix/apple/constant.EHOSTUNREACH.html delete mode 100644 doc/libc/unix/apple/constant.EIDRM.html delete mode 100644 doc/libc/unix/apple/constant.EILSEQ.html delete mode 100644 doc/libc/unix/apple/constant.EINPROGRESS.html delete mode 100644 doc/libc/unix/apple/constant.EINTR.html delete mode 100644 doc/libc/unix/apple/constant.EINVAL.html delete mode 100644 doc/libc/unix/apple/constant.EIO.html delete mode 100644 doc/libc/unix/apple/constant.EISCONN.html delete mode 100644 doc/libc/unix/apple/constant.EISDIR.html delete mode 100644 doc/libc/unix/apple/constant.ELAST.html delete mode 100644 doc/libc/unix/apple/constant.ELOOP.html delete mode 100644 doc/libc/unix/apple/constant.EMFILE.html delete mode 100644 doc/libc/unix/apple/constant.EMLINK.html delete mode 100644 doc/libc/unix/apple/constant.EMSGSIZE.html delete mode 100644 doc/libc/unix/apple/constant.EMULTIHOP.html delete mode 100644 doc/libc/unix/apple/constant.ENAMETOOLONG.html delete mode 100644 doc/libc/unix/apple/constant.ENEEDAUTH.html delete mode 100644 doc/libc/unix/apple/constant.ENETDOWN.html delete mode 100644 doc/libc/unix/apple/constant.ENETRESET.html delete mode 100644 doc/libc/unix/apple/constant.ENETUNREACH.html delete mode 100644 doc/libc/unix/apple/constant.ENFILE.html delete mode 100644 doc/libc/unix/apple/constant.ENOATTR.html delete mode 100644 doc/libc/unix/apple/constant.ENOBUFS.html delete mode 100644 doc/libc/unix/apple/constant.ENODATA.html delete mode 100644 doc/libc/unix/apple/constant.ENODEV.html delete mode 100644 doc/libc/unix/apple/constant.ENOENT.html delete mode 100644 doc/libc/unix/apple/constant.ENOEXEC.html delete mode 100644 doc/libc/unix/apple/constant.ENOLCK.html delete mode 100644 doc/libc/unix/apple/constant.ENOLINK.html delete mode 100644 doc/libc/unix/apple/constant.ENOMEM.html delete mode 100644 doc/libc/unix/apple/constant.ENOMSG.html delete mode 100644 doc/libc/unix/apple/constant.ENOPOLICY.html delete mode 100644 doc/libc/unix/apple/constant.ENOPROTOOPT.html delete mode 100644 doc/libc/unix/apple/constant.ENOSPC.html delete mode 100644 doc/libc/unix/apple/constant.ENOSR.html delete mode 100644 doc/libc/unix/apple/constant.ENOSTR.html delete mode 100644 doc/libc/unix/apple/constant.ENOSYS.html delete mode 100644 doc/libc/unix/apple/constant.ENOTBLK.html delete mode 100644 doc/libc/unix/apple/constant.ENOTCONN.html delete mode 100644 doc/libc/unix/apple/constant.ENOTDIR.html delete mode 100644 doc/libc/unix/apple/constant.ENOTEMPTY.html delete mode 100644 doc/libc/unix/apple/constant.ENOTRECOVERABLE.html delete mode 100644 doc/libc/unix/apple/constant.ENOTSOCK.html delete mode 100644 doc/libc/unix/apple/constant.ENOTSUP.html delete mode 100644 doc/libc/unix/apple/constant.ENOTTY.html delete mode 100644 doc/libc/unix/apple/constant.ENXIO.html delete mode 100644 doc/libc/unix/apple/constant.EOF.html delete mode 100644 doc/libc/unix/apple/constant.EOPNOTSUPP.html delete mode 100644 doc/libc/unix/apple/constant.EOVERFLOW.html delete mode 100644 doc/libc/unix/apple/constant.EOWNERDEAD.html delete mode 100644 doc/libc/unix/apple/constant.EPERM.html delete mode 100644 doc/libc/unix/apple/constant.EPFNOSUPPORT.html delete mode 100644 doc/libc/unix/apple/constant.EPIPE.html delete mode 100644 doc/libc/unix/apple/constant.EPROCLIM.html delete mode 100644 doc/libc/unix/apple/constant.EPROCUNAVAIL.html delete mode 100644 doc/libc/unix/apple/constant.EPROGMISMATCH.html delete mode 100644 doc/libc/unix/apple/constant.EPROGUNAVAIL.html delete mode 100644 doc/libc/unix/apple/constant.EPROTO.html delete mode 100644 doc/libc/unix/apple/constant.EPROTONOSUPPORT.html delete mode 100644 doc/libc/unix/apple/constant.EPROTOTYPE.html delete mode 100644 doc/libc/unix/apple/constant.EPWROFF.html delete mode 100644 doc/libc/unix/apple/constant.EQFULL.html delete mode 100644 doc/libc/unix/apple/constant.ERA.html delete mode 100644 doc/libc/unix/apple/constant.ERANGE.html delete mode 100644 doc/libc/unix/apple/constant.ERA_D_FMT.html delete mode 100644 doc/libc/unix/apple/constant.ERA_D_T_FMT.html delete mode 100644 doc/libc/unix/apple/constant.ERA_T_FMT.html delete mode 100644 doc/libc/unix/apple/constant.EREMOTE.html delete mode 100644 doc/libc/unix/apple/constant.EROFS.html delete mode 100644 doc/libc/unix/apple/constant.ERPCMISMATCH.html delete mode 100644 doc/libc/unix/apple/constant.ESHLIBVERS.html delete mode 100644 doc/libc/unix/apple/constant.ESHUTDOWN.html delete mode 100644 doc/libc/unix/apple/constant.ESOCKTNOSUPPORT.html delete mode 100644 doc/libc/unix/apple/constant.ESPIPE.html delete mode 100644 doc/libc/unix/apple/constant.ESRCH.html delete mode 100644 doc/libc/unix/apple/constant.ESTALE.html delete mode 100644 doc/libc/unix/apple/constant.ETIME.html delete mode 100644 doc/libc/unix/apple/constant.ETIMEDOUT.html delete mode 100644 doc/libc/unix/apple/constant.ETOOMANYREFS.html delete mode 100644 doc/libc/unix/apple/constant.ETXTBSY.html delete mode 100644 doc/libc/unix/apple/constant.EUSERS.html delete mode 100644 doc/libc/unix/apple/constant.EVFILT_AIO.html delete mode 100644 doc/libc/unix/apple/constant.EVFILT_FS.html delete mode 100644 doc/libc/unix/apple/constant.EVFILT_MACHPORT.html delete mode 100644 doc/libc/unix/apple/constant.EVFILT_PROC.html delete mode 100644 doc/libc/unix/apple/constant.EVFILT_READ.html delete mode 100644 doc/libc/unix/apple/constant.EVFILT_SIGNAL.html delete mode 100644 doc/libc/unix/apple/constant.EVFILT_SYSCOUNT.html delete mode 100644 doc/libc/unix/apple/constant.EVFILT_TIMER.html delete mode 100644 doc/libc/unix/apple/constant.EVFILT_USER.html delete mode 100644 doc/libc/unix/apple/constant.EVFILT_VM.html delete mode 100644 doc/libc/unix/apple/constant.EVFILT_VNODE.html delete mode 100644 doc/libc/unix/apple/constant.EVFILT_WRITE.html delete mode 100644 doc/libc/unix/apple/constant.EV_DISPATCH.html delete mode 100644 doc/libc/unix/apple/constant.EV_FLAG0.html delete mode 100644 doc/libc/unix/apple/constant.EV_OOBAND.html delete mode 100644 doc/libc/unix/apple/constant.EV_POLL.html delete mode 100644 doc/libc/unix/apple/constant.EV_RECEIPT.html delete mode 100644 doc/libc/unix/apple/constant.EWOULDBLOCK.html delete mode 100644 doc/libc/unix/apple/constant.EXDEV.html delete mode 100644 doc/libc/unix/apple/constant.EXIT_FAILURE.html delete mode 100644 doc/libc/unix/apple/constant.EXIT_SUCCESS.html delete mode 100644 doc/libc/unix/apple/constant.FD_SETSIZE.html delete mode 100644 doc/libc/unix/apple/constant.FF0.html delete mode 100644 doc/libc/unix/apple/constant.FF1.html delete mode 100644 doc/libc/unix/apple/constant.FILENAME_MAX.html delete mode 100644 doc/libc/unix/apple/constant.FOPEN_MAX.html delete mode 100644 doc/libc/unix/apple/constant.F_ALLOCATEALL.html delete mode 100644 doc/libc/unix/apple/constant.F_ALLOCATECONTIG.html delete mode 100644 doc/libc/unix/apple/constant.F_DUPFD.html delete mode 100644 doc/libc/unix/apple/constant.F_DUPFD_CLOEXEC.html delete mode 100644 doc/libc/unix/apple/constant.F_FREEZE_FS.html delete mode 100644 doc/libc/unix/apple/constant.F_FULLFSYNC.html delete mode 100644 doc/libc/unix/apple/constant.F_GETFD.html delete mode 100644 doc/libc/unix/apple/constant.F_GETFL.html delete mode 100644 doc/libc/unix/apple/constant.F_GETLK.html delete mode 100644 doc/libc/unix/apple/constant.F_GETPATH.html delete mode 100644 doc/libc/unix/apple/constant.F_GLOBAL_NOCACHE.html delete mode 100644 doc/libc/unix/apple/constant.F_LOCK.html delete mode 100644 doc/libc/unix/apple/constant.F_NOCACHE.html delete mode 100644 doc/libc/unix/apple/constant.F_NODIRECT.html delete mode 100644 doc/libc/unix/apple/constant.F_OK.html delete mode 100644 doc/libc/unix/apple/constant.F_PEOFPOSMODE.html delete mode 100644 doc/libc/unix/apple/constant.F_PREALLOCATE.html delete mode 100644 doc/libc/unix/apple/constant.F_RDADVISE.html delete mode 100644 doc/libc/unix/apple/constant.F_RDAHEAD.html delete mode 100644 doc/libc/unix/apple/constant.F_SETFD.html delete mode 100644 doc/libc/unix/apple/constant.F_SETFL.html delete mode 100644 doc/libc/unix/apple/constant.F_SETLK.html delete mode 100644 doc/libc/unix/apple/constant.F_SETLKW.html delete mode 100644 doc/libc/unix/apple/constant.F_TEST.html delete mode 100644 doc/libc/unix/apple/constant.F_THAW_FS.html delete mode 100644 doc/libc/unix/apple/constant.F_TLOCK.html delete mode 100644 doc/libc/unix/apple/constant.F_ULOCK.html delete mode 100644 doc/libc/unix/apple/constant.F_VOLPOSMODE.html delete mode 100644 doc/libc/unix/apple/constant.GLOB_ABORTED.html delete mode 100644 doc/libc/unix/apple/constant.GLOB_APPEND.html delete mode 100644 doc/libc/unix/apple/constant.GLOB_DOOFFS.html delete mode 100644 doc/libc/unix/apple/constant.GLOB_ERR.html delete mode 100644 doc/libc/unix/apple/constant.GLOB_MARK.html delete mode 100644 doc/libc/unix/apple/constant.GLOB_NOCHECK.html delete mode 100644 doc/libc/unix/apple/constant.GLOB_NOESCAPE.html delete mode 100644 doc/libc/unix/apple/constant.GLOB_NOMATCH.html delete mode 100644 doc/libc/unix/apple/constant.GLOB_NOSORT.html delete mode 100644 doc/libc/unix/apple/constant.GLOB_NOSPACE.html delete mode 100644 doc/libc/unix/apple/constant.HW_AVAILCPU.html delete mode 100644 doc/libc/unix/apple/constant.IFF_LOOPBACK.html delete mode 100644 doc/libc/unix/apple/constant.IPPROTO_IP.html delete mode 100644 doc/libc/unix/apple/constant.IPPROTO_IPV6.html delete mode 100644 doc/libc/unix/apple/constant.IPPROTO_RAW.html delete mode 100644 doc/libc/unix/apple/constant.IPPROTO_TCP.html delete mode 100644 doc/libc/unix/apple/constant.IPV6_JOIN_GROUP.html delete mode 100644 doc/libc/unix/apple/constant.IPV6_LEAVE_GROUP.html delete mode 100644 doc/libc/unix/apple/constant.IP_ADD_MEMBERSHIP.html delete mode 100644 doc/libc/unix/apple/constant.IP_DROP_MEMBERSHIP.html delete mode 100644 doc/libc/unix/apple/constant.IP_HDRINCL.html delete mode 100644 doc/libc/unix/apple/constant.IP_MULTICAST_LOOP.html delete mode 100644 doc/libc/unix/apple/constant.IP_MULTICAST_TTL.html delete mode 100644 doc/libc/unix/apple/constant.IP_TTL.html delete mode 100644 doc/libc/unix/apple/constant.IUTF8.html delete mode 100644 doc/libc/unix/apple/constant.LC_ALL_MASK.html delete mode 100644 doc/libc/unix/apple/constant.LC_COLLATE_MASK.html delete mode 100644 doc/libc/unix/apple/constant.LC_CTYPE_MASK.html delete mode 100644 doc/libc/unix/apple/constant.LC_MESSAGES_MASK.html delete mode 100644 doc/libc/unix/apple/constant.LC_MONETARY_MASK.html delete mode 100644 doc/libc/unix/apple/constant.LC_NUMERIC_MASK.html delete mode 100644 doc/libc/unix/apple/constant.LC_TIME_MASK.html delete mode 100644 doc/libc/unix/apple/constant.LOCK_EX.html delete mode 100644 doc/libc/unix/apple/constant.LOCK_NB.html delete mode 100644 doc/libc/unix/apple/constant.LOCK_SH.html delete mode 100644 doc/libc/unix/apple/constant.LOCK_UN.html delete mode 100644 doc/libc/unix/apple/constant.L_tmpnam.html delete mode 100644 doc/libc/unix/apple/constant.MADV_CAN_REUSE.html delete mode 100644 doc/libc/unix/apple/constant.MADV_DONTNEED.html delete mode 100644 doc/libc/unix/apple/constant.MADV_FREE.html delete mode 100644 doc/libc/unix/apple/constant.MADV_FREE_REUSABLE.html delete mode 100644 doc/libc/unix/apple/constant.MADV_FREE_REUSE.html delete mode 100644 doc/libc/unix/apple/constant.MADV_NORMAL.html delete mode 100644 doc/libc/unix/apple/constant.MADV_RANDOM.html delete mode 100644 doc/libc/unix/apple/constant.MADV_SEQUENTIAL.html delete mode 100644 doc/libc/unix/apple/constant.MADV_WILLNEED.html delete mode 100644 doc/libc/unix/apple/constant.MADV_ZERO_WIRED_PAGES.html delete mode 100644 doc/libc/unix/apple/constant.MAP_ANON.html delete mode 100644 doc/libc/unix/apple/constant.MAP_COPY.html delete mode 100644 doc/libc/unix/apple/constant.MAP_FAILED.html delete mode 100644 doc/libc/unix/apple/constant.MAP_FILE.html delete mode 100644 doc/libc/unix/apple/constant.MAP_FIXED.html delete mode 100644 doc/libc/unix/apple/constant.MAP_HASSEMAPHORE.html delete mode 100644 doc/libc/unix/apple/constant.MAP_JIT.html delete mode 100644 doc/libc/unix/apple/constant.MAP_NOCACHE.html delete mode 100644 doc/libc/unix/apple/constant.MAP_NOEXTEND.html delete mode 100644 doc/libc/unix/apple/constant.MAP_NORESERVE.html delete mode 100644 doc/libc/unix/apple/constant.MAP_PRIVATE.html delete mode 100644 doc/libc/unix/apple/constant.MAP_RENAME.html delete mode 100644 doc/libc/unix/apple/constant.MAP_SHARED.html delete mode 100644 doc/libc/unix/apple/constant.MCL_CURRENT.html delete mode 100644 doc/libc/unix/apple/constant.MCL_FUTURE.html delete mode 100644 doc/libc/unix/apple/constant.MINCORE_INCORE.html delete mode 100644 doc/libc/unix/apple/constant.MINCORE_MODIFIED.html delete mode 100644 doc/libc/unix/apple/constant.MINCORE_MODIFIED_OTHER.html delete mode 100644 doc/libc/unix/apple/constant.MINCORE_REFERENCED.html delete mode 100644 doc/libc/unix/apple/constant.MINCORE_REFERENCED_OTHER.html delete mode 100644 doc/libc/unix/apple/constant.MON_1.html delete mode 100644 doc/libc/unix/apple/constant.MON_10.html delete mode 100644 doc/libc/unix/apple/constant.MON_11.html delete mode 100644 doc/libc/unix/apple/constant.MON_12.html delete mode 100644 doc/libc/unix/apple/constant.MON_2.html delete mode 100644 doc/libc/unix/apple/constant.MON_3.html delete mode 100644 doc/libc/unix/apple/constant.MON_4.html delete mode 100644 doc/libc/unix/apple/constant.MON_5.html delete mode 100644 doc/libc/unix/apple/constant.MON_6.html delete mode 100644 doc/libc/unix/apple/constant.MON_7.html delete mode 100644 doc/libc/unix/apple/constant.MON_8.html delete mode 100644 doc/libc/unix/apple/constant.MON_9.html delete mode 100644 doc/libc/unix/apple/constant.MS_ASYNC.html delete mode 100644 doc/libc/unix/apple/constant.MS_DEACTIVATE.html delete mode 100644 doc/libc/unix/apple/constant.MS_INVALIDATE.html delete mode 100644 doc/libc/unix/apple/constant.MS_KILLPAGES.html delete mode 100644 doc/libc/unix/apple/constant.MS_SYNC.html delete mode 100644 doc/libc/unix/apple/constant.NI_MAXHOST.html delete mode 100644 doc/libc/unix/apple/constant.NL0.html delete mode 100644 doc/libc/unix/apple/constant.NL1.html delete mode 100644 doc/libc/unix/apple/constant.NOEXPR.html delete mode 100644 doc/libc/unix/apple/constant.NOSTR.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_ABSOLUTE.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_EXITSTATUS.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_EXIT_REPARENTED.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_FFAND.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_FFCOPY.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_FFCTRLMASK.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_FFLAGSMASK.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_FFNOP.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_FFOR.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_NONE.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_NSECONDS.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_PCTRLMASK.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_REAP.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_SECONDS.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_SIGNAL.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_TRIGGER.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_USECONDS.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_VM_ERROR.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_VM_PRESSURE.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html delete mode 100644 doc/libc/unix/apple/constant.NOTE_VM_PRESSURE_TERMINATE.html delete mode 100644 doc/libc/unix/apple/constant.O_ACCMODE.html delete mode 100644 doc/libc/unix/apple/constant.O_APPEND.html delete mode 100644 doc/libc/unix/apple/constant.O_CLOEXEC.html delete mode 100644 doc/libc/unix/apple/constant.O_CREAT.html delete mode 100644 doc/libc/unix/apple/constant.O_DIRECTORY.html delete mode 100644 doc/libc/unix/apple/constant.O_DSYNC.html delete mode 100644 doc/libc/unix/apple/constant.O_EXCL.html delete mode 100644 doc/libc/unix/apple/constant.O_NOCTTY.html delete mode 100644 doc/libc/unix/apple/constant.O_NONBLOCK.html delete mode 100644 doc/libc/unix/apple/constant.O_RDONLY.html delete mode 100644 doc/libc/unix/apple/constant.O_RDWR.html delete mode 100644 doc/libc/unix/apple/constant.O_SYNC.html delete mode 100644 doc/libc/unix/apple/constant.O_TRUNC.html delete mode 100644 doc/libc/unix/apple/constant.O_WRONLY.html delete mode 100644 doc/libc/unix/apple/constant.PM_STR.html delete mode 100644 doc/libc/unix/apple/constant.POSIX_MADV_DONTNEED.html delete mode 100644 doc/libc/unix/apple/constant.POSIX_MADV_NORMAL.html delete mode 100644 doc/libc/unix/apple/constant.POSIX_MADV_RANDOM.html delete mode 100644 doc/libc/unix/apple/constant.POSIX_MADV_SEQUENTIAL.html delete mode 100644 doc/libc/unix/apple/constant.POSIX_MADV_WILLNEED.html delete mode 100644 doc/libc/unix/apple/constant.PROT_EXEC.html delete mode 100644 doc/libc/unix/apple/constant.PROT_NONE.html delete mode 100644 doc/libc/unix/apple/constant.PROT_READ.html delete mode 100644 doc/libc/unix/apple/constant.PROT_WRITE.html delete mode 100644 doc/libc/unix/apple/constant.PTHREAD_COND_INITIALIZER.html delete mode 100644 doc/libc/unix/apple/constant.PTHREAD_CREATE_DETACHED.html delete mode 100644 doc/libc/unix/apple/constant.PTHREAD_CREATE_JOINABLE.html delete mode 100644 doc/libc/unix/apple/constant.PTHREAD_MUTEX_INITIALIZER.html delete mode 100644 doc/libc/unix/apple/constant.PTHREAD_MUTEX_RECURSIVE.html delete mode 100644 doc/libc/unix/apple/constant.PTHREAD_RWLOCK_INITIALIZER.html delete mode 100644 doc/libc/unix/apple/constant.PTHREAD_STACK_MIN.html delete mode 100644 doc/libc/unix/apple/constant.Q_GETQUOTA.html delete mode 100644 doc/libc/unix/apple/constant.Q_SETQUOTA.html delete mode 100644 doc/libc/unix/apple/constant.RADIXCHAR.html delete mode 100644 doc/libc/unix/apple/constant.RAND_MAX.html delete mode 100644 doc/libc/unix/apple/constant.RLIMIT_AS.html delete mode 100644 doc/libc/unix/apple/constant.RLIMIT_CORE.html delete mode 100644 doc/libc/unix/apple/constant.RLIMIT_CPU.html delete mode 100644 doc/libc/unix/apple/constant.RLIMIT_DATA.html delete mode 100644 doc/libc/unix/apple/constant.RLIMIT_FSIZE.html delete mode 100644 doc/libc/unix/apple/constant.RLIMIT_MEMLOCK.html delete mode 100644 doc/libc/unix/apple/constant.RLIMIT_NOFILE.html delete mode 100644 doc/libc/unix/apple/constant.RLIMIT_NPROC.html delete mode 100644 doc/libc/unix/apple/constant.RLIMIT_RSS.html delete mode 100644 doc/libc/unix/apple/constant.RLIMIT_STACK.html delete mode 100644 doc/libc/unix/apple/constant.RLIM_INFINITY.html delete mode 100644 doc/libc/unix/apple/constant.RLIM_NLIMITS.html delete mode 100644 doc/libc/unix/apple/constant.RTLD_FIRST.html delete mode 100644 doc/libc/unix/apple/constant.RTLD_GLOBAL.html delete mode 100644 doc/libc/unix/apple/constant.RTLD_LOCAL.html delete mode 100644 doc/libc/unix/apple/constant.RTLD_NODELETE.html delete mode 100644 doc/libc/unix/apple/constant.RTLD_NOLOAD.html delete mode 100644 doc/libc/unix/apple/constant.RUSAGE_CHILDREN.html delete mode 100644 doc/libc/unix/apple/constant.RUSAGE_SELF.html delete mode 100644 doc/libc/unix/apple/constant.R_OK.html delete mode 100644 doc/libc/unix/apple/constant.SEEK_CUR.html delete mode 100644 doc/libc/unix/apple/constant.SEEK_END.html delete mode 100644 doc/libc/unix/apple/constant.SEEK_SET.html delete mode 100644 doc/libc/unix/apple/constant.SHUT_RD.html delete mode 100644 doc/libc/unix/apple/constant.SHUT_RDWR.html delete mode 100644 doc/libc/unix/apple/constant.SHUT_WR.html delete mode 100644 doc/libc/unix/apple/constant.SIGABRT.html delete mode 100644 doc/libc/unix/apple/constant.SIGALRM.html delete mode 100644 doc/libc/unix/apple/constant.SIGEMT.html delete mode 100644 doc/libc/unix/apple/constant.SIGFPE.html delete mode 100644 doc/libc/unix/apple/constant.SIGHUP.html delete mode 100644 doc/libc/unix/apple/constant.SIGILL.html delete mode 100644 doc/libc/unix/apple/constant.SIGINT.html delete mode 100644 doc/libc/unix/apple/constant.SIGKILL.html delete mode 100644 doc/libc/unix/apple/constant.SIGPIPE.html delete mode 100644 doc/libc/unix/apple/constant.SIGQUIT.html delete mode 100644 doc/libc/unix/apple/constant.SIGSEGV.html delete mode 100644 doc/libc/unix/apple/constant.SIGSTKSZ.html delete mode 100644 doc/libc/unix/apple/constant.SIGTERM.html delete mode 100644 doc/libc/unix/apple/constant.SIGTRAP.html delete mode 100644 doc/libc/unix/apple/constant.SOCK_DGRAM.html delete mode 100644 doc/libc/unix/apple/constant.SOCK_RAW.html delete mode 100644 doc/libc/unix/apple/constant.SOCK_STREAM.html delete mode 100644 doc/libc/unix/apple/constant.SOL_SOCKET.html delete mode 100644 doc/libc/unix/apple/constant.SO_ACCEPTCONN.html delete mode 100644 doc/libc/unix/apple/constant.SO_BROADCAST.html delete mode 100644 doc/libc/unix/apple/constant.SO_DEBUG.html delete mode 100644 doc/libc/unix/apple/constant.SO_DONTROUTE.html delete mode 100644 doc/libc/unix/apple/constant.SO_DONTTRUNC.html delete mode 100644 doc/libc/unix/apple/constant.SO_ERROR.html delete mode 100644 doc/libc/unix/apple/constant.SO_KEEPALIVE.html delete mode 100644 doc/libc/unix/apple/constant.SO_LINGER.html delete mode 100644 doc/libc/unix/apple/constant.SO_NKE.html delete mode 100644 doc/libc/unix/apple/constant.SO_NOADDRERR.html delete mode 100644 doc/libc/unix/apple/constant.SO_NOSIGPIPE.html delete mode 100644 doc/libc/unix/apple/constant.SO_NREAD.html delete mode 100644 doc/libc/unix/apple/constant.SO_NWRITE.html delete mode 100644 doc/libc/unix/apple/constant.SO_OOBINLINE.html delete mode 100644 doc/libc/unix/apple/constant.SO_RCVBUF.html delete mode 100644 doc/libc/unix/apple/constant.SO_RCVLOWAT.html delete mode 100644 doc/libc/unix/apple/constant.SO_RCVTIMEO.html delete mode 100644 doc/libc/unix/apple/constant.SO_REUSEADDR.html delete mode 100644 doc/libc/unix/apple/constant.SO_REUSEPORT.html delete mode 100644 doc/libc/unix/apple/constant.SO_SNDBUF.html delete mode 100644 doc/libc/unix/apple/constant.SO_SNDLOWAT.html delete mode 100644 doc/libc/unix/apple/constant.SO_SNDTIMEO.html delete mode 100644 doc/libc/unix/apple/constant.SO_TYPE.html delete mode 100644 doc/libc/unix/apple/constant.SO_USELOOPBACK.html delete mode 100644 doc/libc/unix/apple/constant.SO_WANTMORE.html delete mode 100644 doc/libc/unix/apple/constant.SO_WANTOOBFLAG.html delete mode 100644 doc/libc/unix/apple/constant.STDERR_FILENO.html delete mode 100644 doc/libc/unix/apple/constant.STDIN_FILENO.html delete mode 100644 doc/libc/unix/apple/constant.STDOUT_FILENO.html delete mode 100644 doc/libc/unix/apple/constant.ST_NOSUID.html delete mode 100644 doc/libc/unix/apple/constant.S_IEXEC.html delete mode 100644 doc/libc/unix/apple/constant.S_IFBLK.html delete mode 100644 doc/libc/unix/apple/constant.S_IFCHR.html delete mode 100644 doc/libc/unix/apple/constant.S_IFDIR.html delete mode 100644 doc/libc/unix/apple/constant.S_IFIFO.html delete mode 100644 doc/libc/unix/apple/constant.S_IFLNK.html delete mode 100644 doc/libc/unix/apple/constant.S_IFMT.html delete mode 100644 doc/libc/unix/apple/constant.S_IFREG.html delete mode 100644 doc/libc/unix/apple/constant.S_IFSOCK.html delete mode 100644 doc/libc/unix/apple/constant.S_IREAD.html delete mode 100644 doc/libc/unix/apple/constant.S_IRGRP.html delete mode 100644 doc/libc/unix/apple/constant.S_IROTH.html delete mode 100644 doc/libc/unix/apple/constant.S_IRUSR.html delete mode 100644 doc/libc/unix/apple/constant.S_IRWXG.html delete mode 100644 doc/libc/unix/apple/constant.S_IRWXO.html delete mode 100644 doc/libc/unix/apple/constant.S_IRWXU.html delete mode 100644 doc/libc/unix/apple/constant.S_IWGRP.html delete mode 100644 doc/libc/unix/apple/constant.S_IWOTH.html delete mode 100644 doc/libc/unix/apple/constant.S_IWRITE.html delete mode 100644 doc/libc/unix/apple/constant.S_IWUSR.html delete mode 100644 doc/libc/unix/apple/constant.S_IXGRP.html delete mode 100644 doc/libc/unix/apple/constant.S_IXOTH.html delete mode 100644 doc/libc/unix/apple/constant.S_IXUSR.html delete mode 100644 doc/libc/unix/apple/constant.TAB0.html delete mode 100644 doc/libc/unix/apple/constant.TAB1.html delete mode 100644 doc/libc/unix/apple/constant.TAB2.html delete mode 100644 doc/libc/unix/apple/constant.TAB3.html delete mode 100644 doc/libc/unix/apple/constant.TCP_KEEPALIVE.html delete mode 100644 doc/libc/unix/apple/constant.TCP_NODELAY.html delete mode 100644 doc/libc/unix/apple/constant.THOUSEP.html delete mode 100644 doc/libc/unix/apple/constant.TIOCCBRK.html delete mode 100644 doc/libc/unix/apple/constant.TIOCCDTR.html delete mode 100644 doc/libc/unix/apple/constant.TIOCCONS.html delete mode 100644 doc/libc/unix/apple/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/unix/apple/constant.TIOCDRAIN.html delete mode 100644 doc/libc/unix/apple/constant.TIOCDSIMICROCODE.html delete mode 100644 doc/libc/unix/apple/constant.TIOCEXCL.html delete mode 100644 doc/libc/unix/apple/constant.TIOCEXT.html delete mode 100644 doc/libc/unix/apple/constant.TIOCFLUSH.html delete mode 100644 doc/libc/unix/apple/constant.TIOCGDRAINWAIT.html delete mode 100644 doc/libc/unix/apple/constant.TIOCGETD.html delete mode 100644 doc/libc/unix/apple/constant.TIOCGPGRP.html delete mode 100644 doc/libc/unix/apple/constant.TIOCGWINSZ.html delete mode 100644 doc/libc/unix/apple/constant.TIOCIXOFF.html delete mode 100644 doc/libc/unix/apple/constant.TIOCIXON.html delete mode 100644 doc/libc/unix/apple/constant.TIOCMBIC.html delete mode 100644 doc/libc/unix/apple/constant.TIOCMBIS.html delete mode 100644 doc/libc/unix/apple/constant.TIOCMGDTRWAIT.html delete mode 100644 doc/libc/unix/apple/constant.TIOCMGET.html delete mode 100644 doc/libc/unix/apple/constant.TIOCMODG.html delete mode 100644 doc/libc/unix/apple/constant.TIOCMODS.html delete mode 100644 doc/libc/unix/apple/constant.TIOCMSDTRWAIT.html delete mode 100644 doc/libc/unix/apple/constant.TIOCMSET.html delete mode 100644 doc/libc/unix/apple/constant.TIOCM_CAR.html delete mode 100644 doc/libc/unix/apple/constant.TIOCM_CD.html delete mode 100644 doc/libc/unix/apple/constant.TIOCM_CTS.html delete mode 100644 doc/libc/unix/apple/constant.TIOCM_DSR.html delete mode 100644 doc/libc/unix/apple/constant.TIOCM_DTR.html delete mode 100644 doc/libc/unix/apple/constant.TIOCM_LE.html delete mode 100644 doc/libc/unix/apple/constant.TIOCM_RI.html delete mode 100644 doc/libc/unix/apple/constant.TIOCM_RNG.html delete mode 100644 doc/libc/unix/apple/constant.TIOCM_RTS.html delete mode 100644 doc/libc/unix/apple/constant.TIOCM_SR.html delete mode 100644 doc/libc/unix/apple/constant.TIOCM_ST.html delete mode 100644 doc/libc/unix/apple/constant.TIOCNOTTY.html delete mode 100644 doc/libc/unix/apple/constant.TIOCNXCL.html delete mode 100644 doc/libc/unix/apple/constant.TIOCOUTQ.html delete mode 100644 doc/libc/unix/apple/constant.TIOCPKT.html delete mode 100644 doc/libc/unix/apple/constant.TIOCPKT_DATA.html delete mode 100644 doc/libc/unix/apple/constant.TIOCPKT_DOSTOP.html delete mode 100644 doc/libc/unix/apple/constant.TIOCPKT_FLUSHREAD.html delete mode 100644 doc/libc/unix/apple/constant.TIOCPKT_FLUSHWRITE.html delete mode 100644 doc/libc/unix/apple/constant.TIOCPKT_IOCTL.html delete mode 100644 doc/libc/unix/apple/constant.TIOCPKT_NOSTOP.html delete mode 100644 doc/libc/unix/apple/constant.TIOCPKT_START.html delete mode 100644 doc/libc/unix/apple/constant.TIOCPKT_STOP.html delete mode 100644 doc/libc/unix/apple/constant.TIOCPTYGNAME.html delete mode 100644 doc/libc/unix/apple/constant.TIOCPTYGRANT.html delete mode 100644 doc/libc/unix/apple/constant.TIOCPTYUNLK.html delete mode 100644 doc/libc/unix/apple/constant.TIOCREMOTE.html delete mode 100644 doc/libc/unix/apple/constant.TIOCSBRK.html delete mode 100644 doc/libc/unix/apple/constant.TIOCSCONS.html delete mode 100644 doc/libc/unix/apple/constant.TIOCSCTTY.html delete mode 100644 doc/libc/unix/apple/constant.TIOCSDRAINWAIT.html delete mode 100644 doc/libc/unix/apple/constant.TIOCSDTR.html delete mode 100644 doc/libc/unix/apple/constant.TIOCSETD.html delete mode 100644 doc/libc/unix/apple/constant.TIOCSIG.html delete mode 100644 doc/libc/unix/apple/constant.TIOCSPGRP.html delete mode 100644 doc/libc/unix/apple/constant.TIOCSTART.html delete mode 100644 doc/libc/unix/apple/constant.TIOCSTAT.html delete mode 100644 doc/libc/unix/apple/constant.TIOCSTI.html delete mode 100644 doc/libc/unix/apple/constant.TIOCSTOP.html delete mode 100644 doc/libc/unix/apple/constant.TIOCSWINSZ.html delete mode 100644 doc/libc/unix/apple/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/unix/apple/constant.TIOCUCNTL.html delete mode 100644 doc/libc/unix/apple/constant.TMP_MAX.html delete mode 100644 doc/libc/unix/apple/constant.T_FMT.html delete mode 100644 doc/libc/unix/apple/constant.T_FMT_AMPM.html delete mode 100644 doc/libc/unix/apple/constant.VT0.html delete mode 100644 doc/libc/unix/apple/constant.VT1.html delete mode 100644 doc/libc/unix/apple/constant.W_OK.html delete mode 100644 doc/libc/unix/apple/constant.X_OK.html delete mode 100644 doc/libc/unix/apple/constant.YESEXPR.html delete mode 100644 doc/libc/unix/apple/constant.YESSTR.html delete mode 100644 doc/libc/unix/apple/constant._IOFBF.html delete mode 100644 doc/libc/unix/apple/constant._IOLBF.html delete mode 100644 doc/libc/unix/apple/constant._IONBF.html delete mode 100644 doc/libc/unix/apple/constant._PC_NAME_MAX.html delete mode 100644 doc/libc/unix/apple/constant._PTHREAD_COND_SIG_init.html delete mode 100644 doc/libc/unix/apple/constant._PTHREAD_MUTEX_SIG_init.html delete mode 100644 doc/libc/unix/apple/constant._PTHREAD_RWLOCK_SIG_init.html delete mode 100644 doc/libc/unix/apple/constant._RLIMIT_POSIX_FLAG.html delete mode 100644 doc/libc/unix/apple/constant._SC_2_CHAR_TERM.html delete mode 100644 doc/libc/unix/apple/constant._SC_2_C_BIND.html delete mode 100644 doc/libc/unix/apple/constant._SC_2_C_DEV.html delete mode 100644 doc/libc/unix/apple/constant._SC_2_FORT_DEV.html delete mode 100644 doc/libc/unix/apple/constant._SC_2_FORT_RUN.html delete mode 100644 doc/libc/unix/apple/constant._SC_2_LOCALEDEF.html delete mode 100644 doc/libc/unix/apple/constant._SC_2_PBS.html delete mode 100644 doc/libc/unix/apple/constant._SC_2_PBS_ACCOUNTING.html delete mode 100644 doc/libc/unix/apple/constant._SC_2_PBS_CHECKPOINT.html delete mode 100644 doc/libc/unix/apple/constant._SC_2_PBS_LOCATE.html delete mode 100644 doc/libc/unix/apple/constant._SC_2_PBS_MESSAGE.html delete mode 100644 doc/libc/unix/apple/constant._SC_2_PBS_TRACK.html delete mode 100644 doc/libc/unix/apple/constant._SC_2_SW_DEV.html delete mode 100644 doc/libc/unix/apple/constant._SC_2_UPE.html delete mode 100644 doc/libc/unix/apple/constant._SC_2_VERSION.html delete mode 100644 doc/libc/unix/apple/constant._SC_ADVISORY_INFO.html delete mode 100644 doc/libc/unix/apple/constant._SC_AIO_LISTIO_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_AIO_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_AIO_PRIO_DELTA_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_ARG_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_ASYNCHRONOUS_IO.html delete mode 100644 doc/libc/unix/apple/constant._SC_ATEXIT_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_BARRIERS.html delete mode 100644 doc/libc/unix/apple/constant._SC_BC_BASE_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_BC_DIM_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_BC_SCALE_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_BC_STRING_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_CHILD_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_CLK_TCK.html delete mode 100644 doc/libc/unix/apple/constant._SC_CLOCK_SELECTION.html delete mode 100644 doc/libc/unix/apple/constant._SC_COLL_WEIGHTS_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_CPUTIME.html delete mode 100644 doc/libc/unix/apple/constant._SC_DELAYTIMER_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_EXPR_NEST_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_FILE_LOCKING.html delete mode 100644 doc/libc/unix/apple/constant._SC_FSYNC.html delete mode 100644 doc/libc/unix/apple/constant._SC_GETGR_R_SIZE_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_GETPW_R_SIZE_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_HOST_NAME_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_IOV_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_IPV6.html delete mode 100644 doc/libc/unix/apple/constant._SC_JOB_CONTROL.html delete mode 100644 doc/libc/unix/apple/constant._SC_LINE_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_LOGIN_NAME_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_MAPPED_FILES.html delete mode 100644 doc/libc/unix/apple/constant._SC_MEMLOCK.html delete mode 100644 doc/libc/unix/apple/constant._SC_MEMLOCK_RANGE.html delete mode 100644 doc/libc/unix/apple/constant._SC_MEMORY_PROTECTION.html delete mode 100644 doc/libc/unix/apple/constant._SC_MESSAGE_PASSING.html delete mode 100644 doc/libc/unix/apple/constant._SC_MONOTONIC_CLOCK.html delete mode 100644 doc/libc/unix/apple/constant._SC_MQ_OPEN_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_MQ_PRIO_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_NGROUPS_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_NPROCESSORS_CONF.html delete mode 100644 doc/libc/unix/apple/constant._SC_NPROCESSORS_ONLN.html delete mode 100644 doc/libc/unix/apple/constant._SC_OPEN_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_PAGESIZE.html delete mode 100644 doc/libc/unix/apple/constant._SC_PAGE_SIZE.html delete mode 100644 doc/libc/unix/apple/constant._SC_PASS_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_PRIORITIZED_IO.html delete mode 100644 doc/libc/unix/apple/constant._SC_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/unix/apple/constant._SC_RAW_SOCKETS.html delete mode 100644 doc/libc/unix/apple/constant._SC_READER_WRITER_LOCKS.html delete mode 100644 doc/libc/unix/apple/constant._SC_REALTIME_SIGNALS.html delete mode 100644 doc/libc/unix/apple/constant._SC_REGEXP.html delete mode 100644 doc/libc/unix/apple/constant._SC_RE_DUP_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_RTSIG_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_SAVED_IDS.html delete mode 100644 doc/libc/unix/apple/constant._SC_SEMAPHORES.html delete mode 100644 doc/libc/unix/apple/constant._SC_SEM_NSEMS_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_SEM_VALUE_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_SHARED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/unix/apple/constant._SC_SHELL.html delete mode 100644 doc/libc/unix/apple/constant._SC_SIGQUEUE_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_SPAWN.html delete mode 100644 doc/libc/unix/apple/constant._SC_SPIN_LOCKS.html delete mode 100644 doc/libc/unix/apple/constant._SC_SPORADIC_SERVER.html delete mode 100644 doc/libc/unix/apple/constant._SC_SS_REPL_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_STREAM_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_SYMLOOP_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_SYNCHRONIZED_IO.html delete mode 100644 doc/libc/unix/apple/constant._SC_THREADS.html delete mode 100644 doc/libc/unix/apple/constant._SC_THREAD_ATTR_STACKADDR.html delete mode 100644 doc/libc/unix/apple/constant._SC_THREAD_ATTR_STACKSIZE.html delete mode 100644 doc/libc/unix/apple/constant._SC_THREAD_CPUTIME.html delete mode 100644 doc/libc/unix/apple/constant._SC_THREAD_DESTRUCTOR_ITERATIONS.html delete mode 100644 doc/libc/unix/apple/constant._SC_THREAD_KEYS_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_THREAD_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/unix/apple/constant._SC_THREAD_PRIO_INHERIT.html delete mode 100644 doc/libc/unix/apple/constant._SC_THREAD_PRIO_PROTECT.html delete mode 100644 doc/libc/unix/apple/constant._SC_THREAD_PROCESS_SHARED.html delete mode 100644 doc/libc/unix/apple/constant._SC_THREAD_SAFE_FUNCTIONS.html delete mode 100644 doc/libc/unix/apple/constant._SC_THREAD_SPORADIC_SERVER.html delete mode 100644 doc/libc/unix/apple/constant._SC_THREAD_STACK_MIN.html delete mode 100644 doc/libc/unix/apple/constant._SC_THREAD_THREADS_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_TIMEOUTS.html delete mode 100644 doc/libc/unix/apple/constant._SC_TIMERS.html delete mode 100644 doc/libc/unix/apple/constant._SC_TIMER_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_TRACE.html delete mode 100644 doc/libc/unix/apple/constant._SC_TRACE_EVENT_FILTER.html delete mode 100644 doc/libc/unix/apple/constant._SC_TRACE_EVENT_NAME_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_TRACE_INHERIT.html delete mode 100644 doc/libc/unix/apple/constant._SC_TRACE_LOG.html delete mode 100644 doc/libc/unix/apple/constant._SC_TRACE_NAME_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_TRACE_SYS_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_TRACE_USER_EVENT_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_TTY_NAME_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_TYPED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/unix/apple/constant._SC_TZNAME_MAX.html delete mode 100644 doc/libc/unix/apple/constant._SC_V6_ILP32_OFF32.html delete mode 100644 doc/libc/unix/apple/constant._SC_V6_ILP32_OFFBIG.html delete mode 100644 doc/libc/unix/apple/constant._SC_V6_LP64_OFF64.html delete mode 100644 doc/libc/unix/apple/constant._SC_V6_LPBIG_OFFBIG.html delete mode 100644 doc/libc/unix/apple/constant._SC_VERSION.html delete mode 100644 doc/libc/unix/apple/constant._SC_XBS5_ILP32_OFF32.html delete mode 100644 doc/libc/unix/apple/constant._SC_XBS5_ILP32_OFFBIG.html delete mode 100644 doc/libc/unix/apple/constant._SC_XBS5_LP64_OFF64.html delete mode 100644 doc/libc/unix/apple/constant._SC_XBS5_LPBIG_OFFBIG.html delete mode 100644 doc/libc/unix/apple/constant._SC_XOPEN_CRYPT.html delete mode 100644 doc/libc/unix/apple/constant._SC_XOPEN_ENH_I18N.html delete mode 100644 doc/libc/unix/apple/constant._SC_XOPEN_LEGACY.html delete mode 100644 doc/libc/unix/apple/constant._SC_XOPEN_REALTIME.html delete mode 100644 doc/libc/unix/apple/constant._SC_XOPEN_REALTIME_THREADS.html delete mode 100644 doc/libc/unix/apple/constant._SC_XOPEN_SHM.html delete mode 100644 doc/libc/unix/apple/constant._SC_XOPEN_STREAMS.html delete mode 100644 doc/libc/unix/apple/constant._SC_XOPEN_UNIX.html delete mode 100644 doc/libc/unix/apple/constant._SC_XOPEN_VERSION.html delete mode 100644 doc/libc/unix/apple/constant._SC_XOPEN_XCU_VERSION.html delete mode 100644 doc/libc/unix/apple/constant._WSTOPPED.html delete mode 100644 doc/libc/unix/apple/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/unix/apple/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/unix/apple/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/unix/apple/enum.timezone.html delete mode 100644 doc/libc/unix/apple/fn.WIFCONTINUED.html delete mode 100644 doc/libc/unix/apple/fn.WIFSIGNALED.html delete mode 100644 doc/libc/unix/apple/fn.WIFSTOPPED.html delete mode 100644 doc/libc/unix/apple/fn.WSTOPSIG.html delete mode 100644 doc/libc/unix/apple/fn._WSTATUS.html delete mode 100644 doc/libc/unix/apple/fn.__error.html delete mode 100644 doc/libc/unix/apple/fn.backtrace.html delete mode 100644 doc/libc/unix/apple/fn.duplocale.html delete mode 100644 doc/libc/unix/apple/fn.forkpty.html delete mode 100644 doc/libc/unix/apple/fn.freelocale.html delete mode 100644 doc/libc/unix/apple/fn.fstatfs.html delete mode 100644 doc/libc/unix/apple/fn.getnameinfo.html delete mode 100644 doc/libc/unix/apple/fn.kevent.html delete mode 100644 doc/libc/unix/apple/fn.kevent64.html delete mode 100644 doc/libc/unix/apple/fn.localeconv_l.html delete mode 100644 doc/libc/unix/apple/fn.mach_absolute_time.html delete mode 100644 doc/libc/unix/apple/fn.mach_timebase_info.html delete mode 100644 doc/libc/unix/apple/fn.mincore.html delete mode 100644 doc/libc/unix/apple/fn.mount.html delete mode 100644 doc/libc/unix/apple/fn.mprotect.html delete mode 100644 doc/libc/unix/apple/fn.newlocale.html delete mode 100644 doc/libc/unix/apple/fn.openpty.html delete mode 100644 doc/libc/unix/apple/fn.pthread_get_stackaddr_np.html delete mode 100644 doc/libc/unix/apple/fn.pthread_get_stacksize_np.html delete mode 100644 doc/libc/unix/apple/fn.pthread_setname_np.html delete mode 100644 doc/libc/unix/apple/fn.ptrace.html delete mode 100644 doc/libc/unix/apple/fn.querylocale.html delete mode 100644 doc/libc/unix/apple/fn.quotactl.html delete mode 100644 doc/libc/unix/apple/fn.sendfile.html delete mode 100644 doc/libc/unix/apple/fn.sethostname.html delete mode 100644 doc/libc/unix/apple/fn.shm_open.html delete mode 100644 doc/libc/unix/apple/fn.statfs.html delete mode 100644 doc/libc/unix/apple/fn.sysctl.html delete mode 100644 doc/libc/unix/apple/fn.sysctlbyname.html delete mode 100644 doc/libc/unix/apple/fn.sysctlnametomib.html delete mode 100644 doc/libc/unix/apple/fn.uselocale.html delete mode 100644 doc/libc/unix/apple/index.html delete mode 100644 doc/libc/unix/apple/sidebar-items.js delete mode 100644 doc/libc/unix/apple/struct.Dl_info.html delete mode 100644 doc/libc/unix/apple/struct.addrinfo.html delete mode 100644 doc/libc/unix/apple/struct.dirent.html delete mode 100644 doc/libc/unix/apple/struct.dqblk.html delete mode 100644 doc/libc/unix/apple/struct.flock.html delete mode 100644 doc/libc/unix/apple/struct.fstore_t.html delete mode 100644 doc/libc/unix/apple/struct.glob_t.html delete mode 100644 doc/libc/unix/apple/struct.kevent.html delete mode 100644 doc/libc/unix/apple/struct.kevent64_s.html delete mode 100644 doc/libc/unix/apple/struct.lconv.html delete mode 100644 doc/libc/unix/apple/struct.mach_timebase_info.html delete mode 100644 doc/libc/unix/apple/struct.pthread_attr_t.html delete mode 100644 doc/libc/unix/apple/struct.pthread_cond_t.html delete mode 100644 doc/libc/unix/apple/struct.pthread_mutex_t.html delete mode 100644 doc/libc/unix/apple/struct.pthread_mutexattr_t.html delete mode 100644 doc/libc/unix/apple/struct.pthread_rwlock_t.html delete mode 100644 doc/libc/unix/apple/struct.radvisory.html delete mode 100644 doc/libc/unix/apple/struct.sf_hdtr.html delete mode 100644 doc/libc/unix/apple/struct.sigaction.html delete mode 100644 doc/libc/unix/apple/struct.siginfo_t.html delete mode 100644 doc/libc/unix/apple/struct.sockaddr_in.html delete mode 100644 doc/libc/unix/apple/struct.sockaddr_storage.html delete mode 100644 doc/libc/unix/apple/struct.stack_t.html delete mode 100644 doc/libc/unix/apple/struct.stat.html delete mode 100644 doc/libc/unix/apple/struct.statfs.html delete mode 100644 doc/libc/unix/apple/struct.statvfs.html delete mode 100644 doc/libc/unix/apple/struct.termios.html delete mode 100644 doc/libc/unix/apple/type.blksize_t.html delete mode 100644 doc/libc/unix/apple/type.c_long.html delete mode 100644 doc/libc/unix/apple/type.c_ulong.html delete mode 100644 doc/libc/unix/apple/type.clock_t.html delete mode 100644 doc/libc/unix/apple/type.dev_t.html delete mode 100644 doc/libc/unix/apple/type.fsblkcnt_t.html delete mode 100644 doc/libc/unix/apple/type.fsfilcnt_t.html delete mode 100644 doc/libc/unix/apple/type.ino_t.html delete mode 100644 doc/libc/unix/apple/type.mach_timebase_info_data_t.html delete mode 100644 doc/libc/unix/apple/type.mode_t.html delete mode 100644 doc/libc/unix/apple/type.nl_item.html delete mode 100644 doc/libc/unix/apple/type.nlink_t.html delete mode 100644 doc/libc/unix/apple/type.pthread_key_t.html delete mode 100644 doc/libc/unix/apple/type.rlim_t.html delete mode 100644 doc/libc/unix/apple/type.sigset_t.html delete mode 100644 doc/libc/unix/apple/type.speed_t.html delete mode 100644 doc/libc/unix/apple/type.suseconds_t.html delete mode 100644 doc/libc/unix/apple/type.tcflag_t.html delete mode 100644 doc/libc/unix/apple/type.time_t.html delete mode 100644 doc/libc/unix/b64/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/unix/b64/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/unix/b64/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/unix/b64/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/unix/b64/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/unix/b64/index.html delete mode 100644 doc/libc/unix/b64/sidebar-items.js delete mode 100644 doc/libc/unix/b64/struct.pthread_attr_t.html delete mode 100644 doc/libc/unix/b64/type.c_long.html delete mode 100644 doc/libc/unix/b64/type.c_ulong.html delete mode 100644 doc/libc/unix/bsd/apple/b64/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/unix/bsd/apple/b64/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/unix/bsd/apple/b64/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/unix/bsd/apple/b64/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/unix/bsd/apple/b64/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/unix/bsd/apple/b64/index.html delete mode 100644 doc/libc/unix/bsd/apple/b64/sidebar-items.js delete mode 100644 doc/libc/unix/bsd/apple/b64/struct.pthread_attr_t.html delete mode 100644 doc/libc/unix/bsd/apple/b64/type.c_long.html delete mode 100644 doc/libc/unix/bsd/apple/b64/type.c_ulong.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABDAY_1.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABDAY_2.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABDAY_3.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABDAY_4.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABDAY_5.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABDAY_6.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABDAY_7.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABMON_1.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABMON_10.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABMON_11.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABMON_12.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABMON_2.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABMON_3.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABMON_4.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABMON_5.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABMON_6.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABMON_7.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABMON_8.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ABMON_9.html delete mode 100644 doc/libc/unix/bsd/apple/constant.AF_INET.html delete mode 100644 doc/libc/unix/bsd/apple/constant.AF_INET6.html delete mode 100644 doc/libc/unix/bsd/apple/constant.AF_UNIX.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ALT_DIGITS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.AM_STR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.BS0.html delete mode 100644 doc/libc/unix/bsd/apple/constant.BS1.html delete mode 100644 doc/libc/unix/bsd/apple/constant.BUFSIZ.html delete mode 100644 doc/libc/unix/bsd/apple/constant.CODESET.html delete mode 100644 doc/libc/unix/bsd/apple/constant.CR0.html delete mode 100644 doc/libc/unix/bsd/apple/constant.CR1.html delete mode 100644 doc/libc/unix/bsd/apple/constant.CR2.html delete mode 100644 doc/libc/unix/bsd/apple/constant.CR3.html delete mode 100644 doc/libc/unix/bsd/apple/constant.CRNCYSTR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.CRTSCTS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.DAY_1.html delete mode 100644 doc/libc/unix/bsd/apple/constant.DAY_2.html delete mode 100644 doc/libc/unix/bsd/apple/constant.DAY_3.html delete mode 100644 doc/libc/unix/bsd/apple/constant.DAY_4.html delete mode 100644 doc/libc/unix/bsd/apple/constant.DAY_5.html delete mode 100644 doc/libc/unix/bsd/apple/constant.DAY_6.html delete mode 100644 doc/libc/unix/bsd/apple/constant.DAY_7.html delete mode 100644 doc/libc/unix/bsd/apple/constant.D_FMT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.D_MD_ORDER.html delete mode 100644 doc/libc/unix/bsd/apple/constant.D_T_FMT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.E2BIG.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EACCES.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EADDRINUSE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EADDRNOTAVAIL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EAFNOSUPPORT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EAGAIN.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EALREADY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EAUTH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EBADARCH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EBADEXEC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EBADF.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EBADMACHO.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EBADMSG.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EBADRPC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EBUSY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ECANCELED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ECHILD.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ECONNABORTED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ECONNREFUSED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ECONNRESET.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EDEADLK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EDESTADDRREQ.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EDEVERR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EDOM.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EDQUOT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EEXIST.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EFAULT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EFBIG.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EFTYPE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EHOSTDOWN.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EHOSTUNREACH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EIDRM.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EILSEQ.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EINPROGRESS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EINTR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EINVAL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EIO.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EISCONN.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EISDIR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ELAST.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ELOOP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EMFILE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EMLINK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EMSGSIZE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EMULTIHOP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENAMETOOLONG.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENEEDAUTH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENETDOWN.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENETRESET.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENETUNREACH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENFILE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOATTR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOBUFS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENODATA.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENODEV.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOENT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOEXEC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOLCK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOLINK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOMEM.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOMSG.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOPOLICY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOPROTOOPT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOSPC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOSR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOSTR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOSYS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOTBLK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOTCONN.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOTDIR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOTEMPTY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOTRECOVERABLE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOTSOCK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOTSUP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENOTTY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ENXIO.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EOF.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EOPNOTSUPP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EOVERFLOW.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EOWNERDEAD.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EPERM.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EPFNOSUPPORT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EPIPE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EPROCLIM.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EPROCUNAVAIL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EPROGMISMATCH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EPROGUNAVAIL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EPROTO.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EPROTONOSUPPORT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EPROTOTYPE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EPWROFF.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EQFULL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ERA.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ERANGE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ERA_D_FMT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ERA_D_T_FMT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ERA_T_FMT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EREMOTE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EROFS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ERPCMISMATCH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ESHLIBVERS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ESHUTDOWN.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ESOCKTNOSUPPORT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ESPIPE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ESRCH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ESTALE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ETIME.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ETIMEDOUT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ETOOMANYREFS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ETXTBSY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EUSERS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EVFILT_AIO.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EVFILT_FS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EVFILT_MACHPORT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EVFILT_PROC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EVFILT_READ.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EVFILT_SIGNAL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EVFILT_SYSCOUNT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EVFILT_TIMER.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EVFILT_USER.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EVFILT_VM.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EVFILT_VNODE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EVFILT_WRITE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EV_DISPATCH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EV_FLAG0.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EV_OOBAND.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EV_POLL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EV_RECEIPT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EWOULDBLOCK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EXDEV.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EXIT_FAILURE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.EXIT_SUCCESS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.FD_SETSIZE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.FF0.html delete mode 100644 doc/libc/unix/bsd/apple/constant.FF1.html delete mode 100644 doc/libc/unix/bsd/apple/constant.FILENAME_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant.FOPEN_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_ALLOCATEALL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_ALLOCATECONTIG.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_DUPFD.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_DUPFD_CLOEXEC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_FREEZE_FS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_FULLFSYNC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_GETFD.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_GETFL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_GETLK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_GETPATH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_GLOBAL_NOCACHE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_LOCK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_NOCACHE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_NODIRECT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_OK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_PEOFPOSMODE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_PREALLOCATE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_RDADVISE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_RDAHEAD.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_SETFD.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_SETFL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_SETLK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_SETLKW.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_TEST.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_THAW_FS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_TLOCK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_ULOCK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.F_VOLPOSMODE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.GLOB_ABORTED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.GLOB_APPEND.html delete mode 100644 doc/libc/unix/bsd/apple/constant.GLOB_DOOFFS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.GLOB_ERR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.GLOB_MARK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.GLOB_NOCHECK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.GLOB_NOESCAPE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.GLOB_NOMATCH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.GLOB_NOSORT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.GLOB_NOSPACE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.HW_AVAILCPU.html delete mode 100644 doc/libc/unix/bsd/apple/constant.IFF_LOOPBACK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.IPPROTO_IP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.IPPROTO_IPV6.html delete mode 100644 doc/libc/unix/bsd/apple/constant.IPPROTO_RAW.html delete mode 100644 doc/libc/unix/bsd/apple/constant.IPPROTO_TCP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.IPV6_JOIN_GROUP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.IPV6_LEAVE_GROUP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.IP_ADD_MEMBERSHIP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.IP_DROP_MEMBERSHIP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.IP_HDRINCL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.IP_MULTICAST_LOOP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.IP_MULTICAST_TTL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.IP_TTL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.IUTF8.html delete mode 100644 doc/libc/unix/bsd/apple/constant.LC_ALL_MASK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.LC_COLLATE_MASK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.LC_CTYPE_MASK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.LC_MESSAGES_MASK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.LC_MONETARY_MASK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.LC_NUMERIC_MASK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.LC_TIME_MASK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.LOCK_EX.html delete mode 100644 doc/libc/unix/bsd/apple/constant.LOCK_NB.html delete mode 100644 doc/libc/unix/bsd/apple/constant.LOCK_SH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.LOCK_UN.html delete mode 100644 doc/libc/unix/bsd/apple/constant.L_tmpnam.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MADV_CAN_REUSE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MADV_DONTNEED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MADV_FREE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MADV_FREE_REUSABLE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MADV_FREE_REUSE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MADV_NORMAL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MADV_RANDOM.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MADV_SEQUENTIAL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MADV_WILLNEED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MADV_ZERO_WIRED_PAGES.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MAP_ANON.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MAP_COPY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MAP_FAILED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MAP_FILE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MAP_FIXED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MAP_HASSEMAPHORE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MAP_JIT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MAP_NOCACHE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MAP_NOEXTEND.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MAP_NORESERVE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MAP_PRIVATE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MAP_RENAME.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MAP_SHARED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MCL_CURRENT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MCL_FUTURE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MINCORE_INCORE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MINCORE_MODIFIED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MINCORE_MODIFIED_OTHER.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MINCORE_REFERENCED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MINCORE_REFERENCED_OTHER.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MON_1.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MON_10.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MON_11.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MON_12.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MON_2.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MON_3.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MON_4.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MON_5.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MON_6.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MON_7.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MON_8.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MON_9.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MS_ASYNC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MS_DEACTIVATE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MS_INVALIDATE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MS_KILLPAGES.html delete mode 100644 doc/libc/unix/bsd/apple/constant.MS_SYNC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NI_MAXHOST.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NL0.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NL1.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOEXPR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOSTR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_ABSOLUTE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_EXITSTATUS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_EXIT_REPARENTED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_FFAND.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_FFCOPY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_FFCTRLMASK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_FFLAGSMASK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_FFNOP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_FFOR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_NONE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_NSECONDS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_PCTRLMASK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_REAP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_SECONDS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_SIGNAL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_TRIGGER.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_USECONDS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_VM_ERROR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_VM_PRESSURE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.NOTE_VM_PRESSURE_TERMINATE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.O_ACCMODE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.O_APPEND.html delete mode 100644 doc/libc/unix/bsd/apple/constant.O_CLOEXEC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.O_CREAT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.O_DIRECTORY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.O_DSYNC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.O_EXCL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.O_NOCTTY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.O_NONBLOCK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.O_RDONLY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.O_RDWR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.O_SYNC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.O_TRUNC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.O_WRONLY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.PM_STR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.POSIX_MADV_DONTNEED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.POSIX_MADV_NORMAL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.POSIX_MADV_RANDOM.html delete mode 100644 doc/libc/unix/bsd/apple/constant.POSIX_MADV_SEQUENTIAL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.POSIX_MADV_WILLNEED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.PROT_EXEC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.PROT_NONE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.PROT_READ.html delete mode 100644 doc/libc/unix/bsd/apple/constant.PROT_WRITE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.PTHREAD_COND_INITIALIZER.html delete mode 100644 doc/libc/unix/bsd/apple/constant.PTHREAD_CREATE_DETACHED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.PTHREAD_CREATE_JOINABLE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.PTHREAD_MUTEX_INITIALIZER.html delete mode 100644 doc/libc/unix/bsd/apple/constant.PTHREAD_MUTEX_RECURSIVE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.PTHREAD_RWLOCK_INITIALIZER.html delete mode 100644 doc/libc/unix/bsd/apple/constant.PTHREAD_STACK_MIN.html delete mode 100644 doc/libc/unix/bsd/apple/constant.Q_GETQUOTA.html delete mode 100644 doc/libc/unix/bsd/apple/constant.Q_SETQUOTA.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RADIXCHAR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RAND_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RLIMIT_AS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RLIMIT_CORE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RLIMIT_CPU.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RLIMIT_DATA.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RLIMIT_FSIZE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RLIMIT_MEMLOCK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RLIMIT_NOFILE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RLIMIT_NPROC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RLIMIT_RSS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RLIMIT_STACK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RLIM_INFINITY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RLIM_NLIMITS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RTLD_FIRST.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RTLD_GLOBAL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RTLD_LOCAL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RTLD_NODELETE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RTLD_NOLOAD.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RUSAGE_CHILDREN.html delete mode 100644 doc/libc/unix/bsd/apple/constant.RUSAGE_SELF.html delete mode 100644 doc/libc/unix/bsd/apple/constant.R_OK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SEEK_CUR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SEEK_END.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SEEK_SET.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SHUT_RD.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SHUT_RDWR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SHUT_WR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SIGABRT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SIGALRM.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SIGEMT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SIGFPE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SIGHUP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SIGILL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SIGINT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SIGKILL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SIGPIPE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SIGQUIT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SIGSEGV.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SIGSTKSZ.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SIGTERM.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SIGTRAP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SOCK_DGRAM.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SOCK_RAW.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SOCK_STREAM.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SOL_SOCKET.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_ACCEPTCONN.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_BROADCAST.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_DEBUG.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_DONTROUTE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_DONTTRUNC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_ERROR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_KEEPALIVE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_LINGER.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_NKE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_NOADDRERR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_NOSIGPIPE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_NREAD.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_NWRITE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_OOBINLINE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_RCVBUF.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_RCVLOWAT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_RCVTIMEO.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_REUSEADDR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_REUSEPORT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_SNDBUF.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_SNDLOWAT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_SNDTIMEO.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_TYPE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_USELOOPBACK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_WANTMORE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.SO_WANTOOBFLAG.html delete mode 100644 doc/libc/unix/bsd/apple/constant.STDERR_FILENO.html delete mode 100644 doc/libc/unix/bsd/apple/constant.STDIN_FILENO.html delete mode 100644 doc/libc/unix/bsd/apple/constant.STDOUT_FILENO.html delete mode 100644 doc/libc/unix/bsd/apple/constant.ST_NOSUID.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IEXEC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IFBLK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IFCHR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IFDIR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IFIFO.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IFLNK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IFMT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IFREG.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IFSOCK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IREAD.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IRGRP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IROTH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IRUSR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IRWXG.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IRWXO.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IRWXU.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IWGRP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IWOTH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IWRITE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IWUSR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IXGRP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IXOTH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.S_IXUSR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TAB0.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TAB1.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TAB2.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TAB3.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TCP_KEEPALIVE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TCP_NODELAY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.THOUSEP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCCBRK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCCDTR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCCONS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCDRAIN.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCDSIMICROCODE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCEXCL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCEXT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCFLUSH.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCGDRAINWAIT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCGETD.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCGPGRP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCGWINSZ.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCIXOFF.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCIXON.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCMBIC.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCMBIS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCMGDTRWAIT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCMGET.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCMODG.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCMODS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCMSDTRWAIT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCMSET.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCM_CAR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCM_CD.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCM_CTS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCM_DSR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCM_DTR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCM_LE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCM_RI.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCM_RNG.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCM_RTS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCM_SR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCM_ST.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCNOTTY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCNXCL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCOUTQ.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCPKT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCPKT_DATA.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCPKT_DOSTOP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCPKT_FLUSHREAD.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCPKT_FLUSHWRITE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCPKT_IOCTL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCPKT_NOSTOP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCPKT_START.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCPKT_STOP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCPTYGNAME.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCPTYGRANT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCPTYUNLK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCREMOTE.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCSBRK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCSCONS.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCSCTTY.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCSDRAINWAIT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCSDTR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCSETD.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCSIG.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCSPGRP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCSTART.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCSTAT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCSTI.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCSTOP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCSWINSZ.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TIOCUCNTL.html delete mode 100644 doc/libc/unix/bsd/apple/constant.TMP_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant.T_FMT.html delete mode 100644 doc/libc/unix/bsd/apple/constant.T_FMT_AMPM.html delete mode 100644 doc/libc/unix/bsd/apple/constant.VT0.html delete mode 100644 doc/libc/unix/bsd/apple/constant.VT1.html delete mode 100644 doc/libc/unix/bsd/apple/constant.W_OK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.X_OK.html delete mode 100644 doc/libc/unix/bsd/apple/constant.YESEXPR.html delete mode 100644 doc/libc/unix/bsd/apple/constant.YESSTR.html delete mode 100644 doc/libc/unix/bsd/apple/constant._IOFBF.html delete mode 100644 doc/libc/unix/bsd/apple/constant._IOLBF.html delete mode 100644 doc/libc/unix/bsd/apple/constant._IONBF.html delete mode 100644 doc/libc/unix/bsd/apple/constant._PC_NAME_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._PTHREAD_COND_SIG_init.html delete mode 100644 doc/libc/unix/bsd/apple/constant._PTHREAD_MUTEX_SIG_init.html delete mode 100644 doc/libc/unix/bsd/apple/constant._PTHREAD_RWLOCK_SIG_init.html delete mode 100644 doc/libc/unix/bsd/apple/constant._RLIMIT_POSIX_FLAG.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_2_CHAR_TERM.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_2_C_BIND.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_2_C_DEV.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_2_FORT_DEV.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_2_FORT_RUN.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_2_LOCALEDEF.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_2_PBS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_2_PBS_ACCOUNTING.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_2_PBS_CHECKPOINT.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_2_PBS_LOCATE.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_2_PBS_MESSAGE.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_2_PBS_TRACK.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_2_SW_DEV.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_2_UPE.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_2_VERSION.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_ADVISORY_INFO.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_AIO_LISTIO_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_AIO_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_AIO_PRIO_DELTA_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_ARG_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_ASYNCHRONOUS_IO.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_ATEXIT_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_BARRIERS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_BC_BASE_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_BC_DIM_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_BC_SCALE_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_BC_STRING_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_CHILD_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_CLK_TCK.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_CLOCK_SELECTION.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_COLL_WEIGHTS_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_CPUTIME.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_DELAYTIMER_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_EXPR_NEST_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_FILE_LOCKING.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_FSYNC.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_GETGR_R_SIZE_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_GETPW_R_SIZE_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_HOST_NAME_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_IOV_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_IPV6.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_JOB_CONTROL.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_LINE_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_LOGIN_NAME_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_MAPPED_FILES.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_MEMLOCK.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_MEMLOCK_RANGE.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_MEMORY_PROTECTION.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_MESSAGE_PASSING.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_MONOTONIC_CLOCK.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_MQ_OPEN_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_MQ_PRIO_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_NGROUPS_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_NPROCESSORS_CONF.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_NPROCESSORS_ONLN.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_OPEN_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_PAGESIZE.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_PAGE_SIZE.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_PASS_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_PRIORITIZED_IO.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_RAW_SOCKETS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_READER_WRITER_LOCKS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_REALTIME_SIGNALS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_REGEXP.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_RE_DUP_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_RTSIG_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_SAVED_IDS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_SEMAPHORES.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_SEM_NSEMS_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_SEM_VALUE_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_SHARED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_SHELL.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_SIGQUEUE_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_SPAWN.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_SPIN_LOCKS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_SPORADIC_SERVER.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_SS_REPL_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_STREAM_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_SYMLOOP_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_SYNCHRONIZED_IO.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_THREADS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_THREAD_ATTR_STACKADDR.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_THREAD_ATTR_STACKSIZE.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_THREAD_CPUTIME.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_THREAD_DESTRUCTOR_ITERATIONS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_THREAD_KEYS_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_THREAD_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_THREAD_PRIO_INHERIT.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_THREAD_PRIO_PROTECT.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_THREAD_PROCESS_SHARED.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_THREAD_SAFE_FUNCTIONS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_THREAD_SPORADIC_SERVER.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_THREAD_STACK_MIN.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_THREAD_THREADS_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_TIMEOUTS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_TIMERS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_TIMER_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_TRACE.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_TRACE_EVENT_FILTER.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_TRACE_EVENT_NAME_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_TRACE_INHERIT.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_TRACE_LOG.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_TRACE_NAME_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_TRACE_SYS_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_TRACE_USER_EVENT_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_TTY_NAME_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_TYPED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_TZNAME_MAX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_V6_ILP32_OFF32.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_V6_ILP32_OFFBIG.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_V6_LP64_OFF64.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_V6_LPBIG_OFFBIG.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_VERSION.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_XBS5_ILP32_OFF32.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_XBS5_ILP32_OFFBIG.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_XBS5_LP64_OFF64.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_XBS5_LPBIG_OFFBIG.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_XOPEN_CRYPT.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_XOPEN_ENH_I18N.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_XOPEN_LEGACY.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_XOPEN_REALTIME.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_XOPEN_REALTIME_THREADS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_XOPEN_SHM.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_XOPEN_STREAMS.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_XOPEN_UNIX.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_XOPEN_VERSION.html delete mode 100644 doc/libc/unix/bsd/apple/constant._SC_XOPEN_XCU_VERSION.html delete mode 100644 doc/libc/unix/bsd/apple/constant._WSTOPPED.html delete mode 100644 doc/libc/unix/bsd/apple/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/unix/bsd/apple/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/unix/bsd/apple/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/unix/bsd/apple/enum.timezone.html delete mode 100644 doc/libc/unix/bsd/apple/fn.WIFCONTINUED.html delete mode 100644 doc/libc/unix/bsd/apple/fn.WIFSIGNALED.html delete mode 100644 doc/libc/unix/bsd/apple/fn.WIFSTOPPED.html delete mode 100644 doc/libc/unix/bsd/apple/fn.WSTOPSIG.html delete mode 100644 doc/libc/unix/bsd/apple/fn._WSTATUS.html delete mode 100644 doc/libc/unix/bsd/apple/fn.__error.html delete mode 100644 doc/libc/unix/bsd/apple/fn.backtrace.html delete mode 100644 doc/libc/unix/bsd/apple/fn.duplocale.html delete mode 100644 doc/libc/unix/bsd/apple/fn.forkpty.html delete mode 100644 doc/libc/unix/bsd/apple/fn.freelocale.html delete mode 100644 doc/libc/unix/bsd/apple/fn.fstatfs.html delete mode 100644 doc/libc/unix/bsd/apple/fn.getnameinfo.html delete mode 100644 doc/libc/unix/bsd/apple/fn.kevent.html delete mode 100644 doc/libc/unix/bsd/apple/fn.kevent64.html delete mode 100644 doc/libc/unix/bsd/apple/fn.localeconv_l.html delete mode 100644 doc/libc/unix/bsd/apple/fn.mach_absolute_time.html delete mode 100644 doc/libc/unix/bsd/apple/fn.mach_timebase_info.html delete mode 100644 doc/libc/unix/bsd/apple/fn.mincore.html delete mode 100644 doc/libc/unix/bsd/apple/fn.mount.html delete mode 100644 doc/libc/unix/bsd/apple/fn.mprotect.html delete mode 100644 doc/libc/unix/bsd/apple/fn.newlocale.html delete mode 100644 doc/libc/unix/bsd/apple/fn.openpty.html delete mode 100644 doc/libc/unix/bsd/apple/fn.pthread_get_stackaddr_np.html delete mode 100644 doc/libc/unix/bsd/apple/fn.pthread_get_stacksize_np.html delete mode 100644 doc/libc/unix/bsd/apple/fn.pthread_setname_np.html delete mode 100644 doc/libc/unix/bsd/apple/fn.ptrace.html delete mode 100644 doc/libc/unix/bsd/apple/fn.querylocale.html delete mode 100644 doc/libc/unix/bsd/apple/fn.quotactl.html delete mode 100644 doc/libc/unix/bsd/apple/fn.sendfile.html delete mode 100644 doc/libc/unix/bsd/apple/fn.sethostname.html delete mode 100644 doc/libc/unix/bsd/apple/fn.shm_open.html delete mode 100644 doc/libc/unix/bsd/apple/fn.statfs.html delete mode 100644 doc/libc/unix/bsd/apple/fn.sysctl.html delete mode 100644 doc/libc/unix/bsd/apple/fn.sysctlbyname.html delete mode 100644 doc/libc/unix/bsd/apple/fn.sysctlnametomib.html delete mode 100644 doc/libc/unix/bsd/apple/fn.uselocale.html delete mode 100644 doc/libc/unix/bsd/apple/index.html delete mode 100644 doc/libc/unix/bsd/apple/sidebar-items.js delete mode 100644 doc/libc/unix/bsd/apple/struct.Dl_info.html delete mode 100644 doc/libc/unix/bsd/apple/struct.addrinfo.html delete mode 100644 doc/libc/unix/bsd/apple/struct.dirent.html delete mode 100644 doc/libc/unix/bsd/apple/struct.dqblk.html delete mode 100644 doc/libc/unix/bsd/apple/struct.flock.html delete mode 100644 doc/libc/unix/bsd/apple/struct.fstore_t.html delete mode 100644 doc/libc/unix/bsd/apple/struct.glob_t.html delete mode 100644 doc/libc/unix/bsd/apple/struct.kevent.html delete mode 100644 doc/libc/unix/bsd/apple/struct.kevent64_s.html delete mode 100644 doc/libc/unix/bsd/apple/struct.lconv.html delete mode 100644 doc/libc/unix/bsd/apple/struct.mach_timebase_info.html delete mode 100644 doc/libc/unix/bsd/apple/struct.pthread_attr_t.html delete mode 100644 doc/libc/unix/bsd/apple/struct.pthread_cond_t.html delete mode 100644 doc/libc/unix/bsd/apple/struct.pthread_mutex_t.html delete mode 100644 doc/libc/unix/bsd/apple/struct.pthread_mutexattr_t.html delete mode 100644 doc/libc/unix/bsd/apple/struct.pthread_rwlock_t.html delete mode 100644 doc/libc/unix/bsd/apple/struct.radvisory.html delete mode 100644 doc/libc/unix/bsd/apple/struct.sf_hdtr.html delete mode 100644 doc/libc/unix/bsd/apple/struct.sigaction.html delete mode 100644 doc/libc/unix/bsd/apple/struct.siginfo_t.html delete mode 100644 doc/libc/unix/bsd/apple/struct.sockaddr_in.html delete mode 100644 doc/libc/unix/bsd/apple/struct.sockaddr_storage.html delete mode 100644 doc/libc/unix/bsd/apple/struct.stack_t.html delete mode 100644 doc/libc/unix/bsd/apple/struct.stat.html delete mode 100644 doc/libc/unix/bsd/apple/struct.statfs.html delete mode 100644 doc/libc/unix/bsd/apple/struct.statvfs.html delete mode 100644 doc/libc/unix/bsd/apple/struct.termios.html delete mode 100644 doc/libc/unix/bsd/apple/type.blksize_t.html delete mode 100644 doc/libc/unix/bsd/apple/type.c_long.html delete mode 100644 doc/libc/unix/bsd/apple/type.c_ulong.html delete mode 100644 doc/libc/unix/bsd/apple/type.clock_t.html delete mode 100644 doc/libc/unix/bsd/apple/type.dev_t.html delete mode 100644 doc/libc/unix/bsd/apple/type.fsblkcnt_t.html delete mode 100644 doc/libc/unix/bsd/apple/type.fsfilcnt_t.html delete mode 100644 doc/libc/unix/bsd/apple/type.ino_t.html delete mode 100644 doc/libc/unix/bsd/apple/type.mach_timebase_info_data_t.html delete mode 100644 doc/libc/unix/bsd/apple/type.mode_t.html delete mode 100644 doc/libc/unix/bsd/apple/type.nl_item.html delete mode 100644 doc/libc/unix/bsd/apple/type.nlink_t.html delete mode 100644 doc/libc/unix/bsd/apple/type.pthread_key_t.html delete mode 100644 doc/libc/unix/bsd/apple/type.rlim_t.html delete mode 100644 doc/libc/unix/bsd/apple/type.sigset_t.html delete mode 100644 doc/libc/unix/bsd/apple/type.speed_t.html delete mode 100644 doc/libc/unix/bsd/apple/type.suseconds_t.html delete mode 100644 doc/libc/unix/bsd/apple/type.tcflag_t.html delete mode 100644 doc/libc/unix/bsd/apple/type.time_t.html delete mode 100644 doc/libc/unix/bsd/b64/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/unix/bsd/b64/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/unix/bsd/b64/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/unix/bsd/b64/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/unix/bsd/b64/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/unix/bsd/b64/index.html delete mode 100644 doc/libc/unix/bsd/b64/sidebar-items.js delete mode 100644 doc/libc/unix/bsd/b64/struct.pthread_attr_t.html delete mode 100644 doc/libc/unix/bsd/b64/type.c_long.html delete mode 100644 doc/libc/unix/bsd/b64/type.c_ulong.html delete mode 100644 doc/libc/unix/bsd/constant.ABDAY_1.html delete mode 100644 doc/libc/unix/bsd/constant.ABDAY_2.html delete mode 100644 doc/libc/unix/bsd/constant.ABDAY_3.html delete mode 100644 doc/libc/unix/bsd/constant.ABDAY_4.html delete mode 100644 doc/libc/unix/bsd/constant.ABDAY_5.html delete mode 100644 doc/libc/unix/bsd/constant.ABDAY_6.html delete mode 100644 doc/libc/unix/bsd/constant.ABDAY_7.html delete mode 100644 doc/libc/unix/bsd/constant.ABMON_1.html delete mode 100644 doc/libc/unix/bsd/constant.ABMON_10.html delete mode 100644 doc/libc/unix/bsd/constant.ABMON_11.html delete mode 100644 doc/libc/unix/bsd/constant.ABMON_12.html delete mode 100644 doc/libc/unix/bsd/constant.ABMON_2.html delete mode 100644 doc/libc/unix/bsd/constant.ABMON_3.html delete mode 100644 doc/libc/unix/bsd/constant.ABMON_4.html delete mode 100644 doc/libc/unix/bsd/constant.ABMON_5.html delete mode 100644 doc/libc/unix/bsd/constant.ABMON_6.html delete mode 100644 doc/libc/unix/bsd/constant.ABMON_7.html delete mode 100644 doc/libc/unix/bsd/constant.ABMON_8.html delete mode 100644 doc/libc/unix/bsd/constant.ABMON_9.html delete mode 100644 doc/libc/unix/bsd/constant.AF_INET.html delete mode 100644 doc/libc/unix/bsd/constant.AF_INET6.html delete mode 100644 doc/libc/unix/bsd/constant.AF_UNIX.html delete mode 100644 doc/libc/unix/bsd/constant.ALT_DIGITS.html delete mode 100644 doc/libc/unix/bsd/constant.AM_STR.html delete mode 100644 doc/libc/unix/bsd/constant.BRKINT.html delete mode 100644 doc/libc/unix/bsd/constant.BS0.html delete mode 100644 doc/libc/unix/bsd/constant.BS1.html delete mode 100644 doc/libc/unix/bsd/constant.BUFSIZ.html delete mode 100644 doc/libc/unix/bsd/constant.CLOCAL.html delete mode 100644 doc/libc/unix/bsd/constant.CODESET.html delete mode 100644 doc/libc/unix/bsd/constant.CR0.html delete mode 100644 doc/libc/unix/bsd/constant.CR1.html delete mode 100644 doc/libc/unix/bsd/constant.CR2.html delete mode 100644 doc/libc/unix/bsd/constant.CR3.html delete mode 100644 doc/libc/unix/bsd/constant.CREAD.html delete mode 100644 doc/libc/unix/bsd/constant.CRNCYSTR.html delete mode 100644 doc/libc/unix/bsd/constant.CRTSCTS.html delete mode 100644 doc/libc/unix/bsd/constant.CS5.html delete mode 100644 doc/libc/unix/bsd/constant.CS6.html delete mode 100644 doc/libc/unix/bsd/constant.CS7.html delete mode 100644 doc/libc/unix/bsd/constant.CS8.html delete mode 100644 doc/libc/unix/bsd/constant.CSIZE.html delete mode 100644 doc/libc/unix/bsd/constant.CSTOPB.html delete mode 100644 doc/libc/unix/bsd/constant.CTL_HW.html delete mode 100644 doc/libc/unix/bsd/constant.DAY_1.html delete mode 100644 doc/libc/unix/bsd/constant.DAY_2.html delete mode 100644 doc/libc/unix/bsd/constant.DAY_3.html delete mode 100644 doc/libc/unix/bsd/constant.DAY_4.html delete mode 100644 doc/libc/unix/bsd/constant.DAY_5.html delete mode 100644 doc/libc/unix/bsd/constant.DAY_6.html delete mode 100644 doc/libc/unix/bsd/constant.DAY_7.html delete mode 100644 doc/libc/unix/bsd/constant.D_FMT.html delete mode 100644 doc/libc/unix/bsd/constant.D_MD_ORDER.html delete mode 100644 doc/libc/unix/bsd/constant.D_T_FMT.html delete mode 100644 doc/libc/unix/bsd/constant.E2BIG.html delete mode 100644 doc/libc/unix/bsd/constant.EACCES.html delete mode 100644 doc/libc/unix/bsd/constant.EADDRINUSE.html delete mode 100644 doc/libc/unix/bsd/constant.EADDRNOTAVAIL.html delete mode 100644 doc/libc/unix/bsd/constant.EAFNOSUPPORT.html delete mode 100644 doc/libc/unix/bsd/constant.EAGAIN.html delete mode 100644 doc/libc/unix/bsd/constant.EALREADY.html delete mode 100644 doc/libc/unix/bsd/constant.EAUTH.html delete mode 100644 doc/libc/unix/bsd/constant.EBADARCH.html delete mode 100644 doc/libc/unix/bsd/constant.EBADEXEC.html delete mode 100644 doc/libc/unix/bsd/constant.EBADF.html delete mode 100644 doc/libc/unix/bsd/constant.EBADMACHO.html delete mode 100644 doc/libc/unix/bsd/constant.EBADMSG.html delete mode 100644 doc/libc/unix/bsd/constant.EBADRPC.html delete mode 100644 doc/libc/unix/bsd/constant.EBUSY.html delete mode 100644 doc/libc/unix/bsd/constant.ECANCELED.html delete mode 100644 doc/libc/unix/bsd/constant.ECHILD.html delete mode 100644 doc/libc/unix/bsd/constant.ECHO.html delete mode 100644 doc/libc/unix/bsd/constant.ECHOCTL.html delete mode 100644 doc/libc/unix/bsd/constant.ECHOE.html delete mode 100644 doc/libc/unix/bsd/constant.ECHOK.html delete mode 100644 doc/libc/unix/bsd/constant.ECHOKE.html delete mode 100644 doc/libc/unix/bsd/constant.ECHONL.html delete mode 100644 doc/libc/unix/bsd/constant.ECHOPRT.html delete mode 100644 doc/libc/unix/bsd/constant.ECONNABORTED.html delete mode 100644 doc/libc/unix/bsd/constant.ECONNREFUSED.html delete mode 100644 doc/libc/unix/bsd/constant.ECONNRESET.html delete mode 100644 doc/libc/unix/bsd/constant.EDEADLK.html delete mode 100644 doc/libc/unix/bsd/constant.EDESTADDRREQ.html delete mode 100644 doc/libc/unix/bsd/constant.EDEVERR.html delete mode 100644 doc/libc/unix/bsd/constant.EDOM.html delete mode 100644 doc/libc/unix/bsd/constant.EDQUOT.html delete mode 100644 doc/libc/unix/bsd/constant.EEXIST.html delete mode 100644 doc/libc/unix/bsd/constant.EFAULT.html delete mode 100644 doc/libc/unix/bsd/constant.EFBIG.html delete mode 100644 doc/libc/unix/bsd/constant.EFTYPE.html delete mode 100644 doc/libc/unix/bsd/constant.EHOSTDOWN.html delete mode 100644 doc/libc/unix/bsd/constant.EHOSTUNREACH.html delete mode 100644 doc/libc/unix/bsd/constant.EIDRM.html delete mode 100644 doc/libc/unix/bsd/constant.EILSEQ.html delete mode 100644 doc/libc/unix/bsd/constant.EINPROGRESS.html delete mode 100644 doc/libc/unix/bsd/constant.EINTR.html delete mode 100644 doc/libc/unix/bsd/constant.EINVAL.html delete mode 100644 doc/libc/unix/bsd/constant.EIO.html delete mode 100644 doc/libc/unix/bsd/constant.EISCONN.html delete mode 100644 doc/libc/unix/bsd/constant.EISDIR.html delete mode 100644 doc/libc/unix/bsd/constant.ELAST.html delete mode 100644 doc/libc/unix/bsd/constant.ELOOP.html delete mode 100644 doc/libc/unix/bsd/constant.EMFILE.html delete mode 100644 doc/libc/unix/bsd/constant.EMLINK.html delete mode 100644 doc/libc/unix/bsd/constant.EMSGSIZE.html delete mode 100644 doc/libc/unix/bsd/constant.EMULTIHOP.html delete mode 100644 doc/libc/unix/bsd/constant.ENAMETOOLONG.html delete mode 100644 doc/libc/unix/bsd/constant.ENEEDAUTH.html delete mode 100644 doc/libc/unix/bsd/constant.ENETDOWN.html delete mode 100644 doc/libc/unix/bsd/constant.ENETRESET.html delete mode 100644 doc/libc/unix/bsd/constant.ENETUNREACH.html delete mode 100644 doc/libc/unix/bsd/constant.ENFILE.html delete mode 100644 doc/libc/unix/bsd/constant.ENOATTR.html delete mode 100644 doc/libc/unix/bsd/constant.ENOBUFS.html delete mode 100644 doc/libc/unix/bsd/constant.ENODATA.html delete mode 100644 doc/libc/unix/bsd/constant.ENODEV.html delete mode 100644 doc/libc/unix/bsd/constant.ENOENT.html delete mode 100644 doc/libc/unix/bsd/constant.ENOEXEC.html delete mode 100644 doc/libc/unix/bsd/constant.ENOLCK.html delete mode 100644 doc/libc/unix/bsd/constant.ENOLINK.html delete mode 100644 doc/libc/unix/bsd/constant.ENOMEM.html delete mode 100644 doc/libc/unix/bsd/constant.ENOMSG.html delete mode 100644 doc/libc/unix/bsd/constant.ENOPOLICY.html delete mode 100644 doc/libc/unix/bsd/constant.ENOPROTOOPT.html delete mode 100644 doc/libc/unix/bsd/constant.ENOSPC.html delete mode 100644 doc/libc/unix/bsd/constant.ENOSR.html delete mode 100644 doc/libc/unix/bsd/constant.ENOSTR.html delete mode 100644 doc/libc/unix/bsd/constant.ENOSYS.html delete mode 100644 doc/libc/unix/bsd/constant.ENOTBLK.html delete mode 100644 doc/libc/unix/bsd/constant.ENOTCONN.html delete mode 100644 doc/libc/unix/bsd/constant.ENOTDIR.html delete mode 100644 doc/libc/unix/bsd/constant.ENOTEMPTY.html delete mode 100644 doc/libc/unix/bsd/constant.ENOTRECOVERABLE.html delete mode 100644 doc/libc/unix/bsd/constant.ENOTSOCK.html delete mode 100644 doc/libc/unix/bsd/constant.ENOTSUP.html delete mode 100644 doc/libc/unix/bsd/constant.ENOTTY.html delete mode 100644 doc/libc/unix/bsd/constant.ENXIO.html delete mode 100644 doc/libc/unix/bsd/constant.EOF.html delete mode 100644 doc/libc/unix/bsd/constant.EOPNOTSUPP.html delete mode 100644 doc/libc/unix/bsd/constant.EOVERFLOW.html delete mode 100644 doc/libc/unix/bsd/constant.EOWNERDEAD.html delete mode 100644 doc/libc/unix/bsd/constant.EPERM.html delete mode 100644 doc/libc/unix/bsd/constant.EPFNOSUPPORT.html delete mode 100644 doc/libc/unix/bsd/constant.EPIPE.html delete mode 100644 doc/libc/unix/bsd/constant.EPROCLIM.html delete mode 100644 doc/libc/unix/bsd/constant.EPROCUNAVAIL.html delete mode 100644 doc/libc/unix/bsd/constant.EPROGMISMATCH.html delete mode 100644 doc/libc/unix/bsd/constant.EPROGUNAVAIL.html delete mode 100644 doc/libc/unix/bsd/constant.EPROTO.html delete mode 100644 doc/libc/unix/bsd/constant.EPROTONOSUPPORT.html delete mode 100644 doc/libc/unix/bsd/constant.EPROTOTYPE.html delete mode 100644 doc/libc/unix/bsd/constant.EPWROFF.html delete mode 100644 doc/libc/unix/bsd/constant.EQFULL.html delete mode 100644 doc/libc/unix/bsd/constant.ERA.html delete mode 100644 doc/libc/unix/bsd/constant.ERANGE.html delete mode 100644 doc/libc/unix/bsd/constant.ERA_D_FMT.html delete mode 100644 doc/libc/unix/bsd/constant.ERA_D_T_FMT.html delete mode 100644 doc/libc/unix/bsd/constant.ERA_T_FMT.html delete mode 100644 doc/libc/unix/bsd/constant.EREMOTE.html delete mode 100644 doc/libc/unix/bsd/constant.EROFS.html delete mode 100644 doc/libc/unix/bsd/constant.ERPCMISMATCH.html delete mode 100644 doc/libc/unix/bsd/constant.ESHLIBVERS.html delete mode 100644 doc/libc/unix/bsd/constant.ESHUTDOWN.html delete mode 100644 doc/libc/unix/bsd/constant.ESOCKTNOSUPPORT.html delete mode 100644 doc/libc/unix/bsd/constant.ESPIPE.html delete mode 100644 doc/libc/unix/bsd/constant.ESRCH.html delete mode 100644 doc/libc/unix/bsd/constant.ESTALE.html delete mode 100644 doc/libc/unix/bsd/constant.ETIME.html delete mode 100644 doc/libc/unix/bsd/constant.ETIMEDOUT.html delete mode 100644 doc/libc/unix/bsd/constant.ETOOMANYREFS.html delete mode 100644 doc/libc/unix/bsd/constant.ETXTBSY.html delete mode 100644 doc/libc/unix/bsd/constant.EUSERS.html delete mode 100644 doc/libc/unix/bsd/constant.EVFILT_AIO.html delete mode 100644 doc/libc/unix/bsd/constant.EVFILT_FS.html delete mode 100644 doc/libc/unix/bsd/constant.EVFILT_MACHPORT.html delete mode 100644 doc/libc/unix/bsd/constant.EVFILT_PROC.html delete mode 100644 doc/libc/unix/bsd/constant.EVFILT_READ.html delete mode 100644 doc/libc/unix/bsd/constant.EVFILT_SIGNAL.html delete mode 100644 doc/libc/unix/bsd/constant.EVFILT_SYSCOUNT.html delete mode 100644 doc/libc/unix/bsd/constant.EVFILT_TIMER.html delete mode 100644 doc/libc/unix/bsd/constant.EVFILT_USER.html delete mode 100644 doc/libc/unix/bsd/constant.EVFILT_VM.html delete mode 100644 doc/libc/unix/bsd/constant.EVFILT_VNODE.html delete mode 100644 doc/libc/unix/bsd/constant.EVFILT_WRITE.html delete mode 100644 doc/libc/unix/bsd/constant.EV_ADD.html delete mode 100644 doc/libc/unix/bsd/constant.EV_CLEAR.html delete mode 100644 doc/libc/unix/bsd/constant.EV_DELETE.html delete mode 100644 doc/libc/unix/bsd/constant.EV_DISABLE.html delete mode 100644 doc/libc/unix/bsd/constant.EV_DISPATCH.html delete mode 100644 doc/libc/unix/bsd/constant.EV_ENABLE.html delete mode 100644 doc/libc/unix/bsd/constant.EV_EOF.html delete mode 100644 doc/libc/unix/bsd/constant.EV_ERROR.html delete mode 100644 doc/libc/unix/bsd/constant.EV_FLAG0.html delete mode 100644 doc/libc/unix/bsd/constant.EV_FLAG1.html delete mode 100644 doc/libc/unix/bsd/constant.EV_ONESHOT.html delete mode 100644 doc/libc/unix/bsd/constant.EV_OOBAND.html delete mode 100644 doc/libc/unix/bsd/constant.EV_POLL.html delete mode 100644 doc/libc/unix/bsd/constant.EV_RECEIPT.html delete mode 100644 doc/libc/unix/bsd/constant.EV_SYSFLAGS.html delete mode 100644 doc/libc/unix/bsd/constant.EWOULDBLOCK.html delete mode 100644 doc/libc/unix/bsd/constant.EXDEV.html delete mode 100644 doc/libc/unix/bsd/constant.EXIT_FAILURE.html delete mode 100644 doc/libc/unix/bsd/constant.EXIT_SUCCESS.html delete mode 100644 doc/libc/unix/bsd/constant.EXTPROC.html delete mode 100644 doc/libc/unix/bsd/constant.FD_SETSIZE.html delete mode 100644 doc/libc/unix/bsd/constant.FF0.html delete mode 100644 doc/libc/unix/bsd/constant.FF1.html delete mode 100644 doc/libc/unix/bsd/constant.FILENAME_MAX.html delete mode 100644 doc/libc/unix/bsd/constant.FIOCLEX.html delete mode 100644 doc/libc/unix/bsd/constant.FIONBIO.html delete mode 100644 doc/libc/unix/bsd/constant.FLUSHO.html delete mode 100644 doc/libc/unix/bsd/constant.FOPEN_MAX.html delete mode 100644 doc/libc/unix/bsd/constant.F_ALLOCATEALL.html delete mode 100644 doc/libc/unix/bsd/constant.F_ALLOCATECONTIG.html delete mode 100644 doc/libc/unix/bsd/constant.F_DUPFD.html delete mode 100644 doc/libc/unix/bsd/constant.F_DUPFD_CLOEXEC.html delete mode 100644 doc/libc/unix/bsd/constant.F_FREEZE_FS.html delete mode 100644 doc/libc/unix/bsd/constant.F_FULLFSYNC.html delete mode 100644 doc/libc/unix/bsd/constant.F_GETFD.html delete mode 100644 doc/libc/unix/bsd/constant.F_GETFL.html delete mode 100644 doc/libc/unix/bsd/constant.F_GETLK.html delete mode 100644 doc/libc/unix/bsd/constant.F_GETOWN.html delete mode 100644 doc/libc/unix/bsd/constant.F_GETPATH.html delete mode 100644 doc/libc/unix/bsd/constant.F_GLOBAL_NOCACHE.html delete mode 100644 doc/libc/unix/bsd/constant.F_LOCK.html delete mode 100644 doc/libc/unix/bsd/constant.F_NOCACHE.html delete mode 100644 doc/libc/unix/bsd/constant.F_NODIRECT.html delete mode 100644 doc/libc/unix/bsd/constant.F_OK.html delete mode 100644 doc/libc/unix/bsd/constant.F_PEOFPOSMODE.html delete mode 100644 doc/libc/unix/bsd/constant.F_PREALLOCATE.html delete mode 100644 doc/libc/unix/bsd/constant.F_RDADVISE.html delete mode 100644 doc/libc/unix/bsd/constant.F_RDAHEAD.html delete mode 100644 doc/libc/unix/bsd/constant.F_SETFD.html delete mode 100644 doc/libc/unix/bsd/constant.F_SETFL.html delete mode 100644 doc/libc/unix/bsd/constant.F_SETLK.html delete mode 100644 doc/libc/unix/bsd/constant.F_SETLKW.html delete mode 100644 doc/libc/unix/bsd/constant.F_SETOWN.html delete mode 100644 doc/libc/unix/bsd/constant.F_TEST.html delete mode 100644 doc/libc/unix/bsd/constant.F_THAW_FS.html delete mode 100644 doc/libc/unix/bsd/constant.F_TLOCK.html delete mode 100644 doc/libc/unix/bsd/constant.F_ULOCK.html delete mode 100644 doc/libc/unix/bsd/constant.F_VOLPOSMODE.html delete mode 100644 doc/libc/unix/bsd/constant.GLOB_ABORTED.html delete mode 100644 doc/libc/unix/bsd/constant.GLOB_APPEND.html delete mode 100644 doc/libc/unix/bsd/constant.GLOB_DOOFFS.html delete mode 100644 doc/libc/unix/bsd/constant.GLOB_ERR.html delete mode 100644 doc/libc/unix/bsd/constant.GLOB_MARK.html delete mode 100644 doc/libc/unix/bsd/constant.GLOB_NOCHECK.html delete mode 100644 doc/libc/unix/bsd/constant.GLOB_NOESCAPE.html delete mode 100644 doc/libc/unix/bsd/constant.GLOB_NOMATCH.html delete mode 100644 doc/libc/unix/bsd/constant.GLOB_NOSORT.html delete mode 100644 doc/libc/unix/bsd/constant.GLOB_NOSPACE.html delete mode 100644 doc/libc/unix/bsd/constant.HUPCL.html delete mode 100644 doc/libc/unix/bsd/constant.HW_AVAILCPU.html delete mode 100644 doc/libc/unix/bsd/constant.HW_NCPU.html delete mode 100644 doc/libc/unix/bsd/constant.ICANON.html delete mode 100644 doc/libc/unix/bsd/constant.ICRNL.html delete mode 100644 doc/libc/unix/bsd/constant.IEXTEN.html delete mode 100644 doc/libc/unix/bsd/constant.IFF_LOOPBACK.html delete mode 100644 doc/libc/unix/bsd/constant.IGNBRK.html delete mode 100644 doc/libc/unix/bsd/constant.IGNCR.html delete mode 100644 doc/libc/unix/bsd/constant.IGNPAR.html delete mode 100644 doc/libc/unix/bsd/constant.IMAXBEL.html delete mode 100644 doc/libc/unix/bsd/constant.INLCR.html delete mode 100644 doc/libc/unix/bsd/constant.INPCK.html delete mode 100644 doc/libc/unix/bsd/constant.IPPROTO_IP.html delete mode 100644 doc/libc/unix/bsd/constant.IPPROTO_IPV6.html delete mode 100644 doc/libc/unix/bsd/constant.IPPROTO_RAW.html delete mode 100644 doc/libc/unix/bsd/constant.IPPROTO_TCP.html delete mode 100644 doc/libc/unix/bsd/constant.IPV6_JOIN_GROUP.html delete mode 100644 doc/libc/unix/bsd/constant.IPV6_LEAVE_GROUP.html delete mode 100644 doc/libc/unix/bsd/constant.IPV6_MULTICAST_LOOP.html delete mode 100644 doc/libc/unix/bsd/constant.IPV6_V6ONLY.html delete mode 100644 doc/libc/unix/bsd/constant.IP_ADD_MEMBERSHIP.html delete mode 100644 doc/libc/unix/bsd/constant.IP_DROP_MEMBERSHIP.html delete mode 100644 doc/libc/unix/bsd/constant.IP_HDRINCL.html delete mode 100644 doc/libc/unix/bsd/constant.IP_MULTICAST_LOOP.html delete mode 100644 doc/libc/unix/bsd/constant.IP_MULTICAST_TTL.html delete mode 100644 doc/libc/unix/bsd/constant.IP_TTL.html delete mode 100644 doc/libc/unix/bsd/constant.ISIG.html delete mode 100644 doc/libc/unix/bsd/constant.ISTRIP.html delete mode 100644 doc/libc/unix/bsd/constant.IUTF8.html delete mode 100644 doc/libc/unix/bsd/constant.IXANY.html delete mode 100644 doc/libc/unix/bsd/constant.IXOFF.html delete mode 100644 doc/libc/unix/bsd/constant.IXON.html delete mode 100644 doc/libc/unix/bsd/constant.LC_ALL.html delete mode 100644 doc/libc/unix/bsd/constant.LC_ALL_MASK.html delete mode 100644 doc/libc/unix/bsd/constant.LC_COLLATE.html delete mode 100644 doc/libc/unix/bsd/constant.LC_COLLATE_MASK.html delete mode 100644 doc/libc/unix/bsd/constant.LC_CTYPE.html delete mode 100644 doc/libc/unix/bsd/constant.LC_CTYPE_MASK.html delete mode 100644 doc/libc/unix/bsd/constant.LC_MESSAGES.html delete mode 100644 doc/libc/unix/bsd/constant.LC_MESSAGES_MASK.html delete mode 100644 doc/libc/unix/bsd/constant.LC_MONETARY.html delete mode 100644 doc/libc/unix/bsd/constant.LC_MONETARY_MASK.html delete mode 100644 doc/libc/unix/bsd/constant.LC_NUMERIC.html delete mode 100644 doc/libc/unix/bsd/constant.LC_NUMERIC_MASK.html delete mode 100644 doc/libc/unix/bsd/constant.LC_TIME.html delete mode 100644 doc/libc/unix/bsd/constant.LC_TIME_MASK.html delete mode 100644 doc/libc/unix/bsd/constant.LOCK_EX.html delete mode 100644 doc/libc/unix/bsd/constant.LOCK_NB.html delete mode 100644 doc/libc/unix/bsd/constant.LOCK_SH.html delete mode 100644 doc/libc/unix/bsd/constant.LOCK_UN.html delete mode 100644 doc/libc/unix/bsd/constant.L_tmpnam.html delete mode 100644 doc/libc/unix/bsd/constant.MADV_CAN_REUSE.html delete mode 100644 doc/libc/unix/bsd/constant.MADV_DONTNEED.html delete mode 100644 doc/libc/unix/bsd/constant.MADV_FREE.html delete mode 100644 doc/libc/unix/bsd/constant.MADV_FREE_REUSABLE.html delete mode 100644 doc/libc/unix/bsd/constant.MADV_FREE_REUSE.html delete mode 100644 doc/libc/unix/bsd/constant.MADV_NORMAL.html delete mode 100644 doc/libc/unix/bsd/constant.MADV_RANDOM.html delete mode 100644 doc/libc/unix/bsd/constant.MADV_SEQUENTIAL.html delete mode 100644 doc/libc/unix/bsd/constant.MADV_WILLNEED.html delete mode 100644 doc/libc/unix/bsd/constant.MADV_ZERO_WIRED_PAGES.html delete mode 100644 doc/libc/unix/bsd/constant.MAP_ANON.html delete mode 100644 doc/libc/unix/bsd/constant.MAP_COPY.html delete mode 100644 doc/libc/unix/bsd/constant.MAP_FAILED.html delete mode 100644 doc/libc/unix/bsd/constant.MAP_FILE.html delete mode 100644 doc/libc/unix/bsd/constant.MAP_FIXED.html delete mode 100644 doc/libc/unix/bsd/constant.MAP_HASSEMAPHORE.html delete mode 100644 doc/libc/unix/bsd/constant.MAP_JIT.html delete mode 100644 doc/libc/unix/bsd/constant.MAP_NOCACHE.html delete mode 100644 doc/libc/unix/bsd/constant.MAP_NOEXTEND.html delete mode 100644 doc/libc/unix/bsd/constant.MAP_NORESERVE.html delete mode 100644 doc/libc/unix/bsd/constant.MAP_PRIVATE.html delete mode 100644 doc/libc/unix/bsd/constant.MAP_RENAME.html delete mode 100644 doc/libc/unix/bsd/constant.MAP_SHARED.html delete mode 100644 doc/libc/unix/bsd/constant.MCL_CURRENT.html delete mode 100644 doc/libc/unix/bsd/constant.MCL_FUTURE.html delete mode 100644 doc/libc/unix/bsd/constant.MINCORE_INCORE.html delete mode 100644 doc/libc/unix/bsd/constant.MINCORE_MODIFIED.html delete mode 100644 doc/libc/unix/bsd/constant.MINCORE_MODIFIED_OTHER.html delete mode 100644 doc/libc/unix/bsd/constant.MINCORE_REFERENCED.html delete mode 100644 doc/libc/unix/bsd/constant.MINCORE_REFERENCED_OTHER.html delete mode 100644 doc/libc/unix/bsd/constant.MNT_FORCE.html delete mode 100644 doc/libc/unix/bsd/constant.MON_1.html delete mode 100644 doc/libc/unix/bsd/constant.MON_10.html delete mode 100644 doc/libc/unix/bsd/constant.MON_11.html delete mode 100644 doc/libc/unix/bsd/constant.MON_12.html delete mode 100644 doc/libc/unix/bsd/constant.MON_2.html delete mode 100644 doc/libc/unix/bsd/constant.MON_3.html delete mode 100644 doc/libc/unix/bsd/constant.MON_4.html delete mode 100644 doc/libc/unix/bsd/constant.MON_5.html delete mode 100644 doc/libc/unix/bsd/constant.MON_6.html delete mode 100644 doc/libc/unix/bsd/constant.MON_7.html delete mode 100644 doc/libc/unix/bsd/constant.MON_8.html delete mode 100644 doc/libc/unix/bsd/constant.MON_9.html delete mode 100644 doc/libc/unix/bsd/constant.MS_ASYNC.html delete mode 100644 doc/libc/unix/bsd/constant.MS_DEACTIVATE.html delete mode 100644 doc/libc/unix/bsd/constant.MS_INVALIDATE.html delete mode 100644 doc/libc/unix/bsd/constant.MS_KILLPAGES.html delete mode 100644 doc/libc/unix/bsd/constant.MS_SYNC.html delete mode 100644 doc/libc/unix/bsd/constant.NCCS.html delete mode 100644 doc/libc/unix/bsd/constant.NI_MAXHOST.html delete mode 100644 doc/libc/unix/bsd/constant.NL0.html delete mode 100644 doc/libc/unix/bsd/constant.NL1.html delete mode 100644 doc/libc/unix/bsd/constant.NOEXPR.html delete mode 100644 doc/libc/unix/bsd/constant.NOFLSH.html delete mode 100644 doc/libc/unix/bsd/constant.NOSTR.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_ABSOLUTE.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_ATTRIB.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_CHILD.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_DELETE.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_EXEC.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_EXIT.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_EXITSTATUS.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_EXIT_REPARENTED.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_EXTEND.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_FFAND.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_FFCOPY.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_FFCTRLMASK.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_FFLAGSMASK.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_FFNOP.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_FFOR.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_FORK.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_LINK.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_LOWAT.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_NONE.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_NSECONDS.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_PCTRLMASK.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_PDATAMASK.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_REAP.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_RENAME.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_REVOKE.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_SECONDS.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_SIGNAL.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_TRACK.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_TRACKERR.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_TRIGGER.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_USECONDS.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_VM_ERROR.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_VM_PRESSURE.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_VM_PRESSURE_TERMINATE.html delete mode 100644 doc/libc/unix/bsd/constant.NOTE_WRITE.html delete mode 100644 doc/libc/unix/bsd/constant.ONLCR.html delete mode 100644 doc/libc/unix/bsd/constant.OPOST.html delete mode 100644 doc/libc/unix/bsd/constant.O_ACCMODE.html delete mode 100644 doc/libc/unix/bsd/constant.O_APPEND.html delete mode 100644 doc/libc/unix/bsd/constant.O_ASYNC.html delete mode 100644 doc/libc/unix/bsd/constant.O_CLOEXEC.html delete mode 100644 doc/libc/unix/bsd/constant.O_CREAT.html delete mode 100644 doc/libc/unix/bsd/constant.O_DIRECTORY.html delete mode 100644 doc/libc/unix/bsd/constant.O_DSYNC.html delete mode 100644 doc/libc/unix/bsd/constant.O_EXCL.html delete mode 100644 doc/libc/unix/bsd/constant.O_FSYNC.html delete mode 100644 doc/libc/unix/bsd/constant.O_NDELAY.html delete mode 100644 doc/libc/unix/bsd/constant.O_NOCTTY.html delete mode 100644 doc/libc/unix/bsd/constant.O_NOFOLLOW.html delete mode 100644 doc/libc/unix/bsd/constant.O_NONBLOCK.html delete mode 100644 doc/libc/unix/bsd/constant.O_RDONLY.html delete mode 100644 doc/libc/unix/bsd/constant.O_RDWR.html delete mode 100644 doc/libc/unix/bsd/constant.O_SYNC.html delete mode 100644 doc/libc/unix/bsd/constant.O_TRUNC.html delete mode 100644 doc/libc/unix/bsd/constant.O_WRONLY.html delete mode 100644 doc/libc/unix/bsd/constant.PARENB.html delete mode 100644 doc/libc/unix/bsd/constant.PARMRK.html delete mode 100644 doc/libc/unix/bsd/constant.PARODD.html delete mode 100644 doc/libc/unix/bsd/constant.PATH_MAX.html delete mode 100644 doc/libc/unix/bsd/constant.PENDIN.html delete mode 100644 doc/libc/unix/bsd/constant.PM_STR.html delete mode 100644 doc/libc/unix/bsd/constant.POSIX_MADV_DONTNEED.html delete mode 100644 doc/libc/unix/bsd/constant.POSIX_MADV_NORMAL.html delete mode 100644 doc/libc/unix/bsd/constant.POSIX_MADV_RANDOM.html delete mode 100644 doc/libc/unix/bsd/constant.POSIX_MADV_SEQUENTIAL.html delete mode 100644 doc/libc/unix/bsd/constant.POSIX_MADV_WILLNEED.html delete mode 100644 doc/libc/unix/bsd/constant.PROT_EXEC.html delete mode 100644 doc/libc/unix/bsd/constant.PROT_NONE.html delete mode 100644 doc/libc/unix/bsd/constant.PROT_READ.html delete mode 100644 doc/libc/unix/bsd/constant.PROT_WRITE.html delete mode 100644 doc/libc/unix/bsd/constant.PTHREAD_COND_INITIALIZER.html delete mode 100644 doc/libc/unix/bsd/constant.PTHREAD_CREATE_DETACHED.html delete mode 100644 doc/libc/unix/bsd/constant.PTHREAD_CREATE_JOINABLE.html delete mode 100644 doc/libc/unix/bsd/constant.PTHREAD_MUTEX_INITIALIZER.html delete mode 100644 doc/libc/unix/bsd/constant.PTHREAD_MUTEX_RECURSIVE.html delete mode 100644 doc/libc/unix/bsd/constant.PTHREAD_RWLOCK_INITIALIZER.html delete mode 100644 doc/libc/unix/bsd/constant.PTHREAD_STACK_MIN.html delete mode 100644 doc/libc/unix/bsd/constant.Q_GETQUOTA.html delete mode 100644 doc/libc/unix/bsd/constant.Q_QUOTAOFF.html delete mode 100644 doc/libc/unix/bsd/constant.Q_QUOTAON.html delete mode 100644 doc/libc/unix/bsd/constant.Q_SETQUOTA.html delete mode 100644 doc/libc/unix/bsd/constant.Q_SYNC.html delete mode 100644 doc/libc/unix/bsd/constant.RADIXCHAR.html delete mode 100644 doc/libc/unix/bsd/constant.RAND_MAX.html delete mode 100644 doc/libc/unix/bsd/constant.RLIMIT_AS.html delete mode 100644 doc/libc/unix/bsd/constant.RLIMIT_CORE.html delete mode 100644 doc/libc/unix/bsd/constant.RLIMIT_CPU.html delete mode 100644 doc/libc/unix/bsd/constant.RLIMIT_DATA.html delete mode 100644 doc/libc/unix/bsd/constant.RLIMIT_FSIZE.html delete mode 100644 doc/libc/unix/bsd/constant.RLIMIT_MEMLOCK.html delete mode 100644 doc/libc/unix/bsd/constant.RLIMIT_NOFILE.html delete mode 100644 doc/libc/unix/bsd/constant.RLIMIT_NPROC.html delete mode 100644 doc/libc/unix/bsd/constant.RLIMIT_RSS.html delete mode 100644 doc/libc/unix/bsd/constant.RLIMIT_STACK.html delete mode 100644 doc/libc/unix/bsd/constant.RLIM_INFINITY.html delete mode 100644 doc/libc/unix/bsd/constant.RLIM_NLIMITS.html delete mode 100644 doc/libc/unix/bsd/constant.RTLD_DEFAULT.html delete mode 100644 doc/libc/unix/bsd/constant.RTLD_FIRST.html delete mode 100644 doc/libc/unix/bsd/constant.RTLD_GLOBAL.html delete mode 100644 doc/libc/unix/bsd/constant.RTLD_LOCAL.html delete mode 100644 doc/libc/unix/bsd/constant.RTLD_NODELETE.html delete mode 100644 doc/libc/unix/bsd/constant.RTLD_NOLOAD.html delete mode 100644 doc/libc/unix/bsd/constant.RTLD_NOW.html delete mode 100644 doc/libc/unix/bsd/constant.RUSAGE_CHILDREN.html delete mode 100644 doc/libc/unix/bsd/constant.RUSAGE_SELF.html delete mode 100644 doc/libc/unix/bsd/constant.R_OK.html delete mode 100644 doc/libc/unix/bsd/constant.SA_NOCLDSTOP.html delete mode 100644 doc/libc/unix/bsd/constant.SA_NOCLDWAIT.html delete mode 100644 doc/libc/unix/bsd/constant.SA_NODEFER.html delete mode 100644 doc/libc/unix/bsd/constant.SA_ONSTACK.html delete mode 100644 doc/libc/unix/bsd/constant.SA_RESETHAND.html delete mode 100644 doc/libc/unix/bsd/constant.SA_RESTART.html delete mode 100644 doc/libc/unix/bsd/constant.SA_SIGINFO.html delete mode 100644 doc/libc/unix/bsd/constant.SEEK_CUR.html delete mode 100644 doc/libc/unix/bsd/constant.SEEK_END.html delete mode 100644 doc/libc/unix/bsd/constant.SEEK_SET.html delete mode 100644 doc/libc/unix/bsd/constant.SHUT_RD.html delete mode 100644 doc/libc/unix/bsd/constant.SHUT_RDWR.html delete mode 100644 doc/libc/unix/bsd/constant.SHUT_WR.html delete mode 100644 doc/libc/unix/bsd/constant.SIGABRT.html delete mode 100644 doc/libc/unix/bsd/constant.SIGALRM.html delete mode 100644 doc/libc/unix/bsd/constant.SIGBUS.html delete mode 100644 doc/libc/unix/bsd/constant.SIGCHLD.html delete mode 100644 doc/libc/unix/bsd/constant.SIGCONT.html delete mode 100644 doc/libc/unix/bsd/constant.SIGEMT.html delete mode 100644 doc/libc/unix/bsd/constant.SIGFPE.html delete mode 100644 doc/libc/unix/bsd/constant.SIGHUP.html delete mode 100644 doc/libc/unix/bsd/constant.SIGILL.html delete mode 100644 doc/libc/unix/bsd/constant.SIGINFO.html delete mode 100644 doc/libc/unix/bsd/constant.SIGINT.html delete mode 100644 doc/libc/unix/bsd/constant.SIGIO.html delete mode 100644 doc/libc/unix/bsd/constant.SIGKILL.html delete mode 100644 doc/libc/unix/bsd/constant.SIGPIPE.html delete mode 100644 doc/libc/unix/bsd/constant.SIGPROF.html delete mode 100644 doc/libc/unix/bsd/constant.SIGQUIT.html delete mode 100644 doc/libc/unix/bsd/constant.SIGSEGV.html delete mode 100644 doc/libc/unix/bsd/constant.SIGSTKSZ.html delete mode 100644 doc/libc/unix/bsd/constant.SIGSTOP.html delete mode 100644 doc/libc/unix/bsd/constant.SIGSYS.html delete mode 100644 doc/libc/unix/bsd/constant.SIGTERM.html delete mode 100644 doc/libc/unix/bsd/constant.SIGTRAP.html delete mode 100644 doc/libc/unix/bsd/constant.SIGTSTP.html delete mode 100644 doc/libc/unix/bsd/constant.SIGTTIN.html delete mode 100644 doc/libc/unix/bsd/constant.SIGTTOU.html delete mode 100644 doc/libc/unix/bsd/constant.SIGURG.html delete mode 100644 doc/libc/unix/bsd/constant.SIGUSR1.html delete mode 100644 doc/libc/unix/bsd/constant.SIGUSR2.html delete mode 100644 doc/libc/unix/bsd/constant.SIGVTALRM.html delete mode 100644 doc/libc/unix/bsd/constant.SIGWINCH.html delete mode 100644 doc/libc/unix/bsd/constant.SIGXCPU.html delete mode 100644 doc/libc/unix/bsd/constant.SIGXFSZ.html delete mode 100644 doc/libc/unix/bsd/constant.SIG_BLOCK.html delete mode 100644 doc/libc/unix/bsd/constant.SIG_SETMASK.html delete mode 100644 doc/libc/unix/bsd/constant.SIG_UNBLOCK.html delete mode 100644 doc/libc/unix/bsd/constant.SOCK_DGRAM.html delete mode 100644 doc/libc/unix/bsd/constant.SOCK_RAW.html delete mode 100644 doc/libc/unix/bsd/constant.SOCK_STREAM.html delete mode 100644 doc/libc/unix/bsd/constant.SOL_SOCKET.html delete mode 100644 doc/libc/unix/bsd/constant.SO_ACCEPTCONN.html delete mode 100644 doc/libc/unix/bsd/constant.SO_BROADCAST.html delete mode 100644 doc/libc/unix/bsd/constant.SO_DEBUG.html delete mode 100644 doc/libc/unix/bsd/constant.SO_DONTROUTE.html delete mode 100644 doc/libc/unix/bsd/constant.SO_DONTTRUNC.html delete mode 100644 doc/libc/unix/bsd/constant.SO_ERROR.html delete mode 100644 doc/libc/unix/bsd/constant.SO_KEEPALIVE.html delete mode 100644 doc/libc/unix/bsd/constant.SO_LINGER.html delete mode 100644 doc/libc/unix/bsd/constant.SO_NKE.html delete mode 100644 doc/libc/unix/bsd/constant.SO_NOADDRERR.html delete mode 100644 doc/libc/unix/bsd/constant.SO_NOSIGPIPE.html delete mode 100644 doc/libc/unix/bsd/constant.SO_NREAD.html delete mode 100644 doc/libc/unix/bsd/constant.SO_NWRITE.html delete mode 100644 doc/libc/unix/bsd/constant.SO_OOBINLINE.html delete mode 100644 doc/libc/unix/bsd/constant.SO_RCVBUF.html delete mode 100644 doc/libc/unix/bsd/constant.SO_RCVLOWAT.html delete mode 100644 doc/libc/unix/bsd/constant.SO_RCVTIMEO.html delete mode 100644 doc/libc/unix/bsd/constant.SO_REUSEADDR.html delete mode 100644 doc/libc/unix/bsd/constant.SO_REUSEPORT.html delete mode 100644 doc/libc/unix/bsd/constant.SO_SNDBUF.html delete mode 100644 doc/libc/unix/bsd/constant.SO_SNDLOWAT.html delete mode 100644 doc/libc/unix/bsd/constant.SO_SNDTIMEO.html delete mode 100644 doc/libc/unix/bsd/constant.SO_TYPE.html delete mode 100644 doc/libc/unix/bsd/constant.SO_USELOOPBACK.html delete mode 100644 doc/libc/unix/bsd/constant.SO_WANTMORE.html delete mode 100644 doc/libc/unix/bsd/constant.SO_WANTOOBFLAG.html delete mode 100644 doc/libc/unix/bsd/constant.SS_DISABLE.html delete mode 100644 doc/libc/unix/bsd/constant.SS_ONSTACK.html delete mode 100644 doc/libc/unix/bsd/constant.STDERR_FILENO.html delete mode 100644 doc/libc/unix/bsd/constant.STDIN_FILENO.html delete mode 100644 doc/libc/unix/bsd/constant.STDOUT_FILENO.html delete mode 100644 doc/libc/unix/bsd/constant.ST_NOSUID.html delete mode 100644 doc/libc/unix/bsd/constant.ST_RDONLY.html delete mode 100644 doc/libc/unix/bsd/constant.S_IEXEC.html delete mode 100644 doc/libc/unix/bsd/constant.S_IFBLK.html delete mode 100644 doc/libc/unix/bsd/constant.S_IFCHR.html delete mode 100644 doc/libc/unix/bsd/constant.S_IFDIR.html delete mode 100644 doc/libc/unix/bsd/constant.S_IFIFO.html delete mode 100644 doc/libc/unix/bsd/constant.S_IFLNK.html delete mode 100644 doc/libc/unix/bsd/constant.S_IFMT.html delete mode 100644 doc/libc/unix/bsd/constant.S_IFREG.html delete mode 100644 doc/libc/unix/bsd/constant.S_IFSOCK.html delete mode 100644 doc/libc/unix/bsd/constant.S_IREAD.html delete mode 100644 doc/libc/unix/bsd/constant.S_IRGRP.html delete mode 100644 doc/libc/unix/bsd/constant.S_IROTH.html delete mode 100644 doc/libc/unix/bsd/constant.S_IRUSR.html delete mode 100644 doc/libc/unix/bsd/constant.S_IRWXG.html delete mode 100644 doc/libc/unix/bsd/constant.S_IRWXO.html delete mode 100644 doc/libc/unix/bsd/constant.S_IRWXU.html delete mode 100644 doc/libc/unix/bsd/constant.S_IWGRP.html delete mode 100644 doc/libc/unix/bsd/constant.S_IWOTH.html delete mode 100644 doc/libc/unix/bsd/constant.S_IWRITE.html delete mode 100644 doc/libc/unix/bsd/constant.S_IWUSR.html delete mode 100644 doc/libc/unix/bsd/constant.S_IXGRP.html delete mode 100644 doc/libc/unix/bsd/constant.S_IXOTH.html delete mode 100644 doc/libc/unix/bsd/constant.S_IXUSR.html delete mode 100644 doc/libc/unix/bsd/constant.TAB0.html delete mode 100644 doc/libc/unix/bsd/constant.TAB1.html delete mode 100644 doc/libc/unix/bsd/constant.TAB2.html delete mode 100644 doc/libc/unix/bsd/constant.TAB3.html delete mode 100644 doc/libc/unix/bsd/constant.TCIFLUSH.html delete mode 100644 doc/libc/unix/bsd/constant.TCIOFF.html delete mode 100644 doc/libc/unix/bsd/constant.TCIOFLUSH.html delete mode 100644 doc/libc/unix/bsd/constant.TCION.html delete mode 100644 doc/libc/unix/bsd/constant.TCOFLUSH.html delete mode 100644 doc/libc/unix/bsd/constant.TCOOFF.html delete mode 100644 doc/libc/unix/bsd/constant.TCOON.html delete mode 100644 doc/libc/unix/bsd/constant.TCP_KEEPALIVE.html delete mode 100644 doc/libc/unix/bsd/constant.TCP_NODELAY.html delete mode 100644 doc/libc/unix/bsd/constant.TCSADRAIN.html delete mode 100644 doc/libc/unix/bsd/constant.TCSAFLUSH.html delete mode 100644 doc/libc/unix/bsd/constant.TCSANOW.html delete mode 100644 doc/libc/unix/bsd/constant.THOUSEP.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCCBRK.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCCDTR.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCCONS.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCDRAIN.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCDSIMICROCODE.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCEXCL.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCEXT.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCFLUSH.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCGDRAINWAIT.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCGETD.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCGPGRP.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCGWINSZ.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCIXOFF.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCIXON.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCMBIC.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCMBIS.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCMGDTRWAIT.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCMGET.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCMODG.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCMODS.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCMSDTRWAIT.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCMSET.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCM_CAR.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCM_CD.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCM_CTS.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCM_DSR.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCM_DTR.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCM_LE.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCM_RI.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCM_RNG.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCM_RTS.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCM_SR.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCM_ST.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCNOTTY.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCNXCL.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCOUTQ.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCPKT.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCPKT_DATA.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCPKT_DOSTOP.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCPKT_FLUSHREAD.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCPKT_FLUSHWRITE.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCPKT_IOCTL.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCPKT_NOSTOP.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCPKT_START.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCPKT_STOP.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCPTYGNAME.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCPTYGRANT.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCPTYUNLK.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCREMOTE.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCSBRK.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCSCONS.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCSCTTY.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCSDRAINWAIT.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCSDTR.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCSETD.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCSIG.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCSPGRP.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCSTART.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCSTAT.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCSTI.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCSTOP.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCSWINSZ.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/unix/bsd/constant.TIOCUCNTL.html delete mode 100644 doc/libc/unix/bsd/constant.TMP_MAX.html delete mode 100644 doc/libc/unix/bsd/constant.TOSTOP.html delete mode 100644 doc/libc/unix/bsd/constant.T_FMT.html delete mode 100644 doc/libc/unix/bsd/constant.T_FMT_AMPM.html delete mode 100644 doc/libc/unix/bsd/constant.VDISCARD.html delete mode 100644 doc/libc/unix/bsd/constant.VEOF.html delete mode 100644 doc/libc/unix/bsd/constant.VEOL.html delete mode 100644 doc/libc/unix/bsd/constant.VEOL2.html delete mode 100644 doc/libc/unix/bsd/constant.VERASE.html delete mode 100644 doc/libc/unix/bsd/constant.VINTR.html delete mode 100644 doc/libc/unix/bsd/constant.VKILL.html delete mode 100644 doc/libc/unix/bsd/constant.VLNEXT.html delete mode 100644 doc/libc/unix/bsd/constant.VMIN.html delete mode 100644 doc/libc/unix/bsd/constant.VQUIT.html delete mode 100644 doc/libc/unix/bsd/constant.VREPRINT.html delete mode 100644 doc/libc/unix/bsd/constant.VSTART.html delete mode 100644 doc/libc/unix/bsd/constant.VSTOP.html delete mode 100644 doc/libc/unix/bsd/constant.VSUSP.html delete mode 100644 doc/libc/unix/bsd/constant.VT0.html delete mode 100644 doc/libc/unix/bsd/constant.VT1.html delete mode 100644 doc/libc/unix/bsd/constant.VTIME.html delete mode 100644 doc/libc/unix/bsd/constant.VWERASE.html delete mode 100644 doc/libc/unix/bsd/constant.WNOHANG.html delete mode 100644 doc/libc/unix/bsd/constant.W_OK.html delete mode 100644 doc/libc/unix/bsd/constant.X_OK.html delete mode 100644 doc/libc/unix/bsd/constant.YESEXPR.html delete mode 100644 doc/libc/unix/bsd/constant.YESSTR.html delete mode 100644 doc/libc/unix/bsd/constant._IOFBF.html delete mode 100644 doc/libc/unix/bsd/constant._IOLBF.html delete mode 100644 doc/libc/unix/bsd/constant._IONBF.html delete mode 100644 doc/libc/unix/bsd/constant._PC_NAME_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._PTHREAD_COND_SIG_init.html delete mode 100644 doc/libc/unix/bsd/constant._PTHREAD_MUTEX_SIG_init.html delete mode 100644 doc/libc/unix/bsd/constant._PTHREAD_RWLOCK_SIG_init.html delete mode 100644 doc/libc/unix/bsd/constant._RLIMIT_POSIX_FLAG.html delete mode 100644 doc/libc/unix/bsd/constant._SC_2_CHAR_TERM.html delete mode 100644 doc/libc/unix/bsd/constant._SC_2_C_BIND.html delete mode 100644 doc/libc/unix/bsd/constant._SC_2_C_DEV.html delete mode 100644 doc/libc/unix/bsd/constant._SC_2_FORT_DEV.html delete mode 100644 doc/libc/unix/bsd/constant._SC_2_FORT_RUN.html delete mode 100644 doc/libc/unix/bsd/constant._SC_2_LOCALEDEF.html delete mode 100644 doc/libc/unix/bsd/constant._SC_2_PBS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_2_PBS_ACCOUNTING.html delete mode 100644 doc/libc/unix/bsd/constant._SC_2_PBS_CHECKPOINT.html delete mode 100644 doc/libc/unix/bsd/constant._SC_2_PBS_LOCATE.html delete mode 100644 doc/libc/unix/bsd/constant._SC_2_PBS_MESSAGE.html delete mode 100644 doc/libc/unix/bsd/constant._SC_2_PBS_TRACK.html delete mode 100644 doc/libc/unix/bsd/constant._SC_2_SW_DEV.html delete mode 100644 doc/libc/unix/bsd/constant._SC_2_UPE.html delete mode 100644 doc/libc/unix/bsd/constant._SC_2_VERSION.html delete mode 100644 doc/libc/unix/bsd/constant._SC_ADVISORY_INFO.html delete mode 100644 doc/libc/unix/bsd/constant._SC_AIO_LISTIO_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_AIO_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_AIO_PRIO_DELTA_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_ARG_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_ASYNCHRONOUS_IO.html delete mode 100644 doc/libc/unix/bsd/constant._SC_ATEXIT_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_BARRIERS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_BC_BASE_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_BC_DIM_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_BC_SCALE_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_BC_STRING_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_CHILD_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_CLK_TCK.html delete mode 100644 doc/libc/unix/bsd/constant._SC_CLOCK_SELECTION.html delete mode 100644 doc/libc/unix/bsd/constant._SC_COLL_WEIGHTS_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_CPUTIME.html delete mode 100644 doc/libc/unix/bsd/constant._SC_DELAYTIMER_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_EXPR_NEST_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_FILE_LOCKING.html delete mode 100644 doc/libc/unix/bsd/constant._SC_FSYNC.html delete mode 100644 doc/libc/unix/bsd/constant._SC_GETGR_R_SIZE_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_GETPW_R_SIZE_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_HOST_NAME_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_IOV_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_IPV6.html delete mode 100644 doc/libc/unix/bsd/constant._SC_JOB_CONTROL.html delete mode 100644 doc/libc/unix/bsd/constant._SC_LINE_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_LOGIN_NAME_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_MAPPED_FILES.html delete mode 100644 doc/libc/unix/bsd/constant._SC_MEMLOCK.html delete mode 100644 doc/libc/unix/bsd/constant._SC_MEMLOCK_RANGE.html delete mode 100644 doc/libc/unix/bsd/constant._SC_MEMORY_PROTECTION.html delete mode 100644 doc/libc/unix/bsd/constant._SC_MESSAGE_PASSING.html delete mode 100644 doc/libc/unix/bsd/constant._SC_MONOTONIC_CLOCK.html delete mode 100644 doc/libc/unix/bsd/constant._SC_MQ_OPEN_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_MQ_PRIO_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_NGROUPS_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_NPROCESSORS_CONF.html delete mode 100644 doc/libc/unix/bsd/constant._SC_NPROCESSORS_ONLN.html delete mode 100644 doc/libc/unix/bsd/constant._SC_OPEN_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_PAGESIZE.html delete mode 100644 doc/libc/unix/bsd/constant._SC_PAGE_SIZE.html delete mode 100644 doc/libc/unix/bsd/constant._SC_PASS_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_PRIORITIZED_IO.html delete mode 100644 doc/libc/unix/bsd/constant._SC_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/unix/bsd/constant._SC_RAW_SOCKETS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_READER_WRITER_LOCKS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_REALTIME_SIGNALS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_REGEXP.html delete mode 100644 doc/libc/unix/bsd/constant._SC_RE_DUP_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_RTSIG_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_SAVED_IDS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_SEMAPHORES.html delete mode 100644 doc/libc/unix/bsd/constant._SC_SEM_NSEMS_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_SEM_VALUE_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_SHARED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_SHELL.html delete mode 100644 doc/libc/unix/bsd/constant._SC_SIGQUEUE_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_SPAWN.html delete mode 100644 doc/libc/unix/bsd/constant._SC_SPIN_LOCKS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_SPORADIC_SERVER.html delete mode 100644 doc/libc/unix/bsd/constant._SC_SS_REPL_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_STREAM_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_SYMLOOP_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_SYNCHRONIZED_IO.html delete mode 100644 doc/libc/unix/bsd/constant._SC_THREADS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_THREAD_ATTR_STACKADDR.html delete mode 100644 doc/libc/unix/bsd/constant._SC_THREAD_ATTR_STACKSIZE.html delete mode 100644 doc/libc/unix/bsd/constant._SC_THREAD_CPUTIME.html delete mode 100644 doc/libc/unix/bsd/constant._SC_THREAD_DESTRUCTOR_ITERATIONS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_THREAD_KEYS_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_THREAD_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/unix/bsd/constant._SC_THREAD_PRIO_INHERIT.html delete mode 100644 doc/libc/unix/bsd/constant._SC_THREAD_PRIO_PROTECT.html delete mode 100644 doc/libc/unix/bsd/constant._SC_THREAD_PROCESS_SHARED.html delete mode 100644 doc/libc/unix/bsd/constant._SC_THREAD_SAFE_FUNCTIONS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_THREAD_SPORADIC_SERVER.html delete mode 100644 doc/libc/unix/bsd/constant._SC_THREAD_STACK_MIN.html delete mode 100644 doc/libc/unix/bsd/constant._SC_THREAD_THREADS_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_TIMEOUTS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_TIMERS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_TIMER_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_TRACE.html delete mode 100644 doc/libc/unix/bsd/constant._SC_TRACE_EVENT_FILTER.html delete mode 100644 doc/libc/unix/bsd/constant._SC_TRACE_EVENT_NAME_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_TRACE_INHERIT.html delete mode 100644 doc/libc/unix/bsd/constant._SC_TRACE_LOG.html delete mode 100644 doc/libc/unix/bsd/constant._SC_TRACE_NAME_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_TRACE_SYS_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_TRACE_USER_EVENT_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_TTY_NAME_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_TYPED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_TZNAME_MAX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_V6_ILP32_OFF32.html delete mode 100644 doc/libc/unix/bsd/constant._SC_V6_ILP32_OFFBIG.html delete mode 100644 doc/libc/unix/bsd/constant._SC_V6_LP64_OFF64.html delete mode 100644 doc/libc/unix/bsd/constant._SC_V6_LPBIG_OFFBIG.html delete mode 100644 doc/libc/unix/bsd/constant._SC_VERSION.html delete mode 100644 doc/libc/unix/bsd/constant._SC_XBS5_ILP32_OFF32.html delete mode 100644 doc/libc/unix/bsd/constant._SC_XBS5_ILP32_OFFBIG.html delete mode 100644 doc/libc/unix/bsd/constant._SC_XBS5_LP64_OFF64.html delete mode 100644 doc/libc/unix/bsd/constant._SC_XBS5_LPBIG_OFFBIG.html delete mode 100644 doc/libc/unix/bsd/constant._SC_XOPEN_CRYPT.html delete mode 100644 doc/libc/unix/bsd/constant._SC_XOPEN_ENH_I18N.html delete mode 100644 doc/libc/unix/bsd/constant._SC_XOPEN_LEGACY.html delete mode 100644 doc/libc/unix/bsd/constant._SC_XOPEN_REALTIME.html delete mode 100644 doc/libc/unix/bsd/constant._SC_XOPEN_REALTIME_THREADS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_XOPEN_SHM.html delete mode 100644 doc/libc/unix/bsd/constant._SC_XOPEN_STREAMS.html delete mode 100644 doc/libc/unix/bsd/constant._SC_XOPEN_UNIX.html delete mode 100644 doc/libc/unix/bsd/constant._SC_XOPEN_VERSION.html delete mode 100644 doc/libc/unix/bsd/constant._SC_XOPEN_XCU_VERSION.html delete mode 100644 doc/libc/unix/bsd/constant._WSTOPPED.html delete mode 100644 doc/libc/unix/bsd/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/unix/bsd/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/unix/bsd/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/unix/bsd/enum.timezone.html delete mode 100644 doc/libc/unix/bsd/fn.FD_CLR.html delete mode 100644 doc/libc/unix/bsd/fn.FD_ISSET.html delete mode 100644 doc/libc/unix/bsd/fn.FD_SET.html delete mode 100644 doc/libc/unix/bsd/fn.FD_ZERO.html delete mode 100644 doc/libc/unix/bsd/fn.WCOREDUMP.html delete mode 100644 doc/libc/unix/bsd/fn.WEXITSTATUS.html delete mode 100644 doc/libc/unix/bsd/fn.WIFCONTINUED.html delete mode 100644 doc/libc/unix/bsd/fn.WIFEXITED.html delete mode 100644 doc/libc/unix/bsd/fn.WIFSIGNALED.html delete mode 100644 doc/libc/unix/bsd/fn.WIFSTOPPED.html delete mode 100644 doc/libc/unix/bsd/fn.WSTOPSIG.html delete mode 100644 doc/libc/unix/bsd/fn.WTERMSIG.html delete mode 100644 doc/libc/unix/bsd/fn._WSTATUS.html delete mode 100644 doc/libc/unix/bsd/fn.__error.html delete mode 100644 doc/libc/unix/bsd/fn.backtrace.html delete mode 100644 doc/libc/unix/bsd/fn.duplocale.html delete mode 100644 doc/libc/unix/bsd/fn.forkpty.html delete mode 100644 doc/libc/unix/bsd/fn.freelocale.html delete mode 100644 doc/libc/unix/bsd/fn.fstatfs.html delete mode 100644 doc/libc/unix/bsd/fn.getnameinfo.html delete mode 100644 doc/libc/unix/bsd/fn.getpwuid_r.html delete mode 100644 doc/libc/unix/bsd/fn.ioctl.html delete mode 100644 doc/libc/unix/bsd/fn.kevent.html delete mode 100644 doc/libc/unix/bsd/fn.kevent64.html delete mode 100644 doc/libc/unix/bsd/fn.kqueue.html delete mode 100644 doc/libc/unix/bsd/fn.localeconv_l.html delete mode 100644 doc/libc/unix/bsd/fn.mach_absolute_time.html delete mode 100644 doc/libc/unix/bsd/fn.mach_timebase_info.html delete mode 100644 doc/libc/unix/bsd/fn.mincore.html delete mode 100644 doc/libc/unix/bsd/fn.mount.html delete mode 100644 doc/libc/unix/bsd/fn.mprotect.html delete mode 100644 doc/libc/unix/bsd/fn.newlocale.html delete mode 100644 doc/libc/unix/bsd/fn.openpty.html delete mode 100644 doc/libc/unix/bsd/fn.pthread_get_stackaddr_np.html delete mode 100644 doc/libc/unix/bsd/fn.pthread_get_stacksize_np.html delete mode 100644 doc/libc/unix/bsd/fn.pthread_setname_np.html delete mode 100644 doc/libc/unix/bsd/fn.ptrace.html delete mode 100644 doc/libc/unix/bsd/fn.querylocale.html delete mode 100644 doc/libc/unix/bsd/fn.quotactl.html delete mode 100644 doc/libc/unix/bsd/fn.sendfile.html delete mode 100644 doc/libc/unix/bsd/fn.setgroups.html delete mode 100644 doc/libc/unix/bsd/fn.sethostname.html delete mode 100644 doc/libc/unix/bsd/fn.shm_open.html delete mode 100644 doc/libc/unix/bsd/fn.statfs.html delete mode 100644 doc/libc/unix/bsd/fn.syscall.html delete mode 100644 doc/libc/unix/bsd/fn.sysctl.html delete mode 100644 doc/libc/unix/bsd/fn.sysctlbyname.html delete mode 100644 doc/libc/unix/bsd/fn.sysctlnametomib.html delete mode 100644 doc/libc/unix/bsd/fn.unmount.html delete mode 100644 doc/libc/unix/bsd/fn.uselocale.html delete mode 100644 doc/libc/unix/bsd/index.html delete mode 100644 doc/libc/unix/bsd/sidebar-items.js delete mode 100644 doc/libc/unix/bsd/struct.Dl_info.html delete mode 100644 doc/libc/unix/bsd/struct.addrinfo.html delete mode 100644 doc/libc/unix/bsd/struct.dirent.html delete mode 100644 doc/libc/unix/bsd/struct.dqblk.html delete mode 100644 doc/libc/unix/bsd/struct.fd_set.html delete mode 100644 doc/libc/unix/bsd/struct.flock.html delete mode 100644 doc/libc/unix/bsd/struct.fsid_t.html delete mode 100644 doc/libc/unix/bsd/struct.fstore_t.html delete mode 100644 doc/libc/unix/bsd/struct.glob_t.html delete mode 100644 doc/libc/unix/bsd/struct.ifaddrs.html delete mode 100644 doc/libc/unix/bsd/struct.kevent.html delete mode 100644 doc/libc/unix/bsd/struct.kevent64_s.html delete mode 100644 doc/libc/unix/bsd/struct.lconv.html delete mode 100644 doc/libc/unix/bsd/struct.mach_timebase_info.html delete mode 100644 doc/libc/unix/bsd/struct.msghdr.html delete mode 100644 doc/libc/unix/bsd/struct.passwd.html delete mode 100644 doc/libc/unix/bsd/struct.pthread_attr_t.html delete mode 100644 doc/libc/unix/bsd/struct.pthread_cond_t.html delete mode 100644 doc/libc/unix/bsd/struct.pthread_mutex_t.html delete mode 100644 doc/libc/unix/bsd/struct.pthread_mutexattr_t.html delete mode 100644 doc/libc/unix/bsd/struct.pthread_rwlock_t.html delete mode 100644 doc/libc/unix/bsd/struct.radvisory.html delete mode 100644 doc/libc/unix/bsd/struct.sf_hdtr.html delete mode 100644 doc/libc/unix/bsd/struct.sigaction.html delete mode 100644 doc/libc/unix/bsd/struct.siginfo_t.html delete mode 100644 doc/libc/unix/bsd/struct.sockaddr.html delete mode 100644 doc/libc/unix/bsd/struct.sockaddr_in.html delete mode 100644 doc/libc/unix/bsd/struct.sockaddr_in6.html delete mode 100644 doc/libc/unix/bsd/struct.sockaddr_storage.html delete mode 100644 doc/libc/unix/bsd/struct.sockaddr_un.html delete mode 100644 doc/libc/unix/bsd/struct.stack_t.html delete mode 100644 doc/libc/unix/bsd/struct.stat.html delete mode 100644 doc/libc/unix/bsd/struct.statfs.html delete mode 100644 doc/libc/unix/bsd/struct.statvfs.html delete mode 100644 doc/libc/unix/bsd/struct.termios.html delete mode 100644 doc/libc/unix/bsd/struct.tm.html delete mode 100644 doc/libc/unix/bsd/struct.utsname.html delete mode 100644 doc/libc/unix/bsd/type.blkcnt_t.html delete mode 100644 doc/libc/unix/bsd/type.blksize_t.html delete mode 100644 doc/libc/unix/bsd/type.c_char.html delete mode 100644 doc/libc/unix/bsd/type.c_long.html delete mode 100644 doc/libc/unix/bsd/type.c_ulong.html delete mode 100644 doc/libc/unix/bsd/type.clock_t.html delete mode 100644 doc/libc/unix/bsd/type.dev_t.html delete mode 100644 doc/libc/unix/bsd/type.fsblkcnt_t.html delete mode 100644 doc/libc/unix/bsd/type.fsfilcnt_t.html delete mode 100644 doc/libc/unix/bsd/type.ino_t.html delete mode 100644 doc/libc/unix/bsd/type.mach_timebase_info_data_t.html delete mode 100644 doc/libc/unix/bsd/type.mode_t.html delete mode 100644 doc/libc/unix/bsd/type.nfds_t.html delete mode 100644 doc/libc/unix/bsd/type.nl_item.html delete mode 100644 doc/libc/unix/bsd/type.nlink_t.html delete mode 100644 doc/libc/unix/bsd/type.off_t.html delete mode 100644 doc/libc/unix/bsd/type.pthread_key_t.html delete mode 100644 doc/libc/unix/bsd/type.pthread_t.html delete mode 100644 doc/libc/unix/bsd/type.rlim_t.html delete mode 100644 doc/libc/unix/bsd/type.sa_family_t.html delete mode 100644 doc/libc/unix/bsd/type.sigset_t.html delete mode 100644 doc/libc/unix/bsd/type.socklen_t.html delete mode 100644 doc/libc/unix/bsd/type.speed_t.html delete mode 100644 doc/libc/unix/bsd/type.suseconds_t.html delete mode 100644 doc/libc/unix/bsd/type.tcflag_t.html delete mode 100644 doc/libc/unix/bsd/type.time_t.html delete mode 100644 doc/libc/unix/bsd/type.useconds_t.html delete mode 100644 doc/libc/unix/bsd/type.wchar_t.html delete mode 100644 doc/libc/unix/constant.ABDAY_1.html delete mode 100644 doc/libc/unix/constant.ABDAY_2.html delete mode 100644 doc/libc/unix/constant.ABDAY_3.html delete mode 100644 doc/libc/unix/constant.ABDAY_4.html delete mode 100644 doc/libc/unix/constant.ABDAY_5.html delete mode 100644 doc/libc/unix/constant.ABDAY_6.html delete mode 100644 doc/libc/unix/constant.ABDAY_7.html delete mode 100644 doc/libc/unix/constant.ABMON_1.html delete mode 100644 doc/libc/unix/constant.ABMON_10.html delete mode 100644 doc/libc/unix/constant.ABMON_11.html delete mode 100644 doc/libc/unix/constant.ABMON_12.html delete mode 100644 doc/libc/unix/constant.ABMON_2.html delete mode 100644 doc/libc/unix/constant.ABMON_3.html delete mode 100644 doc/libc/unix/constant.ABMON_4.html delete mode 100644 doc/libc/unix/constant.ABMON_5.html delete mode 100644 doc/libc/unix/constant.ABMON_6.html delete mode 100644 doc/libc/unix/constant.ABMON_7.html delete mode 100644 doc/libc/unix/constant.ABMON_8.html delete mode 100644 doc/libc/unix/constant.ABMON_9.html delete mode 100644 doc/libc/unix/constant.AF_INET.html delete mode 100644 doc/libc/unix/constant.AF_INET6.html delete mode 100644 doc/libc/unix/constant.AF_UNIX.html delete mode 100644 doc/libc/unix/constant.ALT_DIGITS.html delete mode 100644 doc/libc/unix/constant.AM_STR.html delete mode 100644 doc/libc/unix/constant.BRKINT.html delete mode 100644 doc/libc/unix/constant.BS0.html delete mode 100644 doc/libc/unix/constant.BS1.html delete mode 100644 doc/libc/unix/constant.BUFSIZ.html delete mode 100644 doc/libc/unix/constant.CLOCAL.html delete mode 100644 doc/libc/unix/constant.CODESET.html delete mode 100644 doc/libc/unix/constant.CR0.html delete mode 100644 doc/libc/unix/constant.CR1.html delete mode 100644 doc/libc/unix/constant.CR2.html delete mode 100644 doc/libc/unix/constant.CR3.html delete mode 100644 doc/libc/unix/constant.CREAD.html delete mode 100644 doc/libc/unix/constant.CRNCYSTR.html delete mode 100644 doc/libc/unix/constant.CRTSCTS.html delete mode 100644 doc/libc/unix/constant.CS5.html delete mode 100644 doc/libc/unix/constant.CS6.html delete mode 100644 doc/libc/unix/constant.CS7.html delete mode 100644 doc/libc/unix/constant.CS8.html delete mode 100644 doc/libc/unix/constant.CSIZE.html delete mode 100644 doc/libc/unix/constant.CSTOPB.html delete mode 100644 doc/libc/unix/constant.CTL_HW.html delete mode 100644 doc/libc/unix/constant.DAY_1.html delete mode 100644 doc/libc/unix/constant.DAY_2.html delete mode 100644 doc/libc/unix/constant.DAY_3.html delete mode 100644 doc/libc/unix/constant.DAY_4.html delete mode 100644 doc/libc/unix/constant.DAY_5.html delete mode 100644 doc/libc/unix/constant.DAY_6.html delete mode 100644 doc/libc/unix/constant.DAY_7.html delete mode 100644 doc/libc/unix/constant.DT_BLK.html delete mode 100644 doc/libc/unix/constant.DT_CHR.html delete mode 100644 doc/libc/unix/constant.DT_DIR.html delete mode 100644 doc/libc/unix/constant.DT_FIFO.html delete mode 100644 doc/libc/unix/constant.DT_LNK.html delete mode 100644 doc/libc/unix/constant.DT_REG.html delete mode 100644 doc/libc/unix/constant.DT_SOCK.html delete mode 100644 doc/libc/unix/constant.D_FMT.html delete mode 100644 doc/libc/unix/constant.D_MD_ORDER.html delete mode 100644 doc/libc/unix/constant.D_T_FMT.html delete mode 100644 doc/libc/unix/constant.E2BIG.html delete mode 100644 doc/libc/unix/constant.EACCES.html delete mode 100644 doc/libc/unix/constant.EADDRINUSE.html delete mode 100644 doc/libc/unix/constant.EADDRNOTAVAIL.html delete mode 100644 doc/libc/unix/constant.EAFNOSUPPORT.html delete mode 100644 doc/libc/unix/constant.EAGAIN.html delete mode 100644 doc/libc/unix/constant.EALREADY.html delete mode 100644 doc/libc/unix/constant.EAUTH.html delete mode 100644 doc/libc/unix/constant.EBADARCH.html delete mode 100644 doc/libc/unix/constant.EBADEXEC.html delete mode 100644 doc/libc/unix/constant.EBADF.html delete mode 100644 doc/libc/unix/constant.EBADMACHO.html delete mode 100644 doc/libc/unix/constant.EBADMSG.html delete mode 100644 doc/libc/unix/constant.EBADRPC.html delete mode 100644 doc/libc/unix/constant.EBUSY.html delete mode 100644 doc/libc/unix/constant.ECANCELED.html delete mode 100644 doc/libc/unix/constant.ECHILD.html delete mode 100644 doc/libc/unix/constant.ECHO.html delete mode 100644 doc/libc/unix/constant.ECHOCTL.html delete mode 100644 doc/libc/unix/constant.ECHOE.html delete mode 100644 doc/libc/unix/constant.ECHOK.html delete mode 100644 doc/libc/unix/constant.ECHOKE.html delete mode 100644 doc/libc/unix/constant.ECHONL.html delete mode 100644 doc/libc/unix/constant.ECHOPRT.html delete mode 100644 doc/libc/unix/constant.ECONNABORTED.html delete mode 100644 doc/libc/unix/constant.ECONNREFUSED.html delete mode 100644 doc/libc/unix/constant.ECONNRESET.html delete mode 100644 doc/libc/unix/constant.EDEADLK.html delete mode 100644 doc/libc/unix/constant.EDESTADDRREQ.html delete mode 100644 doc/libc/unix/constant.EDEVERR.html delete mode 100644 doc/libc/unix/constant.EDOM.html delete mode 100644 doc/libc/unix/constant.EDQUOT.html delete mode 100644 doc/libc/unix/constant.EEXIST.html delete mode 100644 doc/libc/unix/constant.EFAULT.html delete mode 100644 doc/libc/unix/constant.EFBIG.html delete mode 100644 doc/libc/unix/constant.EFTYPE.html delete mode 100644 doc/libc/unix/constant.EHOSTDOWN.html delete mode 100644 doc/libc/unix/constant.EHOSTUNREACH.html delete mode 100644 doc/libc/unix/constant.EIDRM.html delete mode 100644 doc/libc/unix/constant.EILSEQ.html delete mode 100644 doc/libc/unix/constant.EINPROGRESS.html delete mode 100644 doc/libc/unix/constant.EINTR.html delete mode 100644 doc/libc/unix/constant.EINVAL.html delete mode 100644 doc/libc/unix/constant.EIO.html delete mode 100644 doc/libc/unix/constant.EISCONN.html delete mode 100644 doc/libc/unix/constant.EISDIR.html delete mode 100644 doc/libc/unix/constant.ELAST.html delete mode 100644 doc/libc/unix/constant.ELOOP.html delete mode 100644 doc/libc/unix/constant.EMFILE.html delete mode 100644 doc/libc/unix/constant.EMLINK.html delete mode 100644 doc/libc/unix/constant.EMSGSIZE.html delete mode 100644 doc/libc/unix/constant.EMULTIHOP.html delete mode 100644 doc/libc/unix/constant.ENAMETOOLONG.html delete mode 100644 doc/libc/unix/constant.ENEEDAUTH.html delete mode 100644 doc/libc/unix/constant.ENETDOWN.html delete mode 100644 doc/libc/unix/constant.ENETRESET.html delete mode 100644 doc/libc/unix/constant.ENETUNREACH.html delete mode 100644 doc/libc/unix/constant.ENFILE.html delete mode 100644 doc/libc/unix/constant.ENOATTR.html delete mode 100644 doc/libc/unix/constant.ENOBUFS.html delete mode 100644 doc/libc/unix/constant.ENODATA.html delete mode 100644 doc/libc/unix/constant.ENODEV.html delete mode 100644 doc/libc/unix/constant.ENOENT.html delete mode 100644 doc/libc/unix/constant.ENOEXEC.html delete mode 100644 doc/libc/unix/constant.ENOLCK.html delete mode 100644 doc/libc/unix/constant.ENOLINK.html delete mode 100644 doc/libc/unix/constant.ENOMEM.html delete mode 100644 doc/libc/unix/constant.ENOMSG.html delete mode 100644 doc/libc/unix/constant.ENOPOLICY.html delete mode 100644 doc/libc/unix/constant.ENOPROTOOPT.html delete mode 100644 doc/libc/unix/constant.ENOSPC.html delete mode 100644 doc/libc/unix/constant.ENOSR.html delete mode 100644 doc/libc/unix/constant.ENOSTR.html delete mode 100644 doc/libc/unix/constant.ENOSYS.html delete mode 100644 doc/libc/unix/constant.ENOTBLK.html delete mode 100644 doc/libc/unix/constant.ENOTCONN.html delete mode 100644 doc/libc/unix/constant.ENOTDIR.html delete mode 100644 doc/libc/unix/constant.ENOTEMPTY.html delete mode 100644 doc/libc/unix/constant.ENOTRECOVERABLE.html delete mode 100644 doc/libc/unix/constant.ENOTSOCK.html delete mode 100644 doc/libc/unix/constant.ENOTSUP.html delete mode 100644 doc/libc/unix/constant.ENOTTY.html delete mode 100644 doc/libc/unix/constant.ENXIO.html delete mode 100644 doc/libc/unix/constant.EOF.html delete mode 100644 doc/libc/unix/constant.EOPNOTSUPP.html delete mode 100644 doc/libc/unix/constant.EOVERFLOW.html delete mode 100644 doc/libc/unix/constant.EOWNERDEAD.html delete mode 100644 doc/libc/unix/constant.EPERM.html delete mode 100644 doc/libc/unix/constant.EPFNOSUPPORT.html delete mode 100644 doc/libc/unix/constant.EPIPE.html delete mode 100644 doc/libc/unix/constant.EPROCLIM.html delete mode 100644 doc/libc/unix/constant.EPROCUNAVAIL.html delete mode 100644 doc/libc/unix/constant.EPROGMISMATCH.html delete mode 100644 doc/libc/unix/constant.EPROGUNAVAIL.html delete mode 100644 doc/libc/unix/constant.EPROTO.html delete mode 100644 doc/libc/unix/constant.EPROTONOSUPPORT.html delete mode 100644 doc/libc/unix/constant.EPROTOTYPE.html delete mode 100644 doc/libc/unix/constant.EPWROFF.html delete mode 100644 doc/libc/unix/constant.EQFULL.html delete mode 100644 doc/libc/unix/constant.ERA.html delete mode 100644 doc/libc/unix/constant.ERANGE.html delete mode 100644 doc/libc/unix/constant.ERA_D_FMT.html delete mode 100644 doc/libc/unix/constant.ERA_D_T_FMT.html delete mode 100644 doc/libc/unix/constant.ERA_T_FMT.html delete mode 100644 doc/libc/unix/constant.EREMOTE.html delete mode 100644 doc/libc/unix/constant.EROFS.html delete mode 100644 doc/libc/unix/constant.ERPCMISMATCH.html delete mode 100644 doc/libc/unix/constant.ESHLIBVERS.html delete mode 100644 doc/libc/unix/constant.ESHUTDOWN.html delete mode 100644 doc/libc/unix/constant.ESOCKTNOSUPPORT.html delete mode 100644 doc/libc/unix/constant.ESPIPE.html delete mode 100644 doc/libc/unix/constant.ESRCH.html delete mode 100644 doc/libc/unix/constant.ESTALE.html delete mode 100644 doc/libc/unix/constant.ETIME.html delete mode 100644 doc/libc/unix/constant.ETIMEDOUT.html delete mode 100644 doc/libc/unix/constant.ETOOMANYREFS.html delete mode 100644 doc/libc/unix/constant.ETXTBSY.html delete mode 100644 doc/libc/unix/constant.EUSERS.html delete mode 100644 doc/libc/unix/constant.EVFILT_AIO.html delete mode 100644 doc/libc/unix/constant.EVFILT_FS.html delete mode 100644 doc/libc/unix/constant.EVFILT_MACHPORT.html delete mode 100644 doc/libc/unix/constant.EVFILT_PROC.html delete mode 100644 doc/libc/unix/constant.EVFILT_READ.html delete mode 100644 doc/libc/unix/constant.EVFILT_SIGNAL.html delete mode 100644 doc/libc/unix/constant.EVFILT_SYSCOUNT.html delete mode 100644 doc/libc/unix/constant.EVFILT_TIMER.html delete mode 100644 doc/libc/unix/constant.EVFILT_USER.html delete mode 100644 doc/libc/unix/constant.EVFILT_VM.html delete mode 100644 doc/libc/unix/constant.EVFILT_VNODE.html delete mode 100644 doc/libc/unix/constant.EVFILT_WRITE.html delete mode 100644 doc/libc/unix/constant.EV_ADD.html delete mode 100644 doc/libc/unix/constant.EV_CLEAR.html delete mode 100644 doc/libc/unix/constant.EV_DELETE.html delete mode 100644 doc/libc/unix/constant.EV_DISABLE.html delete mode 100644 doc/libc/unix/constant.EV_DISPATCH.html delete mode 100644 doc/libc/unix/constant.EV_ENABLE.html delete mode 100644 doc/libc/unix/constant.EV_EOF.html delete mode 100644 doc/libc/unix/constant.EV_ERROR.html delete mode 100644 doc/libc/unix/constant.EV_FLAG0.html delete mode 100644 doc/libc/unix/constant.EV_FLAG1.html delete mode 100644 doc/libc/unix/constant.EV_ONESHOT.html delete mode 100644 doc/libc/unix/constant.EV_OOBAND.html delete mode 100644 doc/libc/unix/constant.EV_POLL.html delete mode 100644 doc/libc/unix/constant.EV_RECEIPT.html delete mode 100644 doc/libc/unix/constant.EV_SYSFLAGS.html delete mode 100644 doc/libc/unix/constant.EWOULDBLOCK.html delete mode 100644 doc/libc/unix/constant.EXDEV.html delete mode 100644 doc/libc/unix/constant.EXIT_FAILURE.html delete mode 100644 doc/libc/unix/constant.EXIT_SUCCESS.html delete mode 100644 doc/libc/unix/constant.EXTPROC.html delete mode 100644 doc/libc/unix/constant.FD_CLOEXEC.html delete mode 100644 doc/libc/unix/constant.FD_SETSIZE.html delete mode 100644 doc/libc/unix/constant.FF0.html delete mode 100644 doc/libc/unix/constant.FF1.html delete mode 100644 doc/libc/unix/constant.FILENAME_MAX.html delete mode 100644 doc/libc/unix/constant.FIOCLEX.html delete mode 100644 doc/libc/unix/constant.FIONBIO.html delete mode 100644 doc/libc/unix/constant.FLUSHO.html delete mode 100644 doc/libc/unix/constant.FOPEN_MAX.html delete mode 100644 doc/libc/unix/constant.F_ALLOCATEALL.html delete mode 100644 doc/libc/unix/constant.F_ALLOCATECONTIG.html delete mode 100644 doc/libc/unix/constant.F_DUPFD.html delete mode 100644 doc/libc/unix/constant.F_DUPFD_CLOEXEC.html delete mode 100644 doc/libc/unix/constant.F_FREEZE_FS.html delete mode 100644 doc/libc/unix/constant.F_FULLFSYNC.html delete mode 100644 doc/libc/unix/constant.F_GETFD.html delete mode 100644 doc/libc/unix/constant.F_GETFL.html delete mode 100644 doc/libc/unix/constant.F_GETLK.html delete mode 100644 doc/libc/unix/constant.F_GETOWN.html delete mode 100644 doc/libc/unix/constant.F_GETPATH.html delete mode 100644 doc/libc/unix/constant.F_GLOBAL_NOCACHE.html delete mode 100644 doc/libc/unix/constant.F_LOCK.html delete mode 100644 doc/libc/unix/constant.F_NOCACHE.html delete mode 100644 doc/libc/unix/constant.F_NODIRECT.html delete mode 100644 doc/libc/unix/constant.F_OK.html delete mode 100644 doc/libc/unix/constant.F_PEOFPOSMODE.html delete mode 100644 doc/libc/unix/constant.F_PREALLOCATE.html delete mode 100644 doc/libc/unix/constant.F_RDADVISE.html delete mode 100644 doc/libc/unix/constant.F_RDAHEAD.html delete mode 100644 doc/libc/unix/constant.F_SETFD.html delete mode 100644 doc/libc/unix/constant.F_SETFL.html delete mode 100644 doc/libc/unix/constant.F_SETLK.html delete mode 100644 doc/libc/unix/constant.F_SETLKW.html delete mode 100644 doc/libc/unix/constant.F_SETOWN.html delete mode 100644 doc/libc/unix/constant.F_TEST.html delete mode 100644 doc/libc/unix/constant.F_THAW_FS.html delete mode 100644 doc/libc/unix/constant.F_TLOCK.html delete mode 100644 doc/libc/unix/constant.F_ULOCK.html delete mode 100644 doc/libc/unix/constant.F_VOLPOSMODE.html delete mode 100644 doc/libc/unix/constant.GLOB_ABORTED.html delete mode 100644 doc/libc/unix/constant.GLOB_APPEND.html delete mode 100644 doc/libc/unix/constant.GLOB_DOOFFS.html delete mode 100644 doc/libc/unix/constant.GLOB_ERR.html delete mode 100644 doc/libc/unix/constant.GLOB_MARK.html delete mode 100644 doc/libc/unix/constant.GLOB_NOCHECK.html delete mode 100644 doc/libc/unix/constant.GLOB_NOESCAPE.html delete mode 100644 doc/libc/unix/constant.GLOB_NOMATCH.html delete mode 100644 doc/libc/unix/constant.GLOB_NOSORT.html delete mode 100644 doc/libc/unix/constant.GLOB_NOSPACE.html delete mode 100644 doc/libc/unix/constant.GRPQUOTA.html delete mode 100644 doc/libc/unix/constant.HUPCL.html delete mode 100644 doc/libc/unix/constant.HW_AVAILCPU.html delete mode 100644 doc/libc/unix/constant.HW_NCPU.html delete mode 100644 doc/libc/unix/constant.ICANON.html delete mode 100644 doc/libc/unix/constant.ICRNL.html delete mode 100644 doc/libc/unix/constant.IEXTEN.html delete mode 100644 doc/libc/unix/constant.IFF_LOOPBACK.html delete mode 100644 doc/libc/unix/constant.IF_NAMESIZE.html delete mode 100644 doc/libc/unix/constant.IGNBRK.html delete mode 100644 doc/libc/unix/constant.IGNCR.html delete mode 100644 doc/libc/unix/constant.IGNPAR.html delete mode 100644 doc/libc/unix/constant.IMAXBEL.html delete mode 100644 doc/libc/unix/constant.INLCR.html delete mode 100644 doc/libc/unix/constant.INPCK.html delete mode 100644 doc/libc/unix/constant.IPPROTO_IP.html delete mode 100644 doc/libc/unix/constant.IPPROTO_IPV6.html delete mode 100644 doc/libc/unix/constant.IPPROTO_RAW.html delete mode 100644 doc/libc/unix/constant.IPPROTO_TCP.html delete mode 100644 doc/libc/unix/constant.IPV6_JOIN_GROUP.html delete mode 100644 doc/libc/unix/constant.IPV6_LEAVE_GROUP.html delete mode 100644 doc/libc/unix/constant.IPV6_MULTICAST_LOOP.html delete mode 100644 doc/libc/unix/constant.IPV6_V6ONLY.html delete mode 100644 doc/libc/unix/constant.IP_ADD_MEMBERSHIP.html delete mode 100644 doc/libc/unix/constant.IP_DROP_MEMBERSHIP.html delete mode 100644 doc/libc/unix/constant.IP_HDRINCL.html delete mode 100644 doc/libc/unix/constant.IP_MULTICAST_LOOP.html delete mode 100644 doc/libc/unix/constant.IP_MULTICAST_TTL.html delete mode 100644 doc/libc/unix/constant.IP_TTL.html delete mode 100644 doc/libc/unix/constant.ISIG.html delete mode 100644 doc/libc/unix/constant.ISTRIP.html delete mode 100644 doc/libc/unix/constant.IUTF8.html delete mode 100644 doc/libc/unix/constant.IXANY.html delete mode 100644 doc/libc/unix/constant.IXOFF.html delete mode 100644 doc/libc/unix/constant.IXON.html delete mode 100644 doc/libc/unix/constant.LC_ALL.html delete mode 100644 doc/libc/unix/constant.LC_ALL_MASK.html delete mode 100644 doc/libc/unix/constant.LC_COLLATE.html delete mode 100644 doc/libc/unix/constant.LC_COLLATE_MASK.html delete mode 100644 doc/libc/unix/constant.LC_CTYPE.html delete mode 100644 doc/libc/unix/constant.LC_CTYPE_MASK.html delete mode 100644 doc/libc/unix/constant.LC_MESSAGES.html delete mode 100644 doc/libc/unix/constant.LC_MESSAGES_MASK.html delete mode 100644 doc/libc/unix/constant.LC_MONETARY.html delete mode 100644 doc/libc/unix/constant.LC_MONETARY_MASK.html delete mode 100644 doc/libc/unix/constant.LC_NUMERIC.html delete mode 100644 doc/libc/unix/constant.LC_NUMERIC_MASK.html delete mode 100644 doc/libc/unix/constant.LC_TIME.html delete mode 100644 doc/libc/unix/constant.LC_TIME_MASK.html delete mode 100644 doc/libc/unix/constant.LOCK_EX.html delete mode 100644 doc/libc/unix/constant.LOCK_NB.html delete mode 100644 doc/libc/unix/constant.LOCK_SH.html delete mode 100644 doc/libc/unix/constant.LOCK_UN.html delete mode 100644 doc/libc/unix/constant.L_tmpnam.html delete mode 100644 doc/libc/unix/constant.MADV_CAN_REUSE.html delete mode 100644 doc/libc/unix/constant.MADV_DONTNEED.html delete mode 100644 doc/libc/unix/constant.MADV_FREE.html delete mode 100644 doc/libc/unix/constant.MADV_FREE_REUSABLE.html delete mode 100644 doc/libc/unix/constant.MADV_FREE_REUSE.html delete mode 100644 doc/libc/unix/constant.MADV_NORMAL.html delete mode 100644 doc/libc/unix/constant.MADV_RANDOM.html delete mode 100644 doc/libc/unix/constant.MADV_SEQUENTIAL.html delete mode 100644 doc/libc/unix/constant.MADV_WILLNEED.html delete mode 100644 doc/libc/unix/constant.MADV_ZERO_WIRED_PAGES.html delete mode 100644 doc/libc/unix/constant.MAP_ANON.html delete mode 100644 doc/libc/unix/constant.MAP_COPY.html delete mode 100644 doc/libc/unix/constant.MAP_FAILED.html delete mode 100644 doc/libc/unix/constant.MAP_FILE.html delete mode 100644 doc/libc/unix/constant.MAP_FIXED.html delete mode 100644 doc/libc/unix/constant.MAP_HASSEMAPHORE.html delete mode 100644 doc/libc/unix/constant.MAP_JIT.html delete mode 100644 doc/libc/unix/constant.MAP_NOCACHE.html delete mode 100644 doc/libc/unix/constant.MAP_NOEXTEND.html delete mode 100644 doc/libc/unix/constant.MAP_NORESERVE.html delete mode 100644 doc/libc/unix/constant.MAP_PRIVATE.html delete mode 100644 doc/libc/unix/constant.MAP_RENAME.html delete mode 100644 doc/libc/unix/constant.MAP_SHARED.html delete mode 100644 doc/libc/unix/constant.MCL_CURRENT.html delete mode 100644 doc/libc/unix/constant.MCL_FUTURE.html delete mode 100644 doc/libc/unix/constant.MINCORE_INCORE.html delete mode 100644 doc/libc/unix/constant.MINCORE_MODIFIED.html delete mode 100644 doc/libc/unix/constant.MINCORE_MODIFIED_OTHER.html delete mode 100644 doc/libc/unix/constant.MINCORE_REFERENCED.html delete mode 100644 doc/libc/unix/constant.MINCORE_REFERENCED_OTHER.html delete mode 100644 doc/libc/unix/constant.MNT_FORCE.html delete mode 100644 doc/libc/unix/constant.MON_1.html delete mode 100644 doc/libc/unix/constant.MON_10.html delete mode 100644 doc/libc/unix/constant.MON_11.html delete mode 100644 doc/libc/unix/constant.MON_12.html delete mode 100644 doc/libc/unix/constant.MON_2.html delete mode 100644 doc/libc/unix/constant.MON_3.html delete mode 100644 doc/libc/unix/constant.MON_4.html delete mode 100644 doc/libc/unix/constant.MON_5.html delete mode 100644 doc/libc/unix/constant.MON_6.html delete mode 100644 doc/libc/unix/constant.MON_7.html delete mode 100644 doc/libc/unix/constant.MON_8.html delete mode 100644 doc/libc/unix/constant.MON_9.html delete mode 100644 doc/libc/unix/constant.MS_ASYNC.html delete mode 100644 doc/libc/unix/constant.MS_DEACTIVATE.html delete mode 100644 doc/libc/unix/constant.MS_INVALIDATE.html delete mode 100644 doc/libc/unix/constant.MS_KILLPAGES.html delete mode 100644 doc/libc/unix/constant.MS_SYNC.html delete mode 100644 doc/libc/unix/constant.NCCS.html delete mode 100644 doc/libc/unix/constant.NI_MAXHOST.html delete mode 100644 doc/libc/unix/constant.NL0.html delete mode 100644 doc/libc/unix/constant.NL1.html delete mode 100644 doc/libc/unix/constant.NOEXPR.html delete mode 100644 doc/libc/unix/constant.NOFLSH.html delete mode 100644 doc/libc/unix/constant.NOSTR.html delete mode 100644 doc/libc/unix/constant.NOTE_ABSOLUTE.html delete mode 100644 doc/libc/unix/constant.NOTE_ATTRIB.html delete mode 100644 doc/libc/unix/constant.NOTE_CHILD.html delete mode 100644 doc/libc/unix/constant.NOTE_DELETE.html delete mode 100644 doc/libc/unix/constant.NOTE_EXEC.html delete mode 100644 doc/libc/unix/constant.NOTE_EXIT.html delete mode 100644 doc/libc/unix/constant.NOTE_EXITSTATUS.html delete mode 100644 doc/libc/unix/constant.NOTE_EXIT_REPARENTED.html delete mode 100644 doc/libc/unix/constant.NOTE_EXTEND.html delete mode 100644 doc/libc/unix/constant.NOTE_FFAND.html delete mode 100644 doc/libc/unix/constant.NOTE_FFCOPY.html delete mode 100644 doc/libc/unix/constant.NOTE_FFCTRLMASK.html delete mode 100644 doc/libc/unix/constant.NOTE_FFLAGSMASK.html delete mode 100644 doc/libc/unix/constant.NOTE_FFNOP.html delete mode 100644 doc/libc/unix/constant.NOTE_FFOR.html delete mode 100644 doc/libc/unix/constant.NOTE_FORK.html delete mode 100644 doc/libc/unix/constant.NOTE_LINK.html delete mode 100644 doc/libc/unix/constant.NOTE_LOWAT.html delete mode 100644 doc/libc/unix/constant.NOTE_NONE.html delete mode 100644 doc/libc/unix/constant.NOTE_NSECONDS.html delete mode 100644 doc/libc/unix/constant.NOTE_PCTRLMASK.html delete mode 100644 doc/libc/unix/constant.NOTE_PDATAMASK.html delete mode 100644 doc/libc/unix/constant.NOTE_REAP.html delete mode 100644 doc/libc/unix/constant.NOTE_RENAME.html delete mode 100644 doc/libc/unix/constant.NOTE_REVOKE.html delete mode 100644 doc/libc/unix/constant.NOTE_SECONDS.html delete mode 100644 doc/libc/unix/constant.NOTE_SIGNAL.html delete mode 100644 doc/libc/unix/constant.NOTE_TRACK.html delete mode 100644 doc/libc/unix/constant.NOTE_TRACKERR.html delete mode 100644 doc/libc/unix/constant.NOTE_TRIGGER.html delete mode 100644 doc/libc/unix/constant.NOTE_USECONDS.html delete mode 100644 doc/libc/unix/constant.NOTE_VM_ERROR.html delete mode 100644 doc/libc/unix/constant.NOTE_VM_PRESSURE.html delete mode 100644 doc/libc/unix/constant.NOTE_VM_PRESSURE_SUDDEN_TERMINATE.html delete mode 100644 doc/libc/unix/constant.NOTE_VM_PRESSURE_TERMINATE.html delete mode 100644 doc/libc/unix/constant.NOTE_WRITE.html delete mode 100644 doc/libc/unix/constant.ONLCR.html delete mode 100644 doc/libc/unix/constant.OPOST.html delete mode 100644 doc/libc/unix/constant.O_ACCMODE.html delete mode 100644 doc/libc/unix/constant.O_APPEND.html delete mode 100644 doc/libc/unix/constant.O_ASYNC.html delete mode 100644 doc/libc/unix/constant.O_CLOEXEC.html delete mode 100644 doc/libc/unix/constant.O_CREAT.html delete mode 100644 doc/libc/unix/constant.O_DIRECTORY.html delete mode 100644 doc/libc/unix/constant.O_DSYNC.html delete mode 100644 doc/libc/unix/constant.O_EXCL.html delete mode 100644 doc/libc/unix/constant.O_FSYNC.html delete mode 100644 doc/libc/unix/constant.O_NDELAY.html delete mode 100644 doc/libc/unix/constant.O_NOCTTY.html delete mode 100644 doc/libc/unix/constant.O_NOFOLLOW.html delete mode 100644 doc/libc/unix/constant.O_NONBLOCK.html delete mode 100644 doc/libc/unix/constant.O_RDONLY.html delete mode 100644 doc/libc/unix/constant.O_RDWR.html delete mode 100644 doc/libc/unix/constant.O_SYNC.html delete mode 100644 doc/libc/unix/constant.O_TRUNC.html delete mode 100644 doc/libc/unix/constant.O_WRONLY.html delete mode 100644 doc/libc/unix/constant.PARENB.html delete mode 100644 doc/libc/unix/constant.PARMRK.html delete mode 100644 doc/libc/unix/constant.PARODD.html delete mode 100644 doc/libc/unix/constant.PATH_MAX.html delete mode 100644 doc/libc/unix/constant.PENDIN.html delete mode 100644 doc/libc/unix/constant.PM_STR.html delete mode 100644 doc/libc/unix/constant.POLLERR.html delete mode 100644 doc/libc/unix/constant.POLLHUP.html delete mode 100644 doc/libc/unix/constant.POLLIN.html delete mode 100644 doc/libc/unix/constant.POLLNVAL.html delete mode 100644 doc/libc/unix/constant.POLLOUT.html delete mode 100644 doc/libc/unix/constant.POLLPRI.html delete mode 100644 doc/libc/unix/constant.POSIX_MADV_DONTNEED.html delete mode 100644 doc/libc/unix/constant.POSIX_MADV_NORMAL.html delete mode 100644 doc/libc/unix/constant.POSIX_MADV_RANDOM.html delete mode 100644 doc/libc/unix/constant.POSIX_MADV_SEQUENTIAL.html delete mode 100644 doc/libc/unix/constant.POSIX_MADV_WILLNEED.html delete mode 100644 doc/libc/unix/constant.PROT_EXEC.html delete mode 100644 doc/libc/unix/constant.PROT_NONE.html delete mode 100644 doc/libc/unix/constant.PROT_READ.html delete mode 100644 doc/libc/unix/constant.PROT_WRITE.html delete mode 100644 doc/libc/unix/constant.PTHREAD_COND_INITIALIZER.html delete mode 100644 doc/libc/unix/constant.PTHREAD_CREATE_DETACHED.html delete mode 100644 doc/libc/unix/constant.PTHREAD_CREATE_JOINABLE.html delete mode 100644 doc/libc/unix/constant.PTHREAD_MUTEX_INITIALIZER.html delete mode 100644 doc/libc/unix/constant.PTHREAD_MUTEX_RECURSIVE.html delete mode 100644 doc/libc/unix/constant.PTHREAD_RWLOCK_INITIALIZER.html delete mode 100644 doc/libc/unix/constant.PTHREAD_STACK_MIN.html delete mode 100644 doc/libc/unix/constant.Q_GETQUOTA.html delete mode 100644 doc/libc/unix/constant.Q_QUOTAOFF.html delete mode 100644 doc/libc/unix/constant.Q_QUOTAON.html delete mode 100644 doc/libc/unix/constant.Q_SETQUOTA.html delete mode 100644 doc/libc/unix/constant.Q_SYNC.html delete mode 100644 doc/libc/unix/constant.RADIXCHAR.html delete mode 100644 doc/libc/unix/constant.RAND_MAX.html delete mode 100644 doc/libc/unix/constant.RLIMIT_AS.html delete mode 100644 doc/libc/unix/constant.RLIMIT_CORE.html delete mode 100644 doc/libc/unix/constant.RLIMIT_CPU.html delete mode 100644 doc/libc/unix/constant.RLIMIT_DATA.html delete mode 100644 doc/libc/unix/constant.RLIMIT_FSIZE.html delete mode 100644 doc/libc/unix/constant.RLIMIT_MEMLOCK.html delete mode 100644 doc/libc/unix/constant.RLIMIT_NOFILE.html delete mode 100644 doc/libc/unix/constant.RLIMIT_NPROC.html delete mode 100644 doc/libc/unix/constant.RLIMIT_RSS.html delete mode 100644 doc/libc/unix/constant.RLIMIT_STACK.html delete mode 100644 doc/libc/unix/constant.RLIM_INFINITY.html delete mode 100644 doc/libc/unix/constant.RLIM_NLIMITS.html delete mode 100644 doc/libc/unix/constant.RTLD_DEFAULT.html delete mode 100644 doc/libc/unix/constant.RTLD_FIRST.html delete mode 100644 doc/libc/unix/constant.RTLD_GLOBAL.html delete mode 100644 doc/libc/unix/constant.RTLD_LAZY.html delete mode 100644 doc/libc/unix/constant.RTLD_LOCAL.html delete mode 100644 doc/libc/unix/constant.RTLD_NODELETE.html delete mode 100644 doc/libc/unix/constant.RTLD_NOLOAD.html delete mode 100644 doc/libc/unix/constant.RTLD_NOW.html delete mode 100644 doc/libc/unix/constant.RUSAGE_CHILDREN.html delete mode 100644 doc/libc/unix/constant.RUSAGE_SELF.html delete mode 100644 doc/libc/unix/constant.R_OK.html delete mode 100644 doc/libc/unix/constant.SA_NOCLDSTOP.html delete mode 100644 doc/libc/unix/constant.SA_NOCLDWAIT.html delete mode 100644 doc/libc/unix/constant.SA_NODEFER.html delete mode 100644 doc/libc/unix/constant.SA_ONSTACK.html delete mode 100644 doc/libc/unix/constant.SA_RESETHAND.html delete mode 100644 doc/libc/unix/constant.SA_RESTART.html delete mode 100644 doc/libc/unix/constant.SA_SIGINFO.html delete mode 100644 doc/libc/unix/constant.SEEK_CUR.html delete mode 100644 doc/libc/unix/constant.SEEK_END.html delete mode 100644 doc/libc/unix/constant.SEEK_SET.html delete mode 100644 doc/libc/unix/constant.SHUT_RD.html delete mode 100644 doc/libc/unix/constant.SHUT_RDWR.html delete mode 100644 doc/libc/unix/constant.SHUT_WR.html delete mode 100644 doc/libc/unix/constant.SIGABRT.html delete mode 100644 doc/libc/unix/constant.SIGALRM.html delete mode 100644 doc/libc/unix/constant.SIGBUS.html delete mode 100644 doc/libc/unix/constant.SIGCHLD.html delete mode 100644 doc/libc/unix/constant.SIGCONT.html delete mode 100644 doc/libc/unix/constant.SIGEMT.html delete mode 100644 doc/libc/unix/constant.SIGFPE.html delete mode 100644 doc/libc/unix/constant.SIGHUP.html delete mode 100644 doc/libc/unix/constant.SIGILL.html delete mode 100644 doc/libc/unix/constant.SIGINFO.html delete mode 100644 doc/libc/unix/constant.SIGINT.html delete mode 100644 doc/libc/unix/constant.SIGIO.html delete mode 100644 doc/libc/unix/constant.SIGIOT.html delete mode 100644 doc/libc/unix/constant.SIGKILL.html delete mode 100644 doc/libc/unix/constant.SIGPIPE.html delete mode 100644 doc/libc/unix/constant.SIGPROF.html delete mode 100644 doc/libc/unix/constant.SIGQUIT.html delete mode 100644 doc/libc/unix/constant.SIGSEGV.html delete mode 100644 doc/libc/unix/constant.SIGSTKSZ.html delete mode 100644 doc/libc/unix/constant.SIGSTOP.html delete mode 100644 doc/libc/unix/constant.SIGSYS.html delete mode 100644 doc/libc/unix/constant.SIGTERM.html delete mode 100644 doc/libc/unix/constant.SIGTRAP.html delete mode 100644 doc/libc/unix/constant.SIGTSTP.html delete mode 100644 doc/libc/unix/constant.SIGTTIN.html delete mode 100644 doc/libc/unix/constant.SIGTTOU.html delete mode 100644 doc/libc/unix/constant.SIGURG.html delete mode 100644 doc/libc/unix/constant.SIGUSR1.html delete mode 100644 doc/libc/unix/constant.SIGUSR2.html delete mode 100644 doc/libc/unix/constant.SIGVTALRM.html delete mode 100644 doc/libc/unix/constant.SIGWINCH.html delete mode 100644 doc/libc/unix/constant.SIGXCPU.html delete mode 100644 doc/libc/unix/constant.SIGXFSZ.html delete mode 100644 doc/libc/unix/constant.SIG_BLOCK.html delete mode 100644 doc/libc/unix/constant.SIG_DFL.html delete mode 100644 doc/libc/unix/constant.SIG_ERR.html delete mode 100644 doc/libc/unix/constant.SIG_IGN.html delete mode 100644 doc/libc/unix/constant.SIG_SETMASK.html delete mode 100644 doc/libc/unix/constant.SIG_UNBLOCK.html delete mode 100644 doc/libc/unix/constant.SOCK_DGRAM.html delete mode 100644 doc/libc/unix/constant.SOCK_RAW.html delete mode 100644 doc/libc/unix/constant.SOCK_STREAM.html delete mode 100644 doc/libc/unix/constant.SOL_SOCKET.html delete mode 100644 doc/libc/unix/constant.SO_ACCEPTCONN.html delete mode 100644 doc/libc/unix/constant.SO_BROADCAST.html delete mode 100644 doc/libc/unix/constant.SO_DEBUG.html delete mode 100644 doc/libc/unix/constant.SO_DONTROUTE.html delete mode 100644 doc/libc/unix/constant.SO_DONTTRUNC.html delete mode 100644 doc/libc/unix/constant.SO_ERROR.html delete mode 100644 doc/libc/unix/constant.SO_KEEPALIVE.html delete mode 100644 doc/libc/unix/constant.SO_LINGER.html delete mode 100644 doc/libc/unix/constant.SO_NKE.html delete mode 100644 doc/libc/unix/constant.SO_NOADDRERR.html delete mode 100644 doc/libc/unix/constant.SO_NOSIGPIPE.html delete mode 100644 doc/libc/unix/constant.SO_NREAD.html delete mode 100644 doc/libc/unix/constant.SO_NWRITE.html delete mode 100644 doc/libc/unix/constant.SO_OOBINLINE.html delete mode 100644 doc/libc/unix/constant.SO_RCVBUF.html delete mode 100644 doc/libc/unix/constant.SO_RCVLOWAT.html delete mode 100644 doc/libc/unix/constant.SO_RCVTIMEO.html delete mode 100644 doc/libc/unix/constant.SO_REUSEADDR.html delete mode 100644 doc/libc/unix/constant.SO_REUSEPORT.html delete mode 100644 doc/libc/unix/constant.SO_SNDBUF.html delete mode 100644 doc/libc/unix/constant.SO_SNDLOWAT.html delete mode 100644 doc/libc/unix/constant.SO_SNDTIMEO.html delete mode 100644 doc/libc/unix/constant.SO_TYPE.html delete mode 100644 doc/libc/unix/constant.SO_USELOOPBACK.html delete mode 100644 doc/libc/unix/constant.SO_WANTMORE.html delete mode 100644 doc/libc/unix/constant.SO_WANTOOBFLAG.html delete mode 100644 doc/libc/unix/constant.SS_DISABLE.html delete mode 100644 doc/libc/unix/constant.SS_ONSTACK.html delete mode 100644 doc/libc/unix/constant.STDERR_FILENO.html delete mode 100644 doc/libc/unix/constant.STDIN_FILENO.html delete mode 100644 doc/libc/unix/constant.STDOUT_FILENO.html delete mode 100644 doc/libc/unix/constant.ST_NOSUID.html delete mode 100644 doc/libc/unix/constant.ST_RDONLY.html delete mode 100644 doc/libc/unix/constant.S_IEXEC.html delete mode 100644 doc/libc/unix/constant.S_IFBLK.html delete mode 100644 doc/libc/unix/constant.S_IFCHR.html delete mode 100644 doc/libc/unix/constant.S_IFDIR.html delete mode 100644 doc/libc/unix/constant.S_IFIFO.html delete mode 100644 doc/libc/unix/constant.S_IFLNK.html delete mode 100644 doc/libc/unix/constant.S_IFMT.html delete mode 100644 doc/libc/unix/constant.S_IFREG.html delete mode 100644 doc/libc/unix/constant.S_IFSOCK.html delete mode 100644 doc/libc/unix/constant.S_IREAD.html delete mode 100644 doc/libc/unix/constant.S_IRGRP.html delete mode 100644 doc/libc/unix/constant.S_IROTH.html delete mode 100644 doc/libc/unix/constant.S_IRUSR.html delete mode 100644 doc/libc/unix/constant.S_IRWXG.html delete mode 100644 doc/libc/unix/constant.S_IRWXO.html delete mode 100644 doc/libc/unix/constant.S_IRWXU.html delete mode 100644 doc/libc/unix/constant.S_ISGID.html delete mode 100644 doc/libc/unix/constant.S_ISUID.html delete mode 100644 doc/libc/unix/constant.S_ISVTX.html delete mode 100644 doc/libc/unix/constant.S_IWGRP.html delete mode 100644 doc/libc/unix/constant.S_IWOTH.html delete mode 100644 doc/libc/unix/constant.S_IWRITE.html delete mode 100644 doc/libc/unix/constant.S_IWUSR.html delete mode 100644 doc/libc/unix/constant.S_IXGRP.html delete mode 100644 doc/libc/unix/constant.S_IXOTH.html delete mode 100644 doc/libc/unix/constant.S_IXUSR.html delete mode 100644 doc/libc/unix/constant.TAB0.html delete mode 100644 doc/libc/unix/constant.TAB1.html delete mode 100644 doc/libc/unix/constant.TAB2.html delete mode 100644 doc/libc/unix/constant.TAB3.html delete mode 100644 doc/libc/unix/constant.TCIFLUSH.html delete mode 100644 doc/libc/unix/constant.TCIOFF.html delete mode 100644 doc/libc/unix/constant.TCIOFLUSH.html delete mode 100644 doc/libc/unix/constant.TCION.html delete mode 100644 doc/libc/unix/constant.TCOFLUSH.html delete mode 100644 doc/libc/unix/constant.TCOOFF.html delete mode 100644 doc/libc/unix/constant.TCOON.html delete mode 100644 doc/libc/unix/constant.TCP_KEEPALIVE.html delete mode 100644 doc/libc/unix/constant.TCP_NODELAY.html delete mode 100644 doc/libc/unix/constant.TCSADRAIN.html delete mode 100644 doc/libc/unix/constant.TCSAFLUSH.html delete mode 100644 doc/libc/unix/constant.TCSANOW.html delete mode 100644 doc/libc/unix/constant.THOUSEP.html delete mode 100644 doc/libc/unix/constant.TIOCCBRK.html delete mode 100644 doc/libc/unix/constant.TIOCCDTR.html delete mode 100644 doc/libc/unix/constant.TIOCCONS.html delete mode 100644 doc/libc/unix/constant.TIOCDCDTIMESTAMP.html delete mode 100644 doc/libc/unix/constant.TIOCDRAIN.html delete mode 100644 doc/libc/unix/constant.TIOCDSIMICROCODE.html delete mode 100644 doc/libc/unix/constant.TIOCEXCL.html delete mode 100644 doc/libc/unix/constant.TIOCEXT.html delete mode 100644 doc/libc/unix/constant.TIOCFLUSH.html delete mode 100644 doc/libc/unix/constant.TIOCGDRAINWAIT.html delete mode 100644 doc/libc/unix/constant.TIOCGETD.html delete mode 100644 doc/libc/unix/constant.TIOCGPGRP.html delete mode 100644 doc/libc/unix/constant.TIOCGWINSZ.html delete mode 100644 doc/libc/unix/constant.TIOCIXOFF.html delete mode 100644 doc/libc/unix/constant.TIOCIXON.html delete mode 100644 doc/libc/unix/constant.TIOCMBIC.html delete mode 100644 doc/libc/unix/constant.TIOCMBIS.html delete mode 100644 doc/libc/unix/constant.TIOCMGDTRWAIT.html delete mode 100644 doc/libc/unix/constant.TIOCMGET.html delete mode 100644 doc/libc/unix/constant.TIOCMODG.html delete mode 100644 doc/libc/unix/constant.TIOCMODS.html delete mode 100644 doc/libc/unix/constant.TIOCMSDTRWAIT.html delete mode 100644 doc/libc/unix/constant.TIOCMSET.html delete mode 100644 doc/libc/unix/constant.TIOCM_CAR.html delete mode 100644 doc/libc/unix/constant.TIOCM_CD.html delete mode 100644 doc/libc/unix/constant.TIOCM_CTS.html delete mode 100644 doc/libc/unix/constant.TIOCM_DSR.html delete mode 100644 doc/libc/unix/constant.TIOCM_DTR.html delete mode 100644 doc/libc/unix/constant.TIOCM_LE.html delete mode 100644 doc/libc/unix/constant.TIOCM_RI.html delete mode 100644 doc/libc/unix/constant.TIOCM_RNG.html delete mode 100644 doc/libc/unix/constant.TIOCM_RTS.html delete mode 100644 doc/libc/unix/constant.TIOCM_SR.html delete mode 100644 doc/libc/unix/constant.TIOCM_ST.html delete mode 100644 doc/libc/unix/constant.TIOCNOTTY.html delete mode 100644 doc/libc/unix/constant.TIOCNXCL.html delete mode 100644 doc/libc/unix/constant.TIOCOUTQ.html delete mode 100644 doc/libc/unix/constant.TIOCPKT.html delete mode 100644 doc/libc/unix/constant.TIOCPKT_DATA.html delete mode 100644 doc/libc/unix/constant.TIOCPKT_DOSTOP.html delete mode 100644 doc/libc/unix/constant.TIOCPKT_FLUSHREAD.html delete mode 100644 doc/libc/unix/constant.TIOCPKT_FLUSHWRITE.html delete mode 100644 doc/libc/unix/constant.TIOCPKT_IOCTL.html delete mode 100644 doc/libc/unix/constant.TIOCPKT_NOSTOP.html delete mode 100644 doc/libc/unix/constant.TIOCPKT_START.html delete mode 100644 doc/libc/unix/constant.TIOCPKT_STOP.html delete mode 100644 doc/libc/unix/constant.TIOCPTYGNAME.html delete mode 100644 doc/libc/unix/constant.TIOCPTYGRANT.html delete mode 100644 doc/libc/unix/constant.TIOCPTYUNLK.html delete mode 100644 doc/libc/unix/constant.TIOCREMOTE.html delete mode 100644 doc/libc/unix/constant.TIOCSBRK.html delete mode 100644 doc/libc/unix/constant.TIOCSCONS.html delete mode 100644 doc/libc/unix/constant.TIOCSCTTY.html delete mode 100644 doc/libc/unix/constant.TIOCSDRAINWAIT.html delete mode 100644 doc/libc/unix/constant.TIOCSDTR.html delete mode 100644 doc/libc/unix/constant.TIOCSETD.html delete mode 100644 doc/libc/unix/constant.TIOCSIG.html delete mode 100644 doc/libc/unix/constant.TIOCSPGRP.html delete mode 100644 doc/libc/unix/constant.TIOCSTART.html delete mode 100644 doc/libc/unix/constant.TIOCSTAT.html delete mode 100644 doc/libc/unix/constant.TIOCSTI.html delete mode 100644 doc/libc/unix/constant.TIOCSTOP.html delete mode 100644 doc/libc/unix/constant.TIOCSWINSZ.html delete mode 100644 doc/libc/unix/constant.TIOCTIMESTAMP.html delete mode 100644 doc/libc/unix/constant.TIOCUCNTL.html delete mode 100644 doc/libc/unix/constant.TMP_MAX.html delete mode 100644 doc/libc/unix/constant.TOSTOP.html delete mode 100644 doc/libc/unix/constant.T_FMT.html delete mode 100644 doc/libc/unix/constant.T_FMT_AMPM.html delete mode 100644 doc/libc/unix/constant.USRQUOTA.html delete mode 100644 doc/libc/unix/constant.VDISCARD.html delete mode 100644 doc/libc/unix/constant.VEOF.html delete mode 100644 doc/libc/unix/constant.VEOL.html delete mode 100644 doc/libc/unix/constant.VEOL2.html delete mode 100644 doc/libc/unix/constant.VERASE.html delete mode 100644 doc/libc/unix/constant.VINTR.html delete mode 100644 doc/libc/unix/constant.VKILL.html delete mode 100644 doc/libc/unix/constant.VLNEXT.html delete mode 100644 doc/libc/unix/constant.VMIN.html delete mode 100644 doc/libc/unix/constant.VQUIT.html delete mode 100644 doc/libc/unix/constant.VREPRINT.html delete mode 100644 doc/libc/unix/constant.VSTART.html delete mode 100644 doc/libc/unix/constant.VSTOP.html delete mode 100644 doc/libc/unix/constant.VSUSP.html delete mode 100644 doc/libc/unix/constant.VT0.html delete mode 100644 doc/libc/unix/constant.VT1.html delete mode 100644 doc/libc/unix/constant.VTIME.html delete mode 100644 doc/libc/unix/constant.VWERASE.html delete mode 100644 doc/libc/unix/constant.WNOHANG.html delete mode 100644 doc/libc/unix/constant.W_OK.html delete mode 100644 doc/libc/unix/constant.X_OK.html delete mode 100644 doc/libc/unix/constant.YESEXPR.html delete mode 100644 doc/libc/unix/constant.YESSTR.html delete mode 100644 doc/libc/unix/constant._IOFBF.html delete mode 100644 doc/libc/unix/constant._IOLBF.html delete mode 100644 doc/libc/unix/constant._IONBF.html delete mode 100644 doc/libc/unix/constant._PC_NAME_MAX.html delete mode 100644 doc/libc/unix/constant._PTHREAD_COND_SIG_init.html delete mode 100644 doc/libc/unix/constant._PTHREAD_MUTEX_SIG_init.html delete mode 100644 doc/libc/unix/constant._PTHREAD_RWLOCK_SIG_init.html delete mode 100644 doc/libc/unix/constant._RLIMIT_POSIX_FLAG.html delete mode 100644 doc/libc/unix/constant._SC_2_CHAR_TERM.html delete mode 100644 doc/libc/unix/constant._SC_2_C_BIND.html delete mode 100644 doc/libc/unix/constant._SC_2_C_DEV.html delete mode 100644 doc/libc/unix/constant._SC_2_FORT_DEV.html delete mode 100644 doc/libc/unix/constant._SC_2_FORT_RUN.html delete mode 100644 doc/libc/unix/constant._SC_2_LOCALEDEF.html delete mode 100644 doc/libc/unix/constant._SC_2_PBS.html delete mode 100644 doc/libc/unix/constant._SC_2_PBS_ACCOUNTING.html delete mode 100644 doc/libc/unix/constant._SC_2_PBS_CHECKPOINT.html delete mode 100644 doc/libc/unix/constant._SC_2_PBS_LOCATE.html delete mode 100644 doc/libc/unix/constant._SC_2_PBS_MESSAGE.html delete mode 100644 doc/libc/unix/constant._SC_2_PBS_TRACK.html delete mode 100644 doc/libc/unix/constant._SC_2_SW_DEV.html delete mode 100644 doc/libc/unix/constant._SC_2_UPE.html delete mode 100644 doc/libc/unix/constant._SC_2_VERSION.html delete mode 100644 doc/libc/unix/constant._SC_ADVISORY_INFO.html delete mode 100644 doc/libc/unix/constant._SC_AIO_LISTIO_MAX.html delete mode 100644 doc/libc/unix/constant._SC_AIO_MAX.html delete mode 100644 doc/libc/unix/constant._SC_AIO_PRIO_DELTA_MAX.html delete mode 100644 doc/libc/unix/constant._SC_ARG_MAX.html delete mode 100644 doc/libc/unix/constant._SC_ASYNCHRONOUS_IO.html delete mode 100644 doc/libc/unix/constant._SC_ATEXIT_MAX.html delete mode 100644 doc/libc/unix/constant._SC_BARRIERS.html delete mode 100644 doc/libc/unix/constant._SC_BC_BASE_MAX.html delete mode 100644 doc/libc/unix/constant._SC_BC_DIM_MAX.html delete mode 100644 doc/libc/unix/constant._SC_BC_SCALE_MAX.html delete mode 100644 doc/libc/unix/constant._SC_BC_STRING_MAX.html delete mode 100644 doc/libc/unix/constant._SC_CHILD_MAX.html delete mode 100644 doc/libc/unix/constant._SC_CLK_TCK.html delete mode 100644 doc/libc/unix/constant._SC_CLOCK_SELECTION.html delete mode 100644 doc/libc/unix/constant._SC_COLL_WEIGHTS_MAX.html delete mode 100644 doc/libc/unix/constant._SC_CPUTIME.html delete mode 100644 doc/libc/unix/constant._SC_DELAYTIMER_MAX.html delete mode 100644 doc/libc/unix/constant._SC_EXPR_NEST_MAX.html delete mode 100644 doc/libc/unix/constant._SC_FILE_LOCKING.html delete mode 100644 doc/libc/unix/constant._SC_FSYNC.html delete mode 100644 doc/libc/unix/constant._SC_GETGR_R_SIZE_MAX.html delete mode 100644 doc/libc/unix/constant._SC_GETPW_R_SIZE_MAX.html delete mode 100644 doc/libc/unix/constant._SC_HOST_NAME_MAX.html delete mode 100644 doc/libc/unix/constant._SC_IOV_MAX.html delete mode 100644 doc/libc/unix/constant._SC_IPV6.html delete mode 100644 doc/libc/unix/constant._SC_JOB_CONTROL.html delete mode 100644 doc/libc/unix/constant._SC_LINE_MAX.html delete mode 100644 doc/libc/unix/constant._SC_LOGIN_NAME_MAX.html delete mode 100644 doc/libc/unix/constant._SC_MAPPED_FILES.html delete mode 100644 doc/libc/unix/constant._SC_MEMLOCK.html delete mode 100644 doc/libc/unix/constant._SC_MEMLOCK_RANGE.html delete mode 100644 doc/libc/unix/constant._SC_MEMORY_PROTECTION.html delete mode 100644 doc/libc/unix/constant._SC_MESSAGE_PASSING.html delete mode 100644 doc/libc/unix/constant._SC_MONOTONIC_CLOCK.html delete mode 100644 doc/libc/unix/constant._SC_MQ_OPEN_MAX.html delete mode 100644 doc/libc/unix/constant._SC_MQ_PRIO_MAX.html delete mode 100644 doc/libc/unix/constant._SC_NGROUPS_MAX.html delete mode 100644 doc/libc/unix/constant._SC_NPROCESSORS_CONF.html delete mode 100644 doc/libc/unix/constant._SC_NPROCESSORS_ONLN.html delete mode 100644 doc/libc/unix/constant._SC_OPEN_MAX.html delete mode 100644 doc/libc/unix/constant._SC_PAGESIZE.html delete mode 100644 doc/libc/unix/constant._SC_PAGE_SIZE.html delete mode 100644 doc/libc/unix/constant._SC_PASS_MAX.html delete mode 100644 doc/libc/unix/constant._SC_PRIORITIZED_IO.html delete mode 100644 doc/libc/unix/constant._SC_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/unix/constant._SC_RAW_SOCKETS.html delete mode 100644 doc/libc/unix/constant._SC_READER_WRITER_LOCKS.html delete mode 100644 doc/libc/unix/constant._SC_REALTIME_SIGNALS.html delete mode 100644 doc/libc/unix/constant._SC_REGEXP.html delete mode 100644 doc/libc/unix/constant._SC_RE_DUP_MAX.html delete mode 100644 doc/libc/unix/constant._SC_RTSIG_MAX.html delete mode 100644 doc/libc/unix/constant._SC_SAVED_IDS.html delete mode 100644 doc/libc/unix/constant._SC_SEMAPHORES.html delete mode 100644 doc/libc/unix/constant._SC_SEM_NSEMS_MAX.html delete mode 100644 doc/libc/unix/constant._SC_SEM_VALUE_MAX.html delete mode 100644 doc/libc/unix/constant._SC_SHARED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/unix/constant._SC_SHELL.html delete mode 100644 doc/libc/unix/constant._SC_SIGQUEUE_MAX.html delete mode 100644 doc/libc/unix/constant._SC_SPAWN.html delete mode 100644 doc/libc/unix/constant._SC_SPIN_LOCKS.html delete mode 100644 doc/libc/unix/constant._SC_SPORADIC_SERVER.html delete mode 100644 doc/libc/unix/constant._SC_SS_REPL_MAX.html delete mode 100644 doc/libc/unix/constant._SC_STREAM_MAX.html delete mode 100644 doc/libc/unix/constant._SC_SYMLOOP_MAX.html delete mode 100644 doc/libc/unix/constant._SC_SYNCHRONIZED_IO.html delete mode 100644 doc/libc/unix/constant._SC_THREADS.html delete mode 100644 doc/libc/unix/constant._SC_THREAD_ATTR_STACKADDR.html delete mode 100644 doc/libc/unix/constant._SC_THREAD_ATTR_STACKSIZE.html delete mode 100644 doc/libc/unix/constant._SC_THREAD_CPUTIME.html delete mode 100644 doc/libc/unix/constant._SC_THREAD_DESTRUCTOR_ITERATIONS.html delete mode 100644 doc/libc/unix/constant._SC_THREAD_KEYS_MAX.html delete mode 100644 doc/libc/unix/constant._SC_THREAD_PRIORITY_SCHEDULING.html delete mode 100644 doc/libc/unix/constant._SC_THREAD_PRIO_INHERIT.html delete mode 100644 doc/libc/unix/constant._SC_THREAD_PRIO_PROTECT.html delete mode 100644 doc/libc/unix/constant._SC_THREAD_PROCESS_SHARED.html delete mode 100644 doc/libc/unix/constant._SC_THREAD_SAFE_FUNCTIONS.html delete mode 100644 doc/libc/unix/constant._SC_THREAD_SPORADIC_SERVER.html delete mode 100644 doc/libc/unix/constant._SC_THREAD_STACK_MIN.html delete mode 100644 doc/libc/unix/constant._SC_THREAD_THREADS_MAX.html delete mode 100644 doc/libc/unix/constant._SC_TIMEOUTS.html delete mode 100644 doc/libc/unix/constant._SC_TIMERS.html delete mode 100644 doc/libc/unix/constant._SC_TIMER_MAX.html delete mode 100644 doc/libc/unix/constant._SC_TRACE.html delete mode 100644 doc/libc/unix/constant._SC_TRACE_EVENT_FILTER.html delete mode 100644 doc/libc/unix/constant._SC_TRACE_EVENT_NAME_MAX.html delete mode 100644 doc/libc/unix/constant._SC_TRACE_INHERIT.html delete mode 100644 doc/libc/unix/constant._SC_TRACE_LOG.html delete mode 100644 doc/libc/unix/constant._SC_TRACE_NAME_MAX.html delete mode 100644 doc/libc/unix/constant._SC_TRACE_SYS_MAX.html delete mode 100644 doc/libc/unix/constant._SC_TRACE_USER_EVENT_MAX.html delete mode 100644 doc/libc/unix/constant._SC_TTY_NAME_MAX.html delete mode 100644 doc/libc/unix/constant._SC_TYPED_MEMORY_OBJECTS.html delete mode 100644 doc/libc/unix/constant._SC_TZNAME_MAX.html delete mode 100644 doc/libc/unix/constant._SC_V6_ILP32_OFF32.html delete mode 100644 doc/libc/unix/constant._SC_V6_ILP32_OFFBIG.html delete mode 100644 doc/libc/unix/constant._SC_V6_LP64_OFF64.html delete mode 100644 doc/libc/unix/constant._SC_V6_LPBIG_OFFBIG.html delete mode 100644 doc/libc/unix/constant._SC_VERSION.html delete mode 100644 doc/libc/unix/constant._SC_XBS5_ILP32_OFF32.html delete mode 100644 doc/libc/unix/constant._SC_XBS5_ILP32_OFFBIG.html delete mode 100644 doc/libc/unix/constant._SC_XBS5_LP64_OFF64.html delete mode 100644 doc/libc/unix/constant._SC_XBS5_LPBIG_OFFBIG.html delete mode 100644 doc/libc/unix/constant._SC_XOPEN_CRYPT.html delete mode 100644 doc/libc/unix/constant._SC_XOPEN_ENH_I18N.html delete mode 100644 doc/libc/unix/constant._SC_XOPEN_LEGACY.html delete mode 100644 doc/libc/unix/constant._SC_XOPEN_REALTIME.html delete mode 100644 doc/libc/unix/constant._SC_XOPEN_REALTIME_THREADS.html delete mode 100644 doc/libc/unix/constant._SC_XOPEN_SHM.html delete mode 100644 doc/libc/unix/constant._SC_XOPEN_STREAMS.html delete mode 100644 doc/libc/unix/constant._SC_XOPEN_UNIX.html delete mode 100644 doc/libc/unix/constant._SC_XOPEN_VERSION.html delete mode 100644 doc/libc/unix/constant._SC_XOPEN_XCU_VERSION.html delete mode 100644 doc/libc/unix/constant._WSTOPPED.html delete mode 100644 doc/libc/unix/constant.__PTHREAD_COND_SIZE__.html delete mode 100644 doc/libc/unix/constant.__PTHREAD_MUTEX_SIZE__.html delete mode 100644 doc/libc/unix/constant.__PTHREAD_RWLOCK_SIZE__.html delete mode 100644 doc/libc/unix/enum.DIR.html delete mode 100644 doc/libc/unix/enum.locale_t.html delete mode 100644 doc/libc/unix/enum.timezone.html delete mode 100644 doc/libc/unix/fn.FD_CLR.html delete mode 100644 doc/libc/unix/fn.FD_ISSET.html delete mode 100644 doc/libc/unix/fn.FD_SET.html delete mode 100644 doc/libc/unix/fn.FD_ZERO.html delete mode 100644 doc/libc/unix/fn.WCOREDUMP.html delete mode 100644 doc/libc/unix/fn.WEXITSTATUS.html delete mode 100644 doc/libc/unix/fn.WIFCONTINUED.html delete mode 100644 doc/libc/unix/fn.WIFEXITED.html delete mode 100644 doc/libc/unix/fn.WIFSIGNALED.html delete mode 100644 doc/libc/unix/fn.WIFSTOPPED.html delete mode 100644 doc/libc/unix/fn.WSTOPSIG.html delete mode 100644 doc/libc/unix/fn.WTERMSIG.html delete mode 100644 doc/libc/unix/fn._WSTATUS.html delete mode 100644 doc/libc/unix/fn.__error.html delete mode 100644 doc/libc/unix/fn.accept.html delete mode 100644 doc/libc/unix/fn.access.html delete mode 100644 doc/libc/unix/fn.alarm.html delete mode 100644 doc/libc/unix/fn.backtrace.html delete mode 100644 doc/libc/unix/fn.bind.html delete mode 100644 doc/libc/unix/fn.cfgetispeed.html delete mode 100644 doc/libc/unix/fn.cfgetospeed.html delete mode 100644 doc/libc/unix/fn.cfsetispeed.html delete mode 100644 doc/libc/unix/fn.cfsetospeed.html delete mode 100644 doc/libc/unix/fn.chdir.html delete mode 100644 doc/libc/unix/fn.chmod.html delete mode 100644 doc/libc/unix/fn.chown.html delete mode 100644 doc/libc/unix/fn.chroot.html delete mode 100644 doc/libc/unix/fn.close.html delete mode 100644 doc/libc/unix/fn.closedir.html delete mode 100644 doc/libc/unix/fn.connect.html delete mode 100644 doc/libc/unix/fn.creat.html delete mode 100644 doc/libc/unix/fn.daemon.html delete mode 100644 doc/libc/unix/fn.dladdr.html delete mode 100644 doc/libc/unix/fn.dlclose.html delete mode 100644 doc/libc/unix/fn.dlerror.html delete mode 100644 doc/libc/unix/fn.dlopen.html delete mode 100644 doc/libc/unix/fn.dlsym.html delete mode 100644 doc/libc/unix/fn.dup.html delete mode 100644 doc/libc/unix/fn.dup2.html delete mode 100644 doc/libc/unix/fn.duplocale.html delete mode 100644 doc/libc/unix/fn.execv.html delete mode 100644 doc/libc/unix/fn.execve.html delete mode 100644 doc/libc/unix/fn.execvp.html delete mode 100644 doc/libc/unix/fn.fchmod.html delete mode 100644 doc/libc/unix/fn.fcntl.html delete mode 100644 doc/libc/unix/fn.fdopen.html delete mode 100644 doc/libc/unix/fn.fileno.html delete mode 100644 doc/libc/unix/fn.flock.html delete mode 100644 doc/libc/unix/fn.fork.html delete mode 100644 doc/libc/unix/fn.forkpty.html delete mode 100644 doc/libc/unix/fn.fpathconf.html delete mode 100644 doc/libc/unix/fn.fprintf.html delete mode 100644 doc/libc/unix/fn.freeaddrinfo.html delete mode 100644 doc/libc/unix/fn.freeifaddrs.html delete mode 100644 doc/libc/unix/fn.freelocale.html delete mode 100644 doc/libc/unix/fn.fscanf.html delete mode 100644 doc/libc/unix/fn.fseeko.html delete mode 100644 doc/libc/unix/fn.fstat.html delete mode 100644 doc/libc/unix/fn.fstatfs.html delete mode 100644 doc/libc/unix/fn.fstatvfs.html delete mode 100644 doc/libc/unix/fn.fsync.html delete mode 100644 doc/libc/unix/fn.ftello.html delete mode 100644 doc/libc/unix/fn.ftruncate.html delete mode 100644 doc/libc/unix/fn.futimes.html delete mode 100644 doc/libc/unix/fn.gai_strerror.html delete mode 100644 doc/libc/unix/fn.getaddrinfo.html delete mode 100644 doc/libc/unix/fn.getcwd.html delete mode 100644 doc/libc/unix/fn.getdtablesize.html delete mode 100644 doc/libc/unix/fn.getegid.html delete mode 100644 doc/libc/unix/fn.geteuid.html delete mode 100644 doc/libc/unix/fn.getgid.html delete mode 100644 doc/libc/unix/fn.getgroups.html delete mode 100644 doc/libc/unix/fn.gethostname.html delete mode 100644 doc/libc/unix/fn.getifaddrs.html delete mode 100644 doc/libc/unix/fn.getlogin.html delete mode 100644 doc/libc/unix/fn.getnameinfo.html delete mode 100644 doc/libc/unix/fn.getopt.html delete mode 100644 doc/libc/unix/fn.getpeername.html delete mode 100644 doc/libc/unix/fn.getpgrp.html delete mode 100644 doc/libc/unix/fn.getpid.html delete mode 100644 doc/libc/unix/fn.getppid.html delete mode 100644 doc/libc/unix/fn.getpwuid_r.html delete mode 100644 doc/libc/unix/fn.getrlimit.html delete mode 100644 doc/libc/unix/fn.getrusage.html delete mode 100644 doc/libc/unix/fn.getsid.html delete mode 100644 doc/libc/unix/fn.getsockname.html delete mode 100644 doc/libc/unix/fn.getsockopt.html delete mode 100644 doc/libc/unix/fn.gettimeofday.html delete mode 100644 doc/libc/unix/fn.getuid.html delete mode 100644 doc/libc/unix/fn.glob.html delete mode 100644 doc/libc/unix/fn.globfree.html delete mode 100644 doc/libc/unix/fn.gmtime_r.html delete mode 100644 doc/libc/unix/fn.if_indextoname.html delete mode 100644 doc/libc/unix/fn.if_nametoindex.html delete mode 100644 doc/libc/unix/fn.ioctl.html delete mode 100644 doc/libc/unix/fn.isatty.html delete mode 100644 doc/libc/unix/fn.kevent.html delete mode 100644 doc/libc/unix/fn.kevent64.html delete mode 100644 doc/libc/unix/fn.kill.html delete mode 100644 doc/libc/unix/fn.kqueue.html delete mode 100644 doc/libc/unix/fn.link.html delete mode 100644 doc/libc/unix/fn.listen.html delete mode 100644 doc/libc/unix/fn.localeconv.html delete mode 100644 doc/libc/unix/fn.localeconv_l.html delete mode 100644 doc/libc/unix/fn.localtime_r.html delete mode 100644 doc/libc/unix/fn.lseek.html delete mode 100644 doc/libc/unix/fn.lstat.html delete mode 100644 doc/libc/unix/fn.mach_absolute_time.html delete mode 100644 doc/libc/unix/fn.mach_timebase_info.html delete mode 100644 doc/libc/unix/fn.madvise.html delete mode 100644 doc/libc/unix/fn.mincore.html delete mode 100644 doc/libc/unix/fn.mkdir.html delete mode 100644 doc/libc/unix/fn.mkdtemp.html delete mode 100644 doc/libc/unix/fn.mkfifo.html delete mode 100644 doc/libc/unix/fn.mknod.html delete mode 100644 doc/libc/unix/fn.mkstemp.html delete mode 100644 doc/libc/unix/fn.mkstemps.html delete mode 100644 doc/libc/unix/fn.mktime.html delete mode 100644 doc/libc/unix/fn.mlock.html delete mode 100644 doc/libc/unix/fn.mlockall.html delete mode 100644 doc/libc/unix/fn.mmap.html delete mode 100644 doc/libc/unix/fn.mount.html delete mode 100644 doc/libc/unix/fn.mprotect.html delete mode 100644 doc/libc/unix/fn.msync.html delete mode 100644 doc/libc/unix/fn.munlock.html delete mode 100644 doc/libc/unix/fn.munlockall.html delete mode 100644 doc/libc/unix/fn.munmap.html delete mode 100644 doc/libc/unix/fn.nanosleep.html delete mode 100644 doc/libc/unix/fn.newlocale.html delete mode 100644 doc/libc/unix/fn.nl_langinfo.html delete mode 100644 doc/libc/unix/fn.open.html delete mode 100644 doc/libc/unix/fn.opendir.html delete mode 100644 doc/libc/unix/fn.openpty.html delete mode 100644 doc/libc/unix/fn.pathconf.html delete mode 100644 doc/libc/unix/fn.pause.html delete mode 100644 doc/libc/unix/fn.pclose.html delete mode 100644 doc/libc/unix/fn.pipe.html delete mode 100644 doc/libc/unix/fn.poll.html delete mode 100644 doc/libc/unix/fn.popen.html delete mode 100644 doc/libc/unix/fn.posix_madvise.html delete mode 100644 doc/libc/unix/fn.posix_memalign.html delete mode 100644 doc/libc/unix/fn.pread.html delete mode 100644 doc/libc/unix/fn.printf.html delete mode 100644 doc/libc/unix/fn.pselect.html delete mode 100644 doc/libc/unix/fn.pthread_attr_destroy.html delete mode 100644 doc/libc/unix/fn.pthread_attr_init.html delete mode 100644 doc/libc/unix/fn.pthread_attr_setdetachstate.html delete mode 100644 doc/libc/unix/fn.pthread_attr_setstacksize.html delete mode 100644 doc/libc/unix/fn.pthread_cond_broadcast.html delete mode 100644 doc/libc/unix/fn.pthread_cond_destroy.html delete mode 100644 doc/libc/unix/fn.pthread_cond_signal.html delete mode 100644 doc/libc/unix/fn.pthread_cond_timedwait.html delete mode 100644 doc/libc/unix/fn.pthread_cond_wait.html delete mode 100644 doc/libc/unix/fn.pthread_create.html delete mode 100644 doc/libc/unix/fn.pthread_detach.html delete mode 100644 doc/libc/unix/fn.pthread_get_stackaddr_np.html delete mode 100644 doc/libc/unix/fn.pthread_get_stacksize_np.html delete mode 100644 doc/libc/unix/fn.pthread_getspecific.html delete mode 100644 doc/libc/unix/fn.pthread_join.html delete mode 100644 doc/libc/unix/fn.pthread_key_create.html delete mode 100644 doc/libc/unix/fn.pthread_key_delete.html delete mode 100644 doc/libc/unix/fn.pthread_kill.html delete mode 100644 doc/libc/unix/fn.pthread_mutex_destroy.html delete mode 100644 doc/libc/unix/fn.pthread_mutex_init.html delete mode 100644 doc/libc/unix/fn.pthread_mutex_lock.html delete mode 100644 doc/libc/unix/fn.pthread_mutex_trylock.html delete mode 100644 doc/libc/unix/fn.pthread_mutex_unlock.html delete mode 100644 doc/libc/unix/fn.pthread_mutexattr_destroy.html delete mode 100644 doc/libc/unix/fn.pthread_mutexattr_init.html delete mode 100644 doc/libc/unix/fn.pthread_mutexattr_settype.html delete mode 100644 doc/libc/unix/fn.pthread_rwlock_destroy.html delete mode 100644 doc/libc/unix/fn.pthread_rwlock_rdlock.html delete mode 100644 doc/libc/unix/fn.pthread_rwlock_tryrdlock.html delete mode 100644 doc/libc/unix/fn.pthread_rwlock_trywrlock.html delete mode 100644 doc/libc/unix/fn.pthread_rwlock_unlock.html delete mode 100644 doc/libc/unix/fn.pthread_rwlock_wrlock.html delete mode 100644 doc/libc/unix/fn.pthread_self.html delete mode 100644 doc/libc/unix/fn.pthread_setname_np.html delete mode 100644 doc/libc/unix/fn.pthread_setspecific.html delete mode 100644 doc/libc/unix/fn.pthread_sigmask.html delete mode 100644 doc/libc/unix/fn.ptrace.html delete mode 100644 doc/libc/unix/fn.putenv.html delete mode 100644 doc/libc/unix/fn.pwrite.html delete mode 100644 doc/libc/unix/fn.querylocale.html delete mode 100644 doc/libc/unix/fn.quotactl.html delete mode 100644 doc/libc/unix/fn.raise.html delete mode 100644 doc/libc/unix/fn.read.html delete mode 100644 doc/libc/unix/fn.readdir_r.html delete mode 100644 doc/libc/unix/fn.readlink.html delete mode 100644 doc/libc/unix/fn.readv.html delete mode 100644 doc/libc/unix/fn.realpath.html delete mode 100644 doc/libc/unix/fn.recv.html delete mode 100644 doc/libc/unix/fn.recvfrom.html delete mode 100644 doc/libc/unix/fn.recvmsg.html delete mode 100644 doc/libc/unix/fn.rewinddir.html delete mode 100644 doc/libc/unix/fn.rmdir.html delete mode 100644 doc/libc/unix/fn.scanf.html delete mode 100644 doc/libc/unix/fn.sched_yield.html delete mode 100644 doc/libc/unix/fn.seekdir.html delete mode 100644 doc/libc/unix/fn.select.html delete mode 100644 doc/libc/unix/fn.send.html delete mode 100644 doc/libc/unix/fn.sendfile.html delete mode 100644 doc/libc/unix/fn.sendmsg.html delete mode 100644 doc/libc/unix/fn.sendto.html delete mode 100644 doc/libc/unix/fn.setenv.html delete mode 100644 doc/libc/unix/fn.setgid.html delete mode 100644 doc/libc/unix/fn.setgroups.html delete mode 100644 doc/libc/unix/fn.sethostname.html delete mode 100644 doc/libc/unix/fn.setlocale.html delete mode 100644 doc/libc/unix/fn.setpgid.html delete mode 100644 doc/libc/unix/fn.setrlimit.html delete mode 100644 doc/libc/unix/fn.setsid.html delete mode 100644 doc/libc/unix/fn.setsockopt.html delete mode 100644 doc/libc/unix/fn.setuid.html delete mode 100644 doc/libc/unix/fn.shm_open.html delete mode 100644 doc/libc/unix/fn.shm_unlink.html delete mode 100644 doc/libc/unix/fn.shutdown.html delete mode 100644 doc/libc/unix/fn.sigaction.html delete mode 100644 doc/libc/unix/fn.sigaddset.html delete mode 100644 doc/libc/unix/fn.sigaltstack.html delete mode 100644 doc/libc/unix/fn.sigdelset.html delete mode 100644 doc/libc/unix/fn.sigemptyset.html delete mode 100644 doc/libc/unix/fn.sigfillset.html delete mode 100644 doc/libc/unix/fn.sigismember.html delete mode 100644 doc/libc/unix/fn.signal.html delete mode 100644 doc/libc/unix/fn.sigwait.html delete mode 100644 doc/libc/unix/fn.sleep.html delete mode 100644 doc/libc/unix/fn.snprintf.html delete mode 100644 doc/libc/unix/fn.socket.html delete mode 100644 doc/libc/unix/fn.socketpair.html delete mode 100644 doc/libc/unix/fn.sprintf.html delete mode 100644 doc/libc/unix/fn.sscanf.html delete mode 100644 doc/libc/unix/fn.stat.html delete mode 100644 doc/libc/unix/fn.statfs.html delete mode 100644 doc/libc/unix/fn.statvfs.html delete mode 100644 doc/libc/unix/fn.strerror_r.html delete mode 100644 doc/libc/unix/fn.symlink.html delete mode 100644 doc/libc/unix/fn.syscall.html delete mode 100644 doc/libc/unix/fn.sysconf.html delete mode 100644 doc/libc/unix/fn.sysctl.html delete mode 100644 doc/libc/unix/fn.sysctlbyname.html delete mode 100644 doc/libc/unix/fn.sysctlnametomib.html delete mode 100644 doc/libc/unix/fn.tcdrain.html delete mode 100644 doc/libc/unix/fn.tcflow.html delete mode 100644 doc/libc/unix/fn.tcflush.html delete mode 100644 doc/libc/unix/fn.tcgetattr.html delete mode 100644 doc/libc/unix/fn.tcgetpgrp.html delete mode 100644 doc/libc/unix/fn.tcsendbreak.html delete mode 100644 doc/libc/unix/fn.tcsetattr.html delete mode 100644 doc/libc/unix/fn.telldir.html delete mode 100644 doc/libc/unix/fn.timegm.html delete mode 100644 doc/libc/unix/fn.ttyname.html delete mode 100644 doc/libc/unix/fn.umask.html delete mode 100644 doc/libc/unix/fn.uname.html delete mode 100644 doc/libc/unix/fn.unlink.html delete mode 100644 doc/libc/unix/fn.unmount.html delete mode 100644 doc/libc/unix/fn.unsetenv.html delete mode 100644 doc/libc/unix/fn.uselocale.html delete mode 100644 doc/libc/unix/fn.usleep.html delete mode 100644 doc/libc/unix/fn.utime.html delete mode 100644 doc/libc/unix/fn.utimes.html delete mode 100644 doc/libc/unix/fn.wait.html delete mode 100644 doc/libc/unix/fn.waitpid.html delete mode 100644 doc/libc/unix/fn.write.html delete mode 100644 doc/libc/unix/fn.writev.html delete mode 100644 doc/libc/unix/index.html delete mode 100644 doc/libc/unix/sidebar-items.js delete mode 100644 doc/libc/unix/struct.Dl_info.html delete mode 100644 doc/libc/unix/struct.addrinfo.html delete mode 100644 doc/libc/unix/struct.dirent.html delete mode 100644 doc/libc/unix/struct.dqblk.html delete mode 100644 doc/libc/unix/struct.fd_set.html delete mode 100644 doc/libc/unix/struct.flock.html delete mode 100644 doc/libc/unix/struct.fsid_t.html delete mode 100644 doc/libc/unix/struct.fstore_t.html delete mode 100644 doc/libc/unix/struct.glob_t.html delete mode 100644 doc/libc/unix/struct.hostent.html delete mode 100644 doc/libc/unix/struct.ifaddrs.html delete mode 100644 doc/libc/unix/struct.in6_addr.html delete mode 100644 doc/libc/unix/struct.in_addr.html delete mode 100644 doc/libc/unix/struct.iovec.html delete mode 100644 doc/libc/unix/struct.ip_mreq.html delete mode 100644 doc/libc/unix/struct.ipv6_mreq.html delete mode 100644 doc/libc/unix/struct.kevent.html delete mode 100644 doc/libc/unix/struct.kevent64_s.html delete mode 100644 doc/libc/unix/struct.lconv.html delete mode 100644 doc/libc/unix/struct.mach_timebase_info.html delete mode 100644 doc/libc/unix/struct.msghdr.html delete mode 100644 doc/libc/unix/struct.passwd.html delete mode 100644 doc/libc/unix/struct.pollfd.html delete mode 100644 doc/libc/unix/struct.pthread_attr_t.html delete mode 100644 doc/libc/unix/struct.pthread_cond_t.html delete mode 100644 doc/libc/unix/struct.pthread_mutex_t.html delete mode 100644 doc/libc/unix/struct.pthread_mutexattr_t.html delete mode 100644 doc/libc/unix/struct.pthread_rwlock_t.html delete mode 100644 doc/libc/unix/struct.radvisory.html delete mode 100644 doc/libc/unix/struct.rlimit.html delete mode 100644 doc/libc/unix/struct.rusage.html delete mode 100644 doc/libc/unix/struct.sf_hdtr.html delete mode 100644 doc/libc/unix/struct.sigaction.html delete mode 100644 doc/libc/unix/struct.siginfo_t.html delete mode 100644 doc/libc/unix/struct.sockaddr.html delete mode 100644 doc/libc/unix/struct.sockaddr_in.html delete mode 100644 doc/libc/unix/struct.sockaddr_in6.html delete mode 100644 doc/libc/unix/struct.sockaddr_storage.html delete mode 100644 doc/libc/unix/struct.sockaddr_un.html delete mode 100644 doc/libc/unix/struct.stack_t.html delete mode 100644 doc/libc/unix/struct.stat.html delete mode 100644 doc/libc/unix/struct.statfs.html delete mode 100644 doc/libc/unix/struct.statvfs.html delete mode 100644 doc/libc/unix/struct.termios.html delete mode 100644 doc/libc/unix/struct.timespec.html delete mode 100644 doc/libc/unix/struct.timeval.html delete mode 100644 doc/libc/unix/struct.tm.html delete mode 100644 doc/libc/unix/struct.utimbuf.html delete mode 100644 doc/libc/unix/struct.utsname.html delete mode 100644 doc/libc/unix/struct.winsize.html delete mode 100644 doc/libc/unix/type.blkcnt_t.html delete mode 100644 doc/libc/unix/type.blksize_t.html delete mode 100644 doc/libc/unix/type.c_char.html delete mode 100644 doc/libc/unix/type.c_long.html delete mode 100644 doc/libc/unix/type.c_ulong.html delete mode 100644 doc/libc/unix/type.cc_t.html delete mode 100644 doc/libc/unix/type.clock_t.html delete mode 100644 doc/libc/unix/type.dev_t.html delete mode 100644 doc/libc/unix/type.fsblkcnt_t.html delete mode 100644 doc/libc/unix/type.fsfilcnt_t.html delete mode 100644 doc/libc/unix/type.gid_t.html delete mode 100644 doc/libc/unix/type.in_addr_t.html delete mode 100644 doc/libc/unix/type.in_port_t.html delete mode 100644 doc/libc/unix/type.ino_t.html delete mode 100644 doc/libc/unix/type.mach_timebase_info_data_t.html delete mode 100644 doc/libc/unix/type.mode_t.html delete mode 100644 doc/libc/unix/type.nfds_t.html delete mode 100644 doc/libc/unix/type.nl_item.html delete mode 100644 doc/libc/unix/type.nlink_t.html delete mode 100644 doc/libc/unix/type.off_t.html delete mode 100644 doc/libc/unix/type.pid_t.html delete mode 100644 doc/libc/unix/type.pthread_key_t.html delete mode 100644 doc/libc/unix/type.pthread_t.html delete mode 100644 doc/libc/unix/type.rlim_t.html delete mode 100644 doc/libc/unix/type.sa_family_t.html delete mode 100644 doc/libc/unix/type.sighandler_t.html delete mode 100644 doc/libc/unix/type.sigset_t.html delete mode 100644 doc/libc/unix/type.socklen_t.html delete mode 100644 doc/libc/unix/type.speed_t.html delete mode 100644 doc/libc/unix/type.suseconds_t.html delete mode 100644 doc/libc/unix/type.tcflag_t.html delete mode 100644 doc/libc/unix/type.time_t.html delete mode 100644 doc/libc/unix/type.uid_t.html delete mode 100644 doc/libc/unix/type.useconds_t.html delete mode 100644 doc/libc/unix/type.wchar_t.html delete mode 100644 doc/libz_sys/constant.Z_ASCII.html delete mode 100644 doc/libz_sys/constant.Z_BEST_COMPRESSION.html delete mode 100644 doc/libz_sys/constant.Z_BEST_SPEED.html delete mode 100644 doc/libz_sys/constant.Z_BINARY.html delete mode 100644 doc/libz_sys/constant.Z_BLOCK.html delete mode 100644 doc/libz_sys/constant.Z_BUF_ERROR.html delete mode 100644 doc/libz_sys/constant.Z_DATA_ERROR.html delete mode 100644 doc/libz_sys/constant.Z_DEFAULT_COMPRESSION.html delete mode 100644 doc/libz_sys/constant.Z_DEFAULT_STRATEGY.html delete mode 100644 doc/libz_sys/constant.Z_DEFLATED.html delete mode 100644 doc/libz_sys/constant.Z_ERRNO.html delete mode 100644 doc/libz_sys/constant.Z_FILTERED.html delete mode 100644 doc/libz_sys/constant.Z_FINISH.html delete mode 100644 doc/libz_sys/constant.Z_FIXED.html delete mode 100644 doc/libz_sys/constant.Z_FULL_FLUSH.html delete mode 100644 doc/libz_sys/constant.Z_HUFFMAN_ONLY.html delete mode 100644 doc/libz_sys/constant.Z_MEM_ERROR.html delete mode 100644 doc/libz_sys/constant.Z_NEED_DICT.html delete mode 100644 doc/libz_sys/constant.Z_NO_COMPRESSION.html delete mode 100644 doc/libz_sys/constant.Z_NO_FLUSH.html delete mode 100644 doc/libz_sys/constant.Z_OK.html delete mode 100644 doc/libz_sys/constant.Z_PARTIAL_FLUSH.html delete mode 100644 doc/libz_sys/constant.Z_RLE.html delete mode 100644 doc/libz_sys/constant.Z_STREAM_END.html delete mode 100644 doc/libz_sys/constant.Z_STREAM_ERROR.html delete mode 100644 doc/libz_sys/constant.Z_SYNC_FLUSH.html delete mode 100644 doc/libz_sys/constant.Z_TEXT.html delete mode 100644 doc/libz_sys/constant.Z_TREES.html delete mode 100644 doc/libz_sys/constant.Z_UNKNOWN.html delete mode 100644 doc/libz_sys/constant.Z_VERSION_ERROR.html delete mode 100644 doc/libz_sys/enum.gzFile_s.html delete mode 100644 doc/libz_sys/enum.internal_state.html delete mode 100644 doc/libz_sys/fn.adler32.html delete mode 100644 doc/libz_sys/fn.adler32_combine.html delete mode 100644 doc/libz_sys/fn.compress.html delete mode 100644 doc/libz_sys/fn.compress2.html delete mode 100644 doc/libz_sys/fn.compressBound.html delete mode 100644 doc/libz_sys/fn.crc32.html delete mode 100644 doc/libz_sys/fn.crc32_combine.html delete mode 100644 doc/libz_sys/fn.deflate.html delete mode 100644 doc/libz_sys/fn.deflateBound.html delete mode 100644 doc/libz_sys/fn.deflateCopy.html delete mode 100644 doc/libz_sys/fn.deflateEnd.html delete mode 100644 doc/libz_sys/fn.deflateInit2_.html delete mode 100644 doc/libz_sys/fn.deflateInit_.html delete mode 100644 doc/libz_sys/fn.deflateParams.html delete mode 100644 doc/libz_sys/fn.deflatePrime.html delete mode 100644 doc/libz_sys/fn.deflateReset.html delete mode 100644 doc/libz_sys/fn.deflateSetDictionary.html delete mode 100644 doc/libz_sys/fn.deflateSetHeader.html delete mode 100644 doc/libz_sys/fn.deflateTune.html delete mode 100644 doc/libz_sys/fn.gzclearerr.html delete mode 100644 doc/libz_sys/fn.gzclose.html delete mode 100644 doc/libz_sys/fn.gzdirect.html delete mode 100644 doc/libz_sys/fn.gzdopen.html delete mode 100644 doc/libz_sys/fn.gzeof.html delete mode 100644 doc/libz_sys/fn.gzerror.html delete mode 100644 doc/libz_sys/fn.gzflush.html delete mode 100644 doc/libz_sys/fn.gzgetc.html delete mode 100644 doc/libz_sys/fn.gzgets.html delete mode 100644 doc/libz_sys/fn.gzopen.html delete mode 100644 doc/libz_sys/fn.gzputc.html delete mode 100644 doc/libz_sys/fn.gzputs.html delete mode 100644 doc/libz_sys/fn.gzread.html delete mode 100644 doc/libz_sys/fn.gzrewind.html delete mode 100644 doc/libz_sys/fn.gzseek.html delete mode 100644 doc/libz_sys/fn.gzsetparams.html delete mode 100644 doc/libz_sys/fn.gztell.html delete mode 100644 doc/libz_sys/fn.gzungetc.html delete mode 100644 doc/libz_sys/fn.gzwrite.html delete mode 100644 doc/libz_sys/fn.inflate.html delete mode 100644 doc/libz_sys/fn.inflateBack.html delete mode 100644 doc/libz_sys/fn.inflateBackEnd.html delete mode 100644 doc/libz_sys/fn.inflateBackInit_.html delete mode 100644 doc/libz_sys/fn.inflateCopy.html delete mode 100644 doc/libz_sys/fn.inflateEnd.html delete mode 100644 doc/libz_sys/fn.inflateGetHeader.html delete mode 100644 doc/libz_sys/fn.inflateInit2_.html delete mode 100644 doc/libz_sys/fn.inflateInit_.html delete mode 100644 doc/libz_sys/fn.inflateMark.html delete mode 100644 doc/libz_sys/fn.inflatePrime.html delete mode 100644 doc/libz_sys/fn.inflateReset.html delete mode 100644 doc/libz_sys/fn.inflateReset2.html delete mode 100644 doc/libz_sys/fn.inflateSetDictionary.html delete mode 100644 doc/libz_sys/fn.inflateSync.html delete mode 100644 doc/libz_sys/fn.uncompress.html delete mode 100644 doc/libz_sys/fn.zlibCompileFlags.html delete mode 100644 doc/libz_sys/fn.zlibVersion.html delete mode 100644 doc/libz_sys/index.html delete mode 100644 doc/libz_sys/sidebar-items.js delete mode 100644 doc/libz_sys/struct.gz_header.html delete mode 100644 doc/libz_sys/struct.z_stream.html delete mode 100644 doc/libz_sys/type.Bytef.html delete mode 100644 doc/libz_sys/type.alloc_func.html delete mode 100644 doc/libz_sys/type.free_func.html delete mode 100644 doc/libz_sys/type.gzFile.html delete mode 100644 doc/libz_sys/type.gz_headerp.html delete mode 100644 doc/libz_sys/type.in_func.html delete mode 100644 doc/libz_sys/type.out_func.html delete mode 100644 doc/libz_sys/type.uInt.html delete mode 100644 doc/libz_sys/type.uLong.html delete mode 100644 doc/libz_sys/type.uLongf.html delete mode 100644 doc/libz_sys/type.voidp.html delete mode 100644 doc/libz_sys/type.voidpc.html delete mode 100644 doc/libz_sys/type.voidpf.html delete mode 100644 doc/libz_sys/type.z_off_t.html delete mode 100644 doc/libz_sys/type.z_streamp.html delete mode 100644 doc/main.css delete mode 100644 doc/main.js delete mode 100644 doc/memchr/fallback/index.html delete mode 100644 doc/memchr/fallback/sidebar-items.js delete mode 100644 doc/memchr/fn.memchr.html delete mode 100644 doc/memchr/fn.memchr2.html delete mode 100644 doc/memchr/fn.memchr3.html delete mode 100644 doc/memchr/fn.memrchr.html delete mode 100644 doc/memchr/index.html delete mode 100644 doc/memchr/sidebar-items.js delete mode 100644 doc/miniz_sys/constant.MZ_BLOCK.html delete mode 100644 doc/miniz_sys/constant.MZ_BUF_ERROR.html delete mode 100644 doc/miniz_sys/constant.MZ_DATA_ERROR.html delete mode 100644 doc/miniz_sys/constant.MZ_DEFAULT_STRATEGY.html delete mode 100644 doc/miniz_sys/constant.MZ_DEFAULT_WINDOW_BITS.html delete mode 100644 doc/miniz_sys/constant.MZ_DEFLATED.html delete mode 100644 doc/miniz_sys/constant.MZ_ERRNO.html delete mode 100644 doc/miniz_sys/constant.MZ_FINISH.html delete mode 100644 doc/miniz_sys/constant.MZ_FULL_FLUSH.html delete mode 100644 doc/miniz_sys/constant.MZ_MEM_ERROR.html delete mode 100644 doc/miniz_sys/constant.MZ_NEED_DICT.html delete mode 100644 doc/miniz_sys/constant.MZ_NO_FLUSH.html delete mode 100644 doc/miniz_sys/constant.MZ_OK.html delete mode 100644 doc/miniz_sys/constant.MZ_PARAM_ERROR.html delete mode 100644 doc/miniz_sys/constant.MZ_PARTIAL_FLUSH.html delete mode 100644 doc/miniz_sys/constant.MZ_STREAM_END.html delete mode 100644 doc/miniz_sys/constant.MZ_STREAM_ERROR.html delete mode 100644 doc/miniz_sys/constant.MZ_SYNC_FLUSH.html delete mode 100644 doc/miniz_sys/constant.MZ_VERSION_ERROR.html delete mode 100644 doc/miniz_sys/enum.mz_internal_state.html delete mode 100644 doc/miniz_sys/fn.mz_crc32.html delete mode 100644 doc/miniz_sys/fn.mz_deflate.html delete mode 100644 doc/miniz_sys/fn.mz_deflateEnd.html delete mode 100644 doc/miniz_sys/fn.mz_deflateInit2.html delete mode 100644 doc/miniz_sys/fn.mz_deflateReset.html delete mode 100644 doc/miniz_sys/fn.mz_inflate.html delete mode 100644 doc/miniz_sys/fn.mz_inflateEnd.html delete mode 100644 doc/miniz_sys/fn.mz_inflateInit2.html delete mode 100644 doc/miniz_sys/index.html delete mode 100644 doc/miniz_sys/sidebar-items.js delete mode 100644 doc/miniz_sys/struct.mz_stream.html delete mode 100644 doc/miniz_sys/type.mz_alloc_func.html delete mode 100644 doc/miniz_sys/type.mz_free_func.html delete mode 100644 doc/normalize.css delete mode 100644 doc/num_cpus/fn.get.html delete mode 100644 doc/num_cpus/index.html delete mode 100644 doc/num_cpus/sidebar-items.js delete mode 100644 doc/oxipng/deflate/deflate/fn.deflate.html delete mode 100644 doc/oxipng/deflate/deflate/fn.inflate.html delete mode 100644 doc/oxipng/deflate/deflate/index.html delete mode 100644 doc/oxipng/deflate/deflate/sidebar-items.js delete mode 100644 doc/oxipng/deflate/index.html delete mode 100644 doc/oxipng/deflate/libz_stream/enum.Compress.html delete mode 100644 doc/oxipng/deflate/libz_stream/enum.Decompress.html delete mode 100644 doc/oxipng/deflate/libz_stream/index.html delete mode 100644 doc/oxipng/deflate/libz_stream/sidebar-items.js delete mode 100644 doc/oxipng/deflate/libz_stream/struct.Stream.html delete mode 100644 doc/oxipng/deflate/miniz_stream/enum.Compress.html delete mode 100644 doc/oxipng/deflate/miniz_stream/enum.Decompress.html delete mode 100644 doc/oxipng/deflate/miniz_stream/index.html delete mode 100644 doc/oxipng/deflate/miniz_stream/sidebar-items.js delete mode 100644 doc/oxipng/deflate/miniz_stream/struct.Stream.html delete mode 100644 doc/oxipng/deflate/sidebar-items.js delete mode 100644 doc/oxipng/fn.optimize.html delete mode 100644 doc/oxipng/fn.optimize_from_memory.html delete mode 100644 doc/oxipng/index.html delete mode 100644 doc/oxipng/png/enum.BitDepth.html delete mode 100644 doc/oxipng/png/enum.ColorType.html delete mode 100644 doc/oxipng/png/enum.Headers.html delete mode 100644 doc/oxipng/png/index.html delete mode 100644 doc/oxipng/png/sidebar-items.js delete mode 100644 doc/oxipng/png/struct.IhdrData.html delete mode 100644 doc/oxipng/png/struct.PngData.html delete mode 100644 doc/oxipng/png/struct.ScanLine.html delete mode 100644 doc/oxipng/png/struct.ScanLines.html delete mode 100644 doc/oxipng/sidebar-items.js delete mode 100644 doc/oxipng/struct.Options.html delete mode 100644 doc/playpen.js delete mode 100644 doc/regex/backtrack/index.html delete mode 100644 doc/regex/backtrack/sidebar-items.js delete mode 100644 doc/regex/bytes/index.html delete mode 100644 doc/regex/bytes/sidebar-items.js delete mode 100644 doc/regex/bytes/struct.CaptureNames.html delete mode 100644 doc/regex/bytes/struct.Captures.html delete mode 100644 doc/regex/bytes/struct.FindCaptures.html delete mode 100644 doc/regex/bytes/struct.FindMatches.html delete mode 100644 doc/regex/bytes/struct.NoExpand.html delete mode 100644 doc/regex/bytes/struct.Regex.html delete mode 100644 doc/regex/bytes/struct.RegexBuilder.html delete mode 100644 doc/regex/bytes/struct.RegexSet.html delete mode 100644 doc/regex/bytes/struct.SetMatches.html delete mode 100644 doc/regex/bytes/struct.SetMatchesIntoIter.html delete mode 100644 doc/regex/bytes/struct.SetMatchesIter.html delete mode 100644 doc/regex/bytes/struct.Splits.html delete mode 100644 doc/regex/bytes/struct.SplitsN.html delete mode 100644 doc/regex/bytes/struct.SubCaptures.html delete mode 100644 doc/regex/bytes/struct.SubCapturesNamed.html delete mode 100644 doc/regex/bytes/struct.SubCapturesPos.html delete mode 100644 doc/regex/bytes/trait.Replacer.html delete mode 100644 doc/regex/compile/index.html delete mode 100644 doc/regex/compile/sidebar-items.js delete mode 100644 doc/regex/compile/struct.Compiler.html delete mode 100644 doc/regex/dfa/index.html delete mode 100644 doc/regex/dfa/sidebar-items.js delete mode 100644 doc/regex/enum.Error.html delete mode 100644 doc/regex/error/enum.Error.html delete mode 100644 doc/regex/error/index.html delete mode 100644 doc/regex/error/sidebar-items.js delete mode 100644 doc/regex/exec/index.html delete mode 100644 doc/regex/exec/sidebar-items.js delete mode 100644 doc/regex/exec/struct.Exec.html delete mode 100644 doc/regex/exec/struct.ExecBuilder.html delete mode 100644 doc/regex/expand/index.html delete mode 100644 doc/regex/expand/sidebar-items.js delete mode 100644 doc/regex/fn.is_match.html delete mode 100644 doc/regex/fn.quote.html delete mode 100644 doc/regex/freqs/index.html delete mode 100644 doc/regex/freqs/sidebar-items.js delete mode 100644 doc/regex/index.html delete mode 100644 doc/regex/input/index.html delete mode 100644 doc/regex/input/sidebar-items.js delete mode 100644 doc/regex/input/struct.Char.html delete mode 100644 doc/regex/input/struct.CharInput.html delete mode 100644 doc/regex/input/struct.InputAt.html delete mode 100644 doc/regex/input/trait.Input.html delete mode 100644 doc/regex/internal/enum.EmptyLook.html delete mode 100644 doc/regex/internal/enum.Inst.html delete mode 100644 doc/regex/internal/enum._Regex.html delete mode 100644 doc/regex/internal/index.html delete mode 100644 doc/regex/internal/sidebar-items.js delete mode 100644 doc/regex/internal/struct.Char.html delete mode 100644 doc/regex/internal/struct.CharInput.html delete mode 100644 doc/regex/internal/struct.Compiler.html delete mode 100644 doc/regex/internal/struct.Exec.html delete mode 100644 doc/regex/internal/struct.ExecBuilder.html delete mode 100644 doc/regex/internal/struct.InputAt.html delete mode 100644 doc/regex/internal/struct.InstRanges.html delete mode 100644 doc/regex/internal/struct.LiteralSearcher.html delete mode 100644 doc/regex/internal/struct.Plugin.html delete mode 100644 doc/regex/internal/struct.Program.html delete mode 100644 doc/regex/internal/trait.Input.html delete mode 100644 doc/regex/literals/index.html delete mode 100644 doc/regex/literals/sidebar-items.js delete mode 100644 doc/regex/literals/struct.LiteralSearcher.html delete mode 100644 doc/regex/pikevm/index.html delete mode 100644 doc/regex/pikevm/sidebar-items.js delete mode 100644 doc/regex/prog/enum.EmptyLook.html delete mode 100644 doc/regex/prog/enum.Inst.html delete mode 100644 doc/regex/prog/index.html delete mode 100644 doc/regex/prog/sidebar-items.js delete mode 100644 doc/regex/prog/struct.InstRanges.html delete mode 100644 doc/regex/prog/struct.Program.html delete mode 100644 doc/regex/re_builder/bytes/index.html delete mode 100644 doc/regex/re_builder/bytes/sidebar-items.js delete mode 100644 doc/regex/re_builder/bytes/struct.RegexBuilder.html delete mode 100644 doc/regex/re_builder/index.html delete mode 100644 doc/regex/re_builder/sidebar-items.js delete mode 100644 doc/regex/re_builder/unicode/index.html delete mode 100644 doc/regex/re_builder/unicode/sidebar-items.js delete mode 100644 doc/regex/re_builder/unicode/struct.RegexBuilder.html delete mode 100644 doc/regex/re_bytes/index.html delete mode 100644 doc/regex/re_bytes/sidebar-items.js delete mode 100644 doc/regex/re_bytes/struct.CaptureNames.html delete mode 100644 doc/regex/re_bytes/struct.Captures.html delete mode 100644 doc/regex/re_bytes/struct.FindCaptures.html delete mode 100644 doc/regex/re_bytes/struct.FindMatches.html delete mode 100644 doc/regex/re_bytes/struct.NoExpand.html delete mode 100644 doc/regex/re_bytes/struct.Regex.html delete mode 100644 doc/regex/re_bytes/struct.Splits.html delete mode 100644 doc/regex/re_bytes/struct.SplitsN.html delete mode 100644 doc/regex/re_bytes/struct.SubCaptures.html delete mode 100644 doc/regex/re_bytes/struct.SubCapturesNamed.html delete mode 100644 doc/regex/re_bytes/struct.SubCapturesPos.html delete mode 100644 doc/regex/re_bytes/trait.Replacer.html delete mode 100644 doc/regex/re_plugin/index.html delete mode 100644 doc/regex/re_plugin/sidebar-items.js delete mode 100644 doc/regex/re_set/bytes/index.html delete mode 100644 doc/regex/re_set/bytes/sidebar-items.js delete mode 100644 doc/regex/re_set/bytes/struct.RegexSet.html delete mode 100644 doc/regex/re_set/bytes/struct.SetMatches.html delete mode 100644 doc/regex/re_set/bytes/struct.SetMatchesIntoIter.html delete mode 100644 doc/regex/re_set/bytes/struct.SetMatchesIter.html delete mode 100644 doc/regex/re_set/index.html delete mode 100644 doc/regex/re_set/sidebar-items.js delete mode 100644 doc/regex/re_set/unicode/index.html delete mode 100644 doc/regex/re_set/unicode/sidebar-items.js delete mode 100644 doc/regex/re_set/unicode/struct.RegexSet.html delete mode 100644 doc/regex/re_set/unicode/struct.SetMatches.html delete mode 100644 doc/regex/re_set/unicode/struct.SetMatchesIntoIter.html delete mode 100644 doc/regex/re_set/unicode/struct.SetMatchesIter.html delete mode 100644 doc/regex/re_trait/index.html delete mode 100644 doc/regex/re_trait/sidebar-items.js delete mode 100644 doc/regex/re_unicode/fn.is_match.html delete mode 100644 doc/regex/re_unicode/fn.quote.html delete mode 100644 doc/regex/re_unicode/index.html delete mode 100644 doc/regex/re_unicode/sidebar-items.js delete mode 100644 doc/regex/re_unicode/struct.CaptureNames.html delete mode 100644 doc/regex/re_unicode/struct.Captures.html delete mode 100644 doc/regex/re_unicode/struct.FindCaptures.html delete mode 100644 doc/regex/re_unicode/struct.FindMatches.html delete mode 100644 doc/regex/re_unicode/struct.NoExpand.html delete mode 100644 doc/regex/re_unicode/struct.Regex.html delete mode 100644 doc/regex/re_unicode/struct.RegexSplits.html delete mode 100644 doc/regex/re_unicode/struct.RegexSplitsN.html delete mode 100644 doc/regex/re_unicode/struct.SubCaptures.html delete mode 100644 doc/regex/re_unicode/struct.SubCapturesNamed.html delete mode 100644 doc/regex/re_unicode/struct.SubCapturesPos.html delete mode 100644 doc/regex/re_unicode/trait.Replacer.html delete mode 100644 doc/regex/sidebar-items.js delete mode 100644 doc/regex/sparse/index.html delete mode 100644 doc/regex/sparse/sidebar-items.js delete mode 100644 doc/regex/struct.CaptureNames.html delete mode 100644 doc/regex/struct.Captures.html delete mode 100644 doc/regex/struct.FindCaptures.html delete mode 100644 doc/regex/struct.FindMatches.html delete mode 100644 doc/regex/struct.NoExpand.html delete mode 100644 doc/regex/struct.Regex.html delete mode 100644 doc/regex/struct.RegexBuilder.html delete mode 100644 doc/regex/struct.RegexSet.html delete mode 100644 doc/regex/struct.RegexSplits.html delete mode 100644 doc/regex/struct.RegexSplitsN.html delete mode 100644 doc/regex/struct.SetMatches.html delete mode 100644 doc/regex/struct.SetMatchesIntoIter.html delete mode 100644 doc/regex/struct.SetMatchesIter.html delete mode 100644 doc/regex/struct.SubCaptures.html delete mode 100644 doc/regex/struct.SubCapturesNamed.html delete mode 100644 doc/regex/struct.SubCapturesPos.html delete mode 100644 doc/regex/trait.Replacer.html delete mode 100644 doc/regex/utf8/index.html delete mode 100644 doc/regex/utf8/sidebar-items.js delete mode 100644 doc/regex_syntax/enum.ErrorKind.html delete mode 100644 doc/regex_syntax/enum.Expr.html delete mode 100644 doc/regex_syntax/enum.Repeater.html delete mode 100644 doc/regex_syntax/fn.quote.html delete mode 100644 doc/regex_syntax/index.html delete mode 100644 doc/regex_syntax/literals/index.html delete mode 100644 doc/regex_syntax/literals/sidebar-items.js delete mode 100644 doc/regex_syntax/literals/struct.Lit.html delete mode 100644 doc/regex_syntax/literals/struct.Literals.html delete mode 100644 doc/regex_syntax/parser/index.html delete mode 100644 doc/regex_syntax/parser/sidebar-items.js delete mode 100644 doc/regex_syntax/sidebar-items.js delete mode 100644 doc/regex_syntax/struct.ByteClass.html delete mode 100644 doc/regex_syntax/struct.ByteRange.html delete mode 100644 doc/regex_syntax/struct.CharClass.html delete mode 100644 doc/regex_syntax/struct.ClassRange.html delete mode 100644 doc/regex_syntax/struct.Error.html delete mode 100644 doc/regex_syntax/struct.ExprBuilder.html delete mode 100644 doc/regex_syntax/struct.Lit.html delete mode 100644 doc/regex_syntax/struct.Literals.html delete mode 100644 doc/regex_syntax/type.Result.html delete mode 100644 doc/regex_syntax/unicode/case_folding/index.html delete mode 100644 doc/regex_syntax/unicode/case_folding/sidebar-items.js delete mode 100644 doc/regex_syntax/unicode/derived_property/index.html delete mode 100644 doc/regex_syntax/unicode/derived_property/sidebar-items.js delete mode 100644 doc/regex_syntax/unicode/general_category/index.html delete mode 100644 doc/regex_syntax/unicode/general_category/sidebar-items.js delete mode 100644 doc/regex_syntax/unicode/index.html delete mode 100644 doc/regex_syntax/unicode/property/index.html delete mode 100644 doc/regex_syntax/unicode/property/sidebar-items.js delete mode 100644 doc/regex_syntax/unicode/regex/index.html delete mode 100644 doc/regex_syntax/unicode/regex/sidebar-items.js delete mode 100644 doc/regex_syntax/unicode/script/index.html delete mode 100644 doc/regex_syntax/unicode/script/sidebar-items.js delete mode 100644 doc/regex_syntax/unicode/sidebar-items.js delete mode 100644 doc/rustdoc.css delete mode 100644 doc/scoped_pool/index.html delete mode 100644 doc/scoped_pool/sidebar-items.js delete mode 100644 doc/scoped_pool/struct.Pool.html delete mode 100644 doc/scoped_pool/struct.Scope.html delete mode 100644 doc/scoped_pool/struct.WaitGroup.html delete mode 100644 doc/scopeguard/fn.guard.html delete mode 100644 doc/scopeguard/index.html delete mode 100644 doc/scopeguard/macro.defer!.html delete mode 100644 doc/scopeguard/sidebar-items.js delete mode 100644 doc/scopeguard/struct.Guard.html delete mode 100644 doc/search-index.js delete mode 100644 doc/src/aho_corasick/autiter.rs.html delete mode 100644 doc/src/aho_corasick/full.rs.html delete mode 100644 doc/src/aho_corasick/lib.rs.html delete mode 100644 doc/src/ansi_term/lib.rs.html delete mode 100644 doc/src/bit_vec/lib.rs.html delete mode 100644 doc/src/bitflags/lib.rs.html delete mode 100644 doc/src/byteorder/lib.rs.html delete mode 100644 doc/src/byteorder/new.rs.html delete mode 100644 doc/src/clap/app/help.rs.html delete mode 100644 doc/src/clap/app/macros.rs.html delete mode 100644 doc/src/clap/app/meta.rs.html delete mode 100644 doc/src/clap/app/mod.rs.html delete mode 100644 doc/src/clap/app/parser.rs.html delete mode 100644 doc/src/clap/app/settings.rs.html delete mode 100644 doc/src/clap/args/any_arg.rs.html delete mode 100644 doc/src/clap/args/arg.rs.html delete mode 100644 doc/src/clap/args/arg_builder/flag.rs.html delete mode 100644 doc/src/clap/args/arg_builder/mod.rs.html delete mode 100644 doc/src/clap/args/arg_builder/option.rs.html delete mode 100644 doc/src/clap/args/arg_builder/positional.rs.html delete mode 100644 doc/src/clap/args/arg_matcher.rs.html delete mode 100644 doc/src/clap/args/arg_matches.rs.html delete mode 100644 doc/src/clap/args/group.rs.html delete mode 100644 doc/src/clap/args/matched_arg.rs.html delete mode 100644 doc/src/clap/args/mod.rs.html delete mode 100644 doc/src/clap/args/settings.rs.html delete mode 100644 doc/src/clap/args/subcommand.rs.html delete mode 100644 doc/src/clap/errors.rs.html delete mode 100644 doc/src/clap/fmt.rs.html delete mode 100644 doc/src/clap/lib.rs.html delete mode 100644 doc/src/clap/macros.rs.html delete mode 100644 doc/src/clap/osstringext.rs.html delete mode 100644 doc/src/clap/strext.rs.html delete mode 100644 doc/src/clap/suggestions.rs.html delete mode 100644 doc/src/clap/term.rs.html delete mode 100644 doc/src/clap/usage_parser.rs.html delete mode 100644 doc/src/crc/crc32.rs.html delete mode 100644 doc/src/crc/crc64.rs.html delete mode 100644 doc/src/crc/lib.rs.html delete mode 100644 doc/src/crossbeam/lib.rs.html delete mode 100644 doc/src/crossbeam/mem/cache_padded.rs.html delete mode 100644 doc/src/crossbeam/mem/epoch/atomic.rs.html delete mode 100644 doc/src/crossbeam/mem/epoch/garbage.rs.html delete mode 100644 doc/src/crossbeam/mem/epoch/global.rs.html delete mode 100644 doc/src/crossbeam/mem/epoch/guard.rs.html delete mode 100644 doc/src/crossbeam/mem/epoch/local.rs.html delete mode 100644 doc/src/crossbeam/mem/epoch/mod.rs.html delete mode 100644 doc/src/crossbeam/mem/epoch/participant.rs.html delete mode 100644 doc/src/crossbeam/mem/epoch/participants.rs.html delete mode 100644 doc/src/crossbeam/mem/mod.rs.html delete mode 100644 doc/src/crossbeam/scoped.rs.html delete mode 100644 doc/src/crossbeam/sync/arc_cell.rs.html delete mode 100644 doc/src/crossbeam/sync/atomic_option.rs.html delete mode 100644 doc/src/crossbeam/sync/chase_lev.rs.html delete mode 100644 doc/src/crossbeam/sync/mod.rs.html delete mode 100644 doc/src/crossbeam/sync/ms_queue.rs.html delete mode 100644 doc/src/crossbeam/sync/seg_queue.rs.html delete mode 100644 doc/src/crossbeam/sync/treiber_stack.rs.html delete mode 100644 doc/src/kernel32/lib.rs.html delete mode 100644 doc/src/lazy_static/lib.rs.html delete mode 100644 doc/src/libc/dox.rs.html delete mode 100644 doc/src/libc/lib.rs.html delete mode 100644 doc/src/libc/macros.rs.html delete mode 100644 doc/src/libc/unix/bsd/apple/b64.rs.html delete mode 100644 doc/src/libc/unix/bsd/apple/mod.rs.html delete mode 100644 doc/src/libc/unix/bsd/mod.rs.html delete mode 100644 doc/src/libc/unix/mod.rs.html delete mode 100644 doc/src/libz_sys/lib.rs.html delete mode 100644 doc/src/memchr/lib.rs.html delete mode 100644 doc/src/miniz_sys/lib.rs.html delete mode 100644 doc/src/num_cpus/lib.rs.html delete mode 100644 doc/src/oxipng/src/deflate/deflate.rs.html delete mode 100644 doc/src/oxipng/src/deflate/libz_stream.rs.html delete mode 100644 doc/src/oxipng/src/deflate/miniz_stream.rs.html delete mode 100644 doc/src/oxipng/src/lib.rs.html delete mode 100644 doc/src/oxipng/src/png.rs.html delete mode 100644 doc/src/regex/backtrack.rs.html delete mode 100644 doc/src/regex/compile.rs.html delete mode 100644 doc/src/regex/dfa.rs.html delete mode 100644 doc/src/regex/error.rs.html delete mode 100644 doc/src/regex/exec.rs.html delete mode 100644 doc/src/regex/expand.rs.html delete mode 100644 doc/src/regex/freqs.rs.html delete mode 100644 doc/src/regex/input.rs.html delete mode 100644 doc/src/regex/lib.rs.html delete mode 100644 doc/src/regex/literals.rs.html delete mode 100644 doc/src/regex/pikevm.rs.html delete mode 100644 doc/src/regex/prog.rs.html delete mode 100644 doc/src/regex/re_builder.rs.html delete mode 100644 doc/src/regex/re_bytes.rs.html delete mode 100644 doc/src/regex/re_plugin.rs.html delete mode 100644 doc/src/regex/re_set.rs.html delete mode 100644 doc/src/regex/re_trait.rs.html delete mode 100644 doc/src/regex/re_unicode.rs.html delete mode 100644 doc/src/regex/sparse.rs.html delete mode 100644 doc/src/regex/utf8.rs.html delete mode 100644 doc/src/regex_syntax/lib.rs.html delete mode 100644 doc/src/regex_syntax/literals.rs.html delete mode 100644 doc/src/regex_syntax/parser.rs.html delete mode 100644 doc/src/regex_syntax/unicode.rs.html delete mode 100644 doc/src/scoped_pool/lib.rs.html delete mode 100644 doc/src/scopeguard/lib.rs.html delete mode 100644 doc/src/strsim/lib.rs.html delete mode 100644 doc/src/thread_id/lib.rs.html delete mode 100644 doc/src/thread_local/lib.rs.html delete mode 100644 doc/src/unicode_width/lib.rs.html delete mode 100644 doc/src/unicode_width/tables.rs.html delete mode 100644 doc/src/utf8_ranges/char_utf8.rs.html delete mode 100644 doc/src/utf8_ranges/lib.rs.html delete mode 100644 doc/src/variance/lib.rs.html delete mode 100644 doc/src/vec_map/lib.rs.html delete mode 100644 doc/src/winapi/lib.rs.html delete mode 100644 doc/strsim/enum.StrSimError.html delete mode 100644 doc/strsim/fn.damerau_levenshtein.html delete mode 100644 doc/strsim/fn.damerau_levenshtein_against_vec.html delete mode 100644 doc/strsim/fn.hamming.html delete mode 100644 doc/strsim/fn.jaro.html delete mode 100644 doc/strsim/fn.jaro_against_vec.html delete mode 100644 doc/strsim/fn.jaro_winkler.html delete mode 100644 doc/strsim/fn.jaro_winkler_against_vec.html delete mode 100644 doc/strsim/fn.levenshtein.html delete mode 100644 doc/strsim/fn.levenshtein_against_vec.html delete mode 100644 doc/strsim/index.html delete mode 100644 doc/strsim/sidebar-items.js delete mode 100644 doc/strsim/type.HammingResult.html delete mode 100644 doc/thread_id/fn.get.html delete mode 100644 doc/thread_id/index.html delete mode 100644 doc/thread_id/sidebar-items.js delete mode 100644 doc/thread_local/index.html delete mode 100644 doc/thread_local/sidebar-items.js delete mode 100644 doc/thread_local/struct.CachedThreadLocal.html delete mode 100644 doc/thread_local/struct.ThreadLocal.html delete mode 100644 doc/unicode_width/constant.UNICODE_VERSION.html delete mode 100644 doc/unicode_width/index.html delete mode 100644 doc/unicode_width/sidebar-items.js delete mode 100644 doc/unicode_width/tables/charwidth/index.html delete mode 100644 doc/unicode_width/tables/charwidth/sidebar-items.js delete mode 100644 doc/unicode_width/tables/constant.UNICODE_VERSION.html delete mode 100644 doc/unicode_width/tables/index.html delete mode 100644 doc/unicode_width/tables/sidebar-items.js delete mode 100644 doc/unicode_width/trait.UnicodeWidthChar.html delete mode 100644 doc/unicode_width/trait.UnicodeWidthStr.html delete mode 100644 doc/utf8_ranges/char_utf8/index.html delete mode 100644 doc/utf8_ranges/char_utf8/sidebar-items.js delete mode 100644 doc/utf8_ranges/enum.Utf8Sequence.html delete mode 100644 doc/utf8_ranges/index.html delete mode 100644 doc/utf8_ranges/sidebar-items.js delete mode 100644 doc/utf8_ranges/struct.Utf8Range.html delete mode 100644 doc/utf8_ranges/struct.Utf8Sequences.html delete mode 100644 doc/variance/index.html delete mode 100644 doc/variance/sidebar-items.js delete mode 100644 doc/variance/struct.Invariant.html delete mode 100644 doc/variance/struct.InvariantLifetime.html delete mode 100644 doc/vec_map/enum.Entry.html delete mode 100644 doc/vec_map/index.html delete mode 100644 doc/vec_map/sidebar-items.js delete mode 100644 doc/vec_map/struct.Drain.html delete mode 100644 doc/vec_map/struct.IntoIter.html delete mode 100644 doc/vec_map/struct.Iter.html delete mode 100644 doc/vec_map/struct.IterMut.html delete mode 100644 doc/vec_map/struct.Keys.html delete mode 100644 doc/vec_map/struct.OccupiedEntry.html delete mode 100644 doc/vec_map/struct.VacantEntry.html delete mode 100644 doc/vec_map/struct.Values.html delete mode 100644 doc/vec_map/struct.VecMap.html delete mode 100644 doc/winapi/index.html delete mode 100644 doc/winapi/sidebar-items.js diff --git a/doc/.lock b/doc/.lock deleted file mode 100755 index e69de29b..00000000 diff --git a/doc/COPYRIGHT.txt b/doc/COPYRIGHT.txt deleted file mode 100644 index 8773ce6b..00000000 --- a/doc/COPYRIGHT.txt +++ /dev/null @@ -1,64 +0,0 @@ -These documentation pages include resources by third parties. This copyright -file applies only to those resources. The following third party resources are -included, and carry their own copyright notices and license terms: - -* Fira Sans (FiraSans-Regular.woff, FiraSans-Medium.woff): - - Copyright (c) 2014, Mozilla Foundation https://mozilla.org/ - with Reserved Font Name Fira Sans. - - Copyright (c) 2014, Telefonica S.A. - - Licensed under the SIL Open Font License, Version 1.1. - See FiraSans-LICENSE.txt. - -* Heuristica (Heuristica-Italic.woff): - - Copyright 1989, 1991 Adobe Systems Incorporated. All rights reserved. - Utopia is either a registered trademark or trademark of Adobe Systems - Incorporated in the United States and/or other countries. Used under - license. - - Copyright 2006 Han The Thanh, Vntopia font family, http://vntex.sf.net - - Copyright (c) 2008-2012, Andrey V. Panov (panov@canopus.iacp.dvo.ru), - with Reserved Font Name Heuristica. - - Licensed under the SIL Open Font License, Version 1.1. - See Heuristica-LICENSE.txt. - -* jQuery (jquery-2.1.4.min.js): - - Copyright 2005, 2015 jQuery Foundation, Inc. - Licensed under the MIT license (see LICENSE-MIT.txt). - -* rustdoc.css, main.js, and playpen.js: - - Copyright 2015 The Rust Developers. - Licensed under the Apache License, Version 2.0 (see LICENSE-APACHE.txt) or - the MIT license (LICENSE-MIT.txt) at your option. - -* normalize.css: - - Copyright (c) Nicolas Gallagher and Jonathan Neal. - Licensed under the MIT license (see LICENSE-MIT.txt). - -* Source Code Pro (SourceCodePro-Regular.woff, SourceCodePro-Semibold.woff): - - Copyright 2010, 2012 Adobe Systems Incorporated (http://www.adobe.com/), - with Reserved Font Name 'Source'. All Rights Reserved. Source is a trademark - of Adobe Systems Incorporated in the United States and/or other countries. - - Licensed under the SIL Open Font License, Version 1.1. - See SourceCodePro-LICENSE.txt. - -* Source Serif Pro (SourceSerifPro-Regular.woff, SourceSerifPro-Bold.woff): - - Copyright 2014 Adobe Systems Incorporated (http://www.adobe.com/), with - Reserved Font Name 'Source'. All Rights Reserved. Source is a trademark of - Adobe Systems Incorporated in the United States and/or other countries. - - Licensed under the SIL Open Font License, Version 1.1. - See SourceSerifPro-LICENSE.txt. - -This copyright file is intended to be distributed with rustdoc output. diff --git a/doc/FiraSans-LICENSE.txt b/doc/FiraSans-LICENSE.txt deleted file mode 100644 index b4a39671..00000000 --- a/doc/FiraSans-LICENSE.txt +++ /dev/null @@ -1,99 +0,0 @@ -Copyright (c) 2014, Mozilla Foundation https://mozilla.org/ -with Reserved Font Name Fira Sans. - -Copyright (c) 2014, Mozilla Foundation https://mozilla.org/ -with Reserved Font Name Fira Mono. - -Copyright (c) 2014, Telefonica S.A. - -This Font Software is licensed under the SIL Open Font License, Version 1.1. -This license is copied below, and is also available with a FAQ at: -http://scripts.sil.org/OFL - - ------------------------------------------------------------ -SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007 ------------------------------------------------------------ - -PREAMBLE -The goals of the Open Font License (OFL) are to stimulate worldwide -development of collaborative font projects, to support the font creation -efforts of academic and linguistic communities, and to provide a free and -open framework in which fonts may be shared and improved in partnership -with others. - -The OFL allows the licensed fonts to be used, studied, modified and -redistributed freely as long as they are not sold by themselves. The -fonts, including any derivative works, can be bundled, embedded, -redistributed and/or sold with any software provided that any reserved -names are not used by derivative works. The fonts and derivatives, -however, cannot be released under any other type of license. The -requirement for fonts to remain under this license does not apply -to any document created using the fonts or their derivatives. - -DEFINITIONS -"Font Software" refers to the set of files released by the Copyright -Holder(s) under this license and clearly marked as such. This may -include source files, build scripts and documentation. - -"Reserved Font Name" refers to any names specified as such after the -copyright statement(s). - -"Original Version" refers to the collection of Font Software components as -distributed by the Copyright Holder(s). - -"Modified Version" refers to any derivative made by adding to, deleting, -or substituting -- in part or in whole -- any of the components of the -Original Version, by changing formats or by porting the Font Software to a -new environment. - -"Author" refers to any designer, engineer, programmer, technical -writer or other person who contributed to the Font Software. - -PERMISSION & CONDITIONS -Permission is hereby granted, free of charge, to any person obtaining -a copy of the Font Software, to use, study, copy, merge, embed, modify, -redistribute, and sell modified and unmodified copies of the Font -Software, subject to the following conditions: - -1) Neither the Font Software nor any of its individual components, -in Original or Modified Versions, may be sold by itself. - -2) Original or Modified Versions of the Font Software may be bundled, -redistributed and/or sold with any software, provided that each copy -contains the above copyright notice and this license. These can be -included either as stand-alone text files, human-readable headers or -in the appropriate machine-readable metadata fields within text or -binary files as long as those fields can be easily viewed by the user. - -3) No Modified Version of the Font Software may use the Reserved Font -Name(s) unless explicit written permission is granted by the corresponding -Copyright Holder. This restriction only applies to the primary font name as -presented to the users. - -4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font -Software shall not be used to promote, endorse or advertise any -Modified Version, except to acknowledge the contribution(s) of the -Copyright Holder(s) and the Author(s) or with their explicit written -permission. - -5) The Font Software, modified or unmodified, in part or in whole, -must be distributed entirely under this license, and must not be -distributed under any other license. The requirement for fonts to -remain under this license does not apply to any document created -using the Font Software. - -TERMINATION -This license becomes null and void if any of the above conditions are -not met. - -DISCLAIMER -THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT -OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE -COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, -INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL -DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING -FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM -OTHER DEALINGS IN THE FONT SOFTWARE. diff --git a/doc/FiraSans-Medium.woff b/doc/FiraSans-Medium.woff deleted file mode 100644 index 5627227744ae5b2ffb83e632cb32b237428c8962..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 89883 zcmXVX19T-#)9{V0jkB?xjkU2hwr$&XvaxL&8{4*R+qm(c=l%XZr_OZMR9DqZ^>j6+ zTxCT?0U!VX07UmE0QLI{dV>rA{ic9udwmmg001znZ|eVwu%fuwH{IzQf&TvhDkdkZ z2mtxH0|5Lo0RYT5dPTI~#1xeU0U%O;000y!0DxrA5>rt`N=fk>hx={^q6+|k`&yjz z63QwvFnuc|{g$Qq4SL9q(x`^k`gQ;S-3kBzVg0Sp>hL+A`Tq^&RcLZJGGyLHi$g0hmm!+`sMO=>PzRzHO?@JrVK2 zH8Zky0|4O7005$IUGmUbdnJ5k#`;Fza!SA3vHb@hqjSH^zKP$ooo}4z8%QCV!T*_A zJAJnW_4~Fh^!xcPWJ8U`tZWUx`B)adX@}nc#BT^)vDSC{mJJI2-Hz}-fGhxOvC+3S z27vrW0>c6TAkQwyQ7!Fk9i0FmP~SLO9RNVXuv@G%ZRcS8-Ihh_oAFyNz}UTXxb@p3 z-{Js*3qPK4b&-BQ0^ioPaWU^00sd0 zPli5|-g{rqSWnNwAX;xv&kjN!_C8i5mURn9YKwZBKs-Dx0=(2U9u~$sWVt-RAjEGZ zS8oUm9{%f-8SZoW+k#oc_xzq74g%6)(vb%2%IKef2}h(QfZN(&s<+jmD)w-WqYM>; zA)QlVa#KS?qQm-}1I@3I6Ii^5;1q?RIsv!&UbY|1xQxv3@nz7=_USBdV3?bAt+dft z`%OmjvwV@W1Iq&tpl1`r>sWC{aZ|Tjb2&N3t;bthTyn>JTL&4(&)nUPQ}>z2A6j45 zoRqKa+5V_$*Hhv(49T}$3gLZh>OaWGB$f#~t0l|%i{8ql>VM3-ZTBAE4{9cbO^j|Vw*o@6hgRXY`V1es}lJl?H|@H zBvD+yI%FUJk#*yLb>65k;5~PW;wJXK;-PYp9TDE9s@P<`{mhhd5gM&+r{DTexC*#d za#ibstU7#Wc5LILi5k&9ogdLj+L+-SSvu;XNz!ksyv>+(=tv>N3M*Dwo#e14ElYCt(mp`J`*`!3QqL=?=z;~d z7{Oy0;Z;gEu_W=>G3H2ncroF?$3AzfAVf!oQTZ8 zrvr|$5@t(!3DqDydO&Is-tnCRNc51@V6veY{H6mpcOrHqiP_o0Nnf=N3F68=^&EK7 z45m%v?>_~Z4yH+c?@303;fVAvivnwRJ=}47?$@Q%c@hq#H&WN1z z+It&h*xJD^ca2A*d=kN5!L)tTQ>j;M``rB}##v4+OlSQL4-=`nQiu+ttWMc;*H;i} zRgUjW+2ck@Ib;#Brs0SAv0ChJS zqg4AvmbqLere09(Cu!IFxE3^3a3kf7M89c%bmgS&y9#ixzP*&@_?W5a>dI7~>F8q~ zSHug>hYBw1iOj1m7^QXK5XMFMqJWd%1Wu0jxq#N9&e6Tmr zxEKG~=m7E$$n~m+G!8*A`hjT_u-%(#fOB&Ap={9$##mw8I3MLtN?wn=J1q4sa=@xt! zb`-CrJ;mq}hw&`_?y#F&6%hH1m<<>*()?h~W$0Xd^T#B^M9k}$BP*yM$d1780$ zE?G=gK{)4f=fhn@&A3N6I=`S+9^#TgJnt)p-uyIR?4Un4n6w!yP|oG;VmGn$@Y=Gu z4m}jGBa|Etvx>T|*$C<`7-uiSYtt#qL&3A$@WSiFm@ko+ltx;+mzI_JS3Sy;_O9ZY zx-#CV&NuvQ|7Pskn`8Xk!fwPjO|{-Fi~n$M6mmCmr>K`t{;M)u(=On>Av@bLW+ShO z#!Wh#g)hpPTDEyJhre6f{`0FtMd440w|!jXa@WdhcvdC1Xbtwre8BYbn3RF3$Ax=@ z;k2f!VogOG&it`@Ov!f50B>~m=#y%9)gXocYyNA{D(N)-*A!y8tOABaBl$Di`nGAc>fsQiM+QCfmKMf0PbGE zit!VFN^!vn1t-tG?3M6PvsBEOr|nTBo2)Z)n)_@@=|5=~m#o0f4T2VC$_KBukWp4_no-&J0$h;m>ZIlMj6`wZvA;4Itqb z+ydWO@0nXo3*Y*jRnc}SzurAdnjo+MdK4(j$g2 zH=k+_@}PjHY-djw(mClGTE~6t%V4iKdxrE3{sp)axU(1XJOca!YTjKGuJu1V6CRDs z4=p*v!~-r?{1vMlp6o9|S5fJ!2xQer5R46kS-EamQlg}Ca2!Tce=eQBfpB+5HC|Is zDqiTR|Hw$1l%!bqC3u#zLmKaIlT@Jo?P`r~0tfr;HS;KB9P_5^l|vhdH?)H6k`O^I zNa5%AF`3q zy~edPOKwUC+sn}KOs;(t?zOn9FH3i^SQa%^T;v z&RIs;3lnQnxzb_GVaahOoSZ`Qo4G+xF)1iG{guNM#ELvxqdeMIOr80|%l$Ej_}zsa z$H3?@&@q0;lz4eM=S75!$|AEkR4Cnu%BK*<=D>_A_fD5~8O-PC&MZ<_J#zqyIc|3r z*VIZJsf+V1a`i`%(w-!_>H}Y47wKnP%I~f9gc!*S8j;TAhhlvC;Qc}YkC7x?uTaV9 z-?D~F-V^IGd15YUcd>_5-GZKKSEfF~1c@w@d$i+-I=@fi%cb5ynLm>cFC}lc4a)J7 zWbq4ikDOzVS4DQT(2^juZ&j-m)ch6f3u&Lik?a5BFh}oK3B)0(H&u+)z(hp!3(oJr z>G+?DDB4B+y_<102+ug}-&K4+CZoDj>ZIZf--XztzLp;?nHHy~`Lb$k4F8NPmdloz z`$G^9^a*Quuejgx0_Jz(+-(Nl9q7znbA3o$Q^M)T5}M?mDJ4P{3C{mp!{dEA<0Cz7 z?6@_P&wR$XZVt6`yw1|~eErEp=|#fZ@z@oJ^jm`+Lw9^MOOx|QZX|S64U3h$aU7C)65Qv`C@BK| zxbeLv5uD^)qFq6hW4+{05G)OVEN9B+S z=mSzkw^Nh%KWI7F7ZE~#cu52b9q!4g@1^(yM&l#qs?$l0irb3`Erd_jZz-mvaku+( zlq#e?lq$6%DsyjAALohWvrQ!wlWy8U>EyCOVAH6(0t0z+9B#MV)*V@TbRB|voq+3NMgG!vCgVyVm^Zju7~iPa zcV&=MU$_tqSw2atppu6rXldZ5q8`ak3>VNx2TCL^0=EN=Dn+Uum{+Q_R(t~#o*Db= zOf`>ND!+riRoHP1ogO9}pq*JW!t?YuFQI}M>5gIC=(2}E>ZlbCW0G#k2gz3|4wElQ zp_*&?7dyq5*B?0jJ0azzq>%GGh%p*}L5!wXOd!d)tj!8lr!<|yd1ukeeCQs1e&YXi z`tJVKS6OIw&*Qe$Xd0=E?Y-$OO>Oz{?N|Zx#%EyQC|GOfVOQ3BUAt3p(9~9J&hN?G zj*$uHLU)jNm?sXxkU3Y{%Dt8yC3xr`k{M#Wg>dL_pQKQX`l3>!UbR035zQ0IwBwHV z&RS!WcVuaQp+r>g3p!w)X^21J!~GS=Wf^n+`hFIdX-iTtLW2K%hlg5U4I z7}7FtDNflwB{QREMf%&QTws{M-!C6L4L2dCNLc-huDvp`)@mnPA+kjl^{5|nnP>{ zvbH^Cc+R)DXYoP_*Uwy1@834t&U zX?qvxeurbTl>r0vF^KE{Q!;ks;!KEZ{Eulo=Kr%#>HHW@(5PLXg2hnU(-Yl4Tn65gF!hGTy;-k2o{3 zDf@Nee&$RVZ5Xhq7Y~s4QAb0mnXYEsLB!Tp+2wk?fZsBksWfoQ7e9UwG0UsYv^Csa zB~hY?+2a>dObl3sB$UcU2@Lsr!0-x?BCC*%cK zP7GS!W;hJtL*)I&VU~ml0ihllSy6)S&;x;71&6?>Js`w7XF?lL1rQ{7{-o}u;I#42 zIAPgA#ihPSM8^!GHd-7L!fKW{t!BA~%NM>PFeG!GMFN7E|90)o7s(=hzM)|7XW~l| ztxkUX#rSY6WD+!rWWCwQHeHGSUKR(jX#d1;bBvmjQ^J1XL_|T=Sjs!m!{CZiLC^!XGCh(YRxRnLM56zpY-69Kdg*x=3 z8`X97RLYy*)OJ)h`w55|w8K@`x3Pm{KSdzaIC%~8D%6{ zR!8fI#4buK9G&5Hd+Nba8sxQV6Z-Mar1hNsa#qxiJfLI$?2r!Mvg-?}L^~?qXCkE> zq>((qqU0gK-c6&pY|#i#VQFC1TjP+Ma+k~S0qv`#Uz;)W?{8!y5q3Nsj6RZE9xB^_ zk4RY$DkM7ARN_>FenPLPh`g9_85JEDX6qqgFpBo!FW5nb$}!19Yf2z#)+yT)WRAlj z%BI|N%OFS#aUpd8Q+~olz8(bYpiUAR>)tJ+x0v8yLr)I(8|tE(_NNk8tI9+mp+UB9 z^u0nR13nkK5_QcC=%F)z9^2IX+aYSl!H|0mDY`@jsWk2L4c)zGk>~&X(uS5oS_7zS zWao! zBA|k{II|kr5}~q%sfPi9=vSk57zcZ0u$sinkmcP%b(p1^VvliI!;LKT!i~XZr-K;f zhiriDObT5okpTS(7#b1b1-S((8X^v8=J_MEF1F1;VDcA&d=e6(buyuAJ3fG7g{Mh( z?IVQ>{gTZ5p&Q2M$1Uunto(8*U)UjWGgxviLHI{$@_ZVoc#yJ9#5_Cr=;t^L7v(Yd z9Y0WJ6mP^Np^AhKXDQBki-!rSsuyvl82nN+B)`Ute^S?A)WzJC06zWB4aq>kY@rR* z{tMWa)F|Y%iNkn|CP%(~??XfRBnc7G>~ksD@Al-+*f?4e#! zA5B8X?(NCNJMrg9F*#)Sfxios$3qpNx5I+>+{QdN3=;&Kb??cBZqD<(n@ehUQVD14 z+?24fKC1`tQSZc@i>cBm7eI`iE2B7nVZQf%4{PnAx1VKPX(SVV+eK}v9{+z>Qw+20 z^Rwk#|HI+lH@S^cZK{21nKxyS(oWeI$Le~Mts?YKb>NQONRE8?dfJ;vni&7QmEn0q zY<`ySN1mB^S01ywKR7-@27}^7d|w^nCmuNx`9O zlP4gUYvbJ!2CyKUHmK>YcMI)-a{yMUNWz*DZ=;qLRvdL9ns32bK^_6S9zv3Q+HFs` zLAdY^#0v0tS6qJ|99vm?*@7>;V=u<&@UQsLH#4tn8)FLWa%YItG2N#YG8mICs`G$+ zpA3uH*gPw5P}xdEV>RsR`Gw)u_fAoRNKeRbI!U2!@xu|KPsR6HjCPm|{)8Z~K;xe1 zkUoRUknW_5nNk|@7}$USXgx>XKdwR^{mu)Gbi#T8WVd4dwCU3Zl-kQU<<()E>btjM zxDo+K-2p^+s6|$b6w>Kl> zy%c)66S9yo_Ua6STxq1Trsj~fs~)w8VxrJ$NQq4e-@ES05cY?$ims(L>=cX|06w+E z80KED>v^27kHD}TS2GGc-Kfn#v4EyJjuNz^mTEa3h#nSU=S7(fnmB^Gssy6LqMO5F zZBAM1M+VuulTU+aEWNIwme(t6$CTQ;laXYkAP@zTqZGVFl#zecXpAV*F`6-F7=xwZ z{@4e`A}ljIJ|Zj*K3&K&@LX>(QP-dK5r&Vm-bIBlHXu1~PcSry7FuY=^zWX_+Oots z6ob-sfgC4+xV;@>jIUP`*3n)^R<_q0$T^0q4_R6;`#g5SN1x?W%e~uC(MD_84e}7go1<>24C!fHT*F(0&Q}N$f}lKS$~#FMZrU3QL8o`0 z!v*6`lI#y?7Pg-(RsMyO33VQGJV9Y@H>PMd`Llc43vrn4IGb|ZS3h6?d*d1pPE~!W zC#kk30SA4`RXheDSd#7lHpEZ&g6sD{aPLr)&uI;RKi`Q$$WIQK}Z4 z*Y5ZkDUO!akYZ{$e($QVI+>2&SN>*Zy%|pLx_UXXIF_+L>JD*etwUBVUCtk86TTmNw?dCFMR?me%X&~m;UO-6MJQ;g4 zSndZ$R_jqnQDdG^Q21FzWxbtJD;RovVuUV$=*p=A!fLPu8LfG9vCOR`w5dtC0WDwA zGzYqZoN z8$JHQfyJB)F{T+Ab)*~&mwbG9)*mLD;ga)v^uWe3q>B4f7%+|^2;(5 z@ge}4QbBR7G`Wzrm$$ds(z2XO$YN_zdX>K;J;ODKlApBsK|<>v(FA0E2-Da;sxJBH z4aUy4eTl;1f<9vAgrC_y2aYe=YRW=RheT;Gx^zD+9-U5o=jwX@Y7va8&;ZqCG`zFA zs;Z+(-ky#7eci%ccM>U7{#xc_YPl#@J(nt#ibs?ZgeBGX=yKO#M?CDI_x7*0R?D%M zWmJ({luspPRlmpjczNq{@`|zQCTWDA!L%asN7J~)h> zp{D$v!hl`_2E~3_R{PT7yG=Er3`81QkYRB4@hL2g41C!Oppm&*h$8M-8YVjRM!qF_G-Kp66QdJGGyNr+51C8A7!JL+j)je{33UmeXp>*aD-Wd=Ghv^0 zJdFX%6#m;$Y!-|@9TfbZ)8H%v$u^2-7IyrxR9J-ST51 z1h!RTF!UF?=f5e%0(IAic$whqgYy+flQ5~np=uKXn^O0->PIo)JWJr!8xfS3VUcwT z`{Rs3R1lA2br61I}2eMl)=uxXJ<*#0c%GwljeT?@I?24we z6qm}1G+ywZPst>%N*EhPK}DG)yhQb-D8X2h^3SYjGA+a5 z=v{+lHi0w*a;t`j5h5fw!vZ%Wk6J7!ISGJ%XV^~mtSr61sP2eo%y-PD;4oEOr?Gsf z$vGx~jw-|zZt-LMwmBLYSauv|YJjc~5FR<|XJZjFSyF7xHRD_on;w(<)>TyzT{uVz zGSbhngYR$p#=Mvt_Aa@omR`MPo4a-MzJ_0f9rtC5s*WljkqIcV)6uUfJ~{n;v1 zGeN@eKr##06vK|X7)H;JSL(v8&1T};_f1nRy@xAR`bF9`YbFOcw_uh89)pc~*1yb* zPl#~|!jJQ{PKUHMta~i-@}2SY;vo&47qwiq*Q4-4EI5?5t1bChA0;kA5JKw)6FWJY zt4xrg;$g)?%YRkatK+1PRzux1`H#SsTajhfl|rt>wf|XM z@wC@*7hkpZ0ypMnV=;kZ(sNzZrKA0O1gT>jbnT zB=^!>OsC-YWn<>{z=6C%-ldVbAOl&e}-IneFLQ~SfOXs_fyo8+KwOyl&H4| zc?F$kbRPSf9juIC&9SgP&54buK?2f@cXDT4CDl=QL&&5{$P5R9lcu?xX-{_^*|#>d zZ0izqC|?c7jU2jl@H&()WQ62~jiem{OjG!e_z1*2(QY0aL39p0+FGE@K#!Cy93qk<^_WEm>XSH$d}v+aF9P(B|%A~y%XoglE-rqI3F zxxEbb7pgBgFeYfwCt;gUc8H}_Qvm2dhz+asRTg$s6*zP}SyZVx{mQP@Uw`;|Xk!C} zT0fl}ESK>;OQEJ%1bY!wLvahrRpDzZ@ovmRhDkC41XGHHjH2b@jo1#^*aosi;iV7! z-o%eqxVmxIrF`a4}rgUBMsMk2je?9$1LmK z8MZ%x<3h{4-+|xr^7W*md~%a6_5++j6sMWHro$)@)eW@&*iw=mk(r-!_({k8ksw8; zdyYFjsNV7}^7tY-b2Fj-d^pRFY6xK$v4iC@d)+C%PQvNG81Y{4_*N~q#767bO%^Bv zHt~w+t0yngnA^GCT63&N+AYw#7C58MQ-J3b@^6hMYcjXKx{HkO4_sY(-cZ*w@~Q*g zq?3Yj5LWDRRo3O1YrCKNIY|L)xSj%O)7RDS&xUmcGXzM;Pp6_tD5=}gAymP&MttA& z!Ke@DRjqDka6ANL3lyl|1%A~LQD=3H0?~5pNlk5WyPE5XGzVaxdNoMzY5siPzPvd< zktiy9U*iF)+53N<_TW3IPfj&nI;_&kgEJ(hJh4Tj-D!FR*?cy1|jDe?}( z`3e^9%bF|SY{vIv&a0g>NT&^0&)Hlq`lE`-J`)M{rfXNQe+B&Nm)L}USI1p~KG(mT zS94MeGr*W?=(o`6)@x$hxO>;W&9T6eu%G?%mg zZm#S|_vYn_2kooO=W%f?%%S+6$n}tLprIk6q+a8KRD*$rgqWO-z>>K@d~)ur|2ahU z#n_V_G}@Tjj%*F(+f12v^HKaO&<*p0MGdik{{#T7L_i3D zpIeaanx+K`glWJigYRoJgH8GN*@;T4!7_rX z!K+2c0p$hiYr!8Wgvt|U4$jn~fASi(fOI)I!rW9P=1@!2KrN2EG}%jVa0;=95GXbt zeQtK-C@;3wZ8M1?G|Bz09?40RWiCDf{5ZUJ97xQ+CWs!f>Fq%$E+h|m*g*SJ>+8G^ z=*sfbHgwIzY>pJ-YiDLL;hNtk=$v~Rp!nclpj?lCkzY=oLr(HbHdf67P%Ija_77Q0 zs7~?l@wxJDa)!N9J+VltT*bh}!n;pqYwFnE70BF?r3wUR!Vj_Z4r@cc>8kf zxm4EM&~1WxJ~~e9Ii}P|!Av_N1_Xw zPWQ2w3gZ0OfA-JR{(htRv_}TKin<|FV z_vQ|0`~e#6?6)BN7(=El^Ktpy{dF1fv+H|=c-xGc?MByje}*o8U2sLpYUf}W&O3H* z3-J6f_M>pphXhXT+ts{Z{omTJf#>Jyy@9KGru#FNjSv30&Fzmw+p#F z6mskBadAl@pBug_{D>YG?e$;=#6}IgImdZ{4Q{V1h+sxfX9rwum+I{Any4>uysE8N zRk)k8YhrFpY>Uxhm$qN6AXQG+Ln&g4$#`|Bm*lh_g|>?Blzd0VYa6vTOZ5HwE}1do zCrvNz=~|~_v#a)3$Nz9B3`OsmKv>W4Q;`n+^v3=BWeqRaD0;-}lNa)`@EZoF?$(=a z1Nox8(o4 zm3pp8paxPSO>>yD0mIUAjpXDQq0yjDt$pM7Wb@t~hdc*XS$29j%^N;GRO9yXNeozD z88g}c(mMg?Z^*r7?6I+757s9$J%4IMQ8^&Re1l5Ml!n5w2BP%ZnuGruD#peGdS8M< z?cvSSPs%)`u{qvijpfxZhZ@R7U$fnG?Czm0YJ@)T77&1k5j^MG54Z66@SCUQ(;mlE zj|=Vf0sJIg7SX%MqWZ%DKh#)D6bFYIPwm#T?%b%!zF)1SpkS1TE8YRhwT$3XL)rZP z*!Xq-{B%9z4*l@D!|Nl;eTJjP=1=1r^+EO5OY_(JvF$zZ=l5K+ds6b@ORwU{=H+5z zyjCkyRRPv5`v&cS?b8{DQ7jc??1gKS#`pgJ!i|Sp@C$M=GtlQub{zH*;e#n4E0iFc zk3g8--L+dwc3|T~P#q&K!$niYw}-X&8KONX_ZEEmTIh(h83X%4U&P?%sx#py#y;TI zY}hP;o9?3x!0F-Ya&EB^K86JvKtIkRWH8`{M3i!RXzY%=dCy|yhNJMi+bW^|Lhoi+ zKYdALOJ4?6%hMUDrZ{FyA-e2gW1?S^bHh;CI}3xn@fX$K!|rK*n*HLJb-0xxg18we z$rxlY4q9da#9_>1OXkt76aBdLyMvD!L6b38Rn0h)sv_$?LE$jIexplM&4SUn-;3;D zy9-%S#O{g91@G0Rf82{J=go_+R%0%jzVARrk3-)ir%;2ODJ0r`Fvol2&ELG8TsmR0 zy&8rs(dQFwK^un+Sxx7X$%>`NkNODLr}E7ZUm#W(jo9mDTs4(6p8r09(UD-z1dbNS zBa`NxOUo4Cg|fkCH8n^yZ-oCUGC&Epyo31GZ;QNrJetl?K&OvG9W=W$OG59tWX6{d zZ}YU8>>FuV;K-_0DkjfaD#cz0UoWzCX))fI_@d51(LbK{%?o z(OiPPZ*$-8v6Xs3FL!6pS$$~#PwsHYCn7BQbX@pKFqyM)`b&O!HS1&ab@>{JZ!7Vd z^6TL6?K-BLk9X?a9EX|N7n7X*>oMl*vu1nw(DnPg>r1Wqsy_G5Q-Fz$QNAb;%2qm+G3Krm9jEg$XDl7F>!ic6K7G1#XmHZ zSa)h;O1WIZ+&^h?;wDDO;MhS-N$MfQMNG0dxcm#bFvyTZLr}fHGCjqiW1*1-C^(*9 zn=`Psyzj_$yT6W#pDXK^HI6}N0Jw9|;l4!dFEYv%r<^c(3+F7D zKB#+(=+3i0Xn*kYvB4CVi?cmSmETH@7-g`L4@)seOmI0aRPB4%j7&PfZC+jp$#!rs z%u3$HcY5fQr<^|Ch`JeeI+|mfr~dpNKDTRdQ@x`Af4~OqFHuMXw;nl?W!S2 zb6ZL`Qjh{Oq_(iumOrPh2L@}vZ5TXn-D_CZEwz0uafLL7=#)0b$CQ-ktDwJeyRbh= zUI^2&C!<%OYvXHUWTE0=(fvjI`xMp`#fCsEz;P4E-FvxXW=G0_iwlbgz8)A87~C76 z=kkj=6-NqI6f(GXhmdasu1&0tL_IF@4`n>QIhs8QRUA$n@MiKR>gMq#?Z(gU*-oa# zyQTW8hv8NgDER^L>E&C^x1O^bbMN^w`EkMBy_x1?dUmO6`{{iD%ooV#;^w*k%o%zS z`7WztuTZ1~`_*a@s;Lk*PY?sHbflsr!YZTUOqvgAK@8I<_j9x~FeNUatu*x2%uh8o zJS3AB6MwEn`V=~kk?Drol@e9@hO2G{ZPhGyKDw@{jk*wLjUBDcN(9Pvan`A?|bHZ4yYd z{W!FP8ff}F;r~F+Yauk9+h#nU`kxYgrpn!Sat-Ls4B(FM9JxA(6XxR>2A<+id(vAo*1)gv1#n;gz~9D zT^MJa37-=T^ZC+mA#IcCKLq4rsXyn2N5xH2j%p%!`!`Z~E#stKnOgfcg1SuNXwywg zZGW*BksQ!FGQaY=_iSYP2;(!~XTqPe!8EZKmy2l3|JF>H*a$Hpkmfl;bOMVXo6z|= z6?mKKcoG|250_xQE8Lgpi`gyYF~^Cazdgwk@lb4vG8JzJIbqP}GlKkDDl!CSgBQ^u z>xp55y%8JS{=L^poNxlFu!Z@weE8D7o_0L@JR)>dt)QCV~zf5)s}rBfc9fygl5hY-5lPrQL(8x%YZ?v^QOOM7qfnkmA8Y2FdTGF59; zz)V*c*kuuy#s3NuagooU4wT~GSBSWPWTHWNQs#y7x{8}Nj_=&5p`z;E{@`aZi3^mI zwNL_ZJ|GduCQW~*P`IsW$NrP)|Aibf&4G3Y`3EDOjs`x7#-$iuhBT238FCv`#DZ+j zm4B>n&)<}jt^RN@wxv)$l)mfji`)D25_~5e-2JCd5O9dJNf+k*lHq`GTZbJcXuj=? zCyXuvZg^1yGL;7D3FVqq0Mmn4Hz4oFV%a7M?=OlB zj@5~GkJ}gE4_YT&3dvYghBmCq1)BMFV^!Z}-M{}oh#|Q@rd%jCvXO4eZZ(1*I z>7Q%?Eb6|Aol!k7rJ@l+Pz;bWQ++*Cz2&WM0XrHQRJ(hffkZ@<24DpbkRc-ok=_7T zL8P?*a#hg2b7B+$|K-LYeQ^PhKvBMd4FC_C_YL*m^#cHs+ZtUToK!j#C_qmvtze03 ztaXV~G7CvqxZ&^LL}FrvW2^$RGQ)3LnOIiQNl#v5qMBi*{mH^Bvlw3J#D{_yItntH z?u5EU7NO%1mVuOEB;yd4Aw1*q0sS^68rr~D_YvVecaSS>Y_j5m;$R7mEVeA3V4NIv zB3xAnn?THVlzTHT2TLlpl~2q|HWp;)s6OP%+G+0m$b95{2(r)LSNH>|N9^^qkC_%Z z>ysh%5%mZ4-qoXeZvDhxnrb^A$6CW=!UqX6i&}Y;yVSJ7Qi|j<`Nc-d#*q9|6PG4BD}pB+ zE~a4UaBy|+-Tv)%26%rvczbxecpDB(241;+XNN6D&E-W>a$6uCioD2kmlg!|1unO!*co|W9QFl@25aNPhVPZT}NK;~_xU^I$19F~(tkG#S z6NwSEyC3dZ9p1riMQ`C(;kRQTMF9#z=DDSmJc&NxVS9xwR5Xc`6&)3y72K*ZrE=7n zI3gm7FiJQ{B6Rt%r8EoDXZWnK5aY1Z;ZuDkadi@P7Ika&59$%>+$=2o!@Lh?xUVJp4Y)bk1Jqg~dK##+m` zWx3^>WsJMA`^cPMyy|1e2N}F%UK)30(GdE&F$JoWR{-iu&Mp2X5aR zAEcZyWDWk^8`*o+%xjjg39~u1?WEFAW=U*Fj7({fz>omd73kJ@v#3W?r>4AQ-~p!J zIS(&yF}b9DxqMo0T}G|9gXZNb5Ta8;Oa@$XS8@ltN?a>#V0WM*W57rT9}3E~_+mP$ zx~aM@>rTcm=WYY`H`QnsTQy&Ek!PiL+wk*ZPjF zWFf0UQiCoRnX{y~LbsEq2O&>fuMxC*B0QO7Qk*e7wx$XxO@i`BAyaUr`V!In$g8ms zQ~Ly&W+jSm=u5RWJ~2bG>KOW+ORJ1c^7N?cA@^N^hMTn%U0$*dO*QM1&4S2c*qOJ113wH4*rgxN3@G6*@D)EQ zJ$yA#6@LW1pDR$&i^$G@aq^;-kjiC!G~UgNC~8W&OdpTOa^6^vS-B?r>c>oJrr)QV zvM+hK&jz2*JP^8r-t%8XY7mw}%%?5mZ1Wm^SH1EHaWzd9uU`p0<-OW@U-8;*Yiyfr z%WV7OSII6WJg|6Y`-u9!(_AkH`~30M|2ndr*>)ntjRX`3u%yDq^W&sKIrI?MqR~PP z>LHZ6Rlq3uZ|X6uAmIqWoq!+rh}c0q1ZwW!yRjg%0Dk_#%Y{EcU_rFP4oA@FKf8}T zMwl+iwuSG5JPqvYec2}Qwf)$%q-70Y_`?vyV8!4PdKa=5swEWKAG=$-JEFhv%O{m9 zldqCBi+wQFj=V0+d@o%>ia24R!AyhMIt@`YKvYnSSagGgh9rZ;lLUl$VuA@X4Z`H# zs^wFL>x5Xrj6AT^Oo^);*BWmVkEaP-6B(lr!jMR#jaFkkchH3MUx*r`N`8`!v8MYH zlVy>zjdjCXCH;B4^XBVNvhDurm{n5K{=Xf@0W1f2W>H+tpX+s~7c8EE+Q!%ap4X*a zO2GCBxlRz90I=s6?BO}J5WhHVGI@0vw^(e_{-zR2+fk6BriZn{To0@b z91Tnj_%n~dIQC_s$h0wUk2>FF(a3Z=S~6KM+5F(9N>7v;qex1aOxRDT9u21ILo+US z=5oVfjLH<1-Y*WDUpP%ZjW&OS_aZka_F*$hX4hn^NYl>oW^U*9JP~YH&?d#4Ts&B_ z$9s=^4Shgb$F+*)HcegsP`o*w{cWAiYMa{JLE2UL{d4+3*FkqfyWxgH^W5f{ju-j| z?1#kN7|_Bs&q@EB^~m|~Ja0KPLOUXTFss|lm-VBu7OfSnzEB;M2McLd=((21D`sZ? z?DWp;x5squ@CEjBONW3?D&|$x4V!zTPP?lkrvY~Rgl00WWy*4jtk)lcMT$FTpobS% zPOs_R>R0hcXG@>O`y!IUq^TPyp2Ny=_(3!PA2q=QMnwibB=^jQQFSU4XJ za9Nmf4r|BE3sf>1;@K!LCPXnX=m_UPWoY$qdslcl)|(;UBGnCR8IJ*MdT(BkIhT&S z``qi`Irb~F&*fZFk|ZGK*InD!U)vvzZOY}<)gIT270)`I&*Aa%B@)zYWc3R0MTLDz z(M$?43Ql+O;SxHzdvfVTMzcy9*R$^LTro1Xa{rVw%Vu{zjy?L-@ykn#>zg>P3kpBSn{Zfgz`Bf<_`269 zzks@I^Pv{!XBNxMTd^cc;|q%mX61(-t^Cnyi~Tz{La!Z%iKf zv;5o-kOx2;{@U=bu>B_x{5sNY+P+ERQP+bO{%AOWjFd`Buw~Big3WirwYfyiPDH+4 zy97{PWLs>N67$g~Z`qUwtPmphS#H^o_E} zE4zKUFDt|oZ-c7Ea>vHMJ-YknOZWOqH+PO~Q5=({QIeIvRx535orDAS;SJ4eK#^_L zuHUZ2zE6MoV)Cc+D_980ji>DCKbk7BSrS>9E`m>K-qusx_w|Q^1hkOlKH4fHjWQPJ z%)MN5OhSwP{(s_-7XuJ7;{KqRl%&Xdb|C%elnq$dC(dTj+3zOoJud*xGPo+qP}nw(VqNYh!z3 z+u3MiJNaTeU#y#RPTgB|tGb@*=iggB)9>_jb@xm=u&uSgg)KXEZIAJt%871p*7qh7<^KFzC}Kq7C}U|>-7PgjO%o~)eKDGBU= zh@ZtQ?)}rw`(V){()Dl=knr9eKo}ZLGS{RJT0wSv1MLm~sUz$^FF*KMf_77n%YZX$ z4CRInp@s>P3JIDDDP#_+qz&?4_WxAQgrq)ov_Zvv#UF!`aAEV4P#Abk(^z1rX*Ff3 zM}DB@a5t9414BRMEb`iDPwvA@9(ofHERi|%o#ib(Ic)zSSf>2t?wZSQ=*wqM#gvH7 zNA%M9E5Lyl^9)AZTXcwP2LpR}knzJc1rAr@`mY09S*SZiAeRC!!zr7-M_ z?7fuhs)?h+jW^l`c~A3+zS)41VL=|xNi(f}gNTm?G%#L>{;;60)@-?n=ZMOLQ2U#r znQ3$b0&l^7Z;Zb&RtpQ{;K_~a31+{EL6S$z-R$Gv`n}}}e3Z|25bWgDm2w1lqPAIw zaQrpNjwW-!S|9Q&+A)Kv|8+Sznr`d*e9(J&D&oPpa+GJM>hl&bUxsNfj6By@vbgv& zOq<*3=wJ^+HikM3Z2k|am+25?*s~hFK*cj#J({_X9hSBxn zG;cTONnOcGD}MduWiIc6|Ex#B13&teY#L8&uQaW(o7d9Nhfw|a#15m&pt4!NGL;te zfm2<$yAZP94-GJ*EW4}oi0NEjHzfSdr)~XfUjRdNGnS5)VvkS{)=2oSddiTWcH=UQ z@e2$@GHjaspR>- z&y?%L2ZCNz*^?0I-eE9ChO5EB_>By`cC=he)SDWeypa>KBLkoN6{J4DHDOv-OJZ9$ zu%n)|Pjn{vxkBQPtvJ))&|bd9~n=?0@Bo%>TSLWSw?2axByD)ZIeJqI%n z@^mvR8!NnS0o%3(y>1D5(&_i5-|5l#FQ)BmAwJX$YSl1lR55AL#xB8`w)~gTcEA6W z+T$7Tm!qDi+D!H6P33kiz;LnTpddf2GdA!S zO{l98aPx%GR{uP&O-LspIQ_ubtO|;G4i5Bk@nHoABdbRPcG$}F1?=sNUaJurxL)@> zDHJh=%Z?KIIbm+Mfd~YEyZuwqtd){f@oV3~{{Vy~KoJlofKCm{r3>N6Mszzx5>KA- z$t;g8tU3DW>&EoFiR`~59Wm69T5*I=>dtn*7O~sL1I_UTCl#8TGSw8Hl&TmH)s`w} zfsfE??D1vnzsGcc7I1Q6(5mV|I__eCu?*V$ER2XnaYd3SAcCTb{6Pg%mxZ8&0**ce z0?8cu3;l)w6QY2hK8?bA6#|q)_^uB`Q}9Rw&+ZpUHc`?E%8!uLmu@2B-{R~knZbQ9 zC6NMVa_nvh6I-SOJC)T78=V3h9i?lSCx9jFb5Fh#d-jD)6N=n2)~rriPe^TFV|#(N zii!LzF7D>5w9M``rB~}&e ztOkKmE@l1WKu>soC)9Q>DBU0_Fvi;i{s>B?B^MCrJRo73AVpX~Cm2B|kVHP9kp}-| z%-9eLIernnz9?5KteZp&qU zScMvVYfqYj-+<1cpEJ@90-yw*Y8+K85M^C0!lSd;D5ipnlP)87Vsi@)GxX+v0_}!2 ziNVNNmHcDY3xZ8OB;6kSJ&EG`6JMrWI#}WqhGh)JYnaXWKL6QU9$OY#q;(SVhxE!0 zDKv?}bp>f!SFZ-~X#`aqM$pDwQD2HbZT4Bta6VlG_dyjP15n?DD6#6${0OazBEf@k z4~6^sf_l}n5(<~+HBC=i_w#dlPtz{(9Nj>!zbH<08D^t7=^EmGx708(z_>P{-?OI* z8PO0i{Rg{EK!PiR`qjQw5u*Ui6PZ>mHxRfK>{1C@Galnx$&WOz)vZGY(Hm{iLJFg;VRB=dJB&yJ<|v?^_{pIpyko|rv(KG4-WZTasW;emKIOkcnVQg#|xVY ze#jPTj~#v}#=8zXas}bP?0aLu%+QhR*rlWWL7g)5wa35s+`XC@G5yCL!J{EBsnG&# zx`eGF-|h@!uX{90(RIw)^x97|3&NjS-LQPsm}=$)8UAUx0AYz)NfkRE1Z|!e+em=5 z=*ng~3zsFspTKNn0>R6}LOCua4DjT9tmo(d%&R_MPOC_8(!c22usa)z};)V>!1!a{4G;p(4W`6 zgn-cIQt*>48=t9k%ltKAL6(WYYrwAW(qYp5R8@Lv)dWEG4zS->^mp$j2Jp7c*QqU9 z=k3r6Bzy)J^Z3ig2E{g{a*f`r9F|?3>{m?J<=ohn;#Yi@>}FDJ=m+XFrdj|wHUfrj z1q#;;0;vP>UyS6V#cHMUf_KdPF3&a6C|4?&Y74A)-cQ9B^(6(rQlAs@TsDqv4$F~G zn>hPS;3)uNVyh>@F8{DHs~tQUR*+S_{}VGp+OQH7KSul3#g~FsIE0d*whsiPM__{Jarnji<-1zZS1b?(u&+UK{1ZHJ!)xYmM$4 ze}#>XU8x|RdgFhE`cCs;lTs-8V~zw_1B?5T=VZd(4?_Bq{w-0SO4*wNI;~*G?)RRm zEz6ZMQ1IoShvWJgflS`VVFWfe$7~ZWdq(chNru-C_)HMCUq z{HjQHI#F@pR}XRKNw{ zl9&&jIDgb=iMO7@yhggfqZvrvl%a?6^Q@rQxbQpAjJ_WC`A^iec|66|o}Ng2VOz=i z*vbGTN9G+*B|WaFEdr8@+x?d`t?+l4<#UTM9rGDDW4z*EO+~|=GHy9YjYJ_=m0(wu zKsnUJJY4VIDj+rj`dbbATL}yHpzYp3|HJZEg>P!Basck?%G2Z;?9MZ(8+kugOr1y7 zkIyr$H=KCZuK^j3IDcH(p|VF<5qqbjF2;hrka_W>Tb4TE=ANatUl{*26wzW~-@oEE zNhH(=m%^9w{%ZJarpLi{-uP?W(^FWe@Ylk}+n2M3;#I_W_@TpY;(!a9(%hK04Bp7mmQz~TO~S}X4j)T0*Ux^V!?pA>_Q z2+ED*mv67f6pG*lUk~oV+awVTU-zDN5x#EYAJ-P%V;L`E^+{VP!OJKIPo`%7fm<^! z9hQuPUrc?~SsJfW_O8QlOi_ME3T$~+8xE0%AyQ8pfV4cCt!TN@^f_a?^wa{yTrr1hJ>`iSl*WnB z_n#U%UR#)GOwdSdtY7<2-Lj9h8;M0gEHcS_2L7;hu8wk0H2xQZjc6Yc?JCTp$cvXo zj=@V@%o_&8L8!Hv0s?pH5RKG;Py&80C#=`Q-YqfBc5LoUiS0eIqlAtq>m?J$_t&9Pi9&a^K&tMg#9FUsm2}0{ktm@zwIR zVVbi5E6(av<+DO^y*?ZB8Hm&MlF>3}5~W2L51q-7ZV+b18>0V7U4KaTx0pp~h@crX zrg1Z>w{W7w6VhepHLBR={2N2bMPP(E0k}c=mi%$9Rt)3aN3^Uxli}2U`&)bA_I$UN z-_i8?taMJVpt}T>nT=SF*ue1>J~eGuufShX2jJ0u&0J{_#L$m3W=DEoQ|yBR_W-}Z zVl}%|vCxFd!^E;8@86gAED7ou+TycgZA48pR?QOzX$9Re0Wrb_S%m^={SOPWC+c7B zr|j?->Twf<8k5tUjoAp2NIB&`mnw1QGH*Q|#ihi-(43S%)^V{`G^m>>2s9TR7~sdZ z_YEiIj{`C;VU=@CU+7^uzi%HMoG`!vfnc*KJ$7HaqlPW9C9c+wgqHyGFKxTe-I^~d zn+YymiPjcHcOSl7)tb|XU<=7*jf;y-HAe#gCeG#-l4&f@mZ`;M_^GwROeFXxMo?fX z`q%qOvuuNIOEt08zj(n2ahacJkfueU%*tX_@B?9<%}_8xToD9eAgqwhMIaf}AQo^z znIb`%U`Ayq4bwGv8Dd`d+>WtRrn+`arpuY`)n;7~FRu1s2s>Q@Tg-X6T}9(8S<~@m zIC%2=C;#FWx>iDS>a;Hwywz%YtI{o%!n3JqbGbdD- zTd9{=O&>D-t6+~18yDQb%)}w_6Bpdn6o%jEW0<0U8mhhtw!R7U!VZKN_rJ_}LqyC$ z&jfV{#{~t3&~5r&z3OgT!;!eYr^D5^d}FD#!s~=AE+EY+xi1J+5Z}POF|HGAw{Yu{ zUI@1>zqV=Rv&gaC6Jo)i{{8vqY{mvpydW@rS$nN>^BsfQEvSQW2li%OM z#6upd0Q+AS%3>o95Wh&!P9UFR8OCjrNgK=6{v+f+yIa0pC)4FkC>Yg5u+gt;|vCBwS*(=cWO+lyq~h19xX;<`~~ z?8YP3k>%g?h20p$Eh2~>`0GQ+#|MLj03QT`tYr@W|K)o*_vKIQH{V2mNp7GtGn08W zBM!WY-h85T3qo8Y|6f&1-56Tb0sdFJ0Nr;h!=FK`y*Bw5dKD3Z?u?v;dt6+Q>6htg zrD9bKDg@*N?wX{GI(NR-U8~J=f+&gP_(86**l`=rO6SpFA%L9i({jX?e7{H>p$#g%RtF>QVG=(da2^BlrRw+ zOSDnL(cMw;SB!!zR#`fe_0snT`4YoZq?Wy8yD}|I^&1~|4b55SD*8msHoudRFvfO|b~i*G%)61CQeEmjR~cnN6T6{f9yw#*Bbn+H&E%-Pg7jxv z=7Q#Ts)5%%XTof+C%g}PMZPQN(S59Q>#bqHUrx+`RunS8pAc;8^5>~KGsqxJZPHRh zC!G+EhaC1LthcnA+$wd%-Vq|7jsrVG0BWtJz(C;d$shgjmq9NH_NlfSLvq^dzPuVN zkPh0R&Ao|`_3pJVdKfiFE?mo=h!g70NOa1pGJe$U(+fA^PjKh<^f#d_JfEo1z{ zP5we;FF5o>)qE?e$7$=uPM)$#izSpEUH@Ao*PfhmMG5hPe=~G*$WEO-~UTapIyxT_}StTLLo@wvfk&JECDp-4j)0Y7fV^-6VTlOnMINb~NHDB*OK=_Zcc4SNYM5kmDeAc>De0z$6?EJ@MB}4^nz|k_Af7bZzmCut6@49s^G+2D0kt@~XS|FJbJ;s*$!s4EyuO z@`&#fbf^ADm3Bm{a9vde;nf{FDI&qWO~~9_!ScBqJNvTGHsNU`4r$&16m+m6d;c+; zKhmo&dl>h%4DFA;8#Q`d2DOPMTH%AEMeh_48MN39hypfHDtQo@|FEEWH3OZ7ADFU7 zkR+w9winjAeVogfvo+eRo)Z40Q@cPd1Sr`e*4S9xcpHaRl~?;&+a0@+6LlTv*qto$ z@6kW4Ejd~(8Bu65?dX>(h>Xr|l`FTZ2xip80%A|{nd8+@oH)lwwD{*K#XZfnK!>=$ zTF0IRs#t-@@DoE!ooU6Iv!HYNR(NcS(lutZzGxko*D)}I$q}5(MZsOu0H3gn@$=m# z-PuvGK=)Vj=lF1*);+zNAkE>y_daWd?faybMt4Fkk1|6J_m5D!19Tt9Qxu>VsZV_~ ztUuU>!xx<3CyakB?LF3~uj7`Q}jCXw>_Wl%nL8F z-?{GCd;0zHS2=LP(V0sJ1_f^kt&Zm>ql}5`uLsCH%q!jPM%k?BY@Lj*>k`1&*20xwe>ADO z)(t_KvDnt*YBPHIVl#TQPM0g(PmWM7ipo9M<;H+A2V4u$n*`Ie=*Gkp&v61$LDDPd z$N6seOzMvbI*B69!S(7GExNT^y%9t6n>9ND(Nw_{+!-CZA3%b@=P0{!!=|NyyeIb8 zDY(qR3rAqCCB82E=kx`dv7p~=S(xvi7&)(s8Z3%E`O$dh-9G%0JizReM8h?E26!?7 z@9sb0ykAAQ*`SOdd-Kv-&hdm|#OX#->8@Hs{UJhev>pO?%ej;&u1bMIg5s9K2!k9R zJyxcg_W=(56g@fc{7TSi_L04{7PEhNcU{k`J(ir}meSp%0%hL|x7DuMARma+3%9kd znZgi2+wz($$*|zMXKKT}D(IF3F=UtIGjLw9k_|4BPUU&d9IGUeeN?EC-#@ohpkG-C zM7@kL{bK}>Y4Jvc)lqRh#gN$;G=7Hwif)w9;MV4+F(q-kOf4eVSu?WCH}J$QzeBQ< z!SFGt?Dy#|H&482M|>%DfWLx+Bh?1!_gQj|o?rC7_>bH-$=uLwTTGPBo~Izuhk0c8 z@~z87A{}Zw@KSmFjW6wju+)#M*7o*H{(aO50hUlNCB*$Qk)AW{a&@GZgK{gbkTRdm zTUlA(#?`C2aZVX{ej+rTDb?0VcZpy8fi}RIgxJu^rf7*_<#pOUjbj;Lp}o;DeHu!W#zDAYp$*XH zS>Br8+}hflmw(S^01NIoc?(KTpqmS%-BVDTuxjIahIG8#0agED3U<649&&mEl@u=0 zeVd=c?PL`D>3uO7@wZOej?^L-K_UdjAwBF|_1LjT+hgJV#lLOSWdgf>mZP~6C~HRR z?`-6^1GIhyy`jDTQ934#&PU1YvI%jYGQXwx`)cH#s^^C3Rp28*4W3=iK;C;V6FF2Jx#cW)=RXoPW)oe>0qY#mSy);z#XmNYHHQQQus(cp@cp)1) zH29S8-ybb?^oN!A?j=h&zu`Q8B48)9{bb{=CWQ+5Tgh>TSQ(!8C{#6ruREs?UkU(uE^$wM#el^oX#xi$7v3NJYCX|V2?v_t(TG#KMAV{`JE zrfH|uQ-rWQCovKvO)4<}st1<{aRe#dCb!_e@fpeo_-kO0C0PYQBh+dkn>b8OCZNAd z$j0TZ9LI|#X)P2Y#Tzn1-a?v-IQSLy$;qvbT#L}=1SUaVJLR%hsEXa@=4{PuGihTU zAI8n`-(lO{+wyxQT6W`_Jf%hr4@c&d0)c1^kA2KsgDVYlVnf!HJdS#ARk0JtVi$dW z{uzAOYuVk4eNUnKTHI);=1wp3M4US+#aKh+r*;%230sq6_RfOCbmBxeAZ=F8~_SHuW`{PHuyUS{6g05d;Q_#l0U<=X)GDw z%hbmXRIHCLGYR?$@v;1`C#w(VEC9o=kc+nbeFt)45F~Kk1!cW5WbUM+f0c0| z4}2$?qNRc2Pk7vI**+W2oh&qp9~lG`9#=$5QY|jY`YsJYwcoC+Wa`aA^NKkl1`zo| z9YkOt*6RrlZE+279G95(g>%QUgdW@tUNc#c3*_1qTnJ64v2-B9!Jp*KeHrl8-pEQ) zPpge$<)6aLUV1UrE4PN~3%UN-#q>1h!o;WU+!{`@vTNUwXqh&8Xz+hav>)VDnYmmL z3|c>dBp`@|LB6;PT9*-&FnA57=h{Zj6JM~Ot%Qdbx=;ZekrHGWxINTPR;Vqb9_3CacI}ycPCpG@f~+M_wtH&h(m|0sx5A^X zod3|NWPNVMG|7n%Giqo=ey-K1p5A0I8*8BTPgF{Wkxh}M6?;;L4z=`wk2V&)q{?q_ z!CUm-f-^6jOU`H!h6_^flzF&ee~+i}d(oiLh%a~l@?Q6NTAm{FdMLret3k9BV!!rT zk;jQQbHJsqDHGU}nj7wpiy216!x^G9%|F^rD4tT*Z7~n8Ibr>3#sne|7D{k*B==4s zM?Jg!46br|t5f)lIvJ;6UB0^)(@$$>f%s(r`MAzb<36*5t?th5qN&1LUL&AUY9g0g z&H6`ztx`P~Z0Y!)m}?E*TrZScBe1Y6&LNJ%;Z70}>fkEUuBzBD{4-uC(6NXxIP+9L z%e(9XKSmr4L9-)%iQ2teFjrC%*K&KVwPow@H0M-kijgI%@8b{V2WAI6X~VPCz(<>{ zGadf}XJWA+j8fI1>1ma8e26*N<}6hdrz}OsCJX`#*eE+n9x-^H@(h|IjXl&jt=T_` z9Ff?94?7Ya-emc>7N2ZH0!mxw-i7L3n^eB@3666c-e#PBTTrLVqCi+L|Kw5H5c*gv z&}C3QORcjL)EM_n-<#ldKG^wHFMJHU6~25+BN}F~{JLg+#laS=TC~;Mkc7F%$h;O> z?LW*jqHSgSw`{#KGu(HknLw}Y-LZsnR#Wc?xGmxHh|bRN@UE^1Ra@PjyfpXI$xh6K zE_3~VJ$!=YDLDe9$A?hpbQy8uWO0E|a}jlaW8WLknKUK09W4XvKi@Ks+i}Bp2PreX zUlY_42_&uud5D5bqg3V<=gep`>Rk65-FxNUUU(j(J=&i-xGhmH{+)==4%F)R`-zs8!dJVi`?y+)t# zoXsXXyf=9v@G(&N#BcCp+zK&ny5S`Tuuoki&5--Bafmj>3#Z(~E5SMdfT` z@bQ-ydOngJLMI!05vrY!%;mBdfZ-_01B8}872FH_6yMVUAZ9jH}>A%Kl8u=zCa=I`lq*~hR;eoX2pNo=oDgY4fgI=%72Q$ zupH~%RJt0nVUczQF2v8+=;C&XvtCW6Ly*W#mOA1tx1(X036Th0uTRMBDu#F5eQGl3 zrxw}ldDvUotYX>gJjyeKGEI}bMNHaYw!*wRC+KtqL@mh=pJEQ1fQco326OM!cw3CWKgcl;*_W=MajPVj}w zb#~m(HGo=a5+O^8ljgrftVo8mz-9fw8;1F1wDXVc&^+d9a>*5Fd6*-AsoF{-49BNk zQf?4jUkA3IXJsxok=b2s`})3DH7YbCj*b<+L%``oIPwLF9{2Lx>Z>jwkoU(J$RAl} z<(IFdxS&dk>?H5rI$N#XWs3jr^J|jtJfjbJPk8^gd|9g`6%J=iuOvR$1r$zB*o>(w zHv-ur0eLfo_8;hH7nN*O!xEITBD^mxt2ZO>2PzLK}a>pGHob4UODmy-=Gt}`w-nrFfTCRceq zfP4Lj!|adeB2T&f2?+k<0Th0MlAJ?=`Ln`kii9Z>X*08`$#-wVciOMN|F=$pQb*Xg za}<}&X~+D8g7Z-K2-kH{%;Vj(K|ZG(wo@#=b9%E0J{<*w_!fR9lLnqx`K6X`i_&l7(@tn`>m{Zn zq7z<7AlxzpN9r-LV4)?9iaXfNwVV+r0GUe6mX;{=@b8hh$SgdPG!Mv^Lm}d z63)1I&s~%4WTY_&DM)okC#$!#$V1Tc9ExN6k!GYwngK+3CygUo94IYNXu?$!*LR_) zQQYfJH!`m6I~HgH32QqpKKu4_tCeCQ3cQ8L(D=p)f3t6%_XU=Xqu4$5-!ZhkIel1$PskOv@VB^@xmr!dB zQD+4K3N;7qllKvo=7T7-iQb@YBw3+U#@Te~=P5C_cd%0Tp!0rU^L{~WghW%&{x{#O z+tc;;T~wyUc5eb|Jl4D_&7B3 zqVs5X7|dJcM_U7WRh2_ld1^q9DK|Y_^EHowcWrkI)WOirzeLtCXKI3Pb`JvS(?*By z5ZzKsHW||tXN{#hWat1QZ&KduM53bWfpPh5<< zomh^~dwrrWPleqvpkNZZv)qL_Pvt7CP>H`-7Z2zCsjSy2x~IloW>u7i4o$`OQlLMN zP$=bO`t{(L(!nN6L0qZ(_5R05G8VAfFG>d`{_SnbJtxTco7TrppLfbrXS1{ITwT*U z=D#G2+WH@8kW=43gZ}nn$`y?>OK!nwytk|Iracf)CV^Q zTWY&Y;F>&D)AXGFYw^qiA6KV^8QLgmR3P5K08U<;ImG5H(yx#fzW9gayLPQ!W91G* zx_qt0_-_M9ji%89L?~erCRIFu2tAN_Y(zhH@Q89Sh_ln&K{mRyGTEZL>fk-Ii#63sJ4bs zn!3<`*dhNOo1YF7|8WgH)aTDspFQ+3b0ge*w7~!u)69p{j`RjiBU@A3_|MW#V3W(L z;(h)iuxFJXr3+dGRjWcw%YOHn-Vx9)((HIK^oS_TP-uvCm@J)@w%Dgz-4{cUKE{k_ z@*&?GzAF9MSy13e*@2;VcmbE5++~@`@4`MQ4xVI!S0or}Ypp}bPRiiyhc{3pCg_o0 zIDW>RHoOYnz$26~FOf=^r9?i~#% z5>qOar%^0ar5vnLtRx86j033?2Ua67(cqm*)ER2UpQ2x0-+@2?Vx;l46Xpx^3tZ;R>KbPJXsdDJGFeWYe2$55_YAssH70e}C!O~vJ%L&GOSUYl#9 zTZmR5+NDOcGaWCJl&TW|`jUoW8VIau2cPIl&}_tl_SzDL-%3Lpwg6W}WJf)_7HIkq|4Nn&GORr4apf!A|Gd{&fN{I#(w_mJv@qrh^@quCQ%OGfh~{Ske3lw{w$SUk zlJHDIH6^_a{CTM<8)D^P#v{B8>`Q(&d~TV1=x-7r8ukfS_eE()uQRRyQYan4a4t@d;Lh06otl1uZg*{CKoF( zSO?Vc?Cvl#|61(@{xh$VD5Av?fG&v^{1Tn!E&AsT&BieLvrl;D&~JsAdpR=i?c=>t z{eBZU#~q=k!9ws|SG7`vaJ^f5>_d3sL{kX(yon09i2m6cZMIV>>$IFEp={hlLZa7> zBcXiH*9PfMJ%`9uJ3cvTb7Sx>!7$at7HU^i=XjOpThfqpzU;9WSIytU#)o>aV+h6s z_3sn34bTYgpYr<)WqczlXKD?fqlgz)eyo5`%8OGokkTh(5xN3w?R2GrC`-&0)pzJz z$$+eRVhIqIM|9X1d0-Qu2vo0paJXY&sku(xwo%`L zP2oPMLsLHF4caLGCHm=wr)A}Q$Gmdnk#4d*jFE)NK<^fy>fn=eyZ}iTk?I&rXbi`9V_8g!~Tivk=_TTb@& zy>n?8Ncd49G8|Fkq?n#;Ef$MK!B3Y+;KD3#jmn89Z=ZQCr_UgP3^2!KDDXdMWxNw5PSPmuSAV%4ukAtR~6kJDA=*TVTHC!3W$~*o7W6t_DM1C>& z%A#;dMIj@%^L<-tp%p}bXr{>cuA00x$1YYIQ^>*{jTWBz-9fD&sn$^#<#me10qH$3LTASTbO0#`(pynt_Kd#lG zJgs@ok50526irkgx?{(b{MW0y1wkxv9Z=34f0es@qz}Emopg~stVBJu%@GU|>S7ug z$KSmC=o7AKejylzyv0Z+*ZAp+bAyewN3ikL#TPxxxUKfD$NIQYUeGX8UD=Vv7(g60 zZwizGx8s)qhHo1Jn}+NE;W7Axi1*d5oFxW+oJUir(IJYnY(+>E&ozW>t^ItZWLKzJ zwP_tI&oF%LNOnAOfZ!GTVgm0{CuZ8kue#l@jub?2ejQL-Sw~y~znbW_z44aM({~ z{d*jy3i6I>D9T@+Hn;Agkgc9w^N5HqS$FT@V11R<%u#L2?-najdURycP*I^}_bJ{8 zlBKOO=9&^Uyl`AQdV9MjRwC5gF#8x4r@DZKHa1<_v-@(wF<9=(mw!cmNJf!$bBfrF zc$rO-zb*0X7Js~uL%@dM_e!x&zML=o#bEsf+VC0R^Xs?o_x^{?KRQz^BusHh{+kS> zoOy~^D3{`6JDq_5{E&Mi7}GoAWS^HNb)wrHx3o6WU5;7jkaO0YM&jY0)U{h6^>E| zj%e8J#a>AkO^%u?*Y_N;K+iIC%iSkuB`|ctNGWV2ylQnGA ziEYuX2C}r`v+FSK<00VV4Elg@k^w;$v(-Q=DjR?-uLmsWAxg{LIi+i3iSWo|^KIoj ze{-5vbCpv}j}p1G_w#94D};3G@^}k@-+}QqV4DJ&2MQOjTGY07W%*1}YOHI6ua+}0 z(bHZ&jy>b)E&H#Aw$)r7x8yZ)B(OLC$}nxayj~thvIewg->+N)WKYJLWTL)LDDBOM z8H@MWA-d&k{n*>d`JbZp7OGb4s42TV7vULcT!nZ%$eXjvV$2GCX_QR?EM6aBp--vz z2!PD(4eW<#H;H8(iT}c$*2wWhJc2CvZTdaz61fTcuoyRspo4>Rq(ecD=WDe^qb^QG zpF+9e#pl0?-_2P&Mg99EQ!n@+4BIonU(@wTE6m#sH>T28+Vb2;-6R+`-fi&NLe|n; zknv{oRt*EHJONAh&wQF%Q;>IV?_9!Tu+5!r1T_XvQT}fN4OE`LvO8l0 z<1D=IeZ+lOE1abvbN2_U*-Z9W{DP{Z5^UJ+=Lj(css>BFUf{Gbo_8b(3ia$NGxUkK zuU3$dUA6eU5@+g-H4UczdV zwHh>iZyLM6b20_}$#`d>wtA(l*YBeAhjJY`9LzTgsmZ~rh^1zP#FWqSPo-3|@=ZFT z`f#&tM>DQnmwJ#~{R#=iE{G3NM|u?9;^c$~;K$3NteO4l*DBv6q-*aA$3veC!Ma~~8k{*N(B!|P2A*K*n zXB5~{>_sko|D>c*LhdD;C9O=!W6a9;n>Z}eOI(LY!r*L&$O27C=Jy|UO~NDJbRICY zw0kAY2Tsqfc38NR58``;jBQWlM$L4^B5sBEt zHPN;T`p=;>UC)UZBObyrm;Yk(DBOg)zVpl8714PvkIi2M=t&6bc5?c(j1R&^z3cqt z5rDeUVH+)Rb`brCz3wvoC19%oB{^@Y3CQY2t?-7FWrCEF_FBTBPN^d$4&ClNlNlROtFam)utmsC zI@w2>7q|S4<=&LbZ;-e{YGFjVslb1UOl|hYbq8J7L#?A^b~lV{>eZSY9XZ9~Z^(dV zVBq+GGc&iq9L>A4<&NTSi6UM=aK1S7iUUirVx2JrmYbAY`*Q zTuyq-Yue6AMis3HOS5$YX_VJ&Okl%#e5oIjEde(WTXXcgy(>GHY31ZSfHC+u_XG!O zg48s%Axw`eTMvQU@2wWX>pWl4bMVFX7GJD+ZOcgMRIbuMUluGcZqt?4zg(xB1A8mU zV^`sp8`42^g_&1ct}kzt%Tt9_aZRWc67P_Q+26|IZISskC1HfX#b4k78J#A#^og!p zcQRpmDncy_7IV_`qvR0VXJ#7z-b<>~Q@E!q<2iX%+poawRDY)VJtN>I{QI`lgXHry zIQsL80d=o#;a)Q zW~2(ICC#kz95K!t^oxsGQv^LOWq9ojQv{pT7$*(Z7$a5g%p^;OiOBEIBy}Q*Iv3Fc zgS{POQ_m_d$8s>zV4Q$g`|9cj>49aW@}IF`(M`9664c7Xo-OSG&V@NLpKIixMdqWG z_MoXkTb8%tmtOnuy<$IMrF;$Tnq$n~ijv^VdJF7%1)RpQTFZ?ASK2Tf+6#jKFGPN< z{TE;_GCN%~Khg*EcvZ(}kh9R*bF=Y;`zCU8cvM91PEtJ>nBY}uhg>GoV-6Yg z{bGz9kfuj5(c#~MGuk~6rBBo7bt{OwgSK2FPi#kD`^&!5;r&g{*(*iiVPC?~LoMk? z$5eUq?BA7L&WrU(j`!6eK79s-d53$#JFg|%gUmh|CYe{{-3g#P?d(nqHa_=(Isvhl zi{!lgT{i(o0xXpFYFUHMtb?(7|7L;#i1Q}I7Ny*{LvB11mOd|>pP#?q#sz#hPMjdX zg4lKgzF(Oh4a-n^CHi1j+Vaz&GsQ0#V7T~L*e~I0&Mrc4+%KnYcsEud(ASAym-e*&jU#IKwTs->3~X<}otkSEDxkOF7}WtEXpO`+=Oo*{>t{w1c=i(tQj`l_F~0Nt zwdaa44}RcRz)qXDswuGebXlURmeyqCDp}ch-xlyy4CvY?!1nkvQVD(q9XL$@Bvs!A zkoT3t5|GYz7$!DBG}Q2S6t%Sj^`wd21X3T3PVt~eePaoL3-c(i$MZx!a=KY3LiDBO z0AWvjfj+~=Cm5cDUl)jJGp@f6TKvwz;Y+zC4t0n{p^tSAi6uFUILA7aK|lhk<;|+K zrwyS4y2Yj`r)sR4QjfqS#pH+KY!Qz~W7=+9!isnpN>uejX`frG_=p0~Dm z4Sh|Ir?253W$(5`wEHOg+E6oecOsBqje|R~LSgIY|5>VJNJe&1P#(^4<;9Uf?)Xik zTzlgMcfEPzRXvzUg zBmfWZ{gZs4@C#drr#+_gpCI-fh;N`rWCAfqE@^!Ks^$2rIr9-a3hI9TmS++9iH|L( zu`>PfYc%TJzpGQv@@zBgL_O)3B>(Z*`qEPg%Q}0K_x?<+-7JmdHG@7w8&qShU|-Vq zEWUa`CXgH2zZ-FZx+j00c2qTWMKeV82S(fkc9zcVFI!Qd`HbE^b>OA@cS;@;${|(6jvw>COyuB z4RfF|&=?uqQH*zm^uyhoH@Vw36}z_-E&rWqs$TTiORqBLH}%xB;k4W4g0<|=3qhKpacp`U zkwI6=7hFynjnfbt_>{jj{8K7jNH8SQGOIT;#E1)s&NV(+A59nCbMaoI?Ap1n*Qpfp z-FEHp9ar!1Cpy0~kM44mjP6#CIpa_@b#OV@Lx4jY@g-|4OCr4BQO2Mb7kGu74PHLR zubMv}oM1!?7|{wC(E>)afDtWVL<<^AtAUn~{4(1Xq z?xx{bW^bg`(d~-F6OqneA(r(;?UrFz#29W5H+NOZYTM%8oKJ6e4;b|xuM_7AW*6M( zaiF0Db(q&7rGfm~rJ)omEFTyJCEf^1yiri%jW8}FjLQh)GQzlwpu`(Ni8q20Zv-XY z2ueIoFl6VCCXgG5K?`OraXH8rf{JotPHY?D=>`4c#6;TH=!qnI6Q&bK=z3Fjd&9V) zDb5zzma%(;Ph{_2W-OR2A${t|uNwD^3yCBANrT;w(H@TNpJaGq}3s^e94 z47=$34RmFEjYC_PFh#;^hcA9c&HFvkdcYyJdrQtpugJYo&a#a?_-X!(bZnMU3jK}7zVF@tdoged+gXX?v5?Z$4>vz z9(8ExmuZb7;;=`^qt+2YM?U}crytw;t{shEM=x4hw)ggKZ?Rl_!rDC5+dI{4C3qaf zG6SuHq4`(byDJBIlKiy>a@uchaL(KicBFj-&Vla-A2w9a)zzVyeILC{@3qF<@leRRgMKY_e051iR}Jrs zKb`vayRD|`-Aa?MG4M_j2LXMtleK!+68TZPR62ZOC`HTwMOWL>NM3+KtadI(^fh)xXxtw1WVS@=-$R5jEO<|YbQyh(DHV2A@rf4b^ zZLQ1N<8GZL-r;wqy!8_kDPK0;J>DHh%4kQ_qL3*qY}^*?h&DLfeZhDnmfoWG#4P@d z&#JDqc;e1ho-eu`Y<^7idvya&){^<-hTpf)csG96iYN3{92QdHU?trQH}JY6r>Ci( z=VF7f3x_$$2LxkJWzNUM!{r8{DSj@Vn;S;+`4PV+*m%D2ol2O{GvRVs2e3FjnsDTp`gBrH#I;EvH~>bvsD$zxnZ{dB&$ zkS)f2FQMPwaQ3!an|F`Kn*W4clT$m_Pw#q1fv3}N!5D)ivV}=j;O5efJ6y8hF5{Jk z9wkeyKOXB%T6|qwi|Gx1oPEBrx6YaJIWvBvkEf*uyG|QxTiet$-5;{M$IY7Yb%Dm9 zL#=A?#6`Vq6&- z3w$)0&|O|@s3U4_E*6V7diZmr*q+&r!RrcIM~^R(K~-bxP1^84)6~X|o7;B{1Oo$m zy6|05yG5Zu*6nz%F(8Zn1m+q}<**X}t2pRHnkj-7V^+BUHQ+PC6k=InUHkY)QDeH_ zqbaV7n;JrRQo-D*uG*m~y((Gd__dR+fwj|Ij;pO$N-7S)DXY`Gt2qX_oWv#s;VQt@ zPrSm3G@RU=38NN2((`@{YdXK(J^y~;0t zQvL1P>ke;zXVdDr*JRdYPa@kN(;NJa9=txjx)4CW1szjQ{43>r-oND|sLH;Kj}iDI zK1PRof-%5ys8=$ueCx4ODlCxybKul{=dV2>JAUP@o>KaX9`sf9ie~tLQG)v<_crL45IUb~JgW;xE0ZT*qGU^o=qzTR&!(>Li zb#=!L)uXNIy3@6~TduvTbGp-gx~-Q;L>ep{ZLFCbZ9O~Cal^VR=T%RspI7(_{b4jz z`cl5V3i^rVwVwbThs!6?Rm7}Ru%3#On58H2YA?~--vBLfx-~ur!@ro&iE6`&P6b&( z*~{e$=wDosl-Fsy#^|4(X&bGU)r~amnDQB~vDw*F)PCZ{?%qvXTF;C%-Ld(a>s#BJ zJLcv#-_bO7rgh7vwFAes3kwVX3OuC~`yKK&vn_laC}%Sxd8X(nvAum1mE%&n#kiE+ z=sHP#&Q^C&QlG$<*yKLJ*Z;u^c}7q2KEgZcr|3s04>c~0$mE4(^)lyPbMY(HqH~0X zFgTnC!SFnGT(71YIGwSbJ8gzjn>g20PHQ5Q6#bhgY*J>s60Q1q;;QNz&m7)^gP~gL zoWYFe9fRFAZRxA@@ZP3DPP1NeoHaQT&SUhzTD~K@%GS>AAMU4xG{>DXR8#sR zV~@9P^qa>#+2q!nCbY?ST-ZtdjMU>~0czn7 z%nc-WLloLrX$PX5=Aa^B74{%SIC_D1BR6y2!MuqjmCm)x3k8o+%w+_mp;XIB{0o92LpG@pNyxeLZ)pj^~}6?bteg6-cTwti_uJ<@Ux&=fCy z3L8FI?msVIGDhJ9WAw$J&(HsSzT>((@$mXqIq`rx(c03d=|>iz?FDM*<*n=U7PR(v zwf3a1D=VIV_7sWbUP~>8yLy>8+zPe#0xSZEoKM5ygOW^KoSUDYob2LBi$=-BoG;H* zdYDYepZt4yhL+<#_mX+}^rD+|R%{evANW35B< z$h~_Gb#2HR=|@VDwx-|bm+p~sdy;t18wQ)CR)Uvw3z8DIAdwQ&BznEB^y)nQ$bpNG zLM!yb8-Rmpl2^z=c71D-k`onqX;;0he#VWo>UmDMRq)w?ImdsjJvQJ|+1eSH?BrNM z95;fLY6f}{)-@RPDl59NWm;D{shvg*HP!kCj~P|()o0e9nSSBo=SqM6@Q0BS{c6v) zxs3$_`c>urKgeGtnA^Lc??&qSw?DHha9NRKtU}UQoP0ny=0ceJI6i}%*v>L6Il>9k zn?B3n-EJL=jtqS0U0?moO?UO3>bqzDGhco02l`K;rqb8ZQPf`gPt-uJuawT>GK^mw z1OFPVVac-no8J^zKFgC)q(1p2WnJZV2`=S`+bDd;C`L0&&t(FdE{NVL`Z#5EFW?d@+F*R&^l+SB1x?w-UI?YW6I&v1vQC2ILva;)f1rTRUtwtQQD zXCf0%+8u+Dh%MRW?;Nj_F_vhXWKUjCZCR47K)uxW|4q1gnU1-G9yw{eo_``442Y0| zvB`2d;?`f!$dxkL&+florIh`Ie&m(bslgTt9lALB`~4qCUwlc-`*I`jzo#gU&s{D0 z5$q*<`fFD7U8q=ME67sHbChKtMShtf1cxl0^Ya~_zwx=B-GvIJZvY$l4Kicu;`B#Y z+vx&GucmAVwYDc^~Bd*RDN9p0Ca}VtA zu&nIsA^Pn6f58Vs$mK@*5Gcob3BD2pj<3+&(5L#cU9^I$R0y8sNsD9X<-A?Ae1N8Z z$pM=4hE&(amikarz*?L9!7ca8Zol#A+)&o8*e=&ud}j1#;apUPaxVOc3Df_|`)c?p z!9Q&|KMcX|LjHFAE_S?$--XPT>kkF`^KQ0}VTX>cUw7poE9>czv4dBxTYq$jW%|&y z-Rm<(y41l~vgf9VZD0KoD;MO(?77+P^oRNzwT^iqcf5n_GDcMg{x9iK%b%Uh|S2k6}YVedP@ z>+K*`1x8nVp%KL z3^qO+IFhlABXG``0|zjg{lBX2p6T7$6%zLS@4N3iMDKLh^mJFfs(SU_tM`7-Gg5cb zo`boLRI~XYGO_NnPJ8QDLme&y>N+wijCE#tNgg`t+Wv_Nk~Q)KF+Fj?5$b{`I6}ZI z%zRopDj_Vn>}slX#Fd)5hc!3m*cByJJgnuR)vItuDFw#jhBU#gm@yI?ef zhC&}A@|oi(@|oD956zL!)Vz#RlF!Q08A!Y4k`{te{TJR4ADC`=`70>-@?h8Ch%Xa1 zqbE;1nW!4WCloWhlED!E@mIp%v2(@RMbR1gU7e%gi16?SrFt9qTy|UnMr@QT)iztM zD|Rb-9dwE0*xt^&4?Z{8*+CSF=MUoQcCX6WU?JdZi-|famUD5P8>x@)zvHRT>p;5X z_};Du4$dLm+?sHC&Y?s9jdGXu^@`CfwmaZB7~N&^{;z-Yq1yP6+jGLnQ@b`0 zde6SgY=gGis04N2q8M)#o@Es0#FzLdIW$T0iZ`fphp1c z5#XTWaU=vUY2*bvD)2V9-sNna8XTNzbvaw7@u!o+3WGlZGCplb;mj3^U|Cwh z&g^ATy)@lHM(45yKx1OK^4VM{h~gJs_qj7KyX3WluUjI8P~Y-{NLu_m^5-tyvFpev zlD-yBxm53n@Q?9+To0d*_+460zXvOC2FO0wW5uw*1}~>UMELE>2*C@*nR$7bUfdtm z#9bLDdoIAyPmp;@e^f(%RCB(=AS`4>c+gyaVvrtK_=1NKA(jRd_ar<TO1?REu`ktTsF* zm1-?+>l@d+ql>hx?)++T^qp(azxH>nZjBkx$`YO|9{U5F91Q*cGHn#=-xd2~M*(#> z7U{jhgr($tj5#}lhPS<$i6=1z_>N^+0$oYq=VBo%s%t#u;58SVv!nUcmJ`mo;M$8% zZu;Htkmvmu;lKBbzxv(p@GcFs>sgYs<7R3xw+1n=D@Ld@&0GYsdE7NsK zNv4w|p9I=}oY4YiqF`6**Vam1{IiXT#7bX>x20-(wtA$&pHDh#gO*VH%FMvlct^0i zHkYo;4xzS)x7%bJ@VkwnLbRq?Es>agNpDqK!WQu^aoVfHp)fbbfxqECUQ2y^&diTz z%ZIu6I->ko_%mXuBODByOa#rF)}O;jWsKyhE4j~q!ytlpM+aJ}mBrI(<2`|%)|47u z#^JuvdWHhM`&UHo-bXibIgX&*4t3Z3Gm#C;Lu=_w?xLAnzkcOq8QS>bi+?V@34@8e zS26o1^Z~rrSk_r9=0$}!lGt!7E4lOY1~gvJR@nTkQKm!Z&0Hx{Si+69J^EnF=Fx8) zc?aD)y#ByMjwSD}f_7gF?{^->N2CI1>nKR8TpS07X{RoovHTg#ycmz85C3oiR2+I{ zCR(hSRv8(DB-49$N)V!TXVrdgTC(oe)E|-&Tf$QO5?ae9*^tTd4s9%c4Xq#`nTTIk zu#ea{wOBV*Y#1Js#h!2pE?HI%RI*DRnwfcM=8ZRK<4Z3cc}IjZSN6BTb&)|`D(w%7 zPi%j<_**mRTj=Y>aXg}l-xbbFf#12Tj2Ta^`$!!a`12p64h3p4&lzzYun!E)17w2; ziFqTx0f%BUx1;9`pFv;WvW2t9NM@sCtjef$G+xtFvr#4t@(j*v(@wq5TZF}KrG~}F z5RZDNSU?x8aNXr7lN4BB62?;!cwG|On1uP76j)#qSYVQD+G0?=BtHnHyz6e@xLkL! z(?EcV@+p0}GYpdVAe99|Md7pQ1s)0?SgKWSoV#UbWUUqf!hmkB%4 z1GSMZc0bz_PW9J0Y_$W~NQZO3voD(MtG4{umo}S|o@8C3_-RkdY^wDpQz@kE*ghEd zc|X)4h1VA!+};7#F^3nabVZ*tHn@GC+fn?x(=)kc%gW+a9w(C7-7B|jndJ8`(4UFV z-daAd+fKTJ%$)&oR-)tKdxA(I$57EPaB!~VA4m>MXYQYATWy5tI)?5oj{W5Z{LWhV zgZJ}AHk67rq5^M2EUDvtDLoO1HTaWrh~P~pIc$OD%_;W;gYGu-%#3F&IXXlepGk%s zmfswC=Xr-~#qg_CX}hY+e^>*O?^^2P{bv?qx?)R#v6TA)OK3_`Q`~1I-9XCaOC4d zO=I!*GqF?84Yn=MVAlK~uIBlq-s#>NtALk`preToeIvD)kSn&EXyI2($!;Pgby=_; zXeURg;+r!-yiogOuA%~nvclT%FvzO@3Y&>yL3!C*%87lvHWTdQU>Df4ofr~ga1`L^ z$Ka$Kd$t36w$HVhl$27zY67}PH2NKPldmDVHq*Si+3Rav-&VIe+T?9;*SAW)`(0Tc zJz=m7`8-vF+uPc<4^?@*qc&sD*m!>zm$&I%`uEUgCou8*7WEk7Tdg==+lf&CD8qE| z0$scUUA!cvP8^N~I0gt>88-{U0$svDmoU&J40H(tUBUug!a$d>$acaB9URmJCXZQ! z_lf?VooES5yJlv(WzpvGOvCE7fWK{ZJQFNu$>lRA4*8dV79;z?sJh0-WV*YgUw9ke35ppe_iKkSg#0LK6v ztKc{Rj(u1Xz^*RxP&t?gSa%FNQRm3|h-5o1Kffk*+JW@C)XbN2ZCSNT-Iaav$)DJU z>&B+ksw01X@@v`1y);hmwQz1fHK__PDBk^}>`+WvIX6L+Y&uo9Aa z0KGyI4ZJkGrK{SyUh9gtr%{FnQsy!dl=JZ2kFlRHo+`oIdY2Mns&Gz9UzulAxQLfy zE-(xTjWe-SbBf6E_(d5$kzdqYw&|z`zV|&z z*Mx~3ZH*6ZYvWQ)4zh;szVW5K0v;xjpEo?i(d@3iLQe zN%W{t*%zuplM@e_1L93q-{BWmvQ{w;sQ*H~PoG?qq8IRevh%)APHv?w>sY0>70Np+=YL~n<{QE~ zJC)BQQ?{r}|F^%<#;2ZoYGie)BX0U?GH|QRnk=-p6K` znk&%g78HmvjV-09MykTX$N88c>zvIixw#~LjV_tFCf+~Q{2KPx3SjS|) zOL;ZKCJ!wi0vs{(hIIz-&7c=ZeWzLKhUm2z6EM`J|vaqxiXhvz!>lJ6;c<*H=OO~na z23iYsi93qt!9ZM#8j_7>!FP-qBH`|wh4~owb;Vg18QzGEw{oExFvU5)vVCWBj%7F9 z#JQH0?Bln=`&P`eTWA)KpQzxk;)y8ZV|;nV6qpQtf9Uy{-|xeQ^lPq}#_yGrxHX)g zW03lI_Zm(@pNqAt<*{}}xEeght}!47hKJMPM!O~%y1 z4s!1o|8}e3BS!&Ge-miTwbh*Z@7#M3J2ne@4~L=i%!E12-GyKm+J(S*6=DnQL~QO{ zZAgkYBOdw74a9(qeE=Ea1K3%{spk>Vb&FS2jNxnGArf&mQNb6RJuVz(c%xvQ!=hXg zM7g9O$|a%ilOW3B6!b}8B}pRvwqiYqcMq(9-OkMeTR*zT;7L;g0KGrp^w!oW+qXwQ z)_rjKDOwR)x`oxPlh)QO>`geX=DZ0xTRlVee!9xE=C^u|5P9elo4E==3_ ziLwLug)nVQYX{KUA<)_Zv~~ck9YAXb(Aq(0T?Oy4EQn%XBJ9FDMHO)9I-qXL%1~)n zNU`AFkvr2{RX-2Jo(Z}5U7}SBZX|^p=i=A%K3=C2IcSC0CiV$@AAMDuESzm_a~4K%RZ&$eWKFj=k|(D9a(Lt=eLU<=BGRF<9H&8 zQCPL8kKsfj8_bn>=Va@L(V3ZOlj+b!UwicG>&(}Gx%do_=dIgs zM=s)#-1KG99-8GSduSi8K~&I2yhRHun|0~g-a6yP^Y&eG={7^1mo~m~+G(%+x%lQE z_wD;5M{SD=69i;KeWS9<{?K zlw4}L{qJSOmO8$uCADIsrot*!wzZZmtejo7L?Bow)wv7LzxAFgF3ZeZUfOL$|620b zqd!ah^;QV@tP7H(LglDnY~@Wz&aqKO=2e7DrgA_FJuRdspdH7#9L8OwJYOow)iccs9ojuU^1neI|pl`O{-dbyzQvTlXW$A zbgVY9%MB)l#t$Se)5uOI2Bup$Q_>RFuwv7u(FJhv5QmQs<68;qzX-|TC~6D`gTbL7 zvN_JXo3TFj$mJ(VPPyojAN`V67EeM~ANk-_A*Kbt59mBieS&$sxI%#)FC>(T4?E`0 zu=}f^TJUb?=dRm-aR0g|uf1Aw^%baf;&;EBKxY)6LapMq>#0d`zPzL6Z8=(Xq^0Ue z`RYV)b>yPztQed+XL{fZgjSPdFX?_Uh7MzL@qYN5=}DlKk$B!I7u9Dg1dKT>cdk5f zm_Q(N{wccBnSnpUx)=+5xun8?Vq>`OOvyP{K7R9xO~#f(lFP3IUiiD;6`v};hgqYo z_*=A>U~2+jq=`=muB-mob(W*>#ls{oJcn2&DV-_#Gwhck=puqBf;R7zoOtEEpTBmM zWb*P)pFXhK@cr*2_QQMc{mWspKUnsMcN`_&qQW1(95jLhfXze=#4?BA0?)$VJn@1L z8F5aY*;Do&jON>X3H`x?#-#JgiL+0A>j$HQ@<04R%4)GYJTmE6*&6ZQva7teTw#c+ zzPQoFWb}iM!%^oeuivL zJcDYg0tsL7rTMYPcuc`OJ(0w%E)mNo6(Vg#Vq!60Gx0&^*lkuxnRs?V1e1zj3)%?+ z%CtD%g2*XzVlMF5f;s6TcpA7~*3@DaxQd;{kB$Gx&8w0itZXEn3p1P>1IR3#=K|-) zz;Ds>d1rB6TN%kaOH);|@6uBs%h;(vd6lkM1jOi%cwo8bqT=CIR}RcaF08tEQ&$eF zt{hffIjp*Jvb$+Je#EdsAX--A1)vZq_LlcDRWyz6k*pZWE%S8M92h=yLwsmw*X36u zclQ!$@p;-BYd}kNKHVu>Vvf;h`o8;CU9utl&57xgo5r)OfSZW^PWFC9ZLeUG;s{Nu zwB@2YF1R-i3F+98GGXzI&NW}~p4cF%;7xCv4IPj)7s4IELUdDe`?_Y2uVq!^?gI$D zm8+*;Lm8AF?zK8cd?CE+-3*e)mFMc*>R@gBt%z;m!t`Df|6R7J0>iU4XKA^4-sO#er zW6Z<4Mi^EOh6wf>fDuGrJRj$}_)54jVW*3a(T+r8sAq*7btsmjHS>_Ji(hi&C)?U4 z^A1|R`J|IJ^B8*`7&GR%qozU!5nB=LrBPF&18$cE+GP>iWr4da&@KzK3u6LV$f(gD z=cp;8q;m8qaM?Z?Zp>5%JJw^kqCk*`E&4FqBKx(hsXp5z`%hUjQsShZ*arZ+jKu~{ z_*?JraBuONp5fshQLO#RrC9rEK3@{&=l8y_KZaIe{0F@3ASDfYE{~Uw$~kIs0jrj_ zA?3Dh94<1Fp+BNs3*P5MFC$s`K6-Ys`{=j0`=CDj^Jp25-H|}Qpq`~?`CJA#{!b;& zZ&Sc|7M`f~`>U0@&fc(xuJTn?`3yn#C7(5u-`AkGsOK1F{_h32eUc0zTLZsWald~U z|K1oV|9*B8^&EBXyx$iV`+a`S&tdF9{n6#5{_aw43S)}1DA_Ao!p^x8H|%M6M?$IX z?2G6O;zq_wr%DfgAG8-;N!q)}`{vYqZac&cd5WC!?-LOvRyyV1H@gX4LFnUJ@O_1& zyl>9yd_qg}^IsNp5o!_{6un7*ncuS&%Y2&S@S79+x+qJ#sLTu8o-N{CFS6FG6}9gF z@|XADf$l6$qB~Ex;f51Lbud$B&f}w+#jy`71O+jtrHLo6IHeGWYlgk~ux_N}cT5DY zK4dL#`;=>X#~n~tuC{mXxap=HLVcU57f?U?G1ONr*fDXhi1;n$H&0@CF-th@;XhyC z&O;XAlj3}U-=$xqt|OM~5Y@%^Hr82Osl_4}%OZD025ju^Rt}|G>>Q<1!BA~&D43e1 zgfqHy))j=W19f$Qd7pS)q#9;_D!GMzj?eSZPA#LhQ)f}X6y+)+HHzUH#YFwriwk;1 zb>58&c5~ge6es^C-L=$!^SNxc1?L-OhULKw%Yzw~2Qw@WW@;52 zC%~}}YbUT&^ulk`__x@XI}No>Lw(Y)RHR|4NP||LhMK2g#HHbOc)`VRawGl){B|`A zi)N_F)C*jV&V(Vt#t&#RcwYiwJi_+G?E_z#Z@nxdZMr%HE%UM=(o2l)c#$bQuh;ph@_Q zcP1Tmcwk28Tdtcfv{M?2`>({lQ8cm$WzB#c_nPWq2f1~MROA!Yc!_4Hd%_H^mK1eEO} zzx{TpEQ_*e4Y}``Qdt1*+e7Yqwp12GwP>1@eWz5`hxVZ%`b;Q$49e>GvKOGt4Q0YC%GIlcN=XUv{<{ zts(Dyrc@Sy`}UCgo-LIHL5`XxW#1{4_067(hNyEmTJi7bn|&3^f*h^*`+8?@gt9Fh zt@yG%#rshJHE^`5D0`GE!x8MjldI{wL4N!Gy!{W&f-!0q-cHNq%Pa45Xavbt1Cp&q zkZddCETuf^rk-Dwj4z0`DUV4vJPeYFpWh|7!V^L-;G_ydiN(M>MurMpL@@`sD<`f& z@(|}ZY?X0Xe1+_`Wu{Tb72BF7g7vxf!jR$jreFPs=|OFOTlJvJKa@P_Q`Yt7PPBjU z)O{{?BGfiAI5sfS<+kiLTFyFs09ucADM=2-56*oSq8iIoti?pD6=_EWTu?ZgxvK*G zEQ|}n3#P2#yarsQb^nthruzAaZ5-+9Cy}m)VPWv|F|SDEO&po0Utq~Qz=XVv6>pqi zyy#pmYh<2CCzEM>6rcCxmt-fG%rhMmNf_b&C7}t+qcsRZP%*l)Su}4kG!mFUA{H{Uq?nU@(8M8dI@%m z58A?US-c};UDP|JLRA&#YSI(2i75$jhlx!{N=V`6&#?WBbB1GaBpQxG!`4r8C?-Ux zeK@rbt<}xYw0x~$W<=6`v2KH$rX?d|%jxOjw^8%brD|I>Yk3-7_Th)cGoG^AYb?bN z5OygN@~(hxeZiu+q$;-e#A$}j$LWGEH*j!f*zrqFnaRWvvdbdU->emjhC=26ey<GbMz zMz>wymu#74&pYj$Q#hSw$?W^g6!0|cDN>4Xt^lzR+s<+Lj)M>1@iJJf!0?%3al#to zj3(B=&-4ww!=d0{PqVc#|Jm)!uRgJ*ZRgeFORw79aZO_1L_BzG;v^ZUD)3+CMO zWa*v=e@~&}9^pApm+o2oIpurY758x8k#!30<<_ai?!jxkwN#%g7Oc;=aVBwcPgTV| z+;@1bqxpB?=Nww_InS1!w{j-hGf%6Z1dQM~xW@l&ip3!>(=&ByC!id5M?a+o-5DY%)F z3t*3)SOK9JjsS^mfkrv9q47x+F8*ZlR9nb`kmW?iSRY+ARD8Jj@X$GIP>WFr56u1& z+V}-{M~xV_r>wUgCeD$1esfFCyOKs&cuRprsDKk66pUFk%NR2LwZp{+iw{Dpyc*`f zt;m^mFB>nuj$-2{+k$39^X*zoNhDu_c6oqDaNff#kArL#^&O_7jBnrkUYy%l#3EP)5fv#;k8GH!Rlr(?-UMob{e%6PSJz%l!2$ zqW_&ML9ycN6U#jHPM)53P#O9SdOKw!<3vlcn;s?@lN?}}jX%S>3Z^8nvBb;~AZ7^5 zN^<&*iQ;vPRDzJ~bQ^j^afec6GKP)lq6xGY*=rm+k8!^YJ;Lr%z+_?OywghFiTloy zI!t_7737^}{tV~)#czS`lA59AIg$wm#b_IHrdYM^W(9i0cDe$|8K!vM1o|^0LyBE& zu}5}DCewJEEU0+R1ou7{yl;$eBPSIcCKf})w^1vgViyn>Oa!!Nq%cCVSW+z9F@bh7 zQYoULiNzkp9V(^C7&0MLoG4z6Y!RD2$R3avdu(&s$i0(mqlJu7+(rc-&2Hw;$aKIj zVdW8~z-4BYvoI?6pn%_+u$`@d=RzB$QU>jwxRR04NVW^;EdP?ips+>E2%R)R_AMwa z^J#i3tcYgvMk&cvi?<`CrEDHjemgQ^k%fSnA!{IGv&I5BIhzYGpLVfFeqVeQC1?xl zsyXt|qmR=4@35|WQ4OlO*Tu^AKK}S#cu&jh`}Flp2YJsbvH$*Jjz^1U>fpAI^`$c- ze}+TYqB&y-p^y=33JfA9&l(ZSy6(i4xzoimJ0E|1r^dyiKcPhN)uI6^OotwQ^vD~W z95Dv8cw#|X$a(S2$e(d`%RmmHTmaq)EWQx42F6@0ZNX1I@_YQ`et7aj=t7`H@#W&n zb7*lJeLek0@}5)0w5Z4hQ{mx$6t`$h92xHiATOQiOJ_#@3}y%3D9s|2#W^M9#t>Tw z8PP*PCR|T}O!OaJY|(%_7X1l#>>JRrAxtMpsV`+D<%Ns%C$p$WVnqj+y&AA%fSP13 zI!p|L+?ka>t4kNS&a`678`-Di`_yX9=H3!I^)}Y^8m{nHW?}T>ZvD;l>8#7eo_+{9 zAAPj=_JiZ&+}GT!6#Lw~FjlY$@*+NS?p0>$Nh5OAffVUcENqYng1UTizP>*7tr> z-4Tj5`4_zg&#%lSs`&)DL{EGG z1&d2xdI{ZE{OJQI{r%}Je|%@l*5}|?S)@eYTVxL@i$2ZmAl`wGzb3(R(yhhD0}h(E{C7xcISrmPjc_1d*}oOXuf+sMw)9~IH}BE>`W zZ?;l=-q_8|8rlZ>ewON{&N>Ecf`_Se2`$iMc#v}PF(5HPX^X)ij|oa!jD$qT;b?$k zfWY=VNTuO-g%_|L0UL`Sq&i<9oPjOJ{^E7IoJA75aAPERtS{vw+}JJDGB{qA>YVcH zqjk-p!dTYfs2^|WBG*mAHEqr$or$1JrE&(Voyp9RAK>edQ>kTt-ywx@bKGZvLN8Z{ zxm=dApzqO}p_c6wX3uyybB;C?slBR%sE93W*r;LP_k&ahF4j**EN{TDgdl_m7Z<3 zN@I~o0iI1457wZT;?wxihxgsO@$3sWQVZ|}nwp+{UphvA7x<)&Skp@pKVrA?2wPwa zu|iB9191(@D_D>~2(9nFuR!cvJCu z?tPNe$opK!`92cjEeoNm#4p`VUV0b)yUi&xMtw1c1QSU=P=7lE#V(FJyhBPA*_fqpy$HZNW4ICobqFYen)XLkM! z?-LLWn$()pIL#p=r*P8eyI8^=ixg2#Qm=facqZs3Y5EaTnq^)0KymdwNK<^4C|ra$ zZy|U%_Yt``w2HE%TmmE0I_rL>JKk&eY_uhT?y$xs#jTi4L z-hW@sSQo{=FYEr|-_OzV=c@N2y&nI*tkd`W;~M=u?Om+4&(YY) zdjARyhy3U>{XJl(0`>4p_|cT=*Q?ySore!0xzElo|JN# z)rJjiTwYTy`<$HH48(#nPKt=dIuP(kzCSCs$AE2dAd5zci3%PnBfgmh(H{X&_H#Rm?$Y+Q!3DX`+={YXm628IkJOwVFDO4RaCH!Cl zs*kfa;;Lg=9zHOT55AGSg-aqHjm5aU(OH({sKZ83uCe@sbHbh;8{+nN@O!bfk(Kj! zzXd)@h};pw55Qz(vr$f=z%7pP=eP#BSOGsb3!j9zn08jE3BM!5OUd~4azX?)1dWj4 zFQjrVWR&eP_NV=WV=HUTx%z}$QS0#~94Z%huT3X?7 zIhAUsLF4iHwbq!%?Ki7sj8-ar@Cs5jdT^>Ue7CZQEBgEOj=NbTxjiMHB& zI-|?@wc2QvfzbqlUS(+5%jlDtTElhk>0Nr{3CJZnjfAEpND8$;W~Iz*(kj#n5c_mm zHLH+FJ)y8hwvy@a4Gwg&N{2!sx2n_{ngJbDWwYoQiJWz?atUKZsw$04XJHjF5Hw6G zr6-bfs%q15Mq8B#Dda}ELZLN#Gs$FH%^;T+sRBx))@@TWQmGlqWKyj($7BLy6C)mL z(rmNPG|kB63@j2drA?_;ss^%k{T@jT-8ZPx>!dWTQ&>z|rCOsgN@dI_t*UEmG&{6X zsl{Thu1T0=v`&tU-JzQPTtNCYUCQA@I*r<hVA-US5R+!`p zb6i^wN{X>X;qUOsq$Z18VTpQeQmsoPH&<7MHIda)DJ`}3#@#lF%CA<~<;VctCiP_X zN{7RtR2xkul?o3ZL`xKAlR+jmOQX(+T|=wl28mQBlPjbWiApMG?REv!0jS3+oisA3 zk=}0BNu>tF`Xff5gx$=jG%8wd)N6qL5{VRAsx=q_W=3LisU=88E98zUk0Yrn_>o$t zmn*E&7RKsosgKKL3I=YF%M41LPoaiis(os?Mx&N%T_$6d1LdRlF&CQmdCCwHd~@F;tsWZqQhzj8TGz109sWJThzHhe(oUND)wZgVN)% z;8x3>bkL#IN>n-2LC?$P03mGlSqY9Xauc*WrCZmI6{u)PD9*O zm$PJcXN65+mXDw-a7@d_S~#AO6;QgcgN5!O_Q}6Yh^vytKWwL?0`rsNmuEAD0;-n= za{V=-Zk&mVmYEVY)n~!wG&v}g*g*&4TDxnHz|{~A)`zpHLH%B3op?+Uq0CzTlDD&TVwXA~HT%wRGrB!s!pDwWA( zR1>D7&w79b0V9&z6>7gqVspoPt-z+F8(?PAWR9jKc&cm7unJ0oq)1|9q*l$OTq;#E zFjrL)t=18wopStei^rpEwIHKOime`$l75f+kz_kPNbn-PR5g_cNp_f8L2ZH=Twfr@ zvK*UXxrvNNHJiZbYdfJOVFU33%X;n}|G+~efOO%}>RZ1{F1x_|DqYbo4N~6!nV9YBdst62Q=qDxm zyi7^!X}P`;ZkEa=S~aTI%9V@_F)rL#21p7+MQklFR7h$3xom6d?Ge~NpWr{Z7 z`f`a%tI57VJ_M2*Xcrx!>*yxB_y45D z|3%Uw3#GuRLo(KapFmy!1DvaFC=|2EtX9%icqVJXHxQi27!+etK_PwsoB){__{PR! z#tx$#x||rC|4$tK-z$!`BQLF2$UcubfC`=fyl4zFCb{7NEG3wUOOzvs1}0*lWuKu{ z5(U)KgOnhlL6bkP(93}}DGMsKRsx(^`G3;w|4!-l85M(Uj8dMF!yp05F!<&iT&NkD zgH}s*2;U5a4(KUZr4W+>c||3W!y?VX;-i#9F@sQ;MrI9&7wV{91&cpCg!89S6a2{c zC>M3hyvSL@;&v3?$MG0(!W@SAd$c&{)+%fnTB#jy@LPsf$__^yjs`de;J~4g0J1<$ zzg%Vj?8!M7*TNbwqJwwLEL(kSl1A4PdaUe6>42Ln&)#T zs7b8wd+>_i&&$VSm>-&Rl!WknEb%dAhgg6j9)1g%v|k17R|)M`LHqHBkqX+cg7&M( zmMNx}fl$!$0+&dcIZlUw2p4e8p7`Z@fddiftH}u((wrp^ZZWEB!o*v11 zTfMvWdSEGxLefG6DB^hRjGE;7NeTr%XnXZo- z1*vWWwVgVN+DFY$mr~clh|BW!Kb)axKPBZ|@6IosU0FK2kw2@9lZB?qvv@g_!m^F! z7gowGrf?~Rj}Q@R7`!}ZqYRb?La@x@AIb4D9s3*=R$GjHrk-=pkI>2LzzyUo<6daiHDp` zKCOYKr$TYb7iqoD-*{2gMB+*2vE}0q=E=;8r5YXm#O?8k#1pjcU6nL45@CCrq^jy( z7EUu#MNN-AG8}ry6X{f9%{_ZOeLWEyY6h-mY-7&6A~1tlrxhYOyt< zJyUm|KRkT?-BbMMjdiEC*RG7SPqm*~=VRk5Yim1BNgG}2_=?o8(x-H!R>ajV^m(<8 zzHnvnZ;X9t#eGs+WNG62P;ycA61oZfC#_L6Zu{s*D7Cdwt)}UdP-ak&aM6EZ9`9;-mcEA-B8zKh_214?Q}d%&ddv84-*W|KhXEnQ5ZKk4tEW` zyZ9wO=KmI$w^0)FkIQR|x01M->rsGl@Ub*DK9)u(d$d&6hc=)gdOaVnW8>q5^k@hD zZ9ble_rFCpOMbT`cF2Y{llz`5mAT=!>q(i&Zy8z9PWo9|?57+f_dUkPA_>pa zqg~{;-!7Gb7yxa0jE_aK@v%sHw1?dHY^f}W=08wdeU=t`b--*6RNGrDKCAkPy3y`d zZ!FL~vbwQx%}943=56g>vcNO3P251DU9lm9$J7Hs_{qv=K3RI^nudAL?4t(I5W+}+ z5#Ik%p2C<7439`JF#u0}0Y{=^cOMK_k}bu8es1ODcyai%8QSe8-UstSFCHf0 zG{#ce11YqcW30dw1398ViI5x6a!aBsd01WiNnxPcFOOS^BdE?9_IP`xu-Xpf9^ zrw4LXCa2qCuM0;kfh6fiH_(1P)S-$xg<2rs*AI1Y^2m@vZKVHD9~_381>{FA3HO4C zn&s4$B+=b^wx%t%p}EnLVneZ5Fs61n!vSY1k?{}52S%guc>Ou#BV_2BS$VcVqL>>u ze)Ft}ZDZ?;)b+U=W7Ym>z@f40`jJfaIiI7s?~uO`w*~x}csv*iDCBSTPihA^TmWd# zE*K*|7_p};G(SCjLPQ)W#^9(jf^g#}AqU)?jR| zB1R|?Bnws!UkEvjq6U{Pl$TlRZO&B4!X_F6$@aL}mF-XFYR@uiIW~rr^19HVk0Vpxs-#eq};-c(g*j_<~2wEQt)m2*)?N!T`)zkzc zj;g%ZmyfgKwN+MEFc1js^ZTlut{m#{C5*;~FeY$+K3LG{Gk$lqTc>j+-tu^KnxNh3 z_5F->sa*k!gN&UZ$OO|s3p>d!x&Zhx#`*P;vEv{+-JDacjBg2vrw}JsAgfgYq+r2T z)HATz#speiP$Oqeb8yMHziYZ@$`sQ3z0Q!o!PwG-66R3GAIwKA8-|S_NPpkeh$7@aB>E<7d;13 zfebhmrlA}3p>DbhW?Ky8Zk~oAOv8}KWq?=sh<}1qP&=eJNdUeVEmqN5iS9X<4s9(#F!qN4{zM^6;J`N8U4aAYFVYJR_ts8A<7)e>JsgZ^r4l}2xclStD)yQs+k3#Fw zavIYqH4l4TwV=B|#e)0l)eWzlj2@g^dGN^7@U0P^_bSlQUB+MKN1|$h*hh|vT#i?x zKpzZ!XB6mTgkKtgK1QIA5$IzqVFbwo3oX&l85>SqjqJMOob~%FQ^hy9xc8;2Vi|>`1Self#Mra@BG@Wx?RJ;Yp-2_{ykCL@wKnv zEepy9^n9Dn!|Z9P90y{0`ryo5O7!a_o}d`2#<$Q)%X#UNq_}*FJ@j^{V|`=q&e)Rt zl9o1uJ7%}W*>&iA{okA!HZhR(?9EQLh0=B1U4w0rj907Cpp6@D*Q&gY6J*}k!n|kb zyP+D@<*cr}B}B6Ta3O~W>?alW92aib{N*|-@Q*0)k0|huDDaOc@QbS6V*^x9Lm#zOAG zL_W8=Gg7y5|Io5aH|ML1zliyFZ5r40|MhAc&f9v#L z7vDm+o*SWSrZ7RGKwAsY)=LmuOVs5P;b<0s7lbc?GI@cfd7x=tplKdxng^QZ;aPd0 zX`awD44*1OQ;g!45NMhJnkImz37}~LXqpgcngE(6$WmShpU(19UZ$#eDQB<(C#>ZR zxA#D%Df%GScxk9}T~p(l_Fzv-J{4&jOC*=Jgtl8^jge4oTcNS#mDc9CKa;G<(NxW- zx9yCoft=S{-(S_T-02;wtLaYKtTmm*%RDiUU2AU3))ku3-elVB$c5tRBw5$bM}GmH zgk_v{6dsmyhog#1+$P35^p=KKSRi5;h!_@#7$!nO9F7J!21p(<=s&X0J~#dvb6B%T z23XNLHJFq$j{bD4H|vSCuc&LBZ1L4@x^C+=p=MiszOJb;WT$NBJ+R;?lzkOwQM{grud(+eo;I$2~_WJm>_%`%C^b(Ed2fmKN_unVq2gtRD z`V&FTl2M!a7~?JQ{k?EKO|D%8)ADY(-b$`D)Bqi(r{J24CpiKW-A81D?d1FP>^ESI z`WlTBF>~)f4acRx^&WCvi}oXok0%4UlKY-Q-=lT#{i)=-3uK2!&~M@TX8wCOe7_d1 zA0pR0RvIm%o5;0*5hbI0=3VzvyljGTiQxVLa?N9S!1Z>%y(D%Dt}o$p*pPT2xW0_1 z7m442>&tl?ijr#&eFbShA1?#fS8;Y1F5U&MuO{E~F&uDx4Nq?pTLIVC^6ew>32=QK zM?WrJ0Ishuz5n~<`UY~%`(wiO=LnB=!XFQPKlGE2dS+2X1l~1Ww>U}`j~#Us`+G$m zS#g3zx|CqiLGTr55wI4+18UKHKn2A^ni%*pHy?E2g-;(2)FHtYp#nMhfQzi099Ah@ zqVK!ay#u>T{PDVWbFVMx@Qi4)4o5A< zqe|h=;t8gZ%V>lz=G{;g=RWb=8v)+*D;hi9>Kr^SDy<|~pT4qQ!>_=)1#nT153AjI zTpKtTtG!H3GG2pa-!f!(SAmube_RO{)^=TI?%#jrzWoO#-0fQjK&x?k+Nb;bx3+sW zKYG_)k34+$U5}F3DT-DBZ&6XL)M7!qWqso?!GXg*?tEUxHox)r?OB4-y5i8}>HXfu+E}Y^BC&fg zzYKJn*{T(rPaW90Va3_&2SRoEV6?Tq#hdG=gj}#6LA^6&8I0F#7sh(EmSP*F0umG+ z4;mN`8VrmF<3R)CK_iR@4U7j(Nze5NZS_D~JwjVO&{hw$)dOwyKwCXTdaH%^Smz1) zVx0(&7M=tpp#&>MABDR&Hus*H81{}NS_b->nsin6D!-|tuDaXby?!RQyvb(`*SWk6 z)sClYMjHc}bWh0N*3eeJPUDO@QyIT^VA5UJ9`@&}+%iy(60N-LlFStyiNjkscgS2r z=CLYDkDOC{>)X5Tx>2`x^p;z0nM5yE6{qgLdkc=eh53nK{02xQ`oi$m;=b{e)KBSg zCJ(ald3rfRre|?OCP`h!4LKS`dNwxp?ujkQjkWZ**I8;ox4J@KEIJEpHAu5R&rWuR z({;UF!|naeY7N@4@otUEM^q~wk6H!voTFRu+2I$C`Bs#4D>t8;o{S_KMiMQIB${CG z#^GpyV*n03lB75jQz=IL_;jnqR4dzD-Rk!0`u640z<46wSMLk8uFQ6AXmLjec629) zJYNfSIq7_BE|aDEJg1)$kGLC`H|E!LM(Wp`(Y5ND6Pj2{@zr=}+pdX@(Kar2<303e z==Vyyi*CWqbcvy?Y$2>{{pWrpD}Dz(q>a!GQ>#fFvmfYf0D3R1Z|VMb>sxT`EhPYsP)u`>Tcuet&+Ts&&%kTam5l zNwT(@uHreKDz9B@>By#A+R?eSIjgfd6wjuBy5ZTk$^6H_%vj$lp_rDD-5$o?1|(%T zwxG(X2qA^>I3cb%i)*F6C5C5PH*>v#VF&6H136!`YgMLsZL2>$_33R$n{LarwIQ=#fpEdwK_2tFS!K1G?1j=mr>PJ~JmD+=kvn zFJW7RWA66>FTT!$uJs|h9IiJz@Hp)OUF$dWy}+N;Jm!lzRnECWb*ek|L*IW*2@ z0{QrpPufDLS6|F{0|sVv6n&H!%z10mEj~v__t@a3Sf^Psy-{Tkr9;Dm^L11X3xQ6N z+y|#E8XdP73|?thO-qDp1xZaJq~4`o;F5kIGE%iXL?d3P%r9_h39Y!fe7+gnOfj7B zLl0hdNOI-D2X|d|*<}}e>QkRW>(R>MYpAOD)q#H1UWP%PdK?j*QL%4`L%u{r%;tiO&x)IsR&vREY zS#Pc1>GI}>Y8uu?GTydmG^uo?qLHSUrN-}cdmBbmP3uBwUq>{ahA(0xOHb2=+v;>i zZMZ$H)1&4@m(@}q3^i5Ryp9oz+2_>TtX7T29j^1o+pLyc2)<&y&M~VEzG5vFjlFB! z;KmU-@rkjFgT>Nnp?bO zc;8A2d|gJ}2?x*(gAvJqZZe>ojKY(60FG5~oB+o@I4;3fAp(RV^8B60c77E|CIkLt z((iAp^Lp#r{DHPQkEgB;eNdA~R99Cel1pvXZLwHO!e&df#$v72HlaP(j-i8BoJx4f zTF^aSLBECTn;qQuZuovJTtDQfu!~?Ubz--9na4GeFSJ*ztPrvAh?UL<<{saF*IoPX zLXQ_a(c>rFefJ5}oadXNCY6!1C6F0JW{rloqj8Ccq`VD4&d(J+|7Ifr+@24&9kQY$ z@cz4SCGJAD9e3Zo<4#2PX^%ry$)qVfAtn>COX{;ShUmWCi80e53P_dyfX)d*TZ7u>H^pjl;ouciPuD ztoy0ym8Z>L)AY7i_qqIoHG2Hh%vEl%V&Me2VHRw`fkV_lDx(Op)Cl}ayf4SBNt-*VRbV-2}fK7-I>F%Q~wu5S%H zviHVKP1{Cm{4JCD%<`7t?O}gMZ^z*JrF@>>D4hV=U~&8>-7(@n?f91iAa?Zsh)I0( zrjAKWO?~tx{0v4N`V&0A68}l}3GkmTydU|C<1fC5zFz$K{iyl1=`DZ#VDt3Lcs)Q$ zZvCUL!0W;6FJTe9o7oQ6S84wbhv^@{VdC({X&ti~XnDdh^`t8*pkjJT+(|j0udXkXm$990P=c^UO0PXP(*hzyp_m;~QK4 z`nSLRbqiXJ))en3ewoYf!tD)!Oz;7@=563`{UN#LZO(B0cWNQ~rW1Ij?SGBm#?9tn z%H>K0&B7--C(yC6t!-mRz~8a4y?tYcAGr#nX`3xQS}2TQ|BaEtf_@wA(0Cc$vVh%F z^@;7Cl0$|6IQgRDn%mKX6O-o^qg%Fc?}}rS@c*Ds$J^${U8|5+R~+ARM!O}SjCOm+ zs`vJ1CmMZoeL50#b9_3m55jv;?@ZaJqdYPe_UXVK?iMQThDy7IO1q)b*oo8)m3Bj= z-Mj&Fu1|-^ls3F(~<`p*0sl`ZTP`F8lzQHPB4?m$#%_G()F&+_ef^6cVIpV@i$=XHCA z=KFTUfv&T3o(h(IJNV7Jd35!bd^=b^CBR{l7RbApZ^vBMj@d}}hQ{7qu_gJXEj>n0 zl|7MMhd!m7b>`W`V7+&qXNMhaT>mBBv7>Bz3{c6kCCrCw=@apsIw=Rg%DdOAlf40Vd%+?s2J&#rZZ*uXz9rJCCWG2Pt*cxM>$kxby zjIEKN9j-n9CcT91D;pcvw0McJQD4`V?l8I|)_7CIf5uwc8}}5Jrt4R<1Y*4#3tO){ zvEPpFUA?}uH<)s3qyMPA5r5Cw8)+G%=6w~2EfB6X3;A{kb~E^1$LCHVwkWvPSK3@i zTnn+e!1u;~+=cp8V22dx0manEFx5-UjBn|s6 zzcbwtHPCrou(3MXsF6r5{v=+@>t^4h8Q?>Kvh-Z$Knuur$KxGf&aK#4xa+pYlP2@X(=r&-6tC1*4K}UV)9Ik|w$?oq zmk$~}4Ruk2mOIx^X(5`6GXj?L6UzD8;S4IA(LMm8)5}ji^{3+1XpauPdg;2WH`Dn| z!uuYA_bJOQ=O3^7m<)t+{(Zt*uz2?J!w=7(t?-8H*S(Ejz>OiSgZaxjRC!HNwO}e_ zoP@{4Z%`bMeuafrEM@W|kR|_c5Jv%yeyq)LBanp=$P)QV8jMzqB+QF)FtLp?8EQKF zQ0EU!D zJf2*n569>2QK{xTpQ(-|Je=G6MucYua+uN}h3B$H^qFU8W}cn-%U|gHPk(ykIpN*Z z%kXZ7#083N=BfoDSV6xtE}y}Ci`0Gg&$DMyFTwA%1i?~UsVCH><)DPYudtw?_Jpm9 z8CRyKDxtP}qYm`*qCef233G81m=3+9E=uTv#h?}|NK-+Ha{hCuFU~(@&NAlE%QG{Q z9~^rA=eN-L;@^;>SS@06Ai){oMDPL}7Wkd-f=d0!6?OHOe)mbSg&mTqFQ$#rhNaD}v@>F{7Oz03Wzsc?_n`%sp)>gYBz@q4c38{$IWKmr z=6kRoQx6;_tG9~OURwfXuFMUF&U;LPqzrTV=O35Q5(#rU`kb=1wa5Q$sNOntbyHvL zS*RjS_`@Kv(fFu?^RlF>7WCcJ3-cWF1s3=MEARyt#w<%zs|Gj*$fW1?eLVtSz)<8k z&5Q^5f(HhrN8k${;0qp3@0w?qk&8Co>A`5(VU6kU+cO-G4(}N_aoyUTJJ+qFN^?Oye~sby^HdAwAXk*Em$ni==hhf&d5ys& z&)CpGYb@vYw>c6%I-69c*O{>$VA4cv>;RG*sbDNN73^B5bSZM{FcdC%%f|W#e1c-73IeRQYY`>5B;3P9^Ej{OKPFnaeN+m*pDhCbVUfdA|!N02)ZH!T@iw=2tikbh|X=rpJe9O zz!TgH`sS7Vk4x(+za@`;?r)te44+!n8yv06=GBhs!1QW=c#)Sa`t27PMBAS*7t-Hv?^eqoOy6d|y~}ofT(r zmM)UPIUq;bnLE&ndh}8;iC&t*{C^1el7sNgE%UqrAyNcpL*M*WYy(IU}>#)uZe2Mun@TDkDjR!jSiHPjMa5^{BNk^Ggr2L08D=P0O zmA_7FMdg`N`H$#oQMs>F{$sjERBkJk|BT)!DxWHq|C}}w8^C+;=Or?3%_M*5G1>t5 zk;|*)Lb45P4N&p$8XWXEhdZPp3c7i&g#ZZ1f?fnifLIF7_-^{rzoO^##lMGs_FVY2 z;$u(VkR>LA4VSOGcHa-xS%&D`xw5xZc@{lPWnl;=Nezw{9|~_x7B~cxdCGHE zaM-i)Y1BEZJK9oPqr?eXEA?qF*0w$4`TEq7mO!&5;14*xSFyTHvYO%TU1b%!ZkVXp zpnN;4q*c;vINM}Yw;S{VhRxGtoUG%=iJdB!ca+LspHrSGmH&tv4}7_;RQ@x16DbFN zg;?_ZP2BU*t)$#Y$~#KsucI5u`1v`M_mSswu&KTZdSmr>lu6 zp{M6xn)a^B7r#Qx3$B_5Z*Cv*V0*$x6Th~#?%96}wl82y!>1;A`OZG2z!i^@An<*)NGXk2-wRQ@A+gQ(nBD*rJzH~Df~sr+X+b_@n`{p964Dd%(xnuaW%q>tAQC;12Yb9chta)t0`?-l5~nOk(*+HmD{ik7-NXQ z6tUP?GnQoOC0Mi2*)_2ZiI$#d|5U5ip-!xW^9$|veR92`yTAB*JG)2qB(!3#HcjM<9UBD7&w$CwrEWHxZVctn;V{kx0r->j&-qg4Jn-61N^ zl*)fZkBiD}rShNA2gw{EYZ`gZN&IunC3zYYY9NqE=i$w0<$g2Z0s}WkWCV2pvsx=} zXX5fw6M?y`@mPsv?b7c0w(d*^C_L*5T{AQJmQ6ho6v$LRS>2c&NZB^i`L(v%zEb^c zrTYDhUL{&HP-)Hh3GEV<$4cdI&;ib#JS(GDKznek;?_@MPhP-3`TtdSCD3hFS6c7? zCCl+5Tf4Pywie5>Wy_Ldd3O@8i9`0qiL=-Qk`N%Lg%C_Y2_%#RN|}~G%b^UMZcs`B zC0zmq+G$}A)0{UvuB`FSew_?)1!@Nsc1@FV^q(?tkBX_kQoY z_vv7iCNg4|1T}l6L(R1KHZjwzpvV;P*;#GUI^8CJiL)WyJJ{TikiqCmpT}Kpag}I# zZC$BgpY5$bvH8f8=e3qSucS0jdGg%XvgbacXb(&6Z!`U&?afmADRw3siKF;t@C`;; zd;0&g&4l#@N$bm-oJ+CpgrxSj@Bxfcdsu3Jo6}JoCR>CA7`sP~Cs-wcbGV)iU?QTZ zP~ie%SW#pM)+Gfr4hfJhdO?PLbM;09f5_xoe*?S!Dxyo^ zRdSm_o<{gISr92_aK(&KR$f8+KoU*9^ac7}!Ro2$**hl3Q#_WDeJSBr&qEvf=Vvm# zy&3w?C!e5)hCATTu&@-ZUb&L)&7lQkt)za%8|WArF9+>4MBixpo9J7_CVdR;DI!nW z{uX+G=#>rhN=M?Q+W_q+=(j(kngxm4nDvpnc4IF2F;19*`dIgkvk;3BDG6D zkJfT)g)v%-2)#^V&!p=7K=*O7X{I3@tWt_dCvmOdgc43a6;C+_ z<|4y0y#r(48&^p_UAN@Zy~gSYU^%!*zb<6sIINO?zFBHN#VwQDiF__(_9{qlW4~$x z^xxl52${_xd*#4mGGvHH>1VY{4eS#HCYXc}$N`W|q}V!|*ILKT@lV5&IZo|r=&rfZ zoNkzt2Uq^w6f%a}V%~De_e7HK`KDq`8zl2-OOAaS0jBz}_UKVfEh-Z-rl_rLb6+Ubx4A7IM41ZVr=7j-c)&Q6p4Wk1O|D!wn%Y>T z6>;sdv7c>SZ;1~lx33#hto2y`wle+mO8Qqv^lvNEze%NUAhn-jz68NJ$$hr5`)C#I zO;Y>oT$t9T%JKvk?NxnQRcJdVM->yeAwh-T4dPErv3#ktiuy$l-wz(XU-a<(pyPh< z@crQ7`@zHa6F}62Nnu2tqxhgls?Iph4$c4&rF_3>F}ELL?#|7D^I@d+rh(YB;Cq86 z>OCK38uGQ(yQf6r3K=&`GCsxmiHyrY#u#6ePgJUmw>(mu z^aiuBv>i$9Z!+J9wuhwlw^*D_+sCE$ceoZs`!=clU2cese<)i{Fl(Rc@`7AkFK+M_ z+;ZYc_(cg0v)MGOF=<7%oa{j0V%ikYCV2McEm7)AG|lZ93I(qCVx}>5apv(oDfCK|q$b@HN75X6 zj~k`B3hi$ZJGh;-FDCbA`|PmZZX#T%o!s8+ReTRTfKtY}xxMQq z_K=^OgrD2Xce9_vJYK#5A1Z0p3X><=-{F3F&G?b)yJ9(dX#(|pNFksnN}0PERuMeL*sS4tA?qzVfZ zlfuDHs#F7n`2)ick5HyuRt7kJX!Y7mWd=*x0)2Zu`K%|Ox!ZMmoyF{{?I7=-+AiqZ z8223*H)6FOdFjk%-k0=UC%lCM+;>Lt82Sn44DYsxoU_sfnZ_k?&P3AL2cdMx$`6;+ z2IiZFd22Y$-C(axI(31X0i82hYbP>)h`S{_!iPcPr3|COGUpY=iyx`04#Z-C>N@TX zmM{qtIr|BBD7%@rkOB-w)*AzR5@q;FC@P#J6rY6-S8c7!6Nx;tqvf?r_-c z3XAVp;-Cv($X*S8=ad{#xx&d~uo#NjzC78DWI3XG)%}!kZ_G=$Uk$H|;dK?fz67s1 z1j~}EK;)FVIbpY09CoY4e$?P^aJd?M27?d3`wiSjc89}`|5VlCy4H17?49&~5yfJ0@n|A0TjLVbmUQ6{_0iJd=J-gvzs=}#`^jQ` z_53Mo8r*k0Tb^A7?gYKBsX;cz@y1YY9RI$I`NUg$2iGjplCWJgqls14LfEy4ZxP$G zTE;BM^*TA`Cf6IpYaGMD^+tv5RpM!D3f&iTAmMtA^n0GiymEE9#Lsk)*ibt|wvL*_ zMi>&SN$>&9ukQGzu=kBi)Hqz+jJD+)3)=^S>z%n{gWs&=p9Ex%+Bp~~k6~b#RU-Mn z(m%og~;=%oVvF>8?+M_ zgcX5I1OXoA%p#5Y+AlqM=My)fXN6`G<@kZltIVZfySNd8akrrPikE*$HZwkiB_VrQsN^ z}53g~^j%)3Ls{BwHO zfymHA+qcnVzd6|A^L5*!ZasQs$Ewj(U#*@?2^m+wSoBD-$*;;?2N_58dBRa`I3H(+ z>H<3)3R?ple4^*e|Cr%Y6GA=Q1lH02%3jF@$i9k=M7|{rinHf)SUPe9ERMRErGytT z${LM_tc}7zeyv8^q2!^VauVLkACy|8F=)9=AC6}@yN`N`(QS}VnI)PJ65;caKVtLH;_oTH!ak) zhgzFz=cjw4TT}6o7FSEGdBL|sy$$xIy)Ij|b zJY&7g!OHRQ&XEw1lPO4%awPGn5vwLuv!DLo2w&Qh(EAz3!hmKPyKCWjllQif&mGl|t%xCKJE! z`p18B+vlHisdwMS8br8i**|kCBB$^?LI8V9FR^ihWk(I4FF>^Aq`%Mol9bHF|QL zkEAo8XD|m7JBE3DD={Cb2=6yf_j!m6KPG$wgUsH|u@*U-V@fV0%r;dyQ!V-l9v{dM zAKl8RhiJl3*M33D;BO4rN~)hZa8SK_-+j@}Xq9HAy4>i{qkDu$5I&*_#_7(!&%MSi zVLlh;sFo>f`YHBUf1r!pPa3{r+vfxdF$KUpdq}wZT-CY8`?d5D@r%@gbbW;4{wU}Ha7M~Og!4e z=|eqKH>Uer%d^|KjU>NifW_VU*RXRW5{ZtkRBC{(FE|ZD&)NH6P1&4z8dlQir-$*s z=(qUy;@a3BkUig_g1&Ul^Hn;uxhdY0cO zQ?VLFN}tT=Q}|>7DHkHeAxnDKjWxZasizL36Xs9~T(V>rmpZ;~tZ6WAMXv}Sxob?? zUqo46CXFR4!BZ@}CgsEnImS%h+QVnnAW~(C`jS=5tbv5&{w9oaf72Pk-gM>u$lyf! z?#u(GV6)fR(%glu9=c}TSj%wC2vR)ct~TR7D|1JzGLPyU&+jq9UNA^mfhH=wynT6D zbY?S;62WyPyQlPl$_=0Qa2mZt>U`W!9xFiD0GVDg?F$6ck;7he>drxRn_mzA1U)?nxnCET{^mJ<8e_zvy ze(y2%d%|D6_4Yf1fj+Bk(aJT;7O-5M>}lQ%V>LnF9xli&$WO8 z6Fj0kFgWi4d3Zn`INbG!^6-E>JS?vf)&}Nth+^R-sxKu(apu(Op0K(vlNr!mcggM> z4@^2@UW36Kb2#d80h;>q>iL^G{>G)=x%ApQzH-Z5=r5-Fk=FD`++=DPNw%DRnC8sk)2EQ+j#FY6thgA2#b7vg=0aeU6G>cn!T5zQ-@IkdI<+i^3%s7~V@`6{Vh)LFu?nvcg(?BD5+IT# za*(A$g<*6OKH~x~K4Ozr zezqF)RDoNbBR?B63^|M@DCguXvbAT9a~8Fj3udc(|iPN>m`@>O8FJBqy zO?EgNLw5B?AE~QCO-sCnL1#2Hd^yh84*Fa}wH1MM?V4C;$e`G>CjRKQycl&M{9)?8 z8;AXFK1}wwYv3M*Ja3t?nd6Ep5B(`3H5Rdg=oynh^v0D77uJ*-$pAC|{8CsCs(aR^ zezKRk>D=YwvcMd6aWP|F`$@JsFzf@gBL()#quO2&!Onr3OED+Z-!Ny&;;&e(Lt0Wzc~GnpslWe#1uVl>_tGox|=jK_1&345J>L($P{ zmAHpb=BkxcKFObEm1Ag?6k?v-gihQtHgQc7Y1Hxp1~%BlwV2I;eA9J&U1r)0y?E@{ zQE5g>@ll%0NfVosour+I7{tI^R6(_ir*Wl6@|o?Dzc>q@Imdh|ea1PAV?i?6z%L6h z2l~iZ<^9-yK6~P@daq0^n;BUKDy}qclv`l+lrLE$YuhHzc6;_|!Qf9I? zHwcR{)+Sqw!loK4?JEq{r3W_5nMw?!Hmjf5 zi(zFgh`$35lNrcU@G$zIBuwnf3&$$sA}j{aMZ}rf$lBIl5NFC!u_@sB)CB^c4k}g9 zka6CRoRgEz=CaIn-}wH`H^ceM)>*X=oRsqY$Eag3X#_{v((#jq^(n6q=;}0YRDszMZ`HE z!e345jBNV!FfBDgea~`&#myxZ1g4#dnN$5@>Ym#)u9;6PjECn?80Jt|oI_z!2nhe3 z3$FoEC65-;YZ9H;Cb(Y{IIm6Myf%T3G>Oh@6F9F;l$$o4KGBkDDO5;^QIpW4?x49? z=2uuPQG+2lIxjdq7qU7*av}BAB^5ruN8(@9c-&S^WZ{kl`H~?kEjjzMa$azSYNBAJ zlyhw5;DvWpK1q=6KWF8rPfKGD%mF~t6DVWa%T0uK`;`Er% zoA$1|I711>2VX7KYt~8_xpyjFnIkhLgr5^xfLlP$Z8%QfsbI{xuItO-v~C{DMCW3s z6)c9)a?ysLJlYyJm7T?&1Cb3p!#MG)N0fFW$8_eTRVoR-hAHPs8Yn(a4Mq-#iazKc zt6ZbRQNeypfl_nhHd34OG#3TCf=hwiTF^&jy_CEhr{tq*MMI(mWz~v?L<{%BMK`rz zNVH%`w8W5D#KjvM5*vudhEMPYLt+C%ViOIC4Gf8mB274fDk#@%6%Uxuz<_-gON2vc zQa#XBKji4Hy>x!&K=u3$?R)kiRcp6K5Y)ZMQ06LIHQ+N3_#(I6)_?h;$l>(D6|06+ z@_rOjh4?oKo41JUODXwDcCf88<0p9}>`gN(ERAAQ4pD**kf1}9paUd`Yo|Lvf)0?N zLy_Vt^OF#j1cu~5P`T_R;dJ{zk?@D2!E|e1F{&t*s^(lO7Gx3rxM*~A5&CNX(xv@! zJVoVVCvt(fYPPii3*{#j&ffu-`*ikd{=f`t7rqo~i&*(#Q(wPnA*o$>+7c9N7Y0e~ zLT7d(s^tf{BCv;_;&VyiIzq0?$aOQSN8{*ga9ybilUV3F;_;X8xf&FciK#}o0CxfOVTURDuc`Wv9%H7~41?H<-as@;eK%Hz+4D{WrY&FpuTP))3b}f%yvLHE< zusg!_VaGujd3`;M9{s{!n~r!~{wiOM*Wc5Wbi~r$a4PKaN4?K7p-@ie7VhKh4*n>q z46LxZYz?TyGR6e&pT67vYwqK9<9qOTE`#q}A$VQ0Kdy>q>J7&u1ekGU=TlnFU zNMJt9Mr$O^ownDe7^geMINkSfXR=*z&%&JUpT`22(;bNMLzvU;tE^T1-;dEP7G(A&Kr011qv)b4Z=GPaG9ux(XQ{2rxT?6cWp{OdF4V)LFUTymmF&3mn_422j3qOo)um?A1`~TFfY3+%V*QG;$^>9Ustv;L3r6x5>+lQ zdu6sLI}EbV$IA}n^0Ggcc-bUlcJ0C`3HXVXR&uTZ*u_6$yU4W>y9n1@mRz@sb`mvV zJIM_aJ1Sofk?UI3P5fG}lbq3v>y6iwdfPt$$(g}N`1&+!UzR5K5>ALs%WXRWgW zUGTuMAKicdqsP9tEQuz3j`odx;U2qiw_ay&-;8}FC&*zQ<8nvkdTHnIm5!5R9x6!Q ztwS7%0~&E@JO_-#0V8pUBXPh;9Hb~nfPIU4Ofx@GBrl^|96qfDLWIK23lCn{(Q)Bm z1d}T}whV+PtBem;c=XOx)FC`?(SKj((m7kA4&<0}0>q*n^HYOX;eld}rEz3#Vz3G= zFVdLfjE{oP`z86w%%V|ikLYUFXo`;Ng4UMSiYLDR;Ny=!_~6erwp=h;?e7T)cbY2EoZ5MI zwAE~w#4?c21o6N;`rp%$peTbN$RH@nAP6!Df((KngCNKtI5Qm~Dq`_>Z|LaQ(Crsb z3AskEyHDrUJK_P8a7I^tZ(DrK^G?)L4p$?5FmJP3pzN#gS&fh zcL@v-+}%C6yXyoA?(RM?xXs`U%lGZ8x4WXLsQ*lGENltr~R^%N@7O+iRZVC7J#o6o{#g)6>)7eW9#X% zH$_yzod7J}MIkV+q%2W&P|YY)ZKuqnE%PO9C{od)1C+C*ksJ2vt7yj<-CV^>wN=*=6?m1NaXdt5fW zuEauCSe|>|JB0cmwNG;jGkA4j-zlwUKO|AkNmgPf@H^o$a_kQ6LgTT%1Ci1C+eK~f z-@-%4ww88#q15Clr@N0lw|4_#;!Jnn--1E!$G#xDVwHSJwG2^-9ff8MkZPi`sW$#N zAXOwd;eZBpdke_M9+nKcK)0)>n{O%=UR-^b2 zd+6-JR_NecL1wF1*+#X89jA1fB8UGr=-Q%p?b&XWnj+I^T#=Zp`bzj*BTOkGlt+%3w(5nA<8s_js(dM06d3 zCv3r9S`~J1lz773G0P2Hltr=P82iL84@V%ofIJ~xGfli&^GC0}rc!^l0?8&XXJ?#< z(VTB8(mljry@i$dkCf9_PAj+>gb>>p&!BPd1?}wwM9i~%(W1wBp4hSS?9|n&MdT_B z@fl3%BNL)A6qKWneS17Ef5PyhAyJKyM1MytF&3njj@1g}D~U<%rui!M#ZgYYhqA~S z2WsV3d2Ae)lRKv^1|2alwky>ipfJs+KvrlaLr7!;*`V&gIDG!!q*enJ6 zr~UNEdf&IJ^rt50yN@lXoOny>R4SCW<)k8ZdndCDO@E|*Qw3_i!(iiL&?%yyYb<+f z)^TA~6W?L!ZLumG9uXed1{u{IjC<~OApw;0Zpt&wR4tfiO_ob%-B8$~l00m(gle8m z*tZH^-&#Q4Jj!CF9ruD9;n}0z^zRh|%RkfF2UW+m90Z-|)3oeKrn>6)yRT)A@Lp>Q zxwB4QttcEk+Xh5au?Xu=)YUxh`(2rnbpHL+UJc!jW_2>Jb%juSE#@zJzGuGW^1mhs z=r*+ST(Q$Z1QJUv_Q$oy)w6!o(LO&TvXrX9?s2izkVQ7SM8Odv* zErhrk>1$yvgkl(pEq&k)kvCFJL&y{%ZhTx~b0o(knL^Qz`#o-qwuI9hP-RTKgr5)> zU=Q)VN?xJ{vH^PoIz(K~KCdE(>*mTVJx;tK`(dVb6aCD`)%{M%vM)DzJlAk`SV z`*+QjWf~SK({G9)5mJ_bcT7RXbfPE>N+A-ppM^rHzoAmqvYuc)_K-NTeffa=SH$rf z5XG=hf9dyb?MJGmpz#ajCj#BtPlLM%cern9cT`$ASpr9QoLdE|e>3jLw6a$RRP0!{ z@>RbD{jF)GsSdW;CZ6B+C8`%7|x&saTTm)``w z#Qvqaq!S>D?J>FJ5g=9ki+lN1fKahV^^#M7Wb!Y^C6fU0WRJ_GfB+fmU$jfg&d;np zvX|_gUuym`UOISwGKgN>+Pu{1#H<-4zL4xhaTw6O(CEZ)805cD=tMgo@V+qU#5x~D zz7PR^c=5;DrMjaNLOR&ly+aTRSKOYxLl=si+`hhh2gfz+PrWb$A{zc%yl{IW==OKm z(Y@pD4m{uSz7z8OO|~O-$L1T5yJK<3>+5g0qj|^W8@RdSaVH4>Exe<6#{nny>oL3( zz9WXm_-*-JD*9DWeq^IBFYvPd<23i88&A+1(G>w{iHwR zR%j~;&G}VU#49NYN%{6id7Sda^o=C)MW0&hLSH z(?Ff?yhQl|pDfexRpMpTicy*K|1}0lS|;5TJzM(m{l+W|gc$K)vJ{Fzl=z}BOQ;|} z_#$G8O(0r)F)<~$5OKb6g<@5R8egd~H3U2uGe5P} z_mI0i`|J<@AxnGaS)TWyP5@91MTS!Nh?C9ILg{@Zb7u*l)IJi1vj8Zw zkJRQY7L@8)TzD3ANbryh7XwY7Ly@0T;ig8WKh6KS=}lq?#1QlL%CC(vuZ`^fdZ)No z-hj{`wZ#f`|@eIK5_t}L*Sds{BDXPjWpBpT14*lWxgtZPvg z=kQUzZHdmb)Qbq5ycc!lo!p-SQ9o?>L@VRXecq3C(n&oe`+e%k*}&=P_ij+np?3ZX{y#ytg7Kw zA})`f8?eT0D$6M3R<$eFmr$4EWvJ#;D>+g@X=+;$wJU2@(XFtXYi1}@Dc6OSHfB^7 zm!8h4HFd3s$gA>~A6kcGl)0-k%-M2DjjQul=+9MK1Gp4Vt8bLN%e&?_tjUsX%5rsXoPF%OEX4cNw$D*s%HI01YPFR0&Y_u_T4SUY+beE76`zVZURRM$ zg}a5F*cyCOa$N_qB%WW_!)Do+WtOWZ2`OmkYuZlueeZ{=?JOU6$>2Xk0Qs?t~CTicg@0jY!XN*6A` zkUI6yyk7Vp%8z3hl%=1Q0WA-}VQ=Q!!u>3Hcx2i{|CMKe!ZA|Clp zf6}z~%+bWUq6hpJ#P74d`%}N9sAtGE2wwn9Nc*rC7T*p60M4s&o%k^%2gRrL1QeFz=P;)#T3 zZZ$QJgpspLw8IOd_qVy1fK9CuV3qju$VHZ1k;u};m`H5LGbo*!^|v%lMoGx$Xo5a# z;e@*Fj_r$e>pKIkCo=|<5~QB=`*KZWz@Na1V;2{&T;QEb0UxKJ7I&VNg&UfjB`>bd zclLStdsODjCqaju-5sO6?!rKu8jgTb->87eK3|~r%jEgOCulDqbP@PuXvs~`t6dS) zpiyczKIOQwA|WX;AkIg*OUW*v0 zNQkSc7+*a_wtJ5q!P*UJe848lopMhsYIkQ&R_T@$qA{>B zK={AF41+#BzFbLHSHU!M@^gdD@+t8_uK7ryL0wH3}viRVIA=gEhEw;50+uN2>ju;iQJ zx|`-O0DUU`!EFwQO(?$4A1tr+VP57o#~L>tRj4q|lNl8B6cVv3zgU@f2*5mGDEdz9 z7KvDJScn{v>slZ#xBspIE?PvFk=ygPdXE|9M2_F78TlGP`D`3`@8wlF-81s*(CCO>)k1z=Oet|%e`ibM${KD@ ze0ZKr*2s0P(S^qH-Af0n_!ZW~jhaR1*j)+d!ld<&chRk?K2LPd{GqogBYdo9Bd?T4 zH!QGhUy*E>=YFeQg{apQpI83LCjx5#-E92t3njFr%4s3vQaC06OT|RrY(eh|!x@eo zeQ3%k;aAr{h2-}2uQfy4a=qp^FPrLbTV@<>z`QTw$Cw|E@kxwpMOUVks5NgwT&Vn$ zTZYh#bWdX~zan=aaUmGy?ZNh4@ZRfM*oom9ra=ku_^T0>3ZP#O!QX0Kf zC1!9tX<(rZ^N$V|n?%p5w7Fvvis40bk%wq=)bFe5I8*K_2s+8^Qz0T0mdtdB9ADxV zfYxB6BSAH6FUe@DNM_Xa2D3brs1MdIRh*4Aj!tP3aaU8iLTcnI*~}kJ=p^z57e>Ur z(Fr2hl2oQi#s1}c?4~(S$0Hz`g!EFIu&Xc=ozkjtd*v|=@9P{|4m5iP7&HMn|E9fT z?*M6t?jOwH$8ToyG)HkNRmHhREyw4#S!AeqKDQH2 zjsLNSe&I3%pt+jtV;<7fWCqxWxHTvNB-WE$RTtzX0FkZ@S^!yBj{HnzkkustaL90L zBP(YrjV)DNk|R~Tdm*EaK+Bw*u1cl3?Z)TaW55gwPOq6WgKDXAAK(0fhfH&fP?P&v2RYt-tXe{54-#A@J5I{BQ0@11TxHpW%5@F1Ge zt*{8!L)+01(OIhv46~tFFArVtuZ!eR%H;oMUagmOOc-cl&Iws{N~}GqmlTlwSMl$7 z{;zIvh#+9ttcc~BPjT_r@e|vdk8S9;^OxI?j;BJJ`n+sM+*lQLTxlltzACbIz9$GJ zeFBxtl8|?=zO3nwfAkEfmJVzhikQWZrY|@tUcE$LnX-exakYO@I=)ID zQ&^{${is(N@FE+uc1oJH8&j zEJ1AeW(}?X?128Q|cTZCv>Dj};sUTE`=isrkCFb;{aa`N4&9FLd`gQmlj-kk_Vnz`QmO^( zBaK0FuB>;JbMmsVgkfj~IHku`$7VC9SQjw(^tv>ZuYH-{egVU=8W=(r-@JMA_6@?D z4{uQ4;Jrb6WAp~=<>d{k=L)zBIZJ)M=?=88VUfn~a)4Esvb6o1kwJ8cZqu(CKUUvDb8S+G7WdEY3Be27g_+{C9M zb*x2FgX_w;uG2DY=N6$bd&sBiR|c99gMAa!i=Co!t0payI%e~#BrO3g?7|QPl@(_; zA%2H`$HNc0&)GTo*HE?Wnv%mquaKNFG${9T16(2%a_SYjQRZ>D?iIUHaeMfzQ-TEv ze25dOjD-|DqzP3kLR5TIa%W0lg!;v!Fzx3Gp%U0bXZIi0BiWTdj8HTEvKq^R?(&*8 zb^;HS#f2sh5`Egme{L>|uVz;8K&#W4l1C(HS))5OqMw*c zR{UAkc>b9GvPR}5Elu~*@oBri?J`uBjH!y%M_7ZjA_gN|K9YoxpTk%4sX8K*xl^^< z`@St4c~l{09amT1*YYH=ezdin_tNO(`c4z9Z0q(ERA2g(eZ@awjpMS5HMkK@rqa!G zBX|FFM{y}OvJuvWZ;0n{DG}Z_C!RjUZzH-q3_eK7&cX^uUJQx|rT23aO4^L~{O0@P zB%3P_=#=lB?@cF6MhC;T7GY>zr34@Bi_z5-VOk%O1|)l1-alR4*I`{z%uQ3)O^Sv2 zsozM}B}q{NP9gKe2nMas!|-b7G%G8iBcl93zavsTo3ak8hr*?oc$4%PuL_ zFdp*mwew$;pMsRcfFEv$911Qim#?mtF9mn1f$qLJS6r&2qzE0w1lLyn(XvknUW8sR zn2IM89L9U7qHW$vqdQMO$oIlq(8`z#2y+y&h()tt10z4>sVA5#Swx>0&Aop~WJZ)n z_~ zkcQj0Hgkzc-`94Qb}mF<(73kyX;Yfi$e$qDOFE}cCEZR1Z=fvg>nvMX z;hK0hBjzQ;ddTcksPj;5Hmh5CA7XoNnjY}7CQ>{aQ(tkyA{^gkO17+dllp#-oL6gq zh|PHii5VU&;SRrYV|s3K&emfE4CR`}uh9X9aoY6H5<0-7ZJK9^k3|Zk@ls$mfnMCZ zAlge*MTftvKsvJF@&K|s9Ss7Y|KR(^f5?r4Xs))fcU>3neJ&7uE)kyrTNpIeU@Z5) zRAY2^L7l>B4JlGQ-CGy|tXhk>Oj8Z7b(L6WB4O-ZdNp&wUdaYkix7+lTKz)6(a$bz z2j(k$o2UMEgB|IozIr#H*ah0Jnv3@CJo$$dxO^r||2fpRl>S*u^N==UVG_pptOJ_P zve}gx_g32yWAT4_*=28rv%-l?~&2Lsin8;M5A3(ufTi0Yu~`b zp_S&g+Iy0E{qYRfTzNh{L+Mb$qovg6%q^x}Qn0{4`Mgw7jRY2pB+fNGWvQh`933+t zZc=bL9c1~lQN7WPlYWIJ`;PYyn9@cD{bTe!+UaV18GASAkE#`vR&0-f6b! zI+gO010vXyo($_4HSFge7Q|ssC4Q1?r=`QijrU52rJ}-xP$6C4nf@?hfjJe^qX^k+ zQZJ=J?~@Mg*R|6e*=xBBi-e@4Xr#mjaXwXZ`2B^gC(E#QUPMKXhPygkx>`fkhGq_8 zu-&f5ch$jgOAW3mPMS}e(Xy1V6p5gn@pZ3mQ<6LoMT^iSWo=}&^XR}1)o`_`Vr$Si z8`60RfssobCq_xUBc9i9b_FG@uQ5VmXd4TloTyVPPNi)KQOwG8-JiH-b*ZfwA4;IPhx!TX)qOz=nB{OEhV;U^i)qPhXui;Meg4>W$-(Q2#Z+wqh3S{s!! zMCb0bj(=5+>Qg5~;f6)I-LjB4FO51*Nnqg!SOCh zYk$>4Qt)oiB}P+IR4RNV?8}n76KIJ~52H@wW>VZl;plEbL=9Co#bYXlJNHP=mE@RB zHDd>;W?HKw5buO;fC<+O;^@NX6aDSs+82(K^I2_X^Ijp6 z=oXU9kRJYa6<^{X(NR4Kx{)l8_Z|AZ*3^#JQ4r#Z-McYGQHUjG9UnhrY0AV-iq=eh z8MG#v9fr6X;fcDa8gG>(nEm?eOE>`91{owDO!URM9PYoSdr>ckUzY#BHg^kC&!ce}n@BLIe~t z2|dg@lbse0hEx?v2eb{zpQ%TH>5YSz8vVQtKsxv=1U5z}y2w)FPb8Rx; zuaA`Z-$V+y+RX`y`qdw?@@o~9cZ+KEuyKVR*4gbCSG&+!jpV~Ve!K79p`yTVPqZt{ zJvjLp1{JA-z&pb5D3K+8`!C=a+H=!0he+F4IT8Ge6UrF}@f;4aIHskTulStdFgdUB zq9@;eWQtI7kT@pz#96C)f^4FT>f*c9e#Y|`XxrUvL7NB8F9k6LsWe(Yn%XSHysW8Cc~oU*MDJuoWlXm7v!@|_MKFmRFt$JW-y*Mu4pK+5lp{lwMRIj z7s4c!BLRts=Sj=^bcDUr704C_-(C17z(S(JqI_k@Op<it0mrB`4WT zYsX+UTWW$Fz_W zNfz}rSTLyY;yZ-USe@Nn8lDhMaI7@j2*zD{lEB|*Q$b7RKEF|0(=`RrWZJ!2LCLai3LUzQ)NYFxb_VoQ5qs z+~qO((gl-^?1ZX}EUTwW{iCrqEEHx>YTO?BV2a0%L>MZ!ZLl$Dntc7Xn>yS9}3t zY4?9yOfMOwpQLg868dAmUQ%g4{lI^T=kn{xnR%Ujre74EFt1n=#5VxK2{Tw>s{Ivl zoO~w5xm2&CV9(~7mj0RG641|k;@*E|EJtDz;V`_TtAd%i#Ya9>kES+7eAp)lHi@siigpt{8*r51+d(H+i;-x%{lPM&3%lG_^{v<0# zCHGHld|5}t7u4HdbIcF8Yh8$!+Ax+9&D|Z|ceMDgul^Ra8pz>nh$LS6hjFrl?124iobuavCkaCa$BpD;6@LfS%VFzwCbT~vfls@!sk12@Td*#H6 z!S z2(5sUM27JLtc3;Bh4NnqR*Vm3m+m>;8wfj=qtv?$qP!tQ#oMJKEj zL6VK@!7;5xAguh3gcdjbFRAA?n`XSDvgcH6fU*LpxeRbUO*)a~C1$_!FbAbf6dy z_a$|vc#s(SH$++OAZ|&^*ggT0%KEB6Q4xnun}BmTc~oTrTd4Co)~a%2mty$S+3b1k zKBnNkbFt`;{Xntml$j+-8Q5_95zVsnz5kQ;w)l#?sJ^6_qjSHOkR8Fvvt z)k5Av*+St#?m^)}bxVFrc}wB;!NQe?zA}zR;|DHdVfd$+epIWU!JKuX8Cn$b|JUq~ z@|9sU8sfN&`6w*XY@_mH&bSS02#N?~QwWNMX{R*i9pTINKbtfErX>L(oF5x@yghnBnDe4pGK@p-=VkWQb%=Eu%-A1OM9Ng zZ!YThs@P7fg)QS+^GJ3gz{6dF0t+HMvHFAl^OfG8^Fr4p` zXt7f3z-?T!WRPYvrbdxitCCpzJ#mRGaf$gqSHF!>n#ja-y zpwwfkC~hfAnkcZO#w+=p;f4LoF+Skzi1iC*cf4!f{$Bw7_1*f#lwjPB1`x1WsO@02 zpql~1Z>9Mrzm@)%-M9;kavFLmYmR$IJ^moy;5%En$$1PIf513NFn=!A23ajQWWX{p zsfLI)K35c?RVJ|1%C!Gwuv+lU;L0(NE}`!9*q0k2QfwHQMbwZc(4y8iN_O>E*Gc=T zZy%{b1rr+VKrTfDe#pKLmxDVl7nXtmqRTPcvrT-;R|0M!jr6pkc6$HoHJ*%;qp|b^N+7t zVfytn0=5Y!VA3e~_{XJOL*(A08GE*wdve4ZS;ahkAuUDQRTiGJ=_>9CqL(^~=xrVB zUwh=BaUt+U_RUtx0Ym?P!K2_S2hwN*LynWJxv4A|^Z- z2zwsX0!UVFTH>)2`4I0MZaY-@oH!6YYsAKwrbH18JK>C(Im38|(s{CFgF#P5SR8Gp znAYY&t88BCZDuN>8~fx}@BKvYpA@RI%|Q+B0NuE$6jwOuVxE3Fu=`wHcfl6`CPF!E zQq?^^Gk0>a*REFPzP8B5zZr0-ex4nNC)wC=QJQF4^-$@>8`UD8KnQy-Tk ze)s5X3^FV1ERtHQ2z~743NTjG%B`2EkVUO1X^rWqis>M1X@AmMQVcjCjx*1E@w&NW z?w6I;tuJnNbC>secIhO1p0pomkk)OA-n5Tgj>KP$XUZw4#nNF`c+hn(r3bllbGFzR z9xN{C*p&P_#ane)PWhyz6&mc8&hIW}cHl9#a=Kq~^jO8oNYxO&@U3CN7sJntRlva= zpxTT6dy2$*;A8~04cgV8q7FIZQp8+3PbeU zSQr}KLS^6sJMORHtyW)M7;s z_Asp6`?cU3?|Dgux0%fh#RP|m5eF3z*ESZ$vozS%pJGz3^-|&8z$uN>=TAbINs(AM~|2NYXfJE$YZ#Hg#<>jht5CtJbUN zia$viI=Gwg6pmocKYMvWzJd*z28N1@-tXjJCOg}fAQ?ZZJ9@ACXJi=VH-(Pzf$Glh zH@F+D4r=9jZi_+JcBaLS0Ymmz-3DECD^;h*u#DqwH(l5oY#;kIM=|vO1mjWEj7zN()+IF3z&j>>h7A&9E@78mGb`FVt z=gk`}=7;jDb;sVf8nsa``^)G|@ID{2Z9(mgYNpk@VdGsc@MgO0*rx6808PJxwr{#m zAx^V`y#rPI``2>E87mOpNWo{NNX4-iw_W7LHo7b@U>*w|n`N{J6BJIPTkM=>@zt!S z2$=*`=$YsP49<}j2bgU(9(<)h^_lZEV;)&)tJMu23!Mb(o!95}(M`)6g2jNMXJV4s zEBRVwm`#_W%?1Kv!n1!>y+F`!M$ zz98vhKD2L7p=`HJYLAdtAqCf$(U1B`;RvN<2rcN>70$MrHpTe}@ILMW`993CtddfX zCKs0_6@44^UdGwEh%b82%dWuAG=6}S24LMbU{*)dSg=-^-6&~~wdos2>zam{SkkCr z1GXY5qXH9>R27(|$IRE&>kS^eUsWnhlbD&^Aq91og&sRyHIvp1jv{;I!zG2#Uv*<) z9uNHY;s=LT2@4!h^m|bP$h%?4vR4eSi~u5W)nt&LIwbsRo0o$ZX&$LxMf+fg!uSFf ziCya?y*TpZ9OhT8F4w(4&9D2NopheQ=A{bBL#jqU_&~LNlq*gdvERc!`KTiwAFs&y zZBR$e`(Y0phGrCFdg#I)-A{TVR(oW(U2Vs$3zQNZFj*>(V} zyf{S`TmRe&<>3Se1bTbY)RbdPX%<_}^OXg!>^pSHI*ZcOYeF|BNU{tpB&&!XLy4Y&g9~6*q zcG$y|0uVn(b$u44YjXIF;%>wPTg3Uv9-tH=|5@5w>f^iX=w^*j_gLzFt6d(iZ#hcR zcDgfxC_(P*@lyuPl&*1AC?sYHK`&Rn#G7e1;RD8E#rcX?b3UJD`gw4cg8KYlD8fd`T7z3IJiCO4)@IVab-Q$?{QWHJKWWAT0wTRInFgAe`9W~coXJ7>zTqj@IpCRu z&I22P5lCy|oVqrsdW&maH{u4t8tPl~399W9koim<`>{E75QS0^yM0Ing|?FxMSqVz zU}!doMe8+s(m!^TFE~sci54h7Z`Oxh5ZD;c_kIPWRmF}*BCti0r6QqNRDKG=`ISDU zsDUH1_eoUP>TA+aMUd|mQJ%N~Ei@7EfqF(9LhFDd17;SD?v#IZj{MQOFkOkkk9KZ| zAE)~dlqFAcBN3~V?JmtfA;B@>Lyq|$pd9u!;5``k9$nBg+x-erWbC#vkrgEX`60sR zW48pScs)+H_Jv~aw|jy-xo!&dJ}GdaoP;`pA=vb@`BWm#c1ws=cuE{;=i&!u^{1Bm z+K+d^?9i=YNy}i3KeU|w24%@Oi_I$E%|(sfrOf*>r#MVevdTbdvVcLm5-~Tr!=Cfz*=@crf}Wf1e4E=09>B`b( z7bcq07+}ffC%UmeG`BN9xO+m=+q-_MUmU9zikBRz4VY#qm{hteRYoW*9ztzGCjJ<5 zxY3+$#^e4q%`O7%l^Hr=(xDiB5Es_NIw+%pemD|Ti51T+a54QeG2gZ(C=>fLB6gvG ze*3dvNRkOmD@QPfL!9=x37(PUm=Jc15+T1O;FRAF{VIs^49H?0fr0QI|Dx=IejS-k z5IQ|q!BdhPS4yW;p?J_=e6d%G^Qu;Tz-+~wS)O3mxmlR&SxCbVy~#O_>AvtnnaP=k zsmXM|Nh0E$Kd_KxbND zb_)laP=_e325y(z^9M{trwJ35joI62-qXtyM6|SES zb0M@zi3^<6e&tJS3Zc0LetCvJ$j0gLdZjOAp*2vOtD1%RLQ^hTVtCn$DfN@=i$wY+ z1dx1Z-;duLKXrhfnuNTZz# zhB*eJDa+W0lPqcH)v1#9S8K`| z=34ey@u(-DZ=Bq$I8%Bg#$GCY%e+mSefo57f+iT3x9E8zJ9MH=&w3p(hC_@eyWpjV zS@a-EfuEoQl<%UFDx-P+$7f^s(%+aI5w;p{VHTUg|i{_yXI=U7+B!}#zLxRDCH z?Uoh+p`j zuR9P3_Y`3zDsZ51Zqn?NHpJr5h5lZ^j})AB{vXEsy?qFV{~T%SH?KOdmF>m#fV`2S9~p46>O7!Y=`8l9DXW?1ESE1peccDl+*v zgm_KiD{&>94Aj*4|E5MMKYRsdsquxfLZuh!K2pQ#VGgDC<0y3VQI1 zlSuntnmW$W2c*3_9KI-(okJwqC}^}-20+i0JqSr)VO~FOOD*OS*}WyYOl9WykK}WN zl*vXaW6H~l9Oh!5o(o<{lK*ywe}!@-08i_qj}a#ViFx6T@$|P5Lef`itdwdrhf9iQ zx%Xrij}bf_zpNN160NxbrnH)Bk7 zRdV%uF3A$rE{#aO=*emtGinn0K_S9iTr2i(>DvD&?7O4k`o6a#Q6hqf5=IMyh|vb4 zhbS|8wCLSvVGz9q38Ic(Li9e-M<)^qGDZnT8NK%&qD0M4KJWMc_pWoF{oHlW-e<4< z&t2>8d!Lg{`%^yRcDCT zflazy=3R|m8LAYTbh^NHhv1_-1$S)ZJuN*S`%y$wBt_vg3xUeALLU`+XB_x_;-hcm z+&AuWg#^VX`g$Tfc^gf*-oTIiv}r z5o~jYpo1mSyt$l>cL5QA(=_^1@6w%L0;0qZ&H-1^I9DX~wdK+CHZ=Rvu9bxvEqpcz zTEQrczai=9D*EjcF}xmpRvXhgU^vdWeIkO7MS68kH#++{O36bIWAbeZ(UCrHsa*f~ zND9A#=b64LHeI6}o_)^}cIt6^`8vIE?*;0eTW|;qcN2!Y3D515r@bd$IAdHmBUCu! zUN|EMYq5p3z%6HTb=C&&j=@@-^Ja3Bg)+5(?GBuC!|Y4U#)@s64+Nf=N#tmeT{I5u z53!#!Q(U>HrTPuIS`^OHA5C|(g5k3d|0TS~4WGq+04r_$K z8m(FKwY!E=|TF8L6e?F64RL7a0i3r z9OvSZDR#-q8{>ZD3(Cd=vN6aPPRJK78oREuY9i@kVitd z>&h!RWLV#h-gpkjU1JLF#6m9^V<<%E^x!x*Oo4G%fg`WvfT3p!+MyD?!41b5!*SY} zf(A@MArk5o3squ>!2@FAgy&fE5gu4hHt;K*Jb7?EQB;q%-}bm4Y>UTm1P8 zJ#%uDde17ejO?;q^Q%)$p7htyJO`I z?x=utRDe5}2(9?pS7G9H7;%quH@iwVJMt_)#^OpVHE<)6!Q_N;e(%XD|J^#0Fh8+n z56Y~k(0_|i3{)rt-`k&cNe&Z2+6XQ! zf%UBwmOkV6nIAcA&J26v6#K*p`44~i)?$2XV-9RG4s2o%Rvs_+82cXTZkFYKPj0{@ zn=PokI7?VD7(IkY8<}(^LomtK(ne1IMSPI+^6op<$=hW|Lg|H;gnWdJH1IxSc%RTe zRD=AxN=MtqqKkzad4>Pqy_+gjK>p<|ft{%Bov5ut7t@>I0VdIC+e&mXz{DH;zZm~H z+S(wD><|nLCTTa76KP~3G@(d&;qoAC5^^cac<<$85306YyO>@NgXD3_QypM*5kVL^ z{VPlbxX}}nW(!43u9+YtiX!v$R8_A+X|12(y#Z|t2a$fzMPjKZf{h_G; zkv+XT;r*7dqv=Hq)$3)2ln0S+VN`HeAVw94X@ntnW9g*;;1eNhBqNv$Ngu!n)|W?C zYX!kUVsRoa$VYB)rDcroAB^PFcl689uJpI`60hh%7^@$2s_M_9_-s(HaOT+i)HfK7 z6|}MuAI8=cCR%m;4+SY0Iw&w<2kcxsmg*BETovq`LzYYc#NszXrn^e?1YF2lpx9f} z4F8A}J;6P~iANoqBm~h^mYjr!p)!I1<+D&@(wgDBTF6_}u(w~>z9kkRL+*eUzTxVv z?u&54LQ`R()*=&Ck;I@_Vrp3EE|U0%Lro~olGWk0luly=DJYioN4lVu`UEb$=8n2} zsOTVqv(p7?lg`cF8J1`zg?;VAKy^h3peg+BSomG^Uo=B!5$>UdppAlU_5L{#sn!_x|QPV(PynHN4K8|8#^_jr_9WY^P-gez(~nGr+>$7)u0vemntd zXpewnbHHhWY4_!gQ5D>?%5+UM9UvJN4!N?U-b-fBM2A_)Yu1 z&*cDoZ`xz_)Z^K>drr68yIXh1cqZ}Re~4+Q!#uY(tX?Vah*bWGRjafr#Gf4kVsNDZdeT!uE9hw^3QJP2bGh%VqQTZV}!NEKN=hAps2 zhbak?kkt@6p&=vG(XUq&czg4S0eKQhLu9Y$qXNLBb%Kuste)bn7%v{opwyBLJrOh9 z5_HsnCy562j>+^f$tupqKUBZ26onbS`gowPK(V3(PEpdB38Qm}e|f)ynLeT?J=Xr0 zP}-sf;(hS4Q^(oTz2d41{uC1 zpUA+;FuE5!P|X)|c@D4d;M<4`YG(FXB2e$7_NAz{<`lIyfL%OTk-xvBMdU>lkKYJm zX(sO!q@xyO)?D)A#qc0H_K+u&iHz^H0eae$8bid{ZlH4@v(KVj|2JJ=rZ$; zii!&3o(vXHs;{Q$rBsJ~CzgffDLr*7t;Kv9IY0H7w@)OYWLO!njlG~yQ}KFKi@7{Z z$=l#PT%ZaKv97}^=!}FcNgMn!{prDcBL&e-xh00M)at7Mx7!$MO;;QwJg1bhON=;X zVH)Lgk{0-EbRBv@Jevk(Ns$zBcunW0SbdbYXtbKYDF?5`blzz{pQ|`Xm+1^A z)W8Djj<^-x&>SyaqOm-otbe*Ff%%;(_R)S_ z0_#z;j>u8-r}%A(^{8L($f*m6J7!vv810lo=qEa$zMdaDmD$}ca7vr-DAEF zdLa4?VKvcML%ql^&EIDGXXsaVr`Y@4pV}NseN4;1k4i^Kae6(D)9;tR$tpmv3oL!V zH;4QrgK&Ea!tcxHowPCynN<~X89v!Ym{pW})$QRsT^e%ItiSM%`J1qAJ6-LFZoA$= z257#tJrX%IFNTy5YHGV`G!F6yK9Fwjgttt(ZejzO< zts)JT*63$jdpP)D@Zs;svo4RW-(6%~FfJDgxxk$zm5YHqB`R%3@5nr}Na2~N{kRgv0ca?7V@yC2M}>c}zDA{2tA!dmOO z8{krFjVGg_tDj~AbgD}pdZFHvXq!;5ZRs4(LYc+mB*1t09e; z+QC?F_{tUXlK!?E5FDRTTwScrD0Pk%+}D8N)!YZgwptZ}`OJnB+aoGG#)tp~d_O?$!2UG@^x~KztpX zH7}Ia2axQ8jGi&=bBsrwl{PVcV-dg?x5|%i5YHA!c{Y75y*SQe!NL9I+eclG0-lwx zAK#9cHHv(1lCp}vO$SHo5BC}pm0Lq9;>Mc7>0E#E;iim*JYF?{+LMeNY3guS@9ewwMU5}e3wA?`k*4}D zC&Ogt{Ixf)dCaNJB)iuNzIJPV*dU(ylzp7Ew>qmc8@V_I71)-U;~UYS&o?7Km)V~i z`Z=ZgIb$Pej&FUU9=})O|JDcOS>A|au{$T&*WVI#E^qocLh09}+Tu6N1J#SdpaxLiQ9Y<1 zsGq3L=6Bj3wBxmN-GGGz%Um!87!dOl=?kNV>B59z9xyVP8tgVO5f_d7hzrN1;o=gz z90rxcw**=JnRYRZL!e`Al9hT5+vV9;MlWltLGY)IygQ5y7pNV-AVb%5qdiGpSkUXA^b{XI5f z?r8pOGx0*ViJZ%NqiW>Sbk5`GVNf-!qDvJ_lbob;k24+TpO;dk%u|Ma=1y7GC(aP@ zJgqF|BcNJCOD)sMV-y!OMJXnzq@ie*U8Jj}S-Oc38Iq7B(MW$kQ1~fztxVZoUj-u~ z)*IVV$8b-$t6br@RODrLYvg$0)fkAuAiDSH)Ig6VxH`FH7%9;N%`?jz{Mzk)9Qb`I zl$YsUx#ntCi1Kb>V1|Yy*xnOYHKp-cxNolP8RUJ7C`5NU2Qi%}f%?L=^y0of*Q*~$ zTzE!4v+#2gje*fjaYb+dpIw!zWw>#NbUpISPU3g3>RS9*Kef{&4|b6567flPQ?P8s zP;rAM&Y;L(LN4p`66*Wpc9J%H$x2(PAnupI?NlL0`_UJ#U4<6@u14eWC_QsG4>H9s zE1*{?e@)+LK$J(-%~yN=kfodeWFK8fK@=td%&+sA%~aZdshx84EJN zy39{UZfE7&P=1+PPh6+sfK=V;uAUC@GjhLToOnGesItmDnfDxpmB>=>+iC`Lq1@fd4_On zdHMdme!=-aJO(sXfuQ+tWLj@<-!8KmfGQfTm_Dy`&`;c6J(GjNemRTV!})xoKG~89 z%ynFR8wxU^& zkk`sy2gx}jxh=~?w3FS4%aTYZQ+tu$n)iiY@Yd*_v^?! z)MVFER3tM3ZdxMa43fI6I3vkSBhC@?_BH`Qo_>KIgR5V%f49XwWD39A*Qcw`f2J@q zY6`Ob()v8xT}8lSIT{Vnb|W&Xu`S%|b;+lL9jA7(^Ckg!OIK@WURwL{<*t^pfE;l8 zk!2M%wCI9SyB`(Jsd@4sTenNRkUqZG$giv+TEB-!w@$CYQ9rx4vSh4wYSdNC(5zgE z)~66slZjddO#a-lr*?AuiP|zYR8z}qbh53iB&Ri(QmZ|A=fAD#ryx{2nhIHYqY?Fs zmZP-#amyQ`o^_CNkSv_&4N=qyZBYUqKNWcZDX6KYg1(83JcbmcS5y56jOAW*Qp~ER zq795i9bItuDv77kQvPi+JyPG#wGUXoY(DMR^lOqHzgY2`W0T$ga&UV;`jNkE+r-5} z@f?A`>6}l)Y1?+&wAp^(9@n&b{O7TN8Rog!y~D5Gn&E}B+h2Bq_N^(W*vd9Ky}M)@ z3r|Rok4n8~Wa_9-&i;POzn;v!P9CU_^NBldvqvnthM#LnQGaMb+7wQ`dbn( z6{XcfF8IBYB`ft#&;D=f(ji9au}TN@&lZw>qiHQE)|MFT_B19!ocoWZ(2N1USWc{D zWxmP12?L5p!z(18ynbj=Yd>G({w7{nJjO#je*Sgh3+*lrGzB@v4EGbck32i(v zs}R4NZA5j9xLmRB{sXDCs``BZBhdDWhMyX~k9d+h(?)o9Lw}NM+BTw%Ps;YgPMVKR zd>d%L$NYTs)V7@|fpSGbf;(ab__NCDqXH08x`uE2XhG)4##aGtNKYHmF*fdV^sCHE zZ798B^_As8yA==I%j?N*9aBD|@RLOaWZWkpu1!Q0zqH4;cmelR@ zhKhN1OZRts__7ErKzYBZ`7)59?^ZA9@nW2Onbm4&`hF3o!HM*(Y4MhPPMev&WZR$4 zM6HDzt)=EL{B5B==tuj@w`985m@wUc2y>T&-^2<0qWy|#`a>bRpmZ6Qdq5WSgUIyW zU9j6jUbcrkR!Iu%oTV#iZAljQRN0>LLO0n|m7hN4vn_6WnbNDHSEi=%iBC*9@YQ4T zVzfy9x&s@ZZKQfqj}Wv(he|VfQ%J$C7bv7=*H?I$F3qorO+HMK=JT+rk_Ha;N@oZR z_WV8!Y2zka;q)`2>t*+YQuI-s8OHTKaaWf~T|UgnN*G)%dc$VXYv8W>HO+O!M1pU= z=kzc%E0J}z;*w*1#a=?79b0{vX_^q@uEMX2jO1~y9(hcTM*s@)0aa9h;uewkwUOI^ zO0cmayrDU5RGhDHwZ1@qn8#Sd$)WO_pTR;s==IlBm7abjrw==l&2jIN4`g$^KIicN zIClS3)wI2Q-Ws$gIzCVS`i|L0#-n{*S+SkmQMsxwr`iUldJC6YxP`5rd<9B&Y%U$~ z#YhL@x?Zp=m(K3A^nE_PQkdTd#yvBa>u)NL3mV=x7KLO~jc9k3_ZG}mH} zm5YMrj>p$2j)LHS9di#`8jf;$Pt7IXQ|@r~3|+Uhols_JDW3l>;tozq89C+pu&-gY zZwlZ1Su)IaIaikyS(F*5J3oBfDkrwZHCtigS?)5j+o~{sA|o~&JboO=HvdN;ENkyZ zrQzQ}@bC1U@=Dfloff|bZK<)?h$<$h(l@=H+%T_@~CYsT}qJliVs=jhd%-6hm)P)S9Oh1_47FFXEL z($rz@$BA2+8OC{$%Z`gho*_Bp@D*Q#ziUOLHZYaZWPi@;nthy@e`l{$T-S+}&Mh4% z1K{W}ilEyhCs7-fiq5iev(Wjmy&tn0|9RDScwd<5^k|2zn~T6^?9FT{09DCG&<<2K zd2nRGzmTs+M5z2wtow70zlsm8>JpT-d+FCBHZbv9t)?E#ShiSrJxT}{av63b$jtlV zC6Ki)&RYV$dDi7;bwJS+Ez!dp&B@dOOGM{ok+8sdMMnbXV6@ zRaZUTbFZtSgaiNr002OkF#xc@S19Ce03?_LVG;*sW`G$cVDA6g4^?SNFh2}@1ONXC zQc_7#6#zkX2LP~{0st0kJ>ojAlB#Oo0T4g60RRko0Dx-83QtvB?x(600DxEvmWc-d zK>JSiqoOIQvT^_bkknvV>R{4en;@ArvM~Sx0IYrh0E`WInj6*Y0eB-9CvpIQ`zN^1 ze|@Qu(E-b*Kr`_7U$4OOz}iDN!n9@am>D<%!MbdL`(Xc%yZ{_#*6v`vgnt77V^aW# zQEZI%^Luk+8#e#|X&9_qBLJWlc9+uwZEj*<43<*{9>@J3y-&@kn1h*M-WK?t0!-8} zAm}=C8z=BsNH4H%VBIm!1kKaBtnG}z{kXw=_;oNn?QyHr+8DTje+MKqcpUkE1X~Do zV{2ez0)RlK1KSi50DvuCO-KC(v~zRdjJ8{5tsuQUrNOM?>a&Ddh@RNfefPrO$fe40Qdc0b6YXe zH`dq3eXAMi?rz(+o4bTx0Kn$KbLf}D0z776T>k3?mJRI*DFODs7Xa>mGl5<8-*gZx z04M;&e=-baOtZSX|8;lI4Pf_lcWpyh&>d`Qy&Q(k-mOWr*rZ&y z{Ux)Gqp{B-9sgN7_bm16)nP?ZDp-&9^c|&s!}v&Bhe{O7k+86mV~=M9^HY4GP2A(1 zNt0|fG#{aRm(j=KR3G*}R>^?VXrws3zhrNcB zDVcDhPWlnKxo3W>(3V-7QQqh0mvzRO-67GcyB1~oTXB`$<|$p4=Jp%697p*!&GaxK z=ERi?N&Hd4>|N60%c!4iP-8?1?Q2@~YoFr();0&)eTNQ7oJk=Ek+Z4;7Ezg2bZq*oIR8o+CUF(5jw!GQDewodzqF$U>~WpRS)o9yz+*Iu)GlKlTlnXpo18wG zwZ5kpIWH+}qJ8n$U6H%;*mE*@qPl44wLWoM@aI}!U&2Xnh)+-KkS1%jFNeP^b$(8E z8{vsXc%Z}7tKl2yPun!FvL2Ujb}EEd)6ZQA??pG>t2{Zk(AcJe$U;#UA-nh&>u0wq z3sT9=RR5#Xxp2|wz-|G^W(#dgYwg5vjmS)|U%txior+Cvvm&U4HAkFY(l$7>BcwA2|vOsd|tUsCNETCX!$%WIX|H*>?4?57*A0+H-0$R zK(Q^2_(zxUe!cuPTb~v_p-aV~!*!u2v}=Kn_G^pJ#ixYIu*s6g;+3g?Cwj7hpXO)w zdKqYU=%dFv8r0b?3M75m$1J1#?TpjPb75V_-<~nwtlo;bK*nvWkqU_2*&HVfwTEnN z3r#+QW8qIi7K=U?mAE9kp7iR&wtAF(-4~S2-6W5WgXKP5eq%lau3d$o;5yp)d@In1 zhuIF}2g)+Wx=1Uf&-#ip>K_}I!Neu;$+aQAxnCK0OO*#9M_Tnv9^3>*W|wh>pM`n3 z7`*d~6nnM5=KRl+qug_v4g*0s`q346g~U3`I%RE^`CU4Ma_TEQ%qY_c3m(#oIN{uB z9TuC+IMWnQ73j!IMyyl{9NA6z3pzCW8LZW_5F)UWd`OcN*X{Y5(2RAzQ} z_+~_4^cXxi&T=xuYghMYY!LSOr(?!Ckq4^eg&+%ABrNZw9j4BT`-A;O>{J)?RpOZy z^Ar31q^jcOl!w6Q4U;b<#`^Sr3%kgfh1Kaigfka>SM?zrQBEwED1- z&|z^W*_uY28~%@`kg3kepEOuN;zAJibIw6L+u#?sWO9AoR_Kvg)(67iWdEv#9ilnP z5d?}pGd>bN3>=h`wJ$fTuU{)j?H3O6wrXhN@2Hr63vqw799vMo?l&$5-w0Kbr37wW zCn1SnAl>V|5$Q@c)9(Lr`?;(XD#T@*6Ht?gJ6>D@=XpC&!%@>WKgha7^yTrJr0;gr z87nXIE0XUQ&Lkph?{N}Fw^4GcWkf}?o`UFIgYH!|BAg@71fVXEJu637AGbb7 zK_jb;%0JeG%pNx|N1;aRW=Y>3b*?;50_V)=c%a5>n6GlpKRM51yU}_Ho*-JHLB0vQ zx~7+pw;+0>SUVY*=Y}aAXtUxk{Gobfe+Ga;po$xL7nTfn0m7Z;9%A<*K}G>GJs1W7 zIEKtu*A-s%oE$DZ58uBJzQeveM-&6U3$T2HE+Y<}NFIJc4*_wO%G+k%&QG2<%+O!3^YS zyhC{*0K1sapmp?dcp)zUs-|d8$JO;ibBZe8b`>vT!|l>Z)gI&=BxaQ(JD*dFKtHN4 z8~&c+dqp%a@CRNfFM1Jp@5+8C-;D9NIZ~{yIDa!)k+XHaDX}lzg1BI6+;n%kg8g_x zHxbYFMq}n&Hc%|rz7QMw4I8;$TMtdHkH{&#u{zWF*c{ZGxbH*VDj9cYq$R$%D@*-Oistt z?kw{1pT*{Yu3F6_FjNqGqW{GrYPMO-8?Bvr@TjX(+T{(Jy_e^Qhr9|<^hW0fXb>)E zORa_ly|q6eY5Z*x@`vtV@faYDylvEKvm`lIP4%KCjG?HN8N@k7sL;J_r9_f&MbGtaS%u3&SOPR@P`(w`TNM?Ks z%X>{XIg378-jUABwA?m4_Cwr=2?92+=%KdM80AMXd}<@d*)Kk{uK9s~bXj>d6;l%y zbLwNS=C)Qx{XfH@|0&8RPHTGT3(E6!Hwk-8;pKttlI#&4v&Nrb)26~m6TjlR|0`4H zaiw{C@n|s53>F2Mt@~}>>qUT8%EYwz)KoFPDJg-DffC0qQ3!e3RBD8kFwS6WLCS_`a}Wj2kHWX>einMfb>^ z)K}`!ylx*!w|k)_a`L(|zCjXUzeOCu`ug0SIlfuwu_p2`sIg0_%E=0$`s6|TY1MT` zwh?85nIg%1>!rii*b4uq{RT)R;a}Dqtf@t4-~OB@B4&FEBBVZLshiOqocSa2#D64Ky+?`?Fn*+&O8*Smridk5gj<-T|gz|5=6tYwq z`*&f4o4V=xKjCL|;$Xt(JCfKG_{8&v$j8G0b!BwPW}0Lp;(mpGRx}^#3}IvGlmXy3 zLH}#a%}r{2$V*%QAJfUVy4lv!e+UZZ11UdsrELklOYXl!tsN3@=0p=r?&`bidYxYR z0O|33K@LU|IbV~OL^ZS|LG5)LhGW}~8&zmK1Nw}ljP`Pyg<4WpE|=Rg8I0Jj2EG+cJM=BL`N=wbW6NNNVk%K~Mq3 zT0+VT44)K+hogJZClnB!15XgIxq}M}K zA8usZXx>mS*34d`v0?lUOoiRwmNcXPL=J28qw)ROvCSWt=Eb$xx9C^sm9nPMfswJd zHq;z$A1v*5kOthB2hS~R!87kA^u13IWc|{o!v?A6#{+{fiHFt^@wxcomj`4MuO7a#I2@SFiT zkvfPgd7xB(pp-mm>lQ|r!pFFCKA!+x0X{hSpHANyLH9mc67VT7R^uX|-~Pbe^_o^K z{-xNQ?~5{~ILDM;lRxHov&7*S|I=-RsM0`SqQRdJn2#_#cl9%D?NVG((`@M~(xMAW z8JF23&MKaGpvx768I@X_eyHP9+5XiKZAQzK z%Tr>=j-zt_oI=m4#bj8K$@NfSf7pW3)sW^imRG`9c6J!qEzDS9kVzlDo=F+Ce`8jC z{1AO_gfP>gzw*q5WecP$^28#GaRFoAZ;W8q^r&S-gUxL;e}5VAYDz!v^6Jb}iKYr( zr==}VXsD+6{tJJIXN-?-jShS^Ob00o*|Hxbd?^f3hU_~FCk8q{CMZSZT+m&qI=X)# z)FWV|>5nK-(ljMh_fkjepHSCJQ@@Y$W5bjXK-934Fd%z}nqq$k=%Gsu^eiWt$rb={ zkC9HE(9 zS_@c=Jt3%XG=Y8oq{ov4fgsv7R|;Xp0P2o{zr#WUYH4(mX7S1D!?6&S%L>+nVV+yM zS#A(llBO;ROrH_LhE%Z7)qfejd;r<7H5m4cjk8~*dIJ+gar=o3`;GP}B7XG#03DBn zQk2j(Jz%Z`&q8LBL0A-dhH&oAnQgJ_si&QZ8)TGh4EWZ+HpSEvIgP^W@T8D|KNVN-DEC569I7s%=Rj4kUf9C=8c`@KA13^eUz(5>XNDI< zDtKx1CVDAULYNbL$&0JHLma-ili}b|fEV@SZ=14&+7`K@b^lj5L~yq5;sN}W zM#c!VE9v0ADY+}@1zqY?9JgQ|`cpoqvY_0E<$UuW`~Bty#5z6vw>+%4s+w=2tlT66 zVGO(OXpdKtP$oX~!Ni;sedLDtLe_nASUL2!6=MZ#qtLz%#-gn{HZ7_krT5`3!%|K@ zX?8g*u}7GXmPop1`NGMD4Z7{KDf@>A;rLqXCd`YIsYOOZJR#>8J3E1{&Vk&$0AZF0 zYJ^vS?^HbAZx+mp_TJp7?bs=evWW|alE3}a1i@H0kw5+@Z3#7C%c!|27GGY|b{H7s zA%$f=dHXM@JdQ9MpXVNR{^@16FOeU86b8QslNm$=Exm~ zL-oQyQ%2%Xu@wh0=Gt#T(0+@GT;Q(kO${Ei-8k^>m{1B_Wc032M?j zo`A0Vwf3#%3zY3sZh$AQ`4c|IAMN>!bP3|DTM_}rNLH?W;8Lhh#&)DRRrvbCE6rg8 zO$?T>ayac3$~r)TgC^XBfLq$@WGh_P&$b(@Z;d{Uym*^xM@Ejw0%Z(qSlKO|D!_n( z^9pf?u?QtSAz3FNrH>X?57yBneV}yML=|`3yy&+!n=F%ly8vpq;ZCWUymZ;xmC+qZ zn|@ph=o4t>gSpQ?-IXL06XK5kBdP$7b!NvwSG6%ZoGOr(O&126p>w!P00t4%EnC3b zVpw`_EK4ArQMTx}INhnT@%2USRK8+>-oS&Ul;+N8beWehlw|tks_xcpw7GJ4;`$sh z9p<-3@BoW?{U~w|Z15hg)bH8wv;Oe(0~ig(y8vsx^XIZ)>s z6(fbEy~;HhE@++-4J>=ObC@E5+&AnWMWPu+_|!4@R}upR&c-Xr29~{W02-PnF{_AI zhMwH7GMswWNfL%sMk=V``mlN-v=LQBj4;;*@>SND(w`B$#*joAcIKx_b@l1q5}`W` za@OJevO9mLe__GUZ$}$~^fD5PtdRu7fXm=t#2()bq1<@~Zjy;ADH3zK}Tw@58z9&g+y#qB${9 z^Y~E>zj%F~&OcA!I~O4g0!q2*N*hhJq-SMeLv!IEA}wy@T(4S|OBKv6vF z`xz4jQ_}>AP*3pdFe=7ZOfr7W$1%SY23ZCa$8kR5K5VaOZ=vciAir<7;U}Oh=IOUa zSxK`W5-?~(WfA4sYty}G2W|PooqP>;!j~TKN&C`|$^Rs(^%`Odh-T;^`||xvcP9+P z-yPfLh|wwJdiYjQHUqxp*!C@>*H@5*d&%xto(iRy(;`H` z>xS-nC8--4Dni$u?ifRo52Ki)hzZo9C4&$6*o(t06PtgkmtkYt*>6#C&oM7XwxMO| z;!lbbuHI52AYpJpEgr}xM_$j}P15Y}U&h2~m4kGR#aeNAofd#QASE5}0e5hxgUg;?~rGvNTTh)Z0BXin0 z2(XLqTr>CoeaD1X>Xem@XeQaato(Bgv${R zk~#;-N;ao)9*bjMhsEST!QMd=ZhFOJ)5~f%La@L2|Mx5Piz-ujgj)azSv^DvFP8oDwbb`z8gj3!r2|!0^z%2Azp*vKa zbKER4&=5An_}dSf@WLrJGj6b#8PxKuwsn+<#tJN+cl17gSM{sBqL3*alVx-N96qPyDW_;#R)_mSy7`ZAn&Q>x zchf|~Uc*gbp2$JzAP{TdikO^8@yP{PNre+=%INfq?`1`(@Gpc|66HC4C&C&2LRafY zBOuMrL|~I(1pLP_K!<&VrYk8ZFSISS!rx)!0yYwm9wB}M zsc;{psVm(i&EneWw%ib>6}HL66>enrZN|5D(ITY3CD8}E?Q%bQ%`BiGWs+kPv4g9e zXXkc=T0#=v5{<&}ZF%NPQ9T6M_8G;5Mx_Q7MN_a7G3JyOG-(h!eF#v3*jjKjc-XB> zqAXiZ+y;+9t7UltR@G+WqL$>wDZkW`|H#I_VGk^5{$`Iy{#M-lH_6ib!rE?=s*PHO zWQKh3Z=}{Aw|t7*c~c7+c{(?8LTG-I0b#1fia7hcoLiC^F=L`-P5f)Rg<3ikWii~l zmJy)9VIz&aym2IfH(y9m_E>h^ecnEWD@4O zsTpACv>{W$Y0$-@)}J*lHQmI}8qPN6-Cer<-`u=S`rcC7pi(aNGORQW3m((1kHt(; z4;H?i+~09@>g}#>GPjZBTg?QSY}zfsVV*TS{Vaw~by!b+p8pD9N!YFI^&VlpiJzp;ojMir4P5-?s~ncg-HNu zjZ+%m`DOpc9x=7XkvSzcJ8s3j<)zJ0jhu?uobmhOPrcjzZh;pA=Tpi)=g%}O-zyIt z11AUyMD}jo@+*(5#(Hp zt*ywV_FR&Fx;8<^bJWSyp@cz72x@rMO;zC<>UTS^_JoCpj#Z;kA!gAPZBy1%ryV{| zvJ)0a9v7eIAWmVY@2%J&bPF$zQOG{}GF93HDt)nREdT&Hs9u)Rj8^ z2Sk6`NMsEHLWVPupvdNsJqCYV){0SMxppult+!U!5uo55-8v_3`p>Mi;f5&8-c}_D zkAybAD&S9}^A1KW;A{Jfpv=NkbO}Nq9}pP9D@VQp@x-R~l5Gi5^!#JdqsYZ|u#or8 z6MD=z7{A<0RdUO5yJQO|7(a&uSJD+&aDaCZrHc-IHeyxnu>OJYQs_`FrI5KzJwk`U z^zy%wl#@P7Uo99_tV5p*=hAaoOhG6ZPJ zVpt5dikl7x=c9Q0ylQXCDCOl_%~ego2rgUxB`6!?9VRU#vTenj#R`T~I@YgM>f)^y zWmL*VTxu|l`XbXv}lW`OSQVC7}wpgfoO6u9-^CIbNv_Y-)XAAN)pYuneldz~T16{tQ+16<@O}h+Hb3`b3-|-X312I87 zLYK)ejBz@isqfj91oWNbxHkxRhsub}?J1Ij4yP+^oTfBdo`tv-ENp*x{!85=g2x?n zltA>Ok~mkZ=nKxV7_L5i4Va6=IQ*z&(c#{^Z^Vjyk}?3e^+)<(Rj7N@b6}v5L zIy!h<+MNs@B2cr?Se&TnRSnKxr;y2Q!XS0xx%05hVO!+eAWLO1mUat76?FGzzY>_q zNV^&{=BF6WI!8qZXX;AqShk#b{z%oX5X-0#A&s zu+(Jo4nYYPmzFqTcrdYS6Np!?#uTphU?8rTXJrHkK?V)K5@-L!$MxW=`R88!LP-We zD@SRymDm%P&&oRopu2!ORdQp3n1ZNqf-pc7Xf1JYgYn*FW(PoYFzwWbxy7CwOv8$p zwiL4dT+dGWZ|(1e)}?PGW9+Ag+FPWQj70uRvoV&iZ#`O_U2QIALjnhZ;&1>d`+q@j z3=RVNi3!F`Yf~DkEX6yxT@V15=+<+8I%gtUXx3x4w~EM^+vNM?@I zoiA#s_D5DH9Vr_J{& z@P)soq-S8UoA`>dsC0uGHSr^CU2I;EgdJG}%3FzqDe?!Ahj;KVjd~S$#WIQyEOZ1MF=I`i5-O8mn1klj|{& zic0?2IG3vq`C)gz61k6%z9a{sm8q7uMP(LLX@#gZ_?zLb zDN{+B^~olvS2wUB| zZ2NYKvGN#Iy_Raf2J#!m6wDxmgR%nranl&lmZDCS4&1R!s4#+M{y#!P#1Cvs|5i&s z6s{4JMM-~|lp)Cu*f-Gxgtud(&dq&MaL(B_-hRU0t|hza3C#RNK|8S# ze68>BzAp`SulNSAS>^(2>Qv6q_{oV|XkOSy{oRu%5l>Kq7SO&SUijq?@M~q}h3lXi z1bQWT-Rjjkadn(_%hNuHC)IN{nqBA`BcGqHTp=*qyob(QlL5kMC?{*Cs=$20Ubb~; zm{!XK4%q_c6>1zKpJKRstF+-ZD>9+n4usfbzQ2tZ@KWH~z zJ9ITqEK)2p%Oj5^nvZBku0}Gf&F@dv^H!X{uRlhzx$Po+V*HuY&tHwN9`*9*OjEaqZV#- z$2amPOMMRo_Hs$~Gk@WFo=j@?tJ0R9Ty|*}R9{PN;ZK_-plp4`L*)0AsO9*Iw0MN( z1to(0;^Pbui>E%GL!f=o-^KZ@I;5v72OnD41*x-m~R~3On`VC#0~jHsQICZ-JYAIxo$b&@pzg@Z zhqDe2Nq;Vzp6ADs!T;fZBgdLI+y6@m8l)r3QbO(EEn@kl)o)C!3xfPdug*tW&&N(? zV;zr7W_&K(7_G%sm}+j(AS{7(Bx2Kvq_Db_1~XlM;>cBR+LBEMd>KQ?ConnD;ge1KA{rMny= z7%OaiT~xCD?KV_f5*o&O(c#(dNd#E4wRdA&t6QZ7}LUfL5Z5H{AhnY15GS#g2$kE z9IQ#&nFfN2rInovSEFK64Ss8TdlNYRQtF&rsGWE(7P=saqp1`UVu4yMO6y32C(rQ> z5`M4cX?M?kpn|qdr6GFR4d7JXn>%+Q==JEH1s$&%9?dq95O!nd{XKcS|A23NHEQky z$Is}gtsi#ZlAIes_85MO3E*MJ^6kah@2lA6Sl`nFs1c^%uF@7)JZG&Oy-&*60p7b$RV z_MBPSsqa&_);-T=o7+SeNX$%gn~cKe|93PHsy;;yTbo;tjm<7k0*ebk>n__|=oF3+ z4JE7j)vs^e%oDar>AHzFYm6oMBx!f3Qw@CAo%>@YyW;t=rYP_I7dEbOJW2Gh&F0Es zp}8I5Fovze3Rsw)QEr0FwN+A1M1DQj$W=Y~@!TrxbiO+!=O!>ZGej#$IE3)k*G~Y| z$ZDX7^n9DEvUPFPxeS`#`BpdPq3j+>kU*L_1iSx6&ofVL#cBOiHALDt)G3eF==-S$ zbRJvSXIhFqkJG5`X}PBmaY>)x-RrRlu}9#_DFlTO{u2M`-}AQu8w=?g$z372wo2H^7Gr)yt?nVXub5IwwfAPPKk! zIeKVVtH#=g180#V`!yyRG0*nC|4LvWA72A=1`ox2m!N1u4zGc8eaKJ>oOj2S7Gp0y zCnpx^M+Bu0cS)klrQ2bt1_jNVF|#eXQ;W841P`wkj~$Zgfbdj%;m?oP3lqXF3L3&w z3tlHq523N6Hk-CZ7g9aFP}NPLn7*hpOjvK99E@~y*n_jY=~4TmE151LR3u=T*x>B= zuHdoB*h8O>kem@uNoJkz$+iH{E$ZlY^G2|RQ<%WlN8sbZMF*7s78q(L93vbvWU%t6 z6Zf#mv7PSwvFiJNJ2dy%4Gyl&IGA@5BQR+BDbyX=etgz(7W!Wu^Cg1w>hp%scxb-X zeQy7jO$7c!{otBsNs(9U^m=T06c`{S%p{Q=1T^t|wiHJmbP0pKz=0LlaB+!tpTSL9 zX}m`Q(O5QJEQAXyB4Gw*dedITUA&Aq;eVR@>A2Pn6>swPP;m?1 zdh-*R8Q=9c6ZrL#fB262@b$(k4xWY7ln(9N^F){K+vL#5^NZ;puJ499q}qfoU2ttT zJVz3Yxfj3CsR^3@&@5F#ehsahv>)be z^YiueSi5~`D#^FTjUI7{ej#ME$=^Azhcy}8kdVv`(~o3|?F5jQp?!BY{Mjy&$Vk=8 z^A?|}UBn>f+sD4Iljo3|%a=pzyQqDT^)FSMlYWbbb-wAPBnbfgyVK@%-ZRo6$+SeQ z`Q{-DKek;AZ{}}UGJvNJJ>-wUgilLz>dlyR&#l1`7#xbAw=x&*C#wzAzLLHS5 z<%sy0@*)pmI5i?rfPu8$jQ^OAV?3^fJ4#Y+r z;Q0N(SDb2Dhm8^E&R{~Plt-Q?l^!o`YK#s|5X6zJ5kgtap-4z9GM9&d4ofiz*Ta_O zDGeV7kJeAi`}oqFiNE1}^F^=g^PuGM&)-GOL&zxr@eF)~F9pxDf?9{GQZU(OV2Y}j zFMcFO=wg~~FJ+^Y%}@4n)~dY#?If)j7tAb61!meli{n4Qh%7FJaz{1w*=LV5mbt=v z>rUy^BM$E$xpQWB8s6f1vpjb??;^t72qhKL-1l-7*K)(gncQE7AOMEeI^qE!1Zfi}WnDGYBpP6ln+}2mW1# zG!mW}R83L`H|CgCEt2rsE8x(MAn-9~nM}wmv`x^@%BU~C-vhtNOim4WRBjZao$kJ1 zTXl|U)|`fcYRJ;v7BY-gN;dzif`@zJMf>Vj3L#l(DjYWdb9EKY95Z)BcjY28Pdle|qbG~H`q~;|i zMnr{P4U7#8?g`L$VdG3AltYw&4er?@7am4xldPxGh>wz@OCYttwx^`Z&O&EaiJSWfuLbY;kzLKwmv!Rwhi(iI`V*k8(!ZP zX-FYD6>09vj|mcuArJHmtb1k7;ta=<#_M5ruk-&T&8rl-jKazdN^)Sp zU4Ki_|0)!BU-8#ENi8iPc!s3#3L(WPv!W`YxT+y>Vn&=_N-`@2^X<=yR8CZC&W!BC zD8zAy`;2s(3>s4(A=7{+w!ycEI*8L+7%lhE%sM2RrEppXMU-x*dG-BDpR^jppT6^% z>pQaQo*Uz$tWLkw1gV(5BWv8fg|~!~r5-BZ4IVmunS{?}sX+Rq37#{XDAv;W$@(JL z+MOk-*H9*O=j;&KTGJWSS6V|TH53nhkpH!G!Jx_#Kl_IzJKhXMLeE$XKeLqV0s9?C zeSkZ0X9706V&3BKIb#nJdXt>*sqvL#vTk4g6lJRk$sU&Bbpf+kv2^|sEHKnTT2tNikExg zXzg7K0-44$Wtf%OvGEjB?Xfs=z6iN@uVwlCAmzNxLO$h2XyPfU5Z9a))Jhy%3o#{= z|8{`t1eNe_OqXaP@H)-$C@%OfQlicFkKQC-ye=`189rQt&GE01cO_;R6A3`rF~eS; zVf2?W@j)nClE@B4Ph4AqwYcDRXr58Z#3M+R4ZMfN{pa@8^uy`LVX=c^KU&;vZ8v*d zTk?({k-%Ra89`8{DA!Qzf`TWZ-Lhoum~Ks9 zvc!4uEIMMpPSjc#ax&Kkf-K{+MP3jh&k9&Ip5#P!RU*$|IT$e>)P&%?F5)Lm5<0hP z=;^yQ-$lNf#s?}XTK)v^-Jy{wCQtq^-|EEGDfF?ShfMNf-@r=YCNMK1Co{T~AS+NO z(V)X_LW*0`%(#mD>)r7;baq#Viudi@me{y2x;%7At!@(Fqxq;Aqfcspm^ zBj42JK?s^{JNXvQ9EmhExB{fju9n8VcdRWdjEQY8vwFV<75+(MM0>!vZ`_4NC4f}RIQ*8Bhq@7z3hOnbxrjSEI{cDrIL=7^fU6q1# ztIq?E>;dCMho+;WcaanLsU|;m(qyi${biJ0M$-s`oMPRr$}F&-{Xde#ll!M83VR5- z2o`?#@lD^Zw_3F+*{cL*`bxc9iT}?At3BO$_{kj>V@J@_hg4LCGNY!@Gdlv_H#8VuIaqENTqnmUJ+TZ_+(0*K8;0 zcrNjJ9;yn4Ft~A5yUhRma!f;9H%CBUs+b3{>7``)%@xAWADY6W#Uf3VGKVH zn;%>;blqXIZ{a{VZkZ35wbW+2iI!o&^`?-Hw$Xz{V|fj)9qo{rphPZ4TXF{Kc6 z5UR08Xe|}e6s>nf1%uSLNhSr|1D`^;*_rAn>$c^$#&38&r7fj7XqjnjKx)@1cU4Lb zUJec%eCf$&{NdlEc}E23d0VBzsEKLO5uADfJtAxv#6jZU<7)3+dR7%7kkL{4p`iUB z+59l`!0*mcia^ohjL?U`I~`zKF(6cxrn6%R<(Ji z`SeafGKmZBvMl(DP1Yot;lVYULU14Gd263z9uJH zLZ_NgKK#>U#R8fzcrY({>Yuq<1HUGf4PzyLrBEe(C08Y*75Qi!^Mt=c3ts@SatyU( zeBr<2k?DgxKHRnwr=H`PS)9`QC|=kcQR6vw7yQ@O_*VPYCv8I(uGHkwk^RG8hp_2} zU&gErTsSaFa`+}1I6LKp9TQtqX-8D|%5OYw8r;ouXeN^njSPMxFfl}qS{ggoJ=|d3 zj@}U6Xx(r<8$GYW#KUwz+C!*pF}taRF;nBFU`HUfBb^722CpjdLVuS#LjH-0K*0_z z#;inJG{EA<{CEFrq;`q@b>#s$jjqn>$3_h;!MxDcy!uf#D0TYNWX0;vggG&lIR$34X(DkV@G$vsb%JO# zHfbn{M^_3o1r+t^nTXw!ytVfd%pE0t)K{qb+Sg0~JhuZ7bMS=_RDDreFTNhV3&Ht~z1EF2}*D34;r z`gdZil3ozL*6@z=S;@sm7rM9a5Ko*^xfe#9yt*&+T;la3$B-}hOA^| zHJ4MUTj^WONz8UkDaxvZI&(A8r`F8!RO{pT6VI+r4vXHR=Ay!)uw@j#OtdO(MYyHX zxYFNwZRg-NP3B)b70H%?9<2g@GB;6NV>ib^TCR(ms>@WD(I+@}y`2?iZ62>4jh(P4 zVyacwYmA+x9fzk@C#R=}kE{ZsRQS-5{S?KCYiCBblEaDLdu?G=A`K3Rk1%%^8L|BW;+r{{-@Ui})Ka}_C`S7@^nYG|Z);8Iy z=b{JfdJ!s!T%MCT~-G&MHg6X!awQ=Q7(K}@Ue2;qwJPyr{4~Rb}EA(k7bZP*63%r>^{28`TfI=6=FwNb7 zHJ=w)_CY{pDREv#r1Sm#h`%lRA|I|0qj0*gMfr`+AW2Y$1Scv&f~HWyD8RnE>2hh%UwTF!q{oYFXLv2LofKKLV3}YeM|NtNGy_z-v3Uow z_&I|WG)lBpLFJ9*Bv#>#W11#ae?6*vPD`Ba_`UcoU!I(Hoo=0moHp+U@2Z(6LYgsb zeiHTlGGzR#wtQj@#T__q?6@SzX~B6%@PKS*YGP_+x=3m|v||5&@_NB!mBP8ozRL5e z?_#~ceQIAzA}Cp0xIp1dM{-~pF2W4sX>hxv9w9YpoY(H(~t!LE8A z=4Z8C*tNXOW7Bro_5BN(<{mKQ{E&ENer<+8Tb(^8xU*(L#~ntRgBc8P6Kx~cGuOEC z5M^Cwyw@Z(Bux>T6I|0XW@+=O`CNZ%ccixn?=aSJU~x}v`+KbTDzh75IPj`|qu1!0|H0;4)U_&%p9i-Dp_|8{L=*=b z=f}c^iI4UhYQm4FmRJxo3V{^u3#^)`&J^xl&0rPgFTTox`5d*O6A3!OBzy*x9tx8( z<~f3yAlT26_j5fg;TTUj4<>IW-?bZGbOtjp?g8)X8@v(pi3gHh)E|ixBnn$EUqM_{ zus=7!s-e}x$B$pwvY zupeMZKyLn)!1N3f1=7%{BeW{0G$?!Z>oPmA(7tjZHz9xq}p9mIhOH+Kzh-uf=2J!)SYGAIh14qxO5D^it|di zLb6@khY>CqoWo*r{eC!AIwcPDm8*mX`QA`SBosA^KQ)!@@Tq814B&{+vs6iowT?Bu z;VyElN&NC4!3*i&8Dcv^I}61p+BFoS>u5&()E@d8@yNN2s45QQ?PnaF^9|B|2JyQ{#v>*4WFq=Zrwp;p%aN7p+C zS@tdK+N*4I+32#X%eGxz?y_y$wrzIVwr$(CUAOk{+;i?e`-?9kW6tNz@!yIVbLPyE znM+oJMOxyIOc+13_6$UY!d;N~UgV(oUcd61h=(U~Lg=hN>#CK2wu|1j*7H_3vOm86 z7aY$GsQ*brEduvc1JEt4e-nWimg+iXwXBnsyA|* z5>%xagVAG@X|++o$B<;tr%X{2fM|AY=-(r^X(H9+RI?(*hz$+wXa8ccs>77F&(G(G z%(pU2b&RC5Us249*SOs;zgw31gkbTp_=#1!0eWG@{}?Bfc)0 zUsQ@7uPt?A{EiQsWrQfofhm9!tCU~>P>Hea$_v(YPS9QzOa-yyDHb`?-?2(%=mm>T z$FGa-ZYhPUk&+vbi;@E?nCfo_7_}uQ%Uy>$;2{S{9Ey{V3cKK~SAlI!f&1rzY1M;i z6$g$8V)`+_81g2J<*Wk^;K`o^UKkR{a>&tlggrzn-LN9T?KI`!AH#Ql&lFl@Y>eQ){%{PqdB+0xNkf>fgaBb_@H+Sw(^^=?xn_LDW z)KP3<-Z2^11kd|&+wS>`WzJwv90@-e=W!X+^*0D#)i`Kb2(o)l!C~dRbq|ytNgm|| zGGq>odygA+oYW`_0zp;87IDUl`7#z5(SX(QJKQiZg0wD}0XKbo@AT`uu>A-i{~+T3 z!#N))F9Z!P$Ux10|94#gRIkr7sKz!O01^a{2LhM@s^9=1;sQe80YVV}4SobDf$ZqdMNIJ}+i&SAB4%MYEzVtB;! ztb3>&YbuQ1r{!8)(uZGBEZXP$$uX_R82IM`0fRfTaEq*HL$AeeeO#Ou9DAsZx+qh#;rT)ry!wR2<{{EJC3j(6G^Hh zZi1;)(GV_HMpXSW>Jir-&s2h%8|z-GWCC>7Q4F1=9^hlb?*zY*D%0>w<)O6ny0~D; zwmHJ1u|}noclCw}B<6HfqzbNv1yu2q#_i?Hi?enu8LpKYmkUX!G2-P(Ne3C4pevc^ zFxu%Zp5|HBoXXjq3KWyF-~^zEWvvymngq&f5|LCU&KTRe%tORwq`rB*6{G& zIusOr3nWR-%#+-|+A?_4wq*4}5ai|UVV~ohV&t+SucM9 zF@FF51`W*jZ4#h9aG*XChyY4(?_6L$un(mkA7x*F-2c~l;9S>}Nou7^i}UeJ?21?8 z9ol|dMGj`#IX>lOqHB8G2sh`9%z$*r7+?9${CI9Z<$m(~ynEVs>OS&S=7ajKRg8%c zXDA!cO9h6l)N!d1yT<|^tp~qOS>(FgT%Mb=(5*RIWgNS%Vrkx5@+opUthV80{A_92 z^|I3-L?<8hYt#X6HQ9zfzV&K;2K}sEE(7_N$yhnz;KzADttLLS|AQ%RIZ(ZO3q(%_ zZERZABZ4hBN#4iymA){fasu+L4wrE}=EjosW8bqrF0Jq;R%fb^7&+-MQ!!H8^xniu zD*Di+3e_(v{9&tzI>PV*y$VvSAwRBnmL4nq!twwEdg}X$B%wV`QEX;I8br&P05VuW zWRX7cBHiLd+XX*tW+B=Bwf21_X1n=YgC=6Tt8-JBDtPVRn*75IX|8| zZ&Kz+?0>#e{epc{(@vFT_Rta>2694}$apDsaDMroz`b&Ek)A6?rZPp+E(^?2nvE;gEL|R8C*q6>59x?=otaZn3@H zM0>X*cy4H}ehtt?bzgCJcg^{j(;>P(ymzsDtzTn*q!03P&8&qyp82%3F6{$jcGzWu z>zH@zFz3x>O{PlOvd>;DBVOVyxb7+|jB`c6lS_Cv7>zSRe0CVx&tOXzdREeayII!3hs>+<|XhOfZc0u@K_JUDr>>qPj-0#PRQvtKU&e1F5(5 zVS%3>1X^X|!-g=~16bnZL=u^l`LDI+WM9KRyiiKeXSrTzXN^HgNU0q$+48Z(1|75L zmklhTu@F8Ds^-vL+}BI@hpF2cX;10BDei#G5W+02tSKvU_F7c^IoYbtr@^c-DzblR zp|v)9yq!5YOJ>-ay_%aLf;bfIW3LL!zM`h`7WjG(I{29-i$8eQr82^`=PQ1p&-kVA z`lGe8XY?@=Zrj~X3d!Z3bvqWhKtd%|QrQFBe83aiMi|6fn`*s@{JLm(n=XM>cw73% zu@dMeitj(@qVV4sdp#J<3uTS9ZDs4rYP&6s;W6g1=MNa$A%B&#cW9XAxs-)n=AO~xv05GuZQrdl$3Kqw@0Iej(kbgFM5`Np(LHjU4|PMpa~yK_3geHTKjP!HA>dGc zLAhM|n{y?Tu)ub=^J77S-X8bNLVT1I-#hZQ+6@(peEq;1XOPF(D%ROJ0nWInsHI3$ z$^4=5V@I?pYMfc|$`mw)8QM*jXfXw#6A7pm0jLrI%6|YBApz!~KFmlRWZNK8;>u-Q zKD42^v+uzLYZbYNG0a=L*bWcA0u>$jZP^wYv^ zd@ATnim|yxKPB}gLg8zsEqIH*usa`z|AS zwB3UR!$7;fp!Q<3;|XtT+Vg!*^zmb^r<|QR&50!A&-e5v_w>y4Cf8L~Qlk8s7^2K* zOAelv4}3I*zk%^}mYhGMwUVX&fS@%99lTh0D)^TlEq6dTZ8;yvO~tB{az;y$Im%@J zIcxYEP4jel`CuYdnB4@9fRD}7SlHtEC7sUNK@N7INqe z?q6%}SuS2gW*2=Ca~7*Nqw0m3=OZ_BB$|douMF-vmc?>?e7RuO0&deTdCFKU0bEs? ziuTbUT`8AT1Q^emZIva(`$D^pK1d8hKt8Na0#F2lk32a2C_n_Wn;Zng5cFRO*cYSCqlKF9da-P?0;KeGMbO<-09z8V)Th}6BVoJ)m<&TOAaPH^DM6E z%MoVL`_##rZJogbF@(oAY0b*R!;7V8MmUUir` zQaQnB&Z?@MAT$*dSBsN{UT8T}o{gQF6`!%_xX74=*n|6%#wVFMXojv?x zj?Vcgv_p6lCSxyMO1xFO=O8GEHy_9Q%zp6iw{YL|@Wd`gP<(fj+uU8qe?$HbQe9M&7&6IK0PbXBu?@Q=*fZFx)h`jLK6>?Ne0>lDkqSQugjr~*<&*Mz|v)dgbZNd;m~{3lhz9u$b%<|R${E+-qkDegd7RA3)R>r4b=<0`Ha zF8dJ4G15T$&%;JNUL)1KzV2$1dEzr0Ep_)kVS0Kky+2h%VauRzM#ZXphBO$HA8fDj zi|B&M7~k>TE8^pA#BO~roFx&*Y#S{tt-A#6)|f3#lD*40)l_z;Q(qOYN{SuOr}OYS zNUxFabTBrzx-GPw%NHGvsd3nZNjJc67bV=ltRp>SCVhHBXD2{$k3(m_#A1YgrgmYO zZVQY~)CtzkZy(y6coAIr*Y*dc60bs5jUc(+vc!;aV2tDQCi94DNjPdTB32c?fU@s` zY`$#I@Wc@D07?<|L;lBPzdhf!Nh{azMyy@v=~#2VmZu-w+J+D*95~gnnDl8<-!))n zeiFSc%hdGnYB|#X{$Q`Z)xy2fe(~CJBZ!?*2^Ty#gz(6o=@~p~uU79y%c%DogUUpZ zjFplO6edT0LOpCLWeoN?{0FyHRHJ)xQu~Gc-RAYS-P`#rdey7wy#@K1d}5Z0+bYsP zYQ_ufTlaTHM3d^u_=?QK%&4(m69 z%N{oa+|YqFqaHVJ46br*V~b1D4EK1kXz85<7EZNmP*r=E>D5)Q9|5CXnU_e!C;DG@*G{>gc>oP4|W7 zTQ$xOcBV(yD6g6&R40GwGDSXTy=xH8Hy6}hI{b%Wu*-43pt)oiwe^%4?JHu%R3ckh z4RQ-IOo`DXlI&QB35Y<4A)$sLV>jF^s;T%egBTzV0110?G6H|K_nq$xg^(J$ahIyC zWO>auCWvaCFiq$sd6!{A6o`H z%JxUB;W((JD}EXnv#lrBiUT!8|RZJrq4Y{!(&>_O;IgE%}u~t z67ppml@s+{-fU2yK|6j*J`PkK)g70WmKV5dVU>mI)@v^sPUcNZYaPtto!Syxo~*C% zya<1D>@NcF*bmpW7@5rwxl|w|Ip7aJhe0^K8?ORApYV0xrlfilZ&5d8pu<}MnA$@r zSeb?$p;b^SOqrIuRMr!Fn!kfMV&=nDzBiZxL27*qQ)czt`CC={AG_UJZ1iZc$}RWb zb~n^(9*3AN8?rTw#yn$IKU>kJiNzdfY^{puqGwqpS@RBO8IOOKg7mt(4rApRZzQrWKrR9^ zD%&DzM(ZQqG4W$NeeQ2_$GIoTd!8^W2J^_j;-npBLyWQ9Bj2`9IxbNgO8U^t5EqY8 z5qVv)MLTaIvbc4@Opr_LnN;3e-uIlG*e+Jv0%z6f9*7hi{GP`mL#?pwO@mQXhtql~ zfWz)|et%YPiI#r9h~8s*$|TskU^u%b9SB2Y~!-+coRzr6qnpW2uT|g!h0OxbLxCKyUC<^g=J|ylKAq3(XkpIAre->mN$WYhCWmEcN6Il)8 z5(&p_vc#2j;!slzz)016{{s`BFiO@%K!(k3Ta{ZeiIy-TwH+f!81%*SX&6&Cvy!Cg za4s(CoP^wAUw?i_BS=`AOG@jUSSMpObmWs#H2BM1>!-98%^skAmOc|hfb=M=H8>bj9kBbFSw#?zP=!AK;01Ufa|bGPR$bLD@;Ml zG{)kfNoK^!r!a#MBahfYxOH=~VejL8y%?rtgL=vW{`E*}L9T-HRVHQ5@~40{v@ynX z>I3~V=CjC<(*SEi1M&~@7aP|mQu7Zu=Y70Cmp@rF^Y zWxzWeQ+n)cWgbXVxJNNTe5|(hu0bY)_&CVv!nsfO|FoOdhJPL7_hvt)Bl|~#YP+?X z%N|?lU!zMnV^42@J2U}pSn~Y`4q89OW}Z-{>|9hM!Zte4Kl87+%xoP*f*;P}-U%1i zc`7`1{|NAkIg9TcZ2YpbTGhF7aOvxFhf@07xh1v#s46mMvFy>G0C-!0mZzp5D4o!p znpG53t`5sp=D>L1xy_$SxKSI2*k)eU;J8IJT^&s8v)`-2b0-N#{|_P;PzYsfpAVG} zU^%$zV9wg%&lK|)9my$FZ#$``KiFQaVMozetked6WY(Jc=kZ|RU{az^#|!p(GWvil zNkmxciKYS>rM)yv&ndsJRy2GNyh&ZJMnsRlEI;LE6ZkbL$qA|Yn4s|mfFbGv38?~p z{5t~uO9e&%xYrY%fg^i0MMH$F0^ekAnBIPAw1Wn^J;(q}6!{n_@YPY|te{L=K%20D zF{J~iNq@Uj-g3A=55&nOTtp!5&B7uoxNfGTkh^0R6j{H_p1&xI&iror{L7_p#8 zEKX($ylc6WsrI2?8iP;ErT>gQ+Z15T%E(BRYk6kQ9#5BCfD7{&%9u&(|CRF&7p$CT zvQQQyS%nMLu^xR4l+w1Ytf<4+cVvBcP5pq=dF)U^6LWkhZL|6?np8rm)48)7* zN%u&Pk4XuJ^uHKA3w1R!A%LOK49v%a2yeE2!-dbD+PT)Q@BS>CxN1`S_++$Fc05Fw zo=RL&-rdKP;QQ$nMA3pbb1Z21jCord+I(yKu$a?e%a5@B?sq+{j!on1f$~vPV46M* z*02t7jE%Sf`DsI7T>atVrg@pzu*<5~ksyD0ldyC!XP0UHPXlgkJZme9D|ua-zK97|tp}aJ`Ii*$3 zW?v{ymY;H{nv(4|zNch<()#dAn$QM~Vc|I8pkt~5t*ia!!~@m&$yCpkHTIWIDJB%E zzMjP8CdQN_)kZq<9yiQo$mCTcE47Q@e!LQ#s9ud&bt-IJ{)tfhN+GRg_-0brwThvd zj=CV){Bejep~8Wix?g4q6wST^e#*4K1lRbL1?J}TjI=8jtl-vS3X(V4_8OZBBpZ3-xZofNtfn zfa9C<6%WAB`=~S4#>B;%^`qdd6r;S%qHIa&2#+LTt(F;F*cCS8t5pJ~X+GTk`@Ez~ z3Wa5NcC^||6O3r+*G2}WIm@3qqMXhQ!?*^{_Ax*gIlj+YOQ zxB(LZ+OXH*+V6Ssjze{(BzP>4Fuo<5|@vl_1{P z2~rrskz)3tG>aQQ342pc9%X12WT`|VC|%mE0nk7hspxoS*32i3I$EVl`^4oP==h(D zBp^kcb}8Enos%1z>43L-NY7XHGT;|?^98J$%0F~v>T^5IW|1M%VJQ4a7TG?PVmVYu z$6=tYKYjlj5s7~w5(9yX4~JOyyCb#_C<==So6T|7J>?6Zq)hflxLn9R$8cFceRs4C1U^bm}FLqPD_xIpu zeOPOCk*^88zZ{wk#x`hPDpo!V$I1uN0qyI>Fon{ldF8=go)f-w-ur$q#G>#X&pqKX zTyNA2p9eFdU#hPIbpcM$DRo)?Pt$(=n%2wnCBlX(Gpu>{e{(7D5y&ieZ5*_;bc{+V z=2;Szf?$9oJI?CbWF=&1ZD)4cwK=F+UE^hPR3Y3lj%rXp*GG1@C#mbQo~t(Q$ld*J z+;Kb0hiqsVC?!}4FSKW}LPLQZ4)zJ?vZINxmk{FMMIY3MkzY!50z@%1c9ePa!j|-0 zhofO*f`s6)swY4pMEmmarb5BFe&{9kVm1AV^AFXq?>~!VIzsXn4`+_5yo2yYGrwbo zWA~>sMs|#A6?#0#u`d}}LUZQ{>9a~{Q{m}u?+q+{!q5TT>~Lj7e_fL|K@N0|3cXtA z!`;E}dHpfMaSiznlSiA)W;aPTxhf=OJTi7v-ACoRK&>2dJ(j8v1i7x_ z^|5s^#}P||GFm#H*#rl?X;goKo++50^C4N~$5q+sLwmW~3w$5{Q$>jXQ-l*Uu43L4 zv@1+CCd?dnTP=cTuym>4jG6UWY#HTfwe)P`;a3N~6=U7sNg8NEHr*UtT!st!_bNoe3CwOgeNh z$Q!~*^E&oki)*IhZ@*iLvsql^+w$r+cH||Cif63*J}Mr?YF8|&_GxLf5KorGNkvXA zv#L*MgwN*&BdWEWSZ~@8W`@;O;-cN@iC>m!X*O(ys@=$Ji&bw%)5QScuni?bI9 zPHIhPMjKWpdKb{oZPa&xv%WK(o$?y=*~*{L-k-f*kkcQFrKrE9E&l9bDKNmt^r?q8 z3p)0T`Kzgl0=wPJstyq3Wl@@%LE&%}b4D_wX6X6#tHfuTj)N2Kv%($RX>UFOjl4N? zJDf;_>>}hWsHTUb^sMi4!a`S;3`2!U2=lcwpU>>--9w0#DBM0-1kPZKaLJRf1 zA1DUOmceP{EvKkwBBr=O1}jm2^4&)JtBXcWxaE}Y1aOc&;zw$2n+6WWo`Rv%J${M) z!kS=Nj_a{;7elvKKaU!hE2rNJLYe2J5%!}J^O1|y1Af)LnqLCX(g*?YcLR06ogx$d*@13;T_tT^KP(K^ZQ^H zg@Vaa8o=LobQ+mc)Q=Is-_Y$^gx_0I&bT?|W*O}3o1WrmXlT@F`7tY6m5jF}(r! z#X3YBripT{Z5&kkNZ{?cLP&~bf7Bu1Tbn8Okmoh@A!2r49Z(c)*XhVan=7Go z?0m(T!`8w}Ic-uRrfvO3R~Qsl7`37u(1yt(?2AveeXT_M_%uJPA-`**P4C^&(oqtK zrw|?=OC&3cXOf&-bYv2PYYB!6-y!Vwd7oO|A53Vyzdl~hnqE7%-XgBtxAu5lx^~Z| z{Y{{R%7Vn`Ht_=w8lZ7B&iN6nXt~3qw4KL5?}F~o#8TkKt(SQ)@RyTW`cPb>)Amn= z1yjdlG1_*^0cjUplfp}#m?@DcOb50D5tLRf=vXShWOaHs)^Dy`?JGW zmc=Gd#v}Xn@}KSRCw=sbyyrK0>v_w2iB-sv~S;_4C>d^ z_+c}D@8lucW`LS;uljxa)F_#JoG0e7Zp8-X_5>W@r_`XqiD7{*FMIb`F&DuO=o@)W zyq4;j?ATa@$c(2lsTee-7<4KDg#o|>6YvMzC+XL+tug#45cyDUMt~hz!ds3H092fi zC@#;AvMLE|>XiXAn>GERl_Txq@en?_ETwu4S@^!efHKj{%2fQjO&zyKM|4>yq}$ki zx%;UY#_g400W(}mxG4HINtXS0Db8?IaMeANb+5`TNYrE(aTad$-|j_q>kT(5cnP6Z zswy1st+zqRE^K^bW#ts*`9PzUWL5SzI2Vp~pm{Jkpo!R4@0~NDuAeHATM6Qq?`F4e z=SQ0iHG%bgjenrZ1K0U#A1uI_&os?~6Dqnq`CBBCWEpzk?X2tx8~leuS`e|}9hUhc zVPUD(Wk^#HT^#YR?39|}0TaZuECpk;|Fr& z4;rC!$iM0sm9^FURl>JmIgKT(?2_*J#5t~kJFW@$1P}{OwQgQB2boc(8~C|%{UqWm zy)oU#GF!hjSuP?<=WKFrUFVkEDEZuK-redf=Bpx5v0}r*o@o1Y;?8~pW$xwJhu==~ zJLLIG#%{U@IVqe@sb`o;MM(^XmJ%WrPi)Hq4PURfYY#p=RSdTPJs~&|`#QPUyqR3x zeCy^OudV;EZlHvZo7C7$4HRB09$Q&92i*Azus3@I>t0%-=wvg(jJ8V|L#f`qrdLtA zaGMun=RkRG*iWzf+ELVpjoVSE3nvsQ(Ekz1BR71ox@y-Va6;j3#MI(24elMUkEzbx z8nhr486{(hgS)ZJuyM)W*<`5DHnh?Ccb^d6t-(HyNllleyoN7vBB&i9n;#GQ8eh8w zZ%W+c(T$5NxBJOs>fQ@qR^k~XdZ#lHqPc@WK`>xYZMz5;!+mmptsQF(|6sH`#mY!$;dR#q{VrU0TpE~Pfs{yHtAieyYEztTgLMf;y+qa#+~vRbxo_4m11}JX zV6F12arFXxE&ts>kuY_2u)j^bTRh}B?)QG?T5`hADQORJ@fboh$AfueCEuX_^WQY! zGc|`HTpbN_Z6fXFDFJ<#7$pgDX4pw_Fb^*+RHSD4Iv+)}#(t4iNVynv#Au1zOj5R^ zdm&X_^5t6%rJqJMUaanUd7mMwUD@0+r=D_EKcAxSocL0Y0iqsa^m#~FLwtNRSv>!)vSQGd(sjtslk&w6=P=6#CP zc%i?AhP|c_yl$Kmp*{@tzZyQKqdtiCzkZyfLj?_`QcZgvi_+ttm`s90X>v2kd7BY> zuXf>3;UIrT{~TJSZ7Yxb5;$zAOf1{}G_4J?BH^sEY8Jg~ol%C;h%G6}kw1?!GYn1p z+>l~at6?`m;RNDv`jZSYZQC7&<3kIPGX`{Q2Wb69^ncU|Ua3tnIh0_YpbUhd3>j>T zy>UwUktaX^2fxO@quTLZq#%ICB10Cq^j$=x@$iqi1Bi=i#A&xir$O~>GV{FyQhMj2)_?~!eOBd1WKI^`oKS-C9 z&7b6lzd~yWF(~C=J!2@A{`J%9@hZ!E*Qs`;>qS-Z{#^V%wjy~T9`su;7Q3?Ni$FF9 zT8Vt36kUqcEH1U|!%{zITL%Q=Ls4NwfdjzJcfVlSfUh~#gW+-R8%3qu1^nCAoM~w; z*ldYbnOC%5qe->h?QL1CxqEo77X=k%y%Q&VI~N8s^pvmok{m05E6El4qK(>q{&{|J zJ-*{i!{j#{qko1`T44ax!FE%FOicpD|1Z*yePd3op$pl4#4!cXPqp9r+VMICGv%t_ zk=9Q;nme0DWpumt{fxH3jNFK@&gvhl0fdRpLUZ!Lbf;yk&(tlAV2d`-0)pgc;0N92 z46T`$F2As@%vnsCHo^uM>!~j7Uy<>=*RPtWaE+9vmQ%lm&LoK|{TM;eUVouYqp>K; zTO*wrs~)9YG}W$zxrvl#8>WvvoM#WbURbo}dCHe->!^pk`?|>tt)>_iWu6FA8g&o^ zuvLbrC?@pDEmhw-hrhA2g*ybD@6u1F5g`f5b~r)gex&@)G<$(VK3;$UVC*lrl z8wib!1}5p|8pnQtwO$?$c67IBl<7rchq7Y@EaBR00NLRj1dI!0LF1n}_K7qrQ+FI! zLSMN@@|a=K=~$o5ei+i7Z(1r}HCCnuA}1r%L(LFl5AxKqE0CR~o>+^JxlCEyyW|AA z=qn&xIFMte<8N?bkC2J`h}SaJn9#DV#nDt8fAs5O4~dkBSqPb{HI?3gm(Ns;61GSC zXbtG9>qv#Lez=2iatNGUw`{5j#nKGxhm85fCN*S{MX{9L|BA^0Ubbd!2r>3xU;#f@qek$+ z@vQvwLVM>b`V!TFpg->I?t$@`NXQsi-tP|^BeH<{jNmf8&lm2g_D@&lFW85*nc@I9 zti5Yi_~>BjyQt9)k<((?=S#qK|1safj767N`)zj@d;hzEsqS^r4(?p{0+Ut~u*$#g zHq3Au(jY2x^e%I~+tPj8(sySKT-kx@%dlmz)xi?aqAj$@NVT^5i<>;AlP&kLx=T8h z_Ezia8RD$6=p9+_V$Fu#{mhL+L)nMaAL91w`S>Ph89H<6C|EB#9pc<+=a+8hNtd2P z-}!t2Q7`wZDRV)~w)XhKrS?l5G5m|rDa*B~F{52Z34>Fn#J}mFoi&ub+0qGL+^7$v zHC{m%s&yaAPWr;!An&P$qLAK{ms59<7wD%oR>Q>8{&Ic3kA_4oJr3gS{2G?XNtN-+ za7UO_!q>eGc?1{z{h9)94YD!eHYrj-(DOAZJtDIR@17R*0H4%VZW zpC*UrLwPK;`1RZ|-vcEq=pfPluSFpJKmK-#SJc`7u=%;NZXW8~g6gw|CEKOyfE%Cph!6Y=OfE0Y^TD6VqMiiwj`m`|sCF+z80KFa7Rms9 zwC)rzdLy6+wf~E|briLLL2930R6f68bjFeB|7-)PF<`Imtk8fa(fD2WR7Wrvh{gvS zqUd0Psfqw4$@}~Vl2jAd44cQ?dH=|=uro1$&)!sksBd(5I*K!kU$2Snr%Gm)!l}|= z(glm}r($hgp9GHu>mju7*lj3e3r^Mbi{;<|8C4G$h3 zai18~5a(z@*Fcuo1p9QB*aCZZamrR%?=<3kK^V3xoKq|zsIy~Eggpm`DTGcvN<5@J z{}nAHd>oN9$~M1Nw_2-m7AB_3D}N2G-38b-Rx-b3$IZ>pc0wVV!63a+b(uZFv!C)9 z4Kw`)Wb^&SJ!N5(q(1<}rO#RJXhlV02EXv3_vBOHub*Y4%vn8O!H%1t%|Rn#)i%j#moAE8?c1G2 zO#$>m@ttoOmIb<1=*~nT;00S3`$nJlf8jsgGQH*{f+hCeR-#ZpN#DP!)+~kesOk=Q z`eyp+?iFlTd5rOpC8Gux&ckPvz+KXC#MkbTA3lQTh31u(&efWE)R%-8`HG9YQm5h? z%%;2&hMtnbZ)g3F?tgK!tgBGgrWD>#w?55kK6oA#h2Pw2K3L3T&nQ1ojw(=A^EDlK z{lCkaEV}wd`dfUrvO{K`z61u+u8HJ$Mb2#BL8IP{me<6!NRjOaT32|?;Ym0}A4P>^ zb?4@|V%oz=c>2nsvNlKx;gf!!s*W6m?q{-dy}MFk?UFu>&4x=NBTEkZeI;r2|0SB) z0^bDw!X_7=t_Vh8%=^03Uf$|HQc&tVIW@B^t66R78kE1M27)qF5M;OJ9*-=xy|QT! zLRA0z6R*R8IyE);#REHtHNkpMhMcJ}Zm`A&v^1*50}1q{m;0$4zBLOI$1DZUW9hWn zTu;F@@mw7j`KdTbtyW9@1+1orKF`t!ZA13j&)(NHWc+CDioYt(4TmvTUps*L6X(@n z#Ypf}!2sv_;wi5y^vzI92I}Hy=15o_o=0CGu)v4YenoqKoq~cYTBn5Q5Y&Q0tg5ir zd{%blBX3t`UtFro9!?k5x>8gAm-p`Jj^=wcrEACysY;jpM*6)-;@UI95;YYQ3t5D)Q+gAKn9RNWR%HOiT}U$^>a?>sBRa)LjJ&hWKqxr4XB$aGwM z%i-c2ED1=iN(O8n);HvMg`fPryN_RZcG@fS-uli53O+PWirL_`O`@H0ufkd9_4y4%zw@nC}^-nIRk%x=;?5t~WEonZw4x*^EH>LKHw1nkd zAc*WwTGet!cWhPfe-pj71E%|_BgVeF1}p^%Uj(ZGoMcEcL>cGI>TOnE37Zz7nfJ0t{) zfb3N-=fz8)gE4dxe&GytG4f%JwuYbg_VoTSq4$P+ZuA?U_<^(kHS-v}^lng0M#Ff; zxZEhXf%FGgX2KK_kuuLh-r&7!7zV+8z#*wyqFL;z_`cktN+x$Q?q+T`ErEv51KQi7kQ?2X&FgLOBG%C(}LRDc`b;qa2afMIpBNvL-A6ELNV7T9 z7Lcf3nBjTagLsc)sErN`Q?=NX7Uv%SJRDZ4l$ZAt^D4ZucB8Goq-#F-Ppx~K@B`lH z^d@3gPt}UN50tD@_s67vd84q+M2xIz08zJw|Eav*g}&klqOLpc!k{}^`1n5J?>|~- z=*VqvbrxtrfUeGTMG9u@#aeOKa&^kppT`=jD#$o!??c6Ob`&9cM2H{R$MY{{Xx$_- z#+JIt5-X`1FtR>@8FbGFj~}9PeYah_68tE<(J62C=0d~Y+KPqDl_j@1-QX#%%Wy-t zgwf<;VR5BqSR~(9w89~JL$9)9Bvz52nhTO!P!n}rSj#jH6{dYd=LJ3+XQkUhhi|te zAj8~IXnm&Q3A=cY2zgiQ`a8GGc|=GGmu-skqEct9xoLpR+6aO=S?)-zxnUyZ}NT|MDSCFVsx=+gC5DT7yJ_&v7pZiuG9i)tMIAO9(gw$bQQ zmzsrl$m-0T%@?x4=l0swwj&)6I)iIAj%T)JLDoJG!Bt&i=hPPE>K1k5mh{q)hkM-rmhp}2_)ZuOLLWasuIV`aFCsYIBentn78M`})-4A_ulV0c z2&?t&;0Lb?&!886dhp**plGe~zCi{emMVETb_%M6jRNUB88;M94TlnQfJ z+W7o}VTL+l`)k~z;M60fwJVyp*LVKA$L{Srl!mw9RbvYL&vsET*+TFP!9=+>OwO*Q z-)|Z0G>bWn@Fkkd`x0#;dBk(V(_47II2Z+I*6TTUk3$A)C5&hHs7TAB6r-CK9ra{R zn;O(DYkVey?6p-vJT76{{z_I2wa_`RJqgoe!!`y+XxKM+dp|6*_v2~VpP%b21hATI z!%bFQ=(wdm{6RE{|YY zN0L5Fq=IFlD`)EhR-+My+}i+VZ#vh(1oht`SINqqKe=8>m38nH@6|t_T1qou@<<r+jw^t)y%nOV@I9s9U0xL{?gAYcW?4941w#fW5gnVpPMLAh571WR5C2Sf0( za(}caxhhqgvqTDL&e1Eyr`65^mc%v|T^Lcab!Gu{`UO8GNU@|1b1_vi{7{_yxvz>tb4~9-TK0s&O1Cw0hz@p5;XSzg|9q=XS#X+WHWo%>uAZ zNM!8p+z0Q=2X)&^ebBhr2ha$W*ViI`9KUeHUPy(!#*Ss0FPOM>!ekfHD702M4`2vM@hTocibP*9hh;(C+3 zNwS+Y?S9l&$bA9SqAdy^%)GQ{xPyi~iO*yWs5GjQ*6^^^gHd?H#vuv| zfW>i*Uq>J1b^7Tbcr-%)c0uzjI=+Qp7wPSco3;&mO$;(YJ`=O=JXq32#Dl^pTc1mM z8Qy6z-R+3=8VsA6@hio+iV;GA^x(O9HUT>A_g!@L7AS)(T3Cb```NERBEdZ1cw~x|hI|qB^9Nswx>V%R9>@%6?`GSjEPh;IoRyxgC?A z?xVQ=4r}L%qRn1zKI>i_5j+>=MSV9OEB=YECwBt;*qf*}sgdX%26G_&^}4aIvJ8Vx zR=ov9sR@1IWLH$0;t1+YqxqV+@4Vbbm#*4d6r>!f$3r1AOg2#5#|-81(!rO-qQqn55biKmcZDWaP`WfM4IWM> z`mC9z&s%F3<9TzgAL(D?1c7OWkLj~@Uu&)D3R4UkKs{}%oEcs%E_Lwi%z3Y4jLo0{ zwiPt%eNCkNlzp#bbBGCEG_;C;wT}7MOs3k1-x}D7^oAxM% z*0F}QTx00db;EpK(zx-=U9);#R$(`_CVNhqIAUa3Z;7BQbxwBucDD4)tK~xEc4BmZ zZBLlEPP+x-tN(fuVR3-+(ba3!SCGX&lkwG6%zCCkQ8UcL=z-AHls)=1_ldeVzR%?W zxo>qusNo^(0r_uhxxecv+;JhUa-;mQD(~iN^m1PHQq~Sn!HarRM=&YD?URA2I%($T z)K!1D6E=kExO z&wuEulMJ3JHwL>h{w<3!7eSugFX-oQ4g!g3_L_d=+uRe~V*6fE!ytENhPwyqmEO~~Q;Jy!vLj4b&wp`3 z|4h65Ep>%F)PV@IfanYa9c=tx3JkJXgdx8>k&vl{g8rmOFo7JWN%~Nr3v>kKjEbf4 z6Rur>x#8>*^kUE2i;}qyOwsRt+88lD6dO3=p-3#j=X*jsMyG#!NVu93`RaR@NW44p zT;dIXti)74I0ytCh1$!s+nzRy{W{79O4nX-aR)BLyld87PpWwIq!SJEs?B^4#+W1~p^NS?crwK=XM2wn_o+YJ$Y0~?@6qmW=3Jc}!F74POii*Wuax^W z5_f#YrL6Pp!nX_dyXJz}G>*UiW-_MhE+=bwO#dK4h zcWBIZa59rF9W3A}UU*?1>&m}PelI#EG!^49e&Tk?A@f;@A^eO%h*ehyWPOYkM76Q! zZtmh`^1W^=c+2Q6?fp@j+Yjv`175V)i`Xn1=E*i9sN{`Ecy!Ch-qPEzB@h?m5ANpM zNC~{_`t0wutscgF8eC)6y0Yx8vDS1^H;Mvm%(`vCxhweeaDV|n*oP|sm|n^WT0;gk zquJTXKnv#AM|O%IX0e0v3jaa2DPz_COrQF*)Wlss$4LW%6FMXnXg=d!@ywvn~{DHG)g+!0!2jt2sf~`Rg5( zZDL69a7)PelFzyBSpC&X=?hQG@9%=0PI%t3#D|v!Z;yN{s@gMsyr-V)mC>hmEqXmp z{0aVn30EC@{kxMU_TG;|AGb}X>}gL7*y-cSlD52OYOG;XcVX87Zi#)Yx&)6ji13Rz zgkZkyXGDwNXu7$vD$swFu}X3nuw<1o!3DxHOT;8Y4F@hCgJkW0vjx{ryQS+t*KSdylp$xlKGNZ8Z1qfj zPh)~^Hl1H#aR1AVeh~v806b-pt&wk9k!5P({gdDcia;e!K$N)t{x2*1-wOnVgAS-r z{z*{ZKgbGYdO?u|#=+v4eiX`pQ2wViZm2@dh_tAeBQ(g6vHk5hz}`US+W}XzZZE}i zKJ!zU3i&)1?n+{WJ1{+bXKAN!c9Bv0IC~<^Z;N;3SSr+d$h@GSXgfZfljLMdv<2Z} z^=T_h(uu+bXyYoOAwQzxWawm9>vE!7!j2Hqoqn5{Qc{N?D%GORYwd z{w=aGFSHysO0lZ;yeA#El@o_)+-^(I*RZ?=jpK+GYNjsS_jF!R3I23w z>VW<@=md3lr}GFw)~)Cwit!)ej(_uUaw#CbZNz`tpZ{IWn%-hE=}kKd2ry&+bE><2 z^&7^qdO9?Gy#K?(eqi~2IG-5kWtJ8S9SHiZg(mu2hRHolCAZH|3%hV4Phs20V# z8mTBhT;s&)s8$86V#L0e5-vBB*7kIuK*H0Q9O_61)dFtKre(oIxgYM-_+ORXuH=KS zwX-I26^VS*N^;muU57CBYzW3^5Ua$4s_wJgM;j;w$!D_@|FcoW=^<#o)$~6niA9>p z!jTCHfgZ9J_wpRhg2us+wLQN+=3!KBoyx)v$5Nu5S_|@8a4C&D_2$HhEaH94XEq3P z7Q=x`kt0$>G3u_Ar?z7%gErkvqL(sH)4Iu(|7Ph=UN}!_oy6u(9E$!(GI~(@W z))phpzsao{gD&{|R!pQ3aMpV;?n*w?iu(8a+tJeeez-l>`x#83QOUk3C7$Uw4~G}c zymkV=xJ6^ck9;(X9N~1Wt|27i8-FfzT{ry-U)%eK3*%rbhSB9T7T#?~so_L%q@kK>V$~apg7hIV(K{an=q|aNDy8P}BZmY6*#e9P8YjvvhcgzW$U=U znBG?-UwHt-nellX?xx7y(;EM}FsS`H%jj+QN;nWON~pmOZU0${jz(kJLU_JVUp}{J z+heF=dSATZ4v+bBZ9*bjT-xJ7&1u)TsK;{ZR5qOb{aJEjRNS|BB|d-)j2TC63-h&B zvAcH+d*6J1P*|Pq6xOt{1C+CAywbbn-K2q52bg z(yj-B?oyXstvCe4jMD{`e1##t6&>e%*S+9p{s@gp!@u9QJN0;kJ>FIU}ZV`P{+h%e+5@0HPi)i@k=bU zly6;Rh7hA%xRBa8tj40htkbH47W0-x(pLX@_!`2tbM(@I9>2!`^i_QzZFvWmiQpRp z_PjCG8Qce9vy^E#0g=-oaoq;Xmu38_SiyL4{Evz883tE}%+L}+nDRd-Jll|^Kyfi% ztg8l4WY`=T{n)Qc$Rc*4h~pVCg>17r7?7f;f9+o8Q!7&xerJ=LjaRr7vp?4b7433h z+*spTh(3g8mr4@FXLK=IwNl&GcQ~5rT1iuJo4^**)CtY3l`^yy#7NauUhg+2eWcpZ zT_IG+9 zyKlZ%5I_XZ?YuI0TEi|bMpL)WA@A0T`V$kpF&liPa2(N!zw3EHD`9E;#GtO z<24_b3m%vKr+y4r{`UMY{m(;-R$*dJmei+yW@rgUCWN~*LO44L=KU;=Z7fdfXe_}B zIW1<4s9{=hcwAl@y!xfh#hgX-FSw6)T=K6SV*{W&4t{O3-AnInyw7qg56YE3=-MFU zmq=FNu+H*M_t%G5C#y3!;tEmrtQjSj(G*8oXNeP?cmoON+>gNVtViw!17%I|+SSEV z_oqW|+Yy14bE=vOLN$6=YTGi=_F*;v`0#AuO@Q=h2165*L@)$>Q0G=P#aGn22F1L!6*<;nD z{nXs(Ydv~_97YvWjyy(9&KE4x!AKzVl?aVYC^cTy?dwf@`<(KDB-#xdQfdqB0dt9E zaaB5V*2K%!GliXyCuN)-bYaTRlOlotWvTvqVa~e?%bJvG#xINV1r*_qod>k*Qje*7TxUu;=C&Go1*R;$DTvbZjtmt)R4`jHJ|9XwDV9O zp0YzF(nvkcJ%-ba<)8mOt<%fUYfYlY`I8y0nR&F~U6H{eO-3A?8ME7s{iQ?OWp?XO znO%?D?Y91}MW4-=RWW~MOz{O?G>T+;=o~y$f^qSBW)c5}bJhDAtR2+~Tn9Dj_9fmZVGiO+(S4IU`T!m#sG@JTL7l zW0)F!+h3ns5L`lqI71Q-N$E6b2W}60(0-!7P{jtN!ADB}p#}&JOpLR*h^LrkcsyYi zK*<^`+E*xMpTm~}#zidxbsVSGkJ??G+t7wf${bh1ScfFTD_j`19;X%M)wdP)kKrQh zsJf|d4#0)X^PS6`6y#q2UKj#{rOQEw9nM9Y(7!-iF!S4RRE<-b;aDCxSkIdM`b$Z5RV3?w%3@EOYr>`%Lc{hvks z;j}LqXfe9m^ST@MQ|pjOFw$=}V{%u3==bamdO>(H`)(4;p3N9O&F1Zd*Vs88sX$Z* zbq7W{EByAh{w-|u^($d-Us54AB|rKqKi@3x;S^>3JLy$mEdm3dqf$G4+ZLYAK{^nc zNrLdQ&tg;#szxD;NI3zZpJ$lC-Gpgbdc+wmMIPdQA3$zdt=vAJ*PrVf?#|v}%7lJV z&+;Vd35fYqaivknn|os^r9Xmq%-{SRi`T`)9S_42?iIfRgu4<&>S?mFh`CUgjJXi- z;Ez8X*QZ{F;JXMO!Xz+yZ*z*O#dp6%=J}>52+Lg$-j$0NAM8lQWZuP4kYR?VhnU9TpiT6isOnVW1oK5of@8cf(Q-$aEp-EPlI+=;-n+(-4iN^w=s zyxC2%ebPfYp`0iNEchC1INika-OM&xHM2&6g}m%MvsS1!nz`!~`7n{!35%e=MEI}1 zCrw49Dm^5w&H>J_ZiuwWeBa29S7b|ykFgc5)ulR4n}GIh>dZC`iakr?XN_M>!?Xm# zOY5rCBb_yUlu*CLMY#-+8nz&*DM+F$^cVk#Ycge~P>FMNB*O0Hyqg`2R*xzMkKFA! z^L!zfsrR|dIiNEO-s@6UZ%5sY#y=klTXWw__D!l(Q&Z4e4tvhO9yui6X&5x$GBVH5 zMg#xB+~^pr_wW_J-XhKI=w3f{A$iKKYn!ihoOgadA=nfzxN3*9<5F?AsWC&1Hh*pn;6Qfe*<4i%u2sw*s=` z3?y*Wr>x`e&vq)jzqzHgbnZWtKf1!AD$6g+voSH>ySFb}Kvx0r008C<(e98J{nlHL z(!XE{4Ic}gT+spkK|m;RmIVWj7{26gUabiX9?JQn9d|~FHn)27H3MCKy!DKN zw=BB3?kUjUg5uRlU=KU>;8;D)H-$0$ZP%C`#}l)wn6kSzxXb5Ymfk=I_B+Plmo9G0 zwrIZLcTlpqMhv@3d5__QD#zr$WIS$IMMU~E>QN$+FoRj1_8-zQO#nE&Wqf0sjanc~ zSB=ev#)csdJ(e?CXsmdZa&t1A`nliv@sWP#VLH0z+e-&s25?=|3y=eSBW>I&R@##F zG7}Dbr3%ZSs_dh(D6W+H(@juBo$&lK2Btpl7+;RS0+f-x)|B%+!~ku^qT=&qVFcmo zb7MT3x@Ozs`Q}4kyDk3DdM3P|AJhgu{u2tnf6WeCU#DPCfC~cx6St2KP7hxD~HB9dE zOc!Ci4tf0eMX0|UVPdB3ppUOMs=xSPYkkGdtan`{3opx+Py4B9Q&Yib-Lkmo#Wdj3 zHu>r8YU0&Pw$Ra4CHb_MHWs5$T&D^N|FppR3s%`vzW*q^!{zgj8Pj3e6H{&>v+Muo7)Mr3%nC~m(HP-GBsBbR2}5Zl&DPr$3CmI;$wxI9pM zfl2d5Hg%zkKwG{0HG(mH zaNp~;R|RvLC~mk|=pW$>s@)9x`8Iv@b+5+*pO@~e65$Cq3cG?2cD&qCIjCU4Sf-VV zLh6Py4qK`~AognDsqHiqAs&BZA_>6YWg}7Zkq;d_E~9 zwYYUMbn-Z5Xxmy4Sg#%Hi%3r))6|m?bR%(!SoKJm-zX#4MPs7viYi`?33*?b zxmG{XmQ5_}$a_^!vSxN0B4f5t7R}r8A-4*r9cv7Z^)b#EOdNNe%N~(F*;Y@)_jGO%uYvsJ3P8gZl@A~p0A9lw=04eSZSg% znCkyfp_|0`XAH>%_E``I1}*aKdm_m>uk3=TXdp55oQxpKgzS)y-H12PT|^Sm@>sh2 zuV0^SMS(59p!lgNqYBJTQi|0hLXBd*-!$hHf{0Uc3#nU{z`Yx@B!2fG`xei$dUiwvrAb&J*^i&%B64YCn^azx|n&HoDzBXLx3$87L{t%hBE9< z7;MK=>#aU1zG&n=KW|xZGtHMO6@Ob?lhCJfa#2r4{H?j>yYQEql2h|E8nZ~BhaS4+ zh!e_PYDu0iIQZV7wNA2~%Fa(fg$^hVa!X$`H4Sk$s;+D1A@2$S+8=`_-wQgjRU|S|TvyMKC%t#kkw*`hdq20`?68$V? zu`OHcg1(AX8#NfmfJ{Y<%Rea6C3%aL&y*fb@+-VAKGX;!#>M_TWY3y|!I~H_YfVtF zDkAKRsieu`rHCG>K!+0DosRuzR=^#~=YDd4{**(uAH1`$Vd-&WvY$|6yp8PS0vWyi ze7M7Xx_8mn`$nJ1s|K)gV)S_i=C&b ze$Dc{+v()}ryf1#+0Ssy-qvph`cX~38GuQf^LdI?oq~1DT!;ukuq7;FbZrL98YCFV z_3Ku@?Mphie+Zqowdnb9Cc=-)#u7&}q9#A}C~52BO<=f@hjk^Cg%`EWdlc{DZ)y&z zF(U07mN|gdq>&Mt%~)&c9=S++Lyb&Bsy06UyaV&N0QO!H{FMUKC&{00TmauBHblnSH1lbiPi?-J@RjpjZxtN4QZ>58q{!b@Ty6Vc`y;&`V)x{maKxm-y zNY^vxN^uLLzDm55?SA?PH4qZnrCK<ch72+*ZViYB42$?IXmN}{{GSld_}@nmnhKe+aN8@XwI>3x9H3| z{ti^?XRM_*6xzjr`iB99vHN{>-=q0~L;Rm2bch18j{@6F7)t(SD06&Rj*~Od3?bOs zR>auB&VV$j!4w_+xNmMnfW46e%+eJAsyVP&0SW`%1iW{+?x=$mG|ojdqj`#hs#*^16Jp@ zj)}CwVk*SM8qy4s_RkU)t^vGAp;*^RKk2gipxYBPr$)D@@*3O^Vo&pr!@vqH5gq2= zAggzh+ZV=i7)~YSA0{UX&UDNP-O4G`H21KkR6bSz1s+W~Og2NJHA?U5#7 z4b^rWZ{Dl^PT1c~i;G%3LGZ?Gq}#^P7<6GEj}bi2HoGkx6Ew@Bsu_*sjU9rm;i-0v z5bgWuIXO9gzMt$p2GKxXxBFNb+8(+xxxFjrJ}+E-Z5QjOk%wAZhj z{j7@d7e)yWiQSQ7L8Z|5o6hFse{M#!is2ps)o(VE$f6E;ZO|~+i7`4msjNtknCY<%-0h6Yggvh`jC8QSAhYsKTcVkt+Kb5csCHEFaY{EM9-| z_w7mi>sh(R?qEgvfb~*z?vr(5sc1Z{fvRuKume$R*fuD;)oWn(j(vkxY3~?+NFIv* z8RW>{Gt8CvBm8NA5o32Z29Y+seH=c4%VJ>D$<1ywr9<+R%92?LNpnfL8BSz`@? zokibWmtW8@ud8oH`{~==W@4i*ajdr)g!#TR9fB`x!ml|Ch6swsi|{bq7QCJ^1*TO- zhApj?l5DAK@?kFNGXp`|j+&E0KYLdz(IkpWXha8jHpMO=2cK+2SuW;URCzh#UWWRZ zmpDOboXjM(BKa4JEot!I=l~<^2p5OzfCC#&O0NU0CuOQ(abRp}cf5(M){) z?A4oRK-p-B@zJSTON))JxT6mV?)jt3(}dqWu_*hi|Iq5r(_o0(PYB#dub)|R6X(Nu zs>+6+UF<93{%p1yFrQAE2#iv=i{WdLznjq0D7l#Pa&id6f{8xfXPEeBfC%?@pdar7 z{Qqh5@QM9X4PS%(eGPK;F^ti zjj}Awm6x#3>&sE!JH3Crhjlq7@;P(Th_lpM#~qGoy5JsB9&L63QhGICZca!v6WxQ| z@Vh1Qlr&jr7ICOBp`Hgf4LepbS6sVe^6V3CoI-96wy%X&A=7SX1SHb>$neZD!hDI`iia9f1MaEoH}suuMl)K`viQ>X}IA{6be z%t)rQ!vT#Qwpe4VI% zlVshdf|h8_tC`|}iJOEK&7#W$(+^b-{NKx34n7CYGcj6xj^q`hbdT|OO8A_9!3pB` z6OPz-EKUSlh#iL`cX#}B(vavG!Vld)ZIj^gh!j3=M)29i+nHp$6!+A54Khx{`musP z3q5jkb9||HY8!CUhiQM(a19b7P-uP!U^_%}aPCqS$%t*-8_lH#+t(@W4FKb?;lya%OL0pbZp)PE+^ zJzOF|8x%vRKc z2>1FR2M6E&98zt67+FW+4~YME&j8r!+po}qlJZqD9Y35-VKvO=cAEfUI&9Y?@$Sfe z+6Jy3S4q3ab`Ng(s@%WL_UEXF>o82tQ zns4veq)arQWtlFS-$D?_>_Ys>h0iNf>5#o;-v|G9LcCz<7vS{-(DdSLXZ+i8mWR~~ zFQPwKaU^OsSW$zvi74#_zdZ9amK@DlZa4sNQWorQ7JU+_mob75dLsU`!n+dJaU287 zYf8ID?9^u;$Js8D8jR72f~YQW|A(3?i~_NNqx92Ayu{CTqS@w{cxDo)h+;oj*$LoK zWImP)NaGr(X^B<{M~;QuMe=2r-VT4Mint6rKBnUwCH(p07@jhCWSZN~*BI=oH@AN# z=Zoil0E)5rOvU!^Gpb)FlGpp@brwyB)Kag!BA}kxh{B39zK^Pl0=KD?qK-&!BJuV$ z+rg;u`}or9cZxZekl66{@(CJ_@X6iHe(gQlQ6&yazOjqv-c?2gG&VVsht@PD4kQk% zT^(kw@>@r#+aACFTNSQ}e0hk15!;X<-)U z5EHihRxxTFRvBMwnEFN~wx+2t{YJ9=*s0b2P;YlYM;QJ}x|H@F_jOxUW7gth8!2Cu$}K6^+Y|MaHDCvT8(HUD82JF!WN| z!*?mkY|*oOMQt9WH~6~523pG`FuKjLbYo0^TCw9wcyH?+86*sbJFED8_BsYw^&nF}lb6`hg!s!lW zdD2=Xqx971X>T8D?H8mYy?JjQ!Ukr+M<8*W?9cu8a5(6K3y5s%)u@o5kn&L^!#5uW zIi$R_jiD?ZWRAC(<11k+qu`ssyjS!58MbXI=IMr6;9a>D2SN~1@@YEiyStT3hMyiG zNH&;=>&jS@PALD}LZRv&_o4Hc$Ov%fl^l_rQ2s7tk^+(lQWxCw@F{7gWjBp#!XX?9 zAnIE&;8r}*6q_iy15XyFL;Tr1#l_#Mrn7VNB0_E}fT%XMze+sbE_t!7{uL1!dU^af z3~Ps8ethQ26mqQk?O^kgiLutZ+T%rETApIl_LQbyr{jS9>KOkbKPFBs@;m^4hD<4tu{y(O|8jjQ5WmPK1K^t3(ecSv8| z85#YetlU|MW}2?1VoU#IHk?=Y8d)y6`cc3|Bc!y|Ms1bLAzfYc17gw-jXg zEiL^7k2vIT=P}TjA}j3}b4jrZP>xIC{r(v{#@BYXqrDu1&25|DW3oJdegUJyB5?dVjhRqQY&maL(_YMrSXuwJ4nF8Ckk#>u zi3r8*#=n5m;D`>D{>J-kPU!vJ7u8VnaZyG~yO~v&=`rz*rgEO*TD{}{8XF8duVP2# z1BFKvbTMr)Gzz}*Z#ef-Xi8SKp-ZaTaDUefmx^Tui7;!`a)~@6bg+wG30sOK_N;I_UG@^#YZkU5J0p5JXif~u=%}kH+&HH`Y($m=nV4@iv{pp^`A4;KaK$)_fjC9q##{LfAydQ zYQVxK!;|+F1u(j}_m3cFSYX8;L8TKZP;z3Q*gaQw0hKjn{Ag!3*Ap{d#-Aa2EG;Ae zp&R6_e#*eW5@(N}!|>(PwU(vdz2;(mRYro9Cm*Nwle@YB2Dzg4>9FNE^Ns@57# z+TwNf@r-thI-Q#*9|{n2`d&tP@*oDAihAJ!O*iAiw9lIT&gTt3H(j4Uh>NzRIejZ5 z9p7OGH?m8W-alGyu3V~buh3l?Vj13&JNbJyuI3|s;j4mP3!KK@cuDAyd;<~>MVZu_ zg7m9(Lw8VF(=kfTX(QJorYqc2p5afjq_w-OvEi4=#B=j4+!YI&@!HF4D;W-3KPk$K;Zoa;pBhz6ssj!W511;-n-Et8u+ zPl3?RzLp`M8DwFHl$l^0S$S#x1zYtwg|CqbgzHD*Jb^ zPx#%y>tVdqJAM;70`4C_=jFx0mH<3(6XB(*$Aix5LL0-jl%W}PZZRRqeEK|>ccc-1 z(QofJt=s5kQ*)Z3&j4rX6XZKQQ|}$oRn2o@mJ|hq255{U!NSsSzFS*~>Se5;w?S?G zbjc1(NjNSGT;a{iAtmK!8{mZ&2jy!6+Isu{PvaXhA)NpZSa@EVAA#4M zWbZr(jrmZP+h7k?0i?N5$$!Z-ex~P=%GQFh^dZfFNedu5A>+99-caCpcH;2Bkkj}1 zr|dp3XmAnMXdjv!D*$6 zNROStE63S&$^rw@4?bzF{X6Kr~EJZR#n?|ITO=k~ELwO;W zyOkX-JX+NtmbF+LHqFaKEX*4E7J$7MET|g28MI*YT=!wsGA-S{TSAo-230K)0tQn2XTM&}{utJr&uQzdTLl z3(=;iSE#z!n9T018-qDd2gknUr!lnD;^IuA3`@hWpl;2m$GkgF0Ga?5`z0%5KM1xRrXnDh_ zOF1$j`+&PuwRDX%cYi|&h9ZLY>UC72IWxYuY}R3m5z!1MWS0}2JO-;*`n?Hx?8{|Y zSYt8wCv#Ka%Tn|(p|kIk=GD>5R{KudC7kXV`A2iK*jt~I#HAGG(!8;6ZWmfI1T4jM zl*lFvnQ6Pw-S`enn^E7LN*-x)p!rEKNp~ELS4gYW)+Kob@>?0WTM(2m>f|8EvH-Bu zA>6Z4e318VLc2e6K4BklCkj+E3H66bTj-jW_WHG=H;$K}_3D{_58NIt9&7vcvCYs| zGGUrb^QX6Q2r_32-iM*5wY8_IwRN#YGqLmZbTI%o@6X8iZuyCYtHvxxBb8ofbl1nR zfvD+FIyg(<4?ztv0m*>%!|x$+1ku1gq==fGAl%r}Aj95daoi{&R*Tle?C`B?J&mj@ zClNJ7k=5?#SeHZ1bm?|cV+=VOXbpAa&U&1B&xt`8 zvq}Q##IUZm2T-gGBFd2S0z&F7Mud%--65?;e?`&-}%1;fC`R= zcJjcj@O^t=-_d(?z|ba3Z}!gBI`0}M|I8np?6? z?g?!k3zT$qJveo!>$_Oyd2OpU%&TWFz1{3{o-KVSqjbd-XCDs8WldwcK1S`c>9cUY z>{PvMP^MISQ_iPX^rTeswm5McOvUUpL2&+a!qE*bQhxlQ24rx)h`Vg_TlKnjYF_r9 z7LLqr=sI*7e-e>;;;B97O`GFIpz}hg27abLc%-VTE{Jy?<(XXd0XYi}o$zQkktsLt zdh4H9QZ7BrSH0xEE67orrYrx~+U@ev*o3XX<%tFiW;0`YV;K_sj);8}v^zK@e4L_z zzQCDK_adRZePP!^5wV_^nTTDxIHw`PhV3v7RA`5_zX$EEacOI7H4R{m8?e5QCJd#h|TdPuH&t+cduDb&!|bObhUDq3~~K9)Ei z7MMlL-jd#HtW5z1cQy@wRTp*HI-RxAlsT~%t3DBCtOs!fy8mj6`2NnRcb{~}euiWo z_D#_Ra!7m~ONP7<54MQOH{1|Fp(uopaB1EdESfI)sUyy1?J79tdM) z4F6-!m2RKWlsK!?Tv!V=Ij)FNrP6rkaM+N%YK(W=+{z^#?BZm5-zHF9mNMUK@6dD{c^Yt=OQ^ls?bWo%lGo>*JZ) zr?gQzEj-3 zO<_F@)bEBUS*3J$G~&y#v$7Z>k+4oxSQMG<8vk83@h}ORxMRzN&J^d-Qn%#n1k-{? z_0V4)YTP-ls1H>&1=PUjHMH02pqSlnxSY$G#{m?yue`o(p>D`63f4qn`?6w_Jd{=hs%9M{G%AC+j?&yHQ?Oyr5gkAX&SK zI`keu9TS=nM|j-{GgYLPiRdC`X5In9q}fbO0SN|SS%2=qBu(aB4e}#_Oe0}hIG@EZJv2{7;~I338s(Rzv#&5aV9F% z%;tGa+%GnV2Uflt#s|_|(YyWmo=9t>*Ehij&{@)wfOdeR*IER9I+#n7g(+=j>Ipu8 zZ?|QNIKIonBh}D*^ozM2W-UseswvH9aR6PmHD$(cN6!=9Q<8uye1RT1L3UL5HAH)9 zuc5qQ-0%SL=RI(ikt%ETMAJxF?;L}>c`N=yd5z!Ii|xs(EYS8JFMt0-m&Xrqrpx^8 zOOD7V_vZ$_kd3DeW$%;eRZRyVN*C;FS*Td#y>Y8`#MD|HJ zCTIRli{sc=DvDF)&Qtrw8oj}7h1yz&XB7oiHMfT)=33&R4(2?APA~Dg1!%0Ci0krs zKBLRz#$r-)bvA+OIjgQL*tjQT5M1H+W}?mA0ypCGvZ^yL)A5xtT{^ySXt-Bjr&v?{55+YdHHoP^-eFMagBd%Sm)i>gmR*{IFsKlJu#*ct`83 zx4XqzdCh}T=&JdD*6SX*}+4 zbBwIluc;;TRzog}uhw@S3$gCv);O1_*vf0>x6L_piwp~Q z)>I5nuE$whc53dW^4sQWsWqXp-iILTHCx?Q)YmNy6SmUY;w( zYT;ZWZ(y~^l8L044yey_=c?>96s?`EL>}mdW$MIwauok=uqk~o-;RT6Tye#Zvu2Jh zuau;HlN%Q2D*K)nIj#;bRlEvAeTDc9sO`4{th(+6)}bNH#F98ka8YBPD>?AbOf&%$eGOtZS=(UKyg$}_qpolGH!_@jM$sg@kwEqvTuuG0}6`kLE3 zTsQvyR~xR;R~uzdvbuYmkba^%5~YI$*1WUiyR1utbNl>4l}NjuIlizGu zdJ(Q6kxzMB*ZU;n)@=s&^>^f>4b0c)1E|0yoVV5VxrQlM4;rMgJu^SHD9^~J9di7& z+tpbZdd!+#7@7v79k}lVFOF*^h`K>-?DCE0x`pJUyE<yyl?xnLmb1_gjd8e8b4*XyzAdi;GJ7{ECDzLn6t@& zv^+8W2iK?eSrNgJ?wA)wr|7Q>nqIGH0#bwbOAAvNC-6JOL#$Nm&@}N>v$T{{e&Sz_ zxfGV74>E8-s!YI`2>4P3Y^dQrYz7uWLId^AxwvudMIL-88T4!P1f!O1;Q6fX?b?IX+ZU1#q5p{V{!YvD!&9p}JlU@3fZP0qyYZcZ_6x%261a0G ze*MDq@eb3ahcY2SnH=w*?4k7-=`bol0guMwYk|L`5`lpX+KM{un(UJ@p)=Gb&=aUG zzICuX`Xva2nY~@U1_9U%`E7eD6wQ|nU*{-)WjDme<;yKb@U!pnQ*Ew$eO{X3vc7-t zd*FXgT=x6902-pZvbSzxK2g+n64|9v_->#0cdh)sd`&j`!gb86^pU5+uGdOj+JE3TgDb? zuG&!PN^C{jcMC+;jVPuUtW<1)v>9-Pj*LiwONfF3q^-?|ahwUPFzYj@L*&^W;E`8% z$9B)FzV44X0=~(h!Pv=wT7CN z_GuxdD}Mn@14Pk&-s(x}%jdKMs=XhjZA)17`yd7>s=Jq5(%x z{jI;?J%o?Q6XyK`f4no5ebE+K*%G-RKcSFgUsM#m+u?fZWyzGNwZCylOH?kZC)iHw z26RwoS>ZtkFN4&GL=yPc`e^h%?eh)E6UUOe)}3ZHIt)bCLpwrwZ z5q(&Pu7{3 zmF$`*4=mfHfaN-PEm~)6C*JhnT+!~cI~e&1tVeJghi9NiFK8*V|i$! zc71&Ifu@3j5C}v_= zp%R7_cU4%hUy))Lk;WV8uf-fC@+7|ibCoJ(_iBDlWb=gwapJKogiV@PF6NwV8xbhb zZF<>z>B7v^lBqIY@DdIhXK&$u0vwQU(kuF!DaC$!O@T24K~nu1n1fuFHZ z0ipuiS6RtY1}yezTtnwhl*S4q{f!VKQP2w1hU=&R{nZSfr%Jv~T4khc$TPO-ZE}NHVi>*QUIz1Fn`QaIcL4_5oeJ`Rz}$Clsw+so;n}>?G*KwciRBJ1J{_)yn2A0G_c!nf7^^JiBwp zi;g5lCRmY*Q)d7+3`K_ADzySB6ZNxb=)$J{XEvAz%m>pf-RU$FcaB;Yrc`k?-uK^Q z=^TzwrJb4=cdPal0Ndv2qU8w|@D6|Fz;bnkFiYG9pjx$jH6U+6_G5U~{UMw5+K? zCdT2!r%n*FQeQ)H8cDFzY2cfIiMVptX8qX1*o>a#sQc4q<-yZT*)miquV%Dhb(d{m&JikweMP((u>&@` z$#k*B%=v31(Em7x^)OoGXzl`zYR`t*;qS?4Zty_Oi8nqT;DfnXkc^|g5$1@#gG~;| zzEm_j18Wo}Z?#P5FIQU+s8_FM-eJ^?k*hdf6psRrvuM|>br3t?I*?AM!v`R{XCafv zNs}!91_p12Vj;mQQ=;6b1B=U{8NH+~nadaJ>muL3Bh!{fgW)jeL&q|M%a9dhf}35r;D}}V2?X}RTNzNsfCzudKJ>eD*t68Z6$f&=hYElh+p|h=3`!dy| zvc>XLdeha$SdlPWW)&=*0m4(*8YT63wy88Go^+OTG>h3F4)`1D@RHCX5+yrLjv);Y zdi|n8;O$El2k{&I)W0@+A5)lPbj^~9)Lm4hn}uT?tI$`frlA9gK0uag`cgkFR}nvf z08peH_4w@l>*-3i&RTD{04Z`Ge>F=rRXqAul-v zsY});r&m@W{Oi9Tq2isoIQmObhCnGO7+kJf*W?$lmC`YrCIFVR@$I{K{X65&B?&e> z7iV*W22>Cz<-l&1lj5u+G)83#4q`VJeMf$oeu}U*$S4hV1~R$@J~}}&GQAUIh=%cE zfO|m~i$5|l>Hlmd&2fm#cXURa3k9Zqziaa~9@%7Y>g6G%Q**wuOT(}F%oGeHEnSrL$j z*&lqY{|6n!!kJ$XEw}bknrw>w$v~1==^ebg8~%Su`RN0KI>sf^YxndF6fu~3b4rJM zyKkbPayg;`t}pVrEM=bCv^Fp6otn#x*33e&L8`a7lEiFOseWZH*|Jxt4i$+E9O}-N zPf5%iS2OP&o0v}Py#!Zf;22d!W9V-8HU;5w4$20SwqaSm;+tPVWK5(hFy;|`IXIr- zxYLuAbq8RiPS;T8=!nexHVP@Q;5^pirw%K@pWyA%*7h%;3_}Qj6voy4)A$o!1`(Kc z>P14j>j4HnteM`F;@PQMYs@}@2;2Nl%L!-OcZ_w`+}Y9z zhl2w?y%5JqlLE(%*lbDDeGQc43GB(09eN*p1l3NzN9hB2NPPvyiAS0d{pPWL?^sHE zwk#p5aaNrOA_gt7W>dL?J*uSu-xV!J!f|$m5@l_8OJToc(CTwEK=xwO@BXJlYIFoqOzm%qMG9UA&z+t9jQIhOV#EgukyExBE9S%SMZw^I>AWHh3Zbm3fB$O82 zCWuGZ%eO>cMJ!lNnn6-#MSO$jS2np<44@w_0HgD@^<(k(vyTAbZ|4{@L!OQZ(Hp~k z2ryI7-B*F%c^=z^X0eZ|yiTbZ{vB?8C?pGZLaY8v%$%8G5)?hQ1;Yiqy-7-mf2jW?p4_T8*OR- z;+gH}u~|E9Ah8m=`G4;^A`4t4B1cN#9lletcWuGaFbqVD3kg}7To@dDco;PEZL=Mk zJxehXv3kz&ee3>whk|?Cjf2`8rA+UTzStYrLD=&YRvr%OO=T14;<~$~XHBxv(Afyj zn}hXR5?aq06e)!M>I1rDPtAwrY*3D|PG<;}{2_t0(;q;-Z1d65@gn{1K8*duxgVSD zN4dxmo9T3&b1~K$-E4Nz?Z1hK5e$S20mqsb^lX|QWeI47-#R4X2XY18p;;89nA3%5 zTHdA9$p^rj*Mh8_`#*92J5Bm0A!)7-oNHAEUlWD$Dn^DmXHGU8k$&kItAN&j>)@AE zJ%^`I77{*wC^PJx8%=_Q9S$2kQkWV);ojZKWPQI_;_k(Y`H0R7RJ&|i`P}Zs(rwB% zqQUDT2y&6v0Ox~38g(@OSt6astV2~N@7Ob!A)0&&i8ZdOn=zGSe*ZAo<6C?U$Vv{X z)@rr25$Au_d%h~+pPmvtZ)TMDZnn521e!}viP24B?gwOsl;pc?-wV)I=YONZ?N^ZFy%oef>+=u7H z4+&~v0l$n^5$^s)-2JOKt6Z52#OcdeZF0{RSN0CB24uP^ zBW6Tc7<0-h1wf)p0cmJZz-9^45S~|~b%NP&T}E&;aT7ZgYuR$NLX~AW z1WB%F<9tp`XU96WcAq+L=9@e5ni9r^2wy(qMn}w zw{K^}Go7Dn{=Hse+c$&#enoPE7#L&YYAi$y68ahTXST7VHT~1W(!+F~0;5AH_{gMHEuf{d_Ijh6KeVPu zPl#_aifmgw_KkY)-AwOO+Kyoqic@_z?&4VJO9`>PudWW}Gtw%oK`D6#UH8DAHXXQg zZubLX(&I$y#Dx+E5-up;X|ZvWk;EwfnpV7HVPVvf)^vp!KF`rS9@m#VjEL<2MH(*u z;iLg4skcl~u|5`-c0M$^cn*u99g<>QbiO{8P#<$(pb2Qq03>uO5-KgpPtLSJywS81 z)b9hk3uw>|?9V?G9en&<&DEF51@7J_$t^9_0}coDRTd81T1%+Vm0IrICN2giO}Fme zA58@XpZoPIFJBGvTZ1h>TyRqLUo0#;n19io&3IEk0yG{5OSht8ee*~G`m-W}b^=bJ z54;>-?VWobhY@ro^!D?hJHe)^NAyTd{l5MAXxKg!de@x z$NIG;Wn5f{7jjo8cG=dC1vD?l9R)UGhK|k;$pP6t^#J-@ON&R=2c)+Zbb9hj3)3w< zKF_P+@PmcLCGkYsokyAcS3XIjE?D~6VfO+iUGr!R?ER2`r-9762r~_fx{ajTFXnLS z?hlG}PA)PAc3q0b)MwMqFny(UBJ@T&7P#j)>TS@U=;nmu(B@G1CF0|54P8};z#0KX z4gJSU7=BNiV*?1k&B*tcb(X_&q0rSn*Lz|T&7txil^M~`)B6+C4dqPUSecM=DAR69 zMF{`_NiLe0-^|Eph>@hHE%QLPzv}A9)mG51pWsN=EmnBV6pw)VQ-SyXYYLnwm@C1Y0c8$cQnDNz4NG9NOy>c*ct-ZNf_{h2+&)>k55H^UrIp%)O-Ty*?+>PVT@m-pZ-YS zf0P7@3kd$qB3PV+u|9}kzY)QG#)tY!iu@D)S5oxBJVb#5jV~EqqMd}=1Oc9=8uh6y z>#$Cf_L8kY4`4T>uJeqoSPflJaJ6(~ek`eD+$4hOTyd1D`YEcv-w7{6VVMYORRIx39mRGgUHT;PLi3WBYL}olFaUY0>tpm9{ zH8S(};k=RB8J{)PYh_d^Gpd1QvO;7YrxU15kO3yNo>Ad)7b`f>`x^u!H8@l>(%nIR zAF~D-*M%cxAxZb?;}g{g(MYn9W3`{>G}DkC(8#Y_J^0sJ!MHEy8}b*9m-&L)-kyTI zujEmQiVz*zktt@4BUW&d!CxzZzmfHm`2vT!AcKw00(?EIrh!KmK>oo%{_?-b-&F=z z839+B0lT*DZ>LA%ob()o4QYxW-;yee-H&$it_cuG#0gbnJAg zc~{kdI0f%d7&r6n+|mx9(W^PHOEVXl`@DZx(5E+}{QmSaO9Fz!vbIwdAFdh9CuZs? ze#T}NW=do*&Xw+j@G+`xGq<$OwqDx0l{tC+TlApC4Wi^y0dNx0T{NRcQjYY%7MZ`4 z;p%(aMrjRdbm<5kW2y(6u!I-&SPV71*0OI{-nWqlk#ie%;*uRU7UOw1`- zsoLLg`>s|OZ2my_?zn|a^sUCebfaZ->#RNq%=bV7?Bxda}wD<9?RDPJToJ})HFW> z%iQ$8XnXLfmX@A3Iq%n&)UR1|w`u{i!R<7;M{qBcPEVY=mbUneZKvszgOiOAo>C*5 zkPdh9tY_0ONuEMRTU`<^X=z7uTs59<*ls4h@nrhUv{OuOrh8^Q5pGNoZsyQE@-7G2 z5ykL6Fz!%c!8pVPV$cUjAin>gvn2nbjG@A!zo!iC4>P3~ZjloUmVNuK=^+tizSO0uCn!l1@M!6JH6bP9$S7;lnC18K~jeY$O>Qs4ocr|TVQx%gvrN#=(ZK&k%SHbq;mO^Ia4FHwg))zjLFjB zq2Jpo6`W2@>bB759tVghKQ0XG4q$n$74usd*#|sH;Yhh-gn@i>0FU6}dhKvR#LDcp z!Se(O=85ho%e;Yt)S49Yj|t`(=PNMJQed4V!9GZVzmbCYBnJEw{#P=*J1azChFJOi z7IjPYS3?WUtX(HJM48Cu`8_71cULQbZHbRsbcBZll=|f`P})y6q{Rf zs6AfC9Si{XFx*CMzNe-)|q8@O}eFaW>-g3oHx#7BD8-t9{_R%3g{( z%5_F9?Iv;(jQm{yqmjk;k&TnlicWIV!q>WXjX_*3Fwcvb70l>Wf1TtQTM>n#YeB9P zy$>JC$ccgc<1ci);5#by5JS~~+;`k}7j=au)U?Sp#pwVsQrCur9(8fIeB11@v1PRE zEzihGhb9N=l|zz@3~}-I>KffLW#31NN42h2mw8FR-I|p#eRpyk)V)Qb(+>X5d>UO= zZLQ<_V3T>}tudkqQ`}Jmt0B9=iO|noRz@ zKwnUvueya?2dJKNT!zrptUpgA1R~k{dei=?YG7;=G)n>Fo&?4-4S;VH4AaOTpq({9KVgJ%P6snh5!=wN z$e@lck9dN%{nb7`eAeD&Y!{R$Tu+VX?D6+By!yH{(IE|K5?4$a5%zVshO$uF@-lO_ zr51|xn^)o({GFKDWXBdJ!KB8;P3xke2n{lgb;~d}5kd274j#J~sqqsho@Wq)_H~@= zYW38O%H)+B+C{AW=-%!nH$ZK)*u7`ohKa%&zGuRyu^97rk2mDe33_@^8Omn~+$YQ% z;XAb=gW?lafo%{uQYPenq=6^5WE;aGmqV;aNU@WlqB+>CGSI`XAAD$n3jZfP$;Ry0 z2I4LQMiqyZ|F!$s9c=R{Yi`je<#Gm`^Qdd*V@9Yr>JG>Nelrp=G7|AIQWlBh(+wBr z-goutV!;kksPKVpx`uNf$_R$Y8OIfk%O?EAo$B$_78x-a>?OkD-f2YN_;4UR-^NoOh3cK! z|I~>W$my*#QsLYT#kN2b#h{je%eDnHot*_FoR_GmDG(y<**Enu{dXC1;AV=Pw<)|I zxGPRyTBYM6=rovYEAX_%WchcDy{^C^S7b>RVPa_wp1Ss;3@AjpZ_bf%ZjJz-`EF-B zg!VYg*jCYBPQ81n;e45YTs96vxS)_cVpep1Ex^!bMHihk)Hu=ayz)m`Saw^9JbzdM zFZ#^&*`~kxEV%9jEHMnFvCu{_V3Y?iU?dpdqc}wrG}&>Hxr^A@Srs4@tSbpMz29{JE#Kr;%AaoVXWqC~O|n&AK>CuS z;oxCuw4;S>GL46zX8mX{!G@W>sWI%s^EThdZn1r2(H>b>uxO8sh-l3tM$HZs=m~sQ zGwQ?I0z%*D6H~X(@k`GX#xBmu^c2$`i5Jr@TNQE7(d^a7&f9Mhd6mYw|8~=6Zx~4t zwsWY&B71i*q(*y;nhEp;YJhr&>R9SDsMdo!tgPSg+vyDKYnw~-qlzw4pP}eua~}R+h5?h!W1_(rs~%8w!xe#cpS=#;z;QD!$%U&^Cdp+YzI1Sm&m+H z;eV&ab~(MGHulgnqXxy33bv+1e~O|*_b}DkJoOCqhr-dV#?qx-Q_aP-%GRM>Q`K$Z zK}A!<`VSqO^`A^P+oW#tS3bieafQjp95rW2_EXxAK7NL+1_G33DXUnkq|ygg7Pkm? zi+8Bi;@Th)C)v&i1v(vwmV&Al_wii6v(`tGq@up9gIu&2WeUBCxb%QQ!-yRlc0z1k>P{wC6}4Qj%^%^bA1U7ds>n!+VX%#iL#fTPASfPv4qP=)-=T=;-NSUm3+96w>t=^foI(i?g z&lJ~Hhw}^YO@4U8)@>K_q7*mCYiThf-;4uxC3+}qAE~@q)R*1O-dV8Ul|EVBlVv%( zx@~k#{3uwKa8fPXD>pT{_6j=_V;UShoPRb=;EGq8O#yX=5_;U1W3?7`S?AC#lX!$j zdX+^lhBAgT@5`}e+yj{3KK8r755QS`2HT|=%U@_(UJTBS^MkFY-`0R{yLC?nQ9BR? z_35R`SBW*xSCocFU2i~SvqB5Sh$hIynkP?xm}@}?xSnqVlIkBpYkQ~j*vco^&N-X) zmKcSwMj@m9PW|(t?Wh)A)jkU`0)jbs7!w`3Jn}JdsBN6V=O|YJN}S3|b;VLw+LtZw zJ6A$V<#kxzI6Wm-={u~JB*9g&@n6d!4Oz(*vEU{MRLYxRmfqHa4DCw8m+7Km5R#S}9whCjQzOJw&5YjQKR|y}5el>_yP*a>rg^{gruk zMN{aK+ zb!kD^%rGX&xUx^!mBFTVO-f^!Cp1z=;GP!k&TvM{$ZudfFyf(GUJSCJ@K_9J(9}ag z9f>7QO|>YlHM^COpd97o(A}>$wmYHFsFroRI5~DuSl%sYT%2-`qyc`09pRVIMZXxo zOhkN}``50ZiK0y%%b&w?b zwGNdavbI1%=&|& zz_dK`RLut%8ERSSlpkRxh(+@KaaIUM=UcC!SM6Kje5ah2{gK?{%E^=5R)Gv`aJ_r& z_icVl-lP$%;!<8$UXak|gO_K7-vt^DU%%B~Oia3GGCIgWe>ZX4GF zug5={CB1Qz5QBayw5B4XpI?w^Ol~%<3n&Ljdd^aYKIB zQv84{Jp}GRm16!=i`?h#)2%YbYp)ybu20a`=HemEtIgp@CErE3O)^Sy@Db}a#3jztRJR2 zG{7u-{~C7ucuQ?$NW}XPLYV-|DB5|~ueLmQ=R?B~ZC|7E1sHxBrR4vDlc@e{C zHu5pjuvC5H!ztm4eGQHxvfvQo-wkv)1?J!VA3^L5e0>OmoQEi>d4h@S!5O-%4l!cO zIUTx>%vm!e&X%A6*-HWX(@fj2Q%NZ+HD|4DrRF4Z>e41lO?0=h8jrt~XD?^hUSgw< zVlBkpY$IS};C-Yhp?+RGR30ZvEWpOOX3)W%h6jem0e6eKlvNG0LDyqkJL_sL)j|}b z4q2ftnce0P?K}n0rMr3>`RL)*wkp7PX%)NDD&fh|6g{~;+fv^O?=yPuH>l&4kh4FVOfNaW&t|E6&G}Dypwit*sLDMV}tr1fpbI%LEQFt^9wR+Ti|8 z%mPsr(vI&4Q57oRQrH9_qsikpet2H30M_PWHAjMUu1Y^5CmlT9ruy$x>9j0hf>T1sk6(T(D*EW=w=3Z&hVSk0)3&&PM?g(!=P`Vtp@jlwY1uj5He-H7_R ziZ*=t@m;2Vy)qEEf49^GRAgN7KST(!U;X@gO;KA(U0oes;KO3NzRH_>F4#WL@G8dk zynP3-nVpS!v3ZtgM0Tp^UlF6kIamJpg`BSicA^T@q2g~l+X0sV~C1K;qmc+U9;pOT^7@I z7mGcqiw}LuZ`)0;9xuP`>#f@PXZ!M==5DIBbGRnE(#pBwJLtfY(WG~xHw!XPE!Top47xzQ70B-7 zLG)&9S1U*|SfQS;5S^9KAVy6BK@WztgPh;Uomx4+TNN*?lAf#^*OBy6@88;63* zIV586xZyKi_MBCux$^11owa-iC`-hR=Z!M-eDhl#G7);evrG|$Mw%Y*N>dik7Ju_9 z-PucUP8|ebQ+%7ef0owT^80?cBqwc4uy-5M<@*);(de+M&0UiZUj&4cGa!wdfB6&eJbum5FQS zVjv7YIPsaIlkOFEhC**0G5tUoSfY(E{ZJT~qT~8su-a(&>32TLZZ0u?xt*VE&8CG1 z*4etqzsEtNQo$M+W54<$3~9KN%bKldQ>QU2l{b; z%(#(n~PT8i$j+@rSn&W#lAY8Us4=|L04pMPlOIZ&O!{t;_dzkW_5r!!tlHE zah_n==?fR;b-}XPzFi@Q1utLpo3_I%Y_5qxaej8t<{&WE?ffKEy0uNO%-?O% zW*$HkBuhyJ*H7ChqO(Wx0`~OtJqTkO zgg!k&uQtAaJMRxCj~_>OKPC@>(kDR1{|N~eor^zOHcQWO*Z)D^rD%fB(X@b3w}8oB z1y)`Ae^E&PD@^3}Pg_T{$Qmt=6eczXRSBu3o3zWM`|XdhZ13EcLeXn`Yj=^>vH}YO zr|p{~#hqzQvto|jWP~tpH;s$K0~VP=Xq`RPhqL8(6HTAY(bxvFSEKgVD}ERi;)8M zTYW}fee&qqDiG$T^rZ)Rktdw~Cndd6{H8XY%g3OBoT)_c$7RrL)eyBaS zpJ2TBxWsZtICZqkD2*uWHg`Bwa{FT28Lvxoy3n`z_Bz(43(64gXu&;H3r4SQBE+ zMP{xlet$J{1?ieD~RkEC<}{$c)^9D^a(cpFkP zCb!%0$5*GYZZLVv{1@Wuv&Dr{%`l~1exvu4x}fiGH|q~lZjqUp0e6}dDjb0j`JbPb zf8`RKnKBbPu*$Y7}#%eUvqUKR_Mz>>pC6<*}UCI>y3S~qv^Auc+BS-vu%#MTPU3O5T?T)yc zH5RFub%`7HY5Qg>^fvm9CJ<7#DcU-?ztFFgFF%gk)UYJ7Zqg2u&e}ZrHN&pcC{AT5 z^8HF*Z8h6ofP0BLI4w%E0nnifWm2`z#UR8m5)ICF`!B94@baE|TCYwU#ZgouXD=GwjqLJ=jVbT7rjhmUY~Ln=4RC{k(;3uM zKd4aEDa%8YR}1~yD{17=!AuFSlffIhd$_nk{3*^Ew;iTsv|xyD!&dsEkw=uW)`opv z(_C(=i(~UL(bZ~INBm^=%x-uF;@SEi};Gk2X>b~$*YuwmNuXOXhI%W-Mh${w&tJQ;M}iUUfCSkv9Xxj7~PcHdk|-1FBZ5^j}P!o;a56)Ot51VfV+cd+nL^$`CFge3+R;xr}$L**eVNeICk2N|FgOc)0# zgpUNwffC3|4C)~Yc^8g&fJ8J(B8)oSJfMIAR+l-}(m#m|35?hY%9-}JnQAVmtfee< zJv=(ZsOz?FUx-MHh@b=eWbVDJe%r{(b5t6L2|+5-DW4=4Etgf9Z{G z%HxQ9#hek>ZjY&tTf@ZbX{DuH5tlz2hn;5)Bb36Bo#DF-%@MWzOz*obC#^#Tu*+&0 zHXr@bWTWz^m>jZ9RrlM~I~L81veQjVs!bevMN*3&nX~s>?V_yJXGhRhAhXMEuJB#_ zK;X~Pj-{?@&5?;+yt*V-S@$LO)p~a^kKW(fAUAO>zIe;>qPh8E>GIJ^T2uDYnYDM# zv^!nsT|kKyj!gk7pP=F?*@>z}^n?!V1rq=W>D?06wyr2X9CrtIvT456h zZ6d+)?Rb`%wN6Vww;#l|y3qBAe(WvPDWIVZ}XV0o`S;2Y_JMhagHL88;&j3yJd}MpE!0CDvaJxQ1BO=jK?v?W{OdswP#NZRV6dS-l)+>+$OMZ2LWoO$^Rg|jqbv}o|r+CIDM4D@LG?aHc62NDhlE2`0G7EeQNgw zR6B8KW8c{ohd`bbbO4iA_56A^rY7U(Cu8L&@acv1k@8`)XW3z>Ji<06ThixBMvk3A zq?yw0c&oy*EUz6!@cr|FX(kSvpyZsj0ph``^S54kj+E%!kUcL+kG<80{x@ID%VCLV z-{|!QN!}RD>+w$YxryCTAvGOYW0kkw=pppdq?8xU?q94fOwMjm8&syUq4Njc82T)*xg zE@mEUm+}mG>#e+(jwNc6tAED>)0Kh0_I8$}tDVxGS2X6A7LT<6hZiy)hK3+9^EKVx zYh@%&@%N%Ut#vONnJvZ2NTxD#W)eByyJi?GopAnqY z%bJYF!7Lo6VpL3sS?bU$ojbBPsHX9JLyQt_`@S%86Mo-@LGtnBeojrm4Cnpa(|vPu zvv`t=dsf0iu8J9ruX=2<;=_Zb#pnBG>uXpu4Rw8gZJ-?ZBWVYL@gdtg^TT3Nie)W! zT0isJK1rTCxvDhQ+;PeuldM7>uACKn)LQG$7I!_sP44qx8+GCM zE1mxtpW5$kN!2-LYljk6n~ASbEDtd^mS48P)E_VYSoFyw36R^YvfF-1vvw3( zZH41W5!P)KYupecp?l{lN`|6IBw&$Ph_{s%%NpzQcbGAfdz>&Y_*bRMORC}p{6q6k zXF_3cVr#*@cn}wZK*3e;$q*>uj4wiKPz-X!cv(UjVzq%~xf`)mAc8_4Tr5&OvE@}8 z()j#Js{*4cC`2VsCT>W{-)KDbBcW9kQ`qDAbLM)&zi*q}ecMZnDA|E)EcflJhSv|) zK9oEqEw4n5OAh{Q#agRXSyEa#+UfB59lO)AcRTsse;7|%j>9k7Z7+1PQbF}wJL%Q8 zTa{MJHv(}UIfAdVVI6bhrOiQWoO>5wepCUV(ES=NTBOB%!U=OGUB{#`VW|7rgnnw_ zh%k(=p4-O3R!a$lmLfly|7mruu#;a1_;R;@T$|oK;?7P)c){L0tWB1J>f=Ok>b^l5 z$FS|ea%mqUiOxm%N;mIlq`n z*9uWAI;fKe6_#C}Tx-;8$t<($+ML@bznn%MC0^Qy>W}H1lW-hA?l0l}jTmYzA`0Uw zCJ5^=!aZkc^-A}JbeXCC~_KDec zOCE-mVaORVRWtzPQLEfh0iLHm%I; zfN|zP05(m8M3K zBV3=Zm^UMP|JbpHrc>p43k(McVy%Qvq=Nvr$bj~YwpW+R*Cbrpcd@eXk{`fN!Hk}` zF&g*4W8lu3?DrsZ2{0{){H?|I4Jr=COsW;;)ImP3I-&%Vxa7`!(6sPvx&JKteE3Db zHh)5&p{KNew?4N$5l7g7EAw3T2I32(aD&N6LJ2wO9707?XF{U^hCEXbIipS5A61Ez zt0KBO`Bai)BU6*xS?V^DVv{3NJKcqOiVq_;%xu7gdxjqqEYUe|RlG9G!N%TIFhet) zLE`z&4jU);$QCZOu*k7xJaC60HXF0G1vceE+<~&5ISe!6&U44HgVtnAMZ<_%c;n3} z!<2#SURlkyqAfOVWof^NIjPX;cpXT@qt}_{E#Zf1{zaL;t@zEX%i6-xrRU?XGlUTX zKbLp$2|f=?LMTKw1S>f<9`iU5QLWs*ps3}ib0uJ@oyEcX{?HXY5hZvCaNh0;C_t9&u!&0@MM5_8kDTjr46ZrPMA&mL00@ z_j56T(owHS<2=M?y!uoR<1&O|rzPVyXLlNU#0?lB?(r6{gq`YEM}5TSjnM1UhPC6J z{Y_0mG~&wsETp-eYn7eCQ_XiZt-RK|va4He=dlZ6?xRKXW|~n>U2tYx&@Bpg{@ z-TJK1P4*zT$xD98;yL==(eeC8=XID9L()1vj!`RIjR!%e6XH=?Gf$rGcTuHU&Y=#! zga%f#WlDLDiVb>qnV-@@x|axwQN0(D*G(OEJUAQ(vw54Y@Z$~7pQg9D390qK7-L0QcrfBDM<{B0WE9s|#yo@;o|h4eq6Y0uQt*71dS$%Y{@TGv9KUKR>w zuD0vcPrZ|MTv-V4A{34L5rV9d*;hrK;q`~+T7j2pcS_}JjZPQm3Bxa6{oD_l(O_#t z-!96L;d~8n>ZC0jmEX+=EfeHYEE9J$j`u+uAA}qNqcO!7zVTTE2S*U?uR^wesb0c= zT&bNK?(;VM9Hcm_V@b^3Yv7`RDBSz4Z7Vk6H^qV@c$4=;{{AeWS(-Qm*(p4-usa zgjVu{y>FK&Ty~`Io?^b(N^+>0=Src>_ART-(d_-`N>hOM`r-7sm?lYPS(nrEZLFrn z&z5R(KzD4}@_LwOM>nV+S%_l>$KA?1iE445>ol1(UQUh*cBe=KNN5)F4+?2+8kEMW zE9aDmr|u_;cy1_IwOTb%SFER!#X46Hpf*+&lrK{JVygmfSxJ5bvKp|-&#>Pzo)?d% z1ExoAWrnJEUq}KGIe+&_sA8bUw%ls~(gG*`48WW_ISJ$3`X(zm3R75C;x?+b ztVIw<*X3$`k$GEQTfp&ip4D&KoO=C8arwf6x1$lUTMJhqqa`<7YJ(cNhQdOiz0mxj z)*^-oZLM|!GY;&$+Vldfw@WZxxjepPYDH&cn#iL)jydO$A z$R``5u6<4`eZa0do@`C*8ffV(mb-n_Cqavjx`JTWdgiekGGBie5%2Ua7&_bJK|6Bh^G$lWjEZ z4r-43Ey_yt9s<)wpmlT6JlZS2oxrWg>&p%MrEAbj*sYJ*y-C)yVD5-CSYeowmM8Bv ztFU|2D(cV8!nfgURS9}DF?-Tg$b_RYkNQ5I8u zi1#{;s)VjquG>Xmq<3RIOkbO@*0W=%^| zLqnrw%dk;%q8kvA!lHW)-I0^hBCRGOnK%MfRlb+3(DzwIyEgN=Hx`f^$)Jit8q6jQ z_9~n^_+!ealB%%XPhf-<%j_O9rxF7aV~*-gT+ULP#C%G)f1P+Smb>2S&$gJpZ;1DCOTvBG(9J4JBcxOv zkH7y3993@iR*Za(&1HacbGWd(A@NV)o|`?*{#>ALFN=ImOZ#jmeuHk6ZG#pNZjInSNx-7 zfp$y90fF0Z<-}|7GEKY1hOpg|kQyXh`ot^xPg>a!$_jgGv-~VS_r88yS4wQJkqJk& z!zCI#&7D+y6uGlsYSOnXOZ(Q@Fmd7<{JrCv4VgKPx9xdOzk)f3m*shm{{J6uz3soK z1&gSlX4XO`&>ae~M6=Xqty@s-rc7KkW}S)U^Ruv85?FuqAH+zC<`nDeeB~9*2+SN8Q%9a&@8JHH zX~G-WYvk7@Y+_bzwNnvLxmU0R6S(JlqyDms@&BGfyZioX_R=8h39alf>$`&+%WH|j zu&DYeQO3V#XoxGFvg3szraWMw#x(gw;o~2pe7(@oypuVi9CHJ| z$qJ!f^~?gEW=*-dkknx1@{Xkytl3f{xE+t=E#5;ED;_5h)RO@&gySSP`-C5^jItAS zM)a)2;>u5lN{*Se5Dn7P%Zz{}U=^DtvqxXLT z;rTPAMh`@TFM`OvBmnP{yf)C0)jD2~QK+mDg6IM6!tyM}mG;q9+->H4&t{j#k#BkX zac*=^>9r&g>X(kHUIMmN4GdSOPeiSckMoS^{PM{EV(hJh;s~Pk(HQO$2oT&oxI^&Z z1a}GU?h6DD?ry=|T{pP9yDn}EyEx0^-uvqPe)rb><5f+4^-Xu5nyH!YGd(?L&bMg0 z(yXF8*Mc+2WB4i{bJA1-UIBuskqv8LOu!zQkfrWYtOT+)BaQipKdx5J{3F>8qr`-f#~D)fU$8)J6x z8GRrBa0mOUiL}=VHKq&Fnm}?_V9*G^@o{Lu(cT~}7x-}@!nEe%{o|z!?;ynU56RNu z9a$_dehkm_-lwlTb9)NCVMYbP>~5b#F#IQq)o;MT{W|Yn$b_!B+8wR*TQ7bjF0Cye zLAf8Q1j?`Qmk)~zoOvGc>r-25k-DVs4mOz^6+2#qAh0I?EhTTJx$Z{RzL$G4m2`&o zn^HgEsw_2Un-P9w^`m2%zZ&~48f`CEhwe823%Ga>%oAV)w*NgC?5A9b-FgZW@ z=T)Zlmv5kpt%%pzb_*rOoeM)=TI2^&uvCO;{fM!~MYn1~5}iD3$?ELodr?Ey+?}Lo z-uW66SCQgv{mV*Xm=HZ-wiaH7ga$32FCV(jxU( zX(=8GJ&m|8U@{>ctmszjFWApketE4=4K8;G`aORKH!wo3O1w9PA7t7f^Z@=#?A+a8 z;@+>cF@AUnFoT*k5VU=LlNL9jJFV*OiCzZS1OzsP#6ggxUjZ;~@PORmQKZ`(@1yy2 zK~XtL{MIi)-{^wZ{r96Y_)jTVk`zFfCV-T%3tJ5AV)yGyOeZs|uT%^yzL`euH485x z;fdpRh3|1}`%xb=9(VT$0fh?xS{gpVk36Ou^BwS(8*Jmr0=03Bnwr}aUYPO<&+S7g zC7q8MI(E|W{H_<6==hA*419Or6MMBsHo*U5#vpAcoe`yQBaBXbNlf+QnAu&qkc5Wc z{X+j#o=w%}=(u}X%uyrXfKSEW*jqi14U%hW|CUEde``k)>~jAdg(razT$W%Q5f~Up zNf5d>a;o0Do!YyPNq=pc@}zX7r3z|> zvfK=BmDa{p#kHq+PFGv=sB?e9I^qjBa~k_a=vF1Ii}PFg9ZlMkK($U($RW~W@V?i5 z=(7QU#57CQIl3Sc;){--2&r_=W4R5fCHf@X3odw1k$2N-Uy8d(-l17Z&WdXvt&{6 z%xAr1B{B`di?s(NmY0~0{?rlqoK`A@6QsjHnM8ht?loP?D{)2M^UW5HEdWQuIM$5I zX#$h1KXWCnZexgQ1V^JpcaJuIVO~!g!Q_XkIi4VVi!(V$gx{A=c^}Bw_GfP^JHk#` z*2)(6nwetg=C)fs^VBxlYJ)IEN3w3uaRqeFC=#8+H;AJ#{^6Hn%KErRkPAl^oOj9w zyQkA&w?x;OO;BoC_KWEiGO>j}QK#&svjeI@0f2?mGh29Hn5a|qd_9-)O~p4#GR)1h zKOF~^M%LX2Yt6}ByUbI0bx32f!Ck4gfh?tZOq*Fb=sWlayzri1SW^gN^+!YgtfsSa zUw)DSFxh@iC%S}Sxb#o5tR4lCud%EW9!JjVd$MrsoeNme6_MxO()T;xBf6DI?p~}5 zdSi+LDen4YRb(DiO25fy*GCQnmBo(4IpNW7Vv%V2;^~QKRM^cb+69uct(kkMG+6Hm z-;h+`O9sj2eItyvWxK4){+9{nFVpyCCyOAz4xPS49H5xjCU!(%-5Y60r?KE{HD3uh z!COxvz{{X*di1L3#-JgNFJ#dO{+#$1osB7m1HqZ@?|X$GRvH)@QUbLXyZZSQ#70{@ zrSe`{Yeq<&QNI_aej2IaScny8rjsolbn;i(tQv0hcTF-bz_3UwqHUF1U!d8_Sia3wi z%NX#eg-nnr>#H{R7nwmIR4JXX&0MqCL#0@b7)P;#DK9Mlb|coLout?<{+9YdNZ*dM z`CT^bvTN0&-3$XVCO?EK)Ii&A-hSyn1JGei&qvHb{(Kb$F*zOa5gc4hJQBh_9ef40I`Vr&Ssu? zYU#Ls77h-MmZjU#aYwU@x551b~Ya3I8ekP zgzh=k-`emU6`7H;G6Hn^-QHg;is?@i(;uq7kSm;`g|QfhW+c9h$Q`O+q?-0AQN?L0+{2 zXYYM_4QhGLJ`$L=;-Uxj?HKTW6b_->{=|zn8CJ2)uI7lk*puhT0KgFW2X>_S8UnrI z1|Z=7Te!k`Mil9zc4QWOAKT+LjiSwq^tes$xZ~uBofA~DL*R)g9OUPTl@o@)?fvDq z!;YyZoIzl!F=qGgnr+K83=*c_!+7c; zc4YgCi11I;@f!fiuup&a_g*a)<#O=E6~Z&VZtdrxy|-Us-qY@?v~scpjqN(O3ReGS z+?8!*uMVu(wQl9Feh>Ut(@IkvVzbBJ%2FM6x(DA%ZXZmvN7G8L*gH{+wzi`l^$V3a z$^^mv7e0-n%le0w{whbCb@-N$yPc2nzmPlX5axIZO19m3Ker4KI}%>}nR9|)f5)>c zzm8(k z$ppV(^oWDM34V?JM+v4AB#iAb0rLuyDE-3$Qwb6%^{9e51&OErae$cwiKcp7z=DFL ztp8BJ6rEpKd*s0EonLGIF@haDKO00ZZEt~fI?-!}h_0kMksJnfuQWQ*9EJq06gyEa z2Ys##Ix#MX5UxZ4h_3+{dzANd!tjT?d-tD&!Yc6IN$yMr!weeQ+*ev|G>-?RAz=I&bD^Z5lB?rPq1`2}t5dfW@aev9lX z-E+W*{Cf<+BKJhF82@d5u#$fT1r{59d4ad}U#IyWSl0RG)_EF)N;sAj%#w0*?2Sy! z(qnVTjTBW9jB^Z)3{_GUbA*jFRgyMy{EaMC(x-FqjpTL`L~}Ha^a}YCrO~VOvTV+D zip29W`bmE$tWZ`Hn)9oyh*nb)lJf0O@;DWW=^Kd^iq5SNGNc4%T{A>EtY|YN8?4YL zin6WnSCicfycz}0MSW%s8hOse2~LWb)<5y6lD_qczCK5kb>!H8~w6(cj}4>Sf#Sti{Uy;%D5|3)tiIx^x#XDJjv zQs$3BFQGj8!5~f^XA3Irsvdz?v zIT_HfL)89fOO?$e1p6)Ssd-la&fn%2T%!@pqW8wB(lD`PY3%mCBvN zhfw=U8qV=Rn0=+U<}e_XFA^eiz+?Q!WSBT`<`RPNk_t05GW}&f;HEc)CKyA+*Q>BT z&b&Ul=k-BpzsS?dAT$*O^7JwY(A-bF83ZluH+k9_ge`%fp1zyEdG@0{ zO*VshKr)>KElvW`e1qsiZ9xKUkvN@v4n4Zp8l7AYeQVAMs_PR%SqCG6AuW4lokExY z<~*fyCOJH5F8doixu%d4MmZlhRl509?|Ep{qK; zSJElkt8f5z?s&;n8GtZ%(&8!|fR{UQc-00V$(_Q#3ISjlj;CG~0SF8yHLsGNdAcKN z4s7l(0nCO&OE+i$%B_B$8)g9G)?mvGF@Sb!z~e>;z`8Ybck}U?Or-yHJM00=FNt(- z=mE(uA$Parfxs^%ckl244n_+cW(AKuBLhckz^BiwZ^LcB<=)OOYzuUE@B23D_G9l& zV8J4wse2b#AaK9t-Ub#51YO?yzykdDbMGx+Jg>dLYyW#5SoZ7o>vb+NE`v&CQn@O$ zTr^rWnjt?!t-<EaktR0dqHRJ?>_QRj* zg;#W4@!OyTl!OT(0b-l_({V_qsve7s=8WPmd>%5Yizo3H-C}%+3yPF089G~u6PBsI z0Y~5$i%~zN$k4{^_P|VZM}0~PtJA5fGBhjWJ@|TIVqW)X%M9#YZp>Zofk(pHZb*5f zbOD8l!di$qhK|17QYL-5D6lM7=hoTRzRN9y>=KdV+tS?@fGsi`$uTCu&- z=5z76xZ_O~$#l5epEFy7Z_2J40G7ndn|kOR`-<#J)f53a4SoCubS`jVm>{qC;Sa+h z4|Fa_`(c`imZiSH&-)uAX{E6+haO#WWXO(a>fFP7_nVJs98|M`68w~Z8jU2zqIzWg z$W$v)LF~!Sa^&k3xu41K#fP1cm^ZaW7{9Z?|8h6dWzV;AxAc&Bu)NZRi)UD!dU!!E{4WL8I2uLim!CW>M<9d~hIYGj0h$ci)}?Qn&N}g3wQ_&< zcH_Ere~{LBzjTuI{-mV1u~m;*EtfA2Y8q|r;UA|1u^07xXVu#1C$+o8PRC5gO(#6` z8E-3^ecl%J$angiroC^DBHk4}7_d05Rmr?+iAN9V$66t;S2ax?E*wr8zWClOEjjps zAo<~EI%)DlUF&d6yEC~VT@%C$#`<%FG2MVForq-oOB0`v-nDZ`=W&!=YEVhEDoQ@r z)R${l;h@R&I49G=I04Kr3J|~z8=@P$XwkZJvAwLhB^}PR3@=(>$-#s8+1|ng0fejQ z{i*vfDu%@~G4K3ZY928oXO~!qH(Kv+b8kVLT4kO!qA#OYS@K1q%U9!~u^lhKbZXY$ zGBg<_paJ0>UKJIt~RXi4Y;1o7)(mwd(t1uH4%9J234H8xPat??o|r-Ifb;i z^Q}KK0;l@?0NSrpmy4evy*yz{ zfM-KXZv0;Dir@x~QnQI^$JJFyDak^rub{{u!tT}{RL>&dg-d+hMnZ%N_$0*Ua~Tek<{cvxDmv0ZlmuU)5}XcPmz zt9{7>S471Uh(LvJ&pGaTaHW!%Cr!UF`7P2;GN!?QgE(khUw$I)s|+~z4bpRy9%RC4 z>A{7jezFH8{|UiLviF7khO*CYW6u}XhWBofuO#VPls9v`BFwNk_MGY%6kuaIsU3QBM{**Wdwg(&6%&ahwg z&nezq0R>!(oMXqQ{{?0l^y%^B-!xnbW|)&-8f;e1i4JqkM}rLNYU(;$jgnN1aFcx0 zCT+XVaNmwj&c1Tg;n)?>b8Y0}H7!yL?_E~5rK`4(DF@SLWF=1LX=77m!oxdUhdBq$ zF!W(jMy@h_Ib&p+M9`^Gs{T3tcpVTKtSpDv^q5G@rSE==o zWO)|lu+C1hFuGe1inwt^JE<~fMqVkG_zYb}zD9698wc)31yxS>jQlzjI>I-z&|g>6 z%AD5U+0wYOM%oh}U#5~Za-C~*A+h`qG9fDdg*921mgp6c1iDiu%-3oP4Lr5YBv-)mRF={3dYm4Eh)z!*d|oA~!i0cojnTFd~8!~|lf znCP1=>RqEb!w{m6O&KNq>l!HG-KhRqGqkPLYku>#ss6TY#?c1I`zmpYj(CbkY+Nh0 zI-^Xjc^m3N8IasEjAEpF9&7n6f#3_`{hN4}VU4lyreVjmQJ%^*&>T(w#RnJFG{THE z@$}~LDM*q9?~y^fueeAJtW>979?iwBAo&`cj+RomGIr!07kk)DA(LfcHX1IMdWb(7r%jK34xftBf3x_0cx;yD|kn)AYw}ovvRa6knTOXx+ zx=8tg6kjb+#1>gpP9Fi*%JR`)u=Il=Qp7)=Z(MKfK6wAbykV<=d$U6VZMERiC^Vft zc{4u<&;Jqqqo#T}g<)n8_L-`CearUdqNB7(Kl79JUDq&?x(^b_F!R&#UDxti>XUBY z$X#2;`sq;K{3$eP{Heii_hq}nlwzUrsnc4Ur=4oUgJ7~vL`|;ka?ZSSUBpkm*LP_F z@Fc$Dda6=NqnE183~DC{Dzst#(ZOPq=vkFEe@aX~vScp$7;TRHeJve(+Fj+7PBQy+ zs3^H5GaVeq*SJN1HOS~hNDb3lD%vWN8F{0@EDtFP(b}bov$4j}DNQo&dRkXljchfW z8OwxDGGAzMRKf=pKY}euWrjq2Am3vz&3PvN6P!tCFSQA~3Nzt3ts1v?9@EHy&avfS zvuB_|6M*wy+6VRypoZAN;VfSKRyJ>Q6sK}koNLrde14lnhT7=j-Q_tP#UV=aj6#il zef#lTG`H$YJHhnCUwg<`E<+v^SCa$uW15=GK>JX)24x<}jU-pqMFmNoNY@4}9ywQz z{LG&~D=F@D`z^5EmcB_BUPe%F{2J&%bbj^N~O8&*7wq5&}rVWtk(wpu_50m4_geVi{wzw6!>Odt(SC45M*M`d9>z~ zSbI`0B`7ygF>t!@Pq#Q!h-bvCh~Mb6Ie>{CgfU?sEE(T8=lRQl5&J%g&HgB-@=`Yi_r-#)8;MZvt}#ISi_SWwX? z#4%N+Z?uwCzxku*dKw1OQ8UxNlC|q$Off2wb<~r5Q#lC1OBwPlOa zSZR)mDeIph?1|b~%tJY0aC=o9EiY59cgx7MNu51FD0&N7&&ITgJUMJyvwB*uvkp@i zs9H5!C{$O~IIk}Ic}i|AB+(RR2HRSwGeGnatvF=^NLTb#7|dmCl?9$Ny#iTmCX`Ct zOA^a#Y@r`rY$`sxIN7+{eN!ijhL?i=vSD$8x}X)2rd6yPy#<=A>j=^lJL($%(N0o4 zMP+S3hS)r-Z zO)~fBT6c^lsdWRJpESiCf7xl+wOG%WvsLhGMC&&7m1k?5*IW0N%TyFsuG%e-R1{b7 zw-xiJ)R;W{|A0Z}kydJg7OK4z)AfWX-2^8&c6*usyO2Fn*PJ*-+~P;mSL_t;UP3CS z>|jt_?LVXrDw$JqDt)?sNbV$itsiKO*u{m6^ZOC49Bm1Dnu2Pj%NZ^>Vu*>Q|(FZ}vnM#~9p zHPpP_-LtcU>hyK_$cBH;(E9H#a9}+z5W2$jiV%3rq)*f$Ov6%nwD#kbHvgn(p_@>C zsr#!nI`p(BY6V}yavaHnzc+i*v4nA5CRCuzu|!}#JhV%)Z!n#U z{X@;Zo}F1rwNQPeF;L!>^}cdmK@OTQ0?7cS^tkHSY~>W|@(ew{O$`-lUl(>>K`@L4 zhR~&V@7}$C_vsztJLGq`?@-ZSN-mdAw(sqVZ%q@>;);%e0(AXXG2U_&l6@CNA`6 zCwYnNGkxAcAoVGfPy8d8Fc#j>X;ZDXE2*i-U>euB;s+!yH-pTd-<77wsCpdULG=9^ zU7F6CpJLt1QeJMCeM_v<^*wv#^8ZSzXiv))+KJjwo+Im&HL_Z=9V<_d78aw+jr#?pG<;tPRU|E9KHnU@hMHF zqU?*c{a{Iv+sAM&)1%QGPOew3P7oPgaE=yakpt0tNu`V#78w}CrJ9CRCP{fIY{v0` z?5v6vE=QiO0}A&|9wda5r>H3nWi(*aeCkl0{34y=&pKu2jX@e#7U$&~O(nOB*5@T3 z8>JAAF^P+t_*JA&wTNqQTp2fXT4wCrA{6J2`BnYPfV1MzZ$f&p)0A%2Bt_DvY~Gb5 zCBVf!=qI6{O0!!>{>T2OBagZ-**W<)5Vh=@lH+6V(3~<92=_|^OfvQ8+&gTu%;R{& zJ9e|;?)XKg1mh^^F;2KL_Nd@7O}JX=NX1trceVsdpkF)&)qbfEE`dIFcK>BPkz4)C z2r<(ytFbKTF0W~0$M-;5T5R$l)~8(>aB~sTV_h18y1i`R+5aUv3vD-kTV@3fwmMxX zdqe_PG`dqG`iZ#YBwpl<7fuDhHL|a1X}Vy?=bipGaF`q^Qx&VPhz3bT3|hECBr$;i zho9zibwn6*r)sy)Lt8k)m}1NZj;_9+k|u9#Wcc*xD-HO0)E1K1*YJ>)XAzDdK8CYl_lY?K%e(ej zxpAy_qds$tMw!BEbc;R{+c}jLy^GFJuUYBgncZ8Jn+FmzFaAZe5s*v3G0G^CnjuX0 z^zLQ)9!UeC3{1X`_L%peo&WmtIapa7fOt3TPyn`ExxQWj3++||-2HN{xm3qUK6Mo1 z-&h4i%RPVcCh&emS2~;IFy2QNYx7Ya+kO5)wjbVtQpQ|BkfWGIB$fpo9Q~z0J;_|j zBKFK^?&Bqy8BreL_c@WFSo5p0lgfbEgAemV@0?A}_JcUiLO4=5D4g4pBRrMXTvuyy z0eAN#AJZK0pko{%1G8^!<`R{8sO>E6T&V&n(igfNrqgRY+4{7vp5)ryS#_0-=bFZ^)A5X8x9MLbbbv_OG%pgL ziWEuWr9o_hy*T&5v|wZr za4$UDXf)Lz4EKMO<8=4Iog!%sDbl>%+h~ETT1z-g(+zKJm04#aq3m6HHS;0f$p%$R zM`(|<`h`3vzq+&?n6L3{p8MMkc4eOX>fHe1S14XJSMA+-3Xdr;g-odaOPF6N{fn07 zF>S`;6qNBr2RM^uvnM;@qqZ%=fI?D;Ogc-zI{R5WLf z3>@A%!hfQMx%-C!$Ce%to`Ya)udV*QtWc%LlIOYZO_58@`_vcN*Bqrs4Bt`zeUaOW zXA9vyAf&>VCE*7p{sUcvY(Do-E8NI$(4T_kf3Sa=&9hjOy2Z3h2^ARpyew5xBZkJp zOK{ChTWYBhMaK+Em=u6#f-QeFsyDiE(y!8Fd{qc9mK2bfDjsi<%vP)yf% zraz8YWKKo*C_?a_(o1R3`>aDtwSJx>cO#!+k&u)W4WHN`!LMo#d$_XoWEs)Ui>S!a za94j5?9foPp_xB2*lE|}zwThTqXyL!CoLq+YFSEJibl}R`ngxPDN7xSp+xACur{*V zd30cgX}H={u{CI14C}mxLdhgg6Qd+Q5H098y8;t7))|jtXd4_&Q1)Sv3^4 z)?)CW)7^4e?5OWQF7-=kN3;c!oSnM$tWnJ@O4;P1OXikt&J`D}QK5y*m!P&sWhG1E zbFH*oBwe)Q-p)c>gU%`p?_u?bc9OiPrPd|U@_bqPyc~JXaCf&PT^BhJ_kN6C(7N<9 z)3t_u+2km50op{!!jk;);zjRKSp6wyrcL2cSuekiPFm(}auN4vUd@OYX+qMhp4Jc= zWak%ATM`IqFUu}F{5g$NH|IG`9apM201#csjW^g8?=7A_R%$1cCpj_yir8`VtcTN< zS%vYCrR~hU#&R9PXK5wsm&CqBSoANV3oHfN|58{ZliV$tweQ{32yH0JTJJ09Nnsra zXLNvUCKUXp`cVpIOt}p0Z`Qw>hq+UaEPTh94Z*U_kABb_d6q>lsvDHMx_Zd=KoOuF ztF~IXn>cH)wNbf%bM8*-7^rGgpFSfDH!RBSu1!tg7T@fW?=Waut=H>HawyVoazYbq z2uw=7VH~**iFZj_|EC_Bf_rxR$Vj#tTj zHw*eAjEy5Xj6%Z;dxC#%Xpfktoa}f6N~GVp(8RNA)cDR;oPSZ}|6mQ#)KoL8vEY@8&dlA%?hh zeEhJbDHA&hN;5S$cwH>}58PUWC-RbNyj7A=_S>f~kw8e>(Gb~Cq8~PRr2mHQRqbLz z+M*kRx(lb5D+%CsCUJfbGLQgJgVp;rDVNBWD3**T9LTz{jD;anNiD(m?xXEQZKLX!3$NEmJs#k- z`|Teq3I6s(xklfIkzJrsk|+v(APA2VT^6wa3W}kFItCg~hWSj04sp%PJUNzP}%*sv?cktgz{T&HLUFyAB~K^L1oXVQu0 z&!06%ec7*+ER^=r-adtl{LKs}=@pUQAj163Bi|pFk*H*LWMJiA2NdN40x^=LO5I5P zI5KO3|4ccCJ4d4m=oXKCEO`|@l7?aN#y_(wDE~&uIqRLnEmHT8|Kk5)AnGyTO`=Q~B zBN6h=AWx;;E;1@+RqBe|8ahW|BcfBXKBKBjGgg6%>DnP^8Yj0=QsiN*Vx5o2uyWdflrZpFH)iVT4}5_6;<)UlYeLNH0?F zO*JV$@=rQWS9sdPzZO$4qs+4mwtqr@EESki`}qgnYdn{KPtNR{^O<>7d`7=!Ns!p& z5lNWE_@mli5y#1IQk+Zq)(iG+ZfNOW@WDL&d}r?c7sm3$CJ_!JySggqncMti)AcB7 z(?rL8LI6G(MI`V?+e~4!=#ZfaWkwy=#PT0=caYfIHbfAa-G&K_@3-e{5GPvBLpz&> zcenf~&=^3xYE<&@+{T}ELUcvFLzQEG$X)9~wA_ZaoM`Uu@Uf#MU}NpKkkw!gXG0{> z@&MY|F1)+b$Bx$bq)Ct`%*(J1VMM-957fP|>miCEa-dXDP|vmjF1zD*`Kk6ro}KAZua4OrZkR;HvTA-0}mbdjmnoO4Nq!pgp(A&7ApZ>aVtx zU-2pIICAOXMdQ6H9f=^tT6OIU)3!tqx_dv9L9P48zkxf2Q4%y&W((}t&ja$Nc=ZDH z2-u!BBvV-tp!_a*Y~AvuhQgF46^YjSgcU9l7tLLptI*;(g+L;-BL9 z_nk&3b#osBp=CU$4N*Q*Z;zN|ze)voo5Y?~Qz}edBU!-vMVg?Z5hF8ptu)j{YD!X- zL+N1#Dib{FAg&Q38FsCBRN5J)l4&Nq{7t5QtRt5~5xjg7l%KI~rAu3J?hN(+D#hVX z<9gUlYf%X*Md9V*dazAvKM_=ZhewH<8A$5+a-?tm{-o|5RO`1l)Auf6{pAM-msips z$l4*M@eWtopAoy`RSi;b43?7#+)awz5Dq*Hg*wV(^nXrOmzvlRruh4-8XOJ4jg4GPX|wrL(9M$t&VeX%n!Ir%tL&po?|hr&?8R z?9vQ>JDWXk+{YDtcCVHKFdxa+oE(tBuC2E4>^SKmXEA31XEtZa3Ayo?Mmf0(t62A= ze1a|%&Nxdvlr3Z}6fNW)WFF)mly_uz6nErqh!(EA^p$Zm8b5Ft3&TIp_9I*U3gN61 z%g`cM_+N{$6e|DFXh`5N<|DDlu#G8Yz+!o8>(4rs^hje9Bch;g3GJkwsu0z z&6^4-qV~F`0>|ggv^jzDlDRSC-;H!_9fWQhNHVo!Cn{ralNfBJeH$^re#7t0rBCW8 zq08})miD}f-(1umR56`c3tJ|%7U1nf$qqiAL6&XZjnTc7Bo-nCIqaAcymf z?{Nc9Y)XFVA0Ddw4MT;rJ1?(Io6Rrb2vMF`F}0S10_r~)H=Xr>-JK2gKGT|nwV-ip zmy?wju`C~!9nHlP4D-2L+uMU}Pjx(2wr*9x!lReDT$gMSTgHuNxmOpz&V6ruw^$p` zGM}G<4!L)_dUQkX;QU!TX)SdPTM)G|VEmmtCxQ%O;4bp7J)yNZTRT68zCoZ!kE;Ikf)^B5!COUj2*3HmhuEnsX z9ispFxhmU9S}1N; z1HiLYsO@02sG9-BYo+<7u$}&o-M9;cbRGtlGsn57o_JJf@SCgL;ymS9C zVqhI5)V2@1RAuLyhU<_a`c(#oxutdK*lC~1x9sEX+zXlZ}eT2=}? zB#JZ7eD%HsGxy8M=++lEySXcPzqoV~yiC~-Hpu8UMQ_xj9>G3=fwUb!*kds^0nhVr@n%P1ca;OA^%Yjq?7;eQfAedOFB-pB%4{Reth2Ml z{Hq)Yo;EC}I1lXW{9UjCcIGecGg3@z^%%&Mx%w@jkR;o&2!}fRTZzb~L)3L0=?Cvq z*%ezZ{7x~R8>SU5A%<})aX&w9>w1%@O=XscfMRDi8Xnh8C|bQ$M@PA)W;n{|V1zTqtb={i1c1x-y9CVbZV3y~xN&*Pc4?S=s2es} zU7=}dcU-8=u`o2egUG@Lcirt{V%LI6in(tdNZsMf5@s^9Zq`JI1S9=oa}zF0E0_;A zvB!R1znm~Ai)Cvk*1nQzZ=r8?y6E_E3!6hxL$Kp9Lw!_nFNM#rVgG5r-8=u5B!g7j0IQgn;7b*E3or+t-6! z*lQ&5QS%BV=46?qfQ4_)(HaaA=8bE+WnLAqSh8l{n^UfP`lzqPL7c`>Yf(q~x}|HA zY2>sDTeDt6Rr*E3(81k=t9Sx!{?*F|^b=~xG%!?J^7)|fI@Q^>e3bE{x}*1|e^!=J zVN3WF51{V+ag)2j>abRU_pTUtV`p0I7&vTy-EGiSw_0_63e7m}Mp!#%FnL(btW||ZR~3`iPWh+!*O*nVGQDcT_EP{u8DoGuKHIKK)LD_EPm7k% z8}}PI06T|7|I6mh7V~3;wYpQEJB`|?*Mk*QCRm@Z*^ZF*W;N5={fO}%7icTpc6`hB zcc7;KVcR#|=TN6Pq29r&gM%CS(~Q+4zDS`LC!{Vn|PaZl2tk5&j=P|g1Um9e#*?jbq2G(aT)Qo#%rL9#rcr13}Z*<;V)<-w3 zYzh_g6ul4;&s{6j{)F0eDcNj(VoZ1msH*pRBi>9){~sxf{tSmmk0Uf%nM2z}yv_TZ;JvqD$UI=8m>C~mJ& zI?Y@ghpM@ggXRO)oj;QZ`A|-MOH`sSh%B890f%M`E7;Bq-B^Gxw6-hjM;gVeLK?%( z{#}wAxiL?hmVH6e)k0X`zGB&4oAf>bpJED*AEQ6@v*HO-$uLT=*ERNznl}06DBvOP z3gO|8V_7AI9!)L|ODgIP@`J3ia}j^^zPDY0ooW0aCk>Bv+n`w;O=H1&Wp<;KJ;s(_ z9Ia~_dSXeVh7HJyxQr4+KwMQ|mL9WESFbm8>V93RI74h^b`KxiSr&Hcblpr+Gc<9IbfA0Lt)>B(Iwc@>7RJ-qz;jVMUrJ z>etb}Xkt+Qz$GHrIw^0CJb8zOH7oFjH?a9F-q}g#nJO<;SmCH@4AB>&?fbLhoDuUQ z^s}!z!s+R%y#FS3)Pg_e;Bi<+F-GnwetWcEnc-=3#zK~&(`NDss^)>Us|C+8+Kl+d zHy#xX50iCIp;0>!&9RexeP%gr@TI`fh`ltAoc|$SD;)n+_TJ=->c+zbAp4TVHTB5q zLdv6n#c`_b5K?({jv%zwwXbn>xgp!4GUX9nEyL<~*?tFAxeI@isBz70S8~gHTdptD z^y05xdhB|Ed1s4ElNRzkzFsvzY5f0)h&n)N9}*#0{t+VTq|lNFMhKFBG|<2h8u|Ro z?z-hs7i#y4?;i%6*aBV7diZAhD{tLkJf%WN{Xz`Ow%$&a7fSl5KKV5DY{7B>yfSQO z2d>t*e}?74a#?m<;$4z|;;Of!?~I{WYpQ)#ZxjA`SlUqWwk)r&zg6m^cK#SrBiP#W zQ$cMnR7$)+hlh!fINF1<0BOdRhh>#*bw(l5J;L2tAedFK^?1g9#@^n%QMxf~jSXu%;{ycH84aaF`N%TR>( zI-8=u6f+&Yu}abdEo3c%QrgnL ztUOWZVyamqD#By$vj0&Ig!>ZJ^+k-X$>BGWyAdyR3Huj&pmM0f7a1REtPeNQ%^G3u zvDE!md%WJ?a+GE4bZ3K*g5BBUrwy7ZT;r;ch|Lm$U$6a$#Awe(Oh=dT7%9xd2aUyx z^OY!FED&*fg8u!=`v!NmLTdT*V{jA>FX$#m{jk!%T=jCdX} z_`V7)_aHe_iH;M-q_#P8de??GIag-=CSlt1|1;JU{L?vmeOQZ`29lVGD70_R zUM-N+_&xf44o2etw0_oSA-lEGVHpa_+ufVjb*s;h@Y>}j? z@JJSwpM$Zz(x;U)ux0l@i-}lKB@I^u`&|>}Nf^*V5_u4*XC;nk9k69V%wo}<3UtXp zEbGE_Wd?uR`C$R~8HVrQUB3_<8c(Pz;9z?Mo9ZBgrx0&nZ%b!nUAOem{gt2&!wphg-f>acy0 z3sI^UzlXkA$86Ai0|Dlk@{y3;40wa z8n!7p*#RX9hZuCF3f>+2M(wbTkS<8m->~^c{q)u& zJ-on)fJ3oh%JG%0GukN}xECpy`s=d!3pMrB8Das|mV(tpz|9>(_(m(2yidFha%rbf z9zU3Mm$Isi$wi#+0-8U(nE9sTRnI3EcIMaoprGHW?P_ki-%hfhbXNEZkM~uM|35pNfVa;r?9UMisO0Sj*vh?fDqh+1~?oJ zmtcnn=WshLa5%vwNYKMQxLrl*RnfGSj&FLzeVH!64XnJc?ODR~pws&3RqAMs8Y_BND_ zqhKzM)Nh`G_m!>v$lQ64)7to=jN1Tj)E8Z=T}i5CKy6_vihkfd_WrqP*LK$ga-8*P+<$C3AVglaZ-+oOov-CmXWX(4p?ID5m zYcpLpah@^i0`pyuP1=JwC5+8xz~#nLGx5IHUopFn7ayQF7fB~|H|*gK`BZX)*k6A( z`bSd9bl!j8lG$!qq=+oyl?@q!0c(C)jJrrhp(NT^x1xT2L@d2^C6&s6uuz<2oYw|h zkcv>^*X-JotObN)sN|d@0J7xiBu25*?4>HH&43Siv^m1^iAbd6b~z_vq|MlV=}8>FtZ+`z-A_)L9oRcDvag+m?po=};FJ9K zBL}0&J5SIdFb{4~ap%8oR9DYiWJJHFFAWyE#FdfNw1UT|Oc*!r%KcKsYubdooBM&9 z*I9AEel{tkf$QS{EzFu;VpkNM#8Li)%kj>!ZJaLIySrVp%WrbRw z`TF){5RUro{S=0jb{6 z#J#}kJOKZVCWdtmNp}>_a>t9oGW<{|m6%jOXn0O_Cx*I@K%m%EKQGh5_)F!bOxzgk z+FrY}U5W?MZe^eRV|>uVt4|oqfwmqq(6jVwfMVyk*|7HS7ZUA1@1D_=7Yt>IPjlDe zZ7pu!!7yZZ_e||skybxJc_lqM%3nD;QHbziJ)*yRdDV^4^u5Y3Qy#o${ltXrjeCmr z$-&;nAB>OTSx8XSGSIt{2-X;4Yj(k%98_YagaO}tE$-Y|DPmU2D;_@at9*`iPCr`e zADt3^qcDW*#X!z#&MFiydxDf{|3;5XqVMUl)|o#{k+*i7j#07M0o(!iT*!RtC1dad zcopu>R`PfJ-!^WCS*!TUQ*t#I;GE2jG4q;+*Ki3hF*zEg;8QD?Nw$!TM|=Ih;VP3) zXqJl_oiv3|$C_RgH0P1NifFj)WHO(h{5LD*NwIykTuDv3fy%h@FD1^C@i(_c_arHN zI4(BNFdss!PZ(e>fJI|dd|`p)8K9uOr^Y;7uQ>`Nm+jdFe%vo2NU4(RiWHs~l%!NQ zF#;L6dC3R_eshi%CojeD#51)38DEr_FI&sUGS5Fx z6i{Qwy+?XPbEGyPNti;MK^o9$7le9T_}EIu!`$Pw4}LU$QWR3Xh*43B@3ZW{q8*o4 zd~_Vc?Jf>WNML-Tw+GaNqlu2JZt&4FcNtG7b;dPJcF9I|IRIx$!wUCVI{7mK-d9c# zCULB2DE+cN;B@_2{&MbauwMivI*lCdS$6oFTkz@2E6Uqwq%({NV~%>;QOB@;WMQU4 z0$B=_ucYFiz85m;s>u&7gr;>NOPYxG5&apegA0M_SlEZ|g=R+|dodXxbV{Z}HagPl zBcbzOFH!#YkbL9!CC1wX<4d1t!_e-JHZU2@$M4|5u0bKRtSt!EmT6Y6e9dFwqD8}^ zMZTg%x1vR9P@6TV4Pw5Sr?owbGX-jM%wNn)=F8Gx?6hNE9%opmF_i0Ie#!mDL?l-O z_quuPWQ^g82LIMAE!Aht*{o=V9JSEZ&I?(3_0QmAR>)G{cP4WEEShoI(wSSU96+y$_n#@vdEzrKpMKK8#}2pH4> z28Do{fuLqfDqa3Fi>eeS#O9^)z~N&E3&`o*4n!Cix4a~ed;wBj2+|c%XxLL|&mlUZ?~zhxS5>#m z3PBn|keZ0XCPZNoOx__@UV$QJnldJikF*L%dX6aELKG&}*=5$<@8pZl>wCcJcI_ZY z-usth<$Hzwu)h9TY9S|#W{fT=a`IR02Q^)3)rIZ#RPzEpKP_BF!1%P1)r%OD` zM_eIDeW1;ktH>iaS7G3?D%-#&n+=f(l+QN6wZ%NV)v{|4^aoPhKDTR_wrd!&(}oE; z+@A%*4#>wAp1fU^z^+Q(E@~_bE`}|Ta05cvJ;T+e%GCxh+lQ*8%0h*=8Af4rL9lZC zW{V4_0Xxh`Xv3W#n@#@TAowGdvOy2#4{;qOVYI>xHLj)Pwif~;l_C6jOw2EB%ov9P z?=8hOyHg;5Qt&tHKvZo1wTJJaY_(e|<7_vb562!G+5eTo$``U{Z0eX-PJIkxe^TzB zY>J&r4HY+lh>P@j*Yk^Ca(S&xpj)%T-Z;d*ae)29U*7cy@A{ZitISiY*wf9|8~ujf zXWDz^c|Vhz5XmO1O7AWcHo=o;Kyd@3o@5{**;3rV;XjQpb9Hcn>E<4lqxdq4%&|DJ znu#HUhLFMgw5)~@72v`vQyN9r zSy$DSP#Ssi{!hn$9j&dP1~yO%3Zt}p&j~bBV;SM6ymNXPHV3?sqI#|~*AK6+&@3U> zMZnk{@|8!ZoCKf-4*wie$=mFKNVArQ&TSh(MT#RiBZ%v^G$4cY@=ybNs0ekll|n@4 z<=c7NCO4Zbh7k_7^`Te74WBr#$?B}5>a4qF>$_(8ET9xZ&D8gZYevW%ls^!rX&t3$ zoyAbj!CMa1mP>VvhSwKIva94PXY2kQOhQ>-y4aliNoO#^cs4-)kZ3JtV>g(cNMmbs zj3As7U_NM;kDa7St`x`fKRk3~GI-B4H?3HolW66~*pClNqKRelqfojCXHqY|_>u4o z(np9$V6^DF+zqBB0>wMV(uz?^#PRqZ+M&pWd{y7ZgOdYeJMnLQcQs+O3gi-TVYJRN zopURySDZYXIOJ!7z9?IAH>?+JVW@>Q1fk1@Y|6_>*DykeGb2Ko5z!2S9mSH1QSx5! zS;DAzSzzRTRJ?jJuo{g(2tX)KzzIg?3Q^cVc>hI+vIUcG$oFJ?Bo}#44nSD^B2`v> z8^vh_2Zhtbz972C=sq3`E8+3J+M+~@uKytqK1CNkBJ7lb<;WM5!2-oUL5%$2bF5jiu08CB(S+vASo)!oJd}!;p@z?D$8j`Z4~Re? zztR6lEQW|DgOnj@Y8 zVxRrW;IUAhMP}4KRuv8v9ECD>JIPyRurhRqC0dB}xp+|!-eOS_7yYy^`YHHNo4%s} z>)2}G?sW^F#TQ-+DoEFwyy`3>qjoaGMOfAQ#a{4JqC4zb4oBvH`BJtFe6r)L7bHji zblAW$dHFpN=1|DWOhTW&Efmt1%bUiN_Cm%G&ZLrNS7xV~BI9XoCKJudprrLhCrKv_ z?alSaKFRC^{mv}Nzw^ZFW(0D);J$=*mzZ(O?R5=)fHTEDH~sUMkeVvUV}IA;z2c!z z<>=eRoHRav9@7X2mGO6&cyRM318b-~JigQ}CYSuWmA@8px`NGzDUv-?tAhmKi+2zJY?J! zY||E0*Dn|0D#`jD&_z}eQX2Wb&9~B}cYx|ooZA}e|uKH6iM9BJa9sbeKE;3CKM213`!@9gxe-?R@;+{TT z?uvt5NJq*^r@WP)1Tiw@KW;B12salv?$!|x_t6jA(vNT9pT}l=j%1BehKFV)M#k-i zeuRP846#;>tt7PJI| zu3v7-yja(G@_{gZdN+)=6|b9zl!%8$ecgux!4B;@hF#1hQhm~-)YT+V8+)4L3bPX*CSurCBP*BGqi z?X=R@Sg1TrcuOE=lNfPMOFhZyATIDb+|*zLg$ccWx|AkQn<6S;=R)cuSA)u5GuSHF zlZMnIx*vC5EmxjqNOs@XzUrfFK(WgD6Q5J>v}Nq9=XUptMB;2;v2Je|4`upfi2bRn zCN{qyXk=RxLHtP-`fR%+(&t{g1I<x6r4&VNE85LFx_0&k87* zFu5)h`sd9b+)98;p}F_Z){tRbAgc!t5LA z%WoW0zD9Hh4!4Jb2hNY7`6Y9&si3k@_|mbH>x|_2HUCUdVZ*_Cd%IKh*Ml{uCJ!nn zMriSpMG>?ywoc5ka>?3jLBg{pw&Bz>Z^@Zp7RzspWnNaWpJjnK%bs9CAj_#6Gd;l% zWjV#+jmc0GR~83}zY~`hR}z;OR~w?=el_}X^wpop%O3ZhKRviTF+Gpgnb)l?3pne+ zk>IFbJq{P5bz%C-9E{7a(})0(sXgpQYL)cUuMQ%GqFN%)d!AY{)N^`*l5a zjdj7px?VtIHSpk+X93sHr?1ppUGnX$=@VOSZ6>toGh6PLCJ(`5@?T}R5G0=R#+qaY z(QWJ1VSqj5Hev95s;l+g#h;+57SSF&Ig>(K&Aiq`ySIyS0!);ILPW7q-i6PQDRv-% zH-_z`aw_R>nO;>zPFFW=eF$B8DKxoM{p|DVd~0)cjtT=v-}Jz)g=c}-qWYOt7OPA~ zj@#*qvX(Rz2~;+4KCHcwwFx4&-Fz__y7gtrPphW%)d%<|Y)vD4`hBhQC3za*IMGJQ zrgir66`&UJo|dulYC?~aEOlB|3G+z*%QmX?EmH<9go9($xUZpE^Lt#i1R7D@vH`9D zO|m{G6L?J@?Ke1?bq%l?Q9l~%3E8}b-H<r<>JEU;_{h;NZE@_vU*?qcHDCW`f zz3lotpB4%6mFb*xM)^rp?3_P}STczGWR$X1_lOiyr#C*J|D?haSQ$6f5>Dzo%!!;g z*uUUAjmFY}lZnTYmo7k=+mPv3pI_$B8&>3C~NYbkPV zUY`3va+z~Njl94F?@IDyd2D!I`D^BG;4hYx_`eE%8~nCoIF?4)UKTjoQmE>XKz}NR@lDQ`>YwRnWh;xiq~@1QT_wo z2k(Io!MorCa0Gk={uAC0{{rfbG)=D9K!J=|ac$$}UW!!U0U5l9=v4|2b+ zM4$qC#F&VTMt(+yBh!#^i9L3sisAd*?O8V!-(@js=!D0BpQu8reveC#|ObFjzqSAx0yvU7lTGsW7F; zNhGz%sZD@qzwMk!BtB4jq|7Yo&jEPzk#DrIMkkBHfzYPR6{iSDJsJ1FYxBn;oMeiw zFPK6LP%4!ab70{1>^90+Ycx@1Z*)^wV${IFnWpu7v}XL1MqTpr9L)uJjgqa>5L}yT z4umSD`ev!DdhxUh!x_V;zKCVi%H>|-wRQ_0i{)3@uuHrVc4;H>XFz#7 zerkxwVUE3Tl=KGrMQV?yd{bX;mpBew44#$F{<;qTId_nx30b$$R49!5&HX5q&)#fKiK^fX-8)YTnV?%O8deafA&zZy_+Qq^>;|1WOJ1*H_(wHQ!#F2dLctV1a$ zYSVbR@kU9*M}OZ8-C)Q=0qQYDPdv&lup;=jypy;?$ONo@&|9+*;$z@;OEv4VB&f3Y z?wxJd#Ec{G6IcxMF>&TT+l}P*oWs~vJLiGhQrr!ZvMG%%GE7w+Yg?8!s*b{ z&YHzsc;C0nxMQT(7ov-O$$&ijwU2@MbXxq>;wmO7)2THdg zhU)-{5;JX0|BAA6vHfT|6bz&I;WRmSBCl=Z3CUb9^rke@!Pr*dkNOM#cN`76&l|Mp zP}Vm4qcGw=1$A>E|BD7(cNMAa6eZD2zxyqb846KtI;4SUmI3pGX=evF5Bm^zKlt{y z)ZKxwyJXQ%+r|vlm9O|F1}%Zs-`d~ixG8bFZ$#HoYPvo#sI@LS9&jok1)ZmMGjJqP za+Gb=FX~wOaOQ25(E{v{dXeRowIp?glQzF9TT}C80M@QI(|mf<0|q|jP0@P&?Ai^w zP4;>@168F{_4AX?Li#2Z3M5`dz}hVM7UkUVp)HYv{V;srP+vtQzuCdMstS+9R7|D* zBG~sp-A9(Meliuf>8}>`n}n&X=5?F@ll~omVxSb{iT{(R3zFi5>FN2%Q($3j4WYb$ zY~(qxFr$X>S3oT5nuA<+4IxQDEF5*sI-nq&N$~5>4hS)iHa$TC)6*8@=q+gzh-#STH#WIA&Q;jsH63w@9EPR8;E5%{Jbn3Yw`Y%JbJ4}Kb5xn_ zllJzjR>BQey5ru*86UBE2?;D-u|S@eu3M;fdkpCHX_zKa5d08d53x#^se+z3ob^n}0mNaE!Zf{EAEBJIx*@ z#d;;rXX!XmmUsh zvG@i(_?S(uHDQ2C1nC4{_-vK!3H@%ufTX#|?5Nyhdutsb$4p&=zmSqH%ZBKW6Hp8{2 z=d6@(%19g2GBg~t_o>QHZ7SEB`P?39e~ixYqb_S`biczqn+EPmxja4ZbT37X=3d{F<@jyM?F@_z3x7Q=6YP?B70+T9ZDSWlY8QpIf2cR9;5bHl z1m~G&q@WoiY{@4Q)gJVe7xL&8AL@1YrsZCh=lG%GO@Uj7Q?shefpGAqQK=;!{QWcy z@I4dQ?C3eIBUO|7`Q%Hr2-TDK_+)Jc82MCe28+%z#JSY_ zlFw4aIo++Q#TiEj#51`^`~RGUbg<%XGW!^i4lwx0;|~&E>cvNhzc z{uHwYC8gXK4NX5$vp6w^>YtmeGH^CJA@k|Yej`?-K;mTCBql7-cKjn`D+ zz=fP-@(4JmPvc_a?Rm14C6l9X!y0&0Hrm7O+IaJ~oK{@}{|6cqw$~Lo7FolSC&NpB zW7>1#lS0HPQQnj}@eh*b&pJQPKFG>6%#Yl#Un}+q$<+%A3g{}lX&11nNZLy*e(NwX zMSQIPl6Fi_JHyyyg*DP>k;q^Ji-S~P)qGX@fs9I+kfI{^xqZK_{Z4>L?8a>%9r8WP zc(t&1V}gYlaI||NV!8o=7G0t_6j(p|VMz4Z^inU`kTHyeL&U*vIrmFY$A@W!aQxQ1 zb=9hXj2{K@f8mKtwlvDcUep|#C#-HszXFP*XV5WQ@ey0z;{<%vXw)HnuMNs-%6~~7 zZ*n@};|gIhC(adj`tLF$Y@7rpr#LU*{lvY{uzurYW82!;_Qtkt+qP}nwr$(y#x^#|&3DiJdFPyGrcqCI^_0RX@R004;Amhl3vtRfxbPaWomr~Lyx z!zhIdLu-9I007GG#}IV@09Vw2l4LiGM%> z9uK~6X6^JdFJLPG00QM_tY6JBcd?en4mJQFJ^}!M{SN@(<6~bNw_{~%_`^k{1^|AE z{>U+dRVZCr>%0Bf4D{bS_>lz=fXRZy*yvju1AttA#s;nUv6J}$O7YRo*73(SF9ZMp ze*I@?wvZ-jZ#xI$A1(sP53l=22TatoDw5lVp`MYR9^e2*{Mh;KAFD3rQMxWb7(+%C zEV=L0m;2kL-pUxtP|siwV3214;39=y0sJ3l=Q%gp-`{wUFUR*pt%b3OK8%R~=r|XU z%?RP~qyEPl7=Rl991sZr0{{as0e=8k|1|^u0e}L){?nmG~5&_kdqG~ z^qo8L>en9^AMWoT9v+>ZoSmE)ZVUvX=nVi7WClS2Eov{JXJ-8U&qUwjB{zB>^no=* zmtWsL4(E`ngoaQr|tWo3ksldKOdeu0W50IO2fg2kMIR(=z~ z(u77cFe0>d`ENP2ddMa@EJOrmi(jDo@PQd(Fe7H#VgPAoM5IC>R3P-NRM2pwXbiUd zm|l+VmphOBVv>!ciWZ`d^GcmIn%F*%ruJ~TV*w4=?%R0gs$ z_6d_pZp6phi3PqVs(Ro2`caxjURrUe&ZTur}(k1<%ylC4|B zMArVSv<5cEB+Hw$ZdpWZyF6q*HnT7eCy5oduUs{JzVe7&!)p}JtOV{b_N$EPy~m9B zFilgo&qyVi^fadxQNuMDg-eUotlxYwe30%+#VxN{L3`mn)c&&e1$tJ81NY<5YiaSn zF|xjaFpg?gKF;iJnA^nP{BW(l=W*NawTyF+n|{!p(l&ySplY!>cE`F&t*;?_hlfuY zlaPbQGoJd|xi00W-|ar}&i4@ud=bO~rV6Iu8)5+M9XOA4a?_RSS7qzC`cKFX&SMCD z2mVZsFRPE}QaAlx5T}B{*ef3HDHxYj)pOqXMh7}wjYWgFkh>7w7JFrtqR_Oq z9HVkX*%Z<9BL%_mYRe4?8CoZHDByhFkwZ($DuprjUFZtwWH3q>w$gWrl>sj1u=a}^ zS+e2;1zEM?DoSc9|AR`<=GkXtC7bc?%n(%C%~!}?qH1UzB|jC`A$oO7(;*jkgf~(f z*FHfOriP4<$MTx2SLl7w8#X0pUh5gQtv5-8H^wS`!*dOe4_4{35?s+|p-b@6($_%* z-S*>D(`-{I*X+8j#6Sb`q&A|Kc$fiy$Qr%T+r21z$!nfH-`aWlxNQp=CeHH;#}yP8 zJ*3?x&)l$z^{RDhwmY|(^ZLEuG<1nh(D3j2J+!4G*U}U|fAx&-a z-i3o?bBYjROuYMu^a0B(nXW%KBa?YGL*<1@%SdB7-6VVb?+f};8s;tZ9`T5;){r*1 ziT|%S5VA0m*8a#oLp_W%=rTPUk~AofR^Qb5rtDuiK)Qj>ehi7a{_y6DU_OXepq-ne z(kp(`ds=m&tn2bKgEdsvI%=6q$BD8_g+a*yL&Hb?j2m6hu7eP=lFiZs=b>b37a7mH ze|whiki7pYaA`?2SKG?+c@}k-xZ_*Qp#1dCg!?*A?YUf5HA{_tscj&EO?h+lekY6u zPTvB{k&=e%+!7wk!9FIBA44=f<8%<$D7*FxU>fZRvB}F&kJf@E7{^M;a`8+RXHb<{ zW?VF_ysiBUeu1ieLgUKVD9He{2v5u@MNSJ)*&^qvKhnfQ7iL*Yj+=TG?Q{w8uD)X& z+bkQ##ZgTUvPfsANMlP-9RyTh!`B9Th!Zjv*GCF-Nj{2%lT`XzjnWW^vO? zog=5tk`d!gXXx=lx+|8?SFGt*vm;~0BI+9gR{fwF< z@r=<+7)#7k6o&n1*G?yKrz%%@{WPI!U*oip>zc)N)@jeLi-D~;%R*BghzoV*gR*0n z5#Cj^E>WE2Q<$gq4}MENZ}0ATkL)wAC*QlXoK8l&OD*N?a=LHg+~@Y+Iv0yGqNN7i zqoASflR{N59liaIL|L&xoql6nd*ElcCpY#Hh6-Z6f37_>`#jPwd^9LTwNVj&43m8Va))R{oHc!4gxvmc6|L%di|Jr=xun9pgd}} z>IST)iGfG+_Ltt6Z)V|A5RFJw#wm)C;8eRP)eAt=;9VanH#0R?fUiwT;0#7@uJ!WBV z2Hps;wLm>WUHAX)YrkSuhkC5s^X` zA7veF7#TbC_wEmzV7qNxEx*|+3!^~X-lV5Dj3b{K+O~Js)+SX4FQimMMo>3U3Tc?38hS2DeQb=u^CV3dDn=PxR*z2}CFWgGeO2-k>9m;yBEx zUalyDlt{XZVquuGUcd@9ok;U2oTy$j3t4s8*~%Cn5?5za%jyR+sj-lGYxl>Aiu z9m6}iM__hEwvDrsNXtf5!pLmuJR>W^OE#r+tZ`NGxcq_b-S>s>_S;=|tM-=^oEDrG z{MN56_oB4Sq`X6VVR;n+1wzbWR0o#!g8%e13C!ljJB+2~fGy%B6frC0u2e&n ziYt^)mXw{DNSH|^0!z%jo7t_?TgF@1s|0Opxt?k~+G-$Z4xaP{BAeemr_thT$^{~; zd}*FNW8Q9f^cgl<+K}21+dd(s(X4J$|AFZqL2vavd8N$Wn%5jAYE3R{^@p}+z1-8z z9BR!R!N?r4xiQe~y>Z8$+*0R^B)S2|9wKsQ8FGYtIN)E8%U_zHzwFsvk7Td+Teq>a z8jKIztL>_{R%@=XRQ6XiS5#A0E>Jd0R2fvxb(!d}(50VD|7zUgHcLtWm{M?TRoAOw zOMSohZtt zE(kv|M-4E;3;$+6ypw?nMrf+LkfmyBv7BQvgNDcv=4uj!2pR~FISraQ4X8N{xrS`4 zRDm}OtJ^Jwj<+NJ#e*2Fa~jQi8tD@zK>cnAIG{(k6XPcW*QXEB`yE0EHF$?3qDPW5 z3XKtr&VXe|k9K&AG-3!$W`IO?XxtS*krrX@hFYu7X`)AFqR)D)M|(_&`EbXnPzQj% z`ncgIYlx3DxEv@YXpr(HPl0_NBUIv@qxf7 z2IwvZY|m?45_SLxd2qgDdDMj~{Jex1J!0iWdCpt-sO!Rn|J`qED^A-i@*}i7Z00sO zBbnh;!yC3d@~=GhfsqhVYZgfm75zpqZ=E1C&j9iE6RRFex5zcoqUCYen*htl;pYa9 z_0wCir{Z6^zGUOuWox7=B%P~xxtr%Vu+5)4pwpsmHqtEaDGsPLTgC4L+5qm+FGkgq zc?`WLRrT?6zgq!=fmj%o15-mNSvvVD{@2e-CE|XM{!xzcQook4re4OJhjNEHJo8G@ zmmr3>rdkB2ddMIcX*NN`A*Q{bZ7H}^aeMi@PZ~&)_&(eW@BrV5Q)jm(Xi4y-CEJga z!?>#|Rch8IB4TH`ojr(?i_r?^B|cgX$v)s zHP4-L6qX|-N&Ep5BE%7-%!EzZqE>6yv~Ix(R%xl&Mnv7#C!>X&y^7HuuHif5&5Wwt zJdbu2$4T{}oI))X13AwyCtt){bsBIi_hAdLhRMy5{mL0iS^kXJv`s5>sQl97CTqGoYy>CSY#9*U5~iPRkGqH zt%L~5&xU7jHByKSr4})tqc=Wu36++Sxx4!Y_6Z_wujwLcl4j5nLiq|}rS#tRU)&}< z!37ttrGwDvqDOWKE)FlTTmsBkZi<4oSG-Fnl;5EMc`L->YxB3(=gxe)OXPp z*lBW-o|UrnS#<@pb{WU3GSnShsv`@C_9ZG%&QYHbxJkn9n*cJt8ZH`-RS>GTK>yhX zp$=|wcm}GdksnMdh_?|v?kVA?@4B!@rN4YaZ6fSZ7ifiHjJ zep~=2zy_cX;0Fi+qyZ`bji0hPfD)kilP4hk$w%k{XaH(}-vDj^FF+n33m^oDx@{D% zdZ)!Yqk-Q(aGMh+1SwH6gmeXW{iUf5E|X_=X{egO8d-2S<;dp7k`N%rK>XDcAj zW?Nj7d~~@<;X!P*i9RiK-EBbpwCferX6>@VdXGi?0K4`L`XIr^7g>pG3#1Y2N> z0RI)>7?XkH&hc+zo=R2bIwXv+3vVE@(;T;Cwyp>9Wei*9+s<^*yeBmV@hYhC*^&vV-0mTF2$tp_ANev$uEZ+_`_B9ABqg zS$BPS;7`DIb>({dVyOG{f#B#SbdC7X(+>?^&^K>LpN+<|!n__PNBMGh!P?Nuv?n4{ zryMY2Chaszd^lhy-(DDPb@yL>y{NW*SA5jo|6}RUS^ReP)>$48iOYKcQ@| zT&_Nzwa`+%s1I?qJXI4M)vViXa13@rKhO?SB<%X*@eO8LePT$%x6-cxabeBmg?-{` zrvv|@?X^4j((R5Y>=1cm(`OIDw_9pYtb=_=S<<`KC}-t^fBOvbgumerfA=0om$_sU z&<&M~q?6J{+g}WtI!(`d_!_UH`M6QAs&b;aZ(Zn!U4zf{F|!p7)bQb>kS=8I7=uR~4g;Hw(Y-+b;)V4~Ka$@Em^L zJxrA^b6=kaE_0Rc_&%~-ERwhhSJ^dbbo7?pBxN)kH`Eb07TGN;@1iJ&d^!8*K|D(~ z{fPq5%gHw#xtQ~JF=udhYA*^iXMb9KCuIigoGl z=p!VSWpq)8votZ0)itGV&_q)ugm?#GnDewd#nDrP<+U_ zQ^y6Jc@&LuNswLtKE=*cP+5eK=au)=Q+=Jup|LK`ZfvC#a(mw2nfK&Dc(C{8{A6L> zHX*N@&oj=KorFoIUzcEFkGpJb@Mz4efGYoviD{hePN-w=Zq`H=@l3(p+w_$u;$@p% zgO(!mW-q&xbTeIN@4LqDO845(+YEJk+K}+Lc{0&?R9?ZJpuM$D%m(a+#(KZHWwvSi z=z4$bufof;a6F#0_VR`I@{DJju==&S&a>H-@BQU}!1`@Vzz0!*PeMN0jq~F0gvm&r zkk5O=kh%Z9ZMj3dv^|>n@y4}4En0zF?vnJ08T?{qTKLAA5%c5q4j=P8;qTn3yX;LE z;6_9DV?tjbeG+dotxifdMn%mtO=@D_cyW&p|9NEPV9uCMWCxF0b=>RC{(a+KogK)9 zzW{54o<0_CkIbT}|9HbCrl7w8b^|l1ck(8on}0=$p497t`NluKjp$gNS|`rz@}JFQ zuNrWTzF=|KDQHF*;p4%#oc5&o=geGvILh@{Gy0+36|skMR|%;S-y>`h@kqlsNc4|& zuDie6H*@&oy+?Lagoky2%0>I~9b|QA-t9J-J11d`kakx*D96uqB$KOfBi7_ zblt$W<+MK8RMWj-n!0trNqT4W`O1)+&%T?7Dna&XBYzc6jq7X+?9j32vL&%|`T}}( zAHD87@FaDnH>eZh8t+Ya{ux!bC*-a9gM)s2B+u5xZJcZ zNwm1_@^GBjnXl}_pY~>d$dmmJPo^sr`G1QX{DT6#I73eav+(Pif;n%wZy!uOq06|( z^ZFkz&~&kLo_~ z2=Y?%@91Zyrri8b>MPS#;dABO5$<}X1*0@}#Bx`=j1(b{89+VX0;3@@Pis}&ODIge z#2A^xs*X;udAyFCFg0p%yh@U)eUYEy{9CXiQMHmR ziin52tG}dib8@VZhrOjdj(PIeA8Tc;ihTuZpQ6;hb|dei<;I~LF}h%POrF&K2On9w zP+bt6=&N|0cq%wy4`auA!iCEBi0=3m9OScQ;~?&v$0oF>4SI{gF~9hHT0{3D=iA#H zneN<0sZYkc$t-F;cl=W4yK+&%ZbSp)qE#mpO|Y4rLG#a=0A1J$XgAn>mY~(J8WCt> z>z`;~YUE#AOZJ{+qQt-_SzSh-#l&C6EE}OlXF)O-0E=~>uPJT*3ETO@m7k1 z=D0O!YjT##`}=lWOAf->lhc3hc&mGLk+rFHxSl4;g=Hv0Y;)2&)(`@RYt9}dE9RbS zVI$l$d&ya0RbAWES$oM@epOjp)p>i#S<#g^);7U6(d#=&taI{4MmARBTXb%-FnrGy zzQf~uJ8>k3`Q=Dbmg%PaW%~UQkK|It)-zeyH6`8Tj$pEznrmfL=7nK&b7|Wq_G91- z;v4QG8Ftk+ml^xS%A?_FlJ&)E_D@UCx<$j&Sc~N6)oS*?wn&*?{{@^~M;TF0j1j%3 zz$aWQ)4 zw(XN0-M4Q*u4p90^p|Z;X#FcMj4$wI_^VWtFY;Zwkx$~3c|+s)qfEV_A~%&H4|41R z&orLQsx7Ba>>+(%PP!WpkSCg~$@=ViPA9oA-nDzz)S)_Fj-yxZ;A-iu$Ha-&>@qiZ z?)(jh#*cPCS7>uD`DvmTv=1#JHhh(y?eW&dHj!z%)2loWqkhdLiFz(-Z zjer+muV37WVE?G<3ctuoz?@L4-szrE#uR_{(^cJ2df2P>Y(2KV`VwhAPq^BuMqywsWveviv%>z(c7ch>sVpp&ThY4g9=O?>>`d7nPiGpt9W%iUUh84Qj6z0* z*E7N)nOeY19$^)Pr?VU>8P(CN^Z2P>a} z7EzT!juLtO;qkmouj z{#%sg`&{~zZHShO}-%@CKX;{;45@KuSVHW2iDQjHujI@ z4bDB@TU>&{go!vjD&2hUCn*_c?~n5{11SlWu(Qz@ z$q%G0RzseC~i?{V}?D+h+UGzToU*609j_n|y+Z)io z3vZ0G83x5j*#^f;_%xKo!K5*5scD;_9WIG?OHqO7ROWdnooV!Ceu3#^W++;#xpkk* zsu9T(Wu1koxpn5O64GjT8RGl54!Q-?ARx(;<_6j)!%$kY-&++twyKE_UB|atO_ky9 zI?@u(3{VcPE|-15viT${(Qf0b)~^L*MIA{1@hXU0H7=~bv~7+QT|-x@wQ*J ziN9v_H9Hiu+$j@>ZF_7g&a-&oZhpS-ZG1A~Vj{o_GnI+%+ZSE$I~9~h%`{bI{1sKM zEHKi{@bH!aOJ*DmA-<|$XB?U+LZIl|2~@!mwJSva3l|BYT5#nR(AANhaayI)tW4a{ zxT2X{Ij54ql8Jj9#;O8lASt%*QN!Hu>$H-?)7UiIK9uX0$T;AGC~k9^Z-l5jbi9vU zUMz#88?QB6@Nso%6m2Wx@yV$o)HDale!}n-mw7_Wp#?6wQD^ruF z+lO1{Q9Yz^I4?Ws&bzXt*6u_$;o{hX%SvnJrjr@dptUWb|J;qCg|Nlk?t${Aq(7Po zTDPyY3cI@t_xRF(Sat2Des&7GGH6xwH&PMo4ieO(=e&EEK zKAvdPzI$zYpYUK(Si$t zg)z)djs#f{i2s@$(Yc*&tBI4PSK8mdUh?`Ju1}&d~_RY{EZje>CHE-&+H8?FTW2=TYtY3BMTf*fdBoUW>hQ{rbMQr z-!k;sg7kj6EFvgr=eNF~GWSQWoxI)|ySFV-sU(gOc1}!Z?q6VmyU!54zW>TCCHQ+( zF&kcUZ?P30*&?K-qmU8dVH3XurSb(*e8uK`#h3~&HU0RA9&x{B6Pk1 zstM?6+i5ks2q|G}me?^*>H21s!3#hiRXXs81_VIqnyB0g+zRQPJGeHDO|yw~ z^i4veoi&VrIuH}&s&l7pR;SKf14sP* z>@S^5!Uych1JM-Ru5`$rN25QLMN=9<8m-oM;Q!f(ru4v(Ok+Vd>b@*jl|FT> z;fGDe&B9cYWl|_rlO*{!q4Y@HBjK<2Zr0Z^TWK%X;{dea?kBCFFb3EAjZNc?leHPJ_J=Gn{ydKT6PnCL92))PM982)r^o#7=iv0lGfn^ z{!Rw7hfhWY7bQ=XE<&z1wKdS5$xgcVmTixz*nA9kmwYk47A_w(XgKXxyH^vr7&r3jnNEAzxQ>*C!9@g}EKh`KG4`c*{q5$F2fX47@o32|V z1FBAo___SOzmXOCcqo{*!nX@v#gM}Rtjni;h*&`9W>vVNY5^Ro_OK|BYl1RiNOvOo zvix1jc6f|m$#>Nwx66OjjF69-Ax)o2gC%n>_1@^Od~qOoe|_E<)#zJfk9~&)Lj_Q? z*I$T`xK!kE&X}9jF`7UvnaMn?%~+bdu?*f+?pIKb!Ombp=0~gW$k4Dwn0GDPc8z%OuU^Ws-TZne$p`elZrS=Xrf$T@-Qt#s`X#`?@;5ZO&>3kkuoR<^o@ znI{;)GzQ;FhKTxr0+K!+sK?A0^A{spiZ;eY?}|_J>E>7w9Nne%3k5%^oWE6bWr}m0&L&9xA9(El+=_nc75k)C%>mBt;BHTefbX+HO+nx0jk1j5aH9xX*wZlVX)eQly>SMidam9@bEm7J7(jcyv0{ zA3pIOVOyPUb<)V!x(N$n<@{M=ncIG~7fqhz_L{=wGHa95knkij**1O$#_H>K68=&p zh}#7*!Vd93KH$V;YhXc$V=O8O5g1X);f7N)2)sCw2EQ6E@b8RZXG;z|*&6(}TiPbfT>_F7_vi^HazsU+>z$bNfJ*Y^@`vOE#FF0FW`Yder>CH+E*radzWQ0EXWkb>(WvPp<;JZxezRx z(pi=X&`z)(3K|p{EmYp4dq3i`5cn~7eE$;hN)(lgOlX)Bk}5c5l4|Z)LM*oS-&Z_y zv*g7*P|ug#4koAk#zo5dnNb=ZE(h{0rW>yPM6OWY=e0~W_HCf^8`}^cSRh?50`KlA zuC$EQYo&Vd~Rt;Pi$ zYx30lqtNzMN^^lxSt$8T6S@dRi4sc{(jog#wb(nNwAk$6po*DpK+Ubw*Y6W#Y!}6s z)Xf;nKD{39+G$E%an_p6*_qtGvqx+B*m>J5KE=M5p0~HVi!{g5qH!Bibzf@iJ#~vNu%+#7G7;g zcBh%gmn9tY=*=gF z*UigVg^1y?X6F8N6NuN|TJF zpY|tB-C9Fua)D~T0%$FO0ABSZP_|fkEwpS-kaLn`zcRA}X+O&Ot+P zgsS5)G!T^G=3XR@(iAxy$M@}AtMTjSw@O6pYlu+x4oOZR+A?%Hdt`pJ$|fOikcw2q z+8)wV5Pr1aPFRa%$MkBLj$KxDXK3oQz%rIma>iSbQVY+1m`?rF%U~RN(lQHM{E38f z!-7f!0%_&|7nUX$nDH5?$bPG42&=Ol1@|n4u`Ot(UNzt(Mh+sbS$fv_?8d`O__1a= zc7^J5ear?UUrKW>aYG#asK7J8iYk9QJ^+bmTF#Jo9?88W(ZJryRCd??_;r)_>GZm% zE)^D!4s3B|YHvni$Tls@;W62z;il(p?t?98^k&1!uG)U`EL<@(6e{(!Q}P~^Q`Pvh z$Zi(@+V{Dq@CIW;%;N z3VS8+T8$e%^u>=4&jd+mp;*<~uQbe`fkTNpz%fjwv3^O82&PPhMPmUauL+$%ror#A zuo76-%Qp!an;3vS$X!b@A>4_TX4^?v{;vz|Mf+%Z?BDvEr_YXPru41PLl>H(juH>x zQxh6QMD^P0@BU4xd6VLhuL53n4iDm14QCM2jymY z&x3=1!Yc=T8qb${M*}LYZoU{0t9mC|AUREi29|ILO8>zhm!yRVyce#6E~bztH=%rx z5I{8KZ6ECUyuR!R-pNMVMVUkjUFpTgeFCW*G+#@)uBZ=!Ep}IwSVZT|SW|~0C!Rx> zyqmoDN`FRN-V3ss0?g|L`icN4>U79EW(M}uu(=!Zc&~`Hf#QC z&rVo@w8?neZby5Lgns5zdaC_p0K(}dBGpcv?6S8E?c~jaQVTRFedNcHx)W*@DRF?9 zmOI&p!$hS-jE4~~H&wL*j4Qx!!;*hnYk`ylmnVUvBzZvyWb2zInhU5tajO`{HSL^Y=!56v|p(DawSH$3mJ8F_M@Y zzX4rfFF#qJKV#wz_sK%OM7Mn~91~?3NAX_=Sg}S$jib*U@_#ZL9fM_sE4CHCfK!qx zg}GlJIpw~~J?%(|4%OMrE^a1fvt94_lp&mLx~yhonsyi;czj4_*1&@2Z1g;33*P8@ zPvT~}c#&jQ*{tz@e!>7UL2tJQi~4hG-0NPxSZiG6YLHnJ<%sv5Ky*86rc~)}S$JZz z9!n_5Q)kNPEq#RMsG~)&|DGGeM4_V^W&a*>ULl;l*TPCm0V?5m>vTh=k6z<#<=N~$ zUmBnyAF|q?aXldq*7I4tRVqb53qybXs|ty)li20{ufNdLMQA&7W&75wjXgaUxf1^^ zh;hfS{y6(e*NY7fSDma1^bTa=1e;bvC!ObktotPDpTgvemV{)n> zNy4`Ztd!;J3X9U`1+u`>VKZ&_>>BYjFCIN2t<$lP0eX3AMvU#rQy3!9xm*HpTGagZ zAjV{3qJKJyMRqA;0~Gz2IEdqx<&d+fqBkw-Fw3Exo?XvkyaT}_c(j=6kzRXyF*9ON zVmDBANK&YRuZlc_gpm&gDAL}QINzdqDb?Q=%CS%cSGgb?rD=RC&D<4k&5dG%wQYU* z84)bx(IA}FC0aaFY0>Q>Ta#)2Aof|pX8~BetB_|waN?(ntO4)Jas#Irv}hNT85+kE zMzXK+(+|$Jz)OxiF`^PKvIW8}v1~bNWSz?*K+vzvIs_I3YqTv?WfTsacNs&Ve_@Q0 zwEs~!!VEnp$P6#KMCu>K-&JXn9}ou~zbgMpBi9LbHsv7v7k-@|H{5)y(R6?1@UPb) zFUxs*0F%Gfi2>i>^gZYp%$}LqS&|q>oNxpZgvM~VgTa{oJP+$JdNP_8{7*01z?ilS zYA-0O!Ud$3QX;+MCy@5h*a9Z32c~vjGz{x2=`WE1{$I<=%EYG!maN3ujfE1w^4S!E zz}WlGD1T*n7bOPzb;*C<9r3>IOfoa)7lp!Yi)Yv(+?(F50BPf-!cZzRj1H| zGa!dUs-@Nr(_-=ounl(%K(Ar^Gkk_3Hz9O@a@Qrr`q-+S(=Zeo9GpAX3QM;XqNf25 z{hri}&Mt^COn18=DOsATQ&Rd0K0r(T>OGVU zlvFwrGI=IR>r|l6iiBUA)#baLy&rwF9txERD6W#1B=POrqm3XsdT-+^#+&A8X+TR` zwQYrh8U6I{x>`T`i{x%*Ij^T8*r5wedY+YB6Xy)tuK+4R-H$Z#%==C8zp59f*5b9b z6x|YeVd`+hz?@2|1-9^4?%LNt^OdfL_28o|Pwwp#Spo^JFU-OA!^t*<(x8JS^IA_1 z!llr}v}ptz1AY+%9;jN*AZ*0h66C&Mjo@p(x#0m39cE>4s5ReXF+BBN8kg7^7Z^N! zF}mULd?vljc>90?tfbd1&GXiNwos_d^X>QIVEi-c7327A5GQCx(TsU;Tc+z>+Q|F> zEcVji-8gm&GNsqAzT{H?wJu}I^qZ(?RT!~MsvT2vl&WoUO1$$R^Q2?agM?mxuMr{? zvN1*=?8uyKffP+lm#KsXu$puM>5?{z*ZNj*f(gULj!b(VtQIeZ`~ba;>}|mYkMDEj z;0W z>QZ67xN|5h=$X}9@C{xb4Kw{E_#@qC4VW@c{SIv(7dgTEeSv_%c6!Q}T?kRtQO zEzh;?XUQZ=V9$U8g*&S1I9QRby@5I@nRtTafzwdSZ~P}PDH(UZhGWU+ErQZ)N?&1B z0woCAe^CwB%&m5uP7&KwcU5e0$AdT*N)e7nAUt}pwHdmv@CLp%@WwmEsouX3ouaTq=LVH}0HYEG_{f&Lh~XpvYL&ABujrPn$@`s^)&5qC|8?tj^KtEd;5`a& z^LhF{;D2?q#VvAa+kN=%N7WwB1-3#9)i>H^QU68#eEr2O0bx$ zD^f8XSu%1SbtXyY_a05vj3y#v4w-b|rAJI91o;#@Pj$TEv=%E9V@vx|@r1MeKXE*KfC9>GUTK7Y*C>^Dgu%C-~doH~wT&EHD3iCq}ln zc#sBI2Rk;U96_wTJzI3-Xhsz1P|fhaJ!tGK=9J0^#%UdcCWMC7gK7ozlb<6BnD+~M zXljI7nmxd&u6!4hHX8$Ao-a0O=Uskwt)h0+Uk&u1fYQgpl4GA7&qK_ z<(dhYRt#L(G4m z9!wqRA9tph_`r{hVpm;X)GrOM{JD2`0*)?ft}5^_JUI#}=!NRbQGIc@%a0^|Ul16R zVd7IN+}fj|<)eKrk5H5@IM`#TleomQC68{8N>pG9Nm>9Yue#m>sB>RKmY({PF~ny; z1;Ij`sMuoVW~rZ0UE_0ctRuSgSRYW9R*vFs)se}yySTjODEB(kb*rUS>{AOP7ej&+RkBHRJnLfu-&0Tfh|sZbvZ~XAB51z`c&?1n@Sb zG65O=OQo%w|jYvI>R#Ub9Jbq2qpYQ>BgqbE(;rq4g(J0Tci^2f&)w%|jUQ57q+nG$=8`O*o7LH)#xoErz%$9+mk zJWPViYv@`nF8l_po?er+b(`zqTq-;sjE#-uI&E^rh3S1PpBRRN877j?^MQA3y!Rv4 zc5QHJ2|VnG6#O{@avk>)pBOzf=ZrE4DJ678V-W*Cnv9EL12x3J3I1no?cyDT|KPm4 z5xrSjV{-5NSE=)FL_e4BE)#G_vrIlN-`&~5>Lb@ey@9gUuNjk`PFRf$U32+D1s)XG zfRJB{hM=)5uS(cRL0qSnLKPNe8iBE`gMT9Z!f#l8e`Cc|0Rmf&qxo+eG$oH*<(UIG zdWt2Wb53O-33|9`or~~~bq~q6vX;}0cAYs5P%crwa$jqLm>oV>O&bDq>DjX`7XiC# zr-Ja*T^@H^K~`WiD90qDvK{P`}|DdfSrk0s5L=I>^p=N^Ji&13BTPJf4L~VC-mrNu{~dNbTYW zJl}Si*q>vgSA0Jm@X_5d($}i{o5s9#Oh=5b+G&Yv&70M4;P~5-^aQju%x&530q#R| zTjy>)h&m;TiW1$yk`c8*(r?gc!xMRFXOKs&#_cRb$IjD_dS_3FbN2RUr=K67`O>dU zXpl%*!fDgiriyz%guPiMh}mjp23FB{$4clvc|4`;k&2!Uh{o8Vn`+`RGgnxuN9`1} zLBw>Yl1GY#shImu%i7@4nkr<@cLYy>CBHfuYoCC^4g9hM>AI`fGD&Wum`jm?ShSYF z6kDOShHN@!h%r#&ZjLi)+%$(aor&?3OO;%?5^qCxdU;;#-@#wQM8C%#C2tC8Zgbds zL>F_LXg{>dJeafzWdH6SusVRF_Vm#3(E#vLgTOmlv zw2Fq4cY1yZ8Orv=`F5K=VRw}`w<+b@B=dTkMZuA&l@GfPeaW2f8;;0u!t40;oC^i@ zG%-GNtcr{$oT7#aoW`z=Y+a^U=ZML;iKoHgdOYexb{A4pcTK&BUbP6NF57)X;Z*<9 z-?`3xce$2?>cyo2p!@pje@hddzkSqvoesF`Dh)W&;_ce~eyt()vBODu$^$bZndBZ= zB3fz%?!;KQDzLDf5v>#oCRUy6pkqT67r#nd_0l6sdTZ2ue~s-eXEP;XVX1{8z&YT4 z$ReQZF%qS0w1T0vZTBjuN+ZVD*J2D4V?;ZBud|acdkyB%G1C(?Z;K!_dkw zoSA(Q6x@rj(q_a<8gap6!Z(AN15N#Jc{Mh4PRL`51Tgzw6^aF?QicD7L;Ute^9 zwJ02NfoacUPOjS1OkXV*Em6l24mwA)U9~QFEW7*7Il4-t zZckF^P3xdqtz~pFt#qbj#(b1IRYkBx4OPr?LaE*^Fo5Ql;jlHIJWi$mYG9O!)nddA?!aqe~EWg=Z+7GrDi2Q4jJ5BCbhZkit%|(;2qW-wO;5^df~j z;rU$OpL|a=j#4=gRYt3z7!>dp_Z6vl^E61AY-Ko7U^``Z&yj6GGt3w>ebDbxW(Y0L zJ6Ry8B$2^eZ^=)-4c8#}KJnbWbs<|_w>I8AjFIq(s%WzS_<^Vi)HpS4nD%36#{6`@ z%W%(wqhzoPW#Lap(=|x<1aE%^1_tmDe~#ZO|NPpMtqg$GTTaWr(^f$mX|g$yo8B2+ zIdbrfa+^atW!hVX%X)d6Uw?H5c1;BJ>3%yo`lfd-g=wULwB_fiF*(i|{0{&`K)b&x z)dWuW-doEiVcU|kKKhS8efLt9fEVDh*$cF>%!5l;SG*=%xx-@(&f5a5;7-&nUL~pf zZeV+x=S^6R`*PF(xE!5P%(IhZAI?Ox?x$5&WNcIv3|)+qq|n?$Q)%XEOa+HF-8G$y z@Y}9;_+9-jUub)IeLTTF_+W4Ek?zTB)+BwMm7`;wH*_66v8(E_E!&QSkmgst5OK#Q{-PxTgZO{7$az|5T_Dx|Y3tF6C zSbgM%>7lN>N7n93M~7}q_3k)zeQfKIRR>Y-HZQ(HUIAGNG6!@?X{J-sG%D(g*wK|@ z>}Fj44bf~Zr;V=WTbudsVccQhgmD-=0Zcj;Wliy+V{Z2#m%-biZskB*mQK2vj?+wG zN^G8a>-NF5-R=Nq?C;*#ohr`l@a=m0$i%b1ds8W;#3P#yJ~lNvdxz^u%C|MZw?~0* zNv4naLp>7~U{WKc%eT8&laOOF9_+|Aht4)C?L8>%G=od)u${krMM0H;XW%=5u&a@I zH6qnb5i`holpb?ijBq4!x)02p8HUuExSki1x(Wd7SM{O`Zi@~8Z16XbkiU974Y>1586KdwR zEeEdz58WBp%*I;U6tQXR-Zu?TW;gsb*%R#R4my=x@9^jQ!q?t)b1X1)^!;zS_T*4@ zAiE|jn%?F~M-}(GY_XYp{YQoZ@h1^eKfh>agCHAO<}*w!!?dz7GfUZ+P7n(%3~ga2 zwuODrX2lWO;<(^oIoV~jf6 zb{o1VaBOo?G6jTJ>V=35hX@CzCWA#0vycP~#0pvR+$G8%9Z( zDX8{y+Mw-xy=TylxvNf^yV?UUc1aa59V#Kyoq}T^8$oC;VOtv7{6%dRw<+{sTOWoArlGw6uzkjyau z_r8Z3u?Bw&SA24MDDK%P2dOsO(zi9b#U%SO`zPflEm(8`!TiZop5EGBqdaFN;n_kwXfiR0HUO*Fcz!sq!Ln^0zJDeZr2GNMG2VPA9ysRmqx_l5X{oAfc4*@J;hC>ZHP=a60e z%A%dz2xG>a{0EtucS+lMm$aRPW0!I44vCK4u8%!Y&_Y&Sqx;V_qWaiVzrq;CF9Hbw z@td7_JyI$=m&P9T(|G(!CAKtdnzc;YMm!RdZMF`NB;F(P@)#hPTcerGs&s|)wMGq! z%UzDL!vRGfy7jUCVw~IEHf}m+cEg-8!K`^_)Bc066}FtG`P;t^y4ks<%@j4S9m(W% znpV!9W%$;dJtnz1d*q9ZN-kqQqj|$9`_b5CvX5(t#U-#qGX|PqCzVd^{a_QosjIKr zwCh;dZMR3AnQKD@m(P~S`-{7hy-I#r@-Ib+WzXzfpF3f6-Eqx54wDToyB!K*sfOp?;Ds- z*+;iRe-AId!u=lLj3MULX1tr}E0r1{z0G#-L20l`}i~^`Gus$)I#QgO30BHF`HJ z;i|qYQ>&B)tCXfzDg8RD)QXlbS*36!eHrQFSF}pv>#b57xy8fBjRI(<=lDsk_gynX z3D1TWZOiF^eTPZ*r*=a6+)5}Y2b99ZLSQQ_x z#Kt$jd(XZ@yVFzIh;?gWL*D=C$hw0Y%5vwLzFUqwa5#5;b?f2vzT zXCxTecGvaEtp}%fQl72_dhKRypmSqre`Hp-DF<3UCeTi`7FwKj>+D=X8mqplVF58W z&#P9cZnFmH!bYG?%0EuhDsa1kT097l0u97RUCz*H^9UcKC-tduy>m24(|EXPjP z`UW@Ly?QvEOV#!r;VSPK?;1GLJAU={&T!Yz(UJHKxuYj`4tjeodE7+Zd(+VRt+$_4 zJsVHnOyiudkbeUi3Ab{5YGFK}7%a(&V!mE#`f&E2aW zx3aWbJK|ML)?z4@nc1~#ZgeUtyN%JlU~+XayMN=Vty?|uNV+GJ9ILFJ8Q)e6dHn8~ zjK6=VYc@Nvb3~6dze1j4k1+~!su?YimS+IQg}G+Er`IQ(ssczqiy=h>R`z*bWu-dD z3a%XZj^HGlF$F|p?HEF2Il*kRx9y1GaLX(1h3W0{rl`A2IScObk~)8@&$fH3WwY&& zHSs3PeOFt9o-waCeqhjA$&s5sb5 zVOvqgZS$%k)qM)C%)_zWx*2SWFA`m{Zkz!o|8mQc{$m6XeA%go4qZ!dY+#(=$x{5Z z<#na+2S4MW(p$YV9nM~TgFP4-^M!Yo)<@%P?-Mh}Q!@a_$(ImuziZbMyQkl4T{t#y zy<>FCiIe*td^a&FKDuVf+y%5M0j;7KG4;{9b~;&bJ15rvLh@*YrOrkx={Q!P67F)I z$MR%U7H+-pYCEw)fV+ZNcp@00Q=HRJ^eOJL(DW`CvIr;9s>Webi*0Gx-ja8WRQl6; zQ3AB$O_QF!OVIe8Mz=e2bk1N+qzw)$nJhhUvIoGZz)SjY?@M%$Bk!Nun)P^7&cc&3 zzdt!eynZjyW#b;et5?Bzi_E|2^^(*?sX1iKPNAdrm#EIW;?PS4t&`AIC@t(<-Way| z!u9RLFMzD%!9?EkazvLEI}I#pwm5DqLL6jC+dxv_*uJaIV6i#UORJo^tk~>rO-%xN zIzd#FLU@8*&VZy@$`XJ)pJr3fr2H)Pc1P^Tp z!zxvEpjvaSSe=J2!x#9uwnq3(nup;unJq52Cz0$g4^+CcJ^8_E{tBz~E_j>szkOd* z$))<}!mTF7nlpZBm-{%b-8)FS5+$W(k)5WiO${IhmTCR90!fNANh#`cnIn=dG8gJF z+U-|ypAa%^_vCabAY0uITXHk}g5B))S?mFaC)pk7=#-pn#$`+TI^E%9+7)$}?(2Pb z+zD`?Xn1z|Sk4_X8lQN0Cg*}V6 zN9@;Eww-drs`$DJ2oYRPHGzA|)lij&Wh#2r4$KX0(oFHv75wJBcH4Q;&gxX+F_fn` z9Z9<{F4&}L?pb5N&fVj3u$^57qaaB3pp+0p!zDvJ+7r+DV_jeHb`oDS9UGdu{YPCP z!uop+k1hPox2FfT`E5bTsKkT$V8z;V?Jluen(#Xlx?WAgycWoh06*QyP$;Q(m2l}P z&;pPKi|&9>&_vE@DaXJs-K$(a0BXSc=x<h(?p<~;ioh65zo%2D88 zg!tDi)g_nYPfWkY{qUDQ%>4lRZ3g-kn1`5}8|mk2FJGs}HXHFK{dx;3e@@E+$WCMM zh*oCs0V(4}T5mMV%g%1K{HAJE9dD(jWi}M6hV?;K1Emsrj#gnKn*#7S{804wamrU>@sbmIj^0tgtK?7 ztvmqKifmY>*5)KqtB^gmL|Tu#;_Wc=<<&C@pvjvVmF*#8jGHOZI&d5<$W|9Q8Qd>h zvpSonfEx!GO}6P8l@ptV{hBpIDSBS2bMt0ps4p=*>GFq_Onxr3YBU^7$ba5fRTL%R zKdLC zV2I{RxW?5UAP>p5w}-IK?)Fx>x4%zC$mbT;M`P^c(NxSI?TqVd`42As2fKs)5EEfK zi2)0kfkxp=s!~t`v^3N~TJV<^6~iJyHtKd^GPOxQzm!+|-j|O5AO_06k( z@K5{(u&_R1BcwdSzhCIV}jzF~l!cJ*FE1guU^at9FpM( zCzzvbmaQ;JCdXXMpof&U&{9ZtEdAC^XG^Dp)=cU`>ksO%2lM@ToG}87x=XG*B5|vp z$FF&4!bKV|j26M25IMOnczhh*wL3Md9=A`8lN4b06qeK+C@K|NNYm>UvBqkF2#K^P zINjdjKz}N6qO&KR&!>Aj77o(iqcu z0D{nH;Ax{Ag+>E3atVE7DBT922bNk19Y25N9ZL>YFHGeGrZ1)Ed9_!nv%Og94V3!yhR+-&N@t=fjL>OTMZ}PgmCE<&Lr?cbC+f2`RK4$u8kdKTA z3qKb|fFGZp`xib+UcsX-tGgH9!49%t2Aw|2e4ME% zm}nV?*&L^CRXhxCRlcCtqRY2x(GhiwmbdByYuhKO2At8&0#{gsu1_y;g@x!Uz_Dmi z>$0DxWrW9}$sp@>9s01$gWBOdBiP;f64nXUDqu1`uf$X7Tz?g%yGvHXz=}AQt#jwf z!}=Oat598~KaZ)Xdi6)NDtd8job?zB6Px)}E(ANYA}TnxyJIm+d^TAkysIxg*GI@z z!@{o3lWRysc36VdWIs7FJwn)1;{MGuJNB~2@3&16a_!w_Ku11bU}Im#8S3uy_wCJ( z-IVFwS&F#b{?WdU+41h(qqm%x**-+Rv2$+c+Txl6YqzbE$FXMCH`o!@%zj2nlaDeF zFsvkykE$$i?*7FK+zz0-$T&bte3Ge&bbXJOq0(yvJLq|%DIe>95Ct7u~|S{0V}L;5yA~xHp~dM>*^&e0U1TJgQaQ(^s2>`=)!Zavo3I*X*{*b zw19H}OwELiG4RA>wHZB^dSuOwMMTWb&x^d%q9i)#bngi3`=lIRn&ZUFHPL9I z(Klx^)dYssio9JRe~a7_t?aMFz1-Sai^JRH_DpqxC3JH;cP8=?Z`I!uG{^EA)1-fD z%ccRF@j~Z>HQS$zOuu=3vXol2!?xubkd-@_E^?97r8M^>^L2)i1nxLfsPMDXb1}LNR8|4%8UKfCXyt zd`u61)$Nv!PAbMI(U~sF*&^thGdyE8bzr$cOh}5M5gm0l48&#(Us2Pi#CJn2%AE>Nhsxbu5m9uT{oO+j(P6OX6W&OF zYRAT~^m@5BxeaW9xEwat;NG9gK`TM7*yL{@94# zu(_J*?_by75B;Jww%KkNlY=?b+J_9N$w1T3c?;bmXyB=M+d*7-x(SdMO?pXl`#H3E zHV_wMv1UUgI$^`Dgyv$+Zo?}(%n7uPdWH2;Iqo6t1-QwJ3!!gKf8!g|Lqnu8^o1`B zef6ulPd`f}QUiL$u~)Qyu?V6aFK7XaUI7cs7~5$XV;*C{;Bh3IWsEfrpH2X(#EB`h zSjM;(p{XRGVB>mZN2G;}-I1tX5DQ^Nb47EhkTJ~@ZdEa!wQnxIwH)ZO3SPT!%jDGb z-1^>G(+9nZ!`rd&L*nn;5?H-^GL!bWt+9!b!($0g#btMi+x4;R2Oat>jHSZVnOX+N z5(ZF~Ffe*t755_HdgYYWVF#h0#bs$Ewbq02ta1T|UK7i$1SH(BM3=nmOV9f#0>Cdy zY7P-WGp#Zwov#IQ_?bW_sHG|rhsV_og+56jAZz&olEgvF7Z<_N!DyH!L!%Z3J5&pF z=9-lNm&+Glp?I;dqWE)Lq0s$`Q!;t_JG)2CS)#J;$0b^H8}V*TRhbjw)-O6be{Ar`sn&pH|`OQ>w6)aX+D_kEb8%Yn(MVP#SOO) z<1S#jJk?x>QYApdAwa}3B4X#f8j|Ya5Y|kAWBY2Wz7v#yI&bX>)#GUvl*=RvZJl_P z$jYRaU%dvE#)uN7cHakR?$@tcjViorBH}YzOqL;k@(b)5#i!?iUA`){_aP;g=`ERk zDQf$lSo|RSyKI9og3h{!q0jySYX^RU4Du*TIK5@TgbEDz)zWP_x&o7QP3UX-4WE2j z-zDtGz<@Zm7}?o#@Ehr}U6W+>w4MtZtCa-ulC<)3`KCk`{lv}1&?bjCBf zY~BaD?>MbPe=D`)C zK7Suy3L3@?&ISZRuUg?bx8d$|ozICp0%*H$;BtH&p1Hber0 zo#9G(mb_`Yx@BygDDa%4vpb=bV@yIb}fV<&TYv;s-1ulL5P&k!dQ6mhe8}c4{=8)Y~f|CiF1EY0iXp*>Q zMDX5Sy@FJ5M8VCT%XQe3)B(p#`=s#5q}hv!E1LvG&VSGp0pS|asG>ZUNKny zzyAAk!rCiI)WWN5BY0`;6Hh(7@bmb9m*o_NW4#0M`L#MUsKHK zALH}DZYLjF_!;o`?Qnl9@VCMYGaH$0WG_=&i~OC_`MbJUt0I4wtnm=?_%}4kjg6bu zxZvo3)=hnJ$J#_p3+-UD;ibqop)Nv4l z>3MAnh{1XggK4QgF+C1^Uxi0?y;R?@ehXY~#v{knrq^$w`%cFvR!y(puz5>6=Mf9k zWo2+!ulw5s19NME;e%Ce(?)n5(F58VvlSGbLsred4kA?AAVNB!7ghds5W!B;pwNGv z6usRiUydKr-A(*pcen5Z*#-dOHY#5~`IYju%kCo-U>J#HlL$bJP$(8}gBapqyu5}K z7ry>$gpOrWi)n(no1IJ_^KPcrg`!ZPv3RVQfK^Tbl-S!VT5Db>E!dI*9N(=Mx0bt8 zMt~I1E)?ifPhv%U@CkLDX*D)2<&~YEH*hAm)t}TiHfeSjkX#O8XpHj7gq3X=IZQV` z*=7ClGyO|XK@rnSrHb_ZV9O3d`$|A+w7rt`$~xEE|FN|?uzPqa5vu5AtaG{Xk<8Iz zv&QxMS$2A9!C-Mwuf5EjmQvgg4lpi(=>V$Tt|~c3b*o}>tr|*Bsi9SBYSS)Ngp*@O z)ro_HfW=j&d^NdBO+dRrbZQVp$ zH({$fF?jXWDuds)qAxEVS=kqtYF^nF^KxIz?R~K<_rjCY2ve}<| zn*A}Z?2mD|KSulpm9%xqy4prUo0V;>t5E}y?~4B#!wiSqtyYuXm7Gvk*J!5duFGxNIi(9 za^I

+yMl_$w=aJLz^~deN_TAauc!w8mPZw*KO!h{Y^f}`%`+q= zGJ)P)Prvcf7q3_$`~vwh`tX@UZd2?;FRGg>LVA$lZgiaOL{T z&0?+}yp1yRG;uX+mIr9f@)FjX3b$&OV^Qp-!sQq&PQgn`YCaRO_2ANGC36fH$H5H7 zR}?kJHOek5YTnV=LnDcCxgPc;BXpO$^9*nE`2(@GV&~x$lDCVJ_kU3M94M>1Xz3-V zEpPbMmC(hw?!ftVhpsfTZzyHIVrBFm>e!iEj@}&KHMq8kVQKwv-CiC=yO3GZ#L646 zm%iV|F0}RK#S<(0;(Y`5Qu%G{WwS5TUS7SjFa9@RF9ZJzbkXh85o(_@OZF-G#_Uta zZ)KmLPqcQjE;s**^y&Ve;|Xg!uYMc)U|(L+<>p(hzNBeiJpZlSFwM{ZQ0MhOt^B<2 zza2~K^FP!1v-lF_4}L?Iena9n;SX4w0@$A}us?n{`+cV7XZ79eSOJ*EyfXCJXbq$2 zm%!Et1+X%cO0bMOG&}SbE z-C(}H|JObLU_2uXJZ5>6J_CWUsh57uQxGnskO#C@Z4*;|m14@iC5cSF0ZiHZ+hIz* z_AAI_n)?Cs2?nLAxYQrV8<-)^H$Foy>(7hKM=tA+{S9bW`HgGWw*H)e{=C3Eb6J1n zH=tqN|10#-<)=aAXSqMYHy}Te{}uVsb$*TNl;V=k556&-ANlQk62hEjyljPhkFn^H zRn=6&D4uGO%4k-VVs)abCNX<_Zl0_dR|SsqEr-75!2%7dcEsR zBU`U$8)v4T|9t-W=kuR`zWe#->GSDMF22Bd*zYr5nBf`b=H@d|6Rko%v=%SjZrMd) zoc`P%TDSxsrkBMOE9`*FQ?05g`HWz2N;*`tIBTNGNLS=S3EBA^W3mVyryp}|HPHZi z&ba&p2;Z4WAd1UcLAK z*E{{myd?4=d-W@LuMR7FHF5!ab-c4z`L+6I7++ADvq!Ov#uOP@FGAl3*D_}k=JXpd z?rRkgQ83GCLd8^MC2-T|Kn`c=5Ws5J+Ri@w&WTy*aMpZ*xH&Sr$%(UH=;h&J=XG;j zgvA#V0Q4_?$1=y`#wt8p=&8!uZEOXK@DW-s;XEv`|0UK39ox^?|@HLj~mgk1nO zkAZY2b{wp2Ed&i$`uwy$a@Juwbg(h$@cfvP@sa+Ld6L>f{fuhmLAo`hBWoBRsa7$S zTC)m@$gF}Q;xbB*K)4igl)xmJYppSeD*L6&qOH8pRMM*8B%EP!`YHebdAS8~n=}_+ z|F2Ksh=rNJPHaGPF$3r#8)hVQ5&S|zR%s#!GGA*z7Qi4UCZ^H98K;;ULkDK>gj4{V zhfMa3P0>0VuT%H( zgO&pZYj*Og$=!!HZ=KMZjjX}NH1}`m+ep(P2Wv@`{K<7=d&Wna$?cb?b|-htN>EHu z=Ju?&FuS!xZyldmN7s`kr`zr|`8bUX$~#mi^mp&j{>~2V=LAOCp_EYUcx2U;cW80N9aYHeZeXp7LA&fcUiPq10~ubSO`;XqTX`=amkMSmX8 zIr0+pb_9dD}A|eE2HuV3v2TTJ8SqEB%i;zq`ObC7qc>| zJ_S1>DuDsNI1%AKA)j$(={e05183?nYKD5Rlv`7-w}T|vtyUv=4owLQLtJlC=uE4& z1&EqwC7S8+n&4-}DX3MjEnqs+Dn+PWvz$5)W@J>onP7A0 z%Vu)9R3^Y|+CRRoZ^u{Y!>J8fpYPx!!7?A#GST%{SNZCdh1BJx4GDjK<2|GFzPnDw zLL*n*05F10uCRrf8Yx!$w)8Pp<_(2X%mdJSHBG+0Z_~`+#!F{zdWGx3zitMuY=!`e z4`WLPF}7qGI5kTuY{{U^)7t|u2|05qka0zgi2^c?5>jLta*~GxL&yh6BvXYVND_&; zgp1!i!FUK7tXxZLk6=7Xr-VnD0=t}s;s`O6MMeVfDO(gyyu&g+4?HDMYxYE2>6HL0 zH{X)&3bYQ4?s~`G9stXiy9at=tn@a#KQR6x*737M$6ICnp%MDJ_eWo6fAn?h_>8Dgb7aWo$VfVV7u04F9nZsFomJvowing$@>mv$UjCo%pLe{dUY35Iu@U{H zk$=9p`V%ddC*Z*y!}5HZ$n$G*ACRNp{X4>)-x22UFOYuz1FE0D>)$#*AMO76Xy@mn zT|fU}B7?tzF+8ovz_ltF+=YH#WImz%{p-SweA_!p!z zeTU>r=h21(2u$+uKwb&fas9CEhVZt_*s$LQ>>**K%o^z5N``Zu(i?4VA0`e7bE3x! zJE}hqgqsw=k?7HGv{>zKoEz`tFi)+dw+6HLG@Ki3c<~XLFo z4OSn^zt;B}zMLHxd8O~(syChF`lfG~-hcQw--i*6a;56dO5o#>ZO3*D88q3EvG`~s zr{~hc&G=9)IdpU~wdcsz+7-FlKy&XEy8`w8EhldQnPNOEVx!l?oLr*V=-5TrXnsvL z8skFY^|hO<&!LV_m+$UNzSEa{_kK^veK8BUmHU!du`dbImxQ$6rM|#^p8>h-UXxGf zUXve1`hxcj*WH(k@#(y4?n{-dmxSDx+$w!KO8WT*(PL%#=ZmZN!?2HXITd84>F=Uf zR?0(7;!H(@bwNt$2RJ_#a2&lnu-^!_THEBNQW%>A%6vqVmUGVOEe@PBhc@J3!lTO$ zLB@D8>ylqUX8SkkbS)mQrD^HkAB>DV`Io}|*}L@r(EMUk`7=CR1B9M_1D>O|-ZE3e7aifb}O)?|t!@fxWwuvc$`HFZ!Gty$$>&8hQq*0MiH zU+`Y-@9v9zwR^Roj)bqhFL^?QfpFfO2?oUtL^Q;#~(M*0Lu8fCg0G=)MS`|wRVBGXJZSwg83do;Pc_)X`l8{Ge zcB}v^yduV5{c*j41Bk!l=ZE;y%*Z7L*PIXHPnx?vvYwLi+!5W~w^|=m%FU{=In5vG zC8|4{4jU=;Z=pKBg;K8ot@>_{SyTL(oWbA1=IBq--=Vsr6sC*lk7sTD!SZ>#<^6 zSPC+4!(55|^n_HK=8#xWTlQoh=F8G!oJ1kOOKIBee1$UEN&=5F^o1NLW{;c!d=jTa zVJB$3v^NidyuUj-4~;&>LJMpQ~m8W9saGehI@y71_B$F)w|_!)Gn@UX4Yj zGnlglrCOezvgv?)3m9%Ie5Z)MgJI!}Z~#+8iS7UfA48H9y^*Fm6|gSl|KUgniF42p zoRt#-m3%-s1@O^LTX5>%<+}$Xeq*+gDVry&C#5{VYveRQCHXJ+{Ks&{-}EeR^r2WdD6ZPX3elRDzgKrA&=b-;*L4RfSB&4Sr7s9$mC5Luf*yd^>(0QktEDq&zLydVP$PCM(8eRegJETOH|hYPuG3&&~W6-&37q_F>(XRh?2U{GQ6S#=FH!knZsy+n%F8PJbQuXXAxLN#whG zG$wLC`Kg{UIWHo&!Mn!$Nf?t4`Exn?6Z8jr#$E1clm zYo90jIp$F`rccvfQ^q8(n+xxcbM5&oNIv%<`TT5!IbY>E?wWJsn&-Tq`5ux_d)b`7 z_?Ti5*b4%<#{g4W1z0K+p^K_akS`*j2$5hUlXfdaBGN zoHk7MU^XXXrJBq(yEh;=bdDT@6|ju4czz|KCV2*yfeybgVUza``yGr#+T`DC-+a&N zh?|a%8YJqbW21|KmC2iwykBz8c$VtULUvq)U(c@boB{EBUOH#YQQbEHh8OLRI^X;R zo7FsVMfZq;a7I`E25aXxSk)tP2=>lBvw7ta*;gEqos7sX#TItqIN)hCo=?$__Ke5% zq9+aYcy^)jeB*d;{``eoA^)0UCFHJ&*u?*j#JD+raCnm7atcFmbAl^voVe14 z!<9A!+PXf>;V(>b;@}v-yW#Tu6emLQjpzbA`)~v!!6Qx9$tcRMuKZ@%5h{yoY3|XR zonr?2_b*<2vqgQP!c{d48+0?;mCJ6_2P(`h7sT9h6{X@%oC zxDR#!2cvFEI>aUv*ObRyUgKGZ@ZXWM&R^pGY*G4?yoj5o)Ju@(u0{4Pr+H$Te4H0y@hTT@ z@l^65Ht$_M^2uIAbS<}r=vqfUs(U$6X{hoRT^=IpaWI!nAwfm4?Fiefn6{*&?DAn5bH6Wr2 z^sZ3sY(q_KFap4#%^C%`vi)^P+Y&}TUud>aF?+$VoB_719}a5@=B$`DP8iIoFiG zKLYJ@qw=R?(5|5#*O}eEM7FBp8FRy7(e3g263I*!xW<|zqhpnoar3F}VyjNpaYFqD zA75nB_J%8=!KuiaL?b~GkZ;~@+|HQeN)j?dcfUm+-)u>Y>KC8FUmsm;jUaboRBxnr z6c^`6!*57=?&4y=PirIe%m0C33dx+96>3po_iKj;=L4?N zwHW0Ggwz2o9nP5^4M7}6Uu!d(Jb>S5ZD`6F(}GB|FyTBeR;3BQ<5`W&MrOloWECKz zLEeUrJ9m0~<8NL|mP48qGMK_j@S};R*g2X4#Ahu$fp3AW*x>AW@a*ewFr9<9E%a3L zx#&25Ae~W=ohe$Yv$3kSuG42egpU1AND9PPUcKkd7iQFaaI0~vNn+JZ{=oQyjW5Ei zIhD#w41KRpE&gO>c1@yN7*4arnT2{qPOtgqPvo6!7Ruc_x!l>wWhEEtPITV*znxqr z`lDa!oCaSow~bcnCK*~f-`-AjS6F!0~ zMJ=@4htEnjb)csYzEz$hNj)t-M=qP3uhT3PePhmVekYDeH+Ot(KuF4?v7fP`D z;-so85~;4hpGxj_|9$CU`oBpX?*hoMd|`FGn0Iwv@*OwBJks|ozahNJI617PH%j*z z2D}#d3#mrNzXP~Gzo+>;zJquNwy`^v-@&c&4g&gdmlP|Vz*zpg^1GKvJD|_8j_NKExQ=8WSHm|*QG=S`Az>TQ^ z(X)j<>I&brP&2&pG^xjlF;sE|q*$uDMdD_S0yA%-D~M{Cq}7!;4F}UXCs(j3<8O3a zH;&71e1o&x9P^@vJ0}F^A==3V0leJ7 z&RHBFI=e#(GKZkOg`O&*G0hhG99~(P)MJdsVs`{XipUs^S=}Is%)mkT)9UsR7>Y?o z-fj&Ct=e*v^e)%&Ns07z^DT~>w|0nM{S&ljaP;>wZS!|G46a)|Ll|JMSX64T$=bgZ zul@ctAvmnncP4qEdp-1E+SJWvBv(y7XP5RmuVw=iR8i==znC;&ZO?d{i*lZ zs{2t3>X0yXeAqA4)hTBb*j71QIJ9zy`c~{vAL$S_z*s(ue*hj>)SpX8f9SJHfB0qn z;XD1|yZe*xn4Q|n{mHM`pFHVLUhWTBKjglt-Lrl!COVQ`<9!oZKO{c#M9=zhueLw7 zPJhyC=?~I9d2}{i#P~M~jlg2a&x?Ab!gZ<>QU=o}yHTraUf|g|D{n!1DZ|cXGdc7EwN#*`g`O$}Wo@?5 z=a@artkYXv?rg5YXVh$A7M#hvf`i#;yjzKBiD4AQ^Zx_-E^WAP2}Ip$HeGuts&==UY=)B-$Ql*|z7 z!VIASQ-@JGr7$X|dKi_9yi9|&oKd-;VpLXUCdvx&d67j1#4!(Cai)UN1#$4XSTqjQ z$^}(gUJJG1Y#!R=V570PG7V<%$8b}j_r#KdL=*FJhGnUCQbu3~tGhDC@=e(T`JG$x zwJ_)CXI+MYJu7o8zjg65@3}h`a>X`9pQVQtj%5V{0iO?;Ko3TQ;Uez8%xk>=B022j ztnq28JB$5d^6czu><^I-i7h_dBcF?jEqc}%TO{%!=b(@D$me1*_ku4$Y|*260NJ-1 z*f-5Ds81`|!y2fpQ1>U-=}!(a5e1FP!bLg-Sml+w6j`xL5z?iI^a~{!O)yW%^&#}f z_R9IEI;ibZ_o&qAQAzF*j-TB|QQFIpuU?`?sh?6<>4-eswbTgC8KkILYpo%Sm_KAN zAs;nT&;h{?B=C=sdwKVQ(8mIWZ`)7q%>0;>sqG{0e5`0h?+oPnY`hzl&JLKd^?5NW z*V{*-v_1k)4K>F`Yjtvc2ITFvdguBq(1#($MXw+In+GNmA=?y;PSKnLRUhFwXPfe8 zb5I~44gn4`ki1KvX{&;xli3HP=!xdGspkKBKjVM#i?Bti-MaBLHw>1|x0sTfx7@qC z8Kg5eU48gCv*JzIn_qq3?fyRc*EwH#+m$!q`ibW>mttJj0cxCj9o33TSrlG!Ar_U3 zv@nk{GRIXkNuxDPr-P;=YXeL=Tu0${EC_=&!OdcNNV|6B5&SSZFSSih zi#JN3SH(~m#8>rl&M6aRH-*B9Y-Lcs0Mh{4+|aUHFkBzs%QUalm6CFc>S5>MlU;XV z2Or69W_R9v_%byKJ$(ha3?sD{wZ?VbH)3zj*DqC5(+^3vVahr6qvXs${{icaL6y$< zlcK)i{#=Xpr&~HRki4>e%Guj_0cY=zk~_Y=-6Qh<$?y2C#W@bdhy6g$cvc&am{~f@ z?3Cu{%lLN;sVb&c_d9@B{hN|p-++I|e&u(BRw-BL$25uWq~u=6sIeD*6OvjJ<{XUY z+fuCP@}BWTRv9arSqd`K%;(tvZ9tO0EOl>F9?vfH8>GHE)wgW6HT5+Joc8c{o|b#M z^54m>>F>b&>?P~I)V)gLtHR*}nf@BB)hzwKuXIZ^x~iXl7|HYJOdH0Du?QOH9jALu z<18b2KF(YVf9IbP9>gxwf#w`bBdXl z0OyLFH$K-RANOj{8v~v5Ms|(o4I&?M-uP;de4ML2ZpExO7}w?meKf{7%@C+lu-`td8>3L`4`-u%T@RGt2>jB zG2wgr>$*qezKDDKwc%RiFuo7TUHgJEo;y}I=PUFkv_|<7*6fzWLV(MY_sGYOK78lZi(s=c!hONcMMZ^*>n)Uqgf}R zI+&#E7->t6DH&1#rW@5rNV?g9Ky=p;!f3E__h2-4=?$|dXZkq8caVM8-o1ptVD`ud zimB#~9YsuR0P9M^N=Ij!x8ZemD;m#Fna?}*%r(*-{aNPqXncLtLlPf3;041ynCLbw zv;*N1CQvgi%sEPCV@bv|iMbc%3^B@B!YINqR&=0o+erWv0&@-@#MiWDO)!+q6-pBA zQC5K8Vp7{NHci!PTipGF{0IABy~5qp<4l{X&}OPthV^PhGBB25Z5r`<1#tv1vT7>`OLi*g zHkI1ZLfL7<$sdqb2V&9N76d&DDIe`LSp;cZ>D*3{cPY%IC-`b@H<4AfH}}%Q0_9>c za88KKqc?L_3$F8mrw%I6qs0h%Uw~%|eWtocv^A+yHhZLKvC7E}=v}m+yq7KvGkPEu zbz;5^w+ADHQewe~QQ^d36z#QSswwX=<)*N!#KNGFDk>nNj5pi+;g--4@PvvnkM&`5 zd{j?APvXcgw_CJhubC{mNf`Mx>r%JueeVa9YeMF5QKOH1v~MJAaV`En*7)XNV)4iC zcrDp`xuuseCz&~_Nc}&G%mKbB#5yC4bcT@U2})~TMrj3PAae>z>r4xxEe`pPCCuOF zAvoI}Rt!2Yb6cMz_#^_9IuAuCPXO!}|uCblAa}LP>AN9eT+0uxBz=-j}X#=X{>x82z4f>E_`b z#emc68l1Z1hV=g5Z$6Ty80w*=XEi#s-g8tx^(=|LizOsS8g9Ssb&)bJv@|vr=Lgq# zA#tXiC(AcaqV6GXK?u}jWQNa;Jv{~@)Cz%$9SVhb=Q$xWkM_ZwK_5Ue^Wdi!KYjS= zhbIU%mEm2G{}WKHV^0$;NdQCeH(Tg)axtzqc+hKa2O5RcFDlL5m*N%RLyR_s5ZBT$ z1h0CoK8$) z+LeHyN0K(oi?mHn7&J%;gL*^fQd(<9L$=zagh3doM(>pwX+LrtlDq!#4woZeoVE>4 zRNwd|`aO`!wP@HmQ}p#kNS+)0@2GDPWIH-J6ydHsx30UVT4VMVJ1LsX^J8yQkoX`zPY%bmCQRA@z6^8V{5#!NO$k&eOX`dgsGNg2D zzyHbX;v!B}kncjVjVzNpMD)I?$xu;bCGVqJVcAMzK>Y%k3YadIR~bhziGbOOtmB-~ zmo=8!F0zGOtY||Y+b}1wn2iC-e;BD^qYY^VJ?p`XwUC7TGmlRXcYCZB=vG}Fj#VEN zIx{joqk^{I;atUO9e}d`)@?&huQTQig%1q^*8W@GdEK!+AKuO%-S?(TCNRYQzI@cm z>RFpRnhWe0o4pgj_TP8t#Et)U?|s)?^XRKd4FcT5-hupu7+MhzN^DU{>3R+*)d=W^ zlb5Yv99h9Q3*MU;KraJ?AId`nfK;#p3BZBV(8YWl4Nf0H0tkQ)U^9Xb0IsAH(pj(= zd;uef!Kud_r%E02av}6y(2;w&6MS8g!9i~FlDA%Zx%xJa+`_HTMie1zAJ6f(T=`1% z9UQhrZX}5Jp}pXNs(C<;YTGSTNLy-YU=f(H5Wq1o>!9+|%M1E5Z5?4O)9En7-EU1Rv6DrFqebv;;RV*pLHcgCwdFJLfM!nMe_y zE!3z=*gV$b1qKYfkvOYRkFn~0>D%457CMiktz$M?5VDGW@ii< zyB4i8aj#0P>>T<0v16f2pyhvic1WwuQ_jYAu=VElnab-Qq$&Eik|(?P$#eJLPG1i1 z_t#U(%8S;DA?M;hY&bp~H$8~g9K_kagZAAZ9j015+>z(&Z9U0~O4i7UiE-5HEe+(F zThL>!#9NV1PFr!tIfZkk1RpP>nu3!aBr_9aMYkJcCpM%^s%M`53AQa746r2DxN}1P zyh53-!%1(&d7Ws51grQw+TnAyxD`!F44&9IEfpcX4ZZJnOCQtPV)0^st&`BE(V~@$ z+Db~JG9_+skCJ&FSE+I>Upj+TVhP;VbfyoQ(K&UHaN7z&LU!EYTwgw4y(H|A?vQ&x zO}*|@=8R7zwyAm8t8baPE<0n;arEa@{Oet_RxbwJi$9bI*)Mc<2$ZnG~uCI|(wT&n@GWS>>3zIAx44!QG#FtsK1Y+vH-WKe09Tr;66icj@0c_4KRp zUch{*(p~ABasOWTXT>HVnE&{$l=(RB&!b9zY!}fV_e+qQsg>5#^1Ap7-y`KU&L633 zChMuUEWf#)IqOzAOEX-g>ym1>r-GJD6J?2PLo)=zNF_#)pzzL<#R^JZ!Y_2<18jyw1g-l+nP z{1FX<<>RAx)SuHTe27)usY>|D53o6{hCZd>E8i<+0=~!^RNY;B)!Sl?xfleK81h3- z(ch)InT{@mkJGC*S(-)emxhdKj7`x4+#Lq67H^y5@7ax>H2 zAEwhErn~;b($O7`mHT5^u|F2lAB)l-g0)1}(W44}9+|Vm#jT^{TGtW5Xd~f|fcRv};a zR}+w3T$6I3Ne$RjsQuql(7v0Zx@*<6T83U$t9IdQ%(KQd)~Qu{jDGX7TD1$;Rlzmt zDpE5-*6VwfI+!)B*EQ>^YtcISiL_onq12AZcKD)nRd%hqipYtq|F8Dc3kCiRx(e!R z9MU>^sHeWhzskL&n`FRz_ms$q(9&|EUDr8gi;qE`vshrTo;j zRLiUIxO){IcNXr-Ik-A^u=tkTF5$8Tcrn(#X%B0-*P!Dj^mDpfWBL609Aq842V=}=kl=bOS|1*$B`BIYf%Y=8 zNk~uqT9t2=C7Bh3COC*`f}N0KQs4#88IiRuK%y~_0*BoTKr*-zc6TapPDsw5?)%C& zw~%Hd&c%v5&I!?Z^k&XvG`mWt3vc?y9?TyQXXj$^C?KO4&1z(ncvO|>2yivYl+k4F zfTWOgiysbz z0k$U2Wjcv;0_5=&sD9c-Va_74PvU?R+;vfJUTB$IUO-W$sf@u^nu`{y{b^raq)iKR zjNK7R`*2#Moc`Dmb)FS8^I|D@POzy!fp}J6=fzk6u*-DlJ9A84LlRo-B^yBna_}sA z5o6~E>Hks|zv4t}PJe+D)6LsJWVpqiP-H8wUF%NP01 zq_B*}W_Pf`P&Ae=6nojII*Zx$!f2@moHc-!IOJPQ(utGCV+~aX!61ENQ1y1`i1Dab z&Vfm~FTr^-uEqD#`?60eIR#IWmw<`-WcCP2e|gis*>m^behJ#ozeJPvCY*!#VF~@# zPS9^{Y#7jQaq69+uFg0dzTwAT!lE~jd{mDIkV{X`-~YQH$z+k>7Tp{GHOXJM2!3|X z>-QjGqNkeGOK)$>(toQqzEqs&>KSymrU9!6E4^3XFe#Y1KM`z3@ zkZy}oN2M%8oTnaE^3(xyP(qcbg&0ox(INeyBl;m=TM*;uUme9cMVGsY`N19DFy4(0 zBj=oRx%~kN3IkMH6hns)Vq)5mgOnOK&NSo;{-9PL2p6}Pv$g1WI^f^;(Ab`h5A7b_ za$PW(9_l;#hUxK*>1@pP(6&cEbklmwn__1kVxC00ZHW30s+EHbx)MPHjDeQ+0DEc- zM&bbsC>Fp0Ie0*>Y1^S*K1PDsrQDWuv`kYDOz z=bSFi1u6J*X=s_N!n1{5tCE$f7-SKB5l=kQ_pVgBs(=N8-d8n988>c09~E zt&t7jG8SVD%2;f6Pf}Vp4a~y>L&6It$|#AM7;45&SGy2W0+s&Ap37b_I(-B{QEYdg zJlKVXVvEnzUVGxUk#sQe_9KBS(H@vVIWM;WWdWiea#Eo#MR0O$b10n36MkMX zlf}q8DJWop*G(Zv3RnaWz1L@LH*UKldKIlWT_&UZ^ z+at+BOJorSS#U@e9O#BA&WmJWG3Ucb78a025!Xb}qy(h|MOJ1=GNx!uu7QiKpd<?wLfd^{gJFBpo%YkQ~Hc{KKe&A~~MYn)oLF^3r&))SwlS}v8I z$SRdNSw-W8C5_Mu*I=aKn5iVhYgj*cv3?M!_!&;rJ3ER(Hq3FPC=&BxHGEF6&kJ^B zhV50P5YSUy%wcyV@P4P;c1N7NB)*K^i`*AYQz&qPt0`##*4xDNCQ(3wlj~=O8kn|9 z0)kW61xe1fiy#bP9gqqJIj13$sO)yyvR1FA@yKLh$UnT}Wt&EGrR*)a&A!`)c5HdL z8rrgJvpZ54xq2+|L2o#gj;%`s?`gCN9!ere4h%kAe5B8O+)&&quydbm=uk@;+*6a*LWeOuKy^5Az^V+w++2? z*%XG(`7iu7h6T$Y!TONT83v^I(~W^2en4?Wk=12qhMm(gKA_}0 z{=;A67F-?xw2ub-G{UomzN7L+(dR1FZD<02_LNzx^Y{`eFwtEQip)ywWG2gbG<7tF zg~}Dt-VVfgDa+K=6lemd=xX?!zWRi=F_e?iCk=Xox2s~rLBnK1j%7-}>0`#SS!3>Z zMjSf3CR5NF^>>Z-dAIdfiq|_+Mhm;)aM7K#GP~(7R<(;~@8vFu4W-!X;eai~_CI#n z<|Dg@#%uZYuYLJH^#y3=`BT+OU~JpnBq!L;+>GWhKz&Zy9V8(bX9Ek2Di>I=^WBNS zG}JwXdUk=7?dwIpkVl<|ZLbJc^pPD+Gj~oWSXt4+o$C;c;q79<+eMX$O|`W)hsP`X zNjS^bE;n>6CIxxwY;WeS#^5?ne(onPzu`QYxX<^w=`W~~ZW(GD(uub)U!lTCgZyg` z>aa%QCqiU?ze(jD!S`Zb09Ii$m1__y!f| z_ayD=7@O=ip3=%I z$>*;(2nkh=6q2Ei`V479f7rCy6z(@XYZwTaHXDOALqy}u&|?`F6NxZfZt)9gr#3?3 z;u;ZhMWM={;G}BqL~`SLJ^q=eIs9`4Rw&Mk z0S=B;)MGU34-|@n6&1OI5jWKb2FI3@JCrF{<;au94r32qsuvwHRcN&eaB5?yL-Bz0 z>=1TE3|CxZ&~oGYQ@Tmb;A__pAcs-gc+I-er2BAjdk0H3>_2F726BfcJ%P%BtGoll zuZ+3)4yx)mj^Dn0cJj(w_m3`q<}dFe*sAY1LO0{t-B(}0A44vr2w*C6hLC*ovtj>v|PDQ(z)nU*$MC-k4xm6`mplFt|S<^y+M5r2EY zx_FI?wc^2jY}che5*Iry)#RtCzouGAr6xbA)a1j7OAMj55DRS~uZbK8{AWZLi;nuoidstQL{y^TvERyt0Dv@A>LKmKcQQ( ztbb#evsPVB-OG&DK)f=YTUOLRNQ(Ne%GGuc4uzH%_0yDQ=~eUunl~Ty8c8R(e6l5A zYoxHIt;2hX7W_N_f8w#1p7|PH|4^f(A@KtTQu{un_I;rC-RvCeb|5LZ;EA=p8^-$> zqj9hyvK5h?YK3W zrEjdxWVnf)jnd-Vvi;i)cN4qEya|mdOO@#uVI>g4^>%?&3wdiTheXT`2C!u(RxstT zm0GTBxlTskVk}VfD;gatOGpb9UgUec1~Vq<#)$kGb&Zf6wMUW4aDd8yD$fj(O$KC> zLnbk2UM8f|^J3(~W*PmOnI(ENf<2kx*#DSFK%F z_~&1xUV&T@Y+QFfV*N$xkxpgMi5m{yz6;jh-Ds|wSZ}<7YIzxHFEZF?tFLHVqr6}` zBXahI-l|&Jum;gg1i-Kcf|6myFNk5~OlWi2o5b-FO&oG=X%1Ohl>;_7z|(Tc6m~0+ zLAzTo>bAy??z=DT$)}v*$k=UL4sG$4^*WZ=+POzQaM`*YefiP!=wCd1`1&iq8t@XE z%c1dYK{hu*eS~WHU?s-u5S9Y>!6&(_P&%o{T$Nb+V29OQ2Rsb`%YY${W`F)>WwD`y zL)ZhV=Jfp3?+Q~PIW#QCmY1`UG3N4 z8wGVt#^a7^VsuVZ(QLIRH`k9|6JycH_|#B3HPjri3|}^8-Za}}b_DraWOK$B@}QwL z3bUi5`>M}bX?@@E4SQfNFGu72hCG)zCac6fvjRAn_Xc+8T4+*v@2ZIW8 z`HHhhCisnb5@~(+B>M0K*6ALI9L!|VA!m?UFho}esLgAy#f zps%+zR?3R(j)rZUER-Kqm=zxnbQp&NCYcgVKxm|+2qeQ$Ek+x1*`$O1kJpF&&O^R^ zE~oEyrtzTP|Db29!?6|po!>EKCc%7lAfQ9@e3k$(7{FiL_FB!>Svcq4Z zadgW_{*n&^@%s$=WbSw9ub9l<+wJftnJ?nM<3WEBjqw~4rN6^`%c-aC!ec&#-oG8c zUytu9f3tX+`pVKt)@dHKQJPK41TU$d7wB|XMs`qxz3cR_GWenF9FCcl6+ z|0epUNEiG9>4MkeeUV|Jl!o~h?2E-)NIvV*b*OCYG7 z*Q>>1w}o|^FvM3F=$P4sR@i`Hi6~PES!=i|3Boc@p#z@i3pR-fBGT1M8rnlHx+T00 zwD#W~n#>PRM>5uYFl1+qiE3@U7Vu@FMyHL{7|ninA{>l4bas>7ZnD@pkH?)36#Qmq z)ymO-jQ6}at#O52Z? zb}VgO`YdYu^wOT^-MH;-sO@XGO+al<-1er$UoD+jItAl-Ui{;~z+5fRzmHBLvR zxYszj=TCr7)sK9t{shcxe-5w$_2kSXxNG=z+fJMSbFCd1PFMl34vgyrFIdjB&BPj+ zSuu^aYMEOQi|z%X%!)%as7^8JUXYOMTJ|B>*>)S+!;{MpmxS>OV7s{k$p0K?MP1+= z`e)8F4xmM2@NA)H7mgJ&5S}p{@X+bqp0RP&or4+qJ_6ko(wu08OQW(=$TcDRGSL)< zoUK6rFkC^{Ie|q=WEh=PTHfeThrzGmA{c=(CL7^I1wUS|M9t7^K0^{~44T*A zG@4iSZ=Uf-v&?Wds?!gS?b*Qe-CC;6rtEJ#(cg%LT_F!+vt@?^=0mfY4cs(NtYM}a z+y55WJr@5xR>@3^C+~Z(nak9Cc5k2EY%xzBnr82`2m2O(D9^2k)>>Bc)5EaRzP~1x z3h$cuId5A!%lsB&a9m4~wG@=FYXHBo?ervo?8PbJP9iS>@C%&8ft5B!9*Ss5|%~JYh)aC6^q-7FIO34P5=v>zeoF z(^2iVOUF-av%BMW1sT=8NA2ds&IaO2Y*g*t@2CHX^og$dL#9ulnXV6c2%y{ z8iLmrBqRBbm$f8O~J*9tgjPa#ap9ZbK)qFoZTeZ2u(^NgNBQ5 zw8_j6bj;|zWFLX4&PP*jf50>O_rqE5_@B#9?n~3L-e*qSCrO59+W@uGxPCnzP|N*8iSKD z`W(k*7Jt4djtnNFxv{~(_--5F1J`EJoHeK!I!XA91gb8M!ZmJb2r{C~5-yVoDNn06 z0GVuDf5B`k3Dr6{>!LGSs|g${#NlRqJW z>Vz6Q$JJPp%jV===*2KQ7afj}mMU&R-|2_%oSwM$?ALL?4}E6_zSBZabylHCr)OOe zzBW9gy1%ufM$YMqMEPpJ`V&=bXB0wwOy2+~&VEizO*OlT@K(xb>z#9n0K9v;JIr`W zmfMa2g&K8*nOA7Q=@Y71SMlYMWH$mn2PtsfQ?HPLU)h;>Vk0R^Q$=$>NGBv4nIJYY zo~pylW3y;5!I2KVGg!fx8SEx(7yU&F?4lp+;!uxWbf8J+YKjqbC`M3%hMKtf?1BP2 zsGHXj8(2l_Vcpp>{vgK+g?TZ8)EKRT{mJ6MAV!yUVpEA35WVL&llb!9K`Wf^lk^apVps}z;?HLw zZ@aHKrME_5(ieYcD5FWw#&2x!p;>*UlYFYOk=xf_J@NodZxnqHc;9P{+Wyd2NfIi? z^Ej(96Z?1%*vFqJ_Az-8_A#@joPDT?c$MTAUXT64AFD6}F5E9HtkEw#g8aaY<~>L@ zzx)U2&99Z-@KC0u?hV)J4X5snr_-D1^HmA0%6G^wt<&6w_S*pUw^VC@;I9EHvPkD- zJsXkqY&eECpuqFAFvtu1nRbP^4nxugI&t<3YIVv<>h$Wf^LYFCS!4&rbO2Hof!LYl z{DBT?EWNCSfSmGZsrREb?;b#|hbFs{x`XTJQCbGGlbawl75tJE#)`~iopukvV$x2< za(x(CuDexj@VViY8#fOHoN>dZ8!=|4q|88PJ^y z(v3PZko1+KqR_#!7>(Tr5iP5_+ zIgYGI^O799eR?=foC7TQzblW$tj?#*SMKzeW~v!vE%M`yz}P{X?1O&*%Q}N?2lmO4 ztb^18syv9m`6NvXAzrYZkwn?D+Ta7L1%exjP56~ss$MKrY7RtIks{XQRhPidBO0-;3;sGSG;y>nOIA!)P3dH)EkE6 z4NKflJ!6QDIAcdnTp1zW=6~Vs3R~31$IwpvxBZ`f zy#3*yzJ@rMuw7w~{up+nqdM5M=>N-!HY^R>_LGax?NZL~C6QFuc84bZNk<}&=T z>xrICXZY&TW7prH&dTEa0Nd|9c?*EhTHQ$1+9SxrjB~(dq$|*Kx(D&AJ;_f}@-w~%Uj#k9c6L5~y9@q)LPN;HoM#I+a@G|dgTjS`5 zNmfilN&utC4sAPV)6jQsKQNV=+MMefNyO{~qgnEjZ@PK& z6kex*C3YoRr-Rf#P&ii#;NM%;IxIaaoLrN7lH1aDyXr|BW;U3M)ssMHK!8zAHhd2P zAn;LiDr(2b+Kch+D0yYVUb0xmks~1uCnvuR-+QFdk2c_(OW}NA(Gdma1FOp&iYE%i zx}*(~XzpE*)>du`ZcZ!|(cv@{gPeqTy4iCuB}knl?Ruy~2SG09$&BLr=?Q!@+?z}>rsw(cy%vxmR%up_%;n4aEaD{i=F=k&cV&s5MkxL}LqZ{0IBlf8U@ ztvPe!M=N`_hpP3QNn_tP9jH%L6Zk$8`-9-~0Ol;-^Eq@X$&&UNZIB7pWh+m1)KU8HXf2~*bY`Q{c8_ZJT(!8*s(_U%2S>ku z@fiIoEm}-wi(XOf&vy33V~YgdO*juGHyo*3}k&_CFE(82~@Xq*vwv=Mn0bF2U}L5LOO zXq(1)ac1RU#-z-|JPAz96O)9A8BP17?Cr7K#AL?;@C{@Ey!is;9ZW2`V+ z9vT>S2kkyr)1SN~x8aIBQpcNTXvXB;X|YyES6VpQ!h-mY zx!$WH(%4W3aS)K23k1^{;#kSAuw!K+YE{s4qJ_uU_)wkW0|~o0oJ4-!kY3j&R7dmV z0N$q>YL`mA^}1qrop9au=T+WRXUnN#buvz&)`tD4Y6o`!zb{c;`~tWho#@;yx(Lo2UHh%64PRAVOy`^J^e zi_1jTyZo5PR}|Mrs2%*?9E4R~E1sz?Z=R2wV;HE?FpjsOVEU%u3>M$LKm{ zfg;Q#dIJqE-H~|I7xX8B>o~(n#=z)xMvF0T_@ki|Ox5YPr8kAD`XA^GA)`}oGaD8k zo4UNQeplas-|eWIl9`B={*F0fbsCI#N|x+BtPS7NRgkNnthM#SxM5=*-^@Xg zG`SWSK+1T4cmS^<@*-`&-Zc4%>S}85aP-QwPqb)BbIKT|6YdVE}>E z2D_94_9_Ei(B{P_>lcr4$p>mAI|0dZ8dV*@jL3RnWPogzKs^pePm7Ew@pkR*E z=oC_bSbRS()+EXC&wN)MaWEkn8Rj7n@ntNz3So033i!&IZ`ahE`cX_)jHcKhfW)3c;Awx)7+j>k;H%YH#E=Wyt1wPFQ2HMyi zB)25`p{-*#7VyFz=>*o9cdKLNU+$+hQML8Zp^yF`Mb%}SsfF0#6!p)NFX_ftU=xbL zj1AQBifvmXiTV&mZJ6f8br-TsvjLpnuC(&3P@NY?QR~P&HDx7hHIwD5Bct7ii1U6# zMC+EE8WSf>zVJfEc0g{#2mh7U_sT2#1gvaLpwp%emrks(+HJ=3t#qq7L@Q0K)n!_? z{8N(Nz;m&Y`gUh7M7o4#Vv2^EyYoy3vJcZ|+EYY-%&zRLb3HeY-4mm_k9-LxMx2^P z^Rm84Ca9&En0zrkv%2YdA@#G`NqS+G^x_jm^b|wA2?C~Qu2RUO|1zl{6>~_-dx)k2 zGDAUAYnyo&s3?NWlhiH-$cKj%LiHATsB|S9=1_3AUyfHRG&UC}hy7b<~Qt_;$wNQb*k1 zl%^l;y}JE|e#GU*qGm#gzNF);%GK>~oMAt5o-2C2uTfsyqrRsley!HUwAmch$84Y| zRuAY((tXFvknF=$5#rQ1TRg71?;r=?wkscoOAeQWT97#-dff{OVPTKris1b*$3?&f z6ye!I&n{1u!YA5Dv2&Zzc_*C40U%>u7gZ%qANXchfXme~KZo{eebD=`KLrV(95jx~=8qrFGI9`Y> z+7K_(9vMmEJ)}BdCPNAjTyzIHXWPPt;|09bLb&!eh0aMn4nq_*22{a0B%4Gd(TU8- z*~_@1ze10X`9tPLZNte4$KsESbX0eEdg^E{o{JZ@mhO4uU~}N!tCIV-+`Bj6b5x9> z;c`LHuq=^AE_9ptbm_S~w)oDpVSfig4y-_%$q#@T#lPE$? zlL?8TWeoJ6FNh&m7#O5l%?9D#>*k?bA#iaUmp}RSSHGVy(&_HNF^Yfd5YzP@AfMc} z;WKZ0J7%VPFqd!l@Y$peZ(Hc8u7OAHYkff4Yv9UC zZ-{2=gA{m(3sGVQ;=cwxX2Rt;(PBma4m(A!qe-p+CYZ*AM#d9a!QUd`dzx4ssMvzz zdfJ$%Wc+Stww6wgtozG%(5Ypo_1d~iuFOZS*i75D4Egw|epnaey*FLzNICi{mHbfD zZqh_{ZrXWk@9F&qd#;?Frk@($X$?K=bsVKSIOb3ji?RL~>JWN=6Y~_6K%VePDPokC zGVa<|E9KLcS{@An-2(3yc5Tvz4v;JaHN+s=z{npKlNh7O*@T?P$E-G8EbZxobsBUE zdL+8OG+Mh(D(J$OGQeVMli*h%t_JlH27H<3Q>vSKxB(B9hSq=j@H$H{xnt9=&7}wz z)b4&oVzd#DP2RP=ha+(EnywT)N75#_kYq-p8KY!EBn|o*i(fJuL%b&ru zrFmpwua+icQ5=2!$Hp&j2nHfpQZJaJkUOEeL(QXyCA!72|%SpR_iY zmB;#tkD#{(icJ+H)EywfPPE8dJ7lYP>%C&{eUa z!Ppf#E*GoL6d$jA4*`^w>HDi+GHjCQ0sa~Yf6I-M$4{nHbvDr?tz zn$fM}!Ngxs5|8wA^xtDFn#%~f6IiyEQ$wjCXT-1**RdI)7KB{@=ox}5WJhaWFmk7K z7H1%ygNgPyg%ld8CC)idQFezXm6nI9X~?QKCk-3Y>7#T96k%7OzkhQelMcliWlwWc z-}*+Zuz!QckcyXPhFqhUjLqyilxgI{c~^KkmP+MZjZ`yH9Q0KO#*5CNe`w0JWo$&^ zy&Phmq$0>7T}3Lq@u=KJiOLP*QRUGKFRtn)HYkdwF-j1(ybfY!tWh*ydZ#;-#nT6* zmo3U{0v+psN<^zviAa#6ygpfZ0@etg)#c2VV^>cOk88B%>9NC;zS*n4kjWi*!=;Cg z@0Zr?_CEi|BioPd7;L2J*rodqT*tlq54*lM`N;7;Wx?Jo3RsO$5ABw}gwO^$pMH{i5wTrJUGMBj`; z)p2CggwIwIHq?Ot9%J?FAk{feOr329C4gQAN%rU>v=o_YICT?@>Sa<23VEp^m zUmSmkk1YQvmHn0Ve@?uW$LnGUt&=loU6iReN<8s+8I-^`!^i3OAvA^KsW9>=ci`jPDsw<}?fg@)Ia zYULCgPBi@C-L+`kYV)}EbC#gqO20eeV)VYSZt?rR`~$g}es{JK8oosnF69HW`ttSm zsa*pJ+a_Nq+=#ob_enMIP5PHqh5Cs!7ooab_YQB{ZZa?WvQh(&XNRj}YGn+|=a8z; zcwV5-09|r-fW*Q=`Fq~f6$;VGptUg$W4q?rxokdzW+4a97J8~?Aq(l&7ON8jC*;*( zLEy{nX_aGFWl}<)#3l5ATB0hU?}P_6Dv%;{YQQ&1cD-Co&yR5lqrngz(a{^OvimzI zMF$M=RKRDn+9UpKelUtl>mSLVOs67xvwQJQ8Lf!k9g8IE%_~M`^I_tDxRJbXwdM9B!{wBuJ<2QRfB;88xWDFEEfKYu73}l>pSbsc zkK`=x$7g2yYRk;_-kY@2uCzs~RhLe>-kW{r^Z8tH@5Y^C1I9E{LJ1{QgDD9!E7=Z5 zLPQG*keEPnBq4Ny5fEel@E>f5Pygq6-`Uw&o#d0W7i@oSv^%p}J@5NI?S0oVJ52`uDl#j7~L z&-D%DF@=F#i{#pm*9Lr8wMG_fq1%8b_@-DF3t)v{*?61VpU(8;`^?w_dIdaJcG79X zuIcGa_ltZ=Syp|J##0=^oF@{^s%#h7Egd~oEj!`=_JvJq;D1 zt?I=-eLnlB#oybzr)M%*@cGO!M#f5dmP4$h5cBU8M+5bpj5C436^e;wC?l53ZdtVv zq=|V`&|?87Bv6)2;DngL2?-aa$ZA?G)Y57v$Ge{1*@B<&V?SgHx}XEccFq(s(q8sv zKce9T@QU|?cwYl5&+1n&k`ST7+JrAq_qLaUcBOr{3Lj~L)wBVBB@K!q8+@XEEtBNyy8u9MgI1OIP$m`K=8RilxpZ@8{Bd&pqGuigCZ$l63_I8KPYKs$lVCpy1auW6 zVgw<0aDt=GDTR2QV5twQMi15-4$j=QHJ;-+J!>@DBB_yd&&YsDV0CV;zV<aB<{XuSh@X%je#(P6xVu}-)&|s+7X6g>k9Na#Z zDxBCMKl8Ugo5W|u!NF^X{v{i``90U*Wi!6T91h(35q`cv#>4AIzmKUgpJy5a$jd!S zFLryW;YN1G0y+xgW1%oUVyL(r$!Dl2CQnIz+v1$Zp9HU~nS)%M_t0~Y`pN)56)@*z z1o$D*Bn0@OVI{Kk8HA*@cTrsRfe>~8Pf|SMY+Ym=bAqd{K$f~4aFIYBflEZvOUZVc z7E4zvxZ_;4UHUZy{Kyjsnzqau`jcG77>lpoEdBJAgIC-8VuL=u=ExKrerM9B3+jEn zW`ow*)-avoA{`~zzTcvlG4oEU%z27!InU6y1mY6$tmYGj0Qjl%2^p&^UsS^6%+oRT z^krfCG7Abyw2naLgh6}r9?;&xf*9uKY+=myh~TvWSCz!tu!p@(2uCv6mWzbgg}nNn zVoMWP^zZS)&XF+?KpHyn20cY(fw||Fsd5@QmQj};(^ajuaPDx@XtwC}N3OPqWW}Bf zTB}@bZ!O&ebJm>aCwhCg?&OonU{KNWgS{uG>b33ZePm+UCdME$$o#K-t{=;S!$Scb zB_U8M(d{~CE4R-vg4M~fjasn@pgZ={--zm|EyL877F4)_R^k=uBpd%c!egEsw>^EB zKJmbl1U&H~JeY4mOz?Bb1miilW(vm=}-IqxAM$~AnHoM2W z{E7Mq8>W9Q6i)T3n4bpl2b z3L|*>bp%F`io@9cYp;}H2M>+5_#bo(S*IOrg=x&-I#oxPtrKPzH2Rf@%Zshp&Z1a2 zC8a>q#8U;(Gy_!A3>4?%RMYHQc|EtndTv?1o)fFCXHB)9HGXcWhU+=O&rMF?dcsw; zp72mv&)U$$>~QEekhL0J#d33Fy%b2v!LpLgzx!`qUcM_iTD@J&V3v_pNvR zS5t>)Fa^iVfKGfJ@I;!a;Hj94lOv9t?An6ri)!<8K`vp;OFHvnBZ$CSlfkG7_K*E8 z&PpPcq%6&QO3Hvgl%e4?!Mcc9+fv30lgdR&aO*Lh#qKhO10?Fwp9A5s3SJAk4+%Rd zbx&i+lG8Q8!{kjL&aI)WY{Fq?Ye^DuN6YVZDF=q|v6*B0BKt#y!NAQ)y@jjq{lr6e zZ$0>mF^eu1vD=RG_G$M|&lmdo`Y)*tsK~;f~dwezX0oZO_rH|dta zkWXK`u_nY6?(I|9ST&o(C^+;@AO|vyI%iF7K#*Cta`hcBna8&KCX9L^0bAQNoyX*M z4}0I0ZQBFFn$O{s-n;7w;Iq>|85oSy3GFXj%KlkvyFjsrFvgXV=l5nhyJTu{8r9lI zHIb~CQl>8bVp9hm4FRb`kEVrI$B+{bNk{P%&ORY$oq-n{G10vh*x!7Y;AdXJG*Zgh zb4tlAB}nrg)8agDPa%*#--3*gO*{3J`c;R&UPXXfDv2xUYaxr}HC z$Yiao4qD0u9+glq#pNdOcaAmcsNIKK@DXB1aFstPn(7KfD43GIH_Py+cWmv!Grk)yebprgBB@`!T6N6FF&>bI-Rv*H zPaR~wLo;N>uo7q@jTk&~ped&Wn(!!0be8d~em-8z;Q@5K)yV{li}Kbpn-n+;h@&d? z3s^9t!@f-MSU<*#@TviO5bGx~RHrKzZx+hqWZIGc^e|syUTBy|vkKrp(CA`@> z7{DCyaRhy^J6^Ce7$9*{5%z-)|Ssr>wDD4YKDH=I>_V}ERh{f*9<e=Fkis!g-~Ju$YPDLihr z)>`LOq?i07?AJ*p%V{OjZe44gx~i8v-(j6P_FcAepMw42UlRRsY{|w|2)^={siZZ! z5J=2|7ZaX+n`wBRpu1|V<+8+~x#3GCF;JX$M;Q(5W8CsSCQWpw&)R}rZt?>|5EvvO zhM4>dAZT+eqXT}>;#CxQFxVD&%i~qUNIC({4#R477Ar5P&%1nKU=TY27-SG6Gl=nX{q!)CoZFNBYg$syYQ|C|S4`W?u}P2s zJvq;!2fqf#BB@8RfWO<&64+tjL@7*CY+QbDtXL)-A?ALt(mDX7$bc~2N}>^>5$>CP z{h^_4y{>@9SQ$9r{=D(?`b;S@kqG#X-ak6|$cL^kXT0&q-kbI%Q;D(7*>u$L1{&kT zGdq#QFb*rdtgqp|0q=K`_b-R{65(Nq#PG0p-gV^pE@D3fupbuCbA8Mh>!3SwjNoCR zRzMBo8&H%S>8poF?Ht=_7$lU;boamIbR z)u^$U^6w7Ne2Wr=k(Gw^xN=T!OhaT--igM@`oR@S1(ifO($w%P<8oVD97R%svdd${!}Z?yPwW zR(!xSKR&}x2k_Gkc%bgk!&-fLx}er(RNdzf1oJDz0|Hn(=D;IlP$0JD;q|uFOB$A~ zTFZ<0r%gw;DZZxdn?vl@wl!)CyuU!#sP9)FQZEg$7teAxfW0U%|HU*C^4W!aJhfKK zG4Jk9sLe*PsQ6>MpE=QHFXF^roE-E0`ZrY4(!7{iko+E+*>)B?@~DpFOshIPP=nIC zsXD#r20yOhh(ur1kdR`6mO~*oms-iB6z|(M9Cvp+!^D@^KhP5tdQF0F>}LO&=H3NootN^x*k{Vo5FGw`edX}H zDlAC?Q%*T}g->WWYlYZ+==`!OAg^_Jiz#kQu<4CkXU>exV|Rk%ucBf27hda%d9)#Y zamel9V<~5<*8%HtFT-d|1P5uFJtSxMVJdBRsnLaLwPy38Xe~7cv}AvY>Ioa{3~(gz z3t@7Z(tKnxJ76W{1+2J<6ckiwJhDPN4QfkhQbeJIki}!Lh;i5AoI5^d%+I@MxN=5T zZPz~YBc)6VR9lrKz-zG-P}_&ftIE#_RbGu45X850p(@|37?eLYjdvRGRu!Uzd+0rc z>ImR6X%2?^3e{V-IM z7dMoJw>@=n5)nUX*VS=W!4KfvWeOgtU#Xx0Rb^W_!@b$xvMk4HEhd^{Ex5J6O@$17 zvx5;+ba{otr6$kd=9$nhRr&esSKq7Cnr&tyt!)lEweQ_p6fzICqtZ1pLSftKzi7jx zqdvwC5}&LxzodO7(Z|4O0yz$|%05Pv3bC#vM%x+_&AUo|D~04BU>rr_M=Qv4{L>e; zyB2AO>{>X$wK()Ye@&i-c#vjE;E@xsBF>ZsKjGx)bH9F&I1?d$E*v7=jMJ(dqz2q0 zGR>NJL1`Q@X+kFgZ={zw4<+mkXLfk%^_BY;sa-$Xspt$BqS>!#lV<33GnKeE%GI}n z8*$;z;Fzb9y>Q0wjk7znU2V=pvro|vuXx3-tyiKu@rs?|!HaJntG)b#<%-IuAbIdw z4Pxjro0yNv@t!C}?1_}fsev>AqFN|5>?pRIz>Tm8;6|8gB+An>Sf&o2r$nF?lBc8~ zEJYJV;rKHTlgS>G+d}pDi5tgA`6`C*dh*plMHYfd&~j7LxZ9}>5X75ga0JC*lL;r$ zO$)1Jn48*Qxtf)$_JQHu*m$-DTBBVNw1)MTYt=Y~uDO11Vdk|CPsYG~!jSbQemk74 zA8CTpXl?%fM1D+_{XW*a{nCNhMcdf-y@@@2`ZfYhb3`z+PbElsiYDDiI>EE}oHB7hMux*n2;PcOu*n9|hzXtoGBJloi<;u5Urc7%0#XyM)0NO06ih*e4 z_Ac68&Q_Y&=LjHUDqE%n)6Np%{|M~+g~f(1g38lpQ-LrxLjakAm?~ftKMh7K#pBWD z$$vQUqa#XNCc}c%4}RUi!pYv5fB71{UE;;^g5-dWm9W4(ZZHat{(;t+8Mt(K3q#ZD z+sbnKBBXGgk#e{#(t0C(EtsMe7LTr7wxG$gn7K-Dt>hI88M3ADrmvr{d$M}2q>uR{ zpUHS;$Fn(u>vdYz;Oa?*s>g0-|BEx(Dq;$`gLp8lRC+%x_b_G4j<&hOW1A|GQl z#=Y0~g)hnHyX`--JZ;V9`z~X@{ph1CqiJF*Fm}ezq?q%WhL!YpYGVGv-e*4Gv+9~% zVQI%(-bI?Ihq3jDi?+KB^9cK7_0qEtpObC?V*#aaid^+$Xr(^X25WJBvoOfU-CQ~G z&Lhn#m#eV6#cMe|Yj&`o(_eIG@YrOYwe5S~y*uT~mLpeO`wydIgU8CLm%Xff{v~n_ z4aw1A1lYkPaV+*`ohwN^kHc6(0lU75!kZ#vK`RO-G>T0mXz*Q%I$$h%yFWz65^&M6 z#IfkBOUXJ{b?PN3Wl24WNrSu{w0BQjyGe3l?$O#E z+`CCv@cUkM`giQ3lcR;<)NzlSFWJL|-7owXcWJ=M!F+E4#q{?iCvHE@i6e~;MYb#n zU5gFDMEcSoCal1VAuN$=9(9FD$6PJHhq}cYk-79q10R zToae@Ynn|=gt@G4}%#qB1BC9L06Kh6>9JT>6c*#Tb5G5 zBcD{3$4t8j`WJMx=`Z$8HQ^Oo!UZCT4IaiTVlgO}Y|P{=t4mOPN^hX7Bp;&Rvn(_nPENMmtf(qz)}-e@e@Tc$N`jd-F+PHgyI zEG}`n0>%DT`BS#$9XzuJN@MUEvgjKvtA*m7y@AM#>xjpzE{HP4_=&CquFDO4qP;FE zSO~{?KAWuAcvW#!C=;_J4E@Owoh6{Ikz$$blAYj+4l+Mc@k_PTh%gijs?m+E4AY%5 z_4G4X@a&O~!{Vo;EU5e}%~J@tNHGvh-wI%)&EvA0o_SU+?gIpjR5#}taFeWR zw~X-R9%$jY_P6TIrEDCJ9!<2sCsM^m3oVG(egsVl^wn2~b#3KGR+~+~ahHycD}qXA z34r+R%h{|xea|hM-*jmA)j7A-5+0l{o&8tQR(-@(tYVW zKC$a@86mu>U+i2C{Lt>E7fOl_X%@VPkt6ak4=zJ2WRew6SG(c?eT%c&Wx%|V9HVdM zjr0^nzf#kN&II@ua|TD+*lg@18jJG=x-bSKK^#YbrTi*ds~feJ4VK2Kt2xA2M1SzNxgHqVZ4E$uU#&~q~5^KrEWl&)XVv~{>u?2^)kHT{Tpv+ z!lYh)LklMLvdeF{aRr#vTW>o9CiR-Sc&rJNdgWCVCUqWRQjg+C4<3RQJr4sR1TR$@ z-UPooc7U8q(nk_|HT=AwE?ssF*-0MTbK9R1JGF`5k^R2}Q0 z-V@~G!@Rg_!6uII;uwg`1^it20<1GV%Fo4)VzU1cyyE?1cpuc-*e()L!g|xOBS$Yd zR(O$$(-X~#(+jcU^soRQdh{{9bARCFH;?NX7&~^Vs-8hUhFQ5;pEN2{QGTjA_8fk?NnyepY$0+G&Oe0tN2 z0z^8~0&3YbqXHrw1qFyeq{FB=D^*zhnu175V{T!R9gBVb8m00`odQr7M-i9QA>)z? z8^I+#QyFdmoRpopG)Ht@GQLxzF*>%{gmnUxq7uuRy;ols-DKuulv1n%>n3%t``AII zG2LGGI)=-;Z#~7YVx>4A-7&4yzwR%Jv!}4^RZJ7Lg2zj9iGdMgUfK#bw-&`}8Ovkm z3V3gRobthVvDpLSz-p)D`&7lU`}jH2KFpBYi`NER&nTANs}#%b-KQ>=-3n_RtxTiO zI-bA;!|Wukdx7>2o5u5|!U$HZBiNX@gOt~sTTbn{XH#J^BfIH1)_jvUH+ zLHu_uh`abX-!3mKy&tdIxd8sq%|*z)D7o&$YXhFEn8Js+PP@E58pa@YMyHQNcjB$~ zI8+d0?p=HLAy>=_^LAKsR3Ladl^U!O_@9CxWf0AHz#&ae!Ow1i99Hhct}9pWHtUEv$L3j@TqwD#Oh1m1+rKsu|RO{ts-cHBqw$yFB{FEMdms#EkP zqh7DkvRd|X;}z-Ewabdw$Lu#V-YSR6MPtxe^t|51Wj?xA5M-7)vGgo=i2FG+!v>i~ zRn{*>s$XW5RKKp}2^&6=3*3n z6h}@;J-|OhShtAn3OCE_GxCh3sX(kmfy|J~Q(n?xj_tA(jv0QApRwX8=+H9^IRzE) zEm#?hb;7kBBCMekHZ_mGv^s0c?lhUGZv=`HxA?su*D8q`W9_z2o zKk@nl#sd~P0VMTR7!q859z1&J^93}Tkbo#S~oQ@ z18@VYM~8s9pEWPgPyiBCB;#Th=*EL*P=e1zKqto?){u z+Ol&SDVZYqzRX$Lpph77x!HxJtr6PFz0Xu{(dL^92u(;osmK1GjUt@QK6EWnN+kRG&k!Zr`C<9W_-T$bBSi%g76dn1GP+;1 z!{D;!M)9=@*6)^eK05vVwMdq_Dbg8YMX?ez+d!^TtbrorpXT%|Z!e8>{$N(}?b zlRyq#1S>f!YD0%HB_jqaVrwW8mM)66Q*sBchLxNSSS_af3hC>zV5QW8r9hXUV8s_C zmq5a|VhY46g<=&4v5KQuCGd*(lPMxrbF9l9ZxbwdpJ<^+HNd1 zq(l!5F9xx|PB%k`yVaEq%Or<{4p0A68{PuQ#?1ty@XJh*8D?H1Bf@~CaS-hEhLK1I zH~|48)}LW^RTH`14nCxvmptHA_QT75vfGrx6s=I|#{_eSs}FsX8U`%x9V`!Jd z4hhRX7|DTvE%~}QBs^wkJmGYvM9a)7lmg2<^_)uRqcyS&Xh{+mty z?9{1)hNC`K^m&-$wfH z9#{!Z`i0c}9eS4|lEclUV*>#@-I{riXa9^7Y*R|agE;Y_7>c&fTP=hLyp!1$~q9xewS z$sIbjrI6fp)Ac<=1%2VjYu~eP%dv;jT#pbB+H8UJU^a0)nt1ai1KGpZ(w+$cxo5(I zGEPT8#_9MZk^2Xirm=?t6KDQ`X?RKH9?jNkqWwyyFeu~*i!vM0kYqhkD3Y26=9FA2 z3<4+#Aj;vA>eN*WH}s`>4HbF~Rz^%}I1u_|d)H8#7{=xlIy|YjiRJ}HGKWB58z%fg zoy$0e!VpRb8_%$Hk#~sBx~LUEWJQfb)L{mOSB42BSijAFo~TQgc`hi$4=TMoC+@@k zoYX_vL7RKdZkzRSR??{Rg$3-%NnMd<2T$sQAhrp!8~uIKXM)*WF3*Rkw#0)z3VOG@ zncyZF-0*yY)@kdufsZ)RmgGjz^7j~w4a#*N1BkchO>GlG>Z{a z||Ko=8&B@FO#7KP}7bq*Cp z_bExolbTQy=p8%gpRgTi2x^~g}NnTRoZ zdhyzSz5YtSHOO~=;op8?dG@B~nz|v1Wjw3+0 zw+D8wIW$~Z+VMy6rP-%bgd4rUroja%?hu4YC z80WGX#KP*qtA=?@ZwO}ceMMEqjlmlTX0ko4o6XV#CDF!-(8RQX3Z`L_k}3o7yPDX! zxKqt?Fj@EOpV!y?`U^Dg8nZ_#`v2DVq=FYd=r`PLyvMIIJ9g?%e_g-TDd_xgLu)YX za-02_hojR3PXE(4t_oqsti}Rsb5i~LPVx~t36i2dEe4ZjPCVQ)bdi<(q{zbtT3ol4s5B8+g%{jde zm@p4sX}L@o)1C1O8xMy!Ob+cFPLJ2;Z|1qmwHnD_J7=-0aTW(Nh%tVcx0P8;cc=M| z?2#V0>Q-SjPwrEe$8w$~yD{w2670P>;J0z+fV_Vw$oq%>G2A~`^#nFgvcN5SAdGwO zZV<4EqS$?EK1Y@2B&JhzW3hD}Rh9)KR<0VFi6n_W)Cw%nOWLzw0+zxU$Q2H6g!QV- z$6&U=Ws`c+x`ovbWWD2m<=n$}CHnQOR$qx&$6eh1gYHOP|8xCJ=;89VD&Mq*l$ zx=Pe$O>|qdx6TUDx<0J4`KP~~|5CzlBT1$4_Y{v`A0i&R@5o0^FZ!aqY<6^-czpN8 z!G|vOYxEe)j>7(T5O`%TH!a7qcbDf=)bdQrMRx%#x|>#t?nsCmF+W7UJRc!7d7=$W zIyvx<1WlMogSB{QjRYFtp6j0WAZq$P5^chO_R7I)ETKSH=KYibtDpUTPDwL$ElArF zq>tYhzw(TuRj3CJygBx~IJ-cO(z<)_D6OZP9;FQ(`0@Mc7j$F&k=VnFz3}_<&z#rH z$TOK|oq5STYlJ^BXEM5+`R3PmVOf$xh{GM3jxPL+6F(zuj~VfCj6AM|e|S52Oq5AC z<{99%?eA>HzjLzsgYVx&?ri7hwrr2VC%2O8HoP|At5q3+a1VoJTkGPMdIRWCJ%TU8 zAMm$SQMFv1nRLLG#DTThyG+v(g=T~EyAA? zBxa&cTTqG?RU!8TOJp`%!{$=zfE)$s;$F;F7hxAf5Wk{6r#)wjY!9W3Hro!(!}=W8 zJ2g`d2wgc-av#i%&Fu1Z*#d5>TM6q2qp39S;BroD(wBCHlUZlfcW?jO;tsIUCG8_K zSLR(I{;l`V=Iv=$z}DmH>ptTgPv;z-+C3fd6djH*^=CDI1f5Z4wQ|mtk9JVNKEGnT zj5~uly(^YXd0`)GAqgp%?r1KF1<)OpqS$o`>ru>ZPbsoVHWD74R^gZ z9>JUE`>3L+Di-|9svy2ja-mo2RyBzU@u-_~VDGXE%%ilieXF~XOZEPYe)b6VNE+E= zKprarD*R%gX%lSRurhEOYuq|xD5jPpr)eE^Bl|kzD)4DT0t$vB<M{pKvXaQ$7)E)jBOkrKXE8d6nwv3h1h zs@@eFQuXq4_Fg>C?(03XAr;(P){v^VuTov1AyxZrvR*N4wT_tZq%l?D?2W0~Hiql! zPeu2Oee3E`C7bi*eX4E;SwKv?3FfO5d##CS*Q0<1@-q9wlGF@E&YGXE(VgTnFrvw# zm^&p!KnjA997sW)Nd$;^p&Jw6r^ATrGS7eqZClIWiqSz97uuF-bbXMhyTNi5%a8P9!JE>f$uMTAQq7mpdpxd>_qt^y>w@Prj9sN%36~_HN>CN^X+0P79 zKQk09DDA@J)+w$G$whT7>&>?8B&SynKTki?M`k)nlIdul5R?D`d7t(RNmH4~6KQ~J z+qqiPc|X5YJfZ<{o%beoo=WmuB!ymDg}^x8ozS{okNWRn9|lC7a?MCEPr_`UTh z!s8=`)6dDWaovz28|uDOY8Ka?ArQECmTTK#@4SQ9gA+^7Xl~@b%#^^>e~;WzGJr;oP+L76DE1VA6{is1XhN zNO2j5LxURz4DD4bu%FPy5n;Z-fzdrtb|>81yHaDjZ%nABfBUC~duFdp8%%F>XQN)%L)O@A z$!XSyD}|l@ONRsTcTirNCcIW-HZdPyD2q**u$c-Lh|3%{L<<~ONoDL)r1WZPT?~i83pv|ry?j@l z7%ux`hE(Q}^|4;iY}s_hSg4S<*M88(fJBZj09%GUI1O_BA55dB;=xiAN=({@h2h2d zaZ3$(aU6MZ=PJB7+Tz7c3NL2Bz9lpLVBgAgmdnLv@3{<*xe$a~cgfs3@Ah~1)JP~F zLzL3y3?@$6x1pn~FmSD#cn%ohkAo2t#|b-+w%B(6V&~N?-CCKvyA(IgZZQlb zxQr!{TL;5WCBt#P;>h%Xy^H#Ee!V|$)N8s{5ChtSj(vi}FMG**tPMV)xq{DXzQs-v z{Hz};NDr_I?MM%n7Se-7jr3rr@D7OduvIj#jPzhz5$VB3ksfRceirF7!=2=_>|b&B z6MB{udNQK5ogQn89;=!jzJ)w7D0Xce2ZQ8+*hzlqHblx%a>cfm8YL{C7z1lHRzlt# z8#3k3-ll#=l`AUc%^(BYLI0eRMnH#*(9Sj_H*BS3(H$$Fc+WPIMQ3@^(nd)ZooywH z&dj!sJV&a{nwBZy@h*3FPrgJlln^bo|hrw`_T{sx;<;f%jjsrcBW{CN$c6u326yqvVO&xkI48#+g6Lbuvl3U{j+; z2A8=Xma#vB%h=y*T2H%_Ax23TCDF;|@gpA9Vt<>-)nF3GRXL#J{G4eVb3n)N+JNgB zIiO=o4(QmpYHL(22#!Y$U7=`(q+}%oi6{7pLzoBLm8jP1>rD1Mqkd+EyiS*WpDHhF zcrw+yXWz1dnt`6+E{7qqETQw>9L>ubzFOnE@tXD;oBjK$3G0ns*>7L6k=(37=4b7- zWpP}rJS1(Ha2Het@TW zK8}KutN#>y3!Qta1^Dz`8eI3I113yPlNE>js9Y&0H z;!wee1w&yKvQK+;tttnrrRp%$%Bhn^{<(VWrquo&xl%~55AbeXCAU1yD*LWGqd{kM zOXUAO@+-89w=O-)UQhN;dk8+$A~;^}&|CrUztZZr$eo1uUsayJU9%V7zfScWG5tPH zo_~X3G~XhA!0XBL*`;SSlN<-{A0h9t{(2t#f{f-{m!K8?fntRN8}JH(8}|xiOwE4k z6R?jc7@t`}jq|KN0rgRDT6%{28QAd?E7e-xQ3nf8TYxxpK0+<*F+}ho>IyKmEPf-ph{dF23{Ni7O7@y(m&h-@L&Z>?(9m}|NkB*sTfce6XyQZ7`k@+H zdD55=0VDKE+mD)l^xY>fIJ(n&@a=)ZKuCPW==S5?!I8^s&%A8k@reG7N8Goeqx!&i zH}%AN-f?9g@*Y_$&0gTWpU)r?+RI=C?;@+66OHYwZEUT!5m#Ge754KXpHlYgSq+-a zvLgFgDEnFDFC_8+^T@fmPXP~#?E45l+m%3751}ft7OE6qdoTFfKW8TuUz?7svaylv z>u6+(zfH!){kh_AQ<@4JqiMWTn#N)MFQw~mMT&l;P*mR-MI)WBKVqgnE3f}uWc?Xs z{Rh`V71&4|*Dc_;6qqNNMlVXD1@V7+(K1@_#1_ke=Y8a)c0MEYhGDOeAtE{#>J1xd z$2W$8r|Us2nRqdXYAHmOQK%X4#XU3vM|ZmvAnu;h6F;W@jGGrd3sTaJ8L`Zq+mlFA z;EU!f;y7aSRZ&xy>_L!oiz}QVO?JBlk+fa3V1XjI|6)dvT&cRMfRKhM2B|KnrK|G! zlNVh?@1RmbIPOb(gIy!t`%YXq7Q7l)=KQ^HfA`c~cc%*> z!O?9E=dL~PetXRRD^2gVFA7dy;j5hfvcnhOdjRIt1b#=5V9~yTY2?w{Fv6S~N&iV> z6Q3QCFmX=PwtNWYG%c&Wg1W4>P#Zg<-{=b@3wX6REyUi2q`&UkXY}>65 z6zTq6bDyRJI_7`5T|}OLtXOUvZj04?%Cz{DQCn_pYyTVwJ zrGBmS#9Q=uI;4lr57EKQ-zf8Q*V^^?ncAh=slKCgM0LwglsURf_O{keQ}tX~Jd!{9 zjK)p;$M-0G;cCQx{A-43KF9o0uCKjs99L*Pm*@HQWK6d!V+w6-o}-p1p=ko5*b z$e1jO&+j`cJrw7hj)|<*4b2hJwJL3Ft!6r2D>AO4 zyjG7Yr`iu-gEML{RbHrzaibMqN&&!7qLuc zX_{aw#hLf1;$QyKDmY5u7?QO8(5a?>7+eiEsgX^Pq6N(ULtDE3#jWh3LNF!^q zqsQYX(p3eaj7V}9Jv0u1pBJK`*Su|U&X}(n^OBpV1-0t5QFMMuNdZ>Q==@!=LXn&a z4LKyoaJ??M^YA=LYG_8W^H{D*0d4A-f&D0Bv%8a-7An^nfLvMyh->xah`s)Sfo*;@ zFjutu@JthtE8}mq8A}&t_Z~^ta-p14h0E1b_4ZeqfL#6lWM%~zjNzs~q;<-BQZ13W zXE)>z6rwUy+;=A zWeJE=Hi1o~Q67t?MakhV(OO{Ky$Q|T8;P%^Vb4)tezeoWi}@Bhp+C?=I~gdih}fCv zCJh0@yGQ|cu?x#($}~-fZ{L=cOO9Hz0Dq;ZG40i3Fk{Rz7fHH&e)q&*4r$H&h=Khr zjTa|wJgmfvYk>z$zKUZoYMlDqp-Sywbi^%q`uQNc^RzR<%7-wmaPieQaC7m}pX<)&u*3kb4Y;b#S-R^D_>|H%Bo3F0!d$fhw!q;3%u+H z9?r6~ju!j^;|j-%E7hdSth@Xak$ZfFN_3jL`Z1c%dgifVTM0Tm(IeBo@Ou@W%-zJ^ zJTA}QK$+(2HPOt66g2apW}%lDFG_t3sYrC1={aD!nXQ*zDO*oI6CAthfBvA(vJ?a| zp>w=IGay;z70uU63yy}>N#P-xX1<;@;%SceJ}zd-b0e-gkI}R$Ub$XXfbX z%w0o0Y&zU?;PU?MZ^bi=)4${1&du{#tpO}R2()PmbjRJq4roEGtL?zOa0d*5IC=4q z4=V)Q3_+mf=;pAO#)chTy04f%{d?{(`#Z2tf5QbB3(z&AqN{I1bmh+hU3g~mL9*X@ z;u!YqNGm(IvwF`>iYzUPf*tiU*$;m6Ud?-8jy}uvF;4?EvkEoNKP@$MZk8sv4-#I| zfrrD%vvV7vhg)`{buZje){Of{sLPyA0#PiE_ zHz1>-4#%_=bjAa+&d?H_u|=ULv;lg;9nzCqn$RSu&fo@#&d7GAGeVuo=vL4f4^W-K zX^GC*qM|3aetN>4(UV&`U!I>Xu0nK1wlkgK>P$wrg3fqA))_w{I%A89p4j^7ad$>f zZYeU4Ktn{+#u4Bl$B$ z%@NXDZjpH%(DQE!JzZ<1N3~p*4(Vyl&+}Y-+5A}6YD?|s&NsyQnIQA?N%lEqezNlX ztj(5YmNMKtl?nC_L?&{b$wZ(tnaD0V**}my$`{$U5}DWv^yFlE5@(}F9@92?OlHo^ zT-i1zi|AYS9hTO2w55UhT4PFepm>0uz|wYkOkZI?&unWOlSM3?jUI*f9;bVxy{IL- z70&Z)z{Bu%vPW9_Ys_7s{toaR`a9bcYQh_!Cf1=G;F+yfJ_FoDY)Fqnk6{C6fXNQe z>LV~eC*(804-YhHMe6Bfe>qF|XGceS?BqG{ zm+z7N<$c6o&UfZ7r#iF4$G~5{LEd9OP5k8@ozau*&|g;g=jST^=_vQ4ztgjpV`R_u zUUJrARd|S=+eX)T9-Uj-BCorN+rxO<)}2|_E%sh2sC1s0RnmpC9TX9fF-^$p{v~#S z>;u&6&aZLZRSsCTgCZi(^WR_EhBa4cN7*+LJKC$VTfVi}t)+he+jkB34PyJQBDQa* z>N~pEWczYUf7Ddv7zU~JVhW1BaBm=naW3@N3C)+$@8bM~_jW6Om$23t2I!ostaAp4 z&MBzYdSLxBp6*=d9F=v>kBQFN-I>k_biPNg%6s%8*`pU!d*bf(?}@{m?TIe{pYo`@ zNB>(Qo4XZ0UPH{Fx#rvjaxC}vWX+46&2gr)IUZf=$Jz|C=EumI?@{^M;Whc%IHp%n z-wU%|oO`(hD&TgERN*qh}#+M6x?6YR~dm*W+KWN)^9eu*-S z)++1rhlwulSH*7Eugg2#J0OnmhiN>Tdn=)5uR_n+b-7HBxkXP;hxE|-p}zVH%jUs-fj_J!J{_#;|Of>$HT1Wh&zZL%&JQp<~M>N|>e)kWR zarLa7CS_cw$a&8W<^rdl;EQeiyvNhw`3kAUk)F z3WdGYq=sBR!y)xT)rS;Pj>x>>UKP}$j7M0cNS?g-45+(XN7*OU4hln$$9X8ul|t%@NhP?%AlJ@^HT@ z$3Y9ayTJ!XTYMwUk$;ZwK zAJMqp^~?CkwpM!T>a>my`DkfEdsx=fA0m2sSfv-UfAT%)T}%C%9rBs_AkouDRrK_& zk)CrjLEuX-fnDb0Gxb-K^&07@LOIv*8TPZ>puA81S3=JP9mQBWJmXi*&(Br!LuEd_ zF+J3=%+oniVWyEex@&E*g#V+QWzvt7#uF|>ibgxqLLJq)6Wpti%tKF*`8lRg6Waha zeI4?&ong42Xs(61`Oeiy&6w(J;ZJ(<2S3R(YL74 zt9)Pk(ggPtS*Nl@r;e#~SY-V=)zg_y&4TZ%XMah2->(pzdf`ioBVb=TU!I>Xc8SDV z##C{5&-&x=w$Ac8vP;|K`S~jQAriN_@Fm3&I0p3GAm@*Mb6G9GOOf}2@y8!(LNZok zGyd4KHhm%I8&JRJY50x?ck?peFtiT*zb)!EDTdDR|3Z`|_B)CmY~o0-ohB6|%1Ea) zVSSxnU0=ucy_9DtON*d82%Zi5k)?0^@9$(ho0qOOU>fM5I5rjFa!+2_McV-;rP2chKGm+64Gv zKVx<=pMdXpjmpDV<9^w%E+6X5rjy@&mg5|5Wh{CpLdb@d6M~-GCx^)-*q-GqqR;KtH!j6`DYkYRvyz> z`*)1BzGIAxNm(b&5p5q?>t~qXI0zl|yEReGo5=mgncZ;zV+!3r(%Rwv!_2?1m$%Wq z)>s_U{kY~1@*R&b|Li2+y}s|DdH{U1mL7PGO6~${l)J#W+Luv1K>W0(9{8Awp8Oi= z@tvDwLwTLvr;QN#dmZypC+Tsb=z+7zUu&I?Y2F0<^;KDBUdwz=;jc~Y-?6Fn9h=(u zi+cy5<4Iyxo>5zZR<(%d0GBGL*%cut|RM^zqeq&I{1!P zGJoSF-@O6(dk6WBru==SGdo;A7xH&fC4XO4(NkO_J)v{6i6poW{S@~B==nE7Pwpkn z!P>jjFXKLZWa(}~&sG&ZiS^UtI2ZUX)K9SyKP9K=g@LpB7z#M8LQd%%;JfUlJ`ei~ z;`3}(WTJbGeiI$jcF-*_7D2E1_9d;1;mz&eu(|aOn+28Y&LFEc5n@JH9#L_{5f$l( ziUN)A;COa&p8{I8A}#F0W6jZM@O#y?jJ9YQ6+{k3(;SQJzXgeZ@}`dbxAZx{m+2zD z&Szv>R8jdl?dRE`WfgjcTee6wrYD)dST-ixT5VC_+?^@mnChxAZDKyI8q-iaJwq*e zhT6xZ$;$rQ-x2@qP0DxwUiRM}BL3TFRC7S>#|Mf1c#|rRa*ZduZE|Prcn%(teZf}| zU+^>Q_9uz1m3={~Yv0tFFPQ0E*PfPrL8@y%qoSv8^iCcIZt8o-7N?Kck;hcF@zxddip9YeJ%jDBjlR~BmsX~y zZ$*0gC_R16J&kI9o@BXY^Rp2<8#@PUURTXeyPd7H(^F~DQ&HJj9Mc=Aoz*0Xoqd<` z-R*YvG1VLpJIiW_oqbnFcDA=eJA3d9JNwwW?JUuC)XvJf?p-R~l3u@^jhzEsC)-)7 z>mJ)cPM1#&Alk96tK*&>^ujxtqEpWfwd03&ojY7zT+drIR!4@dqkqr5e0*5_msI-* z7jpPU_7PmQZA|DhuP`Rdxq%>EX-u1XRv%Nf<1wjh((*B>JS} zBU;ydlF0bim?e2!ROe(jkhR%!4s_0~8ZDn;AD%oakGyI5*H2AvM>(XZyXu;BOLwtD zo#hopI@evdaxZJ?F1Fqo-foAwRD$_=2ldUFBGIKo8`!f9oU_{fS15V)A6fb$q35N| zhn7IL-XZIZ_Yyz0C0qHm`msA&!jbMd`1@_e(d=QJ-M~gv+3OFIh>zQ%eL>| zh@BW|*K_0QQUYDaWB)F(6Qi=f`+BC$QuMdZ>HHf#r(>6o>q+MCR~pxZx?iLI9F7a@ z->s{UYILKcQpTj><>g~K(i+qDb226spW@imf9r7TZ%v#N9{d2Yf4^paE060|x$E^B zEsjb?M?18CWbE8?X#Z~9Esy+G`2=o_)NE~0GtiO!L;e0~+5QpzPUfbmPe<3NPurNi zWBvYJ+5QpzPG+Y`PkD{>jGi;hNtzFNH|!CKP627ZPgyN?SuLzsYOPkOJ$j#Sl4D2Q z%$3N=uSiawl9LzIJx)X1cYvN_R2K}iDlEs_sTprkGu}>3t#wK{wlX!f6{)FFYHG5+ zxF2|@t1ah7y;j|S>U=#qH?nW=0-@*Fs(X@7b3rLzsPkz?RX+9l<5$(rbQ~G`sJx%} zS0zV`?&F8o7{8)p+Aj0DUi0nCTbw@K{teTuZGF6sk#nkJ^qi{F9F0rd z-A>Ey7A?C8EjX6jn15&QU?UDa!!u{RXIQ4le4i__UPi;j8IdVUY}X?GV?`}ClAPyU zj6s{1bZnmKADCd{hN6Xi*7E(~VflBp$#wm%<`>Q1eVF|PJI?)@aWEyOp*J%5dEUYp zvB{#d*}<}5Vz4En$!f|=F8C5j&kGKbsrL^!vFRx`l=G7Q_WI1jE@y?0@Z&npVu^bE z5iaK|N6XfLFxu}7g-xyqn}fgk4)!N(FZXl$H%;(28$de!i`*&60)LUS;9unQ&A*84 zFX2HQ|K?zAFiTn~4q}H@jo}^2Un75<{cY=S`RQNB`3^0;gL#yBH*e59u=L;y5?O;! z!r1?p`!)DXuVcQzFuY##IxXIR3;Q$n$J{UA{sZtk9Nd54j~x9D_6G7DZ&-TE3!f$H z_J*bVxg7UTOrE)vX>iyY&|RL-cQIjYUi6h3Tps)Fa$P1EUT;xMoSKi*9)NLPGO>Bd zW?hu};HN1rIOep`bPk)(+Jw2TfFlGi8Hvlo1Dzw7BR%~b*g(=d&eiaz!NwV|vmZ8* z&60OXd{VQq$@^_V%VoV9okn9A2niaEBW){Q-4(P2yDsZ97&XbUKu8GKIAgJJO&9x_ z&Ag`Pl5$td;jol0?bh({{-Tuawr^c=pQO80U_q2e~MWb070C)9~OplV!;HUZy1OEsA61d5*rXm*#ZbUSnPyEK9rKw4j&tW`m;)&=BRJ-}+*Qj2zKa%t zF?y5O2+_{Lrwm=iD(%NhXNs-ClwfPanlf|VL1pGh|J`he)3@J%H~OqT)BM#PhM@VX zm`T-sb$HO4(XbAOb?|VC-tuO`VLPAL)Zbi(T>dG zg=J~VyeM8$YFPCk)H)ru7&R|8Z17^fv~^Tx&5Ku;r4oGRKuHY7P6<-XyeOG;q+_PT z1RCo`qI4qsq8Q<&G_1V~Ub=W9BNOm)f|oYK%PPFA^3ra2c>-RZ;H4|!UU>q3;lPE+MN^}o+xWT| z6dvoVPV7E>;!0#QM@eur7*_#?(Y$nV__-!M#m?=koW_}!(W zOTS?Mj5`U&Okf(U9!;9IDBImEaLC6wU*d%)_1t{$g>4MOF?X^i_S4)WjD?9X(@aB) z@)88$FoQ5)``9S?>sI@sXyqjjDnk3B6oa20EAXpXi~JgNz)J&Dr~F9Uj_U~*VY6rC zq5_9}bZ7Um(Vi_=o!_%%3ukokiF#1}!M=0i?jvJ+F8`~sn$sJ#UwF6t1L!*jGx1^W z!;F*hF&|Y`QRB?d8Sp9!{G3DZz*{$7HB7@Oct`_bjn-fk9JK$u-2Yb6fp|B%tS-|2*6nEe zB7?QErff)()lE*IOeSmPT2g=P&ilrPX3SGvT6bLcMP0$G?fP`(6?y$O_Vw?&|MYY5 zK@X?#dNrJ9Fut&j@XtlCF7q(%6mvV%5O7u8U5gD1wwVvXSQACb09wtEKp(}RLDQZl zE2Xn7iaK60!wN-(MJWS6kyg=;Esh_x@q#~;K(!Nfh%O-AVt{ej>`_!tAwl%lCBaRU z4^h&nSwIn>7BFNd*s|Ayqxz9SbwUEeavjshBUcyee#NZ zqnp_C1($PnymlaC`UjJ#r0+Twm@4nsf!M1Yb2E%_4tOuXq?y;ywUsO|Dx($_*;kap zz=z4=yu-xYi=vt#0}KKy26@7QZcw{!UetpUpEpyN#$24&)3(N0_&_WOcG{wG`0S`a z-DVh>5eA(M1HZa~Uqy!i6C+t*c}0D5$S|^GBAbDc8dL)%8nIfz+c#f#d1)+b(OP=@ zrfghtq%v`2`^@y#(QGN@PgU5r-2Tx*Fyg8m-j$uGY}&Ugx_4|Mksd{R3FCbN*3`{x z0@=jTI$%v17;S^cA$Jv7(Nh$y;PHYL@uEwHLdLpDkL4~xq{KQ%7j{%raWB#3=rB|( zptO<+JNvdI>oi8|l|)9X$)#RB|x#telXIMgB3_>XeV^hU6lN&2J&R?z5L>w-phbn6o;wz@=^$BbihjoFIv!) zX5e+EC|Q8~UU(Gu0{L1E;jKsAep4h#e9MeO;_W!5h##IaU=qcoFsIeZ`d`R?iopy21>EqK(vRwzI&62 z^N#dSmHWD@CeF2Ec_qUlYxnziH5DF-%XQGc~RrqO1-l~NbS4~F_?_icMa#@m0aGI?1v z8m>&H^6UY@Pi-ec}=-dp-L+&iD#yH)v|7Jhd(xp$j#kAu%`VT15}?^f>V;B!aGz4s{hd~ojw z`MZCv+^fO8+sNnMtK4(Jy+h=4?^EvaaBmm6_kMa0WNK#VS?*3)w_fIrOd|^(pcFSP zHq5wu0=y8+xc3okru;m^X3gOI`O6Xmj2$e^>viOYr!48=h6}7mUs3FV^>mPBw6Xbl zE7c_hbm)3usW^kSm+p=l=2TYcecni>d(bU23$Vl%BAaDc!y0LN4ob5^wTU4~FK%4P zTA8dW2<{AD)tkonq1^j!xuzP66vrm6Nkay5d$AV>Vtc3c!87Q0(S3<;q$&UOxwXd6Pz_K9W*V@Z#y~> zgO}UTNj^>#f&om7*0m@as7t&b1Ykc;xIQU>?&hT|Jj@pH)%kF9r)^QXsNE>rL>mv* zSQ-vKFV+@Le&x4M?#J6Yu?og|a6$6=pVx_=g_aSo!2N**$p@bgF2FC(*=+(CZ62?p zkDv4Vg77wgSFys+l_~@9wv1PCn4cROuEEu{Xrtkks1*M;%OF18(E1p?U+p z1YZT}4fsubRjM`R5DAk7x%l~61UA*AIPgSZf_BrZBu;4UN-LM&S z!@SuwF}(>5Rdzq9#aJJx#U4T21Ip1cm)>^pC^Fvpf;d|jcRIuwV7;RU;d7gJqOPn} zh@v2zHLj^S(M>En%g%9~Y|ucJ5bI^r7&J-v-=+iR)79dJY^B}EHJ$$AOvYofxe{)V z#dKa*e8e#S1MOy`+2xIN`>SKBhgX$;uQ{kZ;C^Cc8RNH(?yL;szv)uEV8?%3uSmpt z%ubs>KGoaJ-qokkhhO*=JDBXA%;ubx*cFLrPnZ1kbU(M}^gHAyxn%O2J8mu&;a{@4 zWorQb5q+IovT6QO^Jl>4$JjSB4F>mqePxM-yG1{^!MG3ny!@|51_Np5#UU zf;8ZMUd%3N;oY2X((lZlti9n!CHO#>IKa>42C~4h{dmO>OyLJ~;!b{U$IfH$U_V|P zaJR+E4frtfYz}zVqSO2Q*E$OocJ4oRCU4G;18*LwOV+~}-snSJ zR~>;{<8^8O4!Fe&z@SG2(OMU~(616Bf|v$YEKjiGEakvBF<$P7Hq5ffei$>O8!Oi1 z^`JMIH2}{l{8z0^u<)V5EL`&7*Lc8<)+m0LA*Zi79Qr$u8ClzZ-gIFg?J%=!zo$0k z%2zIqpZ-gY&M|J<9dOyQeO)%UCp*~FZPV#kjXvNS8m;NgjuE|O@{(&e*Q!B%SkJiv zoUNeIg+ILQGAm~YhKh-ZiF0QBp)9X+Rrgc}{{POt1WJy(yt9tJ&+4=KKBtfAIeMnM zr?0sWjiebJBaQCcmSsz_d|Oz?*iRoqYl!i4(%H*Sv!a!WP69jzHAL2GtB zp4!2%33^Uc0T;5;ROp?*?ii zSF85pU)3V8@Mg4mEZ`iAgJr9Z!&yfc$#DUXiNhlRK4lYAX_D8d4-SovNj}U#)D;JN zN!y%m-W4AJbz(#8XgDhshiPDffjr=v2Y)s1vd}K&b*PzKph#%mbsv4NOBWxAx%z(E z=Zcg%bo3`eUWT=$p3sj?GLu#7V=0?0^GCX0d8ns#QtCx;m;yyMvMQLPUbZ zO>C>%4|_ZaUUMT(We?Q-{k%dJu z5xgv<7vaTqmT@||M8>HDi(F^5MbIUUcQMvg_-9>BjvBJm_*^5t(jmVR;$VlZL#c(z zTs>Zn!E!l9mgCa0^fin^f~zMJX;4paT}i$UzCZ~-r3RmZkwuG1ynqB*U^m;fRXX!EoyMzCS?y`{yXr9~Yqor|sf+$Lz&w0U zNT;!s)c>gNjB!J!U*6z7+f+-R>)u3njpY8a*XIBY0-7lNk=y8grQ%tB{HK>Mj@eAO z%yQntFD!rM+dph7A@qf>TX~)RPdLNJK1QFx94Y%0ePQ`6PD9=EFSvdR*7vooKSPVs z`oA^SRrlgLbr1bHpr_c+GOv)|kI^Scu2sH{-Q9Sf8%QqpEd6!G`)q^tTN>-1Xsmya ztlz0?zWzkp_jsc1d*JKuY^?u5V|`Ka`qQv}wy}P`vHlli{j3Ss4=Y~(kn;8H<8<@$ zuW$SOC+WK4^RI#R+uJ_>N%}kF^-nO(*B@!D-%8e>roX9p{SjEdxv~DS#`<@p??+;m zql)$WmFw&iWc~B7exR|wzp?%`vi_8%@%hZ<#=49P=&8fh&zW&jZ{t_j+Zx%v5@_PX z^glIfY~d9P{{LH4h0aUf61qx4Iado&81sYwpGH$brQ>=@$AN>BCt6N$gGH)lg~&xQ zX|`HnD4UX1vCE<%=XuLN$GwV#BWnU6IFBpOpr^z+$9M0(DGw!XT}xM)70(U)l@|S&`{TFm`COONYS;PP17-iG*yVcy=a@sB znsNJ5>LAP5`P>Zs6ne_Di_8B?TV6UCRMEWe{qH^Yv3W-z6c3%gh1vD~H<+Evr#2Pb z4u%bq=iwOWxs`8mTKegg&F{TVeC6ZR9Ic|iMHzutHc^5;E3zh%+Oe8|VLVyEbWyZB zm+Bh32^?Pv99v*0jdMx#f)8NA5JeA)+a|IuOqpRW5!p)-H#ijM$75c%FXH2U#pcQV z{#elIi~DJ=af09J2I^V*JiQP2SBupniGvCAA`|O~1Eg_cj-J#gHCRqzFx!kt@Vqt! zO8ExMuPr|^|JwX)wR*lAgcsVKekKvD;bJEuNKp^7r20z49T!S`C(&~xE1AF&T3_k0HeVBQT8l+~Z zC90MIiK-<~tVThUDkxK0IMG&`X``A$CxzF&K<2UDY{mj+E|2lJFp#SS;Ln9=BXtzN z;cQlzx=3n|TN>i_@}=iU_={qthmZl}q}UQ4wU7aN7lg$egvFSATAx*v|A6DN@zE;WXwodIP`%F0h;0W=dgsvPN7E^PLBbdySSzalSm; zIb*z;DgV(>aUc@wJioJR+8plqls4B{8VG3aH{5$Tx@~huk(uvK=6Cmci(My@1K)Cl z-ThO{)?^|(H4*FU(=X2+zj3PCdH2xf!>MqUIgu&sJ?Tp>AN=e+F?u-Jx98mH$o%oi zV^}9a{JsMCP0<^vS`z&{aKyu8`)fG_b3(>&LdK9o3>|r~1Z1a-;h==!NUr8Z47(c` zZpb$MyVc-T0K8Epc==vXi$b0gbMDI)EHxI~moE(8`|D9jHKsYCb5RVsFAIT1wG8cr zk?p^^hN#3GS9j$=B?_Zly*gTf_^>{Rzv?4+tN}@(DB((?A@zD!AeinfR7Vv$kpqTs z5_&FQs1A;duB#8l?lAC%8v}!iSn>jI*w^w#QOO!wR)e~cCslAqF)39Qt@Ii;X=jYF zZvt0XZeequnW{!z+iiYF!Qlz)?4J+s)Z0AiBjYw-=iW~Oj}(TyTA4>$Z1EH1iR#hw zdj^-^h0w|}y5kHT2&Ze$b+w2EC zJ5bNABkYonC&du}EeH5&8d*&F(jr9etFhdVLLMva9GKk`bMad57~rM3aq~IVEx|b)!fZjFcbrLZQ2f`qiX6=q1rx z3qd!LZZ{{oY?5^Iw#zLbg&0>4#ex7_6pt)b*Ym+x3n!<`%?Cr#*lPV;7z7ziV;o)) zece};LG4;?43SMv#!~AhRfiH!I!{)~;Am|N$lx~)J*q8q=0_D`#(a2oZr{nE(_#tR z)7J;G4v#t3>&@+p_wl`LB4~KO!^GT@DPD7=sf+*N;PgztGp2K#z3yl_eBAu0p4^EB zexC&Vav*_>l+CZj(54mvoIV6k11Fk3L_wnjFVh5%DBxj9i<4TZ9&^mI5f#i=qpysdEu4#d;lJRX6E~=zZ+%IU;&JT)n%e3#1K> zN@>%XU1@MB8`5Ub=}iD*N+z`wX-osa^;X2;A}Z8C0>R9*Db$wu(O0y!2;r5iY|dd< ze+1;u;Jx$cCIE7ciG9eu`AFt8B3fd0v>VrrA?A)`;_!#pTGmqszO(FKV^y1W^^1Vv z2tBdBT^*8f99n~8u?@%W)i{o3#j*7PM2lMb|F)>B;ay`_D_p%?!IA+S*D<9Az?<08 zazzOHs;D97@K(*3lQi~si1FmRNTimc7{=dtZI%b;Ou!;e$XhzRActO^| z%t^pMPL-)kQU+}yD*+jmk&nvAThV%=?)6!b=5qn93$14pb)ta9Oc%CiEp!^FP3T%x zvH}kw3s}+W`uq?Aeh4mJ82+zsj!FE`4FcV>C?){$jx~t0)QdWEFw~Lg>1~r)B(0KJ z(ar--UAa7|{S^_sa7FCI4nU->hD;8NQbYqcrPP6GrBRw!K-dmeWntTnsN1VHWJCF3 z_l*P(`tNsXb9JJaKP%qysfi}>z zksk+qV$>*Yp=yH-8(D1H$cPM5WQ};rHZsLZsQMM+S<9yI1=%jNj$>JIe0^llI{JUN zb-a?s4RZBB&<~ObM}@{+(3$x_uwCD}n-qn#4I*HnikL-x8!uOg@l0J++9czt{eX6J zmAG+WH}(BVS;5|URg>8gH)1kx%9I;gc3pcZ`KuU%c2jRqwGc`gFG*TP1~Ib+#EvG2 zExp>4#R~U&Xr%zHgc2>x-nbUUD9BM{@yalzxOy^`0GQyYfC7sil^q`6-rN??c};)n@VYAR{rihk zNz3s3wTvlKYUw!1##Le8H&Fjf)h1=9a#C&)ndF2NHiYy8xu1wde-GAdP}vOu&8=(n zDMa147!AN;3H?q}UMzs$X~@ySbXEvm6usP%xN()AX^{NPQNU&lu=(>#n+Q423FSqx z1CWUWGI_3E$d>_`5*|Ur>Ej*w^5|G=>-7ep6iO|c>{<51K95(#p^^=o#MTA^*m2sf z*&2I2u*&@`C0k0bJsNQ2k4^0CDQ@qXigHdZ7j&k*_lD;-M#~Tim^?n0@%FvO-3Egt zUhNx_^q(Rk7~NILkMu_DK3gJs^8N2W{Go`)5pZ`8G8>YKMEsgPN80TX`w75mBXx)_ zP_+XnCG(P$Y><)LAS1Vd6VixW4#>GQl5@RHVKi`#u9(af%zs?LDzmp(`o5+<)^19hW0Qo({HhlQD(|ZZK7&6{8S@wnI|i%(dPTe$62M1vx4_U zcP;3oZZ|)+)>`3H)kf3~9ve1k>JWQ*h5+xjNMcQz^k&c=17GM!m&#+AVuiPRLmJ)| zVWV6u?d$96p6r<{_>(ct?UQ;BUuJ&H^s+OYmi|*JOnrgu(a)Gy7!!L&>d!Z17uZHY z-O{WCXqEl>`CORRq6=oFfA-0M#q2z2Kj1PNd}o>0ZsEN*I|ez+u+-N%v+`T|N%~rf zllt2&m`-pQmf-$Hb*sPK#w`gpPV~T?>o}>uo!qwCf;-@I$U9Jyrzlu?go5--F*A+1 zhoC&!;4uz{bAHR+jlqPr%m(@!ZBKRIA_#P&y7X`i&sSVk|BNO#3>48Uv z(NNMJDLcyCa{tbrFWq^~Ui{ggE^WC3f4=_NzdU*XeyXL>pWX*QWNw0Dc=}z+LG4o1 zDeXDj9b;b9BWBJlvTJ)4QpE}CMbQe{(6UI?Rcecss5<$qS;#Aq-lSxz6vd)Gt8w$% zo3yhj-8OBfvl|zPR@kXAHQL+dq28Tqv7%rF7?suA^Kl#~1^H|GVFRri4;fvSuYkqqFGMFV*7~ zo25&18<#*<#7?**+=-Wj;~3~wrJ)0k3?1OG0XBw5CGAykE(rxr=s}AZFfR##tk@$J zki}>c+z*@Efnx^-+e=!DH{1z#OM0ShS{y7XfYtFr&`@(^`!PxjyMY?$sgUN4)?fm$ zB#rv3%xSHZbcmK3&}fMpT@i;%A3at*Y|E#;qpZWM*NpkA^PPp+jL~Tg-npY^`^cFM zr9F?|c+JfTJ`%q5*a?5G%iy-~#sj0BgQxsnSNB$aLvd!Sn$>NdK6CpVkstrcG5WW_ zvlhxrZw3vIF|{GT!0D+86%Negay2uD%HC{*Z8hbH_BCBZMT<<_f9WUh6H{*m)9qLk zDgLsc0+asS+ZQF?HerXXS~OxROS5>P|C>LN8gD4BPE#uI@fmVt@u(JzTwQC_z~2Tu z;$WoNL^@>gcpje0;^Wj;4I0Qh0@q)hE+K*_V#$!bnj3at-**T_bXo1R&y_nu#IV&cqv-SJ5m;n-}c1# zx%||zBZecf-Ld62XMePnadq~E%Jy-G`@1_I%r6&uzwm`#`ZUA$4JEdC_e*^41wM}f zJ{_Q4aB_x3#<6B(3}$^HK%fGJw_qdE+?=LS0XM6pDcP`7nx@fXtFE;%Mnj1vP{nnN z)ra!BdV+?>e*P9$rf_0InxJWU&`EDJtqWZ@dTgw;t?1ckpm(V=?^rCV0#n(#_lBqM zIC@hj9}V7ecJI{oaU(sgGmh%53rz2^-KQU!Mcz9Ix_cw@6j--z>TaqQK#d6@zL3c- zxQx^=8h2vxYgRShu$4>!_mGl$qF1y&)&Cf-|o2Gt#xhQcw?B^ za$wKF{GHp+TzgpW&c=ogR14EP|7QE=AKbIC!|4kgc>0l@*USyywC(OP-<=JdJ5d@x zg_zzCnC=EleN>eKL%Bdp*(f)Sa^|++UHXY8HUe%qrefr9l*Wg;mUb&gXjpAyA`&zP z8KMDv?$6NA>FmYO5p#LUuHyZDNA9{K@Ma=m;^-s1E`M1 zI87IjyRv9`#T+apyySZeVcSc3&K`bIb7u4xK#Z=$Sk-vF-RLKU|u= zvobT_4Tr8Bzu{Q#rbAm!|KZ0zl)vfhp}}eT{2y!^dg(ez*PI3(NYnp^vQp!dtZL0 z{muVNEEmt!J-iW2TZpTNLmgQ8j^i)9G>MnifT}3dz{R90r!w=NP*`q%XH`ZMp)W zerq_&^nH56spJN&%3jgY59sLcVxHmQeV;xs^{8q2Wbw3hc;}hhkDPym*6|+tTs+>y zfE59QB2}fQsah7bNhFoeFKEf0i#8v47CdqmW68H8fr$m_5ecQNP|b^FfTIF%3}(fl z1{S}1Qy^HBVaIbyEdJM<&$U|kGO%LdV8sd^iRG<5&7{3Wh`~w)QStyv9e&?~QfrytcpkC#K~G zc0Iej|4TCRCy(8^W%KBDx9%EN;7`+W<~7E}-UIPrfvOqsxhN1ET1byS_OeCLPcb&* zV?8j0i9Dyo(3nQ1o8>1fywxKa&gS;TzskIKJkVj`IAdATSMM;tU^>}z5O>F@nh`%k z)fRc{+9Pk&qhx#??EE|S1H2w$ZZnC%*%OW-t7X^;@i*#|UoyXBg6tfprA|XE_hs@~ zf5*H=|25o?5${Laem@2yIED53j=FPWO4H>l}3_5+PqO( zK7DmM?6w9SffJ86PnhNXsR(DXb7gn)gxu>dn0J^EoBKe|!vQx$`wI)5voP-r4g&5^ zF#pE9$38(hsXQem4AF8JarlEWl38z8^SL-A6NO{>_;eaDh02VS%h}4b(ogUKKE&nA zb5*`{WXs?tb~0LUbM}NeT%56Qn=Iqry#jj|Z|xl-B-rx{mJhgh7H!k5l7XU2tB77du993iRTbT1?LK^d=&4&VM!3R*8 z$><@l$$~|)oKAc~L1U=StinK&LywP+y$%I(&t*)oJF7Q*ndW z6!cGRH9kKp*AS+#r-9l`EmKkl1My;pWG`lj6Ef(r722D_NZM^0hb!?U0w)m{E=K(N zhK`Ppj^*K+l(_m>X9UJdm(+rAkzhj;3FTJK3py)DE=6xGg zfL8XmJ?|Slb9`riajs`Wlym58A!o`L{HWo+1MTVFA4rWy^w}R83>Ig1G&iJ3^j~vh zt0r_?a`~7d%}bh&mZ08-$y^z|!ycCj_V3E@GVk9B5<6KqHV_jhJ0>x1Uz-K!h?} zFWqSg1Xm>5tpEY**6FV9Ria{O)~m17jkl&s@;lmJ+sYu?{!C%yioLFiT1Qv$@U^Yp zR!N6F3HyulvInVJKkjfw+Trc;4sVzB*>+ACMtz2rs*S@)-ZC>a(#h z>a(Qmc*b|mH6R#u%y{+5DDj2&&ZNO*C7tGrdx34`w-}L@8#C=47!}0 zFvE#eT#j+#JS;b*sM)bM0QeOEzba_GYK)9}qwZ@Tmu0CJW9h;`Ri22Y$2in}DIiv= zGqYQE&L3LGnG`)ihzR`29+I#%WB})$-bzK>kI76&a8IRj6$SZ0JiMLrXt@Ui4Y4TU!_yjSUyRzc$br@=% zFw`V+%={{b8i(a>PL0E`ecsD(iZ#~OvKN+pi(=A^wRg49$JKlKx*gctQJO`&dW`I2D29_J@CaQH_yzkWg}o6%-3MvU!23bs)N4@)y)PA;FjR(u|yOR6D?6d>IH+@5{)HVuqgV9imMym zSMT~?$$^vm1NSb+PNgb#a9)0q|W8M|N*X=SWA9NPjn(=$@MFX!s|6 zWpGgTKYC9X;)GmdKZ5xD9gJ2m2Uc_8V@oI(2luXGrRD(|?mdu$P=XdhBtd3|+YdKx z|NPq(IZ>ou6odB5Bq}Eb0yXfe3Xj-4=M8$`&j21-s;2e?$rG+9TBY`QTkUevcJNo( zh1`<|uXN*|eVci4&F#K_1a!lnH+n-O)ByEAsal?CHTi~QP6)}IV8Y$taa@W_Y4LWT zrBVDlG3Aj;ljfRaqq(M-6`U7ED>z=I#-9A(($jJ)n_iwQY&FqzlI(^U0|AdNQZMTC zK7TZpX@o3Olv&`?RU3+ZUiyyci7c; zhwr{|b>C-Vfd1)v9WLK?gr`ExiDw>dYx@k-o$Ix+z}{bI^nC`YD)pnrWVa4(x_XDv69z-nf44Rpk$I5j<&K&BY%5IQ0}@1cAZxSDz;w1 z+KaVz4%1CmPPE%DQwuu1o%hHak5ieAKjkzIX|?rM#7sXR5Xu*@Cg_R*&D^%__TRT@ za~k%(5BC19;qR^K*BoGOzjD9k1xI*8h&f6ZS9NPf=%26Gt%WM-(32#a+l+)M@~3t$X04_N8Yvtg0Z-Qw>c%D zvBf?OnfwtW4tyq@o3E_p=&STuN*ig@+!em>`m6L<4oLfU_?c(c?XZks?&MwO4JJbR zWpGv*_d%T(j9HPz{E1a+ihz(`ErtACb3BwaN(~Vsbk41f7x9^c8tuE-8e@_>Wtcbe z)6;pWQHDI<3gh}Bdk?2&|7H1BO8WnLKLfOn5!ye=v>E0V>LctKp#4~;4KhEbp2a>E z_7$17jd_Q9h|K|QNv7S*yg@z6UJtY%$+Qd1FR29P$JqZa({=*wQ-t=KO#36|W$GCF z7|{NQOxwY{PCduo2ej8^+6~Mvs3+NTK>KHzHUZathFtfrGVL^cmrs-L@=lYs{HvAW zm2E3u1KRRR=X(bU?H-`LNN6iE?eoh&Te)lHOPp3kt?=(z3GK{^W#!qGKZEPuU5ULn zL}-t!^sT(K@;uPqUx~jrNoYHlUtM`&WgpP~172$(v^!QNR_ZJF0`0w(#Cx+8_5T3& z*Huh-+9jO}a8*^h=l9v0XL$E?18Uwt5|YCqCoe)y0^tfF5)eoTaB`9mudN_pjNmmd znsB))eVEaj>guWKvMk5;It_VH1L<%!>@>Q| z;azwS`bIARJvbVUg_GcR*bH0X4)~IPO8ljNUW}vvqx2|enlsUv;LLN@hzp!@aiLQs zmcUYY#f}E1+tEO}l>}zPPI#Q7-`P=jxs|xX=7>*6}< z*P_?!8fH5iICmp;qIgmVW7Mqohr~nJJxuxM)IWm$0(}(yCHffpEA(+%I7`VncphHl z=rw%10dK>5&^HDgs~HHGR{@BRw@8vcf(ufo^h>+lWu zdu!8uo0{*ycj0^RWAoqr1a`w7_!&G5kHDkw82lQZfW5ST%6xYF(5KO7?5f?f@Ekl3 zFTepfXm`-P42R&b-A#7{-@Zp*L0?7xfWC&lj=o_%>E6WR-_W9)})pbJI((9`+`nC!#0WUGpZ}UGsis9(vQ^ z49=QK`9A+w;(l?C=Khda>>m>s!V*eszRz(gHLvGrj$aj5s>igw1yo$i(l#6*K=9xW z34~z5A%hcw1%gA+0KwgT7$CSqf(Dlf7Tn$4A-L1%SE5Do_#)3>L{P_-BZ!VaQvOu@^<|HvFQ>q4bIsG;|NMv=C1Ntqy-VLJfg_iJcluDu$l?(Fmb2J z-D7!Tc#?afdJ=o$T&ZP^S^lBd)df?$u@VtN<2af)Zqn??Ic=JD*n|F#`q(L`TOI76 znX6816!IZ_TYRGA(WuOOs$1TxEhzn{LKXmAlac<`R>D^7U>wLV<+#xpv-&D-i&UQO zj<*4ANge#vc8P$Si?S=6N7<}Qr{zfCm}0;xza>1 zOKC*3PR^pbY=dok%?g6s(`MVdoja`|ZCIp|Yd`Pgwws8LNB|e(@?&bhs1EuSlM8|c zlydS}S5821D_i!byCk`IUZo1`c)(%fn0GctD{SF*Y2n4aL<@$_x z`iv<1CK^=~ES5+;8)$|Ez^GCkWuu&{vbN=y;Mv@>rbILH$wacro|IQbE@*4qX6`yf zq&o5Y17`LCCTc_+A_JOTV^R>Yc$${DLLWb0@{{tR3#x z<+1CtV?Y_QJns}o1?44->rWy#7<>1GUPvWvKvn+W5HFSd=a@nsW1DVL z6CFdzX7fQ3l}}_T#$KF&if_r9gF}U_${M1nOjbqZX=tk8={CtZTVL(G7DAh#p_F+< z0fyNC!h!Pg-je@Zxqli-&;6;h_Lz^mhc)o75tt~r1lVglKULK39d5O6_B7RVjrn)O*x5?yEM4Wrc+%L&(1?31$h$N* z5zHejE{!MaV{R8Yi~g$mtV&k{&C9}w3>-V1X$S>6(OUUxuc#GT1r5bkwyF(Vh`F}v zXe<~)_6J~u%+p$iAPlO{sF@K>b!6uC{1M!SfL)*5JV&xLt{pP2ZVbCeOB+xYx1KzY zAFrLK!>ab1q6()tzw}+~7bXN|#z_sMZ!@DE59| z?e{9nN=Kxn%>}rvx4=@CD-!KKjFtV2(;D>YkIUAamU*$G6|%d4-ap;O-@l_zE0w$g z-{6n`_YgLcT%(n|TZnD3&&jM6r<$daiPwd`{?Os9P0c@WJ}9vZYK1eZ^JKkWx6KSv zRFZ@Q%K9|yv7kgU+_uOJcRbvLf6WRdc)##w!h)`$z9omHXFzRVU+V8&(_GTj(wW@B zf!nksEY6OuFz~g4qlT*kw^-4JiW}ZpyYLLo9vYpL<2bYpwGi3F7`uWqNHejca8SRg zcMMdSbkPbL9FyhN!6DbjUqDRGA4i;L`1QG(b;B%P+A^MW*%x(1^g>t=SwSqBhi@>6 z!bA@HD|?Ve!n%-=bK{F|h~q1-cu`H->)26;{f_lXHap(dK4SI9)j%Qcpo8hxVzLHB zwKCPB7YADEV-*IFe{N$l3{cb^yIRfzZjIQW1xoo6}E_@p0-1-#Nww z-3>a`7F2K4J7BrhGIsfMO_?*!T-t{(honXzl-XSLas@(6*)=EuFVY+oixcP^5vySEir9z#H*CYzGlu-3DA|`^K6$_{gNB^Oo3Un+vST;-ZKwH(QfxI z_EZ~*biKSdM@|%&yF5oXcrP%}qmhyOe0}$AR|;S}7yKZkJ8Z3CeAQ~h-=hYJ*F(Ro z)X90)AS>#U=)22_JZp?zK0siUz}S0(&e`JI?^5`;J{qYTC}#Iq*GHsvXVk><%Pg5u zHOed_dbt#Vkt;)Qv*H)Z%x4~=qAotZy1qIA09^S%l|3)Ud5${*t!jLud-`53w=c8A zMrX*0o}wmt|B2ny`QlD&)Qy~IDY~ikrH<(4-f_sV(&ME1obd(|y94(^s1dOw^q5<0 zBsk74doCr{-4sY$$-qBSHffh;5)+r=-&BfoM$W?)P6c}MvW?&y3d`Ei_!B^cPK2Ey zW#OO3ycD^*4cmxrEiaHtdn$ljR!bpTV4-WWP0=)_qv;D8+qygk#OiSl~Im z7_)6}U!Z&GBQ05svZa6&rb(Rq<-*P^wRcUX&K7+2xRjGKPjJC+w?|ago^MlcLUG*) zsQl>pYKYI;yxii!TPyBvxH~mv9ynUz=*ScTKLiY%GErG{1A^6`r**v*3=420!Z>_I zM8g{3l)FJ+#z5fq?I^nxvG_CG{dzT}R6+Inrx*T$Y$}T#GabAa)3LzZ8_*3@8Aj!$ zQ5TGbpMu{O_C8nJc*^V$Ovtx!w`5UotBtWQ0Mogk0;M~$4EqOjJztXz=EZmL;5#SS z^@De0E#U_r%Pj^B@5vY7MNJ8uuTWeXpnovc^DL=gDDF>^@hUeFu99G!=MezrvN)m6 zekucFoU-yDjajk6-RDy$U(UHt(|rV1g|`swThcnV1S(REI6CgN1|OajD{L7z?ADu@ z_^Ji({SA@k*0IlG*X8~{{LMYxhVu;D z+YW}*1LRTGIWhQ(cal+}Q4&#N3Y=kN9rZMl2cQVuahy44_Yii{oOY+)Zzr6ehz0{i zNqp;I`p0UQKg!yR=L-B6C~fIL1jRm+c9b7+0PXx5IOIjtGjgd1JekyD_d-|pCnIAD z8R_D-lD48E0ZXAvfz=9*o5$wztOak14bzP`m~xvK)w1@`7!urL2a0uy)%@RQ6(QFN zVnOik9pe(TZrN56V9ahQQ}S6J`qaBY%Re`*-EihuKNe>-6*3HyQ?qM}UwotivEm9R zJV_sLRADU>Qde5sR#$9}blGMo35qaL`npgXkTf)5^yZ}6mdP3Tea-{eHYzDv)I@H73Jb1?y5q;Aq`}>e%P@T`c&B=g}0L|_|r$V^{nFCaV?;@ zu4O_<>NZI9BeDjvB2w6C=?BfwxU|~C<4YyOCNBxnzMHV^`rVF7N_^vZYJ%xcilpED z=5MTq;TvmCl=g6+(*5SR39*K2{e7=*4b+?aL3P*qi=GAJqIHY6@MAKyE&BVm->%6w z?*i-Ktl_t7l1<^jx~PA!Li2rS9{=JiV~Uag{N+bUfP7dUvgodxp6?ZK{z8 zcX?!Boun#N`pb=9iF5r0W{!kcN+%X`dSZQA8c5UjYAisZg-3vPhOH^l>)6*(3Qvzx zY;FWQ>x7^qV|uM@tLiY`=2Y?XhoSiXt>we;6gE>ISX0AThw4e2&bD!Q`8F-BHbP~^ zX@_G8vv2$x;I~N~FQSiop66-&WV`RPCrVNeJ+?b&?F+Gn)pWbCzHWwZG*fM8#gDO_ zPq9hP6XBUVV-GHL_U7-f{J3(eU(*`i`OHpcY?WkSO!!ASdD!R-^C2gBy=%|lUDMWFDUKFkvmcE7UMHLE-m#; z%~vB;^_sVICJDLIAcs59Q3_~CuRul09aAUDCc}#sh+mI(OLApj8xUROR!;eP+yUbT zb$bRrSu$yT%7Oe;V1-o>?%5_ScB>aI+!m!~PmZ66fS2FiyPhDN+`pj~zgMVi>WMzM zV>=OmdW*J%-Kn2=Kt-}ds?(-FzJ>?+X71|3|ELN*mx9DwT#mPI%U&eAwSIu#C*~ihI4NC=^c&%!1}DU zqtfv)RY1>*^!D!#IpT0aA!v)qJ9@T-fdn676aWf{)yv9xg)=f#;v)X?;{Uw4R3el4 zDh9{+Ei#-VJ{Y@Nys|0jDf1{ZgB}KWBD_s9@^#w~#iFlQl4J7NNQU-kQOczJ5Vj2e zp+2$jZW)-2Pja4`*~q)_%Wc`)vmW%t<@q`rHbDt#>ML&GO!0eoOh>5e2N*<+;4U}@ zoUoi&pHQCYoCrbZHFX~W?YJp0=o3f!_aGGx9^gG7VfoI7-eUFV4Y~ole|*@|4A}J~ zEDzJ|Wd%NOfClVl5&xGDpui7#xU9Bu*~vCKBiyC!1`MN0zC_|(6unF_cfNdc7cB&OSd zZqf0-2R~xIE0#tS+t&F?Z#Z69R8*c-HEDLuC$U>cSoVYHpS3{k`&Zk-3?st5Lcg<| zkGQt|gywRUuWLF?EUH_#_*@gdo>SQhK8Pj{ZAv2IG&E*QH>F{USb# zrKn!rWB)WvX6dYihrg7+ssSzwCx;&F6Yg9iqW92%^gP@|| zrYahj$E6COJi`9L^s3DX3!7W&gU5amTgR{u{9*) z{p1f%Q^T~{36W=N?QwUS_7V3X8gkMsz@~ej+A(jvLhyIpf}e;&B3=xySM>qHC#?#6 z=j>Czkvl<*k+x%)c16KAwjwjz6dNy#7Xt>*76owzU#AlmOnR;8Zx?>H)Q>$PS&)@x zuBTk=tMe!n=a{ za?U?}y~wnH;WwsP6{C)0vrr1Br$RWXVc6hf{pTMa5w|~i0U3ZSFg%t=0>&)r4Lw<3hoRMy+W2`` zS2DjO*DF=pYI<@$3q3s(aF^#eNG7y=k&b80mOYcNxT&)HDz~%wTxk$s6Ux($DskNM z&6P8ZXKrtysxjDW~cItlhn=%9JYX^~{245d6;n3{5-K05RgMcDL4=V{x32_)aJE*Fc^{#! z8uLDuf^DJSAm{>sXj75!Xs#-0Nnu4H)6?<0M#1Mv&}bnuw#JaS6COWls;|66Zszz{ z#b~&xEjB+=YRK^05eZYU-VYV#nNzWg zS;iO`lpcXv(3y&#Z@V@*4ERnHlq-IUFcnX1S14MF*Ju=^*k!5(c@yv4;v3+fHkhwI zH9gG`kx2g@@Ecd`KbuTC0ANn$>s%lbJE7Mu7Kni2Jea=KgQ z`hwwBpCRhOA(^rM4Qz$MW2vp`2NY-h0T5|lqhg+JWN$W*io?z4F&6Jef;|H*17+PC zhCg)M2%4&KlSMoLtJOP`GDZ($L-J-wIl($5*a7D20<1*v$B{lbw>_2TYr4YtY z)07)ms?V^vY35c|#TXy-8IX#fm{M|UKF$J*ll3!({^R&II=i~l&uXNGgddUBJE}@i zrrNRC(G5!xY_h1S{=y^nyK20B*%)v><`H(*j^yK=3lR24SV_j3N#1Cs{HRmOBGu>b zYkBsvWA@H8ONb`{Hu14t#Su+mh|b7@&Z3KxC7F><%QG@0?heI*$xl0Z-w&|SNIfpKhsLpvyM79Nmc{0_*dditdcPab^45#=q4O8OnVw8Hn?(-WKu zQ*=r8IX%fDN%q~pTv!l1#v8=B=V|T*$()En)FF=KL`8qisaOe zm_S&~*vp@7lbnY%AE2r^d{;EC8gb^x{ZuuIb=;ZvmyB}(D_^)zwN;Vq~BbAPIrlGU0S2B%>X4(nwxvL}CF3!7%hwvk;Bg7*1 zl#Oqy?}=8m2XULbDE@5hWhzZ1Qk2coB_+5GY(tqD^8?89HA@O2OWBB5$FrVXJK#1O zQ>?0O1PngqTtE10uxMO)PA(A$z5X z(L^(FXBs}5OVc~MtorRCNX{UI!!#Ad!SAgtoJet6{YINt$yb|lo-B7qz=Rf_cvRq? znb7VINzNokz`70n0aUb&ha~oUj+Md0pQ$LYdfKJ!%H1JD{%7VA{tC=ATEyY`?35<0 zufAc4eGxukdM@;<$Umyxq87V2D4eJSd#XbY#&N+5Li{<>cuO)CoJu!G|Le?2>xZ`r zJVBO!XWL~C)MaqqW$9E-bAQkCBZBl!hl6~x4Y9V>{msWb=ZaXU&GE{8jYTCWM^)*{ z+MZ91>C|6)yHL$V^~Z%3Fg1-=hA@33gq%=XCNZYJVXta8*(IDC;7#vq6i zHGU^O_Z!qt%N~BngmnawOAcYgF{l;fm;{;Q2rU-NA8Iz6yYvEvunplh;g?IcAWwpY zZm*bxxqE@T{@$zXRCJ5tKb14-K{>x($=Px7)MO-^XChZCw?tg+!2@4;dg0wwsO}Ed z5VpC5$)u`Lb+r2GU-9qg0tY<)h3C6H&kc9z&L3>+CpIYsr3xHRG9jzmoF|1|Dv$qF z7ZXfU4zU|8Y5Q--Bz-+_JgN8Qd4LGewlTX`6gc#)(suP#CA;r*83j1w+q&$~7A$G? z$`;Ms-!rqy!{VYDu4VTM<6&b<~W)KBvon(wd0l=DZ_QO zgGyk#8FOzuh0{e~U}o=?VNFH&;xH$TJE?6~ENGA-@e49p& zn+^ZA9^p>LVwEu&(oax~0qL@hMowK0-Vmpfkcrdk?_|T-%X`k#Z@&_uo=M3A7aIk> zwtOE-(_21X)z|73Zg_r^p*Pv^jFwrV%iCb_m06vedHneAnnyLLWZ6gt6OHO6QRorSrnE zWGl#$tXpp+Pza`SK}r!w3-fS8)~&KVKV$}cxal8a68uPqbDjF(WRMBCsZJ593JTaf7Rgcp-Zs$&sZmTLHQkx6P{85T-b3p-66o=x-bU-JWPn2rOv=)k;ce#?ZOp%xqajb%(+yc+!Tb#xi84YX6D#Z@e2OwS#cpJm#2zA=SoVM^UMVmv`!A!s0Q$ z_t6#w!o}zveDp6lhd}*iohtPw#H|7BhyyDIwU76!%5p!pU%;0uo`x2Ec)?KuT*-xT z@nZf$kiet8&3MN-tf?TVS3-2RVfE?5+%wPd*}S6>iDXx$h)bLYIN@FFa!cq@Y8wNe zbgUAk^HiG{%<%&G2G0vQsw1Y9_)K&_C@cIY1DIQ8_^Gk1WFLCg29nZ|55wh~*fA30 z#VAf}Fer$%pNSem?x@tvLHxJI;WGo@n^=lxGT2XzH^fQ#ls3I$>-2KHphUT(j3r<} zN!w0n1W6Mv7+`QBIhgNv7H<+R95P1FarHtny%QQk;)w@VFgTI^OPHf!S_ybzcp@9V z6g)=G0i=}_>2$N?csNZE$?a1xwZVy4xL5EP4#(AV_@Tdqp?Q*j^nSC0xvoZ1C_Fu? z&e5&VbX6o(d8l&GWY*%I2?j`L=aNC2P=F;qOO_euWY7YXs~4gNW$zU5M;~f)UWqjWd|uZ`TZKZRFVW)9V ze&^>V(5pKNPtf?e2?uZe3+de-de#8&tMiuCNJm(-`Edl)AP7Xz0J=Y$9F^~&(BPvmaGqyHJ~9wLMtX90N?t!Cvj zX0AR?G(DNwk`Y6=7XJnMlxb{`H5qQ#gj)<~=aH=Kelkt6N=Ez9(BCrLE&{ih<9`=w z(R_UGZy938k`3Q!j*4o0rWv1i6XgciKKyFqn*erXt`QcG4_ zstYDNZ59xuK4-E$n0Km$HBu}p2rX9jjl%c47cwuw@FEtmrZKaXVNtbex znu4@TfPP0XMo)VP{|@gGm8+}bQOa0z4b8r5&SRi+%UoCfT}hYu9hX70x47(C%Tv?q z7J`O|dg5+|@HVxXt$Uf>8X`pE8BIYE-v0Xl-tK!aZ~W0?UNrf$ zd%2YUv0oG3vs!9PS+C=2ZusqF)PXvUwi9t_#64N`KT71sf^wnhDklnhEAJ$11HDK47_+shIn|A5+KFm#T+WF;5!TGS6Qxg-)jW?mx<^8kBv5&&w z>ummdfqU%~hUH=CzDA$wy_h|}>ClNDK@1j2;JX1ePsPlAA9m)za+vOd8R-BAW1 z@Xc)P$j$V-WMW>+7POc0TzF!`KWtIEIJP?~jyh$!GkZE7%e>66K1qwSRpXo`WqH{_ z5SgQtCY>4=dyoOy`a~`zuwt{l%fX2;%!$#gq>zSpa7~Z2+>39Bn39)w3g10h-ZwFJ zu;OYPf!W+|FBa|!shHv{Fzdcp(^0)nKqPi1Mv)+%tI~^=V5Sa|e=~oo8>=%e%^mmzEE zU=pOxc?1wi>(!$}mp85p7cUk>;h4;88GiUhCgUKTTt4#j>N`Ua*Cu6SylbRC%OB2e z)tiV(;HGXN3SyvEN>1PgNQIq899>32+u_3+1rB~57lM#d#Zk0LLEHrAo2y#+pQJ0L26gPmP_V&#{C#~#Wmi}bdrh2A)-eCy`+&H{^{)hp?jk@?PL=5pa-K z=J-~-d#R>=-NlK5AATY08`_Jm<6O4|25^+Y#DUu%JDITNDXYJ+9mhuuKr8U#F(}$G zUE-iMJr%k&YE7~CxuL8|s&NprUUs2&u_DF z;8K5r<%H*!S|UrAu6uT(8Kh{!T&xBxAUiMMvleETu9MJ&PeMXdK>F`hd6O}E9`oy8 zl`)1}E09b4ulhZWLo1C-{J+=lOQlC~u{Bzj^{mWgH>SbA>x?iCVJ>M1eMe`E{#qaV zq0u)tPFX?HmuZ;z3W1PGG#a) zyfnbX=a7WC_)}Ot)JDt4B2vAzlEIU-o!ht(iC!EMQ&PPNk{f>J6#`kBpH5vB?6b&EHy<}8X+joEofK+lA(3OZR*Rmr&fNHYb2@H z^bjLpAl@k^-CcXjZe$gvN(v^|s!T2UKF8d6yqQbSY-Cfd9)*JCy18}Zo_g5zEzaWO z9ehBWOE!FZ=i}j|R!w|sRLPW_Bzzt(`7p3&mtvf8ExxsaA*T~_KSC3$+S=B#>?32#7~ zy*E&hTyI7eGB(%M*GRs7g23^Vn9-r1$5z=yRmu&=R%7ssaGe*ShIjyD~A(O!D3>v*NG{=BYVDFWm7A_jPnuBjZz;DZ`pn)6jixaX>> z%Hrq#xP_cW27TMm-b}?DNOdUd%XdiFsaMUitYg*h5F2ZIYBB2+TAa7UX|2RDwb(gn zy;lF)o+WuVUu8licOIU{GpMxfxVOG&!Md+my?=eP9C$wu^CrKutuTGc;cxS&)%V7! zv^0N-C}Nq|V&=N4x!+!Ka#L|~RuL~3GBrQ)vj$!T_$=v7_cjVsQ>tPrTpXt4hv)h< z1^5c$YR6<2%;;#ObH4h`=jqF^H=&DJZQSvKs3sINm|6opb3AcrL<5%b&8&82S4sKr2k6X z*wdh9>_~_Mj$jfpjpJVzArG908w1zaRdcrP+Bt=k64UZz6)4`jBc^QJORDD3%R`_8 zQ{@ncEC;?C43P#{#s7Emik5I_p0#nWeV(_BM!ql@pLwk_^xs(RLKsygAhuJmw)Ota zt22*I<$EFf2oaj%0G>PNvL$LfTNMX*j%eP8c)p18`aSa+Yk~PSY)#+oca9D|8*aDC zac_v?(BruC?ktFRcCPFkRlJKs$$rqIS27`Q3_`c&O_N5y=Kco}reAZU`6uyuxn@f9 z??j)5>gC!W1dr<{+9vgm_ z@v{FW8gAczwR_~6A$YeP)3fYwbfGOzziO=kUTq zh|0U9XZ_&R?WTz;s%3ipaN1Px?kc=TZx*)s3E(G?)ByO9HTwQ0+W16=%6yYl)>A_2aT8tI!-n>|DY*dNuom|mto?gK z+$r;vS&-NbUY{4jcED6E$lHh78NZwB6x}Dx&kOxa+e-|9H%vJ_e>BAHGEbO~%Q&f- z>lX4q?yIsAIhK7JNbT>kVRdmVOAcH7xVvcpAa1Ce8Ty+ju#CLB_|{<3dBm%%Ujqq{ z*L?dr_7^;ZGzuyLMX}uS%a}v27!fm)ZssqV}VDy&sm7a9B}_P za)hX*`(~i4@}ulP*NH5Lkcw3c>a&H~>CHT&>D6}CnOg(CR)%|53B8wcX;tUJ^A&UQGiB^3VIeYFp*xXX#ir1KZ zCZAyjdC#b4(em=S&1bdT_Hs-6Y8j^8b4Vk)i6(NzU|N2VphuGM!EAD|P+HS3;9$W< zq0I1)?_PAL?%IPn7;Jk;5n;0aJ{QbB%Q(jUY!uP!hNPU4d+^M4afxgm?jq8u-tQ}_Gv^;?CKz$=~! z+sYc;&g>uKX3Ipx>f3j(=LAUBv@|-#u$XF0=SQ04Qsz7B9*Cw~%4DZzl+rPWh0T`E z{a*FJbNN$mX8B{BVCg$j4$^o5h(U}B#Ja}yt_z-0>OJ18K7O|E7$1C{ihf`|pMalx zNext(XHBWqb51Io3@=wu#W&oQU8L0lB7<%a+1VO$q^q zO{6>U93p95}g$QDM!eCgdF!4cj&#hKqLTjBgjwtLjf>$YCrRR&53tMCn~? z6&fI-un_}$R3g_;|ASbfR=a%q8=ww=R&#T9;<7(a4)r3O+gDuk>#_L!lo>L`OpG;vxZg z-fTn-9BFOjm%qe%r8NO$WM3?%V@JAuBwJ%yW{VjTw)auUnG8Obxi~zeU90kQCCpuC zv>g9Ho2TcT4n&usf2ObnQy$SL5*~$-j1a<~2xg&tp%PQiN%po@Q~~m3`L|LTFdleJ>oL zJzg+*BpmVcy#Wv1&L?s} zFSt)7k!Nj4&&Z(N)n2TxMVVxS?DRz8Z@)X}1(dW+uad*$wi}V*IW3ssj{7wP>tT}S z2<(_$5YeN|BedcQ{_@ZkFOW+2Gm_mG%eseYMW#9rGnHXdZp%=)plj~vb@6rHFfJt5upS@tRaWIq}%4gZiR$ps++X~Wz3Nx&vZ z&h>{Cs9vEWJ$yhUZK9y{&Q)G}UU`a0{Qt<#+g1d7LJ!QW{fTUnB_aUsYbb@r9&GIu zIs(k3fAd?dEp`*-1E1F}?ACvnYHo<;pLAi_e_65rI#D7*vS1cLFK0n5h_^s2W%Bv( z_ES^m;0pduP0F=GZ2SKtKJy?ppy5YL4VM?q%^Dy51=Td`j=Eh6`1U{Y(Ee#r!xBMb zms8|gl;IdFZ%KR}LTg0p|I6wB%eVehtS_?D?ll!~TZn<0dcShNdXFG+VaxvLk=xwR zhk2WM$)}V8s-dNkKDvq-2|=RiR;pR7=IHaH2n7iKwd`x1sBE~k;BbS~nU(b#u zJ1r;kUr~K%0z{rc!To^9;!zh!9QeTRJ{e4H<8`)zBV{{ItgVNr-{J9S6yR&}3+rm) zdTcDY5~9O*MRmJzyKNTLTnt))qI-V0TpBxXyYCvqX|jO0!vC*^`i|~otM%S(M*t{8 z3gM=cMEAxmdaZZ22orXX^ur*|TU%86ClXa8-*=g2HvlN?%^%wz7AOt2zEX;lF(;2Acmj0Giq?J|k_~~y) z)mMzOD!g*(fV~aO6MGnumqrd3U2ngm!xJRoEcvqSdjxdKHSnNke zJK%F6+zRy3?HO*jc_ZBHI;j#yc5#;XQWYOO)EF^xWpZ2pB~SNVGv|ew^YP{OQ(n5% zj`E?{Dsp|oM}~-AkG^wQY3f1E;}x6*NywH$T-vs(H)=l-CTISnC|C0%d8BnZ11-&!%xqqhWn;TK zDDAZGf3tSXU0qO&P_e?kH|g^=B!YoFSF-2F=UYV1^-5G5JSip?)mBrrhLeKyY&*b2 z=(Se9QUB_T@E91Ul0vOwXi)bC>S;YGj;}1vHjOTIn9a&{fx86{nMaixcy`TYZrq}u z7@_6KxK+DAT`D$h_+{;rHTHhLr56|{Zh$xS>8qGM4*O?koepXzvJpH#38XTjHe_NY zWTjq;zYwQXm!nkIli7ap#*=+JYC7u(U6t{ilgNp5kLdSaCG6M~CQQPvD~69krY{oeSeY$MCYN>)8FsGr%7+x!Y{uVb zVl8pq7g2p|Z5I0a(Z=){-@ACA!>d%2hcrHKrum>%XO1?4_kiC?shVEvY^roJ@ z#~$)I0D^FT@d6|iJ3~%@8Kd5>UV3EWGZdi?UZJ`3lt3tf9=h|_2W7$sz6(t-QE7 zv&RwNmAI4Qv$D-ewc_K!5OZYsIucoN=7d^tYT!w8EUlQStSWO#t%ND?sX5Zzm)BVl z=J<25-J>QG@@fHlU*0Q)ew7mLGIyNwt^QtQW;qvFo&A`OQNkRZLCnycA|iLs%p>WI zz^HhVxWG?&?!=r?)g(!Qai_TelTq2ZI2Z7uIZl#-4igg|J{ zmLx^Dor}OU4$^v~H}+ObHq6X+F5xUw0Qz<={S1r*eRCDq3~s3PA+HMwvgg9d^@i%% ztg6|pv#^s;|Yl6Y9o!<%+oR=%!Au@VK++CQq+A zy9?>216HtpDF9OeYZ31FOR+sLlM`Ie!9A<8A?yYU2#Lq8V+vr4#qIr4s7(gByX8_~ z4dgLBUza&HllQe6s!w)ZB^8Wu z%^ra|E=9O*3Aqs+^l8?I3)IFm@b)Y&bTp-G%?buxyRj12_8z;jvD%9yxPRU{M%3*M zbK^J|x`s73QXh<OHInOSmEQ z9$JRg+)#Rth`^$5@b3p(U?n%?_fg(kA{PpGVfUNf7kYOJ?=-|!X?{M7`1zvayJq0~ zuu7Ta@GoCEWh4ib%PU{e4)i;eHx@o)?w2VqFQh5xw^`qBQs|Qja*|2d_^u87u71R+ zz4iI}nsQC7bAE2vOY!o0xeBcAd(8bOVH{PJKV-8iL@iNEICf!F5-q zis^x%xhtnd=R!!`)zV_NAjs}Yy3q;njpRP)#!N%7+*OvMYao>F>Ps=_5Tr{*;piv` z{-vsL%m@VIQn@+01VVnP)*N#HLA_M+icW_RUw-h4x$iqT3c6wR?pr>Jx?#R&WGu+D z5GSuxN_P78ddJRsOwD>6mtR@xmzj=C!j!R-rjC5VG@+A(jC5qbaWJ^r?H&G7T*D;D7 zIXt7`k(2iPx;5i_&c6E@_|DP$c>=$TQnOT?llBY8orzO3xt!JEYXnRSImPeiYwnH8 z@BK`1v5Y#i&^6tm*c-3Y8qFFWZ>s!$t2Kp?T7uz}$@;UazGfeMz3o-sLY0BKEeb59 z$_m=n2i8($N^L6vE2+Re+xEc5v<&)fX<&I;R_?Yrus$u*bXyZxod(|8b_X`Y4cfK@ zuuL~AVcQs32RCUy<(#+{C2PiMoiG+B^mt-8x0-f~U8gflW&p zfNeQo#Zp$ywl%O}DbsaZ2UxQNKHv5Pico@apng|hgbSmf;Hz)K#R|}vt61Tp5opC# zif{?r==oJv^LMr#=BppgIVC&fS2@kuwmSk>#m%_~JE&KgUf-#A=&$mzSPMP9kfJ2+S1yYC`9Y*z($Irrnsr#QDN_di=ssc+Tq!xa60ApqHFa3jQNu)cP` zQ!&!`&c`YE6VE)NQbJN(Qc_YvQYt?56{Y6Oax0^{-lMOCG|ZA}p@kHhbmbP~Z=NqN zrI`igh{;JN<2hEOW*cNOl3N&Nfn$@?EeF-I8I^V!i5wi0$}_9K^B-pq`_wIZ)&;Pn ziXFmK)yq=$b_WUjI|SrrzU>cUYqr{^G4s5H3cotMprOH)Au@cYH=d>`PHg?cp}B;4`df+2xZ6guRP%ZV z==g*AZ1J%5nc@QP^LakSVV<)9&gX+QY_TEwhM7!7_yS?@ty()av@o3MBk()sF+PlC zjDqXlDvZC_P!Si7X$OUVFi)NkP=xlyqimiTqxM^OT~&1VJ+C3?-xzHo=#MQeYhhwh z+5WLj9jcu>wWU=&;%s52f^DqD>x;DdL|&{Lsn<>G+u@rJWI1t10cn9gZHDuebmi1} z@Wg;_!nkj}o1{)--ah#^QnkujrVdl=p@6QJR#0Xl;8lSL@<5d6`lxK)p-UdJb7rl` zz9<(~3@|MFt(ZNGq?&FGYy5{bl9;tLd8k)DH}_}XWE23F4cYBaYy$W1VzTu zUT8ueLdL)# zxx-T!1lrh|o@+a8ivUyIuV=k}6#gx8~cmTNf8{w%!0HpNq=#FnI4{~~aeJn%0@a)Es< z5El?$tKW%5YeQn+(fWQS0z0DXi*|%@qMkgYC1jAo##MGBiNPZ4TZkb3<;ze%y=!ZY zc>P4OS6rwTVNZy03<2@n=OnHwxyG9zJgSF^+4h3OuxBpo*aVn@Uvvb&EY4|kwMEir zB5;GK>d-FeRuVqz!C!5#!_N~!XnA~t$7n`|e*gF;W=~O2y_DS{W`(Zpy>Ei}od$26 zTV|~^Ecy?@V>V=6^hN?VMws$S_DcF&PdAP_jW7RF%{P+a%TrurTP|lEOciJNax=XH zBfk2z0B>pi9+5uoee_-!@CF5e^T`*{NAjOBOP@HEJ#j*U{ZY!^IsH+&R!mz*K1X$d z!@9u92qH+rL@_omH>AoK!VHv%x{|rcnx%`LeH2%l@SRgc-F|C%-UC;npzcgGGrT0< z9Qb|W|3Gg3FC`5*4ePI>YYno3!OO)wtVSt4;)>!z0Oq=K(7No?g5-^QhkZjiv7SMN zD)>-xyTv@Qw;kJD|JM@bON}go?nQ9JZ~^Z%D^hL$F7Tm75<&68ydk+UghjQ9pxpn( zc;nnr-3VQHz|IxZgRTT8wlanPlq7cln&fd`_f^aZ^44O@lQ}*q1{KHdjGP15@+9;{ zsPBYtJSVom!qlgic_XOH4@Jt;euDU42yA_&r!C5l8Wn)B{1}7}lWYASOdhk+v6K$l zMBJMP@>m4T3-9K|g)}T?g}zO}H~rrPh$6^d=r;rxj4+jz+*Spj^nVkeh+uh<-Ed!+ z!^T%~+Z6oL|EGZZ^Z#Db5kw4mhM#zU3j5)!Hp-P@`ex*F8iEk0U~X?!yCREdB9LG4 zPa6_6b%Qr*2j8pAfTPBo-NE89hWLO*N-~>j4KA~{6>)vL8jiY<-9L-x$+766Qcx5> z=;9J~yt>sf5|mCI^%yDJ;ItE6Z;WurpR8HSni<5S3fHoZ(14G10KIJsRyGDTKd+CW zZ}kbADVes#)%3)Iyu7Tctr7u6@IG%@D!D=o)O>k-cx+mh&a?X1EO z3$-r)YPwa(0k&i@FS6&Z`%W*%Z4TJ3{jPOtspw?o#EZk*_)aWD%+IRB@PLE(+!S8> zt3$n^CfK-@lNWiDxdqwDv2W=iF2%uOtZThJwIP}Q3hW5M#SKs{Cb|Wh|2&#{Xgy3Cq8~KzN_Xd}7I%t;xOSOHGS}YJqTZXgnatqgBB-hT+L( z*>8ij=TbWEEn2^q``HNP#>7PJD>H-7hLXmtf~MN%_ZeaDpkiusiRKT4R1_4E<%tDS znU;K0u@Q3Lsw5=~Grq4EDxIg#S6V5=WGWVhe^9GfbYBM? z_xShS<=$O|LX{6WRf{9m#Yv5QNj~&e!6OB%+9tx`y;Y!!ZClo>% z;X4Gf^k7WdxtpYl{I_Q@%F~%2_>UB?4!Ht zJTcB^j6Kv+HVdOE4X|9M3MXifjCQHi;iyZ-rb0`zR;*2g)=Pc7Am4qsF^B?`*>>qR z;-|+sd*8WS#*%eT66nOhs(4s(%Hrx-)w`}ff6cz?@>l-cYJBIHBXj*{VI0->y1HV1 ztczF`20c{#w*paM#`}ur_ME8xp&9mdx8F6E$f<_NW!sa038_vR(hRZs-Y^yibwX0Q zUDg1qFT?B{T@%OX_1R+^-&4IzQuBv6b}DWOCj7uHO^GH3#$ObAvXUtDn>k7mQD1GJn?ptv9@rC0%oVODRu&q-z}CxrojFH|7%Ox!K!lIw}U&u4eV$-+_ZwJ6Y#S^ zji|d)pEpP`%@>^8R8}?fpwbuI$AR za!_3VG@!5Y9N%f1+p&7jY1}cC)T6K(zE_28D=&PF33x_aWEJ**OrLzEyzE$*No9WM zx?1#4ye)SSIz+7PO+_?vo}jF4NG0t+ke;Nh4bFc}arj9ByDFSYS&}=R9-H2hi&J9e9K+K(Dj<#4vx6)6VlZYZyhI zI-QEcE7|~alAaN(3UgO^E2TZb%gH?IR&`${RVGD%ikhl~#)>g5HE$`c(O;c)f-$AG zlu4ODo}a_capAF8PVQk2kj@q3X1qW#K`l2)PpYCX)j@MwL8Y?LBsV+HqU4vfklh^T zCbPgIAFLk2k-3!kS=rv&R?98Gjl#;$jip4e!@w=!U^3-pfh03P_%Lp~h<=n>MHY}F zMD2^<#O$3WB#Pfb%c>-OHm*WNd3QjYvPxa2vXdEGoidr6VhI_b_nw9FV zfuqi%tXDcqai~_$Va0v8k!nN7Tim~uI!$jtH>truU!}fNx|K3$Teeinwm~1Mj(3?_ zRB_^MFK*9Z<;4)7eED-Dw^8RTEmfxsM*~%fSdO2^Q|Pc*b418fpTPnkz?#OcVw60Q zStbI2P_10xkA;-yYLO~UX^|GLv?LW^DaUPvpgR7OW-tR~9)Y4${--h?#f_tlbt+v+ZXO$a6G(O`^kv25;mzxIC&n8?cDBYFKe+B$ zE|2YOjW#;DJXoA82-Ia675wEuCgjwOvi^)Hdc~JY5;%51J6i*N4T8>e=h7m()A7@+ z)ZE2}_*2|66X|uq9?`>=Qwh4rvV?+e{y>UDqf-rfo6^}5!^~dYYf&Srtx9gCqYCj<% z-TzdOfmFEpr@AS`_y92!)95kBB`LB_vt+3jbE73W{4FVxrg|aX-LoQ9GQR*;w59SG zBtU~BN%rUhB0ag%V2&FmK|+H85L&f@#K%G6o0uS>+LjbCQ*9hcQb#+AmPvYf(M%lK z5HCF|oT)LnDN#!Mn8`B9^D9o{*jX+_s+|_c(Hny3E7N*o6z8><*lEJxk^(h(6hv zD84emRGiqtbB-S_g~sy6dX)U7sCN)(_rqriV6 zH3K4gRgGswWKC@nMI=piXG26wb*I85OxvV~PK+ywK)FX=<$bcl7C2O;9*e<%e) zxtaga&wnTzLPj|;(gz|xyVOlQSsKTTvSXOscn=COId(bnjE6z= z=OsdPRw=169_znS8&gup)ve{}B^FC$Ct^yv6(@GoK^eFD^pUdsh7;`SJ4}a?^w-I5 zm8qO1IgE$m^uIW~F($VT)#$_HjIZ#3MxMP3KYkj#3)u7Ry%93; z0sL?IMyRhNL|ZHXdW%JtHDnq73g*#pt_X?-_nsLY7576V@^9CH6PPsvwt_D{24vmL z=sP$cT#$b|4Gh7vwVFzOb8Y$3u1{vjj9!cLK?gak3Vv`IX3zfLGL#PT4ns%@yg%}9 z8?iv>DJEM6bmh+Q6lcCuWv?M=Z=1H8Ic6abWVG!;iGQ0z5)ZDtpFDOiBK)tqw(4hu z7g2V%khj^Ud#0F)+>uAO2HD$Or%*<>2)F7dd)Aq|-H_|H1{vFKCQ$0O{I}R9jLvab zI>Hs4_mU0THR%i)KC@td%=j3t5I$HUzNcQ`TA|vm`61(D9ZQ&0xCC;zX!u~B_@f42 z1^WAEWyUbk@Vk#@%6rM;d>W5F<}vFmljZI8o}a)J*|h&j*pu9Wleb*wKNEm@nE?pc>hBH8|cM&P;=i*l~=5 zrPxX=-?61Qe}th)nUDS$j>nEBW*m&i7FL5}`~hIX6#0xq`cK(lB*mUY(oF%RIVaXZ zd+etl^*T~7G4+~Kh%saSQ!Xb{EA9Fd!UEpxEXiIa&AjsO*|e80#kpjcB#m)ey)44M z3p*5-$5sk$%^9)=Zj?ZS@yZe|X$8nErGJj2Z-yg2?d8=1_-8X?G5BS{nCep8t}e-` znuAIBX<>)q(t%?95@c}v)ZWaR=9ShQ%7-q z(m^xn7;JuW^uA?*Qp?uNI&Zbj$FjjDb}otU`LPM9BSX&`%UZSOH31t;m-x3ewV<){ zcW|=Ho1x!x7FfwY#4(Fpn010DLBT)7nJ^f#$VVP@r*sOAYt|@sN<%K8RRd`-*fbh# z+?5C$wPrD2@)ienH0LFQq>eNv0&8UYcW&j@?=<-%741gbh~`D^NaecZp3BC022~ah zf37+koa&)v50Q2_N41K2#pQpF&suCYbfhupc1jj*cIspGZ`vU5LCkJIJ8{~un_b@A zynH!~8kB2lx+rrJG?<-PyZkIHW6`Do?2eu8&pr&;XzgQsY1p7V)D^yD%*7?XB=$3| z*aoHBz9jfbpJswom?I`_kvW}6L>QYiFI(CqH~Z%O>+#o2TJ7p;65f^g(;>M<-JJhb z0>){2>-&{+M{iOzUA{Y(rF+TUNE$;PX((K@2^O2}T7Q!<@|J!vS-f*-b!zrlZ~PG| zd6mv0%6x1JG=ZF?ce#ss*(X1_dIb&#tTw&WrLDJlUnad;EG>Y(PDkI~us#c2&cC>?E=J|jeYLGiNW5TTQz@}O?PN`emQZ7UZ(F770a~q zjSJ^^PgjhbwYl=OYzHI01gG6KPxp{>||4Lmjx>~_vt4@JnMp9V`DQ* z3XV@ZG_&LSKGW;I>G@e+yzfSRu6}3nlU}|8vkL1tT;bBcs*7B*__qdVsLrf6R;i5Z z@xQqjzMV@-r-L`BR-N^hVT{XQnOVKfx3+ei;rr`ozh&-0tVv2k*5j?kqvJsK=gkE$V6A7T z6)+Ry_roNsPU>Z75Wfm+GF4{Ynum1>ZqW;@j^qwvTF|qND{hvN>tdqWsi*j%%Zg9P zIqdfuxA4cOiho{Z7t@PB$Wl3VQzyod>FB`DcU@+k>@A+vwukiZJ0uUPFW4 zUv<;7&S~4s8U5YU$(V=j(2qZQze#v3a3yP2?i$~|G8G69-dXuOgdvW>DPS{eSB6{u#eab%1>|Z67NG(88*IRqIO)lD5Ecbt zV}r(`hgKBh=|f@|)%tu(w7r zRT?G4$?u4VXJIL4$__3I;Om9f{hr)f_8hs|lZrG9S#9&!jQ8s?p7h;}7f~kG7pp$m7dsTrfg46~C!mc&-s#YdIXB-#G%r&8;TPhnP=G%>j9-=`~Fp;S1?> z^D~rG=CpsRJa1wAUHVergP2R0yHtvs3zK3F77ZuA%h7)={Y&XC!KIM=Iyja>!nm`^ ztRwK{xrS(Zf~nfjQT4p_sdL4_J$i*t5VzjksDaSy!gBp}vpBfxWYzou8Au(_ydV7s*evr2q zEOiRD+2-k*@V2l}V>GBsVeZ<*akERUN_H7(ttnrQ*Qw!K6!?)AseO9A!QZHnp3e z5IiEq044{gI#u(d%-8*Cv9OR5o~E# zDy;XmSMiuEPeJH9`QD_KQ z+^^Z4YBd@p-10R#eHs?gs`AT{K>rr4?TYt&uX6e`Cm=4j%5v4i(^2G^MTw~bzn&x~%PJIUmahvgd#BiyTPH4`RE_@-Smal-)p9#)r;XH%2%pW41dcFy zLInd8pXVMCyK^~=xm*8Euf`Ee+gRWRJ6p8sSc3`)|o+_E!v zGt`fE9yuehxW?e+Bh%!Z~bqCH}do2KK6jnjzJ@F9D> zcDWE+ZkRjy<>nr*Xj2PT#+C(u);`?#Z?I;A>!lFvQF%EPl1YB9!Ve$P;ccp zS_C@~WU~G;@l7Yb^dj)^k+G_FqNh@(Z#ZcE?Z-3lKX-hvP|(&p?ovJ6KFVF?8TJkus@*Rh=PEMS@N+OZ@fjX=egjEuK z!ho~OmH|&IhtOFePWuYj*&o0=?st>tlZu*#y%L);yH}gC>?7xD)^QIupQ(-CCl$QY z%z7(jC*H*UTsP{U9>E=OY%B=R;I!FGALoSdV~v3|yb~~KV9@kk_Q;f95aG>GYnOgL zIJmdKWWH3>^>68Twsoj_{w5?{cd9efrioYi1?BXeK~HDza@U|Hzt0(mCpR7*J!j{4 z=idXeS^S@f5b{D~i>IuhaHC*}#V|9Wt-tG;^629H?MRn_sm)Ubb7A&(7FS4W<@;5# zOG5whdBr%hXG15_w76OQHGEAO>-<~nh9)pr(HV5Ko|=9ut_Ku zbVPygRBW(Qa83P=plfxOnf)Z$Xa}ic$-4BG8QR;}jdGUKZPdT`0R!l;% zQqi3>w-|pKqNAwQw$bghB?j2i@}*T1)c>B9%7zla_QH;sU-re&;*B2f7WL|tlpCx$ z3%#{9UL!&FJ7?n|Rb;H2P(%KKjyKCqiguLW1U#{Ugi9`sm&O|}U!Y#Ydms2`5Pw_T zAVo_laW(0H_#!xh!QVW-06q z>2xR_ZchyK7z#E1jD-J-VIFS^Eb(}O(26fFoCEHI9r?P26d;1JH44^vawHhdfxfcY z%z6dGp6M;!@qq$b4f?&1pTJ_EzNj}=HKe0I4D$gL3y!sLRsHtQDWSPSMauRc5J87}5o7*P z`MHTCtpA&A#d`nOogxw0ZP~!6=fE>IAfnF(4G2gMlvyIx;ME|F_nD$3I>tIHTEftc z44BKp#Jv@BkvAkR|5N@4GTiE2D8hQ1#3)AHK2xS#to*~#jao*$wpzA{k?^2ii3Kc* zsfQG!gUSC8D)mOG#n$q%G$O2kcW?|NNtzoI6j$0C{oZgNm;mzGz%om;-eEMQeY+0X z&PR9+cY2?A*slyJ@z2S0))@qHv zN1XkzE1_{o(wXxgI0?+8i#qV-($zD*G5`K0`=K<A{S`5~H{vO$_^`Qoe)(+EBv z-4Kce4)>cvKW~3YKJ6n-JItr}FeBa&xg>^F;tK~3VD6H)+OAR{8n9!?=W0L%eC^OverNa1D_W44!2&(P?dlVOAGZe zL(AvuH-X_X>RQ=g44t(}VAiWeBet zAHbh+4`V>0f=^)Ldcvg;@Sm4pgzFzAA1vqx9}C%f>0((w{)zngS8Q50&bnHfQ-ltc z^m8P5UI>}vR!mxCYz*-)cY#Gak7PRzmvnueTI{Xv*;iA{-Mmkww@+Mb5|6l&m}0Nd zH!1<+fX58t=QUF&25Th-EUCZ zWMq!*NOtihZ^B7lP)Lzl{F~j1n+iQC1gz0oA55`fWLxpac_@{L)!-7XVHcJ#KamYU z{ficm2}8$HVyNXmkoAOoWdviL;u32zc92MTDjYgR$zF zYVu~OESi5BNWPx@h~Fc)m`5rk1?pnd-~wY+g(*GI6)+LOSigf|UR6TCNV>@g(zIhI zaC?Em-F1-pl@zM`ldnAoDg*1c8;qfH{{ok(9YH-8 zitbMY|K{(p+KKZYIrPOI4bXzm_gsWuYeq4tO`|dKdi%$M{u?Nd~Vr9KYj> zppZj|g&7|XPP|e+pqv>t^HV8Iq{f{cD_pwH$DtxNp?^^$*A5~m#KL!hY-1_BiU}(G zH;gNJ$Z_redcWL5>wF6`g=$9#K>h@?3O!nf2D^)(%ezV!V&!F)W~6J0yZ-$g$Ca@i zWs8N9*t8fn)*~bdm2Cl9TA*JRv5)}F_!p>cjHx|T-iH#QaKFl=znh#L*6@a+Z7d!b zIh*}Wd z0j|mS!|&Wd_ZtbuFaM~Qkr+XEdos5{RM-C^+&(qM>G#A|($nXpTGBvJ(QHuhg-mBq z@%g`K^&NWrdEQ3!`9db|?WBn`aAiH0)b0^qPn7c9#`2BbOBBGUsMa(N3_W-jb9*D} z2%3ve8M24N*q7Z%2f#_mRA;h zBoZErf-4eO;GtO%*uygVry~&(9~}{T9rAT_ct0K3mGEAXFU4BDW=k?(u@VQ5NehoJ zmPcGh>VOd(A->hdiXP36qZFsKu)x+=5a6 z#l06<2k}7%_5VT_mBLG+zKuPpMoLXmN;MU&o}BW2gAJPy=u^ZfVBltr6OSaxUcDG@ zyw_dLMp3?l``Zj4A6`t1oar!nHGl~cl~@L*Qmh-S5jQd9ujU{6@CI3V%n-%bzM*@Og%N)kXPRi>S0ffMK{WX8 zbie(>v3a)&OL+B3IVLD_?i#(*2zS|Ta&=kC{c8Du$)P{Rl-cKFwZy}}`vA_o-W3v& z=jNU~1kgY+mpYiYekfNIJh)m|=6OZppfc1xjmX`Kq3fkR@3R|0&&OPWSLOf69^YkY zqBOtDQblonmnDl*=9R3uo0csQ5qKVjoRGhCLm%=vF%Ev|ZsR{4 zs@lg{WJ)F7E!@}`O>>VRNaqyJcS&`FGK70{E_Q}HrG-b9#fz{dEkVy6mH7^3nynPOaf-xR#)xFiN`fl#wHonc77 zS?Al7#=D~WL9)Ym!iiQ>DEYvW?&Ob`TvvPK#}~zyUCC}oKMQsDKkZ{1yHZyTTO6@8 zK5qS7bap$u)wAKEBlSQO?zhUvZ8xlL23+1&M4Eo()!jnD>C5jN+EN&>3i*K4g^}v( za{sG!Lo7QN0+f0V66xL$VWhz^+@;L`Z`w;Ejt2})ku2~BhQ6t9aLYj*e-_HmDkSp7 zj-<|_V9)gRylD&F*YLw2wXt8Z%$nr&M(#%pLhmT zEVU&xwJE*G^Yk|ncw1W0q?Xd-%9HeV#ah8V-@uUqULpDyP{6l)hix!)%L*9rg5O2> zJZ8s0fK}j7ChzqmnN;`|OKUlbBv7`-^VGs#Ca*echrpv8;jKc<+kP&az=I}sCd_KY z8xyR8FynZwqFJeXW4*sa^Iu5Q_MbfB5t9}bG5e)ia<6nN;F0=8VJs9Cac0u&Z~Ysk zUK|kTU$xA)X~s|H-Nw(F_VDHfdU>W!p7FNXiq0)OhGJ_I=2191MWlJBPR@MVK9UAR zVXR~+rdWb_Z=O`o_Flonu2r!fjx>u@_#$eeMI_csfw6v>YO8vXm?yNxU8xIi_M#`< zu60GM2ImyZldcNS^dP9KUPOX{m*21)1vJm1#qUwi7H8IHLrZxfQNvvVE6ZPN#Dde=*{r^2n<}(sOVD>j`I@$Vwy(=r}~RR zXZdE+JOoOQRl7j#8bw~Cnq$L0It!2DHy?+H>;4MSm9l{xwXQp4afM>`1|zAraRy)S z2VHH9UWGe+X6JxAxDj6O_RZ^>T+i3>OZ6sQv_t5;zs%y}&ZpnHb-o-ggtqQr+ag^G zr|@R@kFupEKj7(M4fU=%8<;m#C1#2)9J&w zKbpqD=oUe((4jlTDf98Bd}@T!H?t9fE^LQVGyEO)&`c72k<{fe8I|6LCorh@WpLlOv{DS#>CDzEg zcPF28VO{);sSd=9POBIvs>*ru8(?(Q85e1TzToxxavq4+gI4t5$Ku7>SqCJ^)j5^* zZkoq7S%{OhQ7y(aT6rdv4sMyPlniE^H>fE}JE41~$55m0)Qe_`n3t-FJjs{m-Gz<& z9f&@#Lf8+#|3$_XAn%=vmQ2M^PE`v+$JfL(@Hccm6F;LkLoSD`ERhXl2U0I>SM-T( zhd!&HO_uwsno-++ms_QasXNPA&WVvM~J zC^5l4@IRDdp9@ONumjLr*FF*Q3`I<{nQ?Z$P<6f(JJ=1MKhxes zoym3Y7%;b8?>t`kZWG+9lm7MjvXT=k36`D|Mh-NoBgn0lE(??u2|0j0@l@R&0ZXER zh)MFc_I$&iwLm}uAL4H4o#Jco+STmu?UQHBV}LPtr*T}ZPSH8Ehwv9mEV4$V{5vu8 zGbnb?{@#~AlmOKHW3zp`9-iWjUgU$OYnZ3GCny2Z#1^s@BhtLyO$(-h4Snx`fSM!6 zz=IZ%TYXaBnuP8ZnVc;z;xTKFuFqa+-Vs&Pu?BQ%;8Sd|S( zB97nDveEl#;Odc}9mPXzslPO1lIbIvl73%{Bm@&|pv&1sjljq-xbVE|d+#DluH~+G=7C~>S!Mab>WB(1%{}kH27J125inOVUDp6UF z+*Oa{Vutp^Oa}krW-y*(ZSU8!%jkdckn!hXGARgqp>7ao*aG?9FavPB;BM#_D0gBbrXWWmxpWxA8AfJN&G|{a2@GFQH%rp`Hg=w z>#8A8PMC(_Ce#!E7j_PP#_=kwGWJ@sH6JUq$XggL6of$3Brli=f%6Zmz<_kXsskx;E7`G_u!+P(T%L4=N(sR8wYBjlZNDbxyV5oM^y39ELeui*dUM2lOqt>-g=+&+45% zRT`}!vw{X=dOn!3-aOgEIpS5~Y&hz|69&|qVLPs&5rT#yezeXPI&Q11u`5#iavDrz zueV_e+_fNWLnnxRtPE31tGB~-tVHM0Q!6s|*2c$T*It{dtj}sev36>rlwrNN9bh3A)*h^t zU(+JLXe^Xr{j>=`#85A&RbMTx+xinka6_ew41hVO*fibY$!tS8a!M&zZ>syw*9#d) z)J{EZDNZrGNidq7usBBb=G9SO zN-T&_1%8&}B|i<4^~?WBxvqMS9iwB>f(X-5HC=u#h`*aMB`f2}Jvudbf*tACQebSS zOO0WImFytyrX*WS@6}RJ&A@fI)0ei|>Wx^(_;x@gTSFtz#j$3L_`CYEBWKfhDw@z2 zOW}}|QGs*l>MZOY^&2t0b+yH0tJAKX*!zDC@9oNKt}!vbdQA$1SlrF52|8g^H$xke zp?bi{xp~(_sMSGIq_m4+oP1=7&q_O?c3*_v{|?127UDzpg$bPu^#eLA+zl8yAh=(O zEAASt*&nE%17io4XUJz!rW%ryaAfuc^l;yQFW2nR5Z%NA=xK3g6uK`)AhO| zgVix!EGNc33}F_r+mbVyfFa0Wl4MGoBxoSy}u zU}M)8ez#?xkH>jC`74e06;GHY9HQ;BRr7sfyf^BLs~6vW+Wf#MZze@w%@<3OF&Om` zPYs&#p141bZJ+Jgz+NUJ=)Mh3`*D6Z?!*P@+2H$odVU`@#8jjYr!QeE`COVhm^yS6 z!!QtllnTr06DdNPcUih45%}e>pzdXERp{Q6^!aCG@0Enf-P~$meFY4UR)6WoJ2sM| zC}SkqK+QS?Ds%1-4wI)J|b;bvIrMx20<3=D>v+O zJ0AykH_n5qvAd^1A9t+Bw>@{1XOz8;Xa(<5a-YU$UM+2&ck1%0ryyekMQSNcpl((_ z%~%rbB8gw1jk{jgR=gRUp*nN_OJ5WBOoj-oz�*_BmXVd#S5mW8HYZxRlrC2S%~o zF-hL+ZY*BYP@DryY}s$w^Y~MW9>O7jm$`B2;+67M1Gdh%Mg;LXXJJgcFoifnHAG!(DTrBA4L#PNlP-c;k<3rd*|{&>HrPDKAZPvCWvJIU>UfT`#V=iZcJ6FlPna_s z3iBHvu;mB^=3{H6|3z9l`HUY7j|B`RZ%R^j1;>$ZGWg5n}J-9 zKe)@#;EQ&-cbSq$kxmMyA9t+r^jB^5u=bT>17&PB1(*l$gh8;mka2_#yRqXOzh z?x|jfZWlWQPV1@TE#pSGFB>rSy}6eTs7x{`5}=>C`dppq7*~=(xD;*3dR47JNa{a- zC2-B!8`2kT$j3ip{^fIyesebtbDh+r!~CuOZHMZly|cfOb^Mv7p)3_^mC-3F#egLl!A^HTjv_vOQH8XG)ay1Ah}{3W)w3QhlaM6wN3pCCuUG9&UB5GyTkmJK35x# zmj{Ioa#B_J*s}P6J^5`jy03ne5c86kR%=gsaCI9-M@ zMyRG4u;wW`WUCqc5&ypA{T+iB%4}U&Q&*ptf%e-A+K31zy*l9r8RTFNOB3r|7w2@K zKJUbYBJ;WR%ez~X5OQH2Y?95F4ZWtzvBouH&P_k3*7RJ@yml*LO@D`ceFFmn1ho-+ z)C~8L!+F5urtmeA-zDD4p2y6aI5GEG8LWP8+piW${_9148+gSz=;2UhfyN<@!?E13 z;S(W0qSa#eBaT(kimQ8`=N4S@l_yV*cEphDao^H$-`a8C)^Xq7ao>?~-Y%R2}MHS10mSMYEExJxEmnS4G`@Hh;akNxg8bc+7#y;7b^qxDnNjg##NKtg*&z5 zwI($aQCv@iS*dkKKT9nYg)J?=6~JGIX<*Y+_3q!t^J;RTT${HUo{U*;5y2cUpG()x zy|$sRk;lQ;hAP7ISSHU`TXK1g_TyCQGY7s^xO zyoW6*W8(@3y&r$&>M>@ZDSFF^FW0e^O4xW>6cR1Ui{U>!mNjhfrPX`M64FXW#O+m7 z@o2Uj?NAHmG`{L-dkk4=s+VvQbb?Gg%^i=J?3-ME6@++t?mme$!QjmA< z+>gxqqjWSGzbZ7bJXdn+CuQRz0T!#wHfQ)z_-I#00V5l08v3HXJJCmrg?A=HB0z>F zm8QWdV{X$KjG^}od05p4YM~-++!~iPkR{pG zK!J)`Ct=k|BKO@{CuUg#!C-5LFZwlLzN?MMR`>bUAo7P#R2SzSrg} zls3`GzRBQD1H=v=dU^K{5&`#hzX#f?F(0BW1< z+$;qf&_dRLhc$a{mZA;MV%EHeHFs{7Ql!|-r!vmT(0s2gwCggr3jU1baNm=abICzB_#m537Wi$7=~MRdF_tF>z{fKLoA0E8R`J`ghMg z&rRZ@qFZ|pz8;SU#aveZD%pJzU=i*yq2@2a^SZ_LV?B0%Z3%G)1vcAk3A~i&!+Xk1SHpjl6|aU5l^u8d zYN|LL&Zo8nn%ZVQ)pEw1PaOy}b8D3{DWf=}u^*{Jb= zeX({6Xmw^2bgRiN2l8Ut=Beb49m_SRR7CSD@djqhT}k-|O%bUV8c$B{yb|rYoVDTp z%%_yKR0!N!Z$2KWzMLKvVD1;F85DSfI&Vffzb9C+<6p7l-{>W(F^-pJm2t=*?4o3h z`#Hv75q#iP#Bz%u@2+Z6?9376OB5&F99a*M>1SE@d>8kA$5V`(W5+LJCrR(jl!k~p}DiZugCat z=yQkr@oY}Pquo92pD@ISoW&E>ePMA=nq*C!G(1p`G(5Y3-%h&09^11!xFI~ap|iLr zvA74!=O^Q>FOTev&EjRJNr#=QCvoRY-;Ev1#HwLiG$((361F+8Fw~~V<2YyIOplv~w?RNra3x!AGnv9L=#FJP>h45r=Uv!JH8+(+ zw9Z5MjZa!sc?60z4vqltFW(5+7#-%%d zd#v)By9$d0Pf!%^Sk%KlnBFjOvV67Sp)*shty&z!u44!IEnm~qYIy0`n#=f;QfFHl zfXmNL_uPX-!ixtUwSA4_V;KgcoIH#U8_AeOkWbkkZE#inG}Ge5j0x46wx(F1pNlPI zcH9RC#V)a3On-=vH{l(<1ADM#&mMn|oQsTHzZzY7_U3wrCcGN9d&@PM;@sct?p1 zPW+4J_Uo^qQ}`zGfMVsGXKV_G3S;4k$^{4)8G z(Mcbl-(GkQpQSB^bg3@ag@~4i)Og)5XWcKC4Z9-GL1g0@e8{Y;S9=?i9bRZQ&A7<- z{vKZ(k`NhFZR1r>bqnSBj>INgq?-da_2Fjrw~3VV;lL5+rar*-?#m08pJU?Rqc!2cL$bM5c|}K)3J0w{n=m`YVmNz|W({x8VKE z-9R?HZ>#Z~D>E4F)(!^3&SkE>KZOl6WhB5Psp7_e$;cbwQT#&PH_T^ZyUF{W?@rsT z?ieOA;xCOPJirT5!hi zXO+8oO-+q?4fybf&d;|!&-3=mllD7!KavolJkDEpnn?bXp^@FOMKo1j^wj`Gk-*f8 zQPTjWxg;+bSs3Al+n#b6Hu0t>M;5XN9?z?7fj;GyH_4b|QDf!(14;ojeEd7dueWlP zJhZKL#H%^GH2(8h3g2^ksMK(O2sfIi^6@t*C+oCS*UJhY`uz2oPqPlL5xAE8YJ9Kn zKKp~)(Fv(+k}#7Q;W&pmH%eIC<61Az@7izHuddt$zIZI|%eW>$3MosVa% zRl>r@zPyQ!yvj>6Em z`*v{`vGcMifb_ZJndP4Kg7^;-?F;kdiHj!am7}Lm@F#QgE8wUN3|M6VT-0pPHpw=q zqz4GgkG5!%A=GNuSCAU|3akiO7W{6kYEXQTJYinDJU5w3F@AsVdobM0cbDr~j zp65BA|KRgHpGUr+N)#<(+J*9)Uc4&YH18pG{z2yU*#K(nSSDF^80w>kr$qJz#thb^ zUmg>mQTnUwJ__+-K@CinC}3qYN<+d(D)US|ejU|z#SD4IO=#JWsqmoC6=68cO@ZSc z{PoNO@iMMIq(fi2T17jaU%J#{20P-TGLV1>#~GQmj_8WdHzq4qNtBpLsOm1I5W{wo z28limpLkLM?3k(Rc&#|g3mAVlD&xV{w$ex^lo8YRIDq8lr2D=UVk1dLAixJpEPaAld(`{3SLHCLpXp@LRvvQEU{qCiSou z$ZZX~K{xrdpp{PEk}fk^SDD}9pz&WYnQV#1Xf2P# zdLjeX^pXA$QK-HUVx}asS+uV-x+;T`rMe@IfDXHG%hKyAM5`R4oIK6y$Pr&4cEG4o z47*HTRnbRgLB;alBa<(QOCQ zGS*7rzo!;HiUs%}WDKz*n<_Q_1e+rWY>@947WQBwt~OUaUNjk89vd+Vz^#Q|0VP}JQhQ6z$@Jnt(K5Zn6nSs1 zoBdP$iJ>o8Xv>FTM!)iX0PpmM^L5p#AJ-PCo%;j>v}wK;qP1twD#phaInsm)m3Akx z4wv`{jyTKwpuEBp;NFfg3;_O}S-xQ@%Mm6Gkk2iHt%m5IoV&!YjPcn znuw(Yu6bXKGqKR~xby~Ka_}4=<9Z9aU>zD2srwYjkDKka8a_7Z!jny!P~K_*g!CPl zw+mo{01*8h#6a@-JbB8GJmo{4@*q!vmn6k2sD3OZ)@{pRrjA_dyK| z>H^xYfFD)d3u`V}96Eh8#Ba;ufhTnq+n4ivg9?1nz2>j8x4F*dbAG#PlFURLJpF^- z{_+R?(D01XLORC|hRfYo8~&?yD-1UD?gB?I&0g!xvxS?!_i1Fr-lo`{jM)2Yqjp~K zKjYiusqFN9(g{yo)p=elJKaz^@qTaE(Ai@<1~mKsy07*4fiCQit6Rv?Fm%`Qfk*Y; zx2*MSPCpM7wm)|^Yuo+hh6g&;TO9Z@7>Lw9w15Gz#J^`2D#72JQJX1Dw={p+=CmxM z%8eE9ljxjc-u;C4tK83k)_hC$BTM#PpGUz2{XC!({S0J12!hv9CtLeRWViBiUItGK zTc@FahcN!zvrwiMzgLSNML$DP1!3VjnW@$Z7k@VHo2{WZD|c!%o6p3!xfqQi((WhN zx%gXZ4ARd&AKaQzsnG^(EOBL;qle26(ssjRn(+lH(pS@>db9jbIqOHe@K2^_{oi=8 z3b9?ve$|i$;38mooaM_HfO4Ye_)W>Fif$to!+~5Qhl^i;G-O$qewl@AsMW`tKDZ}s zyF=GaI_^KyS0s0JsAin2Y>fy-;_O^dFYHgFPEn<0a3qlv0?L<{JsVW!0#2(|2RA51TpLd!@+x%(@l4Q$3N5O)*o&WY>y2cb>J-ssPb6 zZ#jJZ7x&K{5o1SDH^`q`g#V|hTqwbQ+G?6czZd>3de1*4t|)C2%_x4CcA;)YP`Lm) zwF{oqs4D{N**N}BjD4{jHOdxWDt~OpvDsIX<K=`j zfwmsQ>LTN;TmgII!Hew$*EnrQ&lMiq-llcd z#e^e4Aj7~OW5gTDE6FP>@T6_p>vdc86$Qs2rcu&>9#-st$c?lJo`JD<2tdTWo9q*{ zX{0+>5yZVni`Ue+qNgwT0}y){hm^>wSI0#}MO2=eH=j4>-_EER^#vDa4Y>33oV4d@ z$cJ~AqL&O(D9X;#Yv(SQmZTRKaJ=UAQ*savRU{TCI^~s9z>E);Eqw1Z$SykF7^x`>~_g(Y6undu+eqm5!M{uxGn7 zxxrCA3hoAXA4=6p#c>s;Tr+N2kLkuKOG+*`tUrus$Z4o(3o>*G7laE4>0uzUl}<%G rDW3EPH?=dhQ$bq?JY>3l+;Ah(*z_YYvyrwxke=hq_<{ZC^9BC_3sa*k diff --git a/doc/Heuristica-LICENSE.txt b/doc/Heuristica-LICENSE.txt deleted file mode 100644 index dd85e40e..00000000 --- a/doc/Heuristica-LICENSE.txt +++ /dev/null @@ -1,101 +0,0 @@ -Copyright 1989, 1991 Adobe Systems Incorporated. All rights reserved. -Utopia is either a registered trademark or trademark of Adobe Systems -Incorporated in the United States and/or other countries. Used under -license. - -Copyright 2006 Han The Thanh, Vntopia font family, http://vntex.sf.net - -Copyright (c) 2008-2012, Andrey V. Panov (panov@canopus.iacp.dvo.ru), -with Reserved Font Name Heuristica. - -This Font Software is licensed under the SIL Open Font License, Version 1.1. -This license is copied below, and is also available with a FAQ at: -http://scripts.sil.org/OFL - - ------------------------------------------------------------ -SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007 ------------------------------------------------------------ - -PREAMBLE -The goals of the Open Font License (OFL) are to stimulate worldwide -development of collaborative font projects, to support the font creation -efforts of academic and linguistic communities, and to provide a free and -open framework in which fonts may be shared and improved in partnership -with others. - -The OFL allows the licensed fonts to be used, studied, modified and -redistributed freely as long as they are not sold by themselves. The -fonts, including any derivative works, can be bundled, embedded, -redistributed and/or sold with any software provided that any reserved -names are not used by derivative works. The fonts and derivatives, -however, cannot be released under any other type of license. The -requirement for fonts to remain under this license does not apply -to any document created using the fonts or their derivatives. - -DEFINITIONS -"Font Software" refers to the set of files released by the Copyright -Holder(s) under this license and clearly marked as such. This may -include source files, build scripts and documentation. - -"Reserved Font Name" refers to any names specified as such after the -copyright statement(s). - -"Original Version" refers to the collection of Font Software components as -distributed by the Copyright Holder(s). - -"Modified Version" refers to any derivative made by adding to, deleting, -or substituting -- in part or in whole -- any of the components of the -Original Version, by changing formats or by porting the Font Software to a -new environment. - -"Author" refers to any designer, engineer, programmer, technical -writer or other person who contributed to the Font Software. - -PERMISSION & CONDITIONS -Permission is hereby granted, free of charge, to any person obtaining -a copy of the Font Software, to use, study, copy, merge, embed, modify, -redistribute, and sell modified and unmodified copies of the Font -Software, subject to the following conditions: - -1) Neither the Font Software nor any of its individual components, -in Original or Modified Versions, may be sold by itself. - -2) Original or Modified Versions of the Font Software may be bundled, -redistributed and/or sold with any software, provided that each copy -contains the above copyright notice and this license. These can be -included either as stand-alone text files, human-readable headers or -in the appropriate machine-readable metadata fields within text or -binary files as long as those fields can be easily viewed by the user. - -3) No Modified Version of the Font Software may use the Reserved Font -Name(s) unless explicit written permission is granted by the corresponding -Copyright Holder. This restriction only applies to the primary font name as -presented to the users. - -4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font -Software shall not be used to promote, endorse or advertise any -Modified Version, except to acknowledge the contribution(s) of the -Copyright Holder(s) and the Author(s) or with their explicit written -permission. - -5) The Font Software, modified or unmodified, in part or in whole, -must be distributed entirely under this license, and must not be -distributed under any other license. The requirement for fonts to -remain under this license does not apply to any document created -using the Font Software. - -TERMINATION -This license becomes null and void if any of the above conditions are -not met. - -DISCLAIMER -THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT -OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE -COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, -INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL -DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING -FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM -OTHER DEALINGS IN THE FONT SOFTWARE. diff --git a/doc/LICENSE-APACHE.txt b/doc/LICENSE-APACHE.txt deleted file mode 100644 index 16fe87b0..00000000 --- a/doc/LICENSE-APACHE.txt +++ /dev/null @@ -1,201 +0,0 @@ - Apache License - Version 2.0, January 2004 - http://www.apache.org/licenses/ - -TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION - -1. Definitions. - - "License" shall mean the terms and conditions for use, reproduction, - and distribution as defined by Sections 1 through 9 of this document. - - "Licensor" shall mean the copyright owner or entity authorized by - the copyright owner that is granting the License. - - "Legal Entity" shall mean the union of the acting entity and all - other entities that control, are controlled by, or are under common - control with that entity. For the purposes of this definition, - "control" means (i) the power, direct or indirect, to cause the - direction or management of such entity, whether by contract or - otherwise, or (ii) ownership of fifty percent (50%) or more of the - outstanding shares, or (iii) beneficial ownership of such entity. - - "You" (or "Your") shall mean an individual or Legal Entity - exercising permissions granted by this License. - - "Source" form shall mean the preferred form for making modifications, - including but not limited to software source code, documentation - source, and configuration files. - - "Object" form shall mean any form resulting from mechanical - transformation or translation of a Source form, including but - not limited to compiled object code, generated documentation, - and conversions to other media types. - - "Work" shall mean the work of authorship, whether in Source or - Object form, made available under the License, as indicated by a - copyright notice that is included in or attached to the work - (an example is provided in the Appendix below). - - "Derivative Works" shall mean any work, whether in Source or Object - form, that is based on (or derived from) the Work and for which the - editorial revisions, annotations, elaborations, or other modifications - represent, as a whole, an original work of authorship. For the purposes - of this License, Derivative Works shall not include works that remain - separable from, or merely link (or bind by name) to the interfaces of, - the Work and Derivative Works thereof. - - "Contribution" shall mean any work of authorship, including - the original version of the Work and any modifications or additions - to that Work or Derivative Works thereof, that is intentionally - submitted to Licensor for inclusion in the Work by the copyright owner - or by an individual or Legal Entity authorized to submit on behalf of - the copyright owner. For the purposes of this definition, "submitted" - means any form of electronic, verbal, or written communication sent - to the Licensor or its representatives, including but not limited to - communication on electronic mailing lists, source code control systems, - and issue tracking systems that are managed by, or on behalf of, the - Licensor for the purpose of discussing and improving the Work, but - excluding communication that is conspicuously marked or otherwise - designated in writing by the copyright owner as "Not a Contribution." - - "Contributor" shall mean Licensor and any individual or Legal Entity - on behalf of whom a Contribution has been received by Licensor and - subsequently incorporated within the Work. - -2. Grant of Copyright License. Subject to the terms and conditions of - this License, each Contributor hereby grants to You a perpetual, - worldwide, non-exclusive, no-charge, royalty-free, irrevocable - copyright license to reproduce, prepare Derivative Works of, - publicly display, publicly perform, sublicense, and distribute the - Work and such Derivative Works in Source or Object form. - -3. Grant of Patent License. Subject to the terms and conditions of - this License, each Contributor hereby grants to You a perpetual, - worldwide, non-exclusive, no-charge, royalty-free, irrevocable - (except as stated in this section) patent license to make, have made, - use, offer to sell, sell, import, and otherwise transfer the Work, - where such license applies only to those patent claims licensable - by such Contributor that are necessarily infringed by their - Contribution(s) alone or by combination of their Contribution(s) - with the Work to which such Contribution(s) was submitted. If You - institute patent litigation against any entity (including a - cross-claim or counterclaim in a lawsuit) alleging that the Work - or a Contribution incorporated within the Work constitutes direct - or contributory patent infringement, then any patent licenses - granted to You under this License for that Work shall terminate - as of the date such litigation is filed. - -4. Redistribution. You may reproduce and distribute copies of the - Work or Derivative Works thereof in any medium, with or without - modifications, and in Source or Object form, provided that You - meet the following conditions: - - (a) You must give any other recipients of the Work or - Derivative Works a copy of this License; and - - (b) You must cause any modified files to carry prominent notices - stating that You changed the files; and - - (c) You must retain, in the Source form of any Derivative Works - that You distribute, all copyright, patent, trademark, and - attribution notices from the Source form of the Work, - excluding those notices that do not pertain to any part of - the Derivative Works; and - - (d) If the Work includes a "NOTICE" text file as part of its - distribution, then any Derivative Works that You distribute must - include a readable copy of the attribution notices contained - within such NOTICE file, excluding those notices that do not - pertain to any part of the Derivative Works, in at least one - of the following places: within a NOTICE text file distributed - as part of the Derivative Works; within the Source form or - documentation, if provided along with the Derivative Works; or, - within a display generated by the Derivative Works, if and - wherever such third-party notices normally appear. The contents - of the NOTICE file are for informational purposes only and - do not modify the License. You may add Your own attribution - notices within Derivative Works that You distribute, alongside - or as an addendum to the NOTICE text from the Work, provided - that such additional attribution notices cannot be construed - as modifying the License. - - You may add Your own copyright statement to Your modifications and - may provide additional or different license terms and conditions - for use, reproduction, or distribution of Your modifications, or - for any such Derivative Works as a whole, provided Your use, - reproduction, and distribution of the Work otherwise complies with - the conditions stated in this License. - -5. Submission of Contributions. Unless You explicitly state otherwise, - any Contribution intentionally submitted for inclusion in the Work - by You to the Licensor shall be under the terms and conditions of - this License, without any additional terms or conditions. - Notwithstanding the above, nothing herein shall supersede or modify - the terms of any separate license agreement you may have executed - with Licensor regarding such Contributions. - -6. Trademarks. This License does not grant permission to use the trade - names, trademarks, service marks, or product names of the Licensor, - except as required for reasonable and customary use in describing the - origin of the Work and reproducing the content of the NOTICE file. - -7. Disclaimer of Warranty. Unless required by applicable law or - agreed to in writing, Licensor provides the Work (and each - Contributor provides its Contributions) on an "AS IS" BASIS, - WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or - implied, including, without limitation, any warranties or conditions - of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A - PARTICULAR PURPOSE. You are solely responsible for determining the - appropriateness of using or redistributing the Work and assume any - risks associated with Your exercise of permissions under this License. - -8. Limitation of Liability. In no event and under no legal theory, - whether in tort (including negligence), contract, or otherwise, - unless required by applicable law (such as deliberate and grossly - negligent acts) or agreed to in writing, shall any Contributor be - liable to You for damages, including any direct, indirect, special, - incidental, or consequential damages of any character arising as a - result of this License or out of the use or inability to use the - Work (including but not limited to damages for loss of goodwill, - work stoppage, computer failure or malfunction, or any and all - other commercial damages or losses), even if such Contributor - has been advised of the possibility of such damages. - -9. Accepting Warranty or Additional Liability. While redistributing - the Work or Derivative Works thereof, You may choose to offer, - and charge a fee for, acceptance of support, warranty, indemnity, - or other liability obligations and/or rights consistent with this - License. However, in accepting such obligations, You may act only - on Your own behalf and on Your sole responsibility, not on behalf - of any other Contributor, and only if You agree to indemnify, - defend, and hold each Contributor harmless for any liability - incurred by, or claims asserted against, such Contributor by reason - of your accepting any such warranty or additional liability. - -END OF TERMS AND CONDITIONS - -APPENDIX: How to apply the Apache License to your work. - - To apply the Apache License to your work, attach the following - boilerplate notice, with the fields enclosed by brackets "[]" - replaced with your own identifying information. (Don't include - the brackets!) The text should be enclosed in the appropriate - comment syntax for the file format. We also recommend that a - file or class name and description of purpose be included on the - same "printed page" as the copyright notice for easier - identification within third-party archives. - -Copyright [yyyy] [name of copyright owner] - -Licensed under the Apache License, Version 2.0 (the "License"); -you may not use this file except in compliance with the License. -You may obtain a copy of the License at - - http://www.apache.org/licenses/LICENSE-2.0 - -Unless required by applicable law or agreed to in writing, software -distributed under the License is distributed on an "AS IS" BASIS, -WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -See the License for the specific language governing permissions and -limitations under the License. diff --git a/doc/LICENSE-MIT.txt b/doc/LICENSE-MIT.txt deleted file mode 100644 index 31aa7938..00000000 --- a/doc/LICENSE-MIT.txt +++ /dev/null @@ -1,23 +0,0 @@ -Permission is hereby granted, free of charge, to any -person obtaining a copy of this software and associated -documentation files (the "Software"), to deal in the -Software without restriction, including without -limitation the rights to use, copy, modify, merge, -publish, distribute, sublicense, and/or sell copies of -the Software, and to permit persons to whom the Software -is furnished to do so, subject to the following -conditions: - -The above copyright notice and this permission notice -shall be included in all copies or substantial portions -of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF -ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED -TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A -PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT -SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY -CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR -IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER -DEALINGS IN THE SOFTWARE. diff --git a/doc/SourceCodePro-LICENSE.txt b/doc/SourceCodePro-LICENSE.txt deleted file mode 100644 index 07542572..00000000 --- a/doc/SourceCodePro-LICENSE.txt +++ /dev/null @@ -1,93 +0,0 @@ -Copyright 2010, 2012 Adobe Systems Incorporated (http://www.adobe.com/), with Reserved Font Name 'Source'. All Rights Reserved. Source is a trademark of Adobe Systems Incorporated in the United States and/or other countries. - -This Font Software is licensed under the SIL Open Font License, Version 1.1. - -This license is copied below, and is also available with a FAQ at: http://scripts.sil.org/OFL - - ------------------------------------------------------------ -SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007 ------------------------------------------------------------ - -PREAMBLE -The goals of the Open Font License (OFL) are to stimulate worldwide -development of collaborative font projects, to support the font creation -efforts of academic and linguistic communities, and to provide a free and -open framework in which fonts may be shared and improved in partnership -with others. - -The OFL allows the licensed fonts to be used, studied, modified and -redistributed freely as long as they are not sold by themselves. The -fonts, including any derivative works, can be bundled, embedded, -redistributed and/or sold with any software provided that any reserved -names are not used by derivative works. The fonts and derivatives, -however, cannot be released under any other type of license. The -requirement for fonts to remain under this license does not apply -to any document created using the fonts or their derivatives. - -DEFINITIONS -"Font Software" refers to the set of files released by the Copyright -Holder(s) under this license and clearly marked as such. This may -include source files, build scripts and documentation. - -"Reserved Font Name" refers to any names specified as such after the -copyright statement(s). - -"Original Version" refers to the collection of Font Software components as -distributed by the Copyright Holder(s). - -"Modified Version" refers to any derivative made by adding to, deleting, -or substituting -- in part or in whole -- any of the components of the -Original Version, by changing formats or by porting the Font Software to a -new environment. - -"Author" refers to any designer, engineer, programmer, technical -writer or other person who contributed to the Font Software. - -PERMISSION & CONDITIONS -Permission is hereby granted, free of charge, to any person obtaining -a copy of the Font Software, to use, study, copy, merge, embed, modify, -redistribute, and sell modified and unmodified copies of the Font -Software, subject to the following conditions: - -1) Neither the Font Software nor any of its individual components, -in Original or Modified Versions, may be sold by itself. - -2) Original or Modified Versions of the Font Software may be bundled, -redistributed and/or sold with any software, provided that each copy -contains the above copyright notice and this license. These can be -included either as stand-alone text files, human-readable headers or -in the appropriate machine-readable metadata fields within text or -binary files as long as those fields can be easily viewed by the user. - -3) No Modified Version of the Font Software may use the Reserved Font -Name(s) unless explicit written permission is granted by the corresponding -Copyright Holder. This restriction only applies to the primary font name as -presented to the users. - -4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font -Software shall not be used to promote, endorse or advertise any -Modified Version, except to acknowledge the contribution(s) of the -Copyright Holder(s) and the Author(s) or with their explicit written -permission. - -5) The Font Software, modified or unmodified, in part or in whole, -must be distributed entirely under this license, and must not be -distributed under any other license. The requirement for fonts to -remain under this license does not apply to any document created -using the Font Software. - -TERMINATION -This license becomes null and void if any of the above conditions are -not met. - -DISCLAIMER -THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT -OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE -COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, -INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL -DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING -FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM -OTHER DEALINGS IN THE FONT SOFTWARE. diff --git a/doc/SourceCodePro-Regular.woff b/doc/SourceCodePro-Regular.woff deleted file mode 100644 index 5576670903aea90041f214624c8dd1176fdf6081..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 55472 zcmagEV|1iV)GpjfCYac^ZCev#Voq$^NyoO$iEZ1M*tTuwpWqrlAC$?dy; zz5oCi1pt76I@hG`Y-MZstp_jh-9MFYMCzax9$V|XeYXqx^9D*(XTHKKcVXJ_l^1OSvyeAi|0t)?9)@uSqv!T8%2Zu{F#=s%FxlhnAa8tNJ8 z>FF7TAzv`_<4@V%CHW=1fd3BMsW|rcV5B1-x&Aur1}zfNvzLP)kEH}Cxx@N@8~-1> zuA3`9FfgTouZ*u^COiW`I3d_!0ie|r3jbRN0P;PWL4Ya%5nv5~_%HXJpuch2ta1 zF|Z2ax9GD}1W;$#cgrhF#hHy(PATafw!--FG|9jC41s=pV(;>*aG3)s%;2g%P(HW3CgqNOtz+s1nJma zg62H|J?9$YrUT{2U-@-|O>oe*+W*MJ9!oRUP91X{{pV-m-_fvq3BxW&Ho1&}7i9IZ zN1o@3R@!llx3)4z=!uYD1+4rxV@5e;%Qg$yu<9d^)&6Mfz`l)U)%GhoUQ`8dOa9+{ zxWPo65L0;>Z_O#gI)|P6J{>AvAyNaH@;fY(H4IbRh#eu;cCknmd!n=fBn@$n_S_dk z=`Z1&3XxwB%S2sdWq24b9XNJ>u0<%;16?qE)vm$#qlI^&C~*bY{nXq6%?y0twb|{O5jIVm8}UHD%W8lAP(AYGWY^;SI<$|e zFs0pV$Qa7196nuGPzdF?Yb=+s=e($7)16w&7RGmT(9;ilJt;sjXwlM%98$9W9Z^xq-A9TybUWK4#-ti&h3|-o|R7(Ut34I zrdJ=CK!GjD9$yAUOwmOJDbxFZAI}m;FW1w}5G!Y&A^qF(9aMux4HMgvpTwwfpmnjO zUIXRvA;p-(bG-fayu)`LJrNxPtVQDv8ss$3^{7Jh`@saagw;BH0?<7K;7GoLKk^X$ zk^K88{qree1KTiLCuK0pMU9mAvEE13gve*DJb$?P(xv^g_pmeoj>=Ka`i7L#h>|-f) zDovvvE2P$iojPlWZymj7b#m0b zq-o@F9m8+$;aY`+Ebbw$#^k4jpp7>m+y_yiX1}tg)qjt8o&&|vp%E?3R zszVp@TWnj2lKFT$^Gf+eg*IthtTLG*sRsTxmld+N{aoB+f`>A-DDB{GB(p%wJTZ-e z4u#PY3tam^o^)iR0ERh`SD7e=s6qH4)C=PJ!CyBb$DEv;*s)Ojj57JW=Z>r>|(+A{Sg zr6!vu=_lRk?O$3!|MXT7SH;uMsmv@4Ec{zo>m0+|+dSAjo zlpk#J_Uz2PtfwAp^^3oZmKdO1xw3=6*b&0M+$OTD;d(o$3EN@M)@!@G+2v=iOq315 zSf04AU7_+k@bx08eVuZH!}J*=S6@kF>dUS-udv!wVZX?!zu};(uh8hNFlT4wNeh^u zWLeETGejw{@~_-gr5eAjEj3wCWhc<=ue?!BWTOfB=V4jjD6;bYA#b(HNs{U4u#Bq6 zPL^GNau8g%a6{Td0{;7Ja{Gj>^W zwFDEgK{2;wW8Peov9jah-Jbks)MXW(r)Tr@jaxA7$g}H_;w}B6mf`HU!<(IjuaYqq z{qN5iR4Kkh4@T!FV6w85ffS`3+x^PACu^bO80eK>q8RsP{>uKwcIU3_ExFsCv&#_9 z5#P?A9rxYVqtR=*2f4?^yT#i!UL4*tJ|DW#P10^sNnrzs z*cKKhVtsL8-EO*-Xk!Igwtr{oVpc^tITp#5?B>xDa3{o$byw1l#~F3HuEHIppN$R& zo?O{1;YplaPgjk*?)ftQdILD4451&2 zE;^hjPr6dQODiuCwrZcc&U^A~yT7&s9GiEP9Zk|)6WiFjf0Wn<{G}rp;pSI`(N$y^ z4y7tw7{pnaNIS(3X*d!|D^yMYhjaRoZ1EXw(FWCc7>a9IM52jq80En*o<1DwYl$1V zc4}e4M!8)MsjrDtciPL$9!qw5y`u@&fNlq$Ql4|Rqt@Z4W#%W-AueQzZ8pAc)~{_Q zF5slc@1#%I#tgNg4)vjdoTY&Xh8gZh8zkhU$0!S10MmamWY!f}TM;VJ6-lYu%ef&- zP|r#fVZ^$>XpON}6ICb#V3nyX)S9%##dWE?>Uk|2TpQe3} z=CMcav6udF(B^S?={y7sH~a(FA83c#b%5zLTpMak`Z;RPIVf)zRv$Yu6&Hv~FHD`X zO^soQ$3q;g)L>zx$E(}R+!b-fg)d+S8tq8@IY{|F62lZ&Sey2zHU!KrmOzT*gd$)e zcm<70qg=`VKK7GYv?^4sN-AAD;mkqAW{hq$w%tLOd62yX{el$9Vm5nL9AZSU!4$t^ zssmFBhM*SqbEqzLj5~FxEw$=u1GdYL3wHR(DzMcHW^EZ|Z3TvB8OM_g@r@HIgcEk_ znnZgWR(oGY+k`cq3&C8wtgAa9xFy1FU4&$PSj)|~xlzd?Qrygc*esmFEV$SWvOAB< zN8A;n08(T+A!sJz*R&SibjaXz%HT{48KYkkV_Z^gW@U~4l|Gr4A=(;Yuyt+v#Wnbv zAs>%E7)ecB)(x3J54lV4Pq{uxxgm455iGeu4Y__UxnXyoV7JL3w8@YVnC%1M&%-lZ zpQ%%v27!@N!b^*4#oz6TinA(xe>3mnC6P< zquLg)Y_-P1TW|F+Zd6g6@{aDPFsT*r*6?=m9P7do{$+;BEHeat$msPjFl4ohC3Kkg zi{$pwQ1ek6I{h-lF}oilyj?s^O*|6^HX3zpPn5H9q(Dkxlqmne+!N9e5s9R}t>g3P2C|NX23gM_510TBN3Hpdi|uF+FeuK~fS0cg~K zME}PHPywRf?BJVPeX#&wK@I`1p#0zP`9|zFMgXw?%{5;iP(m{d3~;@uZCS}yU)(jf zG+zBupDl2x{dC%4a@w(|b9unEq{DIJK|jj zy^On{sH9MhtFWu(boofeN9P9r8c5rBa4PVsWzx!_*`gIkAVk!oA_vL%QG$kN=Ks}0 zMHv*cS9(vRB-4r4HK1CdmQ2A-HUdEwgdh|IjDUduM!@t{?E!iAMP!8NfH3g|*8^9F zZ1UqH1bfeIQp8gxU=zhF=qj50jZs1~?|jNGE7@=MkCmn}VNp6_n%vCR{K`C{LEee| zk4$x*<%vgInoY6i3DGO&2g?V|hwdxW2c$Y+R*;<%!cvf~1oB@l-o3w&-H%Mr;$C+< zEN!rE-*&x2iYY`|KgVj`V2L@cK<%rLn9C#C2LbEG(=T&13*<+pKL5Fzy8 zX@k)0_^f=j^dZj!M6NO4v9tX!wv(70((=wlRuoq(R!ml!>jLVORO!n@2lZ~$nN{h^ z{fvz?)UzsdR0G+1J;q~Y=oN`v@sBQcYlh3MV5X zx%pNOGvH9G7#XI7 zTq;Ubnu1AMi5xOO@l$e$w3>`19(*+1=uaKpN`evTR^f}H;8;BI?4V_x<)tMBbGy}5 z+xhGAgLkWVmy3uii4VyiaFt(Wk3Pwtyb%t+fBaH_3ooEE<2e-qqx2h^`N17RK7-m8 zR5U|!U%_3St_Y__vT(MbwQzFUe`*C+8mtYr0A>K`g+Gcs? z%^py@fqSRv3L)58DOxY;BiBS(AFxE`0MF<;5$Y80E)jV1zI~z-=@PO{W&C?tdzp46 zyTQY>J5*x-#P6`>E-;h1Wo40Vz3D^fgXmFXVURH-n?nGNA1%OZX>R`V8gdxpY7*f7 zB)>bgr)qh2qC46BNY`>uU_5ubP-n?y}{J5cM7E}?6)~s2%w|T>j|AV*p%Jm?k>z;l{-? z#Jl3==LUqV`*Gn$#~NY-bMD+=5;KuV$6z&TYUC}(&}7z@ndnl{8J}r z^<4WlpF26w!~@-p{ljV_~qMIwQEDc$fSt`l`v9 zpE_B(&v^5ED}FtCTY7r}{R^P@jl&4}?l;;atVd(VEQpVYa145xfS3qr~=1!i|cZjxPm=7d)!3 zp-%7^ytgxWE%!Xk$XkKk1Q!x=6x>s2sPX0yP5h!hjwilmRSdB+&kJZ=7;^RbT3pI*4)NdlV- zECq3_vyq4At<~9Yi<$AxTk&)&$#gH_F{G0_r2ET1`mp+hp?-jJwN}>z(jXcv8>5^H z)Zpr)Kvg7zgGOMCcvB$m_Rv2bf0dQB7kRQK>_2_I17YG!?^Rrv%GFe^Iz1jXE#-!z z9B{7=Z4X$rA(sZzIC(hwHu~*ZJhyW?j*CqnZ5!K z-Vyb&Td#7cua!iOBiI}v6CRfMVdO@5A_jn{e3XZgr%k^{ole8Nib|WVBH(S>C^7Kt zWGOF+;_TObJ;hm!uH)y+Qf^Ryt=FCqVHixG0N8t!U_x3(EETf>Xe4yF2h(%}6?Zh1 ze|e*M3oPXFe@4cFD z#7^#Fx3@RK@9|Oq%`9M147;;^j7{gT#G98t9yH;i0u2UQ{Bn0;@!!- z>FuJIi?}cr3xVgpvA)^es{Zn~rwjgxEwiwwzi-WH4Z)RjK`;I&o#slF>0c@z!-h&E z0l))amV`5g8>-I)?NFS=x7>cxGgR+u{hp9F0Px4E2UHUO^I@)XviOVQ4AHTp1T2o9 zj=;NSJRo=Yg zi4~H95K}{@+C;iT7u~2~Pqfc4(42NZ*8uC*^(a3ZDSg9D=O_I|X)mYWp9`c-X==7_ z(-gZADRk?fVdM0j_jT@{Lk!*)XIg6Yb64%BWtMVamcATnf@|nzYdv(0)+@dsA_c~9 zSSoyiPJbU5XElYRKt5L`OMkAcd{qk)lmRi)PJzN&r=~X?lb=?XFI?-7p1IZ(X-7)d zYnOe3OG8cV>8mykX6Rc1Hf2D9hsCcB6zsPRs}F&^O6Um?o(Vs%2>GqqHy|ZTxgm9a> zEa}`PpO51PQ72-`U5}#tmz3>84zLWGy^M=Ktr!C+e(pAbRJV;Iy?GvB{uR*nGX-9Wc0jL}d?VW@CNqUSw`TNXG`gE(ME`-#8hWn}~E z;gns_;Aph%e@&M*pKR>(V&zTT%uAaLdBe+#n%obxxXNGXC7wEa$<4QkFV#lHRobwuF_OM}@+GXj- zPcU7)H*0;8K+duQ!!QcQQW0$Fnw$0tPB?p&O>*Xqm0cKO`l6%X$zil(PivgJre1G{ z{K3zh?!?Aja!Jxz3tgCwHbt(E#5V0id@R^KWP_gaL;z(T@b=U%Vd*C8q3fb67SN#S zgUiS@i2X$^2I;>%7UNNH-VQwPvyy z6y=3B55%6uHX;_-e25BplJb)sdfFv!*|u|TSVXS>#O~yRuH3EH68j0*2=CkKXT+Ep zIMl~|W8t0j1B0Ww4TfM5sbG=1P+1KYP1p%U5VGg!$a3mL(X2?wU;wF5&3QD2_|6k9 zgEVp?*0KOvl-vbD30_YQq{Ylk!(1AEl>cPFR9tr7W_h!9yM-%#_gh)zTGghOdgwnq zd^|2sZtScf10#9}r)-K7dlCveM{Dsv%#2VJp4%{4jePD05>GuGLZywhZA=k$+3Y#4 zK~oz^>^cGs#Zoq;X0ahs}SjEJgNDpmm|9<}l>xVtLg2Owu(0K9|7QOhWu zI5jZTpPU0?-HH6M{}|ecye%yX#m|=f_8;6{TK}HpzHLAR)cCeKZ?Qt1hWw9T7n($T z$Pv+h!Jh|U(WZ}HiK90#+Ha-VfJVrvT|nkt8r#uyjue?H`Ud0u%vLwA%gngAewLZz ziJiF^C#TD_(~65O2l!yZoUMS2KHpDL-I*&y(CV0gr9~o-6F3IfE&w z7stM_hDD+ib>ndx=?h(KE6oj_xv08p9iDOL+iu~(L19GP!<_B%i=e$RX@~b|gxS^d zv*^pc0I}x>)~A@INmE0^mNqbTB#VoHlmT9-V@UeA%~+XDKJAJuNz*`rBCp#285r}1%K@~nt*S} zf{}yeJh9l{hLLY@3%Q4zLQn_hDtTb-p7(chLx9O59mj}WLO4knqOCy4yyvt(U0pdp znnyimdwX7f?tJ!(#b{VMJ!N-7UWk(DBG2;cYCbD|v_Dh>H#BbFq$jHl+YAL=<09{# z%TIb2ceP_=HH0;lf2HG*KZfyzR3c?8qSxcEIvX6A-v<#4G?5}l)Ltz;@xjr_2(IB{ z-c=24st4p$D6lTnccR_aX5R;ZxoJQ$IK-KZ)cG z{YX$P#L)LX=6JO|pCRo%o`nta0~V^Gn7c)pus?r%PS%8DZDcSk^c0*_4q^eELu0g& z{@F4-9(rqbK6SuEMh)m@UYX0sEYZQY^L#z34;$^!itP1Tf&X}n z<(lqLTk1aS^teEKI$fK~Kv)WPeM|TZQ@3c^Iy=dcG;aPu9M-?kTYrec5RID-TkM6_ zyrq;WSy=SOm*0*o8At&iXO9)kH?}p>B8t6N=O;W0Wfd6#4u(G1a<7*g5-m-!Zb`If z5NLS}Ki4M)b_Qg4S)@AASUt-vtF~XZp*}1wP_9rhdkQIF#9TS4F&S>q+1pB^qlJ4` zYnGXk4;=FE)tr6Voz5GTSZ=<0KJmK|WaqWFbDCO#Vc6AA3;vwcTLTRBBi!kgSp$ZWgA%%NRpTe@{aouSrBoQ zyx$x&2h!~=b#i){DZ;{4Cwlz(b2Ae;XI>4hZ@;_E1*2ts;|DbpvkYV#{Q@1bz$jK7 z#X*nk8tj=K%!@;Z++?2nCCq{71``s>wI@PmMbfj`1hHDDjQZTsjhcz;we5HC)crNx zdN=p375PW0Kdtl?g&ace|F{T97fm$ss1JYe}6zALlZ{( zwScDf^`I78u0&8RMr8As`CeGgCvJ&O?}pjh*Nd{NZr4i`>4I0?_o@7Bp_Z%)XTib> zveg>ZgLcc_c|c&Nl=$&`;ea~Z1?>earV+57m(54Z*7NKLOLSW5zg0Oe_IG^VzW;V{ z-l&F{c%V=DB6qT6r0E|%!(<0W{&e)VwoIX%VqR?g zf9|F;zY5UQ#%$T&l&Z!kzg;OvDi1{6SbJNvB@yO}Lu;1wS%R~no8d3K%I-iRi;31G~Vnn@m)M9#cT#Dtq z87v>6{K{dFS*@xZmRxg*T}828ORliOYeJ4xY`=}hRN4kWcO-(ESB;z+gYh-JFXk5^0Z7~?u^M2t$b^{H*1av@1G@nQ=Js-9{UuG>!5MUn-p8O=r z8nRrafEm&Db@DbLP(Wg3!=AQ-?que$I=%*~TIUy-ckg1L#y^+>zC*tDnf_FQ{+<}v zkzB&3)+W{9`ArCj6D{=*oQY$&;87-zzTS$HNw!mtCT6@NJyj?^n(egi0nNT5nvujI z#ol1?Jx4d~>e~Bab}ifkqtd3z-DnL8%gaz_91kzvOwF)^Wc1VKf`vab>L2VUBDI@- z2;mQ#ldB$4XIUYhc(P|%Y89@l2}KY5l}kg)F!+33^#>jVLytt$<+ps+)8k_sIT7Xt zwUQ`v7p9e?j?B0@>whTEvm?iI%A@ylDdEZSZYh|O`VvCKf)Qi`dj+wF7LiloO6O%} zz!p&&4W$F+Ak7+F+1#CRoTRj%y(37-8uw=vNV+31FNe2FRjVRi2!FWL?VDupFrKmT zStHlHrPX!mkFjT>xuI_a!4+O_T797#jF|MT33qUwrEAAoE$?5v3q(UG=?%a~XS2}- zzZ-%)xtmI$)8b_yzv7(S(X52xs4hU@DBQxH%(Lg021S{9$g&%Rac)~$TMuX$)K~_L zTU!n2J>1UkvKz)rkt6D((lGt*buko1Xzo`3~r;$E6c<~QAYPNPFK`?rv|HAXLM z9hL;O-Dx!erNU-LjfVs5Y(G5jguY)}?P%HH1F5a(NIweGuga>wx>27atxr(uVo6GJ zP1v0rZx7T?Ug}`Uq6HQ04K`$&(TQFfKQj|IX9XvN`gNnQ(BMLX6lpyj?x=&0ha7?6 zb}@PU&URAgB*w^pGqPZuu4uhWaUS1U23X46^BgswQx)`VK|tLw3%l< zb54^1%wy+OmIv`X0sE5^!c(eu(mxF|AVh2ZYO6YEVx?@+2HC>4o<(=Sdu0SjC1P)r!@U0 zb*8;84o@NaaOgG5?9k|Gc1x%)Iwtl{79QJVQmos70+>WoVn?F(^x;;{sRA`FTs}Mv zSi3r3t80la)Nq7>e!p?L#UXiVNtq(r3a;@*axY8RFB^lk${dX)whHD>qq0Qm`?H4R zDmSN@8Xo%kGw%7aR-?14{Oa@Mq*ENz}vBFvd2Xeco@tL~*1>apd*PXhv&)pc$>Me!qfa`My zyJ$<+F~Z;}W#281)kh57#}vUnm}jyWu2=?w?)q#nqyLiXmL`bRQ8nQ_=1TI>!&`)eLfh^WpgV74zB3)u8;v_UiP3 zVb})nGe>r{JNTPeXZ!C7)!jzLU-!AU9v;0p>~YV&A}aYQ;!GY zJp5OueiF@8%CAu^r%W>|kFKMW1Ve7@TIqY-YT?P`J=W+^s5bO9#&A3Gdm+Qgm*e&*&|P53u$up6UztKZb19 z%XqVLP6?NKH^zoU8lhOG9xkl1{`C`oUAa9=K(qW0D3Dbm#aNpf=tB6lfuD0Q?Q!U` z-fziTh%xBp7|L7UY^{Ckz&7*aWF4kvjBggp5TS;59M9&Kh^^$&u%|k5hOt6H3$O;R zUM5!9`Ln6aGi)NCB8tch&nx^I3nIS2;Ws+@JS~9`w8OP3IIWBeYM4Pe&y7eNRMFSb%*|&jD6nL%R?eOUgJQpQV<L=SBWpv5jbvMT@sSu(TQYmv584SG{LpN`@+PcveL`q zU5m6UsRH&I4r9xwOiyZEcmyK{A#XQd1*CTzIu49?Q9>Gyt+Fj@ZvZj`yt zL<&^)(ZB+ecYfmH3}3e`zj85@XB+B2Cs20`*tus)o@2X53mHRN1>Bqv-;LzXwy!Nl zNNE@B9H(LO0lSd?W=}7xNk{%xXWCgvp_VN(KD6k(@Dr83+d4GRMrankX^r~ zGB%Ql3HP>0j~EnjHMG#VatL8~-N&?gWIk%rbF1F6Ez$%i6S?AK`vK-JQ!YResD}TE zKI92Xmu{R&i;ymg}d0bT~=Aa}kLF=aI@FP0-qyXh!de54VyuDj=3~z{z z?i5vZiap;K?9=2cF!t=D>`Y#ANnSrQvNdd^kHR+YQ|eMfWwT)B@VG_!Z%hAX@Rz8j zbd-G@yZb~{&k?Rf9X@M#sCb8u9jqB@awxtQ)M5G`+avD>nB){!-uLVEb&``(*tXoy z4G!7vlaRn_AKYRn)`wCfu&|$`?<`86&J9DlsypASihi$04bPo_@T}}e4fB(>eY3hP zdj_mSY5RNGCM*jI$NXw+%J_dxt4%=nJOnUp#|QUrxS zR44jQ)Q?h(2=!+OcUYg6gzV>f%sOOKJFMAtC&^7WOf9ohg`?+<(mId=YvZo<-Of)6 zZ(RTK2in8ra{b9$#IDc_)jQAA_c;b8A9&+CgFwGw@7*yJEp6G?y=*CjdvpT53@OYx zJr{uP?SuQ#YTKcRc?WJMc>Gyw@%dmw0RObk!@vEw<2EI-cf4^zb7+ryJkqr7cb){p z$%@*g_<=?ImXYDBgg-rck?)@9PL@SmE!t1q;_+640txK@7`!B>h~A-AlfJzKpC@!? zMCg4aUq^cFQ5pI8(6aT;{mhuDFCuAIby>M+SDj9l2bw=_^)!rDbvd7{Rqyd^4H{TP zVB>|s7}u6z$ta2m8DfIzAJ~wSWHsP{70^x?k5G;><;@(HXihxAcTRY7{ZPaFwOk#+ zEX&k1Vsnf&VFK+2*tc7+mExT#B`}9?I=Etis9eb>^4`F5L)_n97Yy05t#KZ|YmqoS zJL0GSl6^v=`2_9&mH+#XtJD#C1cGzot%^aH+c{Oa#^Bg@t;s^H%B^79Se9aIhl|s) z**vn54NYmmv3n;HiSWA8sU)s5pWn=hxvtmpQ(n*!&~t?X8g0gxXr*@+>q_) zhCExHjt$syI;KN$$h>Q}MR0BP^3$0fe6ogeg}{$((dv`tIjD`kEy4n73<+V7hQSuQ zZIJKzp!rCJpYBJ=51)>;1gGNt zkf*fo+N|`F3)-2&#(wm@eO21Pjj*Ka<(0G-Up*WpWr|f^Hi)Xv+#@tXw2Esm_rk^B z^*16)FGNir5?W_M6jGR!`Ix(9lG?i##p2U0VCpxq&v3PynqI6A;y7Q~nTRGER=#l`3Kyo{y{Ph`)n4|j@gYAE z2!kPiM^k>K1AqS)cY{I+#LE7?>xDPkq8pTB@LYDvrAc~atrPz!EVsaIJ49d;AW+sP z4GYu`GR6ArfNo}dA7!5cY6j^JTw|4;tU@bY7TmwzqOmRBe;Wq2_5l*aD zMRvb~fy@zE=57{J8=k=nv-YbLRy|wC4z#o_#+X(BQiT2CzleGxWEFJ|38DFhonfXz zC`b?Sa33Jmsd{#)3iNC;!T6v~# z?2Z@gJ+q?<<;!}{Bx{G*g}yM$%d<%(rg0}G#=|A)`v_Pbw4W^^(aNT^X9oGxrAsY> zNNvQI{C_??xJ>Z8l~=y6Vh5-d@XKjN*EQA{pOT&ll)s(smqJhq=4XpRG$00(ehO(< zo^Z;wJbNorU>yRe{5>1=)m+HUvQbbtjgYY}v zMStpgC3QfYf9>VgiYe08{+?Q{JE(8=*+t=y46Ef>_a#^4Mtz?x=6_&|$MqxzVjuIU zjb)sIy+Y`U1cN(^PS3$c?Z*?wc}HnewU5L*PW@?(CzG!9Qjb3a)4YmQnJ3Az+NFAw*L{jA8!>{<5KU2NFxgr9wWrG`k`h?gso>E z;WNB{e>wTe0ou+EcZmZdPX4%L;VIq^m8Zo@vzCBDzu$U2#_`A3qL&oYXsxLeZ>`N% zYyRQ5s)Kw#`JK2U_{$a3Q2^_13x}%;?ejOzI}(~t;!aHIwIM7}E@*4wnnL-x6BZ~H zBrtL<(3p2b+W)~R?zdCSTA6d_zssec{ipgwg|FK$1GPnHZrHB=)AV|ru88#=2$vURZm>0g-gwx4UWWRQN5lyI>_krO!Xa+P)B(#;P>7J% zf?zCEiZ3zqmaLx&FjOJ8BcT(vo;cx08z{m(-F#Y@%-p8XGn(^#cMokQZX+4ZZ`vre zV;wB5bnLtli#*murar%)iba?CPA}(48h~qC4ChU%rrO?MP1}Ohy5W&lQ`j4w5sbn3xjnF0|{Y@}i>RgGZ-pKkgRD57zGOP9T~&NFgPL%ZeWTs>fuYI?%!q zZQcN<1xaA30jre~^gS6i>6!Dxt)tGJwAEz9?(x^A25>l5HDFpwqWMh0@6qhRaDJJH_)qrrMeDxr-uk{({E2`ZSa#w>!e3FsG3y|!P^{72}gW|u!44<%p7?C|+ zw-Fre=w*)SkIM6Obd?RTt-?nSj?48v_f^QsD%hhP+7_!bN?g^3X2 z{YDN036J<0=S9HGuV2)dH*Fz()te5>wxS{x_Tcv|sYRayv zf{u7rV^OwAj)m-^&Tba|V*z2&aDpgnTl#)VM&@?`qDJBzxRL?z%5p3!MXK7+%16#S z6~o(&*cBTthUlz%F|v%Dee9We3)G(DBxKgcS)&pq2#>XRq8}P0LTYNos+pXe9Yh&t zHe4|zMPrhhL;}`gp~EQJX@;y>FpDi$K34K))k_f3o7k`~=GQb%!2A1_~7S5DXYn z@5obLZ|$^_?#MTqKm7&mh8ais2^1Oe!TZ}l?djF`=GhBa>T{(I^ zq-Lo`7%gkMXnW)tMov#un9~4X=X5783{x1o?ykHGG zQK^idL&cS+jK9gkI)BS}o1?ygTJ$X#Kcp+`23ToYJ)gnOXC}*4gn|Ddl&c2$c>N_= zl$nVq&ax{(jEm)%`6YHVQmpKF*Z1&ak}aS$)@)#5gv)HYix|>cA#4!rC zVly_cbTgJ3vJ%~TKi51~XG};WrrOc$ZUOS$?bs6%q&9$7pTBP896N-3(ev5yM$u?`fN*TiDGgkd~) zmcb2DZs_CHpPHJzcdEZH>*X3)_U79drv6QSxR?3dMz*r}DE)(p?+m{?_kBdYsCRl4 zy_2cElvHvzHIK?s-Vw+8OpOGqhTDHZt$w1e?#|hns`($PGP(p7gVrJ@?S$O@$@*R& zF^pfOZn!9w*A*q%)+?cqtZZ4QY1fE@S1h?#?~uOb8rffLLcHc340Xj;P_jrw{Ue#b zY*vi)qneZx8cjBa2~!>%WpI#cp2nuyN^3ohW>|cer|980;LVY41!IoB5ri@ zB(FLUKt?f~5cY~Oy%*sWd5w>F$1CEDOmRgu|19#&#g(5Gf(45DVwm2!zOOC&bAInU zF~3uxeHsRTwZidHU|kM#xxuDPl^j1HFu#K@I4(cT)0+EbBy!ezQ`xBQ=m%>h-7|6< z2HHAI3|+q}37(n9s>4@JhpxnCVn&6b^$7Y-l0bTmN@)19nvf8J19wuRU@?9VS{W%b z;rQ<}z*o++lPFF=MB|i_QP(33=y&z8hy+ivM_J`OG}fW2qfBJ?c1z9JxMfie#AiVi-)JbTr#R!Gi4sOH-Fiv(>toBIS7i3pdhK3=f>b z4p@|#LF9Ionrt0Z8k|A8#ya1)O&>?pGP;7$C>#J*_YoL9!%)9d_7f;o{MjbxH;1J- zw2a$-A=k6HIGX2C^p2noval_TPImB|)lSqIG~dv|Lt zl2ggj&5Rw#bv_nNF%Y^mYj}~5zux(;^q*~0uopZZLE3V+q?`ji9bDntD?}<+7=HuN z2G+BPgMOIRxYDPzPu-HCR_KUc_>#b2W5?%Trw`9mf`Hv({=%NHsu7fx7g4EKns@7; zYvNI!tgG^)Zwo1IB<2Nz=Cch$1m*!bMsCvECBy#XHpok6%~Y!kk>eM)Q)3&rKO7Gq3H9{uWQ(t9u;z1&Y5 zPMz;jmSJBy|3%dp|Kop#>;w)m`sJM!GxswR+;vn>UQOQf*q=$L-!c0SKA=Za$d}Yk z?iwp^LRPn9O8!rD{=FJ7@rT@3k*h-R`ir^f+CPO{K4AWg9pQfO?6Zy%ldO5gVkZra zL-J+UZ&;s^kzilef%xG$%p8;HneV{9cx)@>MEX5*4OKH{V^El?G?U+CHMo0Qc!!sw$CKUDu_w~W@9mYIPm`4+1$t8^|5YA9sq8#+gV}G{~+4C?t~Y zJS^{vqZfHIe2wo_qi$|SrcB+tY|;DtwAy?4@WaR%{Z~j3UP&*Jz4{}=nQ3{9(Q^k% zB)aZ**E_9lc1Es^4UUwl;r}u-)TQLKL=NlN4zeZ3*x;lUWkr6`VUEt2SUhT-Whluw z(Lon(r~1m3(ud>a%7t+_(4~q6B~Gd~>e*rcR#FkkBZfR3Hls_$>u7-?Nb|VX*EC`Z z9Kdp|Nk$|`_rI&nvEX<5vQeChP4xfy_6YP}WLft~o%a_S;0X1OdW3t()R8u>SX`*l zROwk&e-6KWC!F|IudH+@CCB%`PKn?>uEu@5t#}q(1EVdVG<0y9UP)t4tZ1)6{ZO2j zuUgepkm3^Xr~qdxSJ8zttbsbvr^7Y5dv4xIZZAj0n-5jN$$TgzZf6vOuv;cYzSaWfZb_g?A+IX}dnRUKXmLB4V{F0vYwlZ!8ll5h^%@}|`a z9HOji@c)KRs~uaCq(=saTKwf84CKVYalmHU4ICF%B-7?1TpaS6RA`Gnce-6fz4>Vc zp9{=V54D01XTi6ksotFq9C1-Nz3uYR4nASvK@cZlfcSH{Yb8XD8;&2s-`^L&#t!Oz zN$S|~zW`-Gn!nO^hAZpiH`fb|HmxvePD(Kqd}ng@tlHo?@u+Vpo1E$QxO0>7%xoYP zI5b%~Fq?c4@5B?4id&TTf_`_!mx3)Lo_k|Jo3*)qro`=5)E&oLUyx*27c^>{x>^0q zCR%aCp1c*7%MkI_9Kg1tGBc=91jBGAA6?LdsgkfAA zdsw5E*9_02x9V0`Qkz4*$iczE{S%SM#NG;4DT~XK^E>pvGrGDq?-gtVf-gKtPmMw6 zq_=I|v4yPjI9cad*0uMPZ78fGrGM#K=9>By?;P=yxsPYOUs?s-OsnWw&0MFXU+5}G zP)#G%eo+T-;AL;?Afw4d0$ABs#kNOhxA4fflEuqCGP0aWZw|tGxbot{S&8q>PKCyU zcm$U&blPW!&W5Qrb_Vcj9IuMHe*cAT_wx%62i)$$M104Y)UL+$$R3B;epcJsOdDMJ zl9tl7DAt6d$GS=V;Ei=Gby9&bW>3Q$g^j`AnhRO}^lO(VYO>vo4~WrDqAznW=lnox zuo0!R!Hcv(TWxTDDz`eV-`1h*4Ucm)$jEj=I|ixp#cQibDA%EiH#$xC5b`JQmrD}b z%gNFJDM>h0bw{mR<${E0fBh@FqA_%)^g;Llas&Mc_@Jn%CLNHz#`0OX+^D&!rkaM; zRAc3{B)D3M+~&$7^kY`#pv(T8Tp4SB&o?7bAunko)_3caJG_t2LF+ozK9milgI6L{~ z!81=ypb5#ft_Z1(B3S(PSFhsbQrGaRKY<=s)bQ$ue#QA;fZp8EBt2hKm`QWlD|%dD zlwLMOYbBeIRmo`*hb!oLeV4tbFk<#73t&Cm8!3#&%^{#J%cLJX1rdR7gCM^J(&s4m&L(SY!)g30uwX-vmGL64 z)?*hlmsh&8t?9gfls{DDUZ?*OD@>vPC zJNORtna1zLzw;UDAJKCy@rT;rkErmY41Y|8A7l7)D*R@KKcT|!W%yGn{6U8QsSQ0R z8SW?jl<`wtt)KHk<2k&CXV+_b70*AVz)gzlwfG!a!p%y0@Hw)CTb1-MI%9-y#0$pm zv9o*Zs%JHDL50sT+|{OSkE-o^S=&#^ZA)iiePq8`;l9w;lexh#?Z-fWo5QgUyR?2L zYjbcD-EijECKMOO?PrB?)tgXy!WLw&P0Fmj!nU-X-?!~PHJkEUZ8jQ))gSD9rA@2a zAv{dCu!Og9X+7P}vERu!-`=!7;?fx0-ZZZE^>g)4_#2C78Vm`8aATwX`*~E;~F4&`$ z(8#1KQFI4)X1z({qNN-euH5Cx2F+e)>YS=~1Z6#&{H8!C>hPtjr|-Ab#Du3Xl?Ya| zaZ7TW7#c`9=Qjn*`J}CMFrGLxIB{h;XU069!~QJ(eW1!cu%q76RIA(2((da}MY`G~ z&y9^#ZO6>NhYO#;?_z6&7-{6ddy<2$QASHSP*Zc>{{e%~RkrGx7k;Q=!9ef1sRd~a#dKQcW%jeb?>6#7p8h_*LF?2z}t4r!`s zPi1IXAJ8kchh2Xr&QG{xVg=1=^0ZNI;`O6w2-!mm%U7*trsuLtfqeS#bYZFLOK*MM zgm1+6^ZHo-{OiwJNz`Vu!F;CT>7Pwy&p7LXAzn-0WrgjA4xq8r$OM(F2E!}7gRB?+ zPBX%K^Rn+$_UqtiGWs?(MfH^&FIF1f-FPEX#ol-w+2P>cQ5amoHLz!Fa9dHB8_I4E zW)kO(W|szoi^IXej4Lv>QrLN!c#S`2_NP7GeAqH(31(dRYQ$F-vyS9&eA8x|R_{qx zL#gS!t0odZWSr!az8!?Ht?@=fX;)`xS%1aI@?FiUw>99mz!{}@CTy4XNl{Ezdi>OdOBJs&n)6=|0{qQ#F9i1A5dp(Y;(9?G~@=Mw|rj2&H2|AX0EiRQKsh2xW}x%5meYx#Sl$JS$yRYQ}TZB{QT&3(Ja z=Ira95APPVbZY3&@3iC+om_T-i?d(hGV_SGF3{WM6*)Fyd3*O zI^#!HNq;sc)>3tfCcMRneReXolI&W2$Tb;>%~nDvcBqh9sQAQ9OX>37$!KQtS>>VK z!HO+f3Qo?%^9RmEzY{#(@e7t>Sy%t&{@j+TKelwm(wXmBjmLd-eb18fskbZN11If& zTFXN{i}}J8x$qm{aP42CMlU|Bbr+Xv^&8R8#Pnq6mn=-RhW&6Vb_x$dI}sg9e* z{!GGCH|)9@SEa%=JN>}c^5n(nIlB@f@Z2o zNpAQ+3!5g5SIaal-5h_z?#=Uyf$BmkKl<<6C&#Lj?%c>P?6?T5`CnX zoW9KoI#g~US9B%Sy>rgjAFezF4eYF^U6B+lQ-Y^ z(U0DE^Cx-hrB{yZ-Q@Ld+BPT@0#T}`>kIhqECRQHs}l3eogwMtMSSq ztU81?s-xeb-L-lDN3VOw^jvA--PeEOOuBE9bO*HaAV=lr9Uwn96ZtvYBtN_4avE7y z9Q@SN z1Ri}J*MUC)CvB+kM~SQt!Wa#3cz-3pD9m#0qO3N!vXz@!Y?9(qx;Tl(v!?EGyYIoI z&zDH}e90fdmn8oA*985N7z-zp;ZQ0SYWl=;=n?4O8~9I?_nu|jz8$p@69&WqVLF^0 z7cc2GqFzA)>fpEY-2>UQ-=D@m{P@9x^)G!vOeVz$ZjH7#kKTY@B<*=yolxP&Yq4q* z#G18Kvo%sz&<^$E_Z>Wl_IxptOh!c7my4k^hoj^tn@ zR7xi@rJ#ZVJonc1Ve~BYA6o*cjc+VGj*tC;PE2DIXbhad>4>l{9Y$?)=AJgL;?DV$ z#sN%YA#`BV%DF&c#HKwzLn+ME3597_s_MrSuFMnqilGJzq3M(8OmvvP3&sbp9UeRM zaSfh$$%Mqe@R#te0e<3=OCBO?;9YR-ulT$87<%@D9ISw6ub{g7-_b$zHj?XvpMjr* zpMi`>-{2_rgrT?Pan4a7o(jfGi_`r3J=@A1iJ+Jo8{G0n$?o_KJnNbb&$4dFY5I*i zeMz0Jgli|mb6((&1Fg>!TA#my%GC1#{|muiAovRs{+smxx`uljuSYL%-0APpYXSQU zU~%-q`Ue5Sf4c(z4a*#^jNXlYh!b0SVAsddj;rGz`&j(c=f&H$-xikY>Xy-8(GP*nmk6CNNpzmYl|dh1 z{3O9oO86>D^BQyk*eM^`_&a`2Eca`^69q{fljHdH3V5v3wA}i3bWeRA1?Ool^{@Hq zHrLts!s#{Xy4UnPphJ2d(EK+lUy&YNg^mKBu^hD$+CIWvfxd@62D=^18ywtDc+;eV zP{vB>~w;r6CqyCe%_3h|) z{0T7GaGM=cn>zX~PJwuF1wH!ukvG5jNcP-AhtAC&U4HbYn;u3%MCT=341a`W$@!!|O-T%lr@FPJwHb#c$#!j=2jx zjBNk$AN6PX9~Mq)3xxi|aPJ%0y%^Dvd$o-o0(e!|= zni&lCbUAXf`H^z0-_zX@FPGyT-Jbqfc_crZb67q7xtz=7aTv=+hsRVnP>z@Uy@hVO z=uDrH?=N*}yGs3~m7G(wcNcp7C8_^^V0|EwgM@Ool(|o1L=&VBJ@6T)?-Y_rmtVVz zJCsHh$p9z&DZ3O4D!rcL!?AvEcSo#Tj&*c<`(ve%{7lZ#C3gz?=g7_EM~+}xb1Nl@ z*8CZ1nbvsuK!NqlmCN;eNZ;rfo{3KKKZ3dHY#H5o0*73p(w&>p{N~#<=iy!={dxyl z=AXxzZZPNYJR!0cwpd8Nc{Bg~DJRFZdA9Psm^?n)EFtkQem4K3Qy&LirFga;*5WZT zr!=JYk)E|8m_;*g3Aa_REY%BWjkLGIUCL|u46G-dBW}#&yN%L&_Ym{N$?sI_mi%!& zVC;+`5Q4RmKqO~e|GwA#L*Ey>3SD39`-j)1-t?vqe10}p`}VhMx!KSAKl2&dx2xBW zqTlfM0SB_2vc{e4>BDbnL2HeA>bO-NAF1mr0vIthd)z7_;|(|HW_9=<^o(v!ciV07 z&*^(r&$n~C;rSg>j22y&^c6Kou0gXVzZ;5HY{&jZtyJY1Q-b@clj=g?4ND(+nK0-H zAzov|2;?8JroZ|Iold4o`f{`W>tEMX>ex48SDdl_FX%M?Rj{JwxNRJ*RFxo9;x`Oh z$-FNDBER=>n#+@KK|pEcouIU}8-~BqmlzLAMgOB%f)Q5|iHWB5WJ&5zN2{8%T2jpz zF}K|nK`}YH5DY|c?GF~+BdKIIHM)5;RZ1Am*4RL- zxa|KIV=NrbgnX91WFV9ddC^5Schv2PfH^agD-1jO;%OP@>^AyiF9xqRW-RT)_2-HClg7oo?0YEu(_+ z9f}=F6EVm8lM9Cj2M;eK<v3TcnO3ctR0 zxwja#+oMHq|HP4aDjkbI`l?()FB!dAf2cpycg5$UsYvh^`>U`9cyJjSLr?PeOYfH* z6dCfldED!4|nf(0=yDwu&X z@tKkjzwKpiW=J66n}DJA0nlY_d$z`UZbPm+;g4?a*Hjx6I+A_T$*$1!E;! zA=D8jXP7%AS&T>6O-^2@glzadO;UCSu8xmN0aO}8o;q`wzy0#<+b^&G___;@AHU!_#8s>K^<UEW4vG3thYxqs4^m_qki{$AsGS)C7_$XPbnOG%v4C0DE3W-Sa-z!oi zjl50+QU;Z^Mc1whRfUi>>Jr>mA?Jt=6ud>V-z1s^r`?wG1x?=M2b=qh&UOh=v)yj7 znG8-tT#WaFeC)9ZCX=;GFvdhn&}~AKN|w<5c>nrke3*YL$es~csmF0tCdf(5i@c=W zj^o5($r2qRS{&;Vyu-;$@1T}tRa8-84Gb#9{8YXdRi4H=8Zu!-e7LCBI_Bb@yl8vx zJIs;6cy`BFG%~u&4&Qp_nKz!<9~s|WIw~f{-)^kYzCI6q{Uqrti{#B?5tLWx z0%DcdvfAswOVD1OF_cy({ z)6g7RW@wQyydib+IIbE&_8Zhr(vh{)AzOHBG)bL=TCCApOMx{SdWNLrbz%*{$|gT0 zJ^8VVKV?8a1Hz{@3!tb;Hog`)}yG1&q#H`fk{tI{$pM_m;t2=Chwk zx640bf{!KU+4F{Wme2Jr|&Y&9_9m{s=x^$(Xfm9_pTJ#5M zTk{<~9i9PiYTg}p4F)5Dp_~`Qd|Kbr;Tmv-%0k8#wVjXpW08ynb)am_AM3OA_~PYA zWGF45TRT2th&Tq#fvz9)cq4_7IGC`bYxUQ4haClz90&GU^i^~>e-h@^0I=yEf~}!@ z&{_ObfDJP2Yk+-`TnDQ~!oCXk-cGO~cHLLux^IzthZWdY(U%D}!my)&-AV2pW!T+t z?;Yg2F^1hm?#0)QGwe==O)%_P^g8q|%@kmh4ErTuuOrwL!|LcL+Q*v!n`YQcXd0bE zuo;GZc6|%Fo4b|rWqmj0%ld9~7WZDt7YX|sU|%HH0beBSt8nk_1RG-4eHE_z7P)s= zfo(xwCfEqWjskWkxp$Odcf-ARkn6@6b{Dz#R>~I%yOUuP410FnfZoMDO!*>VzXa@c z1e;=5eSI6+xBfNC7YTc*{s=mUU^5hhHS^i^m(bm4g!s!7+=hctDn=|!CHK%I35Dk` zUS!AH4wM<$x^)Eq1ar9{{PgVEwsmD?>$W|`!QtUbWq5dy_jS&Ok zcK6nu0iP{qj0;1N>Zmo8alQA2$k5i1Cn#7$Zn09d#p6jwh03z80?%%Twj+)6$HwUa zHM>kipmdR7drU zmc%L7vc=_am117OCRj}|n=6y3**ar^Y{Ba$WBXMg_FKSb9qhdZxE8O->0|1ZX9i-Q zWFS(dfzK6dq6rE3Oc5+3T&;DhR+Fv%v^e+=x6Tz`Kd@tBA-%8=xc}P?-h3I_^fk^A zl_iDoCZmtEXk)Ktax>mo@G+=VUKVdRnu`S2uo`Oku;UMyvwmMR60rG90rR)t-|Y+* zM`x?4VGnS|@A3J147N{HXM0M8!Y0BJ=;l$N?@lt`V~x|H<`??X(X+ET)JST!z-1yU zfZHXX*|7*3seUw@Tg*o;paHMn8?cGCj?AS-zb#$XShJo|*&Il_hPJNG_%qg+&n5W# ztg-OV4822xW=kbykNNtR=XRZ8F%sV14gcH$yfp#sEmmqLQ~0{RMraJS(((D`X};GP zaen#F!GyD$pNLNkZ3FB%K6(WXHSAt_>C?x!^3Gz&?6zKN&k6L`$6x{TWs z@E8NOR8ecqx=W?;5*~D4*7{4qXR^d1{;wN)1_%3K%rnDy#I4xgeRlny(7Vw4C4aU? zI(w-p9O60jY^|8fCKB0PvG$oQmli|W!$U)dv%&sL;r?I3{jX#9r@Zu57GyOikH&$Twnhy+6R`Z0aow^2|{Oq`h2wRw%OeHC+={&9d@^yKIf(N>(M#z z95a{ZHk34Mk>hHhd51u!`kd({pUCUXKCjj7EoHYE;yz@z+g;H}cG@i2KjUEkTqoH- zi<14b2=>oalKrzN**}Y5|6C{8KZ}xGGYq&*b;llixoGzyFy0elA%r()FAR1R{QS zh$Tpo7E#;plWDNd~1ss&mmS#TrSGWQ8OFvxqBYa@xznvJ7C_iaG; z{bVi%VXjeMfSr-(V;()Xl5b!{DXaJ8_!`yGw|UZo{^@zm6WWoyGi4K;L!vmGb^j@y z5NjQjh@CUGp8i^IPts@u&P`?u1)8tshu+uarRA z$Fc|&sa&#k@RT`hOGV!Cj+B?Y`a|61=waZ6 ziJRb-xO18!7+Cz<7-0%7Zah!E)tGjhl%nJCg6-mJ(t@Q_7T~jp9fE7rrIJwSIpWbI z@4nENrNcUfHW#2ntgs|Z)*-|eOii&t_zBJ;kBUPk!C*I6E4?2^Q8TK8ePE< zuzHeSlfh^UN0QEDz>+-~3kDO3U@%7Y&s{Kf50JUPiNk5Xit%fl!%_KQV)DVp3XNOT zvH;|mWb)a?yT-N7fyiKaJP?6x{Wz@o86h+=`ja1|;x6YSc-`T)-w*Q!$K2qU6HQag zBr2^D9N%%`9D4`vbkfYQmkh*uuel5D4*l?KZC$2>E~T zd((QmbLMmc*%c%~bKi!(p9H@5ki3Y_)_hlIuy)}L)^1h@x|`KP?ZTTWRW2(Kj6GBW zsR;e;asD%NZ@Yf(qFES(`p<5A$M-)vwTfx@A<=EWh7KpV7Go}p+y+-DCzR1XX7PtN z`P>Gfug4Y^s>Nk!;MSnGLs!&w4iBIzon!BWzWxH%W`Ic7Kpt;NaVDr*Bax9XNVYUR zAn%YIn*ow6O&xQcQt4~@Vjw%|EUh>qG^QZvA3OQL6Y-rz9p4l3_V@HgJmKg_z-O-n zO+wEIKbvxRYc7Ae@c2We9Q+8vA@h5x^-pnXWBj4pHBDVAF2RBa3|!? z%J_JtJTW2diLVBGfwqfB3FS9TKDuwGYDJKu!EoqP7pX^p<))eJ;HjZwV+V-=DlP4- zG>jwx<4SYk+3_;4rs|&{217o_OU6Px_w+^RUn3SbwHBf|W-DO5eKoe#+UjiNN0?lVThGCKWzj*RG7m`yKw&`yiZZ8eyU-MWrGhtHm< zI82G&K9|{G>H)~)2nfkRH;uKr9q9cx{x+Cs3vKff8ZWS=BHSi<_2nr44yif?CvE$! zVr2}`S6irr*q@fRcUEq?DV((hOue>(dwzho7Bu_zm2OO>Iy-WmhRq{{rq2LP$N5=k zhsFL&RHe+KV48Ky88T=zak!16i(D8ByFAPR&<#E60PCCbtw&bSr zAtreLfN8h|=FU%nhF+2r)RTXeoQE!DQAjdzSX~K?c+2ESm$8%YGGx+899V8$$c z^9zng6hhveHC3aI-J!Wm0q%ds1CrRToWrHyS`)( z-TcdMBjFdnt^XLso-2i)E5Y4#AM*&=$3%$EReGUJa>8W0tqpy3nt0+>w>U7>#8=$r z7-ok1+irDGW?^KyEv?_huQ=sC4zzwBWWEzr zFy0@+!s8t5)L74ADK(N+QLUAfP6>IRLZ#EkdHyj?Deq3%9YDw2E@!e9oLU;pCgXV> z`e>KABVRH0B>Sv;mg8e-=gMfI(4S{}>#eY)sE&3uRn=jWnd)e>v>(Ie*!@zSBR5Mx zwZq^2tQ4dq(iHl*McuvFPjabD+?KG#Dw9}Sd$U+u%iC=9c}Xi*Wo7*xyvHVVznRb- z;4+P>)zV1{quEPnwn#6ppHgPmARLwQ$|iOG)IQDu+~5tg%$tTW^}{hgGGn zfsVM_RTi>Ygsdf?+yz#WH|szhmF3NW3D3KPgbjDHn!m5FHx(H$J9lr1j-&;v)nEU{ z@RY@To85k^**IJ*4O74GUFc492Y)BCGrL(#t&JTsZH(?w9%;F9%0ZAzizh%agb2Z zDu2FXRoEnoL&C1?zG!q`c9#IlYLl><-D|bR_P*@zk65jde!ujIW#8)h%{<3H%k`5t z3pn!l#RB(m=@W9w6pk4ZPGEPCz@^Dh+t#S!qi;V6fz3rdfNAN?0*Jh?R4!AF_bT+< zToI^PDcM1IqaT<9;e@L+l%Lx%mv`kS;==>yi1FANgTo{F*`2fby$i#&&3^P;uiey{ zjd>$}e`+`vtR+3#n{U!(e1o23e=Lv;`jdm1vF)ALyi1qz(OT3n7&zZI*~oB}Dw!Bs z%aSb1v18eZ z<0YHZ;s7C}BqWrCvV{u;YAD>>?~$^!rH@C_a&Z&FzO+E05D0x;ps%dA1e(&@*7b$Q zeJw4ebfItyv3$=g|DweX(C0*!^=szLIcH|hoH=vm9AhLpKAvgby37~oF@y#~iB;Xc zWGLkcuILF3g!=q}+*pf&(31mtWPAmTrE|*mvX=7o)3Qi3R43oPNb~}}5_W(%e|YJg zC$_U=k%%lx0yW(VOY}?ja4+;px*`*grE0#Tc9O~hdZe9)WMwK=JNM~rwJ~3{ zRyFN{;|LR+&8jK4OP2+S^i#Aaw;aJzoo9Jo`Sv304jWzWX5Y7cBe-dLMrognC5FGr^-_S;zov<+7Do2EyvPPjn3-#mFV( z8&mA=CsEVLhOlmyIr5Q&FrE~>?nAv+tcXrK>ZZac8}U)G7f>Gc_YDs%`$2FbmhD`V z3$*mENn|^QLBe+WLOpKu>-tSAM>f^h_*%uCyQH?kjk%tw5|cR?+m8y?&#oz0l!HG}x>GTTf@Lch^|lSpSKQzHU2SV=_0krJ9C@-Xb@{ zEvABG-mv~x1BSjccGZ~yg>4}7T0!R3!1gmQd|N0DU1X^mp5AvvkqjPgn_?k}YE)@a z!#%D99@~O!0$lvPahByK^l`$YJU=dZkIb_18s}bZ%=0l$gB&rh_AK|?BA%%|DdMT* zAr9dQ(8t-CphQ)3;-6%asXXc>YCBn8vWkBa$w-A-JmEsE(*pa9SYbt*jH2?!-nwXA zL$kF$+OTT!;+^D!%TpJ%`a11ti>H3MocE2_i?|Mp$n3uAjCB`=ZSCEL9XpU@IQMdS z=7MYQbL`wM?ffT8$eFS@%|(MG2dNC6R`m*AsSLLA_!Ww0sD(=a zJLhtf8WzeLvaq#oHutK$3elY<6}bowWZ<`Nlh zGXCUyQjPenyA(Mtbw~|?hE9Vc;?&7&@$}s*$PJf`XP&)c0uB1QtjRlH8bFQFGas5=p8OO1 zM5W~sX&!zO7s3|!C}xPVo7Vd9&6 z66Hd6+udYeA<0&exWuyrqo7iHvPc-6G{5qSd2$pbhNZ~z^_`;|)~>y=b8;Xe4Wq99 zWfvmPIRok2J60sze?tee(jAW2P$xa_ITvVY#W%rU4j3CJ2^Ha$o*)`Fx9TftCt24j z_6U-A+da!Vg)ECH`jog&r^s|5H*jI))2D0h%{$$?%o1h!nm>o8i+hmE-x>78TO7-J zntObEC;N>CPa(GM)IfSD9LxC(H{U#-PNUB?Ivt^8Q(?5J8C}{T6{nJ(;OSf9D^pG0 z#;Mly2ytFFsQqPzu}bnM%6?jfqWx=s< z86j{fYviHHY*a?D_blmK<|`q)JsDjegQnh$i07EDvss6O+(0*jW`JH9*d2c1S^Ib| zO00m7!xOdfzOfkTdFcDe3*Bqbt;Tv&jmW%T%blCPc^tm=^ zAY!;QPh*5`gmuaa>r_Jc?4mKSDgqsqBmpgt)16Rrs9}EHoj6_DXPL80>HQdxn8s>q zgx;f?j1Fua*|a>fad|j2u(4-(*9JdPmO4gKUT^1$M5y0((f0=nHD{b*%xt`9V(h{b zv*u6lFm$wZ`NNS_+m{!%uZlD_+%rn|ZERis9o3UAE8CY^%H^GsdQ7+C{KPVHEPYo`t=k49^R16^_)~_4G*52%cV9nr#+caYp)NF zTCY84_m}FMqTSLNJEZi+i&u|dw6Vu@`Zh7ylJc||=Kn0oY_D<-5MD=h``tomh?NSF zZ>bs?I-uI3$O*28i+YbL(oNj7N2Uo|7KoBkOSDD4(gB%HnD;r-p<%i>CQ&Yo>%I|A znpclYpIUw7w5LzmFttr8{(aqJb)Qx=q&N{IQY#PeM(rY!+4kzHD(RD5of3Nd3GaC=Kkp+K8wl9(?~NUl8p)3wkQ$Z*bQIUz1vBa zQxnbZO!AzP*E^BP6>%huN@D++*KF7YKN}x~pOvUFJ{U8*tq!}te(1D903&;Mu6v@p zC;jyPlX53boYZsjADA7XSqS0fcsIR!$!-@jZ>k{}2gnr5Hy;Y$h2Dl=>%SX(9?S5H z`D62X*od#L{u%Z{gZNs|0s0m$L+gboc`gv|r9I?b=!WlyFpFnFVishDAz`hS38Nxz zpgt61g$EzmTXd;L2thqYVEeshe&Wye82x;UHGG7`<$O#SW0z{G`u#?vSOhKd-D1AN zcl4}S(L-K-S@!$e+R!7#J}dfO@rv^2iSh?mjSda2S~WN{nnJRYx z?0Ztbe~Ira>kn7dA6VjhQh)F`-w#!OPwYU#E-c~>7;^zZyHUc{2_wHNQbW&na#@~2 zT}Bp|PGm+U3r{^&c#6ScF%PQV(Kr#^UpxVwMV#e?GleVAUoh}pjI`<#wyyX^p-$U32v}F1Gi3r-QdUn%O zm}L$ZME*C-5=DvF19efo^v;|_P3rKpw0PjPp8kf{K}yLpL9Ztm^mv2CpRo7fn+3w_ ze@7-X&EhL8%#-*EBo>75L*UC%9K~M~&K5{Sh<%h_mkQnJExZe6{Q$p1Z&L436a5{h zn0P1QpP;|g4AA68vy@T|#Symz|00*7&lZ1*I*Zq#v*$NFZ+L#gJb`#NwDGFihNE@hF}^FhTbNCK(MA1&Bo*-8BTBc>Tbm9@Kl`{DrrFe7~zW2Stw^tPC2s$4%qu=5Ez}{%J+t+xOOgO-g zah_iFbjm3tljA+}#7z?`(}wiQ3B12}#e-K}^`OAz!wR5h3Y3a*K89Fl5?#tVt2!3( z{kO>Xhz7o2GS6yx%bD|$dgCmt-Zl%H%o zor`Pni)glYEoGB>4*?TRp!3lBt||c zci5#5hK=?hjM3vJ(^Q>#>lpgcNzkc{9+S&rX>u-0pXVGuX-oUgpPen8^V1ze(yI8@ zQ^p;>M&poVEC}MlF<~Fxf<6F=niiI8Cr4V8@F$27iywJpN-kdK>B&(@&At`lhJyxf zW@r1;5H)ha(9j*uC>fVjS6r)DazP}MS8O+5@TVhg*s-=W#pPy;p=CpFcv;-zi7#u- zZ-^Q!&2sV^;X<^tyQfMLF+Bd5@9tg&Mk>5h(TY`l+5}&S*5|n!=*ZVlbKNoPlVYB!)hj zk_TKE<0HMLfhNJ`x@1*IK>to3rF&84o6G- z=Fo=J=@&-Fwhy$e%mjmdpUB2H1kk$SP@lK&oHG)w-uSXGIjqBxko@(VH(s|R?@y0+ zrl*#-MqABx^XGT_nZM%Uh3)8Z(GAkl!*w4P_OO9Vm+rJjx!qE3FjU56EdNxUC(%@I ztGBfDCL4UlT9e%p_trPi&n>o^Qw%3e=CAm|m3`eC2W0~;V0_~GUih3(!)Ftd+l7UL zcwFouK`{ijU|QIfICc(`cVb7F{>#F?ao3&!TgV3g@!yY~i@q7^ z8~_?fGOQf_Dz%4=E*fJ_%O9dFd6pyERWOmqe&8{*omr+Us6YjPfCumljGAp_Id1B!#Ko>+#_ZPiv}#&J{}JZw!_rhC z8n6M7%I3=QYLgW*M>dDr-EWUu4qWDHZ*jJbY#SKZHqz#7X?I=rvNs;Edpd^W@!<}S zJrMW4yvpFtk4%+y%kZCEwf*f(}!Pwv!_XmsS%T+fMPeT{=WhVjDH zI0Ad!dSOkOreRT{%2`xR!@v`A)pAY4#LssOIz^YUkYKR(#;- z9J-_!Mj{%^jT?$D6<;)r^LvRsfI}PLV1kVvJ0L3eG`1+7#%w{d!>b4V>BQn=Q}~Mc zTKui~DKghTyYLSBGd==3Lzfoko6D?*DwdVQM4RA}szsNWSLq-JU+J58bXcBNQN0@G zWGgXoEr-P_Z`WNAcBaOi` zQkD^_zRH5j7BWBW##&W=x%hdF;^aV*4d_D)1W>p&fLx6zGl+U(?4;3(;7Rs&-*`NC znjDQ^uxivd5EUyF(Es$C7(r)7S}wREdHs8 zYPz0S^+XpU*3|IAZ*d+sKwYMv>FNv3L`e_+s9P+Pl;!XtI?rn z6Uat!2mlUaDh@`~^Ckj&ws0;CLJN---&QNx-!HyLffe6l{)x>gHS@P+Jx*0MpmNuHiPr5a4WhVom&>0%Lzi^*&qKHo%=lVb-WBcj{cWghFNu- zu(Leyl`nk>nZ88A4Zzb&gbnC5^nJ1-3t6gfhPdl0yYQQ!qaws7a)SG(NAy?MjuS%$ zc9yNJ9`cH;Oa}t#l@aB=sjJQHZtH5|@6WaR{o%0R-+CFjBSB7=l=rkl&V)i)+2N40 zp-@J4Fx%Cg!ZdmaT}S-a)aZ0(^*R)bP8Z3^ZgRiYB%{ylj}E+){?-0F?)Yx{=l$?~ zREXjXZY+yQnMYaV4o8t>K;ry6?dXq12WIUlNd2j z_;jCIpIljSLjQ+&dq|0a3H6XXfzew5 zh526~eLIEeDF5Y5n2{=%>XWqyBzebf7=d@elOaRQjg3U z4fGD|-hM)}YwG&Z=+GBOPI>5#8~QW(>u!Ji(`>x0Uw8xC@uR?F5A{DKW2cRJztqsk zE#$H-Q#H7n*qk=hG@-QZskWiPS?}#iWt(H8o_cTG-#z6lo)sTTxNDuwbZl*3co)4(;}bV%*=aw7?ugV3 zx_*>(it-SqMuir%{q}XY-@dMWXn1(YKz^Y$Xk+o4#cz&Yb?r5K_FQxARg@1fmL5X8 z@IwI9qOL{6I6>?Zo=@6Zd+|eO%)mbU9w_$%{1EKJpT39WGJ1Lw+n@6oxY$Uh6p1Ix z;@HCHw|Si1chDE`FUXx$E}`nFL^SbT3(PmRt<3dO%k|%~9Ua-xiHT9{OUSK>HeBe* z6}Y_m6~Nl1!ZNBS$@Mx9LwbSJZ6wQq2kpuxlML9yiB_2aBMSq?^Km?g&c!cbn)Mz& zzX_iY(9bO9@7?hELHhaivd@2`xcnV`8EwTcEFEW3l>dIFrw_kSWN~%BjZZ;$;Tr(P zZ>zRhf)ip+MxZ`4zIzovr{nzu z5|`*TW`0?kS?`>)ik_>)2zBf2Xo|8cx0>YrQnK9fVRLzmRiru!Q| zZFAXtzSJPR`J1}PeI!2KD$gT8BmDNe@8TPlF@8LVe}V269aYOc_+S4eI(RugUP0y) zzSpR9)Yw=y7$e6zmgRx`vsMvxgj29P&l;i;N3*jIXR$4m!b9Fz${WgBJwcl{74uSD ze}wLWKDAeYO)rR+!0u(BgB?Men2}oHN6Lt{UQ|Mh>TQSU1M|!{a#yeM&xo2?7i)X8%0^@mE`f*1I!N^mu|$=o4Wd?x$9d! zyyI+7PaBXt>+Cyx@cP*t5$tF0eL>+$XdL7Y%HFzIS9LH|SO8u~NZ36ncmR+t}$ z6c%?QIWV?oG1cRY7Dm(Mc!LFdVd_y`flA7`PB$*NeT#_rHsccSL#5^?5#VP;3*{+F zRVYF6y;EQID(^mfDkx-i=}u46J1=vj$&oUrixT6&yk!LSlN-b}--36D^S%>U7V@Rq zc(8NuNZ}|H9b9g2U*4)__Kq)ZU0B^EvbSB70L1|<(iX8Xx0jmy6dM?%&_zRLb5~oY9?X(<~4~YzI3Xu2WQbM9G3Bl+8a$B z{yL@Y1^>A??O+{kdXaD*dBj~g%)IoKOw>+ck zqnF!B%5+{BpRdbtF)U6j2azf==V#k#_51HTd8&_BVV;d{NAS1cu>#0uw1a#tmdZ6- zGWiDNcPKW~&M`bw7a#6Zch}70l@Ub~KKs-y`c#z&TuZ{gBb~+%o!kHZxn=I-e>drOe>yj8RSlkgrOdT4L za@p!F{K}F5gl+`Ia3iC)OfKitdc2>DUNc+vo1QnV@g!VXt{I4IwiBGTdF*eJE+@)E z5t`K6ZX*^4u_v)LjXP%&MdAdN=Xw%nM+d4>&#htIGG?3ai@L53Ja+KHPmxoMx6^h2 zyPvOs7WGZnf85@LnEF1+5@f2DF19%)eIYOm6io8ix`joA+1UK>^htS_9CmyVYwx+n zRZ11S0;t3`1MoK}S}GuSddLyOwQy&tM?oO39_4b_@r^dtjqjnGS}d_(58U)P=Ah`m zAi63a0ABA%9SDi_L3d*vqUu;TED z8b%OJ&OA2bSzGid;kwRt?558P7JG|e%nqHHmqPlaj z5a*e!lTTJ?pTgL*(NLw2lV_hi9J*th?;s8+1naLSqnH>2qgDaHitSQ;{gob0|F2B6 zLr}QbeW8nifc%`;WFA##Y0I2t_cEjcpXD0v{My~Q-7xIY7Sme~dadra_yFTuj+?|b zrLNyse>1`T=7bxOhYeGrPtzI>KgWm4`84Ehv4V(LN%bB54_HD$bqqil9$Lk2E4T)- z%}~3-`HK$N(zcnUZ?Tnbg}>V=^;vy}X;&*zyS^F$OMkmz^V@hfoH zt>#+`&}NljGZ?FnL;jU^J}krSoj-$is1EgTv((}j*1}m+v)h>7=o)#g7 zSF2{~steO7UvZb`ybST$s5o44dZNDlp6NiUG}aItaie%d#QF0s_s4zxpM?xixFqC> zqQ`DE0?ojBc4ZToc)>9YwBH*JKIs0fA%oV%+c-5KcxA#?`Qjygwe2bSaq03H^{>f##cs6 zPy&L-0qwA%dwmlcv`~9aoNNqWCq;npmU;M&0%h}880EjC1`w;`CYU8a438DJa;@w<%_@q@Bu&Q+1AZ5?T$FF6||ZpM$JC zcW)&A@poVj*KfX0BqPA2;r&i}`h2jtOW2H9xh*~M!3`p2{@KC2l;QQq`nhhQi!yb# z4Owxi#fih-eKoZ$1sz`)0=ht&QC@Pxv7?MMbDb!C+^at5YTq%GQ*~ti+4zAHD;q(d z4}{+98FOz+!ouR{&M<(=tTgqvpJU035ZA?-n9JA)7V7E})h&#s<_R%pn`77_z_54|hCE(_^_QGg=D53!t7laLR3Y}$Y-5_7VO zI*ZD~YZLt>V=VC-Bh{puS@xP@q~B-K1CynWt-F#ZSv;|n^QD027%+14zv);syO-(D zSazdP&YF=Ec8L1HS=-RFAh23`Od_=^?VMb(K2jqOsGgxxc9n?xBU9; zeluG5N|?= zeWG751XW^ae4Emdb10xVqeu+)EqNTqktBjdgts>iK>ddD^nlL)7Nv(yb;x zklo8L0r%R?_=eI}s_PRTrJ+=IYu!3Wgn!=^Fey-Lj&}kyBk= zt0rDd80CEVZ9Fq zu3Mi0`zjE2nwoIT-8q}IpfYPTX=cAK_ExVp!?^d@hNlq0A;(s{?E`KYtbNKt80D(D zFs0yPe?+&IGbto(I~EPe-}Jq|#9l8xo#cJ6GF&gMLrzq)Epk9As73+Ok3gdze z_XwKN4I6(swUlxVJyvTkH%hBM(vi{dJq}MZ$CIF_&OPA%-mAb^$1_3z5N;c!7@H`s zs+q?-Dhr0qu?+JivXq&`?1?ma2PGIg%q^O#=bu)?aCLC2yo1e!AmIBT#j@-$V?qUz zmyD)QbPbPl`fkEe~x&5FF8U=>X z9WFsSg#)qhg$_lIV>YTcNMoEkhYo$S1iu~mqzZ?1iBZmG;-$4Qi4t9g`5R2sRLK?? zaG^rcm5PhSi$gC-vvFag5__f1~>$;ICUKfvJ& zJQZv(h}zJvH)hJX@yo-FVKVnb_}L~OiNkXPEI$t);QE7vhz<)KVxo{>di^hkcMqM6 z8C2}hQV{1EDlUcV4R~v0@%c|){c8r4g&WEKYH^R8oU9!cBkQL37HAt3IibSPqd)rR z*sn0c2(Bt~yM&Xbkw8y7dFAaFT^?fDv5_g4x0r@iJtT35-f&*4=jz&&k zp>!{oMIRJDMR1V^pDoA_*MV<=<|TG~mK56#E8A{q>Vcr$La83|jK5^5KoIK5ilK4* z)y^>aI9jbRF3ncJinVknp_V#=4vl@$w~DzK4}|c+>Ug^8p*rqAc&BW& z#~4W=Hl#vh+0c)=%@cn_so1v>j4oKDx5JF9|` zF@nvuG%`(d!T;qd#UjgW?H#Ey#xM?YqGfuly5{;-={<7_2Rm2qgCR++b?QR=BNS>-oW24$2(EhpCi@h(x{eT&80?p*8CSqyGdD4!Z#^N zp@i9bR;B_DcgUePb_$y}hVeL6DD+5Y-fB9?2f_P$>%o{YKE0hTHFnszTW9nz(InMj zTyA8v^$Fbrj?Cg0ym&P%*vfGZeU>OIXgQ8KMmcI^{F~xoB`RiMWotDHrupLxr?VDT z25}U{t|Z(~#M|hDD`j5viytOgo68XX&#-3O zk~8}cM<3gX2QNoV*QRD#e{D*TDT~`_dlHiPppmmTIX%}QiT;^+vR$}W#sA?Wem0Bd z{gDv=9!*th&o<}zb59=(bLofa5(p~luISbH0n{)ed3@)~326rsAFtLFdSl}0{=u8n zgTv{rtIflbF<_E4oSM&oyi4b9D=n9Y5nm%PtZb(6#}QzzNtey@Xi3sTT=`Qs6Z8q|(G= zhqyWDx%jbdT&6j?2Mg!txi~;#b_|VPw6!r?X%-@@m5$4h=w(22FDQn!vI913lf+zR zf|T{!lu!ONXLw?pC7`~pH=G;oBe$`^)<93{~x6V|nUen{<{`T6Nk|d&_ zP8XI#i!ME>r`)|oHf$q3>88p6HCSAfb)#*@g-KJ}JtAGt{9ci=-l||=Znw;AvwFu| zR!BYjYglSNsrL~N8g@HwQ?Ii&ki8smwmyyHo{;{%C12^3zQ3kG+lKXOoCPK^S8qi`(Jy72?iJ**nwjXz9%3X)v2Zt6pcOIge>1wEBzK0F_(MYz87avp6r+BuLR~d5KX<23Z`>pv!*)+ zG9p|1n=iao7)_EHqTFrm4{yBjKihiVd_%dSfyr9c6B!i^8Ng*(^~P5NCHc(nDpI}J zlq5Z}1_RSu3CSge6B^kGrf}O!;^KOF{Y*?;v1zLJqzLaAH%BNrBk2M1-NB;p0UvjYm&Hr@i zh8Y;WC6&N-Lj zivODpAAj8y|ECAv7xdxx!eMN6F8}AXdxCv~VGrd{;bGV)`=>8ymKAfnanm>))^P#K zyHpB!y2hB545tz0pC&>Kk@QL1(8xm5^jGDk#B$VNTC9mz=7)x`f2RV494?C4Z3}DA z?a@mTKZ4e`*=-Hx$zW1+>nB4}YmAuKT)Kn-g#$D{8$K?7bT0=pR$lG7yTntWdZ}Zd0{W}VWY=AEV4h}@|F2Rh-S8X? zsoQAKz0A)qWC2#*R)_5#Hhn=}8&+xa;f+bpUd9`8gMI~+sgbHEe_jiQv!$n2vjgo-mgHxkm_spE%K zlV%E>=DJ%27b1RNKhd!p?>!A!^>UzZ%WqyrZ*}}UkmP-9=S)ttJu}1c{CF96Xg|Kx z3C;&*30!x8$DrPWuOy4qkWn4i8-TE#l#3h&C~ymfUoh7OXJ;M5kcS8|ejZhXEtLHSk@m=eLr|@bB;t z%7zks^`X81q@oBYS>-`FLe~ulJ;9tTIm*A~rXmF4`UgQj>rxhfLn<-KMV$aK@MK*3}Z$LU}Z zxskHsKr7H{D;5U1K>ibE|G&MaR8x{0{1ldv%FiJv3USLn4fV6yO0)GXw$7f#TOIJ& z6IO|q(gFpVV5BC^M$R-oa@W(-m!Fv8hu_r{mxPT@T;58WivB+F-jP|!U>Zq z!fR~x{h_wF|HEGPt8bJ$k;=ldk_&P@V{m&wu{9`9*?(5$%*MF#GL(bH)%{6E#aa5b z39L%#?!66ZNZ;~qi(NcPIF5mm;zxx!ogk!Sq9${)vl7MaF=mC{tQ_jqx*Lrzu_-|U zK#r>|VrXPr5&gv&1@7(`{H#oK0m8}EbOCbvKsPb(&mJ?1M~NKuGJCo^9C#-C1BN~? zMLwbP5!J*#GnuT&Fgb2fXZW%9m?xU4lq@HWOSW0PWP={by&=9zo79Hn0`x7PL`{^X zu4Dib6#tU81;}ed)dE!!sV#2QUzw%mNo?(UP%sbA9jxeIC~8QLVy3da3&*}0@|CRcf6lXl?jWu_L&CZ)1oiE<`cX@Ci-wPEr{V{(8stG z0Y`EyNEHb|yg2MCPt5ea&d+fM4Rn@5ZZn3=GG(%H4L@wLf92knf=>^=7f^sD&%5(t zQ=}8g{{RKo{Cm+EB0-IybW#f)0VT>lP{DJ*l$`0umLQ+FC0ZHKIgI@TWXD84}_0gCsg8nk5S;mb?pl;>tWEYDpi; z&kX5{Xz!e(g{paOk~65W?MlI#${~mm^NZZvK>YC-9r|Zj^t~(GPixi9K7YS7{Y+X%%t@<=SSN#@K3O~>+bzUOEt}~?_G#$pTP$61XS;YnpIOv!H$=ac9Eu+sXyd^k&)to2z_s%D=1R$X9Yy521t`{59mR`hq+H}5)Bt#uZesP;4_jGmk))UY zIu8$I!S&d{(6gX~#26GJu#hSB0Ilzqzjh7R+j7AW7gX#N@MO8@;>6k1WE~OHi3*$f z>vIL)+bA{2FN+VGvk;ULN3^BU=H{*CyNs> z1LvVSUTn1y1Ph{lGjQ21Qfd=9-)HAx`QwyZq?PX^{Ws2thn5H{7RmE51ifL-Iw(J< zix=GK#ojmjyolCTa44z87D0@Rn!bm44PBOzg(!6v!nY4Cf_|jVXX2-+d*ET+LZJjKU7^M*V934eeU>N3U&~72+^=n5tht*TKe6Q>XF*W(^fUBYk@s zsjr*sGOone{&{^YW?|L*iDLrEpaU`m`1dQ@*La{5{*HgRp~AeUdJjJ79&QHb@lRWo zbe>Yi=(+;k4Z7QbCSg;##6LU-(`Q(lfhZ)?yhHYYJ3*he_lsi(i%OZwLpfPYPmz|T zW_+e{4=}8LHHcJF4)K9-mu71bz+DY>yXJH4nB}R#S{=^u{Ix>m65)CwBs|pN zyJ*t|0|)s+=B|IR`;EuA^f``bTf>(PV#SuSkuhh0~)Fc`Y zNEQosqhRaAG+Gm4I`Lsy|3u`Ea_6#jZQ|G3w0G)p7wcZb%Oq%jRj=pwf!|2M9d6XY zJuo}@K}h)5_!ZEl4q6S*PoZw>8bv_D^KD;UH2Z_;e82)wCaf0)?=sftqFLnYKs?X* z=>10-UwNl%)>d&|kuj3eA8e?$f+Ex$$%zmg7_LxpvM`%`Vm8q(aarU_^z|p>FZmr< z4uj*aWwJBGJHCeBNtWKC@!w8r8&tNLco1>8)B`9aI+LRTg8EC%Q1BI#DXP&}{{w8wiaiQwgfW(427p$j3YCK))Qjx%5+Ml$7u| za+EK2x>~(Zu|{t7mgW1N1^V4`e>q46Hgx<#Q*|>QK8Y%=tm}Svtve&LM$a1vk@cr3qa1I_uHVk2wPmf#g1{>H4dwrr!}R5+nL7uMQ=C^*BiB zS2?O7_RpB_ognAcs4FAPvG>Mh?U}4EssFNqN@S8rq947+H;fUlq^b{LJiB(m)Ot9D z)VRf_FZWqSN@tT(uW_IXv#H?;a+1UED?goZxW#eD@aX(+=VJ+;Zb( z)(bypkj>50bX#s0eEdN*8`oTw#B%q}avOG2XAgXpr|U|u*3ih6eC8Jyh^3K9217RA zQk784zg{z=C+wAX^-!&AHoruAo}0EGtg3j+5X}`?x}ZLsY3XW;d~#RtVMDoC5YDyH ztOCqTM&UBitEH$k%7wLOqtzOR_3PF3*wkz=t1ZEM4Y>^%u-F3E3!>>O$%LA z!;x}#-+b-gGe|;5D0m)C`mn`t?UrBV%+!jTm-tnohqQS*=fg4=!_Tt;Z>~E-omM=2 zla#K>HQZg)VRkI{&cMp-lw%i=MKA}~*#grFea#its<%G#+^+TplB!%~RRJ9Rbu)(a z>P?SI3&d9+?aGEwu35W#(~?G~f$ef(btc;i1#K9Ool-IzeCO&bCl2N7`I^{yO_#28 zC(vvV(C*T6zf^AVr(>edDf3P&$xBDQotb8+OpEptEYUNuuZ(5m6C|DQ{r8j$g+omaZH!a_8O4wu}OoMXBNG!?e<=9U4%5Z)wv>*=>H~lUw+|^tcnad*dxs&=VXJ%Iqq5a*UVyxcR;tLjMYZu*DC!iNa! zwW@&4wlcu=Ic{#sy87!u2Ys_wiW0Nx2gmzan=g8zHP2Cwy)F}TMg347N~!|`D$l}Q zyNIvUtWlSqK&1cVSjN3qSE%P=F9#n5d31!z^}*9*cLc{dOiso4GyrwkCGo9sI2cyggk>K?w0Kx#E237S+mjO?g<{Y%S+?KnHAHc@5Yxe6?37JNk6zTy4BP zmb8ejP!5p4H9}H#0yqWpXn1gS;w3KF8gQ8HzC;y~GH?yRGtgJIQPYEdvYNUK0Nd*9hbG;-uG-hXzX7HkT*pz9D)NZ%?11#j-DkNr9r+0hTBcqv7@HpLefzxJ%UOCp zF$WKUO})pfMQycP;OyP0>q<+V9uf-m{wD zQ96PE25&za_iN0lkT`8~ zY`vi#)W^x}^1UU*x>G;VGTC* z_Vn%oNg&^{vB`SJjZSuNrYWa& zPGFbYD6-E$U2QR@sVCEDI3P7M|KF>vvt{+EW;M~Be;udw72xyke)8Fqo$f~y7V;4g zup_RnmL~qWI9efPL{{8vg{PgmQut^Ewh_l(5N(BGT_{H-8-K2wS#T65!xW(s#9laU z1-FsFoK)b1A<%ukrw{ zr;xqXXHpg^vNdMX{x`EdbkvE4VdT)uNk1s{sQ6S=KcnLeQUA}^k(n2levZZ-+8Nfw zd}0?e-!#oVbr*H*Naa0t7kTZl%{_M)eeEc4v9=4uVGQSXqzk6?wgmSCx?6B|!Nqp| z-qt0_-y%#e#wiP>3(H|f=O(2K&0%`eF@gUCwUkSwk!$jjH;`h1=7G3dltU3w;lR#| zCueH&9yMoz=O%_Xx^z*>mE?K|uZv}NPtTKl_CU{zV<-E0kI#$YsV$NJnEvVnclHGT z>X>(SzkN%hcCqpS`&oqnqiqbVizBsdDp+^li+AYW3xwgw&(mNh_89>7BFG<(cp~zm z`1S{}(C5XGKPdL7@Wt{iD|X-HjOHySwva2Sw0%jz&zCn>5Q0Bm;UMu9l|NbGaPbwM zKXLY;@fDXpb+!=h)t7qV`vsJ|CywDD@)g;9BNMW0C{;O~;c)U5wkM(Xpz;;FC#Cif z_zKw*?@+M&V%`(#aJ>2A-V=O%)cImxF-JIk=wlgvef<97@Bf?NDD1_^JD6Z!;+4ri zD|e6LmC8ROci-X+#Xlw&fMLnsJH~K3`2pK24QB;%De^ww^MTzv<8YJtf!;fPebf1Y z-#be%C+3P0Fh+1Y`T-L#k$VgHfCv~jxLy7D88Eqf`}~0Q-6wD-@RI9_`W+c?ko$`9 z#qli-HTUI8_$>}~`;WNx#qiz#eJBtbA|_faG$JX9ZC1r9)z~z~X_Y)|+C?kBJAv%l zN=qd(zR(awD`PO`+`#K6w>t^jP*6omGfCZ0QAJ)kiQQ0AMP@U}-B43S0bC4zh_fZc znGkQNwF9u82Y>CbP)g zL`x?zxd_`tTrEm7DVk2YIpNN%)sjlZtmYnvX9a_;P&rrO`jc&rtchGtcAE8%eJRhW zdPg*V@#v|)_wSm5N-L*yagIegW@O;vn2Ynl&q-~{Ile)srdE>xT#c#2F0g%KQn=K1B5uRV?r)Xgm{r-MlRi$IFe&ZF723jlVeUU zefc<)V^S_H`TYAMRc-_M#KmKHE|r;t#$#MAjhV#zW6*X*`h>`1bb?^A~9l>ku2hn$;K;>n&nrgGqsHG&1TNS%iW6LS0-SV(&7k!P) zX+lR5ef8vNLq`^UEzM~}M?y_i)X+}p%O*Qbeqa&xL7U%R&N4$Mire&sm zg;8`_af|q}l7G+^4)Wd!u+eV{v_>usdUwi(BKp$pB7!31nMG zMteo5`ji)M;k82$v_Nw$92;!ZGUjzjt@-D+K2?HW|7vUF60GYh2@JmO5Fx~|@ zMHE0P?~0s~QXrOhNlvi^kjuL!rxXB$@XpsS!T^$am+P0L0@1vS^@}xtY~I!SrK`Z7 z-i13w96&nn%AJx{Af9*WPO%4&&%1V~^ce{Dmd9U&2qbwc<1dK?qP!LH7b^f+-m3UZ zXMu2U1wBO!9I|I=yjly3*omL|8s(bMWIQtMUhN~&LWgJ#(Di}offZMNyZ965~Q z@AkvZLdn5(wf9rBxpAXIFYC6MolMEE3OkZ*)7H+Cg%cs~{kGdjq)xCDnWOzI!%%pI zxYs#hVp{Z?>^Y4)^T+iy%os5;crQvaHJWP@FB3jATd0 zyv>Yw-~_Z@#*Mc(2J^A_$Q<2rlbw%!xmXto7MWch)}vP^`$T!r z+xYM^j#q7R*v_|Q41*6Yqw&=T;MlQIWe=K2?I>sTng30xhaLA09)L?2_&_}=WfVZO zc>s+jM@DRQh0s5)i5FkQvt=#Aw?{md<%YWES~PMlo{ucf!J`r+imG?BJ5&J#6zOj4TD+=v#u}Fw zzRa7w==A-5Zgi2mPH)%++;4P=*S7dA>zwA1S3J(`kKxB;?NhSjlKm-Ma!kUC*#Ih8 zx9R_{u24tpZk}GO_;>yj%PE0!AB}cx?68=u*?v}V?#@yRZHDa7X6t3tpl(5fOa7`? z`vU_RCR^fF*Sg{NQD@~|uPmID8|HNU;mcB^+pNfFM8CVpV+o0VNBK{l&6#eMlYL#D z|shpgY|yFw^!da=1fq+WF5H{HJHJHQdZJJIBa-YVm#` z9hh3~usus}<=XCb`m5uLmdAgZ>!8YIO$$)hIMdNMgJh9SGQ%B~?M8oI<&xAm^ZS27 zjw^bU8FZ7&@kwC4%(~t2j#Lj%MU&K1^o)SE1KP>uOweQp8DSQk`~Z zgx|1mfSUzm_d?L09^Y{m2d9OfKaVDsZACol=S-YWQjOK<%E06VKNYgg#IjDD4Vnp> zrfd8cZ94haG8x?d1!NNuZvD@x=m&i2&#;zHG(zhNA1b5 z^3_{>@h(YJoMH)JQWpR{K|HHa$GQIDjC4dCm=&6ZHnu*t9;l1jZb=9r20%J99T^Ae z;ZNmioX8}YC0|=L zIt#&HkWXX`429_6jQ!X4jIvC^;PrjVJJ81e!cv5?98(yABt0h>gnYr%nSz-tY7pSh z6N+`~6D+c9Vx!K{R?jn#zvVP z;I4j`mB~n`>}BBu3)ItS8V0wj>*QMEmGs4Ac`|@B9X} z@D;1xp8SB1nd{eVz>8?w^80-hj<@B>Mrkl^vl!`?dQK={Lj zS2a$kv6zB~0tfc+N$`7YSBQFjbgn386cVU7^!IF|86Q%UvcOB$FP4E1{RdP%HK0gHZv*ON&XCnEy6u%!_{*UbXHWA&5$+)O`4f* z8)c4GPULI}_DP zxXth=GgEJ30}tAz{t3|r)bTp0`uJ`t)x+b-Uzpe3U%=rk*`?J#7uCkPAL<6x8X<#s z4`Vrre#53YQ)P1={R?Ck}cZePlA45L6+5q!>Yy6e5=@pqMKh98X z_dV@@A3=J4`9c0j0w@|0Vh2*UbWW)+ftVOj!=S5odG8I%edn6EeBEV0h>h2^-VV+B zcm0o`ce|Qdyj47lEA?NgXl*)I41~~75Mzi359)KBSsYor)umn-DJBBNpxsH*StD3q z(fp-LhRCaRSOQAcOcLt@^2j3D$y&&d7tTEO%NTsNhQlEn?twVD4o~2VhDfQMZ3ZO``TgL!jh-AUW+KAt@mfz}piB!Ht~+ z5mP_DU&EV_@l&2X@Bjo{PIek|2_Ok^E~5fbC}z_lx1LgxVOWXdaP{;~X@vRA@=G5I z#*#@9UnxbIj44IBGE4f2g78m6aUaA99z+6A^PtHn#ke5z3W|&U$ae19Dyzx7aQN@q zTC45WVK44IU6qVqnX_Q#>)Hy7ryF>mGy~;L!Z%p9Y(Cdfy5c5Y5y|HG8+zLNf$xB3TOgYS5G}7Mq#mJX}cd#4iH?CAeT(3OdC=p;_yr?FtUMy;BseHYn$$US;iJqK zz3a@!bk<|r+!i&oVKEqWR>3o(xSq5ZW7&&&rUKM0OcgBJ_^_@nxMmuZTO%U9u#&sW z)cyc8b=Qu2E2mF6OdlM^$B?nsgR$1>zjaEtvXd0N&aP;{gJt3;$Fl~?vqsLk{;+T+ z%4H1$Il~&gs#%Q}ERTk9XJtI87!JYpXJ|ahD4daN50<$ZFc3p5BDEE>xZbl!cjN~0 zh!y#REji%slxALa`*1u-9E@2o?#y=vbk+ydTbz&_R4#XB$aE)oJSjHYqhRO(usg#D zl!1@BV51Hs*VKJ>obBmlLk4{M2hMKu?M+=*l@>{aHq9b>T^suV}9aJMxrMF ztN?dW2xUJLX;r{e8NiGjL|?quPg*12w4Gf;_gQJ#aA}#&X~nn@^BLD~(YR3anbvRR zxRCRi+-bRdLZ}5y)P+85V$4mtuXVO8?lkH>^<1_fu3@#r^Xqi1$e6%obiRJ)c6}SP zP$~nqb7j3o2j=A68K4K(1lSaJ~1nw-p1{US>9kpsoC*74&fo~nWsn@W2 z^^xt&r9Ez$eql>__$Z8c_e(@Davf~vac-WlI&8=86>le-T4v{}gJsU!!Xp(5j0lYG{W;(@K{JCc$m%75n`e86dUC%ectuVE7N2 zq!*bTsu*{i;vLkL@2mWZh%fqWeb61&0$}z7h3L&z2hm|7sXctuuiu@Hbmtz{zm}Q6)ft^vz3=R+=s`}j3@9N z?$s$}+|L6#^J{*qbHC>?p5PDsiKqB0yPUa*>*0F29M{|Ras6C>SKx|Vi7O2!Eu8JK zy{hDcb_m%thMO<6R&!K1nX`PCOV4S7DT}^dnh-pF~@HK(>GV9bX}F=5$=UJ z8YIZJ9K>wBt=GGf^iuapubc%JY`0=)r|mc9_&2jS!ufPqGuSwnb5W#OG+*%yZK&2C ztW@*YG?fn&chxeJWG<7=L`+3j*^ZCCspYgcw`+4r=xqsL9x~}Je!C-LamvMxlEuo_* zjQK&EfOxbaJC}Omy2MX>a1KO4JbDFGrHp{XF+6~aolS!uiI8H00RlU>20I)Dk2gTT zQ3ZJ505n-@WRAXDCtc*B75#%66X=A5a)s z!EHk>{zdR)LAL)DOD&8XH!()zR*5<-0ly*Hnm2jMB)l5}wowB_Z68ymEo&8S}A^qG3Z>6Fs zhXp>LQrZ@@Vr6kl;!t%i`YygCVaW9AuH4z>R=T~RVq*fwgS~A@+Ht;CWe6lBr|-4| z3C*j{R#>B5Qw3%(D$-Z_Wrka5Px3EnGCmnPQ5Tw~`zPKUx+0tAuX)0umDW{!4L@P` zSmjzM+&M18Lt(O`dT!{xf=e4&;+3V$5lKs<{qDU-U;<7lh@7$G2d!)e>I92TC$LEV z$$OvQv^XTc_R4>qe{I)A>XDX}tNilqPRx1pd4qW5IP`NaKqBA>gkW^$=$EKlc3Vbl za>F{=XN*~A%m#@lE{SCmT`e$TK!j1?6ybFy(dZ;O}|) zCHwo6Fal6-%pGTU^d*GRNf=omJ-^eU^A+FjEJhy4GMbSh;tS1=8X&iQ#bB|RuZm;H4J<0o<6Ffo496`ZijN2&1ky=FG>$?IqEP3D13-IzIMtHIz&w(V(HxTIjV{$nF%sS6nSXm51=B6=e<6$e+w)fB$8ntF3FvXS1Z_@pKahWNB$tfA(j<#NBaZC1t| zmiKVNG>P~ma*f8_9Jy0eX_XDZ^3|BWFAf9*zO>?lwI*A*Rf*32dqX)xv&k==%}j4) z^sfILsXGwC{beF#pT&{6CZt17#S{PhO!8jRiron}JVkHbZZQ_^xfVAe&qsfjp?LDn zr!Vv<)z_caOUINo9@DBiFjD%uLREYh;nU$@p(`&p7TOGMogU;b)6B0Rp&xc-zquV% zVzm9qROag^w` z+z)~7t*!Lj&c0pm%$~lrjn(c0Sawc`jcjZja5zc@EC-5Csx?_)|i-PL!_yxb}4Y%HpY>>j0tI~0YB93*!~UjXr_gOJ7lx?u6rT*l#^**ykz z#SU3(ZfA#oZ}I;Lw*gjSFp#HMGGYu=G*~p^xI2Gy1`D|05fNW(Ks!=HXmqq4i5^Cw z`e9Z9!}$|1YQz<2EC4If-*y36^%@ElO_-nCPLek|ghoPB0{tT}Rsc7@#U@Lg|Fd;6 zh@tX^=S>&A{rut#B@-}AwR>e2! z6{SC&OZ!~A`C|1&n{%^i(Hzci-{GEa_Yxztd-4@`J^TE;(Tmg6QDoHm&KAc6l|hX( z>HN_Th3PkRt-El<9h+<(q`e7p*wC?`9N8T7@m#Mk{b}S@8>ffa4Ps%1XQqxTzdtRL z;j?UTiXHXtVC?{Gpl{WA$vMR3DUOG|djE04^mJcHx~`YJL=9-*uUQiyB!nUHtion2e65pCaesEYq+X9w<@5ABsGXY`<1KJAh&cl%Z| zy}j87#_?~I#pa0-4|jv^h%*paGH^D4gbn~RZ{6xZ4X6|>FHlTGvsia1v@tYjW0>|G zL?q}k?fHAtHD#31CjvGD!bA5 zwr&D&{em-^Mx55g=z@SHjParfU|ZqV0ynS)ID^gNT#!0^NIE{`?NDSV4>%TLJCtbJ z;6tgzQz@x_jqR~JI@c}JjFi*{%Hm23EAyxLP`;f;D2-Xi=t+--n$Rr)%UP(ojFpgXXP!Cyv{F-GeN*6Eq6vPpfY?2hnZ|GB+1cG!2@yPQEw+iFgU@j` ziigH;XyC5rclp+&n%j>j7}g3kDZTf0nGnNL?3@d$_7x+ZsLQq4yyzo7lGu-RJL8e# zdg7?sMt+I$?56}{D+k$jVJDu9wKFHHK5jQ%dn$-JlrgleO|bUnZtpC~dga&`ZyqR? z+`o+2Ss0e-Mrs_FpkJ{_RPW`qP0mP8*E$wvDewFE1U>92zZ*8mDM`1!n|Ry$=&Gis z5nY}KlSR@~NmskiIVTxELzV4RJiEL~yE&-os@-lC&M!Rm<@Pz8F9g-76>W>8aE9&( z9`G)a0s&w^oaw_Er9W}w9I=4LVm>~A1k_o~M{dD<=rk>+1%=VHX$#xOG$Mnga}kLe zU(Y3w3E!UzRnxSH1T7z|HjzXHCi4u_2f6@Lpi`j5dNl)Me{wa1v%ed8U|C4D<`%h# zf4!*OBio)$Lp;!e57K&2xJxen%uO0H$rocVb1F z=8LmauI2F4Vn;M}tfikS)-}$CXE`(`R>$w#I$>JlP#B@Bp&ePOkBeWRk7A(+`k)Uuakd9f+ zv>9mi`j%uLGM(U$wzgbaf);uMnMkG3DBJ01JoG1wKqaA_pow_T2VkMt#etE3Ht=8a z_Tmj8{8qK&gomik;HxG^t6i_j$y^?Lnbp{AxcmC3mY=}-O9xcvB*fV6JR7ko49oE5 zxBvM5;YaqXIfu>>rEZgDD`0?!59hYdTd1dHpZn&nc-DKN(eTwjj$4BvQOj_b^zufKQ` zp7sjZR92h2ID0-$+x<(@=(YMsID3+i8C6Weqq1i%nCz zjq_OLB5xz1I}*m+epwMFY`=%9`8?l@0F)6F=oVlSbrxeZ8c|n^Au_GsMQb=bZoY}h zILrAE%@if2xcKZ2@wBgz+}wA`rogHf&4#O4a9p^ z(6;B4k3_0W*|emlJ(*xrdH3o;*-^-PxaQaR6ErF49-;&x2ln+zq4a!q3uDB;KVWi& zFQNW)-zLP(REv^blzqpp&eq<&=r?x5kR^Tn ze4hMt$EIJqbJYb`Cs+S0ZJ}K*57(hsbM^XP)VLSZrPJHG>mymNKTEcyDYWF}Cq0eO zhf~_CMPH8Wuz24;7Q?U8J6`pX&7a%ce9~Uw!0z3}7g9NV#Au!Dp1n7FB$I5^^eJ*KfxyH)RHBHp{eicr&~irn27L zA}5Wx6V7A-D&Iy@Y4NWdUJ9eQ?8k634^v0cF}IX z6=&we^tZh$4te)Z?Bm*@&yv(GZ9S>dnljty`Z{}FQ|C$WxO8Rehrp9jx40pcvD?)^NR+e@9HPRMgv`^6Clu z0Rdk8w3x>%{jl}&gg6zMbkVhEY>CNrg?gR0tlsb?sL+u2%agqWdV@1wTd{eHZE-M~ zaS`>K?JORP@Z;pQpbi-*vU6Qk8aA`cl^Z4;ZLL1&K4bbI<-gYH$n(654wh33A+ zR{m-UziA=6{FC9@RHgJ>Qx=b?LA*5d`9i>C@L>q<-XC|N5>+Y)aRiVidl~S za@8}lr?hfeDV@!DY)U?JJg7)yw?bESjqKs=t4$m@nk)VKpJtz*b030z@yG@GEASjK zQp5z;GP$8=7hT3aIz=mdfIsx~>))Yfe)75Nsn@$}Bdl^mV8If?G(oif3< ze$L(a<(}%WLPt*S{!1@5dk_ob5j-Fs!SVI(v18)lpCNEhF(gX;w;yHw;8_}rl(vFp zteWBZ`dS+fNoJ{q4I{wJ0Wr|W2&>PCEWVdRP)f(k!&Ry_pCyxWtZlkfm74;LejtZs zxq?+$6Z#j8_Cy*5+&+14@3aTj@*IEA?TiMML-$gWRkBc*i;fp4xY%&QKgDGd4cO&G$aY;skclE#$B;I8|?!dpX)tK*Gov& zcvMO9CZNV||Ey#8p=)4Sltg5Mj*S=Dehq!^_WpO95j=18DrK!Q zS`P2}B4gL-7rXg3&vYAdyUqCI>;IzI;AQgCCVglBd1aAvmxR}3#m#JgA?Oy8SG`(u zZN$U#wL=C9PW2vCmzLS#`&=7*FSpMa2jtH78BeyrV3hZ*M_uZ68HU10gT+o1=M%fU N>i-Ak^d1HP005RYhx7md diff --git a/doc/SourceCodePro-Semibold.woff b/doc/SourceCodePro-Semibold.woff deleted file mode 100644 index ca972a11dc428209dd66212e382b884f168e83f7..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 55360 zcmaI-W0WPo*FFxPwr$(ywC!ozHl}UcHl}Ucwr#toZR_8k@9%#3tS4(-bxu-yr&5*8 zRLWIOObh@7_$jLb0F<8}pry|LYX85Akf4$%05DMdbB^mjL}De?i6}{m|Fm5I0H}%p z0HHeQe#@S?h^QC<(AxS#ll_B525Uw{ad|l<0H94B003nN03aX8I*^9Ml~jZPfUY_713IL!u z006woD#fplcD9aA06>}aPhW;VWZFRzpk;OrCO^Dzi$8pV{{boHEzxb=NZ(jrU*94D~pSu|XC;|`xRsit-YCi?~XY@bM5C8%I`mYaD zXtM}?eG`5CGvIkx*lolNrkK7k1t7}tso}B7{>i~X;KN!LMhQk{0sn%?M4GU#slkUU zejE^xdpNN^Q1Ia~LZ)E|X(hiTU=S9-+8&Jc&n4W}r&e?%5*08ZZfyLCi9#eyG9Hc^ z(b*~lR~ymTQbDMaaTCChk-W8?P$ajMF{#i5BNZ=*S$-!H|D%4xjF$)30d<}WPBQp~ z1vW<=w*1}r-NB3hD|JD%FZP7@gjes{J?FlimM?KD$QNBt1fJCorLz_%qZb~(6ztbx zFVQM!vVI_!*itbndYv3!VM7*#i9FEK#kHTq>ahA0lT>cD&1I!)m|N84ik(a(5uBefNilZ%PK>#&=z3l{`l9_Iyf|4~Zx38CK;o0k>VH7&B=ECu^66-Izjw z>-Q8^9s%!XIL$eA;XF`J6$v|?>YG$a#ZpgTnRXM&qFn1ub>PJ$ zob3RC*r8Pm|1v_@^w&+<>34jACMeF;Tj9^RW@Z(Jsj2CuTW%Tv;h3_2-zD8VeCL~d zLw{284#|U~?*m(2vWr5o%RXq1e4oNK<9yaW8bv%(DG*1<$`w&zlURE`tsB zr}xpij|J?WHTc$H-gTNPDjbtZpr@<6zu@nJkrTd%D1^3h~3lLyQ&g zO(k9z=5qT#gJFLs5323B8`AGH#9-ip(gP6vUX7C)#wa0%oC()`7dcQ`YZf-XZHd2E zAjMX!EKSJ-;iTo|gFKCEpAN{?)y^GPU7l6XmESujdS=(3S-$)`5WRj3ikKqH3Q}ed zQ=cyqC$BfNE#PbCU!eoLa-CE|#*LG^l3&EA@xb+QWnP07385vJBMUqO4Ll?FoxPEr zgRI394jSY%FAb=I^oJn?cZ4;%y!_C;1Yk&h0-$+_0Z0M;lmYpaA^Vj636M*kE@4Ek zq^XtYqflv-a4@p1^57krMq$b-r09vFUvmR zra`0i;)mcqWw+0^I3!eQ0>QVZv~3FRdqk%}T$dF|nob_yIr9Dyp;bi4;vVX1LViXF z+;j`XWk@P!04t`?hyG9Hcn>mWpRr<$s*N!9u%1+^lTukEZ}%IRb6>SGu3J8WBt(!~Tjiz>Ngh4$aJ zSmn~iQjL7?E^B1(hq<^Z1druv(b^$BNajJ9d14v`oeE>6mbmso+!tA1q7Bt+ix(E~Y$a(8Q|`yajzzDl<3?z8Qkum__5GF9s?HTLOQYDP z(RJjS3svS;-A(J7RyMWG>fBXZ%RXjd4QUGw?O6uXQq#@T^waM2_OETgI(^l|)d}`eqJPXZ!>Oim_Fm= z>T5|%{n-r`mDbxT?3XzWx4-BbDmD5lE!bJP(*q|dS=O`8jZg}#1FH5_sV45~%1oD3 z*$FfUs%}-2*l0qhJggd;gx5Yk<*e5^NU|IqR#6q%$+8tiU>CMi@tjV!n>!l=f2-|GIk^TDEqX0zkJuu zgTr&q%j9R)YT9m=U(!&LS0Y=_U1qMhP1-{$DP#y9*UG{~Y#=VA*F(1!W1=9#Hg%pM zW?h_1N7HoIq;|F*&{F%rLOOy`E#uMT6BGrs3 zoU_jq%dZ&AcF3mVFkGu*5>0fYXb*;ojFC7$E8M7!GfPW0%H0YG15Kp*vp#0_II^>w zJx#bqbUXOeik$O3wN8I6bARbhaX~9=^NCIK0c~?}ekXlCCj-KEX2>md$WIOAzZ!@j zm=XT8!Gccuj54qVFaxK<=G{Scm0=RyQIx8E99uF34P4}9Ho8N`%Y&%P!xWXla%(*y&~zNoJoU;x_0c~K{dpQ$xd;Wpjrhb3 z@U=tjKEm`GsS7h9{Tj397?QIKZ-^V6i4Q`h7otwxrN%JA<0g(#YP2-g=h5q9?vA|X z#OJpIj&UUZ8lwCdjb#cds!P|Y3k9)@Bar%aN)fmevW7;bQK1y@5ckC_QXQsNEtR32 zcPaz1-r9DG!u(G0(HrV~>NhM*4iYq&mboGWd(J+1nB z3%1*z6L#dpI;hPHW@8m)V-1FT6~~hk@tp%Qlmm9>hD3W8R{Ky|+mtnd6Tw2eyt^kb zq&3oRQ2jN8A;>077^+F?cRgbXE&*Hgsq< zb!aY@jL|=tF+RC2tEx8O+JH>U2yKHf#HKFe@&;_fh?m;{grqk9?=2aBFS$z}lx)AG z?63vfD37&&(N4Bmd|b;gw~LqI^e^;=D?K zVb()}Byt(v7_mnA=Llc;Cx|_`!%w#1wyqP$D?7-D7(Bv3dk8LpolT%OpzmA zK0|<#2abQfTI2~{!opnJE+vmehdx9I=;oLqNYF=t1Cs89D^M`T5yXCXA zq;qlKCgbki$qKe#sSr{arOKd~2Z9>H!co+B+~|Mxd6+=6u#XIH1j>J z?dlpW)2j6B$+qRJ^q-4kL zKtVwv{>*>CX||%g;BxH+8Vc&O#eJb;#((jR#IIBz0fK4K#-`B%)wwVd#E{ zW+*43CBiilAyO`q!B0CEk`M$}09F|YyBClKglY#Os1KY5hVJhSEaC@+9FUMpf(eBl z5V%Ve1bGd~-^+uDFyG584_z+6y9(;!Cp!yM+y|RRW*DYUED{usoF7q2Ar_`Ih-sgW zNkJY?WtfphWGab?oB|rJpAb|?dMY875PV4JE$L^lvCBjFdrvOb!7%YjTh?<0uzXCCU^$woYF3#Q$SwIz36?0^cdwKN|Wo)N-iUzG;3)A z*J!#9eHjolEAt@R9(h$D{!i%v(>oo%gyNLSBO^P{3=0!HThJ(psSp+o#31X#Du&8b zm5EInWMNVy{f}uJXWxG9U?p`*h>3o>2Ia&QbUnFxL#604Hcj8U!DU0t+Fxsojggqz zl2xWBX6|X(dZi1e@b1F0!h%7KeLARA>6FQ2+GH=<*U5N0;w+VEaI;JpdxPqrio>&3 zu|E_mL!XnM!7{1EQay@>Ss^bROqxIetVkiMgQ z$tV&1fQtnv-~vqjRc2{!VDbYj`a1PRZzR>JvM{P4`Jq~ZI{Jn8%5Fj_<$^Hg zL`;awB*^9?Geq!+OGas+BgsV_k4%mnk9K_6zdA{((d5EddX&HKRQls-rKYb{w$D4B zb;^@MOkV5#Xo)iuhKwibTWP6&kImOd(b9~J);UPPPmnnjX*1X+xQ_mHsNqp0s*F=D zrG7w@LBm6vhPD+|CsLWDRD9-qrnn|hTUHsSnen;&d@O`6gI2lZljphNTlKz?(a0U7 z;T_jF3USbCdzSyGz27?=FiI8*E|sS4vD9tKe=C$KcTp)h<6+a4QF2@qYLc>%*IJTo z66Y<^Rk|)~SkiAQ^r+|33al|$QC>>3B)3Fv61cR!Ox=m=pW)$DS+msf0P#5gHtb>cY5Xbnsp?(+rS)n5sqsmc5UP*F+%Fas zhO0otRfxnygl_!F^i_9!+kYS(So@QOT!-&V?v9;MtPO_@-wt1v+$`)a1o<1+Vjjam z%p}c_XX9bl4Z|C4y1jPYK)3elV-v4^YRkCS8D6;1(VA= zS2|bkE3Ueub<$?^jpEBy-9Ig>?-xLxgJ09#fB0*CTg)y_o_?c7Cdh+B7bKgrl?&r2 zpjZmpl)^mb0y!b;2ps&wcxdb>)mp&2$iC7&+jc$V!i=E~U0}L?IcvQ@dTM-l@igQO z&laW_9#I&D9(<F=2e5OvTMf;7G3GpGnFP`3j+;LsNwHgii`~DSegM&am(Z{^IE1$i(1B zWrsKp2&iLL!?gsx_s8E@yK!bgUWdr_s~Np8O{W=3^PA$ICP(rKT_Q0Y3x#T)1o#0t;tgpwmXa%iGC++c@rGF<9$IP9 z)+>pL?gU(r6(qkC9}_TQ<>uHo8Cb#DrB<`(3A=gFL#zGPK*HaF{9r??t6r@wzuEeZ z^pv6$s=tFai4_+^SvWA+nvU2|Kw~=z$w(rFZ{+q8%mlZHZ}M{SYu9@>dW6uK=U^Cf zKNUvFEM!OM2Io+d=-Q+Ty=nLiOf@oF2H3G%n_4WPH=?I^hNU}shrM4d)D)v1rDKBs z>rJ_9Eo+^%<0V|?g0A>Rf~#XL_d@FzA4ldvZ_}$Z*AqgOUUG%mH>g8V_Z>L*==L;d zT82aqbbLj^?6sgD#2msmkjxoV;3&e)Kzb*+d{Oc?65ce!U4aSp?sy+Q-S_ z$l){3Pot+j2`}ao2RK_5&hH9$`F3^ALbTl_%mV_c=8X)2t;bn7u zJx_?1z^ZRMf_8G}6n+{80!>ZHT}Qnb@LuNt%XjG2W{{cN@M;??q+FeiW*3zWp-3C$BiXFeB9enE^?(W8?HVcFojG0UCX)Oqut9aU$EKOaaS6nBqaDbZLW-bv4Y)U1^H9N2EiV^0#v!$Vg(?tO;M&1 zP@f|O-=+xsj+kFLT}6-l0*+^hkj*}U8(YvDD*G;F4+{CFNq8Hg54kBx{gAxlrKyq~ znyb2C%_`8n@l@&{TG#C`JYFk0RnZW=i4gFO;}H5<3pBQV-~Kil>BuAmPcB+wpqP?c zgt-280XIFpl%8Y>JLICj^gQCV!vjUsbvhJ&6LW!f^G^k+$ISLvb zqhZtZ93c-)toVMntoZuuklA7S0PWLMJ^SyIeFu!}IY{JS%$FD@=$xXEGatjzi~^%* z!=>uMLRaa?Cw*T4e3o&&Qh@j-95b4>Qv$`~gZ#I|u!E8QJ?|os(aecC;a^1~pk@H3 zC|j|q<BpWV?^QTSb7!CU&9uI{{{iy~BvOUf6pz$z4}p8B)1omF9EIR1Elve$IWLSjqJ9bVfu{#FyqTf70(n* z0Sh+A&{*<9R)R=Jd1p+w_o;k~@|5rN$b5w9Eng~o3D9=JiaV~3xAH}gxPitl$m5Bu zNff4(3jZq6M4U2({JY$YX_a+5ZZXStS?LT;{grdFqmRXRuaWpl#m2!3E#JwBla}S-&}fq72|w8 zIAmFL#I+bH86ny3k|28S)q1>%)UW859H|DE8CjCWA<$A@nf1%~>1oL^k< zJ)!^pqf^ycclbi0?z$%N)Y@BfX$^Ka(QBOBjgs+PaQunvVGUUuzm^(AVmaI}BX)_! zk0*?SJAjETTp1=h4MgflG8dIUrQQVoJ9PYH(yQ;9=H|HV_#f^|A=TcdV>&mloonCtUxeY0n{3>{(n&hgRa(R~I&(oDUvEIQFKraboK?Ts;TegT+-CRT zH z0uDmDj%oq>=82rLP~B+)Lyn*~Odk_vKhtdQ_Sn>e%ML5#ETa7sc08=$rYaFUO4s1` zic;lm*?{#~ufGyM2~TD)kFdweqR*9uYAgr8Xf(tT13PG(d0icB3dC}ddXsYf_ z_A|*`i-oBvN^67jS7>$D75Qd1&Qk&W#yP)?=VdynP3%9E1`NAkBzYzb)Xw*DUa?R~ z3kOUWy{ABgf#a__50@$z7qm&D0(`=%L7@t)^?~#Daa9A0{ba}^v?NP&vi!%AVLF_Y z@TewQ66LHKU^ICQJ7kZ4$AK%_$c9Um`6K03Q)-@-yizY(H~mF4p{!j}!R2a7ZNQ42 zMutYjbyQysIYaCe$eBjF<4U2r_t9=VBzy*Zkw#a39f^O8{)qeit>gmtF{l$$h1r?q z@jHh-3-yUujV@J-737pbTqOuzg`5^@l4NL~x;a!q@)A{U$k-#IbJG>o9M*`9xs@ZnYU%b78lLr9^8QM16Utw`l?43)Vy|t4-E=$`AjK zK5HWz1TZc#iBx;Aa^LSMH+5xsEUeNnr(Rni+6X5^s9nLP{!G{x&5GJQ(qqpw%+OKN zK0`?qJRtK}dFQY2$n64zwc=LnYF9zD=I%k1kD7Cp|u8xitprpaG@6 z+rOe45C>C9T7N0uE6=mSVWzD<+xKKNNs8QhaqRGv)3bn9pQmcCdEP;j5_ud0S6$i8 z(lzH@4J>fD(ps!o_l#D584T()^;#{qR-ms6#;EIy)noWiVa_Fp?#!m$223|w%D05? zi_NF4+~nVgQ7bjP*3S1ZrDQU+3q`|0`OMY)+wxvz8$>IaaDI+U_1-_<=;GmTE?MTW zVn%&Pt#MRuw)wkr@r0C#{Imiwvfg59yLD9s15~~APMum?Lo7_Xf}c?JsO@pPY3bck zvyTNod0j_wo;R38k;MgSx979TZpM!z#nM8R{SS zBga}r;*Al-(mK9)OAnRMXA87!=kSZSi0ArvO_FQc_N>#~qp7#A+qjvgqifmdMII&} zubt6hx`7@Sb?aNMi)+Y>8jP4=oS09Mm9J*90|i#`Tu_mOE%-84=fYG>JRn0+s6b?L zB{NdaE^f6o_CuB0s+rPfX_4W;xmACM$6jk-ZB2sdn(JUtxf?Gd&%VQ@m>Kn{26+C$ zw~zHziNB+Fymq<8YbCjatKH-58Vww*c;G>p6wn4lxtDYrh=UR$VOti4v&Y~c#^075C?1e-m9fY)rjn^s^X@2{ep{#yI@lh%{l3Flo&gsJk%h%8+x~&B} zevI1;hv#>CU7Kq(8au*!PNZ^0yhIT*O4!2&k65fm9`oC0cD-m>^V}@AV?~7V}7ejI& zY&lbRdD7rn<{Eufv7~N%>4&eNe?0BTVmH`@p?H^@Z2E*$iKc2W*3o#Q!hm54dnG9m z8^iuNYRJSm+gY)2o*ZqFd9u)vOl9iw<1(JNJUlOj_KL471Dj$zIr9Up^nz7*$&}2c z&8svFLk#r)eg`Fh9e5b^Vl;=CrSXu2Mmr1+x2*iA9vIitd!EYCb$r+5h^aa~>DhQ& zvVGDGJz0l+!s7!Hl`lKjPJHWEP6`z3V+nT!5pfeEoH6y|BY-;6_9AIBIx$ z3;Y9CXrhFvr;)X%wsBBj%L#OWv_TYX#xj%K04MiUKXigDF#_{g(>jeGJjc?sago1w z4h4_mar(^yA)IcU2!qkUegijoEq_PUCD!*haf^KKvbo)Gh0{_iGLxuLOM_mONB### zy(oo{?z3q)Rm6yXkjlYV_Vl(^gTwNwXFs17S<5pl-UaUfcl|T;Dv<7}=`~qN?O4?v z?I72>r;qRLV#+&v$AE(;0waMyx54TTP^m#XT__vOa1bD|6<4}HUri}9+$NIFo)a>J zQyZ3Gb)_P#(`+%baqZH;)xZ{%J~Z-7rs`@Ee`?nH+`0ZwJf3B+Q_;p3dEOE`78EGy z;a4%JQU73Cl!PqNB-pj&=!eW;n_7x3Mr(7;shy##O({=TZ|q6ewYS>mR=lDeWYLk(oK-o!`T$Aj^ZajtCjKk8mZmx14skiX4zxE zK1Dm|YMFF&CN<;PJQid+a;z7f)~mP@Tk82H;v7*_fn+6)3To3e8q!vzAw?kw*y3Z4 ztM8Zytu={PtAfke(bR`@DG6Itn`?SFba!d|BUeTsW;PHUs&+$)+e2=ars;VIHs}%feB5%f&y}9+-@GxtCg64lrQGO|(_v~FE8XDB4KgzgGJ%e7 zxNVg%2iXw?1O)nN;el`s(5-Pzrbi^%&&RbSVm7SfBSGwfmA2jczu zdl$kV`ViXeWc%?IMDL5)bHe`}fye(t5TyUrlEBzAgVQRRzf`6P14!2*D(Fx8D)1=1 zKmwce!Eb9jW!6I{!~`sXl|DIqA8?{E114fMQJ~c}%oanr}ls#U3#?;>M!vY>o(JV@2pg9ro`&(SfbnmG`Th<;Q2J28 zx+;0OZs$39X7shSLS7qtNXzTwq?61uCTG7VaStw{hjN$02bN!)q5;Bm z4-@NFdw%TU`a()Jf(8|KP0Pp=J0=tO45qyW9arMB0`A|m__fvWGH_AmYZ@g6+DKT9 z0@0-!l zHRrYoHmVvlT3^ApLOp<3$wwXmy12$ZXfdUe0s)b}A#%aSoP`H6HX-uky+afzbz7+x z(+z{^q(OB`cS5g+KmSzq+~E)R4@l|EtQMl*cQv=)vAZBV7Ujpnp*g)rZ>>hR%Xu`` zafgaIIK6oUXCBT;+Pz>9)!yqkUI7iAx!pgBJJ(V;eI%|nkYj9V^ogqZHD1k6rM)A- zf$s^D65jJ(c%$YulmCDp%q%rbK{fdG*z!r)?_n7mTf0~A1jaQ22tdn=6T!=83nEtP zpWUA${N1NqXIWX<(qy&O9{GL150C4{)y56=)a>K#_Pkdkka0}d1umVaKu%z%jendI zej~Sq^&@`&S*0-H?z7u_sOyE}Td8tAr zh}-+0sD{o{t^MkA$JF2)R$c2E;DnVtwiNRrUe6wo1?32b=m+f)0b?LsW8nt#514is z?6I)lMB)5*f$}j$S)2%o>x3C`^+Z?THX)wQfh^E}YK9(1A`L(5C@a$_G{aA`$q)dB zYO#g^pPT^$&UoomusdNhwJ))7DXN#6QFIKENV)4k+QQ`h7_1~(%W}I-g&LxvEu9t5 z!xKpiHgP`onyIw9p}u=;CA>0v-;5A)X#cNPUPXb4)OYq zadQK7Y5L#f8r-h;VR2?mvyUb}BVL=ese``01NfwEyP?v@B!kcZdEHUD%r!r#k3%=+ z3|HR2V3EW1+x&imr&AXeCV#O;&s%1uJ)T_!a(`Fa`Y_c&JJe_@d^<>50-(_f7{!Da z)!jL)kcPS>)(_{-i=Xwr-}3@$Pe|UQDHZ<|e_aS{Vgwp`Teg(!6x+;fK=JTjYc*^a zy|6HU5J!9~{BLrNzl6ILJ__|2$nyS(-u4j{ug18dW!3$y$BD`RNeN76TMODQG|9~< z4Lqt7$Q1?xrfJm<1*?_Is-a1`F>o4@#2ue&#f?w8qvr^lU7jV}zA)!2^4di;_z&ut zn3f-lXYPuLAQU@#;+S=7*(}q1Rr}RUHo)WeZNoW|p4n(iptkE9ZBVFu6eEl{Ey>;# zsXoxYZ4^9Wg{U?I547z!*o6|CS$sPGlc54iUDZJ}H=Mv*KU6cVuK5$`A8Yf5TX6A~ z*agcgN8jIu6v$or2U!p?Ap-t{T^x(RD-1&xjTG5CO3lT5p3hErgo1}pF}|=YY(mcA zCIyU?Z`yL-Y_q8-p6m_t^S?pib5W{w|zy^zi2Ukz$2-Zn!KQ(UY`a$yY#&;U!Yu8 zJca*zi=_M#7mLb_*=;?AY3(vti(+jA~}u2ahUOH@M&9MwSaYPd_hTt}{_}TPKe@JV=8Fa;G!N zVnU=^lpa9QD1(AB*Smq>i?iOB6~uUVb=;;qXK4HSKS`y(gB#H{^56-Q6*l{z!{U>< zRfE0kDnM8ezDeXVG=lt+;h@mD{77WucC(0KT*qN{vwvK;*CCsFQ222?hQizuE}#xn zHRIGn%g4oQYYbZ+HECKN+gRxpHQ>qh(5+-x#XGoPa$+fw#>TiMW46ibz2qK3d5E%< zcA(j;-(d+22RD6pSGSO30&im<4;L4@Pbq=R7wwuRMsxOu!FwJg;tp|fJ)BUF)tcA@ z9pq*e-U+^_qE3+XKURR-rXy@P?Ai@1nOpXc?b$$=YbTzZtWO*%*`H{* zo(%Z!J7=R=>e2igV7|H`{Ia(g#xIGe-+{0_nfnZ5HzpB1v;(n9ACL48os#w><4CzL zlFmPlncQ7Ax@d*wjjUBT0Ee_yZZEf0QYw~M&b}cDU&;*h9!^R0`gXyyvfix8UN+=9 zx3%E+2EE3{MB`=ZP_sR~XbfBc|A3Ch-?qA+-PF)PWif52cblfkY1;8;aoYaOfARW# zKs0mZkqZeG3&l*Dw1k3l!-_m!@CwxnQRow={;{G}g_mz1Uz~eGU}1#RFPNS(oJW@> zv0XGgFRGd86ZQlm-MPaYYJ`+ACfezdV+56iM~4#<67Okd)`+K9>ZcJRX!Z2+i>62@ zvaz>B-)#FtiARO4K}IS~O1p=*a!DUVj(}CCm`ERq-ZiWyNn-oNFX67an{2omb z$+`-y;=FbKT%ZAssNUf`WsmErNK7FHR(r>Xc0qODc90z}l#(_>y5bZ$;M zc5TORD5$Pn!GSYmhH_7A4+M{1+{Ya>{e!qGSfv=VUX&7X zC6NfTJOqWnMJ5u7IsqRrWP}y>c9@qWpU8|rRv35!SBlX+@iPHbbV+Sm+GEMLFRqJ} z(@y6|Z43a_%vq9AGt4uVp?`ep_j8Ed364}+lus5NBrJyMxPO4zMm8o?K4G~0AUWu$IL zD}{&>i(@?!_rbMq0D>VZ;SoW8S&A36@NEHi;b&sqK%RICtTQ998Oa+nvX=_v4|k|9 zbZihH-@NDsXi_=Q4}^sC*t|N_n^e*l7;|{2mkFJ9Z>0eKh{F)So|L?9ouow25oV!b z4w6I3s>5E_RU`Qw@w9tY6BjF0H6u=$%1p*iYNnl>f2fHHmFvOG+S((#ihLpakWxTO zBPbRPq;*h(Ip7Umy(aVN9=GFFkC|<{JGp6FPUlxC&bhmdnrxPanIWAnbll`)_Wj-< z6#6?Z-+Je3rydJM5PzvC9({Z9;&jm(J-_9cmj`Lt64FCZ=5NvpcvzXmuac&wbZCH* z-oZ|UD!pYHj)VH1$T$tG*7Xueo5|Njvfm2|oZX!&&h8`}`ztA1H722yKEy_$Kq#_7 zW_(&6E50|q;kG8)(5^$AM#61RUL9~o*fIL^riQ$55B`L0*z+IACA#@sG zO>4e`{f;91SGhzea<&TU9A>HoVlGwsq0$?%4^!)5yu~qdIscm<;32AsIi_7p%(%z4A07DAxY~DSg zFgf{k_-2I4FZln`4P69x+CDU?%E;B^onBvh{W&a`LSC!j+07?XI3hw)p!Mx*_>(;@ zwx}jyI6M2Ex&xx{2!ek8x zy8>~2n_<2>VSTgq8AkupbqK8gsrudos;@@Kci6t~nb1ro>aTol&WM~OogcCq$s5?; zHERD)(Wzo=v;#7Y-Lm&hsd$s7A&)aL)f6;e@jfz<$C+S~rdg|r!;57Und{b>c4GHl z0t@9i0|r&xNbS)ihe;wUBXngQS-5UIX zjAjuJI@|ol00~!sar3C@*ZTC%k=Slq^JC@{PrNd*R>ZM$xR^x=4gzrOZ$&T@j&s*q+F;lUb`vHeBJ%$bEY7kL}7i;X$lm=WQZ?`wyX5t37d1`}4K@}Mc& zcW!59o{|V$+dr)WoizMNjgagM4`#5SEug+)VrIfcrNm@jb7!gi*?Jf_g z>^s@$fEXh;MjMa)IQ(WkFtf;TAXsnfl7yT%ZKCu?03Vldq ze_{%#rAizLYexq~DdPV8jH;k)7m=rWcfs%v(;>(-@6a99?-yK>k2b*2Z$nP0n`JYo z?zgvJ!RIx(d=LRSAC;gZcYKjYJHMIsYF>C8{!3I|*P45JBQ{2nGCa5rW?cJrE-bD! zs$O0}^-fW4{a|g!vK@cCtjD?!^y%a3Oo$~;|9QoQk~ExV+g}oDhEkG{o(@-Xo_Hn_eqo>?$pOD2sL!s3la#QhlHCA)ZUm z1lB0%XS(tFxtuh+RsgT4gGIaz59R9cFGx4kqg7~*!{<&nZ-I~&%0Eea6ja@mLuljf zk{uCrh8-6Ksy8Foa+7mVfl7gX${*RT8yejDyp5Au$PFs;?&oqV~6*%E z?eJ#&?BY84NZk9PpP z2-5H?V7cyBg7ZB_G0B$}md}rw8M_&w`s&wPzlXVt+TU*j8

d?~=$y_z?$}zMRxO zImHizpRZJsZy!zWyqwKG*63gEnLi{Wz6C=F3SOWhHsoU({j72yzg5I!YWQVqe5=IY zvVOV@a4U{Ewb6diJ+!XmAqs7)c^Q)brl>7FFp zuXO@c)&`H;YnNsSOEc+_d4^jE5yOp@YzQ_?lO7i#ir+q^GCKu3$x5mF2*r$%oEr@H8Oj2W!FkG@I%< zkTUM5)!1rjLnqmClzeVZiK!S9)h~ZHdMK+pfNO0LUZJO~&Pcivp_T9|q^hb&o7(+Q z50B6}uCs*xj{U}J^Wm7H>QOc?-z^GZ%R>wsBc@l)y3p1^CTyeL8cbeC`@SoJ_E7%85M#I6dE#0;l9)WlXaMRSAzve5&?R_M( zml0k)@!@D*VcueIwtDLnvud{5ic~?-zEM+rA0PwOB{rclWG|PP>c>}K-H0f%W)%Wz zizsZ~14&S1PYuS#NjMir>+1M<7k>qJd(mG0Os6?T9s<1;g|4NlxEwc{JS8Mk#COW2 z$% z*_0k;=@+SF7U1l5nKc6M<^GNC55dLVGM*5dj2-Z!n>B)_xXP*?NcFqu${aR|fadw% zEQz)aeDzamp=MqO(y%?aN+Kp-)haJt!&$auNH#?mdUn(-EUNbz?5ZrzOabS@fW4c} zsTs2KJv)*y6SFz_i_il`(n=N$9ZCO*zmz2Qj$#=DLjM{US~;=)a;VF0PC=7-tD6}< z2{d^TqQk|Ale;`N@(oY}lW@}na*q_Gn*V=YN zr(@f;ZQH*8tvau#&eM9CRqJim924K5oLD;J#Qhj{?=f1o%FbBykPE(o&&gfg(I>>N zjBi`0!zi&E-{`_92_X2eRGZVW06d8w-T8>ouc)4SM+?T8!+z>})e&Pn-cgnn8vMS2#5HzhD}t?Xesevlt^;eq~Ir z1aW|68vWU~4$DVJSP`NTI0y#rp35wpQ23md^JI&+kWOijoLC=g*%T(809;jpp2M$x zwX5}6?%f06ej7jhp+h*8cMZ66?P-I~U4OC*S$EvCNrgendC&wzkafCRW3JbEVrlaK zq;77iPr&jE*v|+%nafP>5+QOR@nZ!$GJu~wwiFsKyZJ4LowM)Dw0oa@HbYw|Xe9mk z0h%G33sEZooeksOhWw@G9Ro!@`;?jM<*I28W9h$@sTIp~kw}X__}*a$`@IbmE-H=m z2v>={!k&)%W{3&NoX3`54HdLQV3POQsw-ql@|?%av1t_j(qMK^fG~+&Edmuw_@`&s z8Q@gQWv%x<%b+W%g}UI5Q-+p=g!7jVCJyVxaZA@Qm{oty51>fg!LVDqMDJ?&J#E@8 zW?pbbz4^7BC2UP}F&@fvQ6rZ@FgfZ=)1j}1qAL`h_WVaa^McbR!8vGYqnc21LY4SC zK{B;eF)wuCGPLfI!r7Nd*|%gS8(CwKnSFH9@P>rev1q@KMOba&{gsq9*wa_1Y_;Km z&h&J4AS?YDlL=ZHimSDFA83nwnd(vsqAz(G7E;*mZ&drlv#^Yl#Oy)vLRui(d9bNiU zowY2mi@bj|P8(StGICfZ%|@&EiW%AGO`pD9fJ zZ+P{8_oCJ|1bT$O(C!kwvvVIZ4!KoR^lDF2cU_=u;&%0%rfGL6sQFK`)O)9tJgBmf zCpl%&yG9gl>c(@HhPko31NUPXtUHXY85f%MF*Y!!8?xMTHBGN?&hvE|cEM{EPC#qe zdFS|&+ce!!*UU}Nj#0Z-h!ybh@25&1lO~A?#9h~7awvH7A0XH%UtM6E-QYi56dLq( zug!|It2Cad>P&1OeU$kLVik5%TFtCp>;FkPHkvGU1Jctc& zyRNB>(DY-9G35W-VWnHBvlc08jzU->G#MVUmykl7wPDvDrDpMXNp$mLIQB=GvmhtH zsnMZ6{r&DBLuxdmfeI^-*>SuJX-!Z{h=-L6Pp?`ZDc-V%c|w;(uXaR<(JHyTmmY3v zb;EH4at-qGl3rm#)JSfP3sz@5rwGj}nyxHJIQr3_(-&@@mjr`r1na+RH{J#X-|IAq zr~NpS#qLmM;9`lS52%~u0(m<(O1P@{6+m5eVg6EX5?{*kj!_~oDIwUnLozbkF}R*D z2=neCy$|w7@&HR2Q^)fP{B$JofF48O#2&F=M!1C%!2W|nZT2DOV>1I?FzB<#>Igs*lC9D7hT7pLZ zYE{w%0?++%CoVv=U#_=cuhW-!AmsT0mqk22i2KN+ZQ-h(w7MhbXg2x$30GoDhwzPD z8sNDeRqK;LiC(6E5W^S@TM0PjlqGyqlWhxuxWMk$$8_|Uum@muU-;b10a;lD64A5Q#F&ya3Z*>9Vqkv#0Y0V8_v z0}TBFc7pXs(jK(x0I%7eYOc;{j#i6Srp#szm~d=gerG#ly9YZ1k5%>Xjlu(7NKV3I z!J}}@`Ixkge@nX&tA=NOK#HV#^31yXD)F_02z2lAv8qBW;$}sxjbQbI*1}>{US8c1 zFJ=BIPWG{F^E~t@{4JI`xoDA~cx?BlIUS-UY^FFEx<9OYI0NgW>{gT#SK}&8m8Yx{y03ib-!YSz?X+fuOgs z9yn9;j8J5SkGhE<4~p?^sxeQ2-|)%rCBYE6h$?iu^~;2hF;SFV_Gz(l*Q3^5RQFQq zUQT5khAa;Tr;{6=&d+_pBKD3;%KOZ*l=fN2$fLbFyh^OmQ1UV!L~?02!t98pDYVzVyihg*T^>>#x;4RJ?{wj-5{VS#@+~oKK1OH=GOv z>mq9FmX6!(pR4Mwjpsq-8o562i3zBXfEey z6Dizd)v^8&#hU}p8;(lKoSySYv=NpIhY*>S3Q^~3mhneF>fw_)?Ky0Zzb z)%^KxX{|hG!)Q~Xx^iM&tzP)sm+c%;Y{SE)F)(MzrTRDEQ}sq;CWm$901xTlIy^_$ zn9o`;ooKcR|5D)YGhWl?qz^?D-lSheY@sSK0gx+5=!|071Cj^KsO z5!}_D0Y5!cKa2!E^6>&Q-$ys-y{TKe$8u;N0$YbIFE(ZN{YN^U!DIg@ixmOAd=CG> zP_xIABWYi$ux`8)o_1cygW_Z`0_}V*xmK8;C*q0fT*_CiMyAOSKS?kD@fWjk(yhW* zz(vlYD0g%P8<-rR7a*?s=KA7U!Z%%Tkog}L#ufC{=>n;o5b@2z&j~DjOtn4Xej)UY znr7^0qQZU~J=c5@5cP*WhTyeIe&PsI=7?T&JK+ziGfWK-(G%>tGzUT>R7hZ*_-nRX zyI8dGYUP&5xo>Pq+_YJ2QGC6k)7XAw#HQ8bvv+c`iPPId&;l@v`7c`^%HbjMj}3!i z8+VtqjpdL7x`o!Ck1KEr1l?Cbq{N3#m%4R~!~xA(l1)X~Z}PO&uC>#d_wy;=Ati@^ zSYFr**g)Kh?b~)4jvV&~B|IsqUN7Gx_*=!}OgqKZbc8wa2&320N}~7WZhbk5%2P9H z)ym>sM2}&?+QGhTI2<4R2ds>$C=%#&UA^Rp+nE)RWDccj@rk2`7oSc$0?AU8wde)U znkQjBBc9dY95Ay$nidwzM`-&`D{LRU2^UbjOzvZwRT9WH!3n3xD6NB))17?IlU$6KdCU~~-2FqwPq!)gpRa7(vF);51?r7MG zHFKcS^6QnDOQ7Fkqs(cCl`+gdw*1W6k6a{Ud8%*1@fn-}M=D%s&B01Gp8N?7!=Z)W zUVJDM9vfsLI6EyY5PFz~B5Dg|$P=^~#%vx$(SI}b+Rnx4hLBBEhI1lK#IA9#g${G6 z;|b)6SeVkFMp(Kz;{Du_C;db(1MQ+_+y4eTgO05KdQC<5t-hUZNWZA@gsu&I=>_VW z5E_&2CgWna!sxX{oSxnIQM4kT;N+X-QRbWd;-777i(pCUi>}Wie3sUXL3CeM*liH# zKGr;D=l*XgrHab=%ZmbYT9xy^yE=xTb0j|s*wqoD>RLlB{jP}71$?9xqfhpz9*SK- zP5Z!D)|NV)TbzL`k|!6}s#Z<@!GhhUWL)BqZx{4;+@c3&3J?Jpp8zj%ICpjUf(E4u zI~@6kRsLXLExp&rY<4=M54GI;legQKZo-A?>$_cJzb3mPlc)7wjwcLdPg>izL|d@fW>aC55pRuM=S1C_hJS6!6aCINr|z%(sITsSe80dKp1hBJiFUf--=d7m zVHR9y9R*$qT5+#!!Y)mrY}L*P$Y;PZc8wq%OT0Ix`jtm)2(NJi8TG;{#xcciEdJj%ca9G}C5gET+RYMu0Gj}`X20h;&Y0-)Tikr= zobi%q7EQwX?Zo6v_`DomNvb#HR{CGuGV|r4wRXpaH20>vp<01AE#UAMs)7h2IY_2C z=E>p*0iln~E*eg4x^8`VguJcyJ4QUfeYFYMoHKsG^h)~=D6v+weRpr zbj}y2Zhy9w@Adh9j`Z!7&jbs;NzE_6(IN(_uio@+mttGMbI&D)ZkvLnY&;DsR?_is ztR!)n_o`GWn$OV+K2cBU!M{V&RlZnu--1u+J(Zgo&$O`c?mjGu;9+Pc9;z}3RXxc(6+v|33oLiETJi29;D zF+Kw>LnX}hZd( zznop2-MKwg^%gl&4Tc&;r%TXb-mRlVYq*CZTDbx`8I*lz&tg2XOMJeWBPXm6ya@Cw z(x=(DjRt>XCeUM)^Xm9?Y~4Il0P63cfd;eMQL7|)+nD@t-LGjQ%y1If;z1Y9a z8bvk_;Xv&UXY-ZH{;^>|bGDo$UecEa5FJ+7RI@juaqUmk)picW^m9!9X_nn{y_G`T zb;jSRI*S_;EF2K7yT{;>$I-@cWSs(Tx2`=O6CqDjdoZ>w@-avSPJ0K1He6IC&+gWyTSJJ2a~h3y1E#hs;9Vs_fhe z?ew76QP~s*{l_Qyqo%Yqg7H*|%GwO#G=fmw?yrHIc^w*d{d+g*hw??8vBblD_8dZK zI~~KY6QDi9KfUe4t2HJLml(wz+ls_?5MPLs2H4B4e?1JQsDT0IF(ioOHA8HysNK8z`=5E*5enzjo{(;(=$<7#)B9O~aCm(d_KAv)igyilT zO8B1SvkMQl#%Us)RJRl_%&&9kJ-)J-VXJg7@T6OORWe3#i?B#_qfC)zS#Od4#5U0x z1W1~gSE01XG&&0gHl4>LI%K0>V{9y@Qa+zT&bO6HPq=5^R^h}U;OWhgQ=MIv73+~R zD5$shFhQljaHe}IvaIx*zdN#aTO54dif|h%i29i#nmx1$*}kaStR+B^U%cNCm?GWG!Fx zV!x*Ex6Lg62x)|=fBEK;4jcH#R@(-t+mp4t^~cY*gB*=wZs5(WFZ_=5z1MX#GLr*i z1|)3MY;-?_Scmt{wl8iak&>qoU5HMobyP8SHqNZMO3iwdPCI3 ztGLmZi(lBJlf`+ah93>U-1J}}(Fui`L-!>|`@-OS8Xess#$tqFe?O!O9MLX0Uiv92Q0 zsXtp-B#pz(fRkid~SC*&D%e)q&>j79hT$D|3G>h$?&mx(f7QZ z8th$Thremd`>&d*#{qU@q#ME{^7k~VeXK;00)o#)p8_=O4YJywzxhNN@(END_ZOkU z;OLWp0CE@zPsc#)?Q%I|)Ng8i$JrCyb)`$knRcUx>w<KbJB{o?tt?B6YQWo`iiX?9|UDUX1NFD$kvv%p4MRW_{edrb7~8(aM+9 zVY(r8&=FnG1Q2F*K4Ef7mtf|8uuL4{b-ZdAy@JHK$omuH2>q$a_`BYd`pDf-|MU49 ziGhC5ix0Tbz+?Nzp7YMo%QAIHjVF>3e1tc&VeGCafa;mu?S}NVonojv>ZU9DR{Z{d zK37lLH9cnU$NcRHW0?BaD!|aT#_E?@^(X9Jq+hlvm;^v+^VFa? zLt2$~wdIZM^Taz3D)WH_Sg;&R(iA(zM%FJw3X??(jFn;Q)VUe?IsPJ9%wXj9}pOapD7BS;R03OCJ(gkHEb|Ng=i>ewB2K2cKu^k zvEdfF9im4&xQPh;&2ZQRbKO%R8>&8zRUTnd9&e5oC04*Si)|Rp`3oVNP=pm)RV-VP zx}f~1fB(dWr`Ar~$64~Ro%erxW26~+X1?75+L3HuaojGMTQv(j*ICpRNx@dlztj8s zo!=qcz+&_nH*sZIfe2Nx1+A7=mhtqU>7q6`T!9F3B9GoQ{QH{t>B@S4ZENx!Wx^t&sGJUU2Xnxr%n2%exWVH1jDRxX-oialzJ?|IooWsp5g_yQvSYZ@SEgR*q zbHkxFWW;N%&5M=|L#2wlKl z0~sljT*1&~gFdc^{TC{@>_IP+;r*og6x%;}I zBShAwZr9gPBV%s;5MK#?!^N|nqx3IH_O(NcB9~7~SD4?pR*>omKJd zW_y!n*=ED{zLM9_yWW;AA{r3yCAQ4MjzZ)3I2u&bPmR2 z^3n2O1C~IdUUyK@VrOsS*oD6@WT?UJi3TT&`Pq(Q{~S%hdCf4^xz(XvrmGB2CPjEp z!v1?;o+a?txdC9jW@`V1{1=&QaMD=&zvdEtl2z`j6aJ_=<_P|YPtex%F71Dg9$^BZ zt0q{Pd8?VTS^Th_>i-;}Tms&pT7MZSqkZ5xqVP@I1T@pny>a&M{9yn1VEugmef@~N zy*V-XV$_-8$}17MS;ZPnpwrn;y(x|OMIZ7@56(2qp^>HQRw7bW^^{*|vZ>Jdv+rcu zi}M0{6_PvGOn`%jyV$fXf|9>+%(^Z}F45#)smcO32+fpam~r#QxjQKFmnE)yu;R2c`+ExNZ=3uze}Ou`QWb&1 zPpj~RIWHet;21BU^s27FlWE9uxFsXN!ln$hxLF58OGg#MpA;+WQV!Dp$t{3#(+iic_gA z=?p`a0i$f)tsdxn4M>yedx*pIFip}lp4L;j26twDfLMW`9W%VOvU4b53!h5F3IsraEgL;$&b;t z{>h^x(xYLCZ}(sDgH4yrOa2?dmSI!u0wVvE9SLs9{4rqZ}}_Hrjt&x?+(z7$3C-&o66ye=>Sjlro^<_1~Bl8#P9wkkEifyBk#ko7KR)th(S zSg3e&0@$!tE)DL|Do=?aM2!%FIs51KX+H&hmyg&w;FjYW^fdiqdq&J|@Rgrr7w0+{ zcR_1{zCOuy5`E}26?JM!BS9FCv?OV-nZpa0>B|%j^T@)d2m4BNZAupkC*{Ntsli1e zyb|63C4}!mgz6mZRns?nUNpL+Qvip>ioZadAr*g$CJ18LFlZDu_uvJ9Dv`-Mlz+YV+7ikb#+jcXT5mfU~!N@5U)+ znL+67ue!(T4WWF;;0*qp9oRP`9{G8!Ow4dT-bvnVj7i0kEJiSfA@3fAIc1(eVm!zi zd*TgM!dky#tZvx3$exUr4)3r3czMiP`G?i75v-~md7;V6)^*kH

-nf}~4k^lgCB zxbj}|YM8!1P$9m)9Ir0D#*``jeio9AXjoMpwjwTC>RZ+5X7#c2{6w8&%8OeNT0z4? z&Mhv{*TcasL0ahePMk%U>m1UK(`!<$+F#YfeFbwAOIv>Kzo#2kh^|2YfIDlVTK2{I z9j8gLj6~gYQ)CVGVn6pMg&Ym{W5jNo*CV=FE>~Y}>d@6J%T}tyUy8c<_~K00`37E5 z*z1G`X^eHn+oKyx!phW$P=6oooAi4>S3nl92YN>HO9*q~8 zJY2w~3(S!mt2JYn8=B5OSP>J&aTYCX2!hqH-G(@O$KZwBD6sz!S^IT$e$K2lr&w5G z#(+UH4-vOVx*h~CnatD#v#XtGM@H*a{cq~J37k&bpXEfTeqYhb?ycKymx0D$E zi>tJh@q^&JY}$L9`PA>{$4ll`)Y{+r3!@pm zmtCc;DWhHcz?veCWvb{`lt(%h6Q`WPE#rh#0?JAaNS#TfcDYLZI6-pdp5hY~x^(h< zo6jj-s8XQ{)glcq*%yK5vdxVBicX+F!?ULrpmvW%-f`R){&EChAm{`0vDfQP6GAs$ ze%)K53L4>JYuJR@ush2N8$!I?q6pn3d8HJfkkdlDX>_h={_gq7i>TK~Tf+`qBQR1h zr*ykz74=9Z`1U>R?zn)6)w^L{WUjR}tO<4WL5LvXX$iWASYIlpE?1n`YYQ$wgD@^; zqY+^z4o=D!VNb0sdtYMkjeRe%X6L$wk;^r;TS#t>&)8lEzH;W>uF~bbQER6huxyrU z#lo>C!=R+Tw8Vuf2){S3X3U!&bwgKU-Bp*A(~K&Ci4hW+s?J`(uz>@2ZGYZidmpB5 z8o%M;{+kRuMcTV@uFZ5ty|5Bj`4;C;1hyu%TicJ)j=UP#b}adS?kaR_F<+N)cG$QJ zoo;PepntC1_^EA6>P6ghG^)Ky?=?1F+bp}f6hGCulJbWiF1_SU0**B11m>ios|C(0 zcZ1+@?qtxyVp}(tR|3{MqD_2@w>hx z#p@3RNK!*aZ$G+tHl9+8=l4r=T!AdE?!p%6F%WsyXltQ=+OQBYdD4{z#40!dzjgAjUd?YxBXZ`qPnZBGa}@ zBdf8tc?X)!d$XS9GvfawcjvwsN2g>v?ny*Mx@pI9P(na-8?x=>t)S1J@ew3`^k(k@ zFV)Md*JKoI=^t02vaUyIt_a{ZtoDRCKO437D8~yQMhti5oqTSlLh1HT>{!Aoy1^35 zw&++#hS%J=P?cJ@kaTg(87S;JOa5iUbj%(NnR1|@!*T<> zj-sM%*#ozn4Hgr(DC#bVX0F%elqk-Rjt3Yu7*NZt^iR41J2gC?^jN(;*zn!De$*V9 zLrM+d7s0++;lZ)^ohq~AH*L{3jP4y52pM>t-#Z+|!I$FVVvF6-i*2@mx}tLs==0Dj*HZ2ySYHC( zB3k2ET|UOH!+2R2^_<)YRz7|p;-%Hyl$}ntQztjc!7 zECusHd{B*>IjLQ5Iaj*?=!P1qn9mquxX{pKp)saNig)9GFr(FoyVxJ9;!*9bMn9&A z1(Iwa1FZHcjBf$mB$xUI0a2lYNkxTGl8!+K2&Da||qc>@jPch5C%D!%v zyTLlA_O%{!-=1XZ$z@WSK2xluQjDea4&~~}ZsZNk^oc2;iJ`+m+5FaV!`7swH#YQA zIx$-5`il7Sf&|R>g!7UniW}L{w9IcncWxYZ9Q$e!wemV^=^NSDy%$q<(vS2TxuCmN z!XFtkxE+rt(^<`?v$z|o>VZ!+PL}HCZT~sFY@3V5e11TE?R}lYf8F`FH>~pnf}T7- zV@YOo`ZJop&`PN158q;Ei-D2?X<=#fkW`XqAusF{*EqbXJ0%lY;?RI#a zqm_XnpFLqsgSi!scLI2WBYvFfXjcIhN_3Z2*~?Wm3&Tsg_C>UB;YOTST3Vm1^?X27 z(ujXp{R3fD*bfi`6qP&4=FA!0PJ_TCZHe~JD~{0WZ3a#^D~Xjiph!Y_w|7w?hjKJ8 z`GXMfhx=!{xvuoLYFe|D1fZz&?TlVY{iP&nW&B{)3bJhl#v%6dUJ_OTZB2pRME)}5 zI76){C~~7P&3&;*8bO);K-Hf!ZlCsgAA%#@^N+_{TOF}a^dw7n^h0&lrI;p#VmiPB z^QD7?AaV?$zFgL&-_D?Pie5(LXL@+Q1PW6|jFZwxO4^=BDtrI? zYt-qiDc=Z{mJ#=&=5?~wZORRzX$rsS_IrNGHV;X=@NGgGg;d-Y z#3_{VT#>GuHWi;ouacKeoXMHwfCm6HuwAe$9mr^0qf0wjmRGClKHm!;4w9NZm1R>W zvT(yDbGGl}L*Vmt_W2F>8AV~ZMCRU)r$xHAi{O%*_wYe9X-4W$0SYj7NprmY{%n$33vxpFZa0^u&U1u0m36@kY19ZMzq4=bo}@BYq8Cm$mo-#8QyT)( zKltcQ)EeK*lPHR9B5>ZSibbr7?T=5(?}IHV$`jX_7445v(gNzs99LKQTDj*Q*4TmF zOU>?iW36z`&W$$`=4NISfz<=_H7~PMh4U?z`=Zt=47$IZE&5vebm1R!twp3-NlQdn zV7nb;NgL>?o*_v7Y&J~3tyLrBS1&HTVdrOGW(4~y_(s`NTsU3G+fnh1yb`sO`(oEm z*ypnDS6*8_HI2ts?O0(P`Ja|Nfar?mYs>>*hdG}S;PV67mpJqn6R+%-3Up$bdupX> zHd-o8ineGwmRAs-o{;raHzwffSD+uxYcby*wZ`8cQLO1jDz_A?shF1*&KEt^EO-mA zRqA+Z=3n2~r*~THsD;BsvQpOH*u~d57UaOxPU2e)KaR;&7ieeyDqM0Tuq zmT!0M0s64#cp~QJ(Zx-+&RLDTji1MrhfSxr2}4jy^&bg21VIVi>tCjsYv%C@`NpD8 zo~Qd9<-ElB*VrcQmmXNTI!ppXL9{7RQbX|MDfgkK7$Z|L<&UHXVO$eVo+EUTA~jdQ zzcO2jCGC+OPr^N_!M6}D^c&6OZO%k^=Y%rW7F)aedYREye4ZEW>uMKog7}vWdT#mD z?$1X+gFH!f9Vh=q9IToreb?Lj0geg597MNz=2v|4zB0S31X6Is3kz!8kaj8>G+g-A z*8Cy3@(NQ+l(pL3Y!f`BeLSQb2F3J<^GT=wDpk>eubU7~*O(GlI6(gZFH50y=I4a& zRQJ0JqD`}YgY8d~3m%YD*UrE0;WFI05;3}X^5iBZ11AL7sU$!F-r1--;{Q_J`|;G@ zM}CBs`gjD?sa;PELlG8h;+o<^2dV&#vG8%U6?uZH zT@g1ps@QYcKj(LRZ9hU(wP^)6ootshX*u$4cK2>aXU82azi%tIth2k6s{Ud^ht$6! z+xU5i1#QWkKduvBMZoGH5oo?{5D|)oxu6{yDHvotZT`AxGlrB($|g=Mc1d^3!24xc zKuM5DDl`TOy*DQdh5elI!Pw?_LhzdD2KN1I=vu{V?4SYskH`O!3VG*cNXDFnW$`gK zWfq&o50|T6rrS#jb_?SbcO7Zm;gkNdz|_cpxBmR;IMFf-dFy=rvR`X}-JOQWJ_G4^ zf;%BF!E}P%$GOjSt=WlCjcoWTAvUdfMtq_qOih;a0)tZP>!! z)G-!m^Pi0x_?!ipvs9i0{Qi#EO~24;w}k`LIBP!(4*nhXU-XT~f|}d&XaZF#0&$s7 z3i`Wm|H<*>^vCgJi~qo0@u0sS72b+K`Ez?}UcI&NB7HU3*_c>Zm>Mg1*Vj>Cni?gd zccQvF?NIb$W6t$mQ#%#c#d?9afAidL_A#-i&ek|U4}-YAKO$IqUZC}hdqz&N`HQCB zlQ}9)-_|q@3D!-E-#*-Zo_WW1TqAa59vErIc6=jtq`vzWJ_U5%d6|YO{tDI%>h?PN z2yfi=4TF;IOehLFw>m}SQWFUGCn{X~{gnN^gcQX3_#HT4h@7+~S_jRaN+^!%B=~8w zNAsu-7Xa6&((ESfLZqH>B+0&rv_DrQ>(o+RADDJ^yy`uI|26(|L(mnefp*QqW4EF! zrm#*HC9E6b{u2(fZsXdFs+?vbk0y4!VHPeTcInv;rOlH%$fX#H^6j>XnCtzBD==a% zmlOH^6&>y4%k~4&A@Rc_Vg6Nr`!hR5cip#767DHv#Lf5H$sKa!R+nf?swl*_=&@ZX ztT6W0WcK3Yts6P9eFQtvT^ADdj0_I7G1Y^GWzCw-xeTbG*aG%bpk6TW=BlXsU3nVu zCX>s|=Xl1qC5UM9DNR41@-Mc%6^`7&)dE{m8nBle@y+cdfAqj)$SYwQNWCVm+f~(hfV7q0}XC_K7*$) zq5jlcC_C9)wpGKqRs78pX6YIu#LzKwW%kijR`}wU0kJcs#weP*)y`{_m;yYWH}z#7&v%{^8I^d-}1C&#G;3P`hz|>mFR>_bsD=h zi!`6hkGuJ#$DiV!@Y_$4Ag)XFw1tUVc?N3tJQkyuM^-OrBB!nQQ?By0op?hFQw?$L zKdS|NWXz{5@`e~BbNkg|{n^<3N@NMwblK3VWY3knwQ7w)0?m4rRXX^bCH|ES$YpDb z&5w06Srnp~N|4YCIcmK&WhDHO zt1x-R2hm?XMkkhFt(NNSQ(k*()D6GSm7%Qi1y75aLU7AUz&$wjn< z&vl4#aX5+xysMkGm;EJO95;z#H+6EYqgq@V!5SD#Nv}Ednecj6Qcn?^VqDymr_QW& zPb52yyj{I5xiY?dN?1{W6OEg7CG6{qNH%6>;tT_zvo3P|#QxR3NrGlk8*6eV0bMD~ z>tIU;2gVl&j_u{OYVtp2OWX?OW__z-oRMvexZM1s!D4n{RXmI91O(=3y&7Wd9D!rT ziG|_M(sM2C#oY_PZSTO|>A6`b)&uLWK1OCD+wtABP3k);C)9ASrJO&&*&(W66S2(N zRZ-}pMAEbKiJfU9t6&x+UgND@%oqE!%VP?pfAP#a6ih=)1Ko~WLn@STD=#2Gya)Ju z4(!GiZJTSDs`Pdom)KVxOPd*iY+)x@%T>yR-8O@G*)95de6fIV-Xr{iw>j^i#SRZXo%eb?? z-Tic*Y>k^*oE5@vbQS9AlCwkz^OU>P_F(scg{_ZaJ2=H;TaB`eZh?R?gl4VC4hbr_ zTaf@npy(zrnx(EWF2zP!VAATyCh-cMr@FO09r~Q{xkYud(Ss=8?6S-y{@M7vfjg*N z#li%|3)5W%^BTu+is(yHeWC_ zd0fYHX;MWxgK{NwyHN4!9J)diT_84|;y$RloEeW|v2>*plR$a!N391p5}GMV(&Svn z;ZW`;q~-`yqpC^OdfTO?#rmK9Pzo%=X%rX=yE*WDKmT~RJNfOezTpE!!&c`oL1Q-F z>bA1$^f3R6E%amQd8O3WsawQN9Fr_u(2}Fmq)I5^jviQCE1*HCS*%HF?fS7#XvfGQ>PdYsTyReu zXhL`{X$1HkCoAnPL8CEAAH9+k@EXmY)uqD5I#S@oGWZzpnQ~0%nddgsz z1Hk8T825BsKY^_UHdmA}|6`GDlI0+1ZSTr;$D5NyPJUa?`k4DK+808Xh!IO^+4gF$ z`tw@JI>tCUeCI>6UC&*a59yl4eq$ckPTnO@YY899sn$}dX4?hDvu*1FNV?LTTJZfo zJnZ57I6)TRdy%2SucM7>hwl&)?kTxiuCwOm6>EpYA9|g~`>ZjMk)Kj!qOsXRb;@S^ zQb8SnAdrRS!~3;i6wCjt^xj3hoD)F!(udcyF%TpY)g} zAJ(`=m1HDLkpa)|d;rgRTa`)#{66$x7o3}^cEcKRcb5!jgns*Dj9mh4&-Y^{`b|cw zAf+%4#8|ydw1cbj$1ZC?Qo3R40Zm7B4nrerr~SF3fWUaO8T~=tD(|Oot_^N?i!jm+ zpp%IIRWp;z=2sE;0HJ1^lCn#DK@weOf%5QPJ)oF??tKx0`;a>O`IdN^{FxhXLMkNu zK=-Q_{TRl+Np?Ds3<>VO0Gvu*>}jeGVkSW;C{4WD{#L5#r-+E9chUu-{PXAUR-t~ha>6T1=;iy@D1y_}%>RKRU^|=65 z>^UN>EbCJ$q%)<=3LgiAVuDBvQWPsi??gPjNj(>v-QPolFUgH}$=C^`)vZjzq2!ki zLxx@#w6BT|M1bpOEu)(C=XpfUHZ3HBy9wp)PgaAb-s>|}ca^O*p^D4hOk~dh=D~=8 z4eh9<6p3t>*aCfD)7aD0gt6$>dp4%YiZSBl+NG;?mx=Sru6oLi*Jbxlf^N$Dc-M^1 zD%7C1G``F$wh&Jszds@onJ?)Y`6e*Sk2k4z`9w`!Lw4 zxHOkd@@dFg-p?2fY_rEm*619ba;nyzW-UGL*(<~?i%q$@i9bpk z=Ak-gFn_k!e_xT#uJ*W8Z?PxGmG{$`)(ATX*N9S=Vqp(2Vjzj}#>5f|3gnzmn0~+= z!d8nKy#XF#uRE?I!Wn(+_hI${pOj8ux{(UMR3dqv<5uNeb|)kL({LAe;Xp!v_s12Y zt=c>2G{DcJjl=Pb0wPlfT`Xl}^eHGtX7W%_@ChQduAms>Gn`F@=cvUZ09Zun}dqCEH` z+waAYR5KP@rlA{QzOb4>TSL-s!N)iC+fOuapG*OT{s%PgZ|Av(|1?35sQzz0Q|Vz2 z=KBuDrRo9JHvpDyci_mZ(W}qsOJ@BM+OF{K@rj~5SLOhEvWK|P`|&TP&-Uo!4s=EU z;{o;P3xoGJ41w@Zj4#AY52N-q=N;2KB_I6EPpUvqkm#w)Cj#G3yntXRq~DBQ;ECYe z3FohGXE%%--wC6u;Wg|T?Z+U+*@9(TsIQvcG~ zVkTD_ImZ`gqmH3#Xt$BGfdzx6?=`gZwdMy)J~zgLz#Y&k!t#GG^VJ*tF8Dba24`*^ zzjNK3pYcn!6Q2~DJEG`P(n);rcY3UQnS}mrwIC{O|2FA_GWplpO5_E?{Fq+$z&YVH zvK{E@Dq>3IX1MmBXR$45T%wph^Fy}6WW|wE7h~!_$6_{K^+PpfSD;)krFMnxJWIfgfxD zcZ5`h)wQ+N!zY!*CVZJz)>6eNvt^J}J#qEE!G`Y#z{h*6z zC;#03Kf>NQMw9647Vc@=n6|BHThpAjjcMDqZQHhO+cuxJji zf2>qel~m5zRlD}uE9YUQ$MdVE`L%h|wl}-a4RnOqf5HF~tQ?m3;FpLoAtMOUuN-xk z`Da5c>s{$0z>r9J7N&}b!Fc2YC--HnlmnkNUQ2ERg1Z`5@NS0yF<=VPAfQM5v24CapSG(_7sPwdm9!CEq&+2xehOiQlb zk(Um`hi~E!q=Gte@baX<_mP~!&qHd=xi-$KEiEb@T*QoFFE%4_=L{ng zI~w8As%2n{g-`2&dhw4-kOokkkcLl4!>ZSla~=`%89LsLQ+l>%Ov!GnT@+BD4S4Vb zp|S8UgrwBpYP`R1jK2_TZeC#EL$Q89Ed;p41X7@drQ^=hPyon9?Qdr9fr z1FNEl9am!RL|}*^p(f)%CH1+t;gSfk8KnLw_*7lfJ@n~i5H@-R(I1bC8Jj#BF#WlA z0%tf5KMtsmeMg#ZXxIGHDd_KE^{78M=Z}#4IYq3y(|gZ+$H*|vn4&1m3ATeQ>mS&K zj+lDQ?_|w{cu*4V1!MbnUtx}6^KNuWxZbHm@;K~R!@2}^fhS?t`MJYJ_=S7P>-ri6 zI2)=~R7 zrx=yKUn)m+WiMPWQYRcqP~QZO4Fh7k-6B;$wcR6qkkC=7>gA71W+9~OVM!R}UIPy6 z#!6UgK$GjDgQc=e7=)^#A!|~$#!nfV;TuP{0ENl({Qea*$|+l^ZYV%V_82`1+EaD@?mWp%(x4+_HHwCg_<0!e}2nr-%N&Px{wKcZcjm zt6RYFd^SuT)SiZDsqu9WBb|hV*vPo3tyjy8+f;T}{IQ%p5t*wO3P?I2pJk>6g9(wZ zJ)p$eJIP`&OJ#0}l|w&}xY9T6yQp8w3Sr&q1YYV|K{0QO**kVnJIHeMUlH?8S;N~* zSY~vpC)1p15XMD{eF8RJ;hX2;1!zTaaSIhwqJRd2L#E?GaYU z_!T|xy#MC5%JWv2_FpoKkvxQ8bq6u~{a!B|w)mwekqDXR>ZA(8y42^Y#{xVrUEeVA z>cGpE>|jBzL~@jf2|d4G!;2epOd(w zZ%SI8Z792Y>f*z%Angd<;YxZShNV)2)FIu|5*+f4=N^dhsI`JoHri_m+1l75@zKpc zt{#_GaaMu*d~Tz%CIrWRLr;z;3ox#yW3GH{H(8%AtyrQiDj|Wkg>QnWP^cwFhKGdj zF5{jP3*KAB^H19ZymW5;i{uiJ9jR2Q^kFET(am|&8X}lB21Edfu51;Pqffr>@zFrcoQ+M#6!a@s2LY2z87XIHS@pAHfegGx#D$N8Y4z zkyy| zcw`Z`pR@*&+mL?~zo7S}1DEVds3=%y@W3QaxVjXJ3$t_L9ZQmoW>vqeXe$KXmb6{g z6#xR1zlfRWU12A(l_#$R3~78P6tVC8fslEhE_-}MDeD!Lw7Blp7Gt)a59yytsylgI~%sX~eEzzZ|4{*c<$ z(p6tSlLSfy zxx*V6kz0*k9ranM+dGM-Svloh${RMsvk})Cb%uuxMeb1^_SU#!TSpRJ)j($4igL<` zkqF2}cTV9Wk+xb|Y0}C&9wpU_J%8{c#!?PF=0A6qMOZc%DCCHqoXOh-PDV^XsbICwb6^#2eLjPq|wX;pMY~Zi8iaSqxBrA-GzoK2?hO6kVg! zD%UlU02R>FJRFJp#q?`#hxFNm)Ng;rsaHPG+Tr8Ti>}&;7VcA*6vo*&2Jh!^&L<5^ zoieCDQ%6#s!8hEb06I8I8!pP4XLodYmOoNpRouJFvN+0}`a8M3y9g6_!uUo>?DIl7@4f}e9#9cc(zX*$)jn}pb!JaFs6lhoAPy@xIp@Pi7_;n;)x13CEd_a zQB3L-N&h93cpb4X5l0}Z5;%52jFMNIj-Vc4Bdn;cf`k%6;08?I@6+WssJhtsHb3DsTUcBN$08CgcH0qNUws{T8q8#Fx-_pT5b(JK)b@XdPU1my z{1z;n15Z#IbEop$a4xj$L96Zf`+Nf=bL`qD^XK{uasEy%;s8uLF&hj0oGB&@mDna2 zM!oXTvK8S*aVGdIJlG8FwA^tSfF6`YOI91yul$ZF6zD4U$bJrZKm?PqmKntGKZ)!@nCO927u_dqj+CtUq4tQ zyfdn!COQ{e!wvpP*AQ;%Wl76`Gbe_@jXp!<#c2gVHnw4I`s6LiUW{d+5mH?Cfq}wH z-b-+A&Dj1I9##ZKXb%7v`3g*;Sa*ARn(sTb*yfe|vcSlF^OvLyz z^@6ODARvpGXM}KmBHY5K+9pBL6s|Q!ky{k`N}y_3LeHo>tO=(a-x!3@mOBJ1nTevq zQU372!Lgfjl>lG*dErNP*e(|lrhoe4G#0%mX^KJO$az>z7(X{IDUhoeR)9M$g2o25 z8G00=8^6sCf1I;=-Q%F?O97Vf&V3d=T?q^ZQQip#LINz((_tfRaI+*1Qfd}#y8{~o zH^8qzdZg@uMl29^S*SU9~|9+s++PINDf#-_CN-(>}t>3=t^1{EO(%Q`U* z97jQ->nOsDYLqr|247NB_wjmKbzv@Z>nZXXKYj{bU1|32;YT?mdaqlT=B27S6e|{p z2}Gw-;dAkn7cJE%|COI4Wpx(Rn}E$2qAjVg)_gE$wvUaUuxKF-Qb>9sDqgw98}DZ{ZFFg11kdEX&T(d;P7+xk4|>FIEX!K3sR z*ue&x(yKTfOA>SKvK3**D$DUmmq40GoK8GijjlMm!&tk#*@q3^*g=UqZ`ip=hHSqP z|8EWPiG$v#zW};5V9~cLT0bm*(V&}Oz}96n9X{fT2O44S&Jq^YNo=Q8=?sAw;XH*5z+03-0YQ+laF zeZqXw7FRG*G`}IT??AM^$(?wXI~X)@|2ENsMV|UNdZ=e%O$?A!a!tI8zCD@1{?V|_ zIk3c%sv>vnnyA*XR4=c4)l||@$I;!gQM1C5qfKE1O~htn;cnyJ>{Mv(PDF90Nt~Rb zN--Crq845fVvwke)U=)eNxU3H^rY3VbKm07q2~bTf5viDyE) zQFl|f8q>no)~|=UQ3vWOa0fvAY5jt;z#-O1qL^MJ6PRD%)lCRVesTMvAV-j-^G8$G zh(&vURy^zJwu@xIkD-r89L2PFJd0sWzJ3K}cQ}>it$S6c)KqwNR0IoP6bUmX$%N{T zAz_qs{-Y}IIWS73lH{N+72{;xI$7~=CpK*xmFcGE8_Z(}mPG>cYaq*OPPxD8Ve_q4oVSMAVd?OPr^jX6NKs@pj z8I>~rsr4G`kkK@QT;hIW=ga;44fVxhK314#&bW0Hto0Hw+Ow>C`-@l6{+6Q|KcEZ$ z-(v$`c7eWc3`^!o^-!zaS$^m=4T6U0N3=#!+Kv0QDsx*R>MabaL%Ao@`Cej}F=XhO z5;CoCt9V<2yJNJ(q2aa&X8XRx@p)?kvIBp|(X|bb;Fa0XUHvkC6+DEZ1cY+}A|t^r z{Mj(UY+0_`SmJua8=!3v=zuV<;5~DpQ5rU|d5+YhUHGp|zoy>>H|LMA5@MBB+G)~v zXI@Vljs|Q-L{ceEUL0jJzReZ8k{T8V9{zY?1ImFfiKi8*iMdsB4%i{Fj_r!%W+*J- zO^%M{K!^lHwd7O*qC&f5l49j`4VTOP2T=CsU+$_2vWcd2^nVJ4l6!g; zzIZ|ODH$cy@U^R3I?T-dTJ6_6y&GN0-Fh!4@HP1Ssuoy1l&eOv`HaRn9KF)=tsRA0 z5pVs{h~4dfRr3JWJiS%>1|LD)c!$;cI$sDpzV>myU!HgXW1j9zeM?7gG(Ts*6k>NP ztKV{-Qgc6J34C`O1Y)0Fy)X3mzoGcP`rhxK|LZ=WTEA6e1sY;(zY_^|fronAUvhk3 zYuw&eD_#bl^M<6Gr7M)N-)hnML7zu_eEfAb0$dA+|6Jqe4_&JTyzd)b5^Ng&*3%8$ z%@2}h`VhdGrbrk6w7vf=)_ywTlTiHU7{g%&RrY5DiuKsA#4&Sc-w~&VaS!^H5ykK? zsUdZ-epVP$(suP=-RC;z$J%>?Y}wd4NP0H<>##;10pj{{-pMUf*7 zsE6J0=34Fj|5(MEA|*(Zxh22|Xbg*Dj&(V6rRTT8ik6bg);npSpB+LWtz0-y79!9K zgcG1=D);3780zj$y52OvN1t3EJ0J^(n|~ppzNP`WzUIh&t=VsPKRk{eM?KOguxDmm z(H#K}^rhM(f>yeP(2Lk_U4;wL7&f<+Vy>}?yQ$AFZiXl17X3JtHcqRuMh#kqc@S~K z(na=Il&5jywLkD8?K-HRqdNA%EE3(B2&_vsii8SGBw*t7`uMil`AZ&Rqn8E$jy8YM zvi-GIeL;jcd>16guJ@TiXS?$=M*HN_e3smS|vZLiULfJnCrwC-7mH$wH6j5D$UA3ES2VthZ`oq~LpqG*^m zP+WK_^(f%Nc#kn%kAcJ%>><(%rr2ZxjD(~hi|wg_1oCT=NX4g5*1`)7I{R^t!7e9D zg$iG3K7^O3dmsp*PPNewQh^!n*#8(JXO0}Mgf;>Sm1_$ci6LVM?j4~3H-twPHlCC+ z{49i`P&))G425aF?}tCpv+!+R^c`f#SO6RZPkHo74^|?l61a>+z`w9!%7VjIJhwl# zm2?xRZ8IPT249z|+aJrE$YmgymAa6yL3Y(b#Fma7aL#3sm013mBS)T&(SoG!=+Uk`zIM7D>~a zJAlsInYz16$*+HEXbQPb4VDPu2%geQCISlBpWx_|2UwYy4Pt<}T} zftaI8xfE+JWxqPWW2~~E1$(yH1j_|o3O{yXL#f5Dx#3KJ>RH_fc(I9c)2Ol%BO=Lc zK#l)vZimU-1KmJI zk(JyrQ=v|=UX$Qn7e>8B#+1PN+lw)dmJ|nTL2tw#seVO6u!XMD36=(i7RvYl)!Dis zM47H{4nNy@)Nm;1^>-80XH0l({!{_c$vdPPggFcXv7olR!2zDEG5ESWu{CMyagH=x z5Gy6`^Di)yKt5Yd1x7(^H^T=>BmHr3E~xXYE^~_CDvEKYgC-NY!vM8wf_tg80s68T zZ0Tc|WEfOTziH6>6Cjh&!)?#$q@ZyVe&om>6Ff>kFz~hT%gz8%8p47pJuYN+s}FY7 zG@4RcXtQy04K4Qvl%diOwB1KVWeGh&sxx3R>(@+y+^Y}!j`P^he^IW!N= zkE0rd8uC~i*(WByNhQn6`f`MkFfe|Q=wVR2(W}K{5t6jewoPgo2xJxn`J;O z?TH|x{!pZkHS$;RXD5x@r!!?UCuGX|1(9Pmr)*%m^gxzs5}ShkM?mnp2l}W(Qu}r- z>gqwbO}xP{WwJUT8fe5}UHSgQ-+@@KxQ~&Fvj(n7+?*8N8HlYh*IPJJdeky!z*Brq z6NpjQJG02-%v4r_j=%B!!)Pcjj#HTlIwr{@v@L~8!dgYNw`=x^cO}5m`(;@~B`jFd zzPVY(YHp7>!C9`qJNz88FzC0=NFy1T1G)_hE0O5Ge0C!kZ%WU-@r3@>8{?r7!ndA8 zbmB~q`U_5aGA>8ZjB;67&H*eK6L%~+w-$A&v^0@wF}0_j=)i%>jQSE7R*T>R_~F$v zHVytg1%iS1p^NSF_fFzfN)}9VR*$f=$;B2&vP6!EFGMU+HA4c(_E(o~fy_Hod54uH z%4@~sMa(8&spoNw;OCNxc+1_M(ft;7djSvT;QZdE&FEDa&&18_-`R93mD2T&n&lhd--*AyK@e(3HacXgYB91+G zekP){wV5&`f#g5`eKlC}cHyqCHxKxuB`qd9%I7Giw@J1SLK6$lXf7l}=hD*J)D+ z2c+X)PgglN^1YCIz7%Ack+sibJT!Gv^*+c_hDN_B#4p=KPpasTxwunl$ihF=6A#yG z&A}|^F@J&*=RpnL5>ZFM{-!SYnc#sxUkWWymcGpKC>ucEDEOxq9vXjunjl{p_wWefhwf_zT8T z*81?wi7N|s=-%b=YT^%WSD?D?H`a*3L<=$F- zjwXYcb4Ex(foq$v+!gNajIBlko*bGP1$HkJEYP)owV4=~H=Z_TKH zgE<2WlpKt`BnzkBPH5znZjQJ!en)MVnn^wdk}9-knuK~JSd>YJ*8Lx@yHw{xw%spV zO*Xft0Vj^4}Wev-g@@=pmI>X;GkbhF%JxO z-?O#jrh7dP3Qh{2hNNk*SO-fOXCwEb5$Nop*&${flv=sPj-v9caPTth`5H`OIogqv zDLuzxN)aA#5cl>y{CIwmL_qW<{SI?94kvDK%zeVydkLbS7lmKE{3*cL7zjch0U*57 zg=u15%jz;HGz3Dwy>V2MdxwN6V6pQEAQf)!7W#;(eLf6 zn&mfLEmGevpTH57X|<@GRiy2hXhD@b@emJ=2u-GNM1fQR24w}8Swc6h^rY|_e5%MQ zrWX^qO8zGQ5DgC*GrVKuwWQMEZ!g|Fk786LwWxf&<7a(p}O37ez z5LA{_oUNj+rT?Y+)qB)da}r3CXmcV15T?X4B+!aymeXzg_i0o$S$(UZSo;X8<+%cT zn3omamI_nHv$i00R(_da@7hRn5h%oE>d2>|<{)+B$S&p9IfM+h~l@L__tqH$hT zNL9SZerCN4`NxorF$edGC+s3r#^wCuV@H?BM`{)ib4$j!ucLM3cG#HHOA(1v=jhrl zg1l{U9eaj*7MAc;=byoE)JvUZqjHC$d49(3mbE}n#S1r3f}2*sWJc~XNy@TzZ!d~h z__q6nL>@IKT~}5d$86sy3Nea>?h10pYhiTQPRwfY`nAp8-19Ob-IuzXujY9UpHs`6 z^pWkyJ_<-joqDQJTtXNeuC5%8qL`72*&5a+XH{q?JPywW499fF|hNm`>J-cVND_S4fB_FYt7&qefp*|U3z1Sy~egtc|6^T@~7@; z4>QdP-17_hOKp#s<@9TM+ZLZxsb)%%30J;twTpK*wsETAaz(b0woxIAau`$YE~J;u zM*wN?NOtx+lTkQHOv^d2q@f}~(*l8pLwr`@h2uK2d&5zpV#akEW`*q&-q`sS1ba*u4~Vq9A)Z#94wz5SyGy>3rlEe zSaXG2vhV4V^YzXae|JA7`mextz#hSWgs;ZiRCbP~RSMP7a#7T`QwXf1xcD6c8=g#@Iu?w^n`i)=KhXvQW z%Ut~Qjnxgq7adE-8e;SEce|IRhxZH=%N}EV+imw_Wyj=@*==5)`CX*+H~0rq9*Bll z?;4L%Vk=p*hx9|4&)wHtOyDR~02onA53C-Fc+_A0Ay9y&xmdhFULsBWW)eqkV`+!cq{DPN@eeKziRMKp=3dzr$ zgDaA<`)qN9-S&>j^{ccbqmK^if2s^JQTJgK6W~EZMCAd=Tq|+rzm0mSb1*__5smTi zwZpS<_tUfCBFljSKwXN2#D0=qx%(p1t|dFclajXE6~v~cvuB=n^L&z;Q_$L(dsXA{ z(xR#YeAgk!p4m`EYH-bmI4dv`0JxejYqc=-5~iuo);kQ%b^u+GAA2nPcozYl{fH)~ zM?5RDH+4|_Cy6`ME7>gcqJ}}aA|Js%FGR0A-X9tBm$$mB@8Ld_>?RdpQ4o{dM;yL2 zy5c+%v5qU{wtRzIO4GHmI>$2m*pmfh*?)TuHj*kP@uH1j)7hQm>Cn!o|h)$_~(9T0dJKe=PKl+J;AkUQQ6N zE$|(48_>4lc#8KfRuvZ3)$-0A_nz9R@0b=Nv;f$aGT7Hnz(NLDRtAiDJ-R%mIMA(2 zmS|rVXHaJ4ELf9WX(wMSezrVa1zUQ9{S#&5g`!wkb{eJ`&+>uJiQrL_A?J!xq_%_wg-4Fh)T zIe8qLY<4dVZZ505a%*PRym(%HS!H9UK|tI#tkazT;)-LA5OO+Ljmo5_&nLSy)0WdY zB(TeD6xn2;ueKP_)|0C>9FQ5C{Qsk^vt{+UW;M};e;v2=?ZorL<@mEFJKdW$GzjSH zyCbHmk|y@KI9l;XpS-x)9A7harSQodY$J}nAle+wqELofI{sWcv*0LBiYY=VfW2_q z9Bw0lIjPtsLlDgz)mmzE-e@DIWKMa*-=)Z$HQS{CaU~@Ya}Ndw6Dh@Tfg43A2QSqsWZbru$l5WV?k+D0MZjRa>#u@g+ zd}0?W-!$z5O&3k=NaX`g7e(!`0gX#y33v)Y(F~H!qrn?^jTYo;b#X$Tw7zjZDb0p;X0m#>2@s*q(&igUUCYo|M|d zi#N!gc-w;ASCgJ#TfpY4OHbg%n5WeGjcdI}I-^ty(mq+aHK7o6I*IXy`??~T++&8Q* zj&Dh*xi2T8Z!xI58zA8q<9Gk}p+Inus7SHUh=c@=aTV*I#-=e&^WZgaqaLw+NcfbRt#EWDGkY1^qUfjiU}!EM#VZ5@@Vv;Qj5$@ zboAnri?B^3)grW$BI#tC6E4geEveMZDlT#O<}f&Nm2(wN2yAoYO%yuP)2tyjr97vq z9nl2Eqo+O|el-P^=Jx4g9EavK>vMXKCs1SNxK z65L|kr)J!$E+x%IkikY+>C}xzYU?sCseDFq>r%XDNepKxSyL$lXUSbt@$CzgpNeq> z@MAlQ2@UX)qQ~QLQ>hRQ^3UBQU z|H%0%Eilh`U&l)lJ7IX=#w!##kMu~oO)a-@-h@*vRJvg91WSGfet!zvku;N^2%zRp zoGG3>GItM|DQE;}xXb3GVjYRP|ItlRJ5q6%(M{zzl5v;XNpU^WahKakMLH6G3%gE; z1)#kt|639OILSr(M+$E;y$QAZW-rp+1uZAuZkd}o&&MC#Qa6jC_t{>I0%NiFNN=S; zDW8N~0M=V8kfwM1=AQ7a7D)V^C{THot)kp4G-@V+>s-Zd-q>==X}vt`)WuLEb(+wT z#85qX+R%~3P)mCn(UDM7Re4&`kx^4)d79CYQd50#+R>3yQ;T~V(h+Y{m1&k~Q=uPS zR@@@Cte|Fyvl?Vml6isIQEXGJb-|volvKi2sA0Vd!>vGh*3ywJyK?0mA-jz4B%WQe z=uCMvm+c&KUBKd;a$V7RcHI$rUG7<4n!QoHow2ySQP`ca%Ehhr(WD2bx%6XOOG%Y$pwT*zHSlL1-VDLZb|9|hDWh(vDyWjN40M0>IH&F z;Z7091-(b*PD$$pzDMa!@jqp*N9|7O%LUkb9)A(i1?hVke@W~G+ItayvD^jAdli4_ z>;>F=K~E7QhxAz*ug1b6PU5GoTDdwjIgeDkd;5qaF=0#*3tO~NqJ9}f^lu$Ayo{id ze2qftDLH)~*asyW!-jvJbVtYUytEdrMVHIm<#JzKzICs+Hqi}MK#Na1vbT8o(} z*g_9ZEt%AaoxfC;*Cuz+8s8`xjf0Cqfs^RkCGwOIspf6cgT^=vi#CQUZC2^Xb{zWg z_xoYS!4%-yn)@l5+<4K!S9ROW_C^%fg&oOOX=`W6zY`%Jytms&{v2b=Ge>)yg`)8a zaj$d2#I)!%*>D)xNAowPbHRzs?l&;4Tf0$qw3A;H!hllAvNG!s=rDdiRdH%K77?oxVGv}vq-e;` z1_e*7L4@ju=${VZp6YSgvvPSgb(9vT);l%7dd+-l$VX&_lo3>NGpJHqvA+Bzt}i`0 z=3%VQ11F&II&QGNF_@3dM{cXjz&c3R7Znd-mNB0_o9qDa;$mGSTx529T#sIz>=WU^ zY~v%y0IXW(u$^y9{S7?0iY8DUfMdr&mp*7Bv!g*|^VW>v{K7|2ylqI+HjUG3Ag;sgUj%Mh1W@4IN(V&rC)p<9PT%0W1 zadaVtnU?EhR_|lRT3b6`v3AYe2}Z|*PCoy`_0t;#?)#iw#i1S0%Bm0{BHB4(BR?Qr z6Pi88qp+NVXex$66Lv?io>!d)@$ncZGLkj_dF5cYOZh1#=CkZ&(Zg}#uK+WVvET&R z2s)Syv<*vHf>1JDh0)!)iBf*TH>(+Wy*zcDC1M3<*+En2#4$eIcQH(JVddX;Z9i=u z)}L1V>>>FLkrNC+a)bPc^>^49+hNxHh}|F>-$q@9GPr2r#5oV1eh=fyi(m?67*^u7 znH4QeFXR16K2#iL8M86EKKVQt1O$$Jh!Pn3S1GiLRR3@nD@{+5ra9L9;KEE~%n7`~ zIzUi93ROoNTJT7I$%`h#NIN3>2io8#=lRIu96UNgtY>TaH1{AX;DBbrkJh`8(3%VQm^P_s^pbS(Mi@RUFL%ux1B%=^1qnr&I<^5Q|# z`2{c`xbAub#rDz+a&4J!Z(ESz>8m~6EilveB7C?*c-mPj8j0XmYymej&CW6Mky^a( zPYTfY4<(qr~=fnVc>@tnq0$MsaMZPwd^ zx9KvN(tY-u(6k1zDX=R&!q_-H029^JPhO#HLW7(}mG8tcyk^YU8`&xx|if&R7;~hwz5txCZinkb2@W ziE}Em8^q|985rfn6O$erg<}5HFhjJMVHHEm+); zG+pDfXxYiXmdWVMq2juYG$FH`)EnJ>2n73k;2>pvh!XqYiicHZ(eu-}0>foqFAt@Y zT8*IUOA&XVh-AW2nM7rL?a;NBkO)|R~IWa_~$>sUVAq78K!?%P$h z^X@qVfHf>Nb6gJkJLA80rtQEjgzjuY3+16AT>0<6*5wJp2Q7 z_eA={-8z_r>}V{ty850r!IYKk%qB3cCB>0l5oF*gaeS zulv&f9kBs~5CX71=s>Dhh1Ay|G&vte?l+;NFR9M&sU~f z!@beI|49TALJ1)H-~l;b?QakFM*Cy`J0a(n3nK8t2NVeY3UiCLN7?t^iH&b0H)C}U zkpGMy-`^mhZX5V9#E1j($RegL`4MQW`=#AN{Xiu@@-hqQK@?;=I6NVt1>8NsB`+%# zdQ(AU$Y*j!#zIW+U;Q^WzoeOdgV*;d?m!#R!t)4a*`+WBNVrWf3VDI2GX*l4)*!;4 zClqVfCzxhg#zviEte$5yZ`I8=oCtXzso1Pfxbh#x;7=ux&v{$``oXr~828>Mt?M{W z4Xc5*Ku{!Yf}a260=iRdrB_tYM|)4c2y(*kn7;i;M}CshhzyAbiL;6nmxh}~B`Ly| z7SfZJVH^fuK(JZQsKd2lT90HE&>Ec4>ax-r{5isD8_~WeS)*A=(moV*4CeK|Nu{)2 zwruOnb@VyO+2uNEfBCwGfFy!Y$nvXS{y|FiIon81r@y3dZO{v4J|@Bdi!8*|GN3Gk zG5Y(yN+V9l`8R=H+@JX%-mp4%t|$uNr|JG|Jgb1uhp;*Ec>k@6m{!0ARiQAF=MBkt zj_7nN;ovLg?!G6`FZb2b_weB+jU`lH%0#XikYdi&K$!v1$`_@xz)&?_R<(S3hTjzO z+|jH?2y|KFzLdFWLR+!sn_`j3_V!D5;t* zu?|7uwqCJW?}B^#R~w_q$!?s@FkL)YHJ837bsQFL;QtfNHG*eIFn^N@4-u|8jYf!3Xi%O;ejI@m0a0;;ufjtsWnw^48=*J& zyMB(r8{!N&;+K4`Pj`Zq7J+wEIOqA!IEFKXY9IR(W0Oz#ET4CHd|B;t-1i;PsSv9B zbPxi5k0j)kH$Wju>7Cu5I>yr)dND0OYna~R0kZ*pN*%|9e!Jn9MSIiYB0&oY?YvWub3w_g_XO+t$^t)^7dLs_~uYUIw4-+59!4;|L}> zcuC*i+T@tw%Lj?~?s^`@ZDLbslS5%`;&dpJXc`2!mF3VJhuBM6#l0A_rC-6643mvI z+VneEy}PwNkE27*2kcBVK84V+R2vr!U1U3zuEd`WFZQ_|Le(3J*$w5q$x6-7Ss0x{ zIga9ET&prZd-OG%+3%x1<4Sr7Yt-phC_CgBmnvmqSJ~Z;O1zXNVK))t!=DDJX|&G~ z>ow2UFw@;2*O9~Vi;)?Ob6KWe7e%yAi3e&~=8mIo27((#aisKiiPuO(60i;N7)NuO zk{8T70X{7*_dRs|#4UnJtzhb{~6_1iO>?w5^H>`{;$$0N5@oyRr#^SdVu1aw;m`qxqL*P#Yg0LO$( z$JT8xWN_k@mY`;OLu*=f8JtS4Naw0U*o(*Hs*`GDq4F!^XJ(#>E`?*haD*Km+;=%6>eVN%b z-^f=+j=BpM zF^t*|4uX;aL9yROK~X>@gts9IfEzmwAfb8sxPdn$=chV*~`F)>>`74tx3F=A>Zo#+(H+U-!@Jb-ID~S;mRs zqAqPT0zksPW;lHxBMMXbvX-_q&fb6cc(gENka<$im0nfds2VF3^ptYjrpP&>>aIn$YTzE{HG!On-y(0}X{#6IyIcm15S zz;{49a%&i|QIG@~S}MD@#%e9ONdDzHI@}eCRBCLw=%kiGAi3CR{yr*@tD~9`Bez(x zwB3JFej>OcP9c#}nKmR(%;R~V_iOf0FqZB2jaHHR_wpGHGMwK)vE%Kx=(K zwZ$IAR_SVIhFp7s$BlBcJqm{51a@Z_kpi$!v#vJcFv8`BQFSD!TAvZfnKa0mCR|i6 zh%?9)z=k)jfH$qVQlDeU8H0c~8Ht{ZPyy~J7tDSp+$x8!H1IQW5OeWCH))Mx(`t4N z({rU|!?9&Lrxoi`)N@?7MeS0>b6U5R<5I?Ra;N3$8L{?cqAvJx6KihLWv#Piai>w| zx#y|{X$`w2o?okDMamE^qx0=Mx9eN4g-Y>cJ6GC$bYM=_r6Ec0o|fQ%0~jOjmNe>~ zAaHN`HLxg~Z>LdHI_aX2dhy=Dn|cGQQyD0ysVzZ_MHA|UeWRc&pbCWx2B_V zkLu$$kgcLmGN#4*z_bh#s$u0hGPk^<${^dDy64Z6#8Z{^(!e19nSv{B#;{DLh;xx0F}f7wcH2sM^-nOae~Iri!H zj|~x-jH$-tRPL?N(fKIKTm0)~YU8b0FzyFSpGwEx6Q-O!Bw%>yD{W_1d)URkM?2o? z=9B%Wwy)Y=gmySB0wsOcReg8GQJ@R-I%`NKW0R_*GG}_DSE|&kc>r}pbXL)^hlD2; zM>W%^?Tq#ma{RjZ4?J)-L}4s?1yrSgfWt9dfP3>jY=mLYFt)hQ{ zEK_GFp)0f7mF`px;r1fR1dc1~tTrE5-CY!tH15*55E3{7Q-Ht%E zp1%Zm7H0`ZK=W~9Ob@vU#VUx{%SUsQzRcLDKYwJ7z`xA&MU|utv1%`|{1OqYq5iv2amaSXz-$@*R3pMcfqfB~U zI@S7^n|1c1O({SY=T^7!4waCKnTgtkBH%edSmQ3>qc*UD2<4b0upmOEi_m0{mx=!fE2wM zDJU}EypiM&je_?NBn5b(ai(;|VXzo17V}MUbh&{A#kqd3xcT8Y1%({K{qX@bA_0vf zQv%79x#0j%pBrxZVl#a}w8O%P4n#@_i9n=6L!;HuYq5~s$^EFfSU4XHs^>(+!r`#G zs(Oo!mPaH7I6D=>Q{zHM&i1`o{c;smIou?I;FDtEG^t0)qR8-ir&FnwR_@Cb*amD3ig zEMewl8vE}KXARFJyl^r$x{=zu{$qsZKse`@iQs*vxwFkkyR6D5eg$cyy~Gu}(b1qeGR;MRwsoWCks1dSP2+ zIk@ffAaA*9K_wCWs54{a*3L5Pb!M|-FU;6dxt@6MiQeWD=4syMz9w?x6~Ud&;gc;_ zf*7JNiTMm-J}|aYiWen<5^~F)4%ph-O3QBV+cj?7^V%v}y$@hn*&#Nvu&}}5C`GUg z$SsrsJYK|`Mhjf2p+P241J!8^DX0_3{tS&t3BuvCD0aXK9T0FBFs9eZp!9$a&?>|h zf_U}$iwP7zrfW6k6vZqkoT)l=4nxmU3Mg*CxiAAHJK&{P^3g{^L3Y9ll<4IpC|Mv= z3W*9M21MtS!%y#!p%*nQ(9%=G{9r$Hi$`+gB!!PhZ2^_z-lsmlvq(> zK;+OX$y5%rfNB4+%{#%!C(z|C#3;bQ0iY@KvsX#XWKYL~IIuh^lT@6KI0Y-wQKyR*sAT(VK+*~|*W zCnxq2&p6@b)05S=F#EU3jVMoL-OPdbWEAaYi zKVekc7o4IgCM9Wdhqg>iHmyr&rb^lVX3}Gn#lRuL+I@zk-FIfzUQmg&X+B)To7esT zciD^jQiwfr(71qlR+IDIHe;>583*1vj3@}t5hE7v0^JcOz_)1NEC2}|0A|j*m4Oma zEL>J77msGL?ht5WsL;kR>^qQv*JRl9kEUxxFQZWq9w6qRpnqWi>Tbc-5pWSndY4qF z&(P4&@B1VKQkgIo^@v!0weNM~1mO4$r~esItBKJB{)-snM&W^5(Y8Vtumw1QO(GnS zI=qM)UZm|%WG4gI=3_gQP}1Nd@%XAkiN4qFMfhhcVs$R$sJiqchr;y))@Y8NVRj)sn*tzuF$?`EWAex7$m%_?WJV zjD0G0A`s(9;^7{W$_v`u+xpaF`uPriMCXoPgU?PET1J!B$m$o^5v>weUQ{v-l!BO4 z0x{{}Jd=3uP3hg5xuhL{>h#H!5V!r2N&mKApNlI1M(?}00;|7(B#(bIK3!;x@m2n6 zd^%Q$6#5*r{*n~M1TKBEvyJlQW)_XSvqcklPKUG;nLX92eCwM7X5$SVHt`AHMH#F7 zek>!S>moj!%caFCK4kD2&Qk91+p8+LD+Qh24T&Z;Z{zgNEoqj2=ec=87)!QxDyrF6 zig=Hx(a%R7%9Y(ekJwQZn&v{h_EwbEWE!vB%WjpBnvkNFA8ID!-BCdc z?csI79&|jYd7+DN%OY=ObMq@ru7{H)5>p2+cGWu_GZOOP^vn0e)||kq`P=7B3|X&xp)%($5Wwdsu}^W=7m)!5GlZLj$ztB6JQE83e}je zreo|+u7+^-cOwrh6RFnRAeHd07m|K#)oo7@HFni$;u!)m^k#X~QXmrj>xk?JO3*bI zX3&tL46~X@@&LMFC3}{$k(Zu)s?b~5o{p@Hw^k^~HbF}E-F+E;N7kFQ`!u$}|I(DI zB0+P&!qcB;=$aSr2bNN8zn%Lx+sIfD4VN`^N?M^urfe$PG4Euu0R z<-%c<k0vHT+*iE(SncBE_GICU0j%CU_e9 z51kby5RZn!9Ef7-Ky^+d3O|J|II<^^K^;1VAjW~ktP1Ee(GPNLP;oIJd-VOX1i_NI z9FP--_akj5QvyhM%o2w4hB82Q2Ydi}J()_x$OBo%@`c1rJ;@%>xZzO72rUM>1@p8d zdSV0sKVzjr92>&}iBLEeK*OwJ*bKCKZ8MS=iH7$>TbL~_K@GiuM4*tVS^CWFpAZVKVK~0eRCYt^Inirc6^F8C+I;wk=-EwQnYPc6K`73iF)~d4`W%caL6ub_~~^N?U*CIy~tmu&k~#+3e)rk+l1_gJYL3JjU4&ml#uoMO~}A zXM?|_ayfG>IL3LKzAgRvHenl4A}k%Rg*cs=>sSuDAX*( z#A__XXjFox8eL>+KSgUe2i#l}gK=haA(|1O%bv?UejPmiqdA;S6#0)LwO=H1ND#zC zd?FzH&49^(iS<9PhK~F{S`EZ|X3*ZtI`%3;amunKG3m(!i{kjphvj*Y^>ECsaWyn4 z=pLf@AqV#DNuk7Cb_=7&zrSE|r8oXUZJ#~jdZKCBF7m$oi!hW%UU^lDR-#x-xf8~`zEqgt8-ffU} zn>(`4Ai7h&nDeoSLN9lBPahU}Do5t?1N%>1*~foqU0IC}lgsN9X} z)aY&9^`0c%pDxwX98&h;gO*Cjqbc=OLN8wVn7-?O6UD31`?lsiiyxqwX1OVhHV`rF1!gU82(->)71C`Rd2*AhS4P;M1@q0xrh z$Y~OE9Mwtehz@xore4+-sin4m0mU=W9r^srr(l6|1SJ6|s{Njzj{kt5i{UT=0i?wx z|7@p!O0)mti7>f?#s??N*UIbW97IgKWc22Ej^0QYpqM( z`qk*+p{mtJM4k2qBNL^h9R7RqimjIDJIONJ60Edt8+H!rc96@^7qrF{yJ~obo3lR@ zHOQuDlH*4ZKC{>(2n??O*TG_gkN0?Yt4&)7vAmDHi)AC;mz+Yq*-(Ce4#$-am zA0*OqTZQ0zKXSb_|2*1ia|aWO_Nf-J5bt+XId>-lf>7iJUfc2TerXW zYbI^DmUX)BfNpJhhtNgfW)(ytft0LF4|PTL;!Wrpf4M{NFMd62pJs)tpK7$NfQylP z8#`KWBaHd&YR(R-){n~a8_91)o+i0YvQl5#KVah0UQ$wjdUE)a`g`*!zOF|qKE z5V)u45~cjxkFtL8ER9J@+rUz0&2W8ttqq4Hv)ICd;bY{080e#q)d5=0Kgl7k-hA19 zSj3QZQJm!J(1@-E>yqogkV6#v5z2vE5^nY-S54!5<&9>%&b(abtfD!~u%WrgRbiUQ>H)1q4(W`K!#^4awnk}nRkK{$D@7?@5y*t-7N;;zAmdL0n d&xU0F2O@Pp9zf@HhMqK>r}n002Tsb2$J2 diff --git a/doc/SourceSerifPro-Bold.woff b/doc/SourceSerifPro-Bold.woff deleted file mode 100644 index ac1b1b3a0bb7a673d52495743d8f86fd55188b44..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 48720 zcmZ5mV{m3mw|?V^ZA_d@Y-3{Ewr$(CZQHi(iEZ1-&G~-bu6n9>uU_cg#&VGn76t$T zenPh_0O=t$CZDAC zdqrer6aavfKmY)B6#&pI?3QYs7Ew^*2LR%U0RXTcUa0YP{YelR1zH9G02tv%m&y-x zwV<2;23C5u0021751$DD0MXxI1+rn_?1&Elz-;{Rkp2fCMd%7+TN5h)0Q$!U5bzHi zz|}HYP4paoWaD;zcz*qd?{5HziKUw{0Dwpb02rkJ085<(T0t15MtX)nGKoJtEdK%M z>%nuD9{{v-TjaA>D`u|Y}lI%%XE~*31^$36jIr*UgW&-~H{Of;lzQZ@) zS3PJvNb(OaB;bEk0Kj$4K-W-LH~Yzk2n1x}>pS`zSB;b&AQTIfzyQdE1sD5I_(wM| z5x^7x2Ji$x{Lj))bNtYL>JR`50QygdvFCVWh+mSQUs=Q-e?PxIY<|XJdJOt;U?DZO zR5dl#v{Y4J`-{JmqX4jI8tG~nC>WTYv{dWQ_rcy?uBf@+qggQV2Axw(@S=a{=zst$ z=`eFYW$RkfvQ!kp7``<*@|F5!)zV({yM7|M`5a5FPpTPK3as)MwV;APelEYJM(ASz zm3acGy&03f6h5c{U3jc5kX-(-t4LxYYaj+TuRkKJ%0?a}ItJy*Ew9NjRnr>DZ9i#G zCu4)dQKsARCA)J?@ZpztWvxil?3L2+mGYXmxF;yKo#g3`v(Y4|Hf+g-+3+$YGLB+F zmRv_x{x@iG<0Kvdja-SBkk~u)rI$K}rtYQ~^Ez(5GxNSgVoMB#*_YuK9oCYWxcDke zwozwkZ;8dSv_J#2bIp%*O7#5Hbz@*0gf z8NcA@wl7(ao^Y?b(Cm>S?&RkzN&9(?9~teczlIMjtINoJ?xCU`Xj9fxCvGiiw&_!z z)i>A&O%NSCwot1wdeU+uIvt$pIor62H=tHK8y7_D%W*I9dkrz8HQ=7rW0#gOykn0*YAUx#3F7_TYRQ-l zVp=9VUf*mE^1M3cKt60*qA}j?X>j)cO4&H(xIa5#jH!#%ae3^iT;E^0tQ9((d~cL; zG`_DkQ#J*(4AH;%vz6|a->-$jMtkc{C5)eT&Wolg96Tk;cV{tFJ!rJe2<-{&ksb|f zm21|Lx>u76KdX;uW3bLt{5ES4Di9?MadfJ376xa^ z93ggVtvrl=O|Qeu%rlNIU#OE9o51tNUZiM{z%?dwQV22k zVla~FP3x4(l;Wsz19Vv>?wZlr+Oq+9B};q$w6@Y1#s3FoyZH4yRd{WVlXi?4}$gJFhFv6$9dyWoyvca$tXp(RJPf>h~TI%q~x-pTNH` zM6Re~ThQP8k39gf6q~{S=98o(H^oFHjNzPPIDGPP7II)l@B34LS#|3!lpi#WnYpo? zur*1#nYvlgKmRsjYs0+@#5(Y!a8~xC8SaP} z>SH(WA>7$wyk3khZHziyNJ10EO_>VQ2fLuC`jQjh5Z}9nhO}juxTd44jv{jn5KAX? zCDa9EKkV3LACltjvxC>tRM6vE&EXNzL2+VAB72>R*u2rDu-XBKZA`*ePI0h>++PSr z3BNgDuMwajo`hMS!~nTse$v4V7^URB{6fAZSiYsf4Hy5TVkB!lF64HDr>WU8nrV?r zK`$DsE!9@_OK^|5EiQ&0%)<@r5T}MM(d+7w^MNYLs z=p|Cqgr>4J%iH$*KQ*7!cFAqYK}ypFz3$acoxyFQ}DOdcjC9=BRPA{ zL_7az$E$0vQpw|S94C>fk*iRR!k@yUKP9Fh0Px~j6^$;9j)A;i`+b`b+A8|KlyUi{ za*D4thbt2`z(yH(({(9HBuR&B663<+-}$AZ+NM1=J$f?@to0g~?cAH$#=rGqYEmsY z%{cWYQmz%{f~^9m$5_T$8rj-gmF!&Y7WRgRjB`honLg!Di%?b?lqBCVbCKM_BViI} z{PJJOm;{;L^4OBbGzXP5iI`J|sikR9@3Cs`lVjzScw0OohG?ECoo4TaT^q6v!DCeJ(~^lj7@}G7_`Th_-k4ON?oq1g`$#Z zLLp#*(W}d~CeLKY@45tP#w{jdd)TJmm~l3cZy;F5SW7T&geor)PaoHDT~e{GR{FZ1kyJkMzw|ZaXI#RIt~Fp@Kd-O&}$DOJ@mGm z1QeY_7`Z}D&?8jP|FXD&THaNvMCZ4PZQl%Cse`oH@qiIdSGF}URU>4`hz1KXZX1QoaY-+TLYfj{%C zRxG#lARR)`2piP_xF}jYH6;pV%}JR&TbykAUve&3-uY_5Cpb|vQ%&3CJVq^=VBPqr z=6}PC*Hb6=4amM0NC#FgXnW8JFYl5&H9q(duXmkd_?gQ}*J7RZYz~%{urBkb>4tK= z;1L{Wu02uh%hxs<fgvn3aTlJ!CZ1-RmvskMKNb0b8lyL6hotuF}J=#5T98b{I}Mu z_vTL3hQ)=6W!NDzhHgw(mXZG%oa)W%$`XPd*Z()2ihfv335#S1<-`cmfWcB%-(X>* zD{EUdm1ujr)fbC^Qs*b<4kB;>KFk9sy+oq;+3TVJ7yx{LP(b|8H~cpe019XofCLN! zfCmozLDmmee|UaubNBm*VtD`nw(p1O4$9M;Sv_~1962-0Ce>=EP8MC<4e#0&lkA*R zlhrk(1c-=;gop;BgP|CR^n`Cjgoc8Ff`b?Y`-q6Qp+9;1h_|t>qJzIMuX9HB?-752 zR)1R_q}`F;Pv7IdW`Mc&nfEE>HPLAiQ>4?3L*e#EaRzhhgi8(8?cH|-cSI1DnTjTM zu6SRIS|X5LOI*o_Kg2g7*^Rl1RVPv)Cr>43i9-~vLVQ6$Fle%naJrlNvl3aMyWnp2{ftE)mpG(o)7B=kNo=r>$xMMCGq?-nFH}{zAperZ`7@1*IRtN%SFczm zf0o2NE=*GKK<;)J%TSC|URZ9Q#AhVOTqbXxwN_cY6uDLfS6*;t_t;?{B3wdmVG3Jd zXFM+z6V09Cw~PpEO*Ag}luHc3WO=)V|e98ZclF9kkE&Mw_eWHKgXFJ&?> z#}P7J1bqVTl%_NMaQJqqlh`wzi1)s(GR$`N-{w4pHsZdT7d6t95n1e9A~W5+P(1w!kvCY)wNOiTk~&q)vCG%{v5NQsypC72tY*ma7emno}iSvxRwD-Y=Ds+&QV`%<=${r zOpWO?HAaa#=jNTJn%lIeLcYcUD#B))0JCn(@ zt3i&etck3VYKj$&mG1MWrt3!&mu`=@sKcr7k%QN@AQx)KLpFHyL*cfUZ{t=}>xlJz z={CxmUdl&hcWUhrms!qTt-EY@+Ds*bEDW`!eRhMD-PZjR&?5^wx zUnV-#f0s#*(htV|s3C~dV4-Q-DRS$_Nuf&l@G<(5h_O&!C4mD{drOcE zkT{1iQeHum$SKTwX+ww0zH&M`RccZ&>E=?mzn^an+RLXs9?!NKavWy3Qx@zs*rRFh zTpYMc4q-CW8XO?nM%b*~uMIM*kUTRR?3Uw%z-x7VgBGHx@Q&GB4IJ9vVjM!dJTez- zPrmVv9mi2YJRoB1xu!99&6|>)&o(i=inGijtXwuQMZTS%53k*1F0MKZuH9z*q@l9d z0=u8~r=e*(W#4XNBxpNr?|?9{MTAFguaB?&U1+ZC-2&mb@F7f8giVJ4lz0Rnru2U$ zfZ#?9aMb-Xbm^QK6!Co0U}9^yhF5pnA*;`Kf6su!(^YaRzPE+yq@-Q%a4 zJ9dRxEjRtX%I~KxyL8O0->3IlLb^kkW_aF{)TbV2$`}!l-D@G`*}o^rP6%+(cDa_79kBkv%xk#@=lA3adCZZah-9WR2Vyl zF!daaggoWC$!0&LYX6WfXMlUuE0nCW$9fBID^~4;s^fIL834qcD4MF!X_(D@LnG`a zY$Grxh-u8!&w92+E^b_C*gxzM_{$Sd=%YCML+$gPHFIvA$Mc@wNv6#tB9<2A_}!rH z>s7z#%=?08PUWB1XSEjV1&u54v(~w|O{cE$(MOco%Fo%B&g%;3t+f@0l{#iV3gS>X ziXjqcm&R!a4I?kCbKoTg=u7G*UG7Hb2wIdZkREa4@mCMpanLwFC(>y~4XK;=z;MO0 zqC32HPuabf|JmY$8Zxqp6q!g3_VY}qRpfTYw%t;HbITPKz~3hIRsocV;Ykm}BeNq` z;}7U&+&xC`LY&AS>oknkQL_7ayJ--W%D@z^UNeGz9m2l?prp#t4nT(rx&CJP*#rOZ6MQK2!H$GNrBu$SO}dJdH2?TV?0M zHGBU&?dfvJU7EOZ@bSE5nSYZ$1?u?2rD4Ibf%?n;6dSLsd} z?lB!C0D*3UDK^l^QM}caR+u0OWiK%bxqlg_Mm`#Q`y4ln!@PF6lG5g|+fCJ$b?XP$ z<7~j$%kDgl-rMh*wJP2-==%E2|KStP3Q^%m;F=_sI0{RqGt$)b@71C^2gD(P$|DJ% zi-ku+iDN4QvVnX&p!1H{1vIL+bt-;$nt43hHkedY$aC78b^7GtJP|O3fEF$tyP!br z+FpNI9353}Zl6PLyb9lDua`{cBs`>jJaM7f2-kcA+?8524&9P&n8eH7hUoFDfnDi) zE94hQVd&)kZV)(_L7B?;I{Nu&Lo6o=p6w(Am7eZvg6rD(he(1ofcAl)vZq;3y{Kck zKm6Tg^O*60A^-Q9VdZ&j@{qJ0{MLLs8m9A_1%-P)oM%Dm*DB0xcRu_j0RcgC9^#T2 z3Ezl*Ltwwpz{BNgkGJ%&)bPkwn@qqFcmi*!8@8&Z&WLRE(Cf1qSB;_fObui3>M)Tp zr$(0ydNYS5j}wx^?2zt{wfpP46z{t{*MNg{VVy9N$-kCofH!7(Z5X@q%V8L|%vCf8 z9+Ey~+gvDAZhSAw>kQZ`4z7^uo zF3eSP@6@&U+_Q4d+;+~78YY8g8<}4;uF@l{A_eKk-l_)&ZvN-m0a^k;BA78 zzj!OItwUn$EG#c|ybIzBq-EeTBAk@`K5=#$aw(D^Yz%4N;6dAk%goCwCTI7{CbEti zHFb<5@QDuRd*wfkdyMlet~abD3%^5^7ZV@|V3*B5-2Tkbk>DUq<$qk5IUdn6!@;kC z=pLhB!_o7C!Z>j;fL!ma_48`~awPmR248Rl7Q_B^gnpdEt$Lm5W_Fwu@KiQaAdo_U z>@(|rN1(lsM&NL2cZ!{5_MmKm`_8KC!2{ep0{d3~XGXYJ09i30M)z-^eM&M?0Q>k- zdIko<*@Etjgq=xhmD@%VHf734y|oKk&yl7NhwG|eclT!sJe+oSPtA3&k*UD>g;mp9 zbAv{e!_7H6xi-KC#AEZ)i`Alp1w<=_BqxB8E0z4*S^pf8OQ{>Gz^UBW6S zHT#@Pk-ee0|11QnVQ6yWFVf7PcFlcW$(!xH<_U-R8x-QD%+ye)w32WjB`j-Z-|M>S zY7WCa(Gp^~dmsiQSSOGZ!3RXH)hC0BKS6k~k|g2x0b)?AAfY31zl z{aE8!ALR>pXPb(3OfH)BK*(^&_6w+-9#Pn&jqdycv03k;oeMLY59-={F5S{Fw$53; z!~`S|H6&OEz7@*ydkoTZ_+t2`pua2vSGYo@k-L%cw?hGizZ2BqLV7QV;DuzslH~Mo z&nZGgZGn^ujW>Ae=w}L^g~zjPNe&mleaGdzLn=>b+lI3*W>iEb`5b2xD#1g7eL*cE)k}(=ZmVWPL zT8H2(4-_yqDO=r|dOFtico7$E)BK8;%{jBk&Dbmw=G4qQj{yJlu}xa#kWC8rr*yt5 z{*WZXdFc6+0vE7h)^U>4palqM!gL~Bya`xXcDZ}+*&M<1F=bmK=X}87fj%s}yM2-B zB_wZGZxSQiN=A1(p@WyTC%Zx7+*MJ1#fdPaJP0{JubJv=X)c4oAE7M2fO`izn|TeJ6kpuT5eI` zfQargS{dsUoJxSaN|}PkScbv#Lf9qP=6e1)LymhE|XTKHUKINLst&4#9DI_v2xVq-;p!0>1!4o0EWlzLhU}r2PWu6 z7c{~%E=&*SBAQxh=AL_5Bzi0nmUTZTak1p<#i;N-b?f9rHu6m zdM)Q(G#HDDz2V;=IJ8}aYVeY}@$SZ$f?C7{;pZzH-I%3-yk~{&u0Icw<4ssK0 zog<>=R7;S?;AsWHIr4Y`yj*dZn>D>Jmusf;9u#x&i?~&L8ycp(nFK|b_%bmw@rAw% z^)8mHb-IEV7QLBq%ZOCKW zN9xH^tns}iAs-|Vx?t?tr#DHz?PqhBCYGF$w=>}a7b^C@==Oq&O)G3+9;Aav6GIT{A z=705Hfsj*sev|VLT(uUZ(qVIni45Lb?vu3uBV7nb)~)0r0eVyv9e z@@S?_LZelT>CX~sTP$;U82HcZ(658EsZt?C!NP|Z@h?|3oDmgJ2ZA%mi{fNHD;~Xn z^%1B>azu&%-Ta%O^+P4MWv!Vf)#5s$!yjQs{R;pArWmYu4LYm_iM#}cOK&P(B_iU> z0?U@%gn-SZ2Fi>LSh+xA0aLAOF*1O1oo9p@D`qL1iOmEde{L@Q_KST^99dJUJ6IAd z7JrSJ67|&WR>XlfcZ`86kkYAr#A#%I#$l@+F{%kMsH+nw5C|bt*uC-XGL3T{o`r~9 zjo+0Xl5vH55j#7QOH*g9uE4ib#3<~X)cmuf=Vbp2yefdeAjbDd9#SILL<`-@oHm-& zo)IEr_0;{JCajSgtSqylj7Lk1@%s?vND15&}hVDNp)K{;rnIPDy!!tjjVunxW0 zT)|A`XhN72KP_4Ne8RnJgWR+2n8qE?CwlOxq*}4MH&yLpL^Gaa!sa2hbn^4H(|U%` zf-VzH0yWBu12XB#7~BBR8|3T+3~-sNGd)*cDip+-pz5UG6fRzqidrt+z^0>L|KuLV z#iaaE!>zNRm%AOR78o~0k^gEcBPyy#tns>SosQ%$bSvviY$@>si1ejbWz~@WIMt@p zSmBAsA>6b?4}B86n|CjN*nZ4 zOhxY9QnT&uXc_~P@QQzfGUrCrTDl1V{cGfBPWg93>=(QUgu^#LzRIOPDkQ&t7vwF# zAUlcqKw5RON89!*Zz>Bt1R?$JjFomIF;U!KQLF}YsrH-Q(>kBnBVrLmK}){35SANx z*S44zB=y%e_A4y6YDU)`#_}}FLEk8h8_*}YHjWhqHaIS8g1l9jf^EB-O^3{AS?avf zb9}Bpe2Y%MzrfvCfmg^aleNGu2`kVli;yvKjnrW5$+{G$3~Ql&3pza^D!NoeZMwgq z-~0YU)1W5~298_s$ zt!ei0YOJv_EUdA4fM};1zz&u-NRsWss(QC7`kSxvFr6qb z0H#A~aQ61z@%Kq$V_jLOeRwG?ctNy#jqHx?z%nJ`RWM%sili9TwiI1E-bou?4c?#| z!I`+U`KffiUs1?In5ox*SYY^C{U|t&7SlRJj@LWlv4M>G5Cog0fUs7=-Q>g8hY{;7 z;9qrPktp*+fZze|NrZ<~$CD1uc2a-+Zy-TYd{$NWnH^TSsdBu0y9KN0(wBr$h*sAR%i$5-awHKc+dZN}9Zm(J$wct?Ex>ScqVLS3#DcGuC(fT4M*Ur9vCl&d4ejcMRJe#^Yq z<#Z&;d*(TKS%oV~4cl#Ij;KBS#y%NNS+thj6Z}0b38}N^VaErQOGqyPT*L9K(eba{ z9YbMSavFLAjgr0D>z7F>B__##kN3^lGBaL2->W{VR9~eyX<=0dbJIH9`ry5D(-rlZ z`Q$sjt5Fk}mzn2pL)_uq%+zC)bE@N+j*+Uk69xmXfu<0N*Tp8i+DLO_lM;7yS0Ggp zD+6rO4!9>9>{kBJ=m(!^+tkdg&3e#tYoDV}S7vrpL*VO_KqI5rF|h?<>c+$Hlj~(cxXniq*vM41 zZ?T|Dud4ayHJ{J*m~b#|2m;@BFGX{=W7clKzcRiYI<(WvbTI5o7>i~vn1<__!Jy9a z16NL1v~ae=lu!afucI#GeP5OzrvLepAw8_uRoavtz`w*3&S`Ki;1ogjz?;hNU+pL- z6Fbsp5Be5D-C&YU_$2t!$sV=! zUi?XN>mj2kFizru@L7g%rT6!w*kWCP&=RZ-CnWXAm@@ zsPDDssl4c%1si0G9lVYX%6o5NmiemuYvXHr^uDE zpA|IwT6bwCx%WVmbd`Tk!58@`mZ}1hd6xtiW{2BAZ8A}JS=5AVPlH<`fmFz0D74jC zb})5n4&>CR=yv~$Hs7(tiG^aa)=#dyAb%Gp9x6cu($ z64c1bu53pF_CP4-x}ICvfy(;6Rns`7wT`_`%2umUz#=qc$~q-tYNq)E${oZ9=mzzv z_aaGQ=+k1*+ljEZP*!{Zg+T&b_Zdn=uAp?+@89@XJix|wra723cZ@o3AVnJsO-gRX zmW`JQi#n)hmZfVy%OESKa9@~{Y^6yuAHCOIyVbm^l@li!g*ls}siGN^z=$5B#M#Mm z>Wi&9(Lhcq@gFFA@Nc2T1d}@<0#f7g%p^RVPYkt{J1!z)rrfYKK zZO{sjMheSDt@mGH!u>JC3BoKsI^#xWOQy2i9(sDU*Ewhj=QI!gr80?OBv6!0-=&u9f*iqO`aH8g2FDjU z8LTKKWWKp>FReUr&%Rgm4H*c`z~itR+?hR?NtggRzUk!l(4j;GPuIx7cVeZq!DSJJ zptgVJl(;M7qG1!*cFZu z7`(_^`+ToXGe1lZ@&U>>=XWF0N=Lk?cD|5@ zgq^ttowi+2-im%Aa~i)g7eA3&v-@0}cK=f1KC>L&)45gq-D;a^wW4N~`Tzc@0HzKa zuJB^Tn<}V{m^Y=HdSI7=Ag3Ind>|-@PDup3f*a5`2&1nSi)oHmeRT&N42G z%Wa!3=PIDzoG)@oyjr%#eOMkA7n}_2Y|84}undH(ryMly@9zs%qPqho!xo#&;07`? zVIZDqdMbOL|J;zb`=2mEZI}0EMWO>|>FmF;f#C`GOr|ZnMTc&QXA79m{<_kV41Qw3 zst(jJS|z?IfZCv$K=Zp+*pc?lKzUIHyV9}qQSKyk&`oQ~_lnxKtWXGfkb zpU$FPXbB!uQ#UtZdmM9|D1{p$`7bxcp`mh>&0jYWh)66*t!kxI)F&E#;#u40aYl-Ui%E z&u#8(pR(ZG>2hwNllEUn6Dm|w%ai&i8s2ABw}XTw1*_+jnt_3d7Gq{ccwU3@YROQT z1}Re^+SP>>b9PRv*;%s;#zWiBOTntcKy~JH?Xq&5I$QrX-te}KVqXl!4LO#wL(M(y{jtHtNN*e~3@A){2D-HqFb!R6qo&YH@nUnefJE6xkXi$Ju zTWX|;;Y?n$u&-VDE6O%_4w3@jR8oyAcfEwwZd@<*6jJME9pZ-7 zyTa?T)Sl~wyOKQ(dVLRVE6vcM8WemoLa-IDCv0SbUxi!3E|#7No#56idRehRR7z3N z-dSu@n`Eds>@*GL=)1%&b0JcCyOm*AbkC?UOlr)@YwB^AjjA;5l)$aeYhmMUzzOw0 z!YuRQ1MngW>?SQFa@2us$&H8liU)2XsDS!X0=xR_jrxHJb|nCg`k@DQ#gB&i0Rg4? z7Y_9!1&YgeM9jPy*faeg(#7tYbz

9E8XSY2)E(Vq?32Bxtg&VLnC zLbQ9O`V{KlN407-%5AWUvWt^9#f!)Nt6U8!>6(}HfJKs9+b2*4c~Aj8$P52pY*=_E z+kn#R<1hK*e(A{lED8!L-ClpF*lTzSY@BDzOSh4(P2*` z2gXWHTDs(AHAiEjf-I>QNv35DC3LW)JO7F6#R^k4HIY&m4^a&DP_P05Wvap#oSD27 zzH0qR6*>x@aRjv``nQwd#cK zk$Ik&?x&P@XbcPAj)YQ9hV2BO)JbyN>^I^#XXezmdb{6xU6oK`H7TvDAoY~ zbti-NwEo}9J2WVAeK{&S+Aw5|Ftu;31XrG*YHw;R=VshMY<&H)}nc5ZeK3WixDXL1m=q1466DRic6uL$V8#$v++_i$T zHjI^}rRN{qsQuPPn*zJ_2<0M%tW@-%croRpG$$kc!bTyBxriD``px6z{=7B4U6I+K z)sW=2APrV%@*aVw9|+49ou~52j2b`?Zw)w5sf3LQvpGMmkR_tgMq z*3;x_+yoLU6)D(#-jSm9T>*qvTUptd zhRW?Gq!vv^O=5YbK$R)nGI7IPdZl&vvYs}V3R7@N+>G0W3CgJIa8s$AbX)c2a57p5 zkAo-5Y|W2wu!_;fd?e+%dVTe|h<=%$_wOn1C7Mi@ zeNjPe1%dt3Ht97;ii(lNT5;v0?dLHU8ISxJw@oeoIrjP9ZVPQ*wnO{J78|O3=cg}3 zqu!XHwAz6EH?hbMFk^w?@pp)2Q`CPDdOoN8CF5jck0_~Zy5J~LEj)+{SX{&e=#yHP z;^K3yM~TCxXD#J4b=^(V%jV+oN!Db; z8^bM{1n&(wm_%oxQ$g=H(Uu5g4eH4+?x9kQsaw`XL2Dqj5ofJSq}%CZb8XnR)Bx7u zSF<#rLDVfI#+%OH&Zvj12Qhvdbj;~LIv+s|!BqXLpzv^-s{B1R-fr=MRxpsEy*pOb z_z=E6yd4X7V9VUxa$GXCS@3=$t5alA|j6rqe1@v4W} zd4mVT+y6?*&&VOJSJbNy46VKan!!EFIcBl5;W65DacQ|3H#f`Qqq4OKtU?t@y$h|) z&)e@EMF}Rt#a%CsNZLg(kg?6PGot)wwD;u>dL}I5YA0j`ZXnq_g=!(L?kHGKM!1yK z(KY?DbpJk+Ft0a65Xo!lg33VaHkPb4pd z3=J9C>pnrA^FRvHIA#4BO}?zLgf98nHE042_f)kO$yvkzat=34kh`x>x0_ZaEQ|f2 z;m(*xDA)ApX!uo-nNr3?8u zJwBI@7wzNcVC^v$CUzn9BT>V_H^9V=wnOe*38)X%aa%>f43au}@MUa^Xs)Td?TON~OO z-?(bSMHLb7nzp2zqD2W+z^VkVRdxBrY6AUnC%P4CV@T{#+!7XfX1W#er44R-u8NmB zE}NLlz?fA8T25?rx`#ejBxp;D$Azfyx2DJr_6ggo$QNW8pd`weJj0c_M3l2T~3y*Fmbx*$!%neKbCw&NV z3MIBan+hx7RNr{&ORxFBoXcqe*U3*u>Ca~zXOUxqYBxzb+yv!2*BTWRhNik2RXe!L zx%Hw&1+@5U%$)zc48{6g@$!1}^9qor^%-MG$B!dz^BLxf<)KGOIhxWyQ6Jtn@;AT) z3~qIVyW9M?j!TdcE%*hu)>SGdB#FypUAMhQ*m#M@rz!j}U+0&YZUCI-m0PBUZ-<$? zo!>=_-*!NUOT#0EC0qT5c9DgFeOR(eN{X%K9Y#w)I&9`r$amT*bs+6x0_U<;;RwtJj1Y~NzGec=CnotFUzQh`;;f$-zZxc3R*L!|%Qq^txMqg`I zcig%<)#jv#(97=CjNn1@UWM7mlT1XN7{;@PAPeNvxPka(N+bI(QzDXIW8$Us2{7pW zUU^5@A(cafb*q1Q9}K>to!(K@z7@Q}*D9RVJ?GCNAg@|y%pZp~`6o@ZKm{np4A!BC ztX`b3vAAt-WAR~nZhOBXLcsJ+_EL(hR%mFnJEY=u_`FN}aKEB^UeD*U*l-K*w9*H@RGrAo40joG3eU9u`_L_B)H#lamV@!7KkAtWDzZ>OgnZnBqp z26C=}y5$kdsy0TJaUuEvg6!;0{>F~(wht8-JdAZ{AfbZ&mQ;zmccN;-^P|CQ(X-DS z>svg`b1Nmx=a$8ZizrUQ3rvxZuprw znOhsFzT16{-iX88y_c#@8N=<-h`Cc(M7SeYE*`5 z?`zCmo4p;3yNb?#?O&k+!t&fwtlozw6{!!V;KYGE8X1-v^agq@JzQITKzHG=q%}XF zxdsB9Ib6rpD((YamBt6Le&doY%`wFusliizLYjZOLQpdvkDk$9)mF@r_8kpnll26+aY0GnMEtp22|pZ(%})k^lI+t$+T!9*=}Ws}U(Qt*~aP6|_On(O0eC}|l+ z0M9Z13gzB0ww-!yWoZ^Ns7Z+hGfY`fJhVE;p0ykXr83v8hY-Pc;KnMd)E=?T%y^ni zKE|;LyHfV$OnL4nOtPP5+zoa$D4|DDg2y&twQ!q?-i4~O8Up@p_pzfY zzTI+q6L&B=t?qFx+G)4kC6bWAN-No})uKHhqxNRpViIwDVPjaqfOvQOLaxfE3Qr{Fs5sK52IT3LP=SfXuRpyEm=D%n&CkE%2e|t!V;l= z+2UBRgftP7pHRClsc91lgv9Nrs)TtOKkA<|N_5haYMz#6FMJ;6#Zt1jWBax;_1Z*7 zVFo-IuH=W85sFKo?izJRVFNoAS2|^jPl_%J-D`RvVtZQ)wz>*+4B9aLYTPNyM7N`3 zLHO0)bN2djkpQPGC&NtWnS>yZPWZfYR98%hp~NFYx1xZ6-s<=d0_EF!+!f!MGL5zi z!~Mt6t4R;pf>d*OZPrE)I&1PMWtNuyvE9qVuc6(OS@!FV@HZ*titVRi2V<5Q8E5aE zN;oSDaFEAUdADxb~@SE0bVr&do|vu z?|05eSROrSVlaZ;hE-3<8(H9Hfg#-ew8@ufeY;~p7S6hRr&sXZLnB9MpY!Ww*4842 zYm!A)a+C;td*wrHOHsKlI2z!$;p;xumtmhd)*GO#oX_7!*q$FQ7uY-PY+uj2*ayy8CLr zu{A;PUcQb`Aif7afER4$Xk)F)(jqX*4(Wn${J!EdhoT!9PTk=Oeoolg!~}c6xH;_rCmaw099e!0I4drJO5bGTBib zp{4s?`2dzT>J!%yo!;^Py~boez2m0QWz~5vBRUMQ`@A_8>P=aEgiM`htT{&(4VOVM zFk==xKb;%8AsURpEzSVSr9J5EF)>=9fC`wSlQZK-B>VMF(|s{}E8 zs;Z9%9Radmgde7&F&f$5*-27S?q=vYtlf5VU-(*&eswAgxw~dOvZ3A%?go2V0Z}i5 zZxSx3qTk<+pK6t6+5e{PPT7Bdxzm`P`D>!f*_||i=21k=x*vwErVz_zqG`~}zD%LZ z-H_$2WxW2FZv0-hV$yW$>090T=wflrf5@HCwsDYc?{=-o!`tLCi<%57!*O66IFH8% z)uCO}HPN5r@?Cwo*&&AWF|)X}%l6`i1pW;f=5OZx(Y77X<#E-bd+nJUk@M-b+7a`8 zb(vM`Nj=!vW8sm)S=Dt965VsZt#^I(b@{Jj+ZyLxr@^Hsi4E;y)5J%><9XHTV)Hvf z&2I7yEmX~?rg{2dy}>CoL)AO%9npmsW~gO+9#P2(u!{Vr8Pj5GKRk3cQ>mkm6b3{{T-wu)lboXZ`2t@bi=wUsOxt@}&0FVP8eEC!JbDs(&_V zt4_IWu97!ix41l#SluyRG-dpg1zLwl#ta^525E4|3QmV#0giurCA>$zUvn*tNy2ar zuA({GXM&x1xfP!GD*piBAOg1RRGlVPq6Ij04Qe!`h}Mp9<1&DLM1?6=qULscsvfty zwgPGV!?}FmlEdepfB2F>J_lpnx;(?ZihhpC3}fGQ>hZDRtbbY`R@0btG%28C+umps z+fme@Qgn*(@eim6cyfn&fYhdJ06p+-GM-kqPve?{s?=vP;TF45+*tPn9b4rDmU5M< zYq^PdXOxOcT!M@@S85b=wjZP;C8NG8Dr&XqZJ|mf6`egc8frDh9d5Ih*X9j9J<-(t zbntW{C};D#%`UUnl#2w?yeZ#5BlQlrM4icGF?cd=pEZ_pU_O~yo1=-Z>>-OF@IMnmS{U{}smeSCjib};bE+qkyjA#_H=uzM6pD6lw^-Meea*CN6 z&8nGFzY)Ecdz3!`&Wx~%qnsm)m~p(+$x4!9m)3=`w9aVc-BmYlFzVC%2`S?&7A5oH z!=_BJ=*&nMfACCnBRo?=q#q3YU7~fm=#$)W{(1N%VU={z-(osl%FxZ3c<<~TexVo@ zA{MtNT?-0g(Z-Jp5g}f%o26WQxVK=BIU7+@;|0%teC4ydwcqe;Mb~&0RWrBd+1uB7 zHm*BHp9DUC9_Hg9^Ko$hLidCL{9Oc2dauA=24CLGJ}QtsEW``sRL z%x>4_vY=db%@0zDe%Wcu#d7|I?GM z?tSQmQ$FvnJ7f4hIu86i7zf=;Il*DOa6jN5>wkHD?imzD|C^lSa-8&8A~;@UR6h_X zB?KW+3i!+Twfu}LUJi#UahEGz35CmX+Up~`{4n|vhv4}kj_aHt&mUUej<)dM1fNdf zKekju`44+8daA!fo954*>A{?I*_+>dnUot$JCV13=2;gE$ItlA%{PDNjQH>cXPrsw z+P9+QjR!eM|BUgI=pPqd{RQ0Zt%B(rANTr}x%nSk9v zQd*8W<|Xd2|6+ zIW>Tu3d>vt(sQUF4=%XQz)z|Mq&fZAsjMFWUGfu<1uxr2c>r_;{w$Ku`1+U7Plzta zGF`y#16}YFq6@N27i5Vp*MN-gAu?V+#pfT9&ms9U$l@L%i|c(JTD}<2slevtpdukXinJ+iFh{*wPG+^6`bEIp#9jtW+H&g7BZyZN8~ z+DCQB%4cf;f}gET!qYFn&;EesEb@!pXY1F0x)!@V@N_=}&F~Am|E4p-51>zUwln>X z&Or}=U6~}2`YN0J1WwX`_+f_AV|7LYO>i=*OSpuY78B#XIQ^C5+%UU?S#t2C8x&>81)5w*-*h24zOOz%O6C)247;N+Z&c`7a+L62LTufF0AmXVNK+X?67I0gSMX6 zkS!6o*_C|H2zv*tA-iDYa2~qjO`l|&-1M>^s=`HsArkHKSHj6?G#M@jdQA?KPG@$Q zQ}9oxgHOGIGQC*w*Bm-mJQ9h!bPnEVq;HMxNI9GK`X>**W$V_r9Gvufq)a8^man>6 z!ca63i6o*!LW|+yUV?|Sx%*^1%wjyuuEfI=Kye55x#d&x#w&Jlj#+hlzEGW8Y>a`I&8L31J8P zTkOW(*Syncw*blPrbpLBx=SHcD4$9Qu2?)9aKFZ#flMOm780p^h-3Y2{s?^oVg>=w zm0i_Y#g3^q41}!!t!N_@)+d_uzsAMr@+M5AkEMU;P<9X3Nn)TXZC1<=6jt-VXrMTJZFO6rS1GTg<>JyUoki)aX9WMub z1NAsuwZYZgci-R+IUh3iGtY@%Cyq8sem)< zPxR+RTOchaL*7V#&jw#2;5Hcp+5SvrRCMM7u~ydGUr2_;Fw0Hx$N0OrK=7;B09sqCW5q~3(#wRb`QRzM7hWQ_pbBN!!aR0*Q z_iaJGWvIJab{07irU~3PF5c$4NTnBCm?zA0uBM>v*~1< zHZx6@nTR0qwV3i-8lOc)Mo{-NG)Au-SZ}sMfr1VhE>&*?NrJ=kRofqt# zt5i1ihVZG#mAT#^sVznq;+TcA15!W2;iF^e9#o77p>nDN#MxfB^^c%UD$kDEdvO!IB^(YoNXs~UOmLj_A4_*bnq(%)P)&}x)UpryWTs02 zvEA^XR#sn2K9H>Gvj}<7tn}HHDOL(&@{zMN| z;(-bq;ZExHBeJN(Ixw}`*cH=x8>_?_e_ng2A;q_nh?Vzi@@1ztP!oL+tKu!K=yHQQ z7OW;c`GpH7rr&*Xk-57PoKTx*2BHI4QDj#{pQ3}u0B;S zBzNV*Wp}?D-D3_!qMNFfvR%-EyysK?*3Q9A=TF7j=iPsF^s+s@T9eIK4h7oBZr^dy zr>>c-?s@a34Hs|87b5A@5S6~3M8WAh2XJWVV8{{x#R zep}eY`1Hdc4Szd$NKx)@Pg%9d)<3PMKB98XVQ*m!2%qjy33l8EaUgJlQ%@)qCR;-> zbM)y$>yD@}yQI z%K9H*yAyHz<~t*9GT7Z_v)g7c*zl{}&?(N-F6N!gaMGvB=rpTGV^`z^)hDx{IgRW5Mm*nyFIOs_cq?;7k z{NO~Dlvh;daU!WyLQKuh914%>kM1POe2!6M{S-=Us6P`E)HznF&oXI zblevRWCK=LIOP=c#d_33dg-8h&;}S=69QW58sSbuxQ><{u22Her^hLjl+)>O&!Kv^ ze1le(bhC{BX|qBD+4PX=4Yp$c7L8!Fc?`&tss;x)7o|#l$L!=bjn->+`m|cDSu54D z=~!Sc9oCw3{Ifx)*$~VIEX`7)VKFxHt%1S1!{CY+5z1$hx$IOzl4~}6fagO%KU}jh z$!a!C6`a*Fv4%d~od|NF#_4t=xSM)XtdVTG8=l7BU4aaPdq4d*Q-l2A``^EL>(*h! zy+rFY0Ee?037i#N@1Ceo*E8XuZ5WNpUTh8AA+nR3X=fDqFe;W+YPVKkjnrr0mf&x+ zg`Kmz_RU6{X#p8yPOnyLbQq+JloDbNm+gmN;NPv`Cx(V*9Kp1Z^2Tz!rkcwXdNkH2 z7IB>!jBioX0yjAZaR^>=$HAh!wC++`yt-C&pt92Ov61Mp8*4+X(n4MtZU1jE7>a}g zCZ~Ay+;(%kGBLVsdVW`8^5_IQUMv?ScVQsqK#TT;mN42HpFOatw0pV)(!_;;Ruv6C z*+Rscvcl>sR__FGC!479-rf3-eMuuVI)A1^*+se!APsYx2fnp{v)F=|61R5172$H| zTT#xX$LE;Plj!LYBRIWdWit*s@Bu<>mSvvqXJ4;wLRwQc@nk4!^h%LY z8ca#WEi)6_^2uOKOxJ_KV$2mpk4FO*!R@sLs)-cZ;RjSX-4;jO9SgimXeI~7YNd3| z>Fy1O@*$heA9Drr)Rv(8(I%K5K0&s@^rOV|qg*B-$z>ACX?{{yXRa)X(9@C#wxUYc z^d2+%tSAx^;>lf7JLS>(v!k#cph z*{kR?aBudnE6>0ul#*xkO5N2ObR&Mowr%toZTyT|w{E?y`-~>KhkJ;}6?u5=3!6ZW zu6?NvpuNZ!kNdV69E#jW;JX4_A9T>)UuOw)QEs}I{+aA;6v@gBPr}qwjZLq5f1xiHqXVR`{84$lf3F%i z;v_!AeTm<*?z*G&(U0gI@Le}`I%V`wl9tGH(0*eD|jQewdZBk&qDJJuie7xz7M>ivkP5cPr$+tqLp+_sx^v*rs}33`T)r+Z9-{^AvZ2dk$bb6j%&k zUnj7g3aq&t;vQPQ6X#P^-+h$(2!ZWZV2S0EXaT*G;-y2+_o#9RMbVuUFAN4jG8#kg zrg&j6-}0+y1A%Ss!r;C`pRe`19zIpN+ z+f>i{HQGdA+Z9-H`Tg7p^cjkmj(kqZ`?;?Z*iHr3Tz-{%h&zwsMfvWX+(!s(w*pHb z4lVF^QM@d_f#L=ApeX-tiWdfp18j`Ho8pDReB6Ja4FtBi3xoR(k?+ncFhATk%fEx- zMSdQ@7Wwy4yf9b@zFQ&pZB<}txNn~P#x~XSmeD2x+pfTp+y}T5{9jSLFjx#=Unj7g z3arWf2lo)Vkm5!8?z_2<5ZG=77Dewxm*U>D=vG=^0G}@=pWjP#2)j-C)x5lLnnR3N}w`H5fes!Q*m^ zxvV1;@LPHeJ>Fa#p_ET_*`)g5%&h@~k@|90nES1oE5Vv&NO!_e1y>8<213*hhLjFp zF6Ep&4Qp>Ek;NLhrra&>`oh73zNspR&ESF&(#Y!r_OQe1cUvrO(Hu&Zn!c(e`t!ZP zMn-#GrgobdJ!iIAf~9z>6g2tcd3SEKkRQu?vT1$PfG*L6B3i6JMHur&pjU!KG}w>U zRH(NcVB@1HF|t0NRFyZ8PjpWj>v)GY+U9yU?GM$)QlU!Htr6|cFwbjETB+U6HKXWf z#qyr5nUSJs^CjF4hd&$xl`=FsRHJ_Id(ka`J1g)2#$C9AYfEX)*ioTjA;q0r>A0jm zB9$(QN~_w1w{fp<-HKM>84~nxwt&qR^jb5~aP*ezdh#`Y14muWfVUttZa47{8cmi^ zF+ScD!cl!9?aGdp3Zr?C&HhF`Ag;56&>Q1!JL!j)BtEK_lJ55|Mz}ZOfZQ8Ugzk~26GP4wyAg1fk1gQJ-NAuUv#^oDYGvdj`uhHqNP~c zvo$?j@^2dU*y;N6gQ%*x31~OS;rN~Ut3qWMhZsIuk4xiKQ8_^t4}_ zN+P|!MBM9(B{iF)x}Y~a>oMs9{M>Bgv)MfV^?JV$bh({QpG(l|jEVil z=S|V5;rkNtg#{Eu=MdZlxM@;fJPzZVs$k#O0=~=>*b0GngHri=PMtgMolQ zfIJRuj}+}~i?O$lST~KtyoU6qjYGcb#@e!}zK<1XcQ437nA^h9?6!@? z8aUfvbI8;)vuJr`isjOX$r_+yQ zYPTCh)mXKOJ_{uKfD}u7UJq~3#hCj)7xwoJ{u%JU2R+FBE$|rL^V;Uv=qfaZ6Y+nPT ztD9i%I9cL%6AtbHin>|%X!)>V?b6Dw?Z*ML@?CDFyRw%oOYjV?Wp(yI`HY(8PWiZ1 zbjx*{Lzz!zYHv55-+2G<*qK1`dqX=73b{M~coF_E_Az<<+!tW{zgfP?-TmD!ke?!a z#h$;D=_}Iru+H7Ub*(0Te!4;{?{TagRhDZ)EZJvgGLTo!=fTmk8Df__D~pJ7X=Qs! zY6&-Gp%HePi?T(GJm(^J;L+AsND0mkg^{TGtgJV*qok^YRQHAvf9Ty$Gv6%C4y=VE+z^_G-{icZC0l$emw(sGnB;_j9e@IrSTv*wOG*&K5k6~rL1U-D6%1Kf= zat!ym%#m}gauGVO* z6tcQL9E}>UjJvZVg~E8=<8-I=og)g*_QJUR#DjA&U(#3U9(Hd7e7lsqUAJ4Nk1TW3 zj;^Z?yH|^x_z|HVu!pokU&z%Hvelo&oXI~JOFKkwK+yW551C}PB)I|L#|(@oODqFf zBCp6knG-yUfYNt2!S*8t*j}w}nL0bLo_6bByAt{3-qhxacstlII3vzhP>ODyn26PU zJq?pf2t)!o{-CQjP#$pD=UN7R&gHY2Bjfp&)v}>!@VIS08$F{N-N(J6=_MVd@UjTS zo2f#rnN^W>Jv(e(Q01{zC(W}Jt5>XbDPJqLoYV939=pM1MW1&EGP%!5`uzurpYnV4 zCj6Toz|9@}{{io5n!|@-Q{94fjJ0wNMwagytaf}NXAbOHZ$;Ft!(iH_k#r*!@>vx5PR4tf&on#17bW5v-0#W$sHOg)mCo~qo!Kd$e5 z9|b^x=|A;|AxeLX&%kf_NPi>^`z?`09{4Oc+6#B}@$EhEd$f16g;>2)ALyRZtB1p0 z_)P8c0A1?9?E@G?Cp(SQJFgn z8wBmvd2kT)=iCB=?U|c}zlJmJ#H|^BiJa&d8E=irAJ)!Vrj@-)v>_k1ZaYCwK*2kc z*`e!FlP)i`+G=thD_ge8!=c7z8cB_k&TZX z*GH*e?F9U_U_4fc*XVi&Upe(@>f{J+dYZbv(MI6defN=bTy-t-ef&IuH(wA~p3xi) zEN`Z{eG&_5-br$&6~eQ5rmgb|{&B7&$Vw=J#6O`q5g(OjId>aHcJ!Lj;fG@$kHs4D z<~*L$#)+D$FKDsbyva$&AD=E_{LjoGPj+vwm_tUX>3kh?_=qRx4OuN7Pt1GzIdG22 zq}OJ*1bzQ<`Z@4i65WW#`3GPQ(QZAa7q2vXX+0*#YOiQmpj#1)6P3PdN&nGwrIN<~ z!o3+$%=CuYD|)n%FZA{n@{OvH?v2HpX+cOgGVuaoJ*e~ zC)DE{by{&MSmkH8QX7Y*dIephvBF~(-9M$ev9BU$DD%Tim0zf`b2u!>c*E{g7f<}f6D7k1#GRNH|4j5 zl`kg}iKy~br?(Z0^?ADAjVD~rRhQdd%wNUjJJ9#Q9_v5?r@9^V>zF!qRdE3;%CxR7 zF6fpHFoF_*U+IjGI~~*=@@bwKfa;YsG#%)^DYzmL$drQ?nc^~n$t61^{^$26PAe6DbM zq=!c@=xoW#NG?8HjcFJ67;g%=bk3-+m*>&9Fe}&K5AN+(BQ|0EUX<#-Wi{51p#b0T zDMx6Q6?amIDwlkj0_>v>#pjWB~tEp1GXSlCCooc&x z3}71q&H$g}ujTOBXe%pA*6cyIu6yoBm?(t zQ*3894Z*!iOMJr;O=OtKxA4&n*lb`_kh5=0)DKvGiPr+n zC%b2%uuZ956tKo1WMBRmndkt#M#)45Dsp)qru2Y=mNM3q>$u-zuW}whjg^?<*t<+Q zg49m1EIiCh>ct0h!kaFfN(K&?0TVg_cNT#+Unj-A;CsL^F;A3Vkrom*V~C-f`+F3>r7uxU?#R-oFK)+|fJ5SW-Y zz+R@$LH#>VMc$Dnwrz;%0w(;R9$5BUN;*eiLiR+plKj5&z(o6;wYp^6bxeEHo7#&LS>56u-j}Y2{Qh*Mq3c|S(rMzSEWf(^ zKHdlPZF8Gf?FqEfieerD7CZ%!9EgOcfD^Xd5_OI(q@v9Mx6{UvK6Yrsnq)3HR)7>q z*);Gjqm$&l2KY|RD1;XOVvK~s^NB{&l<+$xt3z+ny39QnUt!W(T%e&;R}3bt*{s)U zt!JV4&Mt;yflSyRcLx(Xt3JGAtbIj$_e9Md3nG*a`x5S8QfD=|%LAJ#H@Df|msils zAm=6E>L>6@APB8YCAxdifwNC!vO$uarW1>^g6JgK=wc<_H`ZBQCM0z{U}!O;7O(^+ ziMGPoKHT#ky&S0p{e`%w3z+-bJCCFrG5Zg`9Xj&}diwUHb>B8eqLpn3{3Ck^>2cC+4>|77Lk`fqndc>U#*o|ihN1AZNAv$R_9Vb@6<7Z5Kc}R*=g*&8 z^XHz?jAo>fW-RL%S(aqU7qYO|#=<8ULjW5GY*>dQUT0arm?gv<8+L6M5Z1LRV?u2T zV?zSe5{^(CiYsj40=9x7t_>TA#U>=HKl}QaLzb3ArLW(=^}1i5uixu_@AYcL)h1uUpo{x>Mq}vAMF^2C$%hQ07Bx*xF(lOj>B_4O7706j8#5G z!}vjN^M>fXNcoNgu>2>{&pXs^1O9tuW*57Ah{IwXIzHdG&{z3X?1H=!=s4O#Jur+5 z-pV$RUB=NT{A?9qH22K|li)A_D-LtmWsqNt!~QLWT`Kr!ek;(=I7~ml6gbQd4r8J) z%g}iaGf??J?7)X8%-xmW!+W_9=lQ%@I~)E~?Bn_D_+mp?3uQvaU^*Rac+}sccl#5;V1hj8 z-fHMcQttU|%Bd~wNvQK%IF6nd9u{=)_X=)nK92q!FM^UuHG6($i>hTiNLqcYJ0>4M zi!_Zx)y#XwZD2#}i)xtboGQ1_!-QtHd7$FHWZdu8aArALl@gLc(l zo?i*dqm@jAp;?G})R$A}7RdFxYWmcXBTFI6(CqyBiT~2N2dFv&dYV>KONSq>Y5Hop z5~GIlQh-g76eQJ0BMdGzjozgra$*AAKk@X_6UUCxei#%^p*PX*YJL@%&3_C=nxo)A z-@EIs^3lnor+)P-;LFsn=vI3?DP+0i0|Hnz$7pOGLX!FJ5LktSHdhYHhMxO`2g*Qqpc^p<;E} zEx-jeM4_9#cD*wiG~@?kR=?L|Ytqy|DLoQyL%+cxoItO`xW5fX`s>0D+FplX{NE2P zYvNL@Nar20QHNmD>(%d|`_;;iCg>Xe1>S%@g4M5PU&kH#e$AD9jW<)J>Bc;sX8gIH zhD0l~wjr!2x!5Pd7&CV7UK!Q*6iN|MSCg0ZAhHw`yuq=$E8w)dTO4v$>h3~V6c0#} z;)^tyt-9bpHHF&y;|MBX_Tv|00fT0p%hWSy4R=otsz>Ee%#qC(JiCn-8SIuON|){s zZ7@ul=?-_9w?~xrp_k0w8dW7mj4j+Gi|nzH-TNptP-cQc@r~L3z_jFcB9Vzwjs64^ zvrP=-0ffI5>t56uT^5h8QSXW^i8_*P?Vfn|5c+u%giLpCI2-BfZkMu`7RV7v{d?-O zbT*p{#PW-@!I+#1+Q}z!2Ma^d=twc_RI=`&1-_2O$>eBPEBj*ikyX5S66RMyxRLKU z`uGXU{Fk=P>F~zOvM#U#Alfd3Rn@^~gzlO)^AOwT&Qa16t84ot#D*=A?gYJkk(_6c zjpo`_jAeu;rGzWluJ{GaKbCt^M6?M@iuLEz18ATQNCxN~a=(>y+c zh{S<_mXeXtTD$cs4KWE?PpK|dkqKVaT?t}w);)eT^%XW^kXFj2Lpo1~?8`-*P0qkI zfi*o{Ys-=R#n<+4+8i62Dn=H_eSP7Dv7~R{@-e^5+cDDS$%dU+ie$qhSC4P~?xx(8 zYfEc-TOG1=-8O#+_`vrnW9S3?6>#8W$7&F2yO8tXgsziWFH;esM9q+Kks7&(a|8;y zm4$Wmj#)~s*s00&I-}OnjFG6*Xhe+C5lbQ&x3={d!d_QOHh%4YZ`C&I{HsewZ+=Bz zX{60%ShXW!l}uW4Z&|?8H2c4@e%61hJ_a7dL!uGdy{c==>6jQ1fs*?W9(rfpJy)Ij z=0VZ;zxSZqC)DTghx{Ia9LSFtQr5V7J?UP3Lw{>Xgr@EV4|=m1`bg<^6wu+vA3^^y zbN2I|1?X{geRDR8w=(C8ViF$~x`j)H*%zc)=Jlg_!Nt=6T~i@*Q!`pj-RmKKWdpIf z>mo!(&o*!Brc1yQBnon&yYXH#SWBcrNlZG`6TbGa(~%m?W(QLaXSm&`o^W2|xih#R z?ai#Zer)XeRT*!3LGVt`*|Qtv@pYRr$+2Q6R2)lYHmw_%H=eywYwumYzGLC$(L`co z%fj3xEBfu)8@cUwoZ4>Y=aXs4@{8ys(OH?xH61_XWOZ!`0!f}I&KKK}Y zVOZ(=&y(j-r~7vGa->67cb?p*zNx-@JL&Jv${nH!@U_)#%~J$ls%mRa)|RTpP=Y*F zTl4z94e@!CQ0B%_u?#@?Eg&E5d=UcSn%*Qk1+!Vnb)$HiX|VHK?aUZe$tG0-pQS|4 zcH=)nXvv^ovWMIN8Cu&ne68Y4Ndb3OlG4K$r&dfUgB$wHct_M(8%`6G$uZzLqccWQ|%m^vbrQp z^tuAn4BA8_kuyYQFmbCBvayjOu2h^ZW)xZ~%w7`%NC``^&VJOzZ0y-J&V?tnV(Pj@ z!+X+Qo%j9K(tVptrOo@6j_=#NVCF>)dREtz-Z8LfXIj*1z72#Y*WF*}8|$9hJ36{| zs++tG8kg>5OH-z^I}60+Uv-p*ge$M&6F3K}l)~43M2)zKml%PrUrjtjPtszt9(9A% z6T>G`YV4D=dK!(S&w`wkT5md+M!r1qrO&|>7Otv%iMOL^ZU_4DJhr(G%)3XifKE0IgF`p(nz@UQvCH*%MS=!w=(i^z4J3hB8O5BGslP>nsZq z{+MXwI3WK5!n@9yY6UuXR!wD7=*%Z+G@_oKQ?{mB*+{`)Xq6C1Ie2@Z53A1v$|1A{ z%Ju{Z)RSmbJr)=Yp~Ye^5eWnZ+U^P3cGWs+Sw0d6tEQmV`x;Er=1Mc z#}APmV4be@qJg%P5k*i*7C{6NOZZ{+Y^_Ad!h7?V*_0anWWMsD+8Seor9eyNk&=v| zXi&V#FfT}RUq*qU&b%8;WPpR@h_#g1fdHfb>YkrFq8xX>+Gl%iYnPbdn z*K7Dad=JsAydaH<_z}|@G1{XZMqAO=BKe~p2FNyHKRS)|)Sj^bZE+gXGAW4lbdZkj zc36|<^P`ryz$UiTAbp=tjgw_zJXL-B@==Kx&sE>iLLmyz{?@J~$>fr**6Mqp5s19A z6b>HZ@}_c1+)aHh89`p*wbYVYYMJe?K$mHPN|fdWBfvdny9!8$eT^->gdc*afW>)ZrQ zQ&PlQvYlxCah5cPGLZMu%4fKQV;oo24 zX*fl(vyh>-`@r&(Z84T5pswY*Q+@pSoH}c&ax)BfMMk|G)`Q-nRi3BL8ZPft)94jP zEg3;UljhX78QuI0TWWPCGoOwppp7fV<)hR4w2$EtT!VFU0b zF{%S_fp4-otSHfSadX?mF!6yJ6uEQL1QBqFmm{0ALDfvQp{&O2O@}%QF<(Rq%8t0S ze!`t@b-3I5q5(Jl*aecFH+69#yCLq#=2AJAJ!n&(n!2{hrO4il;?Us)_r3H}O#Jo{ zdcY{ThVQ~@I3>qCMAj=GS+WQb&OG|)qlbc@e;)iCZ%}`&{u;T}z36syySkU~jp#n% zC42_P_=WAs{4q8hxJO28A=w*jvN?^3F8s5WrfA6CmTi|VA^Rzi4|ZU+ z1@32*_(#P$;%Aik7bQMT;oC;PFT<@UhyNt#ag*?>!1f@wKwOr_wbbHbIEAjpUqGB$ zc!kI1@dC6N{{iBHwYW|^g*M{j5NEH&&6nSNcw;z^cH*}o&MLgd<7{{Y-G*O=IQQ4$ zNP>iZCH@rRoVB=%u@Ciwe5uFYT3il?(Pj~5CHB{F>;@b@qDP8dHMk8GFN#19>#-sb zZBue?@g>#>8$e2Hp5uR-j#K@ax<|YSh^_5jsl^n@Xv`k`p+~l-f|IWsh@N2O1>7TS z5xvmkWIxtPoSjjw&Peqrsis}cN<6`j0k`;4HaQ#(ntW!x)}8DM;PcIHM^o72i5pGk zV2i&!>NnE!3oj}{`Sds}yvWP_ecUQs0d39p$Mu}{IudmSpy5rK)}Z7`1s3Ag6_J!f z_M{5iXxi`Lp9nXIJH96E)V*PsPqMVi*WjOw+Ja`g&n|7JX&(Z-mjhlC_iflh(~1p4 zI?*0Td!&Hg7I19}<0FNXM{aVsy!I77lKvpz-ciFXa+_DNuJM!5%OQ*8b%pQsh)X0u zY!2E+!xZ-hoDv>|@k;h-iM-5~X9qbED9HQw?+@KkyaT7UZx8+p)ibYLf`2Uhvv}G3 z@OR&Rx9`A$1Ng^l)+h%LQuryH7k&U^H7Mk$Pe_T%69U)#AO>0z-)|urr>CGtELB}k z+NoskEfTN!Dkml)1={E3K+@YR*{sftrkE#Tm(AkLU|hs`x2MGuOgbI80k^jqLd{NN z`v5J=v%(L=37|=&EH2tdjb*9cVdkPvg-!_`a#(v|SsEOt*9$Z1$pa>f#RUcEYV)@H zTHH3fjeOu|B~P>66KS#;GDXSVZ1;tX4nrI9Z(8{Vo)R8_`B^>RV?2kbNXi2!qrQ!g zGoO@|%|Ndn5ZmX0JBo_xYhrs1t}Gmdxox9xMm`2@VdkoqX?lr?-h_nHmi}~lz?{ZX zq8FF_*`m)J>nudgzGBwT^4f~u5Dtr1{+YabNM7c?bh_U}^6J5Fcv2m1lag%@ncN*I zw#QRBjz@sTe9XtEu9jDwFAaBegd_Pp9?3=`nM@>-rRko;uL~0}*8cx=N-n3sgI{k` z!l_hPX`{9$=)R$C=KCn`jbh&Kb5Ko@W&4ycqHog$K!r~ zwECua7U5qAKZWu1=kPS1e-#?SdwKTnaeVj}kbNx1(9k#KZz>0{4`}aKR4$U~ENZEb zT%wx^Gtl-ms&awW)&P0j>5#(_O1t?RFH6eqM8Yj6^A>-~=S>AH<^X#$y!Yehg{!&V zA;H_i>qoR|?Pu6U0*$?qXedK=U?58#uixi`2S4A{nJQA)C!*vTaG=e~b8?4s$@-D;#eP8 z)=>B(>hFYdV-EsT(AOm`#+t#0J3@cql#C!Q6RnwNblNt@7k$N z0CSWpbN?KC&J(r~$o%G^UO8%RGI^|CZzN=HFWQDPIi02ri!P_^5Vw=O?}WT>0BX+4 z+XA`M@{%RGz>WR5-sz3bNV_ivb3Pyk%<@R6t9QRQ8xNVKo?t9&h&w$+;r{?$Gk&$>Gh_g#=Jy zEl^bfAP&~SXJ7m)9N}N#yN|xxzrx|GzxQ5dEdY8UWm#bl2i=KW-txUQtJ-m#Kfm?Y z&Mim&`x|^@e9QSczRCCp&L_^mjDP6-((%mr6X#23ZN@*s?td`jA3L8r|7ylRasJl% zcQgL9#_KcZ7q`AQ6sZwy&DBWfI$L4VOP5)I13C+*YM7-j(rEIi4NA{D$1mLHvdpVk zJfu}D3|_d~=M*iy)>$5=i4p=sPt_)#&(k7ElNF8I-+uEv_TTBWn6{(v;&JQ7oQ4c(7it+diFY2WkAE*evvoEuil0rE$Nd)?qO(ZK6)n zq)>f7*6Ob4e|Nv_)E^q1JGbxL9?wCZCGyf~vGz0O7lnaNau8T16C5FmUbm+P3!TX3 zo@{8&L-qJq>O@~;OF!Gd;t#+5 zJz3tlJsi26vll&=z|m@!LVGeIfw}{zx(7AyD>6fos=Nr}Wdswdb(%$!bvV&#qF2Cj z5o;U*l^~4(A{jqiX*DHMi!A+(4vM_RB$f-fM#0>8HOMsfLR&qZVu3~R19Gk~VEaU2 zGFygV9e{WoFX2gW7O@=&g8GW&@YOWanrBneVw%CDA?7=B!Sy^0=FBfwvA==&RX&GO z6Y+qUh={W;{H#cT|2$lXAFz{J-vmM@J-7>;CubE(#}wL-2c(ynXaTI{B&0!{PQqzu zc!4K$$-;{z#RG{PZIlleO_Le@2GI?}ouq}zk&@KKh9=`&M=QjL8XMq%K$rv(c+kOQ z14CrtN?<3ou^#vdiF1LViAWF~U+Bq%MolS9I5Ic!eUQs-_!)o!_S`RcDYKa)0mOMJ zEvZe?ZVOVAnIWjwA>%wcMOpIZ)<``sc4t5JeT?>Lr?4B=lU>sZ6D}P#;>>QM; z1GEwP11yAzAK5&&jS-~~2+f2I!LW>v% zb3d68Q8;q!i_2k}5~g*lg!rCi z+;Sj6>tLRQ0mNEoA=$F5(hE>YSve?^l&Bk%HKbwzhVJOB>v@O?^|d-0^p9wE18-Wq6Ioa@ zLC%3DCvTdGP)Z8&Y}8EI%cT6u-9vr}Tet<)Ig80Or7}Un0;YpdVr9aO4$bzQ0nLIa922n~y11R0}2g^T9#k|K^Iv_4NeRp5g^s}SQi)-Xfr|`O>$O~&JhC& zQ{agPO%i*fo~OCCXN=59`XO@nD%9&LalvCVw$C?kk95Z@msn-RuC5t?vW9;IQ_CcS*X2|If6+$z($8yGCYl%ys)mz4PO4|D}3?bNvBb3eUP@5FHQrs3FyLJt78Sj!yBl^P=19j^DP_Nq5{Q znkOLIQNzw?+&wz)bw+AJ?o5KwMfDNR30hb(uS0vq1@MW*gNg?dWrxkX{ggd?-;vZxRAbso2G~Z=^4P5 zI_{ixUb zW}&%Vhrlj6Z4^9qJ3SEeNQ|Am?Mt8aJc#tnkFXv`&XJQk3uohGPUy^>xl=gGdF(uN z9yw1i>NpduUpN|L54&=#YbVBU<#e6I39y>sJpJ@}ZQ``~T!eqh8I@FX{-*I;WADoB z^l);C?}6c+|uH&c5Q?Gd~ z$7%{aRYQUyPO3|GJcqU^^bL4+RnE7aZ=G+j8Uv?yI7xe^n2m7$0*JSrr~LUf_CCC! zW=(BE#@NTFU~5d+Qa;A-Fqg8HA7f9VoG{fnpF795uw3&nlAXdm!R!M*uUN-9ORt#n z5~~I4Lc7}^CCv$s6V~aaq4gi&;^SP*yvW-MoO%X19yn|M*JeC~SDWd^SS!GDftmmL z7*Ni=50K-&)53{0qdMOcCkk4pjGc1&tSQNIw_*Rg9~5`$|Ge+qac=Wxj9nsqg^|Y+ z7Xd3h)WSfNG^q5WSR;KCMuQ|+GEd=RW%Qs;55EWO8%cw5uR)=8NfvmtSH329D^tL} z7aDm8-3T*lrY(q6)`{>t<qv+uKOAo_f89QXUd(-e+%+Xeii=D1Jl4 z?~?tfFkVDHK(&SZX~J{#b7lN;!MR5`i7WxvBJo5U`62IDShrFwxN`jlvjO{Dt0u(~ ztCBT}nr_wEfTb3?Vq1;XsX0-h;$x@HT!cXtKM`l4890ST>%d4Jv;LBkB(v1xP9zlB zS0x@kOGh&4+TOIZ#gtJXoCM8xWfoj>E(kbEt$rjwW!jC2enMn!EH!E5fVh;To>>>X zx4>BZf6j4T&j(c|-OiihLnj<#K3kD8PhPXaZpN(3E%=DkOS7Y8JZp(@SkA=QIpH2A z+|o<*6uV^H3oXm~U{Q`39p7Zplx=Chi=>;HcPFf|;#?V-thy<8#w=&VDCS%V$6FpJ zJ`i$6i;NzYW5SdsrXyQ5yxm$`&Ii2PqH|#?O;jR6l3eh&NjY~F7R~Bd=~mDCB3-^y z{hA&;Fx=>Z2p@XTkJ+eX1XVd(Cr>$e>XtAm0)c(^Eod@ z#&^?(|D`y)tjSX4NUMEbdTp@>_q5jWggoAFfhu1dqbi-C=JxR!<1^sOODhLgbY2Gr zjj72$Rud}|>0Z^6Dfc0Q!mdT@QLOg%?58Fwh}S)wyMJT!tse%4XJ&A>J+O_z+*B;e z;nqjOMh>s%4Q-;a>a!~iTP7=nCXSmuSv@kEwyx@6Wt)Q=-54&jh4rd>yyqMn!B)nu zYfs;&>~HnnIoM;ByzKI=4q}_S`~!0$WGSMZe(pLyvR#Pu7q(9jue$19AU(i>cj#JH z${G3nnfPP;u&(RbPA$Bdu2)x|*z`VDKA$T~l><`txQU6X!mPB)TtIfcFx^qX+S;>+ z+(S3J4STBUYf^I$k=<3soo-oa7wzqy_G(XPl^ON~ zJ1p*sdy)d$*HOndUv})Jan^AT-R_)qN#zi(dLxu48{x;xy+t(Z^G(O&`A48TX z=4h+#Z<19-YHe&dGtYjCvSX_HaC;k(-g#zj=S{quy3@0a!c^(1!>e-Gwr5_heZ^^6 zJ{Pb(@W%8kLQ{HSU6Zit1Dk#F=E{z+eoK*lHoCIQUb44tuU5|<@(O`N6E4^7{_;+^Zg9oN!yx>fvqW3oqjgJ}7f zSXmnR?U|c&+x7d0Ae6I~@A*y_a&KMK>UCkB9xbk@hRyo7jf*^gmwWu8%(h~S>$=qD zT}Eg~{5SjQqG z``+}Pm^La-y^GsV_bR`UCwNkmo6jk#=O*=Mi!txfW&bx}zPagZGSkh=6Oe*!q-(kM zI*)G|zoU$|s8wsq6Yp5QwaNdphL`X5ghKE4!?~V~FGo6SRF(R3ijRw+%6FbNeCO&e zXSZV#$@X?=SieG=0N4K*h zrw7@)(1LUk*-!ahTJ@IA78M^s;X8nLY@D1Pe zPO z-&3A5)+3%h$L}Hb$$QHV>nzgtS%(v>i!LrpAeIn`j`&^ZTi)>!a*bJvA^V{0Y_WzT z{+ky%Ph4N|tVlL6RvvL5W2v+amLdn?|GMPtvHm@NOJqG{R}RIN?lIR9TfsHhcg#D@ zIy!=V<$)yMF~9%pu-@KYc`dc34fgqfkQ8?i!Ju{M@*Zj!Z@!WXfpp>kMuZ_q+mEScOjPg}t#4_Qh)Khy8H?Zordx95*7& zfviA;7S2EvzhMhK9E7Lg;0adZDSBB&AAV*vYw$dt!LxXdgYheeu$DtPjKlFEM{p#% zIEth35?;WIxCt?i;aHrBn>mi-If2{YV@~8GPUaL&#jAK3ub`XLIGr;%6JOz8&cdgh zjW6&G)*_B|NFu>GoQo9a;WDK0JHh!R)}se5>yY6B`We743^IfqveTsXPf5Pv$8+m8bD^p20JD7SHB6 zJeTM34?Le2@Iqe1i+KqzZu-pBj-03YOE`8PhqhxrH}pczvXxQp8w!KQG@UBJ?`SaFbNYe8Ry_!oQ+nT4jb3tDqMuK_yf+z z#kiV3@+Vw?3;A#U%wPB`|HJ?CH~!8o0)j$_0b-!25SH+WL84N4MV0W0YEdHwiy^pM z)QX{Em>7ZNx+|NlX?~ z#8fd&Ocyi6OfgH$7IVa0F;C1Fbz*_=i+~6YT-MpqAr`Liv?lF{n@(A+Vb|HtJu6D~ zG&EW(mDQ;2N(KYX)~XU#W6+peJ)PQfMW-82#i~0?{d+o1Csr$u-qrmD+NNc;ZkcU} zQQa~}hjL7>oc?`|=~Zm&UWGhy)2q0qRK)ADZlPmMRzjDW&>c(2j-|9IRobye)3F9m z+H@>k)-kuVH%*qS_Esd)saVF!l&&o{4QjEnrF{z-bDJk;`j%6D%a!#lXWG%H`_@-1 zc0kvfc>bTr|Fhmc$4%E|5_YEBqhO-T%I}gQ+bgv}*>2a7x~D6hbCry5Q0tlaM!BBJ zw>~9-6OVOgB_S184t&O+a$c#FY&z35NV-=*29Ut3Lr7Suf@mbeD4qf|Wl~!C-)dm7hS_b`=t;~ArnOsjsObNRCDE zDya@GDNE{AJ^3utQN2HsPA2UF%s+3MVLGX>X{E-=A}$mX zE))_j6cX+)BwQ>cTr4D9C?wopNVva{aIuhZc_HDg3JI4K67DY~Y%+_c(n*z>0x~lR zOlA`5%rugjDW1$s@pNVi>dX{TWhPNcW>PK9OzMTq)P9|r+OIN8<&v(-OaYmh1ST^H zb!HmL%oI;%rg%Ct1$AbMs4|nNBr~a&W+wGQW@^9AOhQYa0V}LUL<@aJEPbl1E-hkO z=u=?DwOFggIxP}fB(>1z$kJ!r>d|7o7W#}^87=hrv~pT((4tohee|tOTJ)Lo7;|m& zbW}O&Qdf9jd(KVkH$zKMUps9rMz$&$3^aJvEnL@?e`?KT<<}H{lQ+|of0Wgd&nziL zPA%IVccYd0sVR`D%$w90x_xSZ8fU8H;0*Sui5bO2Z_y#!8no_jG}nZYfl#HqPLp=l ziE2xW-^fOf?YimSoVj3H%mriW474;?s&#n}8;h>I!Iamqu+d0uZ)ym7@>iN2Gaeh- zLPi>1Ta#Xori{MG>@WBWDA^eB8>#iCK&UF2%fusgB9+#!@1Q?qrV%pl>$Wx{7iy_< z%F9+G+bY#tzRpf$Yt?BDJBf5}BpH?##R>WSK6MJDvGC#v`2#+69LkNs+DP1u0z^hkQ~(ZaVRUW)4gdxK000000RRF32mlNK0smV70RR910C?J+mU(OyRT#z3 znb%fY=wd;Xwn$|uJCw2%5fP-6tzf}|P}bK4T79(GSD+LGgvJG{AOa#*M1q7r5DD;y zF@_Lhh#~$#Ohi${C5V7X3rGP)@XXf{NhmLkd3nD(_s%!>-Z|g-W(EWhg>zw_!^z0Z z%0W!PUtWR%2-7%j-bAdLa7DzT724n-q@X)e(I12G7&0&#t>GJ%J0cl_hEL2%#_XJl zW0UcMcO?;l=7__6NI-jZMi2DS%#UCwMqrG^#KFNmXn}h*Pa+;f2XsMCq#+%HF$|d) z>qYs{4AF?k{YXMPbVOJ5LSGETqj(%6k>y2&ArdiYi3iXY$>@Y`=#74O7(*}|qc9HR z{r*5Xj~Y)HPZ`e}>+}7=Lf&xcgc+lZamLmKC8hJ6Bx8GH7h^ADzd2?8d}oj`!#LhJ z#h4c;p6ho4#xi4tahb6yP_kg2v)Z`UxY1Z++!iR!4>&uGyN&xbT;_aiJZL;*{KEKU zse9Eo#uLVq#c;p=MIL2WOPV23(1&}Z2rILR&Au79Zf%? zo&}*8cUQL5lOt76grTbRY)rvy1W=Bps6sW?qXyft3;Xd&gAbeo4H@?h@O)A2wX3~$ zm)9Qh+8>oucb_LvN2g(oQC>ULYjeGJw%1mA?N+b#=HfYT5Ah9|bK)BMzU}&disf*` zct$arUD=J@*@HdVi@ll3K1^d@_G5nzU^+)C@*rZkh!tGSN-p72KF4KT&J|q6Dn8GZ zirAuvVm{4h7~njXu$1%pEX%ln3mIg&)?9~0x-++>ug0sC_*)~}ZX0oY+kKlgw)WPT zBogTlg-w@;z?T)zI!n za}38ai{m(+PcWMkIFXY$nNKoD5u*^sr#OXErLW^0QT#Mc=M2u|EY7B%dCX@4=dy@} zoTK=TdQTn0xA+dn@xAi(gL3y1enu_oZ~+%_34h=+>Tv~E6&<1I#?D;BpZE*c@i%VZ zCY3a0-EmGU`XqkADg27lID@nJ4d?LtU7`=)WhafzKxc>iPiLpqq+1U$y80_sehQ9? zUGcTpN3&Mr(L3~Rn%a%+vXL>VeY^L1$#wrZj?PSFy_+g+h~B!nD8fQj*g9;*Zq?Qy z9MNu%>mJW*x9@WeBIM3uWq6wIx>mgkIdKf9OMyD|7R!}mIYVk(P_I%B&EiZcb5Xq| za_czGl1i7;#Bq)bD4^8)lE>|D`c9ESF)TroWs64Ta7sGZM2qD zM^;b!lszhAj#iFjq>7{kTS(N_Y^&?ru^pn=fnCs?natE%z)_};NiCHW!|Yr~J?Gps z4AePFyA|H^-^V?oqtzE`-~)are>6l?+53$;Q`QixJ??X3^);2Qk@eW1uP?nN7|sMH zxjWJCq!a1Vn-Zy}L?0>925C%WA_kZq>Fgvu2AUp&UEQQ!ie_}zr>W9hyG}r~?L5X5iZk8Z zAMF0gJyIw3AF`kDQ+V3#TwRPD)s;Rq)Ao33X8cFvpRsBD19%`fhA{@?oe+%ewy_;& z7CXk+7@Nph?Xq4!#KS*0*(?u}NGqXvKzZoZ3ZgV%(5fFov>Iubhb@UjS+!P*71hJC zyDG)l$OWs(LurkFdcS+_x%JmoJu^1bI8yrRR99EsI``aj&)+@wR+B|UHXWlg)Uma^ zdmqg`{`ANRT22LAr$&Q1@HLATQRn7^+g8wuEsyP6L3izYY}X39PwrbZTh2PDOU^oJ zj+_;!o9w^--uF+?LwwxI$DMo}=Hvd8fA!M$=t({v<>N6v{v{ueqkTnV-fZJ{j`WrsoM173_zv}qq(lT6Ki{Bdn zn{n+7zFmynS=9Ul=jQ+y8iBQ{;aVF3n;O1VCfnK$c%6p8oxa8du=uowF*(5G0n-Tm zBc6OyVM8lt@vX7>bRMmIiaHm7VP(Su<`H17S)1^?jNjYQ!s|2uI+x*zHGs9iumMkQ zZj94gG*2)p`g~yY1fx%%;mMUuYYiCdz~%#60Bl8!-kYd7SNa~H?*aFHb7K@ZZQxXt zc?u7nKZ@tag`$9|vA8elc#alJU&le!I4~TgAEV!AB!KXeIj8Ru8|2@(DGHl9vjM;sF`Jz|K!g#`KKh*jQS~uwnkpVUSB%`;AM{6iU zu8zP%lwkWyu=*v~`x5m4dI3sO<^tw%%L9-=Wi3i{Ghi{!mncaB&VIl$oG-`sEx3Lw z;C6s2cLKKIUKy|*umkWYU?*S~U^n1ffIWc60DA%Z0N(-Z2Rsfq0C)m$5O4_aB;YXM zDd0W=I0|?g@Lj-hT>l%u3BXDG9sxWHcn-gx2fP4y5%3b=Wxy+dR{^I$`wsv=MBTpy z{0Q)Oxc(a8O@OusC3+jz-vPV}I1P9Y8Zj3z4=|rf)&d%|7UKIReBTDR126zs57+>B z0I&(L74^3on?pgued@=f4I{W7Aym-LBA8 zV_j1%eagM6a0?3SY1An&rMiCsuGHC9`-x$D|Vl@Mas8(}CC+MVrGuM$@N97+92KqGjV9IDP>IYJ@G+uP6x% z?>o$C<&$)zq{i0ah{|XATM&z;lvj2kjV?x`F22i!#EdI>V+$C0Le)o)EnzQ45U~kb zSlZYPOwX_sonb9gdQ;O8llIK;SDx5U72`k;LSLmu)yUo%_U*1nMj%nr1mdnD(*i8a zu}i3P8E^&G|0-my1K7Lq-P;%iCq~hNt7KF~4m1qY%&>y2}YW<4gj_A!2|F{#VQcvS+Rf+aUpput)iNCN@F*y*gMLGc z;_*>F*3@-?2Z?ggOOLO8z~@zf`c``2wu$GbQk0J{<<+nPBmjO!9qXXXP+mvDGdQaW zHWSm5Tqw96%sFow8#eqEOi&n$(u*7@XmbQ&{CFgY`qb%Xgqi!sx z8yh7*N9JdqVu$TQ(eO!Abd8qHZmVsniB+T<%R^2>&TFh~0o&xLSGCZ}XipS`(&ELX zMaKv#Td8%#==RJ?OWL1i-AP=(LB>XSXS0TSX)hx7#fy8*Dd6`;&&Eq@hs7_S-UuJ|S|JPR`XWwF_V zMo;M)?dLnkB#1-Mw$p5P@}(xKtF6+^QZDnexQyyKj^=hV&oiVZ96vWn?aWXfwQsy( zf`%Yf=Z4a_nbg}qQJxpKh)j4apViPh_{LtSNLZ{y&@#rglXj-fQ9wPWv#$2|0B1T> zgf?boZHjAn6pvPNcw3xgUQukTxD>;9%S+GS)GV3jcs9>6d4`#^*OAv@9B$|bblfSq zur_5eg2YTu(e6sdBFLg3VKKc}k6oGDdNUmvaBKAp@1*kpwdq8IOl{C^yQ4Elt>#3n z?zA^HkzA;nWjd{*Q=Mzcwj(As_+#|2UqL)rjY*@O&NE^*KLGzT#u;5d9{aIQ*y6oH z`w`O57INm}#AN;@KKhb{c0|XD%@#ivlSTHth#r?hEHh;1qkM|^qmjHBj^;G;*b$u= zkTn`NE9BHBLc- zScV!$@$DI3n$S?~pVXM0ll5%BF#@?7i}j>}Yh%3fSm(IelN?lVeKsW?3r6EDUc4B2 z?){xuLHMBl`ADUqmz4Xd~+IvN1 zk)TjUr@V83cNs8s9|Dh^*we+iDjtOzw=5Pp8Rbf=eyDf8$#Es@*Eq*Mp7>Cadv3iL zTVV>OWfj%v%#sY?gjhvC1mDDeao?0PI1RVdhZ`=Zk6p*Aaj*S+e->wNxO7qp9qt+JROv zS9zD3AKLRMR`kN$ftx#TE@EyvqA-CwCGcM&{`5Q}yfR_5PFwgEBWus}E}9%WU(c4V zDMm+S8p4S>9)vG8G5;`^AwU@yPGG(mNh$Acg*_`L_c?^NqAX9DkHUQn*oS$9;FnQ< zSY{Q+aAkAVPzWyzlTlg=@NulP+5JDI6YW)BiH zPadb2S>}{v9s>tLX@P7j**uBy^p%{O*{)h+5s99c;!BC^4B$ESWb`?~xR2pm`};v0 z4}!7*zNgw&PY$L$YFx7QGx-+R$;~S}@fEJLx65oR`5EMSm5#^#3TtvFGRFXFDT=Q1nu zGIA0@(&9I-_;K7_&#+_;+saXS6Cs#<=B)BB$+s=owvKZIZ!!iG;rkJ#Y%3MTO|2{% z-&gNSIEmi5tuh9aXUftsQRKzBy?V61A(;$6DN!6NH|>py=W!;_cz&s?PU+qaOhr%f z=2)!Xm?`Tu@7VQ0UiTkl{8=-AQVzya3R6k04aF?Axjz`A*q$ccI^I&VhK;meI}6zr20>SCJPfpbuuE1(Dov(jdqT^ zv1m21XUXIM({q((ix*}@r(_kc&Ew_fJEpM$8JlrB#@Dmgj9Xl1I?^(Q`C>gG^|go! z&JgK5gO{8uWn_gbU&cD*b&Y|Ouvl*D{VG=^-EWbf8WBF4IB-9?Vq`OEJGy5Ve1ot5;; z3CjY%dz`56W@@>kbGopG`pr|>$D!T@j=hgn)vcKorbzGk{Z*|U=FL`lhgq`0wVYMY znq<9P&ij=3+m&~9%^m?ilX9I~b=8`Yw5M{?yUnVJWONng3e#5)ch~xf`SECSHo#e6 zmBF?1G?}TYwv+>}#j0Y->_OqtHScejU3IpsUBup)(QjwB+I6RGag^hdtn|kr?~2Ti zx|~Pv%Qvqk$LB=F1P_Xmoiy_mJCxxX=g-YvJe?Ps(3wf8lRIw?HPnu*j>*htNK3|^ z5`TD&zcdBUbX`mN$~$>Ib&AFmtkX6N)<6%3)+EdFCHx~B8 zHS;BtRgC@_C9PFD-p=ij%{Jc+chE+*Wehg5B0eE7@6*T_+eZ2)pARH6|6zXGpYod$ zc1!D9&*W(7I%c-9tY!8L;ad01BqSztet;H-&D$i?L~qd^>V#%>Qy(p$n`kjDp{3MM z%V;^RrZx0++CYcsDLO(&>1p~doumM=>>X`UZR)j6?&CU(GTb~dXN5v{+0fX zeoHQ$rBCQQeM%STGrCA$&?UM|SLmumR)^JX^;o@DpS99jWo@)JS!HXxwZr z-nC9!?^*9#A6dV$er=th4q6EM4uR6c^e#PtHe9OG@9A?oLl>2>aIcKEZbe&Fw0;^bt+qZyYj;?`vFg@3@T1fE zce;)4MvH6Fdv)a=x)-GbbN%)Bz7HJf1l&&#&_;R?yqis3w2A(VhUgpg5Ph4rU>>!d zcG7OT8QlFg&UWI?H|Q47e+d0h+&n^eF;DMqD(lehT5emlo-Frpxi?W1RqH|RdQfJ{ zhE!PxYVT)?b=k<}!BpAAy-?-rR6uXiWea+z$|KyzWZBMTH_ErT?B=3+{|IQ)JlGj> zB3`zDE2BDoof%UNZ2iwfg(~#gbv=!1bkDjEJI9q~iS)Z># z(g)}c$o_oPT!orT>0y*_qCAZIbJ;H3isN@s_S54G2T*p?T?pGwmi#-0woaiiU385*rOe_oJ5{>47pkbbOESvJ+|tXX#8Rw^ zI$OcL?+babLO78w`g#w_ZBp*wvM5#7FvnC`2@BD~<$k(2^uw}rqo{xA>xN7mWUYLH)Gp0=(BB0N%5p0IrQjCayG6=s*t|!e z;d4W1t`)z#4Obr^{cqLL40a)``pvLoyI`ljmQm85n=;Dvezb>JAAaA>K43E+*Yowe zWA|0Wr|YO+k28h?eB2L<*ZjFBvnXG)4zL;?N1cW1ZtR2Z{eQ#qDwhBN0C?KXn0Y*u zTOYum8Ds3iFm@(OcFv4FN*ZgHh=|rPGcjUDV=SW*LzcKHNu)w5OL7Zol}cJHw_7P& zM0>iSkZxMuXU5Xh_1^owf4ra1JI`l6&vSlf`Td@Ae!uVeod<#-1n=VBA%!#WT^8c~ z6ixz;LOEJQKgA_wLINR#EaE5}fJM1T1OhJxM9_i;k^)F2K?so0q6TOL3c;~NB2Yy> zz#ACyNmP!gC8$8QylXiW1Vus&C=8-PEcm~edx80UgP~*<2RN3}@oi;M;Q`3;P4}H! z!+p*baWFZ6BQOO2{fh*U2qaP}e(#&ftv5Ua2Hg(Cw4*=U0Et;s5rVK$i5Wa21y-Wa z7-XP5UJhWm1!0W1KQ)p?Wzum(QUnz*3uL%rA&i(q6f=lKkEVr%QStNO(O{`42JIU{ zieXXlsz8}55W~n$32;OzlSSJ|Ba>J(1|6>sRJqjx80>VlFD)F_LJE(d(SvbBd!QyS zfhXVz1U%sV0_7zL08cOl1XFWsbL&8`j?dVYJ~Qe>F|t1Fa1xzGCF6(;W(0#dr49h& zDRnxt)m()*pBarlRAw}dOpSz9L zwxRZ{gVv_D^^P`o9eyLqM9OnAXtf3{`D&F+k;W ze|wq#@@wW3f4fCDvL7w`xW)7tTXb?HD$V}jwbl@xE6vTbtPLZeQJu6o6x( zB=HkSoZu~`sw4`Fl3jmboW7>Dm35%KciXUC&mZmy#=U@m7KVLWP*4bgKrH}TKx3v1 z5GmLY7As<*i3x)o8DY%gxq>m75zg~5RSW|04J8cF@C}K8fE`z+j;CkeCPwh!kY8hqniSis6tmpPq`SUR=&WueDr%d_^Jl zmqC?m5eNEs_?uN*!K*)Mzi38^$uOMDtE{Cz>Ypw+rPR3VO+YSm@;7mh>fiClh1clE zeSQ+B>hE4gRd~%_5~Q6=zj@O#G-t56M@5^u$%_&UHr zmB107F&*)ecgC!4eQhwOqdG(Ll$E@Gj`;s|3{Ax_z+3$g!vyP@7!LZc^qaws#M5u^ zPx^gm!E`Ep5vSZ&?%lTZ*mE%6W3X zq3jI4l;`GlT_&-`R^N6{iGJQsbko>3bj^TxwXid!cGr^SLp!X_OE+o0r>q*0BQQMu zi>uO(B0Kce+S~?u$q(ey39C=7%MUC&r0XRqKa|@;vT^iQy(8l%mhJrcMAe6li<~PX zm@l(mu5Xh%e?5tkqgbz2-j+lo{oE85M;ehyM!^JQGL;Ezr)XdfOaZ>g zq{xWBHx~$h(;G&?e;VZkKDasEpp{52lT~}*-o1h>Z@13klEe$3&aKu&DFAH3-1Pg2 z5?r5)wW-~s54n$I1p&+0l4KnrhC+3p_M@Wq9D#}yPwm13O9WJUe|ySqnID4gt|Qcj zH;frBAe%mOrG!hoXbhH|5Ikxgwly7l<8}4p>es!v8=L2~?PEQvThmu>sZNZ25qqXh z7lkXSc;|LKO>d86!d>aly=$WB%hyRdI@!}DP7PWeIK8l2WV6&~6?SdHmP*>#mxFcU zSc7-lSBoqvSp5Xsj7bcKjIAWf^s)>Gs>cG$5x>eEG&FHl?$Nl|_%$}iyD{Z7CvEM> zqFV1_wyA;fmh+ErBACr@LKRovd36l<8>YM3oxijFcEe(g5VFsKdK#;;N!50Hc7Nj~ zl}=O?;0T7os9G_Nsjz_I@&RZ-@+ta4R==Khz+V!R<{vpB59FpeA?ZhD(zwBHh;yZr zjc1YyF${L50_V$&ie%wDsjL_Va}$0cu$pRs*Cp%W2mn~%ejEa3h7*H{BSo=77))9m zm4b_kq~aL#FgD&15T{(kc6M-L7%4ImXNvQR3JRlPmRT5b9rPw z#YA`qv;59PZqZ_fiHVv26%@a}@^>iy@XCvT&6L?@-}_IS?HJ3V(kbve`jNtDlqqY8 z3<{OU&*?PmpYWMM{I&RcnMd32LpLq16zyb3>UPFFzv6q-eB$C;<-$S#i2Ey*brj26 z`VoRvg6~hhM62FKmz_*KuaIn_rYaJ2zgJ>hz7{ant%$~E`fX|2y^yo*%*jD-z64uQ@p}gU=LrMmWHX4}`h^&UN@esKB4;M8hr=3D5Gs&2^|;84k4$tO0>& z6#NK*6=1>4a7YAJX?nPrm>3@CU@zlgjvNsQ!)>M=5~wKsyOzud5^OLJqDH^~=oRS{ zX{TuNrBwVznnaLErbfZ$Jb0>3> zlT!!BQfu9Nq+D$#9?R{%ko@ti^PAOFuhEiao29T@R0hT$zHRXGV|>i7Dfg~(s=Bei z|7C%=+~SM6Tks{&sBuQBi%dFaSY*Ac`0m5EKIE2cIS_@p52h)wy@Z2N53Wv^JjsLMB@O*Y7+yBi;zAIKY%ETmmGUTKWT-4>rLo)8^n z(elNKG)8MxIz%zJfTF*aUePU+UmSQU>G~z-gyT9MP@IK;?PXFPxusBWC}GD?@4oDb zA+L7wqpYJ^>;{;&=`d|KPtz8;tF%aZ)r-xak`8$&+}COR3vK_u0L0~`DX=sJv%JKc z151MWEHB6K7$A)nn?60;A`t>Sv$;DupAac4>_818#gLe@N7H#2S(w<-B>3>ToEc1_ z)8eMyNQ&pcC_#)6!P3kMPq6-RKDgSr$6|3&B5d_W29r)B;ibVm-l14r*oQ>NEn`Gd z@vyt|=1pA5p27%%--!($qQfJ(+syRzQ7L#CAjO+KaS>m31Qp(U=&YHJ0h#Qgj5 zPES{0@)W&n)X`5*1ZCbj-PPuCL90?!b@-0=`Lo~r)JkO@>qNP&=zFE$!rtmV&qPr7 z9+v7s810rZmkC~Qegk8iOwF*h40?BQ+_}|SV@YYdXrJGyKP7i!lLPf0l7$$aX)8b2 zpNLj&Nz)!{EjaVmW7G5Yochj|p-Y)h^a5WaUv>0}7$ne^reB%dn`5(kokPw_qjj8i z?C9<@H;R)Ef7*$$7ScrrdFIy@SX;|!=X^UlW*5`+%ZuT<9r+*4Is)7d`iX^ZOK#Yd zEA)JZ%Uj?XiQyewU;^m??IO(?PzehZ!HI-8W~GnOjAs~4FF0?xRWZCAcmlT}I zxASZS6ky1=^WgZk&6$Lo@g?Cu*fv)hK4lx6f%C(7PFl|a;~4!*MvSki3RRO9+Z`@b zT$-+iC!cZ)N|N#IuxZv0T(8}vaK6`e)u)GkoqO7Y`o|u{q?a{44@)p#tJ2Sspd=Dk z_?gK0`}HGj@*HBzbZN~4?JgbfPDC6Rp;+8?6zHRjy*D>0%o}GOu4E?XK0tTIC4Fcm z-%%N+WMv`;cACeD9C&!=iZ{Z^Ggn{t@(%m)zLCf5gFfu_=*QXB-V+b@>n+fy+Yd@7 zrll=$t};yDN?z0AdU=rO{UB+_SV+yVea@c8xYP9;SreyJgnH!`)ebb5lWJHiJatCr z)v-N={GZ5c)T>VRt8M$-o_jEjI(gNpd+m+APqdyM5xTkxABE?jQehY;ArT0WSp0tm z+c`Fe@821V5-Z`2duBmJ1n}bgA2ERnUr7uv3HWQ}fadp(C_KEmcMD^b;~%*=1#5~N zroTa)C2a^U1@3%Z#PN%PZPCI6E653AKy-)&;ov6{6b{j#Fo+G8d|-JL#DvHYl~+(U(wpVl1q6gI~PJg_%hlX)egt0ehbbDUD} zn8ie%R_meY?fd;3zq&j=*2;JvVTwb>yuZ6aW!UFE6RVHVikI8t6(RJ;Qqe?tH!3Z+ z1=q06blexJdCO^T>{B^XvFmJ1=56`-qn4E5#bkBIh@9iSsz$eL{de^dhBmG32niW! z>&jfBxs8=LO6c7GB`<8de=!Fs1~^Ee?`wg^a}Xb4LXL6Wk@>&=9yG@XDL(gF3l#Xh zOYHl1bOh{Nvo(VFd2k9~2F$phf=w;WEdu}ITuUcj+_Sv;y7%bQBz5E|%l>j`@wGYJ zLHS`{pWPR2OCQMLLFuCS_1(*ss2W(5IqrTKZL_U2cJ$L;y&KnTFJHu`llR9GP4WUB zr=MG6O!zRlZ;hghuZr`BxPsD%#3kmC|Ghl(Uxe8E>RnG4h!VT&{By+ID>9FyExAbl zLV1>Ye4p07!95nHU4rNG2_?(7zBK*3Yawx2tcL!VV1&3}s7Tp|tcrt)?gtF6b~ks) zZ-FcgXj-9u)jOVBITh|*m*sgU^`x-z8{%@QvFJ;I*ro0P8F%A_(}U6&dOJPL76j#N zsEq{q(6-5a>I*mYINt1fyX$aXoaO!Ox~wg} QJ&hM32>KVoT7vcf00b!O^8f$< diff --git a/doc/SourceSerifPro-LICENSE.txt b/doc/SourceSerifPro-LICENSE.txt deleted file mode 100644 index b77d653a..00000000 --- a/doc/SourceSerifPro-LICENSE.txt +++ /dev/null @@ -1,93 +0,0 @@ -Copyright 2014 Adobe Systems Incorporated (http://www.adobe.com/), with Reserved Font Name 'Source'. All Rights Reserved. Source is a trademark of Adobe Systems Incorporated in the United States and/or other countries. - -This Font Software is licensed under the SIL Open Font License, Version 1.1. - -This license is copied below, and is also available with a FAQ at: http://scripts.sil.org/OFL - - ------------------------------------------------------------ -SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007 ------------------------------------------------------------ - -PREAMBLE -The goals of the Open Font License (OFL) are to stimulate worldwide -development of collaborative font projects, to support the font creation -efforts of academic and linguistic communities, and to provide a free and -open framework in which fonts may be shared and improved in partnership -with others. - -The OFL allows the licensed fonts to be used, studied, modified and -redistributed freely as long as they are not sold by themselves. The -fonts, including any derivative works, can be bundled, embedded, -redistributed and/or sold with any software provided that any reserved -names are not used by derivative works. The fonts and derivatives, -however, cannot be released under any other type of license. The -requirement for fonts to remain under this license does not apply -to any document created using the fonts or their derivatives. - -DEFINITIONS -"Font Software" refers to the set of files released by the Copyright -Holder(s) under this license and clearly marked as such. This may -include source files, build scripts and documentation. - -"Reserved Font Name" refers to any names specified as such after the -copyright statement(s). - -"Original Version" refers to the collection of Font Software components as -distributed by the Copyright Holder(s). - -"Modified Version" refers to any derivative made by adding to, deleting, -or substituting -- in part or in whole -- any of the components of the -Original Version, by changing formats or by porting the Font Software to a -new environment. - -"Author" refers to any designer, engineer, programmer, technical -writer or other person who contributed to the Font Software. - -PERMISSION & CONDITIONS -Permission is hereby granted, free of charge, to any person obtaining -a copy of the Font Software, to use, study, copy, merge, embed, modify, -redistribute, and sell modified and unmodified copies of the Font -Software, subject to the following conditions: - -1) Neither the Font Software nor any of its individual components, -in Original or Modified Versions, may be sold by itself. - -2) Original or Modified Versions of the Font Software may be bundled, -redistributed and/or sold with any software, provided that each copy -contains the above copyright notice and this license. These can be -included either as stand-alone text files, human-readable headers or -in the appropriate machine-readable metadata fields within text or -binary files as long as those fields can be easily viewed by the user. - -3) No Modified Version of the Font Software may use the Reserved Font -Name(s) unless explicit written permission is granted by the corresponding -Copyright Holder. This restriction only applies to the primary font name as -presented to the users. - -4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font -Software shall not be used to promote, endorse or advertise any -Modified Version, except to acknowledge the contribution(s) of the -Copyright Holder(s) and the Author(s) or with their explicit written -permission. - -5) The Font Software, modified or unmodified, in part or in whole, -must be distributed entirely under this license, and must not be -distributed under any other license. The requirement for fonts to -remain under this license does not apply to any document created -using the Font Software. - -TERMINATION -This license becomes null and void if any of the above conditions are -not met. - -DISCLAIMER -THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT -OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE -COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, -INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL -DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING -FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM -OTHER DEALINGS IN THE FONT SOFTWARE. diff --git a/doc/SourceSerifPro-Regular.woff b/doc/SourceSerifPro-Regular.woff deleted file mode 100644 index e8c43b852e10e1556268d6c17b47bd0644d6edec..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 49960 zcmZ5{V{m58^Y$Ivw!N{vv6D@*v2EjyZES3N<78vowr$&b^Zfqb-l@9kRCjgv^x(|& z={W;b5Elo40KQ8fH30Sd0n&E-O(Xut`TvWskg^y65a0dH=lKtjgo(AH%2E;lz&}0! z0QnpMz#fMLgz`xIQcwl}Qndj9oNWL=7rcLIJV8QPMfh9y9RPsP2LND4*9^zO6qFfR z002039x`CA71KYV=wz|5@OO#uKDQ2@YH4**z1FWt`8GB+_W z{?4lKF;JoQx%iSGdb1NL9r0aJlL z!T#@=@BAhI`48L?Ecu&;0ettsf5mOpNZ(jrKl{;+3=C{+^~>kWTRj5Xk962i3I~w( z0m=BE(6?<+GJrh*0^kLJ`d>}o!|~1g?n3}L0OUU#rtLjk{{Bh+{-u#L0sj6yc*3lM z%-GDMpkf-!sTvyUX{qXdj^{tehXD|O804$q5#iyx(o$_d-uk<{`J!j^{QV7BB>&uS z%<&Nyb$5dUD1zY|+*Ugl?93Nb@P}@uxVtjz7t%LR+MC)NCO+EQ?pisP|JE1F4fVF9 zA6Gc@s4_K@sw#(h=-0yk2+y9+#hwk6OeKa~2&Bg452F?lh9(*yG)57Xi?Dt^^Y(dq zx1BqMzQQszqwt){);YzJx|^kj}+MA8~jJ>3x$9mzRG1NWf z`8|c=E>wELu-RNdnTKbJ9ehp{xS7fe^m;TLmijR|re`ZGw;to<0+CWz-m;E?l6l<{ z-Ga|}a7*Ci&N#Rc*cAy1JTwqs1v=3SLBzF1uJ~M1bPkc`zdbbXz4M#Zj~n;ug_(2` zg{EOaku%b}z2?OF}g@h)3&YG3>iBN));$3R<1sjf|}Jam_%tu5d)0$1iL zPt^E@<`MT$_A3UmJ`cyLz`d(m}@}sJCxvt|lTjS!V6nLyQhwP z?@t?>>IzJkT;#2iNwJT<_ik?l#~iqIg7KsNy4IdaT7vt(i?y8pj`sF}e((I^@Lg z_(gr~u+tGM?cc;b+#f-$u$+0#L$Sh5UU(20k)0$@i)yO6P?prwbwF_ECRP)H>e~Sn|$56d;2K(kXN=!2p zO@5ViH(ILv8hqwXf^1?oOJ|?M6%UM2d+bsQ{fPS-j7fy0w6Ied_3Vy(!wKc*#cxx< zo4E3tO6%iyO;bLl^KtzhhbYfDm+`|m^*?7^HPL}Kbu z4r)+VpSu%)MOE_-tUnxsg{7&YxGhDxg{DQ(azG2Yt?_PlTZnk>t~e=eL~}Lu7<~SR zfh#S4nwC5xnC+39yvvlk>19^S(dOIwleaIHABa2+Sy%+-4>F!1+je>*r1yi&z)|Nou&3Ezf3_NWhF#Q%Us0%uy^y@4_GwkldqRZzgjO|l+S{<4 zzXRLObqUzF!_)slFuL_YbzTReeEyB*f&QrjPAWNRou71p-AguqFmE~^2npvrF9D{G z67VZ%hnr25j4x);JfPS-_UOuQ(hXz-C8miPW-d0Unh9*~ zhW&6GuTY-^(||&Co42AD(|B9L*buLA7x~s6`{jIiVSU);To#TjZo*ugIRuEV?nh02 zO@8Md7TS_s;+Br3K8(iKM=qbxkx(0$eZTFHeLzXL#|>G-P|i$XGebzm1j~yfi{^bI zVfV_E!s!4SzCMmnF~P$XdUq}wE&l3+w@QMEavW}Z90THp^T7n)XOfcl42^a}vUtNl z5Ft&YX7bB+RLuRFP+PlcIMXVXmRT}ZSFWWJT6CAaB`$^;!qWi&@$ZZ#QzEZ_CWP)8 zqH70fz1LTpG? z_U=FHme4ioFR#YTg|JGWvx1`+ZvV4DX`awfx@vvXdPh_JLGO^)mg)A)y-@ zz65{fdPZpV$87@Xrs`JuMtUe`*OhF0nQ^qL<}#H!9^ZK!jUKHM!zAJ{;?IZ71QY;C zI;*@MSnnJp__^1!0i~;E=tmcqZ?5?JrTSoLtQyoLgK)AoC5a;GU{z*RT>2~j@35|U zmtB{^R2}C(t&3LvjcijQgP7`6D_#p;gRzvW--;nNf%GFBqa5{It<5S9ZVq$1g9E0y z!>Vi_N+(6=OLZ!;Z#cQA?h#S&iBtah&s1!pY_EA-Nh8|*D%xc1se|bH~)pyCU zimLIN4%K{Z^Rn~@<)BF|miRwd)XGj%x?ySL*nb(sT#20|dAKI9N2~A~6=idu`8qsV z3<`{lg`OL=#+C$VTLsBotZ0N`P-w#<<3ccNDmEuiWykLTgS6x36Y)Il)2}Uf>!{aJ zZN*`@+hBN&f_e0av)_VSLkLdk!#UN04LPVv&Z4l+z|;jX*P%qW zg!S+__joxEfZhw!dKfY5_M_f+HysBS9Y>nD!Hh8@mor0KUBfQ!s8nDH+r+kRge}#= z*ll~li>Lp-L2^UOxIt_*BL7DV9Wk>U%)A^8tcALQnHn@88k8im!?Nn!_2d24u3v=-?F6-%eV_Q<=$N%Z9LZ9M z$+MGVx2F5{UG2zf?sr7Hd$mE|F`P~;zkELva_|t>k9|l<%y@b_bh_%}QYEgqU+F)o z`49wWt3)3WB`wUg?UVCZbr?eQNw{H##-ZJsfA;S!$TWVfq*iJ@L@ z+ogyz7gesL+W&DmSyvzcXHU|N6$K$9c~0HBqFWcQ?6gKBT5k2RZdB2n^N#LluxS+u z)(Cb9oc@I;Ok{@1E;9yw$m(}9GG?`jC$wAiiRAXs(el$8Ig1(Lnct5R-!7h}CZ0+7 zHW+tqkC(G^ra(z!{rwG&y(gq0A`(S=%Zr(%&&Ld&iF;sptspC^@mmW1f)BSsF~K03 zJrj+8E32&-4ugul`2~vn)N22~ICiZ&ccLadE?g?Z0gW|mee&G6f`o3kJFg>a0C&`I zd2%@$%d{MTYAlUdzXVZ>%~AWW&dN^zmwn|#qW#TgPb@Net-qoNn8-flpa5W-0*xI2 zKnKtOxB$Nay5E}_(ibWK7Gwp03JMQE0uA~`);CtZWxng?@3oUe^9BI6O`Ou`>l!Yn zZ0Fj}Y||9V! z!oX>wV-$}F3nl{9pd>@Y3d}owA$UU_b;d_bygsGnA5{a)nLRdKp=}O=goAp!8_$4G zLL$!C5SPA2gQZw@d^B2N8GUe(W#~WlXg;K}?c}ZDAiEti`fPX?;+xdiV1x7tW54Zg z(^h32=B$*vESB%{BpDttWd@`j@|$Dk6UZ${vWy8%C@7RjVrVdmikKqutkES}Xaq5e z(JezX^A}5P((|^aMeeEjrKYB3?s+=ou4Xk}pVLp%A6M~0jDJKWlp6h6=2;w*uIQy) z7I-AcFfLi<=IFEir?<@iIK6Ii$=<~tlcs#Qa`t#uPB9wYju%-}P_&YfoFT&br3pTE zU)ihmUWrgX#$&|fV-tv11ekBv_DZjG`PBGqDy<>i* zeGPtXBR%WATet|hNU^KYt5mO7m(!GLRK95O-gbZLS6AJU+}W3O)(L%Yz{eKP$BnIf zm$C(|aTZ=n&1=sROt1_>n3O^81|rXt=Wr6eFvB34egM?O0G4hr&T9~upVzSWejrTn z@x&0O-K6ReTHA2Xi2t^+p2;lxg=dIa@>QH88uF35QSXQ{#*VHHrupk(P?mCV0)# z(a=;%Q&qmI>YYiRiJl4L&2ikU-*}N$z|0vaJnz9hzmJj(V z3Tg0Y*Yj)t3$Aa+XYzls@p%VSCb@)*;O0VtQ+9TyhvQ~=hS}ZaMexR2N2UUBv;-jO z_fr@p5rx_h1yw2_2Lz_3n>b4n60e5I4MiPP3sGHtc=(vgKMJH^WvhIepS8_1H0<%~ z?gh@)?2wm#L*=T&qf}SLfz~!|@0rh+YRHLJehh~T4jAj1x>x+fH=ZW*DZ#~RhPyEa zAcKs`v~<3b`V+`$n&G`o9=hBn!38nY}9qu6QXme?+N#L zC;_q{Wg9K`G0BmLg*b^$)2>)FdK>jjPGZ6Tb3bbDxb6aL^4Pcd>zI`{2iphr7fuNgywXvHT@x}Xrn#o(?meXm*?fxlDyC}l8~<) z%h*YR$1D!Tj(-(!1cWHUEGV8X`v)F9-g$X{%`VdStUi8jpDS%y_h8`jS}DJM5pKVL z6{UrzrA;g;Tvsk;42l<*q*EyPaOrN@%mq0`|FX`<9l_RAQ@D@TW49gNesn5Yz1mr9^2Ug(69mbj<*Jl}m-oifSa*sf%||jse6DFC_(-9!o;|iNoDQ zj^3s{(5szalwY=a2{^TvS#x`1=$TB3D&cSFARvZjB6VyWRS~vZo+XzfE#mjA>6x(< za_F^N%!z3!QQlGD$1#r=00A-Q+94UqnrGe7PR0E>ErS+YO69h=O**<&LJtGnW&w zyIfhAkrKO@y7nS2)~c7&rmzP$;hFN-NNtGx8YNobnm2oohV5a7-Aa%am*mofS#aPsYxo|+axBtR!>xn{=~50N)4AD-eddv5hQcnPl`*} z*KpJB52AOSL*br#L_&wlP{PyrL%1DJt^rGXuP413+uQmSpJ?BXzg43)-j* z_BGe$h;E)zBgO9c-+LarMhNz&`aYhkolL6!%AKyIJ>vtjjU@$VU=O3R&|qwv3|F^j0`%*_XJ{m%+B7W!NV|2muLy`M|3Mt2Enudxz#UB-XH3Y(F!JC?$|$+-I#`dpVyWK;{NW3}6L^;^r@ zwU}Qv0(r@Ty&-hc$-Mjc-cYV9`gIr|D*f7&j!(7F!DblzEV}=UE*kw*@c*k4KmQE7 zV7m^x;6uoByPXjC_dG!xwuU-StSo3CU^)PiHyrqI>><#~)_p+ji9{J9IPG%?*b<;& zUGR;SV7)%wn@UPcV~*0TbN@_NMG6IJH>_}hfHd*Q)yNI)j+VK%-={f>C8mws;E&V#BI}%+&W3c|+-FL|-rE&CQ zE{Yt0i$wLI{Yw|EK{6O$swf&{fo_l$LKNeQza1xBG(T8Qw)0c2JOcJl>e!Y2bvtTS zFzP!+Gr`qJBQ1`^zqESZK%b_OLq{azjXJxR%^Vgy|AWJ<=|=J=-BKG++YEc2mJ=?r zvwA!)ivdhXph#0d13uvsUmW6T4)pH~W;)n(YX~hR7^G@_cU~BdNHf$T@aWk7SA1o? zycP9`0O+Dql@ti>XJF&nnxK7{;17pGrkKQxZ0t#M-(kHluKw(53q=j{vV-h881 z@i(0)N}SyA6g+paSMB4OBgirswZ#*&Rr%?$1ciKJ){1KXL4=sKTyP*^PBSNv?`m(ltMDd{ND}_pA7d%xWfU74?74EFAnXEzu2> zTiloSE3K|b>VUy;UN;>8@6G}u%LGFe$%$5&bu1#*!7 z!FsT%(TLl?HFdf~8O^Y2m@pCY_!!*|ZnJFA!9qmTtuI&Iav@n=^!@y!X*2Zl@j>PK zyPQ`(*Vy2yfj6aUMUD2n#T2VOnO8sq?bsHygF=E5WxZZfO-o}BMu+SlmEYPK<)bo8 zH40C>OuVT*n2F8!Dij5R3~v%T##w0d`~cC-0WH^n%$wG~L-vM0^`tW`OFwR~0y0!F z{{`N(3_NZ;IN|XZ@TqSlPE8_-(jd)7K_S>movNV%$yOE^ImUTFe-Hjl3(;4J^{%KJ zQwEEo?3YEja9!ZTzzWc|K;xqqKLVm7G}f z$CJ@_#5DZTZu0cBO|J=p6^Yg9&cqWhT~6yaZm$HkU`oPs$%qcs181mbf>yN{&qsrP zx3E7`ogCM5lp{Cpz290gn0DW~-3W6Ss4^HGn}sR ze+eBtUPGPDxlPobhYIhDCU1;(NT_~Ia*Fw^dStJ_QiRi{v-wmGVQ&Q!OL;|p{ zvFVeIx9nLsm2V*UmpWIOxzsO#2K=YS4mDkSXq9yj8{X*hduVwN0w|(KhG=hx$Iw$b z3!jS`d|wPtxycHakl>%~wd|KO3wvtbw+U*@AD^UOIOb{*YcA4VUIeUc*wfP?hEVI$ z>4%zmm$am}p)S-eV>YrvkE@0jxv2D?X&W~;8w-b>4sm+opRDdAoay7y2kT}X-Fk-B zzQ#MfC-!dd<7sz!2Ohu9E6XVxqc6(ZyuqL-XKHYU{7tdVmQz@OuX%%&zpJO>t*uMu zRq-QbsuB!>)2aBi8PkZEDrnX{1YLp8z{^+pLkX?ehwD(mnkO9dgE6}U#s!mzRafkf z$SO&5I2$ECP@7wO&MX$EI(cYk>}eN}3cNA|t;z%!z$4~39UGf{?PA6@P?d!`^BPR( zG8DwcMeH zgT_bvRJx%Q-KtI=4R@JZy>Ii^A#dZy_O%GnR%E+pRlDsF>)WL#di(Fbx~X0!W>Pxo zpTGwNFFbA1y|IgG6dz$hMn9j|X0qzcoUB?>lSO-A#lM0}^`7+^W-4f>$= zU>iM@``4)%r(7A+7Q8~Lm~E(N`&NYSFGekV5=|p09v66enFgJuC%Q!|P=qD?=5K}MS$_d>CU)y)<{b@6W4BCkjUQd@( zP!riXJZ$GeSuERX!O1HErX`tye`MckzZ|b*tFvT#$V$V~`bh#f+J0ZV0fa|Vf zyB>%A5$8ULovW1r(v-y$Z|sk?r;#Xjp_pbCz^7hu&5PSpA|?Ka5_WQfK^adMDm0xS zVGGM3S4QPPISa`(sM%kzBqUL zB%@lDBMHLyFUFEWMEG<6=VA9wsWH3rci!5)SwuZI{?8Y~k{#sb5u#sd2wt z!ij6=&7<;B$QSj>+0^+LhrNF2F5RMZksV(1OsG=%?ma+X*iJD#5VTt9o`$h-tc7&g;yp|!*%n59Y=^=!j?{H*+VrtKbV7n!C||h zpCf`&RE%eVZ>>uTH`1%}Bm_FiigEZR#4fl)UnUZtdZB*>v}XidQ8z|=!{LU?pZsd# zhm4nzpp65B9w$2^^@RQ!*a)A_5c^%tKCJfxQ&{=gp+%7<=?tT8%F1aHf#GT%W@NkM zPb=6#cp|Iq9IoMuQ!-|6WnkrNW7(7bG#)~v#`}Tr)>#;hZkJA-UOLB7L8#5) z%w9g7wh?knicK_Ln_W6P50&FiR`SF>v6=-@H z_~89^&7P=v!8rzEZZR4!;c|jpjy+I&H#rJol%(qFb8E`7>T5(F@bZd!^Pd<6ApbxS zth3a!Z>Agb1m*b6!O~1q&eP(JclKu}8xW32DwG0`kwwEhQE>6y=i8QqW5Zl%%y*s7SYn zjqBo99#I<|C<;7c<`;MCivhEPU9Yrq)Hti?ylh%H7-7&MG->6NPQ;UI%?whN_LHMGz4v$Q*KIwF7zQ z9l?WY%h615lKAtTMhU-3OS@UWRp(*v%p7BkDN@>#Id(eAaXD-`%64CT89094nVAu( zlq_^HcfP-NOI*cwSeSeZ6I@*y(XI*8ZQ^)X2T4^qwU5NHLUMl#J~W34vp zEKjT4Z~ z{xl8As)eHCz#F#$RLg4^ObzO#?0rt}MwlbJ=uB_WzWz)i&%BJxzN!z9yfmF&x{1wZ z*`d67E48EAKnl+5^7~D9+oIOq+tKt>kvXX{9Udc~#GwBRBE7H+%ZHdh|Fp@fG12z* zek&dq4vDsKMw%Ah|C7UFY2a`;NE!`hwx`@&DAgmK?oo1Ur1}HWd6cN_Ni@YkMz?n* z0%5T1ntf|Aink!*rB^_X%L>x-CV`tnawdF7s^q*12HIw?8xJdr%Hoe3_1eTz5;c8gnqM-W_>*w18g+)`7ERnkV?sZ* zC+je6O4TKuw?B_neM2Z;jPx^Vk4$K?Xo+fU-Kyn~k4>tmQ+G|IK+jcn{+0!o;f6I> z7v_V@@rcJipwzc7@#cGsAqeSF$K64ui~JG24t4KC;9OXvqha>*4*5>Gk-rKYAHglo zKO8U0zaGnHyiCWFa43Xs zQS;~TmMW1xpx*FKyv@oE;RAiG4eqYdZ0?j8&C@Tx`VU2I6j1)e{>yIFUYt9}tk1dc z>Qg=~4^2Q&QL-0@5F@{Op5KmaWAt69Vl;ZhPvc@il?~En$k5u^S`5wo(C~gsFpor; z64~K;M4NtmXmQ=J%eKN|r^&Rc=9ruVx&&8x`NSdZJtb{!g_b zTvFtNUG-;l$vOu$mROa7<#Y+VjV+e2uhV6=S+b%H9g%TT!2oF`z8DSL>gMY&aXlW* zuXq@A@U8g=)mTH#WWVIdcd(x_?0F{WI^Eabsbf+&OG-F3;LeaSUzDzby%LtJJwo5q z@pd;IJFxQI-EUoO%(%LS#8$Yi?b?XNR*09gzmNaqZ%96pTThtq6Uy@rDzCEjzZ)i2n ztUTOaN`By-V5|eet09(8br2bZWnO6&Zs)HOM~e+UizY<)8VkkDwc39zlug>OB^r6` zGOz4&#g5T>I?8s7Z4sIo406D{tvr$X`K!-2jat2jbIp#fII{qD{#{VaPO9|A=EKkGN zJ-e1XGzeK@m>Eh}XAXuvy*I+FDj>3TJlW5zHEIiI;@HLzQEhKwYW&ZEsiB4Tt_puT z&SZyxMz4uZu+B(pYUL%@OpZ=OLDP|57lzs)1u9%^R*MYh9w;MoBh8>C493zOl3xMm zeCei%_qj7qu>WtY8V2Ar{|HtJ+^Sa;>hceM&^@Vi3|!)QnjU(nVQLzG6ieg^q-n^W z*KX*AeFb*wpb(TlZH3slNH|H9tGqi+o8&k z6KPQrEjg^(D}fTtDggp`{`y-#D!5IQr#-@}NdGw1U4J&>t3`Oow$msdS{RC_|sbmeepQaa1fK*S|p zp$!z%WamxuaO6M1nZ~1x^i-|aEFnUNkx-RNJnCT8LZ#g)@^&@hK%t1%jNiW%v;<8N ziut~eD*rxdMLl}d{EB`<(CzE)3Fj)O9z&$MMRQkDG_~}t@8n8vdJPedYu2Q53szFK zhT&7N9H*=z>|-}IQi}#!j*H9U8JmrgNm}ZJn2A;oKV)@7p z_6`5vdpjn(^!kHJZF`cx2x+~PBu>!?+Wrdo8$;pS{za=FWfc6bGW!AEAOk7du2 zAaDXd*92@yw+uS0`>CFkSSf$!MJlX`TvjdqP}^LNd!dTW3H4l)(HyMS3C1dg(~nJc z1)c?WrLMl-7ly#<3y#JkI@5nT&#LA4J2X#^3yYw!wlgO87LgOLA{lr7Rgtt@IN5>o@Z}~P zJ%f&vx#M~dWl`oz#t+Lc=rh7L?8mbO*6Kp=aiiLdOffyt-&Phnkk=7k0@tDd;j95~ z@!e4p**g)P?|JIauhR{Hgyi^98_Ial5X5>-risU)oWBV(xmTY05yK)wZpsV*=S7@aUdd;NNMnq7v8R|m&db%341*z=o>)rNzX#J}l^IJ;xwIyY*?HfP$`(ZJ;~jc54LXHmlObQ%PRf+O~b7t6x!IQ+g2Rf5pK=0 zS3Ztm;{!%DaNXR9FsL8&f`L22C=r9AgJRH1x)3Z#zej>j%vHtjN%jS{Es{8B>*XXT zr%CjLh)6}}p~kQ(&riReR@tAAY^2=G>@Gbt$6mCzW4ONt3jNdP0EI#38ophL4=hGb zKn$xewSsLazSfrS#;DK4lD|%18FWUvp$smi%pFvv<+shzqbJ)$)@;8*F@}IUDpt9T z#1RNky6#}sdFBGCK%ogjSzE9{%KD;|^C@O1@a8N+j&IG!NU`_~HV+teYJG@QH4sfb zAKXQ~XIgmGo0EL=3+b~a$}_eUu1jn1f`3VnX3y5xz$!yjRcmP%(WxZ8)mV8Z$OZJ+ z*a9b7RacyK{E%jBovFN*7e>`JRVF?Q5pq#=&Eoe4Y~5aM>C)n+*a@JR!p(X+Ps-^B zGHA)fHdsj|%E<3MkRFNho8%Q}D_@kD$z&o3ZvmwwsK8U!o}jh0^P7#t+M7U;k5I}4 zYvdgR2`9>C+vw$Ht_Fv7U*L|yXmiG!29z4LiT0Qyv93~1(8~u2B@`zb{*mW~PIKIw zGR;@Gv?wCA?cwF%^Qi)W5!J^xY~{Eq?#y7B3~z^X;9_0tVlVVxuLWAoZ@X*&&I(2LRf`5itzr#IOm zJwaJMDk6Y@Yy<9^wr2P~M&ehRK1UhnO2WY{X-n&XEF9^>*Al&ff-agX z7C4hG+{=7AR7)ntEevDnWhL3kF~phI`3dfFDdM&dsJ2hHj%tzBlMhF_q|u%HoUvqH z#1Ay0x=ylo7nlDHD>Cl!|JIIV84Ulay?%iM>>R4LDqp3+4R|US;{6u)!?!ZdehN?V z8!VIcsB@iXPLuW3K*1k-*@W-5I89I6f=M@kI9`bDFMl6@-2m!dQ2u4lQQYi5Dv4!$ z@s9OHAfgKEYH-Bu+6ks6w_!&n8O|Q3Zx#q@S$W^X49vPi^*OQc0ZVqq=j2Byx5svDvzE?0 zAa%t)ZRM?;GkcE@rWHJdgkL53L%6b@VTvzQ+AwU)tYF{}eatj&pb}J}Pp@PWZ?`gq zKdAM%2@wfO74HH9K#*=0l*n3Cv}uE6LOPwc$E}B%nY00w+L&QyTaz=_< zLru`CV`H$d42zOzMsn8qs*eh7HY@!E2wMAnF*ikff&t4&mt5$KISlmCR6I?a6RZ3k z`q-^^^|Ehhnc=HL@|F}KxO?Lxk(@Fd#D1usBXZYrBi(@N@|Bu4;NPxF{foua8!t;3 z=aV0R{#}rL#N;`ZCI1JbBiOmWz$Hj~c|d11DH9dLJAl>lWUQ2cxr_6lNpwKHX0`%8 zHHlXD#$a0a7)&b$3aU8sMw*%x12uv$a@#pANR;#>ZQYc)%eGoINhY07w`&3wy2NW_ zM!$wM`7M%LhHWk9eaLBwV&T*=n%0AHnr$&HP)99eOG;&C)H59oX7tVW8CpZqiv(kJ zj>l6qPO{{Fa*p?%Lt9^O?$*GUZ^tFg8Z+pzVXaw)sEj@)i6DRK2>9A7pF!ok>F;~` zdr?_1XMP8no0j!!=Sb&yj)ibH+q60C%+;80w36w+$YvQIttwK3+=O(!m6Y(7;K(&?mUQuJ^vlR%AWw;cwJ`3)%ivFHy1sQUq`ZIMz%c*7o1dICR^J z{#64qqF}SACE|OUe>!_(9IKBOlIJb5LacPUks+(hZC`h4XTYrE zARtSznPK_dI+=um8SFM5g$#>0975KS*E7X$4MJUtM9vIXs*tAW;V+JZ{@yAYHzo>u zU8yOwf3#R~>CMVac=*ZM5T~B2qU)MHDR*nETr^yx@V@HMLblLM+6KON37PX{+@8dw zfX6*o7vIecoLxH=i-*0N{g!0^nbmpN6a`gK1+oh!*xGR`<3kz2M?}TKSs9~FlWKL4 z|Ln=)Df5xYT}H)1-=<``7agdg^v}dy*et16cDhFoTG{Y=0c`yHmob=jOFO1g zY7qB$s!E(D)%{baWps|@^QV8lgYMzc)dv;1Mnt%`ej)8JIOPSb4M7}sD*I$HZ@*! z6dIci`xQ-P-Oa%=kC%xri2gga4@=K(boADxY7n6;AvH&#sOVMD*$9|i>{s|JjNh7} z-2Z^BK<*3@R^6!;GTV%aAC-TJ@3p@FCP0|Bi+U6M+2v8XCr(jC8mURf}{}{kuRjd?o>@4$k~Kt(zRX8sYI;PR8#+)7o=#um7$ zO(AnUjUFpXSE-EhSeLswLmjf!{4nteV7K~|7oeOgDUWFb-WeRK>LsGKHT zlz6YwS1Y#^{rb9I)hvyHczVI3MyijnP^_F_X6!t&B3y_GoJ9PMnXtx(X1EuhoOXFI z=!8>q;M=!VyOS+dyk$96c$ofxXXha57{H6?!j-Sl6dTFKAZLRUH3ZdEID3yFckaFr zw8VQ;#=r0KzR(rMsO^2dy#VKMf-!i-7uIX`(iA`>*k&r1Y|;0gBD|>;Z03?eH6l>M zrr9L*CZVrW6sKnD-T1Mnh1`0GCp+U7pOJ8^EmB29O{Lyx%Y_-`#sgg5;7tA2>ztY&$Wi~Jj0nHimi%24{^!tEKY3Xr>E`mu~#ZxF0>8^J(Zj#n!! z+JgcA;d9v^v9^EFJvnW3namXp(vBn0>%Z{cvzQ|K5p~ia*llV=C1@j29>Cd#s~H zOG&*7U3A1$tJd`if9UcvdSj7xf@x9d?Vkv{L1jpzh2c6#g2m!ej|eD|cCMRi7>cww z8Z=%?L)wJ=)cc40eU<5u^g}ChdrT>Dr$#uyUIX!p|6l8p{J?K71>X~eJvrs@;h8|T;nOyTI5 z<{-qqTJ*N#I^^=}G$|6&ZDlvok>elnlo8yy7B)g5po$W!pQc+wlU2v$ki83^E_bAu zipYg)@1RL8i#cw7zNyIUY{&jfxYSOIEOy0n4}~p$7MndqXI~PLTv={r^^+I)bzWtO zvtO#dz6wo28G|^b1Ke@tJZLkPakwz9VlA(o6sQr}GAZHf5;NIf?SK)qkm9OMW5>;0 z3_`=xOxW4RRpzBzuFcBg#-wv2(6@LRCy2S(aXG{^k3Kv7d_+3M(nk6OJVT&_l7aew zu)WXTC+E3&nal8Wm~asi`Iz|hP(u$z`vi_Md47O$2*cxzS4$=# z;jf**zL|AgC|BH|ee$;1kP{NEBu_BFQ=#_3jmg(;KkSR8$c%foL(Gi46(}E#Ph_!T zBoZA5n@BzWT40=OFX8YD;X zx@^UGt!o0(ERf9v+|PIHxf<-U;rx!bQl>m`5grn;ql=*uTuC~W6i1doe%*gO3}?7otSm1{@W3*72-kI6To$04f+1brL<-me%uApN>9<#xh? z+tK|QsWjFfm^_&P*weUc45*DlC}|LJS=itAHtQTbU3C%Hmfo~8Zq2A3 zcCPM39s5wLUbf%+2-MwA>Pn~-=^9)lQFC|_{eJ*oK%l=mJ+Zr3+C7=cOzuAB$<%`W zTH51D*Zjd+#`DUI9pc8}&mDhgTXzSEgRl7;X6tYq{GvWn#kOuMvvoE2^Q}L+t^3yR zZ0q8nkN@(2$kyHW2efqouyz0b2e);_)7rWW(DoaDcw2Yp@59#peq-6+&DQm^qxrQ7H^4CI+qXY2m{$$ecPbB=l zu-RZvm<*PPCFS#_@IU_1P&9DExi`T715vuBXmPcV`xg2S%vJb2cItMqW}M=%Fe@c- z_b#z?E8G^T@CEQ~>)XXYAT{je>E4F%+yspK!=w$B&fbpePRQ!no98Kd5RLn(&bGGA z?)H!k9*YW*?$eA*kincQTpC8W=3S(P$>gO2W`nbs@}Yb%;E!#eE*^_p9eM>yn6&Cx z;Wbj5QQA?lC+rH1MyU-r1g}OJ8(b(Kj2cyXqt(~|;nWFXGp6y>Y9BgEXl#;cJO%wb z%KBG0<*6dwB~og#1u@>QvWxemJS3#35)x~00d)(3uhL{h*C6vooe~$e0e;?F{bB&bPM)xvdz%G(VE4vQ}0hLz68xjUyqg4g??}wt6a;;>X zoi&zfWee~f?~#BWM8j~;BqICAz~2YSvl8f0?l1Ts!;_qA_I;txVpW)|8U|POYc3aT z5r0@vYu$-Tz!A^e_%WyG2nC%s(GeZ#FWLRUY8v0$0r&oR@4Y*9@^EjaH@elv9{JwM zK6>wSHn=zR2ilEpfqN&BmGsBTeVvRucqV!S!O31N@R#AM$GMMl@8B`Qz5HPbLvP^T z0UCs2?GYT)SZYKk1ly@1a~5Ki3Xee5ys%O4ATtogBkRKH&3ekEV8 zX4gAh!0K?T=rOoHiO8N6@b|CTnyV`MD}s|fDB$m3Q<>oY z9$8TUZ?(rg3ZHrSpAtWz>Jrn>K8peqRF|^rcs26Lzx(b+zXRtgjXu#{B)=rrDU_$W zj(_Uqc;`Cw^;6#OzV<4`AG9M#bvEKbm%kn8k9E0?`jFg{NQ*v4&VxBg_GKb8 zUSk*EC8Wc4dpIq)>FblWP}b+og>1G^&g;vDq`g7DfWFHixIfUh{cq&{+g8WXApacr zXU;VnEW zr0Tt2k33^Pr|Gs?L6Q}pTz9{V#$8`-Ki_`-%dWAD>HUtc9z`+!>(GAzXsN|JVv=yg zj>itAs(fmcNZ0nIs;*D+{6(MV5#m43-!*>itmPM9*=-n0FMh4(Jd^Z!DtN4clu z`>Fs@lKWc7c{upKP0(&)*QNL6cf5$+`#tzprtX_lS%UTs!hI_cBt43^J!j!l zAH1uOcQ~Yq6Sv<0uXN{sMAnB(ag!SRKe#{CA;zYoPS5BBT`+`PDC~GZhj}N+ocD+K89vu$%SBlPLQJdBl zlg?tLKRi5|ru0B%x!q=R`Vnqz66-(mu7Y=>B<%*5jjOPBlQlKaWQgl%penhk>`1aY z+hu~p(PgQD{!?@S@m;M_{Q6FCOivsEJ@iu;M{e*@v3@uLdIoHJ0l#_#&GBCWeS>ub z$MhA@Kh#e&OX8>(cpl_8tORS-q3&g!?g z0uEOx)^B!NIkvaZ!w^G%lN;ssbG;?ehP9{R80hxNIM2e9HH8XJ#|}WH?{IzjNiHwr zqwF2A?E0ki0dLEt>Z9JAKe=XVY6#>(mOf$#1eK;9X7nqTf@~ z^JB1WIf58YPadRDW zaL_vKZJvU@-IT{HIXyROYZ!>HexSn!L%73+Fnp9*=S_(*rxQF> T#x!RM8#a#Gm zFNyi@L7yY%njQwRWsKW_8Mgz+3Xg(dBCZ6C1GKZRG__W#WJ*n!Tp~p>M(W9>^_QAX zUPC&C+Fj{hi`h)dM_19*B3iaN9MPh`CB|K1PVm)(DxIocamEVX#6a4WO55E;mNmqb@~EKk4oSmEmr+462z#OF2!L(#kt54iQlAee(f zNQehL23s^)4(G=`_Pj6D%zEvil*?uF`Aet*gTUu8TO#R-xUDZ+_gB;Mx5WRslFyT~ z^s;N_yDgoyUwApZi5)lLE3tzwvAcoGuS6Sj?y#j_;Ss;gqrth0w`NMa-mv9st8sIk(`M@U`StZXO?3uh3j-}2>OG1V z|A9M%`Du}t6}9A}FzQxX_JqxgX5E?e$(`eqUqD?65v$+uk~{P%JK-XtgfDuNSoDt~}Ie9J+FD?#jcB#^Eawci3zSHRcPs z&5f|Zc6d&|w79UWQoldH{WY_5uUgDz7hXL#_nPfF{*KbVtCzN4v%jxz|25l}uHFZt zD$_{=Tq<%Co%3tik~PcPo#G7}>@M^uKE@P`6?ToV!m|>ZY2~dB@iqr;;IE1;c=43z zaw2buZbL*5Cn{NKX&GB8oqvQBqj(^apWE!nOqQ)@xPlI^cG^yGc>W78r9TdTm1^C$6@+`33`zK8qhDz4Red!o7T?}J&HF?;${hT zMo5_;R_$864|)zOb~Rags%JY9rO&@=?z^*T_(D}nw;nz9dB-oN4QdoFiZ_SwuvkHqvalgVE5UfG1 z(r&#*$c?7cqgl5*i(hjBI^nNuDi-Ifet&hoh>vFmeQQLo<39!Z!veIupTpaK<7!hX zHqO$i4kl*_*o}|273I;3Hx3EO%YE_uhK?Ckya{cTZRHTL(q)5~3$_)UqqUNB{z(`v zQF81yrhbGR#0PRKrbI?-a#pX3eb9)h4hw{4)rH(K?NH{9%#b$9BQ?4_epBL@?P%)! zRBZ1VhmP=b{m-fb0oAkpJHtOz1_H`Q|KU3isRIG^zbOKbJryR(7&yrYuuR*rfWvy{kd)f!CQsHlgVe zA~WE*L!daN4Mu&nj4!+C%)zA_k2Pz1UOQgi95oe=7q(t^tbgit??1Hl4Lb_CsqM*J zO%)zb;{BQW#OT&cB3yQ$8*S!5B)q+G#2r*>ReU1jA3QKVan?+H{DRxIZGYoZ#%c`- z&f>o7_Z|Ac>!->)UpKeu{OM>W9?MyxwZ!oGnRMRku~Hg82sD12(0G9BCK!krkfWP) zj{=z?_98^=Cf)xB2=?vY55ef(NiXp?0TsgBV{1-OST{#$TDx{yx3;cZw|3Kv(;O_p zj{G2YA15v~gb_iqRFi*+?)|D}bH|9y9pgD<1ADcw?`>?+FkYsKw_6C~IY?1cZQ>QI zpgzgJdX@aEYUs*Vbod_UJ(JG;X9r4wd*R={vz-Ud!SA7`d(rjRTyxFRC*i-PYnJ{D z{#&B+xjA$nnp6yt8jdhWZ3wm>A?t6xV&M{_!(%de>;{7!zdDRl{z^&^QWd|yf-5#E z{6+Q2gvpectkc(tcL;sk8jWpzg7ivjHPDAqKrswXK#tAJYD=9u3~K5%D^mNER(fIt z*&T{3O0c28Kg>^Et3zK6g)Atmjz!e%_u<+mxbK*v1qQIr?&~Shse8KGpnHvh60V|q z7{ve)sR{das}085FC8f4(xTd^)oC1N!Nd#6vM*W;nJkgMSRZ;}wz4-jpM)R3U#jN~5wH%r2GIV$YXy<*;viDyA}O_@4=O zSGiCxh;@Uuo(<;$rb@wLa0C*{LOPL6&x#3zv)FN<^CIvM*HlchnhJdhXPoqGGoH>$ z0jZGUbgKm%b&Y_FDa5*?>Z-21;g_xP2R>JB@v|TM*wC?KWyJj_t0M*4jVbC}lGLV) zxc0w9S1;o&7NvCnc!D{}Hf`kD3jVbP6usmkyF}o9!7m8~!}XL~NHxQQ6Dp;{Y__X3 zZb!V3FIpmIyZOn7`FqvYa5)m`i`r{Ro7EYJt1E?UUa2rWGE2r=8QM6nn1KF=AcCOd z%`H!TTjgWCt!IuZ@6GMJTfINhuu!rjS2H2*RfPln^M)Q#Jhb@9G|*0zD^ZQ;=a zBj_&*<#N)yeG@uv-8&Q-8=itij# zfAHIidZvA^8ntFw%|7&J0_4@exj_b79A2YN4+o(kY_6+XiDRoWMB-3khtbG-E0De3 zq#jBI4#dU5<4q&^L*2CvxbKgM@$`UK$i{r}NX2c{W^-FdhqmNW(I_s8u8sxJ7c)Lj z(q}DrBMEfSA8=*`N5a**+g(dGMk-~o;&3)XzD&T}$OuKU*EIBJ8v0{`_TmxfFHuSI zTcwf(2YjQI&uOE*6s^)p%$?PBxb+&avJ!(>?nm>*hz}*AzD!~B)=h?Rrhk(wSq)8W zj*jeV@E6(CFce2pz_33PHupPQ1A(&WJh;8Q)XHdR{TLeNo={u_?ZbIiE$AsSHwJ{# zz*F$-%O$y{>(*Oc{-mJicaFVrv*We*-Tzuga&l~x>X%{etMc#FB+!zlTU<^&arhR! zknlU-`c`Kn$M1}cj!h;Vuf6}i*E%-85q>|3-pAd~!}-I)yWYhg?4$jK>(J~**F{~?0`j$=Ay<;?c+DxV`}=kh zU$?r--Jkg>_tpF_-lh|)!R?&|g2eFWRpX*2f= zG|9i6(q(lQqsuA^@V8UCFsumJ7=IU~3&RrJ&(H|Lw#Zls`|1qyd*OSiy`SV>wr?BtA>m4Gik+7HOU^xU&mp!Y< z_Dr$^6?x;qy!@?^>{~;8GrH-S(6y;!sn3k0n5gT#`M5Rd3`EQ>oiSvw@Y=b0W5A>{oB2hhPH7I?%vP0FZL~+cj*`ch zPFVteuTf=C+4CVqB4;xv`v#_OFk5V--&W}NMT%>n-zlGj2GhodWiv8YF+~rPI1C5OG zM7e%}0li?e8~sHwUJ4lFV$qo%&1G9zcRr^J=+GtVKuAUA=b_ERz^gEcUJNBXm4^2U zl8zF`b7uh>|H`Ds#)eM3bS0wEuz9jNv%_B)ij=2Rs({U{R$83df#G5-Z$-bzmiKH+ zwQ@o&8S(@J%8^!U#Oo!wruU-Dfo5h#Gfb}pK3uJYD_!Y1p}c$=1>GAe(Q~{xmX8$n zv$~I{5jw|Kk_HQ8zgrtpXGMF&V={Zf_GId{7pdHRA#XVWF;+ELOExdo^Y2a=10@mf zI~mRTH6_9CNRQ=#ZqDMhm}Kqktj*(Of4VsFLER*GDEXW2t~GTbmeMjJArAYJ)Gu|HMsP6Xp(UZ+y9RgfT8Zo9*)jL)H-S=<-L_Z~ zvc5&3H95@Air`DAc&E+mwdgH6FWR$v=#$kN|F7P3#Ak9@9X6ZWVKr#YvAx-6^r4XM zhY9TW3Mh_t6B>HCSyJ;mS;A)o;6$Ji{2E%x;UJF3q`ZY+1in?vCv{Mt-w%3A+M+Z~ zbjC@Lq=>v*LuVU5A(rYK11&m4>itu1c?hvnIyz1=`%7{)9}31I;b1hZbXc6l1}`Lf)AO+0!9=%&d=C9bt>P7^)0ye_5R^V zv4j%=+IurGm++_#-l5mvp|BDQHHSZf^_~lTm^-PsiNr8Xj^;niB^tLnt+Z+r?{{fs z`4F6zk=k!1(-6HbrGsT+VZffxyvd;tl&cr%6&b(V<@dYX{`PyI9p6?5GHQIBEXS{Y z8F{&PlQ!hYm^8BIyGv9<;5NABl)RCgQA6YZ-e-pqJ4C1}j0MXwsu)43y3`t_UZuC2 z967H)gOnioKC_Wm@*1rI)jCZaR=0l{>q~~rPK#i3xE&TFuTtne@p|TAb%2w2d?E1I zL(cToGX6RU^-hwRdIynaC2-b3II5Ko7*?(H?!Jy=U+F4`EFEqVCGrecu{wB=fK)f@ zZSqm87alsCs(!RuzgYj8$~|LqM}hJ0%*+DMb?DVZ{eAh3ns8V<|30bx+~=VEzgeEi z(RuFY$fK}yN%vo7`isZ9p~_v&bu1{)EJL=04jK_sjjJy=k~sB>ya5b?X;U-EdJ zc@HYQzwGfj@ z7cbGQtcjgQV`3XyhnRnc$C83fdeZ&K=@~RpB3XD+iu$N)ytFkNp{BaV*W29*r#0jP zPc3M5C*5jKHR3IbE?ibzPYyg(tDUJwFW7C8vu3w@{XyAXyAEuo9_`1prE_y(bS3l) z`%Boj#y*k&|DtSk2=ZR89K1$JAEI)<%`+IjwC(e^I z?T+@D1n5P|ec3|;LM7rWf>B6T{Gpruf$s%*Hm2v0`)-jH-fpi3%>kvy;dZIw zw#G+_Ag}zpQU$BqDY#Xk+`W29R^tT457CfT}b*unG8 zuH}MVr_M8H{a;P_V5D3hwDl?X?sM7nE))8O-J8sOC861OAp0qgTcd+#+OcoW{}B9% zX?UiJ=^QL=hSC+7X`Uf}jr%-Tb&e4E&(Tt2WTlZ-L2K5&UA&>oGt>36_zd+AwM;}0Y`R{|YR2e5D^eO#h$i!d&Az{!5zn50Mw!xi9{OCQP5j z8{kh)vHK#e?J*DYx4twDZ>9c+NcKa{Lytgnh zQ+#J(ZnX3!{!7~Sv;Xoh$fpj6RS!M@f7K5@0Ij4l@?o?G+UX}6&%(SPp0)9GXS7of z(bRKByWP6}oOX1&bK3XZpJ}!7*Y)k#ox3YKGLpJ1ySyKp2+f||*gRZ(1#a^468zPi zcQrnzeHD30dxK=YA;7GIiXE-(ks}hs%6lwNQ7wSa?!||&qm2$>rwrYbJ~J?x^`%rE zv%zoCIQ+)TQx6O*%{B>ppWi&~by-bXlh&N@p%iBIUq6P4h&UV2Fa>SG`D;u!Outi~ zvW}1DcFh(;f z8n;Kw!C*P&aK!Ly)K2^(?mYB8J_WjRiL9OOuC39nt*z+*6BwAFwI3wiMq1h;P9M(B zH#>)+u&PkWPD!WV$wk~rd3RwdR3zB#aEGoh`(x{io!xFrup7Ga zqmjDH#qO7g#}m@+ob^bg?xgc&mDO9(--5kXletlOSNtlbNwupOVcp{4&XVd4&ZYCq zbHRAWf~r+I1vCq&hRAQ0&ACm&H}rJENmf*c%MK=1STSxgr6B2quvC)_nzE>n7nBQi zY4IAUst}SgE6J1#x%&Dm%|v0K-dC(nWo+K^bUu@s>3#lR!9ss;N?-Unm26w!~ZI zkYfLS&DLR?#h-2}`Ip$d64_JX4z5n@#>Uki-FuSN*`5k{_yzSQ^Ceu*Nwp$;Vw4e> z?@aesz^hhLV!cYsyE_%fCCT}87+Ms?Vgp3Qnh-INU*V7gOpF4%ZSYUpqP^Pp5zAuz$jRp0N3asc9 z6EiE7vdgJPEG5YrKG752-~tgj1xc#gu^+2;x&mbHe{40H=#BcA-R4nf56&LF%05&_ zs6MF6jqj|??bfLRR(sH3(OFf~2h9KcG(u1RlX>5?(Y~DV*=&QGuDi6Vv+K2HZDsiI zM0{@0ZV#kt{E2fa0O{?z>hW_F^bF{rR9$ zm-2*kIUzC<2#qmFpdmNs!p6xB**tP8+*pnszV2OSFGqyikXxKwJ+gQaV+!C zuHFOwE8c^1V$BS%3EPk~+3*o}1*eKUq${|ffLo!?w2@R^VaKaR(!!`WElj3mNLiIx z(VI7GG)EOJh&`UtMZ&?!NVcw31id!V<}y1pcBATwtMw|A-RlTWM6wO7l6)nAzh=~^ zl*U(~TecmIhCN|0`(}rr{eP7`36vB?mKl*(p+-MDVI3FV-=KnD2zJm$tdeCIwC&Z9d-A4u%kF59y?E;JBZ?f&Z;ZC8Bs@f z->8f(?C{*_to;!gb~$=jl;CXrA{F6--bkeGn*p&=WMxYe4U#s~DX$eVjGQhYIccKXUfup@}kQuv3^ zVpO{rp}XOq#bIe3uD{Fav8F=N!h)`-xi-ILR(@iBI(*s|s5Vu#)%Vp8PntVzZr9w4 z2*v9GH|G>TN4@wVB5&a?b>HJ6_Gl{b6+cC%VtO;e2SX!kY5XBp2Ak1S<9+9*6+h=g zP^XHXLffcUh8dhxTm<~l4D=qm+Xa}K?c>0x3Z@b0dnxQp&P(f?jb36f zLjWT%nAHr%Mq!4~uNVyUllL>2J1ER7F2m}1oxuzPjGMu1Wc9cy%q;XSgXskrg~8lF zVTQ^upE8)a0OMjX8(2Lq3NwsOFqm$DNidjQtUn@yIm=)s157=GxsJlj;RFWrYX-9b zU~CL#4uzS^wKAAv1O{eP=4PV{xDRM5^J*cS8X!inA! z@E_$q`l##lX`>#LLl@wUD!Lv_e+H0NMjxPDR~LoLa+}eA;s)ZMirRBCTTRiTQY&~8 zvnhWhd*n#=`RB=BH1qk)kt3PskC4BF&Xl=+=dwl{P`Ms5a8j5UKj; z7tsg(X*rrqM&&fRJtap|si>TKn09SE`*X;Xx#RF&Z{jri1@{nVhQC+Q_vqw?(fcrN zX4te!w*Q9hsmYK+nJlS}lz1ar64h@)d!uOPYlXATXA7k4Bq;k~xvZI$C7z1SOdr#v z=8%Ry)NhKSCHmu0v>Hmj_G*FnREG*K;8v>PB#nxKM>i4+5rh5vfi-%M9bTSXAZBS@BHW2r$K*Aeg`3Ry3k7fkr=uQYCWho96bC?;q8_aO_$b3 zVyn3-UY{yN>WlO>4f`rw)*d!7#mE{;V?k?*UqSu~#sLE94d?@kbzNQP>aI86?0Wrm zIuDDvljvo1mNQrOsT$H+4dKIJLnUaH7tuYp{xG+H%Knq@y%#@s&cOSL(9flCm=LOg zXeROWsCAZC0Pi-WcGX&&c6PhtF=PyW1!_0cl@%jcb>A?m(a+3N25G03TMivty>cwWICq zOyjy#X`sSyGW#yKfn~;!6QYa;NFtwRs@`BRLK{s+6(NL{;49p+g$SDzJmi^Cko=CI z)$H?U#C#LNJbEx-4S0Q$)0EpM%*&%Y(bG;B*3T&sQw`rPxH?;0nQ0ql>)S20!HC=@ z6>A&a66I%A?g9J-x(MBm0dJXSM; zkq|>XljT=?2UIULN)USyp5IdFYY8^Q<6fWIkkxN<*PB*4 zTN{0i%Udho+p(4qens7P&;k z^s20uU6&B?d6O};mAJ8L6&`e`)L|i2G@DY6xB#0q zU@rJ9L9Z=fv4jLyAy;Uds()+-jELl=M_>7s*S6$^RBP06+0J(a+Y*PoDr6Q<^-&Bm?$`)^%( z@5WB4Wgw?5>W*ptZz3Y4(~Hj*`_KzK;(Dl0kS=(`c8c!-Dib3+fk>GQjYiFzfD0v~ znd&&ImI#rjM6uZjIa_8s#6hRm>I`69Q&YoZl#9tzlj#ECJd*K1$mR57Wc<<;iw?xq z4r@(B^2B}ntwLRBo>m*lU*4?^P6%0tw<-03s3=HrzdJ~Nk=w~HxsYXeTYbGqesTGj z-aPPEY2FDVUef7h`x&3$Vb=~Loc{OxgNq;Bb%1yNaUc4d4*gmD2Y?b_asxm&VJKOq z-YsMrEmfv;?3gKgy#utgBNH5uzC3#N#lz_B5&hSbno&_l_GA*@K&_WJ-h!Wm{dXI8 zsYt^$u8+*>*c&thF@=dFy-dXCjYEmpDT*hJtJ5G|Glcau6wrxXUJDU|Sqwo>x@3j! zSJb?i@2CiU45?UN<1K>zYJ6fQaLtO9n*$A<3H>#pCwfrnZVtCC+}ho}Wno)*LU;Tj z`Pi}k@a$!4+cxanv7zm%WwXQm$9C}2)Zr`h1DggCiGhs+`4z)cC4L8;3xDw@EK|GA zma!hUjAIuuZDyc9&KMl7%~Jn!Af zs1I$O@a!J_i2m#z>U;7g{0X$z2OH{Fs(56;Ih7nkr_AXYojeQ<~U_n#+&fW*tqq+ z#mS`$*S)l2?v#XJ(0~()=kYiAJ~$`aDqd;FNG>bf?@@SXnHoeps4qLh7dV&%lL$OA zXAEydMxXPSo|rOH;{H@y4{BFShJZ2>@`p`)X4{mhJF@L<`xnjJyGqkm?VUMe@2bv` zS8LEqW?Obk@06`s-c+;4Tx)9X=*f2vb}ZX9FtBS`2YFg+0_LCB*_zrqawfa^IWxuK zVDVeL7f&Vk_lzDu)U2Cl%Z>CKm7)DiSxI)JlD;k{8^I2YDWpnUio`U3S2dM-*x z3Lr_k=z$VzxJImD;&F&eSyZw+0j+It6!b_X8a_T~Adm1B7d_M6e+VNR-oM_`U)2e3mO*kz-%3cVQ|BYJ&ra8^0cg0EaC_77326F zGL`)fDIVC^){Gp&SByMC{Q(t^;}7t@YWWK*;~;#EsTQLh`XRIittpT{`XLgJle-N) zhU=)!W4^M_Ry_W`NYoFQ6RQb8svABCN~U6?ovNv$Y-qJA{`#ZLU?CPO3}#BtSZ5{} z%yh=;HK0bbTD_9XDfPMBZL#+04Gq)VW2I+?{8$YRU@>IANxgDOuOZcmskJfExJd z$dk?Zrz3MLc;?9Sc*n>Ju2KiT5h(L0tPaC}p5eU2$CiXaOc9MHAJctB2{R_HrD!m5 zI6t9!A2g#76LUCH@zDi^l})+S{Fc5%uausb)7$Za=8-wr6`3d}q*f6R@74c!>(XZy zHuU{q+Pc@*8vVhKc3(TmTewD}@6iLD8{`!rfCO#~dqk*`N)HNN4G%7Rps&>8Wd|1U zu3zZ8-e4^}jpjT->x=_!@jmfyNp-nK`4Ss*?P_Q=ut+**3{5I#7aZlQjMu0KSHMZ3 zV)!R|kgdiUX^LmnI&Z+{x7USI?xcVA^lZD3%*T=v{xXnAWFqn5=5W4Qb<_qsW66HS z74hg>7OY6518T%=!wZb{a18L|WxDQTWedQg)ZdD+b7Phw^m~|`Nn{63+<*W5_d1Us zcOJ)^^$+#;P*%Sg?MBz@w^4iRr@80w$FTQ}USWn$wL&Ea&y$NoYR)1oEQgylHqD8p1z@Ja0Mg2T)dH^}WIJu7JEc z)@~^;g?rFe{5Isdx#KJ^i-*v93@i-}erFr4crsdve*<|!Id3HnqgMPG5JCvo%m8fJef5Z`8vhFwzG-w3m~d~2pY9Z!e)V%{by+R+H$+&m38?eP&Odn=;f#T zJwBIHa!n1FTTfhYwTu9WdW_@N371 z-??+A?}qpd`2E4b&|lH`0L5jvhx-ZOW{hj5ej5XnAmNxsM=i-QF660W9^!Y?UDEL^ zi9h{`D#zkPP1*3qJWb35gos;+#1ZOjAYWv+5GG%654^TdNt+zz{3KBj1W4Mf?L?+o zTmp2*-}4Jte`pM^OZpRFyX0Tqp8=^sEcK_QQEDuAt`)x{2p*4|Fxjomz`8*)ZmKo6 z5FdiY-FO*yGptF&_atKHJFoban~_=n7XNs%ftQT1tz4J-05Y!2-em63`fo7x+>(RoKDN| z!HbfzoJh!Wl9l_2>*rVf8Rb4oMo76xlG>!K!9(03*#C?>q*BR}Uj{=2;T>iBlBi0r z6B7wBs3;%9CkSag6cdB7SWt|Wo|NV&F2ZNIf8;O!lkHSrT;;3M+gLllEVXmC-l)I6 z^fcNzfWzD-*pms*Bhr;rSHWCjUjwVq^Brn(;iw!TA0aJ!y>eP$Pu#DHVmd8~YJ)>c zhs3nxgl8}aPov$3@hNUKe-}_tM!N!gKXM5#LA$my21Z=UR8;!mO@uw3aKc-9hQg8r zAAG7Vm)GvH)EB11kM{Wu0Fb}89N70={Fe9s@<(hYfhbJ zlbue#)pcd$U&|@{x+M5K){yr)_r7up+PD+{l6#Kd`4_j*ZI|nu0h?o$bP7@~zpZYS z#Lp4EURQ0vvDSNCIR*H89h_Tt!dYMPA8znBK1+h!gWkD*=K9d~?fBpByHD7(iS4f+ zl=s&$@OP}6xh}YUJ3nW~4*$Z16#l7V4cAjV!OlgVor}bG!{}%X^GBbHzZvgXq-(C2 z;I4tX{B*{BY{m)2>^Q?hJye{0l_Isk{_jb5Ow|1KHcOr8lp~3xBiUtcNG2wj`4~na zzbKk$Jfq^nQ2$kM?)qt;2`@|gOb+inRnw^`qptQuQi5EcNXz!H%i)gK$nysN=pqbV)^GLr&d>kj)<%!Nvi|n# zK2E&#*%$cq$FCzjzGaE8|4Wa5WPSC`mwNnTYxvDC^!PLD(Kkyy{)zR+Z~jS-e`>Y9 z{Z@}ZxBl&0TaSNcJ-d5LkH4@^?mpM!FRdqc-|F$5zxkKD|ER}bS!XYvc9L|L1Qt7ZaJwY=cQRS!X^r$Shchah6Qv zavgfv<2Ho7w7ajImudws!1GhR0MACRoHsJdgCrJe`Pdb;iI=OS@RN8$9?u^p znMm*?6MnLei!6|N`*Jb8%!}WP*I4z>D=&&Zxs`P{CC2=8!UL?gmW&ge7{t|y~bne`~b9=gic-F{G7RA=f_`ERiWt>C6 zI-X+-Np$-IF-m2u77x^dR*eOZD|vc5N%E64fSj2OlWmI>VROPf5#GiNLT?sI1&=3s z_7B1k1?q@+-Z#0~WLBHb+U8in?I2BKR zC3cn8cYINlIuu97VXl(DiT1o~z&lwK9=bfU@>l>LYv8gwN$ zlYdwTnPmQfK$Rmf=fR;SW7N{XJb~79n3twNA8Q%E#9y-%W+WY-6SPICd%}q)$m#|# zFS<^zKkQHYqoI4}_DLgooj{ER_(O+~q+D{8EP@a!l!hu7iz>69!4)#QpFcRJK4Iu% zX9nFV1Cs}H1eU)dL;}Td#SI*&ayB2>0u=)ISZ6Zj3~e>XAX{^CSQzS75LC+Vc`AKP zY<0Zw7KP5verZZhDW6V&HA?;n4}#bWO`hAwh*Ajh1?2=l)vN``0BI6Srcy5IB)%L& zb?Ui^!Xu~dg-?X+L-M>i2Un4_@HCVKKD3Ah`Fe(QRIF)2oSvGrL611sB&Z>nX5uci zNu}B*)9!)Lq67Vv7cWUDh#Yx}a+s!sX{gwQgLD_M+zJ_Qf-H#%XJxLvE>=l)Xk;EN zV+uD(2T2+szLy!d97xd8U&VnBwYFJ6zAUSB3MmO22V>$Ab?vf-R;<9-nVk1s7cn7z zDLSKJ*TlzIW>JuHeFIe?TEapo5Eqn~IEPaiL3UosmeE_Ep3Dk_G$%Y}m;tkKJa1Z4 zFF+Z1*W#7P!jc7Y4%9h$*Gz<}q#)0R&6K^4%a7bW%arkyqA|kEkH6y%HilqzZN)F$oS;r4(Jmrk*&Eppo!YnXjck&icrLy13~)Hy0XF zN<{_soO-CJ2oU+9Fv)MVj=cC3$$idU-U4HdPlK?+6FET9G_f|3Z3YI!6Jj0&_F zfehz4n@RiV018v!i3Uw2_C`HVa%uKxosskd9;8Q_v$haLeUh!A5>^ zn6_2@fI_*DA5!2K6dczD+M~1)hC2R?F6iG;<5Qw7tk_Sfy2@Y${IBzLOkE7BDMg3o zKY)xF5>kgM2Emb1?-18A2bry^=(7i0&tt8)w)a>~RE1cm6jxi@#0Cu>B3bto+?%Lw zF-j=ZWjs$ZAV=XgM*~s>Tv>Mqz+>qLU#1+^p8q~hw&4F#YMgW?#JX#ARy1xXovBb! zJ;fCcVsxG>boNqCnV2A~N>i<46$y*iIb%@|T=)Xb6P$P0XQ*_@n>2{^jr+aX|9Ve$ zSaPORa)vh5nZ0}8Od@%b{52RsR&A01-TtCpqD}fSsk&@y5%{Xh>${zS-9L9GkbdT< zE1Ns&P2buRNAz7Wo{Zk~yG~b}*e*Vww8Y!~^lWr76<9H`htqesJqUaFPJG`Vc3Z;v z4Q^ttD@GI1KOYbJ4(9s9&fuckAHEi^ux~h`OW}Ec3Zc^xZ`Gpuj!VLzOy>+A?N|Ll zfBLQ^dj08;WcDD`7Grxd?RPE)_C$;?CgTzAmiDjWCFL6TGdSy8n)n!x?)c(^w32NVn zcV2h4*xUPtSL9fez;e;hW{myfk`*sue*y%2p4|X-K#ISV^KI)p>nWZ_kp3P!Y0Uz& zA@bu zN_BdS*@wJeu%#=uL9paCo)&Bot!{skHa#B4Y}0Ek>pyXdhkX&BMJz0^>jm_9Xl?mV zoAFR*wOMY2X9dnoG4nqk8^XH(5qdnZTG+8=R98phN5JZYu@lyiEhSyo)&Pu}W!QVdS#L1rQ|*D*Gtn$ljRIAPv@hraHyw=)#%-evg+H2uPw> z{uS?)Kr4gKi4{8?*P zY*5iqFpDUD1H`YYCWU4ZaUcZih);8#qrW$rmnr8Sb&}GB_#0{_n#d1$y})y$Rm%12 z_n7sWbFG>dYdlq1qo~T#zuRJw0UJUrHpbdt5TN$HCPqd+(*G~bt5aLc*C=O{Jyk^YovcRKnBk(Kt; zypaQaSO?hpBvEu)V9 z8sngxiLi3colLN2m$Fm&CF720UDgMKa>(d-I*TUkOY>Q2x~s7}W{U;q%1~$3UAZ!1 zJwrw@=Sn!;W1QkZz!fdjc9;`mmNeIW*`~pE<88Iy=hX(CnXWWpi3n*j<4^N)?kX&r z)v>azp7)h@`9bw-GI*}B@E9etD?8{pV$I_G2)65z53?H~avbN11;_R)99PUqm4UJv zvPKhyZ^k~A%!$LwZfvag6sGqx*`vwyy1pd)51czP_L|9m3+;=;h{$yJq#|^`$2i^% zP;aHMHkNsu7eme6q`|)gd)GBxsvK#o&r8-8M{rMS9Z$gH;~uE;MHf}6hnhRY&lEo+ zuDtZ*#9*!~7Ugimk)V;o>v==!Xsr6|%EFe;3W1K}W=~d+jHa)vI#~JU@X^3J>eHo*&f0o7sAG^@()vWAyX5vQ#-BVaCmMR2BM3tIP%D z*O~5)3bxklJ>?#{*=?9zRbP|ndx%UvdBHYqYkEpNY%EyL75`Not-G`kmDw*PBsxIacl3O~yesI!A?Y`TjQId)qHL zQfS;gs2^k2DB@_V?r$oqDy^mV;Znc*Dawwi>ch=#MD@-~eLHXB-L#$FWfZzfR~=rJ z!}ghZx%Jga>+-#T>4A5;XHha$FDz>sR()WzPu^YG5!P=hs-F$7?6TL)*8Qi|yNCQE ztyS5=+~@Xrve4N$;qFu+s~9%dH?4##?~9T(kGWP4xf`kXXxGPRtU2DyIDyUpfj(39 zzH1#L$MR6C%w~rfNS$z9-p;iLn|Hb99YpCx{#w*x<_TN>>F3_ucl-Js-b?;GcaYXK zw-Cv<_f;eMOioe}TECU5cMY3MI}X)B2fF8~Zu7^xzpB^IwZ!_(t=Z4bS=Ty8O;=Rt zb57ZJidiZ{f6%vudgr&|j*fPm>dt*$dzZJ;Gp1_PYi)%=su4}ucJl@&(nzWba!h)} z^WjY&K}7PqUBR!Wv%r$dv4Ng*Y6(+p`5M!z<0WUd+VZBuM7S5D7~T@HtXL$F6#Ze zy2qzwwpG5ku1js+Wt0pR|IL0nF5ktZ+75Z78&`~sYAiA6#O1daiXCbB-XXrE=P=%` z-$kD>vgUps?;+mw?@jNCNu%P_ySU?Wui}k*gQse8^F2lN-lYC+G2%6{?EmI`Zm#>9 zOn39@4M@R0lC@lW9phV?ca-tcTD7J;@t*bD>ioZKu>7zmRPz2boa@>6a-_3HRjI$H z__PSBxbwWhovXW?!;VR5cC4Ff-T02AB(FKb3@8bJ3xtRP#I?q~d6TJy^i%8{hgT0Qb!mI)^*I^ z{5g6Z?I1fY*ruWN8gsAoc|+_n-xQv+E=toW=BrbiTJ`xvqnSdc0~^#+8?yT>kMwUb zQZycxdiJ!YHe*DRr~EzT1!Fzo*$ez0W1afm(q@~LwnMg|hv&)`hc!^1P#SgkyU=&M z;x+V|vKC|Jpjz2t3n%>VUuZv_`aRDo%|_bG6YgV-l(xoF=|T9vDNlCU{sDhWWEgU& zhhR?+_|yq|!O_^;`a8`!Itu%WfuvuTzyGw^Zuh9ZMq1Mc$2ee4c+FNgjK_diyZnZt z!;%K&e%d+V`Dsn2Vz=`ApoU>bzrAp*A8@LpnPW3TO)FF!kp7hw3TIpY-6^w2-N!@i z!%peZ5p(GfmA4#m4zIG=A8v_4kE8TlYkpDVk@4e&X5pyRtckCQ7PIaq8A8c2XE#0A z!2uY6X_$@~n2A}KjX9W$d6lXx6ABFurTK!g^~Koq}W3q2f!r{UlUR^lmoSw$ayW;JW@Jf6X`c#ebd zD~GU_LphAY@gYZWB)T|?qwx}6z>ByEF^=I_oQaz`j^jCj+u&nPP!8x3Z6zAbGr13k!`6Sk(2QKT7;R5;@z%L9k zgdDQifL_+KfsJ^LO>AZhx5Y=?j@x4+ci@ib!zLVzLvaXq;?B4nx3HCMT!<67i0$}< zi@Aima4C1i;W!LO;7IPq4(`rn_!{?cIX>ea_!8f8Pp;rfRALy0V+2NG6h>nV#$p`C za}_(e7x(5q+?T7lANS`0JdkU65N(DTVU!NL7-Ki%T+4M#Fv%3t?BRO4%%B#7F#+4) zdJM#s%wh_zU=ChX;11l0+p!ss;88q)2XQT~!w_!3t+_r2JdVd>DAr&ne2!`yg@@@pPWSGkF%z<~cl<=kX6bpBL~#Uc`%e2`}Xzc^NO~6}*yH@oN5w*YMB0me=um z{)IR2M&87mc?)mlZM>bEc?a+0UA&w3@Lt}>`}qJLzQwos4&UW_e4iiiLmZ9!;lZ&uk00R} ze#}q!DemKE{G4C#OMb<#F$j<0NBn@F_zl11cl@6J;6G7=@9;hD;=eEn6EPX*;9Q)I zR-6tS*WfB#gtPbq&d0^Lnm_UB$+2D9u)3J2QS!XSZ*wVTvzh-BxcBOgRHP_o7O=s;$#7Sj6?V9gh(r?P8 z;{HG|=vk`So~4?i?V(1i!;a*#j@6-j4(!Npw3cbpG95+{>l>sDwAa^rmTO1V%e!-_ znC<402|JgyR_Hw|O7=7~S}T>+sO?Gy1I^Z|5>{i-m|H!a+H*yx8&AcmJ4^k0I!z~5 zE05mQ{RP^lWwvgaZHQ6bGDnAUOs|~&eU9l>Z0lZyJaN;jxTaLZ>#}a4V@*~$kgEjA5mv9hIo3mJ2pCujPW zQ+>;o^(|-G(Wm>?S1fiw*P3|#pUD5S-af}o*JToRrrV=nqRYzfk|NtHwL#f#*O9uX zE1h$djBilunfOMzp2@d9C4m!?#-DOtsg!Iw(=|xCS3m}kz^g+@SgC?& zB*Q4445WBEl!7{#BC2qTsAA-SM~0A6MvxR8KvI-{1*Ch)k=`XoJC{iNmL%mm4{Dr^ zk%XO$rh8L$5xZx|`ka%=#?z^SLCwS8y2#rVkL6q^D!Z9C1@j}UjpgErOny3vgwvIk z1-KES&AfY_okk1N5!kobY=TBualAyHB1&@ZFky@_oY)=I}x^B zwX4T=om3%0jnazV2Z!^ga-CC5V2II+glcJUio2CoTvXKt0!>;5{g$oFdg_^6Pex5$ z0XY*1%+w{+Q`bn2Me*cZ6i*LEK|L8oRHKooroSqw4lXH6>Qz1YEYnfFKax%+?E=g{ zZ<=8`sjz9K#>pZs6cR2J5-t=H?k^-A^^m6-xEGYL#)66(w}l9?%<%uMlgW(w-e6j5a+QAuV}EzL~oh0N4`otfIN zGE3!>uF6aSnVAG8GYNHO8p+HQPiCfgIx_`zW{RjXlc*#!sg`CY^+IN9zs^iTOP>KN ztVKi%eMT&Os;n+8Vp`}^V8yjqtHnAk5?Um+(C5g~XWZ)1V!amnj9VEk^!c=MT5Qmw zR||dgtxa0=ne!NPZS!(#YAt>A=?_X z?r${Lgpq+zrMym)cGih%ON-ygMvv{f>E4{VU|P%tW9kgFG*_y1c@GPXtU5WhLt869Y%f=JYt?2dD`dgyh+UQf?R^`T~A;oWr@`dKX(YWI} znRuq$-dZKUPs(j=!%Dwa%GVb9R3pla`n2R_labB;1BBMxn*aa+00061{{R920RR91 z2mk;81ON^I0%>GrZ*p&KZU6#AMod%y4s2m`ZU7Dd1^@s6000310ssgA3;+TDTL1w7 z0001Z+MSkpY!y`)#m|}7R$Ay{L6o*gWhpz9vJ?>!q?D~-!GciM*9BUAwAfdm6a<9E z1*;$eB349#gg+1o@P{#m5MziT{y|JcQN$&PfJh5S0Y&i4*AYo5FO7M5zdQHNH}~E- z-}z<+1Q3ODVV}dv$jr(?Ou%1Wf&mEAIBwoVteS8|#G)12;31@-J5tdfgYXzKFdD7l z8}F=&Yg&=$$) zgl_1Kes~x|FdU;W4&(j)Ksk>ZPZ&=b&l~IW{lP-saOs2@ql|IJ)&(V{^PD7Odt(=4 zFJr$sW&V6;kTJtJ-Z;gW7bu?VcLK&TV})^<7DG>W1g`nxL|(JS7NL%t~6E~HD#zv)(Oq@Ep3Kcb!mp%`~pw$zg&RZoPWs`PA3!E6Ljj-{wVHP)jB+p!D#@kxUZ zoC6IR_YLrTQSG&>y>^$^9`f2Bl~Z@0Cs0SHVT@5;JJf4)y>_Duf)|lhlge1Pmm-sSQ^A%R}RldeGT+7$Fj&E>1H*h20Ou{9mBWy4#)Am^7Vsq_Y;0bE$VOq7jX%H;4av zq3FiWT*IIE3)k^CZr~=BG-cg!PAmE(e!(gHiqklQv-l0?@cUh&58q`cjm7v>D^-39j*4CJwb)0qR^!n-^lqBkjqS3LF{ypK_j<{7|2dA%Ol7^BDs70~ zy16LALRHv0Y{hQX)*&3xZjb98&uh2ua}6To&SGVFn(n$*y$U&T45v$hI`tOIm18+W zYFtpSQVz}HOeu3wy(Mz%IL?wvm(*J-=Z;rpol%Y=)Wv%qS%35(43jf)LXz& zrjJQ2l@!D5Tt_|U+%yc-IZC?~-t*tbJ))!47i!=Gekgx5L{!=PjXG1-5UV}zb7S>2 zm9CNX*r2a3y(JjV1SYvV(eI=b0j|jbQP#Iz*y!#3TB+vtiCX^qCOW1l_bxl=I9h9T z(s*aB)XY|DV{;_hm7TO=IC`5Bsis69DbWULOk^Skm>%iuBs~V29)n%oq+W_eR3C-xt*pYT(7+T~mebXC=v{!h3F_uc>!0s@8*P)R^h z5KyGZl=22aM0_J+2WM%=am_0D7Ia!iu`|;F>&$d0)q)aGTZnX~i&vc~goqUab!c)E zXI9BgRLnj1&eG@b{IR2ck?dKTb;KdZ(H8Mywlyr zcU$UP?)#4KuYHgCp7DLpx5oEF-z&cLzMuKZeLwf@@a^=y>#OwD_)c^m(S1z!rQM&n z=!+iXd(7?ee2-Uq9PDwr=klKGdv5I+?)fKwfq#tuI{$XHEOK30jmb|&Ci$(6E$eDF>8nZ+QEsj7>OGUG8;>^S*A!L~o*ys+S-~KSqCEqw8rSa%`eo>EChR3p7lC zh6&J6@e||i}#Fa zfa$oN0hoh#a{==JHv#4Y765JrECk#FSOoZ6)b#@3MF6O4yaf0G;O_u`5BLYv`9qxl z5wH&MGT=vmR{;M6_-DNT7o2|#_*cMsz)t`h#4+QifLC$-8uI)M=Z%0(z+drduA@jh zp6#6Ly_wWKp9{pUFfEBo333wFn z815ejJOOwT@D$)_z%zhVfYreLS-^A1`!|5^0ltst&jU6BHUVA-Y(amv0^S6?1$dkK z8og<#(Fbrb^*8#G&nUpTAI_Iki7^6D1{epJ0Jt77iAEaJX{<4W#)76w&KC?`E!83ohu6(rqZ+26+#&ZjT^$Z#=EV(^}Le zHK2(%3A~9yr$wRD!p7^O%GfMo#un(5t>BV3!C`NUqu`Q3C^48dA(upM$v>sgG=tE> zU~T25qNNZO(g|qM;izvW6(ZLx)N8W-Q#K@-GoUfBwCxF_2Wegel&>B-zS^oieDlLh`;TZb{mVQ%$Hwnn3q;VT) zJQ01Jq;FqLv7BMlawq2$om!R;ly=kZ&9GhI%eFS`Db$jCUioHxvhT zkHhcl1v(AF)nL&4Qk4D}*nT3aFv8UsVM}=cuMbQ(_#L;Bs_QLc$|g3F~W;av>c<^)Dl=KK=p?=Vh9kfW~0 zy_S!bbAJdUB+sV4Kg`E4a1M))#c|*rmE%FZanE`13}-x-qh)p}?)x;}0kj+?zgW*t z<2<`Aq(ZTVuhktebPD=`YZT`~zANAy0r)@xzU~^_4@nNEplAW*Dsf*SF^8`W` zTo`M-b5t1ULb|Wv;}JkY@{U*rO)H=5(eEFU*kE*OMWv`fdIu7{2YvJ7*={aZj=X+I zf{8p0ve%+c@!dJceXYb=wxw}@K}$fTe!qfwr5bWsixJoke5=I)NT(dJT_{%wX+H#6 ztz_IkW!%H6jxM5p1F*K-+#udb$}ry50_Q_~eH0LKN}2q&S>IcD64BDq)jH=CphfA# zta+MQf0857@*F!)`n@&fzD;pYmfY3_Wt&biJ^|KwO*u8l1^NS@?t|=AIQp8zM^dYJ zc%@j|Tep^1I@PgA4i}krJ?9kb<4K-PY6tkyXH%y|U)x_-d2P_eF?|jz-Rx~0)>e5b z-I46){tHVkAgK{$k8qVnH+Tt_tv@eJ-nj5Q^mgzyU6hwzLA~mM-4CX>@)oSl_4)jb zinRTy32Kp zoUJO{MTlob^YnVN64ebG7Tq zUX8oNI?VS+&Xxa#mSY^n2#FoqDkY?C0j(oU*?rn8D6oB-47Hr6*>=WQQ%w%NbV1YUR%nzWbyuVgiTVQ4Jd^1w5; zqfI-K^KL!6XiS|kx##1K#74B#$Ig9UG~e3(jKe=}Otl2ocg(9iKlB%I&|Pai(EUid zY_zZKo$|4B>qUseVw+emUe5ZyM(l(qoEp0EHCf_$$o4O~gv0?ybBFEqF}^>= z=Qg)r#;d{&E+5FGOzV{e=S^oMX&8~K@9Z5nX3c)Zc~x+72A#kxL9UjTC*@Nd5HE@~ zl8eMcVx^1`qYtf0a_zoID=XIV`3>huoXfc9XrDxs)j$uT3H-QOSTkKcq7%1!V!zx~oy$>mE2eQ!R z2vXFwVjJgU1&xOm2=U77S&Re5_48~|I(v`C+1Bn_OS5}jd={M2qV{ay{J-GnmelzV zc=Nc&FDvk9k`Axkh+0n+!qTG=q6K)vTH#FnWpN^RObArRoS)a8B1x>BIB_%ur(Ej{ zAr<>{`_M^$xsy@BfbEYk%>!;fK1pd{y&s$}R|D+zv;vO>?d$Zhndcnww7$og!w)CD z=G^{NM`vuz&D&A$k8Ejz{8ow8u(ca-{h0WUI01QT$nO7(eOj_**&n3j*dSg({cCWp zRI7?Cmtoen3GorzJhMGdBa5}S+;bectI88&s?l68`Q?wiYfQcIW1L#F#F*?ESayUV z*T}1Nab=lN*DfkXk1(3Nn@dK7tWM!BcOD0LM_!#BpJZ$rS(<7g!SNLBoqOMsKckKe z0l(CExFvQ&M;_)KFwLEneuv*p^!pF+q>}s|;$298lw5(U7SJ`~%(~;Q2wn?g*6iTO zSa|Ge1MlsV@)FTAf(TP8u3MM80nf-=R%5O9h;hB9-iK#XKQ6I$^m{yaBs1HHGgpLN zcX8cnh{iExOirD&9y-P$_c`*uCCF!s)@4JeKlKyaa4rD;avW;J?>V|EWuOQnwF~_z zmh{Bk{;Yna-+599{FL9kSC98L8Uc`3zjyWnv~?KwZA|B|+A)aZcJ>{e$cos^cMZTk z4BTr(J?C#mUmNtEt6G+mOPj&aA&lQ#7*tf zb2QokK5unmOELoUj@W~=U2Mcv6`+=e!0+73qp+R#=~cjbRl*~x;|P34eM&)|<20lH zTQ%bgHs}$ zriXq_XHoM3$p1dIUc>iteXl~iDxP&XOLD8UA62e(zD98rdMPU2bLd&8V`^zDvY7L} zAZvq6<%561Xwgh!EIw3`XJ-{|uiTG}`kRm|l+EkZ{GcSZ{#>pvWaNue>2tJB#X$$s zC|uk~B{YR5b3Nm6MSyYqW)b|Qs9ZZ>Z4+V3l#l$1*0Y!|XGx8rrTNAbf9gimR6?_H zT*z~meB?B_g&@~XG#Sr4vv$1i@9{|sGwo%uwK}9dtj8%KqYx}#YG?8rtSJ);`z%p_ zNVb`-y|)8erqZKl!b}U3{TWkfmDCw>dvma))llotYG;Jr@1t~Om6}x~*L8BoOLZS* z9Zk%`ve!{a#!+P>bcC%*Nd}Elet@!kP83>}v0N0>65SOs<@Ri$wg|~_2xp{A`+ns> z`40%-zwzM7@p^yN66VC&7*UfRpxNkcka^OMi51gC>0#k&3EwXS4AJ%7LIY^1tNtaZ zX&CC7jhf_dD7c?c=bt#&BcSyZaCeOV^`L*2m{l2#%(Z3!?%tD$4|FW`B6w2KlpQoy z)_G3q(`&)iwaf+0jH8MdSay&3%Qh{UXAwCU*kiTtQzSTCwm~hd&g4N&)QY+qGwBsQi#Vk3WTg0jw+~E} zC~)5aJ*?w9n2Ut8_UoTXV>$a9tz6@yWz#QX9l$k#-Y1-B!ABm==ZShad=%@TRowwQ zU#H7Nc_k=;J~e2M<0$%bRB2{iVn0X7tK`>&DRuoOgRDlgNePeI7vhVvS^sh<8BM9B z>@1nS(22(uyPlLlD-Ph=`)4R)Kg;*rrCzIh`^hD)=$HL$B%S##vqD!qX0Ky8;%Pe4 zZABvP^}ddb1gNfeUfEGpZDRwObyVkKs?0O>DeZ;TI-{P$B={Ij#j1n#^S)N?e^{=$ zadGB2Pgm_CO4~nUb}YYZE^n{Jwm3SKAd{=a9r5haA{31oXO-0)Yme!j-mfYv#_x8E zU&5Q(D_We{WDNHGD9Xs_$cL%%{Bz3x?aZ82OeOhUnD)#hI7kD|VWSmE@hf>#^E`YW+0-ZqGx zI<{@PrC+SFRyt>B1=%yCLis6mE>_h;cxA#QeR&|`q%oZK+_`bH6)X4PP?39$Yx-W26Iw{EC z(zn^IdZo8RF` zo7Zbe@c6eRM~1bwy^=ah#W(a02t-n&$79@~`ss$b& z*3bSxfyb*YVBG7pUW=#ryd&hlNOpGap29g{=%T%zIGnvd@*VwMM2z!AQ|zOaI_pmN zD%oq3b3XNN2FjPVqj&?d#OloU=LXOt_Lm$H)-!K#YyV^GPq9sNdr#_#8FIw!adJ7S zXL@?5mHv&NpVv@Aj!Xx%<&2}XQebcxzG1DskHgs&6XE}e>FA6ysn1(7Y580+x^`=? zbl1alZ_PME?A#nU8Q%=s``$C?4Sxy`7cf^BrBFF*l+3lar@&*&reI83&Iomb7Em|p zj@o-sU&!qxG>`_-V7e4oT}GvJHBF#kJA(MBt1n>(=)V+ zR@1ZeJiSf7rgv#S{TGGkWBPAmzO-Gw$nR8CD4qhs`?(S!bg z+6Gh1C^AN)?rTtE0qUHD`^iW{jH$*nqZn<>MtkK*m!pNZjVp}*Fsh6);{&7G7y}w~ zGY(;nFdD5~P1lfoGM27IlK*Hp9_I;k9k95LuBVA~15Ew;xNfN8^yiPK~N!O*M zF~IhE##p5rI891P-{4-zbPf5?o76NNy_0Dg_tBeXbDEE|fYW?VviH+CLOst(Q&Q4& zP(`KzpxP3hmU6l;B`sr$$7ta>gL~1F|NB(_t7&=~nl%mNRD?8y zle{YC-Ul5T6l+SPCiPtYo7ixj$~YCKqybDZnTA3(1Dxh&8Re@W^E07GZh*$P40`2C z=$)%F=9DsW3*`J}Xq3w!@mE56q}?p#e;{4V>tDA)cMvo}Z%FDe2B}4*-BPxT04nu@ z=KB^$jcrKJ<$gN@Pp=1D?BFvJ>0-$2<q|{&E4C!otqc~mboX4>xnCjSs zQM_7izn7kc$|LXYK>0g$J-0*S-IZ4RH5t0M6jW3|K~WKXH=!7JdAslZ@xJfne);a5Gv%B+bIxzhTnK^?f{TBLR8GKm z1xWByIRlF?)mYp=&v?FdfHTkC~Q>HHi3~M zOHpVXGRT3X2ypy@I8G{%#^%si41yyinnqFp@_exv4&xNd3ZXFK=#h~$k_0SYcF3QdIyauT#noBh|qSdE$VR|d3kDm1LvkzTWvOk z9QAyAq4t#1+_f#Moo((o-Ex#?EAzI|YYm$7W>v7%=Xu6xR*^c!d?-l2Bjq1l4Mh{2 z4;yFPdXe|yTV_w7{rsk^CvKnCn>^=Ajt#}8JM8`5DB_b>-WGXaH$9D}m%QcjFA7(# zUAIwqbTMg2Q<~G6rFHbi=on{%PT#1T`sR{`{YI5r`;YXM>nLrcjOND3o$K)~a_?RF zr59Ubc%Ym{xYwTZ^4f;OUW=W+tM)jFWntRFQxaE3B!oJ*{Nl37{}OIPBlq3)OEE|h zI0lN7zJR1r!BXO}C?%A_>iiFk6*q5k@>@GL4%$C{@00A#c{?AxNEVh99k9+(TX zrpf@3sua%QL|YphGpX!oB1hl~L@F~%;A40k0`VOs4$$xoiGYATU#5w&1m?iBkX#5- ziIbhFtVp50#uFYT>`;ylM7WK>pYhr#DIhszfrvQ3@`W;dO(-}{&_I`8mP5@3nulPg zBB=u93D1$`4=C^#BQh|xG$Q>eengUzAQ6dz9o)gq%R%{I_=zviB=BdK@X#wQRv+;_ zp!93MMwWyV<3rTzWgEcD&-7pCurcz?MP-#%a-a083XZEaY=6Bx2Re33%Cq_p(h>0$ z`s=>-tiuO-l+sjQaTkPW=P<5bwTMWbExz5MzvE$`JwDzwOWF28mVB{~YVxL& zfQKrEBYxXt#A9!dSYG>f!Hj`wkH}S5^Zs+h|F2_cB8CCU@~0RkTTR7q$bY5Z6m}$m zeuIC~??(?~&{%vMO#d;C4^lB!PN&b#DRFW=i~U|SM3MB{eLVN^F+&-*M#lG4Tfe0; zinmbq2IFNpIS8WI9@u?9$veB!IFV3mUVKCbKZw88&V`Q zy#k9W(+?rr^k=oWcXv?lD`${{kFUxLD&42+ja44Vc}%f!_QBtl55QzC`g*kTOT?p$jr*zWwbxu zNi+OGDJT9hHkiCEV4F$(L+Ulxeb$YQ{U(^Z?~2t&ww-@i6S&Q$6IHTKt9ouF@oIGA zd9UPo;$xWlvL$)q-Lkr@@|KA><{<*%8Sw*B(_x1M5Kt1t3%~R?AtROu*g^pw253NE zD8Oe;#wdqvB#7~NHjzEKe1br?m~M+qHTcn%LZ|$>DJ*6iQ7J}YWFnQu0=5%0Fasul zRA^jiB;1=1gum$xqu@V{a`ST}`P_dOo@QkCsjnV*yH1DgEmIVcsNlsGf} z{zM7B&n4K@?$U=mhIWJii-h779Wka#b*J`|!q#k&@>DPF1NjR?G&*iQ<2KI@M?X4A zu8q1dVmOa#^4v8vO1iHh3_B`%$SiV0hEmh3>ZjGOItWcMGA(;JPfo7rthdl~Oz2BE z(V~kY6qmnqzml%E3!8XH?rX=2IL4AySZ5aphV=1%%ls{$-3L;ucm+I{>?5-XODntCPxYy9wRsFHn*@kZk***=aRlM|- zL-T8Wint~Q#PxMg2okuM*Ac40w_hFxfrc5b_I0;6U%z0d6;Acbucvb=8u7N9v$`72 zX|$ta0Z%jnMwRa*rXrUQmUTnj*k|Z7JG%6=m;WU(x$!e6l!4*|C$IrD7M&mLh6Gmz zl{l4DU~o!P6$F1)ESp2{qH*GxthFR-U^&r%q)XK!kO43!{5%BA3>PMgK#ApqGgpf(gMpHYAcxC3v&wQ4|*U=S+v-FfkT~%jc2V z1QX#M%;E{^&nxwsQi9#t4PqF@O?D51p{q zkr_%8@N+T^`zL&EbNs#NN~ved9|Kp-FBWd)vUS_zdoTK5H5)zqR{cPKVD!DE>N=`r z&0Pr5O40YnUZC-J(51)H>QqvUXW=D6?sZ6iP_6~cRladbnE~q?cUto{o;bFw4|<^@ zYW@}wiiX}agpB0Ls%3v13Jkx_GOypTvs6imaM%^$LoUo2-U=*_rWPp{ztY&5o~g!Cuywy_sZF} zA+P%%weM?tvujpOgVQX3Jg?yGa@+ujeioVCZ76ncM`l0e`ii6Ox%z2!kL)axCBc~! zPPyZQ_2r3XRV$8-PT?~Zo)I1}6#}6yfO8!o5UL1gI&rWIvEf<%x490DFC(B(L>{FC6s9)?T@^6CNo) z6-b`m?yg2;BQm_j|DbL0_S>op=aagR&dx}QYJSK)SX~|T6Kyx&qm^9lcyo3LNDMn# zeL?GZ@4hRhOR#0H+-lD| zq@?waq}6&nmUXomeX6+gOvS2l)E@ z7b)C=2bQsAV%*U28@A5}7w^V&NiO~_w$=ujd}q!5y6)T&>;d`};!+|aXXB<6sl>Qg z^X73E$_V|Y+P+YOGbqL@Ip0U}c|}3Tldqgxlz2qP6Iy33VtbyFOKmiY?_xNBpi@KVjshP(m$1Sp z4Enl>H9VBVzE9735P@H=tgLv$3Izs*ceA1#z54`c(;dYtmg8i>v8$0A?5~idC|hbXPcs~=bmX+Nc-r&FX&xwMUBy(4;~VEDwx17 zlFKt+T&}9OjVAip(U8n*RS#P{&&;im#1G!~sXO&OU{;CzQ=M3M-_DmRi@6(oWQ;|1 z?<&ze$-|H2&E&)8)&0W!K&5T7wFr54_QRr^R$2>6S|vLJj(^5(RZ0ocdq5RqdZjP@ z=x{Vny*XWb#C%5E%GHqM#zBd39u`%Vs z+8nXoDK4*vXCz*5aDfS=1GEe0Oo2*Vq!3Odq;O09jHW!pXmY^?%ZMDFnxHJ4ZvbMUVWEDi?qp+H9ChYom0ux1?aV2-$X`-$ zme9_#2804bp`C{ytZl|5+*BwD|H-zQ((nn};0#%Wi*e?6>AfSC$Ye?6~llY9%#@@(8vy~cM9O=*` zN8bQr#lV0rq)o0|rIW_%#`18aW;D<$VXx_w>p z$D7pK8iS!bGLhX|&DKfeKe&C-2jSwCqpy2@i^GS`p{Lxve%#gQr&-lLqxXN)o2Sok z=$A`MPhYU8(lBEKbw#u5`F=;A`^j5I!fOT{vUfctRMoHHj2_nz>rk9u+kK;qQp54} z(ixUH$@LNo>`~UL$B%W*+W56KXKy-f?2^l)l})>Q<~}{ z=>H71Gi(k&zB3jkRlpnf)PhQgkfek^Vge1J5{85Y!nKNE&X0~L61=&OyB<-MyrYgn z=8a1r`djJ;R-6n39ztEDNOr)s&^pl)a)Fo-1L8mg_=y5VL3Ah*;=(0ASRM?v&6k2t8*yc70ZGTTuri=Q|+ZyL0D7dPb?lP&D%8l z;LFpUF}xVEJ>veBwk!vqz|(c}mP%QVhe*q2K)a9^%iM3-<*%+WQM&tO5UbxyI`ljy zEb8tML7UvdF^oW*YP7$!|E0?97svJ<`Ks)_0g*e`&-9}mrNpesK~2M_w}7A(x^rCD znpeJc>`hHEu}Q~w{@0|Hk!wHrY{fs%h@~->yK&NXt1TnNK5Ya#uGIk$aebdI%KVZZC!n6yY5O0vP)HQ`uggK z0e1n2{=Hwj>|XaIEn68Jx?jO9Gv1@QpooXW03K58$6BCCJj5rMkRyC|Wc{zd2hH$7 zO31xd0u^EJ!u0)*An3tCS7!QyHtwm z+o%@3^B4QxgQymwQIha_k*#zhxvP$;b!xmmgIhHt7r|8Tg$Z=*n%!ka*;nu zkdr0{xmPx5$NH!(`dkzoMR~Nlla3v?-1l~YVuth>7QS~F7Kr+_CX_eb5rChM?!n1EF$I(@To T`>xjor2he>K@jvWkwJRWB`#{9 diff --git a/doc/aho_corasick/autiter/index.html b/doc/aho_corasick/autiter/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/aho_corasick/autiter/sidebar-items.js b/doc/aho_corasick/autiter/sidebar-items.js deleted file mode 100644 index 2ccc58f9..00000000 --- a/doc/aho_corasick/autiter/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["Match","Records a match in the search text."],["Matches","An iterator of non-overlapping matches for in-memory text."],["MatchesOverlapping","An iterator of overlapping matches for in-memory text."],["StreamMatches","An iterator of non-overlapping matches for streaming text."],["StreamMatchesOverlapping","An iterator of overlapping matches for streaming text."]],"trait":[["Automaton","An abstraction over automatons and their corresponding iterators. The type parameter `P` is the type of the pattern that was used to construct this Automaton."]]}); \ No newline at end of file diff --git a/doc/aho_corasick/autiter/struct.Match.html b/doc/aho_corasick/autiter/struct.Match.html deleted file mode 100644 index a44d0528..00000000 --- a/doc/aho_corasick/autiter/struct.Match.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

- - - \ No newline at end of file diff --git a/doc/aho_corasick/autiter/struct.Matches.html b/doc/aho_corasick/autiter/struct.Matches.html deleted file mode 100644 index 282f6a2c..00000000 --- a/doc/aho_corasick/autiter/struct.Matches.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../aho_corasick/struct.Matches.html...

- - - \ No newline at end of file diff --git a/doc/aho_corasick/autiter/struct.MatchesOverlapping.html b/doc/aho_corasick/autiter/struct.MatchesOverlapping.html deleted file mode 100644 index 61a752c8..00000000 --- a/doc/aho_corasick/autiter/struct.MatchesOverlapping.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../aho_corasick/struct.MatchesOverlapping.html...

- - - \ No newline at end of file diff --git a/doc/aho_corasick/autiter/struct.StreamMatches.html b/doc/aho_corasick/autiter/struct.StreamMatches.html deleted file mode 100644 index 84864b02..00000000 --- a/doc/aho_corasick/autiter/struct.StreamMatches.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../aho_corasick/struct.StreamMatches.html...

- - - \ No newline at end of file diff --git a/doc/aho_corasick/autiter/struct.StreamMatchesOverlapping.html b/doc/aho_corasick/autiter/struct.StreamMatchesOverlapping.html deleted file mode 100644 index 0051214d..00000000 --- a/doc/aho_corasick/autiter/struct.StreamMatchesOverlapping.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../aho_corasick/struct.StreamMatchesOverlapping.html...

- - - \ No newline at end of file diff --git a/doc/aho_corasick/autiter/trait.Automaton.html b/doc/aho_corasick/autiter/trait.Automaton.html deleted file mode 100644 index 4240333a..00000000 --- a/doc/aho_corasick/autiter/trait.Automaton.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../aho_corasick/trait.Automaton.html...

- - - \ No newline at end of file diff --git a/doc/aho_corasick/full/index.html b/doc/aho_corasick/full/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/aho_corasick/full/sidebar-items.js b/doc/aho_corasick/full/sidebar-items.js deleted file mode 100644 index d5d37be8..00000000 --- a/doc/aho_corasick/full/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["FullAcAutomaton","A complete Aho-Corasick automaton."]]}); \ No newline at end of file diff --git a/doc/aho_corasick/full/struct.FullAcAutomaton.html b/doc/aho_corasick/full/struct.FullAcAutomaton.html deleted file mode 100644 index de4188d1..00000000 --- a/doc/aho_corasick/full/struct.FullAcAutomaton.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../aho_corasick/struct.FullAcAutomaton.html...

- - - \ No newline at end of file diff --git a/doc/aho_corasick/index.html b/doc/aho_corasick/index.html deleted file mode 100644 index eabcc29d..00000000 --- a/doc/aho_corasick/index.html +++ /dev/null @@ -1,311 +0,0 @@ - - - - - - - - - - aho_corasick - Rust - - - - - - - - - - - - - - - - - -
-

Crate aho_corasick - - [−] - - [src]

-

An implementation of the -Aho-Corasick string search algorithm.

- -

The Aho-Corasick algorithm is principally useful when you need to search many -large texts for a fixed (possibly large) set of keywords. In particular, the -Aho-Corasick algorithm preprocesses the set of keywords by constructing a -finite state machine. The search phase is then a quick linear scan through the -text. Each character in the search text causes a state transition in the -automaton. Matches are reported when the automaton enters a match state.

- -

Examples

-

The main type exposed by this crate is AcAutomaton, which can be constructed -from an iterator of pattern strings:

- -
-use aho_corasick::{Automaton, AcAutomaton};
-
-let aut = AcAutomaton::new(vec!["apple", "maple"]);
-
-// AcAutomaton also implements `FromIterator`:
-let aut: AcAutomaton<&str> = ["apple", "maple"].iter().cloned().collect();
- -

Finding matches can be done with find:

- -
-use aho_corasick::{Automaton, AcAutomaton, Match};
-
-let aut = AcAutomaton::new(vec!["apple", "maple"]);
-let mut it = aut.find("I like maple apples.");
-assert_eq!(it.next(), Some(Match {
-    pati: 1,
-    start: 7,
-    end: 12,
-}));
-assert_eq!(it.next(), Some(Match {
-    pati: 0,
-    start: 13,
-    end: 18,
-}));
-assert_eq!(it.next(), None);
- -

Use find_overlapping if you want to report all matches, even if they -overlap with each other.

- -
-use aho_corasick::{Automaton, AcAutomaton, Match};
-
-let aut = AcAutomaton::new(vec!["abc", "a"]);
-let matches: Vec<_> = aut.find_overlapping("abc").collect();
-assert_eq!(matches, vec![
-    Match { pati: 1, start: 0, end: 1}, Match { pati: 0, start: 0, end: 3 },
-]);
-
-// Regular `find` will report only one match:
-let matches: Vec<_> = aut.find("abc").collect();
-assert_eq!(matches, vec![Match { pati: 1, start: 0, end: 1}]);
- -

Finally, there are also methods for finding matches on streams. Namely, the -search text does not have to live in memory. It's useful to run this on files -that can't fit into memory:

- -
-use std::fs::File;
-
-use aho_corasick::{Automaton, AcAutomaton};
-
-let aut = AcAutomaton::new(vec!["foo", "bar", "baz"]);
-let rdr = File::open("search.txt").unwrap();
-for m in aut.stream_find(rdr) {
-    let m = m.unwrap(); // could be an IO error
-    println!("Pattern '{}' matched at: ({}, {})",
-             aut.pattern(m.pati), m.start, m.end);
-}
- -

There is also stream_find_overlapping, which is just like find_overlapping, -but it operates on streams.

- -

Please see dict-search.rs in this crate's examples directory for a more -complete example. It creates a large automaton from a dictionary and can do a -streaming match over arbitrarily large data.

- -

Memory usage

-

A key aspect of an Aho-Corasick implementation is how the state transitions -are represented. The easiest way to make the automaton fast is to store a -sparse 256-slot map in each state. It maps an input byte to a state index. -This makes the matching loop extremely fast, since it translates to a simple -pointer read.

- -

The problem is that as the automaton accumulates more states, you end up paying -a 256 * 4 (4 is for the u32 state index) byte penalty for every state -regardless of how many transitions it has.

- -

To solve this, only states near the root of the automaton have this sparse -map representation. States near the leaves of the automaton use a dense mapping -that requires a linear scan.

- -

(The specific limit currently set is 3, so that states with a depth less than -or equal to 3 are less memory efficient. The result is that the memory usage -of the automaton stops growing rapidly past ~60MB, even for automatons with -thousands of patterns.)

- -

If you'd like to opt for the less-memory-efficient-but-faster version, then -you can construct an AcAutomaton with a Sparse transition strategy:

- -
-use aho_corasick::{Automaton, AcAutomaton, Match, Sparse};
-
-let aut = AcAutomaton::<&str, Sparse>::with_transitions(vec!["abc", "a"]);
-let matches: Vec<_> = aut.find("abc").collect();
-assert_eq!(matches, vec![Match { pati: 1, start: 0, end: 1}]);
-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
AcAutomaton -

An Aho-Corasick finite automaton.

-
Dense -

State transitions that can be stored either sparsely or densely.

-
FullAcAutomaton -

A complete Aho-Corasick automaton.

-
Match -

Records a match in the search text.

-
Matches -

An iterator of non-overlapping matches for in-memory text.

-
MatchesOverlapping -

An iterator of overlapping matches for in-memory text.

-
Sparse -

State transitions that are always sparse.

-
StreamMatches -

An iterator of non-overlapping matches for streaming text.

-
StreamMatchesOverlapping -

An iterator of overlapping matches for streaming text.

-

Traits

- - - - - - - - -
Automaton -

An abstraction over automatons and their corresponding iterators. -The type parameter P is the type of the pattern that was used to -construct this Automaton.

-
Transitions -

An abstraction over state transition strategies.

-

Type Definitions

- - - - -
StateIdx -

The integer type used for the state index.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/aho_corasick/sidebar-items.js b/doc/aho_corasick/sidebar-items.js deleted file mode 100644 index f37c1853..00000000 --- a/doc/aho_corasick/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["AcAutomaton","An Aho-Corasick finite automaton."],["Dense","State transitions that can be stored either sparsely or densely."],["FullAcAutomaton","A complete Aho-Corasick automaton."],["Match","Records a match in the search text."],["Matches","An iterator of non-overlapping matches for in-memory text."],["MatchesOverlapping","An iterator of overlapping matches for in-memory text."],["Sparse","State transitions that are always sparse."],["StreamMatches","An iterator of non-overlapping matches for streaming text."],["StreamMatchesOverlapping","An iterator of overlapping matches for streaming text."]],"trait":[["Automaton","An abstraction over automatons and their corresponding iterators. The type parameter `P` is the type of the pattern that was used to construct this Automaton."],["Transitions","An abstraction over state transition strategies."]],"type":[["StateIdx","The integer type used for the state index."]]}); \ No newline at end of file diff --git a/doc/aho_corasick/struct.AcAutomaton.html b/doc/aho_corasick/struct.AcAutomaton.html deleted file mode 100644 index 343383b4..00000000 --- a/doc/aho_corasick/struct.AcAutomaton.html +++ /dev/null @@ -1,152 +0,0 @@ - - - - - - - - - - aho_corasick::AcAutomaton - Rust - - - - - - - - - - - - - - - - - -
-

Struct aho_corasick::AcAutomaton - - [−] - - [src]

-
pub struct AcAutomaton<P, T = Dense> {
-    // some fields omitted
-}

An Aho-Corasick finite automaton.

- -

The type parameter P is the type of the pattern that was used to -construct this AcAutomaton.

-

Methods

impl<P: AsRef<[u8]>> AcAutomaton<P>

fn new<I>(pats: I) -> AcAutomaton<P, Dense> where I: IntoIterator<Item=P>

-

Create a new automaton from an iterator of patterns.

- -

The patterns must be convertible to bytes (&[u8]) via the AsRef -trait.

-

impl<P: AsRef<[u8]>, T: Transitions> AcAutomaton<P, T>

fn with_transitions<I>(pats: I) -> AcAutomaton<P, T> where I: IntoIterator<Item=P>

-

Create a new automaton from an iterator of patterns.

- -

This constructor allows one to choose the transition representation.

- -

The patterns must be convertible to bytes (&[u8]) via the AsRef -trait.

-

fn into_full(self) -> FullAcAutomaton<P>

-

Build out the entire automaton into a single matrix.

- -

This will make searching as fast as possible at the expense of using -at least 4 * 256 * #states bytes of memory.

-

Trait Implementations

impl<P: AsRef<[u8]>, T: Transitions> Automaton<P> for AcAutomaton<P, T>

fn next_state(&self, si: StateIdx, b: u8) -> StateIdx

-

fn get_match(&self, si: StateIdx, outi: usize, texti: usize) -> Match

-

fn has_match(&self, si: StateIdx, outi: usize) -> bool

-

fn start_bytes(&self) -> &[u8]

-

fn patterns(&self) -> &[P]

-

fn pattern(&self, i: usize) -> &P

-

fn len(&self) -> usize

-

fn is_empty(&self) -> bool

-

fn find<'a, 's, Q: ?Sized + AsRef<[u8]>>(&'a self, s: &'s Q) -> Matches<'a, 's, P, Self> where Self: Sized

-

fn find_overlapping<'a, 's, Q: ?Sized + AsRef<[u8]>>(&'a self, s: &'s Q) -> MatchesOverlapping<'a, 's, P, Self> where Self: Sized

-

fn stream_find<'a, R: Read>(&'a self, rdr: R) -> StreamMatches<'a, R, P, Self> where Self: Sized

-

fn stream_find_overlapping<'a, R: Read>(&'a self, rdr: R) -> StreamMatchesOverlapping<'a, R, P, Self> where Self: Sized

-

impl<S: AsRef<[u8]>> FromIterator<S> for AcAutomaton<S>

fn from_iter<T>(it: T) -> AcAutomaton<S> where T: IntoIterator<Item=S>

-

Create an automaton from an iterator of strings.

-

impl<P: AsRef<[u8]> + Debug, T: Transitions> Debug for AcAutomaton<P, T>

fn fmt(&self, f: &mut Formatter) -> Result

-

Derived Implementations

impl<P: Clone, T: Clone> Clone for AcAutomaton<P, T>

fn clone(&self) -> AcAutomaton<P, T>

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/aho_corasick/struct.Dense.html b/doc/aho_corasick/struct.Dense.html deleted file mode 100644 index 5ee76394..00000000 --- a/doc/aho_corasick/struct.Dense.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - aho_corasick::Dense - Rust - - - - - - - - - - - - - - - - - -
-

Struct aho_corasick::Dense - - [−] - - [src]

-
pub struct Dense(_);

State transitions that can be stored either sparsely or densely.

- -

This uses less space but at the expense of slower matching.

-

Trait Implementations

impl Transitions for Dense

fn new(depth: u32) -> Dense

-

fn goto(&self, b1: u8) -> StateIdx

-

fn set_goto(&mut self, b: u8, si: StateIdx)

-

fn heap_bytes(&self) -> usize

-

Derived Implementations

impl Debug for Dense

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-

impl Clone for Dense

fn clone(&self) -> Dense

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/aho_corasick/struct.FullAcAutomaton.html b/doc/aho_corasick/struct.FullAcAutomaton.html deleted file mode 100644 index f7d9fe54..00000000 --- a/doc/aho_corasick/struct.FullAcAutomaton.html +++ /dev/null @@ -1,140 +0,0 @@ - - - - - - - - - - aho_corasick::FullAcAutomaton - Rust - - - - - - - - - - - - - - - - - -
-

Struct aho_corasick::FullAcAutomaton - - [−] - - [src]

-
pub struct FullAcAutomaton<P> {
-    // some fields omitted
-}

A complete Aho-Corasick automaton.

- -

This uses a single transition matrix that permits each input character -to move to the next state with a single lookup in the matrix.

- -

This is as fast as it gets, but it is guaranteed to use a lot of memory. -Namely, it will use at least 4 * 256 * #states, where the number of -states is capped at length of all patterns concatenated.

-

Methods

impl<P: AsRef<[u8]>> FullAcAutomaton<P>

fn new<T: Transitions>(ac: AcAutomaton<P, T>) -> FullAcAutomaton<P>

-

Build a new expanded Aho-Corasick automaton from an existing -Aho-Corasick automaton.

-

Trait Implementations

impl<P: AsRef<[u8]>> Automaton<P> for FullAcAutomaton<P>

fn next_state(&self, si: StateIdx, i: u8) -> StateIdx

-

fn get_match(&self, si: StateIdx, outi: usize, texti: usize) -> Match

-

fn has_match(&self, si: StateIdx, outi: usize) -> bool

-

fn start_bytes(&self) -> &[u8]

-

fn patterns(&self) -> &[P]

-

fn pattern(&self, i: usize) -> &P

-

fn len(&self) -> usize

-

fn is_empty(&self) -> bool

-

fn find<'a, 's, Q: ?Sized + AsRef<[u8]>>(&'a self, s: &'s Q) -> Matches<'a, 's, P, Self> where Self: Sized

-

fn find_overlapping<'a, 's, Q: ?Sized + AsRef<[u8]>>(&'a self, s: &'s Q) -> MatchesOverlapping<'a, 's, P, Self> where Self: Sized

-

fn stream_find<'a, R: Read>(&'a self, rdr: R) -> StreamMatches<'a, R, P, Self> where Self: Sized

-

fn stream_find_overlapping<'a, R: Read>(&'a self, rdr: R) -> StreamMatchesOverlapping<'a, R, P, Self> where Self: Sized

-

impl<P: AsRef<[u8]> + Debug> Debug for FullAcAutomaton<P>

fn fmt(&self, f: &mut Formatter) -> Result

-

Derived Implementations

impl<P: Clone> Clone for FullAcAutomaton<P>

fn clone(&self) -> FullAcAutomaton<P>

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/aho_corasick/struct.Match.html b/doc/aho_corasick/struct.Match.html deleted file mode 100644 index 8263d7c7..00000000 --- a/doc/aho_corasick/struct.Match.html +++ /dev/null @@ -1,137 +0,0 @@ - - - - - - - - - - aho_corasick::Match - Rust - - - - - - - - - - - - - - - - - -
-

Struct aho_corasick::Match - - [−] - - [src]

-
pub struct Match {
-    pub pati: usize,
-    pub start: usize,
-    pub end: usize,
-}

Records a match in the search text.

-

Fields

- - - -
pati

The pattern index.

- -

This corresponds to the ordering in which the matched pattern was -added to the automaton, starting at 0.

-
start

The starting byte offset of the match in the search text.

-
end

The ending byte offset of the match in the search text.

- -

(This can be re-captiulated with pati and adding the pattern's -length to start, but it is convenient to have it here.)

-

Trait Implementations

Derived Implementations

impl Eq for Match

impl PartialEq for Match

fn eq(&self, __arg_0: &Match) -> bool

-

fn ne(&self, __arg_0: &Match) -> bool

-

impl Hash for Match

fn hash<__H: Hasher>(&self, __arg_0: &mut __H)

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl Debug for Match

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-

impl Clone for Match

fn clone(&self) -> Match

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Copy for Match

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/aho_corasick/struct.Matches.html b/doc/aho_corasick/struct.Matches.html deleted file mode 100644 index ae0f31d4..00000000 --- a/doc/aho_corasick/struct.Matches.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - aho_corasick::Matches - Rust - - - - - - - - - - - - - - - - - -
-

Struct aho_corasick::Matches - - [−] - - [src]

-
pub struct Matches<'a, 's, P, A: 'a + Automaton<P> + ?Sized> {
-    // some fields omitted
-}

An iterator of non-overlapping matches for in-memory text.

- -

This iterator yields Match values.

- -

'a is the lifetime of the automaton, 's is the lifetime of the -search text, and P is the type of the Automaton's pattern.

-

Trait Implementations

impl<'a, 's, P, A: Automaton<P> + ?Sized> Iterator for Matches<'a, 's, P, A>

type Item = Match

-

fn next(&mut self) -> Option<Match>

-

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where U: IntoIterator, F: FnMut(Self::Item) -> U1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where Self: Iterator<Item=(A, B)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where T: 'a + Clone, Self: Iterator<Item=&'a T>1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl<'a, 's, P: Debug, A: Debug + 'a + Automaton<P> + ?Sized> Debug for Matches<'a, 's, P, A>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/aho_corasick/struct.MatchesOverlapping.html b/doc/aho_corasick/struct.MatchesOverlapping.html deleted file mode 100644 index 87fc9e8b..00000000 --- a/doc/aho_corasick/struct.MatchesOverlapping.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - aho_corasick::MatchesOverlapping - Rust - - - - - - - - - - - - - - - - - -
-

Struct aho_corasick::MatchesOverlapping - - [−] - - [src]

-
pub struct MatchesOverlapping<'a, 's, P, A: 'a + Automaton<P> + ?Sized> {
-    // some fields omitted
-}

An iterator of overlapping matches for in-memory text.

- -

This iterator yields Match values.

- -

'a is the lifetime of the automaton, 's is the lifetime of the -search text, and P is the type of the Automaton's pattern.

-

Trait Implementations

impl<'a, 's, P, A: Automaton<P> + ?Sized> Iterator for MatchesOverlapping<'a, 's, P, A>

type Item = Match

-

fn next(&mut self) -> Option<Match>

-

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where U: IntoIterator, F: FnMut(Self::Item) -> U1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where Self: Iterator<Item=(A, B)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where T: 'a + Clone, Self: Iterator<Item=&'a T>1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl<'a, 's, P: Debug, A: Debug + 'a + Automaton<P> + ?Sized> Debug for MatchesOverlapping<'a, 's, P, A>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/aho_corasick/struct.Sparse.html b/doc/aho_corasick/struct.Sparse.html deleted file mode 100644 index 74e04d72..00000000 --- a/doc/aho_corasick/struct.Sparse.html +++ /dev/null @@ -1,123 +0,0 @@ - - - - - - - - - - aho_corasick::Sparse - Rust - - - - - - - - - - - - - - - - - -
-

Struct aho_corasick::Sparse - - [−] - - [src]

-
pub struct Sparse(_);

State transitions that are always sparse.

- -

This can use enormous amounts of memory when there are many patterns, -but matching is very fast.

-

Trait Implementations

impl Transitions for Sparse

fn new(_: u32) -> Sparse

-

fn goto(&self, b: u8) -> StateIdx

-

fn set_goto(&mut self, b: u8, si: StateIdx)

-

fn heap_bytes(&self) -> usize

-

Derived Implementations

impl Debug for Sparse

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-

impl Clone for Sparse

fn clone(&self) -> Sparse

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/aho_corasick/struct.StreamMatches.html b/doc/aho_corasick/struct.StreamMatches.html deleted file mode 100644 index 6ccf79eb..00000000 --- a/doc/aho_corasick/struct.StreamMatches.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - aho_corasick::StreamMatches - Rust - - - - - - - - - - - - - - - - - -
-

Struct aho_corasick::StreamMatches - - [−] - - [src]

-
pub struct StreamMatches<'a, R, P, A: 'a + Automaton<P> + ?Sized> {
-    // some fields omitted
-}

An iterator of non-overlapping matches for streaming text.

- -

This iterator yields io::Result<Match> values.

- -

'a is the lifetime of the automaton, R is the type of the underlying -io::Reader, and P is the type of the Automaton's pattern.

-

Trait Implementations

impl<'a, R: Read, P, A: Automaton<P>> Iterator for StreamMatches<'a, R, P, A>

type Item = Result<Match>

-

fn next(&mut self) -> Option<Result<Match>>

-

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where U: IntoIterator, F: FnMut(Self::Item) -> U1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where Self: Iterator<Item=(A, B)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where T: 'a + Clone, Self: Iterator<Item=&'a T>1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl<'a, R: Debug, P: Debug, A: Debug + 'a + Automaton<P> + ?Sized> Debug for StreamMatches<'a, R, P, A>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/aho_corasick/struct.StreamMatchesOverlapping.html b/doc/aho_corasick/struct.StreamMatchesOverlapping.html deleted file mode 100644 index 8f588e42..00000000 --- a/doc/aho_corasick/struct.StreamMatchesOverlapping.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - aho_corasick::StreamMatchesOverlapping - Rust - - - - - - - - - - - - - - - - - -
-

Struct aho_corasick::StreamMatchesOverlapping - - [−] - - [src]

-
pub struct StreamMatchesOverlapping<'a, R, P, A: 'a + Automaton<P> + ?Sized> {
-    // some fields omitted
-}

An iterator of overlapping matches for streaming text.

- -

This iterator yields io::Result<Match> values.

- -

'a is the lifetime of the automaton, R is the type of the underlying -io::Reader, and P is the type of the Automaton's pattern.

-

Trait Implementations

impl<'a, R: Read, P, A: Automaton<P> + ?Sized> Iterator for StreamMatchesOverlapping<'a, R, P, A>

type Item = Result<Match>

-

fn next(&mut self) -> Option<Result<Match>>

-

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where U: IntoIterator, F: FnMut(Self::Item) -> U1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where Self: Iterator<Item=(A, B)>, FromA: Default + Extend<A>, FromB: Default + Extend<B>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where T: 'a + Clone, Self: Iterator<Item=&'a T>1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl<'a, R: Debug, P: Debug, A: Debug + 'a + Automaton<P> + ?Sized> Debug for StreamMatchesOverlapping<'a, R, P, A>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/aho_corasick/trait.Automaton.html b/doc/aho_corasick/trait.Automaton.html deleted file mode 100644 index d23fdcaa..00000000 --- a/doc/aho_corasick/trait.Automaton.html +++ /dev/null @@ -1,161 +0,0 @@ - - - - - - - - - - aho_corasick::Automaton - Rust - - - - - - - - - - - - - - - - - -
-

Trait aho_corasick::Automaton - - [−] - - [src]

-
pub trait Automaton<P> {
-    fn next_state(&self, si: StateIdx, b: u8) -> StateIdx;
-    fn has_match(&self, si: StateIdx, outi: usize) -> bool;
-    fn get_match(&self, si: StateIdx, outi: usize, texti: usize) -> Match;
-    fn start_bytes(&self) -> &[u8];
-    fn patterns(&self) -> &[P];
-    fn pattern(&self, i: usize) -> &P;
-
-    fn len(&self) -> usize { ... }
-    fn is_empty(&self) -> bool { ... }
-    fn find<'a, 's, Q: ?Sized + AsRef<[u8]>>(&'a self, s: &'s Q) -> Matches<'a, 's, P, Self> where Self: Sized { ... }
-    fn find_overlapping<'a, 's, Q: ?Sized + AsRef<[u8]>>(&'a self, s: &'s Q) -> MatchesOverlapping<'a, 's, P, Self> where Self: Sized { ... }
-    fn stream_find<'a, R: Read>(&'a self, rdr: R) -> StreamMatches<'a, R, P, Self> where Self: Sized { ... }
-    fn stream_find_overlapping<'a, R: Read>(&'a self, rdr: R) -> StreamMatchesOverlapping<'a, R, P, Self> where Self: Sized { ... }
-}

An abstraction over automatons and their corresponding iterators. -The type parameter P is the type of the pattern that was used to -construct this Automaton.

-
-

Required Methods

-
-

fn next_state(&self, si: StateIdx, b: u8) -> StateIdx

Return the next state given the current state and next character.

-

fn has_match(&self, si: StateIdx, outi: usize) -> bool

Return true if and only if the given state and current pattern index -indicate a match.

-

fn get_match(&self, si: StateIdx, outi: usize, texti: usize) -> Match

Build a match given the current state, pattern index and input index.

-

fn start_bytes(&self) -> &[u8]

Return the set of bytes that have transitions in the root state.

-

fn patterns(&self) -> &[P]

Returns all of the patterns matched by this automaton.

- -

The order of the patterns is the order in which they were added.

-

fn pattern(&self, i: usize) -> &P

Returns the pattern indexed at i.

- -

The index corresponds to the position at which the pattern was added -to the automaton, starting at 0.

-
-

Provided Methods

-
-

fn len(&self) -> usize

Return the number of patterns in the automaton.

-

fn is_empty(&self) -> bool

Returns true if the automaton has no patterns.

-

fn find<'a, 's, Q: ?Sized + AsRef<[u8]>>(&'a self, s: &'s Q) -> Matches<'a, 's, P, Self> where Self: Sized

Returns an iterator of non-overlapping matches in s.

-

fn find_overlapping<'a, 's, Q: ?Sized + AsRef<[u8]>>(&'a self, s: &'s Q) -> MatchesOverlapping<'a, 's, P, Self> where Self: Sized

Returns an iterator of overlapping matches in s.

-

fn stream_find<'a, R: Read>(&'a self, rdr: R) -> StreamMatches<'a, R, P, Self> where Self: Sized

Returns an iterator of non-overlapping matches in the given reader.

-

fn stream_find_overlapping<'a, R: Read>(&'a self, rdr: R) -> StreamMatchesOverlapping<'a, R, P, Self> where Self: Sized

Returns an iterator of overlapping matches in the given reader.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/aho_corasick/trait.Transitions.html b/doc/aho_corasick/trait.Transitions.html deleted file mode 100644 index 0534ba83..00000000 --- a/doc/aho_corasick/trait.Transitions.html +++ /dev/null @@ -1,138 +0,0 @@ - - - - - - - - - - aho_corasick::Transitions - Rust - - - - - - - - - - - - - - - - - -
-

Trait aho_corasick::Transitions - - [−] - - [src]

-
pub trait Transitions {
-    fn new(depth: u32) -> Self;
-    fn goto(&self, alpha: u8) -> StateIdx;
-    fn set_goto(&mut self, alpha: u8, si: StateIdx);
-    fn heap_bytes(&self) -> usize;
-}

An abstraction over state transition strategies.

- -

This is an attempt to let the caller choose the space/time trade offs -used for state transitions.

- -

(It's possible that this interface is merely good enough for just the two -implementations in this crate.)

-
-

Required Methods

-
-

fn new(depth: u32) -> Self

Return a new state at the given depth.

-

fn goto(&self, alpha: u8) -> StateIdx

Return the next state index given the next character.

-

fn set_goto(&mut self, alpha: u8, si: StateIdx)

Set the next state index for the character given.

-

fn heap_bytes(&self) -> usize

The memory use in bytes (on the heap) of this set of transitions.

-
-

Implementors

-
    -
  • impl Transitions for Dense
    • -
  • impl Transitions for Sparse
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/aho_corasick/type.StateIdx.html b/doc/aho_corasick/type.StateIdx.html deleted file mode 100644 index c920a61a..00000000 --- a/doc/aho_corasick/type.StateIdx.html +++ /dev/null @@ -1,116 +0,0 @@ - - - - - - - - - - aho_corasick::StateIdx - Rust - - - - - - - - - - - - - - - - - -
-

aho_corasick::StateIdx - - [−] - - [src]

-
type StateIdx = u32;

The integer type used for the state index.

- -

Limiting this to 32 bit integers can have a big impact on memory usage -when using the Sparse transition representation.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/ansi_term/enum.Colour.html b/doc/ansi_term/enum.Colour.html deleted file mode 100644 index 5275e58d..00000000 --- a/doc/ansi_term/enum.Colour.html +++ /dev/null @@ -1,185 +0,0 @@ - - - - - - - - - - ansi_term::Colour - Rust - - - - - - - - - - - - - - - - - -
-

Enum ansi_term::Colour - - [−] - - [src]

-
pub enum Colour {
-    Black,
-    Red,
-    Green,
-    Yellow,
-    Blue,
-    Purple,
-    Cyan,
-    White,
-    Fixed(u8),
-}

A colour is one specific type of ANSI escape code, and can refer -to either the foreground or background colour.

- -

These use the standard numeric sequences. -See http://invisible-island.net/xterm/ctlseqs/ctlseqs.html

-

Variants

-
Black

Colour #0 (foreground code 30, background code 40).

- -

This is not necessarily the background colour, and using it as one may -render the text hard to read on terminals with dark backgrounds.

-
Red

Colour #1 (foreground code 31, background code 41).

-
Green

Colour #2 (foreground code 32, background code 42).

-
Yellow

Colour #3 (foreground code 33, background code 43).

-
Blue

Colour #4 (foreground code 34, background code 44).

-
Purple

Colour #5 (foreground code 35, background code 45).

-
Cyan

Colour #6 (foreground code 36, background code 46).

-
White

Colour #7 (foreground code 37, background code 47).

- -

As above, this is not necessarily the foreground colour, and may be -hard to read on terminals with light backgrounds.

-
Fixed

A colour number from 0 to 255, for use in 256-colour terminal -environments.

- -
    -
  • Colours 0 to 7 are the Black to White variants respectively. -These colours can usually be changed in the terminal emulator.
    • -
  • Colours 8 to 15 are brighter versions of the eight colours above. -These can also usually be changed in the terminal emulator, or it -could be configured to use the original colours and show the text in -bold instead. It varies depending on the program.
    • -
  • Colours 16 to 231 contain several palettes of bright colours, -arranged in six squares measuring six by six each.
    • -
  • Colours 232 to 255 are shades of grey from black to white.
    • -
- -

It might make more sense to look at a colour chart.

-

Methods

impl Colour

fn normal(self) -> Style

-

Return a Style with the foreground colour set to this colour.

-

fn paint<'a, S>(self, input: S) -> ANSIString<'a> where S: Into<Cow<'a, str>>

-

Paints the given text with this colour, returning an ANSI string. -This is a short-cut so you don't have to use Blue.normal() just -to get blue text.

-

fn bold(self) -> Style

-

Returns a Style with the bold property set.

-

fn dimmed(self) -> Style

-

Returns a Style with the dimmed property set.

-

fn italic(self) -> Style

-

Returns a Style with the italic property set.

-

fn underline(self) -> Style

-

Returns a Style with the underline property set.

-
-

Returns a Style with the blink property set.

-

fn reverse(self) -> Style

-

Returns a Style with the reverse property set.

-

fn hidden(self) -> Style

-

Returns a Style with the hidden property set.

-

fn on(self, background: Colour) -> Style

-

Returns a Style with the background colour property set.

-

Trait Implementations

Derived Implementations

impl Debug for Colour

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-

impl Copy for Colour

impl Clone for Colour

fn clone(&self) -> Colour

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl PartialEq for Colour

fn eq(&self, __arg_0: &Colour) -> bool

-

fn ne(&self, __arg_0: &Colour) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/ansi_term/index.html b/doc/ansi_term/index.html deleted file mode 100644 index cd7d6a70..00000000 --- a/doc/ansi_term/index.html +++ /dev/null @@ -1,274 +0,0 @@ - - - - - - - - - - ansi_term - Rust - - - - - - - - - - - - - - - - - -
-

Crate ansi_term - - [−] - - [src]

-

This is a library for controlling colours and formatting, such as -red bold text or blue underlined text, on ANSI terminals.

- -

Basic usage

-

There are two main data structures in this crate that you need to be -concerned with: ANSIString and Style. A Style holds stylistic -information: colours, whether the text should be bold, or blinking, or -whatever. There are also Colour variants that represent simple foreground -colour styles. An ANSIString is a string paired with a Style.

- -

(Yes, it’s British English, but you won’t have to write “colour” very often. -Style is used the majority of the time.)

- -

To format a string, call the paint method on a Style or a Colour, -passing in the string you want to format as the argument. For example, -here’s how to get some red text:

- -
-use ansi_term::Colour::Red;
-println!("This is in red: {}", Red.paint("a red string"));
- -

It’s important to note that the paint method does not actually return a -string with the ANSI control characters surrounding it. Instead, it returns -an ANSIString value that has a Display implementation that, when -formatted, returns the characters. This allows strings to be printed with a -minimum of String allocations being performed behind the scenes.

- -

If you do want to get at the escape codes, then you can convert the -ANSIString to a string as you would any other Display value:

- -
-use ansi_term::Colour::Red;
-use std::string::ToString;
-let red_string = Red.paint("a red string").to_string();
- -

Bold, underline, background, and other styles

-

For anything more complex than plain foreground colour changes, you need to -construct Style objects themselves, rather than beginning with a Colour. -You can do this by chaining methods based on a new Style, created with -Style::new(). Each method creates a new style that has that specific -property set. For example:

- -
-use ansi_term::Style;
-println!("How about some {} and {}?",
-         Style::new().bold().paint("bold"),
-         Style::new().underline().paint("underline"));
- -

For brevity, these methods have also been implemented for Colour values, -so you can give your styles a foreground colour without having to begin with -an empty Style value:

- -
-use ansi_term::Colour::{Blue, Yellow};
-println!("Demonstrating {} and {}!",
-         Blue.bold().paint("blue bold"),
-         Yellow.underline().paint("yellow underline"));
-println!("Yellow on blue: {}", Yellow.on(Blue).paint("wow!"));
- -

The complete list of styles you can use are: bold, dimmed, italic, -underline, blink, reverse, hidden, and on for background colours.

- -

Finally, you can turn a Colour into a Style with the normal method. -This will produce the exact same ANSIString as if you just used the -paint method on the Colour directly, but it’s useful in certain cases: -for example, you may have a method that returns Styles, and need to -represent both the “red bold” and “red, but not bold” styles with values of -the same type. The Style struct also has a Default implementation if you -want to have a style with nothing set.

- -
-use ansi_term::Style;
-use ansi_term::Colour::Red;
-Red.normal().paint("yet another red string");
-Style::default().paint("a completely regular string");
- -

Extended colours

-

You can access the extended range of 256 colours by using the Fixed colour -variant, which takes an argument of the colour number to use. This can be -included wherever you would use a Colour:

- -
-use ansi_term::Colour::Fixed;
-Fixed(134).paint("A sort of light purple");
-Fixed(221).on(Fixed(124)).paint("Mustard in the ketchup");
- -

The first sixteen of these values are the same as the normal and bold -standard colour variants. There’s nothing stopping you from using these as -Fixed colours instead, but there’s nothing to be gained by doing so -either.

- -

Combining successive coloured strings

-

The benefit of writing ANSI escape codes to the terminal is that they -stack: you do not need to end every coloured string with a reset code if -the text that follows it is of a similar style. For example, if you want to -have some blue text followed by some blue bold text, it’s possible to send -the ANSI code for blue, followed by the ANSI code for bold, and finishing -with a reset code without having to have an extra one between the two -strings.

- -

This crate can optimise the ANSI codes that get printed in situations like -this, making life easier for your terminal renderer. The ANSIStrings -struct takes a slice of several ANSIString values, and will iterate over -each of them, printing only the codes for the styles that need to be updated -as part of its formatting routine.

- -

The following code snippet uses this to enclose a binary number displayed in -red bold text inside some red, but not bold, brackets:

- -
-use ansi_term::Colour::Red;
-use ansi_term::{ANSIString, ANSIStrings};
-let some_value = format!("{:b}", 42);
-let strings: &[ANSIString<'static>] = &[
-    Red.paint("["),
-    Red.bold().paint(some_value),
-    Red.paint("]"),
-];
-println!("Value: {}", ANSIStrings(strings));
- -

There are several things to note here. Firstly, the paint method can take -either an owned String or a borrowed &str. Internally, an ANSIString -holds a copy-on-write (Cow) string value to deal with both owned and -borrowed strings at the same time. This is used here to display a String, -the result of the format! call, using the same mechanism as some -statically-available &str slices. Secondly, that the ANSIStrings value -works in the same way as its singular counterpart, with a Display -implementation that only performs the formatting when required.

-

Structs

- - - - - - - - - - - - -
ANSIString -

An ANSI String is a string coupled with the Style to display it -in a terminal.

-
ANSIStrings -

A set of ANSIStrings collected together, in order to be written with a -minimum of control characters.

-
Style -

A style is a collection of properties that can format a string -using ANSI escape codes.

-

Enums

- - - - -
Colour -

A colour is one specific type of ANSI escape code, and can refer -to either the foreground or background colour.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/ansi_term/sidebar-items.js b/doc/ansi_term/sidebar-items.js deleted file mode 100644 index dbb7aa66..00000000 --- a/doc/ansi_term/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["Colour","A colour is one specific type of ANSI escape code, and can refer to either the foreground or background colour."]],"struct":[["ANSIString","An ANSI String is a string coupled with the Style to display it in a terminal."],["ANSIStrings","A set of `ANSIString`s collected together, in order to be written with a minimum of control characters."],["Style","A style is a collection of properties that can format a string using ANSI escape codes."]]}); \ No newline at end of file diff --git a/doc/ansi_term/struct.ANSIString.html b/doc/ansi_term/struct.ANSIString.html deleted file mode 100644 index a7aa03af..00000000 --- a/doc/ansi_term/struct.ANSIString.html +++ /dev/null @@ -1,1367 +0,0 @@ - - - - - - - - - - ansi_term::ANSIString - Rust - - - - - - - - - - - - - - - - - -
-

Struct ansi_term::ANSIString - - [−] - - [src]

-
pub struct ANSIString<'a> {
-    // some fields omitted
-}

An ANSI String is a string coupled with the Style to display it -in a terminal.

- -

Although not technically a string itself, it can be turned into -one with the to_string method.

- -

Examples

-
-use ansi_term::ANSIString;
-use ansi_term::Colour::Red;
-
-let red_string = Red.paint("a red string");
-println!("{}", red_string);
- -
-use ansi_term::ANSIString;
-
-let plain_string = ANSIString::from("a plain string");
-assert_eq!(&*plain_string, "a plain string");
-

Methods from Deref<Target=str>

fn len(&self) -> usize1.0.0

-

Returns the length of self.

- -

This length is in bytes, not chars or graphemes. In other words, -it may not be what a human considers the length of the string.

- -

Examples

-

Basic usage:

- -
-let len = "foo".len();
-assert_eq!(3, len);
-
-let len = "ƒoo".len(); // fancy f!
-assert_eq!(4, len);
-

fn is_empty(&self) -> bool1.0.0

-

Returns true if this slice has a length of zero bytes.

- -

Examples

-

Basic usage:

- -
-let s = "";
-assert!(s.is_empty());
-
-let s = "not empty";
-assert!(!s.is_empty());
-

fn is_char_boundary(&self, index: usize) -> bool1.9.0

-

Checks that index-th byte lies at the start and/or end of a -UTF-8 code point sequence.

- -

The start and end of the string (when index == self.len()) are -considered to be -boundaries.

- -

Returns false if index is greater than self.len().

- -

Examples

-
-let s = "Löwe 老虎 Léopard";
-assert!(s.is_char_boundary(0));
-// start of `老`
-assert!(s.is_char_boundary(6));
-assert!(s.is_char_boundary(s.len()));
-
-// second byte of `ö`
-assert!(!s.is_char_boundary(2));
-
-// third byte of `老`
-assert!(!s.is_char_boundary(8));
-

fn as_bytes(&self) -> &[u8]1.0.0

-

Converts a string slice to a byte slice.

- -

Examples

-

Basic usage:

- -
-let bytes = "bors".as_bytes();
-assert_eq!(b"bors", bytes);
-

fn as_ptr(&self) -> *const u81.0.0

-

Converts a string slice to a raw pointer.

- -

As string slices are a slice of bytes, the raw pointer points to a -u8. This pointer will be pointing to the first byte of the string -slice.

- -

Examples

-

Basic usage:

- -
-let s = "Hello";
-let ptr = s.as_ptr();
-

unsafe fn slice_unchecked(&self, begin: usize, end: usize) -> &str1.0.0

-

Creates a string slice from another string slice, bypassing safety -checks.

- -

This new slice goes from begin to end, including begin but -excluding end.

- -

To get a mutable string slice instead, see the -slice_mut_unchecked() method.

- -

Safety

-

Callers of this function are responsible that three preconditions are -satisfied:

- -
    -
  • begin must come before end.
    • -
  • begin and end must be byte positions within the string slice.
    • -
  • begin and end must lie on UTF-8 sequence boundaries.
    • -
- -

Examples

-

Basic usage:

- -
-let s = "Löwe 老虎 Léopard";
-
-unsafe {
-    assert_eq!("Löwe 老虎 Léopard", s.slice_unchecked(0, 21));
-}
-
-let s = "Hello, world!";
-
-unsafe {
-    assert_eq!("world", s.slice_unchecked(7, 12));
-}
-

unsafe fn slice_mut_unchecked(&mut self, begin: usize, end: usize) -> &mut str1.5.0

-

Creates a string slice from another string slice, bypassing safety -checks.

- -

This new slice goes from begin to end, including begin but -excluding end.

- -

To get an immutable string slice instead, see the -slice_unchecked() method.

- -

Safety

-

Callers of this function are responsible that three preconditions are -satisfied:

- -
    -
  • begin must come before end.
    • -
  • begin and end must be byte positions within the string slice.
    • -
  • begin and end must lie on UTF-8 sequence boundaries.
    • -
-

fn char_range_at(&self, start: usize) -> CharRange

-
Deprecated since 1.9.0

: use slicing plus chars() plus len_utf8

-
Unstable (str_char)

: use slicing plus chars() plus len_utf8

-

Given a byte position, returns the next char and its index.

- -

Panics

-

If i is greater than or equal to the length of the string. -If i is not the index of the beginning of a valid UTF-8 sequence.

- -

Examples

-

This example manually iterates through the code points of a string; -this should normally be -done by .chars() or .char_indices().

- -
-#![feature(str_char)]
-#![allow(deprecated)]
-
-use std::str::CharRange;
-
-let s = "中华Việt Nam";
-let mut i = 0;
-while i < s.len() {
-    let CharRange {ch, next} = s.char_range_at(i);
-    println!("{}: {}", i, ch);
-    i = next;
-}
- -

This outputs:

- -
0: 中
-3: 华
-6: V
-7: i
-8: e
-9:
-11:
-13: t
-14:
-15: N
-16: a
-17: m
-
-

fn char_range_at_reverse(&self, start: usize) -> CharRange

-
Deprecated since 1.9.0

: use slicing plus chars().rev() plus len_utf8

-
Unstable (str_char)

: use slicing plus chars().rev() plus len_utf8

-

Given a byte position, returns the previous char and its position.

- -

Note that Unicode has many features, such as combining marks, ligatures, -and direction marks, that need to be taken into account to correctly reverse a string.

- -

Returns 0 for next index if called on start index 0.

- -

Panics

-

If i is greater than the length of the string. -If i is not an index following a valid UTF-8 sequence.

- -

Examples

-

This example manually iterates through the code points of a string; -this should normally be -done by .chars().rev() or .char_indices().

- -
-#![feature(str_char)]
-#![allow(deprecated)]
-
-use std::str::CharRange;
-
-let s = "中华Việt Nam";
-let mut i = s.len();
-while i > 0 {
-    let CharRange {ch, next} = s.char_range_at_reverse(i);
-    println!("{}: {}", i, ch);
-    i = next;
-}
- -

This outputs:

- -
18: m
-17: a
-16: N
-15:
-14: t
-13:
-11:
-9: e
-8: i
-7: V
-6: 华
-3: 中
-
-

fn char_at(&self, i: usize) -> char

-
Deprecated since 1.9.0

: use slicing plus chars()

-
Unstable (str_char)

: use slicing plus chars()

-

Given a byte position, returns the char at that position.

- -

Panics

-

If i is greater than or equal to the length of the string. -If i is not the index of the beginning of a valid UTF-8 sequence.

- -

Examples

-
-#![feature(str_char)]
-#![allow(deprecated)]
-
-let s = "abπc";
-assert_eq!(s.char_at(1), 'b');
-assert_eq!(s.char_at(2), 'π');
-assert_eq!(s.char_at(4), 'c');
-

fn char_at_reverse(&self, i: usize) -> char

-
Deprecated since 1.9.0

: use slicing plus chars().rev()

-
Unstable (str_char)

: use slicing plus chars().rev()

-

Given a byte position, returns the char at that position, counting -from the end.

- -

Panics

-

If i is greater than the length of the string. -If i is not an index following a valid UTF-8 sequence.

- -

Examples

-
-#![feature(str_char)]
-#![allow(deprecated)]
-
-let s = "abπc";
-assert_eq!(s.char_at_reverse(1), 'a');
-assert_eq!(s.char_at_reverse(2), 'b');
-assert_eq!(s.char_at_reverse(3), 'π');
-

fn slice_shift_char(&self) -> Option<(char, &str)>

-
Deprecated since 1.9.0

: use chars() plus Chars::as_str

-
Unstable (str_char)

: use chars() plus Chars::as_str

-

Retrieves the first char from a &str and returns it.

- -

Note that a single Unicode character (grapheme cluster) -can be composed of multiple chars.

- -

This does not allocate a new string; instead, it returns a slice that -points one code point beyond the code point that was shifted.

- -

None is returned if the slice is empty.

- -

Examples

-
-#![feature(str_char)]
-#![allow(deprecated)]
-
-let s = "Łódź"; // \u{141}o\u{301}dz\u{301}
-let (c, s1) = s.slice_shift_char().unwrap();
-
-assert_eq!(c, 'Ł');
-assert_eq!(s1, "ódź");
-
-let (c, s2) = s1.slice_shift_char().unwrap();
-
-assert_eq!(c, 'o');
-assert_eq!(s2, "\u{301}dz\u{301}");
-

fn split_at(&self, mid: usize) -> (&str, &str)1.4.0

-

Divide one string slice into two at an index.

- -

The argument, mid, should be a byte offset from the start of the -string. It must also be on the boundary of a UTF-8 code point.

- -

The two slices returned go from the start of the string slice to mid, -and from mid to the end of the string slice.

- -

To get mutable string slices instead, see the split_at_mut() -method.

- -

Panics

-

Panics if mid is not on a UTF-8 code point boundary, or if it is -beyond the last code point of the string slice.

- -

Examples

-

Basic usage:

- -
-let s = "Per Martin-Löf";
-
-let (first, last) = s.split_at(3);
-
-assert_eq!("Per", first);
-assert_eq!(" Martin-Löf", last);
-

fn split_at_mut(&mut self, mid: usize) -> (&mut str, &mut str)1.4.0

-

Divide one mutable string slice into two at an index.

- -

The argument, mid, should be a byte offset from the start of the -string. It must also be on the boundary of a UTF-8 code point.

- -

The two slices returned go from the start of the string slice to mid, -and from mid to the end of the string slice.

- -

To get immutable string slices instead, see the split_at() method.

- -

Panics

-

Panics if mid is not on a UTF-8 code point boundary, or if it is -beyond the last code point of the string slice.

- -

Examples

-

Basic usage:

- -
-let mut s = "Per Martin-Löf".to_string();
-
-let (first, last) = s.split_at_mut(3);
-
-assert_eq!("Per", first);
-assert_eq!(" Martin-Löf", last);
-

fn chars(&self) -> Chars1.0.0

-

Returns an iterator over the chars of a string slice.

- -

As a string slice consists of valid UTF-8, we can iterate through a -string slice by char. This method returns such an iterator.

- -

It's important to remember that char represents a Unicode Scalar -Value, and may not match your idea of what a 'character' is. Iteration -over grapheme clusters may be what you actually want.

- -

Examples

-

Basic usage:

- -
-let word = "goodbye";
-
-let count = word.chars().count();
-assert_eq!(7, count);
-
-let mut chars = word.chars();
-
-assert_eq!(Some('g'), chars.next());
-assert_eq!(Some('o'), chars.next());
-assert_eq!(Some('o'), chars.next());
-assert_eq!(Some('d'), chars.next());
-assert_eq!(Some('b'), chars.next());
-assert_eq!(Some('y'), chars.next());
-assert_eq!(Some('e'), chars.next());
-
-assert_eq!(None, chars.next());
- -

Remember, chars may not match your human intuition about characters:

- -
-let y = "y̆";
-
-let mut chars = y.chars();
-
-assert_eq!(Some('y'), chars.next()); // not 'y̆'
-assert_eq!(Some('\u{0306}'), chars.next());
-
-assert_eq!(None, chars.next());
-

fn char_indices(&self) -> CharIndices1.0.0

-

Returns an iterator over the chars of a string slice, and their -positions.

- -

As a string slice consists of valid UTF-8, we can iterate through a -string slice by char. This method returns an iterator of both -these chars, as well as their byte positions.

- -

The iterator yields tuples. The position is first, the char is -second.

- -

Examples

-

Basic usage:

- -
-let word = "goodbye";
-
-let count = word.char_indices().count();
-assert_eq!(7, count);
-
-let mut char_indices = word.char_indices();
-
-assert_eq!(Some((0, 'g')), char_indices.next());
-assert_eq!(Some((1, 'o')), char_indices.next());
-assert_eq!(Some((2, 'o')), char_indices.next());
-assert_eq!(Some((3, 'd')), char_indices.next());
-assert_eq!(Some((4, 'b')), char_indices.next());
-assert_eq!(Some((5, 'y')), char_indices.next());
-assert_eq!(Some((6, 'e')), char_indices.next());
-
-assert_eq!(None, char_indices.next());
- -

Remember, chars may not match your human intuition about characters:

- -
-let y = "y̆";
-
-let mut char_indices = y.char_indices();
-
-assert_eq!(Some((0, 'y')), char_indices.next()); // not (0, 'y̆')
-assert_eq!(Some((1, '\u{0306}')), char_indices.next());
-
-assert_eq!(None, char_indices.next());
-

fn bytes(&self) -> Bytes1.0.0

-

An iterator over the bytes of a string slice.

- -

As a string slice consists of a sequence of bytes, we can iterate -through a string slice by byte. This method returns such an iterator.

- -

Examples

-

Basic usage:

- -
-let mut bytes = "bors".bytes();
-
-assert_eq!(Some(b'b'), bytes.next());
-assert_eq!(Some(b'o'), bytes.next());
-assert_eq!(Some(b'r'), bytes.next());
-assert_eq!(Some(b's'), bytes.next());
-
-assert_eq!(None, bytes.next());
-

fn split_whitespace(&self) -> SplitWhitespace1.1.0

-

Split a string slice by whitespace.

- -

The iterator returned will return string slices that are sub-slices of -the original string slice, separated by any amount of whitespace.

- -

'Whitespace' is defined according to the terms of the Unicode Derived -Core Property White_Space.

- -

Examples

-

Basic usage:

- -
-let mut iter = "A few words".split_whitespace();
-
-assert_eq!(Some("A"), iter.next());
-assert_eq!(Some("few"), iter.next());
-assert_eq!(Some("words"), iter.next());
-
-assert_eq!(None, iter.next());
- -

All kinds of whitespace are considered:

- -
-let mut iter = " Mary   had\ta\u{2009}little  \n\t lamb".split_whitespace();
-assert_eq!(Some("Mary"), iter.next());
-assert_eq!(Some("had"), iter.next());
-assert_eq!(Some("a"), iter.next());
-assert_eq!(Some("little"), iter.next());
-assert_eq!(Some("lamb"), iter.next());
-
-assert_eq!(None, iter.next());
-

fn lines(&self) -> Lines1.0.0

-

An iterator over the lines of a string, as string slices.

- -

Lines are ended with either a newline (\n) or a carriage return with -a line feed (\r\n).

- -

The final line ending is optional.

- -

Examples

-

Basic usage:

- -
-let text = "foo\r\nbar\n\nbaz\n";
-let mut lines = text.lines();
-
-assert_eq!(Some("foo"), lines.next());
-assert_eq!(Some("bar"), lines.next());
-assert_eq!(Some(""), lines.next());
-assert_eq!(Some("baz"), lines.next());
-
-assert_eq!(None, lines.next());
- -

The final line ending isn't required:

- -
-let text = "foo\nbar\n\r\nbaz";
-let mut lines = text.lines();
-
-assert_eq!(Some("foo"), lines.next());
-assert_eq!(Some("bar"), lines.next());
-assert_eq!(Some(""), lines.next());
-assert_eq!(Some("baz"), lines.next());
-
-assert_eq!(None, lines.next());
-

fn lines_any(&self) -> LinesAny1.0.0

-
Deprecated since 1.4.0

: use lines() instead now

-

An iterator over the lines of a string.

-

fn utf16_units(&self) -> EncodeUtf16

-
Deprecated since 1.8.0

: renamed to encode_utf16

-
Unstable (str_utf16)

: renamed to encode_utf16

-

Returns an iterator of u16 over the string encoded as UTF-16.

-

fn encode_utf16(&self) -> EncodeUtf161.8.0

-

Returns an iterator of u16 over the string encoded as UTF-16.

-

fn contains<'a, P>(&'a self, pat: P) -> bool where P: Pattern<'a>1.0.0

-

Returns true if the given pattern matches a sub-slice of -this string slice.

- -

Returns false if it does not.

- -

Examples

-

Basic usage:

- -
-let bananas = "bananas";
-
-assert!(bananas.contains("nana"));
-assert!(!bananas.contains("apples"));
-

fn starts_with<'a, P>(&'a self, pat: P) -> bool where P: Pattern<'a>1.0.0

-

Returns true if the given pattern matches a prefix of this -string slice.

- -

Returns false if it does not.

- -

Examples

-

Basic usage:

- -
-let bananas = "bananas";
-
-assert!(bananas.starts_with("bana"));
-assert!(!bananas.starts_with("nana"));
-

fn ends_with<'a, P>(&'a self, pat: P) -> bool where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>1.0.0

-

Returns true if the given pattern matches a suffix of this -string slice.

- -

Returns false if it does not.

- -

Examples

-

Basic usage:

- -
-let bananas = "bananas";
-
-assert!(bananas.ends_with("anas"));
-assert!(!bananas.ends_with("nana"));
-

fn find<'a, P>(&'a self, pat: P) -> Option<usize> where P: Pattern<'a>1.0.0

-

Returns the byte index of the first character of this string slice that -matches the pattern.

- -

Returns None if the pattern doesn't match.

- -

The pattern can be a &str, char, or a closure that determines if -a character matches.

- -

Examples

-

Simple patterns:

- -
-let s = "Löwe 老虎 Léopard";
-
-assert_eq!(s.find('L'), Some(0));
-assert_eq!(s.find('é'), Some(14));
-assert_eq!(s.find("Léopard"), Some(13));
- -

More complex patterns with closures:

- -
-let s = "Löwe 老虎 Léopard";
-
-assert_eq!(s.find(char::is_whitespace), Some(5));
-assert_eq!(s.find(char::is_lowercase), Some(1));
- -

Not finding the pattern:

- -
-let s = "Löwe 老虎 Léopard";
-let x: &[_] = &['1', '2'];
-
-assert_eq!(s.find(x), None);
-

fn rfind<'a, P>(&'a self, pat: P) -> Option<usize> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>1.0.0

-

Returns the byte index of the last character of this string slice that -matches the pattern.

- -

Returns None if the pattern doesn't match.

- -

The pattern can be a &str, char, or a closure that determines if -a character matches.

- -

Examples

-

Simple patterns:

- -
-let s = "Löwe 老虎 Léopard";
-
-assert_eq!(s.rfind('L'), Some(13));
-assert_eq!(s.rfind('é'), Some(14));
- -

More complex patterns with closures:

- -
-let s = "Löwe 老虎 Léopard";
-
-assert_eq!(s.rfind(char::is_whitespace), Some(12));
-assert_eq!(s.rfind(char::is_lowercase), Some(20));
- -

Not finding the pattern:

- -
-let s = "Löwe 老虎 Léopard";
-let x: &[_] = &['1', '2'];
-
-assert_eq!(s.rfind(x), None);
-

fn split<'a, P>(&'a self, pat: P) -> Split<'a, P> where P: Pattern<'a>1.0.0

-

An iterator over substrings of this string slice, separated by -characters matched by a pattern.

- -

The pattern can be a &str, char, or a closure that determines the -split.

- -

Iterator behavior

-

The returned iterator will be a DoubleEndedIterator if the pattern -allows a reverse search and forward/reverse search yields the same -elements. This is true for, eg, char but not for &str.

- -

If the pattern allows a reverse search but its results might differ -from a forward search, the rsplit() method can be used.

- -

Examples

-

Simple patterns:

- -
-let v: Vec<&str> = "Mary had a little lamb".split(' ').collect();
-assert_eq!(v, ["Mary", "had", "a", "little", "lamb"]);
-
-let v: Vec<&str> = "".split('X').collect();
-assert_eq!(v, [""]);
-
-let v: Vec<&str> = "lionXXtigerXleopard".split('X').collect();
-assert_eq!(v, ["lion", "", "tiger", "leopard"]);
-
-let v: Vec<&str> = "lion::tiger::leopard".split("::").collect();
-assert_eq!(v, ["lion", "tiger", "leopard"]);
-
-let v: Vec<&str> = "abc1def2ghi".split(char::is_numeric).collect();
-assert_eq!(v, ["abc", "def", "ghi"]);
-
-let v: Vec<&str> = "lionXtigerXleopard".split(char::is_uppercase).collect();
-assert_eq!(v, ["lion", "tiger", "leopard"]);
- -

A more complex pattern, using a closure:

- -
-let v: Vec<&str> = "abc1defXghi".split(|c| c == '1' || c == 'X').collect();
-assert_eq!(v, ["abc", "def", "ghi"]);
- -

If a string contains multiple contiguous separators, you will end up -with empty strings in the output:

- -
-let x = "||||a||b|c".to_string();
-let d: Vec<_> = x.split('|').collect();
-
-assert_eq!(d, &["", "", "", "", "a", "", "b", "c"]);
- -

This can lead to possibly surprising behavior when whitespace is used -as the separator. This code is correct:

- -
-let x = "    a  b c".to_string();
-let d: Vec<_> = x.split(' ').collect();
-
-assert_eq!(d, &["", "", "", "", "a", "", "b", "c"]);
- -

It does not give you:

- -
-assert_eq!(d, &["a", "b", "c"]);
- -

Use split_whitespace() for this behavior.

-

fn rsplit<'a, P>(&'a self, pat: P) -> RSplit<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>1.0.0

-

An iterator over substrings of the given string slice, separated by -characters matched by a pattern and yielded in reverse order.

- -

The pattern can be a &str, char, or a closure that determines the -split.

- -

Iterator behavior

-

The returned iterator requires that the pattern supports a reverse -search, and it will be a DoubleEndedIterator if a forward/reverse -search yields the same elements.

- -

For iterating from the front, the split() method can be used.

- -

Examples

-

Simple patterns:

- -
-let v: Vec<&str> = "Mary had a little lamb".rsplit(' ').collect();
-assert_eq!(v, ["lamb", "little", "a", "had", "Mary"]);
-
-let v: Vec<&str> = "".rsplit('X').collect();
-assert_eq!(v, [""]);
-
-let v: Vec<&str> = "lionXXtigerXleopard".rsplit('X').collect();
-assert_eq!(v, ["leopard", "tiger", "", "lion"]);
-
-let v: Vec<&str> = "lion::tiger::leopard".rsplit("::").collect();
-assert_eq!(v, ["leopard", "tiger", "lion"]);
- -

A more complex pattern, using a closure:

- -
-let v: Vec<&str> = "abc1defXghi".rsplit(|c| c == '1' || c == 'X').collect();
-assert_eq!(v, ["ghi", "def", "abc"]);
-

fn split_terminator<'a, P>(&'a self, pat: P) -> SplitTerminator<'a, P> where P: Pattern<'a>1.0.0

-

An iterator over substrings of the given string slice, separated by -characters matched by a pattern.

- -

The pattern can be a &str, char, or a closure that determines the -split.

- -

Equivalent to split(), except that the trailing substring -is skipped if empty.

- -

This method can be used for string data that is terminated, -rather than separated by a pattern.

- -

Iterator behavior

-

The returned iterator will be a DoubleEndedIterator if the pattern -allows a reverse search and forward/reverse search yields the same -elements. This is true for, eg, char but not for &str.

- -

If the pattern allows a reverse search but its results might differ -from a forward search, the rsplit_terminator() method can be used.

- -

Examples

-

Basic usage:

- -
-let v: Vec<&str> = "A.B.".split_terminator('.').collect();
-assert_eq!(v, ["A", "B"]);
-
-let v: Vec<&str> = "A..B..".split_terminator(".").collect();
-assert_eq!(v, ["A", "", "B", ""]);
-

fn rsplit_terminator<'a, P>(&'a self, pat: P) -> RSplitTerminator<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>1.0.0

-

An iterator over substrings of self, separated by characters -matched by a pattern and yielded in reverse order.

- -

The pattern can be a simple &str, char, or a closure that -determines the split. -Additional libraries might provide more complex patterns like -regular expressions.

- -

Equivalent to split(), except that the trailing substring is -skipped if empty.

- -

This method can be used for string data that is terminated, -rather than separated by a pattern.

- -

Iterator behavior

-

The returned iterator requires that the pattern supports a -reverse search, and it will be double ended if a forward/reverse -search yields the same elements.

- -

For iterating from the front, the split_terminator() method can be -used.

- -

Examples

-
-let v: Vec<&str> = "A.B.".rsplit_terminator('.').collect();
-assert_eq!(v, ["B", "A"]);
-
-let v: Vec<&str> = "A..B..".rsplit_terminator(".").collect();
-assert_eq!(v, ["", "B", "", "A"]);
-

fn splitn<'a, P>(&'a self, count: usize, pat: P) -> SplitN<'a, P> where P: Pattern<'a>1.0.0

-

An iterator over substrings of the given string slice, separated by a -pattern, restricted to returning at most count items.

- -

The last element returned, if any, will contain the remainder of the -string slice.

- -

The pattern can be a &str, char, or a closure that determines the -split.

- -

Iterator behavior

-

The returned iterator will not be double ended, because it is -not efficient to support.

- -

If the pattern allows a reverse search, the rsplitn() method can be -used.

- -

Examples

-

Simple patterns:

- -
-let v: Vec<&str> = "Mary had a little lambda".splitn(3, ' ').collect();
-assert_eq!(v, ["Mary", "had", "a little lambda"]);
-
-let v: Vec<&str> = "lionXXtigerXleopard".splitn(3, "X").collect();
-assert_eq!(v, ["lion", "", "tigerXleopard"]);
-
-let v: Vec<&str> = "abcXdef".splitn(1, 'X').collect();
-assert_eq!(v, ["abcXdef"]);
-
-let v: Vec<&str> = "".splitn(1, 'X').collect();
-assert_eq!(v, [""]);
- -

A more complex pattern, using a closure:

- -
-let v: Vec<&str> = "abc1defXghi".splitn(2, |c| c == '1' || c == 'X').collect();
-assert_eq!(v, ["abc", "defXghi"]);
-

fn rsplitn<'a, P>(&'a self, count: usize, pat: P) -> RSplitN<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>1.0.0

-

An iterator over substrings of this string slice, separated by a -pattern, starting from the end of the string, restricted to returning -at most count items.

- -

The last element returned, if any, will contain the remainder of the -string slice.

- -

The pattern can be a &str, char, or a closure that -determines the split.

- -

Iterator behavior

-

The returned iterator will not be double ended, because it is not -efficient to support.

- -

For splitting from the front, the splitn() method can be used.

- -

Examples

-

Simple patterns:

- -
-let v: Vec<&str> = "Mary had a little lamb".rsplitn(3, ' ').collect();
-assert_eq!(v, ["lamb", "little", "Mary had a"]);
-
-let v: Vec<&str> = "lionXXtigerXleopard".rsplitn(3, 'X').collect();
-assert_eq!(v, ["leopard", "tiger", "lionX"]);
-
-let v: Vec<&str> = "lion::tiger::leopard".rsplitn(2, "::").collect();
-assert_eq!(v, ["leopard", "lion::tiger"]);
- -

A more complex pattern, using a closure:

- -
-let v: Vec<&str> = "abc1defXghi".rsplitn(2, |c| c == '1' || c == 'X').collect();
-assert_eq!(v, ["ghi", "abc1def"]);
-

fn matches<'a, P>(&'a self, pat: P) -> Matches<'a, P> where P: Pattern<'a>1.2.0

-

An iterator over the matches of a pattern within the given string -slice.

- -

The pattern can be a &str, char, or a closure that -determines if a character matches.

- -

Iterator behavior

-

The returned iterator will be a DoubleEndedIterator if the pattern -allows a reverse search and forward/reverse search yields the same -elements. This is true for, eg, char but not for &str.

- -

If the pattern allows a reverse search but its results might differ -from a forward search, the rmatches() method can be used.

- -

Examples

-

Basic usage:

- -
-let v: Vec<&str> = "abcXXXabcYYYabc".matches("abc").collect();
-assert_eq!(v, ["abc", "abc", "abc"]);
-
-let v: Vec<&str> = "1abc2abc3".matches(char::is_numeric).collect();
-assert_eq!(v, ["1", "2", "3"]);
-

fn rmatches<'a, P>(&'a self, pat: P) -> RMatches<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>1.2.0

-

An iterator over the matches of a pattern within this string slice, -yielded in reverse order.

- -

The pattern can be a &str, char, or a closure that determines if -a character matches.

- -

Iterator behavior

-

The returned iterator requires that the pattern supports a reverse -search, and it will be a DoubleEndedIterator if a forward/reverse -search yields the same elements.

- -

For iterating from the front, the matches() method can be used.

- -

Examples

-

Basic usage:

- -
-let v: Vec<&str> = "abcXXXabcYYYabc".rmatches("abc").collect();
-assert_eq!(v, ["abc", "abc", "abc"]);
-
-let v: Vec<&str> = "1abc2abc3".rmatches(char::is_numeric).collect();
-assert_eq!(v, ["3", "2", "1"]);
-

fn match_indices<'a, P>(&'a self, pat: P) -> MatchIndices<'a, P> where P: Pattern<'a>1.5.0

-

An iterator over the disjoint matches of a pattern within this string -slice as well as the index that the match starts at.

- -

For matches of pat within self that overlap, only the indices -corresponding to the first match are returned.

- -

The pattern can be a &str, char, or a closure that determines -if a character matches.

- -

Iterator behavior

-

The returned iterator will be a DoubleEndedIterator if the pattern -allows a reverse search and forward/reverse search yields the same -elements. This is true for, eg, char but not for &str.

- -

If the pattern allows a reverse search but its results might differ -from a forward search, the rmatch_indices() method can be used.

- -

Examples

-

Basic usage:

- -
-let v: Vec<_> = "abcXXXabcYYYabc".match_indices("abc").collect();
-assert_eq!(v, [(0, "abc"), (6, "abc"), (12, "abc")]);
-
-let v: Vec<_> = "1abcabc2".match_indices("abc").collect();
-assert_eq!(v, [(1, "abc"), (4, "abc")]);
-
-let v: Vec<_> = "ababa".match_indices("aba").collect();
-assert_eq!(v, [(0, "aba")]); // only the first `aba`
-

fn rmatch_indices<'a, P>(&'a self, pat: P) -> RMatchIndices<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>1.5.0

-

An iterator over the disjoint matches of a pattern within self, -yielded in reverse order along with the index of the match.

- -

For matches of pat within self that overlap, only the indices -corresponding to the last match are returned.

- -

The pattern can be a &str, char, or a closure that determines if a -character matches.

- -

Iterator behavior

-

The returned iterator requires that the pattern supports a reverse -search, and it will be a DoubleEndedIterator if a forward/reverse -search yields the same elements.

- -

For iterating from the front, the match_indices() method can be used.

- -

Examples

-

Basic usage:

- -
-let v: Vec<_> = "abcXXXabcYYYabc".rmatch_indices("abc").collect();
-assert_eq!(v, [(12, "abc"), (6, "abc"), (0, "abc")]);
-
-let v: Vec<_> = "1abcabc2".rmatch_indices("abc").collect();
-assert_eq!(v, [(4, "abc"), (1, "abc")]);
-
-let v: Vec<_> = "ababa".rmatch_indices("aba").collect();
-assert_eq!(v, [(2, "aba")]); // only the last `aba`
-

fn trim(&self) -> &str1.0.0

-

Returns a string slice with leading and trailing whitespace removed.

- -

'Whitespace' is defined according to the terms of the Unicode Derived -Core Property White_Space.

- -

Examples

-

Basic usage:

- -
-let s = " Hello\tworld\t";
-
-assert_eq!("Hello\tworld", s.trim());
-

fn trim_left(&self) -> &str1.0.0

-

Returns a string slice with leading whitespace removed.

- -

'Whitespace' is defined according to the terms of the Unicode Derived -Core Property White_Space.

- -

Text directionality

-

A string is a sequence of bytes. 'Left' in this context means the first -position of that byte string; for a language like Arabic or Hebrew -which are 'right to left' rather than 'left to right', this will be -the right side, not the left.

- -

Examples

-

Basic usage:

- -
-let s = " Hello\tworld\t";
-
-assert_eq!("Hello\tworld\t", s.trim_left());
- -

Directionality:

- -
-let s = "  English";
-assert!(Some('E') == s.trim_left().chars().next());
-
-let s = "  עברית";
-assert!(Some('ע') == s.trim_left().chars().next());
-

fn trim_right(&self) -> &str1.0.0

-

Returns a string slice with trailing whitespace removed.

- -

'Whitespace' is defined according to the terms of the Unicode Derived -Core Property White_Space.

- -

Text directionality

-

A string is a sequence of bytes. 'Right' in this context means the last -position of that byte string; for a language like Arabic or Hebrew -which are 'right to left' rather than 'left to right', this will be -the left side, not the right.

- -

Examples

-

Basic usage:

- -
-let s = " Hello\tworld\t";
-
-assert_eq!(" Hello\tworld", s.trim_right());
- -

Directionality:

- -
-let s = "English  ";
-assert!(Some('h') == s.trim_right().chars().rev().next());
-
-let s = "עברית  ";
-assert!(Some('ת') == s.trim_right().chars().rev().next());
-

fn trim_matches<'a, P>(&'a self, pat: P) -> &'a str where P: Pattern<'a>, P::Searcher: DoubleEndedSearcher<'a>1.0.0

-

Returns a string slice with all prefixes and suffixes that match a -pattern repeatedly removed.

- -

The pattern can be a &str, char, or a closure that determines -if a character matches.

- -

Examples

-

Simple patterns:

- -
-assert_eq!("11foo1bar11".trim_matches('1'), "foo1bar");
-assert_eq!("123foo1bar123".trim_matches(char::is_numeric), "foo1bar");
-
-let x: &[_] = &['1', '2'];
-assert_eq!("12foo1bar12".trim_matches(x), "foo1bar");
- -

A more complex pattern, using a closure:

- -
-assert_eq!("1foo1barXX".trim_matches(|c| c == '1' || c == 'X'), "foo1bar");
-

fn trim_left_matches<'a, P>(&'a self, pat: P) -> &'a str where P: Pattern<'a>1.0.0

-

Returns a string slice with all prefixes that match a pattern -repeatedly removed.

- -

The pattern can be a &str, char, or a closure that determines if -a character matches.

- -

Text directionality

-

A string is a sequence of bytes. 'Left' in this context means the first -position of that byte string; for a language like Arabic or Hebrew -which are 'right to left' rather than 'left to right', this will be -the right side, not the left.

- -

Examples

-

Basic usage:

- -
-assert_eq!("11foo1bar11".trim_left_matches('1'), "foo1bar11");
-assert_eq!("123foo1bar123".trim_left_matches(char::is_numeric), "foo1bar123");
-
-let x: &[_] = &['1', '2'];
-assert_eq!("12foo1bar12".trim_left_matches(x), "foo1bar12");
-

fn trim_right_matches<'a, P>(&'a self, pat: P) -> &'a str where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>1.0.0

-

Returns a string slice with all suffixes that match a pattern -repeatedly removed.

- -

The pattern can be a &str, char, or a closure that -determines if a character matches.

- -

Text directionality

-

A string is a sequence of bytes. 'Right' in this context means the last -position of that byte string; for a language like Arabic or Hebrew -which are 'right to left' rather than 'left to right', this will be -the left side, not the right.

- -

Examples

-

Simple patterns:

- -
-assert_eq!("11foo1bar11".trim_right_matches('1'), "11foo1bar");
-assert_eq!("123foo1bar123".trim_right_matches(char::is_numeric), "123foo1bar");
-
-let x: &[_] = &['1', '2'];
-assert_eq!("12foo1bar12".trim_right_matches(x), "12foo1bar");
- -

A more complex pattern, using a closure:

- -
-assert_eq!("1fooX".trim_left_matches(|c| c == '1' || c == 'X'), "fooX");
-

fn parse<F>(&self) -> Result<F, F::Err> where F: FromStr1.0.0

-

Parses this string slice into another type.

- -

Because parse() is so general, it can cause problems with type -inference. As such, parse() is one of the few times you'll see -the syntax affectionately known as the 'turbofish': ::<>. This -helps the inference algorithm understand specifically which type -you're trying to parse into.

- -

parse() can parse any type that implements the FromStr trait.

- -

Errors

-

Will return Err if it's not possible to parse this string slice into -the desired type.

- -

Example

-

Basic usage

- -
-let four: u32 = "4".parse().unwrap();
-
-assert_eq!(4, four);
- -

Using the 'turbofish' instead of annotating four:

- -
-let four = "4".parse::<u32>();
-
-assert_eq!(Ok(4), four);
- -

Failing to parse:

- -
-let nope = "j".parse::<u32>();
-
-assert!(nope.is_err());
-

fn replace<'a, P>(&'a self, from: P, to: &str) -> String where P: Pattern<'a>1.0.0

-

Replaces all matches of a pattern with another string.

- -

replace creates a new String, and copies the data from this string slice into it. -While doing so, it attempts to find matches of a pattern. If it finds any, it -replaces them with the replacement string slice.

- -

Examples

-

Basic usage:

- -
-let s = "this is old";
-
-assert_eq!("this is new", s.replace("old", "new"));
- -

When the pattern doesn't match:

- -
-let s = "this is old";
-assert_eq!(s, s.replace("cookie monster", "little lamb"));
-

fn to_lowercase(&self) -> String1.2.0

-

Returns the lowercase equivalent of this string slice, as a new String.

- -

'Lowercase' is defined according to the terms of the Unicode Derived Core Property -Lowercase.

- -

Examples

-

Basic usage:

- -
-let s = "HELLO";
-
-assert_eq!("hello", s.to_lowercase());
- -

A tricky example, with sigma:

- -
-let sigma = "Σ";
-
-assert_eq!("σ", sigma.to_lowercase());
-
-// but at the end of a word, it's ς, not σ:
-let odysseus = "ὈΔΥΣΣΕΎΣ";
-
-assert_eq!("ὀδυσσεύς", odysseus.to_lowercase());
- -

Languages without case are not changed:

- -
-let new_year = "农历新年";
-
-assert_eq!(new_year, new_year.to_lowercase());
-

fn to_uppercase(&self) -> String1.2.0

-

Returns the uppercase equivalent of this string slice, as a new String.

- -

'Uppercase' is defined according to the terms of the Unicode Derived Core Property -Uppercase.

- -

Examples

-

Basic usage:

- -
-let s = "hello";
-
-assert_eq!("HELLO", s.to_uppercase());
- -

Scripts without case are not changed:

- -
-let new_year = "农历新年";
-
-assert_eq!(new_year, new_year.to_uppercase());
-

fn escape_default(&self) -> String

-
Unstable (str_escape)

: return type may change to be an iterator

-

Escapes each char in s with char::escape_default.

-

fn escape_unicode(&self) -> String

-
Unstable (str_escape)

: return type may change to be an iterator

-

Escapes each char in s with char::escape_unicode.

-

fn into_string(self: Box<str>) -> String1.4.0

-

Converts a Box<str> into a String without copying or allocating.

- -

Examples

-

Basic usage:

- -
-let string = String::from("birthday gift");
-let boxed_str = string.clone().into_boxed_str();
-
-assert_eq!(boxed_str.into_string(), string);
-

Trait Implementations

impl<'a> Display for ANSIString<'a>

fn fmt(&self, f: &mut Formatter) -> Result

-

impl<'a, S> From<S> for ANSIString<'a> where S: Into<Cow<'a, str>>

fn from(input: S) -> ANSIString<'a>

-

impl<'a> Deref for ANSIString<'a>

type Target = str

-

fn deref(&self) -> &str

-

Derived Implementations

impl<'a> Clone for ANSIString<'a>

fn clone(&self) -> ANSIString<'a>

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<'a> Debug for ANSIString<'a>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-

impl<'a> PartialEq for ANSIString<'a>

fn eq(&self, __arg_0: &ANSIString<'a>) -> bool

-

fn ne(&self, __arg_0: &ANSIString<'a>) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/ansi_term/struct.ANSIStrings.html b/doc/ansi_term/struct.ANSIStrings.html deleted file mode 100644 index ddc653db..00000000 --- a/doc/ansi_term/struct.ANSIStrings.html +++ /dev/null @@ -1,115 +0,0 @@ - - - - - - - - - - ansi_term::ANSIStrings - Rust - - - - - - - - - - - - - - - - - -
-

Struct ansi_term::ANSIStrings - - [−] - - [src]

-
pub struct ANSIStrings<'a>(pub &'a [ANSIString<'a>]);

A set of ANSIStrings collected together, in order to be written with a -minimum of control characters.

-

Trait Implementations

impl<'a> Display for ANSIStrings<'a>

fn fmt(&self, f: &mut Formatter) -> Result

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/ansi_term/struct.Style.html b/doc/ansi_term/struct.Style.html deleted file mode 100644 index 64849067..00000000 --- a/doc/ansi_term/struct.Style.html +++ /dev/null @@ -1,142 +0,0 @@ - - - - - - - - - - ansi_term::Style - Rust - - - - - - - - - - - - - - - - - -
-

Struct ansi_term::Style - - [−] - - [src]

-
pub struct Style {
-    // some fields omitted
-}

A style is a collection of properties that can format a string -using ANSI escape codes.

-

Methods

impl Style

fn new() -> Style

-

Creates a new Style with no differences.

-

fn paint<'a, S>(self, input: S) -> ANSIString<'a> where S: Into<Cow<'a, str>>

-

Paints the given text with this colour, returning an ANSI string.

-

fn bold(&self) -> Style

-

Returns a Style with the bold property set.

-

fn dimmed(&self) -> Style

-

Returns a Style with the dimmed property set.

-

fn italic(&self) -> Style

-

Returns a Style with the italic property set.

-

fn underline(&self) -> Style

-

Returns a Style with the underline property set.

-
-

Returns a Style with the blink property set.

-

fn reverse(&self) -> Style

-

Returns a Style with the reverse property set.

-

fn hidden(&self) -> Style

-

Returns a Style with the hidden property set.

-

fn on(&self, background: Colour) -> Style

-

Returns a Style with the background colour property set.

-

Trait Implementations

impl Default for Style

fn default() -> Style

-

Derived Implementations

impl Debug for Style

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-

impl Copy for Style

impl Clone for Style

fn clone(&self) -> Style

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl PartialEq for Style

fn eq(&self, __arg_0: &Style) -> bool

-

fn ne(&self, __arg_0: &Style) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bit_vec/index.html b/doc/bit_vec/index.html deleted file mode 100644 index b2569f47..00000000 --- a/doc/bit_vec/index.html +++ /dev/null @@ -1,199 +0,0 @@ - - - - - - - - - - bit_vec - Rust - - - - - - - - - - - - - - - - - -
-

Crate bit_vec - - [−] - - [src]

-

Collections implemented with bit vectors.

- -

Examples

-

This is a simple example of the Sieve of Eratosthenes -which calculates prime numbers up to a given limit.

- -
-use bit_vec::BitVec;
-
-let max_prime = 10000;
-
-// Store the primes as a BitVec
-let primes = {
-    // Assume all numbers are prime to begin, and then we
-    // cross off non-primes progressively
-    let mut bv = BitVec::from_elem(max_prime, true);
-
-    // Neither 0 nor 1 are prime
-    bv.set(0, false);
-    bv.set(1, false);
-
-    for i in 2.. 1 + (max_prime as f64).sqrt() as usize {
-        // if i is a prime
-        if bv[i] {
-            // Mark all multiples of i as non-prime (any multiples below i * i
-            // will have been marked as non-prime previously)
-            for j in i.. {
-                if i * j >= max_prime {
-                    break;
-                }
-                bv.set(i * j, false)
-            }
-        }
-    }
-    bv
-};
-
-// Simple primality tests below our max bound
-let print_primes = 20;
-print!("The primes below {} are: ", print_primes);
-for x in 0..print_primes {
-    if primes.get(x).unwrap_or(false) {
-        print!("{} ", x);
-    }
-}
-println!("");
-
-let num_primes = primes.iter().filter(|x| *x).count();
-println!("There are {} primes below {}", num_primes, max_prime);
-assert_eq!(num_primes, 1_229);
-

Structs

- - - - - - - - - - - - - - - - -
BitVec -

The bitvector type.

-
Blocks -

An iterator over the blocks of a BitVec.

-
IntoIter - -
Iter -

An iterator for BitVec.

-

Traits

- - - - -
BitBlock -

Abstracts over a pile of bits (basically unsigned primitives)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bit_vec/sidebar-items.js b/doc/bit_vec/sidebar-items.js deleted file mode 100644 index 8de5bf7a..00000000 --- a/doc/bit_vec/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["BitVec","The bitvector type."],["Blocks","An iterator over the blocks of a `BitVec`."],["IntoIter",""],["Iter","An iterator for `BitVec`."]],"trait":[["BitBlock","Abstracts over a pile of bits (basically unsigned primitives)"]]}); \ No newline at end of file diff --git a/doc/bit_vec/struct.BitVec.html b/doc/bit_vec/struct.BitVec.html deleted file mode 100644 index d370edce..00000000 --- a/doc/bit_vec/struct.BitVec.html +++ /dev/null @@ -1,538 +0,0 @@ - - - - - - - - - - bit_vec::BitVec - Rust - - - - - - - - - - - - - - - - - -
-

Struct bit_vec::BitVec - - [−] - - [src]

-
pub struct BitVec<B = u32> {
-    // some fields omitted
-}

The bitvector type.

- -

Examples

-
-use bit_vec::BitVec;
-
-let mut bv = BitVec::from_elem(10, false);
-
-// insert all primes less than 10
-bv.set(2, true);
-bv.set(3, true);
-bv.set(5, true);
-bv.set(7, true);
-println!("{:?}", bv);
-println!("total bits set to true: {}", bv.iter().filter(|x| *x).count());
-
-// flip all values in bitvector, producing non-primes less than 10
-bv.negate();
-println!("{:?}", bv);
-println!("total bits set to true: {}", bv.iter().filter(|x| *x).count());
-
-// reset bitvector to empty
-bv.clear();
-println!("{:?}", bv);
-println!("total bits set to true: {}", bv.iter().filter(|x| *x).count());
-

Methods

impl BitVec<u32>

fn new() -> Self

-

Creates an empty BitVec.

- -

Examples

-
-use bit_vec::BitVec;
-let mut bv = BitVec::new();
-

fn from_elem(nbits: usize, bit: bool) -> Self

-

Creates a BitVec that holds nbits elements, setting each element -to bit.

- -

Examples

-
-use bit_vec::BitVec;
-
-let mut bv = BitVec::from_elem(10, false);
-assert_eq!(bv.len(), 10);
-for x in bv.iter() {
-    assert_eq!(x, false);
-}
-

fn with_capacity(nbits: usize) -> Self

-

Constructs a new, empty BitVec with the specified capacity.

- -

The bitvector will be able to hold at least capacity bits without -reallocating. If capacity is 0, it will not allocate.

- -

It is important to note that this function does not specify the -length of the returned bitvector, but only the capacity.

-

fn from_bytes(bytes: &[u8]) -> Self

-

Transforms a byte-vector into a BitVec. Each byte becomes eight bits, -with the most significant bits of each byte coming first. Each -bit becomes true if equal to 1 or false if equal to 0.

- -

Examples

-
-use bit_vec::BitVec;
-
-let bv = BitVec::from_bytes(&[0b10100000, 0b00010010]);
-assert!(bv.eq_vec(&[true, false, true, false,
-                    false, false, false, false,
-                    false, false, false, true,
-                    false, false, true, false]));
-

fn from_fn<F>(len: usize, f: F) -> Self where F: FnMut(usize) -> bool

-

Creates a BitVec of the specified length where the value at each index -is f(index).

- -

Examples

-
-use bit_vec::BitVec;
-
-let bv = BitVec::from_fn(5, |i| { i % 2 == 0 });
-assert!(bv.eq_vec(&[true, false, true, false, true]));
-

impl<B: BitBlock> BitVec<B>

fn blocks(&self) -> Blocks<B>

-

Iterator over the underlying blocks of data

-

fn storage(&self) -> &[B]

-

Exposes the raw block storage of this BitVec

- -

Only really intended for BitSet.

-

unsafe fn storage_mut(&mut self) -> &mut Vec<B>

-

Exposes the raw block storage of this BitVec

- -

Can probably cause unsafety. Only really intended for BitSet.

-

fn get(&self, i: usize) -> Option<bool>

-

Retrieves the value at index i, or None if the index is out of bounds.

- -

Examples

-
-use bit_vec::BitVec;
-
-let bv = BitVec::from_bytes(&[0b01100000]);
-assert_eq!(bv.get(0), Some(false));
-assert_eq!(bv.get(1), Some(true));
-assert_eq!(bv.get(100), None);
-
-// Can also use array indexing
-assert_eq!(bv[1], true);
-

fn set(&mut self, i: usize, x: bool)

-

Sets the value of a bit at an index i.

- -

Panics

-

Panics if i is out of bounds.

- -

Examples

-
-use bit_vec::BitVec;
-
-let mut bv = BitVec::from_elem(5, false);
-bv.set(3, true);
-assert_eq!(bv[3], true);
-

fn set_all(&mut self)

-

Sets all bits to 1.

- -

Examples

-
-use bit_vec::BitVec;
-
-let before = 0b01100000;
-let after  = 0b11111111;
-
-let mut bv = BitVec::from_bytes(&[before]);
-bv.set_all();
-assert_eq!(bv, BitVec::from_bytes(&[after]));
-

fn negate(&mut self)

-

Flips all bits.

- -

Examples

-
-use bit_vec::BitVec;
-
-let before = 0b01100000;
-let after  = 0b10011111;
-
-let mut bv = BitVec::from_bytes(&[before]);
-bv.negate();
-assert_eq!(bv, BitVec::from_bytes(&[after]));
-

fn union(&mut self, other: &Self) -> bool

-

Calculates the union of two bitvectors. This acts like the bitwise or -function.

- -

Sets self to the union of self and other. Both bitvectors must be -the same length. Returns true if self changed.

- -

Panics

-

Panics if the bitvectors are of different lengths.

- -

Examples

-
-use bit_vec::BitVec;
-
-let a   = 0b01100100;
-let b   = 0b01011010;
-let res = 0b01111110;
-
-let mut a = BitVec::from_bytes(&[a]);
-let b = BitVec::from_bytes(&[b]);
-
-assert!(a.union(&b));
-assert_eq!(a, BitVec::from_bytes(&[res]));
-

fn intersect(&mut self, other: &Self) -> bool

-

Calculates the intersection of two bitvectors. This acts like the -bitwise and function.

- -

Sets self to the intersection of self and other. Both bitvectors -must be the same length. Returns true if self changed.

- -

Panics

-

Panics if the bitvectors are of different lengths.

- -

Examples

-
-use bit_vec::BitVec;
-
-let a   = 0b01100100;
-let b   = 0b01011010;
-let res = 0b01000000;
-
-let mut a = BitVec::from_bytes(&[a]);
-let b = BitVec::from_bytes(&[b]);
-
-assert!(a.intersect(&b));
-assert_eq!(a, BitVec::from_bytes(&[res]));
-

fn difference(&mut self, other: &Self) -> bool

-

Calculates the difference between two bitvectors.

- -

Sets each element of self to the value of that element minus the -element of other at the same index. Both bitvectors must be the same -length. Returns true if self changed.

- -

Panics

-

Panics if the bitvectors are of different length.

- -

Examples

-
-use bit_vec::BitVec;
-
-let a   = 0b01100100;
-let b   = 0b01011010;
-let a_b = 0b00100100; // a - b
-let b_a = 0b00011010; // b - a
-
-let mut bva = BitVec::from_bytes(&[a]);
-let bvb = BitVec::from_bytes(&[b]);
-
-assert!(bva.difference(&bvb));
-assert_eq!(bva, BitVec::from_bytes(&[a_b]));
-
-let bva = BitVec::from_bytes(&[a]);
-let mut bvb = BitVec::from_bytes(&[b]);
-
-assert!(bvb.difference(&bva));
-assert_eq!(bvb, BitVec::from_bytes(&[b_a]));
-

fn all(&self) -> bool

-

Returns true if all bits are 1.

- -

Examples

-
-use bit_vec::BitVec;
-
-let mut bv = BitVec::from_elem(5, true);
-assert_eq!(bv.all(), true);
-
-bv.set(1, false);
-assert_eq!(bv.all(), false);
-

fn iter(&self) -> Iter<B>

-

Returns an iterator over the elements of the vector in order.

- -

Examples

-
-use bit_vec::BitVec;
-
-let bv = BitVec::from_bytes(&[0b01110100, 0b10010010]);
-assert_eq!(bv.iter().filter(|x| *x).count(), 7);
-

fn none(&self) -> bool

-

Returns true if all bits are 0.

- -

Examples

-
-use bit_vec::BitVec;
-
-let mut bv = BitVec::from_elem(10, false);
-assert_eq!(bv.none(), true);
-
-bv.set(3, true);
-assert_eq!(bv.none(), false);
-

fn any(&self) -> bool

-

Returns true if any bit is 1.

- -

Examples

-
-use bit_vec::BitVec;
-
-let mut bv = BitVec::from_elem(10, false);
-assert_eq!(bv.any(), false);
-
-bv.set(3, true);
-assert_eq!(bv.any(), true);
-

fn to_bytes(&self) -> Vec<u8>

-

Organises the bits into bytes, such that the first bit in the -BitVec becomes the high-order bit of the first byte. If the -size of the BitVec is not a multiple of eight then trailing bits -will be filled-in with false.

- -

Examples

-
-use bit_vec::BitVec;
-
-let mut bv = BitVec::from_elem(3, true);
-bv.set(1, false);
-
-assert_eq!(bv.to_bytes(), [0b10100000]);
-
-let mut bv = BitVec::from_elem(9, false);
-bv.set(2, true);
-bv.set(8, true);
-
-assert_eq!(bv.to_bytes(), [0b00100000, 0b10000000]);
-

fn eq_vec(&self, v: &[bool]) -> bool

-

Compares a BitVec to a slice of bools. -Both the BitVec and slice must have the same length.

- -

Panics

-

Panics if the BitVec and slice are of different length.

- -

Examples

-
-use bit_vec::BitVec;
-
-let bv = BitVec::from_bytes(&[0b10100000]);
-
-assert!(bv.eq_vec(&[true, false, true, false,
-                    false, false, false, false]));
-

fn truncate(&mut self, len: usize)

-

Shortens a BitVec, dropping excess elements.

- -

If len is greater than the vector's current length, this has no -effect.

- -

Examples

-
-use bit_vec::BitVec;
-
-let mut bv = BitVec::from_bytes(&[0b01001011]);
-bv.truncate(2);
-assert!(bv.eq_vec(&[false, true]));
-

fn reserve(&mut self, additional: usize)

-

Reserves capacity for at least additional more bits to be inserted in the given -BitVec. The collection may reserve more space to avoid frequent reallocations.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-
-use bit_vec::BitVec;
-
-let mut bv = BitVec::from_elem(3, false);
-bv.reserve(10);
-assert_eq!(bv.len(), 3);
-assert!(bv.capacity() >= 13);
-

fn reserve_exact(&mut self, additional: usize)

-

Reserves the minimum capacity for exactly additional more bits to be inserted in the -given BitVec. Does nothing if the capacity is already sufficient.

- -

Note that the allocator may give the collection more space than it requests. Therefore -capacity can not be relied upon to be precisely minimal. Prefer reserve if future -insertions are expected.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-
-use bit_vec::BitVec;
-
-let mut bv = BitVec::from_elem(3, false);
-bv.reserve(10);
-assert_eq!(bv.len(), 3);
-assert!(bv.capacity() >= 13);
-

fn capacity(&self) -> usize

-

Returns the capacity in bits for this bit vector. Inserting any -element less than this amount will not trigger a resizing.

- -

Examples

-
-use bit_vec::BitVec;
-
-let mut bv = BitVec::new();
-bv.reserve(10);
-assert!(bv.capacity() >= 10);
-

fn grow(&mut self, n: usize, value: bool)

-

Grows the BitVec in-place, adding n copies of value to the BitVec.

- -

Panics

-

Panics if the new len overflows a usize.

- -

Examples

-
-use bit_vec::BitVec;
-
-let mut bv = BitVec::from_bytes(&[0b01001011]);
-bv.grow(2, true);
-assert_eq!(bv.len(), 10);
-assert_eq!(bv.to_bytes(), [0b01001011, 0b11000000]);
-

fn pop(&mut self) -> Option<bool>

-

Removes the last bit from the BitVec, and returns it. Returns None if the BitVec is empty.

- -

Examples

-
-use bit_vec::BitVec;
-
-let mut bv = BitVec::from_bytes(&[0b01001001]);
-assert_eq!(bv.pop(), Some(true));
-assert_eq!(bv.pop(), Some(false));
-assert_eq!(bv.len(), 6);
-

fn push(&mut self, elem: bool)

-

Pushes a bool onto the end.

- -

Examples

-
-use bit_vec::BitVec;
-
-let mut bv = BitVec::new();
-bv.push(true);
-bv.push(false);
-assert!(bv.eq_vec(&[true, false]));
-

fn len(&self) -> usize

-

Returns the total number of bits in this vector

-

unsafe fn set_len(&mut self, len: usize)

-

Sets the number of bits that this BitVec considers initialized.

- -

Almost certainly can cause bad stuff. Only really intended for BitSet.

-

fn is_empty(&self) -> bool

-

Returns true if there are no bits in this vector

-

fn clear(&mut self)

-

Clears all bits in this vector.

-

Trait Implementations

impl<B: BitBlock> Index<usize> for BitVec<B>

type Output = bool

-

fn index(&self, i: usize) -> &bool

-

impl<B: BitBlock> Default for BitVec<B>

fn default() -> Self

-

impl<B: BitBlock> FromIterator<bool> for BitVec<B>

fn from_iter<I: IntoIterator<Item=bool>>(iter: I) -> Self

-

impl<B: BitBlock> Extend<bool> for BitVec<B>

fn extend<I: IntoIterator<Item=bool>>(&mut self, iterable: I)

-

impl<B: BitBlock> Clone for BitVec<B>

fn clone(&self) -> Self

-

fn clone_from(&mut self, source: &Self)

-

impl<B: BitBlock> PartialOrd for BitVec<B>

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool1.0.0

-

fn le(&self, other: &Rhs) -> bool1.0.0

-

fn gt(&self, other: &Rhs) -> bool1.0.0

-

fn ge(&self, other: &Rhs) -> bool1.0.0

-

impl<B: BitBlock> Ord for BitVec<B>

fn cmp(&self, other: &Self) -> Ordering

-

impl<B: BitBlock> Debug for BitVec<B>

fn fmt(&self, fmt: &mut Formatter) -> Result

-

impl<B: BitBlock> Hash for BitVec<B>

fn hash<H: Hasher>(&self, state: &mut H)

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<B: BitBlock> PartialEq for BitVec<B>

fn eq(&self, other: &Self) -> bool

-

fn ne(&self, other: &Rhs) -> bool1.0.0

-

impl<B: BitBlock> Eq for BitVec<B>

impl<'a, B: BitBlock> IntoIterator for &'a BitVec<B>

type Item = bool

-

type IntoIter = Iter<'a, B>

-

fn into_iter(self) -> Iter<'a, B>

-

impl<B: BitBlock> IntoIterator for BitVec<B>

type Item = bool

-

type IntoIter = IntoIter<B>

-

fn into_iter(self) -> IntoIter<B>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bit_vec/struct.Blocks.html b/doc/bit_vec/struct.Blocks.html deleted file mode 100644 index fd9a6de1..00000000 --- a/doc/bit_vec/struct.Blocks.html +++ /dev/null @@ -1,167 +0,0 @@ - - - - - - - - - - bit_vec::Blocks - Rust - - - - - - - - - - - - - - - - - -
-

Struct bit_vec::Blocks - - [−] - - [src]

-
pub struct Blocks<'a, B: 'a> {
-    // some fields omitted
-}

An iterator over the blocks of a BitVec.

-

Trait Implementations

impl<'a, B: BitBlock> Iterator for Blocks<'a, B>

type Item = B

-

fn next(&mut self) -> Option<B>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where U: IntoIterator, F: FnMut(Self::Item) -> U1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>, FromB: Default + Extend<B>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where T: 'a + Clone, Self: Iterator<Item=&'a T>1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, B: BitBlock> DoubleEndedIterator for Blocks<'a, B>

fn next_back(&mut self) -> Option<B>

-

impl<'a, B: BitBlock> ExactSizeIterator for Blocks<'a, B>

fn len(&self) -> usize1.0.0

-

Derived Implementations

impl<'a, B: Clone + 'a> Clone for Blocks<'a, B>

fn clone(&self) -> Blocks<'a, B>

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bit_vec/struct.IntoIter.html b/doc/bit_vec/struct.IntoIter.html deleted file mode 100644 index bdbb7c2d..00000000 --- a/doc/bit_vec/struct.IntoIter.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - - - - - - - bit_vec::IntoIter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bit_vec::IntoIter - - [−] - - [src]

-
pub struct IntoIter<B = u32> {
-    // some fields omitted
-}

Trait Implementations

impl<B: BitBlock> Iterator for IntoIter<B>

type Item = bool

-

fn next(&mut self) -> Option<bool>

-

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where U: IntoIterator, F: FnMut(Self::Item) -> U1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>, FromB: Default + Extend<B>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where T: 'a + Clone, Self: Iterator<Item=&'a T>1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<B: BitBlock> DoubleEndedIterator for IntoIter<B>

fn next_back(&mut self) -> Option<bool>

-

impl<B: BitBlock> ExactSizeIterator for IntoIter<B>

fn len(&self) -> usize1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bit_vec/struct.Iter.html b/doc/bit_vec/struct.Iter.html deleted file mode 100644 index 4cc0ef78..00000000 --- a/doc/bit_vec/struct.Iter.html +++ /dev/null @@ -1,167 +0,0 @@ - - - - - - - - - - bit_vec::Iter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bit_vec::Iter - - [−] - - [src]

-
pub struct Iter<'a, B: 'a = u32> {
-    // some fields omitted
-}

An iterator for BitVec.

-

Trait Implementations

impl<'a, B: BitBlock> Iterator for Iter<'a, B>

type Item = bool

-

fn next(&mut self) -> Option<bool>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where U: IntoIterator, F: FnMut(Self::Item) -> U1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>, FromB: Default + Extend<B>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where T: 'a + Clone, Self: Iterator<Item=&'a T>1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, B: BitBlock> DoubleEndedIterator for Iter<'a, B>

fn next_back(&mut self) -> Option<bool>

-

impl<'a, B: BitBlock> ExactSizeIterator for Iter<'a, B>

fn len(&self) -> usize1.0.0

-

Derived Implementations

impl<'a, B: Clone + 'a> Clone for Iter<'a, B>

fn clone(&self) -> Iter<'a, B>

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bit_vec/trait.BitBlock.html b/doc/bit_vec/trait.BitBlock.html deleted file mode 100644 index 2efc3b59..00000000 --- a/doc/bit_vec/trait.BitBlock.html +++ /dev/null @@ -1,143 +0,0 @@ - - - - - - - - - - bit_vec::BitBlock - Rust - - - - - - - - - - - - - - - - - -
-

Trait bit_vec::BitBlock - - [−] - - [src]

-
pub trait BitBlock: Copy + Add<Self, Output=Self> + Sub<Self, Output=Self> + Shl<usize, Output=Self> + Shr<usize, Output=Self> + Not<Output=Self> + BitAnd<Self, Output=Self> + BitOr<Self, Output=Self> + BitXor<Self, Output=Self> + Rem<Self, Output=Self> + Eq + Ord + Hash {
-    fn bits() -> usize;
-    fn from_byte(byte: u8) -> Self;
-    fn count_ones(self) -> usize;
-    fn zero() -> Self;
-    fn one() -> Self;
-
-    fn bytes() -> usize { ... }
-}

Abstracts over a pile of bits (basically unsigned primitives)

-
-

Required Methods

-
-

fn bits() -> usize

How many bits it has

-

fn from_byte(byte: u8) -> Self

Convert a byte into this type (lowest-order bits set)

-

fn count_ones(self) -> usize

Count the number of 1's in the bitwise repr

-

fn zero() -> Self

Get 0

-

fn one() -> Self

Get 1

-
-

Provided Methods

-
-

fn bytes() -> usize

How many bytes it has

-
-

Implementors

-
    -
  • impl BitBlock for u8
    • -
  • impl BitBlock for u16
    • -
  • impl BitBlock for u32
    • -
  • impl BitBlock for u64
    • -
  • impl BitBlock for usize
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/__rand/fn.thread_rng.html b/doc/bitflags/__core/__rand/fn.thread_rng.html deleted file mode 100644 index e1e88729..00000000 --- a/doc/bitflags/__core/__rand/fn.thread_rng.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../std/rand/fn.thread_rng.html...

- - - \ No newline at end of file diff --git a/doc/bitflags/__core/__rand/index.html b/doc/bitflags/__core/__rand/index.html deleted file mode 100644 index 0fa2ab8f..00000000 --- a/doc/bitflags/__core/__rand/index.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../std/__rand/index.html...

- - - \ No newline at end of file diff --git a/doc/bitflags/__core/__rand/sidebar-items.js b/doc/bitflags/__core/__rand/sidebar-items.js deleted file mode 100644 index 8263b5d5..00000000 --- a/doc/bitflags/__core/__rand/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["thread_rng","Retrieve the lazily-initialized thread-local random number generator, seeded by the system. Intended to be used in method chaining style, e.g. `thread_rng().gen::()`."]],"struct":[["ThreadRng","The thread-local RNG."]],"trait":[["Rng","A random number generator."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/__rand/struct.ThreadRng.html b/doc/bitflags/__core/__rand/struct.ThreadRng.html deleted file mode 100644 index e6960248..00000000 --- a/doc/bitflags/__core/__rand/struct.ThreadRng.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../std/rand/struct.ThreadRng.html...

- - - \ No newline at end of file diff --git a/doc/bitflags/__core/__rand/trait.Rng.html b/doc/bitflags/__core/__rand/trait.Rng.html deleted file mode 100644 index a46b8be2..00000000 --- a/doc/bitflags/__core/__rand/trait.Rng.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../rand/trait.Rng.html...

- - - \ No newline at end of file diff --git a/doc/bitflags/__core/any/index.html b/doc/bitflags/__core/any/index.html deleted file mode 100644 index c9101d89..00000000 --- a/doc/bitflags/__core/any/index.html +++ /dev/null @@ -1,184 +0,0 @@ - - - - - - - - - - bitflags::__core::any - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::any - - [−] - - [src]

-

This module implements the Any trait, which enables dynamic typing -of any 'static type through runtime reflection.

- -

Any itself can be used to get a TypeId, and has more features when used -as a trait object. As &Any (a borrowed trait object), it has the is and -downcast_ref methods, to test if the contained value is of a given type, -and to get a reference to the inner value as a type. As &mut Any, there -is also the downcast_mut method, for getting a mutable reference to the -inner value. Box<Any> adds the downcast method, which attempts to -convert to a Box<T>. See the Box documentation for the full details.

- -

Note that &Any is limited to testing whether a value is of a specified -concrete type, and cannot be used to test whether a type implements a trait.

- -

Examples

-

Consider a situation where we want to log out a value passed to a function. -We know the value we're working on implements Debug, but we don't know its -concrete type. We want to give special treatment to certain types: in this -case printing out the length of String values prior to their value. -We don't know the concrete type of our value at compile time, so we need to -use runtime reflection instead.

- -
-use std::fmt::Debug;
-use std::any::Any;
-
-// Logger function for any type that implements Debug.
-fn log<T: Any + Debug>(value: &T) {
-    let value_any = value as &Any;
-
-    // try to convert our value to a String.  If successful, we want to
-    // output the String's length as well as its value.  If not, it's a
-    // different type: just print it out unadorned.
-    match value_any.downcast_ref::<String>() {
-        Some(as_string) => {
-            println!("String ({}): {}", as_string.len(), as_string);
-        }
-        None => {
-            println!("{:?}", value);
-        }
-    }
-}
-
-// This function wants to log its parameter out prior to doing work with it.
-fn do_work<T: Any + Debug>(value: &T) {
-    log(value);
-    // ...do some other work
-}
-
-fn main() {
-    let my_string = "Hello World".to_string();
-    do_work(&my_string);
-
-    let my_i8: i8 = 100;
-    do_work(&my_i8);
-}
-

Structs

- - - - -
TypeId -

A TypeId represents a globally unique identifier for a type.

-

Traits

- - - - -
Any -

A type to emulate dynamic typing.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/any/sidebar-items.js b/doc/bitflags/__core/any/sidebar-items.js deleted file mode 100644 index 5c70e490..00000000 --- a/doc/bitflags/__core/any/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["TypeId","A `TypeId` represents a globally unique identifier for a type."]],"trait":[["Any","A type to emulate dynamic typing."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/any/struct.TypeId.html b/doc/bitflags/__core/any/struct.TypeId.html deleted file mode 100644 index b3858435..00000000 --- a/doc/bitflags/__core/any/struct.TypeId.html +++ /dev/null @@ -1,132 +0,0 @@ - - - - - - - - - - bitflags::__core::any::TypeId - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::any::TypeId - - [−] - - [src]

-
pub struct TypeId {
-    // some fields omitted
-}
1.0.0

A TypeId represents a globally unique identifier for a type.

- -

Each TypeId is an opaque object which does not allow inspection of what's -inside but does allow basic operations such as cloning, comparison, -printing, and showing.

- -

A TypeId is currently only available for types which ascribe to 'static, -but this limitation may be removed in the future.

-

Methods

impl TypeId

fn of<T>() -> TypeId where T: 'static + Reflect + ?Sized

-

Returns the TypeId of the type this generic function has been -instantiated with

-

Trait Implementations

Derived Implementations

impl Hash for TypeId

fn hash<__H>(&self, __arg_0: &mut __H) where __H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl Debug for TypeId

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl Eq for TypeId

impl PartialEq<TypeId> for TypeId

fn eq(&self, __arg_0: &TypeId) -> bool

-

fn ne(&self, __arg_0: &TypeId) -> bool

-

impl Copy for TypeId

impl Clone for TypeId

fn clone(&self) -> TypeId

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/any/trait.Any.html b/doc/bitflags/__core/any/trait.Any.html deleted file mode 100644 index 71fdc9ad..00000000 --- a/doc/bitflags/__core/any/trait.Any.html +++ /dev/null @@ -1,145 +0,0 @@ - - - - - - - - - - bitflags::__core::any::Any - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::any::Any - - [−] - - [src]

-
pub trait Any: 'static + Reflect {
-    fn get_type_id(&self) -> TypeId;
-}

A type to emulate dynamic typing.

- -

Every type with no non-'static references implements Any. -See the module-level documentation for more details.

-
-

Required Methods

-
-

fn get_type_id(&self) -> TypeId

Unstable (get_type_id)

: this method will likely be replaced by an associated static

-

Gets the TypeId of self.

-

Methods

impl Any + 'static

fn is<T>(&self) -> bool where T: Any

-

Returns true if the boxed type is the same as T

-

fn downcast_ref<T>(&self) -> Option<&T> where T: Any

-

Returns some reference to the boxed value if it is of type T, or -None if it isn't.

-

fn downcast_mut<T>(&mut self) -> Option<&mut T> where T: Any

-

Returns some mutable reference to the boxed value if it is of type T, or -None if it isn't.

-

impl Any + 'static + Send

fn is<T>(&self) -> bool where T: Any

-

Forwards to the method defined on the type Any.

-

fn downcast_ref<T>(&self) -> Option<&T> where T: Any

-

Forwards to the method defined on the type Any.

-

fn downcast_mut<T>(&mut self) -> Option<&mut T> where T: Any

-

Forwards to the method defined on the type Any.

-

Trait Implementations

impl Debug for Any + 'static

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl Debug for Any + 'static + Send

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ascii/fn.escape_default.html b/doc/bitflags/__core/ascii/fn.escape_default.html deleted file mode 100644 index e15935e6..00000000 --- a/doc/bitflags/__core/ascii/fn.escape_default.html +++ /dev/null @@ -1,137 +0,0 @@ - - - - - - - - - - bitflags::__core::ascii::escape_default - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::ascii::escape_default - - [−] - - [src]

-
pub fn escape_default(c: u8) -> EscapeDefault
1.0.0

Returns an iterator that produces an escaped version of a u8.

- -

The default is chosen with a bias toward producing literals that are -legal in a variety of languages, including C++11 and similar C-family -languages. The exact rules are:

- -
    -
  • Tab, CR and LF are escaped as '\t', '\r' and '\n' respectively.
    • -
  • Single-quote, double-quote and backslash chars are backslash-escaped.
    • -
  • Any other chars in the range [0x20,0x7e] are not escaped.
    • -
  • Any other chars are given hex escapes of the form '\xNN'.
    • -
  • Unicode escapes are never generated by this function.
    • -
- -

Examples

-
-use std::ascii;
-
-let escaped = ascii::escape_default(b'0').next().unwrap();
-assert_eq!(b'0', escaped);
-
-let mut escaped = ascii::escape_default(b'\t');
-
-assert_eq!(b'\\', escaped.next().unwrap());
-assert_eq!(b't', escaped.next().unwrap());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ascii/index.html b/doc/bitflags/__core/ascii/index.html deleted file mode 100644 index 1df496af..00000000 --- a/doc/bitflags/__core/ascii/index.html +++ /dev/null @@ -1,138 +0,0 @@ - - - - - - - - - - bitflags::__core::ascii - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::ascii - - [−] - - [src]

-

Operations on ASCII strings and characters.

-

Structs

- - - - -
EscapeDefault -

An iterator over the escaped version of a byte, constructed via -std::ascii::escape_default.

-

Traits

- - - - -
AsciiExt -

Extension methods for ASCII-subset only operations on string slices.

-

Functions

- - - - -
escape_default -

Returns an iterator that produces an escaped version of a u8.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ascii/sidebar-items.js b/doc/bitflags/__core/ascii/sidebar-items.js deleted file mode 100644 index 458e0723..00000000 --- a/doc/bitflags/__core/ascii/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["escape_default","Returns an iterator that produces an escaped version of a `u8`."]],"struct":[["EscapeDefault","An iterator over the escaped version of a byte, constructed via `std::ascii::escape_default`."]],"trait":[["AsciiExt","Extension methods for ASCII-subset only operations on string slices."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/ascii/struct.EscapeDefault.html b/doc/bitflags/__core/ascii/struct.EscapeDefault.html deleted file mode 100644 index 89fdc4b4..00000000 --- a/doc/bitflags/__core/ascii/struct.EscapeDefault.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::ascii::EscapeDefault - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::ascii::EscapeDefault - - [−] - - [src]

-
pub struct EscapeDefault {
-    // some fields omitted
-}
1.0.0

An iterator over the escaped version of a byte, constructed via -std::ascii::escape_default.

-

Trait Implementations

impl Iterator for EscapeDefault

type Item = u8

-

fn next(&mut self) -> Option<u8>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl DoubleEndedIterator for EscapeDefault

fn next_back(&mut self) -> Option<u8>

-

impl ExactSizeIterator for EscapeDefault

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ascii/trait.AsciiExt.html b/doc/bitflags/__core/ascii/trait.AsciiExt.html deleted file mode 100644 index 27613146..00000000 --- a/doc/bitflags/__core/ascii/trait.AsciiExt.html +++ /dev/null @@ -1,237 +0,0 @@ - - - - - - - - - - bitflags::__core::ascii::AsciiExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ascii::AsciiExt - - [−] - - [src]

-
pub trait AsciiExt {
-    type Owned;
-    fn is_ascii(&self) -> bool;
-    fn to_ascii_uppercase(&self) -> Self::Owned;
-    fn to_ascii_lowercase(&self) -> Self::Owned;
-    fn eq_ignore_ascii_case(&self, other: &Self) -> bool;
-    fn make_ascii_uppercase(&mut self);
-    fn make_ascii_lowercase(&mut self);
-}

Extension methods for ASCII-subset only operations on string slices.

- -

Be aware that operations on seemingly non-ASCII characters can sometimes -have unexpected results. Consider this example:

- -
-use std::ascii::AsciiExt;
-
-assert_eq!("café".to_ascii_uppercase(), "CAFÉ");
-assert_eq!("café".to_ascii_uppercase(), "CAFé");
- -

In the first example, the lowercased string is represented "cafe\u{301}" -(the last character is an acute accent combining character). Unlike the -other characters in the string, the combining character will not get mapped -to an uppercase variant, resulting in "CAFE\u{301}". In the second -example, the lowercased string is represented "caf\u{e9}" (the last -character is a single Unicode character representing an 'e' with an acute -accent). Since the last character is defined outside the scope of ASCII, -it will not get mapped to an uppercase variant, resulting in "CAF\u{e9}".

-
-

Associated Types

-
-

type Owned

Container type for copied ASCII characters.

-
-

Required Methods

-
-

fn is_ascii(&self) -> bool

Checks if the value is within the ASCII range.

- -

Examples

-
-use std::ascii::AsciiExt;
-
-let ascii = 'a';
-let utf8 = '❤';
-
-assert!(ascii.is_ascii());
-assert!(!utf8.is_ascii());
-

fn to_ascii_uppercase(&self) -> Self::Owned

Makes a copy of the string in ASCII upper case.

- -

ASCII letters 'a' to 'z' are mapped to 'A' to 'Z', -but non-ASCII letters are unchanged.

- -

Examples

-
-use std::ascii::AsciiExt;
-
-let ascii = 'a';
-let utf8 = '❤';
-
-assert_eq!('A', ascii.to_ascii_uppercase());
-assert_eq!('❤', utf8.to_ascii_uppercase());
-

fn to_ascii_lowercase(&self) -> Self::Owned

Makes a copy of the string in ASCII lower case.

- -

ASCII letters 'A' to 'Z' are mapped to 'a' to 'z', -but non-ASCII letters are unchanged.

- -

Examples

-
-use std::ascii::AsciiExt;
-
-let ascii = 'A';
-let utf8 = '❤';
-
-assert_eq!('a', ascii.to_ascii_lowercase());
-assert_eq!('❤', utf8.to_ascii_lowercase());
-

fn eq_ignore_ascii_case(&self, other: &Self) -> bool

Checks that two strings are an ASCII case-insensitive match.

- -

Same as to_ascii_lowercase(a) == to_ascii_lowercase(b), -but without allocating and copying temporary strings.

- -

Examples

-
-use std::ascii::AsciiExt;
-
-let ascii1 = 'A';
-let ascii2 = 'a';
-let ascii3 = 'A';
-let ascii4 = 'z';
-
-assert!(ascii1.eq_ignore_ascii_case(&ascii2));
-assert!(ascii1.eq_ignore_ascii_case(&ascii3));
-assert!(!ascii1.eq_ignore_ascii_case(&ascii4));
-

fn make_ascii_uppercase(&mut self)1.9.0

Converts this type to its ASCII upper case equivalent in-place.

- -

See to_ascii_uppercase for more information.

- -

Examples

-
-use std::ascii::AsciiExt;
-
-let mut ascii = 'a';
-
-ascii.make_ascii_uppercase();
-
-assert_eq!('A', ascii);
-

fn make_ascii_lowercase(&mut self)1.9.0

Converts this type to its ASCII lower case equivalent in-place.

- -

See to_ascii_lowercase for more information.

- -

Examples

-
-use std::ascii::AsciiExt;
-
-let mut ascii = 'A';
-
-ascii.make_ascii_lowercase();
-
-assert_eq!('a', ascii);
-
-

Implementors

-
    -
  • impl AsciiExt for str
    • -
  • impl AsciiExt for [u8]
    • -
  • impl AsciiExt for u8
    • -
  • impl AsciiExt for char
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/borrow/enum.Cow.html b/doc/bitflags/__core/borrow/enum.Cow.html deleted file mode 100644 index 4aa6eda8..00000000 --- a/doc/bitflags/__core/borrow/enum.Cow.html +++ /dev/null @@ -1,293 +0,0 @@ - - - - - - - - - - bitflags::__core::borrow::Cow - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::borrow::Cow - - [−] - - [src]

-
pub enum Cow<'a, B> where B: 'a + ToOwned + ?Sized {
-    Borrowed(&'a B),
-    Owned(B::Owned),
-}
1.0.0

A clone-on-write smart pointer.

- -

The type Cow is a smart pointer providing clone-on-write functionality: it -can enclose and provide immutable access to borrowed data, and clone the -data lazily when mutation or ownership is required. The type is designed to -work with general borrowed data via the Borrow trait.

- -

Cow implements Deref, which means that you can call -non-mutating methods directly on the data it encloses. If mutation -is desired, to_mut will obtain a mutable reference to an owned -value, cloning if necessary.

- -

Examples

-
-use std::borrow::Cow;
-
-fn abs_all(input: &mut Cow<[i32]>) {
-    for i in 0..input.len() {
-        let v = input[i];
-        if v < 0 {
-            // clones into a vector the first time (if not already owned)
-            input.to_mut()[i] = -v;
-        }
-    }
-}
-

Variants

-
Borrowed

Borrowed data.

-
Owned

Owned data.

-

Methods

impl<'a, B> Cow<'a, B> where B: ToOwned + ?Sized

fn to_mut(&mut self) -> &mut B::Owned

-

Acquires a mutable reference to the owned form of the data.

- -

Clones the data if it is not already owned.

- -

Examples

-
-use std::borrow::Cow;
-
-let mut cow: Cow<[_]> = Cow::Owned(vec![1, 2, 3]);
-
-let hello = cow.to_mut();
-
-assert_eq!(hello, &[1, 2, 3]);
-

fn into_owned(self) -> B::Owned

-

Extracts the owned data.

- -

Clones the data if it is not already owned.

- -

Examples

-
-use std::borrow::Cow;
-
-let cow: Cow<[_]> = Cow::Owned(vec![1, 2, 3]);
-
-let hello = cow.into_owned();
-
-assert_eq!(vec![1, 2, 3], hello);
-

Trait Implementations

impl<'a, 'b> PartialEq<OsStr> for Cow<'a, OsStr>1.8.0

fn eq(&self, other: &OsStr) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<OsStr> for Cow<'a, OsStr>1.8.0

fn partial_cmp(&self, other: &OsStr) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<&'b OsStr> for Cow<'a, OsStr>1.8.0

fn eq(&self, other: &&'b OsStr) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<&'b OsStr> for Cow<'a, OsStr>1.8.0

fn partial_cmp(&self, other: &&'b OsStr) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<OsString> for Cow<'a, OsStr>1.8.0

fn eq(&self, other: &OsString) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<OsString> for Cow<'a, OsStr>1.8.0

fn partial_cmp(&self, other: &OsString) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a> From<&'a Path> for Cow<'a, Path>1.6.0

fn from(s: &'a Path) -> Cow<'a, Path>

-

impl<'a> From<PathBuf> for Cow<'a, Path>1.6.0

fn from(s: PathBuf) -> Cow<'a, Path>

-

impl<'a> AsRef<Path> for Cow<'a, OsStr>1.8.0

fn as_ref(&self) -> &Path

-

impl<'a, 'b> PartialEq<Path> for Cow<'a, Path>1.6.0

fn eq(&self, other: &Path) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Path> for Cow<'a, Path>1.8.0

fn partial_cmp(&self, other: &Path) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<&'b Path> for Cow<'a, Path>1.6.0

fn eq(&self, other: &&'b Path) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<&'b Path> for Cow<'a, Path>1.8.0

fn partial_cmp(&self, other: &&'b Path) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<PathBuf> for Cow<'a, Path>1.6.0

fn eq(&self, other: &PathBuf) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<PathBuf> for Cow<'a, Path>1.8.0

fn partial_cmp(&self, other: &PathBuf) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<PathBuf> for Cow<'a, OsStr>1.8.0

fn eq(&self, other: &PathBuf) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<PathBuf> for Cow<'a, OsStr>1.8.0

fn partial_cmp(&self, other: &PathBuf) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Path> for Cow<'a, OsStr>1.8.0

fn eq(&self, other: &Path) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Path> for Cow<'a, OsStr>1.8.0

fn partial_cmp(&self, other: &Path) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<&'a Path> for Cow<'b, OsStr>1.8.0

fn eq(&self, other: &&'a Path) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<&'a Path> for Cow<'b, OsStr>1.8.0

fn partial_cmp(&self, other: &&'a Path) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<OsStr> for Cow<'a, Path>1.8.0

fn eq(&self, other: &OsStr) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<OsStr> for Cow<'a, Path>1.8.0

fn partial_cmp(&self, other: &OsStr) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<&'b OsStr> for Cow<'a, Path>1.8.0

fn eq(&self, other: &&'b OsStr) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<&'b OsStr> for Cow<'a, Path>1.8.0

fn partial_cmp(&self, other: &&'b OsStr) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<OsString> for Cow<'a, Path>1.8.0

fn eq(&self, other: &OsString) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<OsString> for Cow<'a, Path>1.8.0

fn partial_cmp(&self, other: &OsString) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B]> for Cow<'a, [A]> where A: Clone + PartialEq<B>

fn eq(&self, other: &&'b [B]) -> bool

-

fn ne(&self, other: &&'b [B]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b mut [B]> for Cow<'a, [A]> where A: Clone + PartialEq<B>

fn eq(&self, other: &&'b mut [B]) -> bool

-

fn ne(&self, other: &&'b mut [B]) -> bool

-

impl<'a, 'b, A, B> PartialEq<Vec<B>> for Cow<'a, [A]> where A: Clone + PartialEq<B>

fn eq(&self, other: &Vec<B>) -> bool

-

fn ne(&self, other: &Vec<B>) -> bool

-

impl<'a, T> From<&'a [T]> for Cow<'a, [T]> where T: Clone1.7.0

fn from(s: &'a [T]) -> Cow<'a, [T]>

-

impl<'a, T> From<Vec<T>> for Cow<'a, [T]> where T: Clone1.7.0

fn from(v: Vec<T>) -> Cow<'a, [T]>

-

impl<'a, T> FromIterator<T> for Cow<'a, [T]> where T: Clone

fn from_iter<I>(it: I) -> Cow<'a, [T]> where I: IntoIterator<Item=T>

-

impl<'a, 'b> PartialEq<str> for Cow<'a, str>

fn eq(&self, other: &str) -> bool

-

fn ne(&self, other: &str) -> bool

-

impl<'a, 'b> PartialEq<&'b str> for Cow<'a, str>

fn eq(&self, other: &&'b str) -> bool

-

fn ne(&self, other: &&'b str) -> bool

-

impl<'a, 'b> PartialEq<String> for Cow<'a, str>

fn eq(&self, other: &String) -> bool

-

fn ne(&self, other: &String) -> bool

-

impl<'a> From<&'a str> for Cow<'a, str>

fn from(s: &'a str) -> Cow<'a, str>

-

impl<'a> From<String> for Cow<'a, str>

fn from(s: String) -> Cow<'a, str>

-

impl<'a, B> Borrow<B> for Cow<'a, B> where B: ToOwned + ?Sized, B::Owned: 'a

fn borrow(&self) -> &B

-

impl<'a, B> Clone for Cow<'a, B> where B: ToOwned + ?Sized

fn clone(&self) -> Cow<'a, B>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, B> Deref for Cow<'a, B> where B: ToOwned + ?Sized

type Target = B

-

fn deref(&self) -> &B

-

impl<'a, B> Eq for Cow<'a, B> where B: Eq + ToOwned + ?Sized

impl<'a, B> Ord for Cow<'a, B> where B: Ord + ToOwned + ?Sized

fn cmp(&self, other: &Cow<'a, B>) -> Ordering

-

impl<'a, 'b, B, C> PartialEq<Cow<'b, C>> for Cow<'a, B> where B: PartialEq<C> + ToOwned + ?Sized, C: ToOwned + ?Sized

fn eq(&self, other: &Cow<'b, C>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, B> PartialOrd<Cow<'a, B>> for Cow<'a, B> where B: PartialOrd<B> + ToOwned + ?Sized

fn partial_cmp(&self, other: &Cow<'a, B>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, B> Debug for Cow<'a, B> where B: Debug + ToOwned + ?Sized, B::Owned: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, B> Display for Cow<'a, B> where B: Display + ToOwned + ?Sized, B::Owned: Display

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, B> Hash for Cow<'a, B> where B: Hash + ToOwned + ?Sized

fn hash<H>(&self, state: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<'a, T> AsRef<T> for Cow<'a, T> where T: ToOwned + ?Sized

fn as_ref(&self) -> &T

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/borrow/index.html b/doc/bitflags/__core/borrow/index.html deleted file mode 100644 index fcd50e5a..00000000 --- a/doc/bitflags/__core/borrow/index.html +++ /dev/null @@ -1,143 +0,0 @@ - - - - - - - - - - bitflags::__core::borrow - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::borrow - - [−] - - [src]

-

A module for working with borrowed data.

-

Enums

- - - - -
Cow -

A clone-on-write smart pointer.

-

Traits

- - - - - - - - - - - - -
Borrow -

A trait for borrowing data.

-
BorrowMut -

A trait for mutably borrowing data.

-
ToOwned -

A generalization of Clone to borrowed data.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/borrow/sidebar-items.js b/doc/bitflags/__core/borrow/sidebar-items.js deleted file mode 100644 index 85854b07..00000000 --- a/doc/bitflags/__core/borrow/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["Cow","A clone-on-write smart pointer."]],"trait":[["Borrow","A trait for borrowing data."],["BorrowMut","A trait for mutably borrowing data."],["ToOwned","A generalization of `Clone` to borrowed data."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/borrow/trait.Borrow.html b/doc/bitflags/__core/borrow/trait.Borrow.html deleted file mode 100644 index 776665d8..00000000 --- a/doc/bitflags/__core/borrow/trait.Borrow.html +++ /dev/null @@ -1,201 +0,0 @@ - - - - - - - - - - bitflags::__core::borrow::Borrow - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::borrow::Borrow - - [−] - - [src]

-
pub trait Borrow<Borrowed> where Borrowed: ?Sized {
-    fn borrow(&self) -> &Borrowed;
-}

A trait for borrowing data.

- -

In general, there may be several ways to "borrow" a piece of data. The -typical ways of borrowing a type T are &T (a shared borrow) and &mut T -(a mutable borrow). But types like Vec<T> provide additional kinds of -borrows: the borrowed slices &[T] and &mut [T].

- -

When writing generic code, it is often desirable to abstract over all ways -of borrowing data from a given type. That is the role of the Borrow -trait: if T: Borrow<U>, then &U can be borrowed from &T. A given -type can be borrowed as multiple different types. In particular, Vec<T>: Borrow<Vec<T>> and Vec<T>: Borrow<[T]>.

- -

If you are implementing Borrow and both Self and Borrowed implement -Hash, Eq, and/or Ord, they must produce the same result.

- -

Borrow is very similar to, but different than, AsRef. See -the book for more.

-
-

Required Methods

-
-

fn borrow(&self) -> &Borrowed

Immutably borrows from an owned value.

- -

Examples

-
-use std::borrow::Borrow;
-
-fn check<T: Borrow<str>>(s: T) {
-    assert_eq!("Hello", s.borrow());
-}
-
-let s = "Hello".to_string();
-
-check(s);
-
-let s = "Hello";
-
-check(s);
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/borrow/trait.BorrowMut.html b/doc/bitflags/__core/borrow/trait.BorrowMut.html deleted file mode 100644 index 332684f7..00000000 --- a/doc/bitflags/__core/borrow/trait.BorrowMut.html +++ /dev/null @@ -1,175 +0,0 @@ - - - - - - - - - - bitflags::__core::borrow::BorrowMut - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::borrow::BorrowMut - - [−] - - [src]

-
pub trait BorrowMut<Borrowed>: Borrow<Borrowed> where Borrowed: ?Sized {
-    fn borrow_mut(&mut self) -> &mut Borrowed;
-}

A trait for mutably borrowing data.

- -

Similar to Borrow, but for mutable borrows.

-
-

Required Methods

-
-

fn borrow_mut(&mut self) -> &mut Borrowed

Mutably borrows from an owned value.

- -

Examples

-
-use std::borrow::BorrowMut;
-
-fn check<T: BorrowMut<[i32]>>(mut v: T) {
-    assert_eq!(&mut [1, 2, 3], v.borrow_mut());
-}
-
-let v = vec![1, 2, 3];
-
-check(v);
-
-

Implementors

-
    -
  • impl<T> BorrowMut for Box<T> where T: ?Sized
    • -
  • impl<T> BorrowMut for Vec<T>
    • -
  • impl<T> BorrowMut for T where T: ?Sized
    • -
  • impl<'a, T> BorrowMut for &'a mut T where T: ?Sized
    • -
  • impl<T> BorrowMut for [T; 0]
    • -
  • impl<T> BorrowMut for [T; 1]
    • -
  • impl<T> BorrowMut for [T; 2]
    • -
  • impl<T> BorrowMut for [T; 3]
    • -
  • impl<T> BorrowMut for [T; 4]
    • -
  • impl<T> BorrowMut for [T; 5]
    • -
  • impl<T> BorrowMut for [T; 6]
    • -
  • impl<T> BorrowMut for [T; 7]
    • -
  • impl<T> BorrowMut for [T; 8]
    • -
  • impl<T> BorrowMut for [T; 9]
    • -
  • impl<T> BorrowMut for [T; 10]
    • -
  • impl<T> BorrowMut for [T; 11]
    • -
  • impl<T> BorrowMut for [T; 12]
    • -
  • impl<T> BorrowMut for [T; 13]
    • -
  • impl<T> BorrowMut for [T; 14]
    • -
  • impl<T> BorrowMut for [T; 15]
    • -
  • impl<T> BorrowMut for [T; 16]
    • -
  • impl<T> BorrowMut for [T; 17]
    • -
  • impl<T> BorrowMut for [T; 18]
    • -
  • impl<T> BorrowMut for [T; 19]
    • -
  • impl<T> BorrowMut for [T; 20]
    • -
  • impl<T> BorrowMut for [T; 21]
    • -
  • impl<T> BorrowMut for [T; 22]
    • -
  • impl<T> BorrowMut for [T; 23]
    • -
  • impl<T> BorrowMut for [T; 24]
    • -
  • impl<T> BorrowMut for [T; 25]
    • -
  • impl<T> BorrowMut for [T; 26]
    • -
  • impl<T> BorrowMut for [T; 27]
    • -
  • impl<T> BorrowMut for [T; 28]
    • -
  • impl<T> BorrowMut for [T; 29]
    • -
  • impl<T> BorrowMut for [T; 30]
    • -
  • impl<T> BorrowMut for [T; 31]
    • -
  • impl<T> BorrowMut for [T; 32]
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/borrow/trait.ToOwned.html b/doc/bitflags/__core/borrow/trait.ToOwned.html deleted file mode 100644 index 0e45d9ce..00000000 --- a/doc/bitflags/__core/borrow/trait.ToOwned.html +++ /dev/null @@ -1,149 +0,0 @@ - - - - - - - - - - bitflags::__core::borrow::ToOwned - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::borrow::ToOwned - - [−] - - [src]

-
pub trait ToOwned {
-    type Owned: Borrow<Self>;
-    fn to_owned(&self) -> Self::Owned;
-}

A generalization of Clone to borrowed data.

- -

Some types make it possible to go from borrowed to owned, usually by -implementing the Clone trait. But Clone works only for going from &T -to T. The ToOwned trait generalizes Clone to construct owned data -from any borrow of a given type.

-
-

Associated Types

-
-

type Owned: Borrow<Self>

-

Required Methods

-
-

fn to_owned(&self) -> Self::Owned

Creates owned data from borrowed data, usually by cloning.

- -

Examples

-

Basic usage:

- -
-let s = "a"; // &str
-let ss = s.to_owned(); // String
-
-let v = &[1, 2]; // slice
-let vv = v.to_owned(); // Vec
-
-

Implementors

-
    -
  • impl ToOwned for CStr
    • -
  • impl ToOwned for OsStr
    • -
  • impl ToOwned for Path
    • -
  • impl ToOwned for str
    • -
  • impl<T> ToOwned for T where T: Clone
    • -
  • impl<T> ToOwned for [T] where T: Clone
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/boxed/constant.HEAP.html b/doc/bitflags/__core/boxed/constant.HEAP.html deleted file mode 100644 index d055cdd4..00000000 --- a/doc/bitflags/__core/boxed/constant.HEAP.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::boxed::HEAP - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::boxed::HEAP - - [−] - - [src]

-
pub const HEAP: ExchangeHeapSingleton = ExchangeHeapSingleton{_force_singleton: (),}
Unstable (box_heap)

: may be renamed; uncertain about custom allocator design

-

A value that represents the heap. This is the default place that the box -keyword allocates into when no place is supplied.

- -

The following two examples are equivalent:

- -
-#![feature(box_heap)]
-
-#![feature(box_syntax, placement_in_syntax)]
-use std::boxed::HEAP;
-
-fn main() {
-    let foo: Box<i32> = in HEAP { 5 };
-    let foo = box 5;
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/boxed/index.html b/doc/bitflags/__core/boxed/index.html deleted file mode 100644 index ce90c385..00000000 --- a/doc/bitflags/__core/boxed/index.html +++ /dev/null @@ -1,195 +0,0 @@ - - - - - - - - - - bitflags::__core::boxed - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::boxed - - [−] - - [src]

-

A pointer type for heap allocation.

- -

Box<T>, casually referred to as a 'box', provides the simplest form of -heap allocation in Rust. Boxes provide ownership for this allocation, and -drop their contents when they go out of scope.

- -

Examples

-

Creating a box:

- -
-let x = Box::new(5);
- -

Creating a recursive data structure:

- -
-#[derive(Debug)]
-enum List<T> {
-    Cons(T, Box<List<T>>),
-    Nil,
-}
-
-fn main() {
-    let list: List<i32> = List::Cons(1, Box::new(List::Cons(2, Box::new(List::Nil))));
-    println!("{:?}", list);
-}
- -

This will print Cons(1, Cons(2, Nil)).

- -

Recursive structures must be boxed, because if the definition of Cons -looked like this:

- -
-Cons(T, List<T>),
- -

It wouldn't work. This is because the size of a List depends on how many -elements are in the list, and so we don't know how much memory to allocate -for a Cons. By introducing a Box, which has a defined size, we know how -big Cons needs to be.

-

Structs

- - - - - - - - - - - - -
Box -

A pointer type for heap allocation.

-
ExchangeHeapSingleton - [Unstable]

This the singleton type used solely for boxed::HEAP.

-
IntermediateBox - [Unstable]

IntermediateBox represents uninitialized backing storage for Box.

-

Constants

- - - - -
HEAP - [Unstable]

A value that represents the heap. This is the default place that the box -keyword allocates into when no place is supplied.

-

Traits

- - - - -
FnBox - [Unstable]

FnBox is a version of the FnOnce intended for use with boxed -closure objects. The idea is that where one would normally store a -Box<FnOnce()> in a data structure, you should use -Box<FnBox()>. The two traits behave essentially the same, except -that a FnBox closure can only be called if it is boxed. (Note -that FnBox may be deprecated in the future if Box<FnOnce()> -closures become directly usable.)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/boxed/sidebar-items.js b/doc/bitflags/__core/boxed/sidebar-items.js deleted file mode 100644 index 2f86fd25..00000000 --- a/doc/bitflags/__core/boxed/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["HEAP","A value that represents the heap. This is the default place that the `box` keyword allocates into when no place is supplied."]],"struct":[["Box","A pointer type for heap allocation."],["ExchangeHeapSingleton","This the singleton type used solely for `boxed::HEAP`."],["IntermediateBox","`IntermediateBox` represents uninitialized backing storage for `Box`."]],"trait":[["FnBox","`FnBox` is a version of the `FnOnce` intended for use with boxed closure objects. The idea is that where one would normally store a `Box` in a data structure, you should use `Box`. The two traits behave essentially the same, except that a `FnBox` closure can only be called if it is boxed. (Note that `FnBox` may be deprecated in the future if `Box` closures become directly usable.)"]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/boxed/struct.Box.html b/doc/bitflags/__core/boxed/struct.Box.html deleted file mode 100644 index 58fa7b79..00000000 --- a/doc/bitflags/__core/boxed/struct.Box.html +++ /dev/null @@ -1,287 +0,0 @@ - - - - - - - - - - bitflags::__core::boxed::Box - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::boxed::Box - - [−] - - [src]

-
pub struct Box<T> where T: ?Sized(_);
1.0.0

A pointer type for heap allocation.

- -

See the module-level documentation for more.

-

Methods

impl<T> Box<T>

fn new(x: T) -> Box<T>

-

Allocates memory on the heap and then places x into it.

- -

Examples

-
-let five = Box::new(5);
-

impl<T> Box<T> where T: ?Sized

unsafe fn from_raw(raw: *mut T) -> Box<T>1.4.0

-

Constructs a box from a raw pointer.

- -

After calling this function, the raw pointer is owned by the -resulting Box. Specifically, the Box destructor will call -the destructor of T and free the allocated memory. Since the -way Box allocates and releases memory is unspecified, the -only valid pointer to pass to this function is the one taken -from another Box via the Box::into_raw function.

- -

This function is unsafe because improper use may lead to -memory problems. For example, a double-free may occur if the -function is called twice on the same raw pointer.

-

fn into_raw(b: Box<T>) -> *mut T1.4.0

-

Consumes the Box, returning the wrapped raw pointer.

- -

After calling this function, the caller is responsible for the -memory previously managed by the Box. In particular, the -caller should properly destroy T and release the memory. The -proper way to do so is to convert the raw pointer back into a -Box with the Box::from_raw function.

- -

Examples

-
-let seventeen = Box::new(17);
-let raw = Box::into_raw(seventeen);
-let boxed_again = unsafe { Box::from_raw(raw) };
-

impl Box<Any + 'static>

fn downcast<T>(self) -> Result<Box<T>, Box<Any + 'static>> where T: Any

-

Attempt to downcast the box to a concrete type.

-

impl Box<Any + 'static + Send>

fn downcast<T>(self) -> Result<Box<T>, Box<Any + 'static + Send>> where T: Any

-

Attempt to downcast the box to a concrete type.

-

Trait Implementations

impl<'a, E> From<E> for Box<Error + 'a> where E: 'a + Error

fn from(err: E) -> Box<Error + 'a>

-

impl<'a, E> From<E> for Box<Error + 'a + Send + Sync> where E: Send + Sync + 'a + Error

fn from(err: E) -> Box<Error + 'a + Send + Sync>

-

impl From<String> for Box<Error + 'static + Send + Sync>

fn from(err: String) -> Box<Error + 'static + Send + Sync>

-

impl From<String> for Box<Error + 'static>1.7.0

fn from(str_err: String) -> Box<Error + 'static>

-

impl<'a, 'b> From<&'b str> for Box<Error + 'a + Send + Sync>

fn from(err: &'b str) -> Box<Error + 'a + Send + Sync>

-

impl<'a> From<&'a str> for Box<Error + 'static>1.7.0

fn from(err: &'a str) -> Box<Error + 'static>

-

impl<T> Error for Box<T> where T: Error1.7.0

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

impl<R> Read for Box<R> where R: Read + ?Sized

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-

impl<W> Write for Box<W> where W: Write + ?Sized

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

impl<S> Seek for Box<S> where S: Seek + ?Sized

fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>

-

impl<B> BufRead for Box<B> where B: BufRead + ?Sized

fn fill_buf(&mut self) -> Result<&[u8], Error>

-

fn consume(&mut self, amt: usize)

-

fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn split(self, byte: u8) -> Split<Self>

-

fn lines(self) -> Lines<Self>

-

impl<T> Boxed for Box<T>

type Data = T

-
Unstable (placement_new_protocol)

type Place = IntermediateBox<T>

-
Unstable (placement_new_protocol)

unsafe fn finalize(b: IntermediateBox<T>) -> Box<T>

-
Unstable (placement_new_protocol)

impl<T> Default for Box<T> where T: Default

fn default() -> Box<T>

-

impl<T> Default for Box<[T]>

fn default() -> Box<[T]>

-

impl<T> Clone for Box<T> where T: Clone

fn clone(&self) -> Box<T>

-

Returns a new box with a clone() of this box's contents.

- -

Examples

-
-let x = Box::new(5);
-let y = x.clone();
-

fn clone_from(&mut self, source: &Box<T>)

-

Copies source's contents into self without creating a new allocation.

- -

Examples

-
-let x = Box::new(5);
-let mut y = Box::new(10);
-
-y.clone_from(&x);
-
-assert_eq!(*y, 5);
-

impl Clone for Box<str>1.3.0

fn clone(&self) -> Box<str>

-

fn clone_from(&mut self, source: &Self)

-

impl<T> PartialEq<Box<T>> for Box<T> where T: PartialEq<T> + ?Sized

fn eq(&self, other: &Box<T>) -> bool

-

fn ne(&self, other: &Box<T>) -> bool

-

impl<T> PartialOrd<Box<T>> for Box<T> where T: PartialOrd<T> + ?Sized

fn partial_cmp(&self, other: &Box<T>) -> Option<Ordering>

-

fn lt(&self, other: &Box<T>) -> bool

-

fn le(&self, other: &Box<T>) -> bool

-

fn ge(&self, other: &Box<T>) -> bool

-

fn gt(&self, other: &Box<T>) -> bool

-

impl<T> Ord for Box<T> where T: Ord + ?Sized

fn cmp(&self, other: &Box<T>) -> Ordering

-

impl<T> Eq for Box<T> where T: Eq + ?Sized

impl<T> Hash for Box<T> where T: Hash + ?Sized

fn hash<H>(&self, state: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<T> From<T> for Box<T>1.6.0

fn from(t: T) -> Box<T>

-

impl<T> Display for Box<T> where T: Display + ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Debug for Box<T> where T: Debug + ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Pointer for Box<T> where T: ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Deref for Box<T> where T: ?Sized

type Target = T

-

fn deref(&self) -> &T

-

impl<T> DerefMut for Box<T> where T: ?Sized

fn deref_mut(&mut self) -> &mut T

-

impl<I> Iterator for Box<I> where I: Iterator + ?Sized

type Item = I::Item

-

fn next(&mut self) -> Option<I::Item>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<I> DoubleEndedIterator for Box<I> where I: DoubleEndedIterator + ?Sized

fn next_back(&mut self) -> Option<I::Item>

-

impl<I> ExactSizeIterator for Box<I> where I: ExactSizeIterator + ?Sized

fn len(&self) -> usize

-

impl<'a, A, R> FnOnce<A> for Box<FnBox<A, Output=R> + 'a>

type Output = R

-
Unstable (fnbox)

: Newly introduced

-

extern "rust-call" fn call_once(self, args: A) -> R

-
Unstable (fnbox)

: Newly introduced

-

impl<'a, A, R> FnOnce<A> for Box<FnBox<A, Output=R> + 'a + Send>

type Output = R

-
Unstable (fnbox)

: Newly introduced

-

extern "rust-call" fn call_once(self, args: A) -> R

-
Unstable (fnbox)

: Newly introduced

-

impl<T, U> CoerceUnsized<Box<U>> for Box<T> where T: Unsize<U> + ?Sized, U: ?Sized

impl<T> Clone for Box<[T]> where T: Clone1.3.0

fn clone(&self) -> Box<[T]>

-

fn clone_from(&mut self, source: &Self)

-

impl<T> Borrow<T> for Box<T> where T: ?Sized

fn borrow(&self) -> &T

-

impl<T> BorrowMut<T> for Box<T> where T: ?Sized

fn borrow_mut(&mut self) -> &mut T

-

impl<T> AsRef<T> for Box<T> where T: ?Sized1.5.0

fn as_ref(&self) -> &T

-

impl<T> AsMut<T> for Box<T> where T: ?Sized1.5.0

fn as_mut(&mut self) -> &mut T

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/boxed/struct.ExchangeHeapSingleton.html b/doc/bitflags/__core/boxed/struct.ExchangeHeapSingleton.html deleted file mode 100644 index f7729545..00000000 --- a/doc/bitflags/__core/boxed/struct.ExchangeHeapSingleton.html +++ /dev/null @@ -1,123 +0,0 @@ - - - - - - - - - - bitflags::__core::boxed::ExchangeHeapSingleton - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::boxed::ExchangeHeapSingleton - - [−] - - [src]

-
pub struct ExchangeHeapSingleton {
-    // some fields omitted
-}
Unstable (box_heap)

: may be renamed; uncertain about custom allocator design

-

This the singleton type used solely for boxed::HEAP.

-

Trait Implementations

impl<T> Placer<T> for ExchangeHeapSingleton

type Place = IntermediateBox<T>

-
Unstable (placement_in)

: placement box design is still being worked out.

-

fn make_place(self) -> IntermediateBox<T>

-
Unstable (placement_in)

: placement box design is still being worked out.

-

Derived Implementations

impl Clone for ExchangeHeapSingleton

fn clone(&self) -> ExchangeHeapSingleton

-
Unstable (box_heap)

: may be renamed; uncertain about custom allocator design

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Copy for ExchangeHeapSingleton

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/boxed/struct.IntermediateBox.html b/doc/bitflags/__core/boxed/struct.IntermediateBox.html deleted file mode 100644 index 8c9e0db3..00000000 --- a/doc/bitflags/__core/boxed/struct.IntermediateBox.html +++ /dev/null @@ -1,143 +0,0 @@ - - - - - - - - - - bitflags::__core::boxed::IntermediateBox - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::boxed::IntermediateBox - - [−] - - [src]

-
pub struct IntermediateBox<T> where T: ?Sized {
-    // some fields omitted
-}
Unstable (placement_in)

: placement box design is still being worked out.

-

IntermediateBox represents uninitialized backing storage for Box.

- -

FIXME (pnkfelix): Ideally we would just reuse Box<T> instead of -introducing a separate IntermediateBox<T>; but then you hit -issues when you e.g. attempt to destructure an instance of Box, -since it is a lang item and so it gets special handling by the -compiler. Easier just to make this parallel type for now.

- -

FIXME (pnkfelix): Currently the box protocol only supports -creating instances of sized types. This IntermediateBox is -designed to be forward-compatible with a future protocol that -supports creating instances of unsized types; that is why the type -parameter has the ?Sized generalization marker, and is also why -this carries an explicit size. However, it probably does not need -to carry the explicit alignment; that is just a work-around for -the fact that the align_of intrinsic currently requires the -input type to be Sized (which I do not think is strictly -necessary).

-

Trait Implementations

impl<T> Place<T> for IntermediateBox<T>

fn pointer(&mut self) -> *mut T

-
Unstable (placement_in)

: placement box design is still being worked out.

-

impl<T> BoxPlace<T> for IntermediateBox<T>

fn make_place() -> IntermediateBox<T>

-
Unstable (placement_in)

: placement box design is still being worked out.

-

impl<T> InPlace<T> for IntermediateBox<T>

type Owner = Box<T>

-
Unstable (placement_in)

: placement box design is still being worked out.

-

unsafe fn finalize(self) -> Box<T>

-
Unstable (placement_in)

: placement box design is still being worked out.

-

impl<T> Drop for IntermediateBox<T> where T: ?Sized

fn drop(&mut self)

-
Unstable (placement_in)

: placement box design is still being worked out.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/boxed/trait.FnBox.html b/doc/bitflags/__core/boxed/trait.FnBox.html deleted file mode 100644 index d18f3bfc..00000000 --- a/doc/bitflags/__core/boxed/trait.FnBox.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - - - - - - - bitflags::__core::boxed::FnBox - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::boxed::FnBox - - [−] - - [src]

-
pub trait FnBox<A> {
-    type Output;
-    fn call_box(self: Box<Self>, args: A) -> Self::Output;
-}
Unstable (fnbox)

: Newly introduced

-

FnBox is a version of the FnOnce intended for use with boxed -closure objects. The idea is that where one would normally store a -Box<FnOnce()> in a data structure, you should use -Box<FnBox()>. The two traits behave essentially the same, except -that a FnBox closure can only be called if it is boxed. (Note -that FnBox may be deprecated in the future if Box<FnOnce()> -closures become directly usable.)

- -

Example

-

Here is a snippet of code which creates a hashmap full of boxed -once closures and then removes them one by one, calling each -closure as it is removed. Note that the type of the closures -stored in the map is Box<FnBox() -> i32> and not Box<FnOnce() -> i32>.

- -
-#![feature(fnbox)]
-
-use std::boxed::FnBox;
-use std::collections::HashMap;
-
-fn make_map() -> HashMap<i32, Box<FnBox() -> i32>> {
-    let mut map: HashMap<i32, Box<FnBox() -> i32>> = HashMap::new();
-    map.insert(1, Box::new(|| 22));
-    map.insert(2, Box::new(|| 44));
-    map
-}
-
-fn main() {
-    let mut map = make_map();
-    for i in &[1, 2] {
-        let f = map.remove(&i).unwrap();
-        assert_eq!(f(), i * 22);
-    }
-}
-
-

Associated Types

-
-

type Output

Unstable (fnbox)

: Newly introduced

-
-

Required Methods

-
-

fn call_box(self: Box<Self>, args: A) -> Self::Output

Unstable (fnbox)

: Newly introduced

-
-

Implementors

-
    -
  • impl<A, F> FnBox for F where F: FnOnce<A>
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/cell/enum.BorrowState.html b/doc/bitflags/__core/cell/enum.BorrowState.html deleted file mode 100644 index c063584b..00000000 --- a/doc/bitflags/__core/cell/enum.BorrowState.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::cell::BorrowState - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::cell::BorrowState - - [−] - - [src]

-
pub enum BorrowState {
-    Reading,
-    Writing,
-    Unused,
-}
Unstable (borrow_state)

An enumeration of values returned from the state method on a RefCell<T>.

-

Variants

-
Reading
Unstable (borrow_state)

The cell is currently being read, there is at least one active borrow.

-
Writing
Unstable (borrow_state)

The cell is currently being written to, there is an active borrow_mut.

-
Unused
Unstable (borrow_state)

There are no outstanding borrows on this cell.

-

Trait Implementations

Derived Implementations

impl Debug for BorrowState

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
Unstable (borrow_state)

impl Eq for BorrowState

impl PartialEq<BorrowState> for BorrowState

fn eq(&self, __arg_0: &BorrowState) -> bool

-
Unstable (borrow_state)

fn ne(&self, other: &Rhs) -> bool1.0.0

-

impl Clone for BorrowState

fn clone(&self) -> BorrowState

-
Unstable (borrow_state)

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Copy for BorrowState

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/cell/index.html b/doc/bitflags/__core/cell/index.html deleted file mode 100644 index 9522cade..00000000 --- a/doc/bitflags/__core/cell/index.html +++ /dev/null @@ -1,281 +0,0 @@ - - - - - - - - - - bitflags::__core::cell - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::cell - - [−] - - [src]

-

Shareable mutable containers.

- -

Values of the Cell<T> and RefCell<T> types may be mutated through shared references (i.e. -the common &T type), whereas most Rust types can only be mutated through unique (&mut T) -references. We say that Cell<T> and RefCell<T> provide 'interior mutability', in contrast -with typical Rust types that exhibit 'inherited mutability'.

- -

Cell types come in two flavors: Cell<T> and RefCell<T>. Cell<T> provides get and set -methods that change the interior value with a single method call. Cell<T> though is only -compatible with types that implement Copy. For other types, one must use the RefCell<T> -type, acquiring a write lock before mutating.

- -

RefCell<T> uses Rust's lifetimes to implement 'dynamic borrowing', a process whereby one can -claim temporary, exclusive, mutable access to the inner value. Borrows for RefCell<T>s are -tracked 'at runtime', unlike Rust's native reference types which are entirely tracked -statically, at compile time. Because RefCell<T> borrows are dynamic it is possible to attempt -to borrow a value that is already mutably borrowed; when this happens it results in thread -panic.

- -

When to choose interior mutability

-

The more common inherited mutability, where one must have unique access to mutate a value, is -one of the key language elements that enables Rust to reason strongly about pointer aliasing, -statically preventing crash bugs. Because of that, inherited mutability is preferred, and -interior mutability is something of a last resort. Since cell types enable mutation where it -would otherwise be disallowed though, there are occasions when interior mutability might be -appropriate, or even must be used, e.g.

- -
    -
  • Introducing mutability 'inside' of something immutable
    • -
  • Implementation details of logically-immutable methods.
    • -
  • Mutating implementations of Clone.
    • -
- -

Introducing mutability 'inside' of something immutable

-

Many shared smart pointer types, including Rc<T> and Arc<T>, provide containers that can be -cloned and shared between multiple parties. Because the contained values may be -multiply-aliased, they can only be borrowed with &, not &mut. Without cells it would be -impossible to mutate data inside of these smart pointers at all.

- -

It's very common then to put a RefCell<T> inside shared pointer types to reintroduce -mutability:

- -
-use std::collections::HashMap;
-use std::cell::RefCell;
-use std::rc::Rc;
-
-fn main() {
-    let shared_map: Rc<RefCell<_>> = Rc::new(RefCell::new(HashMap::new()));
-    shared_map.borrow_mut().insert("africa", 92388);
-    shared_map.borrow_mut().insert("kyoto", 11837);
-    shared_map.borrow_mut().insert("piccadilly", 11826);
-    shared_map.borrow_mut().insert("marbles", 38);
-}
- -

Note that this example uses Rc<T> and not Arc<T>. RefCell<T>s are for single-threaded -scenarios. Consider using RwLock<T> or Mutex<T> if you need shared mutability in a -multi-threaded situation.

- -

Implementation details of logically-immutable methods

-

Occasionally it may be desirable not to expose in an API that there is mutation happening -"under the hood". This may be because logically the operation is immutable, but e.g. caching -forces the implementation to perform mutation; or because you must employ mutation to implement -a trait method that was originally defined to take &self.

- -
-use std::cell::RefCell;
-
-struct Graph {
-    edges: Vec<(i32, i32)>,
-    span_tree_cache: RefCell<Option<Vec<(i32, i32)>>>
-}
-
-impl Graph {
-    fn minimum_spanning_tree(&self) -> Vec<(i32, i32)> {
-        // Create a new scope to contain the lifetime of the
-        // dynamic borrow
-        {
-            // Take a reference to the inside of cache cell
-            let mut cache = self.span_tree_cache.borrow_mut();
-            if cache.is_some() {
-                return cache.as_ref().unwrap().clone();
-            }
-
-            let span_tree = self.calc_span_tree();
-            *cache = Some(span_tree);
-        }
-
-        // Recursive call to return the just-cached value.
-        // Note that if we had not let the previous borrow
-        // of the cache fall out of scope then the subsequent
-        // recursive borrow would cause a dynamic thread panic.
-        // This is the major hazard of using `RefCell`.
-        self.minimum_spanning_tree()
-    }
-}
- -

Mutating implementations of Clone

-

This is simply a special - but common - case of the previous: hiding mutability for operations -that appear to be immutable. The clone method is expected to not change the source value, and -is declared to take &self, not &mut self. Therefore any mutation that happens in the -clone method must use cell types. For example, Rc<T> maintains its reference counts within a -Cell<T>.

- -
-use std::cell::Cell;
-
-struct Rc<T> {
-    ptr: *mut RcBox<T>
-}
-
-struct RcBox<T> {
-    value: T,
-    refcount: Cell<usize>
-}
-
-impl<T> Clone for Rc<T> {
-    fn clone(&self) -> Rc<T> {
-        unsafe {
-            (*self.ptr).refcount.set((*self.ptr).refcount.get() + 1);
-            Rc { ptr: self.ptr }
-        }
-    }
-}
-

Structs

- - - - - - - - - - - - - - - - - - - - -
Cell -

A mutable memory location that admits only Copy data.

-
Ref -

Wraps a borrowed reference to a value in a RefCell box. -A wrapper type for an immutably borrowed value from a RefCell<T>.

-
RefCell -

A mutable memory location with dynamically checked borrow rules

-
RefMut -

A wrapper type for a mutably borrowed value from a RefCell<T>.

-
UnsafeCell -

The core primitive for interior mutability in Rust.

-

Enums

- - - - -
BorrowState - [Unstable]

An enumeration of values returned from the state method on a RefCell<T>.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/cell/sidebar-items.js b/doc/bitflags/__core/cell/sidebar-items.js deleted file mode 100644 index aa20866a..00000000 --- a/doc/bitflags/__core/cell/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["BorrowState","An enumeration of values returned from the `state` method on a `RefCell`."]],"struct":[["Cell","A mutable memory location that admits only `Copy` data."],["Ref","Wraps a borrowed reference to a value in a `RefCell` box. A wrapper type for an immutably borrowed value from a `RefCell`."],["RefCell","A mutable memory location with dynamically checked borrow rules"],["RefMut","A wrapper type for a mutably borrowed value from a `RefCell`."],["UnsafeCell","The core primitive for interior mutability in Rust."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/cell/struct.Cell.html b/doc/bitflags/__core/cell/struct.Cell.html deleted file mode 100644 index ede728df..00000000 --- a/doc/bitflags/__core/cell/struct.Cell.html +++ /dev/null @@ -1,163 +0,0 @@ - - - - - - - - - - bitflags::__core::cell::Cell - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::cell::Cell - - [−] - - [src]

-
pub struct Cell<T> {
-    // some fields omitted
-}
1.0.0

A mutable memory location that admits only Copy data.

- -

See the module-level documentation for more.

-

Methods

impl<T> Cell<T> where T: Copy

const fn new(value: T) -> Cell<T>

-

Creates a new Cell containing the given value.

- -

Examples

-
-use std::cell::Cell;
-
-let c = Cell::new(5);
-

fn get(&self) -> T

-

Returns a copy of the contained value.

- -

Examples

-
-use std::cell::Cell;
-
-let c = Cell::new(5);
-
-let five = c.get();
-

fn set(&self, value: T)

-

Sets the contained value.

- -

Examples

-
-use std::cell::Cell;
-
-let c = Cell::new(5);
-
-c.set(10);
-

fn as_unsafe_cell(&self) -> &UnsafeCell<T>

-
Unstable (as_unsafe_cell)

Returns a reference to the underlying UnsafeCell.

- -

Examples

-
-#![feature(as_unsafe_cell)]
-
-use std::cell::Cell;
-
-let c = Cell::new(5);
-
-let uc = c.as_unsafe_cell();
-

Trait Implementations

impl<T> Send for Cell<T> where T: Send

impl<T> !Sync for Cell<T>

impl<T> Clone for Cell<T> where T: Copy

fn clone(&self) -> Cell<T>

-

fn clone_from(&mut self, source: &Self)

-

impl<T> Default for Cell<T> where T: Copy + Default

fn default() -> Cell<T>

-

impl<T> PartialEq<Cell<T>> for Cell<T> where T: Copy + PartialEq<T>

fn eq(&self, other: &Cell<T>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<T> Eq for Cell<T> where T: Copy + Eq1.2.0

impl<T> Debug for Cell<T> where T: Copy + Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/cell/struct.Ref.html b/doc/bitflags/__core/cell/struct.Ref.html deleted file mode 100644 index 7ec49a4c..00000000 --- a/doc/bitflags/__core/cell/struct.Ref.html +++ /dev/null @@ -1,168 +0,0 @@ - - - - - - - - - - bitflags::__core::cell::Ref - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::cell::Ref - - [−] - - [src]

-
pub struct Ref<'b, T> where T: 'b + ?Sized {
-    // some fields omitted
-}
1.0.0

Wraps a borrowed reference to a value in a RefCell box. -A wrapper type for an immutably borrowed value from a RefCell<T>.

- -

See the module-level documentation for more.

-

Methods

impl<'b, T> Ref<'b, T> where T: ?Sized

fn clone(orig: &Ref<'b, T>) -> Ref<'b, T>

-
Unstable (cell_extras)

: likely to be moved to a method, pending language changes

-

Copies a Ref.

- -

The RefCell is already immutably borrowed, so this cannot fail.

- -

This is an associated function that needs to be used as -Ref::clone(...). A Clone implementation or a method would interfere -with the widespread use of r.borrow().clone() to clone the contents of -a RefCell.

-

fn map<U, F>(orig: Ref<'b, T>, f: F) -> Ref<'b, U> where F: FnOnce(&T) -> &U, U: ?Sized1.8.0

-

Make a new Ref for a component of the borrowed data.

- -

The RefCell is already immutably borrowed, so this cannot fail.

- -

This is an associated function that needs to be used as Ref::map(...). -A method would interfere with methods of the same name on the contents -of a RefCell used through Deref.

- -

Example

-
-use std::cell::{RefCell, Ref};
-
-let c = RefCell::new((5, 'b'));
-let b1: Ref<(u32, char)> = c.borrow();
-let b2: Ref<u32> = Ref::map(b1, |t| &t.0);
-assert_eq!(*b2, 5)
-

fn filter_map<U, F>(orig: Ref<'b, T>, f: F) -> Option<Ref<'b, U>> where F: FnOnce(&T) -> Option<&U>, U: ?Sized

-
Deprecated since 1.8.0

: can be built on Ref::map: https://crates.io/crates/ref_filter_map

-
Unstable (cell_extras)

: can be built on Ref::map: https://crates.io/crates/ref_filter_map

-

Make a new Ref for an optional component of the borrowed data, e.g. an -enum variant.

- -

The RefCell is already immutably borrowed, so this cannot fail.

- -

This is an associated function that needs to be used as -Ref::filter_map(...). A method would interfere with methods of the -same name on the contents of a RefCell used through Deref.

- -

Example

-
-use std::cell::{RefCell, Ref};
-
-let c = RefCell::new(Ok(5));
-let b1: Ref<Result<u32, ()>> = c.borrow();
-let b2: Ref<u32> = Ref::filter_map(b1, |o| o.as_ref().ok()).unwrap();
-assert_eq!(*b2, 5)
-

Trait Implementations

impl<'b, T> Deref for Ref<'b, T> where T: ?Sized

type Target = T

-

fn deref(&self) -> &T

-

impl<'b, T, U> CoerceUnsized<Ref<'b, U>> for Ref<'b, T> where U: ?Sized, T: Unsize<U> + ?Sized

impl<'b, T> Debug for Ref<'b, T> where T: Debug + ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/cell/struct.RefCell.html b/doc/bitflags/__core/cell/struct.RefCell.html deleted file mode 100644 index b3f399f4..00000000 --- a/doc/bitflags/__core/cell/struct.RefCell.html +++ /dev/null @@ -1,217 +0,0 @@ - - - - - - - - - - bitflags::__core::cell::RefCell - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::cell::RefCell - - [−] - - [src]

-
pub struct RefCell<T> where T: ?Sized {
-    // some fields omitted
-}
1.0.0

A mutable memory location with dynamically checked borrow rules

- -

See the module-level documentation for more.

-

Methods

impl<T> RefCell<T>

const fn new(value: T) -> RefCell<T>

-

Creates a new RefCell containing value.

- -

Examples

-
-use std::cell::RefCell;
-
-let c = RefCell::new(5);
-

fn into_inner(self) -> T

-

Consumes the RefCell, returning the wrapped value.

- -

Examples

-
-use std::cell::RefCell;
-
-let c = RefCell::new(5);
-
-let five = c.into_inner();
-

impl<T> RefCell<T> where T: ?Sized

fn borrow_state(&self) -> BorrowState

-
Unstable (borrow_state)

Query the current state of this RefCell

- -

The returned value can be dispatched on to determine if a call to -borrow or borrow_mut would succeed.

-

fn borrow(&self) -> Ref<T>

-

Immutably borrows the wrapped value.

- -

The borrow lasts until the returned Ref exits scope. Multiple -immutable borrows can be taken out at the same time.

- -

Panics

-

Panics if the value is currently mutably borrowed.

- -

Examples

-
-use std::cell::RefCell;
-
-let c = RefCell::new(5);
-
-let borrowed_five = c.borrow();
-let borrowed_five2 = c.borrow();
- -

An example of panic:

- -
-use std::cell::RefCell;
-use std::thread;
-
-let result = thread::spawn(move || {
-   let c = RefCell::new(5);
-   let m = c.borrow_mut();
-
-   let b = c.borrow(); // this causes a panic
-}).join();
-
-assert!(result.is_err());
-

fn borrow_mut(&self) -> RefMut<T>

-

Mutably borrows the wrapped value.

- -

The borrow lasts until the returned RefMut exits scope. The value -cannot be borrowed while this borrow is active.

- -

Panics

-

Panics if the value is currently borrowed.

- -

Examples

-
-use std::cell::RefCell;
-
-let c = RefCell::new(5);
-
-*c.borrow_mut() = 7;
-
-assert_eq!(*c.borrow(), 7);
- -

An example of panic:

- -
-use std::cell::RefCell;
-use std::thread;
-
-let result = thread::spawn(move || {
-   let c = RefCell::new(5);
-   let m = c.borrow();
-
-   let b = c.borrow_mut(); // this causes a panic
-}).join();
-
-assert!(result.is_err());
-

unsafe fn as_unsafe_cell(&self) -> &UnsafeCell<T>

-
Unstable (as_unsafe_cell)

Returns a reference to the underlying UnsafeCell.

- -

This can be used to circumvent RefCell's safety checks.

- -

This function is unsafe because UnsafeCell's field is public.

-

Trait Implementations

impl<T> Send for RefCell<T> where T: Send + ?Sized

impl<T> !Sync for RefCell<T> where T: ?Sized

impl<T> Clone for RefCell<T> where T: Clone

fn clone(&self) -> RefCell<T>

-

fn clone_from(&mut self, source: &Self)

-

impl<T> Default for RefCell<T> where T: Default

fn default() -> RefCell<T>

-

impl<T> PartialEq<RefCell<T>> for RefCell<T> where T: PartialEq<T> + ?Sized

fn eq(&self, other: &RefCell<T>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<T> Eq for RefCell<T> where T: Eq + ?Sized1.2.0

impl<T> Debug for RefCell<T> where T: Debug + ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/cell/struct.RefMut.html b/doc/bitflags/__core/cell/struct.RefMut.html deleted file mode 100644 index 58e1bf8a..00000000 --- a/doc/bitflags/__core/cell/struct.RefMut.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - bitflags::__core::cell::RefMut - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::cell::RefMut - - [−] - - [src]

-
pub struct RefMut<'b, T> where T: 'b + ?Sized {
-    // some fields omitted
-}
1.0.0

A wrapper type for a mutably borrowed value from a RefCell<T>.

- -

See the module-level documentation for more.

-

Methods

impl<'b, T> RefMut<'b, T> where T: ?Sized

fn map<U, F>(orig: RefMut<'b, T>, f: F) -> RefMut<'b, U> where F: FnOnce(&mut T) -> &mut U, U: ?Sized1.8.0

-

Make a new RefMut for a component of the borrowed data, e.g. an enum -variant.

- -

The RefCell is already mutably borrowed, so this cannot fail.

- -

This is an associated function that needs to be used as -RefMut::map(...). A method would interfere with methods of the same -name on the contents of a RefCell used through Deref.

- -

Example

-
-use std::cell::{RefCell, RefMut};
-
-let c = RefCell::new((5, 'b'));
-{
-    let b1: RefMut<(u32, char)> = c.borrow_mut();
-    let mut b2: RefMut<u32> = RefMut::map(b1, |t| &mut t.0);
-    assert_eq!(*b2, 5);
-    *b2 = 42;
-}
-assert_eq!(*c.borrow(), (42, 'b'));
-

fn filter_map<U, F>(orig: RefMut<'b, T>, f: F) -> Option<RefMut<'b, U>> where U: ?Sized, F: FnOnce(&mut T) -> Option<&mut U>

-
Deprecated since 1.8.0

: can be built on RefMut::map: https://crates.io/crates/ref_filter_map

-
Unstable (cell_extras)

: can be built on RefMut::map: https://crates.io/crates/ref_filter_map

-

Make a new RefMut for an optional component of the borrowed data, e.g. -an enum variant.

- -

The RefCell is already mutably borrowed, so this cannot fail.

- -

This is an associated function that needs to be used as -RefMut::filter_map(...). A method would interfere with methods of the -same name on the contents of a RefCell used through Deref.

- -

Example

-
-use std::cell::{RefCell, RefMut};
-
-let c = RefCell::new(Ok(5));
-{
-    let b1: RefMut<Result<u32, ()>> = c.borrow_mut();
-    let mut b2: RefMut<u32> = RefMut::filter_map(b1, |o| {
-        o.as_mut().ok()
-    }).unwrap();
-    assert_eq!(*b2, 5);
-    *b2 = 42;
-}
-assert_eq!(*c.borrow(), Ok(42));
-

Trait Implementations

impl<'b, T> Deref for RefMut<'b, T> where T: ?Sized

type Target = T

-

fn deref(&self) -> &T

-

impl<'b, T> DerefMut for RefMut<'b, T> where T: ?Sized

fn deref_mut(&mut self) -> &mut T

-

impl<'b, T, U> CoerceUnsized<RefMut<'b, U>> for RefMut<'b, T> where U: ?Sized, T: Unsize<U> + ?Sized

impl<'b, T> Debug for RefMut<'b, T> where T: Debug + ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/cell/struct.UnsafeCell.html b/doc/bitflags/__core/cell/struct.UnsafeCell.html deleted file mode 100644 index 1582cae2..00000000 --- a/doc/bitflags/__core/cell/struct.UnsafeCell.html +++ /dev/null @@ -1,170 +0,0 @@ - - - - - - - - - - bitflags::__core::cell::UnsafeCell - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::cell::UnsafeCell - - [−] - - [src]

-
pub struct UnsafeCell<T> where T: ?Sized {
-    // some fields omitted
-}
1.0.0

The core primitive for interior mutability in Rust.

- -

UnsafeCell<T> is a type that wraps some T and indicates unsafe interior operations on the -wrapped type. Types with an UnsafeCell<T> field are considered to have an 'unsafe interior'. -The UnsafeCell<T> type is the only legal way to obtain aliasable data that is considered -mutable. In general, transmuting an &T type into an &mut T is considered undefined behavior.

- -

Types like Cell<T> and RefCell<T> use this type to wrap their internal data.

- -

Examples

-
-use std::cell::UnsafeCell;
-use std::marker::Sync;
-
-struct NotThreadSafe<T> {
-    value: UnsafeCell<T>,
-}
-
-unsafe impl<T> Sync for NotThreadSafe<T> {}
-

Methods

impl<T> UnsafeCell<T>

const fn new(value: T) -> UnsafeCell<T>

-

Constructs a new instance of UnsafeCell which will wrap the specified -value.

- -

All access to the inner value through methods is unsafe.

- -

Examples

-
-use std::cell::UnsafeCell;
-
-let uc = UnsafeCell::new(5);
-

unsafe fn into_inner(self) -> T

-

Unwraps the value.

- -

Safety

-

This function is unsafe because this thread or another thread may currently be -inspecting the inner value.

- -

Examples

-
-use std::cell::UnsafeCell;
-
-let uc = UnsafeCell::new(5);
-
-let five = unsafe { uc.into_inner() };
-

impl<T> UnsafeCell<T> where T: ?Sized

fn get(&self) -> *mut T

-

Gets a mutable pointer to the wrapped value.

- -

Examples

-
-use std::cell::UnsafeCell;
-
-let uc = UnsafeCell::new(5);
-
-let five = uc.get();
-

Trait Implementations

impl<T> !RefUnwindSafe for UnsafeCell<T> where T: ?Sized1.9.0

impl<T> !Sync for UnsafeCell<T> where T: ?Sized

impl<T> Default for UnsafeCell<T> where T: Default1.9.0

fn default() -> UnsafeCell<T>

-

impl<T> Debug for UnsafeCell<T> where T: Debug + ?Sized1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/constant.MAX.html b/doc/bitflags/__core/char/constant.MAX.html deleted file mode 100644 index 749df5d0..00000000 --- a/doc/bitflags/__core/char/constant.MAX.html +++ /dev/null @@ -1,117 +0,0 @@ - - - - - - - - - - bitflags::__core::char::MAX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::char::MAX - - [−] - - [src]

-
pub const MAX: char = '\u{10ffff}'

The highest valid code point a char can have.

- -

A char is a Unicode Scalar Value, which means that it is a Code -Point, but only ones within a certain range. MAX is the highest valid -code point that's a valid Unicode Scalar Value.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/constant.REPLACEMENT_CHARACTER.html b/doc/bitflags/__core/char/constant.REPLACEMENT_CHARACTER.html deleted file mode 100644 index 58a8daa6..00000000 --- a/doc/bitflags/__core/char/constant.REPLACEMENT_CHARACTER.html +++ /dev/null @@ -1,117 +0,0 @@ - - - - - - - - - - bitflags::__core::char::REPLACEMENT_CHARACTER - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::char::REPLACEMENT_CHARACTER - - [−] - - [src]

-
pub const REPLACEMENT_CHARACTER: char = '\u{fffd}'

U+FFFD REPLACEMENT CHARACTER (�) is used in Unicode to represent a -decoding error.

- -

It can occur, for example, when giving ill-formed UTF-8 bytes to -String::from_utf8_lossy.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/constant.UNICODE_VERSION.html b/doc/bitflags/__core/char/constant.UNICODE_VERSION.html deleted file mode 100644 index fd2cc577..00000000 --- a/doc/bitflags/__core/char/constant.UNICODE_VERSION.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::char::UNICODE_VERSION - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::char::UNICODE_VERSION - - [−] - - [src]

-
pub const UNICODE_VERSION: (u64, u64, u64) = (8, 0, 0)
Unstable (unicode)

The version of Unicode -that the unicode parts of CharExt and UnicodeStrPrelude traits are based on.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/fn.decode_utf16.html b/doc/bitflags/__core/char/fn.decode_utf16.html deleted file mode 100644 index 720781a6..00000000 --- a/doc/bitflags/__core/char/fn.decode_utf16.html +++ /dev/null @@ -1,153 +0,0 @@ - - - - - - - - - - bitflags::__core::char::decode_utf16 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::char::decode_utf16 - - [−] - - [src]

-
pub fn decode_utf16<I>(iter: I) -> DecodeUtf16<I::IntoIter> where I: IntoIterator<Item=u16>
1.9.0

Create an iterator over the UTF-16 encoded code points in iter, -returning unpaired surrogates as Errs.

- -

Examples

-

Basic usage:

- -
-use std::char::decode_utf16;
-
-fn main() {
-    // 𝄞mus<invalid>ic<invalid>
-    let v = [0xD834, 0xDD1E, 0x006d, 0x0075,
-             0x0073, 0xDD1E, 0x0069, 0x0063,
-             0xD834];
-
-    assert_eq!(decode_utf16(v.iter().cloned())
-                           .map(|r| r.map_err(|e| e.unpaired_surrogate()))
-                           .collect::<Vec<_>>(),
-               vec![Ok('𝄞'),
-                    Ok('m'), Ok('u'), Ok('s'),
-                    Err(0xDD1E),
-                    Ok('i'), Ok('c'),
-                    Err(0xD834)]);
-}
- -

A lossy decoder can be obtained by replacing Err results with the replacement character:

- -
-use std::char::{decode_utf16, REPLACEMENT_CHARACTER};
-
-fn main() {
-    // 𝄞mus<invalid>ic<invalid>
-    let v = [0xD834, 0xDD1E, 0x006d, 0x0075,
-             0x0073, 0xDD1E, 0x0069, 0x0063,
-             0xD834];
-
-    assert_eq!(decode_utf16(v.iter().cloned())
-                   .map(|r| r.unwrap_or(REPLACEMENT_CHARACTER))
-                   .collect::<String>(),
-               "𝄞mus�ic�");
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/fn.from_digit.html b/doc/bitflags/__core/char/fn.from_digit.html deleted file mode 100644 index ff3b8c47..00000000 --- a/doc/bitflags/__core/char/fn.from_digit.html +++ /dev/null @@ -1,161 +0,0 @@ - - - - - - - - - - bitflags::__core::char::from_digit - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::char::from_digit - - [−] - - [src]

-
pub fn from_digit(num: u32, radix: u32) -> Option<char>
1.0.0

Converts a digit in the given radix to a char.

- -

A 'radix' here is sometimes also called a 'base'. A radix of two -indicates a binary number, a radix of ten, decimal, and a radix of -sixteen, hexadecimal, to give some common values. Arbitrary -radicum are supported.

- -

from_digit() will return None if the input is not a digit in -the given radix.

- -

Panics

-

Panics if given a radix larger than 36.

- -

Examples

-

Basic usage:

- -
-use std::char;
-
-let c = char::from_digit(4, 10);
-
-assert_eq!(Some('4'), c);
-
-// Decimal 11 is a single digit in base 16
-let c = char::from_digit(11, 16);
-
-assert_eq!(Some('b'), c);
- -

Returning None when the input is not a digit:

- -
-use std::char;
-
-let c = char::from_digit(20, 10);
-
-assert_eq!(None, c);
- -

Passing a large radix, causing a panic:

- -
-use std::thread;
-use std::char;
-
-let result = thread::spawn(|| {
-    // this panics
-    let c = char::from_digit(1, 37);
-}).join();
-
-assert!(result.is_err());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/fn.from_u32.html b/doc/bitflags/__core/char/fn.from_u32.html deleted file mode 100644 index f8092531..00000000 --- a/doc/bitflags/__core/char/fn.from_u32.html +++ /dev/null @@ -1,148 +0,0 @@ - - - - - - - - - - bitflags::__core::char::from_u32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::char::from_u32 - - [−] - - [src]

-
pub fn from_u32(i: u32) -> Option<char>
1.0.0

Converts a u32 to a char.

- -

Note that all chars are valid u32s, and can be casted to one with -as:

- -
-let c = '💯';
-let i = c as u32;
-
-assert_eq!(128175, i);
- -

However, the reverse is not true: not all valid u32s are valid -chars. from_u32() will return None if the input is not a valid value -for a char.

- -

For an unsafe version of this function which ignores these checks, see -from_u32_unchecked().

- -

Examples

-

Basic usage:

- -
-use std::char;
-
-let c = char::from_u32(0x2764);
-
-assert_eq!(Some('❤'), c);
- -

Returning None when the input is not a valid char:

- -
-use std::char;
-
-let c = char::from_u32(0x110000);
-
-assert_eq!(None, c);
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/fn.from_u32_unchecked.html b/doc/bitflags/__core/char/fn.from_u32_unchecked.html deleted file mode 100644 index bdd96f22..00000000 --- a/doc/bitflags/__core/char/fn.from_u32_unchecked.html +++ /dev/null @@ -1,141 +0,0 @@ - - - - - - - - - - bitflags::__core::char::from_u32_unchecked - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::char::from_u32_unchecked - - [−] - - [src]

-
pub unsafe fn from_u32_unchecked(i: u32) -> char
1.5.0

Converts a u32 to a char, ignoring validity.

- -

Note that all chars are valid u32s, and can be casted to one with -as:

- -
-let c = '💯';
-let i = c as u32;
-
-assert_eq!(128175, i);
- -

However, the reverse is not true: not all valid u32s are valid -chars. from_u32_unchecked() will ignore this, and blindly cast to -char, possibly creating an invalid one.

- -

Safety

-

This function is unsafe, as it may construct invalid char values.

- -

For a safe version of this function, see the from_u32() function.

- -

Examples

-

Basic usage:

- -
-use std::char;
-
-let c = unsafe { char::from_u32_unchecked(0x2764) };
-
-assert_eq!('❤', c);
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/index.html b/doc/bitflags/__core/char/index.html deleted file mode 100644 index d1ae83ee..00000000 --- a/doc/bitflags/__core/char/index.html +++ /dev/null @@ -1,240 +0,0 @@ - - - - - - - - - - bitflags::__core::char - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::char - - [−] - - [src]

-

A character type.

- -

The char type represents a single character. More specifically, since -'character' isn't a well-defined concept in Unicode, char is a 'Unicode -scalar value', which is similar to, but not the same as, a 'Unicode code -point'.

- -

This module exists for technical reasons, the primary documentation for -char is directly on the char primitive type -itself.

- -

This module is the home of the iterator implementations for the iterators -implemented on char, as well as some useful constants and conversion -functions that convert various types to char.

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
DecodeUtf16 -

An iterator that decodes UTF-16 encoded code points from an iterator of u16s.

-
DecodeUtf16Error -

An iterator that decodes UTF-16 encoded code points from an iterator of u16s.

-
EscapeDefault -

An iterator that yields the literal escape code of a char.

-
EscapeUnicode -

Returns an iterator that yields the hexadecimal Unicode escape of a -character, as chars.

-
ToLowercase -

Returns an iterator that yields the lowercase equivalent of a char.

-
ToUppercase -

Returns an iterator that yields the uppercase equivalent of a char.

-
EncodeUtf16 - [Unstable]

An iterator over u16 entries represending the UTF-16 encoding of a char -value.

-
EncodeUtf8 - [Unstable]

An iterator over u8 entries represending the UTF-8 encoding of a char -value.

-

Constants

- - - - - - - - - - - - -
MAX -

The highest valid code point a char can have.

-
REPLACEMENT_CHARACTER -

U+FFFD REPLACEMENT CHARACTER (�) is used in Unicode to represent a -decoding error.

-
UNICODE_VERSION - [Unstable]

The version of Unicode -that the unicode parts of CharExt and UnicodeStrPrelude traits are based on.

-

Functions

- - - - - - - - - - - - - - - - -
decode_utf16 -

Create an iterator over the UTF-16 encoded code points in iter, -returning unpaired surrogates as Errs.

-
from_digit -

Converts a digit in the given radix to a char.

-
from_u32 -

Converts a u32 to a char.

-
from_u32_unchecked -

Converts a u32 to a char, ignoring validity.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/sidebar-items.js b/doc/bitflags/__core/char/sidebar-items.js deleted file mode 100644 index 1246a1da..00000000 --- a/doc/bitflags/__core/char/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["MAX","The highest valid code point a `char` can have."],["REPLACEMENT_CHARACTER","`U+FFFD REPLACEMENT CHARACTER` (�) is used in Unicode to represent a decoding error."],["UNICODE_VERSION","The version of Unicode that the unicode parts of `CharExt` and `UnicodeStrPrelude` traits are based on."]],"fn":[["decode_utf16","Create an iterator over the UTF-16 encoded code points in `iter`, returning unpaired surrogates as `Err`s."],["from_digit","Converts a digit in the given radix to a `char`."],["from_u32","Converts a `u32` to a `char`."],["from_u32_unchecked","Converts a `u32` to a `char`, ignoring validity."]],"struct":[["DecodeUtf16","An iterator that decodes UTF-16 encoded code points from an iterator of `u16`s."],["DecodeUtf16Error","An iterator that decodes UTF-16 encoded code points from an iterator of `u16`s."],["EncodeUtf16","An iterator over `u16` entries represending the UTF-16 encoding of a `char` value."],["EncodeUtf8","An iterator over `u8` entries represending the UTF-8 encoding of a `char` value."],["EscapeDefault","An iterator that yields the literal escape code of a `char`."],["EscapeUnicode","Returns an iterator that yields the hexadecimal Unicode escape of a character, as `char`s."],["ToLowercase","Returns an iterator that yields the lowercase equivalent of a `char`."],["ToUppercase","Returns an iterator that yields the uppercase equivalent of a `char`."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/char/struct.DecodeUtf16.html b/doc/bitflags/__core/char/struct.DecodeUtf16.html deleted file mode 100644 index 3b298657..00000000 --- a/doc/bitflags/__core/char/struct.DecodeUtf16.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::char::DecodeUtf16 - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::char::DecodeUtf16 - - [−] - - [src]

-
pub struct DecodeUtf16<I> where I: Iterator<Item=u16> {
-    // some fields omitted
-}
1.9.0

An iterator that decodes UTF-16 encoded code points from an iterator of u16s.

-

Trait Implementations

impl<I> Iterator for DecodeUtf16<I> where I: Iterator<Item=u16>

type Item = Result<char, DecodeUtf16Error>

-

fn next(&mut self) -> Option<Result<char, DecodeUtf16Error>>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl<I> Clone for DecodeUtf16<I> where I: Clone + Iterator<Item=u16>

fn clone(&self) -> DecodeUtf16<I>

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/struct.DecodeUtf16Error.html b/doc/bitflags/__core/char/struct.DecodeUtf16Error.html deleted file mode 100644 index cc493946..00000000 --- a/doc/bitflags/__core/char/struct.DecodeUtf16Error.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - bitflags::__core::char::DecodeUtf16Error - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::char::DecodeUtf16Error - - [−] - - [src]

-
pub struct DecodeUtf16Error {
-    // some fields omitted
-}
1.9.0

An iterator that decodes UTF-16 encoded code points from an iterator of u16s.

-

Methods

impl DecodeUtf16Error

fn unpaired_surrogate(&self) -> u16

-

Returns the unpaired surrogate which caused this error.

-

Trait Implementations

impl Error for DecodeUtf16Error

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>1.0.0

-

impl Display for DecodeUtf16Error

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl PartialEq<DecodeUtf16Error> for DecodeUtf16Error

fn eq(&self, __arg_0: &DecodeUtf16Error) -> bool

-

fn ne(&self, __arg_0: &DecodeUtf16Error) -> bool

-

impl Eq for DecodeUtf16Error

impl Clone for DecodeUtf16Error

fn clone(&self) -> DecodeUtf16Error

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Debug for DecodeUtf16Error

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/struct.EncodeUtf16.html b/doc/bitflags/__core/char/struct.EncodeUtf16.html deleted file mode 100644 index a7a77f02..00000000 --- a/doc/bitflags/__core/char/struct.EncodeUtf16.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - bitflags::__core::char::EncodeUtf16 - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::char::EncodeUtf16 - - [−] - - [src]

-
pub struct EncodeUtf16 {
-    // some fields omitted
-}
Unstable (unicode)

An iterator over u16 entries represending the UTF-16 encoding of a char -value.

- -

Constructed via the .encode_utf16() method on char.

-

Methods

impl EncodeUtf16

fn as_slice(&self) -> &[u16]

-
Unstable (unicode)

Returns the remaining bytes of this iterator as a slice.

-

Trait Implementations

impl Iterator for EncodeUtf16

type Item = u16

-
Unstable (unicode)

fn next(&mut self) -> Option<u16>

-
Unstable (unicode)

fn size_hint(&self) -> (usize, Option<usize>)

-
Unstable (unicode)

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl Debug for EncodeUtf16

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
Unstable (unicode)
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/struct.EncodeUtf8.html b/doc/bitflags/__core/char/struct.EncodeUtf8.html deleted file mode 100644 index 2fc1789d..00000000 --- a/doc/bitflags/__core/char/struct.EncodeUtf8.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - bitflags::__core::char::EncodeUtf8 - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::char::EncodeUtf8 - - [−] - - [src]

-
pub struct EncodeUtf8 {
-    // some fields omitted
-}
Unstable (unicode)

An iterator over u8 entries represending the UTF-8 encoding of a char -value.

- -

Constructed via the .encode_utf8() method on char.

-

Methods

impl EncodeUtf8

fn as_slice(&self) -> &[u8]

-
Unstable (unicode)

Returns the remaining bytes of this iterator as a slice.

-

Trait Implementations

impl Iterator for EncodeUtf8

type Item = u8

-
Unstable (unicode)

fn next(&mut self) -> Option<u8>

-
Unstable (unicode)

fn size_hint(&self) -> (usize, Option<usize>)

-
Unstable (unicode)

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl Debug for EncodeUtf8

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
Unstable (unicode)
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/struct.EscapeDefault.html b/doc/bitflags/__core/char/struct.EscapeDefault.html deleted file mode 100644 index fd118d8a..00000000 --- a/doc/bitflags/__core/char/struct.EscapeDefault.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - bitflags::__core::char::EscapeDefault - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::char::EscapeDefault - - [−] - - [src]

-
pub struct EscapeDefault {
-    // some fields omitted
-}
1.0.0

An iterator that yields the literal escape code of a char.

- -

This struct is created by the escape_default() method on char. See -its documentation for more.

-

Trait Implementations

impl Iterator for EscapeDefault

type Item = char

-

fn next(&mut self) -> Option<char>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn nth(&mut self, n: usize) -> Option<char>

-

fn last(self) -> Option<char>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl Debug for EscapeDefault

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl Clone for EscapeDefault

fn clone(&self) -> EscapeDefault

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/struct.EscapeUnicode.html b/doc/bitflags/__core/char/struct.EscapeUnicode.html deleted file mode 100644 index 696642a1..00000000 --- a/doc/bitflags/__core/char/struct.EscapeUnicode.html +++ /dev/null @@ -1,170 +0,0 @@ - - - - - - - - - - bitflags::__core::char::EscapeUnicode - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::char::EscapeUnicode - - [−] - - [src]

-
pub struct EscapeUnicode {
-    // some fields omitted
-}
1.0.0

Returns an iterator that yields the hexadecimal Unicode escape of a -character, as chars.

- -

This struct is created by the escape_unicode() method on char. See -its documentation for more.

-

Trait Implementations

impl Iterator for EscapeUnicode

type Item = char

-

fn next(&mut self) -> Option<char>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl Debug for EscapeUnicode

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl Clone for EscapeUnicode

fn clone(&self) -> EscapeUnicode

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/struct.ToLowercase.html b/doc/bitflags/__core/char/struct.ToLowercase.html deleted file mode 100644 index 37e7ec29..00000000 --- a/doc/bitflags/__core/char/struct.ToLowercase.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - - - - - - - bitflags::__core::char::ToLowercase - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::char::ToLowercase - - [−] - - [src]

-
pub struct ToLowercase(_);
1.0.0

Returns an iterator that yields the lowercase equivalent of a char.

- -

This struct is created by the to_lowercase() method on char. See -its documentation for more.

-

Trait Implementations

impl Iterator for ToLowercase

type Item = char

-

fn next(&mut self) -> Option<char>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/char/struct.ToUppercase.html b/doc/bitflags/__core/char/struct.ToUppercase.html deleted file mode 100644 index e91254c7..00000000 --- a/doc/bitflags/__core/char/struct.ToUppercase.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - - - - - - - bitflags::__core::char::ToUppercase - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::char::ToUppercase - - [−] - - [src]

-
pub struct ToUppercase(_);
1.0.0

Returns an iterator that yields the uppercase equivalent of a char.

- -

This struct is created by the to_uppercase() method on char. See -its documentation for more.

-

Trait Implementations

impl Iterator for ToUppercase

type Item = char

-

fn next(&mut self) -> Option<char>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/clone/index.html b/doc/bitflags/__core/clone/index.html deleted file mode 100644 index bfaa0c1c..00000000 --- a/doc/bitflags/__core/clone/index.html +++ /dev/null @@ -1,151 +0,0 @@ - - - - - - - - - - bitflags::__core::clone - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::clone - - [−] - - [src]

-

The Clone trait for types that cannot be 'implicitly copied'.

- -

In Rust, some simple types are "implicitly copyable" and when you -assign them or pass them as arguments, the receiver will get a copy, -leaving the original value in place. These types do not require -allocation to copy and do not have finalizers (i.e. they do not -contain owned boxes or implement Drop), so the compiler considers -them cheap and safe to copy. For other types copies must be made -explicitly, by convention implementing the Clone trait and calling -the clone method.

- -

Basic usage example:

- -
-let s = String::new(); // String type implements Clone
-let copy = s.clone(); // so we can clone it
- -

To easily implement the Clone trait, you can also use -#[derive(Clone)]. Example:

- -
-#[derive(Clone)] // we add the Clone trait to Morpheus struct
-struct Morpheus {
-   blue_pill: f32,
-   red_pill: i64,
-}
-
-fn main() {
-   let f = Morpheus { blue_pill: 0.0, red_pill: 0 };
-   let copy = f.clone(); // and now we can clone it!
-}
-

Traits

- - - - -
Clone -

A common trait for cloning an object.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/clone/sidebar-items.js b/doc/bitflags/__core/clone/sidebar-items.js deleted file mode 100644 index 7fcccc56..00000000 --- a/doc/bitflags/__core/clone/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"trait":[["Clone","A common trait for cloning an object."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/clone/trait.Clone.html b/doc/bitflags/__core/clone/trait.Clone.html deleted file mode 100644 index d012afe4..00000000 --- a/doc/bitflags/__core/clone/trait.Clone.html +++ /dev/null @@ -1,495 +0,0 @@ - - - - - - - - - - bitflags::__core::clone::Clone - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::clone::Clone - - [−] - - [src]

-
pub trait Clone {
-    fn clone(&self) -> Self;
-
-    fn clone_from(&mut self, source: &Self) { ... }
-}

A common trait for cloning an object.

- -

This trait can be used with #[derive].

-
-

Required Methods

-
-

fn clone(&self) -> Self

Returns a copy of the value.

- -

Examples

-
-let hello = "Hello"; // &str implements Clone
-
-assert_eq!("Hello", hello.clone());
-
-

Provided Methods

-
-

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

- -

a.clone_from(&b) is equivalent to a = b.clone() in functionality, -but can be overridden to reuse the resources of a to avoid unnecessary -allocations.

-
-

Implementors

-
    -
  • impl Clone for LocalKeyState
    • -
  • impl Clone for Thread
    • -
  • impl<K, V, S> Clone for HashMap<K, V, S> where S: Clone, V: Clone, K: Clone
    • -
  • impl<'a, K, V> Clone for Iter<'a, K, V>
    • -
  • impl<'a, K, V> Clone for Keys<'a, K, V>
    • -
  • impl<'a, K, V> Clone for Values<'a, K, V>
    • -
  • impl Clone for RandomState
    • -
  • impl<T, S> Clone for HashSet<T, S> where T: Clone, S: Clone
    • -
  • impl<'a, K> Clone for Iter<'a, K>
    • -
  • impl<'a, T, S> Clone for Intersection<'a, T, S>
    • -
  • impl<'a, T, S> Clone for Difference<'a, T, S>
    • -
  • impl<'a, T, S> Clone for SymmetricDifference<'a, T, S>
    • -
  • impl<'a, T, S> Clone for Union<'a, T, S>
    • -
  • impl<'a, T> Clone for Iter<'a, T>
    • -
  • impl<T> Clone for IntoIter<T> where T: Clone
    • -
  • impl<A> Clone for LinkedList<A> where A: Clone
    • -
  • impl<T> Clone for VecDeque<T> where T: Clone
    • -
  • impl<'a, T> Clone for Iter<'a, T>
    • -
  • impl<T> Clone for IntoIter<T> where T: Clone
    • -
  • impl<T> Clone for BinaryHeap<T> where T: Clone
    • -
  • impl<'a, T> Clone for Iter<'a, T>
    • -
  • impl<T> Clone for IntoIter<T> where T: Clone
    • -
  • impl Clone for VarError
    • -
  • impl Clone for CString
    • -
  • impl Clone for NulError
    • -
  • impl Clone for IntoStringError
    • -
  • impl Clone for OsString
    • -
  • impl Clone for Metadata
    • -
  • impl Clone for OpenOptions
    • -
  • impl Clone for Permissions
    • -
  • impl Clone for FileType
    • -
  • impl<T> Clone for Cursor<T> where T: Clone
    • -
  • impl Clone for ErrorKind
    • -
  • impl Clone for SeekFrom
    • -
  • impl Clone for IpAddr
    • -
  • impl Clone for Ipv6MulticastScope
    • -
  • impl Clone for Ipv4Addr
    • -
  • impl Clone for Ipv6Addr
    • -
  • impl Clone for SocketAddr
    • -
  • impl Clone for SocketAddrV4
    • -
  • impl Clone for SocketAddrV6
    • -
  • impl Clone for AddrParseError
    • -
  • impl Clone for Shutdown
    • -
  • impl Clone for stat
    • -
  • impl Clone for SocketAddr
    • -
  • impl<'a> Clone for Prefix<'a>
    • -
  • impl<'a> Clone for PrefixComponent<'a>
    • -
  • impl<'a> Clone for Component<'a>
    • -
  • impl<'a> Clone for Components<'a>
    • -
  • impl<'a> Clone for Iter<'a>
    • -
  • impl Clone for PathBuf
    • -
  • impl Clone for StripPrefixError
    • -
  • impl Clone for Output
    • -
  • impl Clone for ExitStatus
    • -
  • impl<T> Clone for SendError<T> where T: Clone
    • -
  • impl Clone for RecvError
    • -
  • impl Clone for TryRecvError
    • -
  • impl<T> Clone for TrySendError<T> where T: Clone
    • -
  • impl<T> Clone for Sender<T>
    • -
  • impl<T> Clone for SyncSender<T>
    • -
  • impl Clone for WaitTimeoutResult
    • -
  • impl Clone for Ordering
    • -
  • impl Clone for Duration
    • -
  • impl Clone for Instant
    • -
  • impl Clone for SystemTime
    • -
  • impl Clone for SystemTimeError
    • -
  • impl Clone for utimbuf
    • -
  • impl Clone for timeval
    • -
  • impl Clone for timespec
    • -
  • impl Clone for rlimit
    • -
  • impl Clone for rusage
    • -
  • impl Clone for in_addr
    • -
  • impl Clone for in6_addr
    • -
  • impl Clone for ip_mreq
    • -
  • impl Clone for ipv6_mreq
    • -
  • impl Clone for hostent
    • -
  • impl Clone for iovec
    • -
  • impl Clone for pollfd
    • -
  • impl Clone for winsize
    • -
  • impl Clone for sockaddr
    • -
  • impl Clone for sockaddr_in6
    • -
  • impl Clone for sockaddr_un
    • -
  • impl Clone for passwd
    • -
  • impl Clone for ifaddrs
    • -
  • impl Clone for fd_set
    • -
  • impl Clone for tm
    • -
  • impl Clone for utsname
    • -
  • impl Clone for msghdr
    • -
  • impl Clone for fsid_t
    • -
  • impl Clone for glob_t
    • -
  • impl Clone for sockaddr_storage
    • -
  • impl Clone for addrinfo
    • -
  • impl Clone for mach_timebase_info
    • -
  • impl Clone for stat
    • -
  • impl Clone for dirent
    • -
  • impl Clone for pthread_mutex_t
    • -
  • impl Clone for pthread_mutexattr_t
    • -
  • impl Clone for pthread_cond_t
    • -
  • impl Clone for pthread_rwlock_t
    • -
  • impl Clone for siginfo_t
    • -
  • impl Clone for sigaction
    • -
  • impl Clone for stack_t
    • -
  • impl Clone for fstore_t
    • -
  • impl Clone for radvisory
    • -
  • impl Clone for statvfs
    • -
  • impl Clone for Dl_info
    • -
  • impl Clone for sockaddr_in
    • -
  • impl Clone for statfs
    • -
  • impl Clone for kevent
    • -
  • impl Clone for kevent64_s
    • -
  • impl Clone for dqblk
    • -
  • impl Clone for termios
    • -
  • impl Clone for flock
    • -
  • impl Clone for sf_hdtr
    • -
  • impl Clone for lconv
    • -
  • impl Clone for pthread_attr_t
    • -
  • impl<T> Clone for Vec<T> where T: Clone
    • -
  • impl<T> Clone for IntoIter<T> where T: Clone
    • -
  • impl<A, R> Clone for StepBy<A, R> where A: Clone, R: Clone
    • -
  • impl<A> Clone for Repeat<A> where A: Clone
    • -
  • impl<T> Clone for Empty<T>
    • -
  • impl<T> Clone for Once<T> where T: Clone
    • -
  • impl<T> Clone for Rev<T> where T: Clone
    • -
  • impl<I> Clone for Cloned<I> where I: Clone
    • -
  • impl<I> Clone for Cycle<I> where I: Clone
    • -
  • impl<A, B> Clone for Chain<A, B> where A: Clone, B: Clone
    • -
  • impl<A, B> Clone for Zip<A, B> where A: Clone, B: Clone
    • -
  • impl<I, F> Clone for Map<I, F> where I: Clone, F: Clone
    • -
  • impl<I, P> Clone for Filter<I, P> where I: Clone, P: Clone
    • -
  • impl<I, F> Clone for FilterMap<I, F> where I: Clone, F: Clone
    • -
  • impl<I> Clone for Enumerate<I> where I: Clone
    • -
  • impl<I> Clone for Peekable<I> where I: Clone + Iterator, I::Item: Clone
    • -
  • impl<I, P> Clone for SkipWhile<I, P> where P: Clone, I: Clone
    • -
  • impl<I, P> Clone for TakeWhile<I, P> where I: Clone, P: Clone
    • -
  • impl<I> Clone for Skip<I> where I: Clone
    • -
  • impl<I> Clone for Take<I> where I: Clone
    • -
  • impl<I, St, F> Clone for Scan<I, St, F> where I: Clone, F: Clone, St: Clone
    • -
  • impl<I, U, F> Clone for FlatMap<I, U, F> where I: Clone, U: Clone + IntoIterator, F: Clone, U::IntoIter: Clone
    • -
  • impl<I> Clone for Fuse<I> where I: Clone
    • -
  • impl<I, F> Clone for Inspect<I, F> where I: Clone, F: Clone
    • -
  • impl Clone for Ordering
    • -
  • impl Clone for ExchangeHeapSingleton
    • -
  • impl<T> Clone for Box<T> where T: Clone
    • -
  • impl Clone for Box<str>
    • -
  • impl<T> Clone for Box<[T]> where T: Clone
    • -
  • impl Clone for TypeId
    • -
  • impl<T> Clone for Slice<T>
    • -
  • impl Clone for TraitObject
    • -
  • impl Clone for RangeFull
    • -
  • impl<Idx> Clone for Range<Idx> where Idx: Clone
    • -
  • impl<Idx> Clone for RangeFrom<Idx> where Idx: Clone
    • -
  • impl<Idx> Clone for RangeTo<Idx> where Idx: Clone
    • -
  • impl<Idx> Clone for RangeInclusive<Idx> where Idx: Clone
    • -
  • impl<Idx> Clone for RangeToInclusive<Idx> where Idx: Clone
    • -
  • impl<I> Clone for DecodeUtf16<I> where I: Clone + Iterator<Item=u16>
    • -
  • impl Clone for DecodeUtf16Error
    • -
  • impl<T> Clone for PhantomData<T> where T: ?Sized
    • -
  • impl Clone for SipHasher
    • -
  • impl<H> Clone for BuildHasherDefault<H>
    • -
  • impl<'a> Clone for EncodeUtf16<'a>
    • -
  • impl Clone for SearchStep
    • -
  • impl<'a> Clone for CharSearcher<'a>
    • -
  • impl<'a, 'b> Clone for CharSliceSearcher<'a, 'b>
    • -
  • impl<'a, F> Clone for CharPredicateSearcher<'a, F> where F: Clone + FnMut(char) -> bool
    • -
  • impl<'a, 'b> Clone for StrSearcher<'a, 'b>
    • -
  • impl<T> Clone for Cell<T> where T: Copy
    • -
  • impl Clone for BorrowState
    • -
  • impl<T> Clone for RefCell<T> where T: Clone
    • -
  • impl<T> Clone for Rc<T> where T: ?Sized
    • -
  • impl<T> Clone for Weak<T> where T: ?Sized
    • -
  • impl Clone for String
    • -
  • impl Clone for ParseError
    • -
  • impl<T, E> Clone for Result<T, E> where T: Clone, E: Clone
    • -
  • impl<'a, T> Clone for Iter<'a, T>
    • -
  • impl<T> Clone for *const T where T: ?Sized
    • -
  • impl<T> Clone for *mut T where T: ?Sized
    • -
  • impl<Ret> Clone for fn() -> Ret
    • -
  • impl<Ret> Clone for extern fn() -> Ret
    • -
  • impl<Ret> Clone for unsafe fn() -> Ret
    • -
  • impl<Ret> Clone for unsafe extern fn() -> Ret
    • -
  • impl<Ret, A> Clone for fn(A) -> Ret
    • -
  • impl<Ret, A> Clone for extern fn(A) -> Ret
    • -
  • impl<Ret, A> Clone for unsafe fn(A) -> Ret
    • -
  • impl<Ret, A> Clone for unsafe extern fn(A) -> Ret
    • -
  • impl<Ret, A, B> Clone for fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Clone for extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Clone for unsafe fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Clone for unsafe extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B, C> Clone for fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Clone for extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Clone for unsafe fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Clone for unsafe extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C, D> Clone for fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Clone for extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Clone for unsafe fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Clone for unsafe extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Clone for fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Clone for extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Clone for unsafe fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Clone for unsafe extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Clone for fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Clone for extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Clone for unsafe fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Clone for unsafe extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Clone for fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Clone for extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Clone for unsafe fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Clone for unsafe extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Clone for fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Clone for extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Clone for unsafe fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Clone for unsafe extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Clone for fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Clone for extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Clone for unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Clone for unsafe extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Clone for fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Clone for extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Clone for unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Clone for unsafe extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Clone for fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Clone for extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Clone for unsafe fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Clone for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Clone for fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Clone for extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Clone for unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Clone for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<T> Clone for Shared<T> where T: ?Sized
    • -
  • impl<'a, T> Clone for &'a T where T: ?Sized
    • -
  • impl Clone for isize
    • -
  • impl Clone for i8
    • -
  • impl Clone for i16
    • -
  • impl Clone for i32
    • -
  • impl Clone for i64
    • -
  • impl Clone for usize
    • -
  • impl Clone for u8
    • -
  • impl Clone for u16
    • -
  • impl Clone for u32
    • -
  • impl Clone for u64
    • -
  • impl Clone for f32
    • -
  • impl Clone for f64
    • -
  • impl Clone for ()
    • -
  • impl Clone for bool
    • -
  • impl Clone for char
    • -
  • impl<'a, B> Clone for Cow<'a, B> where B: ToOwned + ?Sized
    • -
  • impl<T> Clone for Option<T> where T: Clone
    • -
  • impl<'a, A> Clone for Iter<'a, A>
    • -
  • impl<A> Clone for IntoIter<A> where A: Clone
    • -
  • impl<T> Clone for Wrapping<T> where T: Clone
    • -
  • impl Clone for ParseFloatError
    • -
  • impl Clone for FpCategory
    • -
  • impl Clone for ParseIntError
    • -
  • impl<T> Clone for NonZero<T> where T: Zeroable + Clone
    • -
  • impl<T> Clone for [T; 0] where T: Copy
    • -
  • impl<T> Clone for [T; 1] where T: Copy
    • -
  • impl<T> Clone for [T; 2] where T: Copy
    • -
  • impl<T> Clone for [T; 3] where T: Copy
    • -
  • impl<T> Clone for [T; 4] where T: Copy
    • -
  • impl<T> Clone for [T; 5] where T: Copy
    • -
  • impl<T> Clone for [T; 6] where T: Copy
    • -
  • impl<T> Clone for [T; 7] where T: Copy
    • -
  • impl<T> Clone for [T; 8] where T: Copy
    • -
  • impl<T> Clone for [T; 9] where T: Copy
    • -
  • impl<T> Clone for [T; 10] where T: Copy
    • -
  • impl<T> Clone for [T; 11] where T: Copy
    • -
  • impl<T> Clone for [T; 12] where T: Copy
    • -
  • impl<T> Clone for [T; 13] where T: Copy
    • -
  • impl<T> Clone for [T; 14] where T: Copy
    • -
  • impl<T> Clone for [T; 15] where T: Copy
    • -
  • impl<T> Clone for [T; 16] where T: Copy
    • -
  • impl<T> Clone for [T; 17] where T: Copy
    • -
  • impl<T> Clone for [T; 18] where T: Copy
    • -
  • impl<T> Clone for [T; 19] where T: Copy
    • -
  • impl<T> Clone for [T; 20] where T: Copy
    • -
  • impl<T> Clone for [T; 21] where T: Copy
    • -
  • impl<T> Clone for [T; 22] where T: Copy
    • -
  • impl<T> Clone for [T; 23] where T: Copy
    • -
  • impl<T> Clone for [T; 24] where T: Copy
    • -
  • impl<T> Clone for [T; 25] where T: Copy
    • -
  • impl<T> Clone for [T; 26] where T: Copy
    • -
  • impl<T> Clone for [T; 27] where T: Copy
    • -
  • impl<T> Clone for [T; 28] where T: Copy
    • -
  • impl<T> Clone for [T; 29] where T: Copy
    • -
  • impl<T> Clone for [T; 30] where T: Copy
    • -
  • impl<T> Clone for [T; 31] where T: Copy
    • -
  • impl<T> Clone for [T; 32] where T: Copy
    • -
  • impl Clone for EscapeUnicode
    • -
  • impl Clone for EscapeDefault
    • -
  • impl<'a, T> Clone for Iter<'a, T>
    • -
  • impl<'a, T, P> Clone for Split<'a, T, P> where P: Clone + FnMut(&T) -> bool
    • -
  • impl<'a, T> Clone for Windows<'a, T>
    • -
  • impl<'a, T> Clone for Chunks<'a, T>
    • -
  • impl Clone for ParseBoolError
    • -
  • impl Clone for Utf8Error
    • -
  • impl<'a> Clone for Chars<'a>
    • -
  • impl<'a> Clone for CharIndices<'a>
    • -
  • impl<'a> Clone for Bytes<'a>
    • -
  • impl<'a, P> Clone for Split<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for RSplit<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for SplitTerminator<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for RSplitTerminator<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for SplitN<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for RSplitN<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for MatchIndices<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for RMatchIndices<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for Matches<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for RMatches<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a> Clone for Lines<'a>
    • -
  • impl<'a> Clone for LinesAny<'a>
    • -
  • impl Clone for CharRange
    • -
  • impl Clone for Error
    • -
  • impl<'a> Clone for Arguments<'a>
    • -
  • impl<A> Clone for (A,) where A: Clone
    • -
  • impl<A, B> Clone for (A, B) where B: Clone, A: Clone
    • -
  • impl<A, B, C> Clone for (A, B, C) where B: Clone, A: Clone, C: Clone
    • -
  • impl<A, B, C, D> Clone for (A, B, C, D) where A: Clone, C: Clone, D: Clone, B: Clone
    • -
  • impl<A, B, C, D, E> Clone for (A, B, C, D, E) where E: Clone, C: Clone, A: Clone, D: Clone, B: Clone
    • -
  • impl<A, B, C, D, E, F> Clone for (A, B, C, D, E, F) where D: Clone, C: Clone, E: Clone, A: Clone, B: Clone, F: Clone
    • -
  • impl<A, B, C, D, E, F, G> Clone for (A, B, C, D, E, F, G) where E: Clone, G: Clone, A: Clone, C: Clone, F: Clone, D: Clone, B: Clone
    • -
  • impl<A, B, C, D, E, F, G, H> Clone for (A, B, C, D, E, F, G, H) where H: Clone, D: Clone, B: Clone, A: Clone, E: Clone, G: Clone, F: Clone, C: Clone
    • -
  • impl<A, B, C, D, E, F, G, H, I> Clone for (A, B, C, D, E, F, G, H, I) where H: Clone, C: Clone, D: Clone, A: Clone, B: Clone, E: Clone, G: Clone, I: Clone, F: Clone
    • -
  • impl<A, B, C, D, E, F, G, H, I, J> Clone for (A, B, C, D, E, F, G, H, I, J) where C: Clone, H: Clone, I: Clone, B: Clone, D: Clone, G: Clone, A: Clone, F: Clone, J: Clone, E: Clone
    • -
  • impl<A, B, C, D, E, F, G, H, I, J, K> Clone for (A, B, C, D, E, F, G, H, I, J, K) where A: Clone, J: Clone, D: Clone, H: Clone, I: Clone, B: Clone, K: Clone, C: Clone, G: Clone, E: Clone, F: Clone
    • -
  • impl<A, B, C, D, E, F, G, H, I, J, K, L> Clone for (A, B, C, D, E, F, G, H, I, J, K, L) where F: Clone, A: Clone, G: Clone, H: Clone, K: Clone, I: Clone, C: Clone, E: Clone, J: Clone, B: Clone, L: Clone, D: Clone
    • -
  • impl<K, V> Clone for BTreeMap<K, V> where K: Clone, V: Clone
    • -
  • impl<'a, K, V> Clone for Iter<'a, K, V>
    • -
  • impl<'a, K, V> Clone for Keys<'a, K, V>
    • -
  • impl<'a, K, V> Clone for Values<'a, K, V>
    • -
  • impl<'a, K, V> Clone for Range<'a, K, V>
    • -
  • impl<T> Clone for BTreeSet<T> where T: Clone
    • -
  • impl<'a, T> Clone for Iter<'a, T>
    • -
  • impl<'a, T> Clone for Range<'a, T>
    • -
  • impl<'a, T> Clone for Difference<'a, T>
    • -
  • impl<'a, T> Clone for SymmetricDifference<'a, T>
    • -
  • impl<'a, T> Clone for Intersection<'a, T>
    • -
  • impl<'a, T> Clone for Union<'a, T>
    • -
  • impl<E> Clone for EnumSet<E>
    • -
  • impl<E> Clone for Iter<E>
    • -
  • impl<T> Clone for Bound<T> where T: Clone
    • -
  • impl<T> Clone for Arc<T> where T: ?Sized
    • -
  • impl<T> Clone for Weak<T> where T: ?Sized
    • -
  • impl Clone for StandardNormal
    • -
  • impl Clone for Normal
    • -
  • impl Clone for LogNormal
    • -
  • impl Clone for Exp1
    • -
  • impl Clone for Exp
    • -
  • impl Clone for IsaacRng
    • -
  • impl Clone for Isaac64Rng
    • -
  • impl Clone for ChaChaRng
    • -
  • impl Clone for ReseedWithDefault
    • -
  • impl Clone for XorShiftRng
    • -
  • impl<I> Clone for Utf16Encoder<I> where I: Clone
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/cmp/enum.Ordering.html b/doc/bitflags/__core/cmp/enum.Ordering.html deleted file mode 100644 index 54e907e9..00000000 --- a/doc/bitflags/__core/cmp/enum.Ordering.html +++ /dev/null @@ -1,176 +0,0 @@ - - - - - - - - - - bitflags::__core::cmp::Ordering - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::cmp::Ordering - - [−] - - [src]

-
pub enum Ordering {
-    Less,
-    Equal,
-    Greater,
-}
1.0.0

An Ordering is the result of a comparison between two values.

- -

Examples

-
-use std::cmp::Ordering;
-
-let result = 1.cmp(&2);
-assert_eq!(Ordering::Less, result);
-
-let result = 1.cmp(&1);
-assert_eq!(Ordering::Equal, result);
-
-let result = 2.cmp(&1);
-assert_eq!(Ordering::Greater, result);
-

Variants

-
Less

An ordering where a compared value is less [than another].

-
Equal

An ordering where a compared value is equal [to another].

-
Greater

An ordering where a compared value is greater [than another].

-

Methods

impl Ordering

fn reverse(self) -> Ordering

-

Reverse the Ordering.

- -
    -
  • Less becomes Greater.
    • -
  • Greater becomes Less.
    • -
  • Equal becomes Equal.
    • -
- -

Examples

-

Basic behavior:

- -
-use std::cmp::Ordering;
-
-assert_eq!(Ordering::Less.reverse(), Ordering::Greater);
-assert_eq!(Ordering::Equal.reverse(), Ordering::Equal);
-assert_eq!(Ordering::Greater.reverse(), Ordering::Less);
- -

This method can be used to reverse a comparison:

- -
-let mut data: &mut [_] = &mut [2, 10, 5, 8];
-
-// sort the array from largest to smallest.
-data.sort_by(|a, b| a.cmp(b).reverse());
-
-let b: &mut [_] = &mut [10, 8, 5, 2];
-assert!(data == b);
-

Trait Implementations

impl Eq for Ordering

impl Ord for Ordering

fn cmp(&self, other: &Ordering) -> Ordering

-

impl PartialOrd<Ordering> for Ordering

fn partial_cmp(&self, other: &Ordering) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

Derived Implementations

impl Hash for Ordering

fn hash<__H>(&self, __arg_0: &mut __H) where __H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl Debug for Ordering

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl PartialEq<Ordering> for Ordering

fn eq(&self, __arg_0: &Ordering) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl Copy for Ordering

impl Clone for Ordering

fn clone(&self) -> Ordering

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/cmp/fn.max.html b/doc/bitflags/__core/cmp/fn.max.html deleted file mode 100644 index 5025f715..00000000 --- a/doc/bitflags/__core/cmp/fn.max.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - bitflags::__core::cmp::max - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::cmp::max - - [−] - - [src]

-
pub fn max<T>(v1: T, v2: T) -> T where T: Ord
1.0.0

Compare and return the maximum of two values.

- -

Returns the second argument if the comparison determines them to be equal.

- -

Examples

-
-use std::cmp;
-
-assert_eq!(2, cmp::max(1, 2));
-assert_eq!(2, cmp::max(2, 2));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/cmp/fn.min.html b/doc/bitflags/__core/cmp/fn.min.html deleted file mode 100644 index ef85b341..00000000 --- a/doc/bitflags/__core/cmp/fn.min.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - bitflags::__core::cmp::min - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::cmp::min - - [−] - - [src]

-
pub fn min<T>(v1: T, v2: T) -> T where T: Ord
1.0.0

Compare and return the minimum of two values.

- -

Returns the first argument if the comparison determines them to be equal.

- -

Examples

-
-use std::cmp;
-
-assert_eq!(1, cmp::min(1, 2));
-assert_eq!(2, cmp::min(2, 2));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/cmp/index.html b/doc/bitflags/__core/cmp/index.html deleted file mode 100644 index 737c880b..00000000 --- a/doc/bitflags/__core/cmp/index.html +++ /dev/null @@ -1,184 +0,0 @@ - - - - - - - - - - bitflags::__core::cmp - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::cmp - - [−] - - [src]

-

Functionality for ordering and comparison.

- -

This module defines both PartialOrd and PartialEq traits which are used -by the compiler to implement comparison operators. Rust programs may -implement PartialOrd to overload the <, <=, >, and >= operators, -and may implement PartialEq to overload the == and != operators.

- -

Examples

-
-let x: u32 = 0;
-let y: u32 = 1;
-
-// these two lines are equivalent
-assert_eq!(x < y, true);
-assert_eq!(x.lt(&y), true);
-
-// these two lines are also equivalent
-assert_eq!(x == y, false);
-assert_eq!(x.eq(&y), false);
-

Enums

- - - - -
Ordering -

An Ordering is the result of a comparison between two values.

-

Traits

- - - - - - - - - - - - - - - - -
Eq -

Trait for equality comparisons which are equivalence relations.

-
Ord -

Trait for types that form a total order.

-
PartialEq -

Trait for equality comparisons which are partial equivalence -relations.

-
PartialOrd -

Trait for values that can be compared for a sort-order.

-

Functions

- - - - - - - - -
max -

Compare and return the maximum of two values.

-
min -

Compare and return the minimum of two values.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/cmp/sidebar-items.js b/doc/bitflags/__core/cmp/sidebar-items.js deleted file mode 100644 index 9cf95b46..00000000 --- a/doc/bitflags/__core/cmp/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["Ordering","An `Ordering` is the result of a comparison between two values."]],"fn":[["max","Compare and return the maximum of two values."],["min","Compare and return the minimum of two values."]],"trait":[["Eq","Trait for equality comparisons which are equivalence relations."],["Ord","Trait for types that form a total order."],["PartialEq","Trait for equality comparisons which are partial equivalence relations."],["PartialOrd","Trait for values that can be compared for a sort-order."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/cmp/trait.Eq.html b/doc/bitflags/__core/cmp/trait.Eq.html deleted file mode 100644 index 4a77044a..00000000 --- a/doc/bitflags/__core/cmp/trait.Eq.html +++ /dev/null @@ -1,317 +0,0 @@ - - - - - - - - - - bitflags::__core::cmp::Eq - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::cmp::Eq - - [−] - - [src]

-
pub trait Eq: PartialEq<Self> { }

Trait for equality comparisons which are equivalence relations.

- -

This means, that in addition to a == b and a != b being strict inverses, the equality must -be (for all a, b and c):

- -
    -
  • reflexive: a == a;
    • -
  • symmetric: a == b implies b == a; and
    • -
  • transitive: a == b and b == c implies a == c.
    • -
- -

This property cannot be checked by the compiler, and therefore Eq implies -PartialEq, and has no extra methods.

- -

This trait can be used with #[derive].

-
-

Implementors

-
    -
  • impl Eq for LocalKeyState
    • -
  • impl<K, V, S> Eq for HashMap<K, V, S> where K: Eq + Hash, V: Eq, S: BuildHasher
    • -
  • impl<T, S> Eq for HashSet<T, S> where T: Eq + Hash, S: BuildHasher
    • -
  • impl<A> Eq for LinkedList<A> where A: Eq
    • -
  • impl<A> Eq for VecDeque<A> where A: Eq
    • -
  • impl Eq for VarError
    • -
  • impl Eq for CString
    • -
  • impl Eq for CStr
    • -
  • impl Eq for OsString
    • -
  • impl Eq for OsStr
    • -
  • impl Eq for Permissions
    • -
  • impl Eq for FileType
    • -
  • impl Eq for ErrorKind
    • -
  • impl Eq for SeekFrom
    • -
  • impl Eq for IpAddr
    • -
  • impl Eq for Ipv6MulticastScope
    • -
  • impl Eq for Ipv4Addr
    • -
  • impl Eq for Ipv6Addr
    • -
  • impl Eq for SocketAddr
    • -
  • impl Eq for SocketAddrV4
    • -
  • impl Eq for SocketAddrV6
    • -
  • impl<'a> Eq for Prefix<'a>
    • -
  • impl<'a> Eq for PrefixComponent<'a>
    • -
  • impl<'a> Eq for Component<'a>
    • -
  • impl<'a> Eq for Components<'a>
    • -
  • impl Eq for PathBuf
    • -
  • impl Eq for StripPrefixError
    • -
  • impl Eq for Path
    • -
  • impl Eq for Output
    • -
  • impl Eq for ExitStatus
    • -
  • impl<T> Eq for SendError<T> where T: Eq
    • -
  • impl Eq for RecvError
    • -
  • impl Eq for TryRecvError
    • -
  • impl<T> Eq for TrySendError<T> where T: Eq
    • -
  • impl Eq for WaitTimeoutResult
    • -
  • impl Eq for Duration
    • -
  • impl Eq for Instant
    • -
  • impl Eq for SystemTime
    • -
  • impl<T> Eq for Vec<T> where T: Eq
    • -
  • impl Eq for Ordering
    • -
  • impl Eq for ()
    • -
  • impl Eq for bool
    • -
  • impl Eq for char
    • -
  • impl Eq for usize
    • -
  • impl Eq for u8
    • -
  • impl Eq for u16
    • -
  • impl Eq for u32
    • -
  • impl Eq for u64
    • -
  • impl Eq for isize
    • -
  • impl Eq for i8
    • -
  • impl Eq for i16
    • -
  • impl Eq for i32
    • -
  • impl Eq for i64
    • -
  • impl<'a, A> Eq for &'a A where A: Eq + ?Sized
    • -
  • impl<'a, A> Eq for &'a mut A where A: Eq + ?Sized
    • -
  • impl<T> Eq for Box<T> where T: Eq + ?Sized
    • -
  • impl Eq for TypeId
    • -
  • impl Eq for RangeFull
    • -
  • impl<Idx> Eq for Range<Idx> where Idx: Eq
    • -
  • impl<Idx> Eq for RangeFrom<Idx> where Idx: Eq
    • -
  • impl<Idx> Eq for RangeTo<Idx> where Idx: Eq
    • -
  • impl<Idx> Eq for RangeInclusive<Idx> where Idx: Eq
    • -
  • impl<Idx> Eq for RangeToInclusive<Idx> where Idx: Eq
    • -
  • impl Eq for DecodeUtf16Error
    • -
  • impl<T> Eq for PhantomData<T> where T: ?Sized
    • -
  • impl Eq for SearchStep
    • -
  • impl<T> Eq for Cell<T> where T: Copy + Eq
    • -
  • impl Eq for BorrowState
    • -
  • impl<T> Eq for RefCell<T> where T: Eq + ?Sized
    • -
  • impl<T> Eq for Rc<T> where T: Eq + ?Sized
    • -
  • impl Eq for String
    • -
  • impl Eq for ParseError
    • -
  • impl<T, E> Eq for Result<T, E> where E: Eq, T: Eq
    • -
  • impl<T> Eq for *const T where T: ?Sized
    • -
  • impl<T> Eq for *mut T where T: ?Sized
    • -
  • impl<Ret> Eq for fn() -> Ret
    • -
  • impl<Ret> Eq for extern fn() -> Ret
    • -
  • impl<Ret> Eq for unsafe fn() -> Ret
    • -
  • impl<Ret> Eq for unsafe extern fn() -> Ret
    • -
  • impl<Ret, A> Eq for fn(A) -> Ret
    • -
  • impl<Ret, A> Eq for extern fn(A) -> Ret
    • -
  • impl<Ret, A> Eq for unsafe fn(A) -> Ret
    • -
  • impl<Ret, A> Eq for unsafe extern fn(A) -> Ret
    • -
  • impl<Ret, A, B> Eq for fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Eq for extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Eq for unsafe fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Eq for unsafe extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B, C> Eq for fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Eq for extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Eq for unsafe fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Eq for unsafe extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C, D> Eq for fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Eq for extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Eq for unsafe fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Eq for unsafe extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Eq for fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Eq for extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Eq for unsafe fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Eq for unsafe extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Eq for fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Eq for extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Eq for unsafe fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Eq for unsafe extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Eq for fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Eq for extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Eq for unsafe fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Eq for unsafe extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Eq for fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Eq for extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Eq for unsafe fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Eq for unsafe extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Eq for fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Eq for extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Eq for unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Eq for unsafe extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Eq for fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Eq for extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Eq for unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Eq for unsafe extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Eq for fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Eq for extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Eq for unsafe fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Eq for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Eq for fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Eq for extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Eq for unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Eq for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<'a, B> Eq for Cow<'a, B> where B: Eq + ToOwned + ?Sized
    • -
  • impl<T> Eq for Option<T> where T: Eq
    • -
  • impl<T> Eq for Wrapping<T> where T: Eq
    • -
  • impl<T> Eq for NonZero<T> where T: Zeroable + Eq
    • -
  • impl<T> Eq for [T; 0] where T: Eq
    • -
  • impl<T> Eq for [T; 1] where T: Eq
    • -
  • impl<T> Eq for [T; 2] where T: Eq
    • -
  • impl<T> Eq for [T; 3] where T: Eq
    • -
  • impl<T> Eq for [T; 4] where T: Eq
    • -
  • impl<T> Eq for [T; 5] where T: Eq
    • -
  • impl<T> Eq for [T; 6] where T: Eq
    • -
  • impl<T> Eq for [T; 7] where T: Eq
    • -
  • impl<T> Eq for [T; 8] where T: Eq
    • -
  • impl<T> Eq for [T; 9] where T: Eq
    • -
  • impl<T> Eq for [T; 10] where T: Eq
    • -
  • impl<T> Eq for [T; 11] where T: Eq
    • -
  • impl<T> Eq for [T; 12] where T: Eq
    • -
  • impl<T> Eq for [T; 13] where T: Eq
    • -
  • impl<T> Eq for [T; 14] where T: Eq
    • -
  • impl<T> Eq for [T; 15] where T: Eq
    • -
  • impl<T> Eq for [T; 16] where T: Eq
    • -
  • impl<T> Eq for [T; 17] where T: Eq
    • -
  • impl<T> Eq for [T; 18] where T: Eq
    • -
  • impl<T> Eq for [T; 19] where T: Eq
    • -
  • impl<T> Eq for [T; 20] where T: Eq
    • -
  • impl<T> Eq for [T; 21] where T: Eq
    • -
  • impl<T> Eq for [T; 22] where T: Eq
    • -
  • impl<T> Eq for [T; 23] where T: Eq
    • -
  • impl<T> Eq for [T; 24] where T: Eq
    • -
  • impl<T> Eq for [T; 25] where T: Eq
    • -
  • impl<T> Eq for [T; 26] where T: Eq
    • -
  • impl<T> Eq for [T; 27] where T: Eq
    • -
  • impl<T> Eq for [T; 28] where T: Eq
    • -
  • impl<T> Eq for [T; 29] where T: Eq
    • -
  • impl<T> Eq for [T; 30] where T: Eq
    • -
  • impl<T> Eq for [T; 31] where T: Eq
    • -
  • impl<T> Eq for [T; 32] where T: Eq
    • -
  • impl<T> Eq for [T] where T: Eq
    • -
  • impl Eq for Utf8Error
    • -
  • impl Eq for str
    • -
  • impl Eq for Error
    • -
  • impl<A> Eq for (A,) where A: Eq
    • -
  • impl<A, B> Eq for (A, B) where B: Eq, A: Eq
    • -
  • impl<A, B, C> Eq for (A, B, C) where B: Eq, C: Eq, A: Eq
    • -
  • impl<A, B, C, D> Eq for (A, B, C, D) where B: Eq, D: Eq, C: Eq, A: Eq
    • -
  • impl<A, B, C, D, E> Eq for (A, B, C, D, E) where D: Eq, B: Eq, E: Eq, A: Eq, C: Eq
    • -
  • impl<A, B, C, D, E, F> Eq for (A, B, C, D, E, F) where E: Eq, C: Eq, A: Eq, B: Eq, D: Eq, F: Eq
    • -
  • impl<A, B, C, D, E, F, G> Eq for (A, B, C, D, E, F, G) where E: Eq, D: Eq, A: Eq, G: Eq, F: Eq, C: Eq, B: Eq
    • -
  • impl<A, B, C, D, E, F, G, H> Eq for (A, B, C, D, E, F, G, H) where D: Eq, F: Eq, G: Eq, H: Eq, E: Eq, B: Eq, A: Eq, C: Eq
    • -
  • impl<A, B, C, D, E, F, G, H, I> Eq for (A, B, C, D, E, F, G, H, I) where E: Eq, G: Eq, H: Eq, D: Eq, F: Eq, B: Eq, C: Eq, A: Eq, I: Eq
    • -
  • impl<A, B, C, D, E, F, G, H, I, J> Eq for (A, B, C, D, E, F, G, H, I, J) where J: Eq, E: Eq, A: Eq, C: Eq, H: Eq, B: Eq, I: Eq, D: Eq, G: Eq, F: Eq
    • -
  • impl<A, B, C, D, E, F, G, H, I, J, K> Eq for (A, B, C, D, E, F, G, H, I, J, K) where A: Eq, C: Eq, F: Eq, D: Eq, H: Eq, K: Eq, J: Eq, B: Eq, G: Eq, E: Eq, I: Eq
    • -
  • impl<A, B, C, D, E, F, G, H, I, J, K, L> Eq for (A, B, C, D, E, F, G, H, I, J, K, L) where J: Eq, F: Eq, D: Eq, A: Eq, L: Eq, G: Eq, B: Eq, K: Eq, H: Eq, E: Eq, C: Eq, I: Eq
    • -
  • impl<K, V> Eq for BTreeMap<K, V> where K: Eq, V: Eq
    • -
  • impl<T> Eq for BTreeSet<T> where T: Eq
    • -
  • impl<E> Eq for EnumSet<E> where E: Eq
    • -
  • impl<T> Eq for Bound<T> where T: Eq
    • -
  • impl<T> Eq for Arc<T> where T: Eq + ?Sized
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/cmp/trait.Ord.html b/doc/bitflags/__core/cmp/trait.Ord.html deleted file mode 100644 index ba55e1b7..00000000 --- a/doc/bitflags/__core/cmp/trait.Ord.html +++ /dev/null @@ -1,295 +0,0 @@ - - - - - - - - - - bitflags::__core::cmp::Ord - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::cmp::Ord - - [−] - - [src]

-
pub trait Ord: Eq + PartialOrd<Self> {
-    fn cmp(&self, other: &Self) -> Ordering;
-}

Trait for types that form a total order.

- -

An order is a total order if it is (for all a, b and c):

- -
    -
  • total and antisymmetric: exactly one of a < b, a == b or a > b is true; and
    • -
  • transitive, a < b and b < c implies a < c. The same must hold for both == and >.
    • -
- -

This trait can be used with #[derive]. When derived, it will produce a lexicographic -ordering based on the top-to-bottom declaration order of the struct's members.

-
-

Required Methods

-
-

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

- -

By convention, self.cmp(&other) returns the ordering matching the expression -self <operator> other if true.

- -

Examples

-
-use std::cmp::Ordering;
-
-assert_eq!(5.cmp(&10), Ordering::Less);
-assert_eq!(10.cmp(&5), Ordering::Greater);
-assert_eq!(5.cmp(&5), Ordering::Equal);
-
-

Implementors

-
    -
  • impl<A> Ord for LinkedList<A> where A: Ord
    • -
  • impl<A> Ord for VecDeque<A> where A: Ord
    • -
  • impl Ord for CString
    • -
  • impl Ord for CStr
    • -
  • impl Ord for OsString
    • -
  • impl Ord for OsStr
    • -
  • impl Ord for IpAddr
    • -
  • impl Ord for Ipv4Addr
    • -
  • impl Ord for Ipv6Addr
    • -
  • impl<'a> Ord for Prefix<'a>
    • -
  • impl<'a> Ord for PrefixComponent<'a>
    • -
  • impl<'a> Ord for Component<'a>
    • -
  • impl<'a> Ord for Components<'a>
    • -
  • impl Ord for PathBuf
    • -
  • impl Ord for Path
    • -
  • impl Ord for Duration
    • -
  • impl Ord for Instant
    • -
  • impl Ord for SystemTime
    • -
  • impl<T> Ord for Vec<T> where T: Ord
    • -
  • impl Ord for Ordering
    • -
  • impl Ord for ()
    • -
  • impl Ord for bool
    • -
  • impl Ord for char
    • -
  • impl Ord for usize
    • -
  • impl Ord for u8
    • -
  • impl Ord for u16
    • -
  • impl Ord for u32
    • -
  • impl Ord for u64
    • -
  • impl Ord for isize
    • -
  • impl Ord for i8
    • -
  • impl Ord for i16
    • -
  • impl Ord for i32
    • -
  • impl Ord for i64
    • -
  • impl<'a, A> Ord for &'a A where A: Ord + ?Sized
    • -
  • impl<'a, A> Ord for &'a mut A where A: Ord + ?Sized
    • -
  • impl<T> Ord for Box<T> where T: Ord + ?Sized
    • -
  • impl<T> Ord for PhantomData<T> where T: ?Sized
    • -
  • impl<T> Ord for Rc<T> where T: Ord + ?Sized
    • -
  • impl Ord for String
    • -
  • impl<T, E> Ord for Result<T, E> where E: Ord, T: Ord
    • -
  • impl<Ret> Ord for fn() -> Ret
    • -
  • impl<Ret> Ord for extern fn() -> Ret
    • -
  • impl<Ret> Ord for unsafe fn() -> Ret
    • -
  • impl<Ret> Ord for unsafe extern fn() -> Ret
    • -
  • impl<Ret, A> Ord for fn(A) -> Ret
    • -
  • impl<Ret, A> Ord for extern fn(A) -> Ret
    • -
  • impl<Ret, A> Ord for unsafe fn(A) -> Ret
    • -
  • impl<Ret, A> Ord for unsafe extern fn(A) -> Ret
    • -
  • impl<Ret, A, B> Ord for fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Ord for extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Ord for unsafe fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Ord for unsafe extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B, C> Ord for fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Ord for extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Ord for unsafe fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Ord for unsafe extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C, D> Ord for fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Ord for extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Ord for unsafe fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Ord for unsafe extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Ord for fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Ord for extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Ord for unsafe fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Ord for unsafe extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Ord for fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Ord for extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Ord for unsafe fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Ord for unsafe extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Ord for fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Ord for extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Ord for unsafe fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Ord for unsafe extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Ord for fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Ord for extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Ord for unsafe fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Ord for unsafe extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Ord for fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Ord for extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Ord for unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Ord for unsafe extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for unsafe extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for unsafe fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<T> Ord for *const T where T: ?Sized
    • -
  • impl<T> Ord for *mut T where T: ?Sized
    • -
  • impl<'a, B> Ord for Cow<'a, B> where B: Ord + ToOwned + ?Sized
    • -
  • impl<T> Ord for Option<T> where T: Ord
    • -
  • impl<T> Ord for Wrapping<T> where T: Ord
    • -
  • impl<T> Ord for NonZero<T> where T: Zeroable + Ord
    • -
  • impl<T> Ord for [T; 0] where T: Ord
    • -
  • impl<T> Ord for [T; 1] where T: Ord
    • -
  • impl<T> Ord for [T; 2] where T: Ord
    • -
  • impl<T> Ord for [T; 3] where T: Ord
    • -
  • impl<T> Ord for [T; 4] where T: Ord
    • -
  • impl<T> Ord for [T; 5] where T: Ord
    • -
  • impl<T> Ord for [T; 6] where T: Ord
    • -
  • impl<T> Ord for [T; 7] where T: Ord
    • -
  • impl<T> Ord for [T; 8] where T: Ord
    • -
  • impl<T> Ord for [T; 9] where T: Ord
    • -
  • impl<T> Ord for [T; 10] where T: Ord
    • -
  • impl<T> Ord for [T; 11] where T: Ord
    • -
  • impl<T> Ord for [T; 12] where T: Ord
    • -
  • impl<T> Ord for [T; 13] where T: Ord
    • -
  • impl<T> Ord for [T; 14] where T: Ord
    • -
  • impl<T> Ord for [T; 15] where T: Ord
    • -
  • impl<T> Ord for [T; 16] where T: Ord
    • -
  • impl<T> Ord for [T; 17] where T: Ord
    • -
  • impl<T> Ord for [T; 18] where T: Ord
    • -
  • impl<T> Ord for [T; 19] where T: Ord
    • -
  • impl<T> Ord for [T; 20] where T: Ord
    • -
  • impl<T> Ord for [T; 21] where T: Ord
    • -
  • impl<T> Ord for [T; 22] where T: Ord
    • -
  • impl<T> Ord for [T; 23] where T: Ord
    • -
  • impl<T> Ord for [T; 24] where T: Ord
    • -
  • impl<T> Ord for [T; 25] where T: Ord
    • -
  • impl<T> Ord for [T; 26] where T: Ord
    • -
  • impl<T> Ord for [T; 27] where T: Ord
    • -
  • impl<T> Ord for [T; 28] where T: Ord
    • -
  • impl<T> Ord for [T; 29] where T: Ord
    • -
  • impl<T> Ord for [T; 30] where T: Ord
    • -
  • impl<T> Ord for [T; 31] where T: Ord
    • -
  • impl<T> Ord for [T; 32] where T: Ord
    • -
  • impl<T> Ord for [T] where T: Ord
    • -
  • impl Ord for str
    • -
  • impl Ord for Error
    • -
  • impl<A> Ord for (A,) where A: Ord
    • -
  • impl<A, B> Ord for (A, B) where B: Ord, A: Ord
    • -
  • impl<A, B, C> Ord for (A, B, C) where C: Ord, A: Ord, B: Ord
    • -
  • impl<A, B, C, D> Ord for (A, B, C, D) where D: Ord, C: Ord, A: Ord, B: Ord
    • -
  • impl<A, B, C, D, E> Ord for (A, B, C, D, E) where A: Ord, E: Ord, D: Ord, C: Ord, B: Ord
    • -
  • impl<A, B, C, D, E, F> Ord for (A, B, C, D, E, F) where A: Ord, C: Ord, D: Ord, B: Ord, F: Ord, E: Ord
    • -
  • impl<A, B, C, D, E, F, G> Ord for (A, B, C, D, E, F, G) where B: Ord, A: Ord, F: Ord, D: Ord, G: Ord, E: Ord, C: Ord
    • -
  • impl<A, B, C, D, E, F, G, H> Ord for (A, B, C, D, E, F, G, H) where G: Ord, H: Ord, D: Ord, F: Ord, C: Ord, E: Ord, A: Ord, B: Ord
    • -
  • impl<A, B, C, D, E, F, G, H, I> Ord for (A, B, C, D, E, F, G, H, I) where G: Ord, C: Ord, B: Ord, H: Ord, A: Ord, F: Ord, I: Ord, E: Ord, D: Ord
    • -
  • impl<A, B, C, D, E, F, G, H, I, J> Ord for (A, B, C, D, E, F, G, H, I, J) where C: Ord, E: Ord, D: Ord, J: Ord, I: Ord, A: Ord, B: Ord, F: Ord, G: Ord, H: Ord
    • -
  • impl<A, B, C, D, E, F, G, H, I, J, K> Ord for (A, B, C, D, E, F, G, H, I, J, K) where D: Ord, J: Ord, C: Ord, G: Ord, F: Ord, I: Ord, E: Ord, A: Ord, B: Ord, K: Ord, H: Ord
    • -
  • impl<A, B, C, D, E, F, G, H, I, J, K, L> Ord for (A, B, C, D, E, F, G, H, I, J, K, L) where H: Ord, A: Ord, I: Ord, G: Ord, D: Ord, B: Ord, E: Ord, L: Ord, J: Ord, C: Ord, F: Ord, K: Ord
    • -
  • impl<K, V> Ord for BTreeMap<K, V> where K: Ord, V: Ord
    • -
  • impl<T> Ord for BTreeSet<T> where T: Ord
    • -
  • impl<E> Ord for EnumSet<E> where E: Ord
    • -
  • impl<T> Ord for Arc<T> where T: Ord + ?Sized
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/cmp/trait.PartialEq.html b/doc/bitflags/__core/cmp/trait.PartialEq.html deleted file mode 100644 index 93ab86d5..00000000 --- a/doc/bitflags/__core/cmp/trait.PartialEq.html +++ /dev/null @@ -1,690 +0,0 @@ - - - - - - - - - - bitflags::__core::cmp::PartialEq - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::cmp::PartialEq - - [−] - - [src]

-
pub trait PartialEq<Rhs = Self> where Rhs: ?Sized {
-    fn eq(&self, other: &Rhs) -> bool;
-
-    fn ne(&self, other: &Rhs) -> bool { ... }
-}

Trait for equality comparisons which are partial equivalence -relations.

- -

This trait allows for partial equality, for types that do not have a full -equivalence relation. For example, in floating point numbers NaN != NaN, -so floating point types implement PartialEq but not Eq.

- -

Formally, the equality must be (for all a, b and c):

- -
    -
  • symmetric: a == b implies b == a; and
    • -
  • transitive: a == b and b == c implies a == c.
    • -
- -

Note that these requirements mean that the trait itself must be implemented -symmetrically and transitively: if T: PartialEq<U> and U: PartialEq<V> -then U: PartialEq<T> and T: PartialEq<V>.

- -

PartialEq only requires the eq method to be implemented; ne is defined -in terms of it by default. Any manual implementation of ne must respect -the rule that eq is a strict inverse of ne; that is, !(a == b) if and -only if a != b.

- -

This trait can be used with #[derive].

- -

Examples

-
-let x: u32 = 0;
-let y: u32 = 1;
-
-assert_eq!(x == y, false);
-assert_eq!(x.eq(&y), false);
-
-

Required Methods

-
-

fn eq(&self, other: &Rhs) -> bool

This method tests for self and other values to be equal, and is used -by ==.

-
-

Provided Methods

-
-

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/cmp/trait.PartialOrd.html b/doc/bitflags/__core/cmp/trait.PartialOrd.html deleted file mode 100644 index af8aaeb4..00000000 --- a/doc/bitflags/__core/cmp/trait.PartialOrd.html +++ /dev/null @@ -1,418 +0,0 @@ - - - - - - - - - - bitflags::__core::cmp::PartialOrd - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::cmp::PartialOrd - - [−] - - [src]

-
pub trait PartialOrd<Rhs = Self>: PartialEq<Rhs> where Rhs: ?Sized {
-    fn partial_cmp(&self, other: &Rhs) -> Option<Ordering>;
-
-    fn lt(&self, other: &Rhs) -> bool { ... }
-    fn le(&self, other: &Rhs) -> bool { ... }
-    fn gt(&self, other: &Rhs) -> bool { ... }
-    fn ge(&self, other: &Rhs) -> bool { ... }
-}

Trait for values that can be compared for a sort-order.

- -

The comparison must satisfy, for all a, b and c:

- -
    -
  • antisymmetry: if a < b then !(a > b), as well as a > b implying !(a < b); and
    • -
  • transitivity: a < b and b < c implies a < c. The same must hold for both == and >.
    • -
- -

Note that these requirements mean that the trait itself must be implemented symmetrically and -transitively: if T: PartialOrd<U> and U: PartialOrd<V> then U: PartialOrd<T> and T: PartialOrd<V>.

- -

PartialOrd only requires implementation of the partial_cmp method, with the others generated -from default implementations.

- -

However it remains possible to implement the others separately for types which do not have a -total order. For example, for floating point numbers, NaN < 0 == false and NaN >= 0 == false (cf. IEEE 754-2008 section 5.11).

- -

This trait can be used with #[derive]. When derived, it will produce an ordering -based on the top-to-bottom declaration order of the struct's members.

- -

Examples

-
-let x : u32 = 0;
-let y : u32 = 1;
-
-assert_eq!(x < y, true);
-assert_eq!(x.lt(&y), true);
-
-

Required Methods

-
-

fn partial_cmp(&self, other: &Rhs) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

- -

Examples

-
-use std::cmp::Ordering;
-
-let result = 1.0.partial_cmp(&2.0);
-assert_eq!(result, Some(Ordering::Less));
-
-let result = 1.0.partial_cmp(&1.0);
-assert_eq!(result, Some(Ordering::Equal));
-
-let result = 2.0.partial_cmp(&1.0);
-assert_eq!(result, Some(Ordering::Greater));
- -

When comparison is impossible:

- -
-let result = std::f64::NAN.partial_cmp(&1.0);
-assert_eq!(result, None);
-
-

Provided Methods

-
-

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

- -

Examples

-
-let result = 1.0 < 2.0;
-assert_eq!(result, true);
-
-let result = 2.0 < 1.0;
-assert_eq!(result, false);
-

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= -operator.

- -

Examples

-
-let result = 1.0 <= 2.0;
-assert_eq!(result, true);
-
-let result = 2.0 <= 2.0;
-assert_eq!(result, true);
-

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

- -

Examples

-
-let result = 1.0 > 2.0;
-assert_eq!(result, false);
-
-let result = 2.0 > 2.0;
-assert_eq!(result, false);
-

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= -operator.

- -

Examples

-
-let result = 2.0 >= 1.0;
-assert_eq!(result, true);
-
-let result = 2.0 >= 2.0;
-assert_eq!(result, true);
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/binary_heap/index.html b/doc/bitflags/__core/collections/binary_heap/index.html deleted file mode 100644 index 3f435295..00000000 --- a/doc/bitflags/__core/collections/binary_heap/index.html +++ /dev/null @@ -1,273 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::binary_heap - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::collections::binary_heap - - [−] - - [src]

-

A priority queue implemented with a binary heap.

- -

Insertion and popping the largest element have O(log n) time complexity. -Checking the largest element is O(1). Converting a vector to a binary heap -can be done in-place, and has O(n) complexity. A binary heap can also be -converted to a sorted vector in-place, allowing it to be used for an O(n log n) in-place heapsort.

- -

Examples

-

This is a larger example that implements Dijkstra's algorithm -to solve the shortest path problem on a directed graph. -It shows how to use BinaryHeap with custom types.

- -
-use std::cmp::Ordering;
-use std::collections::BinaryHeap;
-use std::usize;
-
-#[derive(Copy, Clone, Eq, PartialEq)]
-struct State {
-    cost: usize,
-    position: usize,
-}
-
-// The priority queue depends on `Ord`.
-// Explicitly implement the trait so the queue becomes a min-heap
-// instead of a max-heap.
-impl Ord for State {
-    fn cmp(&self, other: &State) -> Ordering {
-        // Notice that the we flip the ordering here
-        other.cost.cmp(&self.cost)
-    }
-}
-
-// `PartialOrd` needs to be implemented as well.
-impl PartialOrd for State {
-    fn partial_cmp(&self, other: &State) -> Option<Ordering> {
-        Some(self.cmp(other))
-    }
-}
-
-// Each node is represented as an `usize`, for a shorter implementation.
-struct Edge {
-    node: usize,
-    cost: usize,
-}
-
-// Dijkstra's shortest path algorithm.
-
-// Start at `start` and use `dist` to track the current shortest distance
-// to each node. This implementation isn't memory-efficient as it may leave duplicate
-// nodes in the queue. It also uses `usize::MAX` as a sentinel value,
-// for a simpler implementation.
-fn shortest_path(adj_list: &Vec<Vec<Edge>>, start: usize, goal: usize) -> Option<usize> {
-    // dist[node] = current shortest distance from `start` to `node`
-    let mut dist: Vec<_> = (0..adj_list.len()).map(|_| usize::MAX).collect();
-
-    let mut heap = BinaryHeap::new();
-
-    // We're at `start`, with a zero cost
-    dist[start] = 0;
-    heap.push(State { cost: 0, position: start });
-
-    // Examine the frontier with lower cost nodes first (min-heap)
-    while let Some(State { cost, position }) = heap.pop() {
-        // Alternatively we could have continued to find all shortest paths
-        if position == goal { return Some(cost); }
-
-        // Important as we may have already found a better way
-        if cost > dist[position] { continue; }
-
-        // For each node we can reach, see if we can find a way with
-        // a lower cost going through this node
-        for edge in &adj_list[position] {
-            let next = State { cost: cost + edge.cost, position: edge.node };
-
-            // If so, add it to the frontier and continue
-            if next.cost < dist[next.position] {
-                heap.push(next);
-                // Relaxation, we have now found a better way
-                dist[next.position] = next.cost;
-            }
-        }
-    }
-
-    // Goal not reachable
-    None
-}
-
-fn main() {
-    // This is the directed graph we're going to use.
-    // The node numbers correspond to the different states,
-    // and the edge weights symbolize the cost of moving
-    // from one node to another.
-    // Note that the edges are one-way.
-    //
-    //                  7
-    //          +-----------------+
-    //          |                 |
-    //          v   1        2    |  2
-    //          0 -----> 1 -----> 3 ---> 4
-    //          |        ^        ^      ^
-    //          |        | 1      |      |
-    //          |        |        | 3    | 1
-    //          +------> 2 -------+      |
-    //           10      |               |
-    //                   +---------------+
-    //
-    // The graph is represented as an adjacency list where each index,
-    // corresponding to a node value, has a list of outgoing edges.
-    // Chosen for its efficiency.
-    let graph = vec![
-        // Node 0
-        vec![Edge { node: 2, cost: 10 },
-             Edge { node: 1, cost: 1 }],
-        // Node 1
-        vec![Edge { node: 3, cost: 2 }],
-        // Node 2
-        vec![Edge { node: 1, cost: 1 },
-             Edge { node: 3, cost: 3 },
-             Edge { node: 4, cost: 1 }],
-        // Node 3
-        vec![Edge { node: 0, cost: 7 },
-             Edge { node: 4, cost: 2 }],
-        // Node 4
-        vec![]];
-
-    assert_eq!(shortest_path(&graph, 0, 1), Some(1));
-    assert_eq!(shortest_path(&graph, 0, 3), Some(3));
-    assert_eq!(shortest_path(&graph, 3, 0), Some(7));
-    assert_eq!(shortest_path(&graph, 0, 4), Some(5));
-    assert_eq!(shortest_path(&graph, 4, 0), None);
-}
-

Structs

- - - - - - - - - - - - - - - - -
BinaryHeap -

A priority queue implemented with a binary heap.

-
Drain -

An iterator that drains a BinaryHeap.

-
IntoIter -

An iterator that moves out of a BinaryHeap.

-
Iter -

BinaryHeap iterator.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/binary_heap/sidebar-items.js b/doc/bitflags/__core/collections/binary_heap/sidebar-items.js deleted file mode 100644 index 4345bb73..00000000 --- a/doc/bitflags/__core/collections/binary_heap/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["BinaryHeap","A priority queue implemented with a binary heap."],["Drain","An iterator that drains a `BinaryHeap`."],["IntoIter","An iterator that moves out of a `BinaryHeap`."],["Iter","`BinaryHeap` iterator."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/collections/binary_heap/struct.BinaryHeap.html b/doc/bitflags/__core/collections/binary_heap/struct.BinaryHeap.html deleted file mode 100644 index ba4aa1ea..00000000 --- a/doc/bitflags/__core/collections/binary_heap/struct.BinaryHeap.html +++ /dev/null @@ -1,491 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::binary_heap::BinaryHeap - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::binary_heap::BinaryHeap - - [−] - - [src]

-
pub struct BinaryHeap<T> {
-    // some fields omitted
-}
1.0.0

A priority queue implemented with a binary heap.

- -

This will be a max-heap.

- -

It is a logic error for an item to be modified in such a way that the -item's ordering relative to any other item, as determined by the Ord -trait, changes while it is in the heap. This is normally only possible -through Cell, RefCell, global state, I/O, or unsafe code.

- -

Examples

-
-use std::collections::BinaryHeap;
-
-// Type inference lets us omit an explicit type signature (which
-// would be `BinaryHeap<i32>` in this example).
-let mut heap = BinaryHeap::new();
-
-// We can use peek to look at the next item in the heap. In this case,
-// there's no items in there yet so we get None.
-assert_eq!(heap.peek(), None);
-
-// Let's add some scores...
-heap.push(1);
-heap.push(5);
-heap.push(2);
-
-// Now peek shows the most important item in the heap.
-assert_eq!(heap.peek(), Some(&5));
-
-// We can check the length of a heap.
-assert_eq!(heap.len(), 3);
-
-// We can iterate over the items in the heap, although they are returned in
-// a random order.
-for x in &heap {
-    println!("{}", x);
-}
-
-// If we instead pop these scores, they should come back in order.
-assert_eq!(heap.pop(), Some(5));
-assert_eq!(heap.pop(), Some(2));
-assert_eq!(heap.pop(), Some(1));
-assert_eq!(heap.pop(), None);
-
-// We can clear the heap of any remaining items.
-heap.clear();
-
-// The heap should now be empty.
-assert!(heap.is_empty())
-

Methods

impl<T> BinaryHeap<T> where T: Ord

fn new() -> BinaryHeap<T>

-

Creates an empty BinaryHeap as a max-heap.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-heap.push(4);
-

fn with_capacity(capacity: usize) -> BinaryHeap<T>

-

Creates an empty BinaryHeap with a specific capacity. -This preallocates enough memory for capacity elements, -so that the BinaryHeap does not have to be reallocated -until it contains at least that many values.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::with_capacity(10);
-heap.push(4);
-

fn iter(&self) -> Iter<T>

-

Returns an iterator visiting all values in the underlying vector, in -arbitrary order.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let heap = BinaryHeap::from(vec![1, 2, 3, 4]);
-
-// Print 1, 2, 3, 4 in arbitrary order
-for x in heap.iter() {
-    println!("{}", x);
-}
-

fn peek(&self) -> Option<&T>

-

Returns the greatest item in the binary heap, or None if it is empty.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-assert_eq!(heap.peek(), None);
-
-heap.push(1);
-heap.push(5);
-heap.push(2);
-assert_eq!(heap.peek(), Some(&5));
-
-

fn capacity(&self) -> usize

-

Returns the number of elements the binary heap can hold without reallocating.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::with_capacity(100);
-assert!(heap.capacity() >= 100);
-heap.push(4);
-

fn reserve_exact(&mut self, additional: usize)

-

Reserves the minimum capacity for exactly additional more elements to be inserted in the -given BinaryHeap. Does nothing if the capacity is already sufficient.

- -

Note that the allocator may give the collection more space than it requests. Therefore -capacity can not be relied upon to be precisely minimal. Prefer reserve if future -insertions are expected.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-heap.reserve_exact(100);
-assert!(heap.capacity() >= 100);
-heap.push(4);
-

fn reserve(&mut self, additional: usize)

-

Reserves capacity for at least additional more elements to be inserted in the -BinaryHeap. The collection may reserve more space to avoid frequent reallocations.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-heap.reserve(100);
-assert!(heap.capacity() >= 100);
-heap.push(4);
-

fn shrink_to_fit(&mut self)

-

Discards as much additional capacity as possible.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap: BinaryHeap<i32> = BinaryHeap::with_capacity(100);
-
-assert!(heap.capacity() >= 100);
-heap.shrink_to_fit();
-assert!(heap.capacity() == 0);
-

fn pop(&mut self) -> Option<T>

-

Removes the greatest item from the binary heap and returns it, or None if it -is empty.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::from(vec![1, 3]);
-
-assert_eq!(heap.pop(), Some(3));
-assert_eq!(heap.pop(), Some(1));
-assert_eq!(heap.pop(), None);
-

fn push(&mut self, item: T)

-

Pushes an item onto the binary heap.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-heap.push(3);
-heap.push(5);
-heap.push(1);
-
-assert_eq!(heap.len(), 3);
-assert_eq!(heap.peek(), Some(&5));
-

fn push_pop(&mut self, item: T) -> T

-
Unstable (binary_heap_extras)

: needs to be audited

-

Pushes an item onto the binary heap, then pops the greatest item off the queue in -an optimized fashion.

- -

Examples

-

Basic usage:

- -
-#![feature(binary_heap_extras)]
-
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-heap.push(1);
-heap.push(5);
-
-assert_eq!(heap.push_pop(3), 5);
-assert_eq!(heap.push_pop(9), 9);
-assert_eq!(heap.len(), 2);
-assert_eq!(heap.peek(), Some(&3));
-

fn replace(&mut self, item: T) -> Option<T>

-
Unstable (binary_heap_extras)

: needs to be audited

-

Pops the greatest item off the binary heap, then pushes an item onto the queue in -an optimized fashion. The push is done regardless of whether the binary heap -was empty.

- -

Examples

-

Basic usage:

- -
-#![feature(binary_heap_extras)]
-
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-
-assert_eq!(heap.replace(1), None);
-assert_eq!(heap.replace(3), Some(1));
-assert_eq!(heap.len(), 1);
-assert_eq!(heap.peek(), Some(&3));
-

fn into_vec(self) -> Vec<T>1.5.0

-

Consumes the BinaryHeap and returns the underlying vector -in arbitrary order.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let heap = BinaryHeap::from(vec![1, 2, 3, 4, 5, 6, 7]);
-let vec = heap.into_vec();
-
-// Will print in some order
-for x in vec {
-    println!("{}", x);
-}
-

fn into_sorted_vec(self) -> Vec<T>1.5.0

-

Consumes the BinaryHeap and returns a vector in sorted -(ascending) order.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-
-let mut heap = BinaryHeap::from(vec![1, 2, 4, 5, 7]);
-heap.push(6);
-heap.push(3);
-
-let vec = heap.into_sorted_vec();
-assert_eq!(vec, [1, 2, 3, 4, 5, 6, 7]);
-

fn len(&self) -> usize

-

Returns the length of the binary heap.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let heap = BinaryHeap::from(vec![1, 3]);
-
-assert_eq!(heap.len(), 2);
-

fn is_empty(&self) -> bool

-

Checks if the binary heap is empty.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-
-assert!(heap.is_empty());
-
-heap.push(3);
-heap.push(5);
-heap.push(1);
-
-assert!(!heap.is_empty());
-

fn drain(&mut self) -> Drain<T>1.6.0

-

Clears the binary heap, returning an iterator over the removed elements.

- -

The elements are removed in arbitrary order.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::from(vec![1, 3]);
-
-assert!(!heap.is_empty());
-
-for x in heap.drain() {
-    println!("{}", x);
-}
-
-assert!(heap.is_empty());
-

fn clear(&mut self)

-

Drops all items from the binary heap.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::from(vec![1, 3]);
-
-assert!(!heap.is_empty());
-
-heap.clear();
-
-assert!(heap.is_empty());
-

fn append(&mut self, other: &mut BinaryHeap<T>)

-
Unstable (binary_heap_append)

: needs to be audited

-

Moves all the elements of other into self, leaving other empty.

- -

Examples

-

Basic usage:

- -
-#![feature(binary_heap_append)]
-
-use std::collections::BinaryHeap;
-
-let v = vec![-10, 1, 2, 3, 3];
-let mut a = BinaryHeap::from(v);
-
-let v = vec![-20, 5, 43];
-let mut b = BinaryHeap::from(v);
-
-a.append(&mut b);
-
-assert_eq!(a.into_sorted_vec(), [-20, -10, 1, 2, 3, 3, 5, 43]);
-assert!(b.is_empty());
-

Trait Implementations

impl<T> Clone for BinaryHeap<T> where T: Clone

fn clone(&self) -> BinaryHeap<T>

-

fn clone_from(&mut self, source: &BinaryHeap<T>)

-

impl<T> Default for BinaryHeap<T> where T: Ord

fn default() -> BinaryHeap<T>

-

impl<T> Debug for BinaryHeap<T> where T: Ord + Debug1.4.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> From<Vec<T>> for BinaryHeap<T> where T: Ord

fn from(vec: Vec<T>) -> BinaryHeap<T>

-

impl<T> FromIterator<T> for BinaryHeap<T> where T: Ord

fn from_iter<I>(iter: I) -> BinaryHeap<T> where I: IntoIterator<Item=T>

-

impl<T> IntoIterator for BinaryHeap<T> where T: Ord

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Creates a consuming iterator, that is, one that moves each value out of -the binary heap in arbitrary order. The binary heap cannot be used -after calling this.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let heap = BinaryHeap::from(vec![1, 2, 3, 4]);
-
-// Print 1, 2, 3, 4 in arbitrary order
-for x in heap.into_iter() {
-    // x has type i32, not &i32
-    println!("{}", x);
-}
-

impl<'a, T> IntoIterator for &'a BinaryHeap<T> where T: Ord

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<T> Extend<T> for BinaryHeap<T> where T: Ord

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=T>

-

impl<'a, T> Extend<&'a T> for BinaryHeap<T> where T: Copy + 'a + Ord1.2.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a T>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/binary_heap/struct.Drain.html b/doc/bitflags/__core/collections/binary_heap/struct.Drain.html deleted file mode 100644 index df0806a8..00000000 --- a/doc/bitflags/__core/collections/binary_heap/struct.Drain.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::binary_heap::Drain - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::binary_heap::Drain - - [−] - - [src]

-
pub struct Drain<'a, T> where T: 'a {
-    // some fields omitted
-}
1.6.0

An iterator that drains a BinaryHeap.

-

Trait Implementations

impl<'a, T> Iterator for Drain<'a, T> where T: 'a1.0.0

type Item = T

-

fn next(&mut self) -> Option<T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T> DoubleEndedIterator for Drain<'a, T> where T: 'a1.0.0

fn next_back(&mut self) -> Option<T>

-

impl<'a, T> ExactSizeIterator for Drain<'a, T> where T: 'a1.0.0

fn len(&self) -> usize1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/binary_heap/struct.IntoIter.html b/doc/bitflags/__core/collections/binary_heap/struct.IntoIter.html deleted file mode 100644 index 535485a6..00000000 --- a/doc/bitflags/__core/collections/binary_heap/struct.IntoIter.html +++ /dev/null @@ -1,167 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::binary_heap::IntoIter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::binary_heap::IntoIter - - [−] - - [src]

-
pub struct IntoIter<T> {
-    // some fields omitted
-}
1.0.0

An iterator that moves out of a BinaryHeap.

-

Trait Implementations

impl<T> Iterator for IntoIter<T>

type Item = T

-

fn next(&mut self) -> Option<T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<T> DoubleEndedIterator for IntoIter<T>

fn next_back(&mut self) -> Option<T>

-

impl<T> ExactSizeIterator for IntoIter<T>

fn len(&self) -> usize

-

Derived Implementations

impl<T> Clone for IntoIter<T> where T: Clone

fn clone(&self) -> IntoIter<T>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/binary_heap/struct.Iter.html b/doc/bitflags/__core/collections/binary_heap/struct.Iter.html deleted file mode 100644 index fdce9725..00000000 --- a/doc/bitflags/__core/collections/binary_heap/struct.Iter.html +++ /dev/null @@ -1,167 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::binary_heap::Iter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::binary_heap::Iter - - [−] - - [src]

-
pub struct Iter<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

BinaryHeap iterator.

-

Trait Implementations

impl<'a, T> Clone for Iter<'a, T>

fn clone(&self) -> Iter<'a, T>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, T> Iterator for Iter<'a, T>

type Item = &'a T

-

fn next(&mut self) -> Option<&'a T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T> DoubleEndedIterator for Iter<'a, T>

fn next_back(&mut self) -> Option<&'a T>

-

impl<'a, T> ExactSizeIterator for Iter<'a, T>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_map/enum.Entry.html b/doc/bitflags/__core/collections/btree_map/enum.Entry.html deleted file mode 100644 index c7c8790a..00000000 --- a/doc/bitflags/__core/collections/btree_map/enum.Entry.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_map::Entry - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::collections::btree_map::Entry - - [−] - - [src]

-
pub enum Entry<'a, K, V> where V: 'a, K: 'a {
-    Vacant(VacantEntry<'a, K, V>),
-    Occupied(OccupiedEntry<'a, K, V>),
-}
1.0.0

A view into a single entry in a map, which may either be vacant or occupied.

-

Variants

-
Vacant

A vacant Entry

-
Occupied

An occupied Entry

-

Methods

impl<'a, K, V> Entry<'a, K, V> where K: Ord

fn or_insert(self, default: V) -> &'a mut V

-

Ensures a value is in the entry by inserting the default if empty, and returns -a mutable reference to the value in the entry.

-

fn or_insert_with<F>(self, default: F) -> &'a mut V where F: FnOnce() -> V

-

Ensures a value is in the entry by inserting the result of the default function if empty, -and returns a mutable reference to the value in the entry.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_map/index.html b/doc/bitflags/__core/collections/btree_map/index.html deleted file mode 100644 index cd6161c8..00000000 --- a/doc/bitflags/__core/collections/btree_map/index.html +++ /dev/null @@ -1,198 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_map - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::collections::btree_map - - [−] - - [src]

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
BTreeMap -

A map based on a B-Tree.

-
IntoIter -

An owning iterator over a BTreeMap's entries.

-
Iter -

An iterator over a BTreeMap's entries.

-
IterMut -

A mutable iterator over a BTreeMap's entries.

-
Keys -

An iterator over a BTreeMap's keys.

-
OccupiedEntry -

An occupied Entry.

-
VacantEntry -

A vacant Entry.

-
Values -

An iterator over a BTreeMap's values.

-
Range - [Unstable]

An iterator over a sub-range of BTreeMap's entries.

-
RangeMut - [Unstable]

A mutable iterator over a sub-range of BTreeMap's entries.

-
ValuesMut - [Unstable]

A mutable iterator over a BTreeMap's values.

-

Enums

- - - - -
Entry -

A view into a single entry in a map, which may either be vacant or occupied.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_map/sidebar-items.js b/doc/bitflags/__core/collections/btree_map/sidebar-items.js deleted file mode 100644 index 9c2d33df..00000000 --- a/doc/bitflags/__core/collections/btree_map/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["Entry","A view into a single entry in a map, which may either be vacant or occupied."]],"struct":[["BTreeMap","A map based on a B-Tree."],["IntoIter","An owning iterator over a BTreeMap's entries."],["Iter","An iterator over a BTreeMap's entries."],["IterMut","A mutable iterator over a BTreeMap's entries."],["Keys","An iterator over a BTreeMap's keys."],["OccupiedEntry","An occupied Entry."],["Range","An iterator over a sub-range of BTreeMap's entries."],["RangeMut","A mutable iterator over a sub-range of BTreeMap's entries."],["VacantEntry","A vacant Entry."],["Values","An iterator over a BTreeMap's values."],["ValuesMut","A mutable iterator over a BTreeMap's values."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_map/struct.BTreeMap.html b/doc/bitflags/__core/collections/btree_map/struct.BTreeMap.html deleted file mode 100644 index 07554c81..00000000 --- a/doc/bitflags/__core/collections/btree_map/struct.BTreeMap.html +++ /dev/null @@ -1,588 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_map::BTreeMap - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_map::BTreeMap - - [−] - - [src]

-
pub struct BTreeMap<K, V> {
-    // some fields omitted
-}
1.0.0

A map based on a B-Tree.

- -

B-Trees represent a fundamental compromise between cache-efficiency and actually minimizing -the amount of work performed in a search. In theory, a binary search tree (BST) is the optimal -choice for a sorted map, as a perfectly balanced BST performs the theoretical minimum amount of -comparisons necessary to find an element (log2n). However, in practice the way this -is done is very inefficient for modern computer architectures. In particular, every element -is stored in its own individually heap-allocated node. This means that every single insertion -triggers a heap-allocation, and every single comparison should be a cache-miss. Since these -are both notably expensive things to do in practice, we are forced to at very least reconsider -the BST strategy.

- -

A B-Tree instead makes each node contain B-1 to 2B-1 elements in a contiguous array. By doing -this, we reduce the number of allocations by a factor of B, and improve cache efficiency in -searches. However, this does mean that searches will have to do more comparisons on average. -The precise number of comparisons depends on the node search strategy used. For optimal cache -efficiency, one could search the nodes linearly. For optimal comparisons, one could search -the node using binary search. As a compromise, one could also perform a linear search -that initially only checks every ith element for some choice of i.

- -

Currently, our implementation simply performs naive linear search. This provides excellent -performance on small nodes of elements which are cheap to compare. However in the future we -would like to further explore choosing the optimal search strategy based on the choice of B, -and possibly other factors. Using linear search, searching for a random element is expected -to take O(B logBn) comparisons, which is generally worse than a BST. In practice, -however, performance is excellent.

- -

It is a logic error for a key to be modified in such a way that the key's ordering relative to -any other key, as determined by the Ord trait, changes while it is in the map. This is -normally only possible through Cell, RefCell, global state, I/O, or unsafe code.

- -

Examples

-
-use std::collections::BTreeMap;
-
-// type inference lets us omit an explicit type signature (which
-// would be `BTreeMap<&str, &str>` in this example).
-let mut movie_reviews = BTreeMap::new();
-
-// review some books.
-movie_reviews.insert("Office Space",       "Deals with real issues in the workplace.");
-movie_reviews.insert("Pulp Fiction",       "Masterpiece.");
-movie_reviews.insert("The Godfather",      "Very enjoyable.");
-movie_reviews.insert("The Blues Brothers", "Eye lyked it alot.");
-
-// check for a specific one.
-if !movie_reviews.contains_key("Les Misérables") {
-    println!("We've got {} reviews, but Les Misérables ain't one.",
-             movie_reviews.len());
-}
-
-// oops, this review has a lot of spelling mistakes, let's delete it.
-movie_reviews.remove("The Blues Brothers");
-
-// look up the values associated with some keys.
-let to_find = ["Up!", "Office Space"];
-for book in &to_find {
-    match movie_reviews.get(book) {
-       Some(review) => println!("{}: {}", book, review),
-       None => println!("{} is unreviewed.", book)
-    }
-}
-
-// iterate over everything.
-for (movie, review) in &movie_reviews {
-    println!("{}: \"{}\"", movie, review);
-}
- -

BTreeMap also implements an Entry API, which allows -for more complex methods of getting, setting, updating and removing keys and -their values:

- -
-use std::collections::BTreeMap;
-
-// type inference lets us omit an explicit type signature (which
-// would be `BTreeMap<&str, u8>` in this example).
-let mut player_stats = BTreeMap::new();
-
-fn random_stat_buff() -> u8 {
-    // could actually return some random value here - let's just return
-    // some fixed value for now
-    42
-}
-
-// insert a key only if it doesn't already exist
-player_stats.entry("health").or_insert(100);
-
-// insert a key using a function that provides a new value only if it
-// doesn't already exist
-player_stats.entry("defence").or_insert_with(random_stat_buff);
-
-// update a key, guarding against the key possibly not being set
-let stat = player_stats.entry("attack").or_insert(100);
-*stat += random_stat_buff();
-

Methods

impl<K, V> BTreeMap<K, V> where K: Ord

fn new() -> BTreeMap<K, V>

-

Makes a new empty BTreeMap with a reasonable choice for B.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-
-// entries can now be inserted into the empty map
-map.insert(1, "a");
-

fn clear(&mut self)

-

Clears the map, removing all values.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut a = BTreeMap::new();
-a.insert(1, "a");
-a.clear();
-assert!(a.is_empty());
-

fn get<Q>(&self, key: &Q) -> Option<&V> where Q: Ord + ?Sized, K: Borrow<Q>

-

Returns a reference to the value corresponding to the key.

- -

The key may be any borrowed form of the map's key type, but the ordering -on the borrowed form must match the ordering on the key type.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-map.insert(1, "a");
-assert_eq!(map.get(&1), Some(&"a"));
-assert_eq!(map.get(&2), None);
-

fn contains_key<Q>(&self, key: &Q) -> bool where K: Borrow<Q>, Q: Ord + ?Sized

-

Returns true if the map contains a value for the specified key.

- -

The key may be any borrowed form of the map's key type, but the ordering -on the borrowed form must match the ordering on the key type.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-map.insert(1, "a");
-assert_eq!(map.contains_key(&1), true);
-assert_eq!(map.contains_key(&2), false);
-

fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V> where Q: Ord + ?Sized, K: Borrow<Q>

-

Returns a mutable reference to the value corresponding to the key.

- -

The key may be any borrowed form of the map's key type, but the ordering -on the borrowed form must match the ordering on the key type.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-map.insert(1, "a");
-if let Some(x) = map.get_mut(&1) {
-    *x = "b";
-}
-assert_eq!(map[&1], "b");
-

fn insert(&mut self, key: K, value: V) -> Option<V>

-

Inserts a key-value pair into the map.

- -

If the map did not have this key present, None is returned.

- -

If the map did have this key present, the value is updated, and the old -value is returned. The key is not updated, though; this matters for -types that can be == without being identical. See the module-level -documentation for more.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-assert_eq!(map.insert(37, "a"), None);
-assert_eq!(map.is_empty(), false);
-
-map.insert(37, "b");
-assert_eq!(map.insert(37, "c"), Some("b"));
-assert_eq!(map[&37], "c");
-

fn remove<Q>(&mut self, key: &Q) -> Option<V> where Q: Ord + ?Sized, K: Borrow<Q>

-

Removes a key from the map, returning the value at the key if the key -was previously in the map.

- -

The key may be any borrowed form of the map's key type, but the ordering -on the borrowed form must match the ordering on the key type.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-map.insert(1, "a");
-assert_eq!(map.remove(&1), Some("a"));
-assert_eq!(map.remove(&1), None);
-

fn append(&mut self, other: &mut BTreeMap<K, V>)

-
Unstable (btree_append)

: recently added as part of collections reform 2

-

Moves all elements from other into Self, leaving other empty.

- -

Examples

-
-#![feature(btree_append)]
-use std::collections::BTreeMap;
-
-let mut a = BTreeMap::new();
-a.insert(1, "a");
-a.insert(2, "b");
-a.insert(3, "c");
-
-let mut b = BTreeMap::new();
-b.insert(3, "d");
-b.insert(4, "e");
-b.insert(5, "f");
-
-a.append(&mut b);
-
-assert_eq!(a.len(), 5);
-assert_eq!(b.len(), 0);
-
-assert_eq!(a[&1], "a");
-assert_eq!(a[&2], "b");
-assert_eq!(a[&3], "d");
-assert_eq!(a[&4], "e");
-assert_eq!(a[&5], "f");
-

fn range<Min, Max>(&self, min: Bound<&Min>, max: Bound<&Max>) -> Range<K, V> where Min: Ord + ?Sized, K: Borrow<Min> + Borrow<Max>, Max: Ord + ?Sized

-
Unstable (btree_range)

: matches collection reform specification, waiting for dust to settle

-

Constructs a double-ended iterator over a sub-range of elements in the map, starting -at min, and ending at max. If min is Unbounded, then it will be treated as "negative -infinity", and if max is Unbounded, then it will be treated as "positive infinity". -Thus range(Unbounded, Unbounded) will yield the whole collection.

- -

Examples

-

Basic usage:

- -
-#![feature(btree_range, collections_bound)]
-
-use std::collections::BTreeMap;
-use std::collections::Bound::{Included, Unbounded};
-
-let mut map = BTreeMap::new();
-map.insert(3, "a");
-map.insert(5, "b");
-map.insert(8, "c");
-for (&key, &value) in map.range(Included(&4), Included(&8)) {
-    println!("{}: {}", key, value);
-}
-assert_eq!(Some((&5, &"b")), map.range(Included(&4), Unbounded).next());
-

fn range_mut<Min, Max>(&mut self, min: Bound<&Min>, max: Bound<&Max>) -> RangeMut<K, V> where Min: Ord + ?Sized, K: Borrow<Min> + Borrow<Max>, Max: Ord + ?Sized

-
Unstable (btree_range)

: matches collection reform specification, waiting for dust to settle

-

Constructs a mutable double-ended iterator over a sub-range of elements in the map, starting -at min, and ending at max. If min is Unbounded, then it will be treated as "negative -infinity", and if max is Unbounded, then it will be treated as "positive infinity". -Thus range(Unbounded, Unbounded) will yield the whole collection.

- -

Examples

-

Basic usage:

- -
-#![feature(btree_range, collections_bound)]
-
-use std::collections::BTreeMap;
-use std::collections::Bound::{Included, Excluded};
-
-let mut map: BTreeMap<&str, i32> = ["Alice", "Bob", "Carol", "Cheryl"].iter()
-                                                                      .map(|&s| (s, 0))
-                                                                      .collect();
-for (_, balance) in map.range_mut(Included("B"), Excluded("Cheryl")) {
-    *balance += 100;
-}
-for (name, balance) in &map {
-    println!("{} => {}", name, balance);
-}
-

fn entry(&mut self, key: K) -> Entry<K, V>

-

Gets the given key's corresponding entry in the map for in-place manipulation.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut count: BTreeMap<&str, usize> = BTreeMap::new();
-
-// count the number of occurrences of letters in the vec
-for x in vec!["a","b","a","c","a","b"] {
-    *count.entry(x).or_insert(0) += 1;
-}
-
-assert_eq!(count["a"], 3);
-

impl<K, V> BTreeMap<K, V>

fn iter(&self) -> Iter<K, V>

-

Gets an iterator over the entries of the map, sorted by key.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-map.insert(3, "c");
-map.insert(2, "b");
-map.insert(1, "a");
-
-for (key, value) in map.iter() {
-    println!("{}: {}", key, value);
-}
-
-let (first_key, first_value) = map.iter().next().unwrap();
-assert_eq!((*first_key, *first_value), (1, "a"));
-

fn iter_mut(&mut self) -> IterMut<K, V>

-

Gets a mutable iterator over the entries of the map, sorted by key.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-map.insert("a", 1);
-map.insert("b", 2);
-map.insert("c", 3);
-
-// add 10 to the value if the key isn't "a"
-for (key, value) in map.iter_mut() {
-    if key != &"a" {
-        *value += 10;
-    }
-}
-

fn keys(&'a self) -> Keys<'a, K, V>

-

Gets an iterator over the keys of the map, in sorted order.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut a = BTreeMap::new();
-a.insert(2, "b");
-a.insert(1, "a");
-
-let keys: Vec<_> = a.keys().cloned().collect();
-assert_eq!(keys, [1, 2]);
-

fn values(&'a self) -> Values<'a, K, V>

-

Gets an iterator over the values of the map, in order by key.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut a = BTreeMap::new();
-a.insert(1, "hello");
-a.insert(2, "goodbye");
-
-let values: Vec<&str> = a.values().cloned().collect();
-assert_eq!(values, ["hello", "goodbye"]);
-

fn values_mut(&'a mut self) -> ValuesMut<'a, K, V>

-
Unstable (map_values_mut)

: recently added

-

Gets a mutable iterator over the values of the map, in order by key.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut a = BTreeMap::new();
-a.insert(1, String::from("hello"));
-a.insert(2, String::from("goodbye"));
-
-for value in a.values_mut() {
-    value.push_str("!");
-}
-
-let values: Vec<String> = a.values().cloned().collect();
-assert_eq!(values, [String::from("hello!"),
-                    String::from("goodbye!")]);
-

fn len(&self) -> usize

-

Returns the number of elements in the map.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut a = BTreeMap::new();
-assert_eq!(a.len(), 0);
-a.insert(1, "a");
-assert_eq!(a.len(), 1);
-

fn is_empty(&self) -> bool

-

Returns true if the map contains no elements.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut a = BTreeMap::new();
-assert!(a.is_empty());
-a.insert(1, "a");
-assert!(!a.is_empty());
-

Trait Implementations

impl<K, V> Drop for BTreeMap<K, V>

fn drop(&mut self)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> Clone for BTreeMap<K, V> where K: Clone, V: Clone

fn clone(&self) -> BTreeMap<K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, K, V> IntoIterator for &'a BTreeMap<K, V> where K: 'a, V: 'a

type Item = (&'a K, &'a V)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

type IntoIter = Iter<'a, K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn into_iter(self) -> Iter<'a, K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<'a, K, V> IntoIterator for &'a mut BTreeMap<K, V> where V: 'a, K: 'a

type Item = (&'a K, &'a mut V)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

type IntoIter = IterMut<'a, K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn into_iter(self) -> IterMut<'a, K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> IntoIterator for BTreeMap<K, V>

type Item = (K, V)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

type IntoIter = IntoIter<K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn into_iter(self) -> IntoIter<K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> FromIterator<(K, V)> for BTreeMap<K, V> where K: Ord

fn from_iter<T>(iter: T) -> BTreeMap<K, V> where T: IntoIterator<Item=(K, V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> Extend<(K, V)> for BTreeMap<K, V> where K: Ord

fn extend<T>(&mut self, iter: T) where T: IntoIterator<Item=(K, V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<'a, K, V> Extend<(&'a K, &'a V)> for BTreeMap<K, V> where K: Copy + Ord, V: Copy

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=(&'a K, &'a V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> Hash for BTreeMap<K, V> where K: Hash, V: Hash

fn hash<H>(&self, state: &mut H) where H: Hasher

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<K, V> Default for BTreeMap<K, V> where K: Ord

fn default() -> BTreeMap<K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> PartialEq<BTreeMap<K, V>> for BTreeMap<K, V> where K: PartialEq<K>, V: PartialEq<V>

fn eq(&self, other: &BTreeMap<K, V>) -> bool

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn ne(&self, other: &Rhs) -> bool

-

impl<K, V> Eq for BTreeMap<K, V> where K: Eq, V: Eq

impl<K, V> PartialOrd<BTreeMap<K, V>> for BTreeMap<K, V> where K: PartialOrd<K>, V: PartialOrd<V>

fn partial_cmp(&self, other: &BTreeMap<K, V>) -> Option<Ordering>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<K, V> Ord for BTreeMap<K, V> where K: Ord, V: Ord

fn cmp(&self, other: &BTreeMap<K, V>) -> Ordering

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> Debug for BTreeMap<K, V> where V: Debug, K: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<'a, K, Q, V> Index<&'a Q> for BTreeMap<K, V> where Q: Ord + ?Sized, K: Ord + Borrow<Q>

type Output = V

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn index(&self, key: &Q) -> &V

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_map/struct.IntoIter.html b/doc/bitflags/__core/collections/btree_map/struct.IntoIter.html deleted file mode 100644 index 57ca4fca..00000000 --- a/doc/bitflags/__core/collections/btree_map/struct.IntoIter.html +++ /dev/null @@ -1,172 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_map::IntoIter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_map::IntoIter - - [−] - - [src]

-
pub struct IntoIter<K, V> {
-    // some fields omitted
-}
1.0.0

An owning iterator over a BTreeMap's entries.

-

Trait Implementations

impl<K, V> Drop for IntoIter<K, V>

fn drop(&mut self)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> Iterator for IntoIter<K, V>

type Item = (K, V)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn next(&mut self) -> Option<(K, V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn size_hint(&self) -> (usize, Option<usize>)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<K, V> DoubleEndedIterator for IntoIter<K, V>

fn next_back(&mut self) -> Option<(K, V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> ExactSizeIterator for IntoIter<K, V>

fn len(&self) -> usize

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_map/struct.Iter.html b/doc/bitflags/__core/collections/btree_map/struct.Iter.html deleted file mode 100644 index 97e55da0..00000000 --- a/doc/bitflags/__core/collections/btree_map/struct.Iter.html +++ /dev/null @@ -1,173 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_map::Iter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_map::Iter - - [−] - - [src]

-
pub struct Iter<'a, K, V> where V: 'a, K: 'a {
-    // some fields omitted
-}
1.0.0

An iterator over a BTreeMap's entries.

-

Trait Implementations

impl<'a, K, V> Iterator for Iter<'a, K, V> where K: 'a, V: 'a

type Item = (&'a K, &'a V)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn next(&mut self) -> Option<(&'a K, &'a V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn size_hint(&self) -> (usize, Option<usize>)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, K, V> DoubleEndedIterator for Iter<'a, K, V> where V: 'a, K: 'a

fn next_back(&mut self) -> Option<(&'a K, &'a V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<'a, K, V> ExactSizeIterator for Iter<'a, K, V> where V: 'a, K: 'a

fn len(&self) -> usize

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<'a, K, V> Clone for Iter<'a, K, V>

fn clone(&self) -> Iter<'a, K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_map/struct.IterMut.html b/doc/bitflags/__core/collections/btree_map/struct.IterMut.html deleted file mode 100644 index 855aa00a..00000000 --- a/doc/bitflags/__core/collections/btree_map/struct.IterMut.html +++ /dev/null @@ -1,170 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_map::IterMut - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_map::IterMut - - [−] - - [src]

-
pub struct IterMut<'a, K, V> where K: 'a, V: 'a {
-    // some fields omitted
-}
1.0.0

A mutable iterator over a BTreeMap's entries.

-

Trait Implementations

impl<'a, K, V> Iterator for IterMut<'a, K, V> where K: 'a, V: 'a

type Item = (&'a K, &'a mut V)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn next(&mut self) -> Option<(&'a K, &'a mut V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn size_hint(&self) -> (usize, Option<usize>)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, K, V> DoubleEndedIterator for IterMut<'a, K, V> where V: 'a, K: 'a

fn next_back(&mut self) -> Option<(&'a K, &'a mut V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<'a, K, V> ExactSizeIterator for IterMut<'a, K, V> where K: 'a, V: 'a

fn len(&self) -> usize

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_map/struct.Keys.html b/doc/bitflags/__core/collections/btree_map/struct.Keys.html deleted file mode 100644 index 546e0f09..00000000 --- a/doc/bitflags/__core/collections/btree_map/struct.Keys.html +++ /dev/null @@ -1,173 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_map::Keys - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_map::Keys - - [−] - - [src]

-
pub struct Keys<'a, K, V> where K: 'a, V: 'a {
-    // some fields omitted
-}
1.0.0

An iterator over a BTreeMap's keys.

-

Trait Implementations

impl<'a, K, V> Iterator for Keys<'a, K, V>

type Item = &'a K

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn next(&mut self) -> Option<&'a K>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn size_hint(&self) -> (usize, Option<usize>)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, K, V> DoubleEndedIterator for Keys<'a, K, V>

fn next_back(&mut self) -> Option<&'a K>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<'a, K, V> ExactSizeIterator for Keys<'a, K, V>

fn len(&self) -> usize

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<'a, K, V> Clone for Keys<'a, K, V>

fn clone(&self) -> Keys<'a, K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_map/struct.OccupiedEntry.html b/doc/bitflags/__core/collections/btree_map/struct.OccupiedEntry.html deleted file mode 100644 index 22156cdf..00000000 --- a/doc/bitflags/__core/collections/btree_map/struct.OccupiedEntry.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_map::OccupiedEntry - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_map::OccupiedEntry - - [−] - - [src]

-
pub struct OccupiedEntry<'a, K, V> where K: 'a, V: 'a {
-    // some fields omitted
-}
1.0.0

An occupied Entry.

-

Methods

impl<'a, K, V> OccupiedEntry<'a, K, V> where K: Ord

fn key(&self) -> &K

-
Unstable (map_entry_keys)

Gets a reference to the key in the entry.

-

fn get(&self) -> &V

-

Gets a reference to the value in the entry.

-

fn get_mut(&mut self) -> &mut V

-

Gets a mutable reference to the value in the entry.

-

fn into_mut(self) -> &'a mut V

-

Converts the entry into a mutable reference to its value.

-

fn insert(&mut self, value: V) -> V

-

Sets the value of the entry with the OccupiedEntry's key, -and returns the entry's old value.

-

fn remove(self) -> V

-

Takes the value of the entry out of the map, and returns it.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_map/struct.Range.html b/doc/bitflags/__core/collections/btree_map/struct.Range.html deleted file mode 100644 index ec891809..00000000 --- a/doc/bitflags/__core/collections/btree_map/struct.Range.html +++ /dev/null @@ -1,171 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_map::Range - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_map::Range - - [−] - - [src]

-
pub struct Range<'a, K, V> where V: 'a, K: 'a {
-    // some fields omitted
-}
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

An iterator over a sub-range of BTreeMap's entries.

-

Trait Implementations

impl<'a, K, V> Iterator for Range<'a, K, V>

type Item = (&'a K, &'a V)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn next(&mut self) -> Option<(&'a K, &'a V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, K, V> DoubleEndedIterator for Range<'a, K, V>

fn next_back(&mut self) -> Option<(&'a K, &'a V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<'a, K, V> Clone for Range<'a, K, V>

fn clone(&self) -> Range<'a, K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_map/struct.RangeMut.html b/doc/bitflags/__core/collections/btree_map/struct.RangeMut.html deleted file mode 100644 index f0c627d4..00000000 --- a/doc/bitflags/__core/collections/btree_map/struct.RangeMut.html +++ /dev/null @@ -1,168 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_map::RangeMut - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_map::RangeMut - - [−] - - [src]

-
pub struct RangeMut<'a, K, V> where V: 'a, K: 'a {
-    // some fields omitted
-}
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

A mutable iterator over a sub-range of BTreeMap's entries.

-

Trait Implementations

impl<'a, K, V> Iterator for RangeMut<'a, K, V>

type Item = (&'a K, &'a mut V)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn next(&mut self) -> Option<(&'a K, &'a mut V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, K, V> DoubleEndedIterator for RangeMut<'a, K, V>

fn next_back(&mut self) -> Option<(&'a K, &'a mut V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_map/struct.VacantEntry.html b/doc/bitflags/__core/collections/btree_map/struct.VacantEntry.html deleted file mode 100644 index 6ac4d36c..00000000 --- a/doc/bitflags/__core/collections/btree_map/struct.VacantEntry.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_map::VacantEntry - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_map::VacantEntry - - [−] - - [src]

-
pub struct VacantEntry<'a, K, V> where K: 'a, V: 'a {
-    // some fields omitted
-}
1.0.0

A vacant Entry.

-

Methods

impl<'a, K, V> VacantEntry<'a, K, V> where K: Ord

fn key(&self) -> &K

-
Unstable (map_entry_keys)

Gets a reference to the key that would be used when inserting a value -through the VacantEntry.

-

fn insert(self, value: V) -> &'a mut V

-

Sets the value of the entry with the VacantEntry's key, -and returns a mutable reference to it.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_map/struct.Values.html b/doc/bitflags/__core/collections/btree_map/struct.Values.html deleted file mode 100644 index 0826a5fa..00000000 --- a/doc/bitflags/__core/collections/btree_map/struct.Values.html +++ /dev/null @@ -1,173 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_map::Values - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_map::Values - - [−] - - [src]

-
pub struct Values<'a, K, V> where V: 'a, K: 'a {
-    // some fields omitted
-}
1.0.0

An iterator over a BTreeMap's values.

-

Trait Implementations

impl<'a, K, V> Iterator for Values<'a, K, V>

type Item = &'a V

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn next(&mut self) -> Option<&'a V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn size_hint(&self) -> (usize, Option<usize>)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, K, V> DoubleEndedIterator for Values<'a, K, V>

fn next_back(&mut self) -> Option<&'a V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<'a, K, V> ExactSizeIterator for Values<'a, K, V>

fn len(&self) -> usize

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<'a, K, V> Clone for Values<'a, K, V>

fn clone(&self) -> Values<'a, K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_map/struct.ValuesMut.html b/doc/bitflags/__core/collections/btree_map/struct.ValuesMut.html deleted file mode 100644 index daaa7211..00000000 --- a/doc/bitflags/__core/collections/btree_map/struct.ValuesMut.html +++ /dev/null @@ -1,171 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_map::ValuesMut - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_map::ValuesMut - - [−] - - [src]

-
pub struct ValuesMut<'a, K, V> where K: 'a, V: 'a {
-    // some fields omitted
-}
Unstable (map_values_mut)

: recently added

-

A mutable iterator over a BTreeMap's values.

-

Trait Implementations

impl<'a, K, V> Iterator for ValuesMut<'a, K, V>

type Item = &'a mut V

-
Unstable (map_values_mut)

: recently added

-

fn next(&mut self) -> Option<&'a mut V>

-
Unstable (map_values_mut)

: recently added

-

fn size_hint(&self) -> (usize, Option<usize>)

-
Unstable (map_values_mut)

: recently added

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, K, V> DoubleEndedIterator for ValuesMut<'a, K, V>

fn next_back(&mut self) -> Option<&'a mut V>

-
Unstable (map_values_mut)

: recently added

-

impl<'a, K, V> ExactSizeIterator for ValuesMut<'a, K, V>

fn len(&self) -> usize

-
Unstable (map_values_mut)

: recently added

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_set/index.html b/doc/bitflags/__core/collections/btree_set/index.html deleted file mode 100644 index cb3a2396..00000000 --- a/doc/bitflags/__core/collections/btree_set/index.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_set - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::collections::btree_set - - [−] - - [src]

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
BTreeSet -

A set based on a B-Tree.

-
Difference -

A lazy iterator producing elements in the set difference (in-order).

-
Intersection -

A lazy iterator producing elements in the set intersection (in-order).

-
IntoIter -

An owning iterator over a BTreeSet's items.

-
Iter -

An iterator over a BTreeSet's items.

-
SymmetricDifference -

A lazy iterator producing elements in the set symmetric difference (in-order).

-
Union -

A lazy iterator producing elements in the set union (in-order).

-
Range - [Unstable]

An iterator over a sub-range of BTreeSet's items.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_set/sidebar-items.js b/doc/bitflags/__core/collections/btree_set/sidebar-items.js deleted file mode 100644 index c6033fd3..00000000 --- a/doc/bitflags/__core/collections/btree_set/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["BTreeSet","A set based on a B-Tree."],["Difference","A lazy iterator producing elements in the set difference (in-order)."],["Intersection","A lazy iterator producing elements in the set intersection (in-order)."],["IntoIter","An owning iterator over a BTreeSet's items."],["Iter","An iterator over a BTreeSet's items."],["Range","An iterator over a sub-range of BTreeSet's items."],["SymmetricDifference","A lazy iterator producing elements in the set symmetric difference (in-order)."],["Union","A lazy iterator producing elements in the set union (in-order)."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_set/struct.BTreeSet.html b/doc/bitflags/__core/collections/btree_set/struct.BTreeSet.html deleted file mode 100644 index e627646d..00000000 --- a/doc/bitflags/__core/collections/btree_set/struct.BTreeSet.html +++ /dev/null @@ -1,524 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_set::BTreeSet - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_set::BTreeSet - - [−] - - [src]

-
pub struct BTreeSet<T> {
-    // some fields omitted
-}
1.0.0

A set based on a B-Tree.

- -

See BTreeMap's documentation for a detailed discussion of this collection's performance -benefits and drawbacks.

- -

It is a logic error for an item to be modified in such a way that the item's ordering relative -to any other item, as determined by the Ord trait, changes while it is in the set. This is -normally only possible through Cell, RefCell, global state, I/O, or unsafe code.

- -

Examples

-
-use std::collections::BTreeSet;
-
-// Type inference lets us omit an explicit type signature (which
-// would be `BTreeSet<&str>` in this example).
-let mut books = BTreeSet::new();
-
-// Add some books.
-books.insert("A Dance With Dragons");
-books.insert("To Kill a Mockingbird");
-books.insert("The Odyssey");
-books.insert("The Great Gatsby");
-
-// Check for a specific one.
-if !books.contains("The Winds of Winter") {
-    println!("We have {} books, but The Winds of Winter ain't one.",
-             books.len());
-}
-
-// Remove a book.
-books.remove("The Odyssey");
-
-// Iterate over everything.
-for book in &books {
-    println!("{}", book);
-}
-

Methods

impl<T> BTreeSet<T> where T: Ord

fn new() -> BTreeSet<T>

-

Makes a new BTreeSet with a reasonable choice of B.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut set: BTreeSet<i32> = BTreeSet::new();
-

impl<T> BTreeSet<T>

fn iter(&self) -> Iter<T>

-

Gets an iterator over the BTreeSet's contents.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let set: BTreeSet<usize> = [1, 2, 3, 4].iter().cloned().collect();
-
-for x in set.iter() {
-    println!("{}", x);
-}
-
-let v: Vec<_> = set.iter().cloned().collect();
-assert_eq!(v, [1, 2, 3, 4]);
-

impl<T> BTreeSet<T> where T: Ord

fn range<Min, Max>(&'a self, min: Bound<&Min>, max: Bound<&Max>) -> Range<'a, T> where Min: Ord + ?Sized, Max: Ord + ?Sized, T: Borrow<Min> + Borrow<Max>

-
Unstable (btree_range)

: matches collection reform specification, waiting for dust to settle

-

Constructs a double-ended iterator over a sub-range of elements in the set, starting -at min, and ending at max. If min is Unbounded, then it will be treated as "negative -infinity", and if max is Unbounded, then it will be treated as "positive infinity". -Thus range(Unbounded, Unbounded) will yield the whole collection.

- -

Examples

-
-#![feature(btree_range, collections_bound)]
-
-use std::collections::BTreeSet;
-use std::collections::Bound::{Included, Unbounded};
-
-let mut set = BTreeSet::new();
-set.insert(3);
-set.insert(5);
-set.insert(8);
-for &elem in set.range(Included(&4), Included(&8)) {
-    println!("{}", elem);
-}
-assert_eq!(Some(&5), set.range(Included(&4), Unbounded).next());
-

impl<T> BTreeSet<T> where T: Ord

fn difference(&'a self, other: &'a BTreeSet<T>) -> Difference<'a, T>

-

Visits the values representing the difference, in ascending order.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut a = BTreeSet::new();
-a.insert(1);
-a.insert(2);
-
-let mut b = BTreeSet::new();
-b.insert(2);
-b.insert(3);
-
-let diff: Vec<_> = a.difference(&b).cloned().collect();
-assert_eq!(diff, [1]);
-

fn symmetric_difference(&'a self, other: &'a BTreeSet<T>) -> SymmetricDifference<'a, T>

-

Visits the values representing the symmetric difference, in ascending order.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut a = BTreeSet::new();
-a.insert(1);
-a.insert(2);
-
-let mut b = BTreeSet::new();
-b.insert(2);
-b.insert(3);
-
-let sym_diff: Vec<_> = a.symmetric_difference(&b).cloned().collect();
-assert_eq!(sym_diff, [1, 3]);
-

fn intersection(&'a self, other: &'a BTreeSet<T>) -> Intersection<'a, T>

-

Visits the values representing the intersection, in ascending order.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut a = BTreeSet::new();
-a.insert(1);
-a.insert(2);
-
-let mut b = BTreeSet::new();
-b.insert(2);
-b.insert(3);
-
-let intersection: Vec<_> = a.intersection(&b).cloned().collect();
-assert_eq!(intersection, [2]);
-

fn union(&'a self, other: &'a BTreeSet<T>) -> Union<'a, T>

-

Visits the values representing the union, in ascending order.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut a = BTreeSet::new();
-a.insert(1);
-
-let mut b = BTreeSet::new();
-b.insert(2);
-
-let union: Vec<_> = a.union(&b).cloned().collect();
-assert_eq!(union, [1, 2]);
-

fn len(&self) -> usize

-

Returns the number of elements in the set.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut v = BTreeSet::new();
-assert_eq!(v.len(), 0);
-v.insert(1);
-assert_eq!(v.len(), 1);
-

fn is_empty(&self) -> bool

-

Returns true if the set contains no elements.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut v = BTreeSet::new();
-assert!(v.is_empty());
-v.insert(1);
-assert!(!v.is_empty());
-

fn clear(&mut self)

-

Clears the set, removing all values.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut v = BTreeSet::new();
-v.insert(1);
-v.clear();
-assert!(v.is_empty());
-

fn contains<Q>(&self, value: &Q) -> bool where T: Borrow<Q>, Q: Ord + ?Sized

-

Returns true if the set contains a value.

- -

The value may be any borrowed form of the set's value type, -but the ordering on the borrowed form must match the -ordering on the value type.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let set: BTreeSet<_> = [1, 2, 3].iter().cloned().collect();
-assert_eq!(set.contains(&1), true);
-assert_eq!(set.contains(&4), false);
-

fn get<Q>(&self, value: &Q) -> Option<&T> where T: Borrow<Q>, Q: Ord + ?Sized1.9.0

-

Returns a reference to the value in the set, if any, that is equal to the given value.

- -

The value may be any borrowed form of the set's value type, -but the ordering on the borrowed form must match the -ordering on the value type.

-

fn is_disjoint(&self, other: &BTreeSet<T>) -> bool

-

Returns true if the set has no elements in common with other. -This is equivalent to checking for an empty intersection.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let a: BTreeSet<_> = [1, 2, 3].iter().cloned().collect();
-let mut b = BTreeSet::new();
-
-assert_eq!(a.is_disjoint(&b), true);
-b.insert(4);
-assert_eq!(a.is_disjoint(&b), true);
-b.insert(1);
-assert_eq!(a.is_disjoint(&b), false);
-

fn is_subset(&self, other: &BTreeSet<T>) -> bool

-

Returns true if the set is a subset of another.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let sup: BTreeSet<_> = [1, 2, 3].iter().cloned().collect();
-let mut set = BTreeSet::new();
-
-assert_eq!(set.is_subset(&sup), true);
-set.insert(2);
-assert_eq!(set.is_subset(&sup), true);
-set.insert(4);
-assert_eq!(set.is_subset(&sup), false);
-

fn is_superset(&self, other: &BTreeSet<T>) -> bool

-

Returns true if the set is a superset of another.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let sub: BTreeSet<_> = [1, 2].iter().cloned().collect();
-let mut set = BTreeSet::new();
-
-assert_eq!(set.is_superset(&sub), false);
-
-set.insert(0);
-set.insert(1);
-assert_eq!(set.is_superset(&sub), false);
-
-set.insert(2);
-assert_eq!(set.is_superset(&sub), true);
-

fn insert(&mut self, value: T) -> bool

-

Adds a value to the set.

- -

If the set did not have a value present, true is returned.

- -

If the set did have this key present, false is returned, and the -entry is not updated. See the module-level documentation for more.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut set = BTreeSet::new();
-
-assert_eq!(set.insert(2), true);
-assert_eq!(set.insert(2), false);
-assert_eq!(set.len(), 1);
-

fn replace(&mut self, value: T) -> Option<T>1.9.0

-

Adds a value to the set, replacing the existing value, if any, that is equal to the given -one. Returns the replaced value.

-

fn remove<Q>(&mut self, value: &Q) -> bool where T: Borrow<Q>, Q: Ord + ?Sized

-

Removes a value from the set. Returns true if the value was -present in the set.

- -

The value may be any borrowed form of the set's value type, -but the ordering on the borrowed form must match the -ordering on the value type.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut set = BTreeSet::new();
-
-set.insert(2);
-assert_eq!(set.remove(&2), true);
-assert_eq!(set.remove(&2), false);
-

fn take<Q>(&mut self, value: &Q) -> Option<T> where T: Borrow<Q>, Q: Ord + ?Sized1.9.0

-

Removes and returns the value in the set, if any, that is equal to the given one.

- -

The value may be any borrowed form of the set's value type, -but the ordering on the borrowed form must match the -ordering on the value type.

-

fn append(&mut self, other: &mut BTreeSet<T>)

-
Unstable (btree_append)

: recently added as part of collections reform 2

-

Moves all elements from other into Self, leaving other empty.

- -

Examples

-
-#![feature(btree_append)]
-use std::collections::BTreeSet;
-
-let mut a = BTreeSet::new();
-a.insert(1);
-a.insert(2);
-a.insert(3);
-
-let mut b = BTreeSet::new();
-b.insert(3);
-b.insert(4);
-b.insert(5);
-
-a.append(&mut b);
-
-assert_eq!(a.len(), 5);
-assert_eq!(b.len(), 0);
-
-assert!(a.contains(&1));
-assert!(a.contains(&2));
-assert!(a.contains(&3));
-assert!(a.contains(&4));
-assert!(a.contains(&5));
-

Trait Implementations

impl<T> FromIterator<T> for BTreeSet<T> where T: Ord

fn from_iter<I>(iter: I) -> BTreeSet<T> where I: IntoIterator<Item=T>

-

impl<T> IntoIterator for BTreeSet<T>

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Gets an iterator for moving out the BtreeSet's contents.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let set: BTreeSet<usize> = [1, 2, 3, 4].iter().cloned().collect();
-
-let v: Vec<_> = set.into_iter().collect();
-assert_eq!(v, [1, 2, 3, 4]);
-

impl<'a, T> IntoIterator for &'a BTreeSet<T>

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<T> Extend<T> for BTreeSet<T> where T: Ord

fn extend<Iter>(&mut self, iter: Iter) where Iter: IntoIterator<Item=T>

-

impl<'a, T> Extend<&'a T> for BTreeSet<T> where T: Copy + 'a + Ord1.2.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a T>

-

impl<T> Default for BTreeSet<T> where T: Ord

fn default() -> BTreeSet<T>

-

impl<'a, 'b, T> Sub<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone

type Output = BTreeSet<T>

-

fn sub(self, rhs: &BTreeSet<T>) -> BTreeSet<T>

-

Returns the difference of self and rhs as a new BTreeSet<T>.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let a: BTreeSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: BTreeSet<_> = vec![3, 4, 5].into_iter().collect();
-
-let result = &a - &b;
-let result_vec: Vec<_> = result.into_iter().collect();
-assert_eq!(result_vec, [1, 2]);
-

impl<'a, 'b, T> BitXor<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone

type Output = BTreeSet<T>

-

fn bitxor(self, rhs: &BTreeSet<T>) -> BTreeSet<T>

-

Returns the symmetric difference of self and rhs as a new BTreeSet<T>.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let a: BTreeSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: BTreeSet<_> = vec![2, 3, 4].into_iter().collect();
-
-let result = &a ^ &b;
-let result_vec: Vec<_> = result.into_iter().collect();
-assert_eq!(result_vec, [1, 4]);
-

impl<'a, 'b, T> BitAnd<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone

type Output = BTreeSet<T>

-

fn bitand(self, rhs: &BTreeSet<T>) -> BTreeSet<T>

-

Returns the intersection of self and rhs as a new BTreeSet<T>.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let a: BTreeSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: BTreeSet<_> = vec![2, 3, 4].into_iter().collect();
-
-let result = &a & &b;
-let result_vec: Vec<_> = result.into_iter().collect();
-assert_eq!(result_vec, [2, 3]);
-

impl<'a, 'b, T> BitOr<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone

type Output = BTreeSet<T>

-

fn bitor(self, rhs: &BTreeSet<T>) -> BTreeSet<T>

-

Returns the union of self and rhs as a new BTreeSet<T>.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let a: BTreeSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: BTreeSet<_> = vec![3, 4, 5].into_iter().collect();
-
-let result = &a | &b;
-let result_vec: Vec<_> = result.into_iter().collect();
-assert_eq!(result_vec, [1, 2, 3, 4, 5]);
-

impl<T> Debug for BTreeSet<T> where T: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl<T> PartialOrd<BTreeSet<T>> for BTreeSet<T> where T: PartialOrd<T>

fn partial_cmp(&self, __arg_0: &BTreeSet<T>) -> Option<Ordering>

-

fn lt(&self, __arg_0: &BTreeSet<T>) -> bool

-

fn le(&self, __arg_0: &BTreeSet<T>) -> bool

-

fn gt(&self, __arg_0: &BTreeSet<T>) -> bool

-

fn ge(&self, __arg_0: &BTreeSet<T>) -> bool

-

impl<T> Ord for BTreeSet<T> where T: Ord

fn cmp(&self, __arg_0: &BTreeSet<T>) -> Ordering

-

impl<T> Eq for BTreeSet<T> where T: Eq

impl<T> PartialEq<BTreeSet<T>> for BTreeSet<T> where T: PartialEq<T>

fn eq(&self, __arg_0: &BTreeSet<T>) -> bool

-

fn ne(&self, __arg_0: &BTreeSet<T>) -> bool

-

impl<T> Hash for BTreeSet<T> where T: Hash

fn hash<__HT>(&self, __arg_0: &mut __HT) where __HT: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<T> Clone for BTreeSet<T> where T: Clone

fn clone(&self) -> BTreeSet<T>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_set/struct.Difference.html b/doc/bitflags/__core/collections/btree_set/struct.Difference.html deleted file mode 100644 index 6b62f1d9..00000000 --- a/doc/bitflags/__core/collections/btree_set/struct.Difference.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_set::Difference - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_set::Difference - - [−] - - [src]

-
pub struct Difference<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

A lazy iterator producing elements in the set difference (in-order).

-

Trait Implementations

impl<'a, T> Clone for Difference<'a, T>

fn clone(&self) -> Difference<'a, T>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, T> Iterator for Difference<'a, T> where T: Ord

type Item = &'a T

-

fn next(&mut self) -> Option<&'a T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_set/struct.Intersection.html b/doc/bitflags/__core/collections/btree_set/struct.Intersection.html deleted file mode 100644 index ce82341b..00000000 --- a/doc/bitflags/__core/collections/btree_set/struct.Intersection.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_set::Intersection - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_set::Intersection - - [−] - - [src]

-
pub struct Intersection<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

A lazy iterator producing elements in the set intersection (in-order).

-

Trait Implementations

impl<'a, T> Clone for Intersection<'a, T>

fn clone(&self) -> Intersection<'a, T>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, T> Iterator for Intersection<'a, T> where T: Ord

type Item = &'a T

-

fn next(&mut self) -> Option<&'a T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_set/struct.IntoIter.html b/doc/bitflags/__core/collections/btree_set/struct.IntoIter.html deleted file mode 100644 index fa765564..00000000 --- a/doc/bitflags/__core/collections/btree_set/struct.IntoIter.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_set::IntoIter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_set::IntoIter - - [−] - - [src]

-
pub struct IntoIter<T> {
-    // some fields omitted
-}
1.0.0

An owning iterator over a BTreeSet's items.

-

Trait Implementations

impl<T> Iterator for IntoIter<T>

type Item = T

-

fn next(&mut self) -> Option<T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<T> DoubleEndedIterator for IntoIter<T>

fn next_back(&mut self) -> Option<T>

-

impl<T> ExactSizeIterator for IntoIter<T>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_set/struct.Iter.html b/doc/bitflags/__core/collections/btree_set/struct.Iter.html deleted file mode 100644 index 4dabf1a4..00000000 --- a/doc/bitflags/__core/collections/btree_set/struct.Iter.html +++ /dev/null @@ -1,168 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_set::Iter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_set::Iter - - [−] - - [src]

-
pub struct Iter<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

An iterator over a BTreeSet's items.

-

Trait Implementations

impl<'a, T> Clone for Iter<'a, T>

fn clone(&self) -> Iter<'a, T>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, T> Iterator for Iter<'a, T>

type Item = &'a T

-

fn next(&mut self) -> Option<&'a T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T> DoubleEndedIterator for Iter<'a, T>

fn next_back(&mut self) -> Option<&'a T>

-

impl<'a, T> ExactSizeIterator for Iter<'a, T>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_set/struct.Range.html b/doc/bitflags/__core/collections/btree_set/struct.Range.html deleted file mode 100644 index df2c9e52..00000000 --- a/doc/bitflags/__core/collections/btree_set/struct.Range.html +++ /dev/null @@ -1,171 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_set::Range - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_set::Range - - [−] - - [src]

-
pub struct Range<'a, T> where T: 'a {
-    // some fields omitted
-}
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

An iterator over a sub-range of BTreeSet's items.

-

Trait Implementations

impl<'a, T> Clone for Range<'a, T>

fn clone(&self) -> Range<'a, T>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<'a, T> Iterator for Range<'a, T>

type Item = &'a T

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn next(&mut self) -> Option<&'a T>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T> DoubleEndedIterator for Range<'a, T>

fn next_back(&mut self) -> Option<&'a T>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_set/struct.SymmetricDifference.html b/doc/bitflags/__core/collections/btree_set/struct.SymmetricDifference.html deleted file mode 100644 index d4ed8c83..00000000 --- a/doc/bitflags/__core/collections/btree_set/struct.SymmetricDifference.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_set::SymmetricDifference - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_set::SymmetricDifference - - [−] - - [src]

-
pub struct SymmetricDifference<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

A lazy iterator producing elements in the set symmetric difference (in-order).

-

Trait Implementations

impl<'a, T> Clone for SymmetricDifference<'a, T>

fn clone(&self) -> SymmetricDifference<'a, T>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, T> Iterator for SymmetricDifference<'a, T> where T: Ord

type Item = &'a T

-

fn next(&mut self) -> Option<&'a T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/btree_set/struct.Union.html b/doc/bitflags/__core/collections/btree_set/struct.Union.html deleted file mode 100644 index e5046dbd..00000000 --- a/doc/bitflags/__core/collections/btree_set/struct.Union.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::btree_set::Union - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::btree_set::Union - - [−] - - [src]

-
pub struct Union<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

A lazy iterator producing elements in the set union (in-order).

-

Trait Implementations

impl<'a, T> Clone for Union<'a, T>

fn clone(&self) -> Union<'a, T>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, T> Iterator for Union<'a, T> where T: Ord

type Item = &'a T

-

fn next(&mut self) -> Option<&'a T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/enum.Bound.html b/doc/bitflags/__core/collections/enum.Bound.html deleted file mode 100644 index 0108b02b..00000000 --- a/doc/bitflags/__core/collections/enum.Bound.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::Bound - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::collections::Bound - - [−] - - [src]

-
pub enum Bound<T> {
-    Included(T),
-    Excluded(T),
-    Unbounded,
-}
Unstable (collections_bound)

An endpoint of a range of keys.

-

Variants

-
Included
Unstable (collections_bound)

An inclusive bound.

-
Excluded
Unstable (collections_bound)

An exclusive bound.

-
Unbounded
Unstable (collections_bound)

An infinite endpoint. Indicates that there is no bound in this direction.

-

Trait Implementations

Derived Implementations

impl<T> Eq for Bound<T> where T: Eq

impl<T> PartialEq<Bound<T>> for Bound<T> where T: PartialEq<T>

fn eq(&self, __arg_0: &Bound<T>) -> bool

-
Unstable (collections_bound)

fn ne(&self, __arg_0: &Bound<T>) -> bool

-
Unstable (collections_bound)

impl<T> Hash for Bound<T> where T: Hash

fn hash<__HT>(&self, __arg_0: &mut __HT) where __HT: Hasher

-
Unstable (collections_bound)

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<T> Debug for Bound<T> where T: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
Unstable (collections_bound)

impl<T> Copy for Bound<T> where T: Copy

impl<T> Clone for Bound<T> where T: Clone

fn clone(&self) -> Bound<T>

-
Unstable (collections_bound)

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_map/enum.Entry.html b/doc/bitflags/__core/collections/hash_map/enum.Entry.html deleted file mode 100644 index ace2695a..00000000 --- a/doc/bitflags/__core/collections/hash_map/enum.Entry.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_map::Entry - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::collections::hash_map::Entry - - [−] - - [src]

-
pub enum Entry<'a, K, V> where K: 'a, V: 'a {
-    Occupied(OccupiedEntry<'a, K, V>),
-    Vacant(VacantEntry<'a, K, V>),
-}
1.0.0

A view into a single location in a map, which may be vacant or occupied.

-

Variants

-
Occupied

An occupied Entry.

-
Vacant

A vacant Entry.

-

Methods

impl<'a, K, V> Entry<'a, K, V>

fn or_insert(self, default: V) -> &'a mut V

-

Ensures a value is in the entry by inserting the default if empty, and returns -a mutable reference to the value in the entry.

-

fn or_insert_with<F>(self, default: F) -> &'a mut V where F: FnOnce() -> V

-

Ensures a value is in the entry by inserting the result of the default function if empty, -and returns a mutable reference to the value in the entry.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_map/index.html b/doc/bitflags/__core/collections/hash_map/index.html deleted file mode 100644 index f5707775..00000000 --- a/doc/bitflags/__core/collections/hash_map/index.html +++ /dev/null @@ -1,200 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_map - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::collections::hash_map - - [−] - - [src]

-

A hashmap

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Drain -

HashMap drain iterator.

-
HashMap -

A hash map implementation which uses linear probing with Robin -Hood bucket stealing.

-
IntoIter -

HashMap move iterator.

-
Iter -

HashMap iterator.

-
IterMut -

HashMap mutable values iterator.

-
Keys -

HashMap keys iterator.

-
OccupiedEntry -

A view into a single occupied location in a HashMap.

-
RandomState -

RandomState is the default state for HashMap types.

-
VacantEntry -

A view into a single empty location in a HashMap.

-
Values -

HashMap values iterator.

-
ValuesMut - [Unstable]

Mutable HashMap values iterator.

-

Enums

- - - - -
Entry -

A view into a single location in a map, which may be vacant or occupied.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_map/sidebar-items.js b/doc/bitflags/__core/collections/hash_map/sidebar-items.js deleted file mode 100644 index 6b26206d..00000000 --- a/doc/bitflags/__core/collections/hash_map/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["Entry","A view into a single location in a map, which may be vacant or occupied."]],"struct":[["Drain","HashMap drain iterator."],["HashMap","A hash map implementation which uses linear probing with Robin Hood bucket stealing."],["IntoIter","HashMap move iterator."],["Iter","HashMap iterator."],["IterMut","HashMap mutable values iterator."],["Keys","HashMap keys iterator."],["OccupiedEntry","A view into a single occupied location in a HashMap."],["RandomState","`RandomState` is the default state for `HashMap` types."],["VacantEntry","A view into a single empty location in a HashMap."],["Values","HashMap values iterator."],["ValuesMut","Mutable HashMap values iterator."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_map/struct.Drain.html b/doc/bitflags/__core/collections/hash_map/struct.Drain.html deleted file mode 100644 index 46fccfb3..00000000 --- a/doc/bitflags/__core/collections/hash_map/struct.Drain.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_map::Drain - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_map::Drain - - [−] - - [src]

-
pub struct Drain<'a, K, V> where V: 'a, K: 'a {
-    // some fields omitted
-}
1.6.0

HashMap drain iterator.

-

Trait Implementations

impl<'a, K, V> Iterator for Drain<'a, K, V>1.0.0

type Item = (K, V)

-

fn next(&mut self) -> Option<(K, V)>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, K, V> ExactSizeIterator for Drain<'a, K, V>1.0.0

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_map/struct.HashMap.html b/doc/bitflags/__core/collections/hash_map/struct.HashMap.html deleted file mode 100644 index 49b091f3..00000000 --- a/doc/bitflags/__core/collections/hash_map/struct.HashMap.html +++ /dev/null @@ -1,615 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_map::HashMap - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_map::HashMap - - [−] - - [src]

-
pub struct HashMap<K, V, S = RandomState> {
-    // some fields omitted
-}
1.0.0

A hash map implementation which uses linear probing with Robin -Hood bucket stealing.

- -

The hashes are all keyed by the thread-local random number generator -on creation by default. This means that the ordering of the keys is -randomized, but makes the tables more resistant to -denial-of-service attacks (Hash DoS). This behavior can be -overridden with one of the constructors.

- -

It is required that the keys implement the Eq and Hash traits, although -this can frequently be achieved by using #[derive(PartialEq, Eq, Hash)]. -If you implement these yourself, it is important that the following -property holds:

- -
k1 == k2 -> hash(k1) == hash(k2)
-
- -

In other words, if two keys are equal, their hashes must be equal.

- -

It is a logic error for a key to be modified in such a way that the key's -hash, as determined by the Hash trait, or its equality, as determined by -the Eq trait, changes while it is in the map. This is normally only -possible through Cell, RefCell, global state, I/O, or unsafe code.

- -

Relevant papers/articles:

- -
    -
  1. Pedro Celis. "Robin Hood Hashing"
    2. -
  2. Emmanuel Goossaert. "Robin Hood -hashing"
    3. -
  3. Emmanuel Goossaert. "Robin Hood hashing: backward shift -deletion"
    4. -
- -

Examples

-
-use std::collections::HashMap;
-
-// type inference lets us omit an explicit type signature (which
-// would be `HashMap<&str, &str>` in this example).
-let mut book_reviews = HashMap::new();
-
-// review some books.
-book_reviews.insert("Adventures of Huckleberry Finn",    "My favorite book.");
-book_reviews.insert("Grimms' Fairy Tales",               "Masterpiece.");
-book_reviews.insert("Pride and Prejudice",               "Very enjoyable.");
-book_reviews.insert("The Adventures of Sherlock Holmes", "Eye lyked it alot.");
-
-// check for a specific one.
-if !book_reviews.contains_key("Les Misérables") {
-    println!("We've got {} reviews, but Les Misérables ain't one.",
-             book_reviews.len());
-}
-
-// oops, this review has a lot of spelling mistakes, let's delete it.
-book_reviews.remove("The Adventures of Sherlock Holmes");
-
-// look up the values associated with some keys.
-let to_find = ["Pride and Prejudice", "Alice's Adventure in Wonderland"];
-for book in &to_find {
-    match book_reviews.get(book) {
-        Some(review) => println!("{}: {}", book, review),
-        None => println!("{} is unreviewed.", book)
-    }
-}
-
-// iterate over everything.
-for (book, review) in &book_reviews {
-    println!("{}: \"{}\"", book, review);
-}
- -

HashMap also implements an Entry API, which allows -for more complex methods of getting, setting, updating and removing keys and -their values:

- -
-use std::collections::HashMap;
-
-// type inference lets us omit an explicit type signature (which
-// would be `HashMap<&str, u8>` in this example).
-let mut player_stats = HashMap::new();
-
-fn random_stat_buff() -> u8 {
-    // could actually return some random value here - let's just return
-    // some fixed value for now
-    42
-}
-
-// insert a key only if it doesn't already exist
-player_stats.entry("health").or_insert(100);
-
-// insert a key using a function that provides a new value only if it
-// doesn't already exist
-player_stats.entry("defence").or_insert_with(random_stat_buff);
-
-// update a key, guarding against the key possibly not being set
-let stat = player_stats.entry("attack").or_insert(100);
-*stat += random_stat_buff();
- -

The easiest way to use HashMap with a custom type as key is to derive Eq and Hash. -We must also derive PartialEq.

- -
-use std::collections::HashMap;
-
-#[derive(Hash, Eq, PartialEq, Debug)]
-struct Viking {
-    name: String,
-    country: String,
-}
-
-impl Viking {
-    /// Create a new Viking.
-    fn new(name: &str, country: &str) -> Viking {
-        Viking { name: name.to_string(), country: country.to_string() }
-    }
-}
-
-// Use a HashMap to store the vikings' health points.
-let mut vikings = HashMap::new();
-
-vikings.insert(Viking::new("Einar", "Norway"), 25);
-vikings.insert(Viking::new("Olaf", "Denmark"), 24);
-vikings.insert(Viking::new("Harald", "Iceland"), 12);
-
-// Use derived implementation to print the status of the vikings.
-for (viking, health) in &vikings {
-    println!("{:?} has {} hp", viking, health);
-}
-

Methods

impl<K, V> HashMap<K, V, RandomState> where K: Eq + Hash

fn new() -> HashMap<K, V, RandomState>

-

Creates an empty HashMap.

- -

Examples

-
-use std::collections::HashMap;
-let mut map: HashMap<&str, isize> = HashMap::new();
-

fn with_capacity(capacity: usize) -> HashMap<K, V, RandomState>

-

Creates an empty hash map with the given initial capacity.

- -

Examples

-
-use std::collections::HashMap;
-let mut map: HashMap<&str, isize> = HashMap::with_capacity(10);
-

impl<K, V, S> HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher

fn with_hasher(hash_builder: S) -> HashMap<K, V, S>1.7.0

-

Creates an empty hashmap which will use the given hash builder to hash -keys.

- -

The created map has the default initial capacity.

- -

Warning: hash_builder is normally randomly generated, and -is designed to allow HashMaps to be resistant to attacks that -cause many collisions and very poor performance. Setting it -manually using this function can expose a DoS attack vector.

- -

Examples

-
-use std::collections::HashMap;
-use std::collections::hash_map::RandomState;
-
-let s = RandomState::new();
-let mut map = HashMap::with_hasher(s);
-map.insert(1, 2);
-

fn with_capacity_and_hasher(capacity: usize, hash_builder: S) -> HashMap<K, V, S>1.7.0

-

Creates an empty HashMap with space for at least capacity -elements, using hasher to hash the keys.

- -

Warning: hasher is normally randomly generated, and -is designed to allow HashMaps to be resistant to attacks that -cause many collisions and very poor performance. Setting it -manually using this function can expose a DoS attack vector.

- -

Examples

-
-use std::collections::HashMap;
-use std::collections::hash_map::RandomState;
-
-let s = RandomState::new();
-let mut map = HashMap::with_capacity_and_hasher(10, s);
-map.insert(1, 2);
-

fn hasher(&self) -> &S1.9.0

-

Returns a reference to the map's hasher.

-

fn capacity(&self) -> usize

-

Returns the number of elements the map can hold without reallocating.

- -

This number is a lower bound; the HashMap<K, V> might be able to hold -more, but is guaranteed to be able to hold at least this many.

- -

Examples

-
-use std::collections::HashMap;
-let map: HashMap<isize, isize> = HashMap::with_capacity(100);
-assert!(map.capacity() >= 100);
-

fn reserve(&mut self, additional: usize)

-

Reserves capacity for at least additional more elements to be inserted -in the HashMap. The collection may reserve more space to avoid -frequent reallocations.

- -

Panics

-

Panics if the new allocation size overflows usize.

- -

Examples

-
-use std::collections::HashMap;
-let mut map: HashMap<&str, isize> = HashMap::new();
-map.reserve(10);
-

fn shrink_to_fit(&mut self)

-

Shrinks the capacity of the map as much as possible. It will drop -down as much as possible while maintaining the internal rules -and possibly leaving some space in accordance with the resize policy.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map: HashMap<isize, isize> = HashMap::with_capacity(100);
-map.insert(1, 2);
-map.insert(3, 4);
-assert!(map.capacity() >= 100);
-map.shrink_to_fit();
-assert!(map.capacity() >= 2);
-

fn keys(&self) -> Keys<K, V>

-

An iterator visiting all keys in arbitrary order. -Iterator element type is &'a K.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert("a", 1);
-map.insert("b", 2);
-map.insert("c", 3);
-
-for key in map.keys() {
-    println!("{}", key);
-}
-

fn values(&self) -> Values<K, V>

-

An iterator visiting all values in arbitrary order. -Iterator element type is &'a V.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert("a", 1);
-map.insert("b", 2);
-map.insert("c", 3);
-
-for val in map.values() {
-    println!("{}", val);
-}
-

fn values_mut(&'a mut self) -> ValuesMut<'a, K, V>

-
Unstable (map_values_mut)

: recently added

-

An iterator visiting all values mutably in arbitrary order. -Iterator element type is &'a mut V.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-
-map.insert("a", 1);
-map.insert("b", 2);
-map.insert("c", 3);
-
-for val in map.values_mut() {
-    *val = *val + 10;
-}
-
-for val in map.values() {
-    print!("{}", val);
-}
-

fn iter(&self) -> Iter<K, V>

-

An iterator visiting all key-value pairs in arbitrary order. -Iterator element type is (&'a K, &'a V).

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert("a", 1);
-map.insert("b", 2);
-map.insert("c", 3);
-
-for (key, val) in map.iter() {
-    println!("key: {} val: {}", key, val);
-}
-

fn iter_mut(&mut self) -> IterMut<K, V>

-

An iterator visiting all key-value pairs in arbitrary order, -with mutable references to the values. -Iterator element type is (&'a K, &'a mut V).

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert("a", 1);
-map.insert("b", 2);
-map.insert("c", 3);
-
-// Update all values
-for (_, val) in map.iter_mut() {
-    *val *= 2;
-}
-
-for (key, val) in &map {
-    println!("key: {} val: {}", key, val);
-}
-

fn entry(&mut self, key: K) -> Entry<K, V>

-

Gets the given key's corresponding entry in the map for in-place manipulation.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut letters = HashMap::new();
-
-for ch in "a short treatise on fungi".chars() {
-    let counter = letters.entry(ch).or_insert(0);
-    *counter += 1;
-}
-
-assert_eq!(letters[&'s'], 2);
-assert_eq!(letters[&'t'], 3);
-assert_eq!(letters[&'u'], 1);
-assert_eq!(letters.get(&'y'), None);
-

fn len(&self) -> usize

-

Returns the number of elements in the map.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut a = HashMap::new();
-assert_eq!(a.len(), 0);
-a.insert(1, "a");
-assert_eq!(a.len(), 1);
-

fn is_empty(&self) -> bool

-

Returns true if the map contains no elements.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut a = HashMap::new();
-assert!(a.is_empty());
-a.insert(1, "a");
-assert!(!a.is_empty());
-

fn drain(&mut self) -> Drain<K, V>1.6.0

-

Clears the map, returning all key-value pairs as an iterator. Keeps the -allocated memory for reuse.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut a = HashMap::new();
-a.insert(1, "a");
-a.insert(2, "b");
-
-for (k, v) in a.drain().take(1) {
-    assert!(k == 1 || k == 2);
-    assert!(v == "a" || v == "b");
-}
-
-assert!(a.is_empty());
-

fn clear(&mut self)

-

Clears the map, removing all key-value pairs. Keeps the allocated memory -for reuse.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut a = HashMap::new();
-a.insert(1, "a");
-a.clear();
-assert!(a.is_empty());
-

fn get<Q>(&self, k: &Q) -> Option<&V> where K: Borrow<Q>, Q: Hash + Eq + ?Sized

-

Returns a reference to the value corresponding to the key.

- -

The key may be any borrowed form of the map's key type, but -Hash and Eq on the borrowed form must match those for -the key type.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert(1, "a");
-assert_eq!(map.get(&1), Some(&"a"));
-assert_eq!(map.get(&2), None);
-

fn contains_key<Q>(&self, k: &Q) -> bool where K: Borrow<Q>, Q: Hash + Eq + ?Sized

-

Returns true if the map contains a value for the specified key.

- -

The key may be any borrowed form of the map's key type, but -Hash and Eq on the borrowed form must match those for -the key type.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert(1, "a");
-assert_eq!(map.contains_key(&1), true);
-assert_eq!(map.contains_key(&2), false);
-

fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V> where Q: Hash + Eq + ?Sized, K: Borrow<Q>

-

Returns a mutable reference to the value corresponding to the key.

- -

The key may be any borrowed form of the map's key type, but -Hash and Eq on the borrowed form must match those for -the key type.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert(1, "a");
-if let Some(x) = map.get_mut(&1) {
-    *x = "b";
-}
-assert_eq!(map[&1], "b");
-

fn insert(&mut self, k: K, v: V) -> Option<V>

-

Inserts a key-value pair into the map.

- -

If the map did not have this key present, None is returned.

- -

If the map did have this key present, the value is updated, and the old -value is returned. The key is not updated, though; this matters for -types that can be == without being identical. See the module-level -documentation for more.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-assert_eq!(map.insert(37, "a"), None);
-assert_eq!(map.is_empty(), false);
-
-map.insert(37, "b");
-assert_eq!(map.insert(37, "c"), Some("b"));
-assert_eq!(map[&37], "c");
-

fn remove<Q>(&mut self, k: &Q) -> Option<V> where K: Borrow<Q>, Q: Hash + Eq + ?Sized

-

Removes a key from the map, returning the value at the key if the key -was previously in the map.

- -

The key may be any borrowed form of the map's key type, but -Hash and Eq on the borrowed form must match those for -the key type.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert(1, "a");
-assert_eq!(map.remove(&1), Some("a"));
-assert_eq!(map.remove(&1), None);
-

Trait Implementations

impl<K, V, S> PartialEq<HashMap<K, V, S>> for HashMap<K, V, S> where S: BuildHasher, K: Eq + Hash, V: PartialEq<V>

fn eq(&self, other: &HashMap<K, V, S>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<K, V, S> Eq for HashMap<K, V, S> where K: Eq + Hash, V: Eq, S: BuildHasher

impl<K, V, S> Debug for HashMap<K, V, S> where V: Debug, K: Eq + Hash + Debug, S: BuildHasher

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<K, V, S> Default for HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher + Default

fn default() -> HashMap<K, V, S>

-

impl<'a, K, Q, V, S> Index<&'a Q> for HashMap<K, V, S> where Q: Eq + Hash + ?Sized, S: BuildHasher, K: Eq + Hash + Borrow<Q>

type Output = V

-

fn index(&self, index: &Q) -> &V

-

impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher

type Item = (&'a K, &'a V)

-

type IntoIter = Iter<'a, K, V>

-

fn into_iter(self) -> Iter<'a, K, V>

-

impl<'a, K, V, S> IntoIterator for &'a mut HashMap<K, V, S> where S: BuildHasher, K: Eq + Hash

type Item = (&'a K, &'a mut V)

-

type IntoIter = IterMut<'a, K, V>

-

fn into_iter(self) -> IterMut<'a, K, V>

-

impl<K, V, S> IntoIterator for HashMap<K, V, S> where S: BuildHasher, K: Eq + Hash

type Item = (K, V)

-

type IntoIter = IntoIter<K, V>

-

fn into_iter(self) -> IntoIter<K, V>

-

Creates a consuming iterator, that is, one that moves each key-value -pair out of the map in arbitrary order. The map cannot be used after -calling this.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert("a", 1);
-map.insert("b", 2);
-map.insert("c", 3);
-
-// Not possible with .iter()
-let vec: Vec<(&str, isize)> = map.into_iter().collect();
-

impl<K, V, S> FromIterator<(K, V)> for HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher + Default

fn from_iter<T>(iter: T) -> HashMap<K, V, S> where T: IntoIterator<Item=(K, V)>

-

impl<K, V, S> Extend<(K, V)> for HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher

fn extend<T>(&mut self, iter: T) where T: IntoIterator<Item=(K, V)>

-

impl<'a, K, V, S> Extend<(&'a K, &'a V)> for HashMap<K, V, S> where V: Copy, K: Eq + Hash + Copy, S: BuildHasher1.4.0

fn extend<T>(&mut self, iter: T) where T: IntoIterator<Item=(&'a K, &'a V)>

-

Derived Implementations

impl<K, V, S> Clone for HashMap<K, V, S> where S: Clone, V: Clone, K: Clone

fn clone(&self) -> HashMap<K, V, S>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_map/struct.IntoIter.html b/doc/bitflags/__core/collections/hash_map/struct.IntoIter.html deleted file mode 100644 index 0948f302..00000000 --- a/doc/bitflags/__core/collections/hash_map/struct.IntoIter.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_map::IntoIter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_map::IntoIter - - [−] - - [src]

-
pub struct IntoIter<K, V> {
-    // some fields omitted
-}
1.0.0

HashMap move iterator.

-

Trait Implementations

impl<K, V> Iterator for IntoIter<K, V>

type Item = (K, V)

-

fn next(&mut self) -> Option<(K, V)>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<K, V> ExactSizeIterator for IntoIter<K, V>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_map/struct.Iter.html b/doc/bitflags/__core/collections/hash_map/struct.Iter.html deleted file mode 100644 index e4d9dcdc..00000000 --- a/doc/bitflags/__core/collections/hash_map/struct.Iter.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_map::Iter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_map::Iter - - [−] - - [src]

-
pub struct Iter<'a, K, V> where K: 'a, V: 'a {
-    // some fields omitted
-}
1.0.0

HashMap iterator.

-

Trait Implementations

impl<'a, K, V> Clone for Iter<'a, K, V>

fn clone(&self) -> Iter<'a, K, V>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, K, V> Iterator for Iter<'a, K, V>

type Item = (&'a K, &'a V)

-

fn next(&mut self) -> Option<(&'a K, &'a V)>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, K, V> ExactSizeIterator for Iter<'a, K, V>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_map/struct.IterMut.html b/doc/bitflags/__core/collections/hash_map/struct.IterMut.html deleted file mode 100644 index 90920865..00000000 --- a/doc/bitflags/__core/collections/hash_map/struct.IterMut.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_map::IterMut - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_map::IterMut - - [−] - - [src]

-
pub struct IterMut<'a, K, V> where V: 'a, K: 'a {
-    // some fields omitted
-}
1.0.0

HashMap mutable values iterator.

-

Trait Implementations

impl<'a, K, V> Iterator for IterMut<'a, K, V>

type Item = (&'a K, &'a mut V)

-

fn next(&mut self) -> Option<(&'a K, &'a mut V)>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, K, V> ExactSizeIterator for IterMut<'a, K, V>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_map/struct.Keys.html b/doc/bitflags/__core/collections/hash_map/struct.Keys.html deleted file mode 100644 index 8747ad6c..00000000 --- a/doc/bitflags/__core/collections/hash_map/struct.Keys.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_map::Keys - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_map::Keys - - [−] - - [src]

-
pub struct Keys<'a, K, V> where V: 'a, K: 'a {
-    // some fields omitted
-}
1.0.0

HashMap keys iterator.

-

Trait Implementations

impl<'a, K, V> Clone for Keys<'a, K, V>

fn clone(&self) -> Keys<'a, K, V>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, K, V> Iterator for Keys<'a, K, V>

type Item = &'a K

-

fn next(&mut self) -> Option<&'a K>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, K, V> ExactSizeIterator for Keys<'a, K, V>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_map/struct.OccupiedEntry.html b/doc/bitflags/__core/collections/hash_map/struct.OccupiedEntry.html deleted file mode 100644 index e414cceb..00000000 --- a/doc/bitflags/__core/collections/hash_map/struct.OccupiedEntry.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_map::OccupiedEntry - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_map::OccupiedEntry - - [−] - - [src]

-
pub struct OccupiedEntry<'a, K, V> where V: 'a, K: 'a {
-    // some fields omitted
-}
1.0.0

A view into a single occupied location in a HashMap.

-

Methods

impl<'a, K, V> OccupiedEntry<'a, K, V>

fn key(&self) -> &K

-
Unstable (map_entry_keys)

Gets a reference to the key in the entry.

-

fn get(&self) -> &V

-

Gets a reference to the value in the entry.

-

fn get_mut(&mut self) -> &mut V

-

Gets a mutable reference to the value in the entry.

-

fn into_mut(self) -> &'a mut V

-

Converts the OccupiedEntry into a mutable reference to the value in the entry -with a lifetime bound to the map itself

-

fn insert(&mut self, value: V) -> V

-

Sets the value of the entry, and returns the entry's old value

-

fn remove(self) -> V

-

Takes the value out of the entry, and returns it

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_map/struct.RandomState.html b/doc/bitflags/__core/collections/hash_map/struct.RandomState.html deleted file mode 100644 index 5b4cce60..00000000 --- a/doc/bitflags/__core/collections/hash_map/struct.RandomState.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_map::RandomState - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_map::RandomState - - [−] - - [src]

-
pub struct RandomState {
-    // some fields omitted
-}
1.7.0

RandomState is the default state for HashMap types.

- -

A particular instance RandomState will create the same instances of -Hasher, but the hashers created by two different RandomState -instances are unlikely to produce the same result for the same values.

-

Methods

impl RandomState

fn new() -> RandomState

-

Constructs a new RandomState that is initialized with random keys.

-

Trait Implementations

impl BuildHasher for RandomState

type Hasher = SipHasher

-

fn build_hasher(&self) -> SipHasher

-

impl Default for RandomState1.0.0

fn default() -> RandomState

-

Derived Implementations

impl Clone for RandomState

fn clone(&self) -> RandomState

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_map/struct.VacantEntry.html b/doc/bitflags/__core/collections/hash_map/struct.VacantEntry.html deleted file mode 100644 index caa07d6d..00000000 --- a/doc/bitflags/__core/collections/hash_map/struct.VacantEntry.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_map::VacantEntry - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_map::VacantEntry - - [−] - - [src]

-
pub struct VacantEntry<'a, K, V> where V: 'a, K: 'a {
-    // some fields omitted
-}
1.0.0

A view into a single empty location in a HashMap.

-

Methods

impl<'a, K, V> VacantEntry<'a, K, V> where V: 'a, K: 'a

fn key(&self) -> &K

-
Unstable (map_entry_keys)

Gets a reference to the key that would be used when inserting a value -through the VacantEntry.

-

fn insert(self, value: V) -> &'a mut V

-

Sets the value of the entry with the VacantEntry's key, -and returns a mutable reference to it

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_map/struct.Values.html b/doc/bitflags/__core/collections/hash_map/struct.Values.html deleted file mode 100644 index 1efeb4fb..00000000 --- a/doc/bitflags/__core/collections/hash_map/struct.Values.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_map::Values - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_map::Values - - [−] - - [src]

-
pub struct Values<'a, K, V> where V: 'a, K: 'a {
-    // some fields omitted
-}
1.0.0

HashMap values iterator.

-

Trait Implementations

impl<'a, K, V> Clone for Values<'a, K, V>

fn clone(&self) -> Values<'a, K, V>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, K, V> Iterator for Values<'a, K, V>

type Item = &'a V

-

fn next(&mut self) -> Option<&'a V>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, K, V> ExactSizeIterator for Values<'a, K, V>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_map/struct.ValuesMut.html b/doc/bitflags/__core/collections/hash_map/struct.ValuesMut.html deleted file mode 100644 index 5907680b..00000000 --- a/doc/bitflags/__core/collections/hash_map/struct.ValuesMut.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_map::ValuesMut - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_map::ValuesMut - - [−] - - [src]

-
pub struct ValuesMut<'a, K, V> where K: 'a, V: 'a {
-    // some fields omitted
-}
Unstable (map_values_mut)

: recently added

-

Mutable HashMap values iterator.

-

Trait Implementations

impl<'a, K, V> Iterator for ValuesMut<'a, K, V>

type Item = &'a mut V

-
Unstable (map_values_mut)

: recently added

-

fn next(&mut self) -> Option<&'a mut V>

-
Unstable (map_values_mut)

: recently added

-

fn size_hint(&self) -> (usize, Option<usize>)

-
Unstable (map_values_mut)

: recently added

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, K, V> ExactSizeIterator for ValuesMut<'a, K, V>

fn len(&self) -> usize

-
Unstable (map_values_mut)

: recently added

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_set/index.html b/doc/bitflags/__core/collections/hash_set/index.html deleted file mode 100644 index 3242a3de..00000000 --- a/doc/bitflags/__core/collections/hash_set/index.html +++ /dev/null @@ -1,171 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_set - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::collections::hash_set - - [−] - - [src]

-

A hashset

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Difference -

Difference iterator

-
Drain -

HashSet drain iterator

-
HashSet -

An implementation of a hash set using the underlying representation of a -HashMap where the value is ().

-
Intersection -

Intersection iterator

-
IntoIter -

HashSet move iterator

-
Iter -

HashSet iterator

-
SymmetricDifference -

Symmetric difference iterator.

-
Union -

Set union iterator.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_set/sidebar-items.js b/doc/bitflags/__core/collections/hash_set/sidebar-items.js deleted file mode 100644 index 2a2ba135..00000000 --- a/doc/bitflags/__core/collections/hash_set/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["Difference","Difference iterator"],["Drain","HashSet drain iterator"],["HashSet","An implementation of a hash set using the underlying representation of a HashMap where the value is ()."],["Intersection","Intersection iterator"],["IntoIter","HashSet move iterator"],["Iter","HashSet iterator"],["SymmetricDifference","Symmetric difference iterator."],["Union","Set union iterator."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_set/struct.Difference.html b/doc/bitflags/__core/collections/hash_set/struct.Difference.html deleted file mode 100644 index 9ae3fc47..00000000 --- a/doc/bitflags/__core/collections/hash_set/struct.Difference.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_set::Difference - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_set::Difference - - [−] - - [src]

-
pub struct Difference<'a, T, S> where S: 'a, T: 'a {
-    // some fields omitted
-}
1.0.0

Difference iterator

-

Trait Implementations

impl<'a, T, S> Clone for Difference<'a, T, S>

fn clone(&self) -> Difference<'a, T, S>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, T, S> Iterator for Difference<'a, T, S> where S: BuildHasher, T: Eq + Hash

type Item = &'a T

-

fn next(&mut self) -> Option<&'a T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_set/struct.Drain.html b/doc/bitflags/__core/collections/hash_set/struct.Drain.html deleted file mode 100644 index f9603644..00000000 --- a/doc/bitflags/__core/collections/hash_set/struct.Drain.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_set::Drain - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_set::Drain - - [−] - - [src]

-
pub struct Drain<'a, K> where K: 'a {
-    // some fields omitted
-}
1.0.0

HashSet drain iterator

-

Trait Implementations

impl<'a, K> Iterator for Drain<'a, K>

type Item = K

-

fn next(&mut self) -> Option<K>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, K> ExactSizeIterator for Drain<'a, K>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_set/struct.HashSet.html b/doc/bitflags/__core/collections/hash_set/struct.HashSet.html deleted file mode 100644 index 0435b567..00000000 --- a/doc/bitflags/__core/collections/hash_set/struct.HashSet.html +++ /dev/null @@ -1,618 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_set::HashSet - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_set::HashSet - - [−] - - [src]

-
pub struct HashSet<T, S = RandomState> {
-    // some fields omitted
-}
1.0.0

An implementation of a hash set using the underlying representation of a -HashMap where the value is ().

- -

As with the HashMap type, a HashSet requires that the elements -implement the Eq and Hash traits. This can frequently be achieved by -using #[derive(PartialEq, Eq, Hash)]. If you implement these yourself, -it is important that the following property holds:

- -
k1 == k2 -> hash(k1) == hash(k2)
-
- -

In other words, if two keys are equal, their hashes must be equal.

- -

It is a logic error for an item to be modified in such a way that the -item's hash, as determined by the Hash trait, or its equality, as -determined by the Eq trait, changes while it is in the set. This is -normally only possible through Cell, RefCell, global state, I/O, or -unsafe code.

- -

Examples

-
-use std::collections::HashSet;
-// Type inference lets us omit an explicit type signature (which
-// would be `HashSet<&str>` in this example).
-let mut books = HashSet::new();
-
-// Add some books.
-books.insert("A Dance With Dragons");
-books.insert("To Kill a Mockingbird");
-books.insert("The Odyssey");
-books.insert("The Great Gatsby");
-
-// Check for a specific one.
-if !books.contains("The Winds of Winter") {
-    println!("We have {} books, but The Winds of Winter ain't one.",
-             books.len());
-}
-
-// Remove a book.
-books.remove("The Odyssey");
-
-// Iterate over everything.
-for book in &books {
-    println!("{}", book);
-}
- -

The easiest way to use HashSet with a custom type is to derive -Eq and Hash. We must also derive PartialEq, this will in the -future be implied by Eq.

- -
-use std::collections::HashSet;
-#[derive(Hash, Eq, PartialEq, Debug)]
-struct Viking<'a> {
-    name: &'a str,
-    power: usize,
-}
-
-let mut vikings = HashSet::new();
-
-vikings.insert(Viking { name: "Einar", power: 9 });
-vikings.insert(Viking { name: "Einar", power: 9 });
-vikings.insert(Viking { name: "Olaf", power: 4 });
-vikings.insert(Viking { name: "Harald", power: 8 });
-
-// Use derived implementation to print the vikings.
-for x in &vikings {
-    println!("{:?}", x);
-}
-

Methods

impl<T> HashSet<T, RandomState> where T: Eq + Hash

fn new() -> HashSet<T, RandomState>

-

Creates an empty HashSet.

- -

Examples

-
-use std::collections::HashSet;
-let mut set: HashSet<i32> = HashSet::new();
-

fn with_capacity(capacity: usize) -> HashSet<T, RandomState>

-

Creates an empty HashSet with space for at least n elements in -the hash table.

- -

Examples

-
-use std::collections::HashSet;
-let mut set: HashSet<i32> = HashSet::with_capacity(10);
-

impl<T, S> HashSet<T, S> where S: BuildHasher, T: Eq + Hash

fn with_hasher(hasher: S) -> HashSet<T, S>1.7.0

-

Creates a new empty hash set which will use the given hasher to hash -keys.

- -

The hash set is also created with the default initial capacity.

- -

Warning: hasher is normally randomly generated, and -is designed to allow HashSets to be resistant to attacks that -cause many collisions and very poor performance. Setting it -manually using this function can expose a DoS attack vector.

- -

Examples

-
-use std::collections::HashSet;
-use std::collections::hash_map::RandomState;
-
-let s = RandomState::new();
-let mut set = HashSet::with_hasher(s);
-set.insert(2);
-

fn with_capacity_and_hasher(capacity: usize, hasher: S) -> HashSet<T, S>1.7.0

-

Creates an empty HashSet with space for at least capacity -elements in the hash table, using hasher to hash the keys.

- -

Warning: hasher is normally randomly generated, and -is designed to allow HashSets to be resistant to attacks that -cause many collisions and very poor performance. Setting it -manually using this function can expose a DoS attack vector.

- -

Examples

-
-use std::collections::HashSet;
-use std::collections::hash_map::RandomState;
-
-let s = RandomState::new();
-let mut set = HashSet::with_capacity_and_hasher(10, s);
-set.insert(1);
-

fn hasher(&self) -> &S1.9.0

-

Returns a reference to the set's hasher.

-

fn capacity(&self) -> usize

-

Returns the number of elements the set can hold without reallocating.

- -

Examples

-
-use std::collections::HashSet;
-let set: HashSet<i32> = HashSet::with_capacity(100);
-assert!(set.capacity() >= 100);
-

fn reserve(&mut self, additional: usize)

-

Reserves capacity for at least additional more elements to be inserted -in the HashSet. The collection may reserve more space to avoid -frequent reallocations.

- -

Panics

-

Panics if the new allocation size overflows usize.

- -

Examples

-
-use std::collections::HashSet;
-let mut set: HashSet<i32> = HashSet::new();
-set.reserve(10);
-

fn shrink_to_fit(&mut self)

-

Shrinks the capacity of the set as much as possible. It will drop -down as much as possible while maintaining the internal rules -and possibly leaving some space in accordance with the resize policy.

- -

Examples

-
-use std::collections::HashSet;
-
-let mut set = HashSet::with_capacity(100);
-set.insert(1);
-set.insert(2);
-assert!(set.capacity() >= 100);
-set.shrink_to_fit();
-assert!(set.capacity() >= 2);
-

fn iter(&self) -> Iter<T>

-

An iterator visiting all elements in arbitrary order. -Iterator element type is &'a T.

- -

Examples

-
-use std::collections::HashSet;
-let mut set = HashSet::new();
-set.insert("a");
-set.insert("b");
-
-// Will print in an arbitrary order.
-for x in set.iter() {
-    println!("{}", x);
-}
-

fn difference(&'a self, other: &'a HashSet<T, S>) -> Difference<'a, T, S>

-

Visit the values representing the difference.

- -

Examples

-
-use std::collections::HashSet;
-let a: HashSet<_> = [1, 2, 3].iter().cloned().collect();
-let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect();
-
-// Can be seen as `a - b`.
-for x in a.difference(&b) {
-    println!("{}", x); // Print 1
-}
-
-let diff: HashSet<_> = a.difference(&b).cloned().collect();
-assert_eq!(diff, [1].iter().cloned().collect());
-
-// Note that difference is not symmetric,
-// and `b - a` means something else:
-let diff: HashSet<_> = b.difference(&a).cloned().collect();
-assert_eq!(diff, [4].iter().cloned().collect());
-

fn symmetric_difference(&'a self, other: &'a HashSet<T, S>) -> SymmetricDifference<'a, T, S>

-

Visit the values representing the symmetric difference.

- -

Examples

-
-use std::collections::HashSet;
-let a: HashSet<_> = [1, 2, 3].iter().cloned().collect();
-let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect();
-
-// Print 1, 4 in arbitrary order.
-for x in a.symmetric_difference(&b) {
-    println!("{}", x);
-}
-
-let diff1: HashSet<_> = a.symmetric_difference(&b).cloned().collect();
-let diff2: HashSet<_> = b.symmetric_difference(&a).cloned().collect();
-
-assert_eq!(diff1, diff2);
-assert_eq!(diff1, [1, 4].iter().cloned().collect());
-

fn intersection(&'a self, other: &'a HashSet<T, S>) -> Intersection<'a, T, S>

-

Visit the values representing the intersection.

- -

Examples

-
-use std::collections::HashSet;
-let a: HashSet<_> = [1, 2, 3].iter().cloned().collect();
-let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect();
-
-// Print 2, 3 in arbitrary order.
-for x in a.intersection(&b) {
-    println!("{}", x);
-}
-
-let intersection: HashSet<_> = a.intersection(&b).cloned().collect();
-assert_eq!(intersection, [2, 3].iter().cloned().collect());
-

fn union(&'a self, other: &'a HashSet<T, S>) -> Union<'a, T, S>

-

Visit the values representing the union.

- -

Examples

-
-use std::collections::HashSet;
-let a: HashSet<_> = [1, 2, 3].iter().cloned().collect();
-let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect();
-
-// Print 1, 2, 3, 4 in arbitrary order.
-for x in a.union(&b) {
-    println!("{}", x);
-}
-
-let union: HashSet<_> = a.union(&b).cloned().collect();
-assert_eq!(union, [1, 2, 3, 4].iter().cloned().collect());
-

fn len(&self) -> usize

-

Returns the number of elements in the set.

- -

Examples

-
-use std::collections::HashSet;
-
-let mut v = HashSet::new();
-assert_eq!(v.len(), 0);
-v.insert(1);
-assert_eq!(v.len(), 1);
-

fn is_empty(&self) -> bool

-

Returns true if the set contains no elements.

- -

Examples

-
-use std::collections::HashSet;
-
-let mut v = HashSet::new();
-assert!(v.is_empty());
-v.insert(1);
-assert!(!v.is_empty());
-

fn drain(&mut self) -> Drain<T>1.6.0

-

Clears the set, returning all elements in an iterator.

-

fn clear(&mut self)

-

Clears the set, removing all values.

- -

Examples

-
-use std::collections::HashSet;
-
-let mut v = HashSet::new();
-v.insert(1);
-v.clear();
-assert!(v.is_empty());
-

fn contains<Q>(&self, value: &Q) -> bool where Q: Hash + Eq + ?Sized, T: Borrow<Q>

-

Returns true if the set contains a value.

- -

The value may be any borrowed form of the set's value type, but -Hash and Eq on the borrowed form must match those for -the value type.

- -

Examples

-
-use std::collections::HashSet;
-
-let set: HashSet<_> = [1, 2, 3].iter().cloned().collect();
-assert_eq!(set.contains(&1), true);
-assert_eq!(set.contains(&4), false);
-

fn get<Q>(&self, value: &Q) -> Option<&T> where T: Borrow<Q>, Q: Hash + Eq + ?Sized1.9.0

-

Returns a reference to the value in the set, if any, that is equal to the given value.

- -

The value may be any borrowed form of the set's value type, but -Hash and Eq on the borrowed form must match those for -the value type.

-

fn is_disjoint(&self, other: &HashSet<T, S>) -> bool

-

Returns true if the set has no elements in common with other. -This is equivalent to checking for an empty intersection.

- -

Examples

-
-use std::collections::HashSet;
-
-let a: HashSet<_> = [1, 2, 3].iter().cloned().collect();
-let mut b = HashSet::new();
-
-assert_eq!(a.is_disjoint(&b), true);
-b.insert(4);
-assert_eq!(a.is_disjoint(&b), true);
-b.insert(1);
-assert_eq!(a.is_disjoint(&b), false);
-

fn is_subset(&self, other: &HashSet<T, S>) -> bool

-

Returns true if the set is a subset of another.

- -

Examples

-
-use std::collections::HashSet;
-
-let sup: HashSet<_> = [1, 2, 3].iter().cloned().collect();
-let mut set = HashSet::new();
-
-assert_eq!(set.is_subset(&sup), true);
-set.insert(2);
-assert_eq!(set.is_subset(&sup), true);
-set.insert(4);
-assert_eq!(set.is_subset(&sup), false);
-

fn is_superset(&self, other: &HashSet<T, S>) -> bool

-

Returns true if the set is a superset of another.

- -

Examples

-
-use std::collections::HashSet;
-
-let sub: HashSet<_> = [1, 2].iter().cloned().collect();
-let mut set = HashSet::new();
-
-assert_eq!(set.is_superset(&sub), false);
-
-set.insert(0);
-set.insert(1);
-assert_eq!(set.is_superset(&sub), false);
-
-set.insert(2);
-assert_eq!(set.is_superset(&sub), true);
-

fn insert(&mut self, value: T) -> bool

-

Adds a value to the set.

- -

If the set did not have this value present, true is returned.

- -

If the set did have this value present, false is returned.

- -

Examples

-
-use std::collections::HashSet;
-
-let mut set = HashSet::new();
-
-assert_eq!(set.insert(2), true);
-assert_eq!(set.insert(2), false);
-assert_eq!(set.len(), 1);
-

fn replace(&mut self, value: T) -> Option<T>1.9.0

-

Adds a value to the set, replacing the existing value, if any, that is equal to the given -one. Returns the replaced value.

-

fn remove<Q>(&mut self, value: &Q) -> bool where T: Borrow<Q>, Q: Hash + Eq + ?Sized

-

Removes a value from the set. Returns true if the value was -present in the set.

- -

The value may be any borrowed form of the set's value type, but -Hash and Eq on the borrowed form must match those for -the value type.

- -

Examples

-
-use std::collections::HashSet;
-
-let mut set = HashSet::new();
-
-set.insert(2);
-assert_eq!(set.remove(&2), true);
-assert_eq!(set.remove(&2), false);
-

fn take<Q>(&mut self, value: &Q) -> Option<T> where Q: Hash + Eq + ?Sized, T: Borrow<Q>1.9.0

-

Removes and returns the value in the set, if any, that is equal to the given one.

- -

The value may be any borrowed form of the set's value type, but -Hash and Eq on the borrowed form must match those for -the value type.

-

Trait Implementations

impl<T, S> PartialEq<HashSet<T, S>> for HashSet<T, S> where S: BuildHasher, T: Eq + Hash

fn eq(&self, other: &HashSet<T, S>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<T, S> Eq for HashSet<T, S> where T: Eq + Hash, S: BuildHasher

impl<T, S> Debug for HashSet<T, S> where T: Eq + Hash + Debug, S: BuildHasher

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T, S> FromIterator<T> for HashSet<T, S> where T: Eq + Hash, S: BuildHasher + Default

fn from_iter<I>(iter: I) -> HashSet<T, S> where I: IntoIterator<Item=T>

-

impl<T, S> Extend<T> for HashSet<T, S> where S: BuildHasher, T: Eq + Hash

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=T>

-

impl<'a, T, S> Extend<&'a T> for HashSet<T, S> where S: BuildHasher, T: 'a + Eq + Hash + Copy1.4.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a T>

-

impl<T, S> Default for HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash

fn default() -> HashSet<T, S>

-

impl<'a, 'b, T, S> BitOr<&'b HashSet<T, S>> for &'a HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash + Clone

type Output = HashSet<T, S>

-

fn bitor(self, rhs: &HashSet<T, S>) -> HashSet<T, S>

-

Returns the union of self and rhs as a new HashSet<T, S>.

- -

Examples

-
-use std::collections::HashSet;
-
-let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: HashSet<_> = vec![3, 4, 5].into_iter().collect();
-
-let set = &a | &b;
-
-let mut i = 0;
-let expected = [1, 2, 3, 4, 5];
-for x in &set {
-    assert!(expected.contains(x));
-    i += 1;
-}
-assert_eq!(i, expected.len());
-

impl<'a, 'b, T, S> BitAnd<&'b HashSet<T, S>> for &'a HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash + Clone

type Output = HashSet<T, S>

-

fn bitand(self, rhs: &HashSet<T, S>) -> HashSet<T, S>

-

Returns the intersection of self and rhs as a new HashSet<T, S>.

- -

Examples

-
-use std::collections::HashSet;
-
-let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: HashSet<_> = vec![2, 3, 4].into_iter().collect();
-
-let set = &a & &b;
-
-let mut i = 0;
-let expected = [2, 3];
-for x in &set {
-    assert!(expected.contains(x));
-    i += 1;
-}
-assert_eq!(i, expected.len());
-

impl<'a, 'b, T, S> BitXor<&'b HashSet<T, S>> for &'a HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash + Clone

type Output = HashSet<T, S>

-

fn bitxor(self, rhs: &HashSet<T, S>) -> HashSet<T, S>

-

Returns the symmetric difference of self and rhs as a new HashSet<T, S>.

- -

Examples

-
-use std::collections::HashSet;
-
-let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: HashSet<_> = vec![3, 4, 5].into_iter().collect();
-
-let set = &a ^ &b;
-
-let mut i = 0;
-let expected = [1, 2, 4, 5];
-for x in &set {
-    assert!(expected.contains(x));
-    i += 1;
-}
-assert_eq!(i, expected.len());
-

impl<'a, 'b, T, S> Sub<&'b HashSet<T, S>> for &'a HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash + Clone

type Output = HashSet<T, S>

-

fn sub(self, rhs: &HashSet<T, S>) -> HashSet<T, S>

-

Returns the difference of self and rhs as a new HashSet<T, S>.

- -

Examples

-
-use std::collections::HashSet;
-
-let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: HashSet<_> = vec![3, 4, 5].into_iter().collect();
-
-let set = &a - &b;
-
-let mut i = 0;
-let expected = [1, 2];
-for x in &set {
-    assert!(expected.contains(x));
-    i += 1;
-}
-assert_eq!(i, expected.len());
-

impl<'a, T, S> IntoIterator for &'a HashSet<T, S> where S: BuildHasher, T: Eq + Hash

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<T, S> IntoIterator for HashSet<T, S> where T: Eq + Hash, S: BuildHasher

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Creates a consuming iterator, that is, one that moves each value out -of the set in arbitrary order. The set cannot be used after calling -this.

- -

Examples

-
-use std::collections::HashSet;
-let mut set = HashSet::new();
-set.insert("a".to_string());
-set.insert("b".to_string());
-
-// Not possible to collect to a Vec<String> with a regular `.iter()`.
-let v: Vec<String> = set.into_iter().collect();
-
-// Will print in an arbitrary order.
-for x in &v {
-    println!("{}", x);
-}
-

Derived Implementations

impl<T, S> Clone for HashSet<T, S> where T: Clone, S: Clone

fn clone(&self) -> HashSet<T, S>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_set/struct.Intersection.html b/doc/bitflags/__core/collections/hash_set/struct.Intersection.html deleted file mode 100644 index 731a4343..00000000 --- a/doc/bitflags/__core/collections/hash_set/struct.Intersection.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_set::Intersection - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_set::Intersection - - [−] - - [src]

-
pub struct Intersection<'a, T, S> where S: 'a, T: 'a {
-    // some fields omitted
-}
1.0.0

Intersection iterator

-

Trait Implementations

impl<'a, T, S> Clone for Intersection<'a, T, S>

fn clone(&self) -> Intersection<'a, T, S>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, T, S> Iterator for Intersection<'a, T, S> where T: Eq + Hash, S: BuildHasher

type Item = &'a T

-

fn next(&mut self) -> Option<&'a T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_set/struct.IntoIter.html b/doc/bitflags/__core/collections/hash_set/struct.IntoIter.html deleted file mode 100644 index 8f95f776..00000000 --- a/doc/bitflags/__core/collections/hash_set/struct.IntoIter.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_set::IntoIter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_set::IntoIter - - [−] - - [src]

-
pub struct IntoIter<K> {
-    // some fields omitted
-}
1.0.0

HashSet move iterator

-

Trait Implementations

impl<K> Iterator for IntoIter<K>

type Item = K

-

fn next(&mut self) -> Option<K>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<K> ExactSizeIterator for IntoIter<K>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_set/struct.Iter.html b/doc/bitflags/__core/collections/hash_set/struct.Iter.html deleted file mode 100644 index 997c0df5..00000000 --- a/doc/bitflags/__core/collections/hash_set/struct.Iter.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_set::Iter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_set::Iter - - [−] - - [src]

-
pub struct Iter<'a, K> where K: 'a {
-    // some fields omitted
-}
1.0.0

HashSet iterator

-

Trait Implementations

impl<'a, K> Clone for Iter<'a, K>

fn clone(&self) -> Iter<'a, K>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, K> Iterator for Iter<'a, K>

type Item = &'a K

-

fn next(&mut self) -> Option<&'a K>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, K> ExactSizeIterator for Iter<'a, K>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_set/struct.SymmetricDifference.html b/doc/bitflags/__core/collections/hash_set/struct.SymmetricDifference.html deleted file mode 100644 index f56c3aa4..00000000 --- a/doc/bitflags/__core/collections/hash_set/struct.SymmetricDifference.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_set::SymmetricDifference - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_set::SymmetricDifference - - [−] - - [src]

-
pub struct SymmetricDifference<'a, T, S> where T: 'a, S: 'a {
-    // some fields omitted
-}
1.0.0

Symmetric difference iterator.

-

Trait Implementations

impl<'a, T, S> Clone for SymmetricDifference<'a, T, S>

fn clone(&self) -> SymmetricDifference<'a, T, S>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, T, S> Iterator for SymmetricDifference<'a, T, S> where S: BuildHasher, T: Eq + Hash

type Item = &'a T

-

fn next(&mut self) -> Option<&'a T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/hash_set/struct.Union.html b/doc/bitflags/__core/collections/hash_set/struct.Union.html deleted file mode 100644 index 5580304f..00000000 --- a/doc/bitflags/__core/collections/hash_set/struct.Union.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::hash_set::Union - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::hash_set::Union - - [−] - - [src]

-
pub struct Union<'a, T, S> where T: 'a, S: 'a {
-    // some fields omitted
-}
1.0.0

Set union iterator.

-

Trait Implementations

impl<'a, T, S> Clone for Union<'a, T, S>

fn clone(&self) -> Union<'a, T, S>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, T, S> Iterator for Union<'a, T, S> where S: BuildHasher, T: Eq + Hash

type Item = &'a T

-

fn next(&mut self) -> Option<&'a T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/index.html b/doc/bitflags/__core/collections/index.html deleted file mode 100644 index 9689089a..00000000 --- a/doc/bitflags/__core/collections/index.html +++ /dev/null @@ -1,678 +0,0 @@ - - - - - - - - - - bitflags::__core::collections - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::collections - - [−] - - [src]

-

Collection types.

- -

Rust's standard collection library provides efficient implementations of the -most common general purpose programming data structures. By using the -standard implementations, it should be possible for two libraries to -communicate without significant data conversion.

- -

To get this out of the way: you should probably just use Vec or HashMap. -These two collections cover most use cases for generic data storage and -processing. They are exceptionally good at doing what they do. All the other -collections in the standard library have specific use cases where they are -the optimal choice, but these cases are borderline niche in comparison. -Even when Vec and HashMap are technically suboptimal, they're probably a -good enough choice to get started.

- -

Rust's collections can be grouped into four major categories:

- -
    -
  • Sequences: Vec, VecDeque, LinkedList
    • -
  • Maps: HashMap, BTreeMap
    • -
  • Sets: HashSet, BTreeSet
    • -
  • Misc: BinaryHeap
    • -
- -

When Should You Use Which Collection?

-

These are fairly high-level and quick break-downs of when each collection -should be considered. Detailed discussions of strengths and weaknesses of -individual collections can be found on their own documentation pages.

- -

Use a Vec when:

-
    -
  • You want to collect items up to be processed or sent elsewhere later, and -don't care about any properties of the actual values being stored.
    • -
  • You want a sequence of elements in a particular order, and will only be -appending to (or near) the end.
    • -
  • You want a stack.
    • -
  • You want a resizable array.
    • -
  • You want a heap-allocated array.
    • -
- -

Use a VecDeque when:

-
    -
  • You want a Vec that supports efficient insertion at both ends of the -sequence.
    • -
  • You want a queue.
    • -
  • You want a double-ended queue (deque).
    • -
- -

Use a LinkedList when:

-
    -
  • You want a Vec or VecDeque of unknown size, and can't tolerate -amortization.
    • -
  • You want to efficiently split and append lists.
    • -
  • You are absolutely certain you really, truly, want a doubly linked -list.
    • -
- -

Use a HashMap when:

-
    -
  • You want to associate arbitrary keys with an arbitrary value.
    • -
  • You want a cache.
    • -
  • You want a map, with no extra functionality.
    • -
- -

Use a BTreeMap when:

-
    -
  • You're interested in what the smallest or largest key-value pair is.
    • -
  • You want to find the largest or smallest key that is smaller or larger -than something.
    • -
  • You want to be able to get all of the entries in order on-demand.
    • -
  • You want a sorted map.
    • -
- -

Use the Set variant of any of these Maps when:

-
    -
  • You just want to remember which keys you've seen.
    • -
  • There is no meaningful value to associate with your keys.
    • -
  • You just want a set.
    • -
- -

Use a BinaryHeap when:

-
    -
  • You want to store a bunch of elements, but only ever want to process the -"biggest" or "most important" one at any given time.
    • -
  • You want a priority queue.
    • -
- -

Performance

-

Choosing the right collection for the job requires an understanding of what -each collection is good at. Here we briefly summarize the performance of -different collections for certain important operations. For further details, -see each type's documentation, and note that the names of actual methods may -differ from the tables below on certain collections.

- -

Throughout the documentation, we will follow a few conventions. For all -operations, the collection's size is denoted by n. If another collection is -involved in the operation, it contains m elements. Operations which have an -amortized cost are suffixed with a *. Operations with an expected -cost are suffixed with a ~.

- -

All amortized costs are for the potential need to resize when capacity is -exhausted. If a resize occurs it will take O(n) time. Our collections never -automatically shrink, so removal operations aren't amortized. Over a -sufficiently large series of operations, the average cost per operation will -deterministically equal the given cost.

- -

Only HashMap has expected costs, due to the probabilistic nature of hashing. -It is theoretically possible, though very unlikely, for HashMap to -experience worse performance.

- -

Sequences

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
get(i)insert(i)remove(i)appendsplit_off(i)
VecO(1)O(n-i)*O(n-i)O(m)*O(n-i)
VecDequeO(1)O(min(i, n-i))*O(min(i, n-i))O(m)*O(min(i, n-i))
LinkedListO(min(i, n-i))O(min(i, n-i))O(min(i, n-i))O(1)O(min(i, n-i))
- -

Note that where ties occur, Vec is generally going to be faster than VecDeque, and VecDeque -is generally going to be faster than LinkedList.

- -

Maps

-

For Sets, all operations have the cost of the equivalent Map operation.

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
getinsertremovepredecessorappend
HashMapO(1)~O(1)~*O(1)~N/AN/A
BTreeMapO(log n)O(log n)O(log n)O(log n)O(n+m)
- -

Correct and Efficient Usage of Collections

-

Of course, knowing which collection is the right one for the job doesn't -instantly permit you to use it correctly. Here are some quick tips for -efficient and correct usage of the standard collections in general. If -you're interested in how to use a specific collection in particular, consult -its documentation for detailed discussion and code examples.

- -

Capacity Management

-

Many collections provide several constructors and methods that refer to -"capacity". These collections are generally built on top of an array. -Optimally, this array would be exactly the right size to fit only the -elements stored in the collection, but for the collection to do this would -be very inefficient. If the backing array was exactly the right size at all -times, then every time an element is inserted, the collection would have to -grow the array to fit it. Due to the way memory is allocated and managed on -most computers, this would almost surely require allocating an entirely new -array and copying every single element from the old one into the new one. -Hopefully you can see that this wouldn't be very efficient to do on every -operation.

- -

Most collections therefore use an amortized allocation strategy. They -generally let themselves have a fair amount of unoccupied space so that they -only have to grow on occasion. When they do grow, they allocate a -substantially larger array to move the elements into so that it will take a -while for another grow to be required. While this strategy is great in -general, it would be even better if the collection never had to resize its -backing array. Unfortunately, the collection itself doesn't have enough -information to do this itself. Therefore, it is up to us programmers to give -it hints.

- -

Any with_capacity constructor will instruct the collection to allocate -enough space for the specified number of elements. Ideally this will be for -exactly that many elements, but some implementation details may prevent -this. Vec and VecDeque can be relied on to allocate exactly the -requested amount, though. Use with_capacity when you know exactly how many -elements will be inserted, or at least have a reasonable upper-bound on that -number.

- -

When anticipating a large influx of elements, the reserve family of -methods can be used to hint to the collection how much room it should make -for the coming items. As with with_capacity, the precise behavior of -these methods will be specific to the collection of interest.

- -

For optimal performance, collections will generally avoid shrinking -themselves. If you believe that a collection will not soon contain any more -elements, or just really need the memory, the shrink_to_fit method prompts -the collection to shrink the backing array to the minimum size capable of -holding its elements.

- -

Finally, if ever you're interested in what the actual capacity of the -collection is, most collections provide a capacity method to query this -information on demand. This can be useful for debugging purposes, or for -use with the reserve methods.

- -

Iterators

-

Iterators are a powerful and robust mechanism used throughout Rust's -standard libraries. Iterators provide a sequence of values in a generic, -safe, efficient and convenient way. The contents of an iterator are usually -lazily evaluated, so that only the values that are actually needed are -ever actually produced, and no allocation need be done to temporarily store -them. Iterators are primarily consumed using a for loop, although many -functions also take iterators where a collection or sequence of values is -desired.

- -

All of the standard collections provide several iterators for performing -bulk manipulation of their contents. The three primary iterators almost -every collection should provide are iter, iter_mut, and into_iter. -Some of these are not provided on collections where it would be unsound or -unreasonable to provide them.

- -

iter provides an iterator of immutable references to all the contents of a -collection in the most "natural" order. For sequence collections like Vec, -this means the items will be yielded in increasing order of index starting -at 0. For ordered collections like BTreeMap, this means that the items -will be yielded in sorted order. For unordered collections like HashMap, -the items will be yielded in whatever order the internal representation made -most convenient. This is great for reading through all the contents of the -collection.

- -
-let vec = vec![1, 2, 3, 4];
-for x in vec.iter() {
-   println!("vec contained {}", x);
-}
- -

iter_mut provides an iterator of mutable references in the same order as -iter. This is great for mutating all the contents of the collection.

- -
-let mut vec = vec![1, 2, 3, 4];
-for x in vec.iter_mut() {
-   *x += 1;
-}
- -

into_iter transforms the actual collection into an iterator over its -contents by-value. This is great when the collection itself is no longer -needed, and the values are needed elsewhere. Using extend with into_iter -is the main way that contents of one collection are moved into another. -extend automatically calls into_iter, and takes any T: IntoIterator. -Calling collect on an iterator itself is also a great way to convert one -collection into another. Both of these methods should internally use the -capacity management tools discussed in the previous section to do this as -efficiently as possible.

- -
-let mut vec1 = vec![1, 2, 3, 4];
-let vec2 = vec![10, 20, 30, 40];
-vec1.extend(vec2);
- -
-use std::collections::VecDeque;
-
-let vec = vec![1, 2, 3, 4];
-let buf: VecDeque<_> = vec.into_iter().collect();
- -

Iterators also provide a series of adapter methods for performing common -threads to sequences. Among the adapters are functional favorites like map, -fold, skip, and take. Of particular interest to collections is the -rev adapter, that reverses any iterator that supports this operation. Most -collections provide reversible iterators as the way to iterate over them in -reverse order.

- -
-let vec = vec![1, 2, 3, 4];
-for x in vec.iter().rev() {
-   println!("vec contained {}", x);
-}
- -

Several other collection methods also return iterators to yield a sequence -of results but avoid allocating an entire collection to store the result in. -This provides maximum flexibility as collect or extend can be called to -"pipe" the sequence into any collection if desired. Otherwise, the sequence -can be looped over with a for loop. The iterator can also be discarded -after partial use, preventing the computation of the unused items.

- -

Entries

-

The entry API is intended to provide an efficient mechanism for -manipulating the contents of a map conditionally on the presence of a key or -not. The primary motivating use case for this is to provide efficient -accumulator maps. For instance, if one wishes to maintain a count of the -number of times each key has been seen, they will have to perform some -conditional logic on whether this is the first time the key has been seen or -not. Normally, this would require a find followed by an insert, -effectively duplicating the search effort on each insertion.

- -

When a user calls map.entry(&key), the map will search for the key and -then yield a variant of the Entry enum.

- -

If a Vacant(entry) is yielded, then the key was not found. In this case -the only valid operation is to insert a value into the entry. When this is -done, the vacant entry is consumed and converted into a mutable reference to -the value that was inserted. This allows for further manipulation of the -value beyond the lifetime of the search itself. This is useful if complex -logic needs to be performed on the value regardless of whether the value was -just inserted.

- -

If an Occupied(entry) is yielded, then the key was found. In this case, -the user has several options: they can get, insert, or remove the -value of the occupied entry. Additionally, they can convert the occupied -entry into a mutable reference to its value, providing symmetry to the -vacant insert case.

- -

Examples

-

Here are the two primary ways in which entry is used. First, a simple -example where the logic performed on the values is trivial.

- -

Counting the number of times each character in a string occurs

-
-use std::collections::btree_map::BTreeMap;
-
-let mut count = BTreeMap::new();
-let message = "she sells sea shells by the sea shore";
-
-for c in message.chars() {
-    *count.entry(c).or_insert(0) += 1;
-}
-
-assert_eq!(count.get(&'s'), Some(&8));
-
-println!("Number of occurrences of each character");
-for (char, count) in &count {
-    println!("{}: {}", char, count);
-}
- -

When the logic to be performed on the value is more complex, we may simply -use the entry API to ensure that the value is initialized, and perform the -logic afterwards.

- -

Tracking the inebriation of customers at a bar

-
-use std::collections::btree_map::BTreeMap;
-
-// A client of the bar. They have a blood alcohol level.
-struct Person { blood_alcohol: f32 }
-
-// All the orders made to the bar, by client id.
-let orders = vec![1,2,1,2,3,4,1,2,2,3,4,1,1,1];
-
-// Our clients.
-let mut blood_alcohol = BTreeMap::new();
-
-for id in orders {
-    // If this is the first time we've seen this customer, initialize them
-    // with no blood alcohol. Otherwise, just retrieve them.
-    let person = blood_alcohol.entry(id).or_insert(Person { blood_alcohol: 0.0 });
-
-    // Reduce their blood alcohol level. It takes time to order and drink a beer!
-    person.blood_alcohol *= 0.9;
-
-    // Check if they're sober enough to have another beer.
-    if person.blood_alcohol > 0.3 {
-        // Too drunk... for now.
-        println!("Sorry {}, I have to cut you off", id);
-    } else {
-        // Have another!
-        person.blood_alcohol += 0.1;
-    }
-}
- -

Insert and complex keys

-

If we have a more complex key, calls to insert() will -not update the value of the key. For example:

- -
-use std::cmp::Ordering;
-use std::collections::BTreeMap;
-use std::hash::{Hash, Hasher};
-
-#[derive(Debug)]
-struct Foo {
-    a: u32,
-    b: &'static str,
-}
-
-// we will compare `Foo`s by their `a` value only.
-impl PartialEq for Foo {
-    fn eq(&self, other: &Self) -> bool { self.a == other.a }
-}
-
-impl Eq for Foo {}
-
-// we will hash `Foo`s by their `a` value only.
-impl Hash for Foo {
-    fn hash<H: Hasher>(&self, h: &mut H) { self.a.hash(h); }
-}
-
-impl PartialOrd for Foo {
-    fn partial_cmp(&self, other: &Self) -> Option<Ordering> { self.a.partial_cmp(&other.a) }
-}
-
-impl Ord for Foo {
-    fn cmp(&self, other: &Self) -> Ordering { self.a.cmp(&other.a) }
-}
-
-let mut map = BTreeMap::new();
-map.insert(Foo { a: 1, b: "baz" }, 99);
-
-// We already have a Foo with an a of 1, so this will be updating the value.
-map.insert(Foo { a: 1, b: "xyz" }, 100);
-
-// The value has been updated...
-assert_eq!(map.values().next().unwrap(), &100);
-
-// ...but the key hasn't changed. b is still "baz", not "xyz".
-assert_eq!(map.keys().next().unwrap().b, "baz");
-

Modules

- - - - - - - - - - - - - - - - - - - - - - - - - - - - -
binary_heap -

A priority queue implemented with a binary heap.

-
btree_map - -
btree_set - -
hash_map -

A hashmap

-
hash_set -

A hashset

-
linked_list -

A doubly-linked list with owned nodes.

-
vec_deque -

VecDeque is a double-ended queue, which is implemented with the help of a -growing ring buffer.

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - -
BTreeMap -

A map based on a B-Tree.

-
BTreeSet -

A set based on a B-Tree.

-
BinaryHeap -

A priority queue implemented with a binary heap.

-
HashMap -

A hash map implementation which uses linear probing with Robin -Hood bucket stealing.

-
HashSet -

An implementation of a hash set using the underlying representation of a -HashMap where the value is ().

-
LinkedList -

A doubly-linked list.

-
VecDeque -

VecDeque is a growable ring buffer, which can be used as a double-ended -queue efficiently.

-

Enums

- - - - -
Bound - [Unstable]

An endpoint of a range of keys.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/linked_list/index.html b/doc/bitflags/__core/collections/linked_list/index.html deleted file mode 100644 index cc96a75c..00000000 --- a/doc/bitflags/__core/collections/linked_list/index.html +++ /dev/null @@ -1,159 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::linked_list - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::collections::linked_list - - [−] - - [src]

-

A doubly-linked list with owned nodes.

- -

The LinkedList allows pushing and popping elements at either end and is thus -efficiently usable as a double-ended queue.

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - -
IntoIter -

An iterator over the items of a LinkedList.

-
Iter -

An iterator over references to the items of a LinkedList.

-
IterMut -

An iterator over mutable references to the items of a LinkedList.

-
LinkedList -

A doubly-linked list.

-
BackPlace - [Unstable]

A place for insertion at the back of a LinkedList.

-
FrontPlace - [Unstable]

A place for insertion at the front of a LinkedList.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/linked_list/sidebar-items.js b/doc/bitflags/__core/collections/linked_list/sidebar-items.js deleted file mode 100644 index 7c595148..00000000 --- a/doc/bitflags/__core/collections/linked_list/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["BackPlace","A place for insertion at the back of a `LinkedList`."],["FrontPlace","A place for insertion at the front of a `LinkedList`."],["IntoIter","An iterator over the items of a `LinkedList`."],["Iter","An iterator over references to the items of a `LinkedList`."],["IterMut","An iterator over mutable references to the items of a `LinkedList`."],["LinkedList","A doubly-linked list."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/collections/linked_list/struct.BackPlace.html b/doc/bitflags/__core/collections/linked_list/struct.BackPlace.html deleted file mode 100644 index af0041b0..00000000 --- a/doc/bitflags/__core/collections/linked_list/struct.BackPlace.html +++ /dev/null @@ -1,129 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::linked_list::BackPlace - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::linked_list::BackPlace - - [−] - - [src]

-
#[must_use = "places do nothing unless written to with `<-` syntax"]
-pub struct BackPlace<'a, T> where T: 'a {
-    // some fields omitted
-}
Unstable (collection_placement)

: struct name and placement protocol are subject to change

-

A place for insertion at the back of a LinkedList.

- -

See LinkedList::back_place for details.

-

Trait Implementations

impl<'a, T> Placer<T> for BackPlace<'a, T>

type Place = BackPlace<'a, T>

-
Unstable (collection_placement)

: placement protocol is subject to change

-

fn make_place(self) -> BackPlace<'a, T>

-
Unstable (collection_placement)

: placement protocol is subject to change

-

impl<'a, T> Place<T> for BackPlace<'a, T>

fn pointer(&mut self) -> *mut T

-
Unstable (collection_placement)

: placement protocol is subject to change

-

impl<'a, T> InPlace<T> for BackPlace<'a, T>

type Owner = ()

-
Unstable (collection_placement)

: placement protocol is subject to change

-

unsafe fn finalize(self)

-
Unstable (collection_placement)

: placement protocol is subject to change

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/linked_list/struct.FrontPlace.html b/doc/bitflags/__core/collections/linked_list/struct.FrontPlace.html deleted file mode 100644 index 03cd1594..00000000 --- a/doc/bitflags/__core/collections/linked_list/struct.FrontPlace.html +++ /dev/null @@ -1,129 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::linked_list::FrontPlace - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::linked_list::FrontPlace - - [−] - - [src]

-
#[must_use = "places do nothing unless written to with `<-` syntax"]
-pub struct FrontPlace<'a, T> where T: 'a {
-    // some fields omitted
-}
Unstable (collection_placement)

: struct name and placement protocol are subject to change

-

A place for insertion at the front of a LinkedList.

- -

See LinkedList::front_place for details.

-

Trait Implementations

impl<'a, T> Placer<T> for FrontPlace<'a, T>

type Place = FrontPlace<'a, T>

-
Unstable (collection_placement)

: placement protocol is subject to change

-

fn make_place(self) -> FrontPlace<'a, T>

-
Unstable (collection_placement)

: placement protocol is subject to change

-

impl<'a, T> Place<T> for FrontPlace<'a, T>

fn pointer(&mut self) -> *mut T

-
Unstable (collection_placement)

: placement protocol is subject to change

-

impl<'a, T> InPlace<T> for FrontPlace<'a, T>

type Owner = ()

-
Unstable (collection_placement)

: placement protocol is subject to change

-

unsafe fn finalize(self)

-
Unstable (collection_placement)

: placement protocol is subject to change

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/linked_list/struct.IntoIter.html b/doc/bitflags/__core/collections/linked_list/struct.IntoIter.html deleted file mode 100644 index 626c757d..00000000 --- a/doc/bitflags/__core/collections/linked_list/struct.IntoIter.html +++ /dev/null @@ -1,167 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::linked_list::IntoIter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::linked_list::IntoIter - - [−] - - [src]

-
pub struct IntoIter<T> {
-    // some fields omitted
-}
1.0.0

An iterator over the items of a LinkedList.

-

Trait Implementations

impl<A> Iterator for IntoIter<A>

type Item = A

-

fn next(&mut self) -> Option<A>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<A> DoubleEndedIterator for IntoIter<A>

fn next_back(&mut self) -> Option<A>

-

impl<A> ExactSizeIterator for IntoIter<A>

fn len(&self) -> usize

-

Derived Implementations

impl<T> Clone for IntoIter<T> where T: Clone

fn clone(&self) -> IntoIter<T>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/linked_list/struct.Iter.html b/doc/bitflags/__core/collections/linked_list/struct.Iter.html deleted file mode 100644 index d0d30731..00000000 --- a/doc/bitflags/__core/collections/linked_list/struct.Iter.html +++ /dev/null @@ -1,167 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::linked_list::Iter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::linked_list::Iter - - [−] - - [src]

-
pub struct Iter<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

An iterator over references to the items of a LinkedList.

-

Trait Implementations

impl<'a, T> Clone for Iter<'a, T>

fn clone(&self) -> Iter<'a, T>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, A> Iterator for Iter<'a, A>

type Item = &'a A

-

fn next(&mut self) -> Option<&'a A>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, A> DoubleEndedIterator for Iter<'a, A>

fn next_back(&mut self) -> Option<&'a A>

-

impl<'a, A> ExactSizeIterator for Iter<'a, A>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/linked_list/struct.IterMut.html b/doc/bitflags/__core/collections/linked_list/struct.IterMut.html deleted file mode 100644 index 0cf216ec..00000000 --- a/doc/bitflags/__core/collections/linked_list/struct.IterMut.html +++ /dev/null @@ -1,205 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::linked_list::IterMut - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::linked_list::IterMut - - [−] - - [src]

-
pub struct IterMut<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

An iterator over mutable references to the items of a LinkedList.

-

Methods

impl<'a, A> IterMut<'a, A>

fn insert_next(&mut self, elt: A)

-
Unstable (linked_list_extras)

: this is probably better handled by a cursor type -- we'll see

-

Inserts elt just after the element most recently returned by .next(). -The inserted element does not appear in the iteration.

- -

Examples

-
-#![feature(linked_list_extras)]
-
-use std::collections::LinkedList;
-
-let mut list: LinkedList<_> = vec![1, 3, 4].into_iter().collect();
-
-{
-    let mut it = list.iter_mut();
-    assert_eq!(it.next().unwrap(), &1);
-    // insert `2` after `1`
-    it.insert_next(2);
-}
-{
-    let vec: Vec<_> = list.into_iter().collect();
-    assert_eq!(vec, [1, 2, 3, 4]);
-}
-

fn peek_next(&mut self) -> Option<&mut A>

-
Unstable (linked_list_extras)

: this is probably better handled by a cursor type -- we'll see

-

Provides a reference to the next element, without changing the iterator.

- -

Examples

-
-#![feature(linked_list_extras)]
-
-use std::collections::LinkedList;
-
-let mut list: LinkedList<_> = vec![1, 2, 3].into_iter().collect();
-
-let mut it = list.iter_mut();
-assert_eq!(it.next().unwrap(), &1);
-assert_eq!(it.peek_next().unwrap(), &2);
-// We just peeked at 2, so it was not consumed from the iterator.
-assert_eq!(it.next().unwrap(), &2);
-

Trait Implementations

impl<'a, A> Iterator for IterMut<'a, A>

type Item = &'a mut A

-

fn next(&mut self) -> Option<&'a mut A>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, A> DoubleEndedIterator for IterMut<'a, A>

fn next_back(&mut self) -> Option<&'a mut A>

-

impl<'a, A> ExactSizeIterator for IterMut<'a, A>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/linked_list/struct.LinkedList.html b/doc/bitflags/__core/collections/linked_list/struct.LinkedList.html deleted file mode 100644 index 2a14453e..00000000 --- a/doc/bitflags/__core/collections/linked_list/struct.LinkedList.html +++ /dev/null @@ -1,418 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::linked_list::LinkedList - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::linked_list::LinkedList - - [−] - - [src]

-
pub struct LinkedList<T> {
-    // some fields omitted
-}
1.0.0

A doubly-linked list.

-

Methods

impl<T> LinkedList<T>

fn new() -> LinkedList<T>

-

Creates an empty LinkedList.

-

fn append(&mut self, other: &mut LinkedList<T>)

-

Moves all elements from other to the end of the list.

- -

This reuses all the nodes from other and moves them into self. After -this operation, other becomes empty.

- -

This operation should compute in O(1) time and O(1) memory.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut a = LinkedList::new();
-let mut b = LinkedList::new();
-a.push_back(1);
-a.push_back(2);
-b.push_back(3);
-b.push_back(4);
-
-a.append(&mut b);
-
-for e in &a {
-    println!("{}", e); // prints 1, then 2, then 3, then 4
-}
-println!("{}", b.len()); // prints 0
-

fn iter(&self) -> Iter<T>

-

Provides a forward iterator.

-

fn iter_mut(&mut self) -> IterMut<T>

-

Provides a forward iterator with mutable references.

-

fn is_empty(&self) -> bool

-

Returns true if the LinkedList is empty.

- -

This operation should compute in O(1) time.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-assert!(dl.is_empty());
-
-dl.push_front("foo");
-assert!(!dl.is_empty());
-

fn len(&self) -> usize

-

Returns the length of the LinkedList.

- -

This operation should compute in O(1) time.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-
-dl.push_front(2);
-assert_eq!(dl.len(), 1);
-
-dl.push_front(1);
-assert_eq!(dl.len(), 2);
-
-dl.push_back(3);
-assert_eq!(dl.len(), 3);
-
-

fn clear(&mut self)

-

Removes all elements from the LinkedList.

- -

This operation should compute in O(n) time.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-
-dl.push_front(2);
-dl.push_front(1);
-assert_eq!(dl.len(), 2);
-assert_eq!(dl.front(), Some(&1));
-
-dl.clear();
-assert_eq!(dl.len(), 0);
-assert_eq!(dl.front(), None);
-
-

fn contains(&self, x: &T) -> bool where T: PartialEq<T>

-
Unstable (linked_list_contains)

: recently added

-

Returns true if the LinkedList contains an element equal to the -given value.

-

fn front(&self) -> Option<&T>

-

Provides a reference to the front element, or None if the list is -empty.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-assert_eq!(dl.front(), None);
-
-dl.push_front(1);
-assert_eq!(dl.front(), Some(&1));
-
-

fn front_mut(&mut self) -> Option<&mut T>

-

Provides a mutable reference to the front element, or None if the list -is empty.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-assert_eq!(dl.front(), None);
-
-dl.push_front(1);
-assert_eq!(dl.front(), Some(&1));
-
-match dl.front_mut() {
-    None => {},
-    Some(x) => *x = 5,
-}
-assert_eq!(dl.front(), Some(&5));
-
-

fn back(&self) -> Option<&T>

-

Provides a reference to the back element, or None if the list is -empty.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-assert_eq!(dl.back(), None);
-
-dl.push_back(1);
-assert_eq!(dl.back(), Some(&1));
-
-

fn back_mut(&mut self) -> Option<&mut T>

-

Provides a mutable reference to the back element, or None if the list -is empty.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-assert_eq!(dl.back(), None);
-
-dl.push_back(1);
-assert_eq!(dl.back(), Some(&1));
-
-match dl.back_mut() {
-    None => {},
-    Some(x) => *x = 5,
-}
-assert_eq!(dl.back(), Some(&5));
-
-

fn push_front(&mut self, elt: T)

-

Adds an element first in the list.

- -

This operation should compute in O(1) time.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-
-dl.push_front(2);
-assert_eq!(dl.front().unwrap(), &2);
-
-dl.push_front(1);
-assert_eq!(dl.front().unwrap(), &1);
-
-

fn pop_front(&mut self) -> Option<T>

-

Removes the first element and returns it, or None if the list is -empty.

- -

This operation should compute in O(1) time.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut d = LinkedList::new();
-assert_eq!(d.pop_front(), None);
-
-d.push_front(1);
-d.push_front(3);
-assert_eq!(d.pop_front(), Some(3));
-assert_eq!(d.pop_front(), Some(1));
-assert_eq!(d.pop_front(), None);
-
-

fn push_back(&mut self, elt: T)

-

Appends an element to the back of a list

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut d = LinkedList::new();
-d.push_back(1);
-d.push_back(3);
-assert_eq!(3, *d.back().unwrap());
-

fn pop_back(&mut self) -> Option<T>

-

Removes the last element from a list and returns it, or None if -it is empty.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut d = LinkedList::new();
-assert_eq!(d.pop_back(), None);
-d.push_back(1);
-d.push_back(3);
-assert_eq!(d.pop_back(), Some(3));
-

fn split_off(&mut self, at: usize) -> LinkedList<T>

-

Splits the list into two at the given index. Returns everything after the given index, -including the index.

- -

Panics

-

Panics if at > len.

- -

This operation should compute in O(n) time.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut d = LinkedList::new();
-
-d.push_front(1);
-d.push_front(2);
-d.push_front(3);
-
-let mut splitted = d.split_off(2);
-
-assert_eq!(splitted.pop_front(), Some(1));
-assert_eq!(splitted.pop_front(), None);
-

fn front_place(&mut self) -> FrontPlace<T>

-
Unstable (collection_placement)

: method name and placement protocol are subject to change

-

Returns a place for insertion at the front of the list.

- -

Using this method with placement syntax is equivalent to push_front, but may be more efficient.

- -

Examples

-
-#![feature(collection_placement)]
-#![feature(placement_in_syntax)]
-
-use std::collections::LinkedList;
-
-let mut list = LinkedList::new();
-list.front_place() <- 2;
-list.front_place() <- 4;
-assert!(list.iter().eq(&[4, 2]));
-

fn back_place(&mut self) -> BackPlace<T>

-
Unstable (collection_placement)

: method name and placement protocol are subject to change

-

Returns a place for insertion at the back of the list.

- -

Using this method with placement syntax is equivalent to push_back, -but may be more efficient.

- -

Examples

-
-#![feature(collection_placement)]
-#![feature(placement_in_syntax)]
-
-use std::collections::LinkedList;
-
-let mut list = LinkedList::new();
-list.back_place() <- 2;
-list.back_place() <- 4;
-assert!(list.iter().eq(&[2, 4]));
-

Trait Implementations

impl<T> Default for LinkedList<T>

fn default() -> LinkedList<T>

-

impl<T> Drop for LinkedList<T>

fn drop(&mut self)

-

impl<A> FromIterator<A> for LinkedList<A>

fn from_iter<T>(iter: T) -> LinkedList<A> where T: IntoIterator<Item=A>

-

impl<T> IntoIterator for LinkedList<T>

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Consumes the list into an iterator yielding elements by value.

-

impl<'a, T> IntoIterator for &'a LinkedList<T>

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<'a, T> IntoIterator for &'a mut LinkedList<T>

type Item = &'a mut T

-

type IntoIter = IterMut<'a, T>

-

fn into_iter(self) -> IterMut<'a, T>

-

impl<A> Extend<A> for LinkedList<A>

fn extend<T>(&mut self, iter: T) where T: IntoIterator<Item=A>

-

impl<'a, T> Extend<&'a T> for LinkedList<T> where T: Copy + 'a1.2.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a T>

-

impl<A> PartialEq<LinkedList<A>> for LinkedList<A> where A: PartialEq<A>

fn eq(&self, other: &LinkedList<A>) -> bool

-

fn ne(&self, other: &LinkedList<A>) -> bool

-

impl<A> Eq for LinkedList<A> where A: Eq

impl<A> PartialOrd<LinkedList<A>> for LinkedList<A> where A: PartialOrd<A>

fn partial_cmp(&self, other: &LinkedList<A>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<A> Ord for LinkedList<A> where A: Ord

fn cmp(&self, other: &LinkedList<A>) -> Ordering

-

impl<A> Clone for LinkedList<A> where A: Clone

fn clone(&self) -> LinkedList<A>

-

fn clone_from(&mut self, source: &Self)

-

impl<A> Debug for LinkedList<A> where A: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<A> Hash for LinkedList<A> where A: Hash

fn hash<H>(&self, state: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/sidebar-items.js b/doc/bitflags/__core/collections/sidebar-items.js deleted file mode 100644 index 3155bdc2..00000000 --- a/doc/bitflags/__core/collections/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["Bound","An endpoint of a range of keys."]],"mod":[["binary_heap","A priority queue implemented with a binary heap."],["btree_map",""],["btree_set",""],["hash_map","A hashmap"],["hash_set","A hashset"],["linked_list","A doubly-linked list with owned nodes."],["vec_deque","VecDeque is a double-ended queue, which is implemented with the help of a growing ring buffer."]],"struct":[["BTreeMap","A map based on a B-Tree."],["BTreeSet","A set based on a B-Tree."],["BinaryHeap","A priority queue implemented with a binary heap."],["HashMap","A hash map implementation which uses linear probing with Robin Hood bucket stealing."],["HashSet","An implementation of a hash set using the underlying representation of a HashMap where the value is ()."],["LinkedList","A doubly-linked list."],["VecDeque","`VecDeque` is a growable ring buffer, which can be used as a double-ended queue efficiently."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/collections/struct.BTreeMap.html b/doc/bitflags/__core/collections/struct.BTreeMap.html deleted file mode 100644 index 886a930e..00000000 --- a/doc/bitflags/__core/collections/struct.BTreeMap.html +++ /dev/null @@ -1,588 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::BTreeMap - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::BTreeMap - - [−] - - [src]

-
pub struct BTreeMap<K, V> {
-    // some fields omitted
-}
1.0.0

A map based on a B-Tree.

- -

B-Trees represent a fundamental compromise between cache-efficiency and actually minimizing -the amount of work performed in a search. In theory, a binary search tree (BST) is the optimal -choice for a sorted map, as a perfectly balanced BST performs the theoretical minimum amount of -comparisons necessary to find an element (log2n). However, in practice the way this -is done is very inefficient for modern computer architectures. In particular, every element -is stored in its own individually heap-allocated node. This means that every single insertion -triggers a heap-allocation, and every single comparison should be a cache-miss. Since these -are both notably expensive things to do in practice, we are forced to at very least reconsider -the BST strategy.

- -

A B-Tree instead makes each node contain B-1 to 2B-1 elements in a contiguous array. By doing -this, we reduce the number of allocations by a factor of B, and improve cache efficiency in -searches. However, this does mean that searches will have to do more comparisons on average. -The precise number of comparisons depends on the node search strategy used. For optimal cache -efficiency, one could search the nodes linearly. For optimal comparisons, one could search -the node using binary search. As a compromise, one could also perform a linear search -that initially only checks every ith element for some choice of i.

- -

Currently, our implementation simply performs naive linear search. This provides excellent -performance on small nodes of elements which are cheap to compare. However in the future we -would like to further explore choosing the optimal search strategy based on the choice of B, -and possibly other factors. Using linear search, searching for a random element is expected -to take O(B logBn) comparisons, which is generally worse than a BST. In practice, -however, performance is excellent.

- -

It is a logic error for a key to be modified in such a way that the key's ordering relative to -any other key, as determined by the Ord trait, changes while it is in the map. This is -normally only possible through Cell, RefCell, global state, I/O, or unsafe code.

- -

Examples

-
-use std::collections::BTreeMap;
-
-// type inference lets us omit an explicit type signature (which
-// would be `BTreeMap<&str, &str>` in this example).
-let mut movie_reviews = BTreeMap::new();
-
-// review some books.
-movie_reviews.insert("Office Space",       "Deals with real issues in the workplace.");
-movie_reviews.insert("Pulp Fiction",       "Masterpiece.");
-movie_reviews.insert("The Godfather",      "Very enjoyable.");
-movie_reviews.insert("The Blues Brothers", "Eye lyked it alot.");
-
-// check for a specific one.
-if !movie_reviews.contains_key("Les Misérables") {
-    println!("We've got {} reviews, but Les Misérables ain't one.",
-             movie_reviews.len());
-}
-
-// oops, this review has a lot of spelling mistakes, let's delete it.
-movie_reviews.remove("The Blues Brothers");
-
-// look up the values associated with some keys.
-let to_find = ["Up!", "Office Space"];
-for book in &to_find {
-    match movie_reviews.get(book) {
-       Some(review) => println!("{}: {}", book, review),
-       None => println!("{} is unreviewed.", book)
-    }
-}
-
-// iterate over everything.
-for (movie, review) in &movie_reviews {
-    println!("{}: \"{}\"", movie, review);
-}
- -

BTreeMap also implements an Entry API, which allows -for more complex methods of getting, setting, updating and removing keys and -their values:

- -
-use std::collections::BTreeMap;
-
-// type inference lets us omit an explicit type signature (which
-// would be `BTreeMap<&str, u8>` in this example).
-let mut player_stats = BTreeMap::new();
-
-fn random_stat_buff() -> u8 {
-    // could actually return some random value here - let's just return
-    // some fixed value for now
-    42
-}
-
-// insert a key only if it doesn't already exist
-player_stats.entry("health").or_insert(100);
-
-// insert a key using a function that provides a new value only if it
-// doesn't already exist
-player_stats.entry("defence").or_insert_with(random_stat_buff);
-
-// update a key, guarding against the key possibly not being set
-let stat = player_stats.entry("attack").or_insert(100);
-*stat += random_stat_buff();
-

Methods

impl<K, V> BTreeMap<K, V> where K: Ord

fn new() -> BTreeMap<K, V>

-

Makes a new empty BTreeMap with a reasonable choice for B.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-
-// entries can now be inserted into the empty map
-map.insert(1, "a");
-

fn clear(&mut self)

-

Clears the map, removing all values.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut a = BTreeMap::new();
-a.insert(1, "a");
-a.clear();
-assert!(a.is_empty());
-

fn get<Q>(&self, key: &Q) -> Option<&V> where Q: Ord + ?Sized, K: Borrow<Q>

-

Returns a reference to the value corresponding to the key.

- -

The key may be any borrowed form of the map's key type, but the ordering -on the borrowed form must match the ordering on the key type.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-map.insert(1, "a");
-assert_eq!(map.get(&1), Some(&"a"));
-assert_eq!(map.get(&2), None);
-

fn contains_key<Q>(&self, key: &Q) -> bool where K: Borrow<Q>, Q: Ord + ?Sized

-

Returns true if the map contains a value for the specified key.

- -

The key may be any borrowed form of the map's key type, but the ordering -on the borrowed form must match the ordering on the key type.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-map.insert(1, "a");
-assert_eq!(map.contains_key(&1), true);
-assert_eq!(map.contains_key(&2), false);
-

fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V> where Q: Ord + ?Sized, K: Borrow<Q>

-

Returns a mutable reference to the value corresponding to the key.

- -

The key may be any borrowed form of the map's key type, but the ordering -on the borrowed form must match the ordering on the key type.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-map.insert(1, "a");
-if let Some(x) = map.get_mut(&1) {
-    *x = "b";
-}
-assert_eq!(map[&1], "b");
-

fn insert(&mut self, key: K, value: V) -> Option<V>

-

Inserts a key-value pair into the map.

- -

If the map did not have this key present, None is returned.

- -

If the map did have this key present, the value is updated, and the old -value is returned. The key is not updated, though; this matters for -types that can be == without being identical. See the module-level -documentation for more.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-assert_eq!(map.insert(37, "a"), None);
-assert_eq!(map.is_empty(), false);
-
-map.insert(37, "b");
-assert_eq!(map.insert(37, "c"), Some("b"));
-assert_eq!(map[&37], "c");
-

fn remove<Q>(&mut self, key: &Q) -> Option<V> where Q: Ord + ?Sized, K: Borrow<Q>

-

Removes a key from the map, returning the value at the key if the key -was previously in the map.

- -

The key may be any borrowed form of the map's key type, but the ordering -on the borrowed form must match the ordering on the key type.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-map.insert(1, "a");
-assert_eq!(map.remove(&1), Some("a"));
-assert_eq!(map.remove(&1), None);
-

fn append(&mut self, other: &mut BTreeMap<K, V>)

-
Unstable (btree_append)

: recently added as part of collections reform 2

-

Moves all elements from other into Self, leaving other empty.

- -

Examples

-
-#![feature(btree_append)]
-use std::collections::BTreeMap;
-
-let mut a = BTreeMap::new();
-a.insert(1, "a");
-a.insert(2, "b");
-a.insert(3, "c");
-
-let mut b = BTreeMap::new();
-b.insert(3, "d");
-b.insert(4, "e");
-b.insert(5, "f");
-
-a.append(&mut b);
-
-assert_eq!(a.len(), 5);
-assert_eq!(b.len(), 0);
-
-assert_eq!(a[&1], "a");
-assert_eq!(a[&2], "b");
-assert_eq!(a[&3], "d");
-assert_eq!(a[&4], "e");
-assert_eq!(a[&5], "f");
-

fn range<Min, Max>(&self, min: Bound<&Min>, max: Bound<&Max>) -> Range<K, V> where Min: Ord + ?Sized, K: Borrow<Min> + Borrow<Max>, Max: Ord + ?Sized

-
Unstable (btree_range)

: matches collection reform specification, waiting for dust to settle

-

Constructs a double-ended iterator over a sub-range of elements in the map, starting -at min, and ending at max. If min is Unbounded, then it will be treated as "negative -infinity", and if max is Unbounded, then it will be treated as "positive infinity". -Thus range(Unbounded, Unbounded) will yield the whole collection.

- -

Examples

-

Basic usage:

- -
-#![feature(btree_range, collections_bound)]
-
-use std::collections::BTreeMap;
-use std::collections::Bound::{Included, Unbounded};
-
-let mut map = BTreeMap::new();
-map.insert(3, "a");
-map.insert(5, "b");
-map.insert(8, "c");
-for (&key, &value) in map.range(Included(&4), Included(&8)) {
-    println!("{}: {}", key, value);
-}
-assert_eq!(Some((&5, &"b")), map.range(Included(&4), Unbounded).next());
-

fn range_mut<Min, Max>(&mut self, min: Bound<&Min>, max: Bound<&Max>) -> RangeMut<K, V> where Min: Ord + ?Sized, K: Borrow<Min> + Borrow<Max>, Max: Ord + ?Sized

-
Unstable (btree_range)

: matches collection reform specification, waiting for dust to settle

-

Constructs a mutable double-ended iterator over a sub-range of elements in the map, starting -at min, and ending at max. If min is Unbounded, then it will be treated as "negative -infinity", and if max is Unbounded, then it will be treated as "positive infinity". -Thus range(Unbounded, Unbounded) will yield the whole collection.

- -

Examples

-

Basic usage:

- -
-#![feature(btree_range, collections_bound)]
-
-use std::collections::BTreeMap;
-use std::collections::Bound::{Included, Excluded};
-
-let mut map: BTreeMap<&str, i32> = ["Alice", "Bob", "Carol", "Cheryl"].iter()
-                                                                      .map(|&s| (s, 0))
-                                                                      .collect();
-for (_, balance) in map.range_mut(Included("B"), Excluded("Cheryl")) {
-    *balance += 100;
-}
-for (name, balance) in &map {
-    println!("{} => {}", name, balance);
-}
-

fn entry(&mut self, key: K) -> Entry<K, V>

-

Gets the given key's corresponding entry in the map for in-place manipulation.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut count: BTreeMap<&str, usize> = BTreeMap::new();
-
-// count the number of occurrences of letters in the vec
-for x in vec!["a","b","a","c","a","b"] {
-    *count.entry(x).or_insert(0) += 1;
-}
-
-assert_eq!(count["a"], 3);
-

impl<K, V> BTreeMap<K, V>

fn iter(&self) -> Iter<K, V>

-

Gets an iterator over the entries of the map, sorted by key.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-map.insert(3, "c");
-map.insert(2, "b");
-map.insert(1, "a");
-
-for (key, value) in map.iter() {
-    println!("{}: {}", key, value);
-}
-
-let (first_key, first_value) = map.iter().next().unwrap();
-assert_eq!((*first_key, *first_value), (1, "a"));
-

fn iter_mut(&mut self) -> IterMut<K, V>

-

Gets a mutable iterator over the entries of the map, sorted by key.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut map = BTreeMap::new();
-map.insert("a", 1);
-map.insert("b", 2);
-map.insert("c", 3);
-
-// add 10 to the value if the key isn't "a"
-for (key, value) in map.iter_mut() {
-    if key != &"a" {
-        *value += 10;
-    }
-}
-

fn keys(&'a self) -> Keys<'a, K, V>

-

Gets an iterator over the keys of the map, in sorted order.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut a = BTreeMap::new();
-a.insert(2, "b");
-a.insert(1, "a");
-
-let keys: Vec<_> = a.keys().cloned().collect();
-assert_eq!(keys, [1, 2]);
-

fn values(&'a self) -> Values<'a, K, V>

-

Gets an iterator over the values of the map, in order by key.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut a = BTreeMap::new();
-a.insert(1, "hello");
-a.insert(2, "goodbye");
-
-let values: Vec<&str> = a.values().cloned().collect();
-assert_eq!(values, ["hello", "goodbye"]);
-

fn values_mut(&'a mut self) -> ValuesMut<'a, K, V>

-
Unstable (map_values_mut)

: recently added

-

Gets a mutable iterator over the values of the map, in order by key.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut a = BTreeMap::new();
-a.insert(1, String::from("hello"));
-a.insert(2, String::from("goodbye"));
-
-for value in a.values_mut() {
-    value.push_str("!");
-}
-
-let values: Vec<String> = a.values().cloned().collect();
-assert_eq!(values, [String::from("hello!"),
-                    String::from("goodbye!")]);
-

fn len(&self) -> usize

-

Returns the number of elements in the map.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut a = BTreeMap::new();
-assert_eq!(a.len(), 0);
-a.insert(1, "a");
-assert_eq!(a.len(), 1);
-

fn is_empty(&self) -> bool

-

Returns true if the map contains no elements.

- -

Examples

-

Basic usage:

- -
-use std::collections::BTreeMap;
-
-let mut a = BTreeMap::new();
-assert!(a.is_empty());
-a.insert(1, "a");
-assert!(!a.is_empty());
-

Trait Implementations

impl<K, V> Drop for BTreeMap<K, V>

fn drop(&mut self)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> Clone for BTreeMap<K, V> where K: Clone, V: Clone

fn clone(&self) -> BTreeMap<K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, K, V> IntoIterator for &'a BTreeMap<K, V> where K: 'a, V: 'a

type Item = (&'a K, &'a V)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

type IntoIter = Iter<'a, K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn into_iter(self) -> Iter<'a, K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<'a, K, V> IntoIterator for &'a mut BTreeMap<K, V> where V: 'a, K: 'a

type Item = (&'a K, &'a mut V)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

type IntoIter = IterMut<'a, K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn into_iter(self) -> IterMut<'a, K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> IntoIterator for BTreeMap<K, V>

type Item = (K, V)

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

type IntoIter = IntoIter<K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn into_iter(self) -> IntoIter<K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> FromIterator<(K, V)> for BTreeMap<K, V> where K: Ord

fn from_iter<T>(iter: T) -> BTreeMap<K, V> where T: IntoIterator<Item=(K, V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> Extend<(K, V)> for BTreeMap<K, V> where K: Ord

fn extend<T>(&mut self, iter: T) where T: IntoIterator<Item=(K, V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<'a, K, V> Extend<(&'a K, &'a V)> for BTreeMap<K, V> where K: Copy + Ord, V: Copy

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=(&'a K, &'a V)>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> Hash for BTreeMap<K, V> where K: Hash, V: Hash

fn hash<H>(&self, state: &mut H) where H: Hasher

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<K, V> Default for BTreeMap<K, V> where K: Ord

fn default() -> BTreeMap<K, V>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> PartialEq<BTreeMap<K, V>> for BTreeMap<K, V> where K: PartialEq<K>, V: PartialEq<V>

fn eq(&self, other: &BTreeMap<K, V>) -> bool

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn ne(&self, other: &Rhs) -> bool

-

impl<K, V> Eq for BTreeMap<K, V> where K: Eq, V: Eq

impl<K, V> PartialOrd<BTreeMap<K, V>> for BTreeMap<K, V> where K: PartialOrd<K>, V: PartialOrd<V>

fn partial_cmp(&self, other: &BTreeMap<K, V>) -> Option<Ordering>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<K, V> Ord for BTreeMap<K, V> where K: Ord, V: Ord

fn cmp(&self, other: &BTreeMap<K, V>) -> Ordering

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<K, V> Debug for BTreeMap<K, V> where V: Debug, K: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

impl<'a, K, Q, V> Index<&'a Q> for BTreeMap<K, V> where Q: Ord + ?Sized, K: Ord + Borrow<Q>

type Output = V

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-

fn index(&self, key: &Q) -> &V

-
Unstable (collections)

: library is unlikely to be stabilized with the current layout and name, use std::collections instead

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/struct.BTreeSet.html b/doc/bitflags/__core/collections/struct.BTreeSet.html deleted file mode 100644 index 8760918b..00000000 --- a/doc/bitflags/__core/collections/struct.BTreeSet.html +++ /dev/null @@ -1,524 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::BTreeSet - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::BTreeSet - - [−] - - [src]

-
pub struct BTreeSet<T> {
-    // some fields omitted
-}
1.0.0

A set based on a B-Tree.

- -

See BTreeMap's documentation for a detailed discussion of this collection's performance -benefits and drawbacks.

- -

It is a logic error for an item to be modified in such a way that the item's ordering relative -to any other item, as determined by the Ord trait, changes while it is in the set. This is -normally only possible through Cell, RefCell, global state, I/O, or unsafe code.

- -

Examples

-
-use std::collections::BTreeSet;
-
-// Type inference lets us omit an explicit type signature (which
-// would be `BTreeSet<&str>` in this example).
-let mut books = BTreeSet::new();
-
-// Add some books.
-books.insert("A Dance With Dragons");
-books.insert("To Kill a Mockingbird");
-books.insert("The Odyssey");
-books.insert("The Great Gatsby");
-
-// Check for a specific one.
-if !books.contains("The Winds of Winter") {
-    println!("We have {} books, but The Winds of Winter ain't one.",
-             books.len());
-}
-
-// Remove a book.
-books.remove("The Odyssey");
-
-// Iterate over everything.
-for book in &books {
-    println!("{}", book);
-}
-

Methods

impl<T> BTreeSet<T> where T: Ord

fn new() -> BTreeSet<T>

-

Makes a new BTreeSet with a reasonable choice of B.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut set: BTreeSet<i32> = BTreeSet::new();
-

impl<T> BTreeSet<T>

fn iter(&self) -> Iter<T>

-

Gets an iterator over the BTreeSet's contents.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let set: BTreeSet<usize> = [1, 2, 3, 4].iter().cloned().collect();
-
-for x in set.iter() {
-    println!("{}", x);
-}
-
-let v: Vec<_> = set.iter().cloned().collect();
-assert_eq!(v, [1, 2, 3, 4]);
-

impl<T> BTreeSet<T> where T: Ord

fn range<Min, Max>(&'a self, min: Bound<&Min>, max: Bound<&Max>) -> Range<'a, T> where Min: Ord + ?Sized, Max: Ord + ?Sized, T: Borrow<Min> + Borrow<Max>

-
Unstable (btree_range)

: matches collection reform specification, waiting for dust to settle

-

Constructs a double-ended iterator over a sub-range of elements in the set, starting -at min, and ending at max. If min is Unbounded, then it will be treated as "negative -infinity", and if max is Unbounded, then it will be treated as "positive infinity". -Thus range(Unbounded, Unbounded) will yield the whole collection.

- -

Examples

-
-#![feature(btree_range, collections_bound)]
-
-use std::collections::BTreeSet;
-use std::collections::Bound::{Included, Unbounded};
-
-let mut set = BTreeSet::new();
-set.insert(3);
-set.insert(5);
-set.insert(8);
-for &elem in set.range(Included(&4), Included(&8)) {
-    println!("{}", elem);
-}
-assert_eq!(Some(&5), set.range(Included(&4), Unbounded).next());
-

impl<T> BTreeSet<T> where T: Ord

fn difference(&'a self, other: &'a BTreeSet<T>) -> Difference<'a, T>

-

Visits the values representing the difference, in ascending order.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut a = BTreeSet::new();
-a.insert(1);
-a.insert(2);
-
-let mut b = BTreeSet::new();
-b.insert(2);
-b.insert(3);
-
-let diff: Vec<_> = a.difference(&b).cloned().collect();
-assert_eq!(diff, [1]);
-

fn symmetric_difference(&'a self, other: &'a BTreeSet<T>) -> SymmetricDifference<'a, T>

-

Visits the values representing the symmetric difference, in ascending order.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut a = BTreeSet::new();
-a.insert(1);
-a.insert(2);
-
-let mut b = BTreeSet::new();
-b.insert(2);
-b.insert(3);
-
-let sym_diff: Vec<_> = a.symmetric_difference(&b).cloned().collect();
-assert_eq!(sym_diff, [1, 3]);
-

fn intersection(&'a self, other: &'a BTreeSet<T>) -> Intersection<'a, T>

-

Visits the values representing the intersection, in ascending order.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut a = BTreeSet::new();
-a.insert(1);
-a.insert(2);
-
-let mut b = BTreeSet::new();
-b.insert(2);
-b.insert(3);
-
-let intersection: Vec<_> = a.intersection(&b).cloned().collect();
-assert_eq!(intersection, [2]);
-

fn union(&'a self, other: &'a BTreeSet<T>) -> Union<'a, T>

-

Visits the values representing the union, in ascending order.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut a = BTreeSet::new();
-a.insert(1);
-
-let mut b = BTreeSet::new();
-b.insert(2);
-
-let union: Vec<_> = a.union(&b).cloned().collect();
-assert_eq!(union, [1, 2]);
-

fn len(&self) -> usize

-

Returns the number of elements in the set.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut v = BTreeSet::new();
-assert_eq!(v.len(), 0);
-v.insert(1);
-assert_eq!(v.len(), 1);
-

fn is_empty(&self) -> bool

-

Returns true if the set contains no elements.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut v = BTreeSet::new();
-assert!(v.is_empty());
-v.insert(1);
-assert!(!v.is_empty());
-

fn clear(&mut self)

-

Clears the set, removing all values.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut v = BTreeSet::new();
-v.insert(1);
-v.clear();
-assert!(v.is_empty());
-

fn contains<Q>(&self, value: &Q) -> bool where T: Borrow<Q>, Q: Ord + ?Sized

-

Returns true if the set contains a value.

- -

The value may be any borrowed form of the set's value type, -but the ordering on the borrowed form must match the -ordering on the value type.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let set: BTreeSet<_> = [1, 2, 3].iter().cloned().collect();
-assert_eq!(set.contains(&1), true);
-assert_eq!(set.contains(&4), false);
-

fn get<Q>(&self, value: &Q) -> Option<&T> where T: Borrow<Q>, Q: Ord + ?Sized1.9.0

-

Returns a reference to the value in the set, if any, that is equal to the given value.

- -

The value may be any borrowed form of the set's value type, -but the ordering on the borrowed form must match the -ordering on the value type.

-

fn is_disjoint(&self, other: &BTreeSet<T>) -> bool

-

Returns true if the set has no elements in common with other. -This is equivalent to checking for an empty intersection.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let a: BTreeSet<_> = [1, 2, 3].iter().cloned().collect();
-let mut b = BTreeSet::new();
-
-assert_eq!(a.is_disjoint(&b), true);
-b.insert(4);
-assert_eq!(a.is_disjoint(&b), true);
-b.insert(1);
-assert_eq!(a.is_disjoint(&b), false);
-

fn is_subset(&self, other: &BTreeSet<T>) -> bool

-

Returns true if the set is a subset of another.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let sup: BTreeSet<_> = [1, 2, 3].iter().cloned().collect();
-let mut set = BTreeSet::new();
-
-assert_eq!(set.is_subset(&sup), true);
-set.insert(2);
-assert_eq!(set.is_subset(&sup), true);
-set.insert(4);
-assert_eq!(set.is_subset(&sup), false);
-

fn is_superset(&self, other: &BTreeSet<T>) -> bool

-

Returns true if the set is a superset of another.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let sub: BTreeSet<_> = [1, 2].iter().cloned().collect();
-let mut set = BTreeSet::new();
-
-assert_eq!(set.is_superset(&sub), false);
-
-set.insert(0);
-set.insert(1);
-assert_eq!(set.is_superset(&sub), false);
-
-set.insert(2);
-assert_eq!(set.is_superset(&sub), true);
-

fn insert(&mut self, value: T) -> bool

-

Adds a value to the set.

- -

If the set did not have a value present, true is returned.

- -

If the set did have this key present, false is returned, and the -entry is not updated. See the module-level documentation for more.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut set = BTreeSet::new();
-
-assert_eq!(set.insert(2), true);
-assert_eq!(set.insert(2), false);
-assert_eq!(set.len(), 1);
-

fn replace(&mut self, value: T) -> Option<T>1.9.0

-

Adds a value to the set, replacing the existing value, if any, that is equal to the given -one. Returns the replaced value.

-

fn remove<Q>(&mut self, value: &Q) -> bool where T: Borrow<Q>, Q: Ord + ?Sized

-

Removes a value from the set. Returns true if the value was -present in the set.

- -

The value may be any borrowed form of the set's value type, -but the ordering on the borrowed form must match the -ordering on the value type.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let mut set = BTreeSet::new();
-
-set.insert(2);
-assert_eq!(set.remove(&2), true);
-assert_eq!(set.remove(&2), false);
-

fn take<Q>(&mut self, value: &Q) -> Option<T> where T: Borrow<Q>, Q: Ord + ?Sized1.9.0

-

Removes and returns the value in the set, if any, that is equal to the given one.

- -

The value may be any borrowed form of the set's value type, -but the ordering on the borrowed form must match the -ordering on the value type.

-

fn append(&mut self, other: &mut BTreeSet<T>)

-
Unstable (btree_append)

: recently added as part of collections reform 2

-

Moves all elements from other into Self, leaving other empty.

- -

Examples

-
-#![feature(btree_append)]
-use std::collections::BTreeSet;
-
-let mut a = BTreeSet::new();
-a.insert(1);
-a.insert(2);
-a.insert(3);
-
-let mut b = BTreeSet::new();
-b.insert(3);
-b.insert(4);
-b.insert(5);
-
-a.append(&mut b);
-
-assert_eq!(a.len(), 5);
-assert_eq!(b.len(), 0);
-
-assert!(a.contains(&1));
-assert!(a.contains(&2));
-assert!(a.contains(&3));
-assert!(a.contains(&4));
-assert!(a.contains(&5));
-

Trait Implementations

impl<T> FromIterator<T> for BTreeSet<T> where T: Ord

fn from_iter<I>(iter: I) -> BTreeSet<T> where I: IntoIterator<Item=T>

-

impl<T> IntoIterator for BTreeSet<T>

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Gets an iterator for moving out the BtreeSet's contents.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let set: BTreeSet<usize> = [1, 2, 3, 4].iter().cloned().collect();
-
-let v: Vec<_> = set.into_iter().collect();
-assert_eq!(v, [1, 2, 3, 4]);
-

impl<'a, T> IntoIterator for &'a BTreeSet<T>

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<T> Extend<T> for BTreeSet<T> where T: Ord

fn extend<Iter>(&mut self, iter: Iter) where Iter: IntoIterator<Item=T>

-

impl<'a, T> Extend<&'a T> for BTreeSet<T> where T: Copy + 'a + Ord1.2.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a T>

-

impl<T> Default for BTreeSet<T> where T: Ord

fn default() -> BTreeSet<T>

-

impl<'a, 'b, T> Sub<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone

type Output = BTreeSet<T>

-

fn sub(self, rhs: &BTreeSet<T>) -> BTreeSet<T>

-

Returns the difference of self and rhs as a new BTreeSet<T>.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let a: BTreeSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: BTreeSet<_> = vec![3, 4, 5].into_iter().collect();
-
-let result = &a - &b;
-let result_vec: Vec<_> = result.into_iter().collect();
-assert_eq!(result_vec, [1, 2]);
-

impl<'a, 'b, T> BitXor<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone

type Output = BTreeSet<T>

-

fn bitxor(self, rhs: &BTreeSet<T>) -> BTreeSet<T>

-

Returns the symmetric difference of self and rhs as a new BTreeSet<T>.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let a: BTreeSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: BTreeSet<_> = vec![2, 3, 4].into_iter().collect();
-
-let result = &a ^ &b;
-let result_vec: Vec<_> = result.into_iter().collect();
-assert_eq!(result_vec, [1, 4]);
-

impl<'a, 'b, T> BitAnd<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone

type Output = BTreeSet<T>

-

fn bitand(self, rhs: &BTreeSet<T>) -> BTreeSet<T>

-

Returns the intersection of self and rhs as a new BTreeSet<T>.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let a: BTreeSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: BTreeSet<_> = vec![2, 3, 4].into_iter().collect();
-
-let result = &a & &b;
-let result_vec: Vec<_> = result.into_iter().collect();
-assert_eq!(result_vec, [2, 3]);
-

impl<'a, 'b, T> BitOr<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone

type Output = BTreeSet<T>

-

fn bitor(self, rhs: &BTreeSet<T>) -> BTreeSet<T>

-

Returns the union of self and rhs as a new BTreeSet<T>.

- -

Examples

-
-use std::collections::BTreeSet;
-
-let a: BTreeSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: BTreeSet<_> = vec![3, 4, 5].into_iter().collect();
-
-let result = &a | &b;
-let result_vec: Vec<_> = result.into_iter().collect();
-assert_eq!(result_vec, [1, 2, 3, 4, 5]);
-

impl<T> Debug for BTreeSet<T> where T: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl<T> PartialOrd<BTreeSet<T>> for BTreeSet<T> where T: PartialOrd<T>

fn partial_cmp(&self, __arg_0: &BTreeSet<T>) -> Option<Ordering>

-

fn lt(&self, __arg_0: &BTreeSet<T>) -> bool

-

fn le(&self, __arg_0: &BTreeSet<T>) -> bool

-

fn gt(&self, __arg_0: &BTreeSet<T>) -> bool

-

fn ge(&self, __arg_0: &BTreeSet<T>) -> bool

-

impl<T> Ord for BTreeSet<T> where T: Ord

fn cmp(&self, __arg_0: &BTreeSet<T>) -> Ordering

-

impl<T> Eq for BTreeSet<T> where T: Eq

impl<T> PartialEq<BTreeSet<T>> for BTreeSet<T> where T: PartialEq<T>

fn eq(&self, __arg_0: &BTreeSet<T>) -> bool

-

fn ne(&self, __arg_0: &BTreeSet<T>) -> bool

-

impl<T> Hash for BTreeSet<T> where T: Hash

fn hash<__HT>(&self, __arg_0: &mut __HT) where __HT: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<T> Clone for BTreeSet<T> where T: Clone

fn clone(&self) -> BTreeSet<T>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/struct.BinaryHeap.html b/doc/bitflags/__core/collections/struct.BinaryHeap.html deleted file mode 100644 index 1cef3057..00000000 --- a/doc/bitflags/__core/collections/struct.BinaryHeap.html +++ /dev/null @@ -1,491 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::BinaryHeap - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::BinaryHeap - - [−] - - [src]

-
pub struct BinaryHeap<T> {
-    // some fields omitted
-}
1.0.0

A priority queue implemented with a binary heap.

- -

This will be a max-heap.

- -

It is a logic error for an item to be modified in such a way that the -item's ordering relative to any other item, as determined by the Ord -trait, changes while it is in the heap. This is normally only possible -through Cell, RefCell, global state, I/O, or unsafe code.

- -

Examples

-
-use std::collections::BinaryHeap;
-
-// Type inference lets us omit an explicit type signature (which
-// would be `BinaryHeap<i32>` in this example).
-let mut heap = BinaryHeap::new();
-
-// We can use peek to look at the next item in the heap. In this case,
-// there's no items in there yet so we get None.
-assert_eq!(heap.peek(), None);
-
-// Let's add some scores...
-heap.push(1);
-heap.push(5);
-heap.push(2);
-
-// Now peek shows the most important item in the heap.
-assert_eq!(heap.peek(), Some(&5));
-
-// We can check the length of a heap.
-assert_eq!(heap.len(), 3);
-
-// We can iterate over the items in the heap, although they are returned in
-// a random order.
-for x in &heap {
-    println!("{}", x);
-}
-
-// If we instead pop these scores, they should come back in order.
-assert_eq!(heap.pop(), Some(5));
-assert_eq!(heap.pop(), Some(2));
-assert_eq!(heap.pop(), Some(1));
-assert_eq!(heap.pop(), None);
-
-// We can clear the heap of any remaining items.
-heap.clear();
-
-// The heap should now be empty.
-assert!(heap.is_empty())
-

Methods

impl<T> BinaryHeap<T> where T: Ord

fn new() -> BinaryHeap<T>

-

Creates an empty BinaryHeap as a max-heap.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-heap.push(4);
-

fn with_capacity(capacity: usize) -> BinaryHeap<T>

-

Creates an empty BinaryHeap with a specific capacity. -This preallocates enough memory for capacity elements, -so that the BinaryHeap does not have to be reallocated -until it contains at least that many values.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::with_capacity(10);
-heap.push(4);
-

fn iter(&self) -> Iter<T>

-

Returns an iterator visiting all values in the underlying vector, in -arbitrary order.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let heap = BinaryHeap::from(vec![1, 2, 3, 4]);
-
-// Print 1, 2, 3, 4 in arbitrary order
-for x in heap.iter() {
-    println!("{}", x);
-}
-

fn peek(&self) -> Option<&T>

-

Returns the greatest item in the binary heap, or None if it is empty.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-assert_eq!(heap.peek(), None);
-
-heap.push(1);
-heap.push(5);
-heap.push(2);
-assert_eq!(heap.peek(), Some(&5));
-
-

fn capacity(&self) -> usize

-

Returns the number of elements the binary heap can hold without reallocating.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::with_capacity(100);
-assert!(heap.capacity() >= 100);
-heap.push(4);
-

fn reserve_exact(&mut self, additional: usize)

-

Reserves the minimum capacity for exactly additional more elements to be inserted in the -given BinaryHeap. Does nothing if the capacity is already sufficient.

- -

Note that the allocator may give the collection more space than it requests. Therefore -capacity can not be relied upon to be precisely minimal. Prefer reserve if future -insertions are expected.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-heap.reserve_exact(100);
-assert!(heap.capacity() >= 100);
-heap.push(4);
-

fn reserve(&mut self, additional: usize)

-

Reserves capacity for at least additional more elements to be inserted in the -BinaryHeap. The collection may reserve more space to avoid frequent reallocations.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-heap.reserve(100);
-assert!(heap.capacity() >= 100);
-heap.push(4);
-

fn shrink_to_fit(&mut self)

-

Discards as much additional capacity as possible.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap: BinaryHeap<i32> = BinaryHeap::with_capacity(100);
-
-assert!(heap.capacity() >= 100);
-heap.shrink_to_fit();
-assert!(heap.capacity() == 0);
-

fn pop(&mut self) -> Option<T>

-

Removes the greatest item from the binary heap and returns it, or None if it -is empty.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::from(vec![1, 3]);
-
-assert_eq!(heap.pop(), Some(3));
-assert_eq!(heap.pop(), Some(1));
-assert_eq!(heap.pop(), None);
-

fn push(&mut self, item: T)

-

Pushes an item onto the binary heap.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-heap.push(3);
-heap.push(5);
-heap.push(1);
-
-assert_eq!(heap.len(), 3);
-assert_eq!(heap.peek(), Some(&5));
-

fn push_pop(&mut self, item: T) -> T

-
Unstable (binary_heap_extras)

: needs to be audited

-

Pushes an item onto the binary heap, then pops the greatest item off the queue in -an optimized fashion.

- -

Examples

-

Basic usage:

- -
-#![feature(binary_heap_extras)]
-
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-heap.push(1);
-heap.push(5);
-
-assert_eq!(heap.push_pop(3), 5);
-assert_eq!(heap.push_pop(9), 9);
-assert_eq!(heap.len(), 2);
-assert_eq!(heap.peek(), Some(&3));
-

fn replace(&mut self, item: T) -> Option<T>

-
Unstable (binary_heap_extras)

: needs to be audited

-

Pops the greatest item off the binary heap, then pushes an item onto the queue in -an optimized fashion. The push is done regardless of whether the binary heap -was empty.

- -

Examples

-

Basic usage:

- -
-#![feature(binary_heap_extras)]
-
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-
-assert_eq!(heap.replace(1), None);
-assert_eq!(heap.replace(3), Some(1));
-assert_eq!(heap.len(), 1);
-assert_eq!(heap.peek(), Some(&3));
-

fn into_vec(self) -> Vec<T>1.5.0

-

Consumes the BinaryHeap and returns the underlying vector -in arbitrary order.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let heap = BinaryHeap::from(vec![1, 2, 3, 4, 5, 6, 7]);
-let vec = heap.into_vec();
-
-// Will print in some order
-for x in vec {
-    println!("{}", x);
-}
-

fn into_sorted_vec(self) -> Vec<T>1.5.0

-

Consumes the BinaryHeap and returns a vector in sorted -(ascending) order.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-
-let mut heap = BinaryHeap::from(vec![1, 2, 4, 5, 7]);
-heap.push(6);
-heap.push(3);
-
-let vec = heap.into_sorted_vec();
-assert_eq!(vec, [1, 2, 3, 4, 5, 6, 7]);
-

fn len(&self) -> usize

-

Returns the length of the binary heap.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let heap = BinaryHeap::from(vec![1, 3]);
-
-assert_eq!(heap.len(), 2);
-

fn is_empty(&self) -> bool

-

Checks if the binary heap is empty.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::new();
-
-assert!(heap.is_empty());
-
-heap.push(3);
-heap.push(5);
-heap.push(1);
-
-assert!(!heap.is_empty());
-

fn drain(&mut self) -> Drain<T>1.6.0

-

Clears the binary heap, returning an iterator over the removed elements.

- -

The elements are removed in arbitrary order.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::from(vec![1, 3]);
-
-assert!(!heap.is_empty());
-
-for x in heap.drain() {
-    println!("{}", x);
-}
-
-assert!(heap.is_empty());
-

fn clear(&mut self)

-

Drops all items from the binary heap.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let mut heap = BinaryHeap::from(vec![1, 3]);
-
-assert!(!heap.is_empty());
-
-heap.clear();
-
-assert!(heap.is_empty());
-

fn append(&mut self, other: &mut BinaryHeap<T>)

-
Unstable (binary_heap_append)

: needs to be audited

-

Moves all the elements of other into self, leaving other empty.

- -

Examples

-

Basic usage:

- -
-#![feature(binary_heap_append)]
-
-use std::collections::BinaryHeap;
-
-let v = vec![-10, 1, 2, 3, 3];
-let mut a = BinaryHeap::from(v);
-
-let v = vec![-20, 5, 43];
-let mut b = BinaryHeap::from(v);
-
-a.append(&mut b);
-
-assert_eq!(a.into_sorted_vec(), [-20, -10, 1, 2, 3, 3, 5, 43]);
-assert!(b.is_empty());
-

Trait Implementations

impl<T> Clone for BinaryHeap<T> where T: Clone

fn clone(&self) -> BinaryHeap<T>

-

fn clone_from(&mut self, source: &BinaryHeap<T>)

-

impl<T> Default for BinaryHeap<T> where T: Ord

fn default() -> BinaryHeap<T>

-

impl<T> Debug for BinaryHeap<T> where T: Ord + Debug1.4.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> From<Vec<T>> for BinaryHeap<T> where T: Ord

fn from(vec: Vec<T>) -> BinaryHeap<T>

-

impl<T> FromIterator<T> for BinaryHeap<T> where T: Ord

fn from_iter<I>(iter: I) -> BinaryHeap<T> where I: IntoIterator<Item=T>

-

impl<T> IntoIterator for BinaryHeap<T> where T: Ord

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Creates a consuming iterator, that is, one that moves each value out of -the binary heap in arbitrary order. The binary heap cannot be used -after calling this.

- -

Examples

-

Basic usage:

- -
-use std::collections::BinaryHeap;
-let heap = BinaryHeap::from(vec![1, 2, 3, 4]);
-
-// Print 1, 2, 3, 4 in arbitrary order
-for x in heap.into_iter() {
-    // x has type i32, not &i32
-    println!("{}", x);
-}
-

impl<'a, T> IntoIterator for &'a BinaryHeap<T> where T: Ord

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<T> Extend<T> for BinaryHeap<T> where T: Ord

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=T>

-

impl<'a, T> Extend<&'a T> for BinaryHeap<T> where T: Copy + 'a + Ord1.2.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a T>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/struct.HashMap.html b/doc/bitflags/__core/collections/struct.HashMap.html deleted file mode 100644 index f52cb28f..00000000 --- a/doc/bitflags/__core/collections/struct.HashMap.html +++ /dev/null @@ -1,615 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::HashMap - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::HashMap - - [−] - - [src]

-
pub struct HashMap<K, V, S = RandomState> {
-    // some fields omitted
-}
1.0.0

A hash map implementation which uses linear probing with Robin -Hood bucket stealing.

- -

The hashes are all keyed by the thread-local random number generator -on creation by default. This means that the ordering of the keys is -randomized, but makes the tables more resistant to -denial-of-service attacks (Hash DoS). This behavior can be -overridden with one of the constructors.

- -

It is required that the keys implement the Eq and Hash traits, although -this can frequently be achieved by using #[derive(PartialEq, Eq, Hash)]. -If you implement these yourself, it is important that the following -property holds:

- -
k1 == k2 -> hash(k1) == hash(k2)
-
- -

In other words, if two keys are equal, their hashes must be equal.

- -

It is a logic error for a key to be modified in such a way that the key's -hash, as determined by the Hash trait, or its equality, as determined by -the Eq trait, changes while it is in the map. This is normally only -possible through Cell, RefCell, global state, I/O, or unsafe code.

- -

Relevant papers/articles:

- -
    -
  1. Pedro Celis. "Robin Hood Hashing"
    2. -
  2. Emmanuel Goossaert. "Robin Hood -hashing"
    3. -
  3. Emmanuel Goossaert. "Robin Hood hashing: backward shift -deletion"
    4. -
- -

Examples

-
-use std::collections::HashMap;
-
-// type inference lets us omit an explicit type signature (which
-// would be `HashMap<&str, &str>` in this example).
-let mut book_reviews = HashMap::new();
-
-// review some books.
-book_reviews.insert("Adventures of Huckleberry Finn",    "My favorite book.");
-book_reviews.insert("Grimms' Fairy Tales",               "Masterpiece.");
-book_reviews.insert("Pride and Prejudice",               "Very enjoyable.");
-book_reviews.insert("The Adventures of Sherlock Holmes", "Eye lyked it alot.");
-
-// check for a specific one.
-if !book_reviews.contains_key("Les Misérables") {
-    println!("We've got {} reviews, but Les Misérables ain't one.",
-             book_reviews.len());
-}
-
-// oops, this review has a lot of spelling mistakes, let's delete it.
-book_reviews.remove("The Adventures of Sherlock Holmes");
-
-// look up the values associated with some keys.
-let to_find = ["Pride and Prejudice", "Alice's Adventure in Wonderland"];
-for book in &to_find {
-    match book_reviews.get(book) {
-        Some(review) => println!("{}: {}", book, review),
-        None => println!("{} is unreviewed.", book)
-    }
-}
-
-// iterate over everything.
-for (book, review) in &book_reviews {
-    println!("{}: \"{}\"", book, review);
-}
- -

HashMap also implements an Entry API, which allows -for more complex methods of getting, setting, updating and removing keys and -their values:

- -
-use std::collections::HashMap;
-
-// type inference lets us omit an explicit type signature (which
-// would be `HashMap<&str, u8>` in this example).
-let mut player_stats = HashMap::new();
-
-fn random_stat_buff() -> u8 {
-    // could actually return some random value here - let's just return
-    // some fixed value for now
-    42
-}
-
-// insert a key only if it doesn't already exist
-player_stats.entry("health").or_insert(100);
-
-// insert a key using a function that provides a new value only if it
-// doesn't already exist
-player_stats.entry("defence").or_insert_with(random_stat_buff);
-
-// update a key, guarding against the key possibly not being set
-let stat = player_stats.entry("attack").or_insert(100);
-*stat += random_stat_buff();
- -

The easiest way to use HashMap with a custom type as key is to derive Eq and Hash. -We must also derive PartialEq.

- -
-use std::collections::HashMap;
-
-#[derive(Hash, Eq, PartialEq, Debug)]
-struct Viking {
-    name: String,
-    country: String,
-}
-
-impl Viking {
-    /// Create a new Viking.
-    fn new(name: &str, country: &str) -> Viking {
-        Viking { name: name.to_string(), country: country.to_string() }
-    }
-}
-
-// Use a HashMap to store the vikings' health points.
-let mut vikings = HashMap::new();
-
-vikings.insert(Viking::new("Einar", "Norway"), 25);
-vikings.insert(Viking::new("Olaf", "Denmark"), 24);
-vikings.insert(Viking::new("Harald", "Iceland"), 12);
-
-// Use derived implementation to print the status of the vikings.
-for (viking, health) in &vikings {
-    println!("{:?} has {} hp", viking, health);
-}
-

Methods

impl<K, V> HashMap<K, V, RandomState> where K: Eq + Hash

fn new() -> HashMap<K, V, RandomState>

-

Creates an empty HashMap.

- -

Examples

-
-use std::collections::HashMap;
-let mut map: HashMap<&str, isize> = HashMap::new();
-

fn with_capacity(capacity: usize) -> HashMap<K, V, RandomState>

-

Creates an empty hash map with the given initial capacity.

- -

Examples

-
-use std::collections::HashMap;
-let mut map: HashMap<&str, isize> = HashMap::with_capacity(10);
-

impl<K, V, S> HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher

fn with_hasher(hash_builder: S) -> HashMap<K, V, S>1.7.0

-

Creates an empty hashmap which will use the given hash builder to hash -keys.

- -

The created map has the default initial capacity.

- -

Warning: hash_builder is normally randomly generated, and -is designed to allow HashMaps to be resistant to attacks that -cause many collisions and very poor performance. Setting it -manually using this function can expose a DoS attack vector.

- -

Examples

-
-use std::collections::HashMap;
-use std::collections::hash_map::RandomState;
-
-let s = RandomState::new();
-let mut map = HashMap::with_hasher(s);
-map.insert(1, 2);
-

fn with_capacity_and_hasher(capacity: usize, hash_builder: S) -> HashMap<K, V, S>1.7.0

-

Creates an empty HashMap with space for at least capacity -elements, using hasher to hash the keys.

- -

Warning: hasher is normally randomly generated, and -is designed to allow HashMaps to be resistant to attacks that -cause many collisions and very poor performance. Setting it -manually using this function can expose a DoS attack vector.

- -

Examples

-
-use std::collections::HashMap;
-use std::collections::hash_map::RandomState;
-
-let s = RandomState::new();
-let mut map = HashMap::with_capacity_and_hasher(10, s);
-map.insert(1, 2);
-

fn hasher(&self) -> &S1.9.0

-

Returns a reference to the map's hasher.

-

fn capacity(&self) -> usize

-

Returns the number of elements the map can hold without reallocating.

- -

This number is a lower bound; the HashMap<K, V> might be able to hold -more, but is guaranteed to be able to hold at least this many.

- -

Examples

-
-use std::collections::HashMap;
-let map: HashMap<isize, isize> = HashMap::with_capacity(100);
-assert!(map.capacity() >= 100);
-

fn reserve(&mut self, additional: usize)

-

Reserves capacity for at least additional more elements to be inserted -in the HashMap. The collection may reserve more space to avoid -frequent reallocations.

- -

Panics

-

Panics if the new allocation size overflows usize.

- -

Examples

-
-use std::collections::HashMap;
-let mut map: HashMap<&str, isize> = HashMap::new();
-map.reserve(10);
-

fn shrink_to_fit(&mut self)

-

Shrinks the capacity of the map as much as possible. It will drop -down as much as possible while maintaining the internal rules -and possibly leaving some space in accordance with the resize policy.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map: HashMap<isize, isize> = HashMap::with_capacity(100);
-map.insert(1, 2);
-map.insert(3, 4);
-assert!(map.capacity() >= 100);
-map.shrink_to_fit();
-assert!(map.capacity() >= 2);
-

fn keys(&self) -> Keys<K, V>

-

An iterator visiting all keys in arbitrary order. -Iterator element type is &'a K.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert("a", 1);
-map.insert("b", 2);
-map.insert("c", 3);
-
-for key in map.keys() {
-    println!("{}", key);
-}
-

fn values(&self) -> Values<K, V>

-

An iterator visiting all values in arbitrary order. -Iterator element type is &'a V.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert("a", 1);
-map.insert("b", 2);
-map.insert("c", 3);
-
-for val in map.values() {
-    println!("{}", val);
-}
-

fn values_mut(&'a mut self) -> ValuesMut<'a, K, V>

-
Unstable (map_values_mut)

: recently added

-

An iterator visiting all values mutably in arbitrary order. -Iterator element type is &'a mut V.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-
-map.insert("a", 1);
-map.insert("b", 2);
-map.insert("c", 3);
-
-for val in map.values_mut() {
-    *val = *val + 10;
-}
-
-for val in map.values() {
-    print!("{}", val);
-}
-

fn iter(&self) -> Iter<K, V>

-

An iterator visiting all key-value pairs in arbitrary order. -Iterator element type is (&'a K, &'a V).

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert("a", 1);
-map.insert("b", 2);
-map.insert("c", 3);
-
-for (key, val) in map.iter() {
-    println!("key: {} val: {}", key, val);
-}
-

fn iter_mut(&mut self) -> IterMut<K, V>

-

An iterator visiting all key-value pairs in arbitrary order, -with mutable references to the values. -Iterator element type is (&'a K, &'a mut V).

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert("a", 1);
-map.insert("b", 2);
-map.insert("c", 3);
-
-// Update all values
-for (_, val) in map.iter_mut() {
-    *val *= 2;
-}
-
-for (key, val) in &map {
-    println!("key: {} val: {}", key, val);
-}
-

fn entry(&mut self, key: K) -> Entry<K, V>

-

Gets the given key's corresponding entry in the map for in-place manipulation.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut letters = HashMap::new();
-
-for ch in "a short treatise on fungi".chars() {
-    let counter = letters.entry(ch).or_insert(0);
-    *counter += 1;
-}
-
-assert_eq!(letters[&'s'], 2);
-assert_eq!(letters[&'t'], 3);
-assert_eq!(letters[&'u'], 1);
-assert_eq!(letters.get(&'y'), None);
-

fn len(&self) -> usize

-

Returns the number of elements in the map.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut a = HashMap::new();
-assert_eq!(a.len(), 0);
-a.insert(1, "a");
-assert_eq!(a.len(), 1);
-

fn is_empty(&self) -> bool

-

Returns true if the map contains no elements.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut a = HashMap::new();
-assert!(a.is_empty());
-a.insert(1, "a");
-assert!(!a.is_empty());
-

fn drain(&mut self) -> Drain<K, V>1.6.0

-

Clears the map, returning all key-value pairs as an iterator. Keeps the -allocated memory for reuse.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut a = HashMap::new();
-a.insert(1, "a");
-a.insert(2, "b");
-
-for (k, v) in a.drain().take(1) {
-    assert!(k == 1 || k == 2);
-    assert!(v == "a" || v == "b");
-}
-
-assert!(a.is_empty());
-

fn clear(&mut self)

-

Clears the map, removing all key-value pairs. Keeps the allocated memory -for reuse.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut a = HashMap::new();
-a.insert(1, "a");
-a.clear();
-assert!(a.is_empty());
-

fn get<Q>(&self, k: &Q) -> Option<&V> where K: Borrow<Q>, Q: Hash + Eq + ?Sized

-

Returns a reference to the value corresponding to the key.

- -

The key may be any borrowed form of the map's key type, but -Hash and Eq on the borrowed form must match those for -the key type.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert(1, "a");
-assert_eq!(map.get(&1), Some(&"a"));
-assert_eq!(map.get(&2), None);
-

fn contains_key<Q>(&self, k: &Q) -> bool where K: Borrow<Q>, Q: Hash + Eq + ?Sized

-

Returns true if the map contains a value for the specified key.

- -

The key may be any borrowed form of the map's key type, but -Hash and Eq on the borrowed form must match those for -the key type.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert(1, "a");
-assert_eq!(map.contains_key(&1), true);
-assert_eq!(map.contains_key(&2), false);
-

fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V> where Q: Hash + Eq + ?Sized, K: Borrow<Q>

-

Returns a mutable reference to the value corresponding to the key.

- -

The key may be any borrowed form of the map's key type, but -Hash and Eq on the borrowed form must match those for -the key type.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert(1, "a");
-if let Some(x) = map.get_mut(&1) {
-    *x = "b";
-}
-assert_eq!(map[&1], "b");
-

fn insert(&mut self, k: K, v: V) -> Option<V>

-

Inserts a key-value pair into the map.

- -

If the map did not have this key present, None is returned.

- -

If the map did have this key present, the value is updated, and the old -value is returned. The key is not updated, though; this matters for -types that can be == without being identical. See the module-level -documentation for more.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-assert_eq!(map.insert(37, "a"), None);
-assert_eq!(map.is_empty(), false);
-
-map.insert(37, "b");
-assert_eq!(map.insert(37, "c"), Some("b"));
-assert_eq!(map[&37], "c");
-

fn remove<Q>(&mut self, k: &Q) -> Option<V> where K: Borrow<Q>, Q: Hash + Eq + ?Sized

-

Removes a key from the map, returning the value at the key if the key -was previously in the map.

- -

The key may be any borrowed form of the map's key type, but -Hash and Eq on the borrowed form must match those for -the key type.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert(1, "a");
-assert_eq!(map.remove(&1), Some("a"));
-assert_eq!(map.remove(&1), None);
-

Trait Implementations

impl<K, V, S> PartialEq<HashMap<K, V, S>> for HashMap<K, V, S> where S: BuildHasher, K: Eq + Hash, V: PartialEq<V>

fn eq(&self, other: &HashMap<K, V, S>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<K, V, S> Eq for HashMap<K, V, S> where K: Eq + Hash, V: Eq, S: BuildHasher

impl<K, V, S> Debug for HashMap<K, V, S> where V: Debug, K: Eq + Hash + Debug, S: BuildHasher

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<K, V, S> Default for HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher + Default

fn default() -> HashMap<K, V, S>

-

impl<'a, K, Q, V, S> Index<&'a Q> for HashMap<K, V, S> where Q: Eq + Hash + ?Sized, S: BuildHasher, K: Eq + Hash + Borrow<Q>

type Output = V

-

fn index(&self, index: &Q) -> &V

-

impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher

type Item = (&'a K, &'a V)

-

type IntoIter = Iter<'a, K, V>

-

fn into_iter(self) -> Iter<'a, K, V>

-

impl<'a, K, V, S> IntoIterator for &'a mut HashMap<K, V, S> where S: BuildHasher, K: Eq + Hash

type Item = (&'a K, &'a mut V)

-

type IntoIter = IterMut<'a, K, V>

-

fn into_iter(self) -> IterMut<'a, K, V>

-

impl<K, V, S> IntoIterator for HashMap<K, V, S> where S: BuildHasher, K: Eq + Hash

type Item = (K, V)

-

type IntoIter = IntoIter<K, V>

-

fn into_iter(self) -> IntoIter<K, V>

-

Creates a consuming iterator, that is, one that moves each key-value -pair out of the map in arbitrary order. The map cannot be used after -calling this.

- -

Examples

-
-use std::collections::HashMap;
-
-let mut map = HashMap::new();
-map.insert("a", 1);
-map.insert("b", 2);
-map.insert("c", 3);
-
-// Not possible with .iter()
-let vec: Vec<(&str, isize)> = map.into_iter().collect();
-

impl<K, V, S> FromIterator<(K, V)> for HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher + Default

fn from_iter<T>(iter: T) -> HashMap<K, V, S> where T: IntoIterator<Item=(K, V)>

-

impl<K, V, S> Extend<(K, V)> for HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher

fn extend<T>(&mut self, iter: T) where T: IntoIterator<Item=(K, V)>

-

impl<'a, K, V, S> Extend<(&'a K, &'a V)> for HashMap<K, V, S> where V: Copy, K: Eq + Hash + Copy, S: BuildHasher1.4.0

fn extend<T>(&mut self, iter: T) where T: IntoIterator<Item=(&'a K, &'a V)>

-

Derived Implementations

impl<K, V, S> Clone for HashMap<K, V, S> where S: Clone, V: Clone, K: Clone

fn clone(&self) -> HashMap<K, V, S>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/struct.HashSet.html b/doc/bitflags/__core/collections/struct.HashSet.html deleted file mode 100644 index 13ef0869..00000000 --- a/doc/bitflags/__core/collections/struct.HashSet.html +++ /dev/null @@ -1,618 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::HashSet - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::HashSet - - [−] - - [src]

-
pub struct HashSet<T, S = RandomState> {
-    // some fields omitted
-}
1.0.0

An implementation of a hash set using the underlying representation of a -HashMap where the value is ().

- -

As with the HashMap type, a HashSet requires that the elements -implement the Eq and Hash traits. This can frequently be achieved by -using #[derive(PartialEq, Eq, Hash)]. If you implement these yourself, -it is important that the following property holds:

- -
k1 == k2 -> hash(k1) == hash(k2)
-
- -

In other words, if two keys are equal, their hashes must be equal.

- -

It is a logic error for an item to be modified in such a way that the -item's hash, as determined by the Hash trait, or its equality, as -determined by the Eq trait, changes while it is in the set. This is -normally only possible through Cell, RefCell, global state, I/O, or -unsafe code.

- -

Examples

-
-use std::collections::HashSet;
-// Type inference lets us omit an explicit type signature (which
-// would be `HashSet<&str>` in this example).
-let mut books = HashSet::new();
-
-// Add some books.
-books.insert("A Dance With Dragons");
-books.insert("To Kill a Mockingbird");
-books.insert("The Odyssey");
-books.insert("The Great Gatsby");
-
-// Check for a specific one.
-if !books.contains("The Winds of Winter") {
-    println!("We have {} books, but The Winds of Winter ain't one.",
-             books.len());
-}
-
-// Remove a book.
-books.remove("The Odyssey");
-
-// Iterate over everything.
-for book in &books {
-    println!("{}", book);
-}
- -

The easiest way to use HashSet with a custom type is to derive -Eq and Hash. We must also derive PartialEq, this will in the -future be implied by Eq.

- -
-use std::collections::HashSet;
-#[derive(Hash, Eq, PartialEq, Debug)]
-struct Viking<'a> {
-    name: &'a str,
-    power: usize,
-}
-
-let mut vikings = HashSet::new();
-
-vikings.insert(Viking { name: "Einar", power: 9 });
-vikings.insert(Viking { name: "Einar", power: 9 });
-vikings.insert(Viking { name: "Olaf", power: 4 });
-vikings.insert(Viking { name: "Harald", power: 8 });
-
-// Use derived implementation to print the vikings.
-for x in &vikings {
-    println!("{:?}", x);
-}
-

Methods

impl<T> HashSet<T, RandomState> where T: Eq + Hash

fn new() -> HashSet<T, RandomState>

-

Creates an empty HashSet.

- -

Examples

-
-use std::collections::HashSet;
-let mut set: HashSet<i32> = HashSet::new();
-

fn with_capacity(capacity: usize) -> HashSet<T, RandomState>

-

Creates an empty HashSet with space for at least n elements in -the hash table.

- -

Examples

-
-use std::collections::HashSet;
-let mut set: HashSet<i32> = HashSet::with_capacity(10);
-

impl<T, S> HashSet<T, S> where S: BuildHasher, T: Eq + Hash

fn with_hasher(hasher: S) -> HashSet<T, S>1.7.0

-

Creates a new empty hash set which will use the given hasher to hash -keys.

- -

The hash set is also created with the default initial capacity.

- -

Warning: hasher is normally randomly generated, and -is designed to allow HashSets to be resistant to attacks that -cause many collisions and very poor performance. Setting it -manually using this function can expose a DoS attack vector.

- -

Examples

-
-use std::collections::HashSet;
-use std::collections::hash_map::RandomState;
-
-let s = RandomState::new();
-let mut set = HashSet::with_hasher(s);
-set.insert(2);
-

fn with_capacity_and_hasher(capacity: usize, hasher: S) -> HashSet<T, S>1.7.0

-

Creates an empty HashSet with space for at least capacity -elements in the hash table, using hasher to hash the keys.

- -

Warning: hasher is normally randomly generated, and -is designed to allow HashSets to be resistant to attacks that -cause many collisions and very poor performance. Setting it -manually using this function can expose a DoS attack vector.

- -

Examples

-
-use std::collections::HashSet;
-use std::collections::hash_map::RandomState;
-
-let s = RandomState::new();
-let mut set = HashSet::with_capacity_and_hasher(10, s);
-set.insert(1);
-

fn hasher(&self) -> &S1.9.0

-

Returns a reference to the set's hasher.

-

fn capacity(&self) -> usize

-

Returns the number of elements the set can hold without reallocating.

- -

Examples

-
-use std::collections::HashSet;
-let set: HashSet<i32> = HashSet::with_capacity(100);
-assert!(set.capacity() >= 100);
-

fn reserve(&mut self, additional: usize)

-

Reserves capacity for at least additional more elements to be inserted -in the HashSet. The collection may reserve more space to avoid -frequent reallocations.

- -

Panics

-

Panics if the new allocation size overflows usize.

- -

Examples

-
-use std::collections::HashSet;
-let mut set: HashSet<i32> = HashSet::new();
-set.reserve(10);
-

fn shrink_to_fit(&mut self)

-

Shrinks the capacity of the set as much as possible. It will drop -down as much as possible while maintaining the internal rules -and possibly leaving some space in accordance with the resize policy.

- -

Examples

-
-use std::collections::HashSet;
-
-let mut set = HashSet::with_capacity(100);
-set.insert(1);
-set.insert(2);
-assert!(set.capacity() >= 100);
-set.shrink_to_fit();
-assert!(set.capacity() >= 2);
-

fn iter(&self) -> Iter<T>

-

An iterator visiting all elements in arbitrary order. -Iterator element type is &'a T.

- -

Examples

-
-use std::collections::HashSet;
-let mut set = HashSet::new();
-set.insert("a");
-set.insert("b");
-
-// Will print in an arbitrary order.
-for x in set.iter() {
-    println!("{}", x);
-}
-

fn difference(&'a self, other: &'a HashSet<T, S>) -> Difference<'a, T, S>

-

Visit the values representing the difference.

- -

Examples

-
-use std::collections::HashSet;
-let a: HashSet<_> = [1, 2, 3].iter().cloned().collect();
-let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect();
-
-// Can be seen as `a - b`.
-for x in a.difference(&b) {
-    println!("{}", x); // Print 1
-}
-
-let diff: HashSet<_> = a.difference(&b).cloned().collect();
-assert_eq!(diff, [1].iter().cloned().collect());
-
-// Note that difference is not symmetric,
-// and `b - a` means something else:
-let diff: HashSet<_> = b.difference(&a).cloned().collect();
-assert_eq!(diff, [4].iter().cloned().collect());
-

fn symmetric_difference(&'a self, other: &'a HashSet<T, S>) -> SymmetricDifference<'a, T, S>

-

Visit the values representing the symmetric difference.

- -

Examples

-
-use std::collections::HashSet;
-let a: HashSet<_> = [1, 2, 3].iter().cloned().collect();
-let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect();
-
-// Print 1, 4 in arbitrary order.
-for x in a.symmetric_difference(&b) {
-    println!("{}", x);
-}
-
-let diff1: HashSet<_> = a.symmetric_difference(&b).cloned().collect();
-let diff2: HashSet<_> = b.symmetric_difference(&a).cloned().collect();
-
-assert_eq!(diff1, diff2);
-assert_eq!(diff1, [1, 4].iter().cloned().collect());
-

fn intersection(&'a self, other: &'a HashSet<T, S>) -> Intersection<'a, T, S>

-

Visit the values representing the intersection.

- -

Examples

-
-use std::collections::HashSet;
-let a: HashSet<_> = [1, 2, 3].iter().cloned().collect();
-let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect();
-
-// Print 2, 3 in arbitrary order.
-for x in a.intersection(&b) {
-    println!("{}", x);
-}
-
-let intersection: HashSet<_> = a.intersection(&b).cloned().collect();
-assert_eq!(intersection, [2, 3].iter().cloned().collect());
-

fn union(&'a self, other: &'a HashSet<T, S>) -> Union<'a, T, S>

-

Visit the values representing the union.

- -

Examples

-
-use std::collections::HashSet;
-let a: HashSet<_> = [1, 2, 3].iter().cloned().collect();
-let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect();
-
-// Print 1, 2, 3, 4 in arbitrary order.
-for x in a.union(&b) {
-    println!("{}", x);
-}
-
-let union: HashSet<_> = a.union(&b).cloned().collect();
-assert_eq!(union, [1, 2, 3, 4].iter().cloned().collect());
-

fn len(&self) -> usize

-

Returns the number of elements in the set.

- -

Examples

-
-use std::collections::HashSet;
-
-let mut v = HashSet::new();
-assert_eq!(v.len(), 0);
-v.insert(1);
-assert_eq!(v.len(), 1);
-

fn is_empty(&self) -> bool

-

Returns true if the set contains no elements.

- -

Examples

-
-use std::collections::HashSet;
-
-let mut v = HashSet::new();
-assert!(v.is_empty());
-v.insert(1);
-assert!(!v.is_empty());
-

fn drain(&mut self) -> Drain<T>1.6.0

-

Clears the set, returning all elements in an iterator.

-

fn clear(&mut self)

-

Clears the set, removing all values.

- -

Examples

-
-use std::collections::HashSet;
-
-let mut v = HashSet::new();
-v.insert(1);
-v.clear();
-assert!(v.is_empty());
-

fn contains<Q>(&self, value: &Q) -> bool where Q: Hash + Eq + ?Sized, T: Borrow<Q>

-

Returns true if the set contains a value.

- -

The value may be any borrowed form of the set's value type, but -Hash and Eq on the borrowed form must match those for -the value type.

- -

Examples

-
-use std::collections::HashSet;
-
-let set: HashSet<_> = [1, 2, 3].iter().cloned().collect();
-assert_eq!(set.contains(&1), true);
-assert_eq!(set.contains(&4), false);
-

fn get<Q>(&self, value: &Q) -> Option<&T> where T: Borrow<Q>, Q: Hash + Eq + ?Sized1.9.0

-

Returns a reference to the value in the set, if any, that is equal to the given value.

- -

The value may be any borrowed form of the set's value type, but -Hash and Eq on the borrowed form must match those for -the value type.

-

fn is_disjoint(&self, other: &HashSet<T, S>) -> bool

-

Returns true if the set has no elements in common with other. -This is equivalent to checking for an empty intersection.

- -

Examples

-
-use std::collections::HashSet;
-
-let a: HashSet<_> = [1, 2, 3].iter().cloned().collect();
-let mut b = HashSet::new();
-
-assert_eq!(a.is_disjoint(&b), true);
-b.insert(4);
-assert_eq!(a.is_disjoint(&b), true);
-b.insert(1);
-assert_eq!(a.is_disjoint(&b), false);
-

fn is_subset(&self, other: &HashSet<T, S>) -> bool

-

Returns true if the set is a subset of another.

- -

Examples

-
-use std::collections::HashSet;
-
-let sup: HashSet<_> = [1, 2, 3].iter().cloned().collect();
-let mut set = HashSet::new();
-
-assert_eq!(set.is_subset(&sup), true);
-set.insert(2);
-assert_eq!(set.is_subset(&sup), true);
-set.insert(4);
-assert_eq!(set.is_subset(&sup), false);
-

fn is_superset(&self, other: &HashSet<T, S>) -> bool

-

Returns true if the set is a superset of another.

- -

Examples

-
-use std::collections::HashSet;
-
-let sub: HashSet<_> = [1, 2].iter().cloned().collect();
-let mut set = HashSet::new();
-
-assert_eq!(set.is_superset(&sub), false);
-
-set.insert(0);
-set.insert(1);
-assert_eq!(set.is_superset(&sub), false);
-
-set.insert(2);
-assert_eq!(set.is_superset(&sub), true);
-

fn insert(&mut self, value: T) -> bool

-

Adds a value to the set.

- -

If the set did not have this value present, true is returned.

- -

If the set did have this value present, false is returned.

- -

Examples

-
-use std::collections::HashSet;
-
-let mut set = HashSet::new();
-
-assert_eq!(set.insert(2), true);
-assert_eq!(set.insert(2), false);
-assert_eq!(set.len(), 1);
-

fn replace(&mut self, value: T) -> Option<T>1.9.0

-

Adds a value to the set, replacing the existing value, if any, that is equal to the given -one. Returns the replaced value.

-

fn remove<Q>(&mut self, value: &Q) -> bool where T: Borrow<Q>, Q: Hash + Eq + ?Sized

-

Removes a value from the set. Returns true if the value was -present in the set.

- -

The value may be any borrowed form of the set's value type, but -Hash and Eq on the borrowed form must match those for -the value type.

- -

Examples

-
-use std::collections::HashSet;
-
-let mut set = HashSet::new();
-
-set.insert(2);
-assert_eq!(set.remove(&2), true);
-assert_eq!(set.remove(&2), false);
-

fn take<Q>(&mut self, value: &Q) -> Option<T> where Q: Hash + Eq + ?Sized, T: Borrow<Q>1.9.0

-

Removes and returns the value in the set, if any, that is equal to the given one.

- -

The value may be any borrowed form of the set's value type, but -Hash and Eq on the borrowed form must match those for -the value type.

-

Trait Implementations

impl<T, S> PartialEq<HashSet<T, S>> for HashSet<T, S> where S: BuildHasher, T: Eq + Hash

fn eq(&self, other: &HashSet<T, S>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<T, S> Eq for HashSet<T, S> where T: Eq + Hash, S: BuildHasher

impl<T, S> Debug for HashSet<T, S> where T: Eq + Hash + Debug, S: BuildHasher

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T, S> FromIterator<T> for HashSet<T, S> where T: Eq + Hash, S: BuildHasher + Default

fn from_iter<I>(iter: I) -> HashSet<T, S> where I: IntoIterator<Item=T>

-

impl<T, S> Extend<T> for HashSet<T, S> where S: BuildHasher, T: Eq + Hash

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=T>

-

impl<'a, T, S> Extend<&'a T> for HashSet<T, S> where S: BuildHasher, T: 'a + Eq + Hash + Copy1.4.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a T>

-

impl<T, S> Default for HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash

fn default() -> HashSet<T, S>

-

impl<'a, 'b, T, S> BitOr<&'b HashSet<T, S>> for &'a HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash + Clone

type Output = HashSet<T, S>

-

fn bitor(self, rhs: &HashSet<T, S>) -> HashSet<T, S>

-

Returns the union of self and rhs as a new HashSet<T, S>.

- -

Examples

-
-use std::collections::HashSet;
-
-let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: HashSet<_> = vec![3, 4, 5].into_iter().collect();
-
-let set = &a | &b;
-
-let mut i = 0;
-let expected = [1, 2, 3, 4, 5];
-for x in &set {
-    assert!(expected.contains(x));
-    i += 1;
-}
-assert_eq!(i, expected.len());
-

impl<'a, 'b, T, S> BitAnd<&'b HashSet<T, S>> for &'a HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash + Clone

type Output = HashSet<T, S>

-

fn bitand(self, rhs: &HashSet<T, S>) -> HashSet<T, S>

-

Returns the intersection of self and rhs as a new HashSet<T, S>.

- -

Examples

-
-use std::collections::HashSet;
-
-let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: HashSet<_> = vec![2, 3, 4].into_iter().collect();
-
-let set = &a & &b;
-
-let mut i = 0;
-let expected = [2, 3];
-for x in &set {
-    assert!(expected.contains(x));
-    i += 1;
-}
-assert_eq!(i, expected.len());
-

impl<'a, 'b, T, S> BitXor<&'b HashSet<T, S>> for &'a HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash + Clone

type Output = HashSet<T, S>

-

fn bitxor(self, rhs: &HashSet<T, S>) -> HashSet<T, S>

-

Returns the symmetric difference of self and rhs as a new HashSet<T, S>.

- -

Examples

-
-use std::collections::HashSet;
-
-let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: HashSet<_> = vec![3, 4, 5].into_iter().collect();
-
-let set = &a ^ &b;
-
-let mut i = 0;
-let expected = [1, 2, 4, 5];
-for x in &set {
-    assert!(expected.contains(x));
-    i += 1;
-}
-assert_eq!(i, expected.len());
-

impl<'a, 'b, T, S> Sub<&'b HashSet<T, S>> for &'a HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash + Clone

type Output = HashSet<T, S>

-

fn sub(self, rhs: &HashSet<T, S>) -> HashSet<T, S>

-

Returns the difference of self and rhs as a new HashSet<T, S>.

- -

Examples

-
-use std::collections::HashSet;
-
-let a: HashSet<_> = vec![1, 2, 3].into_iter().collect();
-let b: HashSet<_> = vec![3, 4, 5].into_iter().collect();
-
-let set = &a - &b;
-
-let mut i = 0;
-let expected = [1, 2];
-for x in &set {
-    assert!(expected.contains(x));
-    i += 1;
-}
-assert_eq!(i, expected.len());
-

impl<'a, T, S> IntoIterator for &'a HashSet<T, S> where S: BuildHasher, T: Eq + Hash

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<T, S> IntoIterator for HashSet<T, S> where T: Eq + Hash, S: BuildHasher

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Creates a consuming iterator, that is, one that moves each value out -of the set in arbitrary order. The set cannot be used after calling -this.

- -

Examples

-
-use std::collections::HashSet;
-let mut set = HashSet::new();
-set.insert("a".to_string());
-set.insert("b".to_string());
-
-// Not possible to collect to a Vec<String> with a regular `.iter()`.
-let v: Vec<String> = set.into_iter().collect();
-
-// Will print in an arbitrary order.
-for x in &v {
-    println!("{}", x);
-}
-

Derived Implementations

impl<T, S> Clone for HashSet<T, S> where T: Clone, S: Clone

fn clone(&self) -> HashSet<T, S>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/struct.LinkedList.html b/doc/bitflags/__core/collections/struct.LinkedList.html deleted file mode 100644 index 1849a3d6..00000000 --- a/doc/bitflags/__core/collections/struct.LinkedList.html +++ /dev/null @@ -1,418 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::LinkedList - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::LinkedList - - [−] - - [src]

-
pub struct LinkedList<T> {
-    // some fields omitted
-}
1.0.0

A doubly-linked list.

-

Methods

impl<T> LinkedList<T>

fn new() -> LinkedList<T>

-

Creates an empty LinkedList.

-

fn append(&mut self, other: &mut LinkedList<T>)

-

Moves all elements from other to the end of the list.

- -

This reuses all the nodes from other and moves them into self. After -this operation, other becomes empty.

- -

This operation should compute in O(1) time and O(1) memory.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut a = LinkedList::new();
-let mut b = LinkedList::new();
-a.push_back(1);
-a.push_back(2);
-b.push_back(3);
-b.push_back(4);
-
-a.append(&mut b);
-
-for e in &a {
-    println!("{}", e); // prints 1, then 2, then 3, then 4
-}
-println!("{}", b.len()); // prints 0
-

fn iter(&self) -> Iter<T>

-

Provides a forward iterator.

-

fn iter_mut(&mut self) -> IterMut<T>

-

Provides a forward iterator with mutable references.

-

fn is_empty(&self) -> bool

-

Returns true if the LinkedList is empty.

- -

This operation should compute in O(1) time.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-assert!(dl.is_empty());
-
-dl.push_front("foo");
-assert!(!dl.is_empty());
-

fn len(&self) -> usize

-

Returns the length of the LinkedList.

- -

This operation should compute in O(1) time.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-
-dl.push_front(2);
-assert_eq!(dl.len(), 1);
-
-dl.push_front(1);
-assert_eq!(dl.len(), 2);
-
-dl.push_back(3);
-assert_eq!(dl.len(), 3);
-
-

fn clear(&mut self)

-

Removes all elements from the LinkedList.

- -

This operation should compute in O(n) time.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-
-dl.push_front(2);
-dl.push_front(1);
-assert_eq!(dl.len(), 2);
-assert_eq!(dl.front(), Some(&1));
-
-dl.clear();
-assert_eq!(dl.len(), 0);
-assert_eq!(dl.front(), None);
-
-

fn contains(&self, x: &T) -> bool where T: PartialEq<T>

-
Unstable (linked_list_contains)

: recently added

-

Returns true if the LinkedList contains an element equal to the -given value.

-

fn front(&self) -> Option<&T>

-

Provides a reference to the front element, or None if the list is -empty.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-assert_eq!(dl.front(), None);
-
-dl.push_front(1);
-assert_eq!(dl.front(), Some(&1));
-
-

fn front_mut(&mut self) -> Option<&mut T>

-

Provides a mutable reference to the front element, or None if the list -is empty.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-assert_eq!(dl.front(), None);
-
-dl.push_front(1);
-assert_eq!(dl.front(), Some(&1));
-
-match dl.front_mut() {
-    None => {},
-    Some(x) => *x = 5,
-}
-assert_eq!(dl.front(), Some(&5));
-
-

fn back(&self) -> Option<&T>

-

Provides a reference to the back element, or None if the list is -empty.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-assert_eq!(dl.back(), None);
-
-dl.push_back(1);
-assert_eq!(dl.back(), Some(&1));
-
-

fn back_mut(&mut self) -> Option<&mut T>

-

Provides a mutable reference to the back element, or None if the list -is empty.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-assert_eq!(dl.back(), None);
-
-dl.push_back(1);
-assert_eq!(dl.back(), Some(&1));
-
-match dl.back_mut() {
-    None => {},
-    Some(x) => *x = 5,
-}
-assert_eq!(dl.back(), Some(&5));
-
-

fn push_front(&mut self, elt: T)

-

Adds an element first in the list.

- -

This operation should compute in O(1) time.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut dl = LinkedList::new();
-
-dl.push_front(2);
-assert_eq!(dl.front().unwrap(), &2);
-
-dl.push_front(1);
-assert_eq!(dl.front().unwrap(), &1);
-
-

fn pop_front(&mut self) -> Option<T>

-

Removes the first element and returns it, or None if the list is -empty.

- -

This operation should compute in O(1) time.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut d = LinkedList::new();
-assert_eq!(d.pop_front(), None);
-
-d.push_front(1);
-d.push_front(3);
-assert_eq!(d.pop_front(), Some(3));
-assert_eq!(d.pop_front(), Some(1));
-assert_eq!(d.pop_front(), None);
-
-

fn push_back(&mut self, elt: T)

-

Appends an element to the back of a list

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut d = LinkedList::new();
-d.push_back(1);
-d.push_back(3);
-assert_eq!(3, *d.back().unwrap());
-

fn pop_back(&mut self) -> Option<T>

-

Removes the last element from a list and returns it, or None if -it is empty.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut d = LinkedList::new();
-assert_eq!(d.pop_back(), None);
-d.push_back(1);
-d.push_back(3);
-assert_eq!(d.pop_back(), Some(3));
-

fn split_off(&mut self, at: usize) -> LinkedList<T>

-

Splits the list into two at the given index. Returns everything after the given index, -including the index.

- -

Panics

-

Panics if at > len.

- -

This operation should compute in O(n) time.

- -

Examples

-
-use std::collections::LinkedList;
-
-let mut d = LinkedList::new();
-
-d.push_front(1);
-d.push_front(2);
-d.push_front(3);
-
-let mut splitted = d.split_off(2);
-
-assert_eq!(splitted.pop_front(), Some(1));
-assert_eq!(splitted.pop_front(), None);
-

fn front_place(&mut self) -> FrontPlace<T>

-
Unstable (collection_placement)

: method name and placement protocol are subject to change

-

Returns a place for insertion at the front of the list.

- -

Using this method with placement syntax is equivalent to push_front, but may be more efficient.

- -

Examples

-
-#![feature(collection_placement)]
-#![feature(placement_in_syntax)]
-
-use std::collections::LinkedList;
-
-let mut list = LinkedList::new();
-list.front_place() <- 2;
-list.front_place() <- 4;
-assert!(list.iter().eq(&[4, 2]));
-

fn back_place(&mut self) -> BackPlace<T>

-
Unstable (collection_placement)

: method name and placement protocol are subject to change

-

Returns a place for insertion at the back of the list.

- -

Using this method with placement syntax is equivalent to push_back, -but may be more efficient.

- -

Examples

-
-#![feature(collection_placement)]
-#![feature(placement_in_syntax)]
-
-use std::collections::LinkedList;
-
-let mut list = LinkedList::new();
-list.back_place() <- 2;
-list.back_place() <- 4;
-assert!(list.iter().eq(&[2, 4]));
-

Trait Implementations

impl<T> Default for LinkedList<T>

fn default() -> LinkedList<T>

-

impl<T> Drop for LinkedList<T>

fn drop(&mut self)

-

impl<A> FromIterator<A> for LinkedList<A>

fn from_iter<T>(iter: T) -> LinkedList<A> where T: IntoIterator<Item=A>

-

impl<T> IntoIterator for LinkedList<T>

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Consumes the list into an iterator yielding elements by value.

-

impl<'a, T> IntoIterator for &'a LinkedList<T>

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<'a, T> IntoIterator for &'a mut LinkedList<T>

type Item = &'a mut T

-

type IntoIter = IterMut<'a, T>

-

fn into_iter(self) -> IterMut<'a, T>

-

impl<A> Extend<A> for LinkedList<A>

fn extend<T>(&mut self, iter: T) where T: IntoIterator<Item=A>

-

impl<'a, T> Extend<&'a T> for LinkedList<T> where T: Copy + 'a1.2.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a T>

-

impl<A> PartialEq<LinkedList<A>> for LinkedList<A> where A: PartialEq<A>

fn eq(&self, other: &LinkedList<A>) -> bool

-

fn ne(&self, other: &LinkedList<A>) -> bool

-

impl<A> Eq for LinkedList<A> where A: Eq

impl<A> PartialOrd<LinkedList<A>> for LinkedList<A> where A: PartialOrd<A>

fn partial_cmp(&self, other: &LinkedList<A>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<A> Ord for LinkedList<A> where A: Ord

fn cmp(&self, other: &LinkedList<A>) -> Ordering

-

impl<A> Clone for LinkedList<A> where A: Clone

fn clone(&self) -> LinkedList<A>

-

fn clone_from(&mut self, source: &Self)

-

impl<A> Debug for LinkedList<A> where A: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<A> Hash for LinkedList<A> where A: Hash

fn hash<H>(&self, state: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/struct.VecDeque.html b/doc/bitflags/__core/collections/struct.VecDeque.html deleted file mode 100644 index b2c2d08e..00000000 --- a/doc/bitflags/__core/collections/struct.VecDeque.html +++ /dev/null @@ -1,643 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::VecDeque - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::VecDeque - - [−] - - [src]

-
pub struct VecDeque<T> {
-    // some fields omitted
-}
1.0.0

VecDeque is a growable ring buffer, which can be used as a double-ended -queue efficiently.

- -

The "default" usage of this type as a queue is to use push_back to add to -the queue, and pop_front to remove from the queue. extend and append -push onto the back in this manner, and iterating over VecDeque goes front -to back.

-

Methods

impl<T> VecDeque<T>

fn new() -> VecDeque<T>

-

Creates an empty VecDeque.

-

fn with_capacity(n: usize) -> VecDeque<T>

-

Creates an empty VecDeque with space for at least n elements.

-

fn get(&self, index: usize) -> Option<&T>

-

Retrieves an element in the VecDeque by index.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(3);
-buf.push_back(4);
-buf.push_back(5);
-assert_eq!(buf.get(1), Some(&4));
-

fn get_mut(&mut self, index: usize) -> Option<&mut T>

-

Retrieves an element in the VecDeque mutably by index.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(3);
-buf.push_back(4);
-buf.push_back(5);
-if let Some(elem) = buf.get_mut(1) {
-    *elem = 7;
-}
-
-assert_eq!(buf[1], 7);
-

fn swap(&mut self, i: usize, j: usize)

-

Swaps elements at indices i and j.

- -

i and j may be equal.

- -

Fails if there is no element with either index.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(3);
-buf.push_back(4);
-buf.push_back(5);
-buf.swap(0, 2);
-assert_eq!(buf[0], 5);
-assert_eq!(buf[2], 3);
-

fn capacity(&self) -> usize

-

Returns the number of elements the VecDeque can hold without -reallocating.

- -

Examples

-
-use std::collections::VecDeque;
-
-let buf: VecDeque<i32> = VecDeque::with_capacity(10);
-assert!(buf.capacity() >= 10);
-

fn reserve_exact(&mut self, additional: usize)

-

Reserves the minimum capacity for exactly additional more elements to be inserted in the -given VecDeque. Does nothing if the capacity is already sufficient.

- -

Note that the allocator may give the collection more space than it requests. Therefore -capacity can not be relied upon to be precisely minimal. Prefer reserve if future -insertions are expected.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf: VecDeque<i32> = vec![1].into_iter().collect();
-buf.reserve_exact(10);
-assert!(buf.capacity() >= 11);
-

fn reserve(&mut self, additional: usize)

-

Reserves capacity for at least additional more elements to be inserted in the given -VecDeque. The collection may reserve more space to avoid frequent reallocations.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf: VecDeque<i32> = vec![1].into_iter().collect();
-buf.reserve(10);
-assert!(buf.capacity() >= 11);
-

fn shrink_to_fit(&mut self)1.5.0

-

Shrinks the capacity of the VecDeque as much as possible.

- -

It will drop down as close as possible to the length but the allocator may still inform the -VecDeque that there is space for a few more elements.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::with_capacity(15);
-buf.extend(0..4);
-assert_eq!(buf.capacity(), 15);
-buf.shrink_to_fit();
-assert!(buf.capacity() >= 4);
-

fn truncate(&mut self, len: usize)

-
Unstable (deque_extras)

: matches collection reform specification; waiting on panic semantics

-

Shortens a VecDeque, dropping excess elements from the back.

- -

If len is greater than the VecDeque's current length, this has no -effect.

- -

Examples

-
-#![feature(deque_extras)]
-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(5);
-buf.push_back(10);
-buf.push_back(15);
-buf.truncate(1);
-assert_eq!(buf.len(), 1);
-assert_eq!(Some(&5), buf.get(0));
-

fn iter(&self) -> Iter<T>

-

Returns a front-to-back iterator.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(5);
-buf.push_back(3);
-buf.push_back(4);
-let b: &[_] = &[&5, &3, &4];
-let c: Vec<&i32> = buf.iter().collect();
-assert_eq!(&c[..], b);
-

fn iter_mut(&mut self) -> IterMut<T>

-

Returns a front-to-back iterator that returns mutable references.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(5);
-buf.push_back(3);
-buf.push_back(4);
-for num in buf.iter_mut() {
-    *num = *num - 2;
-}
-let b: &[_] = &[&mut 3, &mut 1, &mut 2];
-assert_eq!(&buf.iter_mut().collect::<Vec<&mut i32>>()[..], b);
-

fn as_slices(&self) -> (&[T], &[T])1.5.0

-

Returns a pair of slices which contain, in order, the contents of the -VecDeque.

-

fn as_mut_slices(&mut self) -> (&mut [T], &mut [T])1.5.0

-

Returns a pair of slices which contain, in order, the contents of the -VecDeque.

-

fn len(&self) -> usize

-

Returns the number of elements in the VecDeque.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut v = VecDeque::new();
-assert_eq!(v.len(), 0);
-v.push_back(1);
-assert_eq!(v.len(), 1);
-

fn is_empty(&self) -> bool

-

Returns true if the buffer contains no elements

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut v = VecDeque::new();
-assert!(v.is_empty());
-v.push_front(1);
-assert!(!v.is_empty());
-

fn drain<R>(&mut self, range: R) -> Drain<T> where R: RangeArgument<usize>1.6.0

-

Create a draining iterator that removes the specified range in the -VecDeque and yields the removed items.

- -

Note 1: The element range is removed even if the iterator is not -consumed until the end.

- -

Note 2: It is unspecified how many elements are removed from the deque, -if the Drain value is not dropped, but the borrow it holds expires -(eg. due to mem::forget).

- -

Panics

-

Panics if the starting point is greater than the end point or if -the end point is greater than the length of the vector.

- -

Examples

-
-use std::collections::VecDeque;
-let mut v: VecDeque<_> = vec![1, 2, 3].into_iter().collect();
-assert_eq!(vec![3].into_iter().collect::<VecDeque<_>>(), v.drain(2..).collect());
-assert_eq!(vec![1, 2].into_iter().collect::<VecDeque<_>>(), v);
-
-// A full range clears all contents
-v.drain(..);
-assert!(v.is_empty());
-

fn clear(&mut self)

-

Clears the buffer, removing all values.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut v = VecDeque::new();
-v.push_back(1);
-v.clear();
-assert!(v.is_empty());
-

fn contains(&self, x: &T) -> bool where T: PartialEq<T>

-
Unstable (vec_deque_contains)

: recently added

-

Returns true if the VecDeque contains an element equal to the -given value.

-

fn front(&self) -> Option<&T>

-

Provides a reference to the front element, or None if the sequence is -empty.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut d = VecDeque::new();
-assert_eq!(d.front(), None);
-
-d.push_back(1);
-d.push_back(2);
-assert_eq!(d.front(), Some(&1));
-

fn front_mut(&mut self) -> Option<&mut T>

-

Provides a mutable reference to the front element, or None if the -sequence is empty.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut d = VecDeque::new();
-assert_eq!(d.front_mut(), None);
-
-d.push_back(1);
-d.push_back(2);
-match d.front_mut() {
-    Some(x) => *x = 9,
-    None => (),
-}
-assert_eq!(d.front(), Some(&9));
-

fn back(&self) -> Option<&T>

-

Provides a reference to the back element, or None if the sequence is -empty.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut d = VecDeque::new();
-assert_eq!(d.back(), None);
-
-d.push_back(1);
-d.push_back(2);
-assert_eq!(d.back(), Some(&2));
-

fn back_mut(&mut self) -> Option<&mut T>

-

Provides a mutable reference to the back element, or None if the -sequence is empty.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut d = VecDeque::new();
-assert_eq!(d.back(), None);
-
-d.push_back(1);
-d.push_back(2);
-match d.back_mut() {
-    Some(x) => *x = 9,
-    None => (),
-}
-assert_eq!(d.back(), Some(&9));
-

fn pop_front(&mut self) -> Option<T>

-

Removes the first element and returns it, or None if the sequence is -empty.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut d = VecDeque::new();
-d.push_back(1);
-d.push_back(2);
-
-assert_eq!(d.pop_front(), Some(1));
-assert_eq!(d.pop_front(), Some(2));
-assert_eq!(d.pop_front(), None);
-

fn push_front(&mut self, value: T)

-

Inserts an element first in the sequence.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut d = VecDeque::new();
-d.push_front(1);
-d.push_front(2);
-assert_eq!(d.front(), Some(&2));
-

fn push_back(&mut self, value: T)

-

Appends an element to the back of a buffer

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(1);
-buf.push_back(3);
-assert_eq!(3, *buf.back().unwrap());
-

fn pop_back(&mut self) -> Option<T>

-

Removes the last element from a buffer and returns it, or None if -it is empty.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-assert_eq!(buf.pop_back(), None);
-buf.push_back(1);
-buf.push_back(3);
-assert_eq!(buf.pop_back(), Some(3));
-

fn swap_remove_back(&mut self, index: usize) -> Option<T>1.5.0

-

Removes an element from anywhere in the VecDeque and returns it, replacing it with the -last element.

- -

This does not preserve ordering, but is O(1).

- -

Returns None if index is out of bounds.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-assert_eq!(buf.swap_remove_back(0), None);
-buf.push_back(1);
-buf.push_back(2);
-buf.push_back(3);
-
-assert_eq!(buf.swap_remove_back(0), Some(1));
-assert_eq!(buf.len(), 2);
-assert_eq!(buf[0], 3);
-assert_eq!(buf[1], 2);
-

fn swap_remove_front(&mut self, index: usize) -> Option<T>1.5.0

-

Removes an element from anywhere in the VecDeque and returns it, -replacing it with the first element.

- -

This does not preserve ordering, but is O(1).

- -

Returns None if index is out of bounds.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-assert_eq!(buf.swap_remove_front(0), None);
-buf.push_back(1);
-buf.push_back(2);
-buf.push_back(3);
-
-assert_eq!(buf.swap_remove_front(2), Some(3));
-assert_eq!(buf.len(), 2);
-assert_eq!(buf[0], 2);
-assert_eq!(buf[1], 1);
-

fn insert(&mut self, index: usize, value: T)1.5.0

-

Inserts an element at index within the VecDeque. Whichever -end is closer to the insertion point will be moved to make room, -and all the affected elements will be moved to new positions.

- -

Panics

-

Panics if index is greater than VecDeque's length

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(10);
-buf.push_back(12);
-buf.insert(1, 11);
-assert_eq!(Some(&11), buf.get(1));
-

fn remove(&mut self, index: usize) -> Option<T>

-

Removes and returns the element at index from the VecDeque. -Whichever end is closer to the removal point will be moved to make -room, and all the affected elements will be moved to new positions. -Returns None if index is out of bounds.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(1);
-buf.push_back(2);
-buf.push_back(3);
-
-assert_eq!(buf.remove(1), Some(2));
-assert_eq!(buf.get(1), Some(&3));
-

fn split_off(&mut self, at: usize) -> VecDeque<T>1.4.0

-

Splits the collection into two at the given index.

- -

Returns a newly allocated Self. self contains elements [0, at), -and the returned Self contains elements [at, len).

- -

Note that the capacity of self does not change.

- -

Panics

-

Panics if at > len

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf: VecDeque<_> = vec![1,2,3].into_iter().collect();
-let buf2 = buf.split_off(1);
-// buf = [1], buf2 = [2, 3]
-assert_eq!(buf.len(), 1);
-assert_eq!(buf2.len(), 2);
-

fn append(&mut self, other: &mut VecDeque<T>)1.4.0

-

Moves all the elements of other into Self, leaving other empty.

- -

Panics

-

Panics if the new number of elements in self overflows a usize.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf: VecDeque<_> = vec![1, 2, 3].into_iter().collect();
-let mut buf2: VecDeque<_> = vec![4, 5, 6].into_iter().collect();
-buf.append(&mut buf2);
-assert_eq!(buf.len(), 6);
-assert_eq!(buf2.len(), 0);
-

fn retain<F>(&mut self, f: F) where F: FnMut(&T) -> bool1.4.0

-

Retains only the elements specified by the predicate.

- -

In other words, remove all elements e such that f(&e) returns false. -This method operates in place and preserves the order of the retained -elements.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.extend(1..5);
-buf.retain(|&x| x%2 == 0);
-
-let v: Vec<_> = buf.into_iter().collect();
-assert_eq!(&v[..], &[2, 4]);
-

impl<T> VecDeque<T> where T: Clone

fn resize(&mut self, new_len: usize, value: T)

-
Unstable (deque_extras)

: matches collection reform specification; waiting on panic semantics

-

Modifies the VecDeque in-place so that len() is equal to new_len, -either by removing excess elements or by appending copies of a value to the back.

- -

Examples

-
-#![feature(deque_extras)]
-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(5);
-buf.push_back(10);
-buf.push_back(15);
-buf.resize(2, 0);
-buf.resize(6, 20);
-for (a, b) in [5, 10, 20, 20, 20, 20].iter().zip(&buf) {
-    assert_eq!(a, b);
-}
-

Trait Implementations

impl<T> Clone for VecDeque<T> where T: Clone

fn clone(&self) -> VecDeque<T>

-

fn clone_from(&mut self, source: &Self)

-

impl<T> Drop for VecDeque<T>

fn drop(&mut self)

-

impl<T> Default for VecDeque<T>

fn default() -> VecDeque<T>

-

impl<A> PartialEq<VecDeque<A>> for VecDeque<A> where A: PartialEq<A>

fn eq(&self, other: &VecDeque<A>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<A> Eq for VecDeque<A> where A: Eq

impl<A> PartialOrd<VecDeque<A>> for VecDeque<A> where A: PartialOrd<A>

fn partial_cmp(&self, other: &VecDeque<A>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<A> Ord for VecDeque<A> where A: Ord

fn cmp(&self, other: &VecDeque<A>) -> Ordering

-

impl<A> Hash for VecDeque<A> where A: Hash

fn hash<H>(&self, state: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<A> Index<usize> for VecDeque<A>

type Output = A

-

fn index(&self, index: usize) -> &A

-

impl<A> IndexMut<usize> for VecDeque<A>

fn index_mut(&mut self, index: usize) -> &mut A

-

impl<A> FromIterator<A> for VecDeque<A>

fn from_iter<T>(iter: T) -> VecDeque<A> where T: IntoIterator<Item=A>

-

impl<T> IntoIterator for VecDeque<T>

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Consumes the list into a front-to-back iterator yielding elements by -value.

-

impl<'a, T> IntoIterator for &'a VecDeque<T>

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<'a, T> IntoIterator for &'a mut VecDeque<T>

type Item = &'a mut T

-

type IntoIter = IterMut<'a, T>

-

fn into_iter(self) -> IterMut<'a, T>

-

impl<A> Extend<A> for VecDeque<A>

fn extend<T>(&mut self, iter: T) where T: IntoIterator<Item=A>

-

impl<'a, T> Extend<&'a T> for VecDeque<T> where T: Copy + 'a1.2.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a T>

-

impl<T> Debug for VecDeque<T> where T: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> From<Vec<T>> for VecDeque<T>1.10.0

fn from(other: Vec<T>) -> VecDeque<T>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/vec_deque/index.html b/doc/bitflags/__core/collections/vec_deque/index.html deleted file mode 100644 index 2e9d9eb3..00000000 --- a/doc/bitflags/__core/collections/vec_deque/index.html +++ /dev/null @@ -1,156 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::vec_deque - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::collections::vec_deque - - [−] - - [src]

-

VecDeque is a double-ended queue, which is implemented with the help of a -growing ring buffer.

- -

This queue has O(1) amortized inserts and removals from both ends of the -container. It also has O(1) indexing like a vector. The contained elements -are not required to be copyable, and the queue will be sendable if the -contained type is sendable.

-

Structs

- - - - - - - - - - - - - - - - - - - - -
Drain -

A draining VecDeque iterator

-
IntoIter -

A by-value VecDeque iterator

-
Iter -

VecDeque iterator.

-
IterMut -

VecDeque mutable iterator.

-
VecDeque -

VecDeque is a growable ring buffer, which can be used as a double-ended -queue efficiently.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/vec_deque/sidebar-items.js b/doc/bitflags/__core/collections/vec_deque/sidebar-items.js deleted file mode 100644 index 1af96b47..00000000 --- a/doc/bitflags/__core/collections/vec_deque/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["Drain","A draining VecDeque iterator"],["IntoIter","A by-value VecDeque iterator"],["Iter","`VecDeque` iterator."],["IterMut","`VecDeque` mutable iterator."],["VecDeque","`VecDeque` is a growable ring buffer, which can be used as a double-ended queue efficiently."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/collections/vec_deque/struct.Drain.html b/doc/bitflags/__core/collections/vec_deque/struct.Drain.html deleted file mode 100644 index 19ee8e68..00000000 --- a/doc/bitflags/__core/collections/vec_deque/struct.Drain.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::vec_deque::Drain - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::vec_deque::Drain - - [−] - - [src]

-
pub struct Drain<'a, T> where T: 'a {
-    // some fields omitted
-}
1.6.0

A draining VecDeque iterator

-

Trait Implementations

impl<'a, T> Sync for Drain<'a, T> where T: Sync

impl<'a, T> Send for Drain<'a, T> where T: Send

impl<'a, T> Drop for Drain<'a, T> where T: 'a1.0.0

fn drop(&mut self)

-

impl<'a, T> Iterator for Drain<'a, T> where T: 'a1.0.0

type Item = T

-

fn next(&mut self) -> Option<T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T> DoubleEndedIterator for Drain<'a, T> where T: 'a1.0.0

fn next_back(&mut self) -> Option<T>

-

impl<'a, T> ExactSizeIterator for Drain<'a, T> where T: 'a1.0.0

fn len(&self) -> usize1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/vec_deque/struct.IntoIter.html b/doc/bitflags/__core/collections/vec_deque/struct.IntoIter.html deleted file mode 100644 index eec64194..00000000 --- a/doc/bitflags/__core/collections/vec_deque/struct.IntoIter.html +++ /dev/null @@ -1,167 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::vec_deque::IntoIter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::vec_deque::IntoIter - - [−] - - [src]

-
pub struct IntoIter<T> {
-    // some fields omitted
-}
1.0.0

A by-value VecDeque iterator

-

Trait Implementations

impl<T> Iterator for IntoIter<T>

type Item = T

-

fn next(&mut self) -> Option<T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<T> DoubleEndedIterator for IntoIter<T>

fn next_back(&mut self) -> Option<T>

-

impl<T> ExactSizeIterator for IntoIter<T>

fn len(&self) -> usize

-

Derived Implementations

impl<T> Clone for IntoIter<T> where T: Clone

fn clone(&self) -> IntoIter<T>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/vec_deque/struct.Iter.html b/doc/bitflags/__core/collections/vec_deque/struct.Iter.html deleted file mode 100644 index a1cb32f0..00000000 --- a/doc/bitflags/__core/collections/vec_deque/struct.Iter.html +++ /dev/null @@ -1,167 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::vec_deque::Iter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::vec_deque::Iter - - [−] - - [src]

-
pub struct Iter<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

VecDeque iterator.

-

Trait Implementations

impl<'a, T> Clone for Iter<'a, T>

fn clone(&self) -> Iter<'a, T>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, T> Iterator for Iter<'a, T>

type Item = &'a T

-

fn next(&mut self) -> Option<&'a T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T> DoubleEndedIterator for Iter<'a, T>

fn next_back(&mut self) -> Option<&'a T>

-

impl<'a, T> ExactSizeIterator for Iter<'a, T>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/vec_deque/struct.IterMut.html b/doc/bitflags/__core/collections/vec_deque/struct.IterMut.html deleted file mode 100644 index 26fc9b74..00000000 --- a/doc/bitflags/__core/collections/vec_deque/struct.IterMut.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::vec_deque::IterMut - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::vec_deque::IterMut - - [−] - - [src]

-
pub struct IterMut<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

VecDeque mutable iterator.

-

Trait Implementations

impl<'a, T> Iterator for IterMut<'a, T>

type Item = &'a mut T

-

fn next(&mut self) -> Option<&'a mut T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T> DoubleEndedIterator for IterMut<'a, T>

fn next_back(&mut self) -> Option<&'a mut T>

-

impl<'a, T> ExactSizeIterator for IterMut<'a, T>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/collections/vec_deque/struct.VecDeque.html b/doc/bitflags/__core/collections/vec_deque/struct.VecDeque.html deleted file mode 100644 index 71f6dd95..00000000 --- a/doc/bitflags/__core/collections/vec_deque/struct.VecDeque.html +++ /dev/null @@ -1,643 +0,0 @@ - - - - - - - - - - bitflags::__core::collections::vec_deque::VecDeque - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::collections::vec_deque::VecDeque - - [−] - - [src]

-
pub struct VecDeque<T> {
-    // some fields omitted
-}
1.0.0

VecDeque is a growable ring buffer, which can be used as a double-ended -queue efficiently.

- -

The "default" usage of this type as a queue is to use push_back to add to -the queue, and pop_front to remove from the queue. extend and append -push onto the back in this manner, and iterating over VecDeque goes front -to back.

-

Methods

impl<T> VecDeque<T>

fn new() -> VecDeque<T>

-

Creates an empty VecDeque.

-

fn with_capacity(n: usize) -> VecDeque<T>

-

Creates an empty VecDeque with space for at least n elements.

-

fn get(&self, index: usize) -> Option<&T>

-

Retrieves an element in the VecDeque by index.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(3);
-buf.push_back(4);
-buf.push_back(5);
-assert_eq!(buf.get(1), Some(&4));
-

fn get_mut(&mut self, index: usize) -> Option<&mut T>

-

Retrieves an element in the VecDeque mutably by index.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(3);
-buf.push_back(4);
-buf.push_back(5);
-if let Some(elem) = buf.get_mut(1) {
-    *elem = 7;
-}
-
-assert_eq!(buf[1], 7);
-

fn swap(&mut self, i: usize, j: usize)

-

Swaps elements at indices i and j.

- -

i and j may be equal.

- -

Fails if there is no element with either index.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(3);
-buf.push_back(4);
-buf.push_back(5);
-buf.swap(0, 2);
-assert_eq!(buf[0], 5);
-assert_eq!(buf[2], 3);
-

fn capacity(&self) -> usize

-

Returns the number of elements the VecDeque can hold without -reallocating.

- -

Examples

-
-use std::collections::VecDeque;
-
-let buf: VecDeque<i32> = VecDeque::with_capacity(10);
-assert!(buf.capacity() >= 10);
-

fn reserve_exact(&mut self, additional: usize)

-

Reserves the minimum capacity for exactly additional more elements to be inserted in the -given VecDeque. Does nothing if the capacity is already sufficient.

- -

Note that the allocator may give the collection more space than it requests. Therefore -capacity can not be relied upon to be precisely minimal. Prefer reserve if future -insertions are expected.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf: VecDeque<i32> = vec![1].into_iter().collect();
-buf.reserve_exact(10);
-assert!(buf.capacity() >= 11);
-

fn reserve(&mut self, additional: usize)

-

Reserves capacity for at least additional more elements to be inserted in the given -VecDeque. The collection may reserve more space to avoid frequent reallocations.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf: VecDeque<i32> = vec![1].into_iter().collect();
-buf.reserve(10);
-assert!(buf.capacity() >= 11);
-

fn shrink_to_fit(&mut self)1.5.0

-

Shrinks the capacity of the VecDeque as much as possible.

- -

It will drop down as close as possible to the length but the allocator may still inform the -VecDeque that there is space for a few more elements.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::with_capacity(15);
-buf.extend(0..4);
-assert_eq!(buf.capacity(), 15);
-buf.shrink_to_fit();
-assert!(buf.capacity() >= 4);
-

fn truncate(&mut self, len: usize)

-
Unstable (deque_extras)

: matches collection reform specification; waiting on panic semantics

-

Shortens a VecDeque, dropping excess elements from the back.

- -

If len is greater than the VecDeque's current length, this has no -effect.

- -

Examples

-
-#![feature(deque_extras)]
-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(5);
-buf.push_back(10);
-buf.push_back(15);
-buf.truncate(1);
-assert_eq!(buf.len(), 1);
-assert_eq!(Some(&5), buf.get(0));
-

fn iter(&self) -> Iter<T>

-

Returns a front-to-back iterator.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(5);
-buf.push_back(3);
-buf.push_back(4);
-let b: &[_] = &[&5, &3, &4];
-let c: Vec<&i32> = buf.iter().collect();
-assert_eq!(&c[..], b);
-

fn iter_mut(&mut self) -> IterMut<T>

-

Returns a front-to-back iterator that returns mutable references.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(5);
-buf.push_back(3);
-buf.push_back(4);
-for num in buf.iter_mut() {
-    *num = *num - 2;
-}
-let b: &[_] = &[&mut 3, &mut 1, &mut 2];
-assert_eq!(&buf.iter_mut().collect::<Vec<&mut i32>>()[..], b);
-

fn as_slices(&self) -> (&[T], &[T])1.5.0

-

Returns a pair of slices which contain, in order, the contents of the -VecDeque.

-

fn as_mut_slices(&mut self) -> (&mut [T], &mut [T])1.5.0

-

Returns a pair of slices which contain, in order, the contents of the -VecDeque.

-

fn len(&self) -> usize

-

Returns the number of elements in the VecDeque.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut v = VecDeque::new();
-assert_eq!(v.len(), 0);
-v.push_back(1);
-assert_eq!(v.len(), 1);
-

fn is_empty(&self) -> bool

-

Returns true if the buffer contains no elements

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut v = VecDeque::new();
-assert!(v.is_empty());
-v.push_front(1);
-assert!(!v.is_empty());
-

fn drain<R>(&mut self, range: R) -> Drain<T> where R: RangeArgument<usize>1.6.0

-

Create a draining iterator that removes the specified range in the -VecDeque and yields the removed items.

- -

Note 1: The element range is removed even if the iterator is not -consumed until the end.

- -

Note 2: It is unspecified how many elements are removed from the deque, -if the Drain value is not dropped, but the borrow it holds expires -(eg. due to mem::forget).

- -

Panics

-

Panics if the starting point is greater than the end point or if -the end point is greater than the length of the vector.

- -

Examples

-
-use std::collections::VecDeque;
-let mut v: VecDeque<_> = vec![1, 2, 3].into_iter().collect();
-assert_eq!(vec![3].into_iter().collect::<VecDeque<_>>(), v.drain(2..).collect());
-assert_eq!(vec![1, 2].into_iter().collect::<VecDeque<_>>(), v);
-
-// A full range clears all contents
-v.drain(..);
-assert!(v.is_empty());
-

fn clear(&mut self)

-

Clears the buffer, removing all values.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut v = VecDeque::new();
-v.push_back(1);
-v.clear();
-assert!(v.is_empty());
-

fn contains(&self, x: &T) -> bool where T: PartialEq<T>

-
Unstable (vec_deque_contains)

: recently added

-

Returns true if the VecDeque contains an element equal to the -given value.

-

fn front(&self) -> Option<&T>

-

Provides a reference to the front element, or None if the sequence is -empty.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut d = VecDeque::new();
-assert_eq!(d.front(), None);
-
-d.push_back(1);
-d.push_back(2);
-assert_eq!(d.front(), Some(&1));
-

fn front_mut(&mut self) -> Option<&mut T>

-

Provides a mutable reference to the front element, or None if the -sequence is empty.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut d = VecDeque::new();
-assert_eq!(d.front_mut(), None);
-
-d.push_back(1);
-d.push_back(2);
-match d.front_mut() {
-    Some(x) => *x = 9,
-    None => (),
-}
-assert_eq!(d.front(), Some(&9));
-

fn back(&self) -> Option<&T>

-

Provides a reference to the back element, or None if the sequence is -empty.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut d = VecDeque::new();
-assert_eq!(d.back(), None);
-
-d.push_back(1);
-d.push_back(2);
-assert_eq!(d.back(), Some(&2));
-

fn back_mut(&mut self) -> Option<&mut T>

-

Provides a mutable reference to the back element, or None if the -sequence is empty.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut d = VecDeque::new();
-assert_eq!(d.back(), None);
-
-d.push_back(1);
-d.push_back(2);
-match d.back_mut() {
-    Some(x) => *x = 9,
-    None => (),
-}
-assert_eq!(d.back(), Some(&9));
-

fn pop_front(&mut self) -> Option<T>

-

Removes the first element and returns it, or None if the sequence is -empty.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut d = VecDeque::new();
-d.push_back(1);
-d.push_back(2);
-
-assert_eq!(d.pop_front(), Some(1));
-assert_eq!(d.pop_front(), Some(2));
-assert_eq!(d.pop_front(), None);
-

fn push_front(&mut self, value: T)

-

Inserts an element first in the sequence.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut d = VecDeque::new();
-d.push_front(1);
-d.push_front(2);
-assert_eq!(d.front(), Some(&2));
-

fn push_back(&mut self, value: T)

-

Appends an element to the back of a buffer

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(1);
-buf.push_back(3);
-assert_eq!(3, *buf.back().unwrap());
-

fn pop_back(&mut self) -> Option<T>

-

Removes the last element from a buffer and returns it, or None if -it is empty.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-assert_eq!(buf.pop_back(), None);
-buf.push_back(1);
-buf.push_back(3);
-assert_eq!(buf.pop_back(), Some(3));
-

fn swap_remove_back(&mut self, index: usize) -> Option<T>1.5.0

-

Removes an element from anywhere in the VecDeque and returns it, replacing it with the -last element.

- -

This does not preserve ordering, but is O(1).

- -

Returns None if index is out of bounds.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-assert_eq!(buf.swap_remove_back(0), None);
-buf.push_back(1);
-buf.push_back(2);
-buf.push_back(3);
-
-assert_eq!(buf.swap_remove_back(0), Some(1));
-assert_eq!(buf.len(), 2);
-assert_eq!(buf[0], 3);
-assert_eq!(buf[1], 2);
-

fn swap_remove_front(&mut self, index: usize) -> Option<T>1.5.0

-

Removes an element from anywhere in the VecDeque and returns it, -replacing it with the first element.

- -

This does not preserve ordering, but is O(1).

- -

Returns None if index is out of bounds.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-assert_eq!(buf.swap_remove_front(0), None);
-buf.push_back(1);
-buf.push_back(2);
-buf.push_back(3);
-
-assert_eq!(buf.swap_remove_front(2), Some(3));
-assert_eq!(buf.len(), 2);
-assert_eq!(buf[0], 2);
-assert_eq!(buf[1], 1);
-

fn insert(&mut self, index: usize, value: T)1.5.0

-

Inserts an element at index within the VecDeque. Whichever -end is closer to the insertion point will be moved to make room, -and all the affected elements will be moved to new positions.

- -

Panics

-

Panics if index is greater than VecDeque's length

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(10);
-buf.push_back(12);
-buf.insert(1, 11);
-assert_eq!(Some(&11), buf.get(1));
-

fn remove(&mut self, index: usize) -> Option<T>

-

Removes and returns the element at index from the VecDeque. -Whichever end is closer to the removal point will be moved to make -room, and all the affected elements will be moved to new positions. -Returns None if index is out of bounds.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(1);
-buf.push_back(2);
-buf.push_back(3);
-
-assert_eq!(buf.remove(1), Some(2));
-assert_eq!(buf.get(1), Some(&3));
-

fn split_off(&mut self, at: usize) -> VecDeque<T>1.4.0

-

Splits the collection into two at the given index.

- -

Returns a newly allocated Self. self contains elements [0, at), -and the returned Self contains elements [at, len).

- -

Note that the capacity of self does not change.

- -

Panics

-

Panics if at > len

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf: VecDeque<_> = vec![1,2,3].into_iter().collect();
-let buf2 = buf.split_off(1);
-// buf = [1], buf2 = [2, 3]
-assert_eq!(buf.len(), 1);
-assert_eq!(buf2.len(), 2);
-

fn append(&mut self, other: &mut VecDeque<T>)1.4.0

-

Moves all the elements of other into Self, leaving other empty.

- -

Panics

-

Panics if the new number of elements in self overflows a usize.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf: VecDeque<_> = vec![1, 2, 3].into_iter().collect();
-let mut buf2: VecDeque<_> = vec![4, 5, 6].into_iter().collect();
-buf.append(&mut buf2);
-assert_eq!(buf.len(), 6);
-assert_eq!(buf2.len(), 0);
-

fn retain<F>(&mut self, f: F) where F: FnMut(&T) -> bool1.4.0

-

Retains only the elements specified by the predicate.

- -

In other words, remove all elements e such that f(&e) returns false. -This method operates in place and preserves the order of the retained -elements.

- -

Examples

-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.extend(1..5);
-buf.retain(|&x| x%2 == 0);
-
-let v: Vec<_> = buf.into_iter().collect();
-assert_eq!(&v[..], &[2, 4]);
-

impl<T> VecDeque<T> where T: Clone

fn resize(&mut self, new_len: usize, value: T)

-
Unstable (deque_extras)

: matches collection reform specification; waiting on panic semantics

-

Modifies the VecDeque in-place so that len() is equal to new_len, -either by removing excess elements or by appending copies of a value to the back.

- -

Examples

-
-#![feature(deque_extras)]
-
-use std::collections::VecDeque;
-
-let mut buf = VecDeque::new();
-buf.push_back(5);
-buf.push_back(10);
-buf.push_back(15);
-buf.resize(2, 0);
-buf.resize(6, 20);
-for (a, b) in [5, 10, 20, 20, 20, 20].iter().zip(&buf) {
-    assert_eq!(a, b);
-}
-

Trait Implementations

impl<T> Clone for VecDeque<T> where T: Clone

fn clone(&self) -> VecDeque<T>

-

fn clone_from(&mut self, source: &Self)

-

impl<T> Drop for VecDeque<T>

fn drop(&mut self)

-

impl<T> Default for VecDeque<T>

fn default() -> VecDeque<T>

-

impl<A> PartialEq<VecDeque<A>> for VecDeque<A> where A: PartialEq<A>

fn eq(&self, other: &VecDeque<A>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<A> Eq for VecDeque<A> where A: Eq

impl<A> PartialOrd<VecDeque<A>> for VecDeque<A> where A: PartialOrd<A>

fn partial_cmp(&self, other: &VecDeque<A>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<A> Ord for VecDeque<A> where A: Ord

fn cmp(&self, other: &VecDeque<A>) -> Ordering

-

impl<A> Hash for VecDeque<A> where A: Hash

fn hash<H>(&self, state: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<A> Index<usize> for VecDeque<A>

type Output = A

-

fn index(&self, index: usize) -> &A

-

impl<A> IndexMut<usize> for VecDeque<A>

fn index_mut(&mut self, index: usize) -> &mut A

-

impl<A> FromIterator<A> for VecDeque<A>

fn from_iter<T>(iter: T) -> VecDeque<A> where T: IntoIterator<Item=A>

-

impl<T> IntoIterator for VecDeque<T>

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Consumes the list into a front-to-back iterator yielding elements by -value.

-

impl<'a, T> IntoIterator for &'a VecDeque<T>

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<'a, T> IntoIterator for &'a mut VecDeque<T>

type Item = &'a mut T

-

type IntoIter = IterMut<'a, T>

-

fn into_iter(self) -> IterMut<'a, T>

-

impl<A> Extend<A> for VecDeque<A>

fn extend<T>(&mut self, iter: T) where T: IntoIterator<Item=A>

-

impl<'a, T> Extend<&'a T> for VecDeque<T> where T: Copy + 'a1.2.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a T>

-

impl<T> Debug for VecDeque<T> where T: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> From<Vec<T>> for VecDeque<T>1.10.0

fn from(other: Vec<T>) -> VecDeque<T>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/convert/index.html b/doc/bitflags/__core/convert/index.html deleted file mode 100644 index 017373f1..00000000 --- a/doc/bitflags/__core/convert/index.html +++ /dev/null @@ -1,172 +0,0 @@ - - - - - - - - - - bitflags::__core::convert - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::convert - - [−] - - [src]

-

Traits for conversions between types.

- -

The traits in this module provide a general way to talk about conversions -from one type to another. They follow the standard Rust conventions of -as/into/from.

- -

Like many traits, these are often used as bounds for generic functions, to -support arguments of multiple types.

- -
    -
  • Impl the As* traits for reference-to-reference conversions
    • -
  • Impl the Into trait when you want to consume the value in the conversion
    • -
  • The From trait is the most flexible, useful for value and reference conversions
    • -
- -

As a library author, you should prefer implementing From<T> rather than -Into<U>, as From provides greater flexibility and offers an equivalent Into -implementation for free, thanks to a blanket implementation in the standard library.

- -

Note: these traits must not fail. If the conversion can fail, you must use a dedicated -method which returns an Option<T> or a Result<T, E>.

- -

Generic impl

-
    -
  • AsRef and AsMut auto-dereference if the inner type is a reference
    • -
  • From<U> for T implies Into<T> for U
    • -
  • From and Into are reflexive, which means that all types can into() -themselves and from() themselves
    • -
- -

See each trait for usage examples.

-

Traits

- - - - - - - - - - - - - - - - -
AsMut -

A cheap, mutable reference-to-mutable reference conversion.

-
AsRef -

A cheap, reference-to-reference conversion.

-
From -

Construct Self via a conversion.

-
Into -

A conversion that consumes self, which may or may not be expensive.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/convert/sidebar-items.js b/doc/bitflags/__core/convert/sidebar-items.js deleted file mode 100644 index 802707b8..00000000 --- a/doc/bitflags/__core/convert/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"trait":[["AsMut","A cheap, mutable reference-to-mutable reference conversion."],["AsRef","A cheap, reference-to-reference conversion."],["From","Construct `Self` via a conversion."],["Into","A conversion that consumes `self`, which may or may not be expensive."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/convert/trait.AsMut.html b/doc/bitflags/__core/convert/trait.AsMut.html deleted file mode 100644 index 820a216a..00000000 --- a/doc/bitflags/__core/convert/trait.AsMut.html +++ /dev/null @@ -1,171 +0,0 @@ - - - - - - - - - - bitflags::__core::convert::AsMut - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::convert::AsMut - - [−] - - [src]

-
pub trait AsMut<T> where T: ?Sized {
-    fn as_mut(&mut self) -> &mut T;
-}

A cheap, mutable reference-to-mutable reference conversion.

- -

Note: this trait must not fail. If the conversion can fail, use a dedicated method which -returns an Option<T> or a Result<T, E>.

- -

Generic Impls

-
    -
  • AsMut auto-dereference if the inner type is a reference or a mutable -reference (eg: foo.as_ref() will work the same if foo has type &mut Foo or &&mut Foo)
    • -
-
-

Required Methods

-
-

fn as_mut(&mut self) -> &mut T

Performs the conversion.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/convert/trait.AsRef.html b/doc/bitflags/__core/convert/trait.AsRef.html deleted file mode 100644 index 2671e4d4..00000000 --- a/doc/bitflags/__core/convert/trait.AsRef.html +++ /dev/null @@ -1,216 +0,0 @@ - - - - - - - - - - bitflags::__core::convert::AsRef - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::convert::AsRef - - [−] - - [src]

-
pub trait AsRef<T> where T: ?Sized {
-    fn as_ref(&self) -> &T;
-}

A cheap, reference-to-reference conversion.

- -

AsRef is very similar to, but different than, Borrow. See -the book for more.

- -

Note: this trait must not fail. If the conversion can fail, use a dedicated method which -returns an Option<T> or a Result<T, E>.

- -

Examples

-

Both String and &str implement AsRef<str>:

- -
-fn is_hello<T: AsRef<str>>(s: T) {
-   assert_eq!("hello", s.as_ref());
-}
-
-let s = "hello";
-is_hello(s);
-
-let s = "hello".to_string();
-is_hello(s);
- -

Generic Impls

-
    -
  • AsRef auto-dereference if the inner type is a reference or a mutable -reference (eg: foo.as_ref() will work the same if foo has type &mut Foo or &&mut Foo)
    • -
-
-

Required Methods

-
-

fn as_ref(&self) -> &T

Performs the conversion.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/convert/trait.From.html b/doc/bitflags/__core/convert/trait.From.html deleted file mode 100644 index 7c816f98..00000000 --- a/doc/bitflags/__core/convert/trait.From.html +++ /dev/null @@ -1,211 +0,0 @@ - - - - - - - - - - bitflags::__core::convert::From - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::convert::From - - [−] - - [src]

-
pub trait From<T> {
-    fn from(T) -> Self;
-}

Construct Self via a conversion.

- -

Note: this trait must not fail. If the conversion can fail, use a dedicated method which -returns an Option<T> or a Result<T, E>.

- -

Examples

-

String implements From<&str>:

- -
-let string = "hello".to_string();
-let other_string = String::from("hello");
-
-assert_eq!(string, other_string);
- -

Generic impls

-
    -
  • From<T> for U implies Into<U> for T
    • -
  • from() is reflexive, which means that From<T> for T is implemented
    • -
-
-

Required Methods

-
-

fn from(T) -> Self

Performs the conversion.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/convert/trait.Into.html b/doc/bitflags/__core/convert/trait.Into.html deleted file mode 100644 index 597c07ae..00000000 --- a/doc/bitflags/__core/convert/trait.Into.html +++ /dev/null @@ -1,152 +0,0 @@ - - - - - - - - - - bitflags::__core::convert::Into - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::convert::Into - - [−] - - [src]

-
pub trait Into<T> {
-    fn into(self) -> T;
-}

A conversion that consumes self, which may or may not be expensive.

- -

Note: this trait must not fail. If the conversion can fail, use a dedicated method which -returns an Option<T> or a Result<T, E>.

- -

Library authors should not directly implement this trait, but should prefer implementing -the From trait, which offers greater flexibility and provides an equivalent Into -implementation for free, thanks to a blanket implementation in the standard library.

- -

Examples

-

String implements Into<Vec<u8>>:

- -
-fn is_hello<T: Into<Vec<u8>>>(s: T) {
-   let bytes = b"hello".to_vec();
-   assert_eq!(bytes, s.into());
-}
-
-let s = "hello".to_string();
-is_hello(s);
- -

Generic Impls

-
    -
  • From<T> for U implies Into<U> for T
    • -
  • into() is reflexive, which means that Into<T> for T is implemented
    • -
-
-

Required Methods

-
-

fn into(self) -> T

Performs the conversion.

-
-

Implementors

-
    -
  • impl Into for PathBuf
    • -
  • impl<T, U> Into for T where U: From<T>
    • -
  • impl Into for String
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/default/index.html b/doc/bitflags/__core/default/index.html deleted file mode 100644 index 4ecb2ac9..00000000 --- a/doc/bitflags/__core/default/index.html +++ /dev/null @@ -1,178 +0,0 @@ - - - - - - - - - - bitflags::__core::default - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::default - - [−] - - [src]

-

The Default trait for types which may have meaningful default values.

- -

Sometimes, you want to fall back to some kind of default value, and -don't particularly care what it is. This comes up often with structs -that define a set of options:

- -
-struct SomeOptions {
-    foo: i32,
-    bar: f32,
-}
- -

How can we define some default values? You can use Default:

- -
-#[derive(Default)]
-struct SomeOptions {
-    foo: i32,
-    bar: f32,
-}
-
-
-fn main() {
-    let options: SomeOptions = Default::default();
-}
- -

Now, you get all of the default values. Rust implements Default for various primitives types. -If you have your own type, you need to implement Default yourself:

- -
-enum Kind {
-    A,
-    B,
-    C,
-}
-
-impl Default for Kind {
-    fn default() -> Kind { Kind::A }
-}
-
-#[derive(Default)]
-struct SomeOptions {
-    foo: i32,
-    bar: f32,
-    baz: Kind,
-}
-
-
-fn main() {
-    let options: SomeOptions = Default::default();
-}
- -

If you want to override a particular option, but still retain the other defaults:

- -
-fn main() {
-    let options = SomeOptions { foo: 42, ..Default::default() };
-}
-

Traits

- - - - -
Default -

A trait for giving a type a useful default value.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/default/sidebar-items.js b/doc/bitflags/__core/default/sidebar-items.js deleted file mode 100644 index f9122ce7..00000000 --- a/doc/bitflags/__core/default/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"trait":[["Default","A trait for giving a type a useful default value."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/default/trait.Default.html b/doc/bitflags/__core/default/trait.Default.html deleted file mode 100644 index d9e9159e..00000000 --- a/doc/bitflags/__core/default/trait.Default.html +++ /dev/null @@ -1,256 +0,0 @@ - - - - - - - - - - bitflags::__core::default::Default - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::default::Default - - [−] - - [src]

-
pub trait Default {
-    fn default() -> Self;
-}

A trait for giving a type a useful default value.

- -

A struct can derive default implementations of Default for basic types using -#[derive(Default)].

- -

Examples

-
-#[derive(Default)]
-struct SomeOptions {
-    foo: i32,
-    bar: f32,
-}
-
-

Required Methods

-
-

fn default() -> Self

Returns the "default value" for a type.

- -

Default values are often some kind of initial value, identity value, or anything else that -may make sense as a default.

- -

Examples

-

Using built-in default values:

- -
-let i: i8 = Default::default();
-let (x, y): (Option<String>, f64) = Default::default();
-let (a, b, (c, d)): (i32, u32, (bool, bool)) = Default::default();
- -

Making your own:

- -
-enum Kind {
-    A,
-    B,
-    C,
-}
-
-impl Default for Kind {
-    fn default() -> Kind { Kind::A }
-}
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/consts/constant.ARCH.html b/doc/bitflags/__core/env/consts/constant.ARCH.html deleted file mode 100644 index e0ba82d3..00000000 --- a/doc/bitflags/__core/env/consts/constant.ARCH.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::env::consts::ARCH - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::env::consts::ARCH - - [−] - - [src]

-
pub const ARCH: &'static str = super::arch::ARCH

A string describing the architecture of the CPU that is currently -in use.

- -

Some possible values:

- -
    -
  • x86
    • -
  • x86_64
    • -
  • arm
    • -
  • aarch64
    • -
  • mips
    • -
  • powerpc
    • -
  • powerpc64
    • -
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/consts/constant.DLL_EXTENSION.html b/doc/bitflags/__core/env/consts/constant.DLL_EXTENSION.html deleted file mode 100644 index 5c152bf9..00000000 --- a/doc/bitflags/__core/env/consts/constant.DLL_EXTENSION.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - bitflags::__core::env::consts::DLL_EXTENSION - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::env::consts::DLL_EXTENSION - - [−] - - [src]

-
pub const DLL_EXTENSION: &'static str = super::os::DLL_EXTENSION

Specifies the file extension used for shared libraries on this -platform that goes after the dot. Example value is so.

- -

Some possible values:

- -
    -
  • so
    • -
  • dylib
    • -
  • dll
    • -
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/consts/constant.DLL_PREFIX.html b/doc/bitflags/__core/env/consts/constant.DLL_PREFIX.html deleted file mode 100644 index 949b18c7..00000000 --- a/doc/bitflags/__core/env/consts/constant.DLL_PREFIX.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - - - - bitflags::__core::env::consts::DLL_PREFIX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::env::consts::DLL_PREFIX - - [−] - - [src]

-
pub const DLL_PREFIX: &'static str = super::os::DLL_PREFIX

Specifies the filename prefix used for shared libraries on this -platform. Example value is lib.

- -

Some possible values:

- -
    -
  • lib
    • -
  • "" (an empty string)
    • -
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/consts/constant.DLL_SUFFIX.html b/doc/bitflags/__core/env/consts/constant.DLL_SUFFIX.html deleted file mode 100644 index ce4f4105..00000000 --- a/doc/bitflags/__core/env/consts/constant.DLL_SUFFIX.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - bitflags::__core::env::consts::DLL_SUFFIX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::env::consts::DLL_SUFFIX - - [−] - - [src]

-
pub const DLL_SUFFIX: &'static str = super::os::DLL_SUFFIX

Specifies the filename suffix used for shared libraries on this -platform. Example value is .so.

- -

Some possible values:

- -
    -
  • .so
    • -
  • .dylib
    • -
  • .dll
    • -
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/consts/constant.EXE_EXTENSION.html b/doc/bitflags/__core/env/consts/constant.EXE_EXTENSION.html deleted file mode 100644 index fd420cc8..00000000 --- a/doc/bitflags/__core/env/consts/constant.EXE_EXTENSION.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - - - - bitflags::__core::env::consts::EXE_EXTENSION - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::env::consts::EXE_EXTENSION - - [−] - - [src]

-
pub const EXE_EXTENSION: &'static str = super::os::EXE_EXTENSION

Specifies the file extension, if any, used for executable binaries -on this platform. Example value is exe.

- -

Some possible values:

- -
    -
  • exe
    • -
  • "" (an empty string)
    • -
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/consts/constant.EXE_SUFFIX.html b/doc/bitflags/__core/env/consts/constant.EXE_SUFFIX.html deleted file mode 100644 index 8702b922..00000000 --- a/doc/bitflags/__core/env/consts/constant.EXE_SUFFIX.html +++ /dev/null @@ -1,123 +0,0 @@ - - - - - - - - - - bitflags::__core::env::consts::EXE_SUFFIX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::env::consts::EXE_SUFFIX - - [−] - - [src]

-
pub const EXE_SUFFIX: &'static str = super::os::EXE_SUFFIX

Specifies the filename suffix used for executable binaries on this -platform. Example value is .exe.

- -

Some possible values:

- -
    -
  • .exe
    • -
  • .nexe
    • -
  • .pexe
    • -
  • "" (an empty string)
    • -
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/consts/constant.FAMILY.html b/doc/bitflags/__core/env/consts/constant.FAMILY.html deleted file mode 100644 index 34500233..00000000 --- a/doc/bitflags/__core/env/consts/constant.FAMILY.html +++ /dev/null @@ -1,120 +0,0 @@ - - - - - - - - - - bitflags::__core::env::consts::FAMILY - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::env::consts::FAMILY - - [−] - - [src]

-
pub const FAMILY: &'static str = super::os::FAMILY

The family of the operating system. Example value is unix.

- -

Some possible values:

- -
    -
  • unix
    • -
  • windows
    • -
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/consts/constant.OS.html b/doc/bitflags/__core/env/consts/constant.OS.html deleted file mode 100644 index 13de98ee..00000000 --- a/doc/bitflags/__core/env/consts/constant.OS.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::env::consts::OS - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::env::consts::OS - - [−] - - [src]

-
pub const OS: &'static str = super::os::OS

A string describing the specific operating system in use. -Example value is linux.

- -

Some possible values:

- -
    -
  • linux
    • -
  • macos
    • -
  • ios
    • -
  • freebsd
    • -
  • dragonfly
    • -
  • bitrig
    • -
  • netbsd
    • -
  • openbsd
    • -
  • solaris
    • -
  • android
    • -
  • windows
    • -
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/consts/index.html b/doc/bitflags/__core/env/consts/index.html deleted file mode 100644 index 98fd68b3..00000000 --- a/doc/bitflags/__core/env/consts/index.html +++ /dev/null @@ -1,177 +0,0 @@ - - - - - - - - - - bitflags::__core::env::consts - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::env::consts - - [−] - - [src]

-

Constants associated with the current target

-

Constants

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
ARCH -

A string describing the architecture of the CPU that is currently -in use.

-
DLL_EXTENSION -

Specifies the file extension used for shared libraries on this -platform that goes after the dot. Example value is so.

-
DLL_PREFIX -

Specifies the filename prefix used for shared libraries on this -platform. Example value is lib.

-
DLL_SUFFIX -

Specifies the filename suffix used for shared libraries on this -platform. Example value is .so.

-
EXE_EXTENSION -

Specifies the file extension, if any, used for executable binaries -on this platform. Example value is exe.

-
EXE_SUFFIX -

Specifies the filename suffix used for executable binaries on this -platform. Example value is .exe.

-
FAMILY -

The family of the operating system. Example value is unix.

-
OS -

A string describing the specific operating system in use. -Example value is linux.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/consts/sidebar-items.js b/doc/bitflags/__core/env/consts/sidebar-items.js deleted file mode 100644 index 894dcae0..00000000 --- a/doc/bitflags/__core/env/consts/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["ARCH","A string describing the architecture of the CPU that is currently in use."],["DLL_EXTENSION","Specifies the file extension used for shared libraries on this platform that goes after the dot. Example value is `so`."],["DLL_PREFIX","Specifies the filename prefix used for shared libraries on this platform. Example value is `lib`."],["DLL_SUFFIX","Specifies the filename suffix used for shared libraries on this platform. Example value is `.so`."],["EXE_EXTENSION","Specifies the file extension, if any, used for executable binaries on this platform. Example value is `exe`."],["EXE_SUFFIX","Specifies the filename suffix used for executable binaries on this platform. Example value is `.exe`."],["FAMILY","The family of the operating system. Example value is `unix`."],["OS","A string describing the specific operating system in use. Example value is `linux`."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/env/enum.VarError.html b/doc/bitflags/__core/env/enum.VarError.html deleted file mode 100644 index 4ffd98ed..00000000 --- a/doc/bitflags/__core/env/enum.VarError.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::env::VarError - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::env::VarError - - [−] - - [src]

-
pub enum VarError {
-    NotPresent,
-    NotUnicode(OsString),
-}
1.0.0

Possible errors from the env::var method.

-

Variants

-
NotPresent

The specified environment variable was not present in the current -process's environment.

-
NotUnicode

The specified environment variable was found, but it did not contain -valid unicode data. The found data is returned as a payload of this -variant.

-

Trait Implementations

impl Display for VarError

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl Error for VarError

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

Derived Implementations

impl Clone for VarError

fn clone(&self) -> VarError

-

fn clone_from(&mut self, source: &Self)

-

impl Eq for VarError

impl PartialEq<VarError> for VarError

fn eq(&self, __arg_0: &VarError) -> bool

-

fn ne(&self, __arg_0: &VarError) -> bool

-

impl Debug for VarError

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/fn.args.html b/doc/bitflags/__core/env/fn.args.html deleted file mode 100644 index 8ced2e8e..00000000 --- a/doc/bitflags/__core/env/fn.args.html +++ /dev/null @@ -1,132 +0,0 @@ - - - - - - - - - - bitflags::__core::env::args - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::env::args - - [−] - - [src]

-
pub fn args() -> Args
1.0.0

Returns the arguments which this program was started with (normally passed -via the command line).

- -

The first element is traditionally the path of the executable, but it can be -set to arbitrary text, and may not even exist. This means this property should -not be relied upon for security purposes.

- -

Panics

-

The returned iterator will panic during iteration if any argument to the -process is not valid unicode. If this is not desired, -use the args_os function instead.

- -

Examples

-
-use std::env;
-
-// Prints each argument on a separate line
-for argument in env::args() {
-    println!("{}", argument);
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/fn.args_os.html b/doc/bitflags/__core/env/fn.args_os.html deleted file mode 100644 index 4e7c28bf..00000000 --- a/doc/bitflags/__core/env/fn.args_os.html +++ /dev/null @@ -1,127 +0,0 @@ - - - - - - - - - - bitflags::__core::env::args_os - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::env::args_os - - [−] - - [src]

-
pub fn args_os() -> ArgsOs
1.0.0

Returns the arguments which this program was started with (normally passed -via the command line).

- -

The first element is traditionally the path of the executable, but it can be -set to arbitrary text, and it may not even exist, so this property should -not be relied upon for security purposes.

- -

Examples

-
-use std::env;
-
-// Prints each argument on a separate line
-for argument in env::args_os() {
-    println!("{:?}", argument);
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/fn.current_dir.html b/doc/bitflags/__core/env/fn.current_dir.html deleted file mode 100644 index 01fa125d..00000000 --- a/doc/bitflags/__core/env/fn.current_dir.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::env::current_dir - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::env::current_dir - - [−] - - [src]

-
pub fn current_dir() -> Result<PathBuf, Error>
1.0.0

Returns the current working directory as a PathBuf.

- -

Errors

-

Returns an Err if the current working directory value is invalid. -Possible cases:

- -
    -
  • Current directory does not exist.
    • -
  • There are insufficient permissions to access the current directory.
    • -
- -

Examples

-
-use std::env;
-
-// We assume that we are in a valid directory.
-let p = env::current_dir().unwrap();
-println!("The current directory is {}", p.display());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/fn.current_exe.html b/doc/bitflags/__core/env/fn.current_exe.html deleted file mode 100644 index 456c5593..00000000 --- a/doc/bitflags/__core/env/fn.current_exe.html +++ /dev/null @@ -1,131 +0,0 @@ - - - - - - - - - - bitflags::__core::env::current_exe - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::env::current_exe - - [−] - - [src]

-
pub fn current_exe() -> Result<PathBuf, Error>
1.0.0

Returns the full filesystem path of the current running executable.

- -

The path returned is not necessarily a "real path" of the executable as -there may be intermediate symlinks.

- -

Errors

-

Acquiring the path of the current executable is a platform-specific operation -that can fail for a good number of reasons. Some errors can include, but not -be limited to, filesystem operations failing or general syscall failures.

- -

Examples

-
-use std::env;
-
-match env::current_exe() {
-    Ok(exe_path) => println!("Path of this executable is: {}",
-                              exe_path.display()),
-    Err(e) => println!("failed to get current exe path: {}", e),
-};
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/fn.home_dir.html b/doc/bitflags/__core/env/fn.home_dir.html deleted file mode 100644 index 5aa82136..00000000 --- a/doc/bitflags/__core/env/fn.home_dir.html +++ /dev/null @@ -1,135 +0,0 @@ - - - - - - - - - - bitflags::__core::env::home_dir - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::env::home_dir - - [−] - - [src]

-
pub fn home_dir() -> Option<PathBuf>
1.0.0

Returns the path of the current user's home directory if known.

- -

Unix

-

Returns the value of the 'HOME' environment variable if it is set -and not equal to the empty string. Otherwise, it tries to determine the -home directory by invoking the getpwuid_r function on the UID of the -current user.

- -

Windows

-

Returns the value of the 'HOME' environment variable if it is -set and not equal to the empty string. Otherwise, returns the value of the -'USERPROFILE' environment variable if it is set and not equal to the empty -string. If both do not exist, GetUserProfileDirectory is used to -return the appropriate path.

- -

Examples

-
-use std::env;
-
-match env::home_dir() {
-    Some(path) => println!("{}", path.display()),
-    None => println!("Impossible to get your home dir!"),
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/fn.join_paths.html b/doc/bitflags/__core/env/fn.join_paths.html deleted file mode 100644 index 03505a47..00000000 --- a/doc/bitflags/__core/env/fn.join_paths.html +++ /dev/null @@ -1,132 +0,0 @@ - - - - - - - - - - bitflags::__core::env::join_paths - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::env::join_paths - - [−] - - [src]

-
pub fn join_paths<I, T>(paths: I) -> Result<OsString, JoinPathsError> where I: IntoIterator<Item=T>, T: AsRef<OsStr>
1.0.0

Joins a collection of Paths appropriately for the PATH -environment variable.

- -

Returns an OsString on success.

- -

Returns an Err (containing an error message) if one of the input -Paths contains an invalid character for constructing the PATH -variable (a double quote on Windows or a colon on Unix).

- -

Examples

-
-use std::env;
-use std::path::PathBuf;
-
-if let Some(path) = env::var_os("PATH") {
-    let mut paths = env::split_paths(&path).collect::<Vec<_>>();
-    paths.push(PathBuf::from("/home/xyz/bin"));
-    let new_path = env::join_paths(paths).unwrap();
-    env::set_var("PATH", &new_path);
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/fn.remove_var.html b/doc/bitflags/__core/env/fn.remove_var.html deleted file mode 100644 index 50ee954a..00000000 --- a/doc/bitflags/__core/env/fn.remove_var.html +++ /dev/null @@ -1,142 +0,0 @@ - - - - - - - - - - bitflags::__core::env::remove_var - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::env::remove_var - - [−] - - [src]

-
pub fn remove_var<K>(k: K) where K: AsRef<OsStr>
1.0.0

Removes an environment variable from the environment of the currently running process.

- -

Note that while concurrent access to environment variables is safe in Rust, -some platforms only expose inherently unsafe non-threadsafe APIs for -inspecting the environment. As a result extra care needs to be taken when -auditing calls to unsafe external FFI functions to ensure that any external -environment accesses are properly synchronized with accesses in Rust.

- -

Discussion of this unsafety on Unix may be found in:

- - - -

Panics

-

This function may panic if key is empty, contains an ASCII equals sign -'=' or the NUL character '\0', or when the value contains the NUL -character.

- -

Examples

-
-use std::env;
-
-let key = "KEY";
-env::set_var(key, "VALUE");
-assert_eq!(env::var(key), Ok("VALUE".to_string()));
-
-env::remove_var(key);
-assert!(env::var(key).is_err());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/fn.set_current_dir.html b/doc/bitflags/__core/env/fn.set_current_dir.html deleted file mode 100644 index aa0b4a93..00000000 --- a/doc/bitflags/__core/env/fn.set_current_dir.html +++ /dev/null @@ -1,123 +0,0 @@ - - - - - - - - - - bitflags::__core::env::set_current_dir - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::env::set_current_dir - - [−] - - [src]

-
pub fn set_current_dir<P>(p: P) -> Result<(), Error> where P: AsRef<Path>
1.0.0

Changes the current working directory to the specified path, returning -whether the change was completed successfully or not.

- -

Examples

-
-use std::env;
-use std::path::Path;
-
-let root = Path::new("/");
-assert!(env::set_current_dir(&root).is_ok());
-println!("Successfully changed working directory to {}!", root.display());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/fn.set_var.html b/doc/bitflags/__core/env/fn.set_var.html deleted file mode 100644 index a4941f14..00000000 --- a/doc/bitflags/__core/env/fn.set_var.html +++ /dev/null @@ -1,140 +0,0 @@ - - - - - - - - - - bitflags::__core::env::set_var - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::env::set_var - - [−] - - [src]

-
pub fn set_var<K, V>(k: K, v: V) where K: AsRef<OsStr>, V: AsRef<OsStr>
1.0.0

Sets the environment variable k to the value v for the currently running -process.

- -

Note that while concurrent access to environment variables is safe in Rust, -some platforms only expose inherently unsafe non-threadsafe APIs for -inspecting the environment. As a result extra care needs to be taken when -auditing calls to unsafe external FFI functions to ensure that any external -environment accesses are properly synchronized with accesses in Rust.

- -

Discussion of this unsafety on Unix may be found in:

- - - -

Panics

-

This function may panic if key is empty, contains an ASCII equals sign -'=' or the NUL character '\0', or when the value contains the NUL -character.

- -

Examples

-
-use std::env;
-
-let key = "KEY";
-env::set_var(key, "VALUE");
-assert_eq!(env::var(key), Ok("VALUE".to_string()));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/fn.split_paths.html b/doc/bitflags/__core/env/fn.split_paths.html deleted file mode 100644 index f1545c6c..00000000 --- a/doc/bitflags/__core/env/fn.split_paths.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::env::split_paths - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::env::split_paths - - [−] - - [src]

-
pub fn split_paths<T>(unparsed: &T) -> SplitPaths where T: AsRef<OsStr> + ?Sized
1.0.0

Parses input according to platform conventions for the PATH -environment variable.

- -

Returns an iterator over the paths contained in unparsed.

- -

Examples

-
-use std::env;
-
-let key = "PATH";
-match env::var_os(key) {
-    Some(paths) => {
-        for path in env::split_paths(&paths) {
-            println!("'{}'", path.display());
-        }
-    }
-    None => println!("{} is not defined in the environment.", key)
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/fn.temp_dir.html b/doc/bitflags/__core/env/fn.temp_dir.html deleted file mode 100644 index c56b5e56..00000000 --- a/doc/bitflags/__core/env/fn.temp_dir.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - bitflags::__core::env::temp_dir - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::env::temp_dir - - [−] - - [src]

-
pub fn temp_dir() -> PathBuf
1.0.0

Returns the path of a temporary directory.

- -

On Unix, returns the value of the 'TMPDIR' environment variable if it is -set, otherwise for non-Android it returns '/tmp'. If Android, since there -is no global temporary folder (it is usually allocated per-app), we return -'/data/local/tmp'.

- -

On Windows, returns the value of, in order, the 'TMP', 'TEMP', -'USERPROFILE' environment variable if any are set and not the empty -string. Otherwise, tmpdir returns the path of the Windows directory. This -behavior is identical to that of GetTempPath, which this function -uses internally.

- -
-use std::env;
-use std::fs::File;
-
-let mut dir = env::temp_dir();
-dir.push("foo.txt");
-
-let f = try!(File::create(dir));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/fn.var.html b/doc/bitflags/__core/env/fn.var.html deleted file mode 100644 index ddcd711b..00000000 --- a/doc/bitflags/__core/env/fn.var.html +++ /dev/null @@ -1,127 +0,0 @@ - - - - - - - - - - bitflags::__core::env::var - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::env::var - - [−] - - [src]

-
pub fn var<K>(key: K) -> Result<String, VarError> where K: AsRef<OsStr>
1.0.0

Fetches the environment variable key from the current process.

- -

The returned result is Ok(s) if the environment variable is present and is -valid unicode. If the environment variable is not present, or it is not -valid unicode, then Err will be returned.

- -

Examples

-
-use std::env;
-
-let key = "HOME";
-match env::var(key) {
-    Ok(val) => println!("{}: {:?}", key, val),
-    Err(e) => println!("couldn't interpret {}: {}", key, e),
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/fn.var_os.html b/doc/bitflags/__core/env/fn.var_os.html deleted file mode 100644 index 120b5ace..00000000 --- a/doc/bitflags/__core/env/fn.var_os.html +++ /dev/null @@ -1,124 +0,0 @@ - - - - - - - - - - bitflags::__core::env::var_os - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::env::var_os - - [−] - - [src]

-
pub fn var_os<K>(key: K) -> Option<OsString> where K: AsRef<OsStr>
1.0.0

Fetches the environment variable key from the current process, returning -None if the variable isn't set.

- -

Examples

-
-use std::env;
-
-let key = "HOME";
-match env::var_os(key) {
-    Some(val) => println!("{}: {:?}", key, val),
-    None => println!("{} is not defined in the environment.", key)
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/fn.vars.html b/doc/bitflags/__core/env/fn.vars.html deleted file mode 100644 index 24630b7d..00000000 --- a/doc/bitflags/__core/env/fn.vars.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - bitflags::__core::env::vars - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::env::vars - - [−] - - [src]

-
pub fn vars() -> Vars
1.0.0

Returns an iterator of (variable, value) pairs of strings, for all the -environment variables of the current process.

- -

The returned iterator contains a snapshot of the process's environment -variables at the time of this invocation, modifications to environment -variables afterwards will not be reflected in the returned iterator.

- -

Panics

-

While iterating, the returned iterator will panic if any key or value in the -environment is not valid unicode. If this is not desired, consider using the -env::vars_os function.

- -

Examples

-
-use std::env;
-
-// We will iterate through the references to the element returned by
-// env::vars();
-for (key, value) in env::vars() {
-    println!("{}: {}", key, value);
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/fn.vars_os.html b/doc/bitflags/__core/env/fn.vars_os.html deleted file mode 100644 index 09e47fdd..00000000 --- a/doc/bitflags/__core/env/fn.vars_os.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::env::vars_os - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::env::vars_os - - [−] - - [src]

-
pub fn vars_os() -> VarsOs
1.0.0

Returns an iterator of (variable, value) pairs of OS strings, for all the -environment variables of the current process.

- -

The returned iterator contains a snapshot of the process's environment -variables at the time of this invocation, modifications to environment -variables afterwards will not be reflected in the returned iterator.

- -

Examples

-
-use std::env;
-
-// We will iterate through the references to the element returned by
-// env::vars_os();
-for (key, value) in env::vars_os() {
-    println!("{:?}: {:?}", key, value);
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/index.html b/doc/bitflags/__core/env/index.html deleted file mode 100644 index ef26e9e0..00000000 --- a/doc/bitflags/__core/env/index.html +++ /dev/null @@ -1,295 +0,0 @@ - - - - - - - - - - bitflags::__core::env - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::env - - [−] - - [src]

-

Inspection and manipulation of the process's environment.

- -

This module contains methods to inspect various aspects such as -environment variables, process arguments, the current directory, and various -other important directories.

-

Modules

- - - - -
consts -

Constants associated with the current target

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - -
Args -

An iterator over the arguments of a process, yielding a String value -for each argument.

-
ArgsOs -

An iterator over the arguments of a process, yielding an OsString value -for each argument.

-
JoinPathsError -

Error type returned from std::env::join_paths when paths fail to be -joined.

-
SplitPaths -

An iterator over PathBuf instances for parsing an environment variable -according to platform-specific conventions.

-
Vars -

An iterator over a snapshot of the environment variables of this process.

-
VarsOs -

An iterator over a snapshot of the environment variables of this process.

-

Enums

- - - - -
VarError -

Possible errors from the env::var method.

-

Functions

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
args -

Returns the arguments which this program was started with (normally passed -via the command line).

-
args_os -

Returns the arguments which this program was started with (normally passed -via the command line).

-
current_dir -

Returns the current working directory as a PathBuf.

-
current_exe -

Returns the full filesystem path of the current running executable.

-
home_dir -

Returns the path of the current user's home directory if known.

-
join_paths -

Joins a collection of Paths appropriately for the PATH -environment variable.

-
remove_var -

Removes an environment variable from the environment of the currently running process.

-
set_current_dir -

Changes the current working directory to the specified path, returning -whether the change was completed successfully or not.

-
set_var -

Sets the environment variable k to the value v for the currently running -process.

-
split_paths -

Parses input according to platform conventions for the PATH -environment variable.

-
temp_dir -

Returns the path of a temporary directory.

-
var -

Fetches the environment variable key from the current process.

-
var_os -

Fetches the environment variable key from the current process, returning -None if the variable isn't set.

-
vars -

Returns an iterator of (variable, value) pairs of strings, for all the -environment variables of the current process.

-
vars_os -

Returns an iterator of (variable, value) pairs of OS strings, for all the -environment variables of the current process.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/sidebar-items.js b/doc/bitflags/__core/env/sidebar-items.js deleted file mode 100644 index 3baa8426..00000000 --- a/doc/bitflags/__core/env/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["VarError","Possible errors from the `env::var` method."]],"fn":[["args","Returns the arguments which this program was started with (normally passed via the command line)."],["args_os","Returns the arguments which this program was started with (normally passed via the command line)."],["current_dir","Returns the current working directory as a `PathBuf`."],["current_exe","Returns the full filesystem path of the current running executable."],["home_dir","Returns the path of the current user's home directory if known."],["join_paths","Joins a collection of `Path`s appropriately for the `PATH` environment variable."],["remove_var","Removes an environment variable from the environment of the currently running process."],["set_current_dir","Changes the current working directory to the specified path, returning whether the change was completed successfully or not."],["set_var","Sets the environment variable `k` to the value `v` for the currently running process."],["split_paths","Parses input according to platform conventions for the `PATH` environment variable."],["temp_dir","Returns the path of a temporary directory."],["var","Fetches the environment variable `key` from the current process."],["var_os","Fetches the environment variable `key` from the current process, returning `None` if the variable isn't set."],["vars","Returns an iterator of (variable, value) pairs of strings, for all the environment variables of the current process."],["vars_os","Returns an iterator of (variable, value) pairs of OS strings, for all the environment variables of the current process."]],"mod":[["consts","Constants associated with the current target"]],"struct":[["Args","An iterator over the arguments of a process, yielding a `String` value for each argument."],["ArgsOs","An iterator over the arguments of a process, yielding an `OsString` value for each argument."],["JoinPathsError","Error type returned from `std::env::join_paths` when paths fail to be joined."],["SplitPaths","An iterator over `PathBuf` instances for parsing an environment variable according to platform-specific conventions."],["Vars","An iterator over a snapshot of the environment variables of this process."],["VarsOs","An iterator over a snapshot of the environment variables of this process."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/env/struct.Args.html b/doc/bitflags/__core/env/struct.Args.html deleted file mode 100644 index 286d09c6..00000000 --- a/doc/bitflags/__core/env/struct.Args.html +++ /dev/null @@ -1,167 +0,0 @@ - - - - - - - - - - bitflags::__core::env::Args - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::env::Args - - [−] - - [src]

-
pub struct Args {
-    // some fields omitted
-}
1.0.0

An iterator over the arguments of a process, yielding a String value -for each argument.

- -

This structure is created through the std::env::args method.

-

Trait Implementations

impl Iterator for Args

type Item = String

-

fn next(&mut self) -> Option<String>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl ExactSizeIterator for Args

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/struct.ArgsOs.html b/doc/bitflags/__core/env/struct.ArgsOs.html deleted file mode 100644 index 8c5b4cd4..00000000 --- a/doc/bitflags/__core/env/struct.ArgsOs.html +++ /dev/null @@ -1,167 +0,0 @@ - - - - - - - - - - bitflags::__core::env::ArgsOs - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::env::ArgsOs - - [−] - - [src]

-
pub struct ArgsOs {
-    // some fields omitted
-}
1.0.0

An iterator over the arguments of a process, yielding an OsString value -for each argument.

- -

This structure is created through the std::env::args_os method.

-

Trait Implementations

impl Iterator for ArgsOs

type Item = OsString

-

fn next(&mut self) -> Option<OsString>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl ExactSizeIterator for ArgsOs

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/struct.JoinPathsError.html b/doc/bitflags/__core/env/struct.JoinPathsError.html deleted file mode 100644 index d63cbdb7..00000000 --- a/doc/bitflags/__core/env/struct.JoinPathsError.html +++ /dev/null @@ -1,120 +0,0 @@ - - - - - - - - - - bitflags::__core::env::JoinPathsError - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::env::JoinPathsError - - [−] - - [src]

-
pub struct JoinPathsError {
-    // some fields omitted
-}
1.0.0

Error type returned from std::env::join_paths when paths fail to be -joined.

-

Trait Implementations

impl Display for JoinPathsError

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl Error for JoinPathsError

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

Derived Implementations

impl Debug for JoinPathsError

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/struct.SplitPaths.html b/doc/bitflags/__core/env/struct.SplitPaths.html deleted file mode 100644 index 85145831..00000000 --- a/doc/bitflags/__core/env/struct.SplitPaths.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::env::SplitPaths - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::env::SplitPaths - - [−] - - [src]

-
pub struct SplitPaths<'a> {
-    // some fields omitted
-}
1.0.0

An iterator over PathBuf instances for parsing an environment variable -according to platform-specific conventions.

- -

This structure is returned from std::env::split_paths.

-

Trait Implementations

impl<'a> Iterator for SplitPaths<'a>

type Item = PathBuf

-

fn next(&mut self) -> Option<PathBuf>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/struct.Vars.html b/doc/bitflags/__core/env/struct.Vars.html deleted file mode 100644 index 5d98dc9b..00000000 --- a/doc/bitflags/__core/env/struct.Vars.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::env::Vars - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::env::Vars - - [−] - - [src]

-
pub struct Vars {
-    // some fields omitted
-}
1.0.0

An iterator over a snapshot of the environment variables of this process.

- -

This iterator is created through std::env::vars() and yields (String, String) pairs.

-

Trait Implementations

impl Iterator for Vars

type Item = (String, String)

-

fn next(&mut self) -> Option<(String, String)>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/env/struct.VarsOs.html b/doc/bitflags/__core/env/struct.VarsOs.html deleted file mode 100644 index 42849389..00000000 --- a/doc/bitflags/__core/env/struct.VarsOs.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::env::VarsOs - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::env::VarsOs - - [−] - - [src]

-
pub struct VarsOs {
-    // some fields omitted
-}
1.0.0

An iterator over a snapshot of the environment variables of this process.

- -

This iterator is created through std::env::vars_os() and yields -(OsString, OsString) pairs.

-

Trait Implementations

impl Iterator for VarsOs

type Item = (OsString, OsString)

-

fn next(&mut self) -> Option<(OsString, OsString)>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/error/index.html b/doc/bitflags/__core/error/index.html deleted file mode 100644 index 95914052..00000000 --- a/doc/bitflags/__core/error/index.html +++ /dev/null @@ -1,144 +0,0 @@ - - - - - - - - - - bitflags::__core::error - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::error - - [−] - - [src]

-

Traits for working with Errors.

- -

The Error trait

-

Error is a trait representing the basic expectations for error values, -i.e. values of type E in Result<T, E>. At a minimum, errors must provide -a description, but they may optionally provide additional detail (via -Display) and cause chain information:

- -
-use std::fmt::Display;
-
-trait Error: Display {
-    fn description(&self) -> &str;
-
-    fn cause(&self) -> Option<&Error> { None }
-}
- -

The cause method is generally used when errors cross "abstraction -boundaries", i.e. when a one module must report an error that is "caused" -by an error from a lower-level module. This setup makes it possible for the -high-level module to provide its own errors that do not commit to any -particular implementation, but also reveal some of its implementation for -debugging via cause chains.

-

Traits

- - - - -
Error -

Base functionality for all errors in Rust.

-

Implementations

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/error/sidebar-items.js b/doc/bitflags/__core/error/sidebar-items.js deleted file mode 100644 index 371cc6b8..00000000 --- a/doc/bitflags/__core/error/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"trait":[["Error","Base functionality for all errors in Rust."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/error/trait.Error.html b/doc/bitflags/__core/error/trait.Error.html deleted file mode 100644 index 5fcd56a2..00000000 --- a/doc/bitflags/__core/error/trait.Error.html +++ /dev/null @@ -1,185 +0,0 @@ - - - - - - - - - - bitflags::__core::error::Error - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::error::Error - - [−] - - [src]

-
pub trait Error: Reflect + Debug + Display {
-    fn description(&self) -> &str;
-
-    fn cause(&self) -> Option<&Error> { ... }
-}

Base functionality for all errors in Rust.

-
-

Required Methods

-
-

fn description(&self) -> &str

A short description of the error.

- -

The description should not contain newlines or sentence-ending -punctuation, to facilitate embedding in larger user-facing -strings.

-
-

Provided Methods

-
-

fn cause(&self) -> Option<&Error>

The lower-level cause of this error, if any.

-

Methods

impl Error + 'static

fn is<T>(&self) -> bool where T: 'static + Error1.3.0

-

Returns true if the boxed type is the same as T

-

fn downcast_ref<T>(&self) -> Option<&T> where T: 'static + Error1.3.0

-

Returns some reference to the boxed value if it is of type T, or -None if it isn't.

-

fn downcast_mut<T>(&mut self) -> Option<&mut T> where T: 'static + Error1.3.0

-

Returns some mutable reference to the boxed value if it is of type T, or -None if it isn't.

-

impl Error + 'static + Send

fn is<T>(&self) -> bool where T: 'static + Error1.3.0

-

Forwards to the method defined on the type Any.

-

fn downcast_ref<T>(&self) -> Option<&T> where T: 'static + Error1.3.0

-

Forwards to the method defined on the type Any.

-

fn downcast_mut<T>(&mut self) -> Option<&mut T> where T: 'static + Error1.3.0

-

Forwards to the method defined on the type Any.

-

impl Error + 'static + Send + Sync

fn is<T>(&self) -> bool where T: 'static + Error1.3.0

-

Forwards to the method defined on the type Any.

-

fn downcast_ref<T>(&self) -> Option<&T> where T: 'static + Error1.3.0

-

Forwards to the method defined on the type Any.

-

fn downcast_mut<T>(&mut self) -> Option<&mut T> where T: 'static + Error1.3.0

-

Forwards to the method defined on the type Any.

-

impl Error + 'static

fn downcast<T>(self: Box<Error + 'static>) -> Result<Box<T>, Box<Error + 'static>> where T: 'static + Error1.3.0

-

Attempt to downcast the box to a concrete type.

-

impl Error + 'static + Send

fn downcast<T>(self: Box<Error + 'static + Send>) -> Result<Box<T>, Box<Error + 'static + Send>> where T: 'static + Error1.3.0

-

Attempt to downcast the box to a concrete type.

-

impl Error + 'static + Send + Sync

fn downcast<T>(self: Box<Error + 'static + Send + Sync>) -> Result<Box<T>, Box<Error + 'static + Send + Sync>> where T: 'static + Error1.3.0

-

Attempt to downcast the box to a concrete type.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/constant.DIGITS.html b/doc/bitflags/__core/f32/constant.DIGITS.html deleted file mode 100644 index 10c9854d..00000000 --- a/doc/bitflags/__core/f32/constant.DIGITS.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::DIGITS - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::DIGITS - - [−] - - [src]

-
pub const DIGITS: u32 = 6
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/constant.EPSILON.html b/doc/bitflags/__core/f32/constant.EPSILON.html deleted file mode 100644 index 9f2a2d3d..00000000 --- a/doc/bitflags/__core/f32/constant.EPSILON.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::EPSILON - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::EPSILON - - [−] - - [src]

-
pub const EPSILON: f32 = 1.19209290e-07f32
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/constant.INFINITY.html b/doc/bitflags/__core/f32/constant.INFINITY.html deleted file mode 100644 index 39d60b2a..00000000 --- a/doc/bitflags/__core/f32/constant.INFINITY.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::INFINITY - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::INFINITY - - [−] - - [src]

-
pub const INFINITY: f32 = 1.0f32 / 0.0f32
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/constant.MANTISSA_DIGITS.html b/doc/bitflags/__core/f32/constant.MANTISSA_DIGITS.html deleted file mode 100644 index 5b4d6590..00000000 --- a/doc/bitflags/__core/f32/constant.MANTISSA_DIGITS.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::MANTISSA_DIGITS - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::MANTISSA_DIGITS - - [−] - - [src]

-
pub const MANTISSA_DIGITS: u32 = 24
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/constant.MAX.html b/doc/bitflags/__core/f32/constant.MAX.html deleted file mode 100644 index a3443822..00000000 --- a/doc/bitflags/__core/f32/constant.MAX.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::MAX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::MAX - - [−] - - [src]

-
pub const MAX: f32 = 3.40282347e+38f32

Largest finite f32 value

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/constant.MAX_10_EXP.html b/doc/bitflags/__core/f32/constant.MAX_10_EXP.html deleted file mode 100644 index 91ac31ba..00000000 --- a/doc/bitflags/__core/f32/constant.MAX_10_EXP.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::MAX_10_EXP - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::MAX_10_EXP - - [−] - - [src]

-
pub const MAX_10_EXP: i32 = 38
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/constant.MAX_EXP.html b/doc/bitflags/__core/f32/constant.MAX_EXP.html deleted file mode 100644 index e47470eb..00000000 --- a/doc/bitflags/__core/f32/constant.MAX_EXP.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::MAX_EXP - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::MAX_EXP - - [−] - - [src]

-
pub const MAX_EXP: i32 = 128
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/constant.MIN.html b/doc/bitflags/__core/f32/constant.MIN.html deleted file mode 100644 index a4d49ed6..00000000 --- a/doc/bitflags/__core/f32/constant.MIN.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::MIN - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::MIN - - [−] - - [src]

-
pub const MIN: f32 = -3.40282347e+38f32

Smallest finite f32 value

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/constant.MIN_10_EXP.html b/doc/bitflags/__core/f32/constant.MIN_10_EXP.html deleted file mode 100644 index 710c72fc..00000000 --- a/doc/bitflags/__core/f32/constant.MIN_10_EXP.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::MIN_10_EXP - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::MIN_10_EXP - - [−] - - [src]

-
pub const MIN_10_EXP: i32 = -37
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/constant.MIN_EXP.html b/doc/bitflags/__core/f32/constant.MIN_EXP.html deleted file mode 100644 index e58e9f10..00000000 --- a/doc/bitflags/__core/f32/constant.MIN_EXP.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::MIN_EXP - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::MIN_EXP - - [−] - - [src]

-
pub const MIN_EXP: i32 = -125
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/constant.MIN_POSITIVE.html b/doc/bitflags/__core/f32/constant.MIN_POSITIVE.html deleted file mode 100644 index 7d4c946a..00000000 --- a/doc/bitflags/__core/f32/constant.MIN_POSITIVE.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::MIN_POSITIVE - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::MIN_POSITIVE - - [−] - - [src]

-
pub const MIN_POSITIVE: f32 = 1.17549435e-38f32

Smallest positive, normalized f32 value

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/constant.NAN.html b/doc/bitflags/__core/f32/constant.NAN.html deleted file mode 100644 index d67199ea..00000000 --- a/doc/bitflags/__core/f32/constant.NAN.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::NAN - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::NAN - - [−] - - [src]

-
pub const NAN: f32 = 0.0f32 / 0.0f32
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/constant.NEG_INFINITY.html b/doc/bitflags/__core/f32/constant.NEG_INFINITY.html deleted file mode 100644 index 1885dbd2..00000000 --- a/doc/bitflags/__core/f32/constant.NEG_INFINITY.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::NEG_INFINITY - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::NEG_INFINITY - - [−] - - [src]

-
pub const NEG_INFINITY: f32 = -1.0f32 / 0.0f32
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/constant.RADIX.html b/doc/bitflags/__core/f32/constant.RADIX.html deleted file mode 100644 index 7b6a6961..00000000 --- a/doc/bitflags/__core/f32/constant.RADIX.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::RADIX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::RADIX - - [−] - - [src]

-
pub const RADIX: u32 = 2
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.E.html b/doc/bitflags/__core/f32/consts/constant.E.html deleted file mode 100644 index a2bef014..00000000 --- a/doc/bitflags/__core/f32/consts/constant.E.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::E - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::E - - [−] - - [src]

-
pub const E: f32 = 2.71828182845904523536028747135266250f32

Euler's number

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.FRAC_1_PI.html b/doc/bitflags/__core/f32/consts/constant.FRAC_1_PI.html deleted file mode 100644 index 00127d91..00000000 --- a/doc/bitflags/__core/f32/consts/constant.FRAC_1_PI.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::FRAC_1_PI - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::FRAC_1_PI - - [−] - - [src]

-
pub const FRAC_1_PI: f32 = 0.318309886183790671537767526745028724f32

1.0/pi

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.FRAC_1_SQRT_2.html b/doc/bitflags/__core/f32/consts/constant.FRAC_1_SQRT_2.html deleted file mode 100644 index d7afc272..00000000 --- a/doc/bitflags/__core/f32/consts/constant.FRAC_1_SQRT_2.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::FRAC_1_SQRT_2 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::FRAC_1_SQRT_2 - - [−] - - [src]

-
pub const FRAC_1_SQRT_2: f32 = 0.707106781186547524400844362104849039f32

1.0/sqrt(2.0)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.FRAC_2_PI.html b/doc/bitflags/__core/f32/consts/constant.FRAC_2_PI.html deleted file mode 100644 index 6c7bbf32..00000000 --- a/doc/bitflags/__core/f32/consts/constant.FRAC_2_PI.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::FRAC_2_PI - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::FRAC_2_PI - - [−] - - [src]

-
pub const FRAC_2_PI: f32 = 0.636619772367581343075535053490057448f32

2.0/pi

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.FRAC_2_SQRT_PI.html b/doc/bitflags/__core/f32/consts/constant.FRAC_2_SQRT_PI.html deleted file mode 100644 index 44a02277..00000000 --- a/doc/bitflags/__core/f32/consts/constant.FRAC_2_SQRT_PI.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::FRAC_2_SQRT_PI - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::FRAC_2_SQRT_PI - - [−] - - [src]

-
pub const FRAC_2_SQRT_PI: f32 = 1.12837916709551257389615890312154517f32

2.0/sqrt(pi)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.FRAC_PI_2.html b/doc/bitflags/__core/f32/consts/constant.FRAC_PI_2.html deleted file mode 100644 index fc0fbb31..00000000 --- a/doc/bitflags/__core/f32/consts/constant.FRAC_PI_2.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::FRAC_PI_2 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::FRAC_PI_2 - - [−] - - [src]

-
pub const FRAC_PI_2: f32 = 1.57079632679489661923132169163975144f32

pi/2.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.FRAC_PI_3.html b/doc/bitflags/__core/f32/consts/constant.FRAC_PI_3.html deleted file mode 100644 index 02ee7448..00000000 --- a/doc/bitflags/__core/f32/consts/constant.FRAC_PI_3.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::FRAC_PI_3 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::FRAC_PI_3 - - [−] - - [src]

-
pub const FRAC_PI_3: f32 = 1.04719755119659774615421446109316763f32

pi/3.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.FRAC_PI_4.html b/doc/bitflags/__core/f32/consts/constant.FRAC_PI_4.html deleted file mode 100644 index 21c23394..00000000 --- a/doc/bitflags/__core/f32/consts/constant.FRAC_PI_4.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::FRAC_PI_4 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::FRAC_PI_4 - - [−] - - [src]

-
pub const FRAC_PI_4: f32 = 0.785398163397448309615660845819875721f32

pi/4.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.FRAC_PI_6.html b/doc/bitflags/__core/f32/consts/constant.FRAC_PI_6.html deleted file mode 100644 index 689239c9..00000000 --- a/doc/bitflags/__core/f32/consts/constant.FRAC_PI_6.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::FRAC_PI_6 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::FRAC_PI_6 - - [−] - - [src]

-
pub const FRAC_PI_6: f32 = 0.52359877559829887307710723054658381f32

pi/6.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.FRAC_PI_8.html b/doc/bitflags/__core/f32/consts/constant.FRAC_PI_8.html deleted file mode 100644 index a299a482..00000000 --- a/doc/bitflags/__core/f32/consts/constant.FRAC_PI_8.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::FRAC_PI_8 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::FRAC_PI_8 - - [−] - - [src]

-
pub const FRAC_PI_8: f32 = 0.39269908169872415480783042290993786f32

pi/8.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.LN_10.html b/doc/bitflags/__core/f32/consts/constant.LN_10.html deleted file mode 100644 index 9484ac5b..00000000 --- a/doc/bitflags/__core/f32/consts/constant.LN_10.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::LN_10 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::LN_10 - - [−] - - [src]

-
pub const LN_10: f32 = 2.30258509299404568401799145468436421f32

ln(10.0)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.LN_2.html b/doc/bitflags/__core/f32/consts/constant.LN_2.html deleted file mode 100644 index 3a16f71b..00000000 --- a/doc/bitflags/__core/f32/consts/constant.LN_2.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::LN_2 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::LN_2 - - [−] - - [src]

-
pub const LN_2: f32 = 0.693147180559945309417232121458176568f32

ln(2.0)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.LOG10_E.html b/doc/bitflags/__core/f32/consts/constant.LOG10_E.html deleted file mode 100644 index 3862387a..00000000 --- a/doc/bitflags/__core/f32/consts/constant.LOG10_E.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::LOG10_E - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::LOG10_E - - [−] - - [src]

-
pub const LOG10_E: f32 = 0.434294481903251827651128918916605082f32

log10(e)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.LOG2_E.html b/doc/bitflags/__core/f32/consts/constant.LOG2_E.html deleted file mode 100644 index a91987bb..00000000 --- a/doc/bitflags/__core/f32/consts/constant.LOG2_E.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::LOG2_E - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::LOG2_E - - [−] - - [src]

-
pub const LOG2_E: f32 = 1.44269504088896340735992468100189214f32

log2(e)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.PI.html b/doc/bitflags/__core/f32/consts/constant.PI.html deleted file mode 100644 index 28b69e62..00000000 --- a/doc/bitflags/__core/f32/consts/constant.PI.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::PI - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::PI - - [−] - - [src]

-
pub const PI: f32 = 3.14159265358979323846264338327950288f32

Archimedes' constant

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/constant.SQRT_2.html b/doc/bitflags/__core/f32/consts/constant.SQRT_2.html deleted file mode 100644 index 73ebbb9c..00000000 --- a/doc/bitflags/__core/f32/consts/constant.SQRT_2.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts::SQRT_2 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f32::consts::SQRT_2 - - [−] - - [src]

-
pub const SQRT_2: f32 = 1.41421356237309504880168872420969808f32

sqrt(2.0)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/index.html b/doc/bitflags/__core/f32/consts/index.html deleted file mode 100644 index a6c33fb1..00000000 --- a/doc/bitflags/__core/f32/consts/index.html +++ /dev/null @@ -1,226 +0,0 @@ - - - - - - - - - - bitflags::__core::f32::consts - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::f32::consts - - [−] - - [src]

-

Basic mathematical constants.

-

Constants

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
E -

Euler's number

-
FRAC_1_PI -

1.0/pi

-
FRAC_1_SQRT_2 -

1.0/sqrt(2.0)

-
FRAC_2_PI -

2.0/pi

-
FRAC_2_SQRT_PI -

2.0/sqrt(pi)

-
FRAC_PI_2 -

pi/2.0

-
FRAC_PI_3 -

pi/3.0

-
FRAC_PI_4 -

pi/4.0

-
FRAC_PI_6 -

pi/6.0

-
FRAC_PI_8 -

pi/8.0

-
LN_10 -

ln(10.0)

-
LN_2 -

ln(2.0)

-
LOG10_E -

log10(e)

-
LOG2_E -

log2(e)

-
PI -

Archimedes' constant

-
SQRT_2 -

sqrt(2.0)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/consts/sidebar-items.js b/doc/bitflags/__core/f32/consts/sidebar-items.js deleted file mode 100644 index 2113e97a..00000000 --- a/doc/bitflags/__core/f32/consts/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["E","Euler's number"],["FRAC_1_PI","1.0/pi"],["FRAC_1_SQRT_2","1.0/sqrt(2.0)"],["FRAC_2_PI","2.0/pi"],["FRAC_2_SQRT_PI","2.0/sqrt(pi)"],["FRAC_PI_2","pi/2.0"],["FRAC_PI_3","pi/3.0"],["FRAC_PI_4","pi/4.0"],["FRAC_PI_6","pi/6.0"],["FRAC_PI_8","pi/8.0"],["LN_10","ln(10.0)"],["LN_2","ln(2.0)"],["LOG10_E","log10(e)"],["LOG2_E","log2(e)"],["PI","Archimedes' constant"],["SQRT_2","sqrt(2.0)"]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/f32/index.html b/doc/bitflags/__core/f32/index.html deleted file mode 100644 index 7554f6d8..00000000 --- a/doc/bitflags/__core/f32/index.html +++ /dev/null @@ -1,222 +0,0 @@ - - - - - - - - - - bitflags::__core::f32 - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::f32 - - [−] - - [src]

-

The 32-bit floating point type.

- -

See also the f32 primitive type.

-

Modules

- - - - -
consts -

Basic mathematical constants.

-

Constants

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
DIGITS - -
EPSILON - -
INFINITY - -
MANTISSA_DIGITS - -
MAX -

Largest finite f32 value

-
MAX_10_EXP - -
MAX_EXP - -
MIN -

Smallest finite f32 value

-
MIN_10_EXP - -
MIN_EXP - -
MIN_POSITIVE -

Smallest positive, normalized f32 value

-
NAN - -
NEG_INFINITY - -
RADIX - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f32/sidebar-items.js b/doc/bitflags/__core/f32/sidebar-items.js deleted file mode 100644 index 98bc7276..00000000 --- a/doc/bitflags/__core/f32/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["DIGITS",""],["EPSILON",""],["INFINITY",""],["MANTISSA_DIGITS",""],["MAX","Largest finite f32 value"],["MAX_10_EXP",""],["MAX_EXP",""],["MIN","Smallest finite f32 value"],["MIN_10_EXP",""],["MIN_EXP",""],["MIN_POSITIVE","Smallest positive, normalized f32 value"],["NAN",""],["NEG_INFINITY",""],["RADIX",""]],"mod":[["consts","Basic mathematical constants."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/f64/constant.DIGITS.html b/doc/bitflags/__core/f64/constant.DIGITS.html deleted file mode 100644 index 6afee536..00000000 --- a/doc/bitflags/__core/f64/constant.DIGITS.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::DIGITS - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::DIGITS - - [−] - - [src]

-
pub const DIGITS: u32 = 15
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/constant.EPSILON.html b/doc/bitflags/__core/f64/constant.EPSILON.html deleted file mode 100644 index a935fccb..00000000 --- a/doc/bitflags/__core/f64/constant.EPSILON.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::EPSILON - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::EPSILON - - [−] - - [src]

-
pub const EPSILON: f64 = 2.2204460492503131e-16f64
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/constant.INFINITY.html b/doc/bitflags/__core/f64/constant.INFINITY.html deleted file mode 100644 index 315a04e3..00000000 --- a/doc/bitflags/__core/f64/constant.INFINITY.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::INFINITY - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::INFINITY - - [−] - - [src]

-
pub const INFINITY: f64 = 1.0f64 / 0.0f64
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/constant.MANTISSA_DIGITS.html b/doc/bitflags/__core/f64/constant.MANTISSA_DIGITS.html deleted file mode 100644 index ddb9076a..00000000 --- a/doc/bitflags/__core/f64/constant.MANTISSA_DIGITS.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::MANTISSA_DIGITS - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::MANTISSA_DIGITS - - [−] - - [src]

-
pub const MANTISSA_DIGITS: u32 = 53
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/constant.MAX.html b/doc/bitflags/__core/f64/constant.MAX.html deleted file mode 100644 index 44091767..00000000 --- a/doc/bitflags/__core/f64/constant.MAX.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::MAX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::MAX - - [−] - - [src]

-
pub const MAX: f64 = 1.7976931348623157e+308f64

Largest finite f64 value

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/constant.MAX_10_EXP.html b/doc/bitflags/__core/f64/constant.MAX_10_EXP.html deleted file mode 100644 index be5881bf..00000000 --- a/doc/bitflags/__core/f64/constant.MAX_10_EXP.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::MAX_10_EXP - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::MAX_10_EXP - - [−] - - [src]

-
pub const MAX_10_EXP: i32 = 308
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/constant.MAX_EXP.html b/doc/bitflags/__core/f64/constant.MAX_EXP.html deleted file mode 100644 index 70d6a56c..00000000 --- a/doc/bitflags/__core/f64/constant.MAX_EXP.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::MAX_EXP - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::MAX_EXP - - [−] - - [src]

-
pub const MAX_EXP: i32 = 1024
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/constant.MIN.html b/doc/bitflags/__core/f64/constant.MIN.html deleted file mode 100644 index b462ea17..00000000 --- a/doc/bitflags/__core/f64/constant.MIN.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::MIN - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::MIN - - [−] - - [src]

-
pub const MIN: f64 = -1.7976931348623157e+308f64

Smallest finite f64 value

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/constant.MIN_10_EXP.html b/doc/bitflags/__core/f64/constant.MIN_10_EXP.html deleted file mode 100644 index 3551c586..00000000 --- a/doc/bitflags/__core/f64/constant.MIN_10_EXP.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::MIN_10_EXP - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::MIN_10_EXP - - [−] - - [src]

-
pub const MIN_10_EXP: i32 = -307
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/constant.MIN_EXP.html b/doc/bitflags/__core/f64/constant.MIN_EXP.html deleted file mode 100644 index 8efda852..00000000 --- a/doc/bitflags/__core/f64/constant.MIN_EXP.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::MIN_EXP - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::MIN_EXP - - [−] - - [src]

-
pub const MIN_EXP: i32 = -1021
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/constant.MIN_POSITIVE.html b/doc/bitflags/__core/f64/constant.MIN_POSITIVE.html deleted file mode 100644 index 8f6e1232..00000000 --- a/doc/bitflags/__core/f64/constant.MIN_POSITIVE.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::MIN_POSITIVE - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::MIN_POSITIVE - - [−] - - [src]

-
pub const MIN_POSITIVE: f64 = 2.2250738585072014e-308f64

Smallest positive, normalized f64 value

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/constant.NAN.html b/doc/bitflags/__core/f64/constant.NAN.html deleted file mode 100644 index 5da276fc..00000000 --- a/doc/bitflags/__core/f64/constant.NAN.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::NAN - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::NAN - - [−] - - [src]

-
pub const NAN: f64 = 0.0f64 / 0.0f64
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/constant.NEG_INFINITY.html b/doc/bitflags/__core/f64/constant.NEG_INFINITY.html deleted file mode 100644 index 20dcca81..00000000 --- a/doc/bitflags/__core/f64/constant.NEG_INFINITY.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::NEG_INFINITY - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::NEG_INFINITY - - [−] - - [src]

-
pub const NEG_INFINITY: f64 = -1.0f64 / 0.0f64
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/constant.RADIX.html b/doc/bitflags/__core/f64/constant.RADIX.html deleted file mode 100644 index b2dddffc..00000000 --- a/doc/bitflags/__core/f64/constant.RADIX.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::RADIX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::RADIX - - [−] - - [src]

-
pub const RADIX: u32 = 2
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.E.html b/doc/bitflags/__core/f64/consts/constant.E.html deleted file mode 100644 index 0edbb610..00000000 --- a/doc/bitflags/__core/f64/consts/constant.E.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::E - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::E - - [−] - - [src]

-
pub const E: f64 = 2.71828182845904523536028747135266250f64

Euler's number

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.FRAC_1_PI.html b/doc/bitflags/__core/f64/consts/constant.FRAC_1_PI.html deleted file mode 100644 index 8bea9f17..00000000 --- a/doc/bitflags/__core/f64/consts/constant.FRAC_1_PI.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::FRAC_1_PI - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::FRAC_1_PI - - [−] - - [src]

-
pub const FRAC_1_PI: f64 = 0.318309886183790671537767526745028724f64

1.0/pi

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.FRAC_1_SQRT_2.html b/doc/bitflags/__core/f64/consts/constant.FRAC_1_SQRT_2.html deleted file mode 100644 index 2b6ca553..00000000 --- a/doc/bitflags/__core/f64/consts/constant.FRAC_1_SQRT_2.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::FRAC_1_SQRT_2 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::FRAC_1_SQRT_2 - - [−] - - [src]

-
pub const FRAC_1_SQRT_2: f64 = 0.707106781186547524400844362104849039f64

1.0/sqrt(2.0)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.FRAC_2_PI.html b/doc/bitflags/__core/f64/consts/constant.FRAC_2_PI.html deleted file mode 100644 index 91922b9e..00000000 --- a/doc/bitflags/__core/f64/consts/constant.FRAC_2_PI.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::FRAC_2_PI - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::FRAC_2_PI - - [−] - - [src]

-
pub const FRAC_2_PI: f64 = 0.636619772367581343075535053490057448f64

2.0/pi

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.FRAC_2_SQRT_PI.html b/doc/bitflags/__core/f64/consts/constant.FRAC_2_SQRT_PI.html deleted file mode 100644 index 0278d9cd..00000000 --- a/doc/bitflags/__core/f64/consts/constant.FRAC_2_SQRT_PI.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::FRAC_2_SQRT_PI - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::FRAC_2_SQRT_PI - - [−] - - [src]

-
pub const FRAC_2_SQRT_PI: f64 = 1.12837916709551257389615890312154517f64

2.0/sqrt(pi)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.FRAC_PI_2.html b/doc/bitflags/__core/f64/consts/constant.FRAC_PI_2.html deleted file mode 100644 index fd824ce5..00000000 --- a/doc/bitflags/__core/f64/consts/constant.FRAC_PI_2.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::FRAC_PI_2 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::FRAC_PI_2 - - [−] - - [src]

-
pub const FRAC_PI_2: f64 = 1.57079632679489661923132169163975144f64

pi/2.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.FRAC_PI_3.html b/doc/bitflags/__core/f64/consts/constant.FRAC_PI_3.html deleted file mode 100644 index 4e2f86de..00000000 --- a/doc/bitflags/__core/f64/consts/constant.FRAC_PI_3.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::FRAC_PI_3 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::FRAC_PI_3 - - [−] - - [src]

-
pub const FRAC_PI_3: f64 = 1.04719755119659774615421446109316763f64

pi/3.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.FRAC_PI_4.html b/doc/bitflags/__core/f64/consts/constant.FRAC_PI_4.html deleted file mode 100644 index ea550255..00000000 --- a/doc/bitflags/__core/f64/consts/constant.FRAC_PI_4.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::FRAC_PI_4 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::FRAC_PI_4 - - [−] - - [src]

-
pub const FRAC_PI_4: f64 = 0.785398163397448309615660845819875721f64

pi/4.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.FRAC_PI_6.html b/doc/bitflags/__core/f64/consts/constant.FRAC_PI_6.html deleted file mode 100644 index 6dc9400a..00000000 --- a/doc/bitflags/__core/f64/consts/constant.FRAC_PI_6.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::FRAC_PI_6 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::FRAC_PI_6 - - [−] - - [src]

-
pub const FRAC_PI_6: f64 = 0.52359877559829887307710723054658381f64

pi/6.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.FRAC_PI_8.html b/doc/bitflags/__core/f64/consts/constant.FRAC_PI_8.html deleted file mode 100644 index e7773e7a..00000000 --- a/doc/bitflags/__core/f64/consts/constant.FRAC_PI_8.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::FRAC_PI_8 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::FRAC_PI_8 - - [−] - - [src]

-
pub const FRAC_PI_8: f64 = 0.39269908169872415480783042290993786f64

pi/8.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.LN_10.html b/doc/bitflags/__core/f64/consts/constant.LN_10.html deleted file mode 100644 index d2ff34a6..00000000 --- a/doc/bitflags/__core/f64/consts/constant.LN_10.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::LN_10 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::LN_10 - - [−] - - [src]

-
pub const LN_10: f64 = 2.30258509299404568401799145468436421f64

ln(10.0)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.LN_2.html b/doc/bitflags/__core/f64/consts/constant.LN_2.html deleted file mode 100644 index a71289cd..00000000 --- a/doc/bitflags/__core/f64/consts/constant.LN_2.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::LN_2 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::LN_2 - - [−] - - [src]

-
pub const LN_2: f64 = 0.693147180559945309417232121458176568f64

ln(2.0)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.LOG10_E.html b/doc/bitflags/__core/f64/consts/constant.LOG10_E.html deleted file mode 100644 index 6bfdda12..00000000 --- a/doc/bitflags/__core/f64/consts/constant.LOG10_E.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::LOG10_E - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::LOG10_E - - [−] - - [src]

-
pub const LOG10_E: f64 = 0.434294481903251827651128918916605082f64

log10(e)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.LOG2_E.html b/doc/bitflags/__core/f64/consts/constant.LOG2_E.html deleted file mode 100644 index 01cc6d6b..00000000 --- a/doc/bitflags/__core/f64/consts/constant.LOG2_E.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::LOG2_E - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::LOG2_E - - [−] - - [src]

-
pub const LOG2_E: f64 = 1.44269504088896340735992468100189214f64

log2(e)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.PI.html b/doc/bitflags/__core/f64/consts/constant.PI.html deleted file mode 100644 index 63f63780..00000000 --- a/doc/bitflags/__core/f64/consts/constant.PI.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::PI - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::PI - - [−] - - [src]

-
pub const PI: f64 = 3.14159265358979323846264338327950288f64

Archimedes' constant

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/constant.SQRT_2.html b/doc/bitflags/__core/f64/consts/constant.SQRT_2.html deleted file mode 100644 index 46a63c63..00000000 --- a/doc/bitflags/__core/f64/consts/constant.SQRT_2.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts::SQRT_2 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::f64::consts::SQRT_2 - - [−] - - [src]

-
pub const SQRT_2: f64 = 1.41421356237309504880168872420969808f64

sqrt(2.0)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/index.html b/doc/bitflags/__core/f64/consts/index.html deleted file mode 100644 index 6f4b5223..00000000 --- a/doc/bitflags/__core/f64/consts/index.html +++ /dev/null @@ -1,226 +0,0 @@ - - - - - - - - - - bitflags::__core::f64::consts - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::f64::consts - - [−] - - [src]

-

Basic mathematical constants.

-

Constants

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
E -

Euler's number

-
FRAC_1_PI -

1.0/pi

-
FRAC_1_SQRT_2 -

1.0/sqrt(2.0)

-
FRAC_2_PI -

2.0/pi

-
FRAC_2_SQRT_PI -

2.0/sqrt(pi)

-
FRAC_PI_2 -

pi/2.0

-
FRAC_PI_3 -

pi/3.0

-
FRAC_PI_4 -

pi/4.0

-
FRAC_PI_6 -

pi/6.0

-
FRAC_PI_8 -

pi/8.0

-
LN_10 -

ln(10.0)

-
LN_2 -

ln(2.0)

-
LOG10_E -

log10(e)

-
LOG2_E -

log2(e)

-
PI -

Archimedes' constant

-
SQRT_2 -

sqrt(2.0)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/consts/sidebar-items.js b/doc/bitflags/__core/f64/consts/sidebar-items.js deleted file mode 100644 index 2113e97a..00000000 --- a/doc/bitflags/__core/f64/consts/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["E","Euler's number"],["FRAC_1_PI","1.0/pi"],["FRAC_1_SQRT_2","1.0/sqrt(2.0)"],["FRAC_2_PI","2.0/pi"],["FRAC_2_SQRT_PI","2.0/sqrt(pi)"],["FRAC_PI_2","pi/2.0"],["FRAC_PI_3","pi/3.0"],["FRAC_PI_4","pi/4.0"],["FRAC_PI_6","pi/6.0"],["FRAC_PI_8","pi/8.0"],["LN_10","ln(10.0)"],["LN_2","ln(2.0)"],["LOG10_E","log10(e)"],["LOG2_E","log2(e)"],["PI","Archimedes' constant"],["SQRT_2","sqrt(2.0)"]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/f64/index.html b/doc/bitflags/__core/f64/index.html deleted file mode 100644 index c561e7ac..00000000 --- a/doc/bitflags/__core/f64/index.html +++ /dev/null @@ -1,222 +0,0 @@ - - - - - - - - - - bitflags::__core::f64 - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::f64 - - [−] - - [src]

-

The 64-bit floating point type.

- -

See also the f64 primitive type.

-

Modules

- - - - -
consts -

Basic mathematical constants.

-

Constants

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
DIGITS - -
EPSILON - -
INFINITY - -
MANTISSA_DIGITS - -
MAX -

Largest finite f64 value

-
MAX_10_EXP - -
MAX_EXP - -
MIN -

Smallest finite f64 value

-
MIN_10_EXP - -
MIN_EXP - -
MIN_POSITIVE -

Smallest positive, normalized f64 value

-
NAN - -
NEG_INFINITY - -
RADIX - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/f64/sidebar-items.js b/doc/bitflags/__core/f64/sidebar-items.js deleted file mode 100644 index 30e0edfd..00000000 --- a/doc/bitflags/__core/f64/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["DIGITS",""],["EPSILON",""],["INFINITY",""],["MANTISSA_DIGITS",""],["MAX","Largest finite f64 value"],["MAX_10_EXP",""],["MAX_EXP",""],["MIN","Smallest finite f64 value"],["MIN_10_EXP",""],["MIN_EXP",""],["MIN_POSITIVE","Smallest positive, normalized f64 value"],["NAN",""],["NEG_INFINITY",""],["RADIX",""]],"mod":[["consts","Basic mathematical constants."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/ffi/index.html b/doc/bitflags/__core/ffi/index.html deleted file mode 100644 index bb3a3d98..00000000 --- a/doc/bitflags/__core/ffi/index.html +++ /dev/null @@ -1,159 +0,0 @@ - - - - - - - - - - bitflags::__core::ffi - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::ffi - - [−] - - [src]

-

Utilities related to FFI bindings.

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - -
CStr -

Representation of a borrowed C string.

-
CString -

A type representing an owned C-compatible string

-
IntoStringError -

An error returned from CString::into_string to indicate that a UTF-8 error -was encountered during the conversion.

-
NulError -

An error returned from CString::new to indicate that a nul byte was found -in the vector provided.

-
OsStr -

Slices into OS strings (see OsString).

-
OsString -

A type that can represent owned, mutable platform-native strings, but is -cheaply inter-convertible with Rust strings.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ffi/sidebar-items.js b/doc/bitflags/__core/ffi/sidebar-items.js deleted file mode 100644 index 6196a02b..00000000 --- a/doc/bitflags/__core/ffi/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["CStr","Representation of a borrowed C string."],["CString","A type representing an owned C-compatible string"],["IntoStringError","An error returned from `CString::into_string` to indicate that a UTF-8 error was encountered during the conversion."],["NulError","An error returned from `CString::new` to indicate that a nul byte was found in the vector provided."],["OsStr","Slices into OS strings (see `OsString`)."],["OsString","A type that can represent owned, mutable platform-native strings, but is cheaply inter-convertible with Rust strings."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/ffi/struct.CStr.html b/doc/bitflags/__core/ffi/struct.CStr.html deleted file mode 100644 index 3d850668..00000000 --- a/doc/bitflags/__core/ffi/struct.CStr.html +++ /dev/null @@ -1,312 +0,0 @@ - - - - - - - - - - bitflags::__core::ffi::CStr - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::ffi::CStr - - [−] - - [src]

-
pub struct CStr {
-    // some fields omitted
-}
1.0.0

Representation of a borrowed C string.

- -

This dynamically sized type is only safely constructed via a borrowed -version of an instance of CString. This type can be constructed from a raw -C string as well and represents a C string borrowed from another location.

- -

Note that this structure is not repr(C) and is not recommended to be -placed in the signatures of FFI functions. Instead safe wrappers of FFI -functions may leverage the unsafe from_ptr constructor to provide a safe -interface to other consumers.

- -

Examples

-

Inspecting a foreign C string

- -
-use std::ffi::CStr;
-use std::os::raw::c_char;
-
-extern { fn my_string() -> *const c_char; }
-
-fn main() {
-    unsafe {
-        let slice = CStr::from_ptr(my_string());
-        println!("string length: {}", slice.to_bytes().len());
-    }
-}
- -

Passing a Rust-originating C string

- -
-use std::ffi::{CString, CStr};
-use std::os::raw::c_char;
-
-fn work(data: &CStr) {
-    extern { fn work_with(data: *const c_char); }
-
-    unsafe { work_with(data.as_ptr()) }
-}
-
-fn main() {
-    let s = CString::new("data data data data").unwrap();
-    work(&s);
-}
- -

Converting a foreign C string into a Rust String

- -
-use std::ffi::CStr;
-use std::os::raw::c_char;
-
-extern { fn my_string() -> *const c_char; }
-
-fn my_string_safe() -> String {
-    unsafe {
-        CStr::from_ptr(my_string()).to_string_lossy().into_owned()
-    }
-}
-
-fn main() {
-    println!("string: {}", my_string_safe());
-}
-

Methods

impl CStr

unsafe fn from_ptr(ptr: *const i8) -> &'a CStr

-

Casts a raw C string to a safe C string wrapper.

- -

This function will cast the provided ptr to the CStr wrapper which -allows inspection and interoperation of non-owned C strings. This method -is unsafe for a number of reasons:

- -
    -
  • There is no guarantee to the validity of ptr
    • -
  • The returned lifetime is not guaranteed to be the actual lifetime of -ptr
    • -
  • There is no guarantee that the memory pointed to by ptr contains a -valid nul terminator byte at the end of the string.
    • -
- -
-

Note: This operation is intended to be a 0-cost cast but it is -currently implemented with an up-front calculation of the length of -the string. This is not guaranteed to always be the case.

-
- -

Examples

-
-use std::ffi::CStr;
-use std::os::raw::c_char;
-
-extern {
-    fn my_string() -> *const c_char;
-}
-
-unsafe {
-    let slice = CStr::from_ptr(my_string());
-    println!("string returned: {}", slice.to_str().unwrap());
-}
-

fn from_bytes_with_nul(bytes: &[u8]) -> Option<&CStr>

-
Unstable (cstr_from_bytes)

: recently added

-

Creates a C string wrapper from a byte slice.

- -

This function will cast the provided bytes to a CStr wrapper after -ensuring that it is null terminated and does not contain any interior -nul bytes.

- -

Examples

-
-use std::ffi::CStr;
-
-let cstr = CStr::from_bytes_with_nul(b"hello\0");
-assert!(cstr.is_some());
-

unsafe fn from_bytes_with_nul_unchecked(bytes: &[u8]) -> &CStr

-
Unstable (cstr_from_bytes)

: recently added

-

Unsafely creates a C string wrapper from a byte slice.

- -

This function will cast the provided bytes to a CStr wrapper without -performing any sanity checks. The provided slice must be null terminated -and not contain any interior nul bytes.

- -

Examples

-
-use std::ffi::{CStr, CString};
-
-unsafe {
-    let cstring = CString::new("hello").unwrap();
-    let cstr = CStr::from_bytes_with_nul_unchecked(cstring.to_bytes_with_nul());
-    assert_eq!(cstr, &*cstring);
-}
-

fn as_ptr(&self) -> *const i8

-

Returns the inner pointer to this C string.

- -

The returned pointer will be valid for as long as self is and points -to a contiguous region of memory terminated with a 0 byte to represent -the end of the string.

-

fn to_bytes(&self) -> &[u8]

-

Converts this C string to a byte slice.

- -

This function will calculate the length of this string (which normally -requires a linear amount of work to be done) and then return the -resulting slice of u8 elements.

- -

The returned slice will not contain the trailing nul that this C -string has.

- -
-

Note: This method is currently implemented as a 0-cost cast, but -it is planned to alter its definition in the future to perform the -length calculation whenever this method is called.

-
-

fn to_bytes_with_nul(&self) -> &[u8]

-

Converts this C string to a byte slice containing the trailing 0 byte.

- -

This function is the equivalent of to_bytes except that it will retain -the trailing nul instead of chopping it off.

- -
-

Note: This method is currently implemented as a 0-cost cast, but -it is planned to alter its definition in the future to perform the -length calculation whenever this method is called.

-
-

fn to_str(&self) -> Result<&str, Utf8Error>1.4.0

-

Yields a &str slice if the CStr contains valid UTF-8.

- -

This function will calculate the length of this string and check for -UTF-8 validity, and then return the &str if it's valid.

- -
-

Note: This method is currently implemented to check for validity -after a 0-cost cast, but it is planned to alter its definition in the -future to perform the length calculation in addition to the UTF-8 -check whenever this method is called.

-
-

fn to_string_lossy(&self) -> Cow<str>1.4.0

-

Converts a CStr into a Cow<str>.

- -

This function will calculate the length of this string (which normally -requires a linear amount of work to be done) and then return the -resulting slice as a Cow<str>, replacing any invalid UTF-8 sequences -with U+FFFD REPLACEMENT CHARACTER.

- -
-

Note: This method is currently implemented to check for validity -after a 0-cost cast, but it is planned to alter its definition in the -future to perform the length calculation in addition to the UTF-8 -check whenever this method is called.

-
-

Trait Implementations

impl Debug for CStr1.3.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl PartialEq<CStr> for CStr

fn eq(&self, other: &CStr) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl Eq for CStr

impl PartialOrd<CStr> for CStr

fn partial_cmp(&self, other: &CStr) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl Ord for CStr

fn cmp(&self, other: &CStr) -> Ordering

-

impl ToOwned for CStr1.3.0

type Owned = CString

-

fn to_owned(&self) -> CString

-

impl AsRef<CStr> for CStr1.7.0

fn as_ref(&self) -> &CStr

-

Derived Implementations

impl Hash for CStr

fn hash<__H>(&self, __arg_0: &mut __H) where __H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ffi/struct.CString.html b/doc/bitflags/__core/ffi/struct.CString.html deleted file mode 100644 index 7a88a3b1..00000000 --- a/doc/bitflags/__core/ffi/struct.CString.html +++ /dev/null @@ -1,295 +0,0 @@ - - - - - - - - - - bitflags::__core::ffi::CString - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::ffi::CString - - [−] - - [src]

-
pub struct CString {
-    // some fields omitted
-}
1.0.0

A type representing an owned C-compatible string

- -

This type serves the primary purpose of being able to safely generate a -C-compatible string from a Rust byte slice or vector. An instance of this -type is a static guarantee that the underlying bytes contain no interior 0 -bytes and the final byte is 0.

- -

A CString is created from either a byte slice or a byte vector. After -being created, a CString predominately inherits all of its methods from -the Deref implementation to [c_char]. Note that the underlying array -is represented as an array of c_char as opposed to u8. A u8 slice -can be obtained with the as_bytes method. Slices produced from a CString -do not contain the trailing nul terminator unless otherwise specified.

- -

Examples

-
-use std::ffi::CString;
-use std::os::raw::c_char;
-
-extern {
-    fn my_printer(s: *const c_char);
-}
-
-let c_to_print = CString::new("Hello, world!").unwrap();
-unsafe {
-    my_printer(c_to_print.as_ptr());
-}
- -

Safety

-

CString is intended for working with traditional C-style strings -(a sequence of non-null bytes terminated by a single null byte); the -primary use case for these kinds of strings is interoperating with C-like -code. Often you will need to transfer ownership to/from that external -code. It is strongly recommended that you thoroughly read through the -documentation of CString before use, as improper ownership management -of CString instances can lead to invalid memory accesses, memory leaks, -and other memory errors.

-

Methods

impl CString

fn new<T>(t: T) -> Result<CString, NulError> where T: Into<Vec<u8>>

-

Creates a new C-compatible string from a container of bytes.

- -

This method will consume the provided data and use the underlying bytes -to construct a new string, ensuring that there is a trailing 0 byte.

- -

Examples

-
-use std::ffi::CString;
-use std::os::raw::c_char;
-
-extern { fn puts(s: *const c_char); }
-
-fn main() {
-    let to_print = CString::new("Hello!").unwrap();
-    unsafe {
-        puts(to_print.as_ptr());
-    }
-}
- -

Errors

-

This function will return an error if the bytes yielded contain an -internal 0 byte. The error returned will contain the bytes as well as -the position of the nul byte.

-

unsafe fn from_vec_unchecked(v: Vec<u8>) -> CString

-

Creates a C-compatible string from a byte vector without checking for -interior 0 bytes.

- -

This method is equivalent to new except that no runtime assertion -is made that v contains no 0 bytes, and it requires an actual -byte vector, not anything that can be converted to one with Into.

-

unsafe fn from_raw(ptr: *mut i8) -> CString1.4.0

-

Retakes ownership of a CString that was transferred to C.

- -

This should only ever be called with a pointer that was earlier -obtained by calling into_raw on a CString. Additionally, the length -of the string will be recalculated from the pointer.

-

fn into_raw(self) -> *mut i81.4.0

-

Transfers ownership of the string to a C caller.

- -

The pointer must be returned to Rust and reconstituted using -from_raw to be properly deallocated. Specifically, one -should not use the standard C free function to deallocate -this string.

- -

Failure to call from_raw will lead to a memory leak.

-

fn into_string(self) -> Result<String, IntoStringError>1.7.0

-

Converts the CString into a String if it contains valid Unicode data.

- -

On failure, ownership of the original CString is returned.

-

fn into_bytes(self) -> Vec<u8>1.7.0

-

Returns the underlying byte buffer.

- -

The returned buffer does not contain the trailing nul separator and -it is guaranteed to not have any interior nul bytes.

-

fn into_bytes_with_nul(self) -> Vec<u8>1.7.0

-

Equivalent to the into_bytes function except that the returned vector -includes the trailing nul byte.

-

fn as_bytes(&self) -> &[u8]

-

Returns the contents of this CString as a slice of bytes.

- -

The returned slice does not contain the trailing nul separator and -it is guaranteed to not have any interior nul bytes.

-

fn as_bytes_with_nul(&self) -> &[u8]

-

Equivalent to the as_bytes function except that the returned slice -includes the trailing nul byte.

-

Methods from Deref<Target=CStr>

fn as_ptr(&self) -> *const i8

-

Returns the inner pointer to this C string.

- -

The returned pointer will be valid for as long as self is and points -to a contiguous region of memory terminated with a 0 byte to represent -the end of the string.

-

fn to_bytes(&self) -> &[u8]

-

Converts this C string to a byte slice.

- -

This function will calculate the length of this string (which normally -requires a linear amount of work to be done) and then return the -resulting slice of u8 elements.

- -

The returned slice will not contain the trailing nul that this C -string has.

- -
-

Note: This method is currently implemented as a 0-cost cast, but -it is planned to alter its definition in the future to perform the -length calculation whenever this method is called.

-
-

fn to_bytes_with_nul(&self) -> &[u8]

-

Converts this C string to a byte slice containing the trailing 0 byte.

- -

This function is the equivalent of to_bytes except that it will retain -the trailing nul instead of chopping it off.

- -
-

Note: This method is currently implemented as a 0-cost cast, but -it is planned to alter its definition in the future to perform the -length calculation whenever this method is called.

-
-

fn to_str(&self) -> Result<&str, Utf8Error>1.4.0

-

Yields a &str slice if the CStr contains valid UTF-8.

- -

This function will calculate the length of this string and check for -UTF-8 validity, and then return the &str if it's valid.

- -
-

Note: This method is currently implemented to check for validity -after a 0-cost cast, but it is planned to alter its definition in the -future to perform the length calculation in addition to the UTF-8 -check whenever this method is called.

-
-

fn to_string_lossy(&self) -> Cow<str>1.4.0

-

Converts a CStr into a Cow<str>.

- -

This function will calculate the length of this string (which normally -requires a linear amount of work to be done) and then return the -resulting slice as a Cow<str>, replacing any invalid UTF-8 sequences -with U+FFFD REPLACEMENT CHARACTER.

- -
-

Note: This method is currently implemented to check for validity -after a 0-cost cast, but it is planned to alter its definition in the -future to perform the length calculation in addition to the UTF-8 -check whenever this method is called.

-
-

Trait Implementations

impl Deref for CString

type Target = CStr

-

fn deref(&self) -> &CStr

-

impl Debug for CString

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl Borrow<CStr> for CString1.3.0

fn borrow(&self) -> &CStr

-

impl<'a> From<&'a CStr> for CString1.7.0

fn from(s: &'a CStr) -> CString

-

impl Index<RangeFull> for CString1.7.0

type Output = CStr

-

fn index(&self, _index: RangeFull) -> &CStr

-

impl AsRef<CStr> for CString1.7.0

fn as_ref(&self) -> &CStr

-

Derived Implementations

impl Clone for CString

fn clone(&self) -> CString

-

fn clone_from(&mut self, source: &Self)

-

impl Hash for CString

fn hash<__H>(&self, __arg_0: &mut __H) where __H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl Ord for CString

fn cmp(&self, __arg_0: &CString) -> Ordering

-

impl Eq for CString

impl PartialOrd<CString> for CString

fn partial_cmp(&self, __arg_0: &CString) -> Option<Ordering>

-

fn lt(&self, __arg_0: &CString) -> bool

-

fn le(&self, __arg_0: &CString) -> bool

-

fn gt(&self, __arg_0: &CString) -> bool

-

fn ge(&self, __arg_0: &CString) -> bool

-

impl PartialEq<CString> for CString

fn eq(&self, __arg_0: &CString) -> bool

-

fn ne(&self, __arg_0: &CString) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ffi/struct.IntoStringError.html b/doc/bitflags/__core/ffi/struct.IntoStringError.html deleted file mode 100644 index 28ae7f2d..00000000 --- a/doc/bitflags/__core/ffi/struct.IntoStringError.html +++ /dev/null @@ -1,129 +0,0 @@ - - - - - - - - - - bitflags::__core::ffi::IntoStringError - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::ffi::IntoStringError - - [−] - - [src]

-
pub struct IntoStringError {
-    // some fields omitted
-}
1.7.0

An error returned from CString::into_string to indicate that a UTF-8 error -was encountered during the conversion.

-

Methods

impl IntoStringError

fn into_cstring(self) -> CString

-

Consumes this error, returning original CString which generated the -error.

-

fn utf8_error(&self) -> Utf8Error

-

Access the underlying UTF-8 error that was the cause of this error.

-

Trait Implementations

impl Error for IntoStringError

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

impl Display for IntoStringError

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl Debug for IntoStringError

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl PartialEq<IntoStringError> for IntoStringError

fn eq(&self, __arg_0: &IntoStringError) -> bool

-

fn ne(&self, __arg_0: &IntoStringError) -> bool

-

impl Clone for IntoStringError

fn clone(&self) -> IntoStringError

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ffi/struct.NulError.html b/doc/bitflags/__core/ffi/struct.NulError.html deleted file mode 100644 index 51bfac52..00000000 --- a/doc/bitflags/__core/ffi/struct.NulError.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::ffi::NulError - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::ffi::NulError - - [−] - - [src]

-
pub struct NulError(_, _);
1.0.0

An error returned from CString::new to indicate that a nul byte was found -in the vector provided.

-

Methods

impl NulError

fn nul_position(&self) -> usize

-

Returns the position of the nul byte in the slice that was provided to -CString::new.

-

fn into_vec(self) -> Vec<u8>

-

Consumes this error, returning the underlying vector of bytes which -generated the error in the first place.

-

Trait Implementations

impl Error for NulError

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

impl Display for NulError

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl Debug for NulError

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl PartialEq<NulError> for NulError

fn eq(&self, __arg_0: &NulError) -> bool

-

fn ne(&self, __arg_0: &NulError) -> bool

-

impl Clone for NulError

fn clone(&self) -> NulError

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ffi/struct.OsStr.html b/doc/bitflags/__core/ffi/struct.OsStr.html deleted file mode 100644 index 9349af6f..00000000 --- a/doc/bitflags/__core/ffi/struct.OsStr.html +++ /dev/null @@ -1,240 +0,0 @@ - - - - - - - - - - bitflags::__core::ffi::OsStr - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::ffi::OsStr - - [−] - - [src]

-
pub struct OsStr {
-    // some fields omitted
-}
1.0.0

Slices into OS strings (see OsString).

-

Methods

impl OsStr

fn new<S>(s: &S) -> &OsStr where S: AsRef<OsStr> + ?Sized

-

Coerces into an OsStr slice.

-

fn to_str(&self) -> Option<&str>

-

Yields a &str slice if the OsStr is valid Unicode.

- -

This conversion may entail doing a check for UTF-8 validity.

-

fn to_string_lossy(&self) -> Cow<str>

-

Converts an OsStr to a Cow<str>.

- -

Any non-Unicode sequences are replaced with U+FFFD REPLACEMENT CHARACTER.

-

fn to_os_string(&self) -> OsString

-

Copies the slice into an owned OsString.

-

fn is_empty(&self) -> bool1.9.0

-

Checks whether the OsStr is empty.

-

fn len(&self) -> usize1.9.0

-

Returns the length of this OsStr.

- -

Note that this does not return the number of bytes in this string -as, for example, OS strings on Windows are encoded as a list of u16 -rather than a list of bytes. This number is simply useful for passing to -other methods like OsString::with_capacity to avoid reallocations.

- -

See OsStr introduction for more information about encoding.

-

Trait Implementations

impl<'a> Default for &'a OsStr1.9.0

fn default() -> &'a OsStr

-

impl PartialEq<OsStr> for OsStr

fn eq(&self, other: &OsStr) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl PartialEq<str> for OsStr

fn eq(&self, other: &str) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl Eq for OsStr

impl PartialOrd<OsStr> for OsStr

fn partial_cmp(&self, other: &OsStr) -> Option<Ordering>

-

fn lt(&self, other: &OsStr) -> bool

-

fn le(&self, other: &OsStr) -> bool

-

fn gt(&self, other: &OsStr) -> bool

-

fn ge(&self, other: &OsStr) -> bool

-

impl PartialOrd<str> for OsStr

fn partial_cmp(&self, other: &str) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl Ord for OsStr

fn cmp(&self, other: &OsStr) -> Ordering

-

impl<'a, 'b> PartialEq<OsString> for OsStr1.8.0

fn eq(&self, other: &OsString) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<OsString> for OsStr1.8.0

fn partial_cmp(&self, other: &OsString) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<OsString> for &'a OsStr1.8.0

fn eq(&self, other: &OsString) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<OsString> for &'a OsStr1.8.0

fn partial_cmp(&self, other: &OsString) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Cow<'a, OsStr>> for OsStr1.8.0

fn eq(&self, other: &Cow<'a, OsStr>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for OsStr1.8.0

fn partial_cmp(&self, other: &Cow<'a, OsStr>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Cow<'a, OsStr>> for &'b OsStr1.8.0

fn eq(&self, other: &Cow<'a, OsStr>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for &'b OsStr1.8.0

fn partial_cmp(&self, other: &Cow<'a, OsStr>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl Hash for OsStr

fn hash<H>(&self, state: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl Debug for OsStr

fn fmt(&self, formatter: &mut Formatter) -> Result<(), Error>

-

impl ToOwned for OsStr

type Owned = OsString

-

fn to_owned(&self) -> OsString

-

impl AsRef<OsStr> for OsStr

fn as_ref(&self) -> &OsStr

-

impl OsStrExt for OsStr

fn from_bytes(slice: &[u8]) -> &OsStr

-

fn as_bytes(&self) -> &[u8]

-

impl AsRef<Path> for OsStr

fn as_ref(&self) -> &Path

-

impl<'a, 'b> PartialEq<PathBuf> for OsStr1.8.0

fn eq(&self, other: &PathBuf) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<PathBuf> for OsStr1.8.0

fn partial_cmp(&self, other: &PathBuf) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<PathBuf> for &'a OsStr1.8.0

fn eq(&self, other: &PathBuf) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<PathBuf> for &'a OsStr1.8.0

fn partial_cmp(&self, other: &PathBuf) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Path> for OsStr1.8.0

fn eq(&self, other: &Path) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Path> for OsStr1.8.0

fn partial_cmp(&self, other: &Path) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Path> for &'a OsStr1.8.0

fn eq(&self, other: &Path) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Path> for &'a OsStr1.8.0

fn partial_cmp(&self, other: &Path) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<&'a Path> for OsStr1.8.0

fn eq(&self, other: &&'a Path) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<&'a Path> for OsStr1.8.0

fn partial_cmp(&self, other: &&'a Path) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Cow<'a, Path>> for OsStr1.8.0

fn eq(&self, other: &Cow<'a, Path>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Cow<'a, Path>> for OsStr1.8.0

fn partial_cmp(&self, other: &Cow<'a, Path>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Cow<'a, Path>> for &'b OsStr1.8.0

fn eq(&self, other: &Cow<'a, Path>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Cow<'a, Path>> for &'b OsStr1.8.0

fn partial_cmp(&self, other: &Cow<'a, Path>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ffi/struct.OsString.html b/doc/bitflags/__core/ffi/struct.OsString.html deleted file mode 100644 index 82f578ce..00000000 --- a/doc/bitflags/__core/ffi/struct.OsString.html +++ /dev/null @@ -1,269 +0,0 @@ - - - - - - - - - - bitflags::__core::ffi::OsString - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::ffi::OsString - - [−] - - [src]

-
pub struct OsString {
-    // some fields omitted
-}
1.0.0

A type that can represent owned, mutable platform-native strings, but is -cheaply inter-convertible with Rust strings.

- -

The need for this type arises from the fact that:

- -
    -

  • On Unix systems, strings are often arbitrary sequences of non-zero -bytes, in many cases interpreted as UTF-8.

    • -

  • On Windows, strings are often arbitrary sequences of non-zero 16-bit -values, interpreted as UTF-16 when it is valid to do so.

    • -

  • In Rust, strings are always valid UTF-8, but may contain zeros.

    • -
- -

OsString and OsStr bridge this gap by simultaneously representing Rust -and platform-native string values, and in particular allowing a Rust string -to be converted into an "OS" string with no cost.

-

Methods

impl OsString

fn new() -> OsString

-

Constructs a new empty OsString.

-

fn as_os_str(&self) -> &OsStr

-

Converts to an OsStr slice.

-

fn into_string(self) -> Result<String, OsString>

-

Converts the OsString into a String if it contains valid Unicode data.

- -

On failure, ownership of the original OsString is returned.

-

fn push<T>(&mut self, s: T) where T: AsRef<OsStr>

-

Extends the string with the given &OsStr slice.

-

fn with_capacity(capacity: usize) -> OsString1.9.0

-

Creates a new OsString with the given capacity.

- -

The string will be able to hold exactly capacity lenth units of other -OS strings without reallocating. If capacity is 0, the string will not -allocate.

- -

See main OsString documentation information about encoding.

-

fn clear(&mut self)1.9.0

-

Truncates the OsString to zero length.

-

fn capacity(&self) -> usize1.9.0

-

Returns the capacity this OsString can hold without reallocating.

- -

See OsString introduction for information about encoding.

-

fn reserve(&mut self, additional: usize)1.9.0

-

Reserves capacity for at least additional more capacity to be inserted -in the given OsString.

- -

The collection may reserve more space to avoid frequent reallocations.

-

fn reserve_exact(&mut self, additional: usize)1.9.0

-

Reserves the minimum capacity for exactly additional more capacity to -be inserted in the given OsString. Does nothing if the capacity is -already sufficient.

- -

Note that the allocator may give the collection more space than it -requests. Therefore capacity can not be relied upon to be precisely -minimal. Prefer reserve if future insertions are expected.

-

Methods from Deref<Target=OsStr>

fn to_str(&self) -> Option<&str>

-

Yields a &str slice if the OsStr is valid Unicode.

- -

This conversion may entail doing a check for UTF-8 validity.

-

fn to_string_lossy(&self) -> Cow<str>

-

Converts an OsStr to a Cow<str>.

- -

Any non-Unicode sequences are replaced with U+FFFD REPLACEMENT CHARACTER.

-

fn to_os_string(&self) -> OsString

-

Copies the slice into an owned OsString.

-

fn is_empty(&self) -> bool1.9.0

-

Checks whether the OsStr is empty.

-

fn len(&self) -> usize1.9.0

-

Returns the length of this OsStr.

- -

Note that this does not return the number of bytes in this string -as, for example, OS strings on Windows are encoded as a list of u16 -rather than a list of bytes. This number is simply useful for passing to -other methods like OsString::with_capacity to avoid reallocations.

- -

See OsStr introduction for more information about encoding.

-

Trait Implementations

impl From<String> for OsString

fn from(s: String) -> OsString

-

impl<'a, T> From<&'a T> for OsString where T: AsRef<OsStr> + ?Sized

fn from(s: &'a T) -> OsString

-

impl Index<RangeFull> for OsString

type Output = OsStr

-

fn index(&self, _index: RangeFull) -> &OsStr

-

impl Deref for OsString

type Target = OsStr

-

fn deref(&self) -> &OsStr

-

impl Default for OsString1.9.0

fn default() -> OsString

-

impl Debug for OsString

fn fmt(&self, formatter: &mut Formatter) -> Result<(), Error>

-

impl PartialEq<OsString> for OsString

fn eq(&self, other: &OsString) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl PartialEq<str> for OsString

fn eq(&self, other: &str) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl Eq for OsString

impl PartialOrd<OsString> for OsString

fn partial_cmp(&self, other: &OsString) -> Option<Ordering>

-

fn lt(&self, other: &OsString) -> bool

-

fn le(&self, other: &OsString) -> bool

-

fn gt(&self, other: &OsString) -> bool

-

fn ge(&self, other: &OsString) -> bool

-

impl PartialOrd<str> for OsString

fn partial_cmp(&self, other: &str) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl Ord for OsString

fn cmp(&self, other: &OsString) -> Ordering

-

impl Hash for OsString

fn hash<H>(&self, state: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<'a, 'b> PartialEq<OsStr> for OsString1.8.0

fn eq(&self, other: &OsStr) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<OsStr> for OsString1.8.0

fn partial_cmp(&self, other: &OsStr) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<&'a OsStr> for OsString1.8.0

fn eq(&self, other: &&'a OsStr) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<&'a OsStr> for OsString1.8.0

fn partial_cmp(&self, other: &&'a OsStr) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Cow<'a, OsStr>> for OsString1.8.0

fn eq(&self, other: &Cow<'a, OsStr>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for OsString1.8.0

fn partial_cmp(&self, other: &Cow<'a, OsStr>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl Borrow<OsStr> for OsString

fn borrow(&self) -> &OsStr

-

impl AsRef<OsStr> for OsString

fn as_ref(&self) -> &OsStr

-

impl OsStringExt for OsString

fn from_vec(vec: Vec<u8>) -> OsString

-

fn into_vec(self) -> Vec<u8>

-

impl AsRef<Path> for OsString

fn as_ref(&self) -> &Path

-

impl<'a, 'b> PartialEq<PathBuf> for OsString1.8.0

fn eq(&self, other: &PathBuf) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<PathBuf> for OsString1.8.0

fn partial_cmp(&self, other: &PathBuf) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Path> for OsString1.8.0

fn eq(&self, other: &Path) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Path> for OsString1.8.0

fn partial_cmp(&self, other: &Path) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<&'a Path> for OsString1.8.0

fn eq(&self, other: &&'a Path) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<&'a Path> for OsString1.8.0

fn partial_cmp(&self, other: &&'a Path) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Cow<'a, Path>> for OsString1.8.0

fn eq(&self, other: &Cow<'a, Path>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Cow<'a, Path>> for OsString1.8.0

fn partial_cmp(&self, other: &Cow<'a, Path>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

Derived Implementations

impl Clone for OsString

fn clone(&self) -> OsString

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/fn.format.html b/doc/bitflags/__core/fmt/fn.format.html deleted file mode 100644 index 7811c530..00000000 --- a/doc/bitflags/__core/fmt/fn.format.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::format - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fmt::format - - [−] - - [src]

-
pub fn format(args: Arguments) -> String
1.0.0

The format function takes a precompiled format string and a list of -arguments, to return the resulting formatted string.

- -

Arguments

-
    -
  • args - a structure of arguments generated via the format_args! macro.
    • -
- -

Examples

-
-use std::fmt;
-
-let s = fmt::format(format_args!("Hello, {}!", "world"));
-assert_eq!(s, "Hello, world!".to_string());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/fn.write.html b/doc/bitflags/__core/fmt/fn.write.html deleted file mode 100644 index 12fc25d2..00000000 --- a/doc/bitflags/__core/fmt/fn.write.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::write - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fmt::write - - [−] - - [src]

-
pub fn write(output: &mut Write, args: Arguments) -> Result<(), Error>
1.0.0

The write function takes an output stream, a precompiled format string, -and a list of arguments. The arguments will be formatted according to the -specified format string into the output stream provided.

- -

Arguments

-
    -
  • output - the buffer to write output to
    • -
  • args - the precompiled arguments generated by format_args!
    • -
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/index.html b/doc/bitflags/__core/fmt/index.html deleted file mode 100644 index 436516f4..00000000 --- a/doc/bitflags/__core/fmt/index.html +++ /dev/null @@ -1,702 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::fmt - - [−] - - [src]

-

Utilities for formatting and printing strings

- -

This module contains the runtime support for the format! syntax extension. -This macro is implemented in the compiler to emit calls to this module in -order to format arguments at runtime into strings and streams.

- -

Usage

-

The format! macro is intended to be familiar to those coming from C's -printf/fprintf functions or Python's str.format function. In its current -revision, the format! macro returns a String type which is the result of -the formatting. In the future it will also be able to pass in a stream to -format arguments directly while performing minimal allocations.

- -

Some examples of the format! extension are:

- -
-format!("Hello");                 // => "Hello"
-format!("Hello, {}!", "world");   // => "Hello, world!"
-format!("The number is {}", 1);   // => "The number is 1"
-format!("{:?}", (3, 4));          // => "(3, 4)"
-format!("{value}", value=4);      // => "4"
-format!("{} {}", 1, 2);           // => "1 2"
- -

From these, you can see that the first argument is a format string. It is -required by the compiler for this to be a string literal; it cannot be a -variable passed in (in order to perform validity checking). The compiler -will then parse the format string and determine if the list of arguments -provided is suitable to pass to this format string.

- -

Positional parameters

-

Each formatting argument is allowed to specify which value argument it's -referencing, and if omitted it is assumed to be "the next argument". For -example, the format string {} {} {} would take three parameters, and they -would be formatted in the same order as they're given. The format string -{2} {1} {0}, however, would format arguments in reverse order.

- -

Things can get a little tricky once you start intermingling the two types of -positional specifiers. The "next argument" specifier can be thought of as an -iterator over the argument. Each time a "next argument" specifier is seen, -the iterator advances. This leads to behavior like this:

- -
-format!("{1} {} {0} {}", 1, 2); // => "2 1 1 2"
- -

The internal iterator over the argument has not been advanced by the time -the first {} is seen, so it prints the first argument. Then upon reaching -the second {}, the iterator has advanced forward to the second argument. -Essentially, parameters which explicitly name their argument do not affect -parameters which do not name an argument in terms of positional specifiers.

- -

A format string is required to use all of its arguments, otherwise it is a -compile-time error. You may refer to the same argument more than once in the -format string, although it must always be referred to with the same type.

- -

Named parameters

-

Rust itself does not have a Python-like equivalent of named parameters to a -function, but the format! macro is a syntax extension which allows it to -leverage named parameters. Named parameters are listed at the end of the -argument list and have the syntax:

- -
identifier '=' expression
-
- -

For example, the following format! expressions all use named argument:

- -
-format!("{argument}", argument = "test");   // => "test"
-format!("{name} {}", 1, name = 2);        // => "2 1"
-format!("{a} {c} {b}", a="a", b='b', c=3);  // => "a 3 b"
- -

It is not valid to put positional parameters (those without names) after -arguments which have names. Like with positional parameters, it is not -valid to provide named parameters that are unused by the format string.

- -

Argument types

-

Each argument's type is dictated by the format string. It is a requirement -that every argument is only ever referred to by one type. For example, this -is an invalid format string:

- -
{0:x} {0:o}
-
- -

This is invalid because the first argument is both referred to as a -hexadecimal as well as an -octal.

- -

There are various parameters which do require a particular type, however. -Namely, the {:.*} syntax, which sets the number of numbers after the -decimal in floating-point types:

- -
-let formatted_number = format!("{:.*}", 2, 1.234567);
-
-assert_eq!("1.23", formatted_number)
- -

If this syntax is used, then the number of characters to print precedes the -actual object being formatted, and the number of characters must have the -type usize. Although a usize can be printed with {}, it is invalid to -reference an argument as such. For example this is another invalid format -string:

- -
{:.*} {0}
-
- -

Formatting traits

-

When requesting that an argument be formatted with a particular type, you -are actually requesting that an argument ascribes to a particular trait. -This allows multiple actual types to be formatted via {:x} (like i8 as -well as isize). The current mapping of types to traits is:

- - - -

What this means is that any type of argument which implements the -fmt::Binary trait can then be formatted with {:b}. Implementations -are provided for these traits for a number of primitive types by the -standard library as well. If no format is specified (as in {} or {:6}), -then the format trait used is the Display trait.

- -

When implementing a format trait for your own type, you will have to -implement a method of the signature:

- -
-fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
- -

Your type will be passed as self by-reference, and then the function -should emit output into the f.buf stream. It is up to each format trait -implementation to correctly adhere to the requested formatting parameters. -The values of these parameters will be listed in the fields of the -Formatter struct. In order to help with this, the Formatter struct also -provides some helper methods.

- -

Additionally, the return value of this function is fmt::Result which is a -typedef to Result<(), std::io::Error> (also known as std::io::Result<()>). -Formatting implementations should ensure that they return errors from write! -correctly (propagating errors upward).

- -

An example of implementing the formatting traits would look -like:

- -
-use std::fmt;
-
-#[derive(Debug)]
-struct Vector2D {
-    x: isize,
-    y: isize,
-}
-
-impl fmt::Display for Vector2D {
-    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
-        // The `f` value implements the `Write` trait, which is what the
-        // write! macro is expecting. Note that this formatting ignores the
-        // various flags provided to format strings.
-        write!(f, "({}, {})", self.x, self.y)
-    }
-}
-
-// Different traits allow different forms of output of a type. The meaning
-// of this format is to print the magnitude of a vector.
-impl fmt::Binary for Vector2D {
-    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
-        let magnitude = (self.x * self.x + self.y * self.y) as f64;
-        let magnitude = magnitude.sqrt();
-
-        // Respect the formatting flags by using the helper method
-        // `pad_integral` on the Formatter object. See the method
-        // documentation for details, and the function `pad` can be used
-        // to pad strings.
-        let decimals = f.precision().unwrap_or(3);
-        let string = format!("{:.*}", decimals, magnitude);
-        f.pad_integral(true, "", &string)
-    }
-}
-
-fn main() {
-    let myvector = Vector2D { x: 3, y: 4 };
-
-    println!("{}", myvector);       // => "(3, 4)"
-    println!("{:?}", myvector);     // => "Vector2D {x: 3, y:4}"
-    println!("{:10.3b}", myvector); // => "     5.000"
-}
- -

fmt::Display vs fmt::Debug

-

These two formatting traits have distinct purposes:

- -
    -
  • fmt::Display implementations assert that the type can be faithfully -represented as a UTF-8 string at all times. It is not expected that -all types implement the Display trait.
    • -
  • fmt::Debug implementations should be implemented for all public types. -Output will typically represent the internal state as faithfully as possible. -The purpose of the Debug trait is to facilitate debugging Rust code. In -most cases, using #[derive(Debug)] is sufficient and recommended.
    • -
- -

Some examples of the output from both traits:

- -
-assert_eq!(format!("{} {:?}", 3, 4), "3 4");
-assert_eq!(format!("{} {:?}", 'a', 'b'), "a 'b'");
-assert_eq!(format!("{} {:?}", "foo\n", "bar\n"), "foo\n \"bar\\n\"");
- - -

There are a number of related macros in the format! family. The ones that -are currently implemented are:

- -
-format!      // described above
-write!       // first argument is a &mut io::Write, the destination
-writeln!     // same as write but appends a newline
-print!       // the format string is printed to the standard output
-println!     // same as print but appends a newline
-format_args! // described below.
- -

write!

-

This and writeln are two macros which are used to emit the format string -to a specified stream. This is used to prevent intermediate allocations of -format strings and instead directly write the output. Under the hood, this -function is actually invoking the write function defined in this module. -Example usage is:

- -
-use std::io::Write;
-let mut w = Vec::new();
-write!(&mut w, "Hello {}!", "world");
- -

print!

-

This and println emit their output to stdout. Similarly to the write! -macro, the goal of these macros is to avoid intermediate allocations when -printing output. Example usage is:

- -
-print!("Hello {}!", "world");
-println!("I have a newline {}", "character at the end");
- -

format_args!

-

This is a curious macro which is used to safely pass around -an opaque object describing the format string. This object -does not require any heap allocations to create, and it only -references information on the stack. Under the hood, all of -the related macros are implemented in terms of this. First -off, some example usage is:

- -
-use std::fmt;
-use std::io::{self, Write};
-
-fmt::format(format_args!("this returns {}", "String"));
-
-let mut some_writer = io::stdout();
-write!(&mut some_writer, "{}", format_args!("print with a {}", "macro"));
-
-fn my_fmt_fn(args: fmt::Arguments) {
-    write!(&mut io::stdout(), "{}", args);
-}
-my_fmt_fn(format_args!("or a {} too", "function"));
- -

The result of the format_args! macro is a value of type fmt::Arguments. -This structure can then be passed to the write and format functions -inside this module in order to process the format string. -The goal of this macro is to even further prevent intermediate allocations -when dealing formatting strings.

- -

For example, a logging library could use the standard formatting syntax, but -it would internally pass around this structure until it has been determined -where output should go to.

- -

Syntax

-

The syntax for the formatting language used is drawn from other languages, -so it should not be too alien. Arguments are formatted with python-like -syntax, meaning that arguments are surrounded by {} instead of the C-like -%. The actual grammar for the formatting syntax is:

- -
format_string := <text> [ format <text> ] *
-format := '{' [ argument ] [ ':' format_spec ] '}'
-argument := integer | identifier
-
-format_spec := [[fill]align][sign]['#'][0][width]['.' precision][type]
-fill := character
-align := '<' | '^' | '>'
-sign := '+' | '-'
-width := count
-precision := count | '*'
-type := identifier | ''
-count := parameter | integer
-parameter := integer '$'
-
- -

Formatting Parameters

-

Each argument being formatted can be transformed by a number of formatting -parameters (corresponding to format_spec in the syntax above). These -parameters affect the string representation of what's being formatted. This -syntax draws heavily from Python's, so it may seem a bit familiar.

- -

Fill/Alignment

-

The fill character is provided normally in conjunction with the width -parameter. This indicates that if the value being formatted is smaller than -width some extra characters will be printed around it. The extra -characters are specified by fill, and the alignment can be one of the -following options:

- -
    -
  • < - the argument is left-aligned in width columns
    • -
  • ^ - the argument is center-aligned in width columns
    • -
  • > - the argument is right-aligned in width columns
    • -
- -

Note that alignment may not be implemented by some types. A good way -to ensure padding is applied is to format your input, then use this -resulting string to pad your output.

- -

Sign/#/0

-

These can all be interpreted as flags for a particular formatter.

- -
    -
  • + - This is intended for numeric types and indicates that the sign - should always be printed. Positive signs are never printed by - default, and the negative sign is only printed by default for the - Signed trait. This flag indicates that the correct sign (+ or -) - should always be printed.
    • -
  • - - Currently not used
    • -
  • # - This flag is indicates that the "alternate" form of printing should - be used. The alternate forms are: - -
      -
    • #? - pretty-print the Debug formatting
      • -
    • #x - precedes the argument with a 0x
      • -
    • #X - precedes the argument with a 0x
      • -
    • #b - precedes the argument with a 0b
      • -
    • #o - precedes the argument with a 0o
      • -
    • -
  • 0 - This is used to indicate for integer formats that the padding should - both be done with a 0 character as well as be sign-aware. A format - like {:08} would yield 00000001 for the integer 1, while the - same format would yield -0000001 for the integer -1. Notice that - the negative version has one fewer zero than the positive version.
    • -
- -

Width

-

This is a parameter for the "minimum width" that the format should take up. -If the value's string does not fill up this many characters, then the -padding specified by fill/alignment will be used to take up the required -space.

- -

The default fill/alignment for non-numerics is a space and left-aligned. The -defaults for numeric formatters is also a space but with right-alignment. If -the 0 flag is specified for numerics, then the implicit fill character is -0.

- -

The value for the width can also be provided as a usize in the list of -parameters by using the 2$ syntax indicating that the second argument is a -usize specifying the width.

- -

Precision

-

For non-numeric types, this can be considered a "maximum width". If the resulting string is -longer than this width, then it is truncated down to this many characters and only those are -emitted.

- -

For integral types, this is ignored.

- -

For floating-point types, this indicates how many digits after the decimal point should be -printed.

- -

There are three possible ways to specify the desired precision:

- -
    -

  1. An integer .N:

    - -

    the integer N itself is the precision.

    2. -

  2. An integer followed by dollar sign .N$:

    - -

    use format argument N (which must be a usize) as the precision.

    3. -

  3. An asterisk .*:

    - -

    .* means that this {...} is associated with two format inputs rather than one: the -first input holds the usize precision, and the second holds the value to print. Note that -in this case, if one uses the format string {<arg>:<spec>.*}, then the <arg> part refers -to the value to print, and the precision must come in the input preceding <arg>.

    4. -
- -

For example, these:

- -
-// Hello {arg 0 (x)} is {arg 1 (0.01) with precision specified inline (5)}
-println!("Hello {0} is {1:.5}", "x", 0.01);
-
-// Hello {arg 1 (x)} is {arg 2 (0.01) with precision specified in arg 0 (5)}
-println!("Hello {1} is {2:.0$}", 5, "x", 0.01);
-
-// Hello {arg 0 (x)} is {arg 2 (0.01) with precision specified in arg 1 (5)}
-println!("Hello {0} is {2:.1$}", "x", 5, 0.01);
-
-// Hello {next arg (x)} is {second of next two args (0.01) with precision
-//                          specified in first of next two args (5)}
-println!("Hello {} is {:.*}",    "x", 5, 0.01);
-
-// Hello {next arg (x)} is {arg 2 (0.01) with precision
-//                          specified in its predecessor (5)}
-println!("Hello {} is {2:.*}",   "x", 5, 0.01);
- -

All print the same thing:

- -
Hello x is 0.01000
-
- -

While these:

- -
-println!("{}, `{name:.*}` has 3 fractional digits", "Hello", 3, name=1234.56);
-println!("{}, `{name:.*}` has 3 characters", "Hello", 3, name="1234.56");
- -

print two significantly different things:

- -
Hello, `1234.560` has 3 fractional digits
-Hello, `123` has 3 characters
-
- -

Escaping

-

The literal characters { and } may be included in a string by preceding -them with the same character. For example, the { character is escaped with -{{ and the } character is escaped with }}.

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Arguments -

This structure represents a safely precompiled version of a format string -and its arguments. This cannot be generated at runtime because it cannot -safely be done so, so no constructors are given and the fields are private -to prevent modification.

-
DebugList -

A struct to help with fmt::Debug implementations.

-
DebugMap -

A struct to help with fmt::Debug implementations.

-
DebugSet -

A struct to help with fmt::Debug implementations.

-
DebugStruct -

A struct to help with fmt::Debug implementations.

-
DebugTuple -

A struct to help with fmt::Debug implementations.

-
Error -

The error type which is returned from formatting a message into a stream.

-
Formatter -

A struct to represent both where to emit formatting strings to and how they -should be formatted. A mutable version of this is passed to all formatting -traits.

-

Traits

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Binary -

Format trait for the b character.

-
Debug -

Format trait for the ? character.

-
Display -

Format trait for an empty format, {}.

-
LowerExp -

Format trait for the e character.

-
LowerHex -

Format trait for the x character.

-
Octal -

Format trait for the o character.

-
Pointer -

Format trait for the p character.

-
UpperExp -

Format trait for the E character.

-
UpperHex -

Format trait for the X character.

-
Write -

A collection of methods that are required to format a message into a stream.

-

Functions

- - - - - - - - -
format -

The format function takes a precompiled format string and a list of -arguments, to return the resulting formatted string.

-
write -

The write function takes an output stream, a precompiled format string, -and a list of arguments. The arguments will be formatted according to the -specified format string into the output stream provided.

-

Type Definitions

- - - - -
Result - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/rt/index.html b/doc/bitflags/__core/fmt/rt/index.html deleted file mode 100644 index f64687a4..00000000 --- a/doc/bitflags/__core/fmt/rt/index.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../../core/fmt/rt/index.html...

- - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/rt/sidebar-items.js b/doc/bitflags/__core/fmt/rt/sidebar-items.js deleted file mode 100644 index 694112ce..00000000 --- a/doc/bitflags/__core/fmt/rt/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"mod":[["v1","This is an internal module used by the ifmt! runtime. These structures are emitted to static arrays to precompile format strings ahead of time."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/rt/v1/enum.Alignment.html b/doc/bitflags/__core/fmt/rt/v1/enum.Alignment.html deleted file mode 100644 index 520c93c1..00000000 --- a/doc/bitflags/__core/fmt/rt/v1/enum.Alignment.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../../../core/fmt/rt/v1/enum.Alignment.html...

- - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/rt/v1/enum.Count.html b/doc/bitflags/__core/fmt/rt/v1/enum.Count.html deleted file mode 100644 index 8885f5bd..00000000 --- a/doc/bitflags/__core/fmt/rt/v1/enum.Count.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../../../core/fmt/rt/v1/enum.Count.html...

- - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/rt/v1/enum.Position.html b/doc/bitflags/__core/fmt/rt/v1/enum.Position.html deleted file mode 100644 index 13d0a5e2..00000000 --- a/doc/bitflags/__core/fmt/rt/v1/enum.Position.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../../../core/fmt/rt/v1/enum.Position.html...

- - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/rt/v1/index.html b/doc/bitflags/__core/fmt/rt/v1/index.html deleted file mode 100644 index 2228bcb7..00000000 --- a/doc/bitflags/__core/fmt/rt/v1/index.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../../../core/fmt/rt/v1/index.html...

- - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/rt/v1/sidebar-items.js b/doc/bitflags/__core/fmt/rt/v1/sidebar-items.js deleted file mode 100644 index 6fb58f7a..00000000 --- a/doc/bitflags/__core/fmt/rt/v1/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["Alignment","Possible alignments that can be requested as part of a formatting directive."],["Count",""],["Position",""]],"struct":[["Argument",""],["FormatSpec",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/rt/v1/struct.Argument.html b/doc/bitflags/__core/fmt/rt/v1/struct.Argument.html deleted file mode 100644 index 02525c3f..00000000 --- a/doc/bitflags/__core/fmt/rt/v1/struct.Argument.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../../../core/fmt/rt/v1/struct.Argument.html...

- - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/rt/v1/struct.FormatSpec.html b/doc/bitflags/__core/fmt/rt/v1/struct.FormatSpec.html deleted file mode 100644 index be4beb20..00000000 --- a/doc/bitflags/__core/fmt/rt/v1/struct.FormatSpec.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../../../core/fmt/rt/v1/struct.FormatSpec.html...

- - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/sidebar-items.js b/doc/bitflags/__core/fmt/sidebar-items.js deleted file mode 100644 index 3cb54ef7..00000000 --- a/doc/bitflags/__core/fmt/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["format","The format function takes a precompiled format string and a list of arguments, to return the resulting formatted string."],["write","The `write` function takes an output stream, a precompiled format string, and a list of arguments. The arguments will be formatted according to the specified format string into the output stream provided."]],"struct":[["Arguments","This structure represents a safely precompiled version of a format string and its arguments. This cannot be generated at runtime because it cannot safely be done so, so no constructors are given and the fields are private to prevent modification."],["DebugList","A struct to help with `fmt::Debug` implementations."],["DebugMap","A struct to help with `fmt::Debug` implementations."],["DebugSet","A struct to help with `fmt::Debug` implementations."],["DebugStruct","A struct to help with `fmt::Debug` implementations."],["DebugTuple","A struct to help with `fmt::Debug` implementations."],["Error","The error type which is returned from formatting a message into a stream."],["Formatter","A struct to represent both where to emit formatting strings to and how they should be formatted. A mutable version of this is passed to all formatting traits."]],"trait":[["Binary","Format trait for the `b` character."],["Debug","Format trait for the `?` character."],["Display","Format trait for an empty format, `{}`."],["LowerExp","Format trait for the `e` character."],["LowerHex","Format trait for the `x` character."],["Octal","Format trait for the `o` character."],["Pointer","Format trait for the `p` character."],["UpperExp","Format trait for the `E` character."],["UpperHex","Format trait for the `X` character."],["Write","A collection of methods that are required to format a message into a stream."]],"type":[["Result",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/struct.Arguments.html b/doc/bitflags/__core/fmt/struct.Arguments.html deleted file mode 100644 index 4483a2d3..00000000 --- a/doc/bitflags/__core/fmt/struct.Arguments.html +++ /dev/null @@ -1,127 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::Arguments - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fmt::Arguments - - [−] - - [src]

-
pub struct Arguments<'a> {
-    // some fields omitted
-}
1.0.0

This structure represents a safely precompiled version of a format string -and its arguments. This cannot be generated at runtime because it cannot -safely be done so, so no constructors are given and the fields are private -to prevent modification.

- -

The format_args! macro will safely create an instance of this structure -and pass it to a function or closure, passed as the first argument. The -macro validates the format string at compile-time so usage of the write -and format functions can be safely performed.

-

Trait Implementations

impl<'a> Debug for Arguments<'a>

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl<'a> Display for Arguments<'a>

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl<'a> Clone for Arguments<'a>

fn clone(&self) -> Arguments<'a>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a> Copy for Arguments<'a>

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/struct.DebugList.html b/doc/bitflags/__core/fmt/struct.DebugList.html deleted file mode 100644 index 6912b4c4..00000000 --- a/doc/bitflags/__core/fmt/struct.DebugList.html +++ /dev/null @@ -1,124 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::DebugList - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fmt::DebugList - - [−] - - [src]

-
#[must_use]
-pub struct DebugList<'a, 'b> where 'b: 'a {
-    // some fields omitted
-}
1.2.0

A struct to help with fmt::Debug implementations.

- -

Constructed by the Formatter::debug_list method.

-

Methods

impl<'a, 'b> DebugList<'a, 'b> where 'b: 'a

fn entry(&mut self, entry: &Debug) -> &mut DebugList<'a, 'b>

-

Adds a new entry to the list output.

-

fn entries<D, I>(&mut self, entries: I) -> &mut DebugList<'a, 'b> where I: IntoIterator<Item=D>, D: Debug

-

Adds the contents of an iterator of entries to the list output.

-

fn finish(&mut self) -> Result<(), Error>

-

Finishes output and returns any error encountered.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/struct.DebugMap.html b/doc/bitflags/__core/fmt/struct.DebugMap.html deleted file mode 100644 index f864f80d..00000000 --- a/doc/bitflags/__core/fmt/struct.DebugMap.html +++ /dev/null @@ -1,124 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::DebugMap - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fmt::DebugMap - - [−] - - [src]

-
#[must_use]
-pub struct DebugMap<'a, 'b> where 'b: 'a {
-    // some fields omitted
-}
1.2.0

A struct to help with fmt::Debug implementations.

- -

Constructed by the Formatter::debug_map method.

-

Methods

impl<'a, 'b> DebugMap<'a, 'b> where 'b: 'a

fn entry(&mut self, key: &Debug, value: &Debug) -> &mut DebugMap<'a, 'b>

-

Adds a new entry to the map output.

-

fn entries<K, V, I>(&mut self, entries: I) -> &mut DebugMap<'a, 'b> where I: IntoIterator<Item=(K, V)>, V: Debug, K: Debug

-

Adds the contents of an iterator of entries to the map output.

-

fn finish(&mut self) -> Result<(), Error>

-

Finishes output and returns any error encountered.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/struct.DebugSet.html b/doc/bitflags/__core/fmt/struct.DebugSet.html deleted file mode 100644 index 38f16743..00000000 --- a/doc/bitflags/__core/fmt/struct.DebugSet.html +++ /dev/null @@ -1,124 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::DebugSet - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fmt::DebugSet - - [−] - - [src]

-
#[must_use]
-pub struct DebugSet<'a, 'b> where 'b: 'a {
-    // some fields omitted
-}
1.2.0

A struct to help with fmt::Debug implementations.

- -

Constructed by the Formatter::debug_set method.

-

Methods

impl<'a, 'b> DebugSet<'a, 'b> where 'b: 'a

fn entry(&mut self, entry: &Debug) -> &mut DebugSet<'a, 'b>

-

Adds a new entry to the set output.

-

fn entries<D, I>(&mut self, entries: I) -> &mut DebugSet<'a, 'b> where D: Debug, I: IntoIterator<Item=D>

-

Adds the contents of an iterator of entries to the set output.

-

fn finish(&mut self) -> Result<(), Error>

-

Finishes output and returns any error encountered.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/struct.DebugStruct.html b/doc/bitflags/__core/fmt/struct.DebugStruct.html deleted file mode 100644 index 48ce2e7c..00000000 --- a/doc/bitflags/__core/fmt/struct.DebugStruct.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::DebugStruct - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fmt::DebugStruct - - [−] - - [src]

-
#[must_use]
-pub struct DebugStruct<'a, 'b> where 'b: 'a {
-    // some fields omitted
-}
1.2.0

A struct to help with fmt::Debug implementations.

- -

Constructed by the Formatter::debug_struct method.

-

Methods

impl<'a, 'b> DebugStruct<'a, 'b> where 'b: 'a

fn field(&mut self, name: &str, value: &Debug) -> &mut DebugStruct<'a, 'b>

-

Adds a new field to the generated struct output.

-

fn finish(&mut self) -> Result<(), Error>

-

Finishes output and returns any error encountered.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/struct.DebugTuple.html b/doc/bitflags/__core/fmt/struct.DebugTuple.html deleted file mode 100644 index f4788afa..00000000 --- a/doc/bitflags/__core/fmt/struct.DebugTuple.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::DebugTuple - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fmt::DebugTuple - - [−] - - [src]

-
#[must_use]
-pub struct DebugTuple<'a, 'b> where 'b: 'a {
-    // some fields omitted
-}
1.2.0

A struct to help with fmt::Debug implementations.

- -

Constructed by the Formatter::debug_tuple method.

-

Methods

impl<'a, 'b> DebugTuple<'a, 'b> where 'b: 'a

fn field(&mut self, value: &Debug) -> &mut DebugTuple<'a, 'b>

-

Adds a new field to the generated tuple struct output.

-

fn finish(&mut self) -> Result<(), Error>

-

Finishes output and returns any error encountered.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/struct.Error.html b/doc/bitflags/__core/fmt/struct.Error.html deleted file mode 100644 index b0c23728..00000000 --- a/doc/bitflags/__core/fmt/struct.Error.html +++ /dev/null @@ -1,132 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::Error - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fmt::Error - - [−] - - [src]

-
pub struct Error;
1.0.0

The error type which is returned from formatting a message into a stream.

- -

This type does not support transmission of an error other than that an error -occurred. Any extra information must be arranged to be transmitted through -some other means.

-

Trait Implementations

impl Display for Error

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl PartialOrd<Error> for Error

fn partial_cmp(&self, __arg_0: &Error) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl PartialEq<Error> for Error

fn eq(&self, __arg_0: &Error) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl Ord for Error

fn cmp(&self, __arg_0: &Error) -> Ordering

-

impl Hash for Error

fn hash<__H>(&self, __arg_0: &mut __H) where __H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl Eq for Error

impl Default for Error

fn default() -> Error

-

impl Debug for Error

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl Clone for Error

fn clone(&self) -> Error

-

fn clone_from(&mut self, source: &Self)

-

impl Copy for Error

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/struct.Formatter.html b/doc/bitflags/__core/fmt/struct.Formatter.html deleted file mode 100644 index f7163f79..00000000 --- a/doc/bitflags/__core/fmt/struct.Formatter.html +++ /dev/null @@ -1,272 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::Formatter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fmt::Formatter - - [−] - - [src]

-
pub struct Formatter<'a> {
-    // some fields omitted
-}
1.0.0

A struct to represent both where to emit formatting strings to and how they -should be formatted. A mutable version of this is passed to all formatting -traits.

-

Methods

impl<'a> Formatter<'a>

fn pad_integral(&mut self, is_nonnegative: bool, prefix: &str, buf: &str) -> Result<(), Error>

-

Performs the correct padding for an integer which has already been -emitted into a str. The str should not contain the sign for the -integer, that will be added by this method.

- -

Arguments

-
    -
  • is_nonnegative - whether the original integer was either positive or zero.
    • -
  • prefix - if the '#' character (Alternate) is provided, this -is the prefix to put in front of the number.
    • -
  • buf - the byte array that the number has been formatted into
    • -
- -

This function will correctly account for the flags provided as well as -the minimum width. It will not take precision into account.

-

fn pad(&mut self, s: &str) -> Result<(), Error>

-

This function takes a string slice and emits it to the internal buffer -after applying the relevant formatting flags specified. The flags -recognized for generic strings are:

- -
    -
  • width - the minimum width of what to emit
    • -
  • fill/align - what to emit and where to emit it if the string - provided needs to be padded
    • -
  • precision - the maximum length to emit, the string is truncated if it - is longer than this length
    • -
- -

Notably this function ignored the flag parameters

-

fn write_str(&mut self, data: &str) -> Result<(), Error>

-

Writes some data to the underlying buffer contained within this -formatter.

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

Writes some formatted information into this instance

-

fn flags(&self) -> u32

-

Flags for formatting (packed version of rt::Flag)

-

fn fill(&self) -> char1.5.0

-

Character used as 'fill' whenever there is alignment

-

fn align(&self) -> Alignment

-
Unstable (fmt_flags_align)

: method was just created

-

Flag indicating what form of alignment was requested

-

fn width(&self) -> Option<usize>1.5.0

-

Optionally specified integer width that the output should be

-

fn precision(&self) -> Option<usize>1.5.0

-

Optionally specified precision for numeric types

-

fn sign_plus(&self) -> bool1.5.0

-

Determines if the + flag was specified.

-

fn sign_minus(&self) -> bool1.5.0

-

Determines if the - flag was specified.

-

fn alternate(&self) -> bool1.5.0

-

Determines if the # flag was specified.

-

fn sign_aware_zero_pad(&self) -> bool1.5.0

-

Determines if the 0 flag was specified.

-

fn debug_struct(&'b mut self, name: &str) -> DebugStruct<'b, 'a>1.2.0

-

Creates a DebugStruct builder designed to assist with creation of -fmt::Debug implementations for structs.

- -

Examples

-
-use std::fmt;
-
-struct Foo {
-    bar: i32,
-    baz: String,
-}
-
-impl fmt::Debug for Foo {
-    fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
-        fmt.debug_struct("Foo")
-            .field("bar", &self.bar)
-            .field("baz", &self.baz)
-            .finish()
-    }
-}
-
-// prints "Foo { bar: 10, baz: "Hello World" }"
-println!("{:?}", Foo { bar: 10, baz: "Hello World".to_string() });
-

fn debug_tuple(&'b mut self, name: &str) -> DebugTuple<'b, 'a>1.2.0

-

Creates a DebugTuple builder designed to assist with creation of -fmt::Debug implementations for tuple structs.

- -

Examples

-
-use std::fmt;
-
-struct Foo(i32, String);
-
-impl fmt::Debug for Foo {
-    fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
-        fmt.debug_tuple("Foo")
-            .field(&self.0)
-            .field(&self.1)
-            .finish()
-    }
-}
-
-// prints "Foo(10, "Hello World")"
-println!("{:?}", Foo(10, "Hello World".to_string()));
-

fn debug_list(&'b mut self) -> DebugList<'b, 'a>1.2.0

-

Creates a DebugList builder designed to assist with creation of -fmt::Debug implementations for list-like structures.

- -

Examples

-
-use std::fmt;
-
-struct Foo(Vec<i32>);
-
-impl fmt::Debug for Foo {
-    fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
-        fmt.debug_list().entries(self.0.iter()).finish()
-    }
-}
-
-// prints "[10, 11]"
-println!("{:?}", Foo(vec![10, 11]));
-

fn debug_set(&'b mut self) -> DebugSet<'b, 'a>1.2.0

-

Creates a DebugSet builder designed to assist with creation of -fmt::Debug implementations for set-like structures.

- -

Examples

-
-use std::fmt;
-
-struct Foo(Vec<i32>);
-
-impl fmt::Debug for Foo {
-    fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
-        fmt.debug_set().entries(self.0.iter()).finish()
-    }
-}
-
-// prints "{10, 11}"
-println!("{:?}", Foo(vec![10, 11]));
-

fn debug_map(&'b mut self) -> DebugMap<'b, 'a>1.2.0

-

Creates a DebugMap builder designed to assist with creation of -fmt::Debug implementations for map-like structures.

- -

Examples

-
-use std::fmt;
-
-struct Foo(Vec<(String, i32)>);
-
-impl fmt::Debug for Foo {
-    fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
-        fmt.debug_map().entries(self.0.iter().map(|&(ref k, ref v)| (k, v))).finish()
-    }
-}
-
-// prints "{"A": 10, "B": 11}"
-println!("{:?}", Foo(vec![("A".to_string(), 10), ("B".to_string(), 11)]));
-

Trait Implementations

impl<'a> Write for Formatter<'a>1.2.0

fn write_str(&mut self, s: &str) -> Result<(), Error>

-

fn write_char(&mut self, c: char) -> Result<(), Error>

-

fn write_fmt(&mut self, args: Arguments) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/trait.Binary.html b/doc/bitflags/__core/fmt/trait.Binary.html deleted file mode 100644 index 0d2bc3e2..00000000 --- a/doc/bitflags/__core/fmt/trait.Binary.html +++ /dev/null @@ -1,170 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::Binary - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::fmt::Binary - - [−] - - [src]

-
pub trait Binary {
-    fn fmt(&self, &mut Formatter) -> Result<(), Error>;
-}

Format trait for the b character.

- -

The Binary trait should format its output as a number in binary.

- -

The alternate flag, #, adds a 0b in front of the output.

- -

For more information on formatters, see the module-level documentation.

- -

Examples

-

Basic usage with i32:

- -
-let x = 42; // 42 is '101010' in binary
-
-assert_eq!(format!("{:b}", x), "101010");
-assert_eq!(format!("{:#b}", x), "0b101010");
- -

Implementing Binary on a type:

- -
-use std::fmt;
-
-struct Length(i32);
-
-impl fmt::Binary for Length {
-    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
-        let val = self.0;
-
-        write!(f, "{:b}", val) // delegate to i32's implementation
-    }
-}
-
-let l = Length(107);
-
-println!("l as binary is: {:b}", l);
-
-

Required Methods

-
-

fn fmt(&self, &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.

-
-

Implementors

-
    -
  • impl Binary for isize
    • -
  • impl Binary for usize
    • -
  • impl Binary for i8
    • -
  • impl Binary for u8
    • -
  • impl Binary for i16
    • -
  • impl Binary for u16
    • -
  • impl Binary for i32
    • -
  • impl Binary for u32
    • -
  • impl Binary for i64
    • -
  • impl Binary for u64
    • -
  • impl<'a, T> Binary for &'a T where T: Binary + ?Sized
    • -
  • impl<'a, T> Binary for &'a mut T where T: Binary + ?Sized
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/trait.Debug.html b/doc/bitflags/__core/fmt/trait.Debug.html deleted file mode 100644 index 2b8b15a7..00000000 --- a/doc/bitflags/__core/fmt/trait.Debug.html +++ /dev/null @@ -1,504 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::Debug - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::fmt::Debug - - [−] - - [src]

-
pub trait Debug {
-    fn fmt(&self, &mut Formatter) -> Result<(), Error>;
-}

Format trait for the ? character.

- -

Debug should format the output in a programmer-facing, debugging context.

- -

Generally speaking, you should just derive a Debug implementation.

- -

When used with the alternate format specifier #?, the output is pretty-printed.

- -

For more information on formatters, see the module-level documentation.

- -

This trait can be used with #[derive].

- -

Examples

-

Deriving an implementation:

- -
-#[derive(Debug)]
-struct Point {
-    x: i32,
-    y: i32,
-}
-
-let origin = Point { x: 0, y: 0 };
-
-println!("The origin is: {:?}", origin);
- -

Manually implementing:

- -
-use std::fmt;
-
-struct Point {
-    x: i32,
-    y: i32,
-}
-
-impl fmt::Debug for Point {
-    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
-        write!(f, "Point {{ x: {}, y: {} }}", self.x, self.y)
-    }
-}
-
-let origin = Point { x: 0, y: 0 };
-
-println!("The origin is: {:?}", origin);
- -

This outputs:

- -
The origin is: Point { x: 0, y: 0 }
-
- -

There are a number of debug_* methods on Formatter to help you with manual -implementations, such as debug_struct.

- -

Debug implementations using either derive or the debug builder API -on Formatter support pretty printing using the alternate flag: {:#?}.

- -

Pretty printing with #?:

- -
-#[derive(Debug)]
-struct Point {
-    x: i32,
-    y: i32,
-}
-
-let origin = Point { x: 0, y: 0 };
-
-println!("The origin is: {:#?}", origin);
- -

This outputs:

- -
The origin is: Point {
-    x: 0,
-    y: 0
-}
-
-
-

Required Methods

-
-

fn fmt(&self, &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/trait.Display.html b/doc/bitflags/__core/fmt/trait.Display.html deleted file mode 100644 index 57b1a402..00000000 --- a/doc/bitflags/__core/fmt/trait.Display.html +++ /dev/null @@ -1,207 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::Display - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::fmt::Display - - [−] - - [src]

-
pub trait Display {
-    fn fmt(&self, &mut Formatter) -> Result<(), Error>;
-}

Format trait for an empty format, {}.

- -

Display is similar to Debug, but Display is for user-facing -output, and so cannot be derived.

- -

For more information on formatters, see the module-level documentation.

- -

Examples

-

Implementing Display on a type:

- -
-use std::fmt;
-
-struct Point {
-    x: i32,
-    y: i32,
-}
-
-impl fmt::Display for Point {
-    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
-        write!(f, "({}, {})", self.x, self.y)
-    }
-}
-
-let origin = Point { x: 0, y: 0 };
-
-println!("The origin is: {}", origin);
-
-

Required Methods

-
-

fn fmt(&self, &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/trait.LowerExp.html b/doc/bitflags/__core/fmt/trait.LowerExp.html deleted file mode 100644 index bf94c248..00000000 --- a/doc/bitflags/__core/fmt/trait.LowerExp.html +++ /dev/null @@ -1,158 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::LowerExp - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::fmt::LowerExp - - [−] - - [src]

-
pub trait LowerExp {
-    fn fmt(&self, &mut Formatter) -> Result<(), Error>;
-}

Format trait for the e character.

- -

The LowerExp trait should format its output in scientific notation with a lower-case e.

- -

For more information on formatters, see the module-level documentation.

- -

Examples

-

Basic usage with i32:

- -
-let x = 42.0; // 42.0 is '4.2e1' in scientific notation
-
-assert_eq!(format!("{:e}", x), "4.2e1");
- -

Implementing LowerExp on a type:

- -
-use std::fmt;
-
-struct Length(i32);
-
-impl fmt::LowerExp for Length {
-    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
-        let val = self.0;
-        write!(f, "{}e1", val / 10)
-    }
-}
-
-let l = Length(100);
-
-println!("l in scientific notation is: {:e}", l);
-
-

Required Methods

-
-

fn fmt(&self, &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.

-
-

Implementors

-
    -
  • impl<'a, T> LowerExp for &'a T where T: LowerExp + ?Sized
    • -
  • impl<'a, T> LowerExp for &'a mut T where T: LowerExp + ?Sized
    • -
  • impl LowerExp for f32
    • -
  • impl LowerExp for f64
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/trait.LowerHex.html b/doc/bitflags/__core/fmt/trait.LowerHex.html deleted file mode 100644 index 9630f67d..00000000 --- a/doc/bitflags/__core/fmt/trait.LowerHex.html +++ /dev/null @@ -1,171 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::LowerHex - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::fmt::LowerHex - - [−] - - [src]

-
pub trait LowerHex {
-    fn fmt(&self, &mut Formatter) -> Result<(), Error>;
-}

Format trait for the x character.

- -

The LowerHex trait should format its output as a number in hexadecimal, with a through f -in lower case.

- -

The alternate flag, #, adds a 0x in front of the output.

- -

For more information on formatters, see the module-level documentation.

- -

Examples

-

Basic usage with i32:

- -
-let x = 42; // 42 is '2a' in hex
-
-assert_eq!(format!("{:x}", x), "2a");
-assert_eq!(format!("{:#x}", x), "0x2a");
- -

Implementing LowerHex on a type:

- -
-use std::fmt;
-
-struct Length(i32);
-
-impl fmt::LowerHex for Length {
-    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
-        let val = self.0;
-
-        write!(f, "{:x}", val) // delegate to i32's implementation
-    }
-}
-
-let l = Length(9);
-
-println!("l as hex is: {:x}", l);
-
-

Required Methods

-
-

fn fmt(&self, &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.

-
-

Implementors

-
    -
  • impl LowerHex for isize
    • -
  • impl LowerHex for usize
    • -
  • impl LowerHex for i8
    • -
  • impl LowerHex for u8
    • -
  • impl LowerHex for i16
    • -
  • impl LowerHex for u16
    • -
  • impl LowerHex for i32
    • -
  • impl LowerHex for u32
    • -
  • impl LowerHex for i64
    • -
  • impl LowerHex for u64
    • -
  • impl<'a, T> LowerHex for &'a T where T: LowerHex + ?Sized
    • -
  • impl<'a, T> LowerHex for &'a mut T where T: LowerHex + ?Sized
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/trait.Octal.html b/doc/bitflags/__core/fmt/trait.Octal.html deleted file mode 100644 index dd8b6498..00000000 --- a/doc/bitflags/__core/fmt/trait.Octal.html +++ /dev/null @@ -1,170 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::Octal - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::fmt::Octal - - [−] - - [src]

-
pub trait Octal {
-    fn fmt(&self, &mut Formatter) -> Result<(), Error>;
-}

Format trait for the o character.

- -

The Octal trait should format its output as a number in base-8.

- -

The alternate flag, #, adds a 0o in front of the output.

- -

For more information on formatters, see the module-level documentation.

- -

Examples

-

Basic usage with i32:

- -
-let x = 42; // 42 is '52' in octal
-
-assert_eq!(format!("{:o}", x), "52");
-assert_eq!(format!("{:#o}", x), "0o52");
- -

Implementing Octal on a type:

- -
-use std::fmt;
-
-struct Length(i32);
-
-impl fmt::Octal for Length {
-    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
-        let val = self.0;
-
-        write!(f, "{:o}", val) // delegate to i32's implementation
-    }
-}
-
-let l = Length(9);
-
-println!("l as octal is: {:o}", l);
-
-

Required Methods

-
-

fn fmt(&self, &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.

-
-

Implementors

-
    -
  • impl Octal for isize
    • -
  • impl Octal for usize
    • -
  • impl Octal for i8
    • -
  • impl Octal for u8
    • -
  • impl Octal for i16
    • -
  • impl Octal for u16
    • -
  • impl Octal for i32
    • -
  • impl Octal for u32
    • -
  • impl Octal for i64
    • -
  • impl Octal for u64
    • -
  • impl<'a, T> Octal for &'a T where T: Octal + ?Sized
    • -
  • impl<'a, T> Octal for &'a mut T where T: Octal + ?Sized
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/trait.Pointer.html b/doc/bitflags/__core/fmt/trait.Pointer.html deleted file mode 100644 index 4b2d4a9d..00000000 --- a/doc/bitflags/__core/fmt/trait.Pointer.html +++ /dev/null @@ -1,217 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::Pointer - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::fmt::Pointer - - [−] - - [src]

-
pub trait Pointer {
-    fn fmt(&self, &mut Formatter) -> Result<(), Error>;
-}

Format trait for the p character.

- -

The Pointer trait should format its output as a memory location. This is commonly presented -as hexadecimal.

- -

For more information on formatters, see the module-level documentation.

- -

Examples

-

Basic usage with &i32:

- -
-let x = &42;
-
-let address = format!("{:p}", x); // this produces something like '0x7f06092ac6d0'
- -

Implementing Pointer on a type:

- -
-use std::fmt;
-
-struct Length(i32);
-
-impl fmt::Pointer for Length {
-    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
-        // use `as` to convert to a `*const T`, which implements Pointer, which we can use
-
-        write!(f, "{:p}", self as *const Length)
-    }
-}
-
-let l = Length(42);
-
-println!("l is in memory here: {:p}", l);
-
-

Required Methods

-
-

fn fmt(&self, &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.

-
-

Implementors

-
    -
  • impl<T> Pointer for Box<T> where T: ?Sized
    • -
  • impl<T> Pointer for Rc<T> where T: ?Sized
    • -
  • impl<Ret> Pointer for fn() -> Ret
    • -
  • impl<Ret> Pointer for extern fn() -> Ret
    • -
  • impl<Ret> Pointer for unsafe fn() -> Ret
    • -
  • impl<Ret> Pointer for unsafe extern fn() -> Ret
    • -
  • impl<Ret, A> Pointer for fn(A) -> Ret
    • -
  • impl<Ret, A> Pointer for extern fn(A) -> Ret
    • -
  • impl<Ret, A> Pointer for unsafe fn(A) -> Ret
    • -
  • impl<Ret, A> Pointer for unsafe extern fn(A) -> Ret
    • -
  • impl<Ret, A, B> Pointer for fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Pointer for extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Pointer for unsafe fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Pointer for unsafe extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B, C> Pointer for fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Pointer for extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Pointer for unsafe fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Pointer for unsafe extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C, D> Pointer for fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Pointer for extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Pointer for unsafe fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Pointer for unsafe extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Pointer for fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Pointer for extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Pointer for unsafe fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Pointer for unsafe extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Pointer for fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Pointer for extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Pointer for unsafe fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Pointer for unsafe extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Pointer for fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Pointer for extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Pointer for unsafe fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Pointer for unsafe extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Pointer for fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Pointer for extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Pointer for unsafe fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Pointer for unsafe extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Pointer for fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Pointer for extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Pointer for unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Pointer for unsafe extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Pointer for fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Pointer for extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Pointer for unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Pointer for unsafe extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Pointer for fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Pointer for extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Pointer for unsafe fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Pointer for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Pointer for fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Pointer for extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Pointer for unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Pointer for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<T> Pointer for Unique<T>
    • -
  • impl<T> Pointer for Shared<T>
    • -
  • impl<T> Pointer for *const T where T: ?Sized
    • -
  • impl<T> Pointer for *mut T where T: ?Sized
    • -
  • impl<'a, T> Pointer for &'a T where T: ?Sized
    • -
  • impl<'a, T> Pointer for &'a mut T where T: ?Sized
    • -
  • impl<T> Pointer for Arc<T> where T: ?Sized
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/trait.UpperExp.html b/doc/bitflags/__core/fmt/trait.UpperExp.html deleted file mode 100644 index b68a44bc..00000000 --- a/doc/bitflags/__core/fmt/trait.UpperExp.html +++ /dev/null @@ -1,158 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::UpperExp - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::fmt::UpperExp - - [−] - - [src]

-
pub trait UpperExp {
-    fn fmt(&self, &mut Formatter) -> Result<(), Error>;
-}

Format trait for the E character.

- -

The UpperExp trait should format its output in scientific notation with an upper-case E.

- -

For more information on formatters, see the module-level documentation.

- -

Examples

-

Basic usage with f32:

- -
-let x = 42.0; // 42.0 is '4.2E1' in scientific notation
-
-assert_eq!(format!("{:E}", x), "4.2E1");
- -

Implementing UpperExp on a type:

- -
-use std::fmt;
-
-struct Length(i32);
-
-impl fmt::UpperExp for Length {
-    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
-        let val = self.0;
-        write!(f, "{}E1", val / 10)
-    }
-}
-
-let l = Length(100);
-
-println!("l in scientific notation is: {:E}", l);
-
-

Required Methods

-
-

fn fmt(&self, &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.

-
-

Implementors

-
    -
  • impl<'a, T> UpperExp for &'a T where T: UpperExp + ?Sized
    • -
  • impl<'a, T> UpperExp for &'a mut T where T: UpperExp + ?Sized
    • -
  • impl UpperExp for f32
    • -
  • impl UpperExp for f64
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/trait.UpperHex.html b/doc/bitflags/__core/fmt/trait.UpperHex.html deleted file mode 100644 index 998b8d8c..00000000 --- a/doc/bitflags/__core/fmt/trait.UpperHex.html +++ /dev/null @@ -1,171 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::UpperHex - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::fmt::UpperHex - - [−] - - [src]

-
pub trait UpperHex {
-    fn fmt(&self, &mut Formatter) -> Result<(), Error>;
-}

Format trait for the X character.

- -

The UpperHex trait should format its output as a number in hexadecimal, with A through F -in upper case.

- -

The alternate flag, #, adds a 0x in front of the output.

- -

For more information on formatters, see the module-level documentation.

- -

Examples

-

Basic usage with i32:

- -
-let x = 42; // 42 is '2A' in hex
-
-assert_eq!(format!("{:X}", x), "2A");
-assert_eq!(format!("{:#X}", x), "0x2A");
- -

Implementing UpperHex on a type:

- -
-use std::fmt;
-
-struct Length(i32);
-
-impl fmt::UpperHex for Length {
-    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
-        let val = self.0;
-
-        write!(f, "{:X}", val) // delegate to i32's implementation
-    }
-}
-
-let l = Length(9);
-
-println!("l as hex is: {:X}", l);
-
-

Required Methods

-
-

fn fmt(&self, &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.

-
-

Implementors

-
    -
  • impl UpperHex for isize
    • -
  • impl UpperHex for usize
    • -
  • impl UpperHex for i8
    • -
  • impl UpperHex for u8
    • -
  • impl UpperHex for i16
    • -
  • impl UpperHex for u16
    • -
  • impl UpperHex for i32
    • -
  • impl UpperHex for u32
    • -
  • impl UpperHex for i64
    • -
  • impl UpperHex for u64
    • -
  • impl<'a, T> UpperHex for &'a T where T: UpperHex + ?Sized
    • -
  • impl<'a, T> UpperHex for &'a mut T where T: UpperHex + ?Sized
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/trait.Write.html b/doc/bitflags/__core/fmt/trait.Write.html deleted file mode 100644 index 923b47f5..00000000 --- a/doc/bitflags/__core/fmt/trait.Write.html +++ /dev/null @@ -1,162 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::Write - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::fmt::Write - - [−] - - [src]

-
pub trait Write {
-    fn write_str(&mut self, s: &str) -> Result<(), Error>;
-
-    fn write_char(&mut self, c: char) -> Result<(), Error> { ... }
-    fn write_fmt(&mut self, args: Arguments) -> Result<(), Error> { ... }
-}

A collection of methods that are required to format a message into a stream.

- -

This trait is the type which this modules requires when formatting -information. This is similar to the standard library's io::Write trait, -but it is only intended for use in libcore.

- -

This trait should generally not be implemented by consumers of the standard -library. The write! macro accepts an instance of io::Write, and the -io::Write trait is favored over implementing this trait.

-
-

Required Methods

-
-

fn write_str(&mut self, s: &str) -> Result<(), Error>

Writes a slice of bytes into this writer, returning whether the write -succeeded.

- -

This method can only succeed if the entire byte slice was successfully -written, and this method will not return until all data has been -written or an error occurs.

- -

Errors

-

This function will return an instance of Error on error.

-
-

Provided Methods

-
-

fn write_char(&mut self, c: char) -> Result<(), Error>1.1.0

Writes a char into this writer, returning whether the write succeeded.

- -

A single char may be encoded as more than one byte. -This method can only succeed if the entire byte sequence was successfully -written, and this method will not return until all data has been -written or an error occurs.

- -

Errors

-

This function will return an instance of Error on error.

-

fn write_fmt(&mut self, args: Arguments) -> Result<(), Error>

Glue for usage of the write! macro with implementors of this trait.

- -

This method should generally not be invoked manually, but rather through -the write! macro itself.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fmt/type.Result.html b/doc/bitflags/__core/fmt/type.Result.html deleted file mode 100644 index 490908be..00000000 --- a/doc/bitflags/__core/fmt/type.Result.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::fmt::Result - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::fmt::Result - - [−] - - [src]

-
type Result = Result<(), Error>;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/fn.canonicalize.html b/doc/bitflags/__core/fs/fn.canonicalize.html deleted file mode 100644 index 0b11f17b..00000000 --- a/doc/bitflags/__core/fs/fn.canonicalize.html +++ /dev/null @@ -1,134 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::canonicalize - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fs::canonicalize - - [−] - - [src]

-
pub fn canonicalize<P>(path: P) -> Result<PathBuf, Error> where P: AsRef<Path>
1.5.0

Returns the canonical form of a path with all intermediate components -normalized and symbolic links resolved.

- -

Platform-specific behavior

-

This function currently corresponds to the realpath function on Unix -and the CreateFile and GetFinalPathNameByHandle functions on Windows. -Note that, this may change in the future.

- -

Errors

-

This function will return an error in the following situations, but is not -limited to just these cases:

- -
    -
  • path does not exist.
    • -
  • A component in path is not a directory.
    • -
- -

Examples

-
-use std::fs;
-
-let path = try!(fs::canonicalize("../a/../foo.txt"));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/fn.copy.html b/doc/bitflags/__core/fs/fn.copy.html deleted file mode 100644 index 3b7a509d..00000000 --- a/doc/bitflags/__core/fs/fn.copy.html +++ /dev/null @@ -1,145 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::copy - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fs::copy - - [−] - - [src]

-
pub fn copy<P, Q>(from: P, to: Q) -> Result<u64, Error> where Q: AsRef<Path>, P: AsRef<Path>
1.0.0

Copies the contents of one file to another. This function will also -copy the permission bits of the original file to the destination file.

- -

This function will overwrite the contents of to.

- -

Note that if from and to both point to the same file, then the file -will likely get truncated by this operation.

- -

On success, the total number of bytes copied is returned.

- -

Platform-specific behavior

-

This function currently corresponds to the open function in Unix -with O_RDONLY for from and O_WRONLY, O_CREAT, and O_TRUNC for to. -O_CLOEXEC is set for returned file descriptors. -On Windows, this function currently corresponds to CopyFileEx. -Note that, this may change in the future.

- -

Errors

-

This function will return an error in the following situations, but is not -limited to just these cases:

- -
    -
  • The from path is not a file.
    • -
  • The from file does not exist.
    • -
  • The current process does not have the permission rights to access -from or write to.
    • -
- -

Examples

-
-use std::fs;
-
-try!(fs::copy("foo.txt", "bar.txt"));  // Copy foo.txt to bar.txt
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/fn.create_dir.html b/doc/bitflags/__core/fs/fn.create_dir.html deleted file mode 100644 index a667bac7..00000000 --- a/doc/bitflags/__core/fs/fn.create_dir.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::create_dir - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fs::create_dir - - [−] - - [src]

-
pub fn create_dir<P>(path: P) -> Result<(), Error> where P: AsRef<Path>
1.0.0

Creates a new, empty directory at the provided path

- -

Platform-specific behavior

-

This function currently corresponds to the mkdir function on Unix -and the CreateDirectory function on Windows. -Note that, this may change in the future.

- -

Errors

-

This function will return an error in the following situations, but is not -limited to just these cases:

- -
    -
  • User lacks permissions to create directory at path.
    • -
  • path already exists.
    • -
- -

Examples

-
-use std::fs;
-
-try!(fs::create_dir("/some/dir"));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/fn.create_dir_all.html b/doc/bitflags/__core/fs/fn.create_dir_all.html deleted file mode 100644 index a38f8cbc..00000000 --- a/doc/bitflags/__core/fs/fn.create_dir_all.html +++ /dev/null @@ -1,136 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::create_dir_all - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fs::create_dir_all - - [−] - - [src]

-
pub fn create_dir_all<P>(path: P) -> Result<(), Error> where P: AsRef<Path>
1.0.0

Recursively create a directory and all of its parent components if they -are missing.

- -

Platform-specific behavior

-

This function currently corresponds to the mkdir function on Unix -and the CreateDirectory function on Windows. -Note that, this may change in the future.

- -

Errors

-

This function will return an error in the following situations, but is not -limited to just these cases:

- -
    -
  • If any directory in the path specified by path -does not already exist and it could not be created otherwise. The specific -error conditions for when a directory is being created (after it is -determined to not exist) are outlined by fs::create_dir.
    • -
- -

Examples

-
-use std::fs;
-
-try!(fs::create_dir_all("/some/dir"));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/fn.hard_link.html b/doc/bitflags/__core/fs/fn.hard_link.html deleted file mode 100644 index 942fd714..00000000 --- a/doc/bitflags/__core/fs/fn.hard_link.html +++ /dev/null @@ -1,135 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::hard_link - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fs::hard_link - - [−] - - [src]

-
pub fn hard_link<P, Q>(src: P, dst: Q) -> Result<(), Error> where Q: AsRef<Path>, P: AsRef<Path>
1.0.0

Creates a new hard link on the filesystem.

- -

The dst path will be a link pointing to the src path. Note that systems -often require these two paths to both be located on the same filesystem.

- -

Platform-specific behavior

-

This function currently corresponds to the link function on Unix -and the CreateHardLink function on Windows. -Note that, this may change in the future.

- -

Errors

-

This function will return an error in the following situations, but is not -limited to just these cases:

- -
    -
  • The src path is not a file or doesn't exist.
    • -
- -

Examples

-
-use std::fs;
-
-try!(fs::hard_link("a.txt", "b.txt")); // Hard link a.txt to b.txt
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/fn.metadata.html b/doc/bitflags/__core/fs/fn.metadata.html deleted file mode 100644 index c859620a..00000000 --- a/doc/bitflags/__core/fs/fn.metadata.html +++ /dev/null @@ -1,138 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::metadata - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fs::metadata - - [−] - - [src]

-
pub fn metadata<P>(path: P) -> Result<Metadata, Error> where P: AsRef<Path>
1.0.0

Given a path, query the file system to get information about a file, -directory, etc.

- -

This function will traverse symbolic links to query information about the -destination file.

- -

Platform-specific behavior

-

This function currently corresponds to the stat function on Unix -and the GetFileAttributesEx function on Windows. -Note that, this may change in the future.

- -

Errors

-

This function will return an error in the following situations, but is not -limited to just these cases:

- -
    -
  • The user lacks permissions to perform metadata call on path.
    • -
  • path does not exist.
    • -
- -

Examples

-
-use std::fs;
-
-let attr = try!(fs::metadata("/some/file/path.txt"));
-// inspect attr ...
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/fn.read_dir.html b/doc/bitflags/__core/fs/fn.read_dir.html deleted file mode 100644 index 12b8d421..00000000 --- a/doc/bitflags/__core/fs/fn.read_dir.html +++ /dev/null @@ -1,152 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::read_dir - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fs::read_dir - - [−] - - [src]

-
pub fn read_dir<P>(path: P) -> Result<ReadDir, Error> where P: AsRef<Path>
1.0.0

Returns an iterator over the entries within a directory.

- -

The iterator will yield instances of io::Result<DirEntry>. New errors may -be encountered after an iterator is initially constructed.

- -

Platform-specific behavior

-

This function currently corresponds to the opendir function on Unix -and the FindFirstFile function on Windows. -Note that, this may change in the future.

- -

Errors

-

This function will return an error in the following situations, but is not -limited to just these cases:

- -
    -
  • The provided path doesn't exist.
    • -
  • The process lacks permissions to view the contents.
    • -
  • The path points at a non-directory file.
    • -
- -

Examples

-
-use std::io;
-use std::fs::{self, DirEntry};
-use std::path::Path;
-
-// one possible implementation of walking a directory only visiting files
-fn visit_dirs(dir: &Path, cb: &Fn(&DirEntry)) -> io::Result<()> {
-    if try!(fs::metadata(dir)).is_dir() {
-        for entry in try!(fs::read_dir(dir)) {
-            let entry = try!(entry);
-            if try!(fs::metadata(entry.path())).is_dir() {
-                try!(visit_dirs(&entry.path(), cb));
-            } else {
-                cb(&entry);
-            }
-        }
-    }
-    Ok(())
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/fn.read_link.html b/doc/bitflags/__core/fs/fn.read_link.html deleted file mode 100644 index 2df263ef..00000000 --- a/doc/bitflags/__core/fs/fn.read_link.html +++ /dev/null @@ -1,134 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::read_link - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fs::read_link - - [−] - - [src]

-
pub fn read_link<P>(path: P) -> Result<PathBuf, Error> where P: AsRef<Path>
1.0.0

Reads a symbolic link, returning the file that the link points to.

- -

Platform-specific behavior

-

This function currently corresponds to the readlink function on Unix -and the CreateFile function with FILE_FLAG_OPEN_REPARSE_POINT and -FILE_FLAG_BACKUP_SEMANTICS flags on Windows. -Note that, this may change in the future.

- -

Errors

-

This function will return an error in the following situations, but is not -limited to just these cases:

- -
    -
  • path is not a symbolic link.
    • -
  • path does not exist.
    • -
- -

Examples

-
-use std::fs;
-
-let path = try!(fs::read_link("a.txt"));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/fn.remove_dir.html b/doc/bitflags/__core/fs/fn.remove_dir.html deleted file mode 100644 index bd7274d0..00000000 --- a/doc/bitflags/__core/fs/fn.remove_dir.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::remove_dir - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fs::remove_dir - - [−] - - [src]

-
pub fn remove_dir<P>(path: P) -> Result<(), Error> where P: AsRef<Path>
1.0.0

Removes an existing, empty directory.

- -

Platform-specific behavior

-

This function currently corresponds to the rmdir function on Unix -and the RemoveDirectory function on Windows. -Note that, this may change in the future.

- -

Errors

-

This function will return an error in the following situations, but is not -limited to just these cases:

- -
    -
  • The user lacks permissions to remove the directory at the provided path.
    • -
  • The directory isn't empty.
    • -
- -

Examples

-
-use std::fs;
-
-try!(fs::remove_dir("/some/dir"));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/fn.remove_dir_all.html b/doc/bitflags/__core/fs/fn.remove_dir_all.html deleted file mode 100644 index 151100e2..00000000 --- a/doc/bitflags/__core/fs/fn.remove_dir_all.html +++ /dev/null @@ -1,132 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::remove_dir_all - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fs::remove_dir_all - - [−] - - [src]

-
pub fn remove_dir_all<P>(path: P) -> Result<(), Error> where P: AsRef<Path>
1.0.0

Removes a directory at this path, after removing all its contents. Use -carefully!

- -

This function does not follow symbolic links and it will simply remove the -symbolic link itself.

- -

Platform-specific behavior

-

This function currently corresponds to opendir, lstat, rm and rmdir functions on Unix -and the FindFirstFile, GetFileAttributesEx, DeleteFile, and RemoveDirectory functions -on Windows. -Note that, this may change in the future.

- -

Errors

-

See file::remove_file and fs::remove_dir.

- -

Examples

-
-use std::fs;
-
-try!(fs::remove_dir_all("/some/dir"));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/fn.remove_file.html b/doc/bitflags/__core/fs/fn.remove_file.html deleted file mode 100644 index a11e0f0c..00000000 --- a/doc/bitflags/__core/fs/fn.remove_file.html +++ /dev/null @@ -1,137 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::remove_file - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fs::remove_file - - [−] - - [src]

-
pub fn remove_file<P>(path: P) -> Result<(), Error> where P: AsRef<Path>
1.0.0

Removes a file from the filesystem.

- -

Note that there is no -guarantee that the file is immediately deleted (e.g. depending on -platform, other open file descriptors may prevent immediate removal).

- -

Platform-specific behavior

-

This function currently corresponds to the unlink function on Unix -and the DeleteFile function on Windows. -Note that, this may change in the future.

- -

Errors

-

This function will return an error in the following situations, but is not -limited to just these cases:

- -
    -
  • path points to a directory.
    • -
  • The user lacks permissions to remove the file.
    • -
- -

Examples

-
-use std::fs;
-
-try!(fs::remove_file("a.txt"));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/fn.rename.html b/doc/bitflags/__core/fs/fn.rename.html deleted file mode 100644 index 24331cdc..00000000 --- a/doc/bitflags/__core/fs/fn.rename.html +++ /dev/null @@ -1,143 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::rename - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fs::rename - - [−] - - [src]

-
pub fn rename<P, Q>(from: P, to: Q) -> Result<(), Error> where Q: AsRef<Path>, P: AsRef<Path>
1.0.0

Rename a file or directory to a new name, replacing the original file if -to already exists.

- -

This will not work if the new name is on a different mount point.

- -

Platform-specific behavior

-

This function currently corresponds to the rename function on Unix -and the MoveFileEx function with the MOVEFILE_REPLACE_EXISTING flag on Windows.

- -

Because of this, the behavior when both from and to exist differs. On -Unix, if from is a directory, to must also be an (empty) directory. If -from is not a directory, to must also be not a directory. In contrast, -on Windows, from can be anything, but to must not be a directory.

- -

Note that, this may change in the future.

- -

Errors

-

This function will return an error in the following situations, but is not -limited to just these cases:

- -
    -
  • from does not exist.
    • -
  • The user lacks permissions to view contents.
    • -
  • from and to are on separate filesystems.
    • -
- -

Examples

-
-use std::fs;
-
-try!(fs::rename("a.txt", "b.txt")); // Rename a.txt to b.txt
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/fn.set_permissions.html b/doc/bitflags/__core/fs/fn.set_permissions.html deleted file mode 100644 index 75389ae4..00000000 --- a/doc/bitflags/__core/fs/fn.set_permissions.html +++ /dev/null @@ -1,135 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::set_permissions - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fs::set_permissions - - [−] - - [src]

-
pub fn set_permissions<P>(path: P, perm: Permissions) -> Result<(), Error> where P: AsRef<Path>
1.1.0

Changes the permissions found on a file or a directory.

- -

Platform-specific behavior

-

This function currently corresponds to the chmod function on Unix -and the SetFileAttributes function on Windows. -Note that, this may change in the future.

- -

Errors

-

This function will return an error in the following situations, but is not -limited to just these cases:

- -
    -
  • path does not exist.
    • -
  • The user lacks the permission to change attributes of the file.
    • -
- -

Examples

-
-use std::fs;
-
-let mut perms = try!(fs::metadata("foo.txt")).permissions();
-perms.set_readonly(true);
-try!(fs::set_permissions("foo.txt", perms));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/fn.soft_link.html b/doc/bitflags/__core/fs/fn.soft_link.html deleted file mode 100644 index 2c8fba7f..00000000 --- a/doc/bitflags/__core/fs/fn.soft_link.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::soft_link - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fs::soft_link - - [−] - - [src]

-
pub fn soft_link<P, Q>(src: P, dst: Q) -> Result<(), Error> where P: AsRef<Path>, Q: AsRef<Path>
1.0.0
Deprecated since 1.1.0

: replaced with std::os::unix::fs::symlink and std::os::windows::fs::{symlink_file, symlink_dir}

-

Creates a new symbolic link on the filesystem.

- -

The dst path will be a symbolic link pointing to the src path. -On Windows, this will be a file symlink, not a directory symlink; -for this reason, the platform-specific std::os::unix::fs::symlink -and std::os::windows::fs::{symlink_file, symlink_dir} should be -used instead to make the intent explicit.

- -

Examples

-
-use std::fs;
-
-try!(fs::soft_link("a.txt", "b.txt"));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/fn.symlink_metadata.html b/doc/bitflags/__core/fs/fn.symlink_metadata.html deleted file mode 100644 index 0eeceb70..00000000 --- a/doc/bitflags/__core/fs/fn.symlink_metadata.html +++ /dev/null @@ -1,134 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::symlink_metadata - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::fs::symlink_metadata - - [−] - - [src]

-
pub fn symlink_metadata<P>(path: P) -> Result<Metadata, Error> where P: AsRef<Path>
1.1.0

Query the metadata about a file without following symlinks.

- -

Platform-specific behavior

-

This function currently corresponds to the lstat function on Unix -and the GetFileAttributesEx function on Windows. -Note that, this may change in the future.

- -

Errors

-

This function will return an error in the following situations, but is not -limited to just these cases:

- -
    -
  • The user lacks permissions to perform metadata call on path.
    • -
  • path does not exist.
    • -
- -

Examples

-
-use std::fs;
-
-let attr = try!(fs::symlink_metadata("/some/file/path.txt"));
-// inspect attr ...
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/index.html b/doc/bitflags/__core/fs/index.html deleted file mode 100644 index 9e6b209d..00000000 --- a/doc/bitflags/__core/fs/index.html +++ /dev/null @@ -1,287 +0,0 @@ - - - - - - - - - - bitflags::__core::fs - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::fs - - [−] - - [src]

-

Filesystem manipulation operations.

- -

This module contains basic methods to manipulate the contents of the local -filesystem. All methods in this module represent cross-platform filesystem -operations. Extra platform-specific functionality can be found in the -extension traits of std::os::$platform.

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
DirBuilder -

A builder used to create directories in various manners.

-
DirEntry -

Entries returned by the ReadDir iterator.

-
File -

A reference to an open file on the filesystem.

-
FileType -

An structure representing a type of file with accessors for each file type.

-
Metadata -

Metadata information about a file.

-
OpenOptions -

Options and flags which can be used to configure how a file is opened.

-
Permissions -

Representation of the various permissions on a file.

-
ReadDir -

Iterator over the entries in a directory.

-

Functions

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
canonicalize -

Returns the canonical form of a path with all intermediate components -normalized and symbolic links resolved.

-
copy -

Copies the contents of one file to another. This function will also -copy the permission bits of the original file to the destination file.

-
create_dir -

Creates a new, empty directory at the provided path

-
create_dir_all -

Recursively create a directory and all of its parent components if they -are missing.

-
hard_link -

Creates a new hard link on the filesystem.

-
metadata -

Given a path, query the file system to get information about a file, -directory, etc.

-
read_dir -

Returns an iterator over the entries within a directory.

-
read_link -

Reads a symbolic link, returning the file that the link points to.

-
remove_dir -

Removes an existing, empty directory.

-
remove_dir_all -

Removes a directory at this path, after removing all its contents. Use -carefully!

-
remove_file -

Removes a file from the filesystem.

-
rename -

Rename a file or directory to a new name, replacing the original file if -to already exists.

-
set_permissions -

Changes the permissions found on a file or a directory.

-
soft_link - [Deprecated]

Creates a new symbolic link on the filesystem.

-
symlink_metadata -

Query the metadata about a file without following symlinks.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/sidebar-items.js b/doc/bitflags/__core/fs/sidebar-items.js deleted file mode 100644 index 5d19333b..00000000 --- a/doc/bitflags/__core/fs/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["canonicalize","Returns the canonical form of a path with all intermediate components normalized and symbolic links resolved."],["copy","Copies the contents of one file to another. This function will also copy the permission bits of the original file to the destination file."],["create_dir","Creates a new, empty directory at the provided path"],["create_dir_all","Recursively create a directory and all of its parent components if they are missing."],["hard_link","Creates a new hard link on the filesystem."],["metadata","Given a path, query the file system to get information about a file, directory, etc."],["read_dir","Returns an iterator over the entries within a directory."],["read_link","Reads a symbolic link, returning the file that the link points to."],["remove_dir","Removes an existing, empty directory."],["remove_dir_all","Removes a directory at this path, after removing all its contents. Use carefully!"],["remove_file","Removes a file from the filesystem."],["rename","Rename a file or directory to a new name, replacing the original file if `to` already exists."],["set_permissions","Changes the permissions found on a file or a directory."],["soft_link","Creates a new symbolic link on the filesystem."],["symlink_metadata","Query the metadata about a file without following symlinks."]],"struct":[["DirBuilder","A builder used to create directories in various manners."],["DirEntry","Entries returned by the `ReadDir` iterator."],["File","A reference to an open file on the filesystem."],["FileType","An structure representing a type of file with accessors for each file type."],["Metadata","Metadata information about a file."],["OpenOptions","Options and flags which can be used to configure how a file is opened."],["Permissions","Representation of the various permissions on a file."],["ReadDir","Iterator over the entries in a directory."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/fs/struct.DirBuilder.html b/doc/bitflags/__core/fs/struct.DirBuilder.html deleted file mode 100644 index 6446ad6c..00000000 --- a/doc/bitflags/__core/fs/struct.DirBuilder.html +++ /dev/null @@ -1,141 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::DirBuilder - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fs::DirBuilder - - [−] - - [src]

-
pub struct DirBuilder {
-    // some fields omitted
-}
1.6.0

A builder used to create directories in various manners.

- -

This builder also supports platform-specific options.

-

Methods

impl DirBuilder

fn new() -> DirBuilder

-

Creates a new set of options with default mode/security settings for all -platforms and also non-recursive.

-

fn recursive(&mut self, recursive: bool) -> &mut DirBuilder

-

Indicate that directories create should be created recursively, creating -all parent directories if they do not exist with the same security and -permissions settings.

- -

This option defaults to false

-

fn create<P>(&self, path: P) -> Result<(), Error> where P: AsRef<Path>

-

Create the specified directory with the options configured in this -builder.

- -

Examples

-
-use std::fs::{self, DirBuilder};
-
-let path = "/tmp/foo/bar/baz";
-DirBuilder::new()
-    .recursive(true)
-    .create(path).unwrap();
-
-assert!(fs::metadata(path).unwrap().is_dir());
-

Trait Implementations

impl DirBuilderExt for DirBuilder

fn mode(&mut self, mode: u32) -> &mut DirBuilder

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/struct.DirEntry.html b/doc/bitflags/__core/fs/struct.DirEntry.html deleted file mode 100644 index 9142714b..00000000 --- a/doc/bitflags/__core/fs/struct.DirEntry.html +++ /dev/null @@ -1,163 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::DirEntry - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fs::DirEntry - - [−] - - [src]

-
pub struct DirEntry(_);
1.0.0

Entries returned by the ReadDir iterator.

- -

An instance of DirEntry represents an entry inside of a directory on the -filesystem. Each entry can be inspected via methods to learn about the full -path or possibly other metadata through per-platform extension traits.

-

Methods

impl DirEntry

fn path(&self) -> PathBuf

-

Returns the full path to the file that this entry represents.

- -

The full path is created by joining the original path to read_dir or -walk_dir with the filename of this entry.

- -

Examples

-
-use std::fs;
-for entry in try!(fs::read_dir(".")) {
-    let dir = try!(entry);
-    println!("{:?}", dir.path());
-}
- -

This prints output like:

- -
"./whatever.txt"
-"./foo.html"
-"./hello_world.rs"
-
- -

The exact text, of course, depends on what files you have in ..

-

fn metadata(&self) -> Result<Metadata, Error>1.1.0

-

Return the metadata for the file that this entry points at.

- -

This function will not traverse symlinks if this entry points at a -symlink.

- -

Platform-specific behavior

-

On Windows this function is cheap to call (no extra system calls -needed), but on Unix platforms this function is the equivalent of -calling symlink_metadata on the path.

-

fn file_type(&self) -> Result<FileType, Error>1.1.0

-

Return the file type for the file that this entry points at.

- -

This function will not traverse symlinks if this entry points at a -symlink.

- -

Platform-specific behavior

-

On Windows and most Unix platforms this function is free (no extra -system calls needed), but some Unix platforms may require the equivalent -call to symlink_metadata to learn about the target file type.

-

fn file_name(&self) -> OsString1.1.0

-

Returns the bare file name of this directory entry without any other -leading path component.

-

Trait Implementations

impl DirEntryExt for DirEntry1.1.0

fn ino(&self) -> u64

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/struct.File.html b/doc/bitflags/__core/fs/struct.File.html deleted file mode 100644 index 5fea8a25..00000000 --- a/doc/bitflags/__core/fs/struct.File.html +++ /dev/null @@ -1,261 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::File - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fs::File - - [−] - - [src]

-
pub struct File {
-    // some fields omitted
-}
1.0.0

A reference to an open file on the filesystem.

- -

An instance of a File can be read and/or written depending on what options -it was opened with. Files also implement Seek to alter the logical cursor -that the file contains internally.

- -

Examples

-
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::create("foo.txt"));
-try!(f.write_all(b"Hello, world!"));
-
-let mut f = try!(File::open("foo.txt"));
-let mut s = String::new();
-try!(f.read_to_string(&mut s));
-assert_eq!(s, "Hello, world!");
-

Methods

impl File

fn open<P>(path: P) -> Result<File, Error> where P: AsRef<Path>

-

Attempts to open a file in read-only mode.

- -

See the OpenOptions::open method for more details.

- -

Errors

-

This function will return an error if path does not already exist. -Other errors may also be returned according to OpenOptions::open.

- -

Examples

-
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-

fn create<P>(path: P) -> Result<File, Error> where P: AsRef<Path>

-

Opens a file in write-only mode.

- -

This function will create a file if it does not exist, -and will truncate it if it does.

- -

See the OpenOptions::open function for more details.

- -

Examples

-
-use std::fs::File;
-
-let mut f = try!(File::create("foo.txt"));
-

fn sync_all(&self) -> Result<(), Error>

-

Attempts to sync all OS-internal metadata to disk.

- -

This function will attempt to ensure that all in-core data reaches the -filesystem before returning.

- -

Examples

-
-use std::fs::File;
-use std::io::prelude::*;
-
-let mut f = try!(File::create("foo.txt"));
-try!(f.write_all(b"Hello, world!"));
-
-try!(f.sync_all());
-

fn sync_data(&self) -> Result<(), Error>

-

This function is similar to sync_all, except that it may not -synchronize file metadata to the filesystem.

- -

This is intended for use cases that must synchronize content, but don't -need the metadata on disk. The goal of this method is to reduce disk -operations.

- -

Note that some platforms may simply implement this in terms of -sync_all.

- -

Examples

-
-use std::fs::File;
-use std::io::prelude::*;
-
-let mut f = try!(File::create("foo.txt"));
-try!(f.write_all(b"Hello, world!"));
-
-try!(f.sync_data());
-

fn set_len(&self, size: u64) -> Result<(), Error>

-

Truncates or extends the underlying file, updating the size of -this file to become size.

- -

If the size is less than the current file's size, then the file will -be shrunk. If it is greater than the current file's size, then the file -will be extended to size and have all of the intermediate data filled -in with 0s.

- -

Errors

-

This function will return an error if the file is not opened for writing.

- -

Examples

-
-use std::fs::File;
-
-let mut f = try!(File::create("foo.txt"));
-try!(f.set_len(10));
-

fn metadata(&self) -> Result<Metadata, Error>

-

Queries metadata about the underlying file.

- -

Examples

-
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let metadata = try!(f.metadata());
-

fn try_clone(&self) -> Result<File, Error>1.9.0

-

Creates a new independently owned handle to the underlying file.

- -

The returned File is a reference to the same state that this object -references. Both handles will read and write with the same cursor -position.

-

Trait Implementations

impl Debug for File

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl Read for File

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-

impl Write for File

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

impl Seek for File

fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>

-

impl<'a> Read for &'a File

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-

impl<'a> Write for &'a File

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

impl<'a> Seek for &'a File

fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>

-

impl AsRawFd for File

fn as_raw_fd(&self) -> i32

-

impl FromRawFd for File1.1.0

unsafe fn from_raw_fd(fd: i32) -> File

-

impl IntoRawFd for File1.4.0

fn into_raw_fd(self) -> i32

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/struct.FileType.html b/doc/bitflags/__core/fs/struct.FileType.html deleted file mode 100644 index 6d09f43a..00000000 --- a/doc/bitflags/__core/fs/struct.FileType.html +++ /dev/null @@ -1,129 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::FileType - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fs::FileType - - [−] - - [src]

-
pub struct FileType(_);
1.1.0

An structure representing a type of file with accessors for each file type.

-

Methods

impl FileType

fn is_dir(&self) -> bool

-

Test whether this file type represents a directory.

-

fn is_file(&self) -> bool

-

Test whether this file type represents a regular file.

-
-

Test whether this file type represents a symbolic link.

-

Trait Implementations

impl FileTypeExt for FileType1.5.0

fn is_block_device(&self) -> bool

-

fn is_char_device(&self) -> bool

-

fn is_fifo(&self) -> bool

-

fn is_socket(&self) -> bool

-

Derived Implementations

impl Hash for FileType

fn hash<__H>(&self, __arg_0: &mut __H) where __H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl Eq for FileType

impl PartialEq<FileType> for FileType

fn eq(&self, __arg_0: &FileType) -> bool

-

fn ne(&self, __arg_0: &FileType) -> bool

-

impl Clone for FileType

fn clone(&self) -> FileType

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Copy for FileType

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/struct.Metadata.html b/doc/bitflags/__core/fs/struct.Metadata.html deleted file mode 100644 index d59ed2cb..00000000 --- a/doc/bitflags/__core/fs/struct.Metadata.html +++ /dev/null @@ -1,231 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::Metadata - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fs::Metadata - - [−] - - [src]

-
pub struct Metadata(_);
1.0.0

Metadata information about a file.

- -

This structure is returned from the metadata function or method and -represents known metadata about a file such as its permissions, size, -modification times, etc.

-

Methods

impl Metadata

fn file_type(&self) -> FileType1.1.0

-

Returns the file type for this metadata.

-

fn is_dir(&self) -> bool

-

Returns whether this metadata is for a directory.

- -

Examples

-
-use std::fs;
-
-let metadata = try!(fs::metadata("foo.txt"));
-
-assert!(!metadata.is_dir());
-

fn is_file(&self) -> bool

-

Returns whether this metadata is for a regular file.

- -

Examples

-
-use std::fs;
-
-let metadata = try!(fs::metadata("foo.txt"));
-
-assert!(metadata.is_file());
-

fn len(&self) -> u64

-

Returns the size of the file, in bytes, this metadata is for.

- -

Examples

-
-use std::fs;
-
-let metadata = try!(fs::metadata("foo.txt"));
-
-assert_eq!(0, metadata.len());
-

fn permissions(&self) -> Permissions

-

Returns the permissions of the file this metadata is for.

- -

Examples

-
-use std::fs;
-
-let metadata = try!(fs::metadata("foo.txt"));
-
-assert!(!metadata.permissions().readonly());
-

fn modified(&self) -> Result<SystemTime, Error>

-
Unstable (fs_time)

Returns the last modification time listed in this metadata.

- -

The returned value corresponds to the mtime field of stat on Unix -platforms and the ftLastWriteTime field on Windows platforms.

- -

Errors

-

This field may not be available on all platforms, and will return an -Err on platforms where it is not available.

-

fn accessed(&self) -> Result<SystemTime, Error>

-
Unstable (fs_time)

Returns the last access time of this metadata.

- -

The returned value corresponds to the atime field of stat on Unix -platforms and the ftLastAccessTime field on Windows platforms.

- -

Note that not all platforms will keep this field update in a file's -metadata, for example Windows has an option to disable updating this -time when files are accessed and Linux similarly has noatime.

- -

Errors

-

This field may not be available on all platforms, and will return an -Err on platforms where it is not available.

-

fn created(&self) -> Result<SystemTime, Error>

-
Unstable (fs_time)

Returns the creation time listed in the this metadata.

- -

The returned value corresponds to the birthtime field of stat on -Unix platforms and the ftCreationTime field on Windows platforms.

- -

Errors

-

This field may not be available on all platforms, and will return an -Err on platforms where it is not available.

-

Trait Implementations

impl MetadataExt for Metadata1.1.0

fn as_raw_stat(&self) -> &stat

-

fn st_dev(&self) -> u64

-

fn st_ino(&self) -> u64

-

fn st_mode(&self) -> u32

- -

fn st_uid(&self) -> u32

-

fn st_gid(&self) -> u32

-

fn st_rdev(&self) -> u64

-

fn st_size(&self) -> u64

-

fn st_atime(&self) -> i64

-

fn st_atime_nsec(&self) -> i64

-

fn st_mtime(&self) -> i64

-

fn st_mtime_nsec(&self) -> i64

-

fn st_ctime(&self) -> i64

-

fn st_ctime_nsec(&self) -> i64

-

fn st_birthtime(&self) -> i64

-

fn st_birthtime_nsec(&self) -> i64

-

fn st_blksize(&self) -> u64

-

fn st_blocks(&self) -> u64

-

fn st_gen(&self) -> u32

-

fn st_flags(&self) -> u32

-

fn st_lspare(&self) -> u32

-

fn st_qspare(&self) -> [u64; 2]

-

impl MetadataExt for Metadata1.1.0

fn dev(&self) -> u64

-

fn ino(&self) -> u64

-

fn mode(&self) -> u32

- -

fn uid(&self) -> u32

-

fn gid(&self) -> u32

-

fn rdev(&self) -> u64

-

fn size(&self) -> u64

-

fn atime(&self) -> i64

-

fn atime_nsec(&self) -> i64

-

fn mtime(&self) -> i64

-

fn mtime_nsec(&self) -> i64

-

fn ctime(&self) -> i64

-

fn ctime_nsec(&self) -> i64

-

fn blksize(&self) -> u64

-

fn blocks(&self) -> u64

-

Derived Implementations

impl Clone for Metadata

fn clone(&self) -> Metadata

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/struct.OpenOptions.html b/doc/bitflags/__core/fs/struct.OpenOptions.html deleted file mode 100644 index 47438a70..00000000 --- a/doc/bitflags/__core/fs/struct.OpenOptions.html +++ /dev/null @@ -1,285 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::OpenOptions - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fs::OpenOptions - - [−] - - [src]

-
pub struct OpenOptions(_);
1.0.0

Options and flags which can be used to configure how a file is opened.

- -

This builder exposes the ability to configure how a File is opened and -what operations are permitted on the open file. The File::open and -File::create methods are aliases for commonly used options using this -builder.

- -

Generally speaking, when using OpenOptions, you'll first call new(), -then chain calls to methods to set each option, then call open(), passing -the path of the file you're trying to open. This will give you a -io::Result with a File inside that you can further -operate on.

- -

Examples

-

Opening a file to read:

- -
-use std::fs::OpenOptions;
-
-let file = OpenOptions::new().read(true).open("foo.txt");
- -

Opening a file for both reading and writing, as well as creating it if it -doesn't exist:

- -
-use std::fs::OpenOptions;
-
-let file = OpenOptions::new()
-            .read(true)
-            .write(true)
-            .create(true)
-            .open("foo.txt");
-

Methods

impl OpenOptions

fn new() -> OpenOptions

-

Creates a blank new set of options ready for configuration.

- -

All options are initially set to false.

- -

Examples

-
-use std::fs::OpenOptions;
-
-let mut options = OpenOptions::new();
-let file = options.read(true).open("foo.txt");
-

fn read(&mut self, read: bool) -> &mut OpenOptions

-

Sets the option for read access.

- -

This option, when true, will indicate that the file should be -read-able if opened.

- -

Examples

-
-use std::fs::OpenOptions;
-
-let file = OpenOptions::new().read(true).open("foo.txt");
-

fn write(&mut self, write: bool) -> &mut OpenOptions

-

Sets the option for write access.

- -

This option, when true, will indicate that the file should be -write-able if opened.

- -

If the file already exists, any write calls on it will overwrite its -contents, without truncating it.

- -

Examples

-
-use std::fs::OpenOptions;
-
-let file = OpenOptions::new().write(true).open("foo.txt");
-

fn append(&mut self, append: bool) -> &mut OpenOptions

-

Sets the option for the append mode.

- -

This option, when true, means that writes will append to a file instead -of overwriting previous contents. -Note that setting .write(true).append(true) has the same effect as -setting only .append(true).

- -

For most filesystems, the operating system guarantees that all writes are -atomic: no writes get mangled because another process writes at the same -time.

- -

One maybe obvious note when using append-mode: make sure that all data -that belongs together is written to the file in one operation. This -can be done by concatenating strings before passing them to write(), -or using a buffered writer (with a buffer of adequate size), -and calling flush() when the message is complete.

- -

If a file is opened with both read and append access, beware that after -opening, and after every write, the position for reading may be set at the -end of the file. So, before writing, save the current position (using -seek(SeekFrom::Current(0)), and restore it before the next read.

- -

Examples

-
-use std::fs::OpenOptions;
-
-let file = OpenOptions::new().append(true).open("foo.txt");
-

fn truncate(&mut self, truncate: bool) -> &mut OpenOptions

-

Sets the option for truncating a previous file.

- -

If a file is successfully opened with this option set it will truncate -the file to 0 length if it already exists.

- -

The file must be opened with write access for truncate to work.

- -

Examples

-
-use std::fs::OpenOptions;
-
-let file = OpenOptions::new().write(true).truncate(true).open("foo.txt");
-

fn create(&mut self, create: bool) -> &mut OpenOptions

-

Sets the option for creating a new file.

- -

This option indicates whether a new file will be created if the file -does not yet already exist.

- -

In order for the file to be created, write or append access must -be used.

- -

Examples

-
-use std::fs::OpenOptions;
-
-let file = OpenOptions::new().write(true).create(true).open("foo.txt");
-

fn create_new(&mut self, create_new: bool) -> &mut OpenOptions1.9.0

-

Sets the option to always create a new file.

- -

This option indicates whether a new file will be created. -No file is allowed to exist at the target location, also no (dangling) -symlink.

- -

This option is useful because it as atomic. Otherwise between checking -whether a file exists and creating a new one, the file may have been -created by another process (a TOCTOU race condition / attack).

- -

If .create_new(true) is set, .create() and .truncate() are -ignored.

- -

The file must be opened with write or append access in order to create -a new file.

- -

Examples

-
-use std::fs::OpenOptions;
-
-let file = OpenOptions::new().write(true)
-                             .create_new(true)
-                             .open("foo.txt");
-

fn open<P>(&self, path: P) -> Result<File, Error> where P: AsRef<Path>

-

Opens a file at path with the options specified by self.

- -

Errors

-

This function will return an error under a number of different -circumstances, to include but not limited to:

- -
    -
  • Opening a file that does not exist without setting create or -create_new.
    • -
  • Attempting to open a file with access that the user lacks -permissions for
    • -
  • Filesystem-level errors (full disk, etc)
    • -
  • Invalid combinations of open options (truncate without write access, -no access mode set, etc)
    • -
- -

Examples

-
-use std::fs::OpenOptions;
-
-let file = OpenOptions::new().open("foo.txt");
-

Trait Implementations

impl OpenOptionsExt for OpenOptions1.1.0

fn mode(&mut self, mode: u32) -> &mut OpenOptions

-

fn custom_flags(&mut self, flags: i32) -> &mut OpenOptions

-

Derived Implementations

impl Clone for OpenOptions

fn clone(&self) -> OpenOptions

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/struct.Permissions.html b/doc/bitflags/__core/fs/struct.Permissions.html deleted file mode 100644 index 469b5449..00000000 --- a/doc/bitflags/__core/fs/struct.Permissions.html +++ /dev/null @@ -1,158 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::Permissions - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fs::Permissions - - [−] - - [src]

-
pub struct Permissions(_);
1.0.0

Representation of the various permissions on a file.

- -

This module only currently provides one bit of information, readonly, -which is exposed on all currently supported platforms. Unix-specific -functionality, such as mode bits, is available through the -os::unix::PermissionsExt trait.

-

Methods

impl Permissions

fn readonly(&self) -> bool

-

Returns whether these permissions describe a readonly file.

- -

Examples

-
-use std::fs::File;
-
-let mut f = try!(File::create("foo.txt"));
-let metadata = try!(f.metadata());
-
-assert_eq!(false, metadata.permissions().readonly());
-

fn set_readonly(&mut self, readonly: bool)

-

Modifies the readonly flag for this set of permissions.

- -

This operation does not modify the filesystem. To modify the -filesystem use the fs::set_permissions function.

- -

Examples

-
-use std::fs::File;
-
-let f = try!(File::create("foo.txt"));
-let metadata = try!(f.metadata());
-let mut permissions = metadata.permissions();
-
-permissions.set_readonly(true);
-
-// filesystem doesn't change
-assert_eq!(false, metadata.permissions().readonly());
-
-// just this particular `permissions`.
-assert_eq!(true, permissions.readonly());
-

Trait Implementations

impl PermissionsExt for Permissions1.1.0

fn mode(&self) -> u32

-

fn set_mode(&mut self, mode: u32)

-

fn from_mode(mode: u32) -> Permissions

-

Derived Implementations

impl Debug for Permissions

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl Eq for Permissions

impl PartialEq<Permissions> for Permissions

fn eq(&self, __arg_0: &Permissions) -> bool

-

fn ne(&self, __arg_0: &Permissions) -> bool

-

impl Clone for Permissions

fn clone(&self) -> Permissions

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/fs/struct.ReadDir.html b/doc/bitflags/__core/fs/struct.ReadDir.html deleted file mode 100644 index f817a809..00000000 --- a/doc/bitflags/__core/fs/struct.ReadDir.html +++ /dev/null @@ -1,170 +0,0 @@ - - - - - - - - - - bitflags::__core::fs::ReadDir - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::fs::ReadDir - - [−] - - [src]

-
pub struct ReadDir(_);
1.0.0

Iterator over the entries in a directory.

- -

This iterator is returned from the read_dir function of this module and -will yield instances of io::Result<DirEntry>. Through a DirEntry -information like the entry's path and possibly other metadata can be -learned.

- -

Errors

-

This io::Result will be an Err if there's some sort of intermittent -IO error during iteration.

-

Trait Implementations

impl Iterator for ReadDir

type Item = Result<DirEntry, Error>

-

fn next(&mut self) -> Option<Result<DirEntry, Error>>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/hash/index.html b/doc/bitflags/__core/hash/index.html deleted file mode 100644 index b2682f73..00000000 --- a/doc/bitflags/__core/hash/index.html +++ /dev/null @@ -1,207 +0,0 @@ - - - - - - - - - - bitflags::__core::hash - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::hash - - [−] - - [src]

-

Generic hashing support.

- -

This module provides a generic way to compute the hash of a value. The -simplest way to make a type hashable is to use #[derive(Hash)]:

- -

Examples

-
-use std::hash::{Hash, SipHasher, Hasher};
-
-#[derive(Hash)]
-struct Person {
-    id: u32,
-    name: String,
-    phone: u64,
-}
-
-let person1 = Person { id: 5, name: "Janet".to_string(), phone: 555_666_7777 };
-let person2 = Person { id: 5, name: "Bob".to_string(), phone: 555_666_7777 };
-
-assert!(hash(&person1) != hash(&person2));
-
-fn hash<T: Hash>(t: &T) -> u64 {
-    let mut s = SipHasher::new();
-    t.hash(&mut s);
-    s.finish()
-}
- -

If you need more control over how a value is hashed, you need to implement -the trait Hash:

- -
-use std::hash::{Hash, Hasher, SipHasher};
-
-struct Person {
-    id: u32,
-    name: String,
-    phone: u64,
-}
-
-impl Hash for Person {
-    fn hash<H: Hasher>(&self, state: &mut H) {
-        self.id.hash(state);
-        self.phone.hash(state);
-    }
-}
-
-let person1 = Person { id: 5, name: "Janet".to_string(), phone: 555_666_7777 };
-let person2 = Person { id: 5, name: "Bob".to_string(), phone: 555_666_7777 };
-
-assert_eq!(hash(&person1), hash(&person2));
-
-fn hash<T: Hash>(t: &T) -> u64 {
-    let mut s = SipHasher::new();
-    t.hash(&mut s);
-    s.finish()
-}
-

Structs

- - - - - - - - -
BuildHasherDefault -

A structure which implements BuildHasher for all Hasher types which also -implement Default.

-
SipHasher -

An implementation of SipHash 2-4.

-

Traits

- - - - - - - - - - - - -
BuildHasher -

A BuildHasher is typically used as a factory for instances of Hasher -which a HashMap can then use to hash keys independently.

-
Hash -

A hashable type.

-
Hasher -

A trait which represents the ability to hash an arbitrary stream of bytes.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/hash/sidebar-items.js b/doc/bitflags/__core/hash/sidebar-items.js deleted file mode 100644 index ee89b4b2..00000000 --- a/doc/bitflags/__core/hash/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["BuildHasherDefault","A structure which implements `BuildHasher` for all `Hasher` types which also implement `Default`."],["SipHasher","An implementation of SipHash 2-4."]],"trait":[["BuildHasher","A `BuildHasher` is typically used as a factory for instances of `Hasher` which a `HashMap` can then use to hash keys independently."],["Hash","A hashable type."],["Hasher","A trait which represents the ability to hash an arbitrary stream of bytes."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/hash/struct.BuildHasherDefault.html b/doc/bitflags/__core/hash/struct.BuildHasherDefault.html deleted file mode 100644 index 1e934289..00000000 --- a/doc/bitflags/__core/hash/struct.BuildHasherDefault.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - bitflags::__core::hash::BuildHasherDefault - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::hash::BuildHasherDefault - - [−] - - [src]

-
pub struct BuildHasherDefault<H>(_);
1.7.0

A structure which implements BuildHasher for all Hasher types which also -implement Default.

- -

This struct is 0-sized and does not need construction.

-

Trait Implementations

impl<H> Debug for BuildHasherDefault<H>1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<H> BuildHasher for BuildHasherDefault<H> where H: Default + Hasher

type Hasher = H

-

fn build_hasher(&self) -> H

-

impl<H> Clone for BuildHasherDefault<H>

fn clone(&self) -> BuildHasherDefault<H>

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<H> Default for BuildHasherDefault<H>

fn default() -> BuildHasherDefault<H>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/hash/struct.SipHasher.html b/doc/bitflags/__core/hash/struct.SipHasher.html deleted file mode 100644 index a6dab571..00000000 --- a/doc/bitflags/__core/hash/struct.SipHasher.html +++ /dev/null @@ -1,149 +0,0 @@ - - - - - - - - - - bitflags::__core::hash::SipHasher - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::hash::SipHasher - - [−] - - [src]

-
pub struct SipHasher {
-    // some fields omitted
-}
1.0.0

An implementation of SipHash 2-4.

- -

See: https://131002.net/siphash/

- -

This is currently the default hashing function used by standard library -(eg. collections::HashMap uses it by default).

- -

SipHash is a general-purpose hashing function: it runs at a good -speed (competitive with Spooky and City) and permits strong keyed -hashing. This lets you key your hashtables from a strong RNG, such as -rand::os::OsRng.

- -

Although the SipHash algorithm is considered to be generally strong, -it is not intended for cryptographic purposes. As such, all -cryptographic uses of this implementation are strongly discouraged.

-

Methods

impl SipHasher

fn new() -> SipHasher

-

Creates a new SipHasher with the two initial keys set to 0.

-

fn new_with_keys(key0: u64, key1: u64) -> SipHasher

-

Creates a SipHasher that is keyed off the provided keys.

-

Trait Implementations

impl Hasher for SipHasher

fn write(&mut self, msg: &[u8])

-

fn finish(&self) -> u64

-

fn write_u8(&mut self, i: u8)1.3.0

-

fn write_u16(&mut self, i: u16)1.3.0

-

fn write_u32(&mut self, i: u32)1.3.0

-

fn write_u64(&mut self, i: u64)1.3.0

-

fn write_usize(&mut self, i: usize)1.3.0

-

fn write_i8(&mut self, i: i8)1.3.0

-

fn write_i16(&mut self, i: i16)1.3.0

-

fn write_i32(&mut self, i: i32)1.3.0

-

fn write_i64(&mut self, i: i64)1.3.0

-

fn write_isize(&mut self, i: isize)1.3.0

-

impl Clone for SipHasher

fn clone(&self) -> SipHasher

-

fn clone_from(&mut self, source: &Self)

-

impl Default for SipHasher

fn default() -> SipHasher

-

Derived Implementations

impl Debug for SipHasher

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/hash/trait.BuildHasher.html b/doc/bitflags/__core/hash/trait.BuildHasher.html deleted file mode 100644 index ba6a740c..00000000 --- a/doc/bitflags/__core/hash/trait.BuildHasher.html +++ /dev/null @@ -1,136 +0,0 @@ - - - - - - - - - - bitflags::__core::hash::BuildHasher - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::hash::BuildHasher - - [−] - - [src]

-
pub trait BuildHasher {
-    type Hasher: Hasher;
-    fn build_hasher(&self) -> Self::Hasher;
-}

A BuildHasher is typically used as a factory for instances of Hasher -which a HashMap can then use to hash keys independently.

- -

Note that for each instance of BuildHasher, the created hashers should be -identical. That is, if the same stream of bytes is fed into each hasher, the -same output will also be generated.

-
-

Associated Types

-
-

type Hasher: Hasher

Type of the hasher that will be created.

-
-

Required Methods

-
-

fn build_hasher(&self) -> Self::Hasher

Creates a new hasher.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/hash/trait.Hash.html b/doc/bitflags/__core/hash/trait.Hash.html deleted file mode 100644 index 1dd31bc5..00000000 --- a/doc/bitflags/__core/hash/trait.Hash.html +++ /dev/null @@ -1,298 +0,0 @@ - - - - - - - - - - bitflags::__core::hash::Hash - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::hash::Hash - - [−] - - [src]

-
pub trait Hash {
-    fn hash<H>(&self, state: &mut H) where H: Hasher;
-
-    fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher { ... }
-}

A hashable type.

- -

The H type parameter is an abstract hash state that is used by the Hash -to compute the hash.

- -

If you are also implementing Eq, there is an additional property that -is important:

- -
k1 == k2 -> hash(k1) == hash(k2)
-
- -

In other words, if two keys are equal, their hashes should also be equal. -HashMap and HashSet both rely on this behavior.

- -

This trait can be used with #[derive].

-
-

Required Methods

-
-

fn hash<H>(&self, state: &mut H) where H: Hasher

Feeds this value into the state given, updating the hasher as necessary.

-
-

Provided Methods

-
-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

Feeds a slice of this type into the state provided.

-
-

Implementors

-
    -
  • impl<A> Hash for LinkedList<A> where A: Hash
    • -
  • impl<A> Hash for VecDeque<A> where A: Hash
    • -
  • impl Hash for CString
    • -
  • impl Hash for CStr
    • -
  • impl Hash for OsString
    • -
  • impl Hash for OsStr
    • -
  • impl Hash for FileType
    • -
  • impl Hash for IpAddr
    • -
  • impl Hash for Ipv6MulticastScope
    • -
  • impl Hash for Ipv4Addr
    • -
  • impl Hash for Ipv6Addr
    • -
  • impl Hash for SocketAddr
    • -
  • impl Hash for SocketAddrV4
    • -
  • impl Hash for SocketAddrV6
    • -
  • impl<'a> Hash for Prefix<'a>
    • -
  • impl<'a> Hash for PrefixComponent<'a>
    • -
  • impl<'a> Hash for Component<'a>
    • -
  • impl Hash for PathBuf
    • -
  • impl Hash for Path
    • -
  • impl Hash for Duration
    • -
  • impl<T> Hash for Vec<T> where T: Hash
    • -
  • impl Hash for Ordering
    • -
  • impl<T> Hash for Box<T> where T: Hash + ?Sized
    • -
  • impl Hash for TypeId
    • -
  • impl<T> Hash for PhantomData<T> where T: ?Sized
    • -
  • impl Hash for u8
    • -
  • impl Hash for u16
    • -
  • impl Hash for u32
    • -
  • impl Hash for u64
    • -
  • impl Hash for usize
    • -
  • impl Hash for i8
    • -
  • impl Hash for i16
    • -
  • impl Hash for i32
    • -
  • impl Hash for i64
    • -
  • impl Hash for isize
    • -
  • impl Hash for bool
    • -
  • impl Hash for char
    • -
  • impl Hash for str
    • -
  • impl Hash for ()
    • -
  • impl<A> Hash for (A,) where A: Hash
    • -
  • impl<A, B> Hash for (A, B) where A: Hash, B: Hash
    • -
  • impl<A, B, C> Hash for (A, B, C) where C: Hash, A: Hash, B: Hash
    • -
  • impl<A, B, C, D> Hash for (A, B, C, D) where A: Hash, D: Hash, B: Hash, C: Hash
    • -
  • impl<A, B, C, D, E> Hash for (A, B, C, D, E) where A: Hash, E: Hash, D: Hash, B: Hash, C: Hash
    • -
  • impl<A, B, C, D, E, F> Hash for (A, B, C, D, E, F) where A: Hash, C: Hash, F: Hash, B: Hash, D: Hash, E: Hash
    • -
  • impl<A, B, C, D, E, F, G> Hash for (A, B, C, D, E, F, G) where C: Hash, A: Hash, G: Hash, F: Hash, D: Hash, E: Hash, B: Hash
    • -
  • impl<A, B, C, D, E, F, G, H> Hash for (A, B, C, D, E, F, G, H) where A: Hash, F: Hash, E: Hash, C: Hash, D: Hash, B: Hash, G: Hash, H: Hash
    • -
  • impl<A, B, C, D, E, F, G, H, I> Hash for (A, B, C, D, E, F, G, H, I) where H: Hash, I: Hash, G: Hash, D: Hash, B: Hash, E: Hash, A: Hash, F: Hash, C: Hash
    • -
  • impl<A, B, C, D, E, F, G, H, I, J> Hash for (A, B, C, D, E, F, G, H, I, J) where A: Hash, E: Hash, C: Hash, B: Hash, I: Hash, J: Hash, G: Hash, F: Hash, H: Hash, D: Hash
    • -
  • impl<A, B, C, D, E, F, G, H, I, J, K> Hash for (A, B, C, D, E, F, G, H, I, J, K) where A: Hash, G: Hash, K: Hash, F: Hash, H: Hash, B: Hash, C: Hash, D: Hash, E: Hash, J: Hash, I: Hash
    • -
  • impl<A, B, C, D, E, F, G, H, I, J, K, L> Hash for (A, B, C, D, E, F, G, H, I, J, K, L) where J: Hash, I: Hash, K: Hash, L: Hash, F: Hash, D: Hash, E: Hash, H: Hash, A: Hash, C: Hash, G: Hash, B: Hash
    • -
  • impl<T> Hash for [T] where T: Hash
    • -
  • impl<'a, T> Hash for &'a T where T: Hash + ?Sized
    • -
  • impl<'a, T> Hash for &'a mut T where T: Hash + ?Sized
    • -
  • impl<T> Hash for *const T
    • -
  • impl<T> Hash for *mut T
    • -
  • impl<T> Hash for Rc<T> where T: Hash + ?Sized
    • -
  • impl Hash for String
    • -
  • impl<T, E> Hash for Result<T, E> where E: Hash, T: Hash
    • -
  • impl<Ret> Hash for fn() -> Ret
    • -
  • impl<Ret> Hash for extern fn() -> Ret
    • -
  • impl<Ret> Hash for unsafe fn() -> Ret
    • -
  • impl<Ret> Hash for unsafe extern fn() -> Ret
    • -
  • impl<Ret, A> Hash for fn(A) -> Ret
    • -
  • impl<Ret, A> Hash for extern fn(A) -> Ret
    • -
  • impl<Ret, A> Hash for unsafe fn(A) -> Ret
    • -
  • impl<Ret, A> Hash for unsafe extern fn(A) -> Ret
    • -
  • impl<Ret, A, B> Hash for fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Hash for extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Hash for unsafe fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Hash for unsafe extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B, C> Hash for fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Hash for extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Hash for unsafe fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Hash for unsafe extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C, D> Hash for fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Hash for extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Hash for unsafe fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Hash for unsafe extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Hash for fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Hash for extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Hash for unsafe fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Hash for unsafe extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Hash for fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Hash for extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Hash for unsafe fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Hash for unsafe extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Hash for fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Hash for extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Hash for unsafe fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Hash for unsafe extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Hash for fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Hash for extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Hash for unsafe fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Hash for unsafe extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Hash for fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Hash for extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Hash for unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Hash for unsafe extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Hash for fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Hash for extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Hash for unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Hash for unsafe extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Hash for fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Hash for extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Hash for unsafe fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Hash for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Hash for fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Hash for extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Hash for unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Hash for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<'a, B> Hash for Cow<'a, B> where B: Hash + ToOwned + ?Sized
    • -
  • impl<T> Hash for Option<T> where T: Hash
    • -
  • impl<T> Hash for Wrapping<T> where T: Hash
    • -
  • impl<T> Hash for NonZero<T> where T: Zeroable + Hash
    • -
  • impl<T> Hash for [T; 0] where T: Hash
    • -
  • impl<T> Hash for [T; 1] where T: Hash
    • -
  • impl<T> Hash for [T; 2] where T: Hash
    • -
  • impl<T> Hash for [T; 3] where T: Hash
    • -
  • impl<T> Hash for [T; 4] where T: Hash
    • -
  • impl<T> Hash for [T; 5] where T: Hash
    • -
  • impl<T> Hash for [T; 6] where T: Hash
    • -
  • impl<T> Hash for [T; 7] where T: Hash
    • -
  • impl<T> Hash for [T; 8] where T: Hash
    • -
  • impl<T> Hash for [T; 9] where T: Hash
    • -
  • impl<T> Hash for [T; 10] where T: Hash
    • -
  • impl<T> Hash for [T; 11] where T: Hash
    • -
  • impl<T> Hash for [T; 12] where T: Hash
    • -
  • impl<T> Hash for [T; 13] where T: Hash
    • -
  • impl<T> Hash for [T; 14] where T: Hash
    • -
  • impl<T> Hash for [T; 15] where T: Hash
    • -
  • impl<T> Hash for [T; 16] where T: Hash
    • -
  • impl<T> Hash for [T; 17] where T: Hash
    • -
  • impl<T> Hash for [T; 18] where T: Hash
    • -
  • impl<T> Hash for [T; 19] where T: Hash
    • -
  • impl<T> Hash for [T; 20] where T: Hash
    • -
  • impl<T> Hash for [T; 21] where T: Hash
    • -
  • impl<T> Hash for [T; 22] where T: Hash
    • -
  • impl<T> Hash for [T; 23] where T: Hash
    • -
  • impl<T> Hash for [T; 24] where T: Hash
    • -
  • impl<T> Hash for [T; 25] where T: Hash
    • -
  • impl<T> Hash for [T; 26] where T: Hash
    • -
  • impl<T> Hash for [T; 27] where T: Hash
    • -
  • impl<T> Hash for [T; 28] where T: Hash
    • -
  • impl<T> Hash for [T; 29] where T: Hash
    • -
  • impl<T> Hash for [T; 30] where T: Hash
    • -
  • impl<T> Hash for [T; 31] where T: Hash
    • -
  • impl<T> Hash for [T; 32] where T: Hash
    • -
  • impl Hash for Error
    • -
  • impl<K, V> Hash for BTreeMap<K, V> where K: Hash, V: Hash
    • -
  • impl<T> Hash for BTreeSet<T> where T: Hash
    • -
  • impl<E> Hash for EnumSet<E> where E: Hash
    • -
  • impl<T> Hash for Bound<T> where T: Hash
    • -
  • impl<T> Hash for Arc<T> where T: Hash + ?Sized
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/hash/trait.Hasher.html b/doc/bitflags/__core/hash/trait.Hasher.html deleted file mode 100644 index bb6c288d..00000000 --- a/doc/bitflags/__core/hash/trait.Hasher.html +++ /dev/null @@ -1,151 +0,0 @@ - - - - - - - - - - bitflags::__core::hash::Hasher - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::hash::Hasher - - [−] - - [src]

-
pub trait Hasher {
-    fn finish(&self) -> u64;
-    fn write(&mut self, bytes: &[u8]);
-
-    fn write_u8(&mut self, i: u8) { ... }
-    fn write_u16(&mut self, i: u16) { ... }
-    fn write_u32(&mut self, i: u32) { ... }
-    fn write_u64(&mut self, i: u64) { ... }
-    fn write_usize(&mut self, i: usize) { ... }
-    fn write_i8(&mut self, i: i8) { ... }
-    fn write_i16(&mut self, i: i16) { ... }
-    fn write_i32(&mut self, i: i32) { ... }
-    fn write_i64(&mut self, i: i64) { ... }
-    fn write_isize(&mut self, i: isize) { ... }
-}

A trait which represents the ability to hash an arbitrary stream of bytes.

-
-

Required Methods

-
-

fn finish(&self) -> u64

Completes a round of hashing, producing the output hash generated.

-

fn write(&mut self, bytes: &[u8])

Writes some data into this Hasher

-
-

Provided Methods

-
-

fn write_u8(&mut self, i: u8)1.3.0

Write a single u8 into this hasher

-

fn write_u16(&mut self, i: u16)1.3.0

Write a single u16 into this hasher.

-

fn write_u32(&mut self, i: u32)1.3.0

Write a single u32 into this hasher.

-

fn write_u64(&mut self, i: u64)1.3.0

Write a single u64 into this hasher.

-

fn write_usize(&mut self, i: usize)1.3.0

Write a single usize into this hasher.

-

fn write_i8(&mut self, i: i8)1.3.0

Write a single i8 into this hasher.

-

fn write_i16(&mut self, i: i16)1.3.0

Write a single i16 into this hasher.

-

fn write_i32(&mut self, i: i32)1.3.0

Write a single i32 into this hasher.

-

fn write_i64(&mut self, i: i64)1.3.0

Write a single i64 into this hasher.

-

fn write_isize(&mut self, i: isize)1.3.0

Write a single isize into this hasher.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/i16/constant.MAX.html b/doc/bitflags/__core/i16/constant.MAX.html deleted file mode 100644 index bd052f76..00000000 --- a/doc/bitflags/__core/i16/constant.MAX.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::i16::MAX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::i16::MAX - - [−] - - [src]

-
pub const MAX: i16 = !MIN
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/i16/constant.MIN.html b/doc/bitflags/__core/i16/constant.MIN.html deleted file mode 100644 index 064b838d..00000000 --- a/doc/bitflags/__core/i16/constant.MIN.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::i16::MIN - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::i16::MIN - - [−] - - [src]

-
pub const MIN: i16 = -1 as i16 << 16 - 1
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/i16/index.html b/doc/bitflags/__core/i16/index.html deleted file mode 100644 index d3a9c637..00000000 --- a/doc/bitflags/__core/i16/index.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::i16 - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::i16 - - [−] - - [src]

-

The 16-bit signed integer type.

- -

See also the i16 primitive type.

-

Constants

- - - - - - - - -
MAX - -
MIN - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/i16/sidebar-items.js b/doc/bitflags/__core/i16/sidebar-items.js deleted file mode 100644 index 147ce9bf..00000000 --- a/doc/bitflags/__core/i16/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["MAX",""],["MIN",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/i32/constant.MAX.html b/doc/bitflags/__core/i32/constant.MAX.html deleted file mode 100644 index 6199f70e..00000000 --- a/doc/bitflags/__core/i32/constant.MAX.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::i32::MAX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::i32::MAX - - [−] - - [src]

-
pub const MAX: i32 = !MIN
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/i32/constant.MIN.html b/doc/bitflags/__core/i32/constant.MIN.html deleted file mode 100644 index a96354f9..00000000 --- a/doc/bitflags/__core/i32/constant.MIN.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::i32::MIN - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::i32::MIN - - [−] - - [src]

-
pub const MIN: i32 = -1 as i32 << 32 - 1
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/i32/index.html b/doc/bitflags/__core/i32/index.html deleted file mode 100644 index a37b3763..00000000 --- a/doc/bitflags/__core/i32/index.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::i32 - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::i32 - - [−] - - [src]

-

The 32-bit signed integer type.

- -

See also the i32 primitive type.

-

Constants

- - - - - - - - -
MAX - -
MIN - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/i32/sidebar-items.js b/doc/bitflags/__core/i32/sidebar-items.js deleted file mode 100644 index 147ce9bf..00000000 --- a/doc/bitflags/__core/i32/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["MAX",""],["MIN",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/i64/constant.MAX.html b/doc/bitflags/__core/i64/constant.MAX.html deleted file mode 100644 index 86c6042f..00000000 --- a/doc/bitflags/__core/i64/constant.MAX.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::i64::MAX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::i64::MAX - - [−] - - [src]

-
pub const MAX: i64 = !MIN
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/i64/constant.MIN.html b/doc/bitflags/__core/i64/constant.MIN.html deleted file mode 100644 index 4c6caa93..00000000 --- a/doc/bitflags/__core/i64/constant.MIN.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::i64::MIN - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::i64::MIN - - [−] - - [src]

-
pub const MIN: i64 = -1 as i64 << 64 - 1
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/i64/index.html b/doc/bitflags/__core/i64/index.html deleted file mode 100644 index 8dbda564..00000000 --- a/doc/bitflags/__core/i64/index.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::i64 - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::i64 - - [−] - - [src]

-

The 64-bit signed integer type.

- -

See also the i64 primitive type.

-

Constants

- - - - - - - - -
MAX - -
MIN - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/i64/sidebar-items.js b/doc/bitflags/__core/i64/sidebar-items.js deleted file mode 100644 index 147ce9bf..00000000 --- a/doc/bitflags/__core/i64/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["MAX",""],["MIN",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/i8/constant.MAX.html b/doc/bitflags/__core/i8/constant.MAX.html deleted file mode 100644 index 29a4e51a..00000000 --- a/doc/bitflags/__core/i8/constant.MAX.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::i8::MAX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::i8::MAX - - [−] - - [src]

-
pub const MAX: i8 = !MIN
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/i8/constant.MIN.html b/doc/bitflags/__core/i8/constant.MIN.html deleted file mode 100644 index b9d57cde..00000000 --- a/doc/bitflags/__core/i8/constant.MIN.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::i8::MIN - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::i8::MIN - - [−] - - [src]

-
pub const MIN: i8 = -1 as i8 << 8 - 1
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/i8/index.html b/doc/bitflags/__core/i8/index.html deleted file mode 100644 index 5eb60e08..00000000 --- a/doc/bitflags/__core/i8/index.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::i8 - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::i8 - - [−] - - [src]

-

The 8-bit signed integer type.

- -

See also the i8 primitive type.

-

Constants

- - - - - - - - -
MAX - -
MIN - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/i8/sidebar-items.js b/doc/bitflags/__core/i8/sidebar-items.js deleted file mode 100644 index 147ce9bf..00000000 --- a/doc/bitflags/__core/i8/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["MAX",""],["MIN",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/index.html b/doc/bitflags/__core/index.html deleted file mode 100644 index 662e0016..00000000 --- a/doc/bitflags/__core/index.html +++ /dev/null @@ -1,493 +0,0 @@ - - - - - - - - - - bitflags::__core - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core - - [−] - - [src]

-

Modules

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
any -

This module implements the Any trait, which enables dynamic typing -of any 'static type through runtime reflection.

-
ascii -

Operations on ASCII strings and characters.

-
borrow -

A module for working with borrowed data.

-
boxed -

A pointer type for heap allocation.

-
cell -

Shareable mutable containers.

-
char -

A character type.

-
clone -

The Clone trait for types that cannot be 'implicitly copied'.

-
cmp -

Functionality for ordering and comparison.

-
collections -

Collection types.

-
convert -

Traits for conversions between types.

-
default -

The Default trait for types which may have meaningful default values.

-
env -

Inspection and manipulation of the process's environment.

-
error -

Traits for working with Errors.

-
f32 -

The 32-bit floating point type.

-
f64 -

The 64-bit floating point type.

-
ffi -

Utilities related to FFI bindings.

-
fmt -

Utilities for formatting and printing strings

-
fs -

Filesystem manipulation operations.

-
hash -

Generic hashing support.

-
i16 -

The 16-bit signed integer type.

-
i32 -

The 32-bit signed integer type.

-
i64 -

The 64-bit signed integer type.

-
i8 -

The 8-bit signed integer type.

-
io -

Traits, helpers, and type definitions for core I/O functionality.

-
isize -

The pointer-sized signed integer type.

-
iter -

Composable external iteration.

-
marker -

Primitive traits and marker types representing basic 'kinds' of types.

-
mem -

Basic functions for dealing with memory.

-
net -

Networking primitives for TCP/UDP communication.

-
num -

Additional functionality for numerics.

-
ops -

Overloadable operators.

-
option -

Optional values.

-
os -

OS-specific functionality.

-
panic -

Panic support in the standard library

-
path -

Cross-platform path manipulation.

-
prelude -

The Rust Prelude.

-
process -

Working with processes.

-
ptr -

Raw, unsafe pointers, *const T, and *mut T.

-
rc -

Thread-local reference-counted boxes (the Rc<T> type).

-
result -

Error handling with the Result type.

-
slice -

A dynamically-sized view into a contiguous sequence, [T].

-
str -

Unicode string slices.

-
string -

A UTF-8 encoded, growable string.

-
sync -

Useful synchronization primitives.

-
thread -

Native threads.

-
time -

Temporal quantification.

-
u16 -

The 16-bit unsigned integer type.

-
u32 -

The 32-bit unsigned integer type.

-
u64 -

The 64-bit unsigned integer type.

-
u8 -

The 8-bit unsigned integer type.

-
usize -

The pointer-sized unsigned integer type.

-
vec -

A contiguous growable array type with heap-allocated contents, written -Vec<T> but pronounced 'vector.'

-
intrinsics - [Unstable]

rustc compiler intrinsics.

-
raw - [Unstable]

Contains struct definitions for the layout of compiler built-in types.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.abort.html b/doc/bitflags/__core/intrinsics/fn.abort.html deleted file mode 100644 index 6f772ea5..00000000 --- a/doc/bitflags/__core/intrinsics/fn.abort.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::abort - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::abort - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn abort() -> !
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Aborts the execution of the process.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.add_with_overflow.html b/doc/bitflags/__core/intrinsics/fn.add_with_overflow.html deleted file mode 100644 index ea7c8443..00000000 --- a/doc/bitflags/__core/intrinsics/fn.add_with_overflow.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::add_with_overflow - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::add_with_overflow - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn add_with_overflow<T>(x: T, y: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Performs checked integer addition.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.arith_offset.html b/doc/bitflags/__core/intrinsics/fn.arith_offset.html deleted file mode 100644 index 2ef1786d..00000000 --- a/doc/bitflags/__core/intrinsics/fn.arith_offset.html +++ /dev/null @@ -1,123 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::arith_offset - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::arith_offset - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn arith_offset<T>(dst: *const T, offset: isize) -> *const T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Calculates the offset from a pointer, potentially wrapping.

- -

This is implemented as an intrinsic to avoid converting to and from an -integer, since the conversion inhibits certain optimizations.

- -

Safety

-

Unlike the offset intrinsic, this intrinsic does not restrict the -resulting pointer to point into or one byte past the end of an allocated -object, and it wraps with two's complement arithmetic. The resulting -value is not necessarily valid to be used to actually access memory.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.assume.html b/doc/bitflags/__core/intrinsics/fn.assume.html deleted file mode 100644 index 652f581e..00000000 --- a/doc/bitflags/__core/intrinsics/fn.assume.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::assume - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::assume - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn assume(b: bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Informs the optimizer that a condition is always true. -If the condition is false, the behavior is undefined.

- -

No code is generated for this intrinsic, but the optimizer will try -to preserve it (and its condition) between passes, which may interfere -with optimization of surrounding code and reduce performance. It should -not be used if the invariant can be discovered by the optimizer on its -own, or if it does not enable any significant optimizations.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_and.html b/doc/bitflags/__core/intrinsics/fn.atomic_and.html deleted file mode 100644 index f56c822d..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_and.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_and - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_and - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_and<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_and_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_and_acq.html deleted file mode 100644 index e0ace78f..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_and_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_and_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_and_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_and_acq<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_and_acqrel.html b/doc/bitflags/__core/intrinsics/fn.atomic_and_acqrel.html deleted file mode 100644 index 1ea937b6..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_and_acqrel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_and_acqrel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_and_acqrel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_and_acqrel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_and_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_and_rel.html deleted file mode 100644 index 448aa4f9..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_and_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_and_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_and_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_and_rel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_and_relaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_and_relaxed.html deleted file mode 100644 index 353c1f7e..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_and_relaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_and_relaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_and_relaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_and_relaxed<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchg.html deleted file mode 100644 index be876075..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchg - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchg - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchg<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acq.html deleted file mode 100644 index 14ae9d37..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchg_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchg_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchg_acq<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acq_failrelaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acq_failrelaxed.html deleted file mode 100644 index 0c888b62..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acq_failrelaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchg_acq_failrelaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchg_acq_failrelaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchg_acq_failrelaxed<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acqrel.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acqrel.html deleted file mode 100644 index 98cd59ed..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acqrel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchg_acqrel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchg_acqrel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchg_acqrel<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acqrel_failrelaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acqrel_failrelaxed.html deleted file mode 100644 index 09537732..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_acqrel_failrelaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchg_acqrel_failrelaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchg_acqrel_failrelaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchg_acqrel_failrelaxed<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_failacq.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_failacq.html deleted file mode 100644 index 25293171..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_failacq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchg_failacq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchg_failacq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchg_failacq<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_failrelaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_failrelaxed.html deleted file mode 100644 index c4d6dbe4..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_failrelaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchg_failrelaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchg_failrelaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchg_failrelaxed<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_rel.html deleted file mode 100644 index 6c0b8958..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchg_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchg_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchg_rel<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_relaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_relaxed.html deleted file mode 100644 index b871253e..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchg_relaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchg_relaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchg_relaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchg_relaxed<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak.html deleted file mode 100644 index b4c0944f..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchgweak - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchgweak - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchgweak<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acq.html deleted file mode 100644 index 5d53a426..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchgweak_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchgweak_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchgweak_acq<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acq_failrelaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acq_failrelaxed.html deleted file mode 100644 index 4bdf3abc..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acq_failrelaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchgweak_acq_failrelaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchgweak_acq_failrelaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchgweak_acq_failrelaxed<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acqrel.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acqrel.html deleted file mode 100644 index 23fb6a49..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acqrel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchgweak_acqrel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchgweak_acqrel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchgweak_acqrel<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acqrel_failrelaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acqrel_failrelaxed.html deleted file mode 100644 index f1d02695..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_acqrel_failrelaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchgweak_acqrel_failrelaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchgweak_acqrel_failrelaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchgweak_acqrel_failrelaxed<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_failacq.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_failacq.html deleted file mode 100644 index d848eb29..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_failacq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchgweak_failacq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchgweak_failacq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchgweak_failacq<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_failrelaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_failrelaxed.html deleted file mode 100644 index 0399b4e2..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_failrelaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchgweak_failrelaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchgweak_failrelaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchgweak_failrelaxed<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_rel.html deleted file mode 100644 index 4f62d895..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchgweak_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchgweak_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchgweak_rel<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_relaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_relaxed.html deleted file mode 100644 index 0d61b28e..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_cxchgweak_relaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_cxchgweak_relaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_cxchgweak_relaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_cxchgweak_relaxed<T>(dst: *mut T, old: T, src: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_fence.html b/doc/bitflags/__core/intrinsics/fn.atomic_fence.html deleted file mode 100644 index 3b918be0..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_fence.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_fence - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_fence - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_fence()
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_fence_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_fence_acq.html deleted file mode 100644 index 51c6f252..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_fence_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_fence_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_fence_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_fence_acq()
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_fence_acqrel.html b/doc/bitflags/__core/intrinsics/fn.atomic_fence_acqrel.html deleted file mode 100644 index 0286b191..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_fence_acqrel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_fence_acqrel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_fence_acqrel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_fence_acqrel()
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_fence_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_fence_rel.html deleted file mode 100644 index fe677e75..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_fence_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_fence_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_fence_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_fence_rel()
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_load.html b/doc/bitflags/__core/intrinsics/fn.atomic_load.html deleted file mode 100644 index 3e3d0d58..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_load.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_load - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_load - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_load<T>(src: *const T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_load_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_load_acq.html deleted file mode 100644 index 532a2c34..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_load_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_load_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_load_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_load_acq<T>(src: *const T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_load_relaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_load_relaxed.html deleted file mode 100644 index ba6fec25..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_load_relaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_load_relaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_load_relaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_load_relaxed<T>(src: *const T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_load_unordered.html b/doc/bitflags/__core/intrinsics/fn.atomic_load_unordered.html deleted file mode 100644 index e15aa2af..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_load_unordered.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_load_unordered - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_load_unordered - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_load_unordered<T>(src: *const T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_max.html b/doc/bitflags/__core/intrinsics/fn.atomic_max.html deleted file mode 100644 index 84b49504..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_max.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_max - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_max - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_max<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_max_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_max_acq.html deleted file mode 100644 index 75bd6b83..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_max_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_max_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_max_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_max_acq<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_max_acqrel.html b/doc/bitflags/__core/intrinsics/fn.atomic_max_acqrel.html deleted file mode 100644 index c1bba231..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_max_acqrel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_max_acqrel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_max_acqrel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_max_acqrel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_max_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_max_rel.html deleted file mode 100644 index 9e5834fb..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_max_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_max_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_max_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_max_rel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_max_relaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_max_relaxed.html deleted file mode 100644 index 75309f1f..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_max_relaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_max_relaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_max_relaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_max_relaxed<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_min.html b/doc/bitflags/__core/intrinsics/fn.atomic_min.html deleted file mode 100644 index 70b9df80..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_min.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_min - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_min - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_min<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_min_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_min_acq.html deleted file mode 100644 index 46d03f53..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_min_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_min_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_min_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_min_acq<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_min_acqrel.html b/doc/bitflags/__core/intrinsics/fn.atomic_min_acqrel.html deleted file mode 100644 index c976e548..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_min_acqrel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_min_acqrel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_min_acqrel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_min_acqrel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_min_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_min_rel.html deleted file mode 100644 index 57f82a60..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_min_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_min_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_min_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_min_rel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_min_relaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_min_relaxed.html deleted file mode 100644 index 7196d191..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_min_relaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_min_relaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_min_relaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_min_relaxed<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_nand.html b/doc/bitflags/__core/intrinsics/fn.atomic_nand.html deleted file mode 100644 index 3addb6f8..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_nand.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_nand - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_nand - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_nand<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_nand_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_nand_acq.html deleted file mode 100644 index eadc8e94..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_nand_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_nand_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_nand_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_nand_acq<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_nand_acqrel.html b/doc/bitflags/__core/intrinsics/fn.atomic_nand_acqrel.html deleted file mode 100644 index d64d1f5c..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_nand_acqrel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_nand_acqrel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_nand_acqrel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_nand_acqrel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_nand_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_nand_rel.html deleted file mode 100644 index 3a9ae584..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_nand_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_nand_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_nand_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_nand_rel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_nand_relaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_nand_relaxed.html deleted file mode 100644 index e56d72ab..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_nand_relaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_nand_relaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_nand_relaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_nand_relaxed<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_or.html b/doc/bitflags/__core/intrinsics/fn.atomic_or.html deleted file mode 100644 index 5c76dc3c..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_or.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_or - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_or - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_or<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_or_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_or_acq.html deleted file mode 100644 index d97c2451..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_or_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_or_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_or_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_or_acq<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_or_acqrel.html b/doc/bitflags/__core/intrinsics/fn.atomic_or_acqrel.html deleted file mode 100644 index 724cba6c..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_or_acqrel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_or_acqrel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_or_acqrel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_or_acqrel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_or_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_or_rel.html deleted file mode 100644 index 681904e9..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_or_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_or_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_or_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_or_rel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_or_relaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_or_relaxed.html deleted file mode 100644 index 4bc74718..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_or_relaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_or_relaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_or_relaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_or_relaxed<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence.html b/doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence.html deleted file mode 100644 index 60a13aef..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_singlethreadfence - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_singlethreadfence - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_singlethreadfence()
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

A compiler-only memory barrier.

- -

Memory accesses will never be reordered across this barrier by the -compiler, but no instructions will be emitted for it. This is -appropriate for operations on the same thread that may be preempted, -such as when interacting with signal handlers.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence_acq.html deleted file mode 100644 index 35a986bb..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_singlethreadfence_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_singlethreadfence_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_singlethreadfence_acq()
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence_acqrel.html b/doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence_acqrel.html deleted file mode 100644 index d8856949..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence_acqrel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_singlethreadfence_acqrel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_singlethreadfence_acqrel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_singlethreadfence_acqrel()
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence_rel.html deleted file mode 100644 index 0e478cca..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_singlethreadfence_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_singlethreadfence_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_singlethreadfence_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_singlethreadfence_rel()
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_store.html b/doc/bitflags/__core/intrinsics/fn.atomic_store.html deleted file mode 100644 index 3ce10647..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_store.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_store - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_store - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_store<T>(dst: *mut T, val: T)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_store_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_store_rel.html deleted file mode 100644 index 167f5497..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_store_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_store_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_store_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_store_rel<T>(dst: *mut T, val: T)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_store_relaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_store_relaxed.html deleted file mode 100644 index 19de093d..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_store_relaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_store_relaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_store_relaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_store_relaxed<T>(dst: *mut T, val: T)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_store_unordered.html b/doc/bitflags/__core/intrinsics/fn.atomic_store_unordered.html deleted file mode 100644 index 5e1d9c11..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_store_unordered.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_store_unordered - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_store_unordered - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_store_unordered<T>(dst: *mut T, val: T)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_umax.html b/doc/bitflags/__core/intrinsics/fn.atomic_umax.html deleted file mode 100644 index bc1270fe..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_umax.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_umax - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_umax - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_umax<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_umax_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_umax_acq.html deleted file mode 100644 index 9136d5fd..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_umax_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_umax_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_umax_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_umax_acq<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_umax_acqrel.html b/doc/bitflags/__core/intrinsics/fn.atomic_umax_acqrel.html deleted file mode 100644 index 286bc920..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_umax_acqrel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_umax_acqrel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_umax_acqrel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_umax_acqrel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_umax_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_umax_rel.html deleted file mode 100644 index fb1441d7..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_umax_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_umax_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_umax_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_umax_rel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_umax_relaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_umax_relaxed.html deleted file mode 100644 index b337954f..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_umax_relaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_umax_relaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_umax_relaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_umax_relaxed<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_umin.html b/doc/bitflags/__core/intrinsics/fn.atomic_umin.html deleted file mode 100644 index 011e13c9..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_umin.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_umin - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_umin - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_umin<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_umin_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_umin_acq.html deleted file mode 100644 index d0c1d4c9..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_umin_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_umin_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_umin_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_umin_acq<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_umin_acqrel.html b/doc/bitflags/__core/intrinsics/fn.atomic_umin_acqrel.html deleted file mode 100644 index 60694428..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_umin_acqrel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_umin_acqrel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_umin_acqrel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_umin_acqrel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_umin_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_umin_rel.html deleted file mode 100644 index 37260a70..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_umin_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_umin_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_umin_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_umin_rel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_umin_relaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_umin_relaxed.html deleted file mode 100644 index 5991405e..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_umin_relaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_umin_relaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_umin_relaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_umin_relaxed<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xadd.html b/doc/bitflags/__core/intrinsics/fn.atomic_xadd.html deleted file mode 100644 index 614d30af..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xadd.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xadd - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xadd - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xadd<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xadd_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_xadd_acq.html deleted file mode 100644 index 16ab006f..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xadd_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xadd_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xadd_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xadd_acq<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xadd_acqrel.html b/doc/bitflags/__core/intrinsics/fn.atomic_xadd_acqrel.html deleted file mode 100644 index ca931de5..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xadd_acqrel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xadd_acqrel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xadd_acqrel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xadd_acqrel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xadd_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_xadd_rel.html deleted file mode 100644 index 72055a1b..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xadd_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xadd_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xadd_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xadd_rel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xadd_relaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_xadd_relaxed.html deleted file mode 100644 index 542f04a8..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xadd_relaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xadd_relaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xadd_relaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xadd_relaxed<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xchg.html b/doc/bitflags/__core/intrinsics/fn.atomic_xchg.html deleted file mode 100644 index 83eec300..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xchg.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xchg - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xchg - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xchg<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xchg_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_xchg_acq.html deleted file mode 100644 index 6f07e66f..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xchg_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xchg_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xchg_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xchg_acq<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xchg_acqrel.html b/doc/bitflags/__core/intrinsics/fn.atomic_xchg_acqrel.html deleted file mode 100644 index 6589713f..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xchg_acqrel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xchg_acqrel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xchg_acqrel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xchg_acqrel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xchg_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_xchg_rel.html deleted file mode 100644 index 0a4592e5..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xchg_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xchg_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xchg_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xchg_rel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xchg_relaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_xchg_relaxed.html deleted file mode 100644 index b69f9c29..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xchg_relaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xchg_relaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xchg_relaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xchg_relaxed<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xor.html b/doc/bitflags/__core/intrinsics/fn.atomic_xor.html deleted file mode 100644 index 5e64713a..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xor.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xor - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xor - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xor<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xor_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_xor_acq.html deleted file mode 100644 index 1b7cccf9..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xor_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xor_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xor_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xor_acq<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xor_acqrel.html b/doc/bitflags/__core/intrinsics/fn.atomic_xor_acqrel.html deleted file mode 100644 index c52b2e16..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xor_acqrel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xor_acqrel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xor_acqrel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xor_acqrel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xor_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_xor_rel.html deleted file mode 100644 index b4b6c2bc..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xor_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xor_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xor_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xor_rel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xor_relaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_xor_relaxed.html deleted file mode 100644 index ac2d7605..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xor_relaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xor_relaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xor_relaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xor_relaxed<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xsub.html b/doc/bitflags/__core/intrinsics/fn.atomic_xsub.html deleted file mode 100644 index ee05f561..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xsub.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xsub - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xsub - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xsub<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xsub_acq.html b/doc/bitflags/__core/intrinsics/fn.atomic_xsub_acq.html deleted file mode 100644 index d6358604..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xsub_acq.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xsub_acq - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xsub_acq - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xsub_acq<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xsub_acqrel.html b/doc/bitflags/__core/intrinsics/fn.atomic_xsub_acqrel.html deleted file mode 100644 index 7a07e304..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xsub_acqrel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xsub_acqrel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xsub_acqrel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xsub_acqrel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xsub_rel.html b/doc/bitflags/__core/intrinsics/fn.atomic_xsub_rel.html deleted file mode 100644 index 35189b5d..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xsub_rel.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xsub_rel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xsub_rel - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xsub_rel<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.atomic_xsub_relaxed.html b/doc/bitflags/__core/intrinsics/fn.atomic_xsub_relaxed.html deleted file mode 100644 index d1ee3afb..00000000 --- a/doc/bitflags/__core/intrinsics/fn.atomic_xsub_relaxed.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::atomic_xsub_relaxed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::atomic_xsub_relaxed - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn atomic_xsub_relaxed<T>(dst: *mut T, src: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.breakpoint.html b/doc/bitflags/__core/intrinsics/fn.breakpoint.html deleted file mode 100644 index 16509818..00000000 --- a/doc/bitflags/__core/intrinsics/fn.breakpoint.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::breakpoint - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::breakpoint - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn breakpoint()
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Executes a breakpoint trap, for inspection by a debugger.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.bswap.html b/doc/bitflags/__core/intrinsics/fn.bswap.html deleted file mode 100644 index 64cc4206..00000000 --- a/doc/bitflags/__core/intrinsics/fn.bswap.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::bswap - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::bswap - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn bswap<T>(x: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Reverses the bytes in an integer type T.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.ceilf32.html b/doc/bitflags/__core/intrinsics/fn.ceilf32.html deleted file mode 100644 index b9b46487..00000000 --- a/doc/bitflags/__core/intrinsics/fn.ceilf32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::ceilf32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::ceilf32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn ceilf32(x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the smallest integer greater than or equal to an f32.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.ceilf64.html b/doc/bitflags/__core/intrinsics/fn.ceilf64.html deleted file mode 100644 index d1a8729a..00000000 --- a/doc/bitflags/__core/intrinsics/fn.ceilf64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::ceilf64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::ceilf64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn ceilf64(x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the smallest integer greater than or equal to an f64.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.copy.html b/doc/bitflags/__core/intrinsics/fn.copy.html deleted file mode 100644 index e28fbdd8..00000000 --- a/doc/bitflags/__core/intrinsics/fn.copy.html +++ /dev/null @@ -1,135 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::copy - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::copy - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn copy<T>(src: *const T, dst: *mut T, count: usize)
1.0.0

Copies count * size_of<T> bytes from src to dst. The source -and destination may overlap.

- -

copy is semantically equivalent to C's memmove.

- -

Safety

-

Care must be taken with the ownership of src and dst. -This method semantically moves the values of src into dst. -However it does not drop the contents of dst, or prevent the contents of src -from being dropped or used.

- -

Examples

-

Efficiently create a Rust vector from an unsafe buffer:

- -
-use std::ptr;
-
-unsafe fn from_buf_raw<T>(ptr: *const T, elts: usize) -> Vec<T> {
-    let mut dst = Vec::with_capacity(elts);
-    dst.set_len(elts);
-    ptr::copy(ptr, dst.as_mut_ptr(), elts);
-    dst
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.copy_nonoverlapping.html b/doc/bitflags/__core/intrinsics/fn.copy_nonoverlapping.html deleted file mode 100644 index 70875456..00000000 --- a/doc/bitflags/__core/intrinsics/fn.copy_nonoverlapping.html +++ /dev/null @@ -1,147 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::copy_nonoverlapping - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::copy_nonoverlapping - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn copy_nonoverlapping<T>(src: *const T, dst: *mut T, count: usize)
1.0.0

Copies count * size_of<T> bytes from src to dst. The source -and destination may not overlap.

- -

copy_nonoverlapping is semantically equivalent to C's memcpy.

- -

Safety

-

Beyond requiring that the program must be allowed to access both regions -of memory, it is Undefined Behavior for source and destination to -overlap. Care must also be taken with the ownership of src and -dst. This method semantically moves the values of src into dst. -However it does not drop the contents of dst, or prevent the contents -of src from being dropped or used.

- -

Examples

-

A safe swap function:

- -
-use std::mem;
-use std::ptr;
-
-fn swap<T>(x: &mut T, y: &mut T) {
-    unsafe {
-        // Give ourselves some scratch space to work with
-        let mut t: T = mem::uninitialized();
-
-        // Perform the swap, `&mut` pointers never alias
-        ptr::copy_nonoverlapping(x, &mut t, 1);
-        ptr::copy_nonoverlapping(y, x, 1);
-        ptr::copy_nonoverlapping(&t, y, 1);
-
-        // y and t now point to the same thing, but we need to completely forget `tmp`
-        // because it's no longer relevant.
-        mem::forget(t);
-    }
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.copysignf32.html b/doc/bitflags/__core/intrinsics/fn.copysignf32.html deleted file mode 100644 index 47b52111..00000000 --- a/doc/bitflags/__core/intrinsics/fn.copysignf32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::copysignf32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::copysignf32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn copysignf32(x: f32, y: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Copies the sign from y to x for f32 values.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.copysignf64.html b/doc/bitflags/__core/intrinsics/fn.copysignf64.html deleted file mode 100644 index 5497d3f2..00000000 --- a/doc/bitflags/__core/intrinsics/fn.copysignf64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::copysignf64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::copysignf64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn copysignf64(x: f64, y: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Copies the sign from y to x for f64 values.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.cosf32.html b/doc/bitflags/__core/intrinsics/fn.cosf32.html deleted file mode 100644 index 8e6d6c23..00000000 --- a/doc/bitflags/__core/intrinsics/fn.cosf32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::cosf32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::cosf32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn cosf32(x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the cosine of an f32.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.cosf64.html b/doc/bitflags/__core/intrinsics/fn.cosf64.html deleted file mode 100644 index 72109ae7..00000000 --- a/doc/bitflags/__core/intrinsics/fn.cosf64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::cosf64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::cosf64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn cosf64(x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the cosine of an f64.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.ctlz.html b/doc/bitflags/__core/intrinsics/fn.ctlz.html deleted file mode 100644 index 7bdb34a9..00000000 --- a/doc/bitflags/__core/intrinsics/fn.ctlz.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::ctlz - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::ctlz - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn ctlz<T>(x: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the number of leading bits unset in an integer type T

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.ctpop.html b/doc/bitflags/__core/intrinsics/fn.ctpop.html deleted file mode 100644 index 39f0d113..00000000 --- a/doc/bitflags/__core/intrinsics/fn.ctpop.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::ctpop - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::ctpop - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn ctpop<T>(x: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the number of bits set in an integer type T

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.cttz.html b/doc/bitflags/__core/intrinsics/fn.cttz.html deleted file mode 100644 index fbe85aac..00000000 --- a/doc/bitflags/__core/intrinsics/fn.cttz.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::cttz - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::cttz - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn cttz<T>(x: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the number of trailing bits unset in an integer type T

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.discriminant_value.html b/doc/bitflags/__core/intrinsics/fn.discriminant_value.html deleted file mode 100644 index 7bd45fac..00000000 --- a/doc/bitflags/__core/intrinsics/fn.discriminant_value.html +++ /dev/null @@ -1,115 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::discriminant_value - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::discriminant_value - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn discriminant_value<T>(v: &T) -> u64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the value of the discriminant for the variant in 'v', -cast to a u64; if T has no discriminant, returns 0.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.drop_in_place.html b/doc/bitflags/__core/intrinsics/fn.drop_in_place.html deleted file mode 100644 index 9d7553ec..00000000 --- a/doc/bitflags/__core/intrinsics/fn.drop_in_place.html +++ /dev/null @@ -1,129 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::drop_in_place - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::drop_in_place - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn drop_in_place<T>(to_drop: *mut T) where T: ?Sized
1.8.0

Executes the destructor (if any) of the pointed-to value.

- -

This has two use cases:

- -
    -

  • It is required to use drop_in_place to drop unsized types like -trait objects, because they can't be read out onto the stack and -dropped normally.

    • -

  • It is friendlier to the optimizer to do this over ptr::read when -dropping manually allocated memory (e.g. when writing Box/Rc/Vec), -as the compiler doesn't need to prove that it's sound to elide the -copy.

    • -
- -

Undefined Behavior

-

This has all the same safety problems as ptr::read with respect to -invalid pointers, types, and double drops.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.exp2f32.html b/doc/bitflags/__core/intrinsics/fn.exp2f32.html deleted file mode 100644 index 36cec38f..00000000 --- a/doc/bitflags/__core/intrinsics/fn.exp2f32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::exp2f32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::exp2f32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn exp2f32(x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns 2 raised to the power of an f32.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.exp2f64.html b/doc/bitflags/__core/intrinsics/fn.exp2f64.html deleted file mode 100644 index ee6e74ff..00000000 --- a/doc/bitflags/__core/intrinsics/fn.exp2f64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::exp2f64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::exp2f64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn exp2f64(x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns 2 raised to the power of an f64.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.expf32.html b/doc/bitflags/__core/intrinsics/fn.expf32.html deleted file mode 100644 index 8eb2c1b5..00000000 --- a/doc/bitflags/__core/intrinsics/fn.expf32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::expf32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::expf32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn expf32(x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the exponential of an f32.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.expf64.html b/doc/bitflags/__core/intrinsics/fn.expf64.html deleted file mode 100644 index 822f4f83..00000000 --- a/doc/bitflags/__core/intrinsics/fn.expf64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::expf64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::expf64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn expf64(x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the exponential of an f64.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.fabsf32.html b/doc/bitflags/__core/intrinsics/fn.fabsf32.html deleted file mode 100644 index 5bbef34e..00000000 --- a/doc/bitflags/__core/intrinsics/fn.fabsf32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::fabsf32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::fabsf32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn fabsf32(x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the absolute value of an f32.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.fabsf64.html b/doc/bitflags/__core/intrinsics/fn.fabsf64.html deleted file mode 100644 index 09f5ceea..00000000 --- a/doc/bitflags/__core/intrinsics/fn.fabsf64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::fabsf64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::fabsf64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn fabsf64(x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the absolute value of an f64.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.fadd_fast.html b/doc/bitflags/__core/intrinsics/fn.fadd_fast.html deleted file mode 100644 index c0c6cc4a..00000000 --- a/doc/bitflags/__core/intrinsics/fn.fadd_fast.html +++ /dev/null @@ -1,115 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::fadd_fast - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::fadd_fast - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn fadd_fast<T>(a: T, b: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Float addition that allows optimizations based on algebraic rules. -May assume inputs are finite.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.fdiv_fast.html b/doc/bitflags/__core/intrinsics/fn.fdiv_fast.html deleted file mode 100644 index 6fdd2d3b..00000000 --- a/doc/bitflags/__core/intrinsics/fn.fdiv_fast.html +++ /dev/null @@ -1,115 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::fdiv_fast - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::fdiv_fast - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn fdiv_fast<T>(a: T, b: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Float division that allows optimizations based on algebraic rules. -May assume inputs are finite.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.floorf32.html b/doc/bitflags/__core/intrinsics/fn.floorf32.html deleted file mode 100644 index 043b5448..00000000 --- a/doc/bitflags/__core/intrinsics/fn.floorf32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::floorf32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::floorf32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn floorf32(x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the largest integer less than or equal to an f32.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.floorf64.html b/doc/bitflags/__core/intrinsics/fn.floorf64.html deleted file mode 100644 index fb8b1891..00000000 --- a/doc/bitflags/__core/intrinsics/fn.floorf64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::floorf64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::floorf64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn floorf64(x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the largest integer less than or equal to an f64.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.fmaf32.html b/doc/bitflags/__core/intrinsics/fn.fmaf32.html deleted file mode 100644 index 94d2e9ac..00000000 --- a/doc/bitflags/__core/intrinsics/fn.fmaf32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::fmaf32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::fmaf32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn fmaf32(a: f32, b: f32, c: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns a * b + c for f32 values.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.fmaf64.html b/doc/bitflags/__core/intrinsics/fn.fmaf64.html deleted file mode 100644 index 018f0390..00000000 --- a/doc/bitflags/__core/intrinsics/fn.fmaf64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::fmaf64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::fmaf64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn fmaf64(a: f64, b: f64, c: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns a * b + c for f64 values.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.fmul_fast.html b/doc/bitflags/__core/intrinsics/fn.fmul_fast.html deleted file mode 100644 index 563cd52e..00000000 --- a/doc/bitflags/__core/intrinsics/fn.fmul_fast.html +++ /dev/null @@ -1,115 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::fmul_fast - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::fmul_fast - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn fmul_fast<T>(a: T, b: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Float multiplication that allows optimizations based on algebraic rules. -May assume inputs are finite.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.forget.html b/doc/bitflags/__core/intrinsics/fn.forget.html deleted file mode 100644 index 0fc3107f..00000000 --- a/doc/bitflags/__core/intrinsics/fn.forget.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::forget - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::forget - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn forget<T>(T)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Moves a value out of scope without running drop glue.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.frem_fast.html b/doc/bitflags/__core/intrinsics/fn.frem_fast.html deleted file mode 100644 index 491bc20c..00000000 --- a/doc/bitflags/__core/intrinsics/fn.frem_fast.html +++ /dev/null @@ -1,115 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::frem_fast - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::frem_fast - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn frem_fast<T>(a: T, b: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Float remainder that allows optimizations based on algebraic rules. -May assume inputs are finite.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.fsub_fast.html b/doc/bitflags/__core/intrinsics/fn.fsub_fast.html deleted file mode 100644 index c9e83967..00000000 --- a/doc/bitflags/__core/intrinsics/fn.fsub_fast.html +++ /dev/null @@ -1,115 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::fsub_fast - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::fsub_fast - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn fsub_fast<T>(a: T, b: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Float subtraction that allows optimizations based on algebraic rules. -May assume inputs are finite.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.init.html b/doc/bitflags/__core/intrinsics/fn.init.html deleted file mode 100644 index 90b81465..00000000 --- a/doc/bitflags/__core/intrinsics/fn.init.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::init - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::init - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn init<T>() -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Creates a value initialized to zero.

- -

init is unsafe because it returns a zeroed-out datum, -which is unsafe unless T is Copy. Also, even if T is -Copy, an all-zero value may not correspond to any legitimate -state for the type in question.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.init_dropped.html b/doc/bitflags/__core/intrinsics/fn.init_dropped.html deleted file mode 100644 index 491d0a7a..00000000 --- a/doc/bitflags/__core/intrinsics/fn.init_dropped.html +++ /dev/null @@ -1,124 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::init_dropped - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::init_dropped - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn init_dropped<T>() -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Creates a value initialized to so that its drop flag, -if any, says that it has been dropped.

- -

init_dropped is unsafe because it returns a datum with all -of its bytes set to the drop flag, which generally does not -correspond to a valid value.

- -

This intrinsic is likely to be deprecated in the future when -Rust moves to non-zeroing dynamic drop (and thus removes the -embedded drop flags that are being established by this -intrinsic).

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.log10f32.html b/doc/bitflags/__core/intrinsics/fn.log10f32.html deleted file mode 100644 index 3cce9ff1..00000000 --- a/doc/bitflags/__core/intrinsics/fn.log10f32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::log10f32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::log10f32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn log10f32(x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the base 10 logarithm of an f32.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.log10f64.html b/doc/bitflags/__core/intrinsics/fn.log10f64.html deleted file mode 100644 index 7764c3bf..00000000 --- a/doc/bitflags/__core/intrinsics/fn.log10f64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::log10f64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::log10f64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn log10f64(x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the base 10 logarithm of an f64.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.log2f32.html b/doc/bitflags/__core/intrinsics/fn.log2f32.html deleted file mode 100644 index 62fae63b..00000000 --- a/doc/bitflags/__core/intrinsics/fn.log2f32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::log2f32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::log2f32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn log2f32(x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the base 2 logarithm of an f32.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.log2f64.html b/doc/bitflags/__core/intrinsics/fn.log2f64.html deleted file mode 100644 index dd35aa48..00000000 --- a/doc/bitflags/__core/intrinsics/fn.log2f64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::log2f64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::log2f64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn log2f64(x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the base 2 logarithm of an f64.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.logf32.html b/doc/bitflags/__core/intrinsics/fn.logf32.html deleted file mode 100644 index c2d3737d..00000000 --- a/doc/bitflags/__core/intrinsics/fn.logf32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::logf32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::logf32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn logf32(x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the natural logarithm of an f32.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.logf64.html b/doc/bitflags/__core/intrinsics/fn.logf64.html deleted file mode 100644 index acd50f2c..00000000 --- a/doc/bitflags/__core/intrinsics/fn.logf64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::logf64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::logf64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn logf64(x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the natural logarithm of an f64.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.min_align_of.html b/doc/bitflags/__core/intrinsics/fn.min_align_of.html deleted file mode 100644 index bb86cafe..00000000 --- a/doc/bitflags/__core/intrinsics/fn.min_align_of.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::min_align_of - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::min_align_of - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn min_align_of<T>() -> usize
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.min_align_of_val.html b/doc/bitflags/__core/intrinsics/fn.min_align_of_val.html deleted file mode 100644 index a2242ab3..00000000 --- a/doc/bitflags/__core/intrinsics/fn.min_align_of_val.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::min_align_of_val - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::min_align_of_val - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn min_align_of_val<T>(&T) -> usize where T: ?Sized
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.move_val_init.html b/doc/bitflags/__core/intrinsics/fn.move_val_init.html deleted file mode 100644 index 5c41754a..00000000 --- a/doc/bitflags/__core/intrinsics/fn.move_val_init.html +++ /dev/null @@ -1,116 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::move_val_init - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::move_val_init - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn move_val_init<T>(dst: *mut T, src: T)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Moves a value to an uninitialized memory location.

- -

Drop glue is not run on the destination.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.mul_with_overflow.html b/doc/bitflags/__core/intrinsics/fn.mul_with_overflow.html deleted file mode 100644 index 81887b1a..00000000 --- a/doc/bitflags/__core/intrinsics/fn.mul_with_overflow.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::mul_with_overflow - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::mul_with_overflow - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn mul_with_overflow<T>(x: T, y: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Performs checked integer multiplication

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.nearbyintf32.html b/doc/bitflags/__core/intrinsics/fn.nearbyintf32.html deleted file mode 100644 index 46e3c6a8..00000000 --- a/doc/bitflags/__core/intrinsics/fn.nearbyintf32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::nearbyintf32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::nearbyintf32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn nearbyintf32(x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the nearest integer to an f32.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.nearbyintf64.html b/doc/bitflags/__core/intrinsics/fn.nearbyintf64.html deleted file mode 100644 index 15c30561..00000000 --- a/doc/bitflags/__core/intrinsics/fn.nearbyintf64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::nearbyintf64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::nearbyintf64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn nearbyintf64(x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the nearest integer to an f64.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.needs_drop.html b/doc/bitflags/__core/intrinsics/fn.needs_drop.html deleted file mode 100644 index ec087ec2..00000000 --- a/doc/bitflags/__core/intrinsics/fn.needs_drop.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::needs_drop - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::needs_drop - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn needs_drop<T>() -> bool
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns true if the actual type given as T requires drop -glue; returns false if the actual type provided for T -implements Copy.

- -

If the actual type neither requires drop glue nor implements -Copy, then may return true or false.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.offset.html b/doc/bitflags/__core/intrinsics/fn.offset.html deleted file mode 100644 index 7321ff55..00000000 --- a/doc/bitflags/__core/intrinsics/fn.offset.html +++ /dev/null @@ -1,123 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::offset - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::offset - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn offset<T>(dst: *const T, offset: isize) -> *const T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Calculates the offset from a pointer.

- -

This is implemented as an intrinsic to avoid converting to and from an -integer, since the conversion would throw away aliasing information.

- -

Safety

-

Both the starting and resulting pointer must be either in bounds or one -byte past the end of an allocated object. If either pointer is out of -bounds or arithmetic overflow occurs then any further use of the -returned value will result in undefined behavior.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.overflowing_add.html b/doc/bitflags/__core/intrinsics/fn.overflowing_add.html deleted file mode 100644 index 21b52bfd..00000000 --- a/doc/bitflags/__core/intrinsics/fn.overflowing_add.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::overflowing_add - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::overflowing_add - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn overflowing_add<T>(a: T, b: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns (a + b) mod 2N, where N is the width of T in bits.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.overflowing_mul.html b/doc/bitflags/__core/intrinsics/fn.overflowing_mul.html deleted file mode 100644 index 261b2588..00000000 --- a/doc/bitflags/__core/intrinsics/fn.overflowing_mul.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::overflowing_mul - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::overflowing_mul - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn overflowing_mul<T>(a: T, b: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns (a * b) mod 2N, where N is the width of T in bits.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.overflowing_sub.html b/doc/bitflags/__core/intrinsics/fn.overflowing_sub.html deleted file mode 100644 index 2e54f487..00000000 --- a/doc/bitflags/__core/intrinsics/fn.overflowing_sub.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::overflowing_sub - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::overflowing_sub - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn overflowing_sub<T>(a: T, b: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns (a - b) mod 2N, where N is the width of T in bits.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.powf32.html b/doc/bitflags/__core/intrinsics/fn.powf32.html deleted file mode 100644 index 039d2b0a..00000000 --- a/doc/bitflags/__core/intrinsics/fn.powf32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::powf32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::powf32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn powf32(a: f32, x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Raises an f32 to an f32 power.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.powf64.html b/doc/bitflags/__core/intrinsics/fn.powf64.html deleted file mode 100644 index 9f37843a..00000000 --- a/doc/bitflags/__core/intrinsics/fn.powf64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::powf64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::powf64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn powf64(a: f64, x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Raises an f64 to an f64 power.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.powif32.html b/doc/bitflags/__core/intrinsics/fn.powif32.html deleted file mode 100644 index c0802edf..00000000 --- a/doc/bitflags/__core/intrinsics/fn.powif32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::powif32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::powif32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn powif32(a: f32, x: i32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Raises an f32 to an integer power.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.powif64.html b/doc/bitflags/__core/intrinsics/fn.powif64.html deleted file mode 100644 index 5001d935..00000000 --- a/doc/bitflags/__core/intrinsics/fn.powif64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::powif64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::powif64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn powif64(a: f64, x: i32) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Raises an f64 to an integer power.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.pref_align_of.html b/doc/bitflags/__core/intrinsics/fn.pref_align_of.html deleted file mode 100644 index ca855124..00000000 --- a/doc/bitflags/__core/intrinsics/fn.pref_align_of.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::pref_align_of - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::pref_align_of - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn pref_align_of<T>() -> usize
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.return_address.html b/doc/bitflags/__core/intrinsics/fn.return_address.html deleted file mode 100644 index e3e3c3d4..00000000 --- a/doc/bitflags/__core/intrinsics/fn.return_address.html +++ /dev/null @@ -1,117 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::return_address - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::return_address - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn return_address() -> *const u8
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Gives the address for the return value of the enclosing function.

- -

Using this intrinsic in a function that does not use an out pointer -will trigger a compiler error.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.rintf32.html b/doc/bitflags/__core/intrinsics/fn.rintf32.html deleted file mode 100644 index b4757a72..00000000 --- a/doc/bitflags/__core/intrinsics/fn.rintf32.html +++ /dev/null @@ -1,115 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::rintf32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::rintf32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn rintf32(x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the nearest integer to an f32. May raise an inexact floating-point exception -if the argument is not an integer.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.rintf64.html b/doc/bitflags/__core/intrinsics/fn.rintf64.html deleted file mode 100644 index e585477a..00000000 --- a/doc/bitflags/__core/intrinsics/fn.rintf64.html +++ /dev/null @@ -1,115 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::rintf64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::rintf64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn rintf64(x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the nearest integer to an f64. May raise an inexact floating-point exception -if the argument is not an integer.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.roundf32.html b/doc/bitflags/__core/intrinsics/fn.roundf32.html deleted file mode 100644 index e6ffdca6..00000000 --- a/doc/bitflags/__core/intrinsics/fn.roundf32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::roundf32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::roundf32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn roundf32(x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the nearest integer to an f32. Rounds half-way cases away from zero.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.roundf64.html b/doc/bitflags/__core/intrinsics/fn.roundf64.html deleted file mode 100644 index 775d2481..00000000 --- a/doc/bitflags/__core/intrinsics/fn.roundf64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::roundf64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::roundf64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn roundf64(x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the nearest integer to an f64. Rounds half-way cases away from zero.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.sinf32.html b/doc/bitflags/__core/intrinsics/fn.sinf32.html deleted file mode 100644 index 0d80d391..00000000 --- a/doc/bitflags/__core/intrinsics/fn.sinf32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::sinf32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::sinf32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn sinf32(x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the sine of an f32.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.sinf64.html b/doc/bitflags/__core/intrinsics/fn.sinf64.html deleted file mode 100644 index 2487f8c7..00000000 --- a/doc/bitflags/__core/intrinsics/fn.sinf64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::sinf64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::sinf64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn sinf64(x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the sine of an f64.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.size_of.html b/doc/bitflags/__core/intrinsics/fn.size_of.html deleted file mode 100644 index 5f73e461..00000000 --- a/doc/bitflags/__core/intrinsics/fn.size_of.html +++ /dev/null @@ -1,120 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::size_of - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::size_of - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn size_of<T>() -> usize
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

The size of a type in bytes.

- -

This is the exact number of bytes in memory taken up by a -value of the given type. In other words, a memset of this size -would exactly overwrite a value. When laid out in vectors -and structures there may be additional padding between -elements.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.size_of_val.html b/doc/bitflags/__core/intrinsics/fn.size_of_val.html deleted file mode 100644 index 35707459..00000000 --- a/doc/bitflags/__core/intrinsics/fn.size_of_val.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::size_of_val - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::size_of_val - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn size_of_val<T>(&T) -> usize where T: ?Sized
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.sqrtf32.html b/doc/bitflags/__core/intrinsics/fn.sqrtf32.html deleted file mode 100644 index 040042de..00000000 --- a/doc/bitflags/__core/intrinsics/fn.sqrtf32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::sqrtf32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::sqrtf32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn sqrtf32(x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the square root of an f32

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.sqrtf64.html b/doc/bitflags/__core/intrinsics/fn.sqrtf64.html deleted file mode 100644 index bfe3d6ba..00000000 --- a/doc/bitflags/__core/intrinsics/fn.sqrtf64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::sqrtf64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::sqrtf64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn sqrtf64(x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the square root of an f64

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.sub_with_overflow.html b/doc/bitflags/__core/intrinsics/fn.sub_with_overflow.html deleted file mode 100644 index 6c37e47c..00000000 --- a/doc/bitflags/__core/intrinsics/fn.sub_with_overflow.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::sub_with_overflow - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::sub_with_overflow - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn sub_with_overflow<T>(x: T, y: T) -> (T, bool)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Performs checked integer subtraction

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.transmute.html b/doc/bitflags/__core/intrinsics/fn.transmute.html deleted file mode 100644 index 3da0c7bc..00000000 --- a/doc/bitflags/__core/intrinsics/fn.transmute.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::transmute - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::transmute - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn transmute<T, U>(e: T) -> U
1.0.0

Unsafely transforms a value of one type into a value of another type.

- -

Both types must have the same size.

- -

Examples

-
-use std::mem;
-
-let array: &[u8] = unsafe { mem::transmute("Rust") };
-assert_eq!(array, [82, 117, 115, 116]);
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.truncf32.html b/doc/bitflags/__core/intrinsics/fn.truncf32.html deleted file mode 100644 index 062922a7..00000000 --- a/doc/bitflags/__core/intrinsics/fn.truncf32.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::truncf32 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::truncf32 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn truncf32(x: f32) -> f32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the integer part of an f32.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.truncf64.html b/doc/bitflags/__core/intrinsics/fn.truncf64.html deleted file mode 100644 index cf11156d..00000000 --- a/doc/bitflags/__core/intrinsics/fn.truncf64.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::truncf64 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::truncf64 - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn truncf64(x: f64) -> f64
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the integer part of an f64.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.try.html b/doc/bitflags/__core/intrinsics/fn.try.html deleted file mode 100644 index 753c211a..00000000 --- a/doc/bitflags/__core/intrinsics/fn.try.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::try - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::try - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn try(f: fn(*mut u8), data: *mut u8, local_ptr: *mut u8) -> i32
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Rust's "try catch" construct which invokes the function pointer f with -the data pointer data.

- -

The third pointer is a target-specific data pointer which is filled in -with the specifics of the exception that occurred. For examples on Unix -platforms this is a *mut *mut T which is filled in by the compiler and -on MSVC it's *mut [usize; 2]. For more information see the compiler's -source as well as std's catch implementation.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.type_id.html b/doc/bitflags/__core/intrinsics/fn.type_id.html deleted file mode 100644 index c80bd52f..00000000 --- a/doc/bitflags/__core/intrinsics/fn.type_id.html +++ /dev/null @@ -1,116 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::type_id - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::type_id - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn type_id<T>() -> u64 where T: 'static + ?Sized
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Gets an identifier which is globally unique to the specified type. This -function will return the same value for a type regardless of whichever -crate it is invoked in.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.type_name.html b/doc/bitflags/__core/intrinsics/fn.type_name.html deleted file mode 100644 index c425b54e..00000000 --- a/doc/bitflags/__core/intrinsics/fn.type_name.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::type_name - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::type_name - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn type_name<T>() -> &'static str where T: ?Sized
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Gets a static string slice containing the name of a type.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.unchecked_div.html b/doc/bitflags/__core/intrinsics/fn.unchecked_div.html deleted file mode 100644 index f3da9e3b..00000000 --- a/doc/bitflags/__core/intrinsics/fn.unchecked_div.html +++ /dev/null @@ -1,115 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::unchecked_div - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::unchecked_div - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn unchecked_div<T>(x: T, y: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Performs an unchecked division, resulting in undefined behavior -where y = 0 or x = T::min_value() and y = -1

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.unchecked_rem.html b/doc/bitflags/__core/intrinsics/fn.unchecked_rem.html deleted file mode 100644 index 98089b0d..00000000 --- a/doc/bitflags/__core/intrinsics/fn.unchecked_rem.html +++ /dev/null @@ -1,115 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::unchecked_rem - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::unchecked_rem - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn unchecked_rem<T>(x: T, y: T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Returns the remainder of an unchecked division, resulting in -undefined behavior where y = 0 or x = T::min_value() and y = -1

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.uninit.html b/doc/bitflags/__core/intrinsics/fn.uninit.html deleted file mode 100644 index ead93157..00000000 --- a/doc/bitflags/__core/intrinsics/fn.uninit.html +++ /dev/null @@ -1,120 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::uninit - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::uninit - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn uninit<T>() -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Creates an uninitialized value.

- -

uninit is unsafe because there is no guarantee of what its -contents are. In particular its drop-flag may be set to any -state, which means it may claim either dropped or -undropped. In the general case one must use ptr::write to -initialize memory previous set to the result of uninit.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.unreachable.html b/doc/bitflags/__core/intrinsics/fn.unreachable.html deleted file mode 100644 index dc96fd2b..00000000 --- a/doc/bitflags/__core/intrinsics/fn.unreachable.html +++ /dev/null @@ -1,117 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::unreachable - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::unreachable - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn unreachable() -> !
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Tells LLVM that this point in the code is not reachable, -enabling further optimizations.

- -

NB: This is very different from the unreachable!() macro!

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.volatile_copy_memory.html b/doc/bitflags/__core/intrinsics/fn.volatile_copy_memory.html deleted file mode 100644 index d71e9b9a..00000000 --- a/doc/bitflags/__core/intrinsics/fn.volatile_copy_memory.html +++ /dev/null @@ -1,118 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::volatile_copy_memory - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::volatile_copy_memory - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn volatile_copy_memory<T>(dst: *mut T, src: *const T, count: usize)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Equivalent to the appropriate llvm.memmove.p0i8.0i8.* intrinsic, with -a size of count * size_of::<T>() and an alignment of -min_align_of::<T>()

- -

The volatile parameter is set to true, so it will not be optimized out.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.volatile_copy_nonoverlapping_memory.html b/doc/bitflags/__core/intrinsics/fn.volatile_copy_nonoverlapping_memory.html deleted file mode 100644 index 42fdad13..00000000 --- a/doc/bitflags/__core/intrinsics/fn.volatile_copy_nonoverlapping_memory.html +++ /dev/null @@ -1,118 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::volatile_copy_nonoverlapping_memory - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::volatile_copy_nonoverlapping_memory - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn volatile_copy_nonoverlapping_memory<T>(dst: *mut T, src: *const T, count: usize)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Equivalent to the appropriate llvm.memcpy.p0i8.0i8.* intrinsic, with -a size of count * size_of::<T>() and an alignment of -min_align_of::<T>()

- -

The volatile parameter is set to true, so it will not be optimized out.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.volatile_load.html b/doc/bitflags/__core/intrinsics/fn.volatile_load.html deleted file mode 100644 index c5aee1db..00000000 --- a/doc/bitflags/__core/intrinsics/fn.volatile_load.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::volatile_load - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::volatile_load - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn volatile_load<T>(src: *const T) -> T
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Perform a volatile load from the src pointer.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.volatile_set_memory.html b/doc/bitflags/__core/intrinsics/fn.volatile_set_memory.html deleted file mode 100644 index b7dc245a..00000000 --- a/doc/bitflags/__core/intrinsics/fn.volatile_set_memory.html +++ /dev/null @@ -1,118 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::volatile_set_memory - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::volatile_set_memory - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn volatile_set_memory<T>(dst: *mut T, val: u8, count: usize)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Equivalent to the appropriate llvm.memset.p0i8.* intrinsic, with a -size of count * size_of::<T>() and an alignment of -min_align_of::<T>().

- -

The volatile parameter is set to true, so it will not be optimized out.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.volatile_store.html b/doc/bitflags/__core/intrinsics/fn.volatile_store.html deleted file mode 100644 index 71a4e7ef..00000000 --- a/doc/bitflags/__core/intrinsics/fn.volatile_store.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::volatile_store - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::volatile_store - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn volatile_store<T>(dst: *mut T, val: T)
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

Perform a volatile store to the dst pointer.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/fn.write_bytes.html b/doc/bitflags/__core/intrinsics/fn.write_bytes.html deleted file mode 100644 index c1e206de..00000000 --- a/doc/bitflags/__core/intrinsics/fn.write_bytes.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics::write_bytes - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::intrinsics::write_bytes - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn write_bytes<T>(dst: *mut T, val: u8, count: usize)
1.0.0

Invokes memset on the specified pointer, setting count * size_of::<T>() -bytes of memory starting at dst to val.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/index.html b/doc/bitflags/__core/intrinsics/index.html deleted file mode 100644 index d33a924b..00000000 --- a/doc/bitflags/__core/intrinsics/index.html +++ /dev/null @@ -1,1399 +0,0 @@ - - - - - - - - - - bitflags::__core::intrinsics - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::intrinsics - - [−] - - [src]

-
Unstable (core_intrinsics)

: intrinsics are unlikely to ever be stabilized, instead they should be used through stabilized interfaces in the rest of the standard library

-

rustc compiler intrinsics.

- -

The corresponding definitions are in librustc_trans/trans/intrinsic.rs.

- -

Volatiles

-

The volatile intrinsics provide operations intended to act on I/O -memory, which are guaranteed to not be reordered by the compiler -across other volatile intrinsics. See the LLVM documentation on -[volatile].

- -

Atomics

-

The atomic intrinsics provide common atomic operations on machine -words, with multiple possible memory orderings. They obey the same -semantics as C++11. See the LLVM documentation on [atomics].

- -

A quick refresher on memory ordering:

- -
    -
  • Acquire - a barrier for acquiring a lock. Subsequent reads and writes -take place after the barrier.
    • -
  • Release - a barrier for releasing a lock. Preceding reads and writes -take place before the barrier.
    • -
  • Sequentially consistent - sequentially consistent operations are -guaranteed to happen in order. This is the standard mode for working -with atomic types and is equivalent to Java's volatile.
    • -
-

Functions

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
copy -

Copies count * size_of<T> bytes from src to dst. The source -and destination may overlap.

-
copy_nonoverlapping -

Copies count * size_of<T> bytes from src to dst. The source -and destination may not overlap.

-
drop_in_place -

Executes the destructor (if any) of the pointed-to value.

-
transmute -

Unsafely transforms a value of one type into a value of another type.

-
write_bytes -

Invokes memset on the specified pointer, setting count * size_of::<T>() -bytes of memory starting at dst to val.

-
abort - [Unstable]

Aborts the execution of the process.

-
add_with_overflow - [Unstable]

Performs checked integer addition.

-
arith_offset - [Unstable]

Calculates the offset from a pointer, potentially wrapping.

-
assume - [Unstable]

Informs the optimizer that a condition is always true. -If the condition is false, the behavior is undefined.

-
atomic_and - [Unstable] -
atomic_and_acq - [Unstable] -
atomic_and_acqrel - [Unstable] -
atomic_and_rel - [Unstable] -
atomic_and_relaxed - [Unstable] -
atomic_cxchg - [Unstable] -
atomic_cxchg_acq - [Unstable] -
atomic_cxchg_acq_failrelaxed - [Unstable] -
atomic_cxchg_acqrel - [Unstable] -
atomic_cxchg_acqrel_failrelaxed - [Unstable] -
atomic_cxchg_failacq - [Unstable] -
atomic_cxchg_failrelaxed - [Unstable] -
atomic_cxchg_rel - [Unstable] -
atomic_cxchg_relaxed - [Unstable] -
atomic_cxchgweak - [Unstable] -
atomic_cxchgweak_acq - [Unstable] -
atomic_cxchgweak_acq_failrelaxed - [Unstable] -
atomic_cxchgweak_acqrel - [Unstable] -
atomic_cxchgweak_acqrel_failrelaxed - [Unstable] -
atomic_cxchgweak_failacq - [Unstable] -
atomic_cxchgweak_failrelaxed - [Unstable] -
atomic_cxchgweak_rel - [Unstable] -
atomic_cxchgweak_relaxed - [Unstable] -
atomic_fence - [Unstable] -
atomic_fence_acq - [Unstable] -
atomic_fence_acqrel - [Unstable] -
atomic_fence_rel - [Unstable] -
atomic_load - [Unstable] -
atomic_load_acq - [Unstable] -
atomic_load_relaxed - [Unstable] -
atomic_load_unordered - [Unstable] -
atomic_max - [Unstable] -
atomic_max_acq - [Unstable] -
atomic_max_acqrel - [Unstable] -
atomic_max_rel - [Unstable] -
atomic_max_relaxed - [Unstable] -
atomic_min - [Unstable] -
atomic_min_acq - [Unstable] -
atomic_min_acqrel - [Unstable] -
atomic_min_rel - [Unstable] -
atomic_min_relaxed - [Unstable] -
atomic_nand - [Unstable] -
atomic_nand_acq - [Unstable] -
atomic_nand_acqrel - [Unstable] -
atomic_nand_rel - [Unstable] -
atomic_nand_relaxed - [Unstable] -
atomic_or - [Unstable] -
atomic_or_acq - [Unstable] -
atomic_or_acqrel - [Unstable] -
atomic_or_rel - [Unstable] -
atomic_or_relaxed - [Unstable] -
atomic_singlethreadfence - [Unstable]

A compiler-only memory barrier.

-
atomic_singlethreadfence_acq - [Unstable] -
atomic_singlethreadfence_acqrel - [Unstable] -
atomic_singlethreadfence_rel - [Unstable] -
atomic_store - [Unstable] -
atomic_store_rel - [Unstable] -
atomic_store_relaxed - [Unstable] -
atomic_store_unordered - [Unstable] -
atomic_umax - [Unstable] -
atomic_umax_acq - [Unstable] -
atomic_umax_acqrel - [Unstable] -
atomic_umax_rel - [Unstable] -
atomic_umax_relaxed - [Unstable] -
atomic_umin - [Unstable] -
atomic_umin_acq - [Unstable] -
atomic_umin_acqrel - [Unstable] -
atomic_umin_rel - [Unstable] -
atomic_umin_relaxed - [Unstable] -
atomic_xadd - [Unstable] -
atomic_xadd_acq - [Unstable] -
atomic_xadd_acqrel - [Unstable] -
atomic_xadd_rel - [Unstable] -
atomic_xadd_relaxed - [Unstable] -
atomic_xchg - [Unstable] -
atomic_xchg_acq - [Unstable] -
atomic_xchg_acqrel - [Unstable] -
atomic_xchg_rel - [Unstable] -
atomic_xchg_relaxed - [Unstable] -
atomic_xor - [Unstable] -
atomic_xor_acq - [Unstable] -
atomic_xor_acqrel - [Unstable] -
atomic_xor_rel - [Unstable] -
atomic_xor_relaxed - [Unstable] -
atomic_xsub - [Unstable] -
atomic_xsub_acq - [Unstable] -
atomic_xsub_acqrel - [Unstable] -
atomic_xsub_rel - [Unstable] -
atomic_xsub_relaxed - [Unstable] -
breakpoint - [Unstable]

Executes a breakpoint trap, for inspection by a debugger.

-
bswap - [Unstable]

Reverses the bytes in an integer type T.

-
ceilf32 - [Unstable]

Returns the smallest integer greater than or equal to an f32.

-
ceilf64 - [Unstable]

Returns the smallest integer greater than or equal to an f64.

-
copysignf32 - [Unstable]

Copies the sign from y to x for f32 values.

-
copysignf64 - [Unstable]

Copies the sign from y to x for f64 values.

-
cosf32 - [Unstable]

Returns the cosine of an f32.

-
cosf64 - [Unstable]

Returns the cosine of an f64.

-
ctlz - [Unstable]

Returns the number of leading bits unset in an integer type T

-
ctpop - [Unstable]

Returns the number of bits set in an integer type T

-
cttz - [Unstable]

Returns the number of trailing bits unset in an integer type T

-
discriminant_value - [Unstable]

Returns the value of the discriminant for the variant in 'v', -cast to a u64; if T has no discriminant, returns 0.

-
exp2f32 - [Unstable]

Returns 2 raised to the power of an f32.

-
exp2f64 - [Unstable]

Returns 2 raised to the power of an f64.

-
expf32 - [Unstable]

Returns the exponential of an f32.

-
expf64 - [Unstable]

Returns the exponential of an f64.

-
fabsf32 - [Unstable]

Returns the absolute value of an f32.

-
fabsf64 - [Unstable]

Returns the absolute value of an f64.

-
fadd_fast - [Unstable]

Float addition that allows optimizations based on algebraic rules. -May assume inputs are finite.

-
fdiv_fast - [Unstable]

Float division that allows optimizations based on algebraic rules. -May assume inputs are finite.

-
floorf32 - [Unstable]

Returns the largest integer less than or equal to an f32.

-
floorf64 - [Unstable]

Returns the largest integer less than or equal to an f64.

-
fmaf32 - [Unstable]

Returns a * b + c for f32 values.

-
fmaf64 - [Unstable]

Returns a * b + c for f64 values.

-
fmul_fast - [Unstable]

Float multiplication that allows optimizations based on algebraic rules. -May assume inputs are finite.

-
forget - [Unstable]

Moves a value out of scope without running drop glue.

-
frem_fast - [Unstable]

Float remainder that allows optimizations based on algebraic rules. -May assume inputs are finite.

-
fsub_fast - [Unstable]

Float subtraction that allows optimizations based on algebraic rules. -May assume inputs are finite.

-
init - [Unstable]

Creates a value initialized to zero.

-
init_dropped - [Unstable]

Creates a value initialized to so that its drop flag, -if any, says that it has been dropped.

-
log10f32 - [Unstable]

Returns the base 10 logarithm of an f32.

-
log10f64 - [Unstable]

Returns the base 10 logarithm of an f64.

-
log2f32 - [Unstable]

Returns the base 2 logarithm of an f32.

-
log2f64 - [Unstable]

Returns the base 2 logarithm of an f64.

-
logf32 - [Unstable]

Returns the natural logarithm of an f32.

-
logf64 - [Unstable]

Returns the natural logarithm of an f64.

-
min_align_of - [Unstable] -
min_align_of_val - [Unstable] -
move_val_init - [Unstable]

Moves a value to an uninitialized memory location.

-
mul_with_overflow - [Unstable]

Performs checked integer multiplication

-
nearbyintf32 - [Unstable]

Returns the nearest integer to an f32.

-
nearbyintf64 - [Unstable]

Returns the nearest integer to an f64.

-
needs_drop - [Unstable]

Returns true if the actual type given as T requires drop -glue; returns false if the actual type provided for T -implements Copy.

-
offset - [Unstable]

Calculates the offset from a pointer.

-
overflowing_add - [Unstable]

Returns (a + b) mod 2N, where N is the width of T in bits.

-
overflowing_mul - [Unstable]

Returns (a * b) mod 2N, where N is the width of T in bits.

-
overflowing_sub - [Unstable]

Returns (a - b) mod 2N, where N is the width of T in bits.

-
powf32 - [Unstable]

Raises an f32 to an f32 power.

-
powf64 - [Unstable]

Raises an f64 to an f64 power.

-
powif32 - [Unstable]

Raises an f32 to an integer power.

-
powif64 - [Unstable]

Raises an f64 to an integer power.

-
pref_align_of - [Unstable] -
return_address - [Unstable]

Gives the address for the return value of the enclosing function.

-
rintf32 - [Unstable]

Returns the nearest integer to an f32. May raise an inexact floating-point exception -if the argument is not an integer.

-
rintf64 - [Unstable]

Returns the nearest integer to an f64. May raise an inexact floating-point exception -if the argument is not an integer.

-
roundf32 - [Unstable]

Returns the nearest integer to an f32. Rounds half-way cases away from zero.

-
roundf64 - [Unstable]

Returns the nearest integer to an f64. Rounds half-way cases away from zero.

-
sinf32 - [Unstable]

Returns the sine of an f32.

-
sinf64 - [Unstable]

Returns the sine of an f64.

-
size_of - [Unstable]

The size of a type in bytes.

-
size_of_val - [Unstable] -
sqrtf32 - [Unstable]

Returns the square root of an f32

-
sqrtf64 - [Unstable]

Returns the square root of an f64

-
sub_with_overflow - [Unstable]

Performs checked integer subtraction

-
truncf32 - [Unstable]

Returns the integer part of an f32.

-
truncf64 - [Unstable]

Returns the integer part of an f64.

-
try - [Unstable]

Rust's "try catch" construct which invokes the function pointer f with -the data pointer data.

-
type_id - [Unstable]

Gets an identifier which is globally unique to the specified type. This -function will return the same value for a type regardless of whichever -crate it is invoked in.

-
type_name - [Unstable]

Gets a static string slice containing the name of a type.

-
unchecked_div - [Unstable]

Performs an unchecked division, resulting in undefined behavior -where y = 0 or x = T::min_value() and y = -1

-
unchecked_rem - [Unstable]

Returns the remainder of an unchecked division, resulting in -undefined behavior where y = 0 or x = T::min_value() and y = -1

-
uninit - [Unstable]

Creates an uninitialized value.

-
unreachable - [Unstable]

Tells LLVM that this point in the code is not reachable, -enabling further optimizations.

-
volatile_copy_memory - [Unstable]

Equivalent to the appropriate llvm.memmove.p0i8.0i8.* intrinsic, with -a size of count * size_of::<T>() and an alignment of -min_align_of::<T>()

-
volatile_copy_nonoverlapping_memory - [Unstable]

Equivalent to the appropriate llvm.memcpy.p0i8.0i8.* intrinsic, with -a size of count * size_of::<T>() and an alignment of -min_align_of::<T>()

-
volatile_load - [Unstable]

Perform a volatile load from the src pointer.

-
volatile_set_memory - [Unstable]

Equivalent to the appropriate llvm.memset.p0i8.* intrinsic, with a -size of count * size_of::<T>() and an alignment of -min_align_of::<T>().

-
volatile_store - [Unstable]

Perform a volatile store to the dst pointer.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/intrinsics/sidebar-items.js b/doc/bitflags/__core/intrinsics/sidebar-items.js deleted file mode 100644 index fd28d517..00000000 --- a/doc/bitflags/__core/intrinsics/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["abort","Aborts the execution of the process."],["add_with_overflow","Performs checked integer addition."],["arith_offset","Calculates the offset from a pointer, potentially wrapping."],["assume","Informs the optimizer that a condition is always true. If the condition is false, the behavior is undefined."],["atomic_and",""],["atomic_and_acq",""],["atomic_and_acqrel",""],["atomic_and_rel",""],["atomic_and_relaxed",""],["atomic_cxchg",""],["atomic_cxchg_acq",""],["atomic_cxchg_acq_failrelaxed",""],["atomic_cxchg_acqrel",""],["atomic_cxchg_acqrel_failrelaxed",""],["atomic_cxchg_failacq",""],["atomic_cxchg_failrelaxed",""],["atomic_cxchg_rel",""],["atomic_cxchg_relaxed",""],["atomic_cxchgweak",""],["atomic_cxchgweak_acq",""],["atomic_cxchgweak_acq_failrelaxed",""],["atomic_cxchgweak_acqrel",""],["atomic_cxchgweak_acqrel_failrelaxed",""],["atomic_cxchgweak_failacq",""],["atomic_cxchgweak_failrelaxed",""],["atomic_cxchgweak_rel",""],["atomic_cxchgweak_relaxed",""],["atomic_fence",""],["atomic_fence_acq",""],["atomic_fence_acqrel",""],["atomic_fence_rel",""],["atomic_load",""],["atomic_load_acq",""],["atomic_load_relaxed",""],["atomic_load_unordered",""],["atomic_max",""],["atomic_max_acq",""],["atomic_max_acqrel",""],["atomic_max_rel",""],["atomic_max_relaxed",""],["atomic_min",""],["atomic_min_acq",""],["atomic_min_acqrel",""],["atomic_min_rel",""],["atomic_min_relaxed",""],["atomic_nand",""],["atomic_nand_acq",""],["atomic_nand_acqrel",""],["atomic_nand_rel",""],["atomic_nand_relaxed",""],["atomic_or",""],["atomic_or_acq",""],["atomic_or_acqrel",""],["atomic_or_rel",""],["atomic_or_relaxed",""],["atomic_singlethreadfence","A compiler-only memory barrier."],["atomic_singlethreadfence_acq",""],["atomic_singlethreadfence_acqrel",""],["atomic_singlethreadfence_rel",""],["atomic_store",""],["atomic_store_rel",""],["atomic_store_relaxed",""],["atomic_store_unordered",""],["atomic_umax",""],["atomic_umax_acq",""],["atomic_umax_acqrel",""],["atomic_umax_rel",""],["atomic_umax_relaxed",""],["atomic_umin",""],["atomic_umin_acq",""],["atomic_umin_acqrel",""],["atomic_umin_rel",""],["atomic_umin_relaxed",""],["atomic_xadd",""],["atomic_xadd_acq",""],["atomic_xadd_acqrel",""],["atomic_xadd_rel",""],["atomic_xadd_relaxed",""],["atomic_xchg",""],["atomic_xchg_acq",""],["atomic_xchg_acqrel",""],["atomic_xchg_rel",""],["atomic_xchg_relaxed",""],["atomic_xor",""],["atomic_xor_acq",""],["atomic_xor_acqrel",""],["atomic_xor_rel",""],["atomic_xor_relaxed",""],["atomic_xsub",""],["atomic_xsub_acq",""],["atomic_xsub_acqrel",""],["atomic_xsub_rel",""],["atomic_xsub_relaxed",""],["breakpoint","Executes a breakpoint trap, for inspection by a debugger."],["bswap","Reverses the bytes in an integer type `T`."],["ceilf32","Returns the smallest integer greater than or equal to an `f32`."],["ceilf64","Returns the smallest integer greater than or equal to an `f64`."],["copy","Copies `count * size_of` bytes from `src` to `dst`. The source and destination may overlap."],["copy_nonoverlapping","Copies `count * size_of` bytes from `src` to `dst`. The source and destination may *not* overlap."],["copysignf32","Copies the sign from `y` to `x` for `f32` values."],["copysignf64","Copies the sign from `y` to `x` for `f64` values."],["cosf32","Returns the cosine of an `f32`."],["cosf64","Returns the cosine of an `f64`."],["ctlz","Returns the number of leading bits unset in an integer type `T`"],["ctpop","Returns the number of bits set in an integer type `T`"],["cttz","Returns the number of trailing bits unset in an integer type `T`"],["discriminant_value","Returns the value of the discriminant for the variant in 'v', cast to a `u64`; if `T` has no discriminant, returns 0."],["drop_in_place","Executes the destructor (if any) of the pointed-to value."],["exp2f32","Returns 2 raised to the power of an `f32`."],["exp2f64","Returns 2 raised to the power of an `f64`."],["expf32","Returns the exponential of an `f32`."],["expf64","Returns the exponential of an `f64`."],["fabsf32","Returns the absolute value of an `f32`."],["fabsf64","Returns the absolute value of an `f64`."],["fadd_fast","Float addition that allows optimizations based on algebraic rules. May assume inputs are finite."],["fdiv_fast","Float division that allows optimizations based on algebraic rules. May assume inputs are finite."],["floorf32","Returns the largest integer less than or equal to an `f32`."],["floorf64","Returns the largest integer less than or equal to an `f64`."],["fmaf32","Returns `a * b + c` for `f32` values."],["fmaf64","Returns `a * b + c` for `f64` values."],["fmul_fast","Float multiplication that allows optimizations based on algebraic rules. May assume inputs are finite."],["forget","Moves a value out of scope without running drop glue."],["frem_fast","Float remainder that allows optimizations based on algebraic rules. May assume inputs are finite."],["fsub_fast","Float subtraction that allows optimizations based on algebraic rules. May assume inputs are finite."],["init","Creates a value initialized to zero."],["init_dropped","Creates a value initialized to so that its drop flag, if any, says that it has been dropped."],["log10f32","Returns the base 10 logarithm of an `f32`."],["log10f64","Returns the base 10 logarithm of an `f64`."],["log2f32","Returns the base 2 logarithm of an `f32`."],["log2f64","Returns the base 2 logarithm of an `f64`."],["logf32","Returns the natural logarithm of an `f32`."],["logf64","Returns the natural logarithm of an `f64`."],["min_align_of",""],["min_align_of_val",""],["move_val_init","Moves a value to an uninitialized memory location."],["mul_with_overflow","Performs checked integer multiplication"],["nearbyintf32","Returns the nearest integer to an `f32`."],["nearbyintf64","Returns the nearest integer to an `f64`."],["needs_drop","Returns `true` if the actual type given as `T` requires drop glue; returns `false` if the actual type provided for `T` implements `Copy`."],["offset","Calculates the offset from a pointer."],["overflowing_add","Returns (a + b) mod 2^N, where N is the width of T in bits."],["overflowing_mul","Returns (a * b) mod 2^N, where N is the width of T in bits."],["overflowing_sub","Returns (a - b) mod 2^N, where N is the width of T in bits."],["powf32","Raises an `f32` to an `f32` power."],["powf64","Raises an `f64` to an `f64` power."],["powif32","Raises an `f32` to an integer power."],["powif64","Raises an `f64` to an integer power."],["pref_align_of",""],["return_address","Gives the address for the return value of the enclosing function."],["rintf32","Returns the nearest integer to an `f32`. May raise an inexact floating-point exception if the argument is not an integer."],["rintf64","Returns the nearest integer to an `f64`. May raise an inexact floating-point exception if the argument is not an integer."],["roundf32","Returns the nearest integer to an `f32`. Rounds half-way cases away from zero."],["roundf64","Returns the nearest integer to an `f64`. Rounds half-way cases away from zero."],["sinf32","Returns the sine of an `f32`."],["sinf64","Returns the sine of an `f64`."],["size_of","The size of a type in bytes."],["size_of_val",""],["sqrtf32","Returns the square root of an `f32`"],["sqrtf64","Returns the square root of an `f64`"],["sub_with_overflow","Performs checked integer subtraction"],["transmute","Unsafely transforms a value of one type into a value of another type."],["truncf32","Returns the integer part of an `f32`."],["truncf64","Returns the integer part of an `f64`."],["try","Rust's \"try catch\" construct which invokes the function pointer `f` with the data pointer `data`."],["type_id","Gets an identifier which is globally unique to the specified type. This function will return the same value for a type regardless of whichever crate it is invoked in."],["type_name","Gets a static string slice containing the name of a type."],["unchecked_div","Performs an unchecked division, resulting in undefined behavior where y = 0 or x = `T::min_value()` and y = -1"],["unchecked_rem","Returns the remainder of an unchecked division, resulting in undefined behavior where y = 0 or x = `T::min_value()` and y = -1"],["uninit","Creates an uninitialized value."],["unreachable","Tells LLVM that this point in the code is not reachable, enabling further optimizations."],["volatile_copy_memory","Equivalent to the appropriate `llvm.memmove.p0i8.0i8.*` intrinsic, with a size of `count` * `size_of::()` and an alignment of `min_align_of::()`"],["volatile_copy_nonoverlapping_memory","Equivalent to the appropriate `llvm.memcpy.p0i8.0i8.*` intrinsic, with a size of `count` * `size_of::()` and an alignment of `min_align_of::()`"],["volatile_load","Perform a volatile load from the `src` pointer."],["volatile_set_memory","Equivalent to the appropriate `llvm.memset.p0i8.*` intrinsic, with a size of `count` * `size_of::()` and an alignment of `min_align_of::()`."],["volatile_store","Perform a volatile store to the `dst` pointer."],["write_bytes","Invokes memset on the specified pointer, setting `count * size_of::()` bytes of memory starting at `dst` to `val`."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/io/enum.CharsError.html b/doc/bitflags/__core/io/enum.CharsError.html deleted file mode 100644 index 594a9117..00000000 --- a/doc/bitflags/__core/io/enum.CharsError.html +++ /dev/null @@ -1,132 +0,0 @@ - - - - - - - - - - bitflags::__core::io::CharsError - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::io::CharsError - - [−] - - [src]

-
pub enum CharsError {
-    NotUtf8,
-    Other(Error),
-}
Unstable (io)

: awaiting stability of Read::chars

-

An enumeration of possible errors that can be generated from the Chars -adapter.

-

Variants

-
NotUtf8
Unstable (io)

: awaiting stability of Read::chars

-

Variant representing that the underlying stream was read successfully -but it did not contain valid utf8 data.

-
Other
Unstable (io)

: awaiting stability of Read::chars

-

Variant representing that an I/O error occurred.

-

Trait Implementations

impl Error for CharsError

fn description(&self) -> &str

-
Unstable (io)

: awaiting stability of Read::chars

-

fn cause(&self) -> Option<&Error>

-
Unstable (io)

: awaiting stability of Read::chars

-

impl Display for CharsError

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
Unstable (io)

: awaiting stability of Read::chars

-

Derived Implementations

impl Debug for CharsError

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
Unstable (io)

: awaiting stability of Read::chars

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/enum.ErrorKind.html b/doc/bitflags/__core/io/enum.ErrorKind.html deleted file mode 100644 index f59470d4..00000000 --- a/doc/bitflags/__core/io/enum.ErrorKind.html +++ /dev/null @@ -1,182 +0,0 @@ - - - - - - - - - - bitflags::__core::io::ErrorKind - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::io::ErrorKind - - [−] - - [src]

-
pub enum ErrorKind {
-    NotFound,
-    PermissionDenied,
-    ConnectionRefused,
-    ConnectionReset,
-    ConnectionAborted,
-    NotConnected,
-    AddrInUse,
-    AddrNotAvailable,
-    BrokenPipe,
-    AlreadyExists,
-    WouldBlock,
-    InvalidInput,
-    InvalidData,
-    TimedOut,
-    WriteZero,
-    Interrupted,
-    Other,
-    UnexpectedEof,
-    // some variants omitted
-}
1.0.0

A list specifying general categories of I/O error.

- -

This list is intended to grow over time and it is not recommended to -exhaustively match against it.

-

Variants

-
NotFound

An entity was not found, often a file.

-
PermissionDenied

The operation lacked the necessary privileges to complete.

-
ConnectionRefused

The connection was refused by the remote server.

-
ConnectionReset

The connection was reset by the remote server.

-
ConnectionAborted

The connection was aborted (terminated) by the remote server.

-
NotConnected

The network operation failed because it was not connected yet.

-
AddrInUse

A socket address could not be bound because the address is already in -use elsewhere.

-
AddrNotAvailable

A nonexistent interface was requested or the requested address was not -local.

-
BrokenPipe

The operation failed because a pipe was closed.

-
AlreadyExists

An entity already exists, often a file.

-
WouldBlock

The operation needs to block to complete, but the blocking operation was -requested to not occur.

-
InvalidInput

A parameter was incorrect.

-
InvalidData

Data not valid for the operation were encountered.

- -

Unlike InvalidInput, this typically means that the operation -parameters were valid, however the error was caused by malformed -input data.

- -

For example, a function that reads a file into a string will error with -InvalidData if the file's contents are not valid UTF-8.

-
1.2.0
TimedOut

The I/O operation's timeout expired, causing it to be canceled.

-
WriteZero

An error returned when an operation could not be completed because a -call to write returned Ok(0).

- -

This typically means that an operation could only succeed if it wrote a -particular number of bytes but only a smaller number of bytes could be -written.

-
Interrupted

This operation was interrupted.

- -

Interrupted operations can typically be retried.

-
Other

Any I/O error not part of this list.

-
UnexpectedEof

An error returned when an operation could not be completed because an -"end of file" was reached prematurely.

- -

This typically means that an operation could only succeed if it read a -particular number of bytes but only a smaller number of bytes could be -read.

-
1.6.0

Trait Implementations

Derived Implementations

impl Debug for ErrorKind

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl Clone for ErrorKind

fn clone(&self) -> ErrorKind

-

fn clone_from(&mut self, source: &Self)

-

impl Eq for ErrorKind

impl PartialEq<ErrorKind> for ErrorKind

fn eq(&self, __arg_0: &ErrorKind) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl Copy for ErrorKind

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/enum.SeekFrom.html b/doc/bitflags/__core/io/enum.SeekFrom.html deleted file mode 100644 index 3dacfbf1..00000000 --- a/doc/bitflags/__core/io/enum.SeekFrom.html +++ /dev/null @@ -1,134 +0,0 @@ - - - - - - - - - - bitflags::__core::io::SeekFrom - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::io::SeekFrom - - [−] - - [src]

-
pub enum SeekFrom {
-    Start(u64),
-    End(i64),
-    Current(i64),
-}
1.0.0

Enumeration of possible methods to seek within an I/O object.

-

Variants

-
Start

Set the offset to the provided number of bytes.

-
End

Set the offset to the size of this object plus the specified number of -bytes.

- -

It is possible to seek beyond the end of an object, but it's an error to -seek before byte 0.

-
Current

Set the offset to the current position plus the specified number of -bytes.

- -

It is possible to seek beyond the end of an object, but it's an error to -seek before byte 0.

-

Trait Implementations

Derived Implementations

impl Debug for SeekFrom

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl Clone for SeekFrom

fn clone(&self) -> SeekFrom

-

fn clone_from(&mut self, source: &Self)

-

impl Eq for SeekFrom

impl PartialEq<SeekFrom> for SeekFrom

fn eq(&self, __arg_0: &SeekFrom) -> bool

-

fn ne(&self, __arg_0: &SeekFrom) -> bool

-

impl Copy for SeekFrom

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/fn.copy.html b/doc/bitflags/__core/io/fn.copy.html deleted file mode 100644 index 400c0d00..00000000 --- a/doc/bitflags/__core/io/fn.copy.html +++ /dev/null @@ -1,136 +0,0 @@ - - - - - - - - - - bitflags::__core::io::copy - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::io::copy - - [−] - - [src]

-
pub fn copy<R, W>(reader: &mut R, writer: &mut W) -> Result<u64, Error> where W: Write + ?Sized, R: Read + ?Sized
1.0.0

Copies the entire contents of a reader into a writer.

- -

This function will continuously read data from reader and then -write it into writer in a streaming fashion until reader -returns EOF.

- -

On success, the total number of bytes that were copied from -reader to writer is returned.

- -

Errors

-

This function will return an error immediately if any call to read or -write returns an error. All instances of ErrorKind::Interrupted are -handled by this function and the underlying operation is retried.

- -

Examples

-
-use std::io;
-
-let mut reader: &[u8] = b"hello";
-let mut writer: Vec<u8> = vec![];
-
-try!(io::copy(&mut reader, &mut writer));
-
-assert_eq!(reader, &writer[..]);
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/fn.empty.html b/doc/bitflags/__core/io/fn.empty.html deleted file mode 100644 index 5494ded0..00000000 --- a/doc/bitflags/__core/io/fn.empty.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - bitflags::__core::io::empty - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::io::empty - - [−] - - [src]

-
pub fn empty() -> Empty
1.0.0

Constructs a new handle to an empty reader.

- -

All reads from the returned reader will return Ok(0).

- -

Examples

-

A slightly sad example of not reading anything into a buffer:

- -
-use std::io;
-use std::io::Read;
-
-let mut buffer = String::new();
-try!(io::empty().read_to_string(&mut buffer));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/fn.repeat.html b/doc/bitflags/__core/io/fn.repeat.html deleted file mode 100644 index 906a9842..00000000 --- a/doc/bitflags/__core/io/fn.repeat.html +++ /dev/null @@ -1,116 +0,0 @@ - - - - - - - - - - bitflags::__core::io::repeat - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::io::repeat - - [−] - - [src]

-
pub fn repeat(byte: u8) -> Repeat
1.0.0

Creates an instance of a reader that infinitely repeats one byte.

- -

All reads from this reader will succeed by filling the specified buffer with -the given byte.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/fn.sink.html b/doc/bitflags/__core/io/fn.sink.html deleted file mode 100644 index 793b7e37..00000000 --- a/doc/bitflags/__core/io/fn.sink.html +++ /dev/null @@ -1,116 +0,0 @@ - - - - - - - - - - bitflags::__core::io::sink - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::io::sink - - [−] - - [src]

-
pub fn sink() -> Sink
1.0.0

Creates an instance of a writer which will successfully consume all data.

- -

All calls to write on the returned instance will return Ok(buf.len()) -and the contents of the buffer will not be inspected.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/fn.stderr.html b/doc/bitflags/__core/io/fn.stderr.html deleted file mode 100644 index 3ed01616..00000000 --- a/doc/bitflags/__core/io/fn.stderr.html +++ /dev/null @@ -1,135 +0,0 @@ - - - - - - - - - - bitflags::__core::io::stderr - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::io::stderr - - [−] - - [src]

-
pub fn stderr() -> Stderr
1.0.0

Constructs a new handle to the standard error of the current process.

- -

This handle is not buffered.

- -

Examples

-

Using implicit synchronization:

- -
-use std::io::{self, Write};
-
-try!(io::stderr().write(b"hello world"));
-
- -

Using explicit synchronization:

- -
-use std::io::{self, Write};
-
-let stderr = io::stderr();
-let mut handle = stderr.lock();
-
-try!(handle.write(b"hello world"));
-
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/fn.stdin.html b/doc/bitflags/__core/io/fn.stdin.html deleted file mode 100644 index ba78021c..00000000 --- a/doc/bitflags/__core/io/fn.stdin.html +++ /dev/null @@ -1,137 +0,0 @@ - - - - - - - - - - bitflags::__core::io::stdin - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::io::stdin - - [−] - - [src]

-
pub fn stdin() -> Stdin
1.0.0

Constructs a new handle to the standard input of the current process.

- -

Each handle returned is a reference to a shared global buffer whose access -is synchronized via a mutex. If you need more explicit control over -locking, see the lock() method.

- -

Examples

-

Using implicit synchronization:

- -
-use std::io::{self, Read};
-
-let mut buffer = String::new();
-try!(io::stdin().read_to_string(&mut buffer));
- -

Using explicit synchronization:

- -
-use std::io::{self, Read};
-
-let mut buffer = String::new();
-let stdin = io::stdin();
-let mut handle = stdin.lock();
-
-try!(handle.read_to_string(&mut buffer));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/fn.stdout.html b/doc/bitflags/__core/io/fn.stdout.html deleted file mode 100644 index 2360803d..00000000 --- a/doc/bitflags/__core/io/fn.stdout.html +++ /dev/null @@ -1,137 +0,0 @@ - - - - - - - - - - bitflags::__core::io::stdout - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::io::stdout - - [−] - - [src]

-
pub fn stdout() -> Stdout
1.0.0

Constructs a new handle to the standard output of the current process.

- -

Each handle returned is a reference to a shared global buffer whose access -is synchronized via a mutex. If you need more explicit control over -locking, see the Stdout::lock method.

- -

Examples

-

Using implicit synchronization:

- -
-use std::io::{self, Write};
-
-try!(io::stdout().write(b"hello world"));
-
- -

Using explicit synchronization:

- -
-use std::io::{self, Write};
-
-let stdout = io::stdout();
-let mut handle = stdout.lock();
-
-try!(handle.write(b"hello world"));
-
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/index.html b/doc/bitflags/__core/io/index.html deleted file mode 100644 index e94ab10d..00000000 --- a/doc/bitflags/__core/io/index.html +++ /dev/null @@ -1,571 +0,0 @@ - - - - - - - - - - bitflags::__core::io - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::io - - [−] - - [src]

-

Traits, helpers, and type definitions for core I/O functionality.

- -

The std::io module contains a number of common things you'll need -when doing input and output. The most core part of this module is -the Read and Write traits, which provide the -most general interface for reading and writing input and output.

- -

Read and Write

-

Because they are traits, Read and Write are implemented by a number -of other types, and you can implement them for your types too. As such, -you'll see a few different types of I/O throughout the documentation in -this module: Files, TcpStreams, and sometimes even Vec<T>s. For -example, Read adds a read() method, which we can use on Files:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = [0; 10];
-
-// read up to 10 bytes
-try!(f.read(&mut buffer));
-
-println!("The bytes: {:?}", buffer);
- -

Read and Write are so important, implementors of the two traits have a -nickname: readers and writers. So you'll sometimes see 'a reader' instead -of 'a type that implements the Read trait'. Much easier!

- -

Seek and BufRead

-

Beyond that, there are two important traits that are provided: Seek -and BufRead. Both of these build on top of a reader to control -how the reading happens. Seek lets you control where the next byte is -coming from:

- -
-use std::io;
-use std::io::prelude::*;
-use std::io::SeekFrom;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = [0; 10];
-
-// skip to the last 10 bytes of the file
-try!(f.seek(SeekFrom::End(-10)));
-
-// read up to 10 bytes
-try!(f.read(&mut buffer));
-
-println!("The bytes: {:?}", buffer);
- -

BufRead uses an internal buffer to provide a number of other ways to read, but -to show it off, we'll need to talk about buffers in general. Keep reading!

- -

BufReader and BufWriter

-

Byte-based interfaces are unwieldy and can be inefficient, as we'd need to be -making near-constant calls to the operating system. To help with this, -std::io comes with two structs, BufReader and BufWriter, which wrap -readers and writers. The wrapper uses a buffer, reducing the number of -calls and providing nicer methods for accessing exactly what you want.

- -

For example, BufReader works with the BufRead trait to add extra -methods to any reader:

- -
-use std::io;
-use std::io::prelude::*;
-use std::io::BufReader;
-use std::fs::File;
-
-let f = try!(File::open("foo.txt"));
-let mut reader = BufReader::new(f);
-let mut buffer = String::new();
-
-// read a line into buffer
-try!(reader.read_line(&mut buffer));
-
-println!("{}", buffer);
- -

BufWriter doesn't add any new ways of writing; it just buffers every call -to write():

- -
-use std::io;
-use std::io::prelude::*;
-use std::io::BufWriter;
-use std::fs::File;
-
-let f = try!(File::create("foo.txt"));
-{
-    let mut writer = BufWriter::new(f);
-
-    // write a byte to the buffer
-    try!(writer.write(&[42]));
-
-} // the buffer is flushed once writer goes out of scope
-
- -

Standard input and output

-

A very common source of input is standard input:

- -
-use std::io;
-
-let mut input = String::new();
-
-try!(io::stdin().read_line(&mut input));
-
-println!("You typed: {}", input.trim());
- -

And a very common source of output is standard output:

- -
-use std::io;
-use std::io::prelude::*;
-
-try!(io::stdout().write(&[42]));
- -

Of course, using io::stdout() directly is less common than something like -println!.

- -

Iterator types

-

A large number of the structures provided by std::io are for various -ways of iterating over I/O. For example, Lines is used to split over -lines:

- -
-use std::io;
-use std::io::prelude::*;
-use std::io::BufReader;
-use std::fs::File;
-
-let f = try!(File::open("foo.txt"));
-let mut reader = BufReader::new(f);
-
-for line in reader.lines() {
-    let line = try!(line);
-    println!("{}", line);
-}
-
- -

Functions

-

There are a number of functions that offer access to various -features. For example, we can use three of these functions to copy everything -from standard input to standard output:

- -
-use std::io;
-
-try!(io::copy(&mut io::stdin(), &mut io::stdout()));
- -

io::Result

-

Last, but certainly not least, is io::Result. This type is used -as the return type of many std::io functions that can cause an error, and -can be returned from your own functions as well. Many of the examples in this -module use the try! macro:

- -
-use std::io;
-
-fn read_input() -> io::Result<()> {
-    let mut input = String::new();
-
-    try!(io::stdin().read_line(&mut input));
-
-    println!("You typed: {}", input.trim());
-
-    Ok(())
-}
- -

The return type of read_input(), io::Result<()>, is a very common type -for functions which don't have a 'real' return value, but do want to return -errors if they happen. In this case, the only purpose of this function is -to read the line and print it, so we use ().

- -

Platform-specific behavior

-

Many I/O functions throughout the standard library are documented to indicate -what various library or syscalls they are delegated to. This is done to help -applications both understand what's happening under the hood as well as investigate -any possibly unclear semantics. Note, however, that this is informative, not a binding -contract. The implementation of many of these functions are subject to change over -time and may call fewer or more syscalls/library functions.

-

Modules

- - - - -
prelude -

The I/O Prelude

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
BufReader -

The BufReader struct adds buffering to any reader.

-
BufWriter -

Wraps a writer and buffers its output.

-
Bytes -

An iterator over u8 values of a reader.

-
Chain -

Adaptor to chain together two readers.

-
Cursor -

A Cursor wraps another type and provides it with a -Seek implementation.

-
Empty -

A reader which is always at EOF.

-
Error -

The error type for I/O operations of the Read, Write, Seek, and -associated traits.

-
IntoInnerError -

An error returned by into_inner which combines an error that -happened while writing out the buffer, and the buffered writer object -which may be used to recover from the condition.

-
LineWriter -

Wraps a writer and buffers output to it, flushing whenever a newline -(0x0a, '\n') is detected.

-
Lines -

An iterator over the lines of an instance of BufRead.

-
Repeat -

A reader which yields one byte over and over and over and over and over and...

-
Sink -

A writer which will move data into the void.

-
Split -

An iterator over the contents of an instance of BufRead split on a -particular byte.

-
Stderr -

A handle to the standard error stream of a process.

-
StderrLock -

A locked reference to the Stderr handle.

-
Stdin -

A handle to the standard input stream of a process.

-
StdinLock -

A locked reference to the Stdin handle.

-
Stdout -

A handle to the global standard output stream of the current process.

-
StdoutLock -

A locked reference to the Stdout handle.

-
Take -

Reader adaptor which limits the bytes read from an underlying reader.

-
Chars - [Unstable]

An iterator over the chars of a reader.

-

Enums

- - - - - - - - - - - - -
ErrorKind -

A list specifying general categories of I/O error.

-
SeekFrom -

Enumeration of possible methods to seek within an I/O object.

-
CharsError - [Unstable]

An enumeration of possible errors that can be generated from the Chars -adapter.

-

Traits

- - - - - - - - - - - - - - - - -
BufRead -

A BufRead is a type of Reader which has an internal buffer, allowing it -to perform extra ways of reading.

-
Read -

The Read trait allows for reading bytes from a source.

-
Seek -

The Seek trait provides a cursor which can be moved within a stream of -bytes.

-
Write -

A trait for objects which are byte-oriented sinks.

-

Functions

- - - - - - - - - - - - - - - - - - - - - - - - - - - - -
copy -

Copies the entire contents of a reader into a writer.

-
empty -

Constructs a new handle to an empty reader.

-
repeat -

Creates an instance of a reader that infinitely repeats one byte.

-
sink -

Creates an instance of a writer which will successfully consume all data.

-
stderr -

Constructs a new handle to the standard error of the current process.

-
stdin -

Constructs a new handle to the standard input of the current process.

-
stdout -

Constructs a new handle to the standard output of the current process.

-

Type Definitions

- - - - -
Result - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/prelude/index.html b/doc/bitflags/__core/io/prelude/index.html deleted file mode 100644 index 894ef8c2..00000000 --- a/doc/bitflags/__core/io/prelude/index.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - - - - - - bitflags::__core::io::prelude - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::io::prelude - - [−] - - [src]

-

The I/O Prelude

- -

The purpose of this module is to alleviate imports of many common I/O traits -by adding a glob import to the top of I/O heavy modules:

- -
-use std::io::prelude::*;
-

Traits

- - - - - - - - - - - - - - - - -
BufRead -

A BufRead is a type of Reader which has an internal buffer, allowing it -to perform extra ways of reading.

-
Read -

The Read trait allows for reading bytes from a source.

-
Seek -

The Seek trait provides a cursor which can be moved within a stream of -bytes.

-
Write -

A trait for objects which are byte-oriented sinks.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/prelude/sidebar-items.js b/doc/bitflags/__core/io/prelude/sidebar-items.js deleted file mode 100644 index d23d5833..00000000 --- a/doc/bitflags/__core/io/prelude/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"trait":[["BufRead","A `BufRead` is a type of `Read`er which has an internal buffer, allowing it to perform extra ways of reading."],["Read","The `Read` trait allows for reading bytes from a source."],["Seek","The `Seek` trait provides a cursor which can be moved within a stream of bytes."],["Write","A trait for objects which are byte-oriented sinks."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/io/prelude/trait.BufRead.html b/doc/bitflags/__core/io/prelude/trait.BufRead.html deleted file mode 100644 index e0381548..00000000 --- a/doc/bitflags/__core/io/prelude/trait.BufRead.html +++ /dev/null @@ -1,343 +0,0 @@ - - - - - - - - - - bitflags::__core::io::prelude::BufRead - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::io::prelude::BufRead - - [−] - - [src]

-
pub trait BufRead: Read {
-    fn fill_buf(&mut self) -> Result<&[u8], Error>;
-    fn consume(&mut self, amt: usize);
-
-    fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error> { ... }
-    fn read_line(&mut self, buf: &mut String) -> Result<usize, Error> { ... }
-    fn split(self, byte: u8) -> Split<Self> { ... }
-    fn lines(self) -> Lines<Self> { ... }
-}

A BufRead is a type of Reader which has an internal buffer, allowing it -to perform extra ways of reading.

- -

For example, reading line-by-line is inefficient without using a buffer, so -if you want to read by line, you'll need BufRead, which includes a -read_line() method as well as a lines() iterator.

- -

Examples

-

A locked standard input implements BufRead:

- -
-use std::io;
-use std::io::prelude::*;
-
-let stdin = io::stdin();
-for line in stdin.lock().lines() {
-    println!("{}", line.unwrap());
-}
- -

If you have something that implements Read, you can use the BufReader -type to turn it into a BufRead.

- -

For example, File implements Read, but not BufRead. -BufReader to the rescue!

- -
-use std::io::{self, BufReader};
-use std::io::prelude::*;
-use std::fs::File;
-
-let f = try!(File::open("foo.txt"));
-let f = BufReader::new(f);
-
-for line in f.lines() {
-    println!("{}", line.unwrap());
-}
-
-
-

Required Methods

-
-

fn fill_buf(&mut self) -> Result<&[u8], Error>

Fills the internal buffer of this object, returning the buffer contents.

- -

This function is a lower-level call. It needs to be paired with the -consume method to function properly. When calling this -method, none of the contents will be "read" in the sense that later -calling read may return the same contents. As such, consume must be -called with the number of bytes that are consumed from this buffer to -ensure that the bytes are never returned twice.

- -

An empty buffer returned indicates that the stream has reached EOF.

- -

Errors

-

This function will return an I/O error if the underlying reader was -read, but returned an error.

- -

Examples

-

A locked standard input implements BufRead:

- -
-use std::io;
-use std::io::prelude::*;
-
-let stdin = io::stdin();
-let mut stdin = stdin.lock();
-
-// we can't have two `&mut` references to `stdin`, so use a block
-// to end the borrow early.
-let length = {
-    let buffer = stdin.fill_buf().unwrap();
-
-    // work with buffer
-    println!("{:?}", buffer);
-
-    buffer.len()
-};
-
-// ensure the bytes we worked with aren't returned again later
-stdin.consume(length);
-

fn consume(&mut self, amt: usize)

Tells this buffer that amt bytes have been consumed from the buffer, -so they should no longer be returned in calls to read.

- -

This function is a lower-level call. It needs to be paired with the -fill_buf method to function properly. This function does -not perform any I/O, it simply informs this object that some amount of -its buffer, returned from fill_buf, has been consumed and should no -longer be returned. As such, this function may do odd things if -fill_buf isn't called before calling it.

- -

The amt must be <= the number of bytes in the buffer returned by -fill_buf.

- -

Examples

-

Since consume() is meant to be used with fill_buf(), -that method's example includes an example of consume().

-
-

Provided Methods

-
-

fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>

Read all bytes into buf until the delimiter byte is reached.

- -

This function will read bytes from the underlying stream until the -delimiter or EOF is found. Once found, all bytes up to, and including, -the delimiter (if found) will be appended to buf.

- -

If this reader is currently at EOF then this function will not modify -buf and will return Ok(n) where n is the number of bytes which -were read.

- -

Errors

-

This function will ignore all instances of ErrorKind::Interrupted and -will otherwise return any errors returned by fill_buf.

- -

If an I/O error is encountered then all bytes read so far will be -present in buf and its length will have been adjusted appropriately.

- -

Examples

-

A locked standard input implements BufRead. In this example, we'll -read from standard input until we see an a byte.

- -
-use std::io;
-use std::io::prelude::*;
-
-fn foo() -> io::Result<()> {
-let stdin = io::stdin();
-let mut stdin = stdin.lock();
-let mut buffer = Vec::new();
-
-try!(stdin.read_until(b'a', &mut buffer));
-
-println!("{:?}", buffer);
-

fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>

Read all bytes until a newline (the 0xA byte) is reached, and append -them to the provided buffer.

- -

This function will read bytes from the underlying stream until the -newline delimiter (the 0xA byte) or EOF is found. Once found, all bytes -up to, and including, the delimiter (if found) will be appended to -buf.

- -

If this reader is currently at EOF then this function will not modify -buf and will return Ok(n) where n is the number of bytes which -were read.

- -

Errors

-

This function has the same error semantics as read_until and will also -return an error if the read bytes are not valid UTF-8. If an I/O error -is encountered then buf may contain some bytes already read in the -event that all data read so far was valid UTF-8.

- -

Examples

-

A locked standard input implements BufRead. In this example, we'll -read all of the lines from standard input. If we were to do this in -an actual project, the lines() method would be easier, of -course.

- -
-use std::io;
-use std::io::prelude::*;
-
-let stdin = io::stdin();
-let mut stdin = stdin.lock();
-let mut buffer = String::new();
-
-while stdin.read_line(&mut buffer).unwrap() > 0 {
-    // work with buffer
-    println!("{:?}", buffer);
-
-    buffer.clear();
-}
-

fn split(self, byte: u8) -> Split<Self>

Returns an iterator over the contents of this reader split on the byte -byte.

- -

The iterator returned from this function will return instances of -io::Result<Vec<u8>>. Each vector returned will not have the -delimiter byte at the end.

- -

This function will yield errors whenever read_until would have also -yielded an error.

- -

Examples

-

A locked standard input implements BufRead. In this example, we'll -read some input from standard input, splitting on commas.

- -
-use std::io;
-use std::io::prelude::*;
-
-let stdin = io::stdin();
-
-for content in stdin.lock().split(b',') {
-    println!("{:?}", content.unwrap());
-}
-

fn lines(self) -> Lines<Self>

Returns an iterator over the lines of this reader.

- -

The iterator returned from this function will yield instances of -io::Result<String>. Each string returned will not have a newline -byte (the 0xA byte) or CRLF (0xD, 0xA bytes) at the end.

- -

Examples

-

A locked standard input implements BufRead:

- -
-use std::io;
-use std::io::prelude::*;
-
-let stdin = io::stdin();
-
-for line in stdin.lock().lines() {
-    println!("{}", line.unwrap());
-}
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/prelude/trait.Read.html b/doc/bitflags/__core/io/prelude/trait.Read.html deleted file mode 100644 index 47274bdf..00000000 --- a/doc/bitflags/__core/io/prelude/trait.Read.html +++ /dev/null @@ -1,447 +0,0 @@ - - - - - - - - - - bitflags::__core::io::prelude::Read - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::io::prelude::Read - - [−] - - [src]

-
pub trait Read {
-    fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>;
-
-    fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error> { ... }
-    fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error> { ... }
-    fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error> { ... }
-    fn by_ref(&mut self) -> &mut Self { ... }
-    fn bytes(self) -> Bytes<Self> { ... }
-    fn chars(self) -> Chars<Self> { ... }
-    fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read { ... }
-    fn take(self, limit: u64) -> Take<Self> { ... }
-}

The Read trait allows for reading bytes from a source.

- -

Implementors of the Read trait are sometimes called 'readers'.

- -

Readers are defined by one required method, read(). Each call to read -will attempt to pull bytes from this source into a provided buffer. A -number of other methods are implemented in terms of read(), giving -implementors a number of ways to read bytes while only needing to implement -a single method.

- -

Readers are intended to be composable with one another. Many implementors -throughout std::io take and provide types which implement the Read -trait.

- -

Please note that each call to read may involve a system call, and -therefore, using something that implements BufRead, such as -BufReader, will be more efficient.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = [0; 10];
-
-// read up to 10 bytes
-try!(f.read(&mut buffer));
-
-let mut buffer = vec![0; 10];
-// read the whole file
-try!(f.read_to_end(&mut buffer));
-
-// read into a String, so that you don't need to do the conversion.
-let mut buffer = String::new();
-try!(f.read_to_string(&mut buffer));
-
-// and more! See the other methods for more details.
-
-

Required Methods

-
-

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

Pull some bytes from this source into the specified buffer, returning -how many bytes were read.

- -

This function does not provide any guarantees about whether it blocks -waiting for data, but if an object needs to block for a read but cannot -it will typically signal this via an Err return value.

- -

If the return value of this method is Ok(n), then it must be -guaranteed that 0 <= n <= buf.len(). A nonzero n value indicates -that the buffer buf has been filled in with n bytes of data from this -source. If n is 0, then it can indicate one of two scenarios:

- -
    -
  1. This reader has reached its "end of file" and will likely no longer -be able to produce bytes. Note that this does not mean that the -reader will always no longer be able to produce bytes.
    2. -
  2. The buffer specified was 0 bytes in length.
    3. -
- -

No guarantees are provided about the contents of buf when this -function is called, implementations cannot rely on any property of the -contents of buf being true. It is recommended that implementations -only write data to buf instead of reading its contents.

- -

Errors

-

If this function encounters any form of I/O or other error, an error -variant will be returned. If an error is returned then it must be -guaranteed that no bytes were read.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = [0; 10];
-
-// read 10 bytes
-try!(f.read(&mut buffer[..]));
-
-

Provided Methods

-
-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

Read all bytes until EOF in this source, placing them into buf.

- -

All bytes read from this source will be appended to the specified buffer -buf. This function will continuously call read to append more data to -buf until read returns either Ok(0) or an error of -non-ErrorKind::Interrupted kind.

- -

If successful, this function will return the total number of bytes read.

- -

Errors

-

If this function encounters an error of the kind -ErrorKind::Interrupted then the error is ignored and the operation -will continue.

- -

If any other read error is encountered then this function immediately -returns. Any bytes which have already been read will be appended to -buf.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = Vec::new();
-
-// read the whole file
-try!(f.read_to_end(&mut buffer));
-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

Read all bytes until EOF in this source, placing them into buf.

- -

If successful, this function returns the number of bytes which were read -and appended to buf.

- -

Errors

-

If the data in this stream is not valid UTF-8 then an error is -returned and buf is unchanged.

- -

See read_to_end() for other error semantics.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = String::new();
-
-try!(f.read_to_string(&mut buffer));
-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

Read the exact number of bytes required to fill buf.

- -

This function reads as many bytes as necessary to completely fill the -specified buffer buf.

- -

No guarantees are provided about the contents of buf when this -function is called, implementations cannot rely on any property of the -contents of buf being true. It is recommended that implementations -only write data to buf instead of reading its contents.

- -

Errors

-

If this function encounters an error of the kind -ErrorKind::Interrupted then the error is ignored and the operation -will continue.

- -

If this function encounters an "end of file" before completely filling -the buffer, it returns an error of the kind ErrorKind::UnexpectedEof. -The contents of buf are unspecified in this case.

- -

If any other read error is encountered then this function immediately -returns. The contents of buf are unspecified in this case.

- -

If this function returns an error, it is unspecified how many bytes it -has read, but it will never read more than would be necessary to -completely fill the buffer.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = [0; 10];
-
-// read exactly 10 bytes
-try!(f.read_exact(&mut buffer));
-

fn by_ref(&mut self) -> &mut Self

Creates a "by reference" adaptor for this instance of Read.

- -

The returned adaptor also implements Read and will simply borrow this -current reader.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::Read;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = Vec::new();
-let mut other_buffer = Vec::new();
-
-{
-    let reference = f.by_ref();
-
-    // read at most 5 bytes
-    try!(reference.take(5).read_to_end(&mut buffer));
-
-} // drop our &mut reference so we can use f again
-
-// original file still usable, read the rest
-try!(f.read_to_end(&mut other_buffer));
-

fn bytes(self) -> Bytes<Self>

Transforms this Read instance to an Iterator over its bytes.

- -

The returned type implements Iterator where the Item is Result<u8, R::Err>. The yielded item is Ok if a byte was successfully read and -Err otherwise for I/O errors. EOF is mapped to returning None from -this iterator.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-
-for byte in f.bytes() {
-    println!("{}", byte.unwrap());
-}
-

fn chars(self) -> Chars<Self>

Unstable (io)

: the semantics of a partial read/write of where errors happen is currently unclear and may change

-

Transforms this Read instance to an Iterator over chars.

- -

This adaptor will attempt to interpret this reader as a UTF-8 encoded -sequence of characters. The returned iterator will return None once -EOF is reached for this reader. Otherwise each element yielded will be a -Result<char, E> where E may contain information about what I/O error -occurred or where decoding failed.

- -

Currently this adaptor will discard intermediate data read, and should -be avoided if this is not desired.

- -

Examples

-

Files implement Read:

- -
-#![feature(io)]
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-
-for c in f.chars() {
-    println!("{}", c.unwrap());
-}
-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

Creates an adaptor which will chain this stream with another.

- -

The returned Read instance will first read all bytes from this object -until EOF is encountered. Afterwards the output is equivalent to the -output of next.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f1 = try!(File::open("foo.txt"));
-let mut f2 = try!(File::open("bar.txt"));
-
-let mut handle = f1.chain(f2);
-let mut buffer = String::new();
-
-// read the value into a String. We could use any Read method here,
-// this is just one example.
-try!(handle.read_to_string(&mut buffer));
-

fn take(self, limit: u64) -> Take<Self>

Creates an adaptor which will read at most limit bytes from it.

- -

This function returns a new instance of Read which will read at most -limit bytes, after which it will always return EOF (Ok(0)). Any -read errors will not count towards the number of bytes read and future -calls to read may succeed.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = [0; 5];
-
-// read at most five bytes
-let mut handle = f.take(5);
-
-try!(handle.read(&mut buffer));
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/prelude/trait.Seek.html b/doc/bitflags/__core/io/prelude/trait.Seek.html deleted file mode 100644 index 18ac3e82..00000000 --- a/doc/bitflags/__core/io/prelude/trait.Seek.html +++ /dev/null @@ -1,159 +0,0 @@ - - - - - - - - - - bitflags::__core::io::prelude::Seek - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::io::prelude::Seek - - [−] - - [src]

-
pub trait Seek {
-    fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>;
-}

The Seek trait provides a cursor which can be moved within a stream of -bytes.

- -

The stream typically has a fixed size, allowing seeking relative to either -end or the current offset.

- -

Examples

-

Files implement Seek:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-use std::io::SeekFrom;
-
-let mut f = try!(File::open("foo.txt"));
-
-// move the cursor 42 bytes from the start of the file
-try!(f.seek(SeekFrom::Start(42)));
-
-

Required Methods

-
-

fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>

Seek to an offset, in bytes, in a stream.

- -

A seek beyond the end of a stream is allowed, but implementation -defined.

- -

If the seek operation completed successfully, -this method returns the new position from the start of the stream. -That position can be used later with SeekFrom::Start.

- -

Errors

-

Seeking to a negative offset is considered an error.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/prelude/trait.Write.html b/doc/bitflags/__core/io/prelude/trait.Write.html deleted file mode 100644 index ec013f1d..00000000 --- a/doc/bitflags/__core/io/prelude/trait.Write.html +++ /dev/null @@ -1,287 +0,0 @@ - - - - - - - - - - bitflags::__core::io::prelude::Write - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::io::prelude::Write - - [−] - - [src]

-
pub trait Write {
-    fn write(&mut self, buf: &[u8]) -> Result<usize, Error>;
-    fn flush(&mut self) -> Result<(), Error>;
-
-    fn write_all(&mut self, buf: &[u8]) -> Result<(), Error> { ... }
-    fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error> { ... }
-    fn by_ref(&mut self) -> &mut Self { ... }
-}

A trait for objects which are byte-oriented sinks.

- -

Implementors of the Write trait are sometimes called 'writers'.

- -

Writers are defined by two required methods, write() and flush():

- -
    -

  • The write() method will attempt to write some data into the object, -returning how many bytes were successfully written.

    • -

  • The flush() method is useful for adaptors and explicit buffers -themselves for ensuring that all buffered data has been pushed out to the -'true sink'.

    • -
- -

Writers are intended to be composable with one another. Many implementors -throughout std::io take and provide types which implement the Write -trait.

- -

Examples

-
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut buffer = try!(File::create("foo.txt"));
-
-try!(buffer.write(b"some bytes"));
-
-

Required Methods

-
-

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

Write a buffer into this object, returning how many bytes were written.

- -

This function will attempt to write the entire contents of buf, but -the entire write may not succeed, or the write may also generate an -error. A call to write represents at most one attempt to write to -any wrapped object.

- -

Calls to write are not guaranteed to block waiting for data to be -written, and a write which would otherwise block can be indicated through -an Err variant.

- -

If the return value is Ok(n) then it must be guaranteed that -0 <= n <= buf.len(). A return value of 0 typically means that the -underlying object is no longer able to accept bytes and will likely not -be able to in the future as well, or that the buffer provided is empty.

- -

Errors

-

Each call to write may generate an I/O error indicating that the -operation could not be completed. If an error is returned then no bytes -in the buffer were written to this writer.

- -

It is not considered an error if the entire buffer could not be -written to this writer.

- -

Examples

-
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut buffer = try!(File::create("foo.txt"));
-
-try!(buffer.write(b"some bytes"));
-

fn flush(&mut self) -> Result<(), Error>

Flush this output stream, ensuring that all intermediately buffered -contents reach their destination.

- -

Errors

-

It is considered an error if not all bytes could be written due to -I/O errors or EOF being reached.

- -

Examples

-
-use std::io::prelude::*;
-use std::io::BufWriter;
-use std::fs::File;
-
-let mut buffer = BufWriter::new(try!(File::create("foo.txt")));
-
-try!(buffer.write(b"some bytes"));
-try!(buffer.flush());
-
-

Provided Methods

-
-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

Attempts to write an entire buffer into this write.

- -

This method will continuously call write while there is more data to -write. This method will not return until the entire buffer has been -successfully written or an error occurs. The first error generated from -this method will be returned.

- -

Errors

-

This function will return the first error that write returns.

- -

Examples

-
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut buffer = try!(File::create("foo.txt"));
-
-try!(buffer.write_all(b"some bytes"));
-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

Writes a formatted string into this writer, returning any error -encountered.

- -

This method is primarily used to interface with the -format_args! macro, but it is rare that this should -explicitly be called. The write! macro should be favored to -invoke this method instead.

- -

This function internally uses the write_all method on -this trait and hence will continuously write data so long as no errors -are received. This also means that partial writes are not indicated in -this signature.

- -

Errors

-

This function will return any I/O error reported while formatting.

- -

Examples

-
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut buffer = try!(File::create("foo.txt"));
-
-// this call
-try!(write!(buffer, "{:.*}", 2, 1.234567));
-// turns into this:
-try!(buffer.write_fmt(format_args!("{:.*}", 2, 1.234567)));
-

fn by_ref(&mut self) -> &mut Self

Creates a "by reference" adaptor for this instance of Write.

- -

The returned adaptor also implements Write and will simply borrow this -current writer.

- -

Examples

-
-use std::io::Write;
-use std::fs::File;
-
-let mut buffer = try!(File::create("foo.txt"));
-
-let reference = buffer.by_ref();
-
-// we can use reference just like our original buffer
-try!(reference.write_all(b"some bytes"));
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/sidebar-items.js b/doc/bitflags/__core/io/sidebar-items.js deleted file mode 100644 index 9e7e28fe..00000000 --- a/doc/bitflags/__core/io/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["CharsError","An enumeration of possible errors that can be generated from the `Chars` adapter."],["ErrorKind","A list specifying general categories of I/O error."],["SeekFrom","Enumeration of possible methods to seek within an I/O object."]],"fn":[["copy","Copies the entire contents of a reader into a writer."],["empty","Constructs a new handle to an empty reader."],["repeat","Creates an instance of a reader that infinitely repeats one byte."],["sink","Creates an instance of a writer which will successfully consume all data."],["stderr","Constructs a new handle to the standard error of the current process."],["stdin","Constructs a new handle to the standard input of the current process."],["stdout","Constructs a new handle to the standard output of the current process."]],"mod":[["prelude","The I/O Prelude"]],"struct":[["BufReader","The `BufReader` struct adds buffering to any reader."],["BufWriter","Wraps a writer and buffers its output."],["Bytes","An iterator over `u8` values of a reader."],["Chain","Adaptor to chain together two readers."],["Chars","An iterator over the `char`s of a reader."],["Cursor","A `Cursor` wraps another type and provides it with a `Seek` implementation."],["Empty","A reader which is always at EOF."],["Error","The error type for I/O operations of the `Read`, `Write`, `Seek`, and associated traits."],["IntoInnerError","An error returned by `into_inner` which combines an error that happened while writing out the buffer, and the buffered writer object which may be used to recover from the condition."],["LineWriter","Wraps a writer and buffers output to it, flushing whenever a newline (`0x0a`, `'\\n'`) is detected."],["Lines","An iterator over the lines of an instance of `BufRead`."],["Repeat","A reader which yields one byte over and over and over and over and over and..."],["Sink","A writer which will move data into the void."],["Split","An iterator over the contents of an instance of `BufRead` split on a particular byte."],["Stderr","A handle to the standard error stream of a process."],["StderrLock","A locked reference to the `Stderr` handle."],["Stdin","A handle to the standard input stream of a process."],["StdinLock","A locked reference to the `Stdin` handle."],["Stdout","A handle to the global standard output stream of the current process."],["StdoutLock","A locked reference to the `Stdout` handle."],["Take","Reader adaptor which limits the bytes read from an underlying reader."]],"trait":[["BufRead","A `BufRead` is a type of `Read`er which has an internal buffer, allowing it to perform extra ways of reading."],["Read","The `Read` trait allows for reading bytes from a source."],["Seek","The `Seek` trait provides a cursor which can be moved within a stream of bytes."],["Write","A trait for objects which are byte-oriented sinks."]],"type":[["Result",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.BufReader.html b/doc/bitflags/__core/io/struct.BufReader.html deleted file mode 100644 index 918a5fcc..00000000 --- a/doc/bitflags/__core/io/struct.BufReader.html +++ /dev/null @@ -1,232 +0,0 @@ - - - - - - - - - - bitflags::__core::io::BufReader - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::BufReader - - [−] - - [src]

-
pub struct BufReader<R> {
-    // some fields omitted
-}
1.0.0

The BufReader struct adds buffering to any reader.

- -

It can be excessively inefficient to work directly with a Read instance. -For example, every call to read on TcpStream results in a system call. -A BufReader performs large, infrequent reads on the underlying Read -and maintains an in-memory buffer of the results.

- -

Examples

-
-use std::io::prelude::*;
-use std::io::BufReader;
-use std::fs::File;
-
-let mut f = try!(File::open("log.txt"));
-let mut reader = BufReader::new(f);
-
-let mut line = String::new();
-let len = try!(reader.read_line(&mut line));
-println!("First line is {} bytes long", len);
-

Methods

impl<R> BufReader<R> where R: Read

fn new(inner: R) -> BufReader<R>

-

Creates a new BufReader with a default buffer capacity.

- -

Examples

-
-use std::io::BufReader;
-use std::fs::File;
-
-let mut f = try!(File::open("log.txt"));
-let mut reader = BufReader::new(f);
-

fn with_capacity(cap: usize, inner: R) -> BufReader<R>

-

Creates a new BufReader with the specified buffer capacity.

- -

Examples

-

Creating a buffer with ten bytes of capacity:

- -
-use std::io::BufReader;
-use std::fs::File;
-
-let mut f = try!(File::open("log.txt"));
-let mut reader = BufReader::with_capacity(10, f);
-

fn get_ref(&self) -> &R

-

Gets a reference to the underlying reader.

- -

It is inadvisable to directly read from the underlying reader.

- -

Examples

-
-use std::io::BufReader;
-use std::fs::File;
-
-let mut f1 = try!(File::open("log.txt"));
-let mut reader = BufReader::new(f1);
-
-let f2 = reader.get_ref();
-

fn get_mut(&mut self) -> &mut R

-

Gets a mutable reference to the underlying reader.

- -

It is inadvisable to directly read from the underlying reader.

- -

Examples

-
-use std::io::BufReader;
-use std::fs::File;
-
-let mut f1 = try!(File::open("log.txt"));
-let mut reader = BufReader::new(f1);
-
-let f2 = reader.get_mut();
-

fn into_inner(self) -> R

-

Unwraps this BufReader, returning the underlying reader.

- -

Note that any leftover data in the internal buffer is lost.

- -

Examples

-
-use std::io::BufReader;
-use std::fs::File;
-
-let mut f1 = try!(File::open("log.txt"));
-let mut reader = BufReader::new(f1);
-
-let f2 = reader.into_inner();
-

Trait Implementations

impl<R> Read for BufReader<R> where R: Read

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-

impl<R> BufRead for BufReader<R> where R: Read

fn fill_buf(&mut self) -> Result<&[u8], Error>

-

fn consume(&mut self, amt: usize)

-

fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn split(self, byte: u8) -> Split<Self>

-

fn lines(self) -> Lines<Self>

-

impl<R> Debug for BufReader<R> where R: Debug

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl<R> Seek for BufReader<R> where R: Seek

fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>

-

Seek to an offset, in bytes, in the underlying reader.

- -

The position used for seeking with SeekFrom::Current(_) is the -position the underlying reader would be at if the BufReader had no -internal buffer.

- -

Seeking always discards the internal buffer, even if the seek position -would otherwise fall within it. This guarantees that calling -.unwrap() immediately after a seek yields the underlying reader at -the same position.

- -

See std::io::Seek for more details.

- -

Note: In the edge case where you're seeking with SeekFrom::Current(n) -where n minus the internal buffer length underflows an i64, two -seeks will be performed instead of one. If the second seek returns -Err, the underlying reader will be left at the same position it would -have if you seeked to SeekFrom::Current(0).

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.BufWriter.html b/doc/bitflags/__core/io/struct.BufWriter.html deleted file mode 100644 index cac3697d..00000000 --- a/doc/bitflags/__core/io/struct.BufWriter.html +++ /dev/null @@ -1,226 +0,0 @@ - - - - - - - - - - bitflags::__core::io::BufWriter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::BufWriter - - [−] - - [src]

-
pub struct BufWriter<W> where W: Write {
-    // some fields omitted
-}
1.0.0

Wraps a writer and buffers its output.

- -

It can be excessively inefficient to work directly with something that -implements Write. For example, every call to write on TcpStream -results in a system call. A BufWriter keeps an in-memory buffer of data -and writes it to an underlying writer in large, infrequent batches.

- -

The buffer will be written out when the writer is dropped.

- -

Examples

-

Let's write the numbers one through ten to a TcpStream:

- -
-use std::io::prelude::*;
-use std::net::TcpStream;
-
-let mut stream = TcpStream::connect("127.0.0.1:34254").unwrap();
-
-for i in 1..10 {
-    stream.write(&[i]).unwrap();
-}
- -

Because we're not buffering, we write each one in turn, incurring the -overhead of a system call per byte written. We can fix this with a -BufWriter:

- -
-use std::io::prelude::*;
-use std::io::BufWriter;
-use std::net::TcpStream;
-
-let mut stream = BufWriter::new(TcpStream::connect("127.0.0.1:34254").unwrap());
-
-for i in 1..10 {
-    stream.write(&[i]).unwrap();
-}
- -

By wrapping the stream with a BufWriter, these ten writes are all grouped -together by the buffer, and will all be written out in one system call when -the stream is dropped.

-

Methods

impl<W> BufWriter<W> where W: Write

fn new(inner: W) -> BufWriter<W>

-

Creates a new BufWriter with a default buffer capacity.

- -

Examples

-
-use std::io::BufWriter;
-use std::net::TcpStream;
-
-let mut buffer = BufWriter::new(TcpStream::connect("127.0.0.1:34254").unwrap());
-

fn with_capacity(cap: usize, inner: W) -> BufWriter<W>

-

Creates a new BufWriter with the specified buffer capacity.

- -

Examples

-

Creating a buffer with a buffer of a hundred bytes.

- -
-use std::io::BufWriter;
-use std::net::TcpStream;
-
-let stream = TcpStream::connect("127.0.0.1:34254").unwrap();
-let mut buffer = BufWriter::with_capacity(100, stream);
-

fn get_ref(&self) -> &W

-

Gets a reference to the underlying writer.

- -

Examples

-
-use std::io::BufWriter;
-use std::net::TcpStream;
-
-let mut buffer = BufWriter::new(TcpStream::connect("127.0.0.1:34254").unwrap());
-
-// we can use reference just like buffer
-let reference = buffer.get_ref();
-

fn get_mut(&mut self) -> &mut W

-

Gets a mutable reference to the underlying writer.

- -

It is inadvisable to directly write to the underlying writer.

- -

Examples

-
-use std::io::BufWriter;
-use std::net::TcpStream;
-
-let mut buffer = BufWriter::new(TcpStream::connect("127.0.0.1:34254").unwrap());
-
-// we can use reference just like buffer
-let reference = buffer.get_mut();
-

fn into_inner(self) -> Result<W, IntoInnerError<BufWriter<W>>>

-

Unwraps this BufWriter, returning the underlying writer.

- -

The buffer is written out before returning the writer.

- -

Examples

-
-use std::io::BufWriter;
-use std::net::TcpStream;
-
-let mut buffer = BufWriter::new(TcpStream::connect("127.0.0.1:34254").unwrap());
-
-// unwrap the TcpStream and flush the buffer
-let stream = buffer.into_inner().unwrap();
-

Trait Implementations

impl<W> Write for BufWriter<W> where W: Write

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

impl<W> Debug for BufWriter<W> where W: Write + Debug

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl<W> Seek for BufWriter<W> where W: Write + Seek

fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>

-

Seek to the offset, in bytes, in the underlying writer.

- -

Seeking always writes out the internal buffer before seeking.

-

impl<W> Drop for BufWriter<W> where W: Write

fn drop(&mut self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.Bytes.html b/doc/bitflags/__core/io/struct.Bytes.html deleted file mode 100644 index d2c71614..00000000 --- a/doc/bitflags/__core/io/struct.Bytes.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Bytes - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::Bytes - - [−] - - [src]

-
pub struct Bytes<R> {
-    // some fields omitted
-}
1.0.0

An iterator over u8 values of a reader.

- -

This struct is generally created by calling bytes() on a reader. -Please see the documentation of bytes() for more details.

-

Trait Implementations

impl<R> Iterator for Bytes<R> where R: Read

type Item = Result<u8, Error>

-

fn next(&mut self) -> Option<Result<u8, Error>>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.Chain.html b/doc/bitflags/__core/io/struct.Chain.html deleted file mode 100644 index d8039334..00000000 --- a/doc/bitflags/__core/io/struct.Chain.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Chain - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::Chain - - [−] - - [src]

-
pub struct Chain<T, U> {
-    // some fields omitted
-}
1.0.0

Adaptor to chain together two readers.

- -

This struct is generally created by calling chain() on a reader. -Please see the documentation of chain() for more details.

-

Trait Implementations

impl<T, U> Read for Chain<T, U> where U: Read, T: Read

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-

impl<T, U> BufRead for Chain<T, U> where U: BufRead, T: BufRead1.9.0

fn fill_buf(&mut self) -> Result<&[u8], Error>

-

fn consume(&mut self, amt: usize)

-

fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn split(self, byte: u8) -> Split<Self>

-

fn lines(self) -> Lines<Self>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.Chars.html b/doc/bitflags/__core/io/struct.Chars.html deleted file mode 100644 index 8363a763..00000000 --- a/doc/bitflags/__core/io/struct.Chars.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Chars - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::Chars - - [−] - - [src]

-
pub struct Chars<R> {
-    // some fields omitted
-}
Unstable (io)

: awaiting stability of Read::chars

-

An iterator over the chars of a reader.

- -

This struct is generally created by calling chars() on a reader. -Please see the documentation of chars() for more details.

-

Trait Implementations

impl<R> Iterator for Chars<R> where R: Read

type Item = Result<char, CharsError>

-
Unstable (io)

: awaiting stability of Read::chars

-

fn next(&mut self) -> Option<Result<char, CharsError>>

-
Unstable (io)

: awaiting stability of Read::chars

-

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.Cursor.html b/doc/bitflags/__core/io/struct.Cursor.html deleted file mode 100644 index 83305a75..00000000 --- a/doc/bitflags/__core/io/struct.Cursor.html +++ /dev/null @@ -1,275 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Cursor - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::Cursor - - [−] - - [src]

-
pub struct Cursor<T> {
-    // some fields omitted
-}
1.0.0

A Cursor wraps another type and provides it with a -Seek implementation.

- -

Cursors are typically used with in-memory buffers to allow them to -implement Read and/or Write, allowing these buffers to be used -anywhere you might use a reader or writer that does actual I/O.

- -

The standard library implements some I/O traits on various types which -are commonly used as a buffer, like Cursor<Vec<u8>> and Cursor<&[u8]>.

- -

Examples

-

We may want to write bytes to a File in our production -code, but use an in-memory buffer in our tests. We can do this with -Cursor:

- -
-use std::io::prelude::*;
-use std::io::{self, SeekFrom};
-use std::fs::File;
-
-// a library function we've written
-fn write_ten_bytes_at_end<W: Write + Seek>(writer: &mut W) -> io::Result<()> {
-    try!(writer.seek(SeekFrom::End(-10)));
-
-    for i in 0..10 {
-        try!(writer.write(&[i]));
-    }
-
-    // all went well
-    Ok(())
-}
-
-// Here's some code that uses this library function.
-//
-// We might want to use a BufReader here for efficiency, but let's
-// keep this example focused.
-let mut file = try!(File::create("foo.txt"));
-
-try!(write_ten_bytes_at_end(&mut file));
-
-// now let's write a test
-#[test]
-fn test_writes_bytes() {
-    // setting up a real File is much more slow than an in-memory buffer,
-    // let's use a cursor instead
-    use std::io::Cursor;
-    let mut buff = Cursor::new(vec![0; 15]);
-
-    write_ten_bytes_at_end(&mut buff).unwrap();
-
-    assert_eq!(&buff.get_ref()[5..15], &[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]);
-}
-

Methods

impl<T> Cursor<T>

fn new(inner: T) -> Cursor<T>

-

Creates a new cursor wrapping the provided underlying I/O object.

- -

Examples

-
-use std::io::Cursor;
-
-let buff = Cursor::new(Vec::new());
-

fn into_inner(self) -> T

-

Consumes this cursor, returning the underlying value.

- -

Examples

-
-use std::io::Cursor;
-
-let buff = Cursor::new(Vec::new());
-
-let vec = buff.into_inner();
-

fn get_ref(&self) -> &T

-

Gets a reference to the underlying value in this cursor.

- -

Examples

-
-use std::io::Cursor;
-
-let buff = Cursor::new(Vec::new());
-
-let reference = buff.get_ref();
-

fn get_mut(&mut self) -> &mut T

-

Gets a mutable reference to the underlying value in this cursor.

- -

Care should be taken to avoid modifying the internal I/O state of the -underlying value as it may corrupt this cursor's position.

- -

Examples

-
-use std::io::Cursor;
-
-let mut buff = Cursor::new(Vec::new());
-
-let reference = buff.get_mut();
-

fn position(&self) -> u64

-

Returns the current position of this cursor.

- -

Examples

-
-use std::io::Cursor;
-use std::io::prelude::*;
-use std::io::SeekFrom;
-
-let mut buff = Cursor::new(vec![1, 2, 3, 4, 5]);
-
-assert_eq!(buff.position(), 0);
-
-buff.seek(SeekFrom::Current(2)).unwrap();
-assert_eq!(buff.position(), 2);
-
-buff.seek(SeekFrom::Current(-1)).unwrap();
-assert_eq!(buff.position(), 1);
-

fn set_position(&mut self, pos: u64)

-

Sets the position of this cursor.

- -

Examples

-
-use std::io::Cursor;
-
-let mut buff = Cursor::new(vec![1, 2, 3, 4, 5]);
-
-assert_eq!(buff.position(), 0);
-
-buff.set_position(2);
-assert_eq!(buff.position(), 2);
-
-buff.set_position(4);
-assert_eq!(buff.position(), 4);
-

Trait Implementations

impl<T> Seek for Cursor<T> where T: AsRef<[u8]>

fn seek(&mut self, style: SeekFrom) -> Result<u64, Error>

-

impl<T> Read for Cursor<T> where T: AsRef<[u8]>

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-

impl<T> BufRead for Cursor<T> where T: AsRef<[u8]>

fn fill_buf(&mut self) -> Result<&[u8], Error>

-

fn consume(&mut self, amt: usize)

-

fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn split(self, byte: u8) -> Split<Self>

-

fn lines(self) -> Lines<Self>

-

impl<'a> Write for Cursor<&'a mut [u8]>

fn write(&mut self, data: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

impl Write for Cursor<Vec<u8>>

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

impl Write for Cursor<Box<[u8]>>1.5.0

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

Derived Implementations

impl<T> Debug for Cursor<T> where T: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<T> Clone for Cursor<T> where T: Clone

fn clone(&self) -> Cursor<T>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.Empty.html b/doc/bitflags/__core/io/struct.Empty.html deleted file mode 100644 index 318b8296..00000000 --- a/doc/bitflags/__core/io/struct.Empty.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Empty - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::Empty - - [−] - - [src]

-
pub struct Empty {
-    // some fields omitted
-}
1.0.0

A reader which is always at EOF.

- -

This struct is generally created by calling empty(). Please see -the documentation of empty() for more details.

-

Trait Implementations

impl Read for Empty

fn read(&mut self, _buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-

impl BufRead for Empty

fn fill_buf(&mut self) -> Result<&[u8], Error>

-

fn consume(&mut self, _n: usize)

-

fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn split(self, byte: u8) -> Split<Self>

-

fn lines(self) -> Lines<Self>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.Error.html b/doc/bitflags/__core/io/struct.Error.html deleted file mode 100644 index f32cd513..00000000 --- a/doc/bitflags/__core/io/struct.Error.html +++ /dev/null @@ -1,175 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Error - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::Error - - [−] - - [src]

-
pub struct Error {
-    // some fields omitted
-}
1.0.0

The error type for I/O operations of the Read, Write, Seek, and -associated traits.

- -

Errors mostly originate from the underlying OS, but custom instances of -Error can be created with crafted error messages and a particular value of -ErrorKind.

-

Methods

impl Error

fn new<E>(kind: ErrorKind, error: E) -> Error where E: Into<Box<Error + 'static + Send + Sync>>

-

Creates a new I/O error from a known kind of error as well as an -arbitrary error payload.

- -

This function is used to generically create I/O errors which do not -originate from the OS itself. The error argument is an arbitrary -payload which will be contained in this Error.

- -

Examples

-
-use std::io::{Error, ErrorKind};
-
-// errors can be created from strings
-let custom_error = Error::new(ErrorKind::Other, "oh no!");
-
-// errors can also be created from other errors
-let custom_error2 = Error::new(ErrorKind::Interrupted, custom_error);
-

fn last_os_error() -> Error

-

Returns an error representing the last OS error which occurred.

- -

This function reads the value of errno for the target platform (e.g. -GetLastError on Windows) and will return a corresponding instance of -Error for the error code.

-

fn from_raw_os_error(code: i32) -> Error

-

Creates a new instance of an Error from a particular OS error code.

-

fn raw_os_error(&self) -> Option<i32>

-

Returns the OS error that this error represents (if any).

- -

If this Error was constructed via last_os_error or -from_raw_os_error, then this function will return Some, otherwise -it will return None.

-

fn get_ref(&self) -> Option<&Error + 'static + Send + Sync>1.3.0

-

Returns a reference to the inner error wrapped by this error (if any).

- -

If this Error was constructed via new then this function will -return Some, otherwise it will return None.

-

fn get_mut(&mut self) -> Option<&mut Error + 'static + Send + Sync>1.3.0

-

Returns a mutable reference to the inner error wrapped by this error -(if any).

- -

If this Error was constructed via new then this function will -return Some, otherwise it will return None.

-

fn into_inner(self) -> Option<Box<Error + 'static + Send + Sync>>1.3.0

-

Consumes the Error, returning its inner error (if any).

- -

If this Error was constructed via new then this function will -return Some, otherwise it will return None.

-

fn kind(&self) -> ErrorKind

-

Returns the corresponding ErrorKind for this error.

-

Trait Implementations

impl From<NulError> for Error

fn from(NulError) -> Error

-

impl<W> From<IntoInnerError<W>> for Error

fn from(iie: IntoInnerError<W>) -> Error

-

impl Display for Error

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl Error for Error

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

Derived Implementations

impl Debug for Error

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.IntoInnerError.html b/doc/bitflags/__core/io/struct.IntoInnerError.html deleted file mode 100644 index 012e0ecf..00000000 --- a/doc/bitflags/__core/io/struct.IntoInnerError.html +++ /dev/null @@ -1,194 +0,0 @@ - - - - - - - - - - bitflags::__core::io::IntoInnerError - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::IntoInnerError - - [−] - - [src]

-
pub struct IntoInnerError<W>(_, _);
1.0.0

An error returned by into_inner which combines an error that -happened while writing out the buffer, and the buffered writer object -which may be used to recover from the condition.

- -

Examples

-
-use std::io::BufWriter;
-use std::net::TcpStream;
-
-let mut stream = BufWriter::new(TcpStream::connect("127.0.0.1:34254").unwrap());
-
-// do stuff with the stream
-
-// we want to get our `TcpStream` back, so let's try:
-
-let stream = match stream.into_inner() {
-    Ok(s) => s,
-    Err(e) => {
-        // Here, e is an IntoInnerError
-        panic!("An error occurred");
-    }
-};
-

Methods

impl<W> IntoInnerError<W>

fn error(&self) -> &Error

-

Returns the error which caused the call to into_inner() to fail.

- -

This error was returned when attempting to write the internal buffer.

- -

Examples

-
-use std::io::BufWriter;
-use std::net::TcpStream;
-
-let mut stream = BufWriter::new(TcpStream::connect("127.0.0.1:34254").unwrap());
-
-// do stuff with the stream
-
-// we want to get our `TcpStream` back, so let's try:
-
-let stream = match stream.into_inner() {
-    Ok(s) => s,
-    Err(e) => {
-        // Here, e is an IntoInnerError, let's log the inner error.
-        //
-        // We'll just 'log' to stdout for this example.
-        println!("{}", e.error());
-
-        panic!("An unexpected error occurred.");
-    }
-};
-

fn into_inner(self) -> W

-

Returns the buffered writer instance which generated the error.

- -

The returned object can be used for error recovery, such as -re-inspecting the buffer.

- -

Examples

-
-use std::io::BufWriter;
-use std::net::TcpStream;
-
-let mut stream = BufWriter::new(TcpStream::connect("127.0.0.1:34254").unwrap());
-
-// do stuff with the stream
-
-// we want to get our `TcpStream` back, so let's try:
-
-let stream = match stream.into_inner() {
-    Ok(s) => s,
-    Err(e) => {
-        // Here, e is an IntoInnerError, let's re-examine the buffer:
-        let buffer = e.into_inner();
-
-        // do stuff to try to recover
-
-        // afterwards, let's just return the stream
-        buffer.into_inner().unwrap()
-    }
-};
-

Trait Implementations

impl<W> Error for IntoInnerError<W> where W: Send + Reflect + Debug

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

impl<W> Display for IntoInnerError<W>

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl<W> Debug for IntoInnerError<W> where W: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.LineWriter.html b/doc/bitflags/__core/io/struct.LineWriter.html deleted file mode 100644 index 41f83927..00000000 --- a/doc/bitflags/__core/io/struct.LineWriter.html +++ /dev/null @@ -1,225 +0,0 @@ - - - - - - - - - - bitflags::__core::io::LineWriter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::LineWriter - - [−] - - [src]

-
pub struct LineWriter<W> where W: Write {
-    // some fields omitted
-}
1.0.0

Wraps a writer and buffers output to it, flushing whenever a newline -(0x0a, '\n') is detected.

- -

The BufWriter struct wraps a writer and buffers its output. -But it only does this batched write when it goes out of scope, or when the -internal buffer is full. Sometimes, you'd prefer to write each line as it's -completed, rather than the entire buffer at once. Enter LineWriter. It -does exactly that.

- -

If there's still a partial line in the buffer when the LineWriter is -dropped, it will flush those contents.

- -

Examples

-

We can use LineWriter to write one line at a time, significantly -reducing the number of actual writes to the file.

- -
-use std::fs::File;
-use std::io::prelude::*;
-use std::io::LineWriter;
-
-let road_not_taken = b"I shall be telling this with a sigh
-Somewhere ages and ages hence:
-Two roads diverged in a wood, and I -
-I took the one less traveled by,
-And that has made all the difference.";
-
-let file = try!(File::create("poem.txt"));
-let mut file = LineWriter::new(file);
-
-for &byte in road_not_taken.iter() {
-   file.write(&[byte]).unwrap();
-}
-
-// let's check we did the right thing.
-let mut file = try!(File::open("poem.txt"));
-let mut contents = String::new();
-
-try!(file.read_to_string(&mut contents));
-
-assert_eq!(contents.as_bytes(), &road_not_taken[..]);
-

Methods

impl<W> LineWriter<W> where W: Write

fn new(inner: W) -> LineWriter<W>

-

Creates a new LineWriter.

- -

Examples

-
-use std::fs::File;
-use std::io::LineWriter;
-
-let file = try!(File::create("poem.txt"));
-let file = LineWriter::new(file);
-

fn with_capacity(cap: usize, inner: W) -> LineWriter<W>

-

Creates a new LineWriter with a specified capacity for the internal -buffer.

- -

Examples

-
-use std::fs::File;
-use std::io::LineWriter;
-
-let file = try!(File::create("poem.txt"));
-let file = LineWriter::with_capacity(100, file);
-

fn get_ref(&self) -> &W

-

Gets a reference to the underlying writer.

- -

Examples

-
-use std::fs::File;
-use std::io::LineWriter;
-
-let file = try!(File::create("poem.txt"));
-let file = LineWriter::new(file);
-
-let reference = file.get_ref();
-

fn get_mut(&mut self) -> &mut W

-

Gets a mutable reference to the underlying writer.

- -

Caution must be taken when calling methods on the mutable reference -returned as extra writes could corrupt the output stream.

- -

Examples

-
-use std::fs::File;
-use std::io::LineWriter;
-
-let file = try!(File::create("poem.txt"));
-let mut file = LineWriter::new(file);
-
-// we can use reference just like file
-let reference = file.get_mut();
-

fn into_inner(self) -> Result<W, IntoInnerError<LineWriter<W>>>

-

Unwraps this LineWriter, returning the underlying writer.

- -

The internal buffer is written out before returning the writer.

- -

Examples

-
-use std::fs::File;
-use std::io::LineWriter;
-
-let file = try!(File::create("poem.txt"));
-
-let writer: LineWriter<File> = LineWriter::new(file);
-
-let file: File = try!(writer.into_inner());
-

Trait Implementations

impl<W> Write for LineWriter<W> where W: Write

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

impl<W> Debug for LineWriter<W> where W: Write + Debug

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.Lines.html b/doc/bitflags/__core/io/struct.Lines.html deleted file mode 100644 index 9e50b03a..00000000 --- a/doc/bitflags/__core/io/struct.Lines.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Lines - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::Lines - - [−] - - [src]

-
pub struct Lines<B> {
-    // some fields omitted
-}
1.0.0

An iterator over the lines of an instance of BufRead.

- -

This struct is generally created by calling lines() on a -BufRead. Please see the documentation of lines() for more details.

-

Trait Implementations

impl<B> Iterator for Lines<B> where B: BufRead

type Item = Result<String, Error>

-

fn next(&mut self) -> Option<Result<String, Error>>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.Repeat.html b/doc/bitflags/__core/io/struct.Repeat.html deleted file mode 100644 index 2b6e2d3e..00000000 --- a/doc/bitflags/__core/io/struct.Repeat.html +++ /dev/null @@ -1,127 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Repeat - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::Repeat - - [−] - - [src]

-
pub struct Repeat {
-    // some fields omitted
-}
1.0.0

A reader which yields one byte over and over and over and over and over and...

- -

This struct is generally created by calling repeat(). Please -see the documentation of repeat() for more details.

-

Trait Implementations

impl Read for Repeat

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.Sink.html b/doc/bitflags/__core/io/struct.Sink.html deleted file mode 100644 index 40e161b5..00000000 --- a/doc/bitflags/__core/io/struct.Sink.html +++ /dev/null @@ -1,123 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Sink - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::Sink - - [−] - - [src]

-
pub struct Sink {
-    // some fields omitted
-}
1.0.0

A writer which will move data into the void.

- -

This struct is generally created by calling sink(). Please -see the documentation of sink() for more details.

-

Trait Implementations

impl Write for Sink

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.Split.html b/doc/bitflags/__core/io/struct.Split.html deleted file mode 100644 index 44a492df..00000000 --- a/doc/bitflags/__core/io/struct.Split.html +++ /dev/null @@ -1,167 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Split - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::Split - - [−] - - [src]

-
pub struct Split<B> {
-    // some fields omitted
-}
1.0.0

An iterator over the contents of an instance of BufRead split on a -particular byte.

- -

This struct is generally created by calling split() on a -BufRead. Please see the documentation of split() for more details.

-

Trait Implementations

impl<B> Iterator for Split<B> where B: BufRead

type Item = Result<Vec<u8>, Error>

-

fn next(&mut self) -> Option<Result<Vec<u8>, Error>>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.Stderr.html b/doc/bitflags/__core/io/struct.Stderr.html deleted file mode 100644 index 354fd7fb..00000000 --- a/doc/bitflags/__core/io/struct.Stderr.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Stderr - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::Stderr - - [−] - - [src]

-
pub struct Stderr {
-    // some fields omitted
-}
1.0.0

A handle to the standard error stream of a process.

- -

For more information, see the io::stderr method.

-

Methods

impl Stderr

fn lock(&self) -> StderrLock

-

Locks this handle to the standard error stream, returning a writable -guard.

- -

The lock is released when the returned lock goes out of scope. The -returned guard also implements the Write trait for writing data.

-

Trait Implementations

impl Write for Stderr

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, args: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.StderrLock.html b/doc/bitflags/__core/io/struct.StderrLock.html deleted file mode 100644 index 630abf7e..00000000 --- a/doc/bitflags/__core/io/struct.StderrLock.html +++ /dev/null @@ -1,123 +0,0 @@ - - - - - - - - - - bitflags::__core::io::StderrLock - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::StderrLock - - [−] - - [src]

-
pub struct StderrLock<'a> {
-    // some fields omitted
-}
1.0.0

A locked reference to the Stderr handle.

- -

This handle implements the Write trait and is constructed via -the Stderr::lock method.

-

Trait Implementations

impl<'a> Write for StderrLock<'a>

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.Stdin.html b/doc/bitflags/__core/io/struct.Stdin.html deleted file mode 100644 index eb7049fd..00000000 --- a/doc/bitflags/__core/io/struct.Stdin.html +++ /dev/null @@ -1,168 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Stdin - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::Stdin - - [−] - - [src]

-
pub struct Stdin {
-    // some fields omitted
-}
1.0.0

A handle to the standard input stream of a process.

- -

Each handle is a shared reference to a global buffer of input data to this -process. A handle can be lock'd to gain full access to BufRead methods -(e.g. .lines()). Reads to this handle are otherwise locked with respect -to other reads.

- -

This handle implements the Read trait, but beware that concurrent reads -of Stdin must be executed with care.

- -

Created by the io::stdin method.

-

Methods

impl Stdin

fn lock(&self) -> StdinLock

-

Locks this handle to the standard input stream, returning a readable -guard.

- -

The lock is released when the returned lock goes out of scope. The -returned guard also implements the Read and BufRead traits for -accessing the underlying data.

-

fn read_line(&self, buf: &mut String) -> Result<usize, Error>

-

Locks this handle and reads a line of input into the specified buffer.

- -

For detailed semantics of this method, see the documentation on -BufRead::read_line.

- -

Examples

-
-use std::io;
-
-let mut input = String::new();
-match io::stdin().read_line(&mut input) {
-    Ok(n) => {
-        println!("{} bytes read", n);
-        println!("{}", input);
-    }
-    Err(error) => println!("error: {}", error),
-}
- -

You can run the example one of two ways:

- -
    -
  • Pipe some text to it, e.g. printf foo | path/to/executable
    • -
  • Give it text interactively by running the executable directly, -in which case it will wait for the Enter key to be pressed before -continuing
    • -
-

Trait Implementations

impl Read for Stdin

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.StdinLock.html b/doc/bitflags/__core/io/struct.StdinLock.html deleted file mode 100644 index 95df6ab1..00000000 --- a/doc/bitflags/__core/io/struct.StdinLock.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - bitflags::__core::io::StdinLock - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::StdinLock - - [−] - - [src]

-
pub struct StdinLock<'a> {
-    // some fields omitted
-}
1.0.0

A locked reference to the Stdin handle.

- -

This handle implements both the Read and BufRead traits, and -is constructed via the Stdin::lock method.

-

Trait Implementations

impl<'a> Read for StdinLock<'a>

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-

impl<'a> BufRead for StdinLock<'a>

fn fill_buf(&mut self) -> Result<&[u8], Error>

-

fn consume(&mut self, n: usize)

-

fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn split(self, byte: u8) -> Split<Self>

-

fn lines(self) -> Lines<Self>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.Stdout.html b/doc/bitflags/__core/io/struct.Stdout.html deleted file mode 100644 index ba29e698..00000000 --- a/doc/bitflags/__core/io/struct.Stdout.html +++ /dev/null @@ -1,132 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Stdout - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::Stdout - - [−] - - [src]

-
pub struct Stdout {
-    // some fields omitted
-}
1.0.0

A handle to the global standard output stream of the current process.

- -

Each handle shares a global buffer of data to be written to the standard -output stream. Access is also synchronized via a lock and explicit control -over locking is available via the lock method.

- -

Created by the io::stdout method.

-

Methods

impl Stdout

fn lock(&self) -> StdoutLock

-

Locks this handle to the standard output stream, returning a writable -guard.

- -

The lock is released when the returned lock goes out of scope. The -returned guard also implements the Write trait for writing data.

-

Trait Implementations

impl Write for Stdout

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, args: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.StdoutLock.html b/doc/bitflags/__core/io/struct.StdoutLock.html deleted file mode 100644 index 0e209f8d..00000000 --- a/doc/bitflags/__core/io/struct.StdoutLock.html +++ /dev/null @@ -1,123 +0,0 @@ - - - - - - - - - - bitflags::__core::io::StdoutLock - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::StdoutLock - - [−] - - [src]

-
pub struct StdoutLock<'a> {
-    // some fields omitted
-}
1.0.0

A locked reference to the Stdout handle.

- -

This handle implements the Write trait, and is constructed via -the Stdout::lock method.

-

Trait Implementations

impl<'a> Write for StdoutLock<'a>

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/struct.Take.html b/doc/bitflags/__core/io/struct.Take.html deleted file mode 100644 index 823116b3..00000000 --- a/doc/bitflags/__core/io/struct.Take.html +++ /dev/null @@ -1,140 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Take - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::io::Take - - [−] - - [src]

-
pub struct Take<T> {
-    // some fields omitted
-}
1.0.0

Reader adaptor which limits the bytes read from an underlying reader.

- -

This struct is generally created by calling take() on a reader. -Please see the documentation of take() for more details.

-

Methods

impl<T> Take<T>

fn limit(&self) -> u64

-

Returns the number of bytes that can be read before this instance will -return EOF.

- -

Note

-

This instance may reach EOF after reading fewer bytes than indicated by -this method if the underlying Read instance reaches EOF.

-

Trait Implementations

impl<T> Read for Take<T> where T: Read

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-

impl<T> BufRead for Take<T> where T: BufRead

fn fill_buf(&mut self) -> Result<&[u8], Error>

-

fn consume(&mut self, amt: usize)

-

fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn split(self, byte: u8) -> Split<Self>

-

fn lines(self) -> Lines<Self>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/trait.BufRead.html b/doc/bitflags/__core/io/trait.BufRead.html deleted file mode 100644 index 84839ac2..00000000 --- a/doc/bitflags/__core/io/trait.BufRead.html +++ /dev/null @@ -1,343 +0,0 @@ - - - - - - - - - - bitflags::__core::io::BufRead - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::io::BufRead - - [−] - - [src]

-
pub trait BufRead: Read {
-    fn fill_buf(&mut self) -> Result<&[u8], Error>;
-    fn consume(&mut self, amt: usize);
-
-    fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error> { ... }
-    fn read_line(&mut self, buf: &mut String) -> Result<usize, Error> { ... }
-    fn split(self, byte: u8) -> Split<Self> { ... }
-    fn lines(self) -> Lines<Self> { ... }
-}

A BufRead is a type of Reader which has an internal buffer, allowing it -to perform extra ways of reading.

- -

For example, reading line-by-line is inefficient without using a buffer, so -if you want to read by line, you'll need BufRead, which includes a -read_line() method as well as a lines() iterator.

- -

Examples

-

A locked standard input implements BufRead:

- -
-use std::io;
-use std::io::prelude::*;
-
-let stdin = io::stdin();
-for line in stdin.lock().lines() {
-    println!("{}", line.unwrap());
-}
- -

If you have something that implements Read, you can use the BufReader -type to turn it into a BufRead.

- -

For example, File implements Read, but not BufRead. -BufReader to the rescue!

- -
-use std::io::{self, BufReader};
-use std::io::prelude::*;
-use std::fs::File;
-
-let f = try!(File::open("foo.txt"));
-let f = BufReader::new(f);
-
-for line in f.lines() {
-    println!("{}", line.unwrap());
-}
-
-
-

Required Methods

-
-

fn fill_buf(&mut self) -> Result<&[u8], Error>

Fills the internal buffer of this object, returning the buffer contents.

- -

This function is a lower-level call. It needs to be paired with the -consume method to function properly. When calling this -method, none of the contents will be "read" in the sense that later -calling read may return the same contents. As such, consume must be -called with the number of bytes that are consumed from this buffer to -ensure that the bytes are never returned twice.

- -

An empty buffer returned indicates that the stream has reached EOF.

- -

Errors

-

This function will return an I/O error if the underlying reader was -read, but returned an error.

- -

Examples

-

A locked standard input implements BufRead:

- -
-use std::io;
-use std::io::prelude::*;
-
-let stdin = io::stdin();
-let mut stdin = stdin.lock();
-
-// we can't have two `&mut` references to `stdin`, so use a block
-// to end the borrow early.
-let length = {
-    let buffer = stdin.fill_buf().unwrap();
-
-    // work with buffer
-    println!("{:?}", buffer);
-
-    buffer.len()
-};
-
-// ensure the bytes we worked with aren't returned again later
-stdin.consume(length);
-

fn consume(&mut self, amt: usize)

Tells this buffer that amt bytes have been consumed from the buffer, -so they should no longer be returned in calls to read.

- -

This function is a lower-level call. It needs to be paired with the -fill_buf method to function properly. This function does -not perform any I/O, it simply informs this object that some amount of -its buffer, returned from fill_buf, has been consumed and should no -longer be returned. As such, this function may do odd things if -fill_buf isn't called before calling it.

- -

The amt must be <= the number of bytes in the buffer returned by -fill_buf.

- -

Examples

-

Since consume() is meant to be used with fill_buf(), -that method's example includes an example of consume().

-
-

Provided Methods

-
-

fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>

Read all bytes into buf until the delimiter byte is reached.

- -

This function will read bytes from the underlying stream until the -delimiter or EOF is found. Once found, all bytes up to, and including, -the delimiter (if found) will be appended to buf.

- -

If this reader is currently at EOF then this function will not modify -buf and will return Ok(n) where n is the number of bytes which -were read.

- -

Errors

-

This function will ignore all instances of ErrorKind::Interrupted and -will otherwise return any errors returned by fill_buf.

- -

If an I/O error is encountered then all bytes read so far will be -present in buf and its length will have been adjusted appropriately.

- -

Examples

-

A locked standard input implements BufRead. In this example, we'll -read from standard input until we see an a byte.

- -
-use std::io;
-use std::io::prelude::*;
-
-fn foo() -> io::Result<()> {
-let stdin = io::stdin();
-let mut stdin = stdin.lock();
-let mut buffer = Vec::new();
-
-try!(stdin.read_until(b'a', &mut buffer));
-
-println!("{:?}", buffer);
-

fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>

Read all bytes until a newline (the 0xA byte) is reached, and append -them to the provided buffer.

- -

This function will read bytes from the underlying stream until the -newline delimiter (the 0xA byte) or EOF is found. Once found, all bytes -up to, and including, the delimiter (if found) will be appended to -buf.

- -

If this reader is currently at EOF then this function will not modify -buf and will return Ok(n) where n is the number of bytes which -were read.

- -

Errors

-

This function has the same error semantics as read_until and will also -return an error if the read bytes are not valid UTF-8. If an I/O error -is encountered then buf may contain some bytes already read in the -event that all data read so far was valid UTF-8.

- -

Examples

-

A locked standard input implements BufRead. In this example, we'll -read all of the lines from standard input. If we were to do this in -an actual project, the lines() method would be easier, of -course.

- -
-use std::io;
-use std::io::prelude::*;
-
-let stdin = io::stdin();
-let mut stdin = stdin.lock();
-let mut buffer = String::new();
-
-while stdin.read_line(&mut buffer).unwrap() > 0 {
-    // work with buffer
-    println!("{:?}", buffer);
-
-    buffer.clear();
-}
-

fn split(self, byte: u8) -> Split<Self>

Returns an iterator over the contents of this reader split on the byte -byte.

- -

The iterator returned from this function will return instances of -io::Result<Vec<u8>>. Each vector returned will not have the -delimiter byte at the end.

- -

This function will yield errors whenever read_until would have also -yielded an error.

- -

Examples

-

A locked standard input implements BufRead. In this example, we'll -read some input from standard input, splitting on commas.

- -
-use std::io;
-use std::io::prelude::*;
-
-let stdin = io::stdin();
-
-for content in stdin.lock().split(b',') {
-    println!("{:?}", content.unwrap());
-}
-

fn lines(self) -> Lines<Self>

Returns an iterator over the lines of this reader.

- -

The iterator returned from this function will yield instances of -io::Result<String>. Each string returned will not have a newline -byte (the 0xA byte) or CRLF (0xD, 0xA bytes) at the end.

- -

Examples

-

A locked standard input implements BufRead:

- -
-use std::io;
-use std::io::prelude::*;
-
-let stdin = io::stdin();
-
-for line in stdin.lock().lines() {
-    println!("{}", line.unwrap());
-}
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/trait.Read.html b/doc/bitflags/__core/io/trait.Read.html deleted file mode 100644 index ee813cda..00000000 --- a/doc/bitflags/__core/io/trait.Read.html +++ /dev/null @@ -1,447 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Read - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::io::Read - - [−] - - [src]

-
pub trait Read {
-    fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>;
-
-    fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error> { ... }
-    fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error> { ... }
-    fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error> { ... }
-    fn by_ref(&mut self) -> &mut Self { ... }
-    fn bytes(self) -> Bytes<Self> { ... }
-    fn chars(self) -> Chars<Self> { ... }
-    fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read { ... }
-    fn take(self, limit: u64) -> Take<Self> { ... }
-}

The Read trait allows for reading bytes from a source.

- -

Implementors of the Read trait are sometimes called 'readers'.

- -

Readers are defined by one required method, read(). Each call to read -will attempt to pull bytes from this source into a provided buffer. A -number of other methods are implemented in terms of read(), giving -implementors a number of ways to read bytes while only needing to implement -a single method.

- -

Readers are intended to be composable with one another. Many implementors -throughout std::io take and provide types which implement the Read -trait.

- -

Please note that each call to read may involve a system call, and -therefore, using something that implements BufRead, such as -BufReader, will be more efficient.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = [0; 10];
-
-// read up to 10 bytes
-try!(f.read(&mut buffer));
-
-let mut buffer = vec![0; 10];
-// read the whole file
-try!(f.read_to_end(&mut buffer));
-
-// read into a String, so that you don't need to do the conversion.
-let mut buffer = String::new();
-try!(f.read_to_string(&mut buffer));
-
-// and more! See the other methods for more details.
-
-

Required Methods

-
-

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

Pull some bytes from this source into the specified buffer, returning -how many bytes were read.

- -

This function does not provide any guarantees about whether it blocks -waiting for data, but if an object needs to block for a read but cannot -it will typically signal this via an Err return value.

- -

If the return value of this method is Ok(n), then it must be -guaranteed that 0 <= n <= buf.len(). A nonzero n value indicates -that the buffer buf has been filled in with n bytes of data from this -source. If n is 0, then it can indicate one of two scenarios:

- -
    -
  1. This reader has reached its "end of file" and will likely no longer -be able to produce bytes. Note that this does not mean that the -reader will always no longer be able to produce bytes.
    2. -
  2. The buffer specified was 0 bytes in length.
    3. -
- -

No guarantees are provided about the contents of buf when this -function is called, implementations cannot rely on any property of the -contents of buf being true. It is recommended that implementations -only write data to buf instead of reading its contents.

- -

Errors

-

If this function encounters any form of I/O or other error, an error -variant will be returned. If an error is returned then it must be -guaranteed that no bytes were read.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = [0; 10];
-
-// read 10 bytes
-try!(f.read(&mut buffer[..]));
-
-

Provided Methods

-
-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

Read all bytes until EOF in this source, placing them into buf.

- -

All bytes read from this source will be appended to the specified buffer -buf. This function will continuously call read to append more data to -buf until read returns either Ok(0) or an error of -non-ErrorKind::Interrupted kind.

- -

If successful, this function will return the total number of bytes read.

- -

Errors

-

If this function encounters an error of the kind -ErrorKind::Interrupted then the error is ignored and the operation -will continue.

- -

If any other read error is encountered then this function immediately -returns. Any bytes which have already been read will be appended to -buf.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = Vec::new();
-
-// read the whole file
-try!(f.read_to_end(&mut buffer));
-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

Read all bytes until EOF in this source, placing them into buf.

- -

If successful, this function returns the number of bytes which were read -and appended to buf.

- -

Errors

-

If the data in this stream is not valid UTF-8 then an error is -returned and buf is unchanged.

- -

See read_to_end() for other error semantics.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = String::new();
-
-try!(f.read_to_string(&mut buffer));
-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

Read the exact number of bytes required to fill buf.

- -

This function reads as many bytes as necessary to completely fill the -specified buffer buf.

- -

No guarantees are provided about the contents of buf when this -function is called, implementations cannot rely on any property of the -contents of buf being true. It is recommended that implementations -only write data to buf instead of reading its contents.

- -

Errors

-

If this function encounters an error of the kind -ErrorKind::Interrupted then the error is ignored and the operation -will continue.

- -

If this function encounters an "end of file" before completely filling -the buffer, it returns an error of the kind ErrorKind::UnexpectedEof. -The contents of buf are unspecified in this case.

- -

If any other read error is encountered then this function immediately -returns. The contents of buf are unspecified in this case.

- -

If this function returns an error, it is unspecified how many bytes it -has read, but it will never read more than would be necessary to -completely fill the buffer.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = [0; 10];
-
-// read exactly 10 bytes
-try!(f.read_exact(&mut buffer));
-

fn by_ref(&mut self) -> &mut Self

Creates a "by reference" adaptor for this instance of Read.

- -

The returned adaptor also implements Read and will simply borrow this -current reader.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::Read;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = Vec::new();
-let mut other_buffer = Vec::new();
-
-{
-    let reference = f.by_ref();
-
-    // read at most 5 bytes
-    try!(reference.take(5).read_to_end(&mut buffer));
-
-} // drop our &mut reference so we can use f again
-
-// original file still usable, read the rest
-try!(f.read_to_end(&mut other_buffer));
-

fn bytes(self) -> Bytes<Self>

Transforms this Read instance to an Iterator over its bytes.

- -

The returned type implements Iterator where the Item is Result<u8, R::Err>. The yielded item is Ok if a byte was successfully read and -Err otherwise for I/O errors. EOF is mapped to returning None from -this iterator.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-
-for byte in f.bytes() {
-    println!("{}", byte.unwrap());
-}
-

fn chars(self) -> Chars<Self>

Unstable (io)

: the semantics of a partial read/write of where errors happen is currently unclear and may change

-

Transforms this Read instance to an Iterator over chars.

- -

This adaptor will attempt to interpret this reader as a UTF-8 encoded -sequence of characters. The returned iterator will return None once -EOF is reached for this reader. Otherwise each element yielded will be a -Result<char, E> where E may contain information about what I/O error -occurred or where decoding failed.

- -

Currently this adaptor will discard intermediate data read, and should -be avoided if this is not desired.

- -

Examples

-

Files implement Read:

- -
-#![feature(io)]
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-
-for c in f.chars() {
-    println!("{}", c.unwrap());
-}
-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

Creates an adaptor which will chain this stream with another.

- -

The returned Read instance will first read all bytes from this object -until EOF is encountered. Afterwards the output is equivalent to the -output of next.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f1 = try!(File::open("foo.txt"));
-let mut f2 = try!(File::open("bar.txt"));
-
-let mut handle = f1.chain(f2);
-let mut buffer = String::new();
-
-// read the value into a String. We could use any Read method here,
-// this is just one example.
-try!(handle.read_to_string(&mut buffer));
-

fn take(self, limit: u64) -> Take<Self>

Creates an adaptor which will read at most limit bytes from it.

- -

This function returns a new instance of Read which will read at most -limit bytes, after which it will always return EOF (Ok(0)). Any -read errors will not count towards the number of bytes read and future -calls to read may succeed.

- -

Examples

-

Files implement Read:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut f = try!(File::open("foo.txt"));
-let mut buffer = [0; 5];
-
-// read at most five bytes
-let mut handle = f.take(5);
-
-try!(handle.read(&mut buffer));
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/trait.Seek.html b/doc/bitflags/__core/io/trait.Seek.html deleted file mode 100644 index b528337a..00000000 --- a/doc/bitflags/__core/io/trait.Seek.html +++ /dev/null @@ -1,159 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Seek - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::io::Seek - - [−] - - [src]

-
pub trait Seek {
-    fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>;
-}

The Seek trait provides a cursor which can be moved within a stream of -bytes.

- -

The stream typically has a fixed size, allowing seeking relative to either -end or the current offset.

- -

Examples

-

Files implement Seek:

- -
-use std::io;
-use std::io::prelude::*;
-use std::fs::File;
-use std::io::SeekFrom;
-
-let mut f = try!(File::open("foo.txt"));
-
-// move the cursor 42 bytes from the start of the file
-try!(f.seek(SeekFrom::Start(42)));
-
-

Required Methods

-
-

fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>

Seek to an offset, in bytes, in a stream.

- -

A seek beyond the end of a stream is allowed, but implementation -defined.

- -

If the seek operation completed successfully, -this method returns the new position from the start of the stream. -That position can be used later with SeekFrom::Start.

- -

Errors

-

Seeking to a negative offset is considered an error.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/trait.Write.html b/doc/bitflags/__core/io/trait.Write.html deleted file mode 100644 index 62079f7f..00000000 --- a/doc/bitflags/__core/io/trait.Write.html +++ /dev/null @@ -1,287 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Write - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::io::Write - - [−] - - [src]

-
pub trait Write {
-    fn write(&mut self, buf: &[u8]) -> Result<usize, Error>;
-    fn flush(&mut self) -> Result<(), Error>;
-
-    fn write_all(&mut self, buf: &[u8]) -> Result<(), Error> { ... }
-    fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error> { ... }
-    fn by_ref(&mut self) -> &mut Self { ... }
-}

A trait for objects which are byte-oriented sinks.

- -

Implementors of the Write trait are sometimes called 'writers'.

- -

Writers are defined by two required methods, write() and flush():

- -
    -

  • The write() method will attempt to write some data into the object, -returning how many bytes were successfully written.

    • -

  • The flush() method is useful for adaptors and explicit buffers -themselves for ensuring that all buffered data has been pushed out to the -'true sink'.

    • -
- -

Writers are intended to be composable with one another. Many implementors -throughout std::io take and provide types which implement the Write -trait.

- -

Examples

-
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut buffer = try!(File::create("foo.txt"));
-
-try!(buffer.write(b"some bytes"));
-
-

Required Methods

-
-

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

Write a buffer into this object, returning how many bytes were written.

- -

This function will attempt to write the entire contents of buf, but -the entire write may not succeed, or the write may also generate an -error. A call to write represents at most one attempt to write to -any wrapped object.

- -

Calls to write are not guaranteed to block waiting for data to be -written, and a write which would otherwise block can be indicated through -an Err variant.

- -

If the return value is Ok(n) then it must be guaranteed that -0 <= n <= buf.len(). A return value of 0 typically means that the -underlying object is no longer able to accept bytes and will likely not -be able to in the future as well, or that the buffer provided is empty.

- -

Errors

-

Each call to write may generate an I/O error indicating that the -operation could not be completed. If an error is returned then no bytes -in the buffer were written to this writer.

- -

It is not considered an error if the entire buffer could not be -written to this writer.

- -

Examples

-
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut buffer = try!(File::create("foo.txt"));
-
-try!(buffer.write(b"some bytes"));
-

fn flush(&mut self) -> Result<(), Error>

Flush this output stream, ensuring that all intermediately buffered -contents reach their destination.

- -

Errors

-

It is considered an error if not all bytes could be written due to -I/O errors or EOF being reached.

- -

Examples

-
-use std::io::prelude::*;
-use std::io::BufWriter;
-use std::fs::File;
-
-let mut buffer = BufWriter::new(try!(File::create("foo.txt")));
-
-try!(buffer.write(b"some bytes"));
-try!(buffer.flush());
-
-

Provided Methods

-
-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

Attempts to write an entire buffer into this write.

- -

This method will continuously call write while there is more data to -write. This method will not return until the entire buffer has been -successfully written or an error occurs. The first error generated from -this method will be returned.

- -

Errors

-

This function will return the first error that write returns.

- -

Examples

-
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut buffer = try!(File::create("foo.txt"));
-
-try!(buffer.write_all(b"some bytes"));
-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

Writes a formatted string into this writer, returning any error -encountered.

- -

This method is primarily used to interface with the -format_args! macro, but it is rare that this should -explicitly be called. The write! macro should be favored to -invoke this method instead.

- -

This function internally uses the write_all method on -this trait and hence will continuously write data so long as no errors -are received. This also means that partial writes are not indicated in -this signature.

- -

Errors

-

This function will return any I/O error reported while formatting.

- -

Examples

-
-use std::io::prelude::*;
-use std::fs::File;
-
-let mut buffer = try!(File::create("foo.txt"));
-
-// this call
-try!(write!(buffer, "{:.*}", 2, 1.234567));
-// turns into this:
-try!(buffer.write_fmt(format_args!("{:.*}", 2, 1.234567)));
-

fn by_ref(&mut self) -> &mut Self

Creates a "by reference" adaptor for this instance of Write.

- -

The returned adaptor also implements Write and will simply borrow this -current writer.

- -

Examples

-
-use std::io::Write;
-use std::fs::File;
-
-let mut buffer = try!(File::create("foo.txt"));
-
-let reference = buffer.by_ref();
-
-// we can use reference just like our original buffer
-try!(reference.write_all(b"some bytes"));
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/io/type.Result.html b/doc/bitflags/__core/io/type.Result.html deleted file mode 100644 index d2205abc..00000000 --- a/doc/bitflags/__core/io/type.Result.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::io::Result - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::io::Result - - [−] - - [src]

-
type Result<T> = Result<T, Error>;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/isize/constant.MAX.html b/doc/bitflags/__core/isize/constant.MAX.html deleted file mode 100644 index 58416595..00000000 --- a/doc/bitflags/__core/isize/constant.MAX.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::isize::MAX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::isize::MAX - - [−] - - [src]

-
pub const MAX: isize = !MIN
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/isize/constant.MIN.html b/doc/bitflags/__core/isize/constant.MIN.html deleted file mode 100644 index 6fbb6076..00000000 --- a/doc/bitflags/__core/isize/constant.MIN.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::isize::MIN - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::isize::MIN - - [−] - - [src]

-
pub const MIN: isize = -1 as isize << 64 - 1
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/isize/index.html b/doc/bitflags/__core/isize/index.html deleted file mode 100644 index da7d264e..00000000 --- a/doc/bitflags/__core/isize/index.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::isize - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::isize - - [−] - - [src]

-

The pointer-sized signed integer type.

- -

See also the isize primitive type.

-

Constants

- - - - - - - - -
MAX - -
MIN - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/isize/sidebar-items.js b/doc/bitflags/__core/isize/sidebar-items.js deleted file mode 100644 index 147ce9bf..00000000 --- a/doc/bitflags/__core/isize/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["MAX",""],["MIN",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/iter/fn.empty.html b/doc/bitflags/__core/iter/fn.empty.html deleted file mode 100644 index 8a5a7468..00000000 --- a/doc/bitflags/__core/iter/fn.empty.html +++ /dev/null @@ -1,124 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::empty - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::iter::empty - - [−] - - [src]

-
pub fn empty<T>() -> Empty<T>
1.2.0

Creates an iterator that yields nothing.

- -

Examples

-

Basic usage:

- -
-use std::iter;
-
-// this could have been an iterator over i32, but alas, it's just not.
-let mut nope = iter::empty::<i32>();
-
-assert_eq!(None, nope.next());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/fn.once.html b/doc/bitflags/__core/iter/fn.once.html deleted file mode 100644 index d1a5a8eb..00000000 --- a/doc/bitflags/__core/iter/fn.once.html +++ /dev/null @@ -1,158 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::once - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::iter::once - - [−] - - [src]

-
pub fn once<T>(value: T) -> Once<T>
1.2.0

Creates an iterator that yields an element exactly once.

- -

This is commonly used to adapt a single value into a chain() of other -kinds of iteration. Maybe you have an iterator that covers almost -everything, but you need an extra special case. Maybe you have a function -which works on iterators, but you only need to process one value.

- -

Examples

-

Basic usage:

- -
-use std::iter;
-
-// one is the loneliest number
-let mut one = iter::once(1);
-
-assert_eq!(Some(1), one.next());
-
-// just one, that's all we get
-assert_eq!(None, one.next());
- -

Chaining together with another iterator. Let's say that we want to iterate -over each file of the .foo directory, but also a configuration file, -.foorc:

- -
-use std::iter;
-use std::fs;
-use std::path::PathBuf;
-
-let dirs = fs::read_dir(".foo").unwrap();
-
-// we need to convert from an iterator of DirEntry-s to an iterator of
-// PathBufs, so we use map
-let dirs = dirs.map(|file| file.unwrap().path());
-
-// now, our iterator just for our config file
-let config = iter::once(PathBuf::from(".foorc"));
-
-// chain the two iterators together into one big iterator
-let files = dirs.chain(config);
-
-// this will give us all of the files in .foo as well as .foorc
-for f in files {
-    println!("{:?}", f);
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/fn.repeat.html b/doc/bitflags/__core/iter/fn.repeat.html deleted file mode 100644 index c42f586f..00000000 --- a/doc/bitflags/__core/iter/fn.repeat.html +++ /dev/null @@ -1,153 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::repeat - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::iter::repeat - - [−] - - [src]

-
pub fn repeat<T>(elt: T) -> Repeat<T> where T: Clone
1.0.0

Creates a new iterator that endlessly repeats a single element.

- -

The repeat() function repeats a single value over and over and over and -over and over and 🔁.

- -

Infinite iterators like repeat() are often used with adapters like -take(), in order to make them finite.

- -

Examples

-

Basic usage:

- -
-use std::iter;
-
-// the number four 4ever:
-let mut fours = iter::repeat(4);
-
-assert_eq!(Some(4), fours.next());
-assert_eq!(Some(4), fours.next());
-assert_eq!(Some(4), fours.next());
-assert_eq!(Some(4), fours.next());
-assert_eq!(Some(4), fours.next());
-
-// yup, still four
-assert_eq!(Some(4), fours.next());
- -

Going finite with take():

- -
-use std::iter;
-
-// that last example was too many fours. Let's only have four fours.
-let mut four_fours = iter::repeat(4).take(4);
-
-assert_eq!(Some(4), four_fours.next());
-assert_eq!(Some(4), four_fours.next());
-assert_eq!(Some(4), four_fours.next());
-assert_eq!(Some(4), four_fours.next());
-
-// ... and now we're done
-assert_eq!(None, four_fours.next());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/index.html b/doc/bitflags/__core/iter/index.html deleted file mode 100644 index 878e3fa6..00000000 --- a/doc/bitflags/__core/iter/index.html +++ /dev/null @@ -1,596 +0,0 @@ - - - - - - - - - - bitflags::__core::iter - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::iter - - [−] - - [src]

-

Composable external iteration.

- -

If you've found yourself with a collection of some kind, and needed to -perform an operation on the elements of said collection, you'll quickly run -into 'iterators'. Iterators are heavily used in idiomatic Rust code, so -it's worth becoming familiar with them.

- -

Before explaining more, let's talk about how this module is structured:

- -

Organization

-

This module is largely organized by type:

- -
    -
  • Traits are the core portion: these traits define what kind of iterators -exist and what you can do with them. The methods of these traits are worth -putting some extra study time into.
    • -
  • Functions provide some helpful ways to create some basic iterators.
    • -
  • Structs are often the return types of the various methods on this -module's traits. You'll usually want to look at the method that creates -the struct, rather than the struct itself. For more detail about why, -see 'Implementing Iterator'.
    • -
- -

That's it! Let's dig into iterators.

- -

Iterator

-

The heart and soul of this module is the Iterator trait. The core of -Iterator looks like this:

- -
-trait Iterator {
-    type Item;
-    fn next(&mut self) -> Option<Self::Item>;
-}
- -

An iterator has a method, next(), which when called, returns an -Option<Item>. next() will return Some(Item) as long as there -are elements, and once they've all been exhausted, will return None to -indicate that iteration is finished. Individual iterators may choose to -resume iteration, and so calling next() again may or may not eventually -start returning Some(Item) again at some point.

- -

Iterator's full definition includes a number of other methods as well, -but they are default methods, built on top of next(), and so you get -them for free.

- -

Iterators are also composable, and it's common to chain them together to do -more complex forms of processing. See the Adapters section -below for more details.

- -

The three forms of iteration

-

There are three common methods which can create iterators from a collection:

- -
    -
  • iter(), which iterates over &T.
    • -
  • iter_mut(), which iterates over &mut T.
    • -
  • into_iter(), which iterates over T.
    • -
- -

Various things in the standard library may implement one or more of the -three, where appropriate.

- -

Implementing Iterator

-

Creating an iterator of your own involves two steps: creating a struct to -hold the iterator's state, and then implementing Iterator for that -struct. This is why there are so many structs in this module: there is -one for each iterator and iterator adapter.

- -

Let's make an iterator named Counter which counts from 1 to 5:

- -
-// First, the struct:
-
-/// An iterator which counts from one to five
-struct Counter {
-    count: usize,
-}
-
-// we want our count to start at one, so let's add a new() method to help.
-// This isn't strictly necessary, but is convenient. Note that we start
-// `count` at zero, we'll see why in `next()`'s implementation below.
-impl Counter {
-    fn new() -> Counter {
-        Counter { count: 0 }
-    }
-}
-
-// Then, we implement `Iterator` for our `Counter`:
-
-impl Iterator for Counter {
-    // we will be counting with usize
-    type Item = usize;
-
-    // next() is the only required method
-    fn next(&mut self) -> Option<usize> {
-        // increment our count. This is why we started at zero.
-        self.count += 1;
-
-        // check to see if we've finished counting or not.
-        if self.count < 6 {
-            Some(self.count)
-        } else {
-            None
-        }
-    }
-}
-
-// And now we can use it!
-
-let mut counter = Counter::new();
-
-let x = counter.next().unwrap();
-println!("{}", x);
-
-let x = counter.next().unwrap();
-println!("{}", x);
-
-let x = counter.next().unwrap();
-println!("{}", x);
-
-let x = counter.next().unwrap();
-println!("{}", x);
-
-let x = counter.next().unwrap();
-println!("{}", x);
- -

This will print 1 through 5, each on their own line.

- -

Calling next() this way gets repetitive. Rust has a construct which can -call next() on your iterator, until it reaches None. Let's go over that -next.

- -

for Loops and IntoIterator

-

Rust's for loop syntax is actually sugar for iterators. Here's a basic -example of for:

- -
-let values = vec![1, 2, 3, 4, 5];
-
-for x in values {
-    println!("{}", x);
-}
- -

This will print the numbers one through five, each on their own line. But -you'll notice something here: we never called anything on our vector to -produce an iterator. What gives?

- -

There's a trait in the standard library for converting something into an -iterator: IntoIterator. This trait has one method, into_iter(), -which converts the thing implementing IntoIterator into an iterator. -Let's take a look at that for loop again, and what the compiler converts -it into:

- -
-let values = vec![1, 2, 3, 4, 5];
-
-for x in values {
-    println!("{}", x);
-}
- -

Rust de-sugars this into:

- -
-let values = vec![1, 2, 3, 4, 5];
-{
-    let result = match IntoIterator::into_iter(values) {
-        mut iter => loop {
-            match iter.next() {
-                Some(x) => { println!("{}", x); },
-                None => break,
-            }
-        },
-    };
-    result
-}
- -

First, we call into_iter() on the value. Then, we match on the iterator -that returns, calling next() over and over until we see a None. At -that point, we break out of the loop, and we're done iterating.

- -

There's one more subtle bit here: the standard library contains an -interesting implementation of IntoIterator:

- -
-impl<I: Iterator> IntoIterator for I
- -

In other words, all Iterators implement IntoIterator, by just -returning themselves. This means two things:

- -
    -
  1. If you're writing an Iterator, you can use it with a for loop.
    2. -
  2. If you're creating a collection, implementing IntoIterator for it -will allow your collection to be used with the for loop.
    3. -
- -

Adapters

-

Functions which take an Iterator and return another Iterator are -often called 'iterator adapters', as they're a form of the 'adapter -pattern'.

- -

Common iterator adapters include map(), take(), and collect(). -For more, see their documentation.

- -

Laziness

-

Iterators (and iterator adapters) are lazy. This means that -just creating an iterator doesn't do a whole lot. Nothing really happens -until you call next(). This is sometimes a source of confusion when -creating an iterator solely for its side effects. For example, the map() -method calls a closure on each element it iterates over:

- -
-let v = vec![1, 2, 3, 4, 5];
-v.iter().map(|x| println!("{}", x));
- -

This will not print any values, as we only created an iterator, rather than -using it. The compiler will warn us about this kind of behavior:

- -
warning: unused result which must be used: iterator adaptors are lazy and
-do nothing unless consumed
-
- -

The idiomatic way to write a map() for its side effects is to use a -for loop instead:

- -
-let v = vec![1, 2, 3, 4, 5];
-
-for x in &v {
-    println!("{}", x);
-}
- -

The two most common ways to evaluate an iterator are to use a for loop -like this, or using the collect() adapter to produce a new collection.

- -

Infinity

-

Iterators do not have to be finite. As an example, an open-ended range is -an infinite iterator:

- -
-let numbers = 0..;
- -

It is common to use the take() iterator adapter to turn an infinite -iterator into a finite one:

- -
-let numbers = 0..;
-let five_numbers = numbers.take(5);
-
-for number in five_numbers {
-    println!("{}", number);
-}
- -

This will print the numbers 0 through 4, each on their own line.

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Chain -

An iterator that strings two iterators together.

-
Cloned -

An iterator that clones the elements of an underlying iterator.

-
Cycle -

An iterator that repeats endlessly.

-
Empty -

An iterator that yields nothing.

-
Enumerate -

An iterator that yields the current count and the element during iteration.

-
Filter -

An iterator that filters the elements of iter with predicate.

-
FilterMap -

An iterator that uses f to both filter and map elements from iter.

-
FlatMap -

An iterator that maps each element to an iterator, and yields the elements -of the produced iterators.

-
Fuse -

An iterator that yields None forever after the underlying iterator -yields None once.

-
Inspect -

An iterator that calls a function with a reference to each element before -yielding it.

-
Map -

An iterator that maps the values of iter with f.

-
Once -

An iterator that yields an element exactly once.

-
Peekable -

An iterator with a peek() that returns an optional reference to the next -element.

-
Repeat -

An iterator that repeats an element endlessly.

-
Rev -

An double-ended iterator with the direction inverted.

-
Scan -

An iterator to maintain state while iterating another iterator.

-
Skip -

An iterator that skips over n elements of iter.

-
SkipWhile -

An iterator that rejects elements while predicate is true.

-
Take -

An iterator that only iterates over the first n iterations of iter.

-
TakeWhile -

An iterator that only accepts elements while predicate is true.

-
Zip -

An iterator that iterates two other iterators simultaneously.

-
StepBy - [Unstable]

An adapter for stepping range iterators by a custom amount.

-

Traits

- - - - - - - - - - - - - - - - - - - - - - - - - - - - -
DoubleEndedIterator -

An iterator able to yield elements from both ends.

-
ExactSizeIterator -

An iterator that knows its exact length.

-
Extend -

Extend a collection with the contents of an iterator.

-
FromIterator -

Conversion from an Iterator.

-
IntoIterator -

Conversion into an Iterator.

-
Iterator -

An interface for dealing with iterators.

-
Step - [Unstable]

Objects that can be stepped over in both directions.

-

Functions

- - - - - - - - - - - - -
empty -

Creates an iterator that yields nothing.

-
once -

Creates an iterator that yields an element exactly once.

-
repeat -

Creates a new iterator that endlessly repeats a single element.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/sidebar-items.js b/doc/bitflags/__core/iter/sidebar-items.js deleted file mode 100644 index 6a4696f5..00000000 --- a/doc/bitflags/__core/iter/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["empty","Creates an iterator that yields nothing."],["once","Creates an iterator that yields an element exactly once."],["repeat","Creates a new iterator that endlessly repeats a single element."]],"struct":[["Chain","An iterator that strings two iterators together."],["Cloned","An iterator that clones the elements of an underlying iterator."],["Cycle","An iterator that repeats endlessly."],["Empty","An iterator that yields nothing."],["Enumerate","An iterator that yields the current count and the element during iteration."],["Filter","An iterator that filters the elements of `iter` with `predicate`."],["FilterMap","An iterator that uses `f` to both filter and map elements from `iter`."],["FlatMap","An iterator that maps each element to an iterator, and yields the elements of the produced iterators."],["Fuse","An iterator that yields `None` forever after the underlying iterator yields `None` once."],["Inspect","An iterator that calls a function with a reference to each element before yielding it."],["Map","An iterator that maps the values of `iter` with `f`."],["Once","An iterator that yields an element exactly once."],["Peekable","An iterator with a `peek()` that returns an optional reference to the next element."],["Repeat","An iterator that repeats an element endlessly."],["Rev","An double-ended iterator with the direction inverted."],["Scan","An iterator to maintain state while iterating another iterator."],["Skip","An iterator that skips over `n` elements of `iter`."],["SkipWhile","An iterator that rejects elements while `predicate` is true."],["StepBy","An adapter for stepping range iterators by a custom amount."],["Take","An iterator that only iterates over the first `n` iterations of `iter`."],["TakeWhile","An iterator that only accepts elements while `predicate` is true."],["Zip","An iterator that iterates two other iterators simultaneously."]],"trait":[["DoubleEndedIterator","An iterator able to yield elements from both ends."],["ExactSizeIterator","An iterator that knows its exact length."],["Extend","Extend a collection with the contents of an iterator."],["FromIterator","Conversion from an `Iterator`."],["IntoIterator","Conversion into an `Iterator`."],["Iterator","An interface for dealing with iterators."],["Step","Objects that can be stepped over in both directions."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Chain.html b/doc/bitflags/__core/iter/struct.Chain.html deleted file mode 100644 index d07cd2bd..00000000 --- a/doc/bitflags/__core/iter/struct.Chain.html +++ /dev/null @@ -1,171 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Chain - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Chain - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct Chain<A, B> {
-    // some fields omitted
-}
1.0.0

An iterator that strings two iterators together.

- -

This struct is created by the chain() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<A, B> Iterator for Chain<A, B> where B: Iterator<Item=A::Item>, A: Iterator

type Item = A::Item

-

fn next(&mut self) -> Option<A::Item>

-

fn count(self) -> usize

-

fn nth(&mut self, n: usize) -> Option<A::Item>

-

fn last(self) -> Option<A::Item>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<A, B> DoubleEndedIterator for Chain<A, B> where B: DoubleEndedIterator<Item=A::Item>, A: DoubleEndedIterator

fn next_back(&mut self) -> Option<A::Item>

-

Derived Implementations

impl<A, B> Debug for Chain<A, B> where A: Debug, B: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<A, B> Clone for Chain<A, B> where A: Clone, B: Clone

fn clone(&self) -> Chain<A, B>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Cloned.html b/doc/bitflags/__core/iter/struct.Cloned.html deleted file mode 100644 index 2a25a310..00000000 --- a/doc/bitflags/__core/iter/struct.Cloned.html +++ /dev/null @@ -1,172 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Cloned - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Cloned - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct Cloned<I> {
-    // some fields omitted
-}
1.1.0

An iterator that clones the elements of an underlying iterator.

- -

This struct is created by the cloned() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<'a, I, T> Iterator for Cloned<I> where I: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

type Item = T

-

fn next(&mut self) -> Option<T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, I, T> DoubleEndedIterator for Cloned<I> where I: DoubleEndedIterator<Item=&'a T>, T: 'a + Clone1.0.0

fn next_back(&mut self) -> Option<T>

-

impl<'a, I, T> ExactSizeIterator for Cloned<I> where T: 'a + Clone, I: ExactSizeIterator<Item=&'a T>1.0.0

fn len(&self) -> usize1.0.0

-

Derived Implementations

impl<I> Debug for Cloned<I> where I: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<I> Clone for Cloned<I> where I: Clone

fn clone(&self) -> Cloned<I>

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Cycle.html b/doc/bitflags/__core/iter/struct.Cycle.html deleted file mode 100644 index 56422447..00000000 --- a/doc/bitflags/__core/iter/struct.Cycle.html +++ /dev/null @@ -1,170 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Cycle - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Cycle - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct Cycle<I> {
-    // some fields omitted
-}
1.0.0

An iterator that repeats endlessly.

- -

This struct is created by the cycle() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<I> Iterator for Cycle<I> where I: Clone + Iterator

type Item = I::Item

-

fn next(&mut self) -> Option<I::Item>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl<I> Debug for Cycle<I> where I: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<I> Clone for Cycle<I> where I: Clone

fn clone(&self) -> Cycle<I>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Empty.html b/doc/bitflags/__core/iter/struct.Empty.html deleted file mode 100644 index f89c45cc..00000000 --- a/doc/bitflags/__core/iter/struct.Empty.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Empty - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Empty - - [−] - - [src]

-
pub struct Empty<T>(_);
1.2.0

An iterator that yields nothing.

- -

This struct is created by the empty() function. See its documentation for more.

-

Trait Implementations

impl<T> Debug for Empty<T>1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Iterator for Empty<T>

type Item = T

-

fn next(&mut self) -> Option<T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<T> DoubleEndedIterator for Empty<T>

fn next_back(&mut self) -> Option<T>

-

impl<T> ExactSizeIterator for Empty<T>

fn len(&self) -> usize

-

impl<T> Clone for Empty<T>

fn clone(&self) -> Empty<T>

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<T> Default for Empty<T>

fn default() -> Empty<T>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Enumerate.html b/doc/bitflags/__core/iter/struct.Enumerate.html deleted file mode 100644 index 23146dfe..00000000 --- a/doc/bitflags/__core/iter/struct.Enumerate.html +++ /dev/null @@ -1,180 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Enumerate - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Enumerate - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct Enumerate<I> {
-    // some fields omitted
-}
1.0.0

An iterator that yields the current count and the element during iteration.

- -

This struct is created by the enumerate() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<I> Iterator for Enumerate<I> where I: Iterator

type Item = (usize, I::Item)

-

fn next(&mut self) -> Option<(usize, I::Item)>

-
-

Overflow Behavior

-

The method does no guarding against overflows, so enumerating more than -usize::MAX elements either produces the wrong result or panics. If -debug assertions are enabled, a panic is guaranteed.

- -

Panics

-

Might panic if the index of the element overflows a usize.

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn nth(&mut self, n: usize) -> Option<(usize, I::Item)>

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<I> DoubleEndedIterator for Enumerate<I> where I: ExactSizeIterator + DoubleEndedIterator

fn next_back(&mut self) -> Option<(usize, I::Item)>

-

impl<I> ExactSizeIterator for Enumerate<I> where I: ExactSizeIterator

fn len(&self) -> usize

-

Derived Implementations

impl<I> Debug for Enumerate<I> where I: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<I> Clone for Enumerate<I> where I: Clone

fn clone(&self) -> Enumerate<I>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Filter.html b/doc/bitflags/__core/iter/struct.Filter.html deleted file mode 100644 index 63fc09ab..00000000 --- a/doc/bitflags/__core/iter/struct.Filter.html +++ /dev/null @@ -1,171 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Filter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Filter - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct Filter<I, P> {
-    // some fields omitted
-}
1.0.0

An iterator that filters the elements of iter with predicate.

- -

This struct is created by the filter() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<I, P> Debug for Filter<I, P> where I: Debug1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<I, P> Iterator for Filter<I, P> where I: Iterator, P: FnMut(&I::Item) -> bool

type Item = I::Item

-

fn next(&mut self) -> Option<I::Item>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<I, P> DoubleEndedIterator for Filter<I, P> where P: FnMut(&I::Item) -> bool, I: DoubleEndedIterator

fn next_back(&mut self) -> Option<I::Item>

-

Derived Implementations

impl<I, P> Clone for Filter<I, P> where I: Clone, P: Clone

fn clone(&self) -> Filter<I, P>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.FilterMap.html b/doc/bitflags/__core/iter/struct.FilterMap.html deleted file mode 100644 index 24c3af05..00000000 --- a/doc/bitflags/__core/iter/struct.FilterMap.html +++ /dev/null @@ -1,171 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::FilterMap - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::FilterMap - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct FilterMap<I, F> {
-    // some fields omitted
-}
1.0.0

An iterator that uses f to both filter and map elements from iter.

- -

This struct is created by the filter_map() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<I, F> Debug for FilterMap<I, F> where I: Debug1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<B, I, F> Iterator for FilterMap<I, F> where F: FnMut(I::Item) -> Option<B>, I: Iterator

type Item = B

-

fn next(&mut self) -> Option<B>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<B, I, F> DoubleEndedIterator for FilterMap<I, F> where F: FnMut(I::Item) -> Option<B>, I: DoubleEndedIterator

fn next_back(&mut self) -> Option<B>

-

Derived Implementations

impl<I, F> Clone for FilterMap<I, F> where I: Clone, F: Clone

fn clone(&self) -> FilterMap<I, F>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.FlatMap.html b/doc/bitflags/__core/iter/struct.FlatMap.html deleted file mode 100644 index c6e76cfa..00000000 --- a/doc/bitflags/__core/iter/struct.FlatMap.html +++ /dev/null @@ -1,172 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::FlatMap - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::FlatMap - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct FlatMap<I, U, F> where U: IntoIterator {
-    // some fields omitted
-}
1.0.0

An iterator that maps each element to an iterator, and yields the elements -of the produced iterators.

- -

This struct is created by the flat_map() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<I, U, F> Debug for FlatMap<I, U, F> where I: Debug, U: IntoIterator, U::IntoIter: Debug1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<I, U, F> Iterator for FlatMap<I, U, F> where U: IntoIterator, I: Iterator, F: FnMut(I::Item) -> U

type Item = U::Item

-

fn next(&mut self) -> Option<U::Item>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<I, U, F> DoubleEndedIterator for FlatMap<I, U, F> where U: IntoIterator, I: DoubleEndedIterator, F: FnMut(I::Item) -> U, U::IntoIter: DoubleEndedIterator

fn next_back(&mut self) -> Option<U::Item>

-

Derived Implementations

impl<I, U, F> Clone for FlatMap<I, U, F> where I: Clone, U: Clone + IntoIterator, F: Clone, U::IntoIter: Clone

fn clone(&self) -> FlatMap<I, U, F>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Fuse.html b/doc/bitflags/__core/iter/struct.Fuse.html deleted file mode 100644 index 0c6920bb..00000000 --- a/doc/bitflags/__core/iter/struct.Fuse.html +++ /dev/null @@ -1,173 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Fuse - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Fuse - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct Fuse<I> {
-    // some fields omitted
-}
1.0.0

An iterator that yields None forever after the underlying iterator -yields None once.

- -

This struct is created by the fuse() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<I> Iterator for Fuse<I> where I: Iterator

type Item = I::Item

-

fn next(&mut self) -> Option<I::Item>

-

fn nth(&mut self, n: usize) -> Option<I::Item>

-

fn last(self) -> Option<I::Item>

-

fn count(self) -> usize

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<I> DoubleEndedIterator for Fuse<I> where I: DoubleEndedIterator

fn next_back(&mut self) -> Option<I::Item>

-

impl<I> ExactSizeIterator for Fuse<I> where I: ExactSizeIterator

fn len(&self) -> usize

-

Derived Implementations

impl<I> Debug for Fuse<I> where I: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<I> Clone for Fuse<I> where I: Clone

fn clone(&self) -> Fuse<I>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Inspect.html b/doc/bitflags/__core/iter/struct.Inspect.html deleted file mode 100644 index 78e33f23..00000000 --- a/doc/bitflags/__core/iter/struct.Inspect.html +++ /dev/null @@ -1,173 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Inspect - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Inspect - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct Inspect<I, F> {
-    // some fields omitted
-}
1.0.0

An iterator that calls a function with a reference to each element before -yielding it.

- -

This struct is created by the inspect() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<I, F> Debug for Inspect<I, F> where I: Debug1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<I, F> Iterator for Inspect<I, F> where F: FnMut(&I::Item) -> (), I: Iterator

type Item = I::Item

-

fn next(&mut self) -> Option<I::Item>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<I, F> DoubleEndedIterator for Inspect<I, F> where I: DoubleEndedIterator, F: FnMut(&I::Item) -> ()

fn next_back(&mut self) -> Option<I::Item>

-

impl<I, F> ExactSizeIterator for Inspect<I, F> where I: ExactSizeIterator, F: FnMut(&I::Item) -> ()

fn len(&self) -> usize

-

Derived Implementations

impl<I, F> Clone for Inspect<I, F> where I: Clone, F: Clone

fn clone(&self) -> Inspect<I, F>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Map.html b/doc/bitflags/__core/iter/struct.Map.html deleted file mode 100644 index 28094a12..00000000 --- a/doc/bitflags/__core/iter/struct.Map.html +++ /dev/null @@ -1,209 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Map - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Map - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct Map<I, F> {
-    // some fields omitted
-}
1.0.0

An iterator that maps the values of iter with f.

- -

This struct is created by the map() method on Iterator. See its -documentation for more.

- -

Notes about side effects

-

The map() iterator implements DoubleEndedIterator, meaning that -you can also map() backwards:

- -
-let v: Vec<i32> = vec![1, 2, 3].into_iter().rev().map(|x| x + 1).collect();
-
-assert_eq!(v, [4, 3, 2]);
- -

But if your closure has state, iterating backwards may act in a way you do -not expect. Let's go through an example. First, in the forward direction:

- -
-let mut c = 0;
-
-for pair in vec!['a', 'b', 'c'].into_iter()
-                               .map(|letter| { c += 1; (letter, c) }) {
-    println!("{:?}", pair);
-}
- -

This will print "('a', 1), ('b', 2), ('c', 3)".

- -

Now consider this twist where we add a call to rev. This version will -print ('c', 1), ('b', 2), ('a', 3). Note that the letters are reversed, -but the values of the counter still go in order. This is because map() is -still being called lazilly on each item, but we are popping items off the -back of the vector now, instead of shifting them from the front.

- -
-let mut c = 0;
-
-for pair in vec!['a', 'b', 'c'].into_iter()
-                               .map(|letter| { c += 1; (letter, c) })
-                               .rev() {
-    println!("{:?}", pair);
-}
-

Trait Implementations

impl<I, F> Debug for Map<I, F> where I: Debug1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<B, I, F> Iterator for Map<I, F> where I: Iterator, F: FnMut(I::Item) -> B

type Item = B

-

fn next(&mut self) -> Option<B>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<B, I, F> DoubleEndedIterator for Map<I, F> where I: DoubleEndedIterator, F: FnMut(I::Item) -> B

fn next_back(&mut self) -> Option<B>

-

impl<B, I, F> ExactSizeIterator for Map<I, F> where F: FnMut(I::Item) -> B, I: ExactSizeIterator

fn len(&self) -> usize

-

Derived Implementations

impl<I, F> Clone for Map<I, F> where I: Clone, F: Clone

fn clone(&self) -> Map<I, F>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Once.html b/doc/bitflags/__core/iter/struct.Once.html deleted file mode 100644 index 4112e4de..00000000 --- a/doc/bitflags/__core/iter/struct.Once.html +++ /dev/null @@ -1,170 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Once - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Once - - [−] - - [src]

-
pub struct Once<T> {
-    // some fields omitted
-}
1.2.0

An iterator that yields an element exactly once.

- -

This struct is created by the once() function. See its documentation for more.

-

Trait Implementations

impl<T> Iterator for Once<T>

type Item = T

-

fn next(&mut self) -> Option<T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<T> DoubleEndedIterator for Once<T>

fn next_back(&mut self) -> Option<T>

-

impl<T> ExactSizeIterator for Once<T>

fn len(&self) -> usize

-

Derived Implementations

impl<T> Debug for Once<T> where T: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<T> Clone for Once<T> where T: Clone

fn clone(&self) -> Once<T>

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Peekable.html b/doc/bitflags/__core/iter/struct.Peekable.html deleted file mode 100644 index 206869e4..00000000 --- a/doc/bitflags/__core/iter/struct.Peekable.html +++ /dev/null @@ -1,233 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Peekable - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Peekable - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct Peekable<I> where I: Iterator {
-    // some fields omitted
-}
1.0.0

An iterator with a peek() that returns an optional reference to the next -element.

- -

This struct is created by the peekable() method on Iterator. See its -documentation for more.

-

Methods

impl<I> Peekable<I> where I: Iterator

fn peek(&mut self) -> Option<&I::Item>

-

Returns a reference to the next() value without advancing the iterator.

- -

The peek() method will return the value that a call to next() would -return, but does not advance the iterator. Like next(), if there is -a value, it's wrapped in a Some(T), but if the iterator is over, it -will return None.

- -

Because peek() returns reference, and many iterators iterate over -references, this leads to a possibly confusing situation where the -return value is a double reference. You can see this effect in the -examples below, with &&i32.

- -

Examples

-

Basic usage:

- -
-let xs = [1, 2, 3];
-
-let mut iter = xs.iter().peekable();
-
-// peek() lets us see into the future
-assert_eq!(iter.peek(), Some(&&1));
-assert_eq!(iter.next(), Some(&1));
-
-assert_eq!(iter.next(), Some(&2));
-
-// we can peek() multiple times, the iterator won't advance
-assert_eq!(iter.peek(), Some(&&3));
-assert_eq!(iter.peek(), Some(&&3));
-
-assert_eq!(iter.next(), Some(&3));
-
-// after the iterator is finished, so is peek()
-assert_eq!(iter.peek(), None);
-assert_eq!(iter.next(), None);
-

fn is_empty(&mut self) -> bool

-
Unstable (peekable_is_empty)

Checks if the iterator has finished iterating.

- -

Returns true if there are no more elements in the iterator, and -false if there are.

- -

Examples

-

Basic usage:

- -
-#![feature(peekable_is_empty)]
-
-let xs = [1, 2, 3];
-
-let mut iter = xs.iter().peekable();
-
-// there are still elements to iterate over
-assert_eq!(iter.is_empty(), false);
-
-// let's consume the iterator
-iter.next();
-iter.next();
-iter.next();
-
-assert_eq!(iter.is_empty(), true);
-

Trait Implementations

impl<I> Iterator for Peekable<I> where I: Iterator

type Item = I::Item

-

fn next(&mut self) -> Option<I::Item>

-

fn count(self) -> usize

-

fn nth(&mut self, n: usize) -> Option<I::Item>

-

fn last(self) -> Option<I::Item>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<I> ExactSizeIterator for Peekable<I> where I: ExactSizeIterator

fn len(&self) -> usize

-

Derived Implementations

impl<I> Debug for Peekable<I> where I: Iterator + Debug, I::Item: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<I> Clone for Peekable<I> where I: Clone + Iterator, I::Item: Clone

fn clone(&self) -> Peekable<I>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Repeat.html b/doc/bitflags/__core/iter/struct.Repeat.html deleted file mode 100644 index 3dacc584..00000000 --- a/doc/bitflags/__core/iter/struct.Repeat.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Repeat - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Repeat - - [−] - - [src]

-
pub struct Repeat<A> {
-    // some fields omitted
-}
1.0.0

An iterator that repeats an element endlessly.

- -

This struct is created by the repeat() function. See its documentation for more.

-

Trait Implementations

impl<A> Iterator for Repeat<A> where A: Clone

type Item = A

-

fn next(&mut self) -> Option<A>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<A> DoubleEndedIterator for Repeat<A> where A: Clone

fn next_back(&mut self) -> Option<A>

-

Derived Implementations

impl<A> Debug for Repeat<A> where A: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<A> Clone for Repeat<A> where A: Clone

fn clone(&self) -> Repeat<A>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Rev.html b/doc/bitflags/__core/iter/struct.Rev.html deleted file mode 100644 index 1a2b9476..00000000 --- a/doc/bitflags/__core/iter/struct.Rev.html +++ /dev/null @@ -1,172 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Rev - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Rev - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct Rev<T> {
-    // some fields omitted
-}
1.0.0

An double-ended iterator with the direction inverted.

- -

This struct is created by the rev() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<I> Iterator for Rev<I> where I: DoubleEndedIterator

type Item = I::Item

-

fn next(&mut self) -> Option<I::Item>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<I> DoubleEndedIterator for Rev<I> where I: DoubleEndedIterator

fn next_back(&mut self) -> Option<I::Item>

-

impl<I> ExactSizeIterator for Rev<I> where I: ExactSizeIterator + DoubleEndedIterator

fn len(&self) -> usize

-

Derived Implementations

impl<T> Debug for Rev<T> where T: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<T> Clone for Rev<T> where T: Clone

fn clone(&self) -> Rev<T>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Scan.html b/doc/bitflags/__core/iter/struct.Scan.html deleted file mode 100644 index ced22119..00000000 --- a/doc/bitflags/__core/iter/struct.Scan.html +++ /dev/null @@ -1,170 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Scan - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Scan - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct Scan<I, St, F> {
-    // some fields omitted
-}
1.0.0

An iterator to maintain state while iterating another iterator.

- -

This struct is created by the scan() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<I, St, F> Debug for Scan<I, St, F> where I: Debug, St: Debug1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<B, I, St, F> Iterator for Scan<I, St, F> where F: FnMut(&mut St, I::Item) -> Option<B>, I: Iterator

type Item = B

-

fn next(&mut self) -> Option<B>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl<I, St, F> Clone for Scan<I, St, F> where I: Clone, F: Clone, St: Clone

fn clone(&self) -> Scan<I, St, F>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Skip.html b/doc/bitflags/__core/iter/struct.Skip.html deleted file mode 100644 index e00c89b3..00000000 --- a/doc/bitflags/__core/iter/struct.Skip.html +++ /dev/null @@ -1,172 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Skip - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Skip - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct Skip<I> {
-    // some fields omitted
-}
1.0.0

An iterator that skips over n elements of iter.

- -

This struct is created by the skip() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<I> Iterator for Skip<I> where I: Iterator

type Item = I::Item

-

fn next(&mut self) -> Option<I::Item>

-

fn nth(&mut self, n: usize) -> Option<I::Item>

-

fn count(self) -> usize

-

fn last(self) -> Option<I::Item>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<I> ExactSizeIterator for Skip<I> where I: ExactSizeIterator

fn len(&self) -> usize

-

impl<I> DoubleEndedIterator for Skip<I> where I: DoubleEndedIterator + ExactSizeIterator1.8.0

fn next_back(&mut self) -> Option<Skip<I>::Item>

-

Derived Implementations

impl<I> Debug for Skip<I> where I: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<I> Clone for Skip<I> where I: Clone

fn clone(&self) -> Skip<I>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.SkipWhile.html b/doc/bitflags/__core/iter/struct.SkipWhile.html deleted file mode 100644 index 3b3a042f..00000000 --- a/doc/bitflags/__core/iter/struct.SkipWhile.html +++ /dev/null @@ -1,170 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::SkipWhile - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::SkipWhile - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct SkipWhile<I, P> {
-    // some fields omitted
-}
1.0.0

An iterator that rejects elements while predicate is true.

- -

This struct is created by the skip_while() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<I, P> Debug for SkipWhile<I, P> where I: Debug1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<I, P> Iterator for SkipWhile<I, P> where I: Iterator, P: FnMut(&I::Item) -> bool

type Item = I::Item

-

fn next(&mut self) -> Option<I::Item>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl<I, P> Clone for SkipWhile<I, P> where P: Clone, I: Clone

fn clone(&self) -> SkipWhile<I, P>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.StepBy.html b/doc/bitflags/__core/iter/struct.StepBy.html deleted file mode 100644 index 404dc05b..00000000 --- a/doc/bitflags/__core/iter/struct.StepBy.html +++ /dev/null @@ -1,272 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::StepBy - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::StepBy - - [−] - - [src]

-
pub struct StepBy<A, R> {
-    // some fields omitted
-}
Unstable (step_by)

: recent addition

-

An adapter for stepping range iterators by a custom amount.

- -

The resulting iterator handles overflow by stopping. The A -parameter is the type being iterated over, while R is the range -type (usually one of std::ops::{Range, RangeFrom, RangeInclusive}.

-

Trait Implementations

impl<A> Iterator for StepBy<A, RangeFrom<A>> where A: Clone, &'a A: Add<&'a A>, &'a A::Output == A1.0.0

type Item = A

-

fn next(&mut self) -> Option<A>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<A> Iterator for StepBy<A, Range<A>> where A: Zero + Clone + Step1.0.0

type Item = A

-

fn next(&mut self) -> Option<A>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<A> Iterator for StepBy<A, RangeInclusive<A>> where A: Zero + Clone + Step

type Item = A

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn next(&mut self) -> Option<A>

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn size_hint(&self) -> (usize, Option<usize>)

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl<A, R> Debug for StepBy<A, R> where R: Debug, A: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
Unstable (step_by)

: recent addition

-

impl<A, R> Clone for StepBy<A, R> where A: Clone, R: Clone

fn clone(&self) -> StepBy<A, R>

-
Unstable (step_by)

: recent addition

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Take.html b/doc/bitflags/__core/iter/struct.Take.html deleted file mode 100644 index 3bca6372..00000000 --- a/doc/bitflags/__core/iter/struct.Take.html +++ /dev/null @@ -1,171 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Take - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Take - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct Take<I> {
-    // some fields omitted
-}
1.0.0

An iterator that only iterates over the first n iterations of iter.

- -

This struct is created by the take() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<I> Iterator for Take<I> where I: Iterator

type Item = I::Item

-

fn next(&mut self) -> Option<I::Item>

-

fn nth(&mut self, n: usize) -> Option<I::Item>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<I> ExactSizeIterator for Take<I> where I: ExactSizeIterator

fn len(&self) -> usize

-

Derived Implementations

impl<I> Debug for Take<I> where I: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<I> Clone for Take<I> where I: Clone

fn clone(&self) -> Take<I>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.TakeWhile.html b/doc/bitflags/__core/iter/struct.TakeWhile.html deleted file mode 100644 index 160be65d..00000000 --- a/doc/bitflags/__core/iter/struct.TakeWhile.html +++ /dev/null @@ -1,170 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::TakeWhile - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::TakeWhile - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct TakeWhile<I, P> {
-    // some fields omitted
-}
1.0.0

An iterator that only accepts elements while predicate is true.

- -

This struct is created by the take_while() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<I, P> Debug for TakeWhile<I, P> where I: Debug1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<I, P> Iterator for TakeWhile<I, P> where I: Iterator, P: FnMut(&I::Item) -> bool

type Item = I::Item

-

fn next(&mut self) -> Option<I::Item>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl<I, P> Clone for TakeWhile<I, P> where I: Clone, P: Clone

fn clone(&self) -> TakeWhile<I, P>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/struct.Zip.html b/doc/bitflags/__core/iter/struct.Zip.html deleted file mode 100644 index ffb1055e..00000000 --- a/doc/bitflags/__core/iter/struct.Zip.html +++ /dev/null @@ -1,172 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Zip - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::iter::Zip - - [−] - - [src]

-
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
-pub struct Zip<A, B> {
-    // some fields omitted
-}
1.0.0

An iterator that iterates two other iterators simultaneously.

- -

This struct is created by the zip() method on Iterator. See its -documentation for more.

-

Trait Implementations

impl<A, B> Iterator for Zip<A, B> where A: Iterator, B: Iterator

type Item = (A::Item, B::Item)

-

fn next(&mut self) -> Option<(A::Item, B::Item)>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<A, B> DoubleEndedIterator for Zip<A, B> where A: DoubleEndedIterator + ExactSizeIterator, B: DoubleEndedIterator + ExactSizeIterator

fn next_back(&mut self) -> Option<(A::Item, B::Item)>

-

impl<A, B> ExactSizeIterator for Zip<A, B> where B: ExactSizeIterator, A: ExactSizeIterator

fn len(&self) -> usize

-

Derived Implementations

impl<A, B> Debug for Zip<A, B> where A: Debug, B: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<A, B> Clone for Zip<A, B> where A: Clone, B: Clone

fn clone(&self) -> Zip<A, B>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/trait.DoubleEndedIterator.html b/doc/bitflags/__core/iter/trait.DoubleEndedIterator.html deleted file mode 100644 index eb5d6fb0..00000000 --- a/doc/bitflags/__core/iter/trait.DoubleEndedIterator.html +++ /dev/null @@ -1,240 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::DoubleEndedIterator - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::iter::DoubleEndedIterator - - [−] - - [src]

-
pub trait DoubleEndedIterator: Iterator {
-    fn next_back(&mut self) -> Option<Self::Item>;
-}

An iterator able to yield elements from both ends.

- -

Something that implements DoubleEndedIterator has one extra capability -over something that implements Iterator: the ability to also take -Items from the back, as well as the front.

- -

It is important to note that both back and forth work on the same range, -and do not cross: iteration is over when they meet in the middle.

- -

In a similar fashion to the Iterator protocol, once a -DoubleEndedIterator returns None from a next_back(), calling it again -may or may not ever return Some again. next() and next_back() are -interchangable for this purpose.

- -

Examples

-

Basic usage:

- -
-let numbers = vec![1, 2, 3];
-
-let mut iter = numbers.iter();
-
-assert_eq!(Some(&1), iter.next());
-assert_eq!(Some(&3), iter.next_back());
-assert_eq!(Some(&2), iter.next_back());
-assert_eq!(None, iter.next());
-assert_eq!(None, iter.next_back());
-
-

Required Methods

-
-

fn next_back(&mut self) -> Option<Self::Item>

An iterator able to yield elements from both ends.

- -

As this is the only method for this trait, the trait-level docs -contain more details.

- -

Examples

-

Basic usage:

- -
-let numbers = vec![1, 2, 3];
-
-let mut iter = numbers.iter();
-
-assert_eq!(Some(&1), iter.next());
-assert_eq!(Some(&3), iter.next_back());
-assert_eq!(Some(&2), iter.next_back());
-assert_eq!(None, iter.next());
-assert_eq!(None, iter.next_back());
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/trait.ExactSizeIterator.html b/doc/bitflags/__core/iter/trait.ExactSizeIterator.html deleted file mode 100644 index 07646d93..00000000 --- a/doc/bitflags/__core/iter/trait.ExactSizeIterator.html +++ /dev/null @@ -1,255 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::ExactSizeIterator - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::iter::ExactSizeIterator - - [−] - - [src]

-
pub trait ExactSizeIterator: Iterator {
-    fn len(&self) -> usize { ... }
-}

An iterator that knows its exact length.

- -

Many Iterators don't know how many times they will iterate, but some do. -If an iterator knows how many times it can iterate, providing access to -that information can be useful. For example, if you want to iterate -backwards, a good start is to know where the end is.

- -

When implementing an ExactSizeIterator, You must also implement -Iterator. When doing so, the implementation of size_hint() must -return the exact size of the iterator.

- -

The len() method has a default implementation, so you usually shouldn't -implement it. However, you may be able to provide a more performant -implementation than the default, so overriding it in this case makes sense.

- -

Examples

-

Basic usage:

- -
-// a finite range knows exactly how many times it will iterate
-let five = 0..5;
-
-assert_eq!(5, five.len());
- -

In the module level docs, we implemented an Iterator, -Counter. Let's implement ExactSizeIterator for it as well:

- -
-impl ExactSizeIterator for Counter {
-    // We already have the number of iterations, so we can use it directly.
-    fn len(&self) -> usize {
-        self.count
-    }
-}
-
-// And now we can use it!
-
-let counter = Counter::new();
-
-assert_eq!(0, counter.len());
-
-

Provided Methods

-
-

fn len(&self) -> usize

Returns the exact number of times the iterator will iterate.

- -

This method has a default implementation, so you usually should not -implement it directly. However, if you can provide a more efficient -implementation, you can do so. See the trait-level docs for an -example.

- -

This function has the same safety guarantees as the size_hint() -function.

- -

Examples

-

Basic usage:

- -
-// a finite range knows exactly how many times it will iterate
-let five = 0..5;
-
-assert_eq!(5, five.len());
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/trait.Extend.html b/doc/bitflags/__core/iter/trait.Extend.html deleted file mode 100644 index 78646eb3..00000000 --- a/doc/bitflags/__core/iter/trait.Extend.html +++ /dev/null @@ -1,223 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Extend - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::iter::Extend - - [−] - - [src]

-
pub trait Extend<A> {
-    fn extend<T>(&mut self, iter: T) where T: IntoIterator<Item=A>;
-}

Extend a collection with the contents of an iterator.

- -

Iterators produce a series of values, and collections can also be thought -of as a series of values. The Extend trait bridges this gap, allowing you -to extend a collection by including the contents of that iterator.

- -

Examples

-

Basic usage:

- -
-// You can extend a String with some chars:
-let mut message = String::from("The first three letters are: ");
-
-message.extend(&['a', 'b', 'c']);
-
-assert_eq!("abc", &message[29..32]);
- -

Implementing Extend:

- -
-// A sample collection, that's just a wrapper over Vec<T>
-#[derive(Debug)]
-struct MyCollection(Vec<i32>);
-
-// Let's give it some methods so we can create one and add things
-// to it.
-impl MyCollection {
-    fn new() -> MyCollection {
-        MyCollection(Vec::new())
-    }
-
-    fn add(&mut self, elem: i32) {
-        self.0.push(elem);
-    }
-}
-
-// since MyCollection has a list of i32s, we implement Extend for i32
-impl Extend<i32> for MyCollection {
-
-    // This is a bit simpler with the concrete type signature: we can call
-    // extend on anything which can be turned into an Iterator which gives
-    // us i32s. Because we need i32s to put into MyCollection.
-    fn extend<T: IntoIterator<Item=i32>>(&mut self, iter: T) {
-
-        // The implementation is very straightforward: loop through the
-        // iterator, and add() each element to ourselves.
-        for elem in iter {
-            self.add(elem);
-        }
-    }
-}
-
-let mut c = MyCollection::new();
-
-c.add(5);
-c.add(6);
-c.add(7);
-
-// let's extend our collection with three more numbers
-c.extend(vec![1, 2, 3]);
-
-// we've added these elements onto the end
-assert_eq!("MyCollection([5, 6, 7, 1, 2, 3])", format!("{:?}", c));
-
-

Required Methods

-
-

fn extend<T>(&mut self, iter: T) where T: IntoIterator<Item=A>

Extends a collection with the contents of an iterator.

- -

As this is the only method for this trait, the trait-level docs -contain more details.

- -

Examples

-

Basic usage:

- -
-// You can extend a String with some chars:
-let mut message = String::from("abc");
-
-message.extend(['d', 'e', 'f'].iter());
-
-assert_eq!("abcdef", &message);
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/trait.FromIterator.html b/doc/bitflags/__core/iter/trait.FromIterator.html deleted file mode 100644 index 0d4aae6f..00000000 --- a/doc/bitflags/__core/iter/trait.FromIterator.html +++ /dev/null @@ -1,234 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::FromIterator - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::iter::FromIterator - - [−] - - [src]

-
pub trait FromIterator<A> {
-    fn from_iter<T>(iter: T) -> Self where T: IntoIterator<Item=A>;
-}

Conversion from an Iterator.

- -

By implementing FromIterator for a type, you define how it will be -created from an iterator. This is common for types which describe a -collection of some kind.

- -

FromIterator's from_iter() is rarely called explicitly, and is instead -used through Iterator's collect() method. See collect()'s -documentation for more examples.

- -

See also: IntoIterator.

- -

Examples

-

Basic usage:

- -
-use std::iter::FromIterator;
-
-let five_fives = std::iter::repeat(5).take(5);
-
-let v = Vec::from_iter(five_fives);
-
-assert_eq!(v, vec![5, 5, 5, 5, 5]);
- -

Using collect() to implicitly use FromIterator:

- -
-let five_fives = std::iter::repeat(5).take(5);
-
-let v: Vec<i32> = five_fives.collect();
-
-assert_eq!(v, vec![5, 5, 5, 5, 5]);
- -

Implementing FromIterator for your type:

- -
-use std::iter::FromIterator;
-
-// A sample collection, that's just a wrapper over Vec<T>
-#[derive(Debug)]
-struct MyCollection(Vec<i32>);
-
-// Let's give it some methods so we can create one and add things
-// to it.
-impl MyCollection {
-    fn new() -> MyCollection {
-        MyCollection(Vec::new())
-    }
-
-    fn add(&mut self, elem: i32) {
-        self.0.push(elem);
-    }
-}
-
-// and we'll implement FromIterator
-impl FromIterator<i32> for MyCollection {
-    fn from_iter<I: IntoIterator<Item=i32>>(iter: I) -> Self {
-        let mut c = MyCollection::new();
-
-        for i in iter {
-            c.add(i);
-        }
-
-        c
-    }
-}
-
-// Now we can make a new iterator...
-let iter = (0..5).into_iter();
-
-// ... and make a MyCollection out of it
-let c = MyCollection::from_iter(iter);
-
-assert_eq!(c.0, vec![0, 1, 2, 3, 4]);
-
-// collect works too!
-
-let iter = (0..5).into_iter();
-let c: MyCollection = iter.collect();
-
-assert_eq!(c.0, vec![0, 1, 2, 3, 4]);
-
-

Required Methods

-
-

fn from_iter<T>(iter: T) -> Self where T: IntoIterator<Item=A>

Creates a value from an iterator.

- -

See the module-level documentation for more.

- -

Examples

-

Basic usage:

- -
-use std::iter::FromIterator;
-
-let five_fives = std::iter::repeat(5).take(5);
-
-let v = Vec::from_iter(five_fives);
-
-assert_eq!(v, vec![5, 5, 5, 5, 5]);
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/trait.IntoIterator.html b/doc/bitflags/__core/iter/trait.IntoIterator.html deleted file mode 100644 index ee1101c5..00000000 --- a/doc/bitflags/__core/iter/trait.IntoIterator.html +++ /dev/null @@ -1,326 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::IntoIterator - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::iter::IntoIterator - - [−] - - [src]

-
pub trait IntoIterator where Self::IntoIter::Item == Self::Item {
-    type Item;
-    type IntoIter: Iterator;
-    fn into_iter(self) -> Self::IntoIter;
-}

Conversion into an Iterator.

- -

By implementing IntoIterator for a type, you define how it will be -converted to an iterator. This is common for types which describe a -collection of some kind.

- -

One benefit of implementing IntoIterator is that your type will work -with Rust's for loop syntax.

- -

See also: FromIterator.

- -

Examples

-

Basic usage:

- -
-let v = vec![1, 2, 3];
-
-let mut iter = v.into_iter();
-
-let n = iter.next();
-assert_eq!(Some(1), n);
-
-let n = iter.next();
-assert_eq!(Some(2), n);
-
-let n = iter.next();
-assert_eq!(Some(3), n);
-
-let n = iter.next();
-assert_eq!(None, n);
- -

Implementing IntoIterator for your type:

- -
-// A sample collection, that's just a wrapper over Vec<T>
-#[derive(Debug)]
-struct MyCollection(Vec<i32>);
-
-// Let's give it some methods so we can create one and add things
-// to it.
-impl MyCollection {
-    fn new() -> MyCollection {
-        MyCollection(Vec::new())
-    }
-
-    fn add(&mut self, elem: i32) {
-        self.0.push(elem);
-    }
-}
-
-// and we'll implement IntoIterator
-impl IntoIterator for MyCollection {
-    type Item = i32;
-    type IntoIter = ::std::vec::IntoIter<i32>;
-
-    fn into_iter(self) -> Self::IntoIter {
-        self.0.into_iter()
-    }
-}
-
-// Now we can make a new collection...
-let mut c = MyCollection::new();
-
-// ... add some stuff to it ...
-c.add(0);
-c.add(1);
-c.add(2);
-
-// ... and then turn it into an Iterator:
-for (i, n) in c.into_iter().enumerate() {
-    assert_eq!(i as i32, n);
-}
-
-

Associated Types

-
-

type Item

The type of the elements being iterated over.

-

type IntoIter: Iterator

Which kind of iterator are we turning this into?

-
-

Required Methods

-
-

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

- -

See the module-level documentation for more.

- -

Examples

-

Basic usage:

- -
-let v = vec![1, 2, 3];
-
-let mut iter = v.into_iter();
-
-let n = iter.next();
-assert_eq!(Some(1), n);
-
-let n = iter.next();
-assert_eq!(Some(2), n);
-
-let n = iter.next();
-assert_eq!(Some(3), n);
-
-let n = iter.next();
-assert_eq!(None, n);
-
-

Implementors

-
    -
  • impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher
    • -
  • impl<'a, K, V, S> IntoIterator for &'a mut HashMap<K, V, S> where S: BuildHasher, K: Eq + Hash
    • -
  • impl<K, V, S> IntoIterator for HashMap<K, V, S> where S: BuildHasher, K: Eq + Hash
    • -
  • impl<'a, T, S> IntoIterator for &'a HashSet<T, S> where S: BuildHasher, T: Eq + Hash
    • -
  • impl<T, S> IntoIterator for HashSet<T, S> where T: Eq + Hash, S: BuildHasher
    • -
  • impl<T> IntoIterator for LinkedList<T>
    • -
  • impl<'a, T> IntoIterator for &'a LinkedList<T>
    • -
  • impl<'a, T> IntoIterator for &'a mut LinkedList<T>
    • -
  • impl<T> IntoIterator for VecDeque<T>
    • -
  • impl<'a, T> IntoIterator for &'a VecDeque<T>
    • -
  • impl<'a, T> IntoIterator for &'a mut VecDeque<T>
    • -
  • impl<T> IntoIterator for BinaryHeap<T> where T: Ord
    • -
  • impl<'a, T> IntoIterator for &'a BinaryHeap<T> where T: Ord
    • -
  • impl<'a> IntoIterator for &'a UnixListener
    • -
  • impl<'a> IntoIterator for &'a PathBuf
    • -
  • impl<'a> IntoIterator for &'a Path
    • -
  • impl<'a, T> IntoIterator for &'a Receiver<T>
    • -
  • impl<T> IntoIterator for Receiver<T>
    • -
  • impl<T> IntoIterator for Vec<T>
    • -
  • impl<'a, T> IntoIterator for &'a Vec<T>
    • -
  • impl<'a, T> IntoIterator for &'a mut Vec<T>
    • -
  • impl<I> IntoIterator for I where I: Iterator
    • -
  • impl<T, E> IntoIterator for Result<T, E>
    • -
  • impl<'a, T, E> IntoIterator for &'a Result<T, E>
    • -
  • impl<'a, T, E> IntoIterator for &'a mut Result<T, E>
    • -
  • impl<T> IntoIterator for Option<T>
    • -
  • impl<'a, T> IntoIterator for &'a Option<T>
    • -
  • impl<'a, T> IntoIterator for &'a mut Option<T>
    • -
  • impl<'a, T> IntoIterator for &'a [T; 0]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 0]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 1]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 1]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 2]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 2]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 3]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 3]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 4]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 4]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 5]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 5]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 6]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 6]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 7]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 7]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 8]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 8]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 9]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 9]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 10]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 10]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 11]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 11]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 12]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 12]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 13]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 13]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 14]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 14]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 15]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 15]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 16]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 16]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 17]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 17]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 18]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 18]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 19]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 19]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 20]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 20]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 21]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 21]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 22]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 22]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 23]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 23]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 24]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 24]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 25]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 25]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 26]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 26]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 27]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 27]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 28]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 28]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 29]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 29]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 30]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 30]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 31]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 31]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 32]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 32]
    • -
  • impl<'a, T> IntoIterator for &'a [T]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T]
    • -
  • impl<'a, K, V> IntoIterator for &'a BTreeMap<K, V> where K: 'a, V: 'a
    • -
  • impl<'a, K, V> IntoIterator for &'a mut BTreeMap<K, V> where V: 'a, K: 'a
    • -
  • impl<K, V> IntoIterator for BTreeMap<K, V>
    • -
  • impl<T> IntoIterator for BTreeSet<T>
    • -
  • impl<'a, T> IntoIterator for &'a BTreeSet<T>
    • -
  • impl<'a, E> IntoIterator for &'a EnumSet<E> where E: CLike
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/trait.Iterator.html b/doc/bitflags/__core/iter/trait.Iterator.html deleted file mode 100644 index 1a9c0015..00000000 --- a/doc/bitflags/__core/iter/trait.Iterator.html +++ /dev/null @@ -1,1671 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Iterator - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::iter::Iterator - - [−] - - [src]

-
pub trait Iterator {
-    type Item;
-    fn next(&mut self) -> Option<Self::Item>;
-
-    fn size_hint(&self) -> (usize, Option<usize>) { ... }
-    fn count(self) -> usize { ... }
-    fn last(self) -> Option<Self::Item> { ... }
-    fn nth(&mut self, n: usize) -> Option<Self::Item> { ... }
-    fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item> { ... }
-    fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator { ... }
-    fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B { ... }
-    fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool { ... }
-    fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B> { ... }
-    fn enumerate(self) -> Enumerate<Self> { ... }
-    fn peekable(self) -> Peekable<Self> { ... }
-    fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool { ... }
-    fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool { ... }
-    fn skip(self, n: usize) -> Skip<Self> { ... }
-    fn take(self, n: usize) -> Take<Self> { ... }
-    fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B> { ... }
-    fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator { ... }
-    fn fuse(self) -> Fuse<Self> { ... }
-    fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> () { ... }
-    fn by_ref(&mut self) -> &mut Self { ... }
-    fn collect<B>(self) -> B where B: FromIterator<Self::Item> { ... }
-    fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item> { ... }
-    fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B { ... }
-    fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool { ... }
-    fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool { ... }
-    fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool { ... }
-    fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool { ... }
-    fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator { ... }
-    fn max(self) -> Option<Self::Item> where Self::Item: Ord { ... }
-    fn min(self) -> Option<Self::Item> where Self::Item: Ord { ... }
-    fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B { ... }
-    fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B { ... }
-    fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator { ... }
-    fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)> { ... }
-    fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone { ... }
-    fn cycle(self) -> Cycle<Self> where Self: Clone { ... }
-    fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero { ... }
-    fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One { ... }
-    fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord { ... }
-    fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item> { ... }
-    fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item> { ... }
-    fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item> { ... }
-    fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item> { ... }
-    fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item> { ... }
-    fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item> { ... }
-    fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item> { ... }
-}

An interface for dealing with iterators.

- -

This is the main iterator trait. For more about the concept of iterators -generally, please see the module-level documentation. In particular, you -may want to know how to implement Iterator.

-
-

Associated Types

-
-

type Item

The type of the elements being iterated over.

-
-

Required Methods

-
-

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value.

- -

Returns None when iteration is finished. Individual iterator -implementations may choose to resume iteration, and so calling next() -again may or may not eventually start returning Some(Item) again at some -point.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter();
-
-// A call to next() returns the next value...
-assert_eq!(Some(&1), iter.next());
-assert_eq!(Some(&2), iter.next());
-assert_eq!(Some(&3), iter.next());
-
-// ... and then None once it's over.
-assert_eq!(None, iter.next());
-
-// More calls may or may not return None. Here, they always will.
-assert_eq!(None, iter.next());
-assert_eq!(None, iter.next());
-
-

Provided Methods

-
-

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

- -

Specifically, size_hint() returns a tuple where the first element -is the lower bound, and the second element is the upper bound.

- -

The second half of the tuple that is returned is an Option<usize>. A -None here means that either there is no known upper bound, or the -upper bound is larger than usize.

- -

Implementation notes

-

It is not enforced that an iterator implementation yields the declared -number of elements. A buggy iterator may yield less than the lower bound -or more than the upper bound of elements.

- -

size_hint() is primarily intended to be used for optimizations such as -reserving space for the elements of the iterator, but must not be -trusted to e.g. omit bounds checks in unsafe code. An incorrect -implementation of size_hint() should not lead to memory safety -violations.

- -

That said, the implementation should provide a correct estimation, -because otherwise it would be a violation of the trait's protocol.

- -

The default implementation returns (0, None) which is correct for any -iterator.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-let iter = a.iter();
-
-assert_eq!((3, Some(3)), iter.size_hint());
- -

A more complex example:

- -
-// The even numbers from zero to ten.
-let iter = (0..10).filter(|x| x % 2 == 0);
-
-// We might iterate from zero to ten times. Knowing that it's five
-// exactly wouldn't be possible without executing filter().
-assert_eq!((0, Some(10)), iter.size_hint());
-
-// Let's add one five more numbers with chain()
-let iter = (0..10).filter(|x| x % 2 == 0).chain(15..20);
-
-// now both bounds are increased by five
-assert_eq!((5, Some(15)), iter.size_hint());
- -

Returning None for an upper bound:

- -
-// an infinite iterator has no upper bound
-let iter = 0..;
-
-assert_eq!((0, None), iter.size_hint());
-

fn count(self) -> usize

Consumes the iterator, counting the number of iterations and returning it.

- -

This method will evaluate the iterator until its next() returns -None. Once None is encountered, count() returns the number of -times it called next().

- -

Overflow Behavior

-

The method does no guarding against overflows, so counting elements of -an iterator with more than usize::MAX elements either produces the -wrong result or panics. If debug assertions are enabled, a panic is -guaranteed.

- -

Panics

-

This function might panic if the iterator has more than usize::MAX -elements.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-assert_eq!(a.iter().count(), 3);
-
-let a = [1, 2, 3, 4, 5];
-assert_eq!(a.iter().count(), 5);
-

fn last(self) -> Option<Self::Item>

Consumes the iterator, returning the last element.

- -

This method will evaluate the iterator until it returns None. While -doing so, it keeps track of the current element. After None is -returned, last() will then return the last element it saw.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-assert_eq!(a.iter().last(), Some(&3));
-
-let a = [1, 2, 3, 4, 5];
-assert_eq!(a.iter().last(), Some(&5));
-

fn nth(&mut self, n: usize) -> Option<Self::Item>

Consumes the n first elements of the iterator, then returns the -next() one.

- -

This method will evaluate the iterator n times, discarding those elements. -After it does so, it will call next() and return its value.

- -

Like most indexing operations, the count starts from zero, so nth(0) -returns the first value, nth(1) the second, and so on.

- -

nth() will return None if n is larger than the length of the -iterator.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-assert_eq!(a.iter().nth(1), Some(&2));
- -

Calling nth() multiple times doesn't rewind the iterator:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter();
-
-assert_eq!(iter.nth(1), Some(&2));
-assert_eq!(iter.nth(1), None);
- -

Returning None if there are less than n elements:

- -
-let a = [1, 2, 3];
-assert_eq!(a.iter().nth(10), None);
-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

Takes two iterators and creates a new iterator over both in sequence.

- -

chain() will return a new iterator which will first iterate over -values from the first iterator and then over values from the second -iterator.

- -

In other words, it links two iterators together, in a chain. 🔗

- -

Examples

-

Basic usage:

- -
-let a1 = [1, 2, 3];
-let a2 = [4, 5, 6];
-
-let mut iter = a1.iter().chain(a2.iter());
-
-assert_eq!(iter.next(), Some(&1));
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), Some(&3));
-assert_eq!(iter.next(), Some(&4));
-assert_eq!(iter.next(), Some(&5));
-assert_eq!(iter.next(), Some(&6));
-assert_eq!(iter.next(), None);
- -

Since the argument to chain() uses IntoIterator, we can pass -anything that can be converted into an Iterator, not just an -Iterator itself. For example, slices (&[T]) implement -IntoIterator, and so can be passed to chain() directly:

- -
-let s1 = &[1, 2, 3];
-let s2 = &[4, 5, 6];
-
-let mut iter = s1.iter().chain(s2);
-
-assert_eq!(iter.next(), Some(&1));
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), Some(&3));
-assert_eq!(iter.next(), Some(&4));
-assert_eq!(iter.next(), Some(&5));
-assert_eq!(iter.next(), Some(&6));
-assert_eq!(iter.next(), None);
-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

'Zips up' two iterators into a single iterator of pairs.

- -

zip() returns a new iterator that will iterate over two other -iterators, returning a tuple where the first element comes from the -first iterator, and the second element comes from the second iterator.

- -

In other words, it zips two iterators together, into a single one.

- -

When either iterator returns None, all further calls to next() -will return None.

- -

Examples

-

Basic usage:

- -
-let a1 = [1, 2, 3];
-let a2 = [4, 5, 6];
-
-let mut iter = a1.iter().zip(a2.iter());
-
-assert_eq!(iter.next(), Some((&1, &4)));
-assert_eq!(iter.next(), Some((&2, &5)));
-assert_eq!(iter.next(), Some((&3, &6)));
-assert_eq!(iter.next(), None);
- -

Since the argument to zip() uses IntoIterator, we can pass -anything that can be converted into an Iterator, not just an -Iterator itself. For example, slices (&[T]) implement -IntoIterator, and so can be passed to zip() directly:

- -
-let s1 = &[1, 2, 3];
-let s2 = &[4, 5, 6];
-
-let mut iter = s1.iter().zip(s2);
-
-assert_eq!(iter.next(), Some((&1, &4)));
-assert_eq!(iter.next(), Some((&2, &5)));
-assert_eq!(iter.next(), Some((&3, &6)));
-assert_eq!(iter.next(), None);
- -

zip() is often used to zip an infinite iterator to a finite one. -This works because the finite iterator will eventually return None, -ending the zipper. Zipping with (0..) can look a lot like enumerate():

- -
-let enumerate: Vec<_> = "foo".chars().enumerate().collect();
-
-let zipper: Vec<_> = (0..).zip("foo".chars()).collect();
-
-assert_eq!((0, 'f'), enumerate[0]);
-assert_eq!((0, 'f'), zipper[0]);
-
-assert_eq!((1, 'o'), enumerate[1]);
-assert_eq!((1, 'o'), zipper[1]);
-
-assert_eq!((2, 'o'), enumerate[2]);
-assert_eq!((2, 'o'), zipper[2]);
-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

Takes a closure and creates an iterator which calls that closure on each -element.

- -

map() transforms one iterator into another, by means of its argument: -something that implements FnMut. It produces a new iterator which -calls this closure on each element of the original iterator.

- -

If you are good at thinking in types, you can think of map() like this: -If you have an iterator that gives you elements of some type A, and -you want an iterator of some other type B, you can use map(), -passing a closure that takes an A and returns a B.

- -

map() is conceptually similar to a for loop. However, as map() is -lazy, it is best used when you're already working with other iterators. -If you're doing some sort of looping for a side effect, it's considered -more idiomatic to use for than map().

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.into_iter().map(|x| 2 * x);
-
-assert_eq!(iter.next(), Some(2));
-assert_eq!(iter.next(), Some(4));
-assert_eq!(iter.next(), Some(6));
-assert_eq!(iter.next(), None);
- -

If you're doing some sort of side effect, prefer for to map():

- -
-// don't do this:
-(0..5).map(|x| println!("{}", x));
-
-// it won't even execute, as it is lazy. Rust will warn you about this.
-
-// Instead, use for:
-for x in 0..5 {
-    println!("{}", x);
-}
-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

Creates an iterator which uses a closure to determine if an element -should be yielded.

- -

The closure must return true or false. filter() creates an -iterator which calls this closure on each element. If the closure -returns true, then the element is returned. If the closure returns -false, it will try again, and call the closure on the next element, -seeing if it passes the test.

- -

Examples

-

Basic usage:

- -
-let a = [0i32, 1, 2];
-
-let mut iter = a.into_iter().filter(|x| x.is_positive());
-
-assert_eq!(iter.next(), Some(&1));
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), None);
- -

Because the closure passed to filter() takes a reference, and many -iterators iterate over references, this leads to a possibly confusing -situation, where the type of the closure is a double reference:

- -
-let a = [0, 1, 2];
-
-let mut iter = a.into_iter().filter(|x| **x > 1); // need two *s!
-
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), None);
- -

It's common to instead use destructuring on the argument to strip away -one:

- -
-let a = [0, 1, 2];
-
-let mut iter = a.into_iter().filter(|&x| *x > 1); // both & and *
-
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), None);
- -

or both:

- -
-let a = [0, 1, 2];
-
-let mut iter = a.into_iter().filter(|&&x| x > 1); // two &s
-
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), None);
- -

of these layers.

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

Creates an iterator that both filters and maps.

- -

The closure must return an Option<T>. filter_map() creates an -iterator which calls this closure on each element. If the closure -returns Some(element), then that element is returned. If the -closure returns None, it will try again, and call the closure on the -next element, seeing if it will return Some.

- -

Why filter_map() and not just filter().map()? The key is in this -part:

- -
-

If the closure returns Some(element), then that element is returned.

-
- -

In other words, it removes the Option<T> layer automatically. If your -mapping is already returning an Option<T> and you want to skip over -Nones, then filter_map() is much, much nicer to use.

- -

Examples

-

Basic usage:

- -
-let a = ["1", "2", "lol"];
-
-let mut iter = a.iter().filter_map(|s| s.parse().ok());
-
-assert_eq!(iter.next(), Some(1));
-assert_eq!(iter.next(), Some(2));
-assert_eq!(iter.next(), None);
- -

Here's the same example, but with filter() and map():

- -
-let a = ["1", "2", "lol"];
-
-let mut iter = a.iter()
-                .map(|s| s.parse().ok())
-                .filter(|s| s.is_some());
-
-assert_eq!(iter.next(), Some(Some(1)));
-assert_eq!(iter.next(), Some(Some(2)));
-assert_eq!(iter.next(), None);
- -

There's an extra layer of Some in there.

-

fn enumerate(self) -> Enumerate<Self>

Creates an iterator which gives the current iteration count as well as -the next value.

- -

The iterator returned yields pairs (i, val), where i is the -current index of iteration and val is the value returned by the -iterator.

- -

enumerate() keeps its count as a usize. If you want to count by a -different sized integer, the zip() function provides similar -functionality.

- -

Overflow Behavior

-

The method does no guarding against overflows, so enumerating more than -usize::MAX elements either produces the wrong result or panics. If -debug assertions are enabled, a panic is guaranteed.

- -

Panics

-

The returned iterator might panic if the to-be-returned index would -overflow a usize.

- -

Examples

-
-let a = ['a', 'b', 'c'];
-
-let mut iter = a.iter().enumerate();
-
-assert_eq!(iter.next(), Some((0, &'a')));
-assert_eq!(iter.next(), Some((1, &'b')));
-assert_eq!(iter.next(), Some((2, &'c')));
-assert_eq!(iter.next(), None);
-

fn peekable(self) -> Peekable<Self>

Creates an iterator which can use peek to look at the next element of -the iterator without consuming it.

- -

Adds a peek() method to an iterator. See its documentation for -more information.

- -

Note that the underlying iterator is still advanced when peek is -called for the first time: In order to retrieve the next element, -next is called on the underlying iterator, hence any side effects of -the next method will occur.

- -

Examples

-

Basic usage:

- -
-let xs = [1, 2, 3];
-
-let mut iter = xs.iter().peekable();
-
-// peek() lets us see into the future
-assert_eq!(iter.peek(), Some(&&1));
-assert_eq!(iter.next(), Some(&1));
-
-assert_eq!(iter.next(), Some(&2));
-
-// we can peek() multiple times, the iterator won't advance
-assert_eq!(iter.peek(), Some(&&3));
-assert_eq!(iter.peek(), Some(&&3));
-
-assert_eq!(iter.next(), Some(&3));
-
-// after the iterator is finished, so is peek()
-assert_eq!(iter.peek(), None);
-assert_eq!(iter.next(), None);
-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

Creates an iterator that skip()s elements based on a predicate.

- -

skip_while() takes a closure as an argument. It will call this -closure on each element of the iterator, and ignore elements -until it returns false.

- -

After false is returned, skip_while()'s job is over, and the -rest of the elements are yielded.

- -

Examples

-

Basic usage:

- -
-let a = [-1i32, 0, 1];
-
-let mut iter = a.into_iter().skip_while(|x| x.is_negative());
-
-assert_eq!(iter.next(), Some(&0));
-assert_eq!(iter.next(), Some(&1));
-assert_eq!(iter.next(), None);
- -

Because the closure passed to skip_while() takes a reference, and many -iterators iterate over references, this leads to a possibly confusing -situation, where the type of the closure is a double reference:

- -
-let a = [-1, 0, 1];
-
-let mut iter = a.into_iter().skip_while(|x| **x < 0); // need two *s!
-
-assert_eq!(iter.next(), Some(&0));
-assert_eq!(iter.next(), Some(&1));
-assert_eq!(iter.next(), None);
- -

Stopping after an initial false:

- -
-let a = [-1, 0, 1, -2];
-
-let mut iter = a.into_iter().skip_while(|x| **x < 0);
-
-assert_eq!(iter.next(), Some(&0));
-assert_eq!(iter.next(), Some(&1));
-
-// while this would have been false, since we already got a false,
-// skip_while() isn't used any more
-assert_eq!(iter.next(), Some(&-2));
-
-assert_eq!(iter.next(), None);
-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

Creates an iterator that yields elements based on a predicate.

- -

take_while() takes a closure as an argument. It will call this -closure on each element of the iterator, and yield elements -while it returns true.

- -

After false is returned, take_while()'s job is over, and the -rest of the elements are ignored.

- -

Examples

-

Basic usage:

- -
-let a = [-1i32, 0, 1];
-
-let mut iter = a.into_iter().take_while(|x| x.is_negative());
-
-assert_eq!(iter.next(), Some(&-1));
-assert_eq!(iter.next(), None);
- -

Because the closure passed to take_while() takes a reference, and many -iterators iterate over references, this leads to a possibly confusing -situation, where the type of the closure is a double reference:

- -
-let a = [-1, 0, 1];
-
-let mut iter = a.into_iter().take_while(|x| **x < 0); // need two *s!
-
-assert_eq!(iter.next(), Some(&-1));
-assert_eq!(iter.next(), None);
- -

Stopping after an initial false:

- -
-let a = [-1, 0, 1, -2];
-
-let mut iter = a.into_iter().take_while(|x| **x < 0);
-
-assert_eq!(iter.next(), Some(&-1));
-
-// We have more elements that are less than zero, but since we already
-// got a false, take_while() isn't used any more
-assert_eq!(iter.next(), None);
- -

Because take_while() needs to look at the value in order to see if it -should be included or not, consuming iterators will see that it is -removed:

- -
-let a = [1, 2, 3, 4];
-let mut iter = a.into_iter();
-
-let result: Vec<i32> = iter.by_ref()
-                           .take_while(|n| **n != 3)
-                           .cloned()
-                           .collect();
-
-assert_eq!(result, &[1, 2]);
-
-let result: Vec<i32> = iter.cloned().collect();
-
-assert_eq!(result, &[4]);
- -

The 3 is no longer there, because it was consumed in order to see if -the iteration should stop, but wasn't placed back into the iterator or -some similar thing.

-

fn skip(self, n: usize) -> Skip<Self>

Creates an iterator that skips the first n elements.

- -

After they have been consumed, the rest of the elements are yielded.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter().skip(2);
-
-assert_eq!(iter.next(), Some(&3));
-assert_eq!(iter.next(), None);
-

fn take(self, n: usize) -> Take<Self>

Creates an iterator that yields its first n elements.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter().take(2);
-
-assert_eq!(iter.next(), Some(&1));
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), None);
- -

take() is often used with an infinite iterator, to make it finite:

- -
-let mut iter = (0..).take(3);
-
-assert_eq!(iter.next(), Some(0));
-assert_eq!(iter.next(), Some(1));
-assert_eq!(iter.next(), Some(2));
-assert_eq!(iter.next(), None);
-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

An iterator adaptor similar to fold() that holds internal state and -produces a new iterator.

- -

scan() takes two arguments: an initial value which seeds the internal -state, and a closure with two arguments, the first being a mutable -reference to the internal state and the second an iterator element. -The closure can assign to the internal state to share state between -iterations.

- -

On iteration, the closure will be applied to each element of the -iterator and the return value from the closure, an Option, is -yielded by the iterator.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter().scan(1, |state, &x| {
-    // each iteration, we'll multiply the state by the element
-    *state = *state * x;
-
-    // the value passed on to the next iteration
-    Some(*state)
-});
-
-assert_eq!(iter.next(), Some(1));
-assert_eq!(iter.next(), Some(2));
-assert_eq!(iter.next(), Some(6));
-assert_eq!(iter.next(), None);
-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

Creates an iterator that works like map, but flattens nested structure.

- -

The map() adapter is very useful, but only when the closure -argument produces values. If it produces an iterator instead, there's -an extra layer of indirection. flat_map() will remove this extra layer -on its own.

- -

Another way of thinking about flat_map(): map()'s closure returns -one item for each element, and flat_map()'s closure returns an -iterator for each element.

- -

Examples

-

Basic usage:

- -
-let words = ["alpha", "beta", "gamma"];
-
-// chars() returns an iterator
-let merged: String = words.iter()
-                          .flat_map(|s| s.chars())
-                          .collect();
-assert_eq!(merged, "alphabetagamma");
-

fn fuse(self) -> Fuse<Self>

Creates an iterator which ends after the first None.

- -

After an iterator returns None, future calls may or may not yield -Some(T) again. fuse() adapts an iterator, ensuring that after a -None is given, it will always return None forever.

- -

Examples

-

Basic usage:

- -
-// an iterator which alternates between Some and None
-struct Alternate {
-    state: i32,
-}
-
-impl Iterator for Alternate {
-    type Item = i32;
-
-    fn next(&mut self) -> Option<i32> {
-        let val = self.state;
-        self.state = self.state + 1;
-
-        // if it's even, Some(i32), else None
-        if val % 2 == 0 {
-            Some(val)
-        } else {
-            None
-        }
-    }
-}
-
-let mut iter = Alternate { state: 0 };
-
-// we can see our iterator going back and forth
-assert_eq!(iter.next(), Some(0));
-assert_eq!(iter.next(), None);
-assert_eq!(iter.next(), Some(2));
-assert_eq!(iter.next(), None);
-
-// however, once we fuse it...
-let mut iter = iter.fuse();
-
-assert_eq!(iter.next(), Some(4));
-assert_eq!(iter.next(), None);
-
-// it will always return None after the first time.
-assert_eq!(iter.next(), None);
-assert_eq!(iter.next(), None);
-assert_eq!(iter.next(), None);
-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

Do something with each element of an iterator, passing the value on.

- -

When using iterators, you'll often chain several of them together. -While working on such code, you might want to check out what's -happening at various parts in the pipeline. To do that, insert -a call to inspect().

- -

It's much more common for inspect() to be used as a debugging tool -than to exist in your final code, but never say never.

- -

Examples

-

Basic usage:

- -
-let a = [1, 4, 2, 3];
-
-// this iterator sequence is complex.
-let sum = a.iter()
-            .cloned()
-            .filter(|&x| x % 2 == 0)
-            .fold(0, |sum, i| sum + i);
-
-println!("{}", sum);
-
-// let's add some inspect() calls to investigate what's happening
-let sum = a.iter()
-            .cloned()
-            .inspect(|x| println!("about to filter: {}", x))
-            .filter(|&x| x % 2 == 0)
-            .inspect(|x| println!("made it through filter: {}", x))
-            .fold(0, |sum, i| sum + i);
-
-println!("{}", sum);
- -

This will print:

- -
about to filter: 1
-about to filter: 4
-made it through filter: 4
-about to filter: 2
-made it through filter: 2
-about to filter: 3
-6
-
-

fn by_ref(&mut self) -> &mut Self

Borrows an iterator, rather than consuming it.

- -

This is useful to allow applying iterator adaptors while still -retaining ownership of the original iterator.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let iter = a.into_iter();
-
-let sum: i32 = iter.take(5)
-                   .fold(0, |acc, &i| acc + i );
-
-assert_eq!(sum, 6);
-
-// if we try to use iter again, it won't work. The following line
-// gives "error: use of moved value: `iter`
-// assert_eq!(iter.next(), None);
-
-// let's try that again
-let a = [1, 2, 3];
-
-let mut iter = a.into_iter();
-
-// instead, we add in a .by_ref()
-let sum: i32 = iter.by_ref()
-                   .take(2)
-                   .fold(0, |acc, &i| acc + i );
-
-assert_eq!(sum, 3);
-
-// now this is just fine:
-assert_eq!(iter.next(), Some(&3));
-assert_eq!(iter.next(), None);
-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

Transforms an iterator into a collection.

- -

collect() can take anything iterable, and turn it into a relevant -collection. This is one of the more powerful methods in the standard -library, used in a variety of contexts.

- -

The most basic pattern in which collect() is used is to turn one -collection into another. You take a collection, call iter() on it, -do a bunch of transformations, and then collect() at the end.

- -

One of the keys to collect()'s power is that many things you might -not think of as 'collections' actually are. For example, a String -is a collection of chars. And a collection of Result<T, E> can -be thought of as single Result<Collection<T>, E>. See the examples -below for more.

- -

Because collect() is so general, it can cause problems with type -inference. As such, collect() is one of the few times you'll see -the syntax affectionately known as the 'turbofish': ::<>. This -helps the inference algorithm understand specifically which collection -you're trying to collect into.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let doubled: Vec<i32> = a.iter()
-                         .map(|&x| x * 2)
-                         .collect();
-
-assert_eq!(vec![2, 4, 6], doubled);
- -

Note that we needed the : Vec<i32> on the left-hand side. This is because -we could collect into, for example, a VecDeque<T> instead:

- -
-use std::collections::VecDeque;
-
-let a = [1, 2, 3];
-
-let doubled: VecDeque<i32> = a.iter()
-                              .map(|&x| x * 2)
-                              .collect();
-
-assert_eq!(2, doubled[0]);
-assert_eq!(4, doubled[1]);
-assert_eq!(6, doubled[2]);
- -

Using the 'turbofish' instead of annotating doubled:

- -
-let a = [1, 2, 3];
-
-let doubled = a.iter()
-               .map(|&x| x * 2)
-               .collect::<Vec<i32>>();
-
-assert_eq!(vec![2, 4, 6], doubled);
- -

Because collect() cares about what you're collecting into, you can -still use a partial type hint, _, with the turbofish:

- -
-let a = [1, 2, 3];
-
-let doubled = a.iter()
-               .map(|&x| x * 2)
-               .collect::<Vec<_>>();
-
-assert_eq!(vec![2, 4, 6], doubled);
- -

Using collect() to make a String:

- -
-let chars = ['g', 'd', 'k', 'k', 'n'];
-
-let hello: String = chars.iter()
-                         .map(|&x| x as u8)
-                         .map(|x| (x + 1) as char)
-                         .collect();
-
-assert_eq!("hello", hello);
- -

If you have a list of Result<T, E>s, you can use collect() to -see if any of them failed:

- -
-let results = [Ok(1), Err("nope"), Ok(3), Err("bad")];
-
-let result: Result<Vec<_>, &str> = results.iter().cloned().collect();
-
-// gives us the first error
-assert_eq!(Err("nope"), result);
-
-let results = [Ok(1), Ok(3)];
-
-let result: Result<Vec<_>, &str> = results.iter().cloned().collect();
-
-// gives us the list of answers
-assert_eq!(Ok(vec![1, 3]), result);
-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

Consumes an iterator, creating two collections from it.

- -

The predicate passed to partition() can return true, or false. -partition() returns a pair, all of the elements for which it returned -true, and all of the elements for which it returned false.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let (even, odd): (Vec<i32>, Vec<i32>) = a.into_iter()
-                                         .partition(|&n| n % 2 == 0);
-
-assert_eq!(even, vec![2]);
-assert_eq!(odd, vec![1, 3]);
-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

An iterator adaptor that applies a function, producing a single, final value.

- -

fold() takes two arguments: an initial value, and a closure with two -arguments: an 'accumulator', and an element. The closure returns the value that -the accumulator should have for the next iteration.

- -

The initial value is the value the accumulator will have on the first -call.

- -

After applying this closure to every element of the iterator, fold() -returns the accumulator.

- -

This operation is sometimes called 'reduce' or 'inject'.

- -

Folding is useful whenever you have a collection of something, and want -to produce a single value from it.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-// the sum of all of the elements of a
-let sum = a.iter()
-           .fold(0, |acc, &x| acc + x);
-
-assert_eq!(sum, 6);
- -

Let's walk through each step of the iteration here:

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
elementaccxresult
0
1011
2123
3336
- -

And so, our final result, 6.

- -

It's common for people who haven't used iterators a lot to -use a for loop with a list of things to build up a result. Those -can be turned into fold()s:

- -
-let numbers = [1, 2, 3, 4, 5];
-
-let mut result = 0;
-
-// for loop:
-for i in &numbers {
-    result = result + i;
-}
-
-// fold:
-let result2 = numbers.iter().fold(0, |acc, &x| acc + x);
-
-// they're the same
-assert_eq!(result, result2);
-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

Tests if every element of the iterator matches a predicate.

- -

all() takes a closure that returns true or false. It applies -this closure to each element of the iterator, and if they all return -true, then so does all(). If any of them return false, it -returns false.

- -

all() is short-circuiting; in other words, it will stop processing -as soon as it finds a false, given that no matter what else happens, -the result will also be false.

- -

An empty iterator returns true.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-assert!(a.iter().all(|&x| x > 0));
-
-assert!(!a.iter().all(|&x| x > 2));
- -

Stopping at the first false:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter();
-
-assert!(!iter.all(|&x| x != 2));
-
-// we can still use `iter`, as there are more elements.
-assert_eq!(iter.next(), Some(&3));
-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

Tests if any element of the iterator matches a predicate.

- -

any() takes a closure that returns true or false. It applies -this closure to each element of the iterator, and if any of them return -true, then so does any(). If they all return false, it -returns false.

- -

any() is short-circuiting; in other words, it will stop processing -as soon as it finds a true, given that no matter what else happens, -the result will also be true.

- -

An empty iterator returns false.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-assert!(a.iter().any(|&x| x > 0));
-
-assert!(!a.iter().any(|&x| x > 5));
- -

Stopping at the first true:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter();
-
-assert!(iter.any(|&x| x != 2));
-
-// we can still use `iter`, as there are more elements.
-assert_eq!(iter.next(), Some(&2));
-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

Searches for an element of an iterator that satisfies a predicate.

- -

find() takes a closure that returns true or false. It applies -this closure to each element of the iterator, and if any of them return -true, then find() returns Some(element). If they all return -false, it returns None.

- -

find() is short-circuiting; in other words, it will stop processing -as soon as the closure returns true.

- -

Because find() takes a reference, and many iterators iterate over -references, this leads to a possibly confusing situation where the -argument is a double reference. You can see this effect in the -examples below, with &&x.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-assert_eq!(a.iter().find(|&&x| x == 2), Some(&2));
-
-assert_eq!(a.iter().find(|&&x| x == 5), None);
- -

Stopping at the first true:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter();
-
-assert_eq!(iter.find(|&&x| x == 2), Some(&2));
-
-// we can still use `iter`, as there are more elements.
-assert_eq!(iter.next(), Some(&3));
-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

Searches for an element in an iterator, returning its index.

- -

position() takes a closure that returns true or false. It applies -this closure to each element of the iterator, and if one of them -returns true, then position() returns Some(index). If all of -them return false, it returns None.

- -

position() is short-circuiting; in other words, it will stop -processing as soon as it finds a true.

- -

Overflow Behavior

-

The method does no guarding against overflows, so if there are more -than usize::MAX non-matching elements, it either produces the wrong -result or panics. If debug assertions are enabled, a panic is -guaranteed.

- -

Panics

-

This function might panic if the iterator has more than usize::MAX -non-matching elements.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-assert_eq!(a.iter().position(|&x| x == 2), Some(1));
-
-assert_eq!(a.iter().position(|&x| x == 5), None);
- -

Stopping at the first true:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter();
-
-assert_eq!(iter.position(|&x| x == 2), Some(1));
-
-// we can still use `iter`, as there are more elements.
-assert_eq!(iter.next(), Some(&3));
-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

Searches for an element in an iterator from the right, returning its -index.

- -

rposition() takes a closure that returns true or false. It applies -this closure to each element of the iterator, starting from the end, -and if one of them returns true, then rposition() returns -Some(index). If all of them return false, it returns None.

- -

rposition() is short-circuiting; in other words, it will stop -processing as soon as it finds a true.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-assert_eq!(a.iter().rposition(|&x| x == 3), Some(2));
-
-assert_eq!(a.iter().rposition(|&x| x == 5), None);
- -

Stopping at the first true:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter();
-
-assert_eq!(iter.rposition(|&x| x == 2), Some(1));
-
-// we can still use `iter`, as there are more elements.
-assert_eq!(iter.next(), Some(&1));
-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

Returns the maximum element of an iterator.

- -

If the two elements are equally maximum, the latest element is -returned.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-assert_eq!(a.iter().max(), Some(&3));
-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

Returns the minimum element of an iterator.

- -

If the two elements are equally minimum, the first element is -returned.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-assert_eq!(a.iter().min(), Some(&1));
-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

Returns the element that gives the maximum value from the -specified function.

- -

Returns the rightmost element if the comparison determines two elements -to be equally maximum.

- -

Examples

-
-let a = [-3_i32, 0, 1, 5, -10];
-assert_eq!(*a.iter().max_by_key(|x| x.abs()).unwrap(), -10);
-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

Returns the element that gives the minimum value from the -specified function.

- -

Returns the latest element if the comparison determines two elements -to be equally minimum.

- -

Examples

-
-let a = [-3_i32, 0, 1, 5, -10];
-assert_eq!(*a.iter().min_by_key(|x| x.abs()).unwrap(), 0);
-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

Reverses an iterator's direction.

- -

Usually, iterators iterate from left to right. After using rev(), -an iterator will instead iterate from right to left.

- -

This is only possible if the iterator has an end, so rev() only -works on DoubleEndedIterators.

- -

Examples

-
-let a = [1, 2, 3];
-
-let mut iter = a.iter().rev();
-
-assert_eq!(iter.next(), Some(&3));
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), Some(&1));
-
-assert_eq!(iter.next(), None);
-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

Converts an iterator of pairs into a pair of containers.

- -

unzip() consumes an entire iterator of pairs, producing two -collections: one from the left elements of the pairs, and one -from the right elements.

- -

This function is, in some sense, the opposite of zip().

- -

Examples

-

Basic usage:

- -
-let a = [(1, 2), (3, 4)];
-
-let (left, right): (Vec<_>, Vec<_>) = a.iter().cloned().unzip();
-
-assert_eq!(left, [1, 3]);
-assert_eq!(right, [2, 4]);
-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

Creates an iterator which clone()s all of its elements.

- -

This is useful when you have an iterator over &T, but you need an -iterator over T.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let v_cloned: Vec<_> = a.iter().cloned().collect();
-
-// cloned is the same as .map(|&x| x), for integers
-let v_map: Vec<_> = a.iter().map(|&x| x).collect();
-
-assert_eq!(v_cloned, vec![1, 2, 3]);
-assert_eq!(v_map, vec![1, 2, 3]);
-

fn cycle(self) -> Cycle<Self> where Self: Clone

Repeats an iterator endlessly.

- -

Instead of stopping at None, the iterator will instead start again, -from the beginning. After iterating again, it will start at the -beginning again. And again. And again. Forever.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let mut it = a.iter().cycle();
-
-assert_eq!(it.next(), Some(&1));
-assert_eq!(it.next(), Some(&2));
-assert_eq!(it.next(), Some(&3));
-assert_eq!(it.next(), Some(&1));
-assert_eq!(it.next(), Some(&2));
-assert_eq!(it.next(), Some(&3));
-assert_eq!(it.next(), Some(&1));
-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

Unstable (iter_arith)

: bounds recently changed

-

Sums the elements of an iterator.

- -

Takes each element, adds them together, and returns the result.

- -

An empty iterator returns the zero value of the type.

- -

Examples

-

Basic usage:

- -
-#![feature(iter_arith)]
-
-let a = [1, 2, 3];
-let sum: i32 = a.iter().sum();
-
-assert_eq!(sum, 6);
-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

Unstable (iter_arith)

: bounds recently changed

-

Iterates over the entire iterator, multiplying all the elements

- -

An empty iterator returns the one value of the type.

- -

Examples

-
-#![feature(iter_arith)]
-
-fn factorial(n: u32) -> u32 {
-    (1..).take_while(|&i| i <= n).product()
-}
-assert_eq!(factorial(0), 1);
-assert_eq!(factorial(1), 1);
-assert_eq!(factorial(5), 120);
-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

Lexicographically compares the elements of this Iterator with those -of another.

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

Lexicographically compares the elements of this Iterator with those -of another.

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

Determines if the elements of this Iterator are equal to those of -another.

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

Determines if the elements of this Iterator are unequal to those of -another.

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

Determines if the elements of this Iterator are lexicographically -less than those of another.

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

Determines if the elements of this Iterator are lexicographically -less or equal to those of another.

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

Determines if the elements of this Iterator are lexicographically -greater than those of another.

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

Determines if the elements of this Iterator are lexicographically -greater than or equal to those of another.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/iter/trait.Step.html b/doc/bitflags/__core/iter/trait.Step.html deleted file mode 100644 index eb6d40a2..00000000 --- a/doc/bitflags/__core/iter/trait.Step.html +++ /dev/null @@ -1,146 +0,0 @@ - - - - - - - - - - bitflags::__core::iter::Step - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::iter::Step - - [−] - - [src]

-
pub trait Step: PartialOrd<Self> {
-    fn step(&self, by: &Self) -> Option<Self>;
-    fn steps_between(start: &Self, end: &Self, by: &Self) -> Option<usize>;
-}
Unstable (step_trait)

: likely to be replaced by finer-grained traits

-

Objects that can be stepped over in both directions.

- -

The steps_between function provides a way to efficiently compare -two Step objects.

-
-

Required Methods

-
-

fn step(&self, by: &Self) -> Option<Self>

Unstable (step_trait)

: likely to be replaced by finer-grained traits

-

Steps self if possible.

-

fn steps_between(start: &Self, end: &Self, by: &Self) -> Option<usize>

Unstable (step_trait)

: likely to be replaced by finer-grained traits

-

Returns the number of steps between two step objects. The count is -inclusive of start and exclusive of end.

- -

Returns None if it is not possible to calculate steps_between -without overflow.

-
-

Implementors

-
    -
  • impl Step for usize
    • -
  • impl Step for u8
    • -
  • impl Step for u16
    • -
  • impl Step for u32
    • -
  • impl Step for isize
    • -
  • impl Step for i8
    • -
  • impl Step for i16
    • -
  • impl Step for i32
    • -
  • impl Step for u64
    • -
  • impl Step for i64
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/marker/index.html b/doc/bitflags/__core/marker/index.html deleted file mode 100644 index a1388fbf..00000000 --- a/doc/bitflags/__core/marker/index.html +++ /dev/null @@ -1,170 +0,0 @@ - - - - - - - - - - bitflags::__core::marker - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::marker - - [−] - - [src]

-

Primitive traits and marker types representing basic 'kinds' of types.

- -

Rust types can be classified in various useful ways according to -intrinsic properties of the type. These classifications, often called -'kinds', are represented as traits.

-

Structs

- - - - -
PhantomData -

PhantomData<T> allows you to describe that a type acts as if it stores a value of type T, -even though it does not. This allows you to inform the compiler about certain safety properties -of your code.

-

Traits

- - - - - - - - - - - - - - - - - - - - - - - - -
Copy -

Types that can be copied by simply copying bits (i.e. memcpy).

-
Send -

Types that can be transferred across thread boundaries.

-
Sized -

Types with a constant size known at compile-time.

-
Sync -

Types that can be safely shared between threads when aliased.

-
Reflect - [Unstable]

Types that can be reflected over.

-
Unsize - [Unstable]

Types that can be "unsized" to a dynamically sized type.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/marker/sidebar-items.js b/doc/bitflags/__core/marker/sidebar-items.js deleted file mode 100644 index eefee6e6..00000000 --- a/doc/bitflags/__core/marker/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["PhantomData","`PhantomData` allows you to describe that a type acts as if it stores a value of type `T`, even though it does not. This allows you to inform the compiler about certain safety properties of your code."]],"trait":[["Copy","Types that can be copied by simply copying bits (i.e. `memcpy`)."],["Reflect","Types that can be reflected over."],["Send","Types that can be transferred across thread boundaries."],["Sized","Types with a constant size known at compile-time."],["Sync","Types that can be safely shared between threads when aliased."],["Unsize","Types that can be \"unsized\" to a dynamically sized type."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/marker/struct.PhantomData.html b/doc/bitflags/__core/marker/struct.PhantomData.html deleted file mode 100644 index f2fdb8ca..00000000 --- a/doc/bitflags/__core/marker/struct.PhantomData.html +++ /dev/null @@ -1,216 +0,0 @@ - - - - - - - - - - bitflags::__core::marker::PhantomData - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::marker::PhantomData - - [−] - - [src]

-
pub struct PhantomData<T> where T: ?Sized;
1.0.0

PhantomData<T> allows you to describe that a type acts as if it stores a value of type T, -even though it does not. This allows you to inform the compiler about certain safety properties -of your code.

- -

For a more in-depth explanation of how to use PhantomData<T>, please see the Nomicon.

- -

A ghastly note 👻👻👻

-

Though they both have scary names, PhantomData<T> and 'phantom types' are related, but not -identical. Phantom types are a more general concept that don't require PhantomData<T> to -implement, but PhantomData<T> is the most common way to implement them in a correct manner.

- -

Examples

-

Unused lifetime parameter

-

Perhaps the most common time that PhantomData is required is -with a struct that has an unused lifetime parameter, typically as -part of some unsafe code. For example, here is a struct Slice -that has two pointers of type *const T, presumably pointing into -an array somewhere:

- -
-struct Slice<'a, T> {
-    start: *const T,
-    end: *const T,
-}
- -

The intention is that the underlying data is only valid for the -lifetime 'a, so Slice should not outlive 'a. However, this -intent is not expressed in the code, since there are no uses of -the lifetime 'a and hence it is not clear what data it applies -to. We can correct this by telling the compiler to act as if the -Slice struct contained a borrowed reference &'a T:

- -
-use std::marker::PhantomData;
-
-struct Slice<'a, T: 'a> {
-    start: *const T,
-    end: *const T,
-    phantom: PhantomData<&'a T>
-}
- -

This also in turn requires that we annotate T:'a, indicating -that T is a type that can be borrowed for the lifetime 'a.

- -

Unused type parameters

-

It sometimes happens that there are unused type parameters that -indicate what type of data a struct is "tied" to, even though that -data is not actually found in the struct itself. Here is an -example where this arises when handling external resources over a -foreign function interface. PhantomData<T> can prevent -mismatches by enforcing types in the method implementations:

- -
-use std::marker::PhantomData;
-use std::mem;
-
-struct ExternalResource<R> {
-   resource_handle: *mut (),
-   resource_type: PhantomData<R>,
-}
-
-impl<R: ResType> ExternalResource<R> {
-    fn new() -> ExternalResource<R> {
-        let size_of_res = mem::size_of::<R>();
-        ExternalResource {
-            resource_handle: foreign_lib::new(size_of_res),
-            resource_type: PhantomData,
-        }
-    }
-
-    fn do_stuff(&self, param: ParamType) {
-        let foreign_params = convert_params(param);
-        foreign_lib::do_stuff(self.resource_handle, foreign_params);
-    }
-}
- -

Indicating ownership

-

Adding a field of type PhantomData<T> also indicates that your -struct owns data of type T. This in turn implies that when your -struct is dropped, it may in turn drop one or more instances of -the type T, though that may not be apparent from the other -structure of the type itself. This is commonly necessary if the -structure is using a raw pointer like *mut T whose referent -may be dropped when the type is dropped, as a *mut T is -otherwise not treated as owned.

- -

If your struct does not in fact own the data of type T, it is -better to use a reference type, like PhantomData<&'a T> -(ideally) or PhantomData<*const T> (if no lifetime applies), so -as not to indicate ownership.

-

Trait Implementations

impl<T> Hash for PhantomData<T> where T: ?Sized

fn hash<H>(&self, &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<T> PartialEq<PhantomData<T>> for PhantomData<T> where T: ?Sized

fn eq(&self, _other: &PhantomData<T>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<T> Eq for PhantomData<T> where T: ?Sized

impl<T> PartialOrd<PhantomData<T>> for PhantomData<T> where T: ?Sized

fn partial_cmp(&self, _other: &PhantomData<T>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<T> Ord for PhantomData<T> where T: ?Sized

fn cmp(&self, _other: &PhantomData<T>) -> Ordering

-

impl<T> Copy for PhantomData<T> where T: ?Sized

impl<T> Clone for PhantomData<T> where T: ?Sized

fn clone(&self) -> PhantomData<T>

-

fn clone_from(&mut self, source: &Self)

-

impl<T> Default for PhantomData<T> where T: ?Sized

fn default() -> PhantomData<T>

-

impl<T> Debug for PhantomData<T> where T: ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/marker/trait.Copy.html b/doc/bitflags/__core/marker/trait.Copy.html deleted file mode 100644 index 8ca3ea02..00000000 --- a/doc/bitflags/__core/marker/trait.Copy.html +++ /dev/null @@ -1,316 +0,0 @@ - - - - - - - - - - bitflags::__core::marker::Copy - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::marker::Copy - - [−] - - [src]

-
pub trait Copy: Clone { }

Types that can be copied by simply copying bits (i.e. memcpy).

- -

By default, variable bindings have 'move semantics.' In other -words:

- -
-#[derive(Debug)]
-struct Foo;
-
-let x = Foo;
-
-let y = x;
-
-// `x` has moved into `y`, and so cannot be used
-
-// println!("{:?}", x); // error: use of moved value
- -

However, if a type implements Copy, it instead has 'copy semantics':

- -
-// we can just derive a `Copy` implementation
-#[derive(Debug, Copy, Clone)]
-struct Foo;
-
-let x = Foo;
-
-let y = x;
-
-// `y` is a copy of `x`
-
-println!("{:?}", x); // A-OK!
- -

It's important to note that in these two examples, the only difference is if you are allowed to -access x after the assignment: a move is also a bitwise copy under the hood.

- -

When can my type be Copy?

-

A type can implement Copy if all of its components implement Copy. For example, this -struct can be Copy:

- -
-struct Point {
-   x: i32,
-   y: i32,
-}
- -

A struct can be Copy, and i32 is Copy, so therefore, Point is eligible to be Copy.

- -
-struct PointList {
-    points: Vec<Point>,
-}
- -

The PointList struct cannot implement Copy, because Vec<T> is not Copy. If we -attempt to derive a Copy implementation, we'll get an error:

- -
the trait `Copy` may not be implemented for this type; field `points` does not implement `Copy`
-
- -

How can I implement Copy?

-

There are two ways to implement Copy on your type:

- -
-#[derive(Copy, Clone)]
-struct MyStruct;
- -

and

- -
-struct MyStruct;
-impl Copy for MyStruct {}
-impl Clone for MyStruct { fn clone(&self) -> MyStruct { *self } }
- -

There is a small difference between the two: the derive strategy will also place a Copy -bound on type parameters, which isn't always desired.

- -

When can my type not be Copy?

-

Some types can't be copied safely. For example, copying &mut T would create an aliased -mutable reference, and copying String would result in two attempts to free the same buffer.

- -

Generalizing the latter case, any type implementing Drop can't be Copy, because it's -managing some resource besides its own size_of::<T>() bytes.

- -

When should my type be Copy?

-

Generally speaking, if your type can implement Copy, it should. There's one important thing -to consider though: if you think your type may not be able to implement Copy in the future, -then it might be prudent to not implement Copy. This is because removing Copy is a breaking -change: that second example would fail to compile if we made Foo non-Copy.

- -

Derivable

-

This trait can be used with #[derive].

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/marker/trait.Reflect.html b/doc/bitflags/__core/marker/trait.Reflect.html deleted file mode 100644 index bc424aa9..00000000 --- a/doc/bitflags/__core/marker/trait.Reflect.html +++ /dev/null @@ -1,148 +0,0 @@ - - - - - - - - - - bitflags::__core::marker::Reflect - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::marker::Reflect - - [−] - - [src]

-
pub trait Reflect { }
Unstable (reflect_marker)

: requires RFC and more experience

-

Types that can be reflected over.

- -

This trait is implemented for all types. Its purpose is to ensure -that when you write a generic function that will employ -reflection, that must be reflected (no pun intended) in the -generic bounds of that function. Here is an example:

- -
-#![feature(reflect_marker)]
-use std::marker::Reflect;
-use std::any::Any;
-
-fn foo<T: Reflect + 'static>(x: &T) {
-    let any: &Any = x;
-    if any.is::<u32>() { println!("u32"); }
-}
- -

Without the declaration T: Reflect, foo would not type check -(note: as a matter of style, it would be preferable to write -T: Any, because T: Any implies T: Reflect and T: 'static, but -we use Reflect here to show how it works). The Reflect bound -thus serves to alert foo's caller to the fact that foo may -behave differently depending on whether T = u32 or not. In -particular, thanks to the Reflect bound, callers know that a -function declared like fn bar<T>(...) will always act in -precisely the same way no matter what type T is supplied, -because there are no bounds declared on T. (The ability for a -caller to reason about what a function may do based solely on what -generic bounds are declared is often called the "parametricity -property".)

-
-

Implementors

-
    -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/marker/trait.Send.html b/doc/bitflags/__core/marker/trait.Send.html deleted file mode 100644 index fc11f367..00000000 --- a/doc/bitflags/__core/marker/trait.Send.html +++ /dev/null @@ -1,149 +0,0 @@ - - - - - - - - - - bitflags::__core::marker::Send - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::marker::Send - - [−] - - [src]

-
pub unsafe trait Send { }

Types that can be transferred across thread boundaries.

- -

This trait is automatically derived when the compiler determines it's appropriate.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/marker/trait.Sized.html b/doc/bitflags/__core/marker/trait.Sized.html deleted file mode 100644 index df39af99..00000000 --- a/doc/bitflags/__core/marker/trait.Sized.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::marker::Sized - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::marker::Sized - - [−] - - [src]

-
pub trait Sized { }

Types with a constant size known at compile-time.

- -

All type parameters which can be bounded have an implicit bound of Sized. The special syntax -?Sized can be used to remove this bound if it is not appropriate.

- -
-struct Foo<T>(T);
-struct Bar<T: ?Sized>(T);
-
-// struct FooUse(Foo<[i32]>); // error: Sized is not implemented for [i32]
-struct BarUse(Bar<[i32]>); // OK
-
-

Implementors

-
    -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/marker/trait.Sync.html b/doc/bitflags/__core/marker/trait.Sync.html deleted file mode 100644 index 588cc0a4..00000000 --- a/doc/bitflags/__core/marker/trait.Sync.html +++ /dev/null @@ -1,190 +0,0 @@ - - - - - - - - - - bitflags::__core::marker::Sync - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::marker::Sync - - [−] - - [src]

-
pub unsafe trait Sync { }

Types that can be safely shared between threads when aliased.

- -

The precise definition is: a type T is Sync if &T is -thread-safe. In other words, there is no possibility of data races -when passing &T references between threads.

- -

As one would expect, primitive types like u8 and f64 are all -Sync, and so are simple aggregate types containing them (like -tuples, structs and enums). More instances of basic Sync types -include "immutable" types like &T and those with simple -inherited mutability, such as Box<T>, Vec<T> and most other -collection types. (Generic parameters need to be Sync for their -container to be Sync.)

- -

A somewhat surprising consequence of the definition is &mut T is -Sync (if T is Sync) even though it seems that it might -provide unsynchronized mutation. The trick is a mutable reference -stored in an aliasable reference (that is, & &mut T) becomes -read-only, as if it were a & &T, hence there is no risk of a data -race.

- -

Types that are not Sync are those that have "interior -mutability" in a non-thread-safe way, such as Cell and RefCell -in std::cell. These types allow for mutation of their contents -even when in an immutable, aliasable slot, e.g. the contents of -&Cell<T> can be .set, and do not ensure data races are -impossible, hence they cannot be Sync. A higher level example -of a non-Sync type is the reference counted pointer -std::rc::Rc, because any reference &Rc<T> can clone a new -reference, which modifies the reference counts in a non-atomic -way.

- -

For cases when one does need thread-safe interior mutability, -types like the atomics in std::sync and Mutex & RWLock in -the sync crate do ensure that any mutation cannot cause data -races. Hence these types are Sync.

- -

Any types with interior mutability must also use the std::cell::UnsafeCell -wrapper around the value(s) which can be mutated when behind a & -reference; not doing this is undefined behavior (for example, -transmute-ing from &T to &mut T is invalid).

- -

This trait is automatically derived when the compiler determines it's appropriate.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/marker/trait.Unsize.html b/doc/bitflags/__core/marker/trait.Unsize.html deleted file mode 100644 index 5048c998..00000000 --- a/doc/bitflags/__core/marker/trait.Unsize.html +++ /dev/null @@ -1,118 +0,0 @@ - - - - - - - - - - bitflags::__core::marker::Unsize - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::marker::Unsize - - [−] - - [src]

-
pub trait Unsize<T> where T: ?Sized { }
Unstable (unsize)

Types that can be "unsized" to a dynamically sized type.

-
-

Implementors

-
    -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/constant.POST_DROP_U32.html b/doc/bitflags/__core/mem/constant.POST_DROP_U32.html deleted file mode 100644 index 431020ad..00000000 --- a/doc/bitflags/__core/mem/constant.POST_DROP_U32.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::POST_DROP_U32 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::mem::POST_DROP_U32 - - [−] - - [src]

-
pub const POST_DROP_U32: u32 = POST_DROP_U8 as u32 << 24 | POST_DROP_U8 as u32 << 16 |
-    POST_DROP_U8 as u32 << 8 | POST_DROP_U8 as u32
Unstable (filling_drop)
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/constant.POST_DROP_U64.html b/doc/bitflags/__core/mem/constant.POST_DROP_U64.html deleted file mode 100644 index 4fbb923b..00000000 --- a/doc/bitflags/__core/mem/constant.POST_DROP_U64.html +++ /dev/null @@ -1,115 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::POST_DROP_U64 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::mem::POST_DROP_U64 - - [−] - - [src]

-
pub const POST_DROP_U64: u64 = POST_DROP_U8 as u32 << 24 | POST_DROP_U8 as u32 << 16 |
-    POST_DROP_U8 as u32 << 8 | POST_DROP_U8 as u32 as u64 << 32 |
-    POST_DROP_U8 as u32 << 24 | POST_DROP_U8 as u32 << 16 |
-        POST_DROP_U8 as u32 << 8 | POST_DROP_U8 as u32 as u64
Unstable (filling_drop)
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/constant.POST_DROP_U8.html b/doc/bitflags/__core/mem/constant.POST_DROP_U8.html deleted file mode 100644 index e946f0fe..00000000 --- a/doc/bitflags/__core/mem/constant.POST_DROP_U8.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::POST_DROP_U8 - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::mem::POST_DROP_U8 - - [−] - - [src]

-
pub const POST_DROP_U8: u8 = 29
Unstable (filling_drop)
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/constant.POST_DROP_USIZE.html b/doc/bitflags/__core/mem/constant.POST_DROP_USIZE.html deleted file mode 100644 index 63842710..00000000 --- a/doc/bitflags/__core/mem/constant.POST_DROP_USIZE.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::POST_DROP_USIZE - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::mem::POST_DROP_USIZE - - [−] - - [src]

-
pub const POST_DROP_USIZE: usize = POST_DROP_U64 as usize
Unstable (filling_drop)
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/fn.align_of.html b/doc/bitflags/__core/mem/fn.align_of.html deleted file mode 100644 index 84e79482..00000000 --- a/doc/bitflags/__core/mem/fn.align_of.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::align_of - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::mem::align_of - - [−] - - [src]

-
pub fn align_of<T>() -> usize
1.0.0

Returns the alignment in memory for a type.

- -

This is the alignment used for struct fields. It may be smaller than the preferred alignment.

- -

Examples

-
-use std::mem;
-
-assert_eq!(4, mem::align_of::<i32>());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/fn.align_of_val.html b/doc/bitflags/__core/mem/fn.align_of_val.html deleted file mode 100644 index 76df9e25..00000000 --- a/doc/bitflags/__core/mem/fn.align_of_val.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::align_of_val - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::mem::align_of_val - - [−] - - [src]

-
pub fn align_of_val<T>(val: &T) -> usize where T: ?Sized
1.0.0

Returns the ABI-required minimum alignment of the type of the value that val points to

- -

Examples

-
-use std::mem;
-
-assert_eq!(4, mem::align_of_val(&5i32));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/fn.drop.html b/doc/bitflags/__core/mem/fn.drop.html deleted file mode 100644 index 5c652023..00000000 --- a/doc/bitflags/__core/mem/fn.drop.html +++ /dev/null @@ -1,182 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::drop - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::mem::drop - - [−] - - [src]

-
pub fn drop<T>(_x: T)
1.0.0

Disposes of a value.

- -

While this does call the argument's implementation of Drop, it will not -release any borrows, as borrows are based on lexical scope.

- -

This effectively does nothing for -types which implement Copy, -e.g. integers. Such values are copied and then moved into the function, -so the value persists after this function call.

- -

Examples

-

Basic usage:

- -
-let v = vec![1, 2, 3];
-
-drop(v); // explicitly drop the vector
- -

Borrows are based on lexical scope, so this produces an error:

- -
-let mut v = vec![1, 2, 3];
-let x = &v[0];
-
-drop(x); // explicitly drop the reference, but the borrow still exists
-
-v.push(4); // error: cannot borrow `v` as mutable because it is also
-           // borrowed as immutable
- -

An inner scope is needed to fix this:

- -
-let mut v = vec![1, 2, 3];
-
-{
-    let x = &v[0];
-
-    drop(x); // this is now redundant, as `x` is going out of scope anyway
-}
-
-v.push(4); // no problems
- -

Since RefCell enforces the borrow rules at runtime, drop() can -seemingly release a borrow of one:

- -
-use std::cell::RefCell;
-
-let x = RefCell::new(1);
-
-let mut mutable_borrow = x.borrow_mut();
-*mutable_borrow = 1;
-
-drop(mutable_borrow); // relinquish the mutable borrow on this slot
-
-let borrow = x.borrow();
-println!("{}", *borrow);
- -

Integers and other types implementing Copy are unaffected by drop()

- -
-#[derive(Copy, Clone)]
-struct Foo(u8);
-
-let x = 1;
-let y = Foo(2);
-drop(x); // a copy of `x` is moved and dropped
-drop(y); // a copy of `y` is moved and dropped
-
-println!("x: {}, y: {}", x, y.0); // still available
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/fn.dropped.html b/doc/bitflags/__core/mem/fn.dropped.html deleted file mode 100644 index 998d7f1a..00000000 --- a/doc/bitflags/__core/mem/fn.dropped.html +++ /dev/null @@ -1,124 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::dropped - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::mem::dropped - - [−] - - [src]

-
pub unsafe fn dropped<T>() -> T
Unstable (filling_drop)

Creates a value initialized to an unspecified series of bytes.

- -

The byte sequence usually indicates that the value at the memory -in question has been dropped. Thus, if T carries a drop flag, -any associated destructor will not be run when the value falls out -of scope.

- -

Some code at one time used the zeroed function above to -accomplish this goal.

- -

This function is expected to be deprecated with the transition -to non-zeroing drop.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/fn.forget.html b/doc/bitflags/__core/mem/fn.forget.html deleted file mode 100644 index bf81202f..00000000 --- a/doc/bitflags/__core/mem/fn.forget.html +++ /dev/null @@ -1,194 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::forget - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::mem::forget - - [−] - - [src]

-
pub fn forget<T>(t: T)
1.0.0

Leaks a value into the void, consuming ownership and never running its -destructor.

- -

This function will take ownership of its argument, but is distinct from the -mem::drop function in that it does not run the destructor, leaking the -value and any resources that it owns.

- -

There's only a few reasons to use this function. They mainly come -up in unsafe code or FFI code.

- -
    -
  • You have an uninitialized value, perhaps for performance reasons, and -need to prevent the destructor from running on it.
    • -
  • You have two copies of a value (like when writing something like -mem::swap), but need the destructor to only run once to -prevent a double free.
    • -
  • Transferring resources across FFI boundaries.
    • -
- -

Safety

-

This function is not marked as unsafe as Rust does not guarantee that the -Drop implementation for a value will always run. Note, however, that -leaking resources such as memory or I/O objects is likely not desired, so -this function is only recommended for specialized use cases.

- -

The safety of this function implies that when writing unsafe code -yourself care must be taken when leveraging a destructor that is required to -run to preserve memory safety. There are known situations where the -destructor may not run (such as if ownership of the object with the -destructor is returned) which must be taken into account.

- -

Other forms of Leakage

-

It's important to point out that this function is not the only method by -which a value can be leaked in safe Rust code. Other known sources of -leakage are:

- -
    -
  • Rc and Arc cycles
    • -
  • mpsc::{Sender, Receiver} cycles (they use Arc internally)
    • -
  • Panicking destructors are likely to leak local resources
    • -
- -

Example

-

Leak some heap memory by never deallocating it:

- -
-use std::mem;
-
-let heap_memory = Box::new(3);
-mem::forget(heap_memory);
- -

Leak an I/O object, never closing the file:

- -
-use std::mem;
-use std::fs::File;
-
-let file = File::open("foo.txt").unwrap();
-mem::forget(file);
- -

The mem::swap function uses mem::forget to good effect:

- -
-use std::mem;
-use std::ptr;
-
-fn swap<T>(x: &mut T, y: &mut T) {
-    unsafe {
-        // Give ourselves some scratch space to work with
-        let mut t: T = mem::uninitialized();
-
-        // Perform the swap, `&mut` pointers never alias
-        ptr::copy_nonoverlapping(&*x, &mut t, 1);
-        ptr::copy_nonoverlapping(&*y, x, 1);
-        ptr::copy_nonoverlapping(&t, y, 1);
-
-        // y and t now point to the same thing, but we need to completely
-        // forget `t` because we do not want to run the destructor for `T`
-        // on its value, which is still owned somewhere outside this function.
-        mem::forget(t);
-    }
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/fn.min_align_of.html b/doc/bitflags/__core/mem/fn.min_align_of.html deleted file mode 100644 index 14ed66ef..00000000 --- a/doc/bitflags/__core/mem/fn.min_align_of.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::min_align_of - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::mem::min_align_of - - [−] - - [src]

-
pub fn min_align_of<T>() -> usize
1.0.0
Deprecated since 1.2.0

: use align_of instead

-

Returns the ABI-required minimum alignment of a type

- -

This is the alignment used for struct fields. It may be smaller than the preferred alignment.

- -

Examples

-
-use std::mem;
-
-assert_eq!(4, mem::min_align_of::<i32>());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/fn.min_align_of_val.html b/doc/bitflags/__core/mem/fn.min_align_of_val.html deleted file mode 100644 index 255b56de..00000000 --- a/doc/bitflags/__core/mem/fn.min_align_of_val.html +++ /dev/null @@ -1,120 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::min_align_of_val - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::mem::min_align_of_val - - [−] - - [src]

-
pub fn min_align_of_val<T>(val: &T) -> usize where T: ?Sized
1.0.0
Deprecated since 1.2.0

: use align_of_val instead

-

Returns the ABI-required minimum alignment of the type of the value that val points to

- -

Examples

-
-use std::mem;
-
-assert_eq!(4, mem::min_align_of_val(&5i32));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/fn.replace.html b/doc/bitflags/__core/mem/fn.replace.html deleted file mode 100644 index 222c00c1..00000000 --- a/doc/bitflags/__core/mem/fn.replace.html +++ /dev/null @@ -1,154 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::replace - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::mem::replace - - [−] - - [src]

-
pub fn replace<T>(dest: &mut T, src: T) -> T
1.0.0

Replaces the value at a mutable location with a new one, returning the old value, without -deinitializing or copying either one.

- -

This is primarily used for transferring and swapping ownership of a value in a mutable -location.

- -

Examples

-

A simple example:

- -
-use std::mem;
-
-let mut v: Vec<i32> = Vec::new();
-
-mem::replace(&mut v, Vec::new());
- -

This function allows consumption of one field of a struct by replacing it with another value. -The normal approach doesn't always work:

- -
-struct Buffer<T> { buf: Vec<T> }
-
-impl<T> Buffer<T> {
-    fn get_and_reset(&mut self) -> Vec<T> {
-        // error: cannot move out of dereference of `&mut`-pointer
-        let buf = self.buf;
-        self.buf = Vec::new();
-        buf
-    }
-}
- -

Note that T does not necessarily implement Clone, so it can't even clone and reset -self.buf. But replace can be used to disassociate the original value of self.buf from -self, allowing it to be returned:

- -
-use std::mem;
-impl<T> Buffer<T> {
-    fn get_and_reset(&mut self) -> Vec<T> {
-        mem::replace(&mut self.buf, Vec::new())
-    }
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/fn.size_of.html b/doc/bitflags/__core/mem/fn.size_of.html deleted file mode 100644 index 9d5c136a..00000000 --- a/doc/bitflags/__core/mem/fn.size_of.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::size_of - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::mem::size_of - - [−] - - [src]

-
pub fn size_of<T>() -> usize
1.0.0

Returns the size of a type in bytes.

- -

Examples

-
-use std::mem;
-
-assert_eq!(4, mem::size_of::<i32>());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/fn.size_of_val.html b/doc/bitflags/__core/mem/fn.size_of_val.html deleted file mode 100644 index 9055054f..00000000 --- a/doc/bitflags/__core/mem/fn.size_of_val.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::size_of_val - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::mem::size_of_val - - [−] - - [src]

-
pub fn size_of_val<T>(val: &T) -> usize where T: ?Sized
1.0.0

Returns the size of the given value in bytes.

- -

Examples

-
-use std::mem;
-
-assert_eq!(4, mem::size_of_val(&5i32));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/fn.swap.html b/doc/bitflags/__core/mem/fn.swap.html deleted file mode 100644 index 4fec3df1..00000000 --- a/doc/bitflags/__core/mem/fn.swap.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::swap - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::mem::swap - - [−] - - [src]

-
pub fn swap<T>(x: &mut T, y: &mut T)
1.0.0

Swap the values at two mutable locations of the same type, without deinitializing or copying -either one.

- -

Examples

-
-use std::mem;
-
-let x = &mut 5;
-let y = &mut 42;
-
-mem::swap(x, y);
-
-assert_eq!(42, *x);
-assert_eq!(5, *y);
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/fn.transmute.html b/doc/bitflags/__core/mem/fn.transmute.html deleted file mode 100644 index aefb7203..00000000 --- a/doc/bitflags/__core/mem/fn.transmute.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::transmute - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::mem::transmute - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn transmute<T, U>(e: T) -> U
1.0.0

Unsafely transforms a value of one type into a value of another type.

- -

Both types must have the same size.

- -

Examples

-
-use std::mem;
-
-let array: &[u8] = unsafe { mem::transmute("Rust") };
-assert_eq!(array, [82, 117, 115, 116]);
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/fn.transmute_copy.html b/doc/bitflags/__core/mem/fn.transmute_copy.html deleted file mode 100644 index 7c89dee7..00000000 --- a/doc/bitflags/__core/mem/fn.transmute_copy.html +++ /dev/null @@ -1,148 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::transmute_copy - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::mem::transmute_copy - - [−] - - [src]

-
pub unsafe fn transmute_copy<T, U>(src: &T) -> U
1.0.0

Interprets src as &U, and then reads src without moving the contained -value.

- -

This function will unsafely assume the pointer src is valid for -sizeof(U) bytes by transmuting &T to &U and then reading the &U. It -will also unsafely create a copy of the contained value instead of moving -out of src.

- -

It is not a compile-time error if T and U have different sizes, but it -is highly encouraged to only invoke this function where T and U have the -same size. This function triggers undefined behavior if U is larger than -T.

- -

Examples

-
-use std::mem;
-
-#[repr(packed)]
-struct Foo {
-    bar: u8,
-}
-
-let foo_slice = [10u8];
-
-unsafe {
-    // Copy the data from 'foo_slice' and treat it as a 'Foo'
-    let mut foo_struct: Foo = mem::transmute_copy(&foo_slice);
-    assert_eq!(foo_struct.bar, 10);
-
-    // Modify the copied data
-    foo_struct.bar = 20;
-    assert_eq!(foo_struct.bar, 20);
-}
-
-// The contents of 'foo_slice' should not have changed
-assert_eq!(foo_slice, [10]);
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/fn.uninitialized.html b/doc/bitflags/__core/mem/fn.uninitialized.html deleted file mode 100644 index 3d19643b..00000000 --- a/doc/bitflags/__core/mem/fn.uninitialized.html +++ /dev/null @@ -1,187 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::uninitialized - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::mem::uninitialized - - [−] - - [src]

-
pub unsafe fn uninitialized<T>() -> T
1.0.0

Bypasses Rust's normal memory-initialization checks by pretending to -produce a value of type T, while doing nothing at all.

- -

This is incredibly dangerous, and should not be done lightly. Deeply -consider initializing your memory with a default value instead.

- -

This is useful for FFI functions and initializing arrays sometimes, -but should generally be avoided.

- -

Undefined Behavior

-

It is Undefined Behavior to read uninitialized memory. Even just an -uninitialized boolean. For instance, if you branch on the value of such -a boolean your program may take one, both, or neither of the branches.

- -

Note that this often also includes writing to the uninitialized value. -Rust believes the value is initialized, and will therefore try to Drop -the uninitialized value and its fields if you try to overwrite the memory -in a normal manner. The only way to safely initialize an arbitrary -uninitialized value is with one of the ptr functions: write, copy, or -copy_nonoverlapping. This isn't necessary if T is a primitive -or otherwise only contains types that don't implement Drop.

- -

If this value does need some kind of Drop, it must be initialized before -it goes out of scope (and therefore would be dropped). Note that this -includes a panic occurring and unwinding the stack suddenly.

- -

Examples

-

Here's how to safely initialize an array of Vecs.

- -
-use std::mem;
-use std::ptr;
-
-// Only declare the array. This safely leaves it
-// uninitialized in a way that Rust will track for us.
-// However we can't initialize it element-by-element
-// safely, and we can't use the `[value; 1000]`
-// constructor because it only works with `Copy` data.
-let mut data: [Vec<u32>; 1000];
-
-unsafe {
-    // So we need to do this to initialize it.
-    data = mem::uninitialized();
-
-    // DANGER ZONE: if anything panics or otherwise
-    // incorrectly reads the array here, we will have
-    // Undefined Behavior.
-
-    // It's ok to mutably iterate the data, since this
-    // doesn't involve reading it at all.
-    // (ptr and len are statically known for arrays)
-    for elem in &mut data[..] {
-        // *elem = Vec::new() would try to drop the
-        // uninitialized memory at `elem` -- bad!
-        //
-        // Vec::new doesn't allocate or do really
-        // anything. It's only safe to call here
-        // because we know it won't panic.
-        ptr::write(elem, Vec::new());
-    }
-
-    // SAFE ZONE: everything is initialized.
-}
-
-println!("{:?}", &data[0]);
- -

This example emphasizes exactly how delicate and dangerous doing this is. -Note that the vec! macro does let you initialize every element with a -value that is only Clone, so the following is semantically equivalent and -vastly less dangerous, as long as you can live with an extra heap -allocation:

- -
-let data: Vec<Vec<u32>> = vec![Vec::new(); 1000];
-println!("{:?}", &data[0]);
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/fn.zeroed.html b/doc/bitflags/__core/mem/fn.zeroed.html deleted file mode 100644 index 74dc118b..00000000 --- a/doc/bitflags/__core/mem/fn.zeroed.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::mem::zeroed - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::mem::zeroed - - [−] - - [src]

-
pub unsafe fn zeroed<T>() -> T
1.0.0

Creates a value initialized to zero.

- -

This function is similar to allocating space for a local variable and zeroing it out (an unsafe -operation).

- -

Care must be taken when using this function, if the type T has a destructor and the value -falls out of scope (due to unwinding or returning) before being initialized, then the -destructor will run on zeroed data, likely leading to crashes.

- -

This is useful for FFI functions sometimes, but should generally be avoided.

- -

Examples

-
-use std::mem;
-
-let x: i32 = unsafe { mem::zeroed() };
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/index.html b/doc/bitflags/__core/mem/index.html deleted file mode 100644 index 32cb1f8d..00000000 --- a/doc/bitflags/__core/mem/index.html +++ /dev/null @@ -1,256 +0,0 @@ - - - - - - - - - - bitflags::__core::mem - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::mem - - [−] - - [src]

-

Basic functions for dealing with memory.

- -

This module contains functions for querying the size and alignment of -types, initializing and manipulating memory.

-

Constants

- - - - - - - - - - - - - - - - -
POST_DROP_U32 - [Unstable] -
POST_DROP_U64 - [Unstable] -
POST_DROP_U8 - [Unstable] -
POST_DROP_USIZE - [Unstable] -

Functions

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
align_of -

Returns the alignment in memory for a type.

-
align_of_val -

Returns the ABI-required minimum alignment of the type of the value that val points to

-
drop -

Disposes of a value.

-
forget -

Leaks a value into the void, consuming ownership and never running its -destructor.

-
min_align_of - [Deprecated]

Returns the ABI-required minimum alignment of a type

-
min_align_of_val - [Deprecated]

Returns the ABI-required minimum alignment of the type of the value that val points to

-
replace -

Replaces the value at a mutable location with a new one, returning the old value, without -deinitializing or copying either one.

-
size_of -

Returns the size of a type in bytes.

-
size_of_val -

Returns the size of the given value in bytes.

-
swap -

Swap the values at two mutable locations of the same type, without deinitializing or copying -either one.

-
transmute -

Unsafely transforms a value of one type into a value of another type.

-
transmute_copy -

Interprets src as &U, and then reads src without moving the contained -value.

-
uninitialized -

Bypasses Rust's normal memory-initialization checks by pretending to -produce a value of type T, while doing nothing at all.

-
zeroed -

Creates a value initialized to zero.

-
dropped - [Unstable]

Creates a value initialized to an unspecified series of bytes.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/mem/sidebar-items.js b/doc/bitflags/__core/mem/sidebar-items.js deleted file mode 100644 index de968593..00000000 --- a/doc/bitflags/__core/mem/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["POST_DROP_U32",""],["POST_DROP_U64",""],["POST_DROP_U8",""],["POST_DROP_USIZE",""]],"fn":[["align_of","Returns the alignment in memory for a type."],["align_of_val","Returns the ABI-required minimum alignment of the type of the value that `val` points to"],["drop","Disposes of a value."],["dropped","Creates a value initialized to an unspecified series of bytes."],["forget","Leaks a value into the void, consuming ownership and never running its destructor."],["min_align_of","Returns the ABI-required minimum alignment of a type"],["min_align_of_val","Returns the ABI-required minimum alignment of the type of the value that `val` points to"],["replace","Replaces the value at a mutable location with a new one, returning the old value, without deinitializing or copying either one."],["size_of","Returns the size of a type in bytes."],["size_of_val","Returns the size of the given value in bytes."],["swap","Swap the values at two mutable locations of the same type, without deinitializing or copying either one."],["transmute","Unsafely transforms a value of one type into a value of another type."],["transmute_copy","Interprets `src` as `&U`, and then reads `src` without moving the contained value."],["uninitialized","Bypasses Rust's normal memory-initialization checks by pretending to produce a value of type T, while doing nothing at all."],["zeroed","Creates a value initialized to zero."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/net/enum.IpAddr.html b/doc/bitflags/__core/net/enum.IpAddr.html deleted file mode 100644 index a446f644..00000000 --- a/doc/bitflags/__core/net/enum.IpAddr.html +++ /dev/null @@ -1,135 +0,0 @@ - - - - - - - - - - bitflags::__core::net::IpAddr - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::net::IpAddr - - [−] - - [src]

-
pub enum IpAddr {
-    V4(Ipv4Addr),
-    V6(Ipv6Addr),
-}
1.7.0

An IP address, either an IPv4 or IPv6 address.

-

Variants

-
V4

Representation of an IPv4 address.

-
V6

Representation of an IPv6 address.

-

Trait Implementations

impl Display for IpAddr1.0.0

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl FromStr for IpAddr1.0.0

type Err = AddrParseError

-

fn from_str(s: &str) -> Result<IpAddr, AddrParseError>

-

Derived Implementations

impl Ord for IpAddr

fn cmp(&self, __arg_0: &IpAddr) -> Ordering

-

impl PartialOrd<IpAddr> for IpAddr

fn partial_cmp(&self, __arg_0: &IpAddr) -> Option<Ordering>

-

fn lt(&self, __arg_0: &IpAddr) -> bool

-

fn le(&self, __arg_0: &IpAddr) -> bool

-

fn gt(&self, __arg_0: &IpAddr) -> bool

-

fn ge(&self, __arg_0: &IpAddr) -> bool

-

impl Hash for IpAddr

fn hash<__H>(&self, __arg_0: &mut __H) where __H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl Debug for IpAddr

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl PartialEq<IpAddr> for IpAddr

fn eq(&self, __arg_0: &IpAddr) -> bool

-

fn ne(&self, __arg_0: &IpAddr) -> bool

-

impl Eq for IpAddr

impl Clone for IpAddr

fn clone(&self) -> IpAddr

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Copy for IpAddr

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/enum.Ipv6MulticastScope.html b/doc/bitflags/__core/net/enum.Ipv6MulticastScope.html deleted file mode 100644 index 49fda97e..00000000 --- a/doc/bitflags/__core/net/enum.Ipv6MulticastScope.html +++ /dev/null @@ -1,140 +0,0 @@ - - - - - - - - - - bitflags::__core::net::Ipv6MulticastScope - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::net::Ipv6MulticastScope - - [−] - - [src]

-
pub enum Ipv6MulticastScope {
-    InterfaceLocal,
-    LinkLocal,
-    RealmLocal,
-    AdminLocal,
-    SiteLocal,
-    OrganizationLocal,
-    Global,
-}
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-

Variants

-
InterfaceLocal
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-
LinkLocal
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-
RealmLocal
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-
AdminLocal
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-
SiteLocal
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-
OrganizationLocal
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-
Global
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-

Trait Implementations

Derived Implementations

impl Debug for Ipv6MulticastScope

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-

impl Hash for Ipv6MulticastScope

fn hash<__H>(&self, __arg_0: &mut __H) where __H: Hasher

-
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl Clone for Ipv6MulticastScope

fn clone(&self) -> Ipv6MulticastScope

-
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Eq for Ipv6MulticastScope

impl PartialEq<Ipv6MulticastScope> for Ipv6MulticastScope

fn eq(&self, __arg_0: &Ipv6MulticastScope) -> bool

-
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-

fn ne(&self, other: &Rhs) -> bool1.0.0

-

impl Copy for Ipv6MulticastScope

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/enum.Shutdown.html b/doc/bitflags/__core/net/enum.Shutdown.html deleted file mode 100644 index 2903597b..00000000 --- a/doc/bitflags/__core/net/enum.Shutdown.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::net::Shutdown - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::net::Shutdown - - [−] - - [src]

-
pub enum Shutdown {
-    Read,
-    Write,
-    Both,
-}
1.0.0

Possible values which can be passed to the shutdown method of TcpStream.

-

Variants

-
Read

Indicates that the reading portion of this stream/socket should be shut -down. All currently blocked and future reads will return Ok(0).

-
Write

Indicates that the writing portion of this stream/socket should be shut -down. All currently blocked and future writes will return an error.

-
Both

Shut down both the reading and writing portions of this stream.

- -

See Shutdown::Read and Shutdown::Write for more information.

-

Trait Implementations

Derived Implementations

impl Debug for Shutdown

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl PartialEq<Shutdown> for Shutdown

fn eq(&self, __arg_0: &Shutdown) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl Clone for Shutdown

fn clone(&self) -> Shutdown

-

fn clone_from(&mut self, source: &Self)

-

impl Copy for Shutdown

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/enum.SocketAddr.html b/doc/bitflags/__core/net/enum.SocketAddr.html deleted file mode 100644 index 7dcf1a5e..00000000 --- a/doc/bitflags/__core/net/enum.SocketAddr.html +++ /dev/null @@ -1,145 +0,0 @@ - - - - - - - - - - bitflags::__core::net::SocketAddr - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::net::SocketAddr - - [−] - - [src]

-
pub enum SocketAddr {
-    V4(SocketAddrV4),
-    V6(SocketAddrV6),
-}
1.0.0

Representation of a socket address for networking applications.

- -

A socket address can either represent the IPv4 or IPv6 protocol and is -paired with at least a port number as well. Each protocol may have more -specific information about the address available to it as well.

-

Variants

-
V4

An IPv4 socket address which is a (ip, port) combination.

-
V6

An IPv6 socket address

-

Methods

impl SocketAddr

fn new(ip: IpAddr, port: u16) -> SocketAddr1.7.0

-

Creates a new socket address from the (ip, port) pair.

-

fn ip(&self) -> IpAddr1.7.0

-

Returns the IP address associated with this socket address.

-

fn set_ip(&mut self, new_ip: IpAddr)1.9.0

-

Change the IP address associated with this socket address.

-

fn port(&self) -> u16

-

Returns the port number associated with this socket address.

-

fn set_port(&mut self, new_port: u16)1.9.0

-

Change the port number associated with this socket address.

-

Trait Implementations

impl Display for SocketAddr

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl ToSocketAddrs for SocketAddr

type Iter = IntoIter<SocketAddr>

-

fn to_socket_addrs(&self) -> Result<IntoIter<SocketAddr>, Error>

-

impl FromStr for SocketAddr

type Err = AddrParseError

-

fn from_str(s: &str) -> Result<SocketAddr, AddrParseError>

-

Derived Implementations

impl Debug for SocketAddr

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl Hash for SocketAddr

fn hash<__H>(&self, __arg_0: &mut __H) where __H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl Eq for SocketAddr

impl PartialEq<SocketAddr> for SocketAddr

fn eq(&self, __arg_0: &SocketAddr) -> bool

-

fn ne(&self, __arg_0: &SocketAddr) -> bool

-

impl Clone for SocketAddr

fn clone(&self) -> SocketAddr

-

fn clone_from(&mut self, source: &Self)

-

impl Copy for SocketAddr

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/fn.lookup_host.html b/doc/bitflags/__core/net/fn.lookup_host.html deleted file mode 100644 index 8786cfd6..00000000 --- a/doc/bitflags/__core/net/fn.lookup_host.html +++ /dev/null @@ -1,127 +0,0 @@ - - - - - - - - - - bitflags::__core::net::lookup_host - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::net::lookup_host - - [−] - - [src]

-
pub fn lookup_host(host: &str) -> Result<LookupHost, Error>
Unstable (lookup_host)

: unsure about the returned iterator and returning socket addresses

-

Resolve the host specified by host as a number of SocketAddr instances.

- -

This method may perform a DNS query to resolve host and may also inspect -system configuration to resolve the specified hostname.

- -

Examples

-
-#![feature(lookup_host)]
-
-use std::net;
-
-for host in try!(net::lookup_host("rust-lang.org")) {
-    println!("found address: {}", try!(host));
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/index.html b/doc/bitflags/__core/net/index.html deleted file mode 100644 index 7ad85e27..00000000 --- a/doc/bitflags/__core/net/index.html +++ /dev/null @@ -1,231 +0,0 @@ - - - - - - - - - - bitflags::__core::net - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::net - - [−] - - [src]

-

Networking primitives for TCP/UDP communication.

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
AddrParseError -

An error returned when parsing an IP address or a socket address.

-
Incoming -

An infinite iterator over the connections from a TcpListener.

-
Ipv4Addr -

Representation of an IPv4 address.

-
Ipv6Addr -

Representation of an IPv6 address.

-
SocketAddrV4 -

An IPv4 socket address which is a (ip, port) combination.

-
SocketAddrV6 -

An IPv6 socket address.

-
TcpListener -

A structure representing a socket server.

-
TcpStream -

A structure which represents a TCP stream between a local socket and a -remote socket.

-
UdpSocket -

A User Datagram Protocol socket.

-
LookupHost - [Unstable]

An iterator over SocketAddr values returned from a host lookup operation.

-

Enums

- - - - - - - - - - - - - - - - -
IpAddr -

An IP address, either an IPv4 or IPv6 address.

-
Shutdown -

Possible values which can be passed to the shutdown method of TcpStream.

-
SocketAddr -

Representation of a socket address for networking applications.

-
Ipv6MulticastScope - [Unstable] -

Traits

- - - - -
ToSocketAddrs -

A trait for objects which can be converted or resolved to one or more -SocketAddr values.

-

Functions

- - - - -
lookup_host - [Unstable]

Resolve the host specified by host as a number of SocketAddr instances.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/sidebar-items.js b/doc/bitflags/__core/net/sidebar-items.js deleted file mode 100644 index 690c889d..00000000 --- a/doc/bitflags/__core/net/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["IpAddr","An IP address, either an IPv4 or IPv6 address."],["Ipv6MulticastScope",""],["Shutdown","Possible values which can be passed to the `shutdown` method of `TcpStream`."],["SocketAddr","Representation of a socket address for networking applications."]],"fn":[["lookup_host","Resolve the host specified by `host` as a number of `SocketAddr` instances."]],"struct":[["AddrParseError","An error returned when parsing an IP address or a socket address."],["Incoming","An infinite iterator over the connections from a `TcpListener`."],["Ipv4Addr","Representation of an IPv4 address."],["Ipv6Addr","Representation of an IPv6 address."],["LookupHost","An iterator over `SocketAddr` values returned from a host lookup operation."],["SocketAddrV4","An IPv4 socket address which is a (ip, port) combination."],["SocketAddrV6","An IPv6 socket address."],["TcpListener","A structure representing a socket server."],["TcpStream","A structure which represents a TCP stream between a local socket and a remote socket."],["UdpSocket","A User Datagram Protocol socket."]],"trait":[["ToSocketAddrs","A trait for objects which can be converted or resolved to one or more `SocketAddr` values."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/net/struct.AddrParseError.html b/doc/bitflags/__core/net/struct.AddrParseError.html deleted file mode 100644 index d1d36729..00000000 --- a/doc/bitflags/__core/net/struct.AddrParseError.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - - - - bitflags::__core::net::AddrParseError - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::net::AddrParseError - - [−] - - [src]

-
pub struct AddrParseError(_);
1.0.0

An error returned when parsing an IP address or a socket address.

-

Trait Implementations

impl Display for AddrParseError1.4.0

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl Error for AddrParseError1.4.0

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

Derived Implementations

impl PartialEq<AddrParseError> for AddrParseError

fn eq(&self, __arg_0: &AddrParseError) -> bool

-

fn ne(&self, __arg_0: &AddrParseError) -> bool

-

impl Clone for AddrParseError

fn clone(&self) -> AddrParseError

-

fn clone_from(&mut self, source: &Self)

-

impl Debug for AddrParseError

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/struct.Incoming.html b/doc/bitflags/__core/net/struct.Incoming.html deleted file mode 100644 index 2f2cc24f..00000000 --- a/doc/bitflags/__core/net/struct.Incoming.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::net::Incoming - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::net::Incoming - - [−] - - [src]

-
pub struct Incoming<'a> {
-    // some fields omitted
-}
1.0.0

An infinite iterator over the connections from a TcpListener.

- -

This iterator will infinitely yield Some of the accepted connections. It -is equivalent to calling accept in a loop.

-

Trait Implementations

impl<'a> Iterator for Incoming<'a>

type Item = Result<TcpStream, Error>

-

fn next(&mut self) -> Option<Result<TcpStream, Error>>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/struct.Ipv4Addr.html b/doc/bitflags/__core/net/struct.Ipv4Addr.html deleted file mode 100644 index 4a185ff8..00000000 --- a/doc/bitflags/__core/net/struct.Ipv4Addr.html +++ /dev/null @@ -1,202 +0,0 @@ - - - - - - - - - - bitflags::__core::net::Ipv4Addr - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::net::Ipv4Addr - - [−] - - [src]

-
pub struct Ipv4Addr {
-    // some fields omitted
-}
1.0.0

Representation of an IPv4 address.

-

Methods

impl Ipv4Addr

fn new(a: u8, b: u8, c: u8, d: u8) -> Ipv4Addr

-

Creates a new IPv4 address from four eight-bit octets.

- -

The result will represent the IP address a.b.c.d.

-

fn octets(&self) -> [u8; 4]

-

Returns the four eight-bit integers that make up this address.

-

fn is_unspecified(&self) -> bool

-
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-

Returns true for the special 'unspecified' address 0.0.0.0.

-

fn is_loopback(&self) -> bool1.7.0

-

Returns true if this is a loopback address (127.0.0.0/8).

- -

This property is defined by RFC 6890

-

fn is_private(&self) -> bool1.7.0

-

Returns true if this is a private address.

- -

The private address ranges are defined in RFC1918 and include:

- -
    -
  • 10.0.0.0/8
    • -
  • 172.16.0.0/12
    • -
  • 192.168.0.0/16
    • -
-
-

Returns true if the address is link-local (169.254.0.0/16).

- -

This property is defined by RFC 6890

-

fn is_global(&self) -> bool

-
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-

Returns true if the address appears to be globally routable. -See iana-ipv4-special-registry.

- -

The following return false:

- -
    -
  • private address (10.0.0.0/8, 172.16.0.0/12 and 192.168.0.0/16)
    • -
  • the loopback address (127.0.0.0/8)
    • -
  • the link-local address (169.254.0.0/16)
    • -
  • the broadcast address (255.255.255.255/32)
    • -
  • test addresses used for documentation (192.0.2.0/24, 198.51.100.0/24 and 203.0.113.0/24)
    • -
  • the unspecified address (0.0.0.0)
    • -
-

fn is_multicast(&self) -> bool1.7.0

-

Returns true if this is a multicast address.

- -

Multicast addresses have a most significant octet between 224 and 239, -and is defined by RFC 5771

-

fn is_broadcast(&self) -> bool1.7.0

-

Returns true if this is a broadcast address.

- -

A broadcast address has all octets set to 255 as defined in RFC 919.

-

fn is_documentation(&self) -> bool1.7.0

-

Returns true if this address is in a range designated for documentation.

- -

This is defined in RFC 5737:

- -
    -
  • 192.0.2.0/24 (TEST-NET-1)
    • -
  • 198.51.100.0/24 (TEST-NET-2)
    • -
  • 203.0.113.0/24 (TEST-NET-3)
    • -
-

fn to_ipv6_compatible(&self) -> Ipv6Addr

-

Converts this address to an IPv4-compatible IPv6 address.

- -

a.b.c.d becomes ::a.b.c.d

-

fn to_ipv6_mapped(&self) -> Ipv6Addr

-

Converts this address to an IPv4-mapped IPv6 address.

- -

a.b.c.d becomes ::ffff:a.b.c.d

-

Trait Implementations

impl Display for Ipv4Addr

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl Debug for Ipv4Addr

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl Clone for Ipv4Addr

fn clone(&self) -> Ipv4Addr

-

fn clone_from(&mut self, source: &Self)

-

impl PartialEq<Ipv4Addr> for Ipv4Addr

fn eq(&self, other: &Ipv4Addr) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl Eq for Ipv4Addr

impl Hash for Ipv4Addr

fn hash<H>(&self, s: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl PartialOrd<Ipv4Addr> for Ipv4Addr

fn partial_cmp(&self, other: &Ipv4Addr) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl Ord for Ipv4Addr

fn cmp(&self, other: &Ipv4Addr) -> Ordering

-

impl From<u32> for Ipv4Addr1.1.0

fn from(ip: u32) -> Ipv4Addr

-

impl From<[u8; 4]> for Ipv4Addr1.9.0

fn from(octets: [u8; 4]) -> Ipv4Addr

-

impl FromStr for Ipv4Addr

type Err = AddrParseError

-

fn from_str(s: &str) -> Result<Ipv4Addr, AddrParseError>

-

Derived Implementations

impl Copy for Ipv4Addr

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/struct.Ipv6Addr.html b/doc/bitflags/__core/net/struct.Ipv6Addr.html deleted file mode 100644 index 2897b8cf..00000000 --- a/doc/bitflags/__core/net/struct.Ipv6Addr.html +++ /dev/null @@ -1,203 +0,0 @@ - - - - - - - - - - bitflags::__core::net::Ipv6Addr - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::net::Ipv6Addr - - [−] - - [src]

-
pub struct Ipv6Addr {
-    // some fields omitted
-}
1.0.0

Representation of an IPv6 address.

-

Methods

impl Ipv6Addr

fn new(a: u16, b: u16, c: u16, d: u16, e: u16, f: u16, g: u16, h: u16) -> Ipv6Addr

-

Creates a new IPv6 address from eight 16-bit segments.

- -

The result will represent the IP address a:b:c:d:e:f:g:h.

-

fn segments(&self) -> [u16; 8]

-

Returns the eight 16-bit segments that make up this address.

-

fn is_unspecified(&self) -> bool1.7.0

-

Returns true for the special 'unspecified' address ::.

- -

This property is defined in RFC 6890.

-

fn is_loopback(&self) -> bool1.7.0

-

Returns true if this is a loopback address (::1).

- -

This property is defined in RFC 6890.

-

fn is_global(&self) -> bool

-
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-

Returns true if the address appears to be globally routable.

- -

The following return false:

- -
    -
  • the loopback address
    • -
  • link-local, site-local, and unique local unicast addresses
    • -
  • interface-, link-, realm-, admin- and site-local multicast addresses
    • -
-

fn is_unique_local(&self) -> bool

-
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-

Returns true if this is a unique local address (IPv6).

- -

Unique local addresses are defined in RFC4193 and have the form fc00::/7.

-
-
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-

Returns true if the address is unicast and link-local (fe80::/10).

-

fn is_unicast_site_local(&self) -> bool

-
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-

Returns true if this is a deprecated unicast site-local address (IPv6 -fec0::/10).

-

fn is_documentation(&self) -> bool

-
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-

Returns true if this is an address reserved for documentation -This is defined to be 2001:db8::/32 in RFC RFC 3849

-

fn is_unicast_global(&self) -> bool

-
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-

Returns true if the address is a globally routable unicast address.

- -

The following return false:

- -
    -
  • the loopback address
    • -
  • the link-local addresses
    • -
  • the (deprecated) site-local addresses
    • -
  • unique local addresses
    • -
  • the unspecified address
    • -
  • the address range reserved for documentation
    • -
-

fn multicast_scope(&self) -> Option<Ipv6MulticastScope>

-
Unstable (ip)

: extra functionality has not been scrutinized to the level that it should be stable

-

Returns the address's multicast scope if the address is multicast.

-

fn is_multicast(&self) -> bool1.7.0

-

Returns true if this is a multicast address.

- -

Multicast addresses have the form ff00::/8, and this property is defined -by RFC 3956.

-

fn to_ipv4(&self) -> Option<Ipv4Addr>

-

Converts this address to an IPv4 address. Returns None if this address is -neither IPv4-compatible or IPv4-mapped.

- -

::a.b.c.d and ::ffff:a.b.c.d become a.b.c.d

-

fn octets(&self) -> [u8; 16]

-
Unstable (ipv6_to_octets)

: needs some testing

-

Returns the sixteen eight-bit integers the IPv6 address consists of.

-

Trait Implementations

impl Display for Ipv6Addr

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl Debug for Ipv6Addr

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl Clone for Ipv6Addr

fn clone(&self) -> Ipv6Addr

-

fn clone_from(&mut self, source: &Self)

-

impl PartialEq<Ipv6Addr> for Ipv6Addr

fn eq(&self, other: &Ipv6Addr) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl Eq for Ipv6Addr

impl Hash for Ipv6Addr

fn hash<H>(&self, s: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl PartialOrd<Ipv6Addr> for Ipv6Addr

fn partial_cmp(&self, other: &Ipv6Addr) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl Ord for Ipv6Addr

fn cmp(&self, other: &Ipv6Addr) -> Ordering

-

impl From<[u8; 16]> for Ipv6Addr1.9.0

fn from(octets: [u8; 16]) -> Ipv6Addr

-

impl FromStr for Ipv6Addr

type Err = AddrParseError

-

fn from_str(s: &str) -> Result<Ipv6Addr, AddrParseError>

-

Derived Implementations

impl Copy for Ipv6Addr

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/struct.LookupHost.html b/doc/bitflags/__core/net/struct.LookupHost.html deleted file mode 100644 index fbf2e0d1..00000000 --- a/doc/bitflags/__core/net/struct.LookupHost.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - - - - - - - bitflags::__core::net::LookupHost - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::net::LookupHost - - [−] - - [src]

-
pub struct LookupHost(_);
Unstable (lookup_host)

: unsure about the returned iterator and returning socket addresses

-

An iterator over SocketAddr values returned from a host lookup operation.

-

Trait Implementations

impl Iterator for LookupHost

type Item = Result<SocketAddr, Error>

-
Unstable (lookup_host)

: unsure about the returned iterator and returning socket addresses

-

fn next(&mut self) -> Option<Result<SocketAddr, Error>>

-
Unstable (lookup_host)

: unsure about the returned iterator and returning socket addresses

-

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/struct.SocketAddrV4.html b/doc/bitflags/__core/net/struct.SocketAddrV4.html deleted file mode 100644 index e3c1d4b7..00000000 --- a/doc/bitflags/__core/net/struct.SocketAddrV4.html +++ /dev/null @@ -1,137 +0,0 @@ - - - - - - - - - - bitflags::__core::net::SocketAddrV4 - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::net::SocketAddrV4 - - [−] - - [src]

-
pub struct SocketAddrV4 {
-    // some fields omitted
-}
1.0.0

An IPv4 socket address which is a (ip, port) combination.

-

Methods

impl SocketAddrV4

fn new(ip: Ipv4Addr, port: u16) -> SocketAddrV4

-

Creates a new socket address from the (ip, port) pair.

-

fn ip(&self) -> &Ipv4Addr

-

Returns the IP address associated with this socket address.

-

fn set_ip(&mut self, new_ip: Ipv4Addr)1.9.0

-

Change the IP address associated with this socket address.

-

fn port(&self) -> u16

-

Returns the port number associated with this socket address.

-

fn set_port(&mut self, new_port: u16)1.9.0

-

Change the port number associated with this socket address.

-

Trait Implementations

impl Display for SocketAddrV4

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl Debug for SocketAddrV4

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl Clone for SocketAddrV4

fn clone(&self) -> SocketAddrV4

-

fn clone_from(&mut self, source: &Self)

-

impl PartialEq<SocketAddrV4> for SocketAddrV4

fn eq(&self, other: &SocketAddrV4) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl Eq for SocketAddrV4

impl Hash for SocketAddrV4

fn hash<H>(&self, s: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl ToSocketAddrs for SocketAddrV4

type Iter = IntoIter<SocketAddr>

-

fn to_socket_addrs(&self) -> Result<IntoIter<SocketAddr>, Error>

-

impl FromStr for SocketAddrV41.5.0

type Err = AddrParseError

-

fn from_str(s: &str) -> Result<SocketAddrV4, AddrParseError>

-

Derived Implementations

impl Copy for SocketAddrV4

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/struct.SocketAddrV6.html b/doc/bitflags/__core/net/struct.SocketAddrV6.html deleted file mode 100644 index 7172f2f9..00000000 --- a/doc/bitflags/__core/net/struct.SocketAddrV6.html +++ /dev/null @@ -1,148 +0,0 @@ - - - - - - - - - - bitflags::__core::net::SocketAddrV6 - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::net::SocketAddrV6 - - [−] - - [src]

-
pub struct SocketAddrV6 {
-    // some fields omitted
-}
1.0.0

An IPv6 socket address.

-

Methods

impl SocketAddrV6

fn new(ip: Ipv6Addr, port: u16, flowinfo: u32, scope_id: u32) -> SocketAddrV6

-

Creates a new socket address from the ip/port/flowinfo/scope_id -components.

-

fn ip(&self) -> &Ipv6Addr

-

Returns the IP address associated with this socket address.

-

fn set_ip(&mut self, new_ip: Ipv6Addr)1.9.0

-

Change the IP address associated with this socket address.

-

fn port(&self) -> u16

-

Returns the port number associated with this socket address.

-

fn set_port(&mut self, new_port: u16)1.9.0

-

Change the port number associated with this socket address.

-

fn flowinfo(&self) -> u32

-

Returns the flow information associated with this address, -corresponding to the sin6_flowinfo field in C.

-

fn set_flowinfo(&mut self, new_flowinfo: u32)1.9.0

-

Change the flow information associated with this socket address.

-

fn scope_id(&self) -> u32

-

Returns the scope ID associated with this address, -corresponding to the sin6_scope_id field in C.

-

fn set_scope_id(&mut self, new_scope_id: u32)1.9.0

-

Change the scope ID associated with this socket address.

-

Trait Implementations

impl Display for SocketAddrV6

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl Debug for SocketAddrV6

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl Clone for SocketAddrV6

fn clone(&self) -> SocketAddrV6

-

fn clone_from(&mut self, source: &Self)

-

impl PartialEq<SocketAddrV6> for SocketAddrV6

fn eq(&self, other: &SocketAddrV6) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl Eq for SocketAddrV6

impl Hash for SocketAddrV6

fn hash<H>(&self, s: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl ToSocketAddrs for SocketAddrV6

type Iter = IntoIter<SocketAddr>

-

fn to_socket_addrs(&self) -> Result<IntoIter<SocketAddr>, Error>

-

impl FromStr for SocketAddrV61.5.0

type Err = AddrParseError

-

fn from_str(s: &str) -> Result<SocketAddrV6, AddrParseError>

-

Derived Implementations

impl Copy for SocketAddrV6

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/struct.TcpListener.html b/doc/bitflags/__core/net/struct.TcpListener.html deleted file mode 100644 index e08d3aed..00000000 --- a/doc/bitflags/__core/net/struct.TcpListener.html +++ /dev/null @@ -1,209 +0,0 @@ - - - - - - - - - - bitflags::__core::net::TcpListener - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::net::TcpListener - - [−] - - [src]

-
pub struct TcpListener(_);
1.0.0

A structure representing a socket server.

- -

Examples

-
-use std::net::{TcpListener, TcpStream};
-use std::thread;
-
-let listener = TcpListener::bind("127.0.0.1:80").unwrap();
-
-fn handle_client(stream: TcpStream) {
-    // ...
-}
-
-// accept connections and process them, spawning a new thread for each one
-for stream in listener.incoming() {
-    match stream {
-        Ok(stream) => {
-            thread::spawn(move|| {
-                // connection succeeded
-                handle_client(stream)
-            });
-        }
-        Err(e) => { /* connection failed */ }
-    }
-}
-
-// close the socket server
-drop(listener);
-

Methods

impl TcpListener

fn bind<A>(addr: A) -> Result<TcpListener, Error> where A: ToSocketAddrs

-

Creates a new TcpListener which will be bound to the specified -address.

- -

The returned listener is ready for accepting connections.

- -

Binding with a port number of 0 will request that the OS assigns a port -to this listener. The port allocated can be queried via the -local_addr method.

- -

The address type can be any implementor of ToSocketAddrs trait. See -its documentation for concrete examples.

-

fn local_addr(&self) -> Result<SocketAddr, Error>

-

Returns the local socket address of this listener.

-

fn try_clone(&self) -> Result<TcpListener, Error>

-

Creates a new independently owned handle to the underlying socket.

- -

The returned TcpListener is a reference to the same socket that this -object references. Both handles can be used to accept incoming -connections and options set on one listener will affect the other.

-

fn accept(&self) -> Result<(TcpStream, SocketAddr), Error>

-

Accept a new incoming connection from this listener.

- -

This function will block the calling thread until a new TCP connection -is established. When established, the corresponding TcpStream and the -remote peer's address will be returned.

-

fn incoming(&self) -> Incoming

-

Returns an iterator over the connections being received on this -listener.

- -

The returned iterator will never return None and will also not yield -the peer's SocketAddr structure.

-

fn set_ttl(&self, ttl: u32) -> Result<(), Error>1.9.0

-

Sets the value for the IP_TTL option on this socket.

- -

This value sets the time-to-live field that is used in every packet sent -from this socket.

-

fn ttl(&self) -> Result<u32, Error>1.9.0

-

Gets the value of the IP_TTL option for this socket.

- -

For more information about this option, see set_ttl.

-

fn set_only_v6(&self, only_v6: bool) -> Result<(), Error>1.9.0

-

Sets the value for the IPV6_V6ONLY option on this socket.

- -

If this is set to true then the socket is restricted to sending and -receiving IPv6 packets only. In this case two IPv4 and IPv6 applications -can bind the same port at the same time.

- -

If this is set to false then the socket can be used to send and -receive packets from an IPv4-mapped IPv6 address.

-

fn only_v6(&self) -> Result<bool, Error>1.9.0

-

Gets the value of the IPV6_V6ONLY option for this socket.

- -

For more information about this option, see set_only_v6.

-

fn take_error(&self) -> Result<Option<Error>, Error>1.9.0

-

Get the value of the SO_ERROR option on this socket.

- -

This will retrieve the stored error in the underlying socket, clearing -the field in the process. This can be useful for checking errors between -calls.

-

fn set_nonblocking(&self, nonblocking: bool) -> Result<(), Error>1.9.0

-

Moves this TCP stream into or out of nonblocking mode.

- -

On Unix this corresponds to calling fcntl, and on Windows this -corresponds to calling ioctlsocket.

-

Trait Implementations

impl Debug for TcpListener

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl AsRawFd for TcpListener

fn as_raw_fd(&self) -> i32

-

impl FromRawFd for TcpListener1.1.0

unsafe fn from_raw_fd(fd: i32) -> TcpListener

-

impl IntoRawFd for TcpListener1.4.0

fn into_raw_fd(self) -> i32

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/struct.TcpStream.html b/doc/bitflags/__core/net/struct.TcpStream.html deleted file mode 100644 index 2f5d29ad..00000000 --- a/doc/bitflags/__core/net/struct.TcpStream.html +++ /dev/null @@ -1,254 +0,0 @@ - - - - - - - - - - bitflags::__core::net::TcpStream - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::net::TcpStream - - [−] - - [src]

-
pub struct TcpStream(_);
1.0.0

A structure which represents a TCP stream between a local socket and a -remote socket.

- -

The socket will be closed when the value is dropped.

- -

Examples

-
-use std::io::prelude::*;
-use std::net::TcpStream;
-
-{
-    let mut stream = TcpStream::connect("127.0.0.1:34254").unwrap();
-
-    // ignore the Result
-    let _ = stream.write(&[1]);
-    let _ = stream.read(&mut [0; 128]); // ignore here too
-} // the stream is closed here
-

Methods

impl TcpStream

fn connect<A>(addr: A) -> Result<TcpStream, Error> where A: ToSocketAddrs

-

Opens a TCP connection to a remote host.

- -

addr is an address of the remote host. Anything which implements -ToSocketAddrs trait can be supplied for the address; see this trait -documentation for concrete examples. -In case ToSocketAddrs::to_socket_addrs() returns more than one entry, -then the first valid and reachable address is used.

-

fn peer_addr(&self) -> Result<SocketAddr, Error>

-

Returns the socket address of the remote peer of this TCP connection.

-

fn local_addr(&self) -> Result<SocketAddr, Error>

-

Returns the socket address of the local half of this TCP connection.

-

fn shutdown(&self, how: Shutdown) -> Result<(), Error>

-

Shuts down the read, write, or both halves of this connection.

- -

This function will cause all pending and future I/O on the specified -portions to return immediately with an appropriate value (see the -documentation of Shutdown).

-

fn try_clone(&self) -> Result<TcpStream, Error>

-

Creates a new independently owned handle to the underlying socket.

- -

The returned TcpStream is a reference to the same stream that this -object references. Both handles will read and write the same stream of -data, and options set on one stream will be propagated to the other -stream.

-

fn set_read_timeout(&self, dur: Option<Duration>) -> Result<(), Error>1.4.0

-

Sets the read timeout to the timeout specified.

- -

If the value specified is None, then read calls will block -indefinitely. It is an error to pass the zero Duration to this -method.

- -

Note

-

Platforms may return a different error code whenever a read times out as -a result of setting this option. For example Unix typically returns an -error of the kind WouldBlock, but Windows may return TimedOut.

-

fn set_write_timeout(&self, dur: Option<Duration>) -> Result<(), Error>1.4.0

-

Sets the write timeout to the timeout specified.

- -

If the value specified is None, then write calls will block -indefinitely. It is an error to pass the zero Duration to this -method.

- -

Note

-

Platforms may return a different error code whenever a write times out -as a result of setting this option. For example Unix typically returns -an error of the kind WouldBlock, but Windows may return TimedOut.

-

fn read_timeout(&self) -> Result<Option<Duration>, Error>1.4.0

-

Returns the read timeout of this socket.

- -

If the timeout is None, then read calls will block indefinitely.

- -

Note

-

Some platforms do not provide access to the current timeout.

-

fn write_timeout(&self) -> Result<Option<Duration>, Error>1.4.0

-

Returns the write timeout of this socket.

- -

If the timeout is None, then write calls will block indefinitely.

- -

Note

-

Some platforms do not provide access to the current timeout.

-

fn set_nodelay(&self, nodelay: bool) -> Result<(), Error>1.9.0

-

Sets the value of the TCP_NODELAY option on this socket.

- -

If set, this option disables the Nagle algorithm. This means that -segments are always sent as soon as possible, even if there is only a -small amount of data. When not set, data is buffered until there is a -sufficient amount to send out, thereby avoiding the frequent sending of -small packets.

-

fn nodelay(&self) -> Result<bool, Error>1.9.0

-

Gets the value of the TCP_NODELAY option on this socket.

- -

For more information about this option, see set_nodelay.

-

fn set_ttl(&self, ttl: u32) -> Result<(), Error>1.9.0

-

Sets the value for the IP_TTL option on this socket.

- -

This value sets the time-to-live field that is used in every packet sent -from this socket.

-

fn ttl(&self) -> Result<u32, Error>1.9.0

-

Gets the value of the IP_TTL option for this socket.

- -

For more information about this option, see set_ttl.

-

fn take_error(&self) -> Result<Option<Error>, Error>1.9.0

-

Get the value of the SO_ERROR option on this socket.

- -

This will retrieve the stored error in the underlying socket, clearing -the field in the process. This can be useful for checking errors between -calls.

-

fn set_nonblocking(&self, nonblocking: bool) -> Result<(), Error>1.9.0

-

Moves this TCP stream into or out of nonblocking mode.

- -

On Unix this corresponds to calling fcntl, and on Windows this -corresponds to calling ioctlsocket.

-

Trait Implementations

impl Read for TcpStream

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-

impl Write for TcpStream

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

impl<'a> Read for &'a TcpStream

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-

impl<'a> Write for &'a TcpStream

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

impl Debug for TcpStream

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl AsRawFd for TcpStream

fn as_raw_fd(&self) -> i32

-

impl FromRawFd for TcpStream1.1.0

unsafe fn from_raw_fd(fd: i32) -> TcpStream

-

impl IntoRawFd for TcpStream1.4.0

fn into_raw_fd(self) -> i32

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/struct.UdpSocket.html b/doc/bitflags/__core/net/struct.UdpSocket.html deleted file mode 100644 index ce568c12..00000000 --- a/doc/bitflags/__core/net/struct.UdpSocket.html +++ /dev/null @@ -1,292 +0,0 @@ - - - - - - - - - - bitflags::__core::net::UdpSocket - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::net::UdpSocket - - [−] - - [src]

-
pub struct UdpSocket(_);
1.0.0

A User Datagram Protocol socket.

- -

This is an implementation of a bound UDP socket. This supports both IPv4 and -IPv6 addresses, and there is no corresponding notion of a server because UDP -is a datagram protocol.

- -

Examples

-
-use std::net::UdpSocket;
-
-{
-    let mut socket = try!(UdpSocket::bind("127.0.0.1:34254"));
-
-    // read from the socket
-    let mut buf = [0; 10];
-    let (amt, src) = try!(socket.recv_from(&mut buf));
-
-    // send a reply to the socket we received data from
-    let buf = &mut buf[..amt];
-    buf.reverse();
-    try!(socket.send_to(buf, &src));
-} // the socket is closed here
-

Methods

impl UdpSocket

fn bind<A>(addr: A) -> Result<UdpSocket, Error> where A: ToSocketAddrs

-

Creates a UDP socket from the given address.

- -

The address type can be any implementor of ToSocketAddr trait. See -its documentation for concrete examples.

-

fn recv_from(&self, buf: &mut [u8]) -> Result<(usize, SocketAddr), Error>

-

Receives data from the socket. On success, returns the number of bytes -read and the address from whence the data came.

-

fn send_to<A>(&self, buf: &[u8], addr: A) -> Result<usize, Error> where A: ToSocketAddrs

-

Sends data on the socket to the given address. On success, returns the -number of bytes written.

- -

Address type can be any implementor of ToSocketAddrs trait. See its -documentation for concrete examples.

-

fn local_addr(&self) -> Result<SocketAddr, Error>

-

Returns the socket address that this socket was created from.

-

fn try_clone(&self) -> Result<UdpSocket, Error>

-

Creates a new independently owned handle to the underlying socket.

- -

The returned UdpSocket is a reference to the same socket that this -object references. Both handles will read and write the same port, and -options set on one socket will be propagated to the other.

-

fn set_read_timeout(&self, dur: Option<Duration>) -> Result<(), Error>1.4.0

-

Sets the read timeout to the timeout specified.

- -

If the value specified is None, then read calls will block -indefinitely. It is an error to pass the zero Duration to this -method.

- -

Note

-

Platforms may return a different error code whenever a read times out as -a result of setting this option. For example Unix typically returns an -error of the kind WouldBlock, but Windows may return TimedOut.

-

fn set_write_timeout(&self, dur: Option<Duration>) -> Result<(), Error>1.4.0

-

Sets the write timeout to the timeout specified.

- -

If the value specified is None, then write calls will block -indefinitely. It is an error to pass the zero Duration to this -method.

- -

Note

-

Platforms may return a different error code whenever a write times out -as a result of setting this option. For example Unix typically returns -an error of the kind WouldBlock, but Windows may return TimedOut.

-

fn read_timeout(&self) -> Result<Option<Duration>, Error>1.4.0

-

Returns the read timeout of this socket.

- -

If the timeout is None, then read calls will block indefinitely.

-

fn write_timeout(&self) -> Result<Option<Duration>, Error>1.4.0

-

Returns the write timeout of this socket.

- -

If the timeout is None, then write calls will block indefinitely.

-

fn set_broadcast(&self, broadcast: bool) -> Result<(), Error>1.9.0

-

Sets the value of the SO_BROADCAST option for this socket.

- -

When enabled, this socket is allowed to send packets to a broadcast -address.

-

fn broadcast(&self) -> Result<bool, Error>1.9.0

-

Gets the value of the SO_BROADCAST option for this socket.

- -

For more information about this option, see -set_broadcast.

-

fn set_multicast_loop_v4(&self, multicast_loop_v4: bool) -> Result<(), Error>1.9.0

-

Sets the value of the IP_MULTICAST_LOOP option for this socket.

- -

If enabled, multicast packets will be looped back to the local socket. -Note that this may not have any affect on IPv6 sockets.

-

fn multicast_loop_v4(&self) -> Result<bool, Error>1.9.0

-

Gets the value of the IP_MULTICAST_LOOP option for this socket.

- -

For more information about this option, see -set_multicast_loop_v4.

-

fn set_multicast_ttl_v4(&self, multicast_ttl_v4: u32) -> Result<(), Error>1.9.0

-

Sets the value of the IP_MULTICAST_TTL option for this socket.

- -

Indicates the time-to-live value of outgoing multicast packets for -this socket. The default value is 1 which means that multicast packets -don't leave the local network unless explicitly requested.

- -

Note that this may not have any affect on IPv6 sockets.

-

fn multicast_ttl_v4(&self) -> Result<u32, Error>1.9.0

-

Gets the value of the IP_MULTICAST_TTL option for this socket.

- -

For more information about this option, see -set_multicast_ttl_v4.

-

fn set_multicast_loop_v6(&self, multicast_loop_v6: bool) -> Result<(), Error>1.9.0

-

Sets the value of the IPV6_MULTICAST_LOOP option for this socket.

- -

Controls whether this socket sees the multicast packets it sends itself. -Note that this may not have any affect on IPv4 sockets.

-

fn multicast_loop_v6(&self) -> Result<bool, Error>1.9.0

-

Gets the value of the IPV6_MULTICAST_LOOP option for this socket.

- -

For more information about this option, see -set_multicast_loop_v6.

-

fn set_ttl(&self, ttl: u32) -> Result<(), Error>1.9.0

-

Sets the value for the IP_TTL option on this socket.

- -

This value sets the time-to-live field that is used in every packet sent -from this socket.

-

fn ttl(&self) -> Result<u32, Error>1.9.0

-

Gets the value of the IP_TTL option for this socket.

- -

For more information about this option, see set_ttl.

-

fn join_multicast_v4(&self, multiaddr: &Ipv4Addr, interface: &Ipv4Addr) -> Result<(), Error>1.9.0

-

Executes an operation of the IP_ADD_MEMBERSHIP type.

- -

This function specifies a new multicast group for this socket to join. -The address must be a valid multicast address, and interface is the -address of the local interface with which the system should join the -multicast group. If it's equal to INADDR_ANY then an appropriate -interface is chosen by the system.

-

fn join_multicast_v6(&self, multiaddr: &Ipv6Addr, interface: u32) -> Result<(), Error>1.9.0

-

Executes an operation of the IPV6_ADD_MEMBERSHIP type.

- -

This function specifies a new multicast group for this socket to join. -The address must be a valid multicast address, and interface is the -index of the interface to join/leave (or 0 to indicate any interface).

-

fn leave_multicast_v4(&self, multiaddr: &Ipv4Addr, interface: &Ipv4Addr) -> Result<(), Error>1.9.0

-

Executes an operation of the IP_DROP_MEMBERSHIP type.

- -

For more information about this option, see -join_multicast_v4.

-

fn leave_multicast_v6(&self, multiaddr: &Ipv6Addr, interface: u32) -> Result<(), Error>1.9.0

-

Executes an operation of the IPV6_DROP_MEMBERSHIP type.

- -

For more information about this option, see -join_multicast_v6.

-

fn take_error(&self) -> Result<Option<Error>, Error>1.9.0

-

Get the value of the SO_ERROR option on this socket.

- -

This will retrieve the stored error in the underlying socket, clearing -the field in the process. This can be useful for checking errors between -calls.

-

fn connect<A>(&self, addr: A) -> Result<(), Error> where A: ToSocketAddrs1.9.0

-

Connects this UDP socket to a remote address, allowing the send and -recv syscalls to be used to send data and also applies filters to only -receive data from the specified address.

-

fn send(&self, buf: &[u8]) -> Result<usize, Error>1.9.0

-

Sends data on the socket to the remote address to which it is connected.

- -

The connect method will connect this socket to a remote address. This -method will fail if the socket is not connected.

-

fn recv(&self, buf: &mut [u8]) -> Result<usize, Error>1.9.0

-

Receives data on the socket from the remote address to which it is -connected.

- -

The connect method will connect this socket to a remote address. This -method will fail if the socket is not connected.

-

fn set_nonblocking(&self, nonblocking: bool) -> Result<(), Error>1.9.0

-

Moves this UDP socket into or out of nonblocking mode.

- -

On Unix this corresponds to calling fcntl, and on Windows this -corresponds to calling ioctlsocket.

-

Trait Implementations

impl Debug for UdpSocket

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl AsRawFd for UdpSocket

fn as_raw_fd(&self) -> i32

-

impl FromRawFd for UdpSocket1.1.0

unsafe fn from_raw_fd(fd: i32) -> UdpSocket

-

impl IntoRawFd for UdpSocket1.4.0

fn into_raw_fd(self) -> i32

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/net/trait.ToSocketAddrs.html b/doc/bitflags/__core/net/trait.ToSocketAddrs.html deleted file mode 100644 index c1e8e390..00000000 --- a/doc/bitflags/__core/net/trait.ToSocketAddrs.html +++ /dev/null @@ -1,200 +0,0 @@ - - - - - - - - - - bitflags::__core::net::ToSocketAddrs - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::net::ToSocketAddrs - - [−] - - [src]

-
pub trait ToSocketAddrs where Self::Iter::Item == SocketAddr {
-    type Iter: Iterator;
-    fn to_socket_addrs(&self) -> Result<Self::Iter, Error>;
-}

A trait for objects which can be converted or resolved to one or more -SocketAddr values.

- -

This trait is used for generic address resolution when constructing network -objects. By default it is implemented for the following types:

- -
    -

  • SocketAddr, SocketAddrV4, SocketAddrV6 - to_socket_addrs is -identity function.

    • -

  • (IpvNAddr, u16) - to_socket_addrs constructs SocketAddr trivially.

    • -

  • (&str, u16) - the string should be either a string representation of an -IP address expected by FromStr implementation for IpvNAddr or a host -name.

    • -

  • &str - the string should be either a string representation of a -SocketAddr as expected by its FromStr implementation or a string like -<host_name>:<port> pair where <port> is a u16 value.

    • -
- -

This trait allows constructing network objects like TcpStream or -UdpSocket easily with values of various types for the bind/connection -address. It is needed because sometimes one type is more appropriate than -the other: for simple uses a string like "localhost:12345" is much nicer -than manual construction of the corresponding SocketAddr, but sometimes -SocketAddr value is the main source of the address, and converting it to -some other type (e.g. a string) just for it to be converted back to -SocketAddr in constructor methods is pointless.

- -

Some examples:

- -
-use std::net::{SocketAddrV4, TcpStream, UdpSocket, TcpListener, Ipv4Addr};
-
-fn main() {
-    let ip = Ipv4Addr::new(127, 0, 0, 1);
-    let port = 12345;
-
-    // The following lines are equivalent modulo possible "localhost" name
-    // resolution differences
-    let tcp_s = TcpStream::connect(SocketAddrV4::new(ip, port));
-    let tcp_s = TcpStream::connect((ip, port));
-    let tcp_s = TcpStream::connect(("127.0.0.1", port));
-    let tcp_s = TcpStream::connect(("localhost", port));
-    let tcp_s = TcpStream::connect("127.0.0.1:12345");
-    let tcp_s = TcpStream::connect("localhost:12345");
-
-    // TcpListener::bind(), UdpSocket::bind() and UdpSocket::send_to()
-    // behave similarly
-    let tcp_l = TcpListener::bind("localhost:12345");
-
-    let mut udp_s = UdpSocket::bind(("127.0.0.1", port)).unwrap();
-    udp_s.send_to(&[7], (ip, 23451)).unwrap();
-}
-
-

Associated Types

-
-

type Iter: Iterator

Returned iterator over socket addresses which this type may correspond -to.

-
-

Required Methods

-
-

fn to_socket_addrs(&self) -> Result<Self::Iter, Error>

Converts this object to an iterator of resolved SocketAddrs.

- -

The returned iterator may not actually yield any values depending on the -outcome of any resolution performed.

- -

Note that this function may block the current thread while resolution is -performed.

- -

Errors

-

Any errors encountered during resolution will be returned as an Err.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/num/enum.FpCategory.html b/doc/bitflags/__core/num/enum.FpCategory.html deleted file mode 100644 index e8ed947b..00000000 --- a/doc/bitflags/__core/num/enum.FpCategory.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - bitflags::__core::num::FpCategory - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::num::FpCategory - - [−] - - [src]

-
pub enum FpCategory {
-    Nan,
-    Infinite,
-    Zero,
-    Subnormal,
-    Normal,
-}
1.0.0

A classification of floating point numbers.

- -

This enum is used as the return type for f32::classify() and f64::classify(). See -their documentation for more.

-

Variants

-
Nan

"Not a Number", often obtained by dividing by zero

-
Infinite

Positive or negative infinity

-
Zero

Positive or negative zero

-
Subnormal

De-normalized floating point representation (less precise than Normal)

-
Normal

A regular floating point number

-

Trait Implementations

Derived Implementations

impl Debug for FpCategory

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl PartialEq<FpCategory> for FpCategory

fn eq(&self, __arg_0: &FpCategory) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl Clone for FpCategory

fn clone(&self) -> FpCategory

-

fn clone_from(&mut self, source: &Self)

-

impl Copy for FpCategory

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/num/index.html b/doc/bitflags/__core/num/index.html deleted file mode 100644 index aac3a484..00000000 --- a/doc/bitflags/__core/num/index.html +++ /dev/null @@ -1,161 +0,0 @@ - - - - - - - - - - bitflags::__core::num - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::num - - [−] - - [src]

-

Additional functionality for numerics.

- -

This module provides some extra types that are useful when doing numerical -work. See the individual documentation for each piece for more information.

-

Structs

- - - - - - - - - - - - -
ParseFloatError -

An error which can be returned when parsing a float.

-
ParseIntError -

An error which can be returned when parsing an integer.

-
Wrapping -

Provides intentionally-wrapped arithmetic on T.

-

Enums

- - - - -
FpCategory -

A classification of floating point numbers.

-

Traits

- - - - - - - - -
One - [Unstable]

Types that have a "one" value.

-
Zero - [Unstable]

Types that have a "zero" value.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/num/sidebar-items.js b/doc/bitflags/__core/num/sidebar-items.js deleted file mode 100644 index cb4b296e..00000000 --- a/doc/bitflags/__core/num/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["FpCategory","A classification of floating point numbers."]],"struct":[["ParseFloatError","An error which can be returned when parsing a float."],["ParseIntError","An error which can be returned when parsing an integer."],["Wrapping","Provides intentionally-wrapped arithmetic on `T`."]],"trait":[["One","Types that have a \"one\" value."],["Zero","Types that have a \"zero\" value."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/num/struct.ParseFloatError.html b/doc/bitflags/__core/num/struct.ParseFloatError.html deleted file mode 100644 index 8dd80de3..00000000 --- a/doc/bitflags/__core/num/struct.ParseFloatError.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::num::ParseFloatError - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::num::ParseFloatError - - [−] - - [src]

-
pub struct ParseFloatError {
-    // some fields omitted
-}
1.0.0

An error which can be returned when parsing a float.

- -

This error is used as the error type for the FromStr implementation -for f32 and f64.

-

Trait Implementations

impl Error for ParseFloatError

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

impl Display for ParseFloatError

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl PartialEq<ParseFloatError> for ParseFloatError

fn eq(&self, __arg_0: &ParseFloatError) -> bool

-

fn ne(&self, __arg_0: &ParseFloatError) -> bool

-

impl Clone for ParseFloatError

fn clone(&self) -> ParseFloatError

-

fn clone_from(&mut self, source: &Self)

-

impl Debug for ParseFloatError

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/num/struct.ParseIntError.html b/doc/bitflags/__core/num/struct.ParseIntError.html deleted file mode 100644 index ae5ff2da..00000000 --- a/doc/bitflags/__core/num/struct.ParseIntError.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::num::ParseIntError - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::num::ParseIntError - - [−] - - [src]

-
pub struct ParseIntError {
-    // some fields omitted
-}
1.0.0

An error which can be returned when parsing an integer.

- -

This error is used as the error type for the from_str_radix() functions -on the primitive integer types, such as i8::from_str_radix().

-

Trait Implementations

impl Error for ParseIntError

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

impl Display for ParseIntError

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl PartialEq<ParseIntError> for ParseIntError

fn eq(&self, __arg_0: &ParseIntError) -> bool

-

fn ne(&self, __arg_0: &ParseIntError) -> bool

-

impl Clone for ParseIntError

fn clone(&self) -> ParseIntError

-

fn clone_from(&mut self, source: &Self)

-

impl Debug for ParseIntError

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/num/struct.Wrapping.html b/doc/bitflags/__core/num/struct.Wrapping.html deleted file mode 100644 index 1d9a29a3..00000000 --- a/doc/bitflags/__core/num/struct.Wrapping.html +++ /dev/null @@ -1,459 +0,0 @@ - - - - - - - - - - bitflags::__core::num::Wrapping - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::num::Wrapping - - [−] - - [src]

-
pub struct Wrapping<T>(pub T);
1.0.0

Provides intentionally-wrapped arithmetic on T.

- -

Operations like + on u32 values is intended to never overflow, -and in some debug configurations overflow is detected and results -in a panic. While most arithmetic falls into this category, some -code explicitly expects and relies upon modular arithmetic (e.g., -hashing).

- -

Wrapping arithmetic can be achieved either through methods like -wrapping_add, or through the Wrapping<T> type, which says that -all standard arithmetic operations on the underlying value are -intended to have wrapping semantics.

-

Trait Implementations

impl<T> Debug for Wrapping<T> where T: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Display for Wrapping<T> where T: Display1.10.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl Shl<usize> for Wrapping<u8>

type Output = Wrapping<u8>

-

fn shl(self, other: usize) -> Wrapping<u8>

-

impl ShlAssign<usize> for Wrapping<u8>1.7.0

fn shl_assign(&mut self, other: usize)

-

impl Shr<usize> for Wrapping<u8>

type Output = Wrapping<u8>

-

fn shr(self, other: usize) -> Wrapping<u8>

-

impl ShrAssign<usize> for Wrapping<u8>1.7.0

fn shr_assign(&mut self, other: usize)

-

impl Shl<usize> for Wrapping<u16>

type Output = Wrapping<u16>

-

fn shl(self, other: usize) -> Wrapping<u16>

-

impl ShlAssign<usize> for Wrapping<u16>1.7.0

fn shl_assign(&mut self, other: usize)

-

impl Shr<usize> for Wrapping<u16>

type Output = Wrapping<u16>

-

fn shr(self, other: usize) -> Wrapping<u16>

-

impl ShrAssign<usize> for Wrapping<u16>1.7.0

fn shr_assign(&mut self, other: usize)

-

impl Shl<usize> for Wrapping<u32>

type Output = Wrapping<u32>

-

fn shl(self, other: usize) -> Wrapping<u32>

-

impl ShlAssign<usize> for Wrapping<u32>1.7.0

fn shl_assign(&mut self, other: usize)

-

impl Shr<usize> for Wrapping<u32>

type Output = Wrapping<u32>

-

fn shr(self, other: usize) -> Wrapping<u32>

-

impl ShrAssign<usize> for Wrapping<u32>1.7.0

fn shr_assign(&mut self, other: usize)

-

impl Shl<usize> for Wrapping<u64>

type Output = Wrapping<u64>

-

fn shl(self, other: usize) -> Wrapping<u64>

-

impl ShlAssign<usize> for Wrapping<u64>1.7.0

fn shl_assign(&mut self, other: usize)

-

impl Shr<usize> for Wrapping<u64>

type Output = Wrapping<u64>

-

fn shr(self, other: usize) -> Wrapping<u64>

-

impl ShrAssign<usize> for Wrapping<u64>1.7.0

fn shr_assign(&mut self, other: usize)

-

impl Shl<usize> for Wrapping<usize>

type Output = Wrapping<usize>

-

fn shl(self, other: usize) -> Wrapping<usize>

-

impl ShlAssign<usize> for Wrapping<usize>1.7.0

fn shl_assign(&mut self, other: usize)

-

impl Shr<usize> for Wrapping<usize>

type Output = Wrapping<usize>

-

fn shr(self, other: usize) -> Wrapping<usize>

-

impl ShrAssign<usize> for Wrapping<usize>1.7.0

fn shr_assign(&mut self, other: usize)

-

impl Shl<usize> for Wrapping<i8>

type Output = Wrapping<i8>

-

fn shl(self, other: usize) -> Wrapping<i8>

-

impl ShlAssign<usize> for Wrapping<i8>1.7.0

fn shl_assign(&mut self, other: usize)

-

impl Shr<usize> for Wrapping<i8>

type Output = Wrapping<i8>

-

fn shr(self, other: usize) -> Wrapping<i8>

-

impl ShrAssign<usize> for Wrapping<i8>1.7.0

fn shr_assign(&mut self, other: usize)

-

impl Shl<usize> for Wrapping<i16>

type Output = Wrapping<i16>

-

fn shl(self, other: usize) -> Wrapping<i16>

-

impl ShlAssign<usize> for Wrapping<i16>1.7.0

fn shl_assign(&mut self, other: usize)

-

impl Shr<usize> for Wrapping<i16>

type Output = Wrapping<i16>

-

fn shr(self, other: usize) -> Wrapping<i16>

-

impl ShrAssign<usize> for Wrapping<i16>1.7.0

fn shr_assign(&mut self, other: usize)

-

impl Shl<usize> for Wrapping<i32>

type Output = Wrapping<i32>

-

fn shl(self, other: usize) -> Wrapping<i32>

-

impl ShlAssign<usize> for Wrapping<i32>1.7.0

fn shl_assign(&mut self, other: usize)

-

impl Shr<usize> for Wrapping<i32>

type Output = Wrapping<i32>

-

fn shr(self, other: usize) -> Wrapping<i32>

-

impl ShrAssign<usize> for Wrapping<i32>1.7.0

fn shr_assign(&mut self, other: usize)

-

impl Shl<usize> for Wrapping<i64>

type Output = Wrapping<i64>

-

fn shl(self, other: usize) -> Wrapping<i64>

-

impl ShlAssign<usize> for Wrapping<i64>1.7.0

fn shl_assign(&mut self, other: usize)

-

impl Shr<usize> for Wrapping<i64>

type Output = Wrapping<i64>

-

fn shr(self, other: usize) -> Wrapping<i64>

-

impl ShrAssign<usize> for Wrapping<i64>1.7.0

fn shr_assign(&mut self, other: usize)

-

impl Shl<usize> for Wrapping<isize>

type Output = Wrapping<isize>

-

fn shl(self, other: usize) -> Wrapping<isize>

-

impl ShlAssign<usize> for Wrapping<isize>1.7.0

fn shl_assign(&mut self, other: usize)

-

impl Shr<usize> for Wrapping<isize>

type Output = Wrapping<isize>

-

fn shr(self, other: usize) -> Wrapping<isize>

-

impl ShrAssign<usize> for Wrapping<isize>1.7.0

fn shr_assign(&mut self, other: usize)

-

impl Add<Wrapping<usize>> for Wrapping<usize>

type Output = Wrapping<usize>

-

fn add(self, other: Wrapping<usize>) -> Wrapping<usize>

-

impl AddAssign<Wrapping<usize>> for Wrapping<usize>1.8.0

fn add_assign(&mut self, other: Wrapping<usize>)

-

impl Sub<Wrapping<usize>> for Wrapping<usize>

type Output = Wrapping<usize>

-

fn sub(self, other: Wrapping<usize>) -> Wrapping<usize>

-

impl SubAssign<Wrapping<usize>> for Wrapping<usize>1.8.0

fn sub_assign(&mut self, other: Wrapping<usize>)

-

impl Mul<Wrapping<usize>> for Wrapping<usize>

type Output = Wrapping<usize>

-

fn mul(self, other: Wrapping<usize>) -> Wrapping<usize>

-

impl MulAssign<Wrapping<usize>> for Wrapping<usize>1.8.0

fn mul_assign(&mut self, other: Wrapping<usize>)

-

impl Div<Wrapping<usize>> for Wrapping<usize>1.3.0

type Output = Wrapping<usize>

-

fn div(self, other: Wrapping<usize>) -> Wrapping<usize>

-

impl DivAssign<Wrapping<usize>> for Wrapping<usize>1.8.0

fn div_assign(&mut self, other: Wrapping<usize>)

-

impl Rem<Wrapping<usize>> for Wrapping<usize>1.7.0

type Output = Wrapping<usize>

-

fn rem(self, other: Wrapping<usize>) -> Wrapping<usize>

-

impl RemAssign<Wrapping<usize>> for Wrapping<usize>1.8.0

fn rem_assign(&mut self, other: Wrapping<usize>)

-

impl Not for Wrapping<usize>

type Output = Wrapping<usize>

-

fn not(self) -> Wrapping<usize>

-

impl BitXor<Wrapping<usize>> for Wrapping<usize>

type Output = Wrapping<usize>

-

fn bitxor(self, other: Wrapping<usize>) -> Wrapping<usize>

-

impl BitXorAssign<Wrapping<usize>> for Wrapping<usize>1.8.0

fn bitxor_assign(&mut self, other: Wrapping<usize>)

-

impl BitOr<Wrapping<usize>> for Wrapping<usize>

type Output = Wrapping<usize>

-

fn bitor(self, other: Wrapping<usize>) -> Wrapping<usize>

-

impl BitOrAssign<Wrapping<usize>> for Wrapping<usize>1.8.0

fn bitor_assign(&mut self, other: Wrapping<usize>)

-

impl BitAnd<Wrapping<usize>> for Wrapping<usize>

type Output = Wrapping<usize>

-

fn bitand(self, other: Wrapping<usize>) -> Wrapping<usize>

-

impl BitAndAssign<Wrapping<usize>> for Wrapping<usize>1.8.0

fn bitand_assign(&mut self, other: Wrapping<usize>)

-

impl Add<Wrapping<u8>> for Wrapping<u8>

type Output = Wrapping<u8>

-

fn add(self, other: Wrapping<u8>) -> Wrapping<u8>

-

impl AddAssign<Wrapping<u8>> for Wrapping<u8>1.8.0

fn add_assign(&mut self, other: Wrapping<u8>)

-

impl Sub<Wrapping<u8>> for Wrapping<u8>

type Output = Wrapping<u8>

-

fn sub(self, other: Wrapping<u8>) -> Wrapping<u8>

-

impl SubAssign<Wrapping<u8>> for Wrapping<u8>1.8.0

fn sub_assign(&mut self, other: Wrapping<u8>)

-

impl Mul<Wrapping<u8>> for Wrapping<u8>

type Output = Wrapping<u8>

-

fn mul(self, other: Wrapping<u8>) -> Wrapping<u8>

-

impl MulAssign<Wrapping<u8>> for Wrapping<u8>1.8.0

fn mul_assign(&mut self, other: Wrapping<u8>)

-

impl Div<Wrapping<u8>> for Wrapping<u8>1.3.0

type Output = Wrapping<u8>

-

fn div(self, other: Wrapping<u8>) -> Wrapping<u8>

-

impl DivAssign<Wrapping<u8>> for Wrapping<u8>1.8.0

fn div_assign(&mut self, other: Wrapping<u8>)

-

impl Rem<Wrapping<u8>> for Wrapping<u8>1.7.0

type Output = Wrapping<u8>

-

fn rem(self, other: Wrapping<u8>) -> Wrapping<u8>

-

impl RemAssign<Wrapping<u8>> for Wrapping<u8>1.8.0

fn rem_assign(&mut self, other: Wrapping<u8>)

-

impl Not for Wrapping<u8>

type Output = Wrapping<u8>

-

fn not(self) -> Wrapping<u8>

-

impl BitXor<Wrapping<u8>> for Wrapping<u8>

type Output = Wrapping<u8>

-

fn bitxor(self, other: Wrapping<u8>) -> Wrapping<u8>

-

impl BitXorAssign<Wrapping<u8>> for Wrapping<u8>1.8.0

fn bitxor_assign(&mut self, other: Wrapping<u8>)

-

impl BitOr<Wrapping<u8>> for Wrapping<u8>

type Output = Wrapping<u8>

-

fn bitor(self, other: Wrapping<u8>) -> Wrapping<u8>

-

impl BitOrAssign<Wrapping<u8>> for Wrapping<u8>1.8.0

fn bitor_assign(&mut self, other: Wrapping<u8>)

-

impl BitAnd<Wrapping<u8>> for Wrapping<u8>

type Output = Wrapping<u8>

-

fn bitand(self, other: Wrapping<u8>) -> Wrapping<u8>

-

impl BitAndAssign<Wrapping<u8>> for Wrapping<u8>1.8.0

fn bitand_assign(&mut self, other: Wrapping<u8>)

-

impl Add<Wrapping<u16>> for Wrapping<u16>

type Output = Wrapping<u16>

-

fn add(self, other: Wrapping<u16>) -> Wrapping<u16>

-

impl AddAssign<Wrapping<u16>> for Wrapping<u16>1.8.0

fn add_assign(&mut self, other: Wrapping<u16>)

-

impl Sub<Wrapping<u16>> for Wrapping<u16>

type Output = Wrapping<u16>

-

fn sub(self, other: Wrapping<u16>) -> Wrapping<u16>

-

impl SubAssign<Wrapping<u16>> for Wrapping<u16>1.8.0

fn sub_assign(&mut self, other: Wrapping<u16>)

-

impl Mul<Wrapping<u16>> for Wrapping<u16>

type Output = Wrapping<u16>

-

fn mul(self, other: Wrapping<u16>) -> Wrapping<u16>

-

impl MulAssign<Wrapping<u16>> for Wrapping<u16>1.8.0

fn mul_assign(&mut self, other: Wrapping<u16>)

-

impl Div<Wrapping<u16>> for Wrapping<u16>1.3.0

type Output = Wrapping<u16>

-

fn div(self, other: Wrapping<u16>) -> Wrapping<u16>

-

impl DivAssign<Wrapping<u16>> for Wrapping<u16>1.8.0

fn div_assign(&mut self, other: Wrapping<u16>)

-

impl Rem<Wrapping<u16>> for Wrapping<u16>1.7.0

type Output = Wrapping<u16>

-

fn rem(self, other: Wrapping<u16>) -> Wrapping<u16>

-

impl RemAssign<Wrapping<u16>> for Wrapping<u16>1.8.0

fn rem_assign(&mut self, other: Wrapping<u16>)

-

impl Not for Wrapping<u16>

type Output = Wrapping<u16>

-

fn not(self) -> Wrapping<u16>

-

impl BitXor<Wrapping<u16>> for Wrapping<u16>

type Output = Wrapping<u16>

-

fn bitxor(self, other: Wrapping<u16>) -> Wrapping<u16>

-

impl BitXorAssign<Wrapping<u16>> for Wrapping<u16>1.8.0

fn bitxor_assign(&mut self, other: Wrapping<u16>)

-

impl BitOr<Wrapping<u16>> for Wrapping<u16>

type Output = Wrapping<u16>

-

fn bitor(self, other: Wrapping<u16>) -> Wrapping<u16>

-

impl BitOrAssign<Wrapping<u16>> for Wrapping<u16>1.8.0

fn bitor_assign(&mut self, other: Wrapping<u16>)

-

impl BitAnd<Wrapping<u16>> for Wrapping<u16>

type Output = Wrapping<u16>

-

fn bitand(self, other: Wrapping<u16>) -> Wrapping<u16>

-

impl BitAndAssign<Wrapping<u16>> for Wrapping<u16>1.8.0

fn bitand_assign(&mut self, other: Wrapping<u16>)

-

impl Add<Wrapping<u32>> for Wrapping<u32>

type Output = Wrapping<u32>

-

fn add(self, other: Wrapping<u32>) -> Wrapping<u32>

-

impl AddAssign<Wrapping<u32>> for Wrapping<u32>1.8.0

fn add_assign(&mut self, other: Wrapping<u32>)

-

impl Sub<Wrapping<u32>> for Wrapping<u32>

type Output = Wrapping<u32>

-

fn sub(self, other: Wrapping<u32>) -> Wrapping<u32>

-

impl SubAssign<Wrapping<u32>> for Wrapping<u32>1.8.0

fn sub_assign(&mut self, other: Wrapping<u32>)

-

impl Mul<Wrapping<u32>> for Wrapping<u32>

type Output = Wrapping<u32>

-

fn mul(self, other: Wrapping<u32>) -> Wrapping<u32>

-

impl MulAssign<Wrapping<u32>> for Wrapping<u32>1.8.0

fn mul_assign(&mut self, other: Wrapping<u32>)

-

impl Div<Wrapping<u32>> for Wrapping<u32>1.3.0

type Output = Wrapping<u32>

-

fn div(self, other: Wrapping<u32>) -> Wrapping<u32>

-

impl DivAssign<Wrapping<u32>> for Wrapping<u32>1.8.0

fn div_assign(&mut self, other: Wrapping<u32>)

-

impl Rem<Wrapping<u32>> for Wrapping<u32>1.7.0

type Output = Wrapping<u32>

-

fn rem(self, other: Wrapping<u32>) -> Wrapping<u32>

-

impl RemAssign<Wrapping<u32>> for Wrapping<u32>1.8.0

fn rem_assign(&mut self, other: Wrapping<u32>)

-

impl Not for Wrapping<u32>

type Output = Wrapping<u32>

-

fn not(self) -> Wrapping<u32>

-

impl BitXor<Wrapping<u32>> for Wrapping<u32>

type Output = Wrapping<u32>

-

fn bitxor(self, other: Wrapping<u32>) -> Wrapping<u32>

-

impl BitXorAssign<Wrapping<u32>> for Wrapping<u32>1.8.0

fn bitxor_assign(&mut self, other: Wrapping<u32>)

-

impl BitOr<Wrapping<u32>> for Wrapping<u32>

type Output = Wrapping<u32>

-

fn bitor(self, other: Wrapping<u32>) -> Wrapping<u32>

-

impl BitOrAssign<Wrapping<u32>> for Wrapping<u32>1.8.0

fn bitor_assign(&mut self, other: Wrapping<u32>)

-

impl BitAnd<Wrapping<u32>> for Wrapping<u32>

type Output = Wrapping<u32>

-

fn bitand(self, other: Wrapping<u32>) -> Wrapping<u32>

-

impl BitAndAssign<Wrapping<u32>> for Wrapping<u32>1.8.0

fn bitand_assign(&mut self, other: Wrapping<u32>)

-

impl Add<Wrapping<u64>> for Wrapping<u64>

type Output = Wrapping<u64>

-

fn add(self, other: Wrapping<u64>) -> Wrapping<u64>

-

impl AddAssign<Wrapping<u64>> for Wrapping<u64>1.8.0

fn add_assign(&mut self, other: Wrapping<u64>)

-

impl Sub<Wrapping<u64>> for Wrapping<u64>

type Output = Wrapping<u64>

-

fn sub(self, other: Wrapping<u64>) -> Wrapping<u64>

-

impl SubAssign<Wrapping<u64>> for Wrapping<u64>1.8.0

fn sub_assign(&mut self, other: Wrapping<u64>)

-

impl Mul<Wrapping<u64>> for Wrapping<u64>

type Output = Wrapping<u64>

-

fn mul(self, other: Wrapping<u64>) -> Wrapping<u64>

-

impl MulAssign<Wrapping<u64>> for Wrapping<u64>1.8.0

fn mul_assign(&mut self, other: Wrapping<u64>)

-

impl Div<Wrapping<u64>> for Wrapping<u64>1.3.0

type Output = Wrapping<u64>

-

fn div(self, other: Wrapping<u64>) -> Wrapping<u64>

-

impl DivAssign<Wrapping<u64>> for Wrapping<u64>1.8.0

fn div_assign(&mut self, other: Wrapping<u64>)

-

impl Rem<Wrapping<u64>> for Wrapping<u64>1.7.0

type Output = Wrapping<u64>

-

fn rem(self, other: Wrapping<u64>) -> Wrapping<u64>

-

impl RemAssign<Wrapping<u64>> for Wrapping<u64>1.8.0

fn rem_assign(&mut self, other: Wrapping<u64>)

-

impl Not for Wrapping<u64>

type Output = Wrapping<u64>

-

fn not(self) -> Wrapping<u64>

-

impl BitXor<Wrapping<u64>> for Wrapping<u64>

type Output = Wrapping<u64>

-

fn bitxor(self, other: Wrapping<u64>) -> Wrapping<u64>

-

impl BitXorAssign<Wrapping<u64>> for Wrapping<u64>1.8.0

fn bitxor_assign(&mut self, other: Wrapping<u64>)

-

impl BitOr<Wrapping<u64>> for Wrapping<u64>

type Output = Wrapping<u64>

-

fn bitor(self, other: Wrapping<u64>) -> Wrapping<u64>

-

impl BitOrAssign<Wrapping<u64>> for Wrapping<u64>1.8.0

fn bitor_assign(&mut self, other: Wrapping<u64>)

-

impl BitAnd<Wrapping<u64>> for Wrapping<u64>

type Output = Wrapping<u64>

-

fn bitand(self, other: Wrapping<u64>) -> Wrapping<u64>

-

impl BitAndAssign<Wrapping<u64>> for Wrapping<u64>1.8.0

fn bitand_assign(&mut self, other: Wrapping<u64>)

-

impl Add<Wrapping<isize>> for Wrapping<isize>

type Output = Wrapping<isize>

-

fn add(self, other: Wrapping<isize>) -> Wrapping<isize>

-

impl AddAssign<Wrapping<isize>> for Wrapping<isize>1.8.0

fn add_assign(&mut self, other: Wrapping<isize>)

-

impl Sub<Wrapping<isize>> for Wrapping<isize>

type Output = Wrapping<isize>

-

fn sub(self, other: Wrapping<isize>) -> Wrapping<isize>

-

impl SubAssign<Wrapping<isize>> for Wrapping<isize>1.8.0

fn sub_assign(&mut self, other: Wrapping<isize>)

-

impl Mul<Wrapping<isize>> for Wrapping<isize>

type Output = Wrapping<isize>

-

fn mul(self, other: Wrapping<isize>) -> Wrapping<isize>

-

impl MulAssign<Wrapping<isize>> for Wrapping<isize>1.8.0

fn mul_assign(&mut self, other: Wrapping<isize>)

-

impl Div<Wrapping<isize>> for Wrapping<isize>1.3.0

type Output = Wrapping<isize>

-

fn div(self, other: Wrapping<isize>) -> Wrapping<isize>

-

impl DivAssign<Wrapping<isize>> for Wrapping<isize>1.8.0

fn div_assign(&mut self, other: Wrapping<isize>)

-

impl Rem<Wrapping<isize>> for Wrapping<isize>1.7.0

type Output = Wrapping<isize>

-

fn rem(self, other: Wrapping<isize>) -> Wrapping<isize>

-

impl RemAssign<Wrapping<isize>> for Wrapping<isize>1.8.0

fn rem_assign(&mut self, other: Wrapping<isize>)

-

impl Not for Wrapping<isize>

type Output = Wrapping<isize>

-

fn not(self) -> Wrapping<isize>

-

impl BitXor<Wrapping<isize>> for Wrapping<isize>

type Output = Wrapping<isize>

-

fn bitxor(self, other: Wrapping<isize>) -> Wrapping<isize>

-

impl BitXorAssign<Wrapping<isize>> for Wrapping<isize>1.8.0

fn bitxor_assign(&mut self, other: Wrapping<isize>)

-

impl BitOr<Wrapping<isize>> for Wrapping<isize>

type Output = Wrapping<isize>

-

fn bitor(self, other: Wrapping<isize>) -> Wrapping<isize>

-

impl BitOrAssign<Wrapping<isize>> for Wrapping<isize>1.8.0

fn bitor_assign(&mut self, other: Wrapping<isize>)

-

impl BitAnd<Wrapping<isize>> for Wrapping<isize>

type Output = Wrapping<isize>

-

fn bitand(self, other: Wrapping<isize>) -> Wrapping<isize>

-

impl BitAndAssign<Wrapping<isize>> for Wrapping<isize>1.8.0

fn bitand_assign(&mut self, other: Wrapping<isize>)

-

impl Add<Wrapping<i8>> for Wrapping<i8>

type Output = Wrapping<i8>

-

fn add(self, other: Wrapping<i8>) -> Wrapping<i8>

-

impl AddAssign<Wrapping<i8>> for Wrapping<i8>1.8.0

fn add_assign(&mut self, other: Wrapping<i8>)

-

impl Sub<Wrapping<i8>> for Wrapping<i8>

type Output = Wrapping<i8>

-

fn sub(self, other: Wrapping<i8>) -> Wrapping<i8>

-

impl SubAssign<Wrapping<i8>> for Wrapping<i8>1.8.0

fn sub_assign(&mut self, other: Wrapping<i8>)

-

impl Mul<Wrapping<i8>> for Wrapping<i8>

type Output = Wrapping<i8>

-

fn mul(self, other: Wrapping<i8>) -> Wrapping<i8>

-

impl MulAssign<Wrapping<i8>> for Wrapping<i8>1.8.0

fn mul_assign(&mut self, other: Wrapping<i8>)

-

impl Div<Wrapping<i8>> for Wrapping<i8>1.3.0

type Output = Wrapping<i8>

-

fn div(self, other: Wrapping<i8>) -> Wrapping<i8>

-

impl DivAssign<Wrapping<i8>> for Wrapping<i8>1.8.0

fn div_assign(&mut self, other: Wrapping<i8>)

-

impl Rem<Wrapping<i8>> for Wrapping<i8>1.7.0

type Output = Wrapping<i8>

-

fn rem(self, other: Wrapping<i8>) -> Wrapping<i8>

-

impl RemAssign<Wrapping<i8>> for Wrapping<i8>1.8.0

fn rem_assign(&mut self, other: Wrapping<i8>)

-

impl Not for Wrapping<i8>

type Output = Wrapping<i8>

-

fn not(self) -> Wrapping<i8>

-

impl BitXor<Wrapping<i8>> for Wrapping<i8>

type Output = Wrapping<i8>

-

fn bitxor(self, other: Wrapping<i8>) -> Wrapping<i8>

-

impl BitXorAssign<Wrapping<i8>> for Wrapping<i8>1.8.0

fn bitxor_assign(&mut self, other: Wrapping<i8>)

-

impl BitOr<Wrapping<i8>> for Wrapping<i8>

type Output = Wrapping<i8>

-

fn bitor(self, other: Wrapping<i8>) -> Wrapping<i8>

-

impl BitOrAssign<Wrapping<i8>> for Wrapping<i8>1.8.0

fn bitor_assign(&mut self, other: Wrapping<i8>)

-

impl BitAnd<Wrapping<i8>> for Wrapping<i8>

type Output = Wrapping<i8>

-

fn bitand(self, other: Wrapping<i8>) -> Wrapping<i8>

-

impl BitAndAssign<Wrapping<i8>> for Wrapping<i8>1.8.0

fn bitand_assign(&mut self, other: Wrapping<i8>)

-

impl Add<Wrapping<i16>> for Wrapping<i16>

type Output = Wrapping<i16>

-

fn add(self, other: Wrapping<i16>) -> Wrapping<i16>

-

impl AddAssign<Wrapping<i16>> for Wrapping<i16>1.8.0

fn add_assign(&mut self, other: Wrapping<i16>)

-

impl Sub<Wrapping<i16>> for Wrapping<i16>

type Output = Wrapping<i16>

-

fn sub(self, other: Wrapping<i16>) -> Wrapping<i16>

-

impl SubAssign<Wrapping<i16>> for Wrapping<i16>1.8.0

fn sub_assign(&mut self, other: Wrapping<i16>)

-

impl Mul<Wrapping<i16>> for Wrapping<i16>

type Output = Wrapping<i16>

-

fn mul(self, other: Wrapping<i16>) -> Wrapping<i16>

-

impl MulAssign<Wrapping<i16>> for Wrapping<i16>1.8.0

fn mul_assign(&mut self, other: Wrapping<i16>)

-

impl Div<Wrapping<i16>> for Wrapping<i16>1.3.0

type Output = Wrapping<i16>

-

fn div(self, other: Wrapping<i16>) -> Wrapping<i16>

-

impl DivAssign<Wrapping<i16>> for Wrapping<i16>1.8.0

fn div_assign(&mut self, other: Wrapping<i16>)

-

impl Rem<Wrapping<i16>> for Wrapping<i16>1.7.0

type Output = Wrapping<i16>

-

fn rem(self, other: Wrapping<i16>) -> Wrapping<i16>

-

impl RemAssign<Wrapping<i16>> for Wrapping<i16>1.8.0

fn rem_assign(&mut self, other: Wrapping<i16>)

-

impl Not for Wrapping<i16>

type Output = Wrapping<i16>

-

fn not(self) -> Wrapping<i16>

-

impl BitXor<Wrapping<i16>> for Wrapping<i16>

type Output = Wrapping<i16>

-

fn bitxor(self, other: Wrapping<i16>) -> Wrapping<i16>

-

impl BitXorAssign<Wrapping<i16>> for Wrapping<i16>1.8.0

fn bitxor_assign(&mut self, other: Wrapping<i16>)

-

impl BitOr<Wrapping<i16>> for Wrapping<i16>

type Output = Wrapping<i16>

-

fn bitor(self, other: Wrapping<i16>) -> Wrapping<i16>

-

impl BitOrAssign<Wrapping<i16>> for Wrapping<i16>1.8.0

fn bitor_assign(&mut self, other: Wrapping<i16>)

-

impl BitAnd<Wrapping<i16>> for Wrapping<i16>

type Output = Wrapping<i16>

-

fn bitand(self, other: Wrapping<i16>) -> Wrapping<i16>

-

impl BitAndAssign<Wrapping<i16>> for Wrapping<i16>1.8.0

fn bitand_assign(&mut self, other: Wrapping<i16>)

-

impl Add<Wrapping<i32>> for Wrapping<i32>

type Output = Wrapping<i32>

-

fn add(self, other: Wrapping<i32>) -> Wrapping<i32>

-

impl AddAssign<Wrapping<i32>> for Wrapping<i32>1.8.0

fn add_assign(&mut self, other: Wrapping<i32>)

-

impl Sub<Wrapping<i32>> for Wrapping<i32>

type Output = Wrapping<i32>

-

fn sub(self, other: Wrapping<i32>) -> Wrapping<i32>

-

impl SubAssign<Wrapping<i32>> for Wrapping<i32>1.8.0

fn sub_assign(&mut self, other: Wrapping<i32>)

-

impl Mul<Wrapping<i32>> for Wrapping<i32>

type Output = Wrapping<i32>

-

fn mul(self, other: Wrapping<i32>) -> Wrapping<i32>

-

impl MulAssign<Wrapping<i32>> for Wrapping<i32>1.8.0

fn mul_assign(&mut self, other: Wrapping<i32>)

-

impl Div<Wrapping<i32>> for Wrapping<i32>1.3.0

type Output = Wrapping<i32>

-

fn div(self, other: Wrapping<i32>) -> Wrapping<i32>

-

impl DivAssign<Wrapping<i32>> for Wrapping<i32>1.8.0

fn div_assign(&mut self, other: Wrapping<i32>)

-

impl Rem<Wrapping<i32>> for Wrapping<i32>1.7.0

type Output = Wrapping<i32>

-

fn rem(self, other: Wrapping<i32>) -> Wrapping<i32>

-

impl RemAssign<Wrapping<i32>> for Wrapping<i32>1.8.0

fn rem_assign(&mut self, other: Wrapping<i32>)

-

impl Not for Wrapping<i32>

type Output = Wrapping<i32>

-

fn not(self) -> Wrapping<i32>

-

impl BitXor<Wrapping<i32>> for Wrapping<i32>

type Output = Wrapping<i32>

-

fn bitxor(self, other: Wrapping<i32>) -> Wrapping<i32>

-

impl BitXorAssign<Wrapping<i32>> for Wrapping<i32>1.8.0

fn bitxor_assign(&mut self, other: Wrapping<i32>)

-

impl BitOr<Wrapping<i32>> for Wrapping<i32>

type Output = Wrapping<i32>

-

fn bitor(self, other: Wrapping<i32>) -> Wrapping<i32>

-

impl BitOrAssign<Wrapping<i32>> for Wrapping<i32>1.8.0

fn bitor_assign(&mut self, other: Wrapping<i32>)

-

impl BitAnd<Wrapping<i32>> for Wrapping<i32>

type Output = Wrapping<i32>

-

fn bitand(self, other: Wrapping<i32>) -> Wrapping<i32>

-

impl BitAndAssign<Wrapping<i32>> for Wrapping<i32>1.8.0

fn bitand_assign(&mut self, other: Wrapping<i32>)

-

impl Add<Wrapping<i64>> for Wrapping<i64>

type Output = Wrapping<i64>

-

fn add(self, other: Wrapping<i64>) -> Wrapping<i64>

-

impl AddAssign<Wrapping<i64>> for Wrapping<i64>1.8.0

fn add_assign(&mut self, other: Wrapping<i64>)

-

impl Sub<Wrapping<i64>> for Wrapping<i64>

type Output = Wrapping<i64>

-

fn sub(self, other: Wrapping<i64>) -> Wrapping<i64>

-

impl SubAssign<Wrapping<i64>> for Wrapping<i64>1.8.0

fn sub_assign(&mut self, other: Wrapping<i64>)

-

impl Mul<Wrapping<i64>> for Wrapping<i64>

type Output = Wrapping<i64>

-

fn mul(self, other: Wrapping<i64>) -> Wrapping<i64>

-

impl MulAssign<Wrapping<i64>> for Wrapping<i64>1.8.0

fn mul_assign(&mut self, other: Wrapping<i64>)

-

impl Div<Wrapping<i64>> for Wrapping<i64>1.3.0

type Output = Wrapping<i64>

-

fn div(self, other: Wrapping<i64>) -> Wrapping<i64>

-

impl DivAssign<Wrapping<i64>> for Wrapping<i64>1.8.0

fn div_assign(&mut self, other: Wrapping<i64>)

-

impl Rem<Wrapping<i64>> for Wrapping<i64>1.7.0

type Output = Wrapping<i64>

-

fn rem(self, other: Wrapping<i64>) -> Wrapping<i64>

-

impl RemAssign<Wrapping<i64>> for Wrapping<i64>1.8.0

fn rem_assign(&mut self, other: Wrapping<i64>)

-

impl Not for Wrapping<i64>

type Output = Wrapping<i64>

-

fn not(self) -> Wrapping<i64>

-

impl BitXor<Wrapping<i64>> for Wrapping<i64>

type Output = Wrapping<i64>

-

fn bitxor(self, other: Wrapping<i64>) -> Wrapping<i64>

-

impl BitXorAssign<Wrapping<i64>> for Wrapping<i64>1.8.0

fn bitxor_assign(&mut self, other: Wrapping<i64>)

-

impl BitOr<Wrapping<i64>> for Wrapping<i64>

type Output = Wrapping<i64>

-

fn bitor(self, other: Wrapping<i64>) -> Wrapping<i64>

-

impl BitOrAssign<Wrapping<i64>> for Wrapping<i64>1.8.0

fn bitor_assign(&mut self, other: Wrapping<i64>)

-

impl BitAnd<Wrapping<i64>> for Wrapping<i64>

type Output = Wrapping<i64>

-

fn bitand(self, other: Wrapping<i64>) -> Wrapping<i64>

-

impl BitAndAssign<Wrapping<i64>> for Wrapping<i64>1.8.0

fn bitand_assign(&mut self, other: Wrapping<i64>)

-

Derived Implementations

impl<T> Hash for Wrapping<T> where T: Hash

fn hash<__HT>(&self, __arg_0: &mut __HT) where __HT: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<T> Default for Wrapping<T> where T: Default

fn default() -> Wrapping<T>

-

impl<T> Copy for Wrapping<T> where T: Copy

impl<T> Clone for Wrapping<T> where T: Clone

fn clone(&self) -> Wrapping<T>

-

fn clone_from(&mut self, source: &Self)

-

impl<T> Ord for Wrapping<T> where T: Ord

fn cmp(&self, __arg_0: &Wrapping<T>) -> Ordering

-

impl<T> PartialOrd<Wrapping<T>> for Wrapping<T> where T: PartialOrd<T>

fn partial_cmp(&self, __arg_0: &Wrapping<T>) -> Option<Ordering>

-

fn lt(&self, __arg_0: &Wrapping<T>) -> bool

-

fn le(&self, __arg_0: &Wrapping<T>) -> bool

-

fn gt(&self, __arg_0: &Wrapping<T>) -> bool

-

fn ge(&self, __arg_0: &Wrapping<T>) -> bool

-

impl<T> Eq for Wrapping<T> where T: Eq

impl<T> PartialEq<Wrapping<T>> for Wrapping<T> where T: PartialEq<T>

fn eq(&self, __arg_0: &Wrapping<T>) -> bool

-

fn ne(&self, __arg_0: &Wrapping<T>) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/num/trait.One.html b/doc/bitflags/__core/num/trait.One.html deleted file mode 100644 index 20d6c948..00000000 --- a/doc/bitflags/__core/num/trait.One.html +++ /dev/null @@ -1,141 +0,0 @@ - - - - - - - - - - bitflags::__core::num::One - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::num::One - - [−] - - [src]

-
pub trait One {
-    fn one() -> Self;
-}
Unstable (zero_one)

: unsure of placement, wants to use associated constants

-

Types that have a "one" value.

- -

This trait is intended for use in conjunction with Mul, as an identity: -x * T::one() == x.

-
-

Required Methods

-
-

fn one() -> Self

Unstable (zero_one)

: unsure of placement, wants to use associated constants

-

The "one" (usually, multiplicative identity) for this type.

-
-

Implementors

-
    -
  • impl One for u8
    • -
  • impl One for u16
    • -
  • impl One for u32
    • -
  • impl One for u64
    • -
  • impl One for usize
    • -
  • impl One for i8
    • -
  • impl One for i16
    • -
  • impl One for i32
    • -
  • impl One for i64
    • -
  • impl One for isize
    • -
  • impl One for f32
    • -
  • impl One for f64
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/num/trait.Zero.html b/doc/bitflags/__core/num/trait.Zero.html deleted file mode 100644 index 06c5535a..00000000 --- a/doc/bitflags/__core/num/trait.Zero.html +++ /dev/null @@ -1,141 +0,0 @@ - - - - - - - - - - bitflags::__core::num::Zero - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::num::Zero - - [−] - - [src]

-
pub trait Zero {
-    fn zero() -> Self;
-}
Unstable (zero_one)

: unsure of placement, wants to use associated constants

-

Types that have a "zero" value.

- -

This trait is intended for use in conjunction with Add, as an identity: -x + T::zero() == x.

-
-

Required Methods

-
-

fn zero() -> Self

Unstable (zero_one)

: unsure of placement, wants to use associated constants

-

The "zero" (usually, additive identity) for this type.

-
-

Implementors

-
    -
  • impl Zero for u8
    • -
  • impl Zero for u16
    • -
  • impl Zero for u32
    • -
  • impl Zero for u64
    • -
  • impl Zero for usize
    • -
  • impl Zero for i8
    • -
  • impl Zero for i16
    • -
  • impl Zero for i32
    • -
  • impl Zero for i64
    • -
  • impl Zero for isize
    • -
  • impl Zero for f32
    • -
  • impl Zero for f64
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/enum.RangeInclusive.html b/doc/bitflags/__core/ops/enum.RangeInclusive.html deleted file mode 100644 index 6fcea43c..00000000 --- a/doc/bitflags/__core/ops/enum.RangeInclusive.html +++ /dev/null @@ -1,261 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::RangeInclusive - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::ops::RangeInclusive - - [−] - - [src]

-
pub enum RangeInclusive<Idx> {
-    Empty {
-        at: Idx,
-    },
-    NonEmpty {
-        start: Idx,
-        end: Idx,
-    },
-}
Unstable (inclusive_range)

: recently added, follows RFC

-

An inclusive range which is bounded at both ends: { x | start <= x <= end }. -Use start...end (three dots) for its shorthand.

- -

See the contains() method for its characterization.

- -

Examples

-
-#![feature(inclusive_range,inclusive_range_syntax,iter_arith)]
-fn main() {
-    assert_eq!((3...5), std::ops::RangeInclusive::NonEmpty{ start: 3, end: 5 });
-    assert_eq!(3+4+5, (3...5).sum());
-
-    let arr = [0, 1, 2, 3];
-    assert_eq!(arr[ ...2], [0,1,2  ]);
-    assert_eq!(arr[1...2], [  1,2  ]);  // RangeInclusive
-}
-

Variants

-
Empty
Unstable (inclusive_range)

: recently added, follows RFC

-

Empty range (iteration has finished)

-

Fields

- -
at
Unstable (inclusive_range)

: recently added, follows RFC

-
NonEmpty
Unstable (inclusive_range)

: recently added, follows RFC

-

Non-empty range (iteration will yield value(s))

-

Fields

- -
start
Unstable (inclusive_range)

: recently added, follows RFC

-
end
Unstable (inclusive_range)

: recently added, follows RFC

-

Methods

impl<A> RangeInclusive<A> where A: Step

fn step_by(self, by: A) -> StepBy<A, RangeInclusive<A>>

-
Unstable (step_by)

: recent addition

-

Creates an iterator with the same range, but stepping by the -given amount at each iteration.

- -

The resulting iterator handles overflow by stopping.

- -

Examples

-
-#![feature(step_by, inclusive_range_syntax)]
-
-for i in (0...10).step_by(2) {
-    println!("{}", i);
-}
- -

This prints:

- -
0
-2
-4
-6
-8
-10
-
-

impl<Idx> RangeInclusive<Idx> where Idx: PartialOrd<Idx>

fn contains(&self, item: Idx) -> bool

-
Unstable (range_contains)

: recently added as per RFC

-
-

Examples

-
-#![feature(range_contains,inclusive_range_syntax)]
-fn main() {
-    assert!( ! (3...5).contains(2));
-    assert!(   (3...5).contains(3));
-    assert!(   (3...5).contains(4));
-    assert!(   (3...5).contains(5));
-    assert!( ! (3...5).contains(6));
-
-    assert!(   (3...3).contains(3));
-    assert!( ! (3...2).contains(3));
-}
-

Trait Implementations

impl ExactSizeIterator for RangeInclusive<usize>

fn len(&self) -> usize1.0.0

-

impl ExactSizeIterator for RangeInclusive<u8>

fn len(&self) -> usize1.0.0

-

impl ExactSizeIterator for RangeInclusive<u16>

fn len(&self) -> usize1.0.0

-

impl ExactSizeIterator for RangeInclusive<u32>

fn len(&self) -> usize1.0.0

-

impl ExactSizeIterator for RangeInclusive<isize>

fn len(&self) -> usize1.0.0

-

impl ExactSizeIterator for RangeInclusive<i8>

fn len(&self) -> usize1.0.0

-

impl ExactSizeIterator for RangeInclusive<i16>

fn len(&self) -> usize1.0.0

-

impl ExactSizeIterator for RangeInclusive<i32>

fn len(&self) -> usize1.0.0

-

impl<A> Iterator for RangeInclusive<A> where A: One + Step, &'a A: Add<&'a A>, &'a A::Output == A

type Item = A

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn next(&mut self) -> Option<A>

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn size_hint(&self) -> (usize, Option<usize>)

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<A> DoubleEndedIterator for RangeInclusive<A> where A: Step + One, &'a A: Add<&'a A>, &'a A: Sub<&'a A>, &'a A::Output == A, &'a A::Output == A

fn next_back(&mut self) -> Option<A>

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl<Idx> Debug for RangeInclusive<Idx> where Idx: Debug

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl<Idx> From<Range<Idx>> for RangeInclusive<Idx> where Idx: One + Sub<Idx, Output=Idx> + PartialOrd<Idx>

fn from(range: Range<Idx>) -> RangeInclusive<Idx>

-
Unstable (inclusive_range)

: recently added, follows RFC

-

Derived Implementations

impl<Idx> Eq for RangeInclusive<Idx> where Idx: Eq

impl<Idx> PartialEq<RangeInclusive<Idx>> for RangeInclusive<Idx> where Idx: PartialEq<Idx>

fn eq(&self, __arg_0: &RangeInclusive<Idx>) -> bool

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn ne(&self, __arg_0: &RangeInclusive<Idx>) -> bool

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl<Idx> Clone for RangeInclusive<Idx> where Idx: Clone

fn clone(&self) -> RangeInclusive<Idx>

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<Idx> Copy for RangeInclusive<Idx> where Idx: Copy

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/index.html b/doc/bitflags/__core/ops/index.html deleted file mode 100644 index 4b487416..00000000 --- a/doc/bitflags/__core/ops/index.html +++ /dev/null @@ -1,477 +0,0 @@ - - - - - - - - - - bitflags::__core::ops - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::ops - - [−] - - [src]

-

Overloadable operators.

- -

Implementing these traits allows you to get an effect similar to -overloading operators.

- -

Some of these traits are imported by the prelude, so they are available in -every Rust program.

- -

Many of the operators take their operands by value. In non-generic -contexts involving built-in types, this is usually not a problem. -However, using these operators in generic code, requires some -attention if values have to be reused as opposed to letting the operators -consume them. One option is to occasionally use clone(). -Another option is to rely on the types involved providing additional -operator implementations for references. For example, for a user-defined -type T which is supposed to support addition, it is probably a good -idea to have both T and &T implement the traits Add<T> and Add<&T> -so that generic code can be written without unnecessary cloning.

- -

Examples

-

This example creates a Point struct that implements Add and Sub, and -then demonstrates adding and subtracting two Points.

- -
-use std::ops::{Add, Sub};
-
-#[derive(Debug)]
-struct Point {
-    x: i32,
-    y: i32,
-}
-
-impl Add for Point {
-    type Output = Point;
-
-    fn add(self, other: Point) -> Point {
-        Point {x: self.x + other.x, y: self.y + other.y}
-    }
-}
-
-impl Sub for Point {
-    type Output = Point;
-
-    fn sub(self, other: Point) -> Point {
-        Point {x: self.x - other.x, y: self.y - other.y}
-    }
-}
-fn main() {
-    println!("{:?}", Point {x: 1, y: 0} + Point {x: 2, y: 3});
-    println!("{:?}", Point {x: 1, y: 0} - Point {x: 2, y: 3});
-}
- -

See the documentation for each trait for a minimum implementation that -prints something to the screen.

-

Structs

- - - - - - - - - - - - - - - - - - - - -
Range -

A (half-open) range which is bounded at both ends: { x | start <= x < end }. -Use start..end (two dots) for its shorthand.

-
RangeFrom -

A range which is only bounded below: { x | start <= x }. -Use start.. for its shorthand.

-
RangeFull -

An unbounded range. Use .. (two dots) for its shorthand.

-
RangeTo -

A range which is only bounded above: { x | x < end }. -Use ..end (two dots) for its shorthand.

-
RangeToInclusive - [Unstable]

An inclusive range which is only bounded above: { x | x <= end }. -Use ...end (three dots) for its shorthand.

-

Enums

- - - - -
RangeInclusive - [Unstable]

An inclusive range which is bounded at both ends: { x | start <= x <= end }. -Use start...end (three dots) for its shorthand.

-

Traits

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Add -

The Add trait is used to specify the functionality of +.

-
AddAssign -

The AddAssign trait is used to specify the functionality of +=.

-
BitAnd -

The BitAnd trait is used to specify the functionality of &.

-
BitAndAssign -

The BitAndAssign trait is used to specify the functionality of &=.

-
BitOr -

The BitOr trait is used to specify the functionality of |.

-
BitOrAssign -

The BitOrAssign trait is used to specify the functionality of |=.

-
BitXor -

The BitXor trait is used to specify the functionality of ^.

-
BitXorAssign -

The BitXorAssign trait is used to specify the functionality of ^=.

-
Deref -

The Deref trait is used to specify the functionality of dereferencing -operations, like *v.

-
DerefMut -

The DerefMut trait is used to specify the functionality of dereferencing -mutably like *v = 1;

-
Div -

The Div trait is used to specify the functionality of /.

-
DivAssign -

The DivAssign trait is used to specify the functionality of /=.

-
Drop -

The Drop trait is used to run some code when a value goes out of scope. -This is sometimes called a 'destructor'.

-
Fn -

A version of the call operator that takes an immutable receiver.

-
FnMut -

A version of the call operator that takes a mutable receiver.

-
FnOnce -

A version of the call operator that takes a by-value receiver.

-
Index -

The Index trait is used to specify the functionality of indexing operations -like arr[idx] when used in an immutable context.

-
IndexMut -

The IndexMut trait is used to specify the functionality of indexing -operations like arr[idx], when used in a mutable context.

-
Mul -

The Mul trait is used to specify the functionality of *.

-
MulAssign -

The MulAssign trait is used to specify the functionality of *=.

-
Neg -

The Neg trait is used to specify the functionality of unary -.

-
Not -

The Not trait is used to specify the functionality of unary !.

-
Rem -

The Rem trait is used to specify the functionality of %.

-
RemAssign -

The RemAssign trait is used to specify the functionality of %=.

-
Shl -

The Shl trait is used to specify the functionality of <<.

-
ShlAssign -

The ShlAssign trait is used to specify the functionality of <<=.

-
Shr -

The Shr trait is used to specify the functionality of >>.

-
ShrAssign -

The ShrAssign trait is used to specify the functionality of >>=.

-
Sub -

The Sub trait is used to specify the functionality of -.

-
SubAssign -

The SubAssign trait is used to specify the functionality of -=.

-
BoxPlace - [Unstable]

Specialization of Place trait supporting box EXPR.

-
Boxed - [Unstable]

Core trait for the box EXPR form.

-
CoerceUnsized - [Unstable]

Trait that indicates that this is a pointer or a wrapper for one, -where unsizing can be performed on the pointee.

-
InPlace - [Unstable]

Specialization of Place trait supporting in (PLACE) EXPR.

-
Place - [Unstable]

Both in (PLACE) EXPR and box EXPR desugar into expressions -that allocate an intermediate "place" that holds uninitialized -state. The desugaring evaluates EXPR, and writes the result at -the address returned by the pointer method of this trait.

-
Placer - [Unstable]

Interface to implementations of in (PLACE) EXPR.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/sidebar-items.js b/doc/bitflags/__core/ops/sidebar-items.js deleted file mode 100644 index 95b5fe2d..00000000 --- a/doc/bitflags/__core/ops/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["RangeInclusive","An inclusive range which is bounded at both ends: { x | start <= x <= end }. Use `start...end` (three dots) for its shorthand."]],"struct":[["Range","A (half-open) range which is bounded at both ends: { x | start <= x < end }. Use `start..end` (two dots) for its shorthand."],["RangeFrom","A range which is only bounded below: { x | start <= x }. Use `start..` for its shorthand."],["RangeFull","An unbounded range. Use `..` (two dots) for its shorthand."],["RangeTo","A range which is only bounded above: { x | x < end }. Use `..end` (two dots) for its shorthand."],["RangeToInclusive","An inclusive range which is only bounded above: { x | x <= end }. Use `...end` (three dots) for its shorthand."]],"trait":[["Add","The `Add` trait is used to specify the functionality of `+`."],["AddAssign","The `AddAssign` trait is used to specify the functionality of `+=`."],["BitAnd","The `BitAnd` trait is used to specify the functionality of `&`."],["BitAndAssign","The `BitAndAssign` trait is used to specify the functionality of `&=`."],["BitOr","The `BitOr` trait is used to specify the functionality of `|`."],["BitOrAssign","The `BitOrAssign` trait is used to specify the functionality of `|=`."],["BitXor","The `BitXor` trait is used to specify the functionality of `^`."],["BitXorAssign","The `BitXorAssign` trait is used to specify the functionality of `^=`."],["BoxPlace","Specialization of `Place` trait supporting `box EXPR`."],["Boxed","Core trait for the `box EXPR` form."],["CoerceUnsized","Trait that indicates that this is a pointer or a wrapper for one, where unsizing can be performed on the pointee."],["Deref","The `Deref` trait is used to specify the functionality of dereferencing operations, like `*v`."],["DerefMut","The `DerefMut` trait is used to specify the functionality of dereferencing mutably like `*v = 1;`"],["Div","The `Div` trait is used to specify the functionality of `/`."],["DivAssign","The `DivAssign` trait is used to specify the functionality of `/=`."],["Drop","The `Drop` trait is used to run some code when a value goes out of scope. This is sometimes called a 'destructor'."],["Fn","A version of the call operator that takes an immutable receiver."],["FnMut","A version of the call operator that takes a mutable receiver."],["FnOnce","A version of the call operator that takes a by-value receiver."],["InPlace","Specialization of `Place` trait supporting `in (PLACE) EXPR`."],["Index","The `Index` trait is used to specify the functionality of indexing operations like `arr[idx]` when used in an immutable context."],["IndexMut","The `IndexMut` trait is used to specify the functionality of indexing operations like `arr[idx]`, when used in a mutable context."],["Mul","The `Mul` trait is used to specify the functionality of `*`."],["MulAssign","The `MulAssign` trait is used to specify the functionality of `*=`."],["Neg","The `Neg` trait is used to specify the functionality of unary `-`."],["Not","The `Not` trait is used to specify the functionality of unary `!`."],["Place","Both `in (PLACE) EXPR` and `box EXPR` desugar into expressions that allocate an intermediate \"place\" that holds uninitialized state. The desugaring evaluates EXPR, and writes the result at the address returned by the `pointer` method of this trait."],["Placer","Interface to implementations of `in (PLACE) EXPR`."],["Rem","The `Rem` trait is used to specify the functionality of `%`."],["RemAssign","The `RemAssign` trait is used to specify the functionality of `%=`."],["Shl","The `Shl` trait is used to specify the functionality of `<<`."],["ShlAssign","The `ShlAssign` trait is used to specify the functionality of `<<=`."],["Shr","The `Shr` trait is used to specify the functionality of `>>`."],["ShrAssign","The `ShrAssign` trait is used to specify the functionality of `>>=`."],["Sub","The `Sub` trait is used to specify the functionality of `-`."],["SubAssign","The `SubAssign` trait is used to specify the functionality of `-=`."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/ops/struct.Range.html b/doc/bitflags/__core/ops/struct.Range.html deleted file mode 100644 index 47a00890..00000000 --- a/doc/bitflags/__core/ops/struct.Range.html +++ /dev/null @@ -1,242 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Range - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::ops::Range - - [−] - - [src]

-
pub struct Range<Idx> {
-    pub start: Idx,
-    pub end: Idx,
-}
1.0.0

A (half-open) range which is bounded at both ends: { x | start <= x < end }. -Use start..end (two dots) for its shorthand.

- -

See the contains() method for its characterization.

- -

Examples

-
-#![feature(iter_arith)]
-fn main() {
-    assert_eq!((3..5), std::ops::Range{ start: 3, end: 5 });
-    assert_eq!(3+4+5, (3..6).sum());
-
-    let arr = [0, 1, 2, 3];
-    assert_eq!(arr[ .. ], [0,1,2,3]);
-    assert_eq!(arr[ ..3], [0,1,2  ]);
-    assert_eq!(arr[1.. ], [  1,2,3]);
-    assert_eq!(arr[1..3], [  1,2  ]);  // Range
-}
-

Fields

- - -
start

The lower bound of the range (inclusive).

-
end

The upper bound of the range (exclusive).

-

Methods

impl<A> Range<A> where A: Step

fn step_by(self, by: A) -> StepBy<A, Range<A>>

-
Unstable (step_by)

: recent addition

-

Creates an iterator with the same range, but stepping by the -given amount at each iteration.

- -

The resulting iterator handles overflow by stopping.

- -

Examples

-
-#![feature(step_by)]
-
-for i in (0..10).step_by(2) {
-    println!("{}", i);
-}
- -

This prints:

- -
0
-2
-4
-6
-8
-
-

impl<Idx> Range<Idx> where Idx: PartialOrd<Idx>

fn contains(&self, item: Idx) -> bool

-
Unstable (range_contains)

: recently added as per RFC

-
-

Examples

-
-#![feature(range_contains)]
-fn main() {
-    assert!( ! (3..5).contains(2));
-    assert!(   (3..5).contains(3));
-    assert!(   (3..5).contains(4));
-    assert!( ! (3..5).contains(5));
-
-    assert!( ! (3..3).contains(3));
-    assert!( ! (3..2).contains(3));
-}
-

Trait Implementations

impl<A> Iterator for Range<A> where A: One + Step, &'a A: Add<&'a A>, &'a A::Output == A

type Item = A

-

fn next(&mut self) -> Option<A>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl ExactSizeIterator for Range<usize>

fn len(&self) -> usize

-

impl ExactSizeIterator for Range<u8>

fn len(&self) -> usize

-

impl ExactSizeIterator for Range<u16>

fn len(&self) -> usize

-

impl ExactSizeIterator for Range<u32>

fn len(&self) -> usize

-

impl ExactSizeIterator for Range<isize>

fn len(&self) -> usize

-

impl ExactSizeIterator for Range<i8>

fn len(&self) -> usize

-

impl ExactSizeIterator for Range<i16>

fn len(&self) -> usize

-

impl ExactSizeIterator for Range<i32>

fn len(&self) -> usize

-

impl<A> DoubleEndedIterator for Range<A> where A: Clone + Step + One, &'a A: Add<&'a A>, &'a A: Sub<&'a A>, &'a A::Output == A, &'a A::Output == A

fn next_back(&mut self) -> Option<A>

-

impl<Idx> Debug for Range<Idx> where Idx: Debug

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl<T> RangeArgument<T> for Range<T>

fn start(&self) -> Option<&T>

-
Unstable (collections_range)

: waiting for dust to settle on inclusive ranges

-

fn end(&self) -> Option<&T>

-
Unstable (collections_range)

: waiting for dust to settle on inclusive ranges

-

Derived Implementations

impl<Idx> Eq for Range<Idx> where Idx: Eq

impl<Idx> PartialEq<Range<Idx>> for Range<Idx> where Idx: PartialEq<Idx>

fn eq(&self, __arg_0: &Range<Idx>) -> bool

-

fn ne(&self, __arg_0: &Range<Idx>) -> bool

-

impl<Idx> Clone for Range<Idx> where Idx: Clone

fn clone(&self) -> Range<Idx>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/struct.RangeFrom.html b/doc/bitflags/__core/ops/struct.RangeFrom.html deleted file mode 100644 index 5e7bc6dc..00000000 --- a/doc/bitflags/__core/ops/struct.RangeFrom.html +++ /dev/null @@ -1,219 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::RangeFrom - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::ops::RangeFrom - - [−] - - [src]

-
pub struct RangeFrom<Idx> {
-    pub start: Idx,
-}
1.0.0

A range which is only bounded below: { x | start <= x }. -Use start.. for its shorthand.

- -

See the contains() method for its characterization.

- -

Note: Currently, no overflow checking is done for the iterator -implementation; if you use an integer range and the integer overflows, it -might panic in debug mode or create an endless loop in release mode. This -overflow behavior might change in the future.

- -

Examples

-
-#![feature(iter_arith)]
-fn main() {
-    assert_eq!((2..), std::ops::RangeFrom{ start: 2 });
-    assert_eq!(2+3+4, (2..).take(3).sum());
-
-    let arr = [0, 1, 2, 3];
-    assert_eq!(arr[ .. ], [0,1,2,3]);
-    assert_eq!(arr[ ..3], [0,1,2  ]);
-    assert_eq!(arr[1.. ], [  1,2,3]);  // RangeFrom
-    assert_eq!(arr[1..3], [  1,2  ]);
-}
-

Fields

- -
start

The lower bound of the range (inclusive).

-

Methods

impl<A> RangeFrom<A> where A: Step

fn step_by(self, by: A) -> StepBy<A, RangeFrom<A>>

-
Unstable (step_by)

: recent addition

-

Creates an iterator starting at the same point, but stepping by -the given amount at each iteration.

- -

Examples

-
-
-for i in (0u8..).step_by(2).take(10) {
-    println!("{}", i);
-}
- -

This prints the first ten even natural integers (0 to 18).

-

impl<Idx> RangeFrom<Idx> where Idx: PartialOrd<Idx>

fn contains(&self, item: Idx) -> bool

-
Unstable (range_contains)

: recently added as per RFC

-
-

Examples

-
-#![feature(range_contains)]
-fn main() {
-    assert!( ! (3..).contains(2));
-    assert!(   (3..).contains(3));
-    assert!(   (3..).contains(1_000_000_000));
-}
-

Trait Implementations

impl<A> Iterator for RangeFrom<A> where A: One + Step, &'a A: Add<&'a A>, &'a A::Output == A

type Item = A

-

fn next(&mut self) -> Option<A>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<Idx> Debug for RangeFrom<Idx> where Idx: Debug

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl<T> RangeArgument<T> for RangeFrom<T>

fn start(&self) -> Option<&T>

-
Unstable (collections_range)

: waiting for dust to settle on inclusive ranges

-

Derived Implementations

impl<Idx> Eq for RangeFrom<Idx> where Idx: Eq

impl<Idx> PartialEq<RangeFrom<Idx>> for RangeFrom<Idx> where Idx: PartialEq<Idx>

fn eq(&self, __arg_0: &RangeFrom<Idx>) -> bool

-

fn ne(&self, __arg_0: &RangeFrom<Idx>) -> bool

-

impl<Idx> Clone for RangeFrom<Idx> where Idx: Clone

fn clone(&self) -> RangeFrom<Idx>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/struct.RangeFull.html b/doc/bitflags/__core/ops/struct.RangeFull.html deleted file mode 100644 index 0434ffb5..00000000 --- a/doc/bitflags/__core/ops/struct.RangeFull.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::RangeFull - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::ops::RangeFull - - [−] - - [src]

-
pub struct RangeFull;
1.0.0

An unbounded range. Use .. (two dots) for its shorthand.

- -

Its primary use case is slicing index. It cannot serve as an iterator -because it doesn't have a starting point.

- -

Examples

-
-fn main() {
-    assert_eq!((..), std::ops::RangeFull);
-
-    let arr = [0, 1, 2, 3];
-    assert_eq!(arr[ .. ], [0,1,2,3]);  // RangeFull
-    assert_eq!(arr[ ..3], [0,1,2  ]);
-    assert_eq!(arr[1.. ], [  1,2,3]);
-    assert_eq!(arr[1..3], [  1,2  ]);
-}
-

Trait Implementations

impl Debug for RangeFull

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl<T> RangeArgument<T> for RangeFull

Derived Implementations

impl Eq for RangeFull

impl PartialEq<RangeFull> for RangeFull

fn eq(&self, __arg_0: &RangeFull) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl Clone for RangeFull

fn clone(&self) -> RangeFull

-

fn clone_from(&mut self, source: &Self)

-

impl Copy for RangeFull

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/struct.RangeTo.html b/doc/bitflags/__core/ops/struct.RangeTo.html deleted file mode 100644 index 70838007..00000000 --- a/doc/bitflags/__core/ops/struct.RangeTo.html +++ /dev/null @@ -1,154 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::RangeTo - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::ops::RangeTo - - [−] - - [src]

-
pub struct RangeTo<Idx> {
-    pub end: Idx,
-}
1.0.0

A range which is only bounded above: { x | x < end }. -Use ..end (two dots) for its shorthand.

- -

See the contains() method for its characterization.

- -

It cannot serve as an iterator because it doesn't have a starting point. -``` -fn main() { - assert_eq!((..5), std::ops::RangeTo{ end: 5 });

- -
-let arr = [0, 1, 2, 3];
-assert_eq!(arr[ .. ], [0,1,2,3]);
-assert_eq!(arr[ ..3], [0,1,2  ]);  // RangeTo
-assert_eq!(arr[1.. ], [  1,2,3]);
-assert_eq!(arr[1..3], [  1,2  ]);
- -

} -```

-

Fields

- -
end

The upper bound of the range (exclusive).

-

Methods

impl<Idx> RangeTo<Idx> where Idx: PartialOrd<Idx>

fn contains(&self, item: Idx) -> bool

-
Unstable (range_contains)

: recently added as per RFC

-
-

Examples

-
-#![feature(range_contains)]
-fn main() {
-    assert!(   (..5).contains(-1_000_000_000));
-    assert!(   (..5).contains(4));
-    assert!( ! (..5).contains(5));
-}
-

Trait Implementations

impl<Idx> Debug for RangeTo<Idx> where Idx: Debug

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

impl<T> RangeArgument<T> for RangeTo<T>

fn end(&self) -> Option<&T>

-
Unstable (collections_range)

: waiting for dust to settle on inclusive ranges

-

Derived Implementations

impl<Idx> Eq for RangeTo<Idx> where Idx: Eq

impl<Idx> PartialEq<RangeTo<Idx>> for RangeTo<Idx> where Idx: PartialEq<Idx>

fn eq(&self, __arg_0: &RangeTo<Idx>) -> bool

-

fn ne(&self, __arg_0: &RangeTo<Idx>) -> bool

-

impl<Idx> Clone for RangeTo<Idx> where Idx: Clone

fn clone(&self) -> RangeTo<Idx>

-

fn clone_from(&mut self, source: &Self)

-

impl<Idx> Copy for RangeTo<Idx> where Idx: Copy

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/struct.RangeToInclusive.html b/doc/bitflags/__core/ops/struct.RangeToInclusive.html deleted file mode 100644 index 91fea036..00000000 --- a/doc/bitflags/__core/ops/struct.RangeToInclusive.html +++ /dev/null @@ -1,156 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::RangeToInclusive - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::ops::RangeToInclusive - - [−] - - [src]

-
pub struct RangeToInclusive<Idx> {
-    pub end: Idx,
-}
Unstable (inclusive_range)

: recently added, follows RFC

-

An inclusive range which is only bounded above: { x | x <= end }. -Use ...end (three dots) for its shorthand.

- -

See the contains() method for its characterization.

- -

It cannot serve as an iterator because it doesn't have a starting point.

- -

Examples

-
-#![feature(inclusive_range,inclusive_range_syntax)]
-fn main() {
-    assert_eq!((...5), std::ops::RangeToInclusive{ end: 5 });
-
-    let arr = [0, 1, 2, 3];
-    assert_eq!(arr[ ...2], [0,1,2  ]);  // RangeToInclusive
-    assert_eq!(arr[1...2], [  1,2  ]);
-}
-

Fields

- -
end
Unstable (inclusive_range)

: recently added, follows RFC

-

The upper bound of the range (inclusive)

-

Methods

impl<Idx> RangeToInclusive<Idx> where Idx: PartialOrd<Idx>

fn contains(&self, item: Idx) -> bool

-
Unstable (range_contains)

: recently added as per RFC

-
-

Examples

-
-#![feature(range_contains,inclusive_range_syntax)]
-fn main() {
-    assert!(   (...5).contains(-1_000_000_000));
-    assert!(   (...5).contains(5));
-    assert!( ! (...5).contains(6));
-}
-

Trait Implementations

impl<Idx> Debug for RangeToInclusive<Idx> where Idx: Debug

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-
Unstable (inclusive_range)

: recently added, follows RFC

-

Derived Implementations

impl<Idx> Eq for RangeToInclusive<Idx> where Idx: Eq

impl<Idx> PartialEq<RangeToInclusive<Idx>> for RangeToInclusive<Idx> where Idx: PartialEq<Idx>

fn eq(&self, __arg_0: &RangeToInclusive<Idx>) -> bool

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn ne(&self, __arg_0: &RangeToInclusive<Idx>) -> bool

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl<Idx> Clone for RangeToInclusive<Idx> where Idx: Clone

fn clone(&self) -> RangeToInclusive<Idx>

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<Idx> Copy for RangeToInclusive<Idx> where Idx: Copy

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Add.html b/doc/bitflags/__core/ops/trait.Add.html deleted file mode 100644 index 8d98a179..00000000 --- a/doc/bitflags/__core/ops/trait.Add.html +++ /dev/null @@ -1,213 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Add - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Add - - [−] - - [src]

-
pub trait Add<RHS = Self> {
-    type Output;
-    fn add(self, rhs: RHS) -> Self::Output;
-}

The Add trait is used to specify the functionality of +.

- -

Examples

-

A trivial implementation of Add. When Foo + Foo happens, it ends up -calling add, and therefore, main prints Adding!.

- -
-use std::ops::Add;
-
-struct Foo;
-
-impl Add for Foo {
-    type Output = Foo;
-
-    fn add(self, _rhs: Foo) -> Foo {
-        println!("Adding!");
-        self
-    }
-}
-
-fn main() {
-    Foo + Foo;
-}
-
-

Associated Types

-
-

type Output

The resulting type after applying the + operator

-
-

Required Methods

-
-

fn add(self, rhs: RHS) -> Self::Output

The method for the + operator

-
-

Implementors

-
    -
  • impl Add for Duration
    • -
  • impl Add for Instant
    • -
  • impl Add for SystemTime
    • -
  • impl Add for usize
    • -
  • impl<'a> Add for &'a usize
    • -
  • impl<'a> Add for usize
    • -
  • impl<'a, 'b> Add for &'b usize
    • -
  • impl Add for u8
    • -
  • impl<'a> Add for &'a u8
    • -
  • impl<'a> Add for u8
    • -
  • impl<'a, 'b> Add for &'b u8
    • -
  • impl Add for u16
    • -
  • impl<'a> Add for &'a u16
    • -
  • impl<'a> Add for u16
    • -
  • impl<'a, 'b> Add for &'b u16
    • -
  • impl Add for u32
    • -
  • impl<'a> Add for &'a u32
    • -
  • impl<'a> Add for u32
    • -
  • impl<'a, 'b> Add for &'b u32
    • -
  • impl Add for u64
    • -
  • impl<'a> Add for &'a u64
    • -
  • impl<'a> Add for u64
    • -
  • impl<'a, 'b> Add for &'b u64
    • -
  • impl Add for isize
    • -
  • impl<'a> Add for &'a isize
    • -
  • impl<'a> Add for isize
    • -
  • impl<'a, 'b> Add for &'b isize
    • -
  • impl Add for i8
    • -
  • impl<'a> Add for &'a i8
    • -
  • impl<'a> Add for i8
    • -
  • impl<'a, 'b> Add for &'b i8
    • -
  • impl Add for i16
    • -
  • impl<'a> Add for &'a i16
    • -
  • impl<'a> Add for i16
    • -
  • impl<'a, 'b> Add for &'b i16
    • -
  • impl Add for i32
    • -
  • impl<'a> Add for &'a i32
    • -
  • impl<'a> Add for i32
    • -
  • impl<'a, 'b> Add for &'b i32
    • -
  • impl Add for i64
    • -
  • impl<'a> Add for &'a i64
    • -
  • impl<'a> Add for i64
    • -
  • impl<'a, 'b> Add for &'b i64
    • -
  • impl Add for f32
    • -
  • impl<'a> Add for &'a f32
    • -
  • impl<'a> Add for f32
    • -
  • impl<'a, 'b> Add for &'b f32
    • -
  • impl Add for f64
    • -
  • impl<'a> Add for &'a f64
    • -
  • impl<'a> Add for f64
    • -
  • impl<'a, 'b> Add for &'b f64
    • -
  • impl<'a> Add for String
    • -
  • impl Add for Wrapping<usize>
    • -
  • impl Add for Wrapping<u8>
    • -
  • impl Add for Wrapping<u16>
    • -
  • impl Add for Wrapping<u32>
    • -
  • impl Add for Wrapping<u64>
    • -
  • impl Add for Wrapping<isize>
    • -
  • impl Add for Wrapping<i8>
    • -
  • impl Add for Wrapping<i16>
    • -
  • impl Add for Wrapping<i32>
    • -
  • impl Add for Wrapping<i64>
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.AddAssign.html b/doc/bitflags/__core/ops/trait.AddAssign.html deleted file mode 100644 index 38d4f684..00000000 --- a/doc/bitflags/__core/ops/trait.AddAssign.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::AddAssign - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::AddAssign - - [−] - - [src]

-
pub trait AddAssign<Rhs = Self> {
-    fn add_assign(&mut self, Rhs);
-}

The AddAssign trait is used to specify the functionality of +=.

- -

Examples

-

A trivial implementation of AddAssign. When Foo += Foo happens, it ends up -calling add_assign, and therefore, main prints Adding!.

- -
-use std::ops::AddAssign;
-
-struct Foo;
-
-impl AddAssign for Foo {
-    fn add_assign(&mut self, _rhs: Foo) {
-        println!("Adding!");
-    }
-}
-
-fn main() {
-    let mut foo = Foo;
-    foo += Foo;
-}
-
-

Required Methods

-
-

fn add_assign(&mut self, Rhs)

The method for the += operator

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.BitAnd.html b/doc/bitflags/__core/ops/trait.BitAnd.html deleted file mode 100644 index 0603b71c..00000000 --- a/doc/bitflags/__core/ops/trait.BitAnd.html +++ /dev/null @@ -1,208 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::BitAnd - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::BitAnd - - [−] - - [src]

-
pub trait BitAnd<RHS = Self> {
-    type Output;
-    fn bitand(self, rhs: RHS) -> Self::Output;
-}

The BitAnd trait is used to specify the functionality of &.

- -

Examples

-

A trivial implementation of BitAnd. When Foo & Foo happens, it ends up -calling bitand, and therefore, main prints Bitwise And-ing!.

- -
-use std::ops::BitAnd;
-
-struct Foo;
-
-impl BitAnd for Foo {
-    type Output = Foo;
-
-    fn bitand(self, _rhs: Foo) -> Foo {
-        println!("Bitwise And-ing!");
-        self
-    }
-}
-
-fn main() {
-    Foo & Foo;
-}
-
-

Associated Types

-
-

type Output

The resulting type after applying the & operator

-
-

Required Methods

-
-

fn bitand(self, rhs: RHS) -> Self::Output

The method for the & operator

-
-

Implementors

-
    -
  • impl<'a, 'b, T, S> BitAnd for &'a HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash + Clone
    • -
  • impl BitAnd for bool
    • -
  • impl<'a> BitAnd for &'a bool
    • -
  • impl<'a> BitAnd for bool
    • -
  • impl<'a, 'b> BitAnd for &'b bool
    • -
  • impl BitAnd for usize
    • -
  • impl<'a> BitAnd for &'a usize
    • -
  • impl<'a> BitAnd for usize
    • -
  • impl<'a, 'b> BitAnd for &'b usize
    • -
  • impl BitAnd for u8
    • -
  • impl<'a> BitAnd for &'a u8
    • -
  • impl<'a> BitAnd for u8
    • -
  • impl<'a, 'b> BitAnd for &'b u8
    • -
  • impl BitAnd for u16
    • -
  • impl<'a> BitAnd for &'a u16
    • -
  • impl<'a> BitAnd for u16
    • -
  • impl<'a, 'b> BitAnd for &'b u16
    • -
  • impl BitAnd for u32
    • -
  • impl<'a> BitAnd for &'a u32
    • -
  • impl<'a> BitAnd for u32
    • -
  • impl<'a, 'b> BitAnd for &'b u32
    • -
  • impl BitAnd for u64
    • -
  • impl<'a> BitAnd for &'a u64
    • -
  • impl<'a> BitAnd for u64
    • -
  • impl<'a, 'b> BitAnd for &'b u64
    • -
  • impl BitAnd for isize
    • -
  • impl<'a> BitAnd for &'a isize
    • -
  • impl<'a> BitAnd for isize
    • -
  • impl<'a, 'b> BitAnd for &'b isize
    • -
  • impl BitAnd for i8
    • -
  • impl<'a> BitAnd for &'a i8
    • -
  • impl<'a> BitAnd for i8
    • -
  • impl<'a, 'b> BitAnd for &'b i8
    • -
  • impl BitAnd for i16
    • -
  • impl<'a> BitAnd for &'a i16
    • -
  • impl<'a> BitAnd for i16
    • -
  • impl<'a, 'b> BitAnd for &'b i16
    • -
  • impl BitAnd for i32
    • -
  • impl<'a> BitAnd for &'a i32
    • -
  • impl<'a> BitAnd for i32
    • -
  • impl<'a, 'b> BitAnd for &'b i32
    • -
  • impl BitAnd for i64
    • -
  • impl<'a> BitAnd for &'a i64
    • -
  • impl<'a> BitAnd for i64
    • -
  • impl<'a, 'b> BitAnd for &'b i64
    • -
  • impl BitAnd for Wrapping<usize>
    • -
  • impl BitAnd for Wrapping<u8>
    • -
  • impl BitAnd for Wrapping<u16>
    • -
  • impl BitAnd for Wrapping<u32>
    • -
  • impl BitAnd for Wrapping<u64>
    • -
  • impl BitAnd for Wrapping<isize>
    • -
  • impl BitAnd for Wrapping<i8>
    • -
  • impl BitAnd for Wrapping<i16>
    • -
  • impl BitAnd for Wrapping<i32>
    • -
  • impl BitAnd for Wrapping<i64>
    • -
  • impl<'a, 'b, T> BitAnd for &'a BTreeSet<T> where T: Ord + Clone
    • -
  • impl<E> BitAnd for EnumSet<E> where E: CLike
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.BitAndAssign.html b/doc/bitflags/__core/ops/trait.BitAndAssign.html deleted file mode 100644 index f1622028..00000000 --- a/doc/bitflags/__core/ops/trait.BitAndAssign.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::BitAndAssign - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::BitAndAssign - - [−] - - [src]

-
pub trait BitAndAssign<Rhs = Self> {
-    fn bitand_assign(&mut self, Rhs);
-}

The BitAndAssign trait is used to specify the functionality of &=.

- -

Examples

-

A trivial implementation of BitAndAssign. When Foo &= Foo happens, it ends up -calling bitand_assign, and therefore, main prints Bitwise And-ing!.

- -
-use std::ops::BitAndAssign;
-
-struct Foo;
-
-impl BitAndAssign for Foo {
-    fn bitand_assign(&mut self, _rhs: Foo) {
-        println!("Bitwise And-ing!");
-    }
-}
-
-fn main() {
-    let mut foo = Foo;
-    foo &= Foo;
-}
-
-

Required Methods

-
-

fn bitand_assign(&mut self, Rhs)

The method for the & operator

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.BitOr.html b/doc/bitflags/__core/ops/trait.BitOr.html deleted file mode 100644 index bf096e4a..00000000 --- a/doc/bitflags/__core/ops/trait.BitOr.html +++ /dev/null @@ -1,208 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::BitOr - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::BitOr - - [−] - - [src]

-
pub trait BitOr<RHS = Self> {
-    type Output;
-    fn bitor(self, rhs: RHS) -> Self::Output;
-}

The BitOr trait is used to specify the functionality of |.

- -

Examples

-

A trivial implementation of BitOr. When Foo | Foo happens, it ends up -calling bitor, and therefore, main prints Bitwise Or-ing!.

- -
-use std::ops::BitOr;
-
-struct Foo;
-
-impl BitOr for Foo {
-    type Output = Foo;
-
-    fn bitor(self, _rhs: Foo) -> Foo {
-        println!("Bitwise Or-ing!");
-        self
-    }
-}
-
-fn main() {
-    Foo | Foo;
-}
-
-

Associated Types

-
-

type Output

The resulting type after applying the | operator

-
-

Required Methods

-
-

fn bitor(self, rhs: RHS) -> Self::Output

The method for the | operator

-
-

Implementors

-
    -
  • impl<'a, 'b, T, S> BitOr for &'a HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash + Clone
    • -
  • impl BitOr for bool
    • -
  • impl<'a> BitOr for &'a bool
    • -
  • impl<'a> BitOr for bool
    • -
  • impl<'a, 'b> BitOr for &'b bool
    • -
  • impl BitOr for usize
    • -
  • impl<'a> BitOr for &'a usize
    • -
  • impl<'a> BitOr for usize
    • -
  • impl<'a, 'b> BitOr for &'b usize
    • -
  • impl BitOr for u8
    • -
  • impl<'a> BitOr for &'a u8
    • -
  • impl<'a> BitOr for u8
    • -
  • impl<'a, 'b> BitOr for &'b u8
    • -
  • impl BitOr for u16
    • -
  • impl<'a> BitOr for &'a u16
    • -
  • impl<'a> BitOr for u16
    • -
  • impl<'a, 'b> BitOr for &'b u16
    • -
  • impl BitOr for u32
    • -
  • impl<'a> BitOr for &'a u32
    • -
  • impl<'a> BitOr for u32
    • -
  • impl<'a, 'b> BitOr for &'b u32
    • -
  • impl BitOr for u64
    • -
  • impl<'a> BitOr for &'a u64
    • -
  • impl<'a> BitOr for u64
    • -
  • impl<'a, 'b> BitOr for &'b u64
    • -
  • impl BitOr for isize
    • -
  • impl<'a> BitOr for &'a isize
    • -
  • impl<'a> BitOr for isize
    • -
  • impl<'a, 'b> BitOr for &'b isize
    • -
  • impl BitOr for i8
    • -
  • impl<'a> BitOr for &'a i8
    • -
  • impl<'a> BitOr for i8
    • -
  • impl<'a, 'b> BitOr for &'b i8
    • -
  • impl BitOr for i16
    • -
  • impl<'a> BitOr for &'a i16
    • -
  • impl<'a> BitOr for i16
    • -
  • impl<'a, 'b> BitOr for &'b i16
    • -
  • impl BitOr for i32
    • -
  • impl<'a> BitOr for &'a i32
    • -
  • impl<'a> BitOr for i32
    • -
  • impl<'a, 'b> BitOr for &'b i32
    • -
  • impl BitOr for i64
    • -
  • impl<'a> BitOr for &'a i64
    • -
  • impl<'a> BitOr for i64
    • -
  • impl<'a, 'b> BitOr for &'b i64
    • -
  • impl BitOr for Wrapping<usize>
    • -
  • impl BitOr for Wrapping<u8>
    • -
  • impl BitOr for Wrapping<u16>
    • -
  • impl BitOr for Wrapping<u32>
    • -
  • impl BitOr for Wrapping<u64>
    • -
  • impl BitOr for Wrapping<isize>
    • -
  • impl BitOr for Wrapping<i8>
    • -
  • impl BitOr for Wrapping<i16>
    • -
  • impl BitOr for Wrapping<i32>
    • -
  • impl BitOr for Wrapping<i64>
    • -
  • impl<'a, 'b, T> BitOr for &'a BTreeSet<T> where T: Ord + Clone
    • -
  • impl<E> BitOr for EnumSet<E> where E: CLike
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.BitOrAssign.html b/doc/bitflags/__core/ops/trait.BitOrAssign.html deleted file mode 100644 index 8efabb49..00000000 --- a/doc/bitflags/__core/ops/trait.BitOrAssign.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::BitOrAssign - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::BitOrAssign - - [−] - - [src]

-
pub trait BitOrAssign<Rhs = Self> {
-    fn bitor_assign(&mut self, Rhs);
-}

The BitOrAssign trait is used to specify the functionality of |=.

- -

Examples

-

A trivial implementation of BitOrAssign. When Foo |= Foo happens, it ends up -calling bitor_assign, and therefore, main prints Bitwise Or-ing!.

- -
-use std::ops::BitOrAssign;
-
-struct Foo;
-
-impl BitOrAssign for Foo {
-    fn bitor_assign(&mut self, _rhs: Foo) {
-        println!("Bitwise Or-ing!");
-    }
-}
-
-fn main() {
-    let mut foo = Foo;
-    foo |= Foo;
-}
-
-

Required Methods

-
-

fn bitor_assign(&mut self, Rhs)

The method for the |= operator

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.BitXor.html b/doc/bitflags/__core/ops/trait.BitXor.html deleted file mode 100644 index b0dc7c6b..00000000 --- a/doc/bitflags/__core/ops/trait.BitXor.html +++ /dev/null @@ -1,208 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::BitXor - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::BitXor - - [−] - - [src]

-
pub trait BitXor<RHS = Self> {
-    type Output;
-    fn bitxor(self, rhs: RHS) -> Self::Output;
-}

The BitXor trait is used to specify the functionality of ^.

- -

Examples

-

A trivial implementation of BitXor. When Foo ^ Foo happens, it ends up -calling bitxor, and therefore, main prints Bitwise Xor-ing!.

- -
-use std::ops::BitXor;
-
-struct Foo;
-
-impl BitXor for Foo {
-    type Output = Foo;
-
-    fn bitxor(self, _rhs: Foo) -> Foo {
-        println!("Bitwise Xor-ing!");
-        self
-    }
-}
-
-fn main() {
-    Foo ^ Foo;
-}
-
-

Associated Types

-
-

type Output

The resulting type after applying the ^ operator

-
-

Required Methods

-
-

fn bitxor(self, rhs: RHS) -> Self::Output

The method for the ^ operator

-
-

Implementors

-
    -
  • impl<'a, 'b, T, S> BitXor for &'a HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash + Clone
    • -
  • impl BitXor for bool
    • -
  • impl<'a> BitXor for &'a bool
    • -
  • impl<'a> BitXor for bool
    • -
  • impl<'a, 'b> BitXor for &'b bool
    • -
  • impl BitXor for usize
    • -
  • impl<'a> BitXor for &'a usize
    • -
  • impl<'a> BitXor for usize
    • -
  • impl<'a, 'b> BitXor for &'b usize
    • -
  • impl BitXor for u8
    • -
  • impl<'a> BitXor for &'a u8
    • -
  • impl<'a> BitXor for u8
    • -
  • impl<'a, 'b> BitXor for &'b u8
    • -
  • impl BitXor for u16
    • -
  • impl<'a> BitXor for &'a u16
    • -
  • impl<'a> BitXor for u16
    • -
  • impl<'a, 'b> BitXor for &'b u16
    • -
  • impl BitXor for u32
    • -
  • impl<'a> BitXor for &'a u32
    • -
  • impl<'a> BitXor for u32
    • -
  • impl<'a, 'b> BitXor for &'b u32
    • -
  • impl BitXor for u64
    • -
  • impl<'a> BitXor for &'a u64
    • -
  • impl<'a> BitXor for u64
    • -
  • impl<'a, 'b> BitXor for &'b u64
    • -
  • impl BitXor for isize
    • -
  • impl<'a> BitXor for &'a isize
    • -
  • impl<'a> BitXor for isize
    • -
  • impl<'a, 'b> BitXor for &'b isize
    • -
  • impl BitXor for i8
    • -
  • impl<'a> BitXor for &'a i8
    • -
  • impl<'a> BitXor for i8
    • -
  • impl<'a, 'b> BitXor for &'b i8
    • -
  • impl BitXor for i16
    • -
  • impl<'a> BitXor for &'a i16
    • -
  • impl<'a> BitXor for i16
    • -
  • impl<'a, 'b> BitXor for &'b i16
    • -
  • impl BitXor for i32
    • -
  • impl<'a> BitXor for &'a i32
    • -
  • impl<'a> BitXor for i32
    • -
  • impl<'a, 'b> BitXor for &'b i32
    • -
  • impl BitXor for i64
    • -
  • impl<'a> BitXor for &'a i64
    • -
  • impl<'a> BitXor for i64
    • -
  • impl<'a, 'b> BitXor for &'b i64
    • -
  • impl BitXor for Wrapping<usize>
    • -
  • impl BitXor for Wrapping<u8>
    • -
  • impl BitXor for Wrapping<u16>
    • -
  • impl BitXor for Wrapping<u32>
    • -
  • impl BitXor for Wrapping<u64>
    • -
  • impl BitXor for Wrapping<isize>
    • -
  • impl BitXor for Wrapping<i8>
    • -
  • impl BitXor for Wrapping<i16>
    • -
  • impl BitXor for Wrapping<i32>
    • -
  • impl BitXor for Wrapping<i64>
    • -
  • impl<'a, 'b, T> BitXor for &'a BTreeSet<T> where T: Ord + Clone
    • -
  • impl<E> BitXor for EnumSet<E> where E: CLike
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.BitXorAssign.html b/doc/bitflags/__core/ops/trait.BitXorAssign.html deleted file mode 100644 index 4829cebe..00000000 --- a/doc/bitflags/__core/ops/trait.BitXorAssign.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::BitXorAssign - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::BitXorAssign - - [−] - - [src]

-
pub trait BitXorAssign<Rhs = Self> {
-    fn bitxor_assign(&mut self, Rhs);
-}

The BitXorAssign trait is used to specify the functionality of ^=.

- -

Examples

-

A trivial implementation of BitXorAssign. When Foo ^= Foo happens, it ends up -calling bitxor_assign, and therefore, main prints Bitwise Xor-ing!.

- -
-use std::ops::BitXorAssign;
-
-struct Foo;
-
-impl BitXorAssign for Foo {
-    fn bitxor_assign(&mut self, _rhs: Foo) {
-        println!("Bitwise Xor-ing!");
-    }
-}
-
-fn main() {
-    let mut foo = Foo;
-    foo ^= Foo;
-}
-
-

Required Methods

-
-

fn bitxor_assign(&mut self, Rhs)

The method for the ^= operator

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.BoxPlace.html b/doc/bitflags/__core/ops/trait.BoxPlace.html deleted file mode 100644 index c28711ef..00000000 --- a/doc/bitflags/__core/ops/trait.BoxPlace.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::BoxPlace - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::BoxPlace - - [−] - - [src]

-
pub trait BoxPlace<Data>: Place<Data> where Data: ?Sized {
-    fn make_place() -> Self;
-}
Unstable (placement_new_protocol)

Specialization of Place trait supporting box EXPR.

-
-

Required Methods

-
-

fn make_place() -> Self

Unstable (placement_new_protocol)

Creates a globally fresh place.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Boxed.html b/doc/bitflags/__core/ops/trait.Boxed.html deleted file mode 100644 index 173bf79d..00000000 --- a/doc/bitflags/__core/ops/trait.Boxed.html +++ /dev/null @@ -1,152 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Boxed - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Boxed - - [−] - - [src]

-
pub trait Boxed {
-    type Data;
-    type Place: BoxPlace<Self::Data>;
-    unsafe fn finalize(filled: Self::Place) -> Self;
-}
Unstable (placement_new_protocol)

Core trait for the box EXPR form.

- -

box EXPR effectively desugars into:

- -
-let mut place = BoxPlace::make_place();
-let raw_place = Place::pointer(&mut place);
-let value = EXPR;
-unsafe {
-    ::std::ptr::write(raw_place, value);
-    Boxed::finalize(place)
-}
- -

The type of box EXPR is supplied from its surrounding -context; in the above expansion, the result type T is used -to determine which implementation of Boxed to use, and that -<T as Boxed> in turn dictates determines which -implementation of BoxPlace to use, namely: -<<T as Boxed>::Place as BoxPlace>.

-
-

Associated Types

-
-

type Data

Unstable (placement_new_protocol)

The kind of data that is stored in this kind of box.

-

type Place: BoxPlace<Self::Data>

Unstable (placement_new_protocol)

The place that will negotiate the storage of the data.

-
-

Required Methods

-
-

unsafe fn finalize(filled: Self::Place) -> Self

Unstable (placement_new_protocol)

Converts filled place into final owning value, shifting -deallocation/cleanup responsibilities (if any remain), over to -returned instance of Self and forgetting filled.

-
-

Implementors

-
    -
  • impl<T> Boxed for Box<T>
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.CoerceUnsized.html b/doc/bitflags/__core/ops/trait.CoerceUnsized.html deleted file mode 100644 index 7814a719..00000000 --- a/doc/bitflags/__core/ops/trait.CoerceUnsized.html +++ /dev/null @@ -1,138 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::CoerceUnsized - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::CoerceUnsized - - [−] - - [src]

-
pub trait CoerceUnsized<T> { }
Unstable (coerce_unsized)

Trait that indicates that this is a pointer or a wrapper for one, -where unsizing can be performed on the pointee.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Deref.html b/doc/bitflags/__core/ops/trait.Deref.html deleted file mode 100644 index ec7ba33b..00000000 --- a/doc/bitflags/__core/ops/trait.Deref.html +++ /dev/null @@ -1,177 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Deref - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Deref - - [−] - - [src]

-
pub trait Deref {
-    type Target: ?Sized;
-    fn deref(&self) -> &Self::Target;
-}

The Deref trait is used to specify the functionality of dereferencing -operations, like *v.

- -

Deref also enables 'Deref coercions'.

- -

Examples

-

A struct with a single field which is accessible via dereferencing the -struct.

- -
-use std::ops::Deref;
-
-struct DerefExample<T> {
-    value: T
-}
-
-impl<T> Deref for DerefExample<T> {
-    type Target = T;
-
-    fn deref(&self) -> &T {
-        &self.value
-    }
-}
-
-fn main() {
-    let x = DerefExample { value: 'a' };
-    assert_eq!('a', *x);
-}
-
-

Associated Types

-
-

type Target: ?Sized

The resulting type after dereferencing

-
-

Required Methods

-
-

fn deref(&self) -> &Self::Target

The method called to dereference a value

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.DerefMut.html b/doc/bitflags/__core/ops/trait.DerefMut.html deleted file mode 100644 index 313a216f..00000000 --- a/doc/bitflags/__core/ops/trait.DerefMut.html +++ /dev/null @@ -1,167 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::DerefMut - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::DerefMut - - [−] - - [src]

-
pub trait DerefMut: Deref {
-    fn deref_mut(&mut self) -> &mut Self::Target;
-}

The DerefMut trait is used to specify the functionality of dereferencing -mutably like *v = 1;

- -

DerefMut also enables 'Deref coercions'.

- -

Examples

-

A struct with a single field which is modifiable via dereferencing the -struct.

- -
-use std::ops::{Deref, DerefMut};
-
-struct DerefMutExample<T> {
-    value: T
-}
-
-impl<T> Deref for DerefMutExample<T> {
-    type Target = T;
-
-    fn deref<'a>(&'a self) -> &'a T {
-        &self.value
-    }
-}
-
-impl<T> DerefMut for DerefMutExample<T> {
-    fn deref_mut<'a>(&'a mut self) -> &'a mut T {
-        &mut self.value
-    }
-}
-
-fn main() {
-    let mut x = DerefMutExample { value: 'a' };
-    *x = 'b';
-    assert_eq!('b', *x);
-}
-
-

Required Methods

-
-

fn deref_mut(&mut self) -> &mut Self::Target

The method called to mutably dereference a value

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Div.html b/doc/bitflags/__core/ops/trait.Div.html deleted file mode 100644 index ff630f16..00000000 --- a/doc/bitflags/__core/ops/trait.Div.html +++ /dev/null @@ -1,210 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Div - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Div - - [−] - - [src]

-
pub trait Div<RHS = Self> {
-    type Output;
-    fn div(self, rhs: RHS) -> Self::Output;
-}

The Div trait is used to specify the functionality of /.

- -

Examples

-

A trivial implementation of Div. When Foo / Foo happens, it ends up -calling div, and therefore, main prints Dividing!.

- -
-use std::ops::Div;
-
-struct Foo;
-
-impl Div for Foo {
-    type Output = Foo;
-
-    fn div(self, _rhs: Foo) -> Foo {
-        println!("Dividing!");
-        self
-    }
-}
-
-fn main() {
-    Foo / Foo;
-}
-
-

Associated Types

-
-

type Output

The resulting type after applying the / operator

-
-

Required Methods

-
-

fn div(self, rhs: RHS) -> Self::Output

The method for the / operator

-
-

Implementors

-
    -
  • impl Div for Duration
    • -
  • impl Div for usize
    • -
  • impl<'a> Div for &'a usize
    • -
  • impl<'a> Div for usize
    • -
  • impl<'a, 'b> Div for &'b usize
    • -
  • impl Div for u8
    • -
  • impl<'a> Div for &'a u8
    • -
  • impl<'a> Div for u8
    • -
  • impl<'a, 'b> Div for &'b u8
    • -
  • impl Div for u16
    • -
  • impl<'a> Div for &'a u16
    • -
  • impl<'a> Div for u16
    • -
  • impl<'a, 'b> Div for &'b u16
    • -
  • impl Div for u32
    • -
  • impl<'a> Div for &'a u32
    • -
  • impl<'a> Div for u32
    • -
  • impl<'a, 'b> Div for &'b u32
    • -
  • impl Div for u64
    • -
  • impl<'a> Div for &'a u64
    • -
  • impl<'a> Div for u64
    • -
  • impl<'a, 'b> Div for &'b u64
    • -
  • impl Div for isize
    • -
  • impl<'a> Div for &'a isize
    • -
  • impl<'a> Div for isize
    • -
  • impl<'a, 'b> Div for &'b isize
    • -
  • impl Div for i8
    • -
  • impl<'a> Div for &'a i8
    • -
  • impl<'a> Div for i8
    • -
  • impl<'a, 'b> Div for &'b i8
    • -
  • impl Div for i16
    • -
  • impl<'a> Div for &'a i16
    • -
  • impl<'a> Div for i16
    • -
  • impl<'a, 'b> Div for &'b i16
    • -
  • impl Div for i32
    • -
  • impl<'a> Div for &'a i32
    • -
  • impl<'a> Div for i32
    • -
  • impl<'a, 'b> Div for &'b i32
    • -
  • impl Div for i64
    • -
  • impl<'a> Div for &'a i64
    • -
  • impl<'a> Div for i64
    • -
  • impl<'a, 'b> Div for &'b i64
    • -
  • impl Div for f32
    • -
  • impl<'a> Div for &'a f32
    • -
  • impl<'a> Div for f32
    • -
  • impl<'a, 'b> Div for &'b f32
    • -
  • impl Div for f64
    • -
  • impl<'a> Div for &'a f64
    • -
  • impl<'a> Div for f64
    • -
  • impl<'a, 'b> Div for &'b f64
    • -
  • impl Div for Wrapping<usize>
    • -
  • impl Div for Wrapping<u8>
    • -
  • impl Div for Wrapping<u16>
    • -
  • impl Div for Wrapping<u32>
    • -
  • impl Div for Wrapping<u64>
    • -
  • impl Div for Wrapping<isize>
    • -
  • impl Div for Wrapping<i8>
    • -
  • impl Div for Wrapping<i16>
    • -
  • impl Div for Wrapping<i32>
    • -
  • impl Div for Wrapping<i64>
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.DivAssign.html b/doc/bitflags/__core/ops/trait.DivAssign.html deleted file mode 100644 index 5f02531a..00000000 --- a/doc/bitflags/__core/ops/trait.DivAssign.html +++ /dev/null @@ -1,167 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::DivAssign - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::DivAssign - - [−] - - [src]

-
pub trait DivAssign<Rhs = Self> {
-    fn div_assign(&mut self, Rhs);
-}

The DivAssign trait is used to specify the functionality of /=.

- -

Examples

-

A trivial implementation of DivAssign. When Foo /= Foo happens, it ends up -calling div_assign, and therefore, main prints Dividing!.

- -
-use std::ops::DivAssign;
-
-struct Foo;
-
-impl DivAssign for Foo {
-    fn div_assign(&mut self, _rhs: Foo) {
-        println!("Dividing!");
-    }
-}
-
-fn main() {
-    let mut foo = Foo;
-    foo /= Foo;
-}
-
-

Required Methods

-
-

fn div_assign(&mut self, Rhs)

The method for the /= operator

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Drop.html b/doc/bitflags/__core/ops/trait.Drop.html deleted file mode 100644 index 37972570..00000000 --- a/doc/bitflags/__core/ops/trait.Drop.html +++ /dev/null @@ -1,178 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Drop - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Drop - - [−] - - [src]

-
pub trait Drop {
-    fn drop(&mut self);
-}

The Drop trait is used to run some code when a value goes out of scope. -This is sometimes called a 'destructor'.

- -

Examples

-

A trivial implementation of Drop. The drop method is called when _x -goes out of scope, and therefore main prints Dropping!.

- -
-struct HasDrop;
-
-impl Drop for HasDrop {
-    fn drop(&mut self) {
-        println!("Dropping!");
-    }
-}
-
-fn main() {
-    let _x = HasDrop;
-}
-
-

Required Methods

-
-

fn drop(&mut self)

A method called when the value goes out of scope.

- -

When this method has been called, self has not yet been deallocated. -If it were, self would be a dangling reference.

- -

After this function is over, the memory of self will be deallocated.

- -

Panics

-

Given that a panic! will call drop() as it unwinds, any panic! in -a drop() implementation will likely abort.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Fn.html b/doc/bitflags/__core/ops/trait.Fn.html deleted file mode 100644 index ce1b3993..00000000 --- a/doc/bitflags/__core/ops/trait.Fn.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Fn - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Fn - - [−] - - [src]

-
pub trait Fn<Args>: FnMut<Args> {
-    extern "rust-call" fn call(&self, args: Args) -> Self::Output;
-}

A version of the call operator that takes an immutable receiver.

-
-

Required Methods

-
-

extern "rust-call" fn call(&self, args: Args) -> Self::Output

Unstable (fn_traits)

This is called when the call operator is used.

-
-

Implementors

-
    -
  • impl<'a, A, F> Fn for &'a F where F: Fn<A> + ?Sized
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.FnMut.html b/doc/bitflags/__core/ops/trait.FnMut.html deleted file mode 100644 index 713a60cf..00000000 --- a/doc/bitflags/__core/ops/trait.FnMut.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::FnMut - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::FnMut - - [−] - - [src]

-
pub trait FnMut<Args>: FnOnce<Args> {
-    extern "rust-call" fn call_mut(&mut self, args: Args) -> Self::Output;
-}

A version of the call operator that takes a mutable receiver.

-
-

Required Methods

-
-

extern "rust-call" fn call_mut(&mut self, args: Args) -> Self::Output

Unstable (fn_traits)

This is called when the call operator is used.

-
-

Implementors

-
    -
  • impl<'a, A, F> FnMut for &'a F where F: Fn<A> + ?Sized
    • -
  • impl<'a, A, F> FnMut for &'a mut F where F: FnMut<A> + ?Sized
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.FnOnce.html b/doc/bitflags/__core/ops/trait.FnOnce.html deleted file mode 100644 index 608116a9..00000000 --- a/doc/bitflags/__core/ops/trait.FnOnce.html +++ /dev/null @@ -1,135 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::FnOnce - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::FnOnce - - [−] - - [src]

-
pub trait FnOnce<Args> {
-    type Output;
-    extern "rust-call" fn call_once(self, args: Args) -> Self::Output;
-}

A version of the call operator that takes a by-value receiver.

-
-

Associated Types

-
-

type Output

Unstable (fn_traits)

The returned type after the call operator is used.

-
-

Required Methods

-
-

extern "rust-call" fn call_once(self, args: Args) -> Self::Output

Unstable (fn_traits)

This is called when the call operator is used.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.InPlace.html b/doc/bitflags/__core/ops/trait.InPlace.html deleted file mode 100644 index b184a368..00000000 --- a/doc/bitflags/__core/ops/trait.InPlace.html +++ /dev/null @@ -1,140 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::InPlace - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::InPlace - - [−] - - [src]

-
pub trait InPlace<Data>: Place<Data> where Data: ?Sized {
-    type Owner;
-    unsafe fn finalize(self) -> Self::Owner;
-}
Unstable (placement_new_protocol)

Specialization of Place trait supporting in (PLACE) EXPR.

-
-

Associated Types

-
-

type Owner

Unstable (placement_new_protocol)

Owner is the type of the end value of in (PLACE) EXPR

- -

Note that when in (PLACE) EXPR is solely used for -side-effecting an existing data-structure, -e.g. Vec::emplace_back, then Owner need not carry any -information at all (e.g. it can be the unit type () in that -case).

-
-

Required Methods

-
-

unsafe fn finalize(self) -> Self::Owner

Unstable (placement_new_protocol)

Converts self into the final value, shifting -deallocation/cleanup responsibilities (if any remain), over to -the returned instance of Owner and forgetting self.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Index.html b/doc/bitflags/__core/ops/trait.Index.html deleted file mode 100644 index 01668dc5..00000000 --- a/doc/bitflags/__core/ops/trait.Index.html +++ /dev/null @@ -1,185 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Index - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Index - - [−] - - [src]

-
pub trait Index<Idx> where Idx: ?Sized {
-    type Output: ?Sized;
-    fn index(&self, index: Idx) -> &Self::Output;
-}

The Index trait is used to specify the functionality of indexing operations -like arr[idx] when used in an immutable context.

- -

Examples

-

A trivial implementation of Index. When Foo[Bar] happens, it ends up -calling index, and therefore, main prints Indexing!.

- -
-use std::ops::Index;
-
-#[derive(Copy, Clone)]
-struct Foo;
-struct Bar;
-
-impl Index<Bar> for Foo {
-    type Output = Foo;
-
-    fn index<'a>(&'a self, _index: Bar) -> &'a Foo {
-        println!("Indexing!");
-        self
-    }
-}
-
-fn main() {
-    Foo[Bar];
-}
-
-

Associated Types

-
-

type Output: ?Sized

The returned type after indexing

-
-

Required Methods

-
-

fn index(&self, index: Idx) -> &Self::Output

The method for the indexing (Foo[Bar]) operation

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.IndexMut.html b/doc/bitflags/__core/ops/trait.IndexMut.html deleted file mode 100644 index 4f286fb0..00000000 --- a/doc/bitflags/__core/ops/trait.IndexMut.html +++ /dev/null @@ -1,182 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::IndexMut - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::IndexMut - - [−] - - [src]

-
pub trait IndexMut<Idx>: Index<Idx> where Idx: ?Sized {
-    fn index_mut(&mut self, index: Idx) -> &mut Self::Output;
-}

The IndexMut trait is used to specify the functionality of indexing -operations like arr[idx], when used in a mutable context.

- -

Examples

-

A trivial implementation of IndexMut. When Foo[Bar] happens, it ends up -calling index_mut, and therefore, main prints Indexing!.

- -
-use std::ops::{Index, IndexMut};
-
-#[derive(Copy, Clone)]
-struct Foo;
-struct Bar;
-
-impl Index<Bar> for Foo {
-    type Output = Foo;
-
-    fn index<'a>(&'a self, _index: Bar) -> &'a Foo {
-        self
-    }
-}
-
-impl IndexMut<Bar> for Foo {
-    fn index_mut<'a>(&'a mut self, _index: Bar) -> &'a mut Foo {
-        println!("Indexing!");
-        self
-    }
-}
-
-fn main() {
-    &mut Foo[Bar];
-}
-
-

Required Methods

-
-

fn index_mut(&mut self, index: Idx) -> &mut Self::Output

The method for the indexing (Foo[Bar]) operation

-
-

Implementors

-
    -
  • impl<A> IndexMut for VecDeque<A>
    • -
  • impl<T> IndexMut for Vec<T>
    • -
  • impl<T> IndexMut for Vec<T>
    • -
  • impl<T> IndexMut for Vec<T>
    • -
  • impl<T> IndexMut for Vec<T>
    • -
  • impl<T> IndexMut for Vec<T>
    • -
  • impl<T> IndexMut for Vec<T>
    • -
  • impl<T> IndexMut for Vec<T>
    • -
  • impl IndexMut for String
    • -
  • impl IndexMut for String
    • -
  • impl IndexMut for String
    • -
  • impl IndexMut for String
    • -
  • impl IndexMut for String
    • -
  • impl IndexMut for String
    • -
  • impl<T> IndexMut for [T]
    • -
  • impl<T> IndexMut for [T]
    • -
  • impl<T> IndexMut for [T]
    • -
  • impl<T> IndexMut for [T]
    • -
  • impl<T> IndexMut for [T]
    • -
  • impl<T> IndexMut for [T]
    • -
  • impl<T> IndexMut for [T]
    • -
  • impl IndexMut for str
    • -
  • impl IndexMut for str
    • -
  • impl IndexMut for str
    • -
  • impl IndexMut for str
    • -
  • impl IndexMut for str
    • -
  • impl IndexMut for str
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Mul.html b/doc/bitflags/__core/ops/trait.Mul.html deleted file mode 100644 index 09b0c8ba..00000000 --- a/doc/bitflags/__core/ops/trait.Mul.html +++ /dev/null @@ -1,210 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Mul - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Mul - - [−] - - [src]

-
pub trait Mul<RHS = Self> {
-    type Output;
-    fn mul(self, rhs: RHS) -> Self::Output;
-}

The Mul trait is used to specify the functionality of *.

- -

Examples

-

A trivial implementation of Mul. When Foo * Foo happens, it ends up -calling mul, and therefore, main prints Multiplying!.

- -
-use std::ops::Mul;
-
-struct Foo;
-
-impl Mul for Foo {
-    type Output = Foo;
-
-    fn mul(self, _rhs: Foo) -> Foo {
-        println!("Multiplying!");
-        self
-    }
-}
-
-fn main() {
-    Foo * Foo;
-}
-
-

Associated Types

-
-

type Output

The resulting type after applying the * operator

-
-

Required Methods

-
-

fn mul(self, rhs: RHS) -> Self::Output

The method for the * operator

-
-

Implementors

-
    -
  • impl Mul for Duration
    • -
  • impl Mul for usize
    • -
  • impl<'a> Mul for &'a usize
    • -
  • impl<'a> Mul for usize
    • -
  • impl<'a, 'b> Mul for &'b usize
    • -
  • impl Mul for u8
    • -
  • impl<'a> Mul for &'a u8
    • -
  • impl<'a> Mul for u8
    • -
  • impl<'a, 'b> Mul for &'b u8
    • -
  • impl Mul for u16
    • -
  • impl<'a> Mul for &'a u16
    • -
  • impl<'a> Mul for u16
    • -
  • impl<'a, 'b> Mul for &'b u16
    • -
  • impl Mul for u32
    • -
  • impl<'a> Mul for &'a u32
    • -
  • impl<'a> Mul for u32
    • -
  • impl<'a, 'b> Mul for &'b u32
    • -
  • impl Mul for u64
    • -
  • impl<'a> Mul for &'a u64
    • -
  • impl<'a> Mul for u64
    • -
  • impl<'a, 'b> Mul for &'b u64
    • -
  • impl Mul for isize
    • -
  • impl<'a> Mul for &'a isize
    • -
  • impl<'a> Mul for isize
    • -
  • impl<'a, 'b> Mul for &'b isize
    • -
  • impl Mul for i8
    • -
  • impl<'a> Mul for &'a i8
    • -
  • impl<'a> Mul for i8
    • -
  • impl<'a, 'b> Mul for &'b i8
    • -
  • impl Mul for i16
    • -
  • impl<'a> Mul for &'a i16
    • -
  • impl<'a> Mul for i16
    • -
  • impl<'a, 'b> Mul for &'b i16
    • -
  • impl Mul for i32
    • -
  • impl<'a> Mul for &'a i32
    • -
  • impl<'a> Mul for i32
    • -
  • impl<'a, 'b> Mul for &'b i32
    • -
  • impl Mul for i64
    • -
  • impl<'a> Mul for &'a i64
    • -
  • impl<'a> Mul for i64
    • -
  • impl<'a, 'b> Mul for &'b i64
    • -
  • impl Mul for f32
    • -
  • impl<'a> Mul for &'a f32
    • -
  • impl<'a> Mul for f32
    • -
  • impl<'a, 'b> Mul for &'b f32
    • -
  • impl Mul for f64
    • -
  • impl<'a> Mul for &'a f64
    • -
  • impl<'a> Mul for f64
    • -
  • impl<'a, 'b> Mul for &'b f64
    • -
  • impl Mul for Wrapping<usize>
    • -
  • impl Mul for Wrapping<u8>
    • -
  • impl Mul for Wrapping<u16>
    • -
  • impl Mul for Wrapping<u32>
    • -
  • impl Mul for Wrapping<u64>
    • -
  • impl Mul for Wrapping<isize>
    • -
  • impl Mul for Wrapping<i8>
    • -
  • impl Mul for Wrapping<i16>
    • -
  • impl Mul for Wrapping<i32>
    • -
  • impl Mul for Wrapping<i64>
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.MulAssign.html b/doc/bitflags/__core/ops/trait.MulAssign.html deleted file mode 100644 index 7995ab21..00000000 --- a/doc/bitflags/__core/ops/trait.MulAssign.html +++ /dev/null @@ -1,167 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::MulAssign - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::MulAssign - - [−] - - [src]

-
pub trait MulAssign<Rhs = Self> {
-    fn mul_assign(&mut self, Rhs);
-}

The MulAssign trait is used to specify the functionality of *=.

- -

Examples

-

A trivial implementation of MulAssign. When Foo *= Foo happens, it ends up -calling mul_assign, and therefore, main prints Multiplying!.

- -
-use std::ops::MulAssign;
-
-struct Foo;
-
-impl MulAssign for Foo {
-    fn mul_assign(&mut self, _rhs: Foo) {
-        println!("Multiplying!");
-    }
-}
-
-fn main() {
-    let mut foo = Foo;
-    foo *= Foo;
-}
-
-

Required Methods

-
-

fn mul_assign(&mut self, Rhs)

The method for the *= operator

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Neg.html b/doc/bitflags/__core/ops/trait.Neg.html deleted file mode 100644 index ee27cc30..00000000 --- a/doc/bitflags/__core/ops/trait.Neg.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Neg - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Neg - - [−] - - [src]

-
pub trait Neg {
-    type Output;
-    fn neg(self) -> Self::Output;
-}

The Neg trait is used to specify the functionality of unary -.

- -

Examples

-

A trivial implementation of Neg. When -Foo happens, it ends up calling -neg, and therefore, main prints Negating!.

- -
-use std::ops::Neg;
-
-struct Foo;
-
-impl Neg for Foo {
-    type Output = Foo;
-
-    fn neg(self) -> Foo {
-        println!("Negating!");
-        self
-    }
-}
-
-fn main() {
-    -Foo;
-}
-
-

Associated Types

-
-

type Output

The resulting type after applying the - operator

-
-

Required Methods

-
-

fn neg(self) -> Self::Output

The method for the unary - operator

-
-

Implementors

-
    -
  • impl Neg for isize
    • -
  • impl<'a> Neg for &'a isize
    • -
  • impl Neg for i8
    • -
  • impl<'a> Neg for &'a i8
    • -
  • impl Neg for i16
    • -
  • impl<'a> Neg for &'a i16
    • -
  • impl Neg for i32
    • -
  • impl<'a> Neg for &'a i32
    • -
  • impl Neg for i64
    • -
  • impl<'a> Neg for &'a i64
    • -
  • impl Neg for f32
    • -
  • impl<'a> Neg for &'a f32
    • -
  • impl Neg for f64
    • -
  • impl<'a> Neg for &'a f64
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Not.html b/doc/bitflags/__core/ops/trait.Not.html deleted file mode 100644 index 853a0a31..00000000 --- a/doc/bitflags/__core/ops/trait.Not.html +++ /dev/null @@ -1,183 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Not - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Not - - [−] - - [src]

-
pub trait Not {
-    type Output;
-    fn not(self) -> Self::Output;
-}

The Not trait is used to specify the functionality of unary !.

- -

Examples

-

A trivial implementation of Not. When !Foo happens, it ends up calling -not, and therefore, main prints Not-ing!.

- -
-use std::ops::Not;
-
-struct Foo;
-
-impl Not for Foo {
-    type Output = Foo;
-
-    fn not(self) -> Foo {
-        println!("Not-ing!");
-        self
-    }
-}
-
-fn main() {
-    !Foo;
-}
-
-

Associated Types

-
-

type Output

The resulting type after applying the ! operator

-
-

Required Methods

-
-

fn not(self) -> Self::Output

The method for the unary ! operator

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Place.html b/doc/bitflags/__core/ops/trait.Place.html deleted file mode 100644 index a21e2499..00000000 --- a/doc/bitflags/__core/ops/trait.Place.html +++ /dev/null @@ -1,146 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Place - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Place - - [−] - - [src]

-
pub trait Place<Data> where Data: ?Sized {
-    fn pointer(&mut self) -> *mut Data;
-}
Unstable (placement_new_protocol)

Both in (PLACE) EXPR and box EXPR desugar into expressions -that allocate an intermediate "place" that holds uninitialized -state. The desugaring evaluates EXPR, and writes the result at -the address returned by the pointer method of this trait.

- -

A Place can be thought of as a special representation for a -hypothetical &uninit reference (which Rust cannot currently -express directly). That is, it represents a pointer to -uninitialized storage.

- -

The client is responsible for two steps: First, initializing the -payload (it can access its address via pointer). Second, -converting the agent to an instance of the owning pointer, via the -appropriate finalize method (see the InPlace.

- -

If evaluating EXPR fails, then the destructor for the -implementation of Place to clean up any intermediate state -(e.g. deallocate box storage, pop a stack, etc).

-
-

Required Methods

-
-

fn pointer(&mut self) -> *mut Data

Unstable (placement_new_protocol)

Returns the address where the input value will be written. -Note that the data at this address is generally uninitialized, -and thus one should use ptr::write for initializing it.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Placer.html b/doc/bitflags/__core/ops/trait.Placer.html deleted file mode 100644 index 0ca38e39..00000000 --- a/doc/bitflags/__core/ops/trait.Placer.html +++ /dev/null @@ -1,154 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Placer - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Placer - - [−] - - [src]

-
pub trait Placer<Data> where Data: ?Sized {
-    type Place: InPlace<Data>;
-    fn make_place(self) -> Self::Place;
-}
Unstable (placement_new_protocol)

Interface to implementations of in (PLACE) EXPR.

- -

in (PLACE) EXPR effectively desugars into:

- -
-let p = PLACE;
-let mut place = Placer::make_place(p);
-let raw_place = Place::pointer(&mut place);
-let value = EXPR;
-unsafe {
-    std::ptr::write(raw_place, value);
-    InPlace::finalize(place)
-}
- -

The type of in (PLACE) EXPR is derived from the type of PLACE; -if the type of PLACE is P, then the final type of the whole -expression is P::Place::Owner (see the InPlace and Boxed -traits).

- -

Values for types implementing this trait usually are transient -intermediate values (e.g. the return value of Vec::emplace_back) -or Copy, since the make_place method takes self by value.

-
-

Associated Types

-
-

type Place: InPlace<Data>

Unstable (placement_new_protocol)

Place is the intermedate agent guarding the -uninitialized state for Data.

-
-

Required Methods

-
-

fn make_place(self) -> Self::Place

Unstable (placement_new_protocol)

Creates a fresh place from self.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Rem.html b/doc/bitflags/__core/ops/trait.Rem.html deleted file mode 100644 index f3a4fcf7..00000000 --- a/doc/bitflags/__core/ops/trait.Rem.html +++ /dev/null @@ -1,209 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Rem - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Rem - - [−] - - [src]

-
pub trait Rem<RHS = Self> {
-    type Output = Self;
-    fn rem(self, rhs: RHS) -> Self::Output;
-}

The Rem trait is used to specify the functionality of %.

- -

Examples

-

A trivial implementation of Rem. When Foo % Foo happens, it ends up -calling rem, and therefore, main prints Remainder-ing!.

- -
-use std::ops::Rem;
-
-struct Foo;
-
-impl Rem for Foo {
-    type Output = Foo;
-
-    fn rem(self, _rhs: Foo) -> Foo {
-        println!("Remainder-ing!");
-        self
-    }
-}
-
-fn main() {
-    Foo % Foo;
-}
-
-

Associated Types

-
-

type Output = Self

The resulting type after applying the % operator

-
-

Required Methods

-
-

fn rem(self, rhs: RHS) -> Self::Output

The method for the % operator

-
-

Implementors

-
    -
  • impl Rem for usize
    • -
  • impl<'a> Rem for &'a usize
    • -
  • impl<'a> Rem for usize
    • -
  • impl<'a, 'b> Rem for &'b usize
    • -
  • impl Rem for u8
    • -
  • impl<'a> Rem for &'a u8
    • -
  • impl<'a> Rem for u8
    • -
  • impl<'a, 'b> Rem for &'b u8
    • -
  • impl Rem for u16
    • -
  • impl<'a> Rem for &'a u16
    • -
  • impl<'a> Rem for u16
    • -
  • impl<'a, 'b> Rem for &'b u16
    • -
  • impl Rem for u32
    • -
  • impl<'a> Rem for &'a u32
    • -
  • impl<'a> Rem for u32
    • -
  • impl<'a, 'b> Rem for &'b u32
    • -
  • impl Rem for u64
    • -
  • impl<'a> Rem for &'a u64
    • -
  • impl<'a> Rem for u64
    • -
  • impl<'a, 'b> Rem for &'b u64
    • -
  • impl Rem for isize
    • -
  • impl<'a> Rem for &'a isize
    • -
  • impl<'a> Rem for isize
    • -
  • impl<'a, 'b> Rem for &'b isize
    • -
  • impl Rem for i8
    • -
  • impl<'a> Rem for &'a i8
    • -
  • impl<'a> Rem for i8
    • -
  • impl<'a, 'b> Rem for &'b i8
    • -
  • impl Rem for i16
    • -
  • impl<'a> Rem for &'a i16
    • -
  • impl<'a> Rem for i16
    • -
  • impl<'a, 'b> Rem for &'b i16
    • -
  • impl Rem for i32
    • -
  • impl<'a> Rem for &'a i32
    • -
  • impl<'a> Rem for i32
    • -
  • impl<'a, 'b> Rem for &'b i32
    • -
  • impl Rem for i64
    • -
  • impl<'a> Rem for &'a i64
    • -
  • impl<'a> Rem for i64
    • -
  • impl<'a, 'b> Rem for &'b i64
    • -
  • impl Rem for f32
    • -
  • impl<'a> Rem for &'a f32
    • -
  • impl<'a> Rem for f32
    • -
  • impl<'a, 'b> Rem for &'b f32
    • -
  • impl Rem for f64
    • -
  • impl<'a> Rem for &'a f64
    • -
  • impl<'a> Rem for f64
    • -
  • impl<'a, 'b> Rem for &'b f64
    • -
  • impl Rem for Wrapping<usize>
    • -
  • impl Rem for Wrapping<u8>
    • -
  • impl Rem for Wrapping<u16>
    • -
  • impl Rem for Wrapping<u32>
    • -
  • impl Rem for Wrapping<u64>
    • -
  • impl Rem for Wrapping<isize>
    • -
  • impl Rem for Wrapping<i8>
    • -
  • impl Rem for Wrapping<i16>
    • -
  • impl Rem for Wrapping<i32>
    • -
  • impl Rem for Wrapping<i64>
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.RemAssign.html b/doc/bitflags/__core/ops/trait.RemAssign.html deleted file mode 100644 index 0c318cf9..00000000 --- a/doc/bitflags/__core/ops/trait.RemAssign.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::RemAssign - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::RemAssign - - [−] - - [src]

-
pub trait RemAssign<Rhs = Self> {
-    fn rem_assign(&mut self, Rhs);
-}

The RemAssign trait is used to specify the functionality of %=.

- -

Examples

-

A trivial implementation of RemAssign. When Foo %= Foo happens, it ends up -calling rem_assign, and therefore, main prints Remainder-ing!.

- -
-use std::ops::RemAssign;
-
-struct Foo;
-
-impl RemAssign for Foo {
-    fn rem_assign(&mut self, _rhs: Foo) {
-        println!("Remainder-ing!");
-    }
-}
-
-fn main() {
-    let mut foo = Foo;
-    foo %= Foo;
-}
-
-

Required Methods

-
-

fn rem_assign(&mut self, Rhs)

The method for the %= operator

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Shl.html b/doc/bitflags/__core/ops/trait.Shl.html deleted file mode 100644 index 206b2fc1..00000000 --- a/doc/bitflags/__core/ops/trait.Shl.html +++ /dev/null @@ -1,561 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Shl - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Shl - - [−] - - [src]

-
pub trait Shl<RHS> {
-    type Output;
-    fn shl(self, rhs: RHS) -> Self::Output;
-}

The Shl trait is used to specify the functionality of <<.

- -

Examples

-

A trivial implementation of Shl. When Foo << Foo happens, it ends up -calling shl, and therefore, main prints Shifting left!.

- -
-use std::ops::Shl;
-
-struct Foo;
-
-impl Shl<Foo> for Foo {
-    type Output = Foo;
-
-    fn shl(self, _rhs: Foo) -> Foo {
-        println!("Shifting left!");
-        self
-    }
-}
-
-fn main() {
-    Foo << Foo;
-}
-
-

Associated Types

-
-

type Output

The resulting type after applying the << operator

-
-

Required Methods

-
-

fn shl(self, rhs: RHS) -> Self::Output

The method for the << operator

-
-

Implementors

-
    -
  • impl Shl for u8
    • -
  • impl<'a> Shl for &'a u8
    • -
  • impl<'a> Shl for u8
    • -
  • impl<'a, 'b> Shl for &'b u8
    • -
  • impl Shl for u8
    • -
  • impl<'a> Shl for &'a u8
    • -
  • impl<'a> Shl for u8
    • -
  • impl<'a, 'b> Shl for &'b u8
    • -
  • impl Shl for u8
    • -
  • impl<'a> Shl for &'a u8
    • -
  • impl<'a> Shl for u8
    • -
  • impl<'a, 'b> Shl for &'b u8
    • -
  • impl Shl for u8
    • -
  • impl<'a> Shl for &'a u8
    • -
  • impl<'a> Shl for u8
    • -
  • impl<'a, 'b> Shl for &'b u8
    • -
  • impl Shl for u8
    • -
  • impl<'a> Shl for &'a u8
    • -
  • impl<'a> Shl for u8
    • -
  • impl<'a, 'b> Shl for &'b u8
    • -
  • impl Shl for u8
    • -
  • impl<'a> Shl for &'a u8
    • -
  • impl<'a> Shl for u8
    • -
  • impl<'a, 'b> Shl for &'b u8
    • -
  • impl Shl for u8
    • -
  • impl<'a> Shl for &'a u8
    • -
  • impl<'a> Shl for u8
    • -
  • impl<'a, 'b> Shl for &'b u8
    • -
  • impl Shl for u8
    • -
  • impl<'a> Shl for &'a u8
    • -
  • impl<'a> Shl for u8
    • -
  • impl<'a, 'b> Shl for &'b u8
    • -
  • impl Shl for u8
    • -
  • impl<'a> Shl for &'a u8
    • -
  • impl<'a> Shl for u8
    • -
  • impl<'a, 'b> Shl for &'b u8
    • -
  • impl Shl for u8
    • -
  • impl<'a> Shl for &'a u8
    • -
  • impl<'a> Shl for u8
    • -
  • impl<'a, 'b> Shl for &'b u8
    • -
  • impl Shl for u16
    • -
  • impl<'a> Shl for &'a u16
    • -
  • impl<'a> Shl for u16
    • -
  • impl<'a, 'b> Shl for &'b u16
    • -
  • impl Shl for u16
    • -
  • impl<'a> Shl for &'a u16
    • -
  • impl<'a> Shl for u16
    • -
  • impl<'a, 'b> Shl for &'b u16
    • -
  • impl Shl for u16
    • -
  • impl<'a> Shl for &'a u16
    • -
  • impl<'a> Shl for u16
    • -
  • impl<'a, 'b> Shl for &'b u16
    • -
  • impl Shl for u16
    • -
  • impl<'a> Shl for &'a u16
    • -
  • impl<'a> Shl for u16
    • -
  • impl<'a, 'b> Shl for &'b u16
    • -
  • impl Shl for u16
    • -
  • impl<'a> Shl for &'a u16
    • -
  • impl<'a> Shl for u16
    • -
  • impl<'a, 'b> Shl for &'b u16
    • -
  • impl Shl for u16
    • -
  • impl<'a> Shl for &'a u16
    • -
  • impl<'a> Shl for u16
    • -
  • impl<'a, 'b> Shl for &'b u16
    • -
  • impl Shl for u16
    • -
  • impl<'a> Shl for &'a u16
    • -
  • impl<'a> Shl for u16
    • -
  • impl<'a, 'b> Shl for &'b u16
    • -
  • impl Shl for u16
    • -
  • impl<'a> Shl for &'a u16
    • -
  • impl<'a> Shl for u16
    • -
  • impl<'a, 'b> Shl for &'b u16
    • -
  • impl Shl for u16
    • -
  • impl<'a> Shl for &'a u16
    • -
  • impl<'a> Shl for u16
    • -
  • impl<'a, 'b> Shl for &'b u16
    • -
  • impl Shl for u16
    • -
  • impl<'a> Shl for &'a u16
    • -
  • impl<'a> Shl for u16
    • -
  • impl<'a, 'b> Shl for &'b u16
    • -
  • impl Shl for u32
    • -
  • impl<'a> Shl for &'a u32
    • -
  • impl<'a> Shl for u32
    • -
  • impl<'a, 'b> Shl for &'b u32
    • -
  • impl Shl for u32
    • -
  • impl<'a> Shl for &'a u32
    • -
  • impl<'a> Shl for u32
    • -
  • impl<'a, 'b> Shl for &'b u32
    • -
  • impl Shl for u32
    • -
  • impl<'a> Shl for &'a u32
    • -
  • impl<'a> Shl for u32
    • -
  • impl<'a, 'b> Shl for &'b u32
    • -
  • impl Shl for u32
    • -
  • impl<'a> Shl for &'a u32
    • -
  • impl<'a> Shl for u32
    • -
  • impl<'a, 'b> Shl for &'b u32
    • -
  • impl Shl for u32
    • -
  • impl<'a> Shl for &'a u32
    • -
  • impl<'a> Shl for u32
    • -
  • impl<'a, 'b> Shl for &'b u32
    • -
  • impl Shl for u32
    • -
  • impl<'a> Shl for &'a u32
    • -
  • impl<'a> Shl for u32
    • -
  • impl<'a, 'b> Shl for &'b u32
    • -
  • impl Shl for u32
    • -
  • impl<'a> Shl for &'a u32
    • -
  • impl<'a> Shl for u32
    • -
  • impl<'a, 'b> Shl for &'b u32
    • -
  • impl Shl for u32
    • -
  • impl<'a> Shl for &'a u32
    • -
  • impl<'a> Shl for u32
    • -
  • impl<'a, 'b> Shl for &'b u32
    • -
  • impl Shl for u32
    • -
  • impl<'a> Shl for &'a u32
    • -
  • impl<'a> Shl for u32
    • -
  • impl<'a, 'b> Shl for &'b u32
    • -
  • impl Shl for u32
    • -
  • impl<'a> Shl for &'a u32
    • -
  • impl<'a> Shl for u32
    • -
  • impl<'a, 'b> Shl for &'b u32
    • -
  • impl Shl for u64
    • -
  • impl<'a> Shl for &'a u64
    • -
  • impl<'a> Shl for u64
    • -
  • impl<'a, 'b> Shl for &'b u64
    • -
  • impl Shl for u64
    • -
  • impl<'a> Shl for &'a u64
    • -
  • impl<'a> Shl for u64
    • -
  • impl<'a, 'b> Shl for &'b u64
    • -
  • impl Shl for u64
    • -
  • impl<'a> Shl for &'a u64
    • -
  • impl<'a> Shl for u64
    • -
  • impl<'a, 'b> Shl for &'b u64
    • -
  • impl Shl for u64
    • -
  • impl<'a> Shl for &'a u64
    • -
  • impl<'a> Shl for u64
    • -
  • impl<'a, 'b> Shl for &'b u64
    • -
  • impl Shl for u64
    • -
  • impl<'a> Shl for &'a u64
    • -
  • impl<'a> Shl for u64
    • -
  • impl<'a, 'b> Shl for &'b u64
    • -
  • impl Shl for u64
    • -
  • impl<'a> Shl for &'a u64
    • -
  • impl<'a> Shl for u64
    • -
  • impl<'a, 'b> Shl for &'b u64
    • -
  • impl Shl for u64
    • -
  • impl<'a> Shl for &'a u64
    • -
  • impl<'a> Shl for u64
    • -
  • impl<'a, 'b> Shl for &'b u64
    • -
  • impl Shl for u64
    • -
  • impl<'a> Shl for &'a u64
    • -
  • impl<'a> Shl for u64
    • -
  • impl<'a, 'b> Shl for &'b u64
    • -
  • impl Shl for u64
    • -
  • impl<'a> Shl for &'a u64
    • -
  • impl<'a> Shl for u64
    • -
  • impl<'a, 'b> Shl for &'b u64
    • -
  • impl Shl for u64
    • -
  • impl<'a> Shl for &'a u64
    • -
  • impl<'a> Shl for u64
    • -
  • impl<'a, 'b> Shl for &'b u64
    • -
  • impl Shl for usize
    • -
  • impl<'a> Shl for &'a usize
    • -
  • impl<'a> Shl for usize
    • -
  • impl<'a, 'b> Shl for &'b usize
    • -
  • impl Shl for usize
    • -
  • impl<'a> Shl for &'a usize
    • -
  • impl<'a> Shl for usize
    • -
  • impl<'a, 'b> Shl for &'b usize
    • -
  • impl Shl for usize
    • -
  • impl<'a> Shl for &'a usize
    • -
  • impl<'a> Shl for usize
    • -
  • impl<'a, 'b> Shl for &'b usize
    • -
  • impl Shl for usize
    • -
  • impl<'a> Shl for &'a usize
    • -
  • impl<'a> Shl for usize
    • -
  • impl<'a, 'b> Shl for &'b usize
    • -
  • impl Shl for usize
    • -
  • impl<'a> Shl for &'a usize
    • -
  • impl<'a> Shl for usize
    • -
  • impl<'a, 'b> Shl for &'b usize
    • -
  • impl Shl for usize
    • -
  • impl<'a> Shl for &'a usize
    • -
  • impl<'a> Shl for usize
    • -
  • impl<'a, 'b> Shl for &'b usize
    • -
  • impl Shl for usize
    • -
  • impl<'a> Shl for &'a usize
    • -
  • impl<'a> Shl for usize
    • -
  • impl<'a, 'b> Shl for &'b usize
    • -
  • impl Shl for usize
    • -
  • impl<'a> Shl for &'a usize
    • -
  • impl<'a> Shl for usize
    • -
  • impl<'a, 'b> Shl for &'b usize
    • -
  • impl Shl for usize
    • -
  • impl<'a> Shl for &'a usize
    • -
  • impl<'a> Shl for usize
    • -
  • impl<'a, 'b> Shl for &'b usize
    • -
  • impl Shl for usize
    • -
  • impl<'a> Shl for &'a usize
    • -
  • impl<'a> Shl for usize
    • -
  • impl<'a, 'b> Shl for &'b usize
    • -
  • impl Shl for i8
    • -
  • impl<'a> Shl for &'a i8
    • -
  • impl<'a> Shl for i8
    • -
  • impl<'a, 'b> Shl for &'b i8
    • -
  • impl Shl for i8
    • -
  • impl<'a> Shl for &'a i8
    • -
  • impl<'a> Shl for i8
    • -
  • impl<'a, 'b> Shl for &'b i8
    • -
  • impl Shl for i8
    • -
  • impl<'a> Shl for &'a i8
    • -
  • impl<'a> Shl for i8
    • -
  • impl<'a, 'b> Shl for &'b i8
    • -
  • impl Shl for i8
    • -
  • impl<'a> Shl for &'a i8
    • -
  • impl<'a> Shl for i8
    • -
  • impl<'a, 'b> Shl for &'b i8
    • -
  • impl Shl for i8
    • -
  • impl<'a> Shl for &'a i8
    • -
  • impl<'a> Shl for i8
    • -
  • impl<'a, 'b> Shl for &'b i8
    • -
  • impl Shl for i8
    • -
  • impl<'a> Shl for &'a i8
    • -
  • impl<'a> Shl for i8
    • -
  • impl<'a, 'b> Shl for &'b i8
    • -
  • impl Shl for i8
    • -
  • impl<'a> Shl for &'a i8
    • -
  • impl<'a> Shl for i8
    • -
  • impl<'a, 'b> Shl for &'b i8
    • -
  • impl Shl for i8
    • -
  • impl<'a> Shl for &'a i8
    • -
  • impl<'a> Shl for i8
    • -
  • impl<'a, 'b> Shl for &'b i8
    • -
  • impl Shl for i8
    • -
  • impl<'a> Shl for &'a i8
    • -
  • impl<'a> Shl for i8
    • -
  • impl<'a, 'b> Shl for &'b i8
    • -
  • impl Shl for i8
    • -
  • impl<'a> Shl for &'a i8
    • -
  • impl<'a> Shl for i8
    • -
  • impl<'a, 'b> Shl for &'b i8
    • -
  • impl Shl for i16
    • -
  • impl<'a> Shl for &'a i16
    • -
  • impl<'a> Shl for i16
    • -
  • impl<'a, 'b> Shl for &'b i16
    • -
  • impl Shl for i16
    • -
  • impl<'a> Shl for &'a i16
    • -
  • impl<'a> Shl for i16
    • -
  • impl<'a, 'b> Shl for &'b i16
    • -
  • impl Shl for i16
    • -
  • impl<'a> Shl for &'a i16
    • -
  • impl<'a> Shl for i16
    • -
  • impl<'a, 'b> Shl for &'b i16
    • -
  • impl Shl for i16
    • -
  • impl<'a> Shl for &'a i16
    • -
  • impl<'a> Shl for i16
    • -
  • impl<'a, 'b> Shl for &'b i16
    • -
  • impl Shl for i16
    • -
  • impl<'a> Shl for &'a i16
    • -
  • impl<'a> Shl for i16
    • -
  • impl<'a, 'b> Shl for &'b i16
    • -
  • impl Shl for i16
    • -
  • impl<'a> Shl for &'a i16
    • -
  • impl<'a> Shl for i16
    • -
  • impl<'a, 'b> Shl for &'b i16
    • -
  • impl Shl for i16
    • -
  • impl<'a> Shl for &'a i16
    • -
  • impl<'a> Shl for i16
    • -
  • impl<'a, 'b> Shl for &'b i16
    • -
  • impl Shl for i16
    • -
  • impl<'a> Shl for &'a i16
    • -
  • impl<'a> Shl for i16
    • -
  • impl<'a, 'b> Shl for &'b i16
    • -
  • impl Shl for i16
    • -
  • impl<'a> Shl for &'a i16
    • -
  • impl<'a> Shl for i16
    • -
  • impl<'a, 'b> Shl for &'b i16
    • -
  • impl Shl for i16
    • -
  • impl<'a> Shl for &'a i16
    • -
  • impl<'a> Shl for i16
    • -
  • impl<'a, 'b> Shl for &'b i16
    • -
  • impl Shl for i32
    • -
  • impl<'a> Shl for &'a i32
    • -
  • impl<'a> Shl for i32
    • -
  • impl<'a, 'b> Shl for &'b i32
    • -
  • impl Shl for i32
    • -
  • impl<'a> Shl for &'a i32
    • -
  • impl<'a> Shl for i32
    • -
  • impl<'a, 'b> Shl for &'b i32
    • -
  • impl Shl for i32
    • -
  • impl<'a> Shl for &'a i32
    • -
  • impl<'a> Shl for i32
    • -
  • impl<'a, 'b> Shl for &'b i32
    • -
  • impl Shl for i32
    • -
  • impl<'a> Shl for &'a i32
    • -
  • impl<'a> Shl for i32
    • -
  • impl<'a, 'b> Shl for &'b i32
    • -
  • impl Shl for i32
    • -
  • impl<'a> Shl for &'a i32
    • -
  • impl<'a> Shl for i32
    • -
  • impl<'a, 'b> Shl for &'b i32
    • -
  • impl Shl for i32
    • -
  • impl<'a> Shl for &'a i32
    • -
  • impl<'a> Shl for i32
    • -
  • impl<'a, 'b> Shl for &'b i32
    • -
  • impl Shl for i32
    • -
  • impl<'a> Shl for &'a i32
    • -
  • impl<'a> Shl for i32
    • -
  • impl<'a, 'b> Shl for &'b i32
    • -
  • impl Shl for i32
    • -
  • impl<'a> Shl for &'a i32
    • -
  • impl<'a> Shl for i32
    • -
  • impl<'a, 'b> Shl for &'b i32
    • -
  • impl Shl for i32
    • -
  • impl<'a> Shl for &'a i32
    • -
  • impl<'a> Shl for i32
    • -
  • impl<'a, 'b> Shl for &'b i32
    • -
  • impl Shl for i32
    • -
  • impl<'a> Shl for &'a i32
    • -
  • impl<'a> Shl for i32
    • -
  • impl<'a, 'b> Shl for &'b i32
    • -
  • impl Shl for i64
    • -
  • impl<'a> Shl for &'a i64
    • -
  • impl<'a> Shl for i64
    • -
  • impl<'a, 'b> Shl for &'b i64
    • -
  • impl Shl for i64
    • -
  • impl<'a> Shl for &'a i64
    • -
  • impl<'a> Shl for i64
    • -
  • impl<'a, 'b> Shl for &'b i64
    • -
  • impl Shl for i64
    • -
  • impl<'a> Shl for &'a i64
    • -
  • impl<'a> Shl for i64
    • -
  • impl<'a, 'b> Shl for &'b i64
    • -
  • impl Shl for i64
    • -
  • impl<'a> Shl for &'a i64
    • -
  • impl<'a> Shl for i64
    • -
  • impl<'a, 'b> Shl for &'b i64
    • -
  • impl Shl for i64
    • -
  • impl<'a> Shl for &'a i64
    • -
  • impl<'a> Shl for i64
    • -
  • impl<'a, 'b> Shl for &'b i64
    • -
  • impl Shl for i64
    • -
  • impl<'a> Shl for &'a i64
    • -
  • impl<'a> Shl for i64
    • -
  • impl<'a, 'b> Shl for &'b i64
    • -
  • impl Shl for i64
    • -
  • impl<'a> Shl for &'a i64
    • -
  • impl<'a> Shl for i64
    • -
  • impl<'a, 'b> Shl for &'b i64
    • -
  • impl Shl for i64
    • -
  • impl<'a> Shl for &'a i64
    • -
  • impl<'a> Shl for i64
    • -
  • impl<'a, 'b> Shl for &'b i64
    • -
  • impl Shl for i64
    • -
  • impl<'a> Shl for &'a i64
    • -
  • impl<'a> Shl for i64
    • -
  • impl<'a, 'b> Shl for &'b i64
    • -
  • impl Shl for i64
    • -
  • impl<'a> Shl for &'a i64
    • -
  • impl<'a> Shl for i64
    • -
  • impl<'a, 'b> Shl for &'b i64
    • -
  • impl Shl for isize
    • -
  • impl<'a> Shl for &'a isize
    • -
  • impl<'a> Shl for isize
    • -
  • impl<'a, 'b> Shl for &'b isize
    • -
  • impl Shl for isize
    • -
  • impl<'a> Shl for &'a isize
    • -
  • impl<'a> Shl for isize
    • -
  • impl<'a, 'b> Shl for &'b isize
    • -
  • impl Shl for isize
    • -
  • impl<'a> Shl for &'a isize
    • -
  • impl<'a> Shl for isize
    • -
  • impl<'a, 'b> Shl for &'b isize
    • -
  • impl Shl for isize
    • -
  • impl<'a> Shl for &'a isize
    • -
  • impl<'a> Shl for isize
    • -
  • impl<'a, 'b> Shl for &'b isize
    • -
  • impl Shl for isize
    • -
  • impl<'a> Shl for &'a isize
    • -
  • impl<'a> Shl for isize
    • -
  • impl<'a, 'b> Shl for &'b isize
    • -
  • impl Shl for isize
    • -
  • impl<'a> Shl for &'a isize
    • -
  • impl<'a> Shl for isize
    • -
  • impl<'a, 'b> Shl for &'b isize
    • -
  • impl Shl for isize
    • -
  • impl<'a> Shl for &'a isize
    • -
  • impl<'a> Shl for isize
    • -
  • impl<'a, 'b> Shl for &'b isize
    • -
  • impl Shl for isize
    • -
  • impl<'a> Shl for &'a isize
    • -
  • impl<'a> Shl for isize
    • -
  • impl<'a, 'b> Shl for &'b isize
    • -
  • impl Shl for isize
    • -
  • impl<'a> Shl for &'a isize
    • -
  • impl<'a> Shl for isize
    • -
  • impl<'a, 'b> Shl for &'b isize
    • -
  • impl Shl for isize
    • -
  • impl<'a> Shl for &'a isize
    • -
  • impl<'a> Shl for isize
    • -
  • impl<'a, 'b> Shl for &'b isize
    • -
  • impl Shl for Wrapping<u8>
    • -
  • impl Shl for Wrapping<u16>
    • -
  • impl Shl for Wrapping<u32>
    • -
  • impl Shl for Wrapping<u64>
    • -
  • impl Shl for Wrapping<usize>
    • -
  • impl Shl for Wrapping<i8>
    • -
  • impl Shl for Wrapping<i16>
    • -
  • impl Shl for Wrapping<i32>
    • -
  • impl Shl for Wrapping<i64>
    • -
  • impl Shl for Wrapping<isize>
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.ShlAssign.html b/doc/bitflags/__core/ops/trait.ShlAssign.html deleted file mode 100644 index a336fd9e..00000000 --- a/doc/bitflags/__core/ops/trait.ShlAssign.html +++ /dev/null @@ -1,254 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::ShlAssign - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::ShlAssign - - [−] - - [src]

-
pub trait ShlAssign<Rhs> {
-    fn shl_assign(&mut self, Rhs);
-}

The ShlAssign trait is used to specify the functionality of <<=.

- -

Examples

-

A trivial implementation of ShlAssign. When Foo <<= Foo happens, it ends up -calling shl_assign, and therefore, main prints Shifting left!.

- -
-use std::ops::ShlAssign;
-
-struct Foo;
-
-impl ShlAssign<Foo> for Foo {
-    fn shl_assign(&mut self, _rhs: Foo) {
-        println!("Shifting left!");
-    }
-}
-
-fn main() {
-    let mut foo = Foo;
-    foo <<= Foo;
-}
-
-

Required Methods

-
-

fn shl_assign(&mut self, Rhs)

The method for the <<= operator

-
-

Implementors

-
    -
  • impl ShlAssign for u8
    • -
  • impl ShlAssign for u8
    • -
  • impl ShlAssign for u8
    • -
  • impl ShlAssign for u8
    • -
  • impl ShlAssign for u8
    • -
  • impl ShlAssign for u8
    • -
  • impl ShlAssign for u8
    • -
  • impl ShlAssign for u8
    • -
  • impl ShlAssign for u8
    • -
  • impl ShlAssign for u8
    • -
  • impl ShlAssign for u16
    • -
  • impl ShlAssign for u16
    • -
  • impl ShlAssign for u16
    • -
  • impl ShlAssign for u16
    • -
  • impl ShlAssign for u16
    • -
  • impl ShlAssign for u16
    • -
  • impl ShlAssign for u16
    • -
  • impl ShlAssign for u16
    • -
  • impl ShlAssign for u16
    • -
  • impl ShlAssign for u16
    • -
  • impl ShlAssign for u32
    • -
  • impl ShlAssign for u32
    • -
  • impl ShlAssign for u32
    • -
  • impl ShlAssign for u32
    • -
  • impl ShlAssign for u32
    • -
  • impl ShlAssign for u32
    • -
  • impl ShlAssign for u32
    • -
  • impl ShlAssign for u32
    • -
  • impl ShlAssign for u32
    • -
  • impl ShlAssign for u32
    • -
  • impl ShlAssign for u64
    • -
  • impl ShlAssign for u64
    • -
  • impl ShlAssign for u64
    • -
  • impl ShlAssign for u64
    • -
  • impl ShlAssign for u64
    • -
  • impl ShlAssign for u64
    • -
  • impl ShlAssign for u64
    • -
  • impl ShlAssign for u64
    • -
  • impl ShlAssign for u64
    • -
  • impl ShlAssign for u64
    • -
  • impl ShlAssign for usize
    • -
  • impl ShlAssign for usize
    • -
  • impl ShlAssign for usize
    • -
  • impl ShlAssign for usize
    • -
  • impl ShlAssign for usize
    • -
  • impl ShlAssign for usize
    • -
  • impl ShlAssign for usize
    • -
  • impl ShlAssign for usize
    • -
  • impl ShlAssign for usize
    • -
  • impl ShlAssign for usize
    • -
  • impl ShlAssign for i8
    • -
  • impl ShlAssign for i8
    • -
  • impl ShlAssign for i8
    • -
  • impl ShlAssign for i8
    • -
  • impl ShlAssign for i8
    • -
  • impl ShlAssign for i8
    • -
  • impl ShlAssign for i8
    • -
  • impl ShlAssign for i8
    • -
  • impl ShlAssign for i8
    • -
  • impl ShlAssign for i8
    • -
  • impl ShlAssign for i16
    • -
  • impl ShlAssign for i16
    • -
  • impl ShlAssign for i16
    • -
  • impl ShlAssign for i16
    • -
  • impl ShlAssign for i16
    • -
  • impl ShlAssign for i16
    • -
  • impl ShlAssign for i16
    • -
  • impl ShlAssign for i16
    • -
  • impl ShlAssign for i16
    • -
  • impl ShlAssign for i16
    • -
  • impl ShlAssign for i32
    • -
  • impl ShlAssign for i32
    • -
  • impl ShlAssign for i32
    • -
  • impl ShlAssign for i32
    • -
  • impl ShlAssign for i32
    • -
  • impl ShlAssign for i32
    • -
  • impl ShlAssign for i32
    • -
  • impl ShlAssign for i32
    • -
  • impl ShlAssign for i32
    • -
  • impl ShlAssign for i32
    • -
  • impl ShlAssign for i64
    • -
  • impl ShlAssign for i64
    • -
  • impl ShlAssign for i64
    • -
  • impl ShlAssign for i64
    • -
  • impl ShlAssign for i64
    • -
  • impl ShlAssign for i64
    • -
  • impl ShlAssign for i64
    • -
  • impl ShlAssign for i64
    • -
  • impl ShlAssign for i64
    • -
  • impl ShlAssign for i64
    • -
  • impl ShlAssign for isize
    • -
  • impl ShlAssign for isize
    • -
  • impl ShlAssign for isize
    • -
  • impl ShlAssign for isize
    • -
  • impl ShlAssign for isize
    • -
  • impl ShlAssign for isize
    • -
  • impl ShlAssign for isize
    • -
  • impl ShlAssign for isize
    • -
  • impl ShlAssign for isize
    • -
  • impl ShlAssign for isize
    • -
  • impl ShlAssign for Wrapping<u8>
    • -
  • impl ShlAssign for Wrapping<u16>
    • -
  • impl ShlAssign for Wrapping<u32>
    • -
  • impl ShlAssign for Wrapping<u64>
    • -
  • impl ShlAssign for Wrapping<usize>
    • -
  • impl ShlAssign for Wrapping<i8>
    • -
  • impl ShlAssign for Wrapping<i16>
    • -
  • impl ShlAssign for Wrapping<i32>
    • -
  • impl ShlAssign for Wrapping<i64>
    • -
  • impl ShlAssign for Wrapping<isize>
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Shr.html b/doc/bitflags/__core/ops/trait.Shr.html deleted file mode 100644 index 3440a943..00000000 --- a/doc/bitflags/__core/ops/trait.Shr.html +++ /dev/null @@ -1,561 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Shr - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Shr - - [−] - - [src]

-
pub trait Shr<RHS> {
-    type Output;
-    fn shr(self, rhs: RHS) -> Self::Output;
-}

The Shr trait is used to specify the functionality of >>.

- -

Examples

-

A trivial implementation of Shr. When Foo >> Foo happens, it ends up -calling shr, and therefore, main prints Shifting right!.

- -
-use std::ops::Shr;
-
-struct Foo;
-
-impl Shr<Foo> for Foo {
-    type Output = Foo;
-
-    fn shr(self, _rhs: Foo) -> Foo {
-        println!("Shifting right!");
-        self
-    }
-}
-
-fn main() {
-    Foo >> Foo;
-}
-
-

Associated Types

-
-

type Output

The resulting type after applying the >> operator

-
-

Required Methods

-
-

fn shr(self, rhs: RHS) -> Self::Output

The method for the >> operator

-
-

Implementors

-
    -
  • impl Shr for u8
    • -
  • impl<'a> Shr for &'a u8
    • -
  • impl<'a> Shr for u8
    • -
  • impl<'a, 'b> Shr for &'b u8
    • -
  • impl Shr for u8
    • -
  • impl<'a> Shr for &'a u8
    • -
  • impl<'a> Shr for u8
    • -
  • impl<'a, 'b> Shr for &'b u8
    • -
  • impl Shr for u8
    • -
  • impl<'a> Shr for &'a u8
    • -
  • impl<'a> Shr for u8
    • -
  • impl<'a, 'b> Shr for &'b u8
    • -
  • impl Shr for u8
    • -
  • impl<'a> Shr for &'a u8
    • -
  • impl<'a> Shr for u8
    • -
  • impl<'a, 'b> Shr for &'b u8
    • -
  • impl Shr for u8
    • -
  • impl<'a> Shr for &'a u8
    • -
  • impl<'a> Shr for u8
    • -
  • impl<'a, 'b> Shr for &'b u8
    • -
  • impl Shr for u8
    • -
  • impl<'a> Shr for &'a u8
    • -
  • impl<'a> Shr for u8
    • -
  • impl<'a, 'b> Shr for &'b u8
    • -
  • impl Shr for u8
    • -
  • impl<'a> Shr for &'a u8
    • -
  • impl<'a> Shr for u8
    • -
  • impl<'a, 'b> Shr for &'b u8
    • -
  • impl Shr for u8
    • -
  • impl<'a> Shr for &'a u8
    • -
  • impl<'a> Shr for u8
    • -
  • impl<'a, 'b> Shr for &'b u8
    • -
  • impl Shr for u8
    • -
  • impl<'a> Shr for &'a u8
    • -
  • impl<'a> Shr for u8
    • -
  • impl<'a, 'b> Shr for &'b u8
    • -
  • impl Shr for u8
    • -
  • impl<'a> Shr for &'a u8
    • -
  • impl<'a> Shr for u8
    • -
  • impl<'a, 'b> Shr for &'b u8
    • -
  • impl Shr for u16
    • -
  • impl<'a> Shr for &'a u16
    • -
  • impl<'a> Shr for u16
    • -
  • impl<'a, 'b> Shr for &'b u16
    • -
  • impl Shr for u16
    • -
  • impl<'a> Shr for &'a u16
    • -
  • impl<'a> Shr for u16
    • -
  • impl<'a, 'b> Shr for &'b u16
    • -
  • impl Shr for u16
    • -
  • impl<'a> Shr for &'a u16
    • -
  • impl<'a> Shr for u16
    • -
  • impl<'a, 'b> Shr for &'b u16
    • -
  • impl Shr for u16
    • -
  • impl<'a> Shr for &'a u16
    • -
  • impl<'a> Shr for u16
    • -
  • impl<'a, 'b> Shr for &'b u16
    • -
  • impl Shr for u16
    • -
  • impl<'a> Shr for &'a u16
    • -
  • impl<'a> Shr for u16
    • -
  • impl<'a, 'b> Shr for &'b u16
    • -
  • impl Shr for u16
    • -
  • impl<'a> Shr for &'a u16
    • -
  • impl<'a> Shr for u16
    • -
  • impl<'a, 'b> Shr for &'b u16
    • -
  • impl Shr for u16
    • -
  • impl<'a> Shr for &'a u16
    • -
  • impl<'a> Shr for u16
    • -
  • impl<'a, 'b> Shr for &'b u16
    • -
  • impl Shr for u16
    • -
  • impl<'a> Shr for &'a u16
    • -
  • impl<'a> Shr for u16
    • -
  • impl<'a, 'b> Shr for &'b u16
    • -
  • impl Shr for u16
    • -
  • impl<'a> Shr for &'a u16
    • -
  • impl<'a> Shr for u16
    • -
  • impl<'a, 'b> Shr for &'b u16
    • -
  • impl Shr for u16
    • -
  • impl<'a> Shr for &'a u16
    • -
  • impl<'a> Shr for u16
    • -
  • impl<'a, 'b> Shr for &'b u16
    • -
  • impl Shr for u32
    • -
  • impl<'a> Shr for &'a u32
    • -
  • impl<'a> Shr for u32
    • -
  • impl<'a, 'b> Shr for &'b u32
    • -
  • impl Shr for u32
    • -
  • impl<'a> Shr for &'a u32
    • -
  • impl<'a> Shr for u32
    • -
  • impl<'a, 'b> Shr for &'b u32
    • -
  • impl Shr for u32
    • -
  • impl<'a> Shr for &'a u32
    • -
  • impl<'a> Shr for u32
    • -
  • impl<'a, 'b> Shr for &'b u32
    • -
  • impl Shr for u32
    • -
  • impl<'a> Shr for &'a u32
    • -
  • impl<'a> Shr for u32
    • -
  • impl<'a, 'b> Shr for &'b u32
    • -
  • impl Shr for u32
    • -
  • impl<'a> Shr for &'a u32
    • -
  • impl<'a> Shr for u32
    • -
  • impl<'a, 'b> Shr for &'b u32
    • -
  • impl Shr for u32
    • -
  • impl<'a> Shr for &'a u32
    • -
  • impl<'a> Shr for u32
    • -
  • impl<'a, 'b> Shr for &'b u32
    • -
  • impl Shr for u32
    • -
  • impl<'a> Shr for &'a u32
    • -
  • impl<'a> Shr for u32
    • -
  • impl<'a, 'b> Shr for &'b u32
    • -
  • impl Shr for u32
    • -
  • impl<'a> Shr for &'a u32
    • -
  • impl<'a> Shr for u32
    • -
  • impl<'a, 'b> Shr for &'b u32
    • -
  • impl Shr for u32
    • -
  • impl<'a> Shr for &'a u32
    • -
  • impl<'a> Shr for u32
    • -
  • impl<'a, 'b> Shr for &'b u32
    • -
  • impl Shr for u32
    • -
  • impl<'a> Shr for &'a u32
    • -
  • impl<'a> Shr for u32
    • -
  • impl<'a, 'b> Shr for &'b u32
    • -
  • impl Shr for u64
    • -
  • impl<'a> Shr for &'a u64
    • -
  • impl<'a> Shr for u64
    • -
  • impl<'a, 'b> Shr for &'b u64
    • -
  • impl Shr for u64
    • -
  • impl<'a> Shr for &'a u64
    • -
  • impl<'a> Shr for u64
    • -
  • impl<'a, 'b> Shr for &'b u64
    • -
  • impl Shr for u64
    • -
  • impl<'a> Shr for &'a u64
    • -
  • impl<'a> Shr for u64
    • -
  • impl<'a, 'b> Shr for &'b u64
    • -
  • impl Shr for u64
    • -
  • impl<'a> Shr for &'a u64
    • -
  • impl<'a> Shr for u64
    • -
  • impl<'a, 'b> Shr for &'b u64
    • -
  • impl Shr for u64
    • -
  • impl<'a> Shr for &'a u64
    • -
  • impl<'a> Shr for u64
    • -
  • impl<'a, 'b> Shr for &'b u64
    • -
  • impl Shr for u64
    • -
  • impl<'a> Shr for &'a u64
    • -
  • impl<'a> Shr for u64
    • -
  • impl<'a, 'b> Shr for &'b u64
    • -
  • impl Shr for u64
    • -
  • impl<'a> Shr for &'a u64
    • -
  • impl<'a> Shr for u64
    • -
  • impl<'a, 'b> Shr for &'b u64
    • -
  • impl Shr for u64
    • -
  • impl<'a> Shr for &'a u64
    • -
  • impl<'a> Shr for u64
    • -
  • impl<'a, 'b> Shr for &'b u64
    • -
  • impl Shr for u64
    • -
  • impl<'a> Shr for &'a u64
    • -
  • impl<'a> Shr for u64
    • -
  • impl<'a, 'b> Shr for &'b u64
    • -
  • impl Shr for u64
    • -
  • impl<'a> Shr for &'a u64
    • -
  • impl<'a> Shr for u64
    • -
  • impl<'a, 'b> Shr for &'b u64
    • -
  • impl Shr for usize
    • -
  • impl<'a> Shr for &'a usize
    • -
  • impl<'a> Shr for usize
    • -
  • impl<'a, 'b> Shr for &'b usize
    • -
  • impl Shr for usize
    • -
  • impl<'a> Shr for &'a usize
    • -
  • impl<'a> Shr for usize
    • -
  • impl<'a, 'b> Shr for &'b usize
    • -
  • impl Shr for usize
    • -
  • impl<'a> Shr for &'a usize
    • -
  • impl<'a> Shr for usize
    • -
  • impl<'a, 'b> Shr for &'b usize
    • -
  • impl Shr for usize
    • -
  • impl<'a> Shr for &'a usize
    • -
  • impl<'a> Shr for usize
    • -
  • impl<'a, 'b> Shr for &'b usize
    • -
  • impl Shr for usize
    • -
  • impl<'a> Shr for &'a usize
    • -
  • impl<'a> Shr for usize
    • -
  • impl<'a, 'b> Shr for &'b usize
    • -
  • impl Shr for usize
    • -
  • impl<'a> Shr for &'a usize
    • -
  • impl<'a> Shr for usize
    • -
  • impl<'a, 'b> Shr for &'b usize
    • -
  • impl Shr for usize
    • -
  • impl<'a> Shr for &'a usize
    • -
  • impl<'a> Shr for usize
    • -
  • impl<'a, 'b> Shr for &'b usize
    • -
  • impl Shr for usize
    • -
  • impl<'a> Shr for &'a usize
    • -
  • impl<'a> Shr for usize
    • -
  • impl<'a, 'b> Shr for &'b usize
    • -
  • impl Shr for usize
    • -
  • impl<'a> Shr for &'a usize
    • -
  • impl<'a> Shr for usize
    • -
  • impl<'a, 'b> Shr for &'b usize
    • -
  • impl Shr for usize
    • -
  • impl<'a> Shr for &'a usize
    • -
  • impl<'a> Shr for usize
    • -
  • impl<'a, 'b> Shr for &'b usize
    • -
  • impl Shr for i8
    • -
  • impl<'a> Shr for &'a i8
    • -
  • impl<'a> Shr for i8
    • -
  • impl<'a, 'b> Shr for &'b i8
    • -
  • impl Shr for i8
    • -
  • impl<'a> Shr for &'a i8
    • -
  • impl<'a> Shr for i8
    • -
  • impl<'a, 'b> Shr for &'b i8
    • -
  • impl Shr for i8
    • -
  • impl<'a> Shr for &'a i8
    • -
  • impl<'a> Shr for i8
    • -
  • impl<'a, 'b> Shr for &'b i8
    • -
  • impl Shr for i8
    • -
  • impl<'a> Shr for &'a i8
    • -
  • impl<'a> Shr for i8
    • -
  • impl<'a, 'b> Shr for &'b i8
    • -
  • impl Shr for i8
    • -
  • impl<'a> Shr for &'a i8
    • -
  • impl<'a> Shr for i8
    • -
  • impl<'a, 'b> Shr for &'b i8
    • -
  • impl Shr for i8
    • -
  • impl<'a> Shr for &'a i8
    • -
  • impl<'a> Shr for i8
    • -
  • impl<'a, 'b> Shr for &'b i8
    • -
  • impl Shr for i8
    • -
  • impl<'a> Shr for &'a i8
    • -
  • impl<'a> Shr for i8
    • -
  • impl<'a, 'b> Shr for &'b i8
    • -
  • impl Shr for i8
    • -
  • impl<'a> Shr for &'a i8
    • -
  • impl<'a> Shr for i8
    • -
  • impl<'a, 'b> Shr for &'b i8
    • -
  • impl Shr for i8
    • -
  • impl<'a> Shr for &'a i8
    • -
  • impl<'a> Shr for i8
    • -
  • impl<'a, 'b> Shr for &'b i8
    • -
  • impl Shr for i8
    • -
  • impl<'a> Shr for &'a i8
    • -
  • impl<'a> Shr for i8
    • -
  • impl<'a, 'b> Shr for &'b i8
    • -
  • impl Shr for i16
    • -
  • impl<'a> Shr for &'a i16
    • -
  • impl<'a> Shr for i16
    • -
  • impl<'a, 'b> Shr for &'b i16
    • -
  • impl Shr for i16
    • -
  • impl<'a> Shr for &'a i16
    • -
  • impl<'a> Shr for i16
    • -
  • impl<'a, 'b> Shr for &'b i16
    • -
  • impl Shr for i16
    • -
  • impl<'a> Shr for &'a i16
    • -
  • impl<'a> Shr for i16
    • -
  • impl<'a, 'b> Shr for &'b i16
    • -
  • impl Shr for i16
    • -
  • impl<'a> Shr for &'a i16
    • -
  • impl<'a> Shr for i16
    • -
  • impl<'a, 'b> Shr for &'b i16
    • -
  • impl Shr for i16
    • -
  • impl<'a> Shr for &'a i16
    • -
  • impl<'a> Shr for i16
    • -
  • impl<'a, 'b> Shr for &'b i16
    • -
  • impl Shr for i16
    • -
  • impl<'a> Shr for &'a i16
    • -
  • impl<'a> Shr for i16
    • -
  • impl<'a, 'b> Shr for &'b i16
    • -
  • impl Shr for i16
    • -
  • impl<'a> Shr for &'a i16
    • -
  • impl<'a> Shr for i16
    • -
  • impl<'a, 'b> Shr for &'b i16
    • -
  • impl Shr for i16
    • -
  • impl<'a> Shr for &'a i16
    • -
  • impl<'a> Shr for i16
    • -
  • impl<'a, 'b> Shr for &'b i16
    • -
  • impl Shr for i16
    • -
  • impl<'a> Shr for &'a i16
    • -
  • impl<'a> Shr for i16
    • -
  • impl<'a, 'b> Shr for &'b i16
    • -
  • impl Shr for i16
    • -
  • impl<'a> Shr for &'a i16
    • -
  • impl<'a> Shr for i16
    • -
  • impl<'a, 'b> Shr for &'b i16
    • -
  • impl Shr for i32
    • -
  • impl<'a> Shr for &'a i32
    • -
  • impl<'a> Shr for i32
    • -
  • impl<'a, 'b> Shr for &'b i32
    • -
  • impl Shr for i32
    • -
  • impl<'a> Shr for &'a i32
    • -
  • impl<'a> Shr for i32
    • -
  • impl<'a, 'b> Shr for &'b i32
    • -
  • impl Shr for i32
    • -
  • impl<'a> Shr for &'a i32
    • -
  • impl<'a> Shr for i32
    • -
  • impl<'a, 'b> Shr for &'b i32
    • -
  • impl Shr for i32
    • -
  • impl<'a> Shr for &'a i32
    • -
  • impl<'a> Shr for i32
    • -
  • impl<'a, 'b> Shr for &'b i32
    • -
  • impl Shr for i32
    • -
  • impl<'a> Shr for &'a i32
    • -
  • impl<'a> Shr for i32
    • -
  • impl<'a, 'b> Shr for &'b i32
    • -
  • impl Shr for i32
    • -
  • impl<'a> Shr for &'a i32
    • -
  • impl<'a> Shr for i32
    • -
  • impl<'a, 'b> Shr for &'b i32
    • -
  • impl Shr for i32
    • -
  • impl<'a> Shr for &'a i32
    • -
  • impl<'a> Shr for i32
    • -
  • impl<'a, 'b> Shr for &'b i32
    • -
  • impl Shr for i32
    • -
  • impl<'a> Shr for &'a i32
    • -
  • impl<'a> Shr for i32
    • -
  • impl<'a, 'b> Shr for &'b i32
    • -
  • impl Shr for i32
    • -
  • impl<'a> Shr for &'a i32
    • -
  • impl<'a> Shr for i32
    • -
  • impl<'a, 'b> Shr for &'b i32
    • -
  • impl Shr for i32
    • -
  • impl<'a> Shr for &'a i32
    • -
  • impl<'a> Shr for i32
    • -
  • impl<'a, 'b> Shr for &'b i32
    • -
  • impl Shr for i64
    • -
  • impl<'a> Shr for &'a i64
    • -
  • impl<'a> Shr for i64
    • -
  • impl<'a, 'b> Shr for &'b i64
    • -
  • impl Shr for i64
    • -
  • impl<'a> Shr for &'a i64
    • -
  • impl<'a> Shr for i64
    • -
  • impl<'a, 'b> Shr for &'b i64
    • -
  • impl Shr for i64
    • -
  • impl<'a> Shr for &'a i64
    • -
  • impl<'a> Shr for i64
    • -
  • impl<'a, 'b> Shr for &'b i64
    • -
  • impl Shr for i64
    • -
  • impl<'a> Shr for &'a i64
    • -
  • impl<'a> Shr for i64
    • -
  • impl<'a, 'b> Shr for &'b i64
    • -
  • impl Shr for i64
    • -
  • impl<'a> Shr for &'a i64
    • -
  • impl<'a> Shr for i64
    • -
  • impl<'a, 'b> Shr for &'b i64
    • -
  • impl Shr for i64
    • -
  • impl<'a> Shr for &'a i64
    • -
  • impl<'a> Shr for i64
    • -
  • impl<'a, 'b> Shr for &'b i64
    • -
  • impl Shr for i64
    • -
  • impl<'a> Shr for &'a i64
    • -
  • impl<'a> Shr for i64
    • -
  • impl<'a, 'b> Shr for &'b i64
    • -
  • impl Shr for i64
    • -
  • impl<'a> Shr for &'a i64
    • -
  • impl<'a> Shr for i64
    • -
  • impl<'a, 'b> Shr for &'b i64
    • -
  • impl Shr for i64
    • -
  • impl<'a> Shr for &'a i64
    • -
  • impl<'a> Shr for i64
    • -
  • impl<'a, 'b> Shr for &'b i64
    • -
  • impl Shr for i64
    • -
  • impl<'a> Shr for &'a i64
    • -
  • impl<'a> Shr for i64
    • -
  • impl<'a, 'b> Shr for &'b i64
    • -
  • impl Shr for isize
    • -
  • impl<'a> Shr for &'a isize
    • -
  • impl<'a> Shr for isize
    • -
  • impl<'a, 'b> Shr for &'b isize
    • -
  • impl Shr for isize
    • -
  • impl<'a> Shr for &'a isize
    • -
  • impl<'a> Shr for isize
    • -
  • impl<'a, 'b> Shr for &'b isize
    • -
  • impl Shr for isize
    • -
  • impl<'a> Shr for &'a isize
    • -
  • impl<'a> Shr for isize
    • -
  • impl<'a, 'b> Shr for &'b isize
    • -
  • impl Shr for isize
    • -
  • impl<'a> Shr for &'a isize
    • -
  • impl<'a> Shr for isize
    • -
  • impl<'a, 'b> Shr for &'b isize
    • -
  • impl Shr for isize
    • -
  • impl<'a> Shr for &'a isize
    • -
  • impl<'a> Shr for isize
    • -
  • impl<'a, 'b> Shr for &'b isize
    • -
  • impl Shr for isize
    • -
  • impl<'a> Shr for &'a isize
    • -
  • impl<'a> Shr for isize
    • -
  • impl<'a, 'b> Shr for &'b isize
    • -
  • impl Shr for isize
    • -
  • impl<'a> Shr for &'a isize
    • -
  • impl<'a> Shr for isize
    • -
  • impl<'a, 'b> Shr for &'b isize
    • -
  • impl Shr for isize
    • -
  • impl<'a> Shr for &'a isize
    • -
  • impl<'a> Shr for isize
    • -
  • impl<'a, 'b> Shr for &'b isize
    • -
  • impl Shr for isize
    • -
  • impl<'a> Shr for &'a isize
    • -
  • impl<'a> Shr for isize
    • -
  • impl<'a, 'b> Shr for &'b isize
    • -
  • impl Shr for isize
    • -
  • impl<'a> Shr for &'a isize
    • -
  • impl<'a> Shr for isize
    • -
  • impl<'a, 'b> Shr for &'b isize
    • -
  • impl Shr for Wrapping<u8>
    • -
  • impl Shr for Wrapping<u16>
    • -
  • impl Shr for Wrapping<u32>
    • -
  • impl Shr for Wrapping<u64>
    • -
  • impl Shr for Wrapping<usize>
    • -
  • impl Shr for Wrapping<i8>
    • -
  • impl Shr for Wrapping<i16>
    • -
  • impl Shr for Wrapping<i32>
    • -
  • impl Shr for Wrapping<i64>
    • -
  • impl Shr for Wrapping<isize>
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.ShrAssign.html b/doc/bitflags/__core/ops/trait.ShrAssign.html deleted file mode 100644 index fe5e9707..00000000 --- a/doc/bitflags/__core/ops/trait.ShrAssign.html +++ /dev/null @@ -1,254 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::ShrAssign - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::ShrAssign - - [−] - - [src]

-
pub trait ShrAssign<Rhs = Self> {
-    fn shr_assign(&mut self, Rhs);
-}

The ShrAssign trait is used to specify the functionality of >>=.

- -

Examples

-

A trivial implementation of ShrAssign. When Foo >>= Foo happens, it ends up -calling shr_assign, and therefore, main prints Shifting right!.

- -
-use std::ops::ShrAssign;
-
-struct Foo;
-
-impl ShrAssign<Foo> for Foo {
-    fn shr_assign(&mut self, _rhs: Foo) {
-        println!("Shifting right!");
-    }
-}
-
-fn main() {
-    let mut foo = Foo;
-    foo >>= Foo;
-}
-
-

Required Methods

-
-

fn shr_assign(&mut self, Rhs)

The method for the >>= operator

-
-

Implementors

-
    -
  • impl ShrAssign for u8
    • -
  • impl ShrAssign for u8
    • -
  • impl ShrAssign for u8
    • -
  • impl ShrAssign for u8
    • -
  • impl ShrAssign for u8
    • -
  • impl ShrAssign for u8
    • -
  • impl ShrAssign for u8
    • -
  • impl ShrAssign for u8
    • -
  • impl ShrAssign for u8
    • -
  • impl ShrAssign for u8
    • -
  • impl ShrAssign for u16
    • -
  • impl ShrAssign for u16
    • -
  • impl ShrAssign for u16
    • -
  • impl ShrAssign for u16
    • -
  • impl ShrAssign for u16
    • -
  • impl ShrAssign for u16
    • -
  • impl ShrAssign for u16
    • -
  • impl ShrAssign for u16
    • -
  • impl ShrAssign for u16
    • -
  • impl ShrAssign for u16
    • -
  • impl ShrAssign for u32
    • -
  • impl ShrAssign for u32
    • -
  • impl ShrAssign for u32
    • -
  • impl ShrAssign for u32
    • -
  • impl ShrAssign for u32
    • -
  • impl ShrAssign for u32
    • -
  • impl ShrAssign for u32
    • -
  • impl ShrAssign for u32
    • -
  • impl ShrAssign for u32
    • -
  • impl ShrAssign for u32
    • -
  • impl ShrAssign for u64
    • -
  • impl ShrAssign for u64
    • -
  • impl ShrAssign for u64
    • -
  • impl ShrAssign for u64
    • -
  • impl ShrAssign for u64
    • -
  • impl ShrAssign for u64
    • -
  • impl ShrAssign for u64
    • -
  • impl ShrAssign for u64
    • -
  • impl ShrAssign for u64
    • -
  • impl ShrAssign for u64
    • -
  • impl ShrAssign for usize
    • -
  • impl ShrAssign for usize
    • -
  • impl ShrAssign for usize
    • -
  • impl ShrAssign for usize
    • -
  • impl ShrAssign for usize
    • -
  • impl ShrAssign for usize
    • -
  • impl ShrAssign for usize
    • -
  • impl ShrAssign for usize
    • -
  • impl ShrAssign for usize
    • -
  • impl ShrAssign for usize
    • -
  • impl ShrAssign for i8
    • -
  • impl ShrAssign for i8
    • -
  • impl ShrAssign for i8
    • -
  • impl ShrAssign for i8
    • -
  • impl ShrAssign for i8
    • -
  • impl ShrAssign for i8
    • -
  • impl ShrAssign for i8
    • -
  • impl ShrAssign for i8
    • -
  • impl ShrAssign for i8
    • -
  • impl ShrAssign for i8
    • -
  • impl ShrAssign for i16
    • -
  • impl ShrAssign for i16
    • -
  • impl ShrAssign for i16
    • -
  • impl ShrAssign for i16
    • -
  • impl ShrAssign for i16
    • -
  • impl ShrAssign for i16
    • -
  • impl ShrAssign for i16
    • -
  • impl ShrAssign for i16
    • -
  • impl ShrAssign for i16
    • -
  • impl ShrAssign for i16
    • -
  • impl ShrAssign for i32
    • -
  • impl ShrAssign for i32
    • -
  • impl ShrAssign for i32
    • -
  • impl ShrAssign for i32
    • -
  • impl ShrAssign for i32
    • -
  • impl ShrAssign for i32
    • -
  • impl ShrAssign for i32
    • -
  • impl ShrAssign for i32
    • -
  • impl ShrAssign for i32
    • -
  • impl ShrAssign for i32
    • -
  • impl ShrAssign for i64
    • -
  • impl ShrAssign for i64
    • -
  • impl ShrAssign for i64
    • -
  • impl ShrAssign for i64
    • -
  • impl ShrAssign for i64
    • -
  • impl ShrAssign for i64
    • -
  • impl ShrAssign for i64
    • -
  • impl ShrAssign for i64
    • -
  • impl ShrAssign for i64
    • -
  • impl ShrAssign for i64
    • -
  • impl ShrAssign for isize
    • -
  • impl ShrAssign for isize
    • -
  • impl ShrAssign for isize
    • -
  • impl ShrAssign for isize
    • -
  • impl ShrAssign for isize
    • -
  • impl ShrAssign for isize
    • -
  • impl ShrAssign for isize
    • -
  • impl ShrAssign for isize
    • -
  • impl ShrAssign for isize
    • -
  • impl ShrAssign for isize
    • -
  • impl ShrAssign for Wrapping<u8>
    • -
  • impl ShrAssign for Wrapping<u16>
    • -
  • impl ShrAssign for Wrapping<u32>
    • -
  • impl ShrAssign for Wrapping<u64>
    • -
  • impl ShrAssign for Wrapping<usize>
    • -
  • impl ShrAssign for Wrapping<i8>
    • -
  • impl ShrAssign for Wrapping<i16>
    • -
  • impl ShrAssign for Wrapping<i32>
    • -
  • impl ShrAssign for Wrapping<i64>
    • -
  • impl ShrAssign for Wrapping<isize>
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.Sub.html b/doc/bitflags/__core/ops/trait.Sub.html deleted file mode 100644 index f044c293..00000000 --- a/doc/bitflags/__core/ops/trait.Sub.html +++ /dev/null @@ -1,216 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::Sub - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::Sub - - [−] - - [src]

-
pub trait Sub<RHS = Self> {
-    type Output;
-    fn sub(self, rhs: RHS) -> Self::Output;
-}

The Sub trait is used to specify the functionality of -.

- -

Examples

-

A trivial implementation of Sub. When Foo - Foo happens, it ends up -calling sub, and therefore, main prints Subtracting!.

- -
-use std::ops::Sub;
-
-struct Foo;
-
-impl Sub for Foo {
-    type Output = Foo;
-
-    fn sub(self, _rhs: Foo) -> Foo {
-        println!("Subtracting!");
-        self
-    }
-}
-
-fn main() {
-    Foo - Foo;
-}
-
-

Associated Types

-
-

type Output

The resulting type after applying the - operator

-
-

Required Methods

-
-

fn sub(self, rhs: RHS) -> Self::Output

The method for the - operator

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ops/trait.SubAssign.html b/doc/bitflags/__core/ops/trait.SubAssign.html deleted file mode 100644 index 598a438e..00000000 --- a/doc/bitflags/__core/ops/trait.SubAssign.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - bitflags::__core::ops::SubAssign - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::ops::SubAssign - - [−] - - [src]

-
pub trait SubAssign<Rhs = Self> {
-    fn sub_assign(&mut self, Rhs);
-}

The SubAssign trait is used to specify the functionality of -=.

- -

Examples

-

A trivial implementation of SubAssign. When Foo -= Foo happens, it ends up -calling sub_assign, and therefore, main prints Subtracting!.

- -
-use std::ops::SubAssign;
-
-struct Foo;
-
-impl SubAssign for Foo {
-    fn sub_assign(&mut self, _rhs: Foo) {
-        println!("Subtracting!");
-    }
-}
-
-fn main() {
-    let mut foo = Foo;
-    foo -= Foo;
-}
-
-

Required Methods

-
-

fn sub_assign(&mut self, Rhs)

The method for the -= operator

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/option/enum.Option.html b/doc/bitflags/__core/option/enum.Option.html deleted file mode 100644 index ab8a8f37..00000000 --- a/doc/bitflags/__core/option/enum.Option.html +++ /dev/null @@ -1,450 +0,0 @@ - - - - - - - - - - bitflags::__core::option::Option - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::option::Option - - [−] - - [src]

-
pub enum Option<T> {
-    None,
-    Some(T),
-}
1.0.0

The Option type. See the module level documentation for more.

-

Variants

-
None

No value

-
Some

Some value T

-

Methods

impl<T> Option<T>

fn is_some(&self) -> bool

-

Returns true if the option is a Some value

- -

Examples

-
-let x: Option<u32> = Some(2);
-assert_eq!(x.is_some(), true);
-
-let x: Option<u32> = None;
-assert_eq!(x.is_some(), false);
-

fn is_none(&self) -> bool

-

Returns true if the option is a None value

- -

Examples

-
-let x: Option<u32> = Some(2);
-assert_eq!(x.is_none(), false);
-
-let x: Option<u32> = None;
-assert_eq!(x.is_none(), true);
-

fn as_ref(&self) -> Option<&T>

-

Converts from Option<T> to Option<&T>

- -

Examples

-

Convert an Option<String> into an Option<usize>, preserving the original. -The map method takes the self argument by value, consuming the original, -so this technique uses as_ref to first take an Option to a reference -to the value inside the original.

- -
-let num_as_str: Option<String> = Some("10".to_string());
-// First, cast `Option<String>` to `Option<&String>` with `as_ref`,
-// then consume *that* with `map`, leaving `num_as_str` on the stack.
-let num_as_int: Option<usize> = num_as_str.as_ref().map(|n| n.len());
-println!("still can print num_as_str: {:?}", num_as_str);
-

fn as_mut(&mut self) -> Option<&mut T>

-

Converts from Option<T> to Option<&mut T>

- -

Examples

-
-let mut x = Some(2);
-match x.as_mut() {
-    Some(v) => *v = 42,
-    None => {},
-}
-assert_eq!(x, Some(42));
-

fn expect(self, msg: &str) -> T

-

Unwraps an option, yielding the content of a Some.

- -

Panics

-

Panics if the value is a None with a custom panic message provided by -msg.

- -

Examples

-
-let x = Some("value");
-assert_eq!(x.expect("the world is ending"), "value");
- -
-let x: Option<&str> = None;
-x.expect("the world is ending"); // panics with `the world is ending`
-

fn unwrap(self) -> T

-

Moves the value v out of the Option<T> if it is Some(v).

- -

Panics

-

Panics if the self value equals None.

- -

Safety note

-

In general, because this function may panic, its use is discouraged. -Instead, prefer to use pattern matching and handle the None -case explicitly.

- -

Examples

-
-let x = Some("air");
-assert_eq!(x.unwrap(), "air");
- -
-let x: Option<&str> = None;
-assert_eq!(x.unwrap(), "air"); // fails
-

fn unwrap_or(self, def: T) -> T

-

Returns the contained value or a default.

- -

Examples

-
-assert_eq!(Some("car").unwrap_or("bike"), "car");
-assert_eq!(None.unwrap_or("bike"), "bike");
-

fn unwrap_or_else<F>(self, f: F) -> T where F: FnOnce() -> T

-

Returns the contained value or computes it from a closure.

- -

Examples

-
-let k = 10;
-assert_eq!(Some(4).unwrap_or_else(|| 2 * k), 4);
-assert_eq!(None.unwrap_or_else(|| 2 * k), 20);
-

fn map<U, F>(self, f: F) -> Option<U> where F: FnOnce(T) -> U

-

Maps an Option<T> to Option<U> by applying a function to a contained value

- -

Examples

-

Convert an Option<String> into an Option<usize>, consuming the original:

- -
-let maybe_some_string = Some(String::from("Hello, World!"));
-// `Option::map` takes self *by value*, consuming `maybe_some_string`
-let maybe_some_len = maybe_some_string.map(|s| s.len());
-
-assert_eq!(maybe_some_len, Some(13));
-

fn map_or<U, F>(self, default: U, f: F) -> U where F: FnOnce(T) -> U

-

Applies a function to the contained value (if any), -or returns a default (if not).

- -

Examples

-
-let x = Some("foo");
-assert_eq!(x.map_or(42, |v| v.len()), 3);
-
-let x: Option<&str> = None;
-assert_eq!(x.map_or(42, |v| v.len()), 42);
-

fn map_or_else<U, D, F>(self, default: D, f: F) -> U where D: FnOnce() -> U, F: FnOnce(T) -> U

-

Applies a function to the contained value (if any), -or computes a default (if not).

- -

Examples

-
-let k = 21;
-
-let x = Some("foo");
-assert_eq!(x.map_or_else(|| 2 * k, |v| v.len()), 3);
-
-let x: Option<&str> = None;
-assert_eq!(x.map_or_else(|| 2 * k, |v| v.len()), 42);
-

fn ok_or<E>(self, err: E) -> Result<T, E>

-

Transforms the Option<T> into a Result<T, E>, mapping Some(v) to -Ok(v) and None to Err(err).

- -

Examples

-
-let x = Some("foo");
-assert_eq!(x.ok_or(0), Ok("foo"));
-
-let x: Option<&str> = None;
-assert_eq!(x.ok_or(0), Err(0));
-

fn ok_or_else<E, F>(self, err: F) -> Result<T, E> where F: FnOnce() -> E

-

Transforms the Option<T> into a Result<T, E>, mapping Some(v) to -Ok(v) and None to Err(err()).

- -

Examples

-
-let x = Some("foo");
-assert_eq!(x.ok_or_else(|| 0), Ok("foo"));
-
-let x: Option<&str> = None;
-assert_eq!(x.ok_or_else(|| 0), Err(0));
-

fn iter(&self) -> Iter<T>

-

Returns an iterator over the possibly contained value.

- -

Examples

-
-let x = Some(4);
-assert_eq!(x.iter().next(), Some(&4));
-
-let x: Option<u32> = None;
-assert_eq!(x.iter().next(), None);
-

fn iter_mut(&mut self) -> IterMut<T>

-

Returns a mutable iterator over the possibly contained value.

- -

Examples

-
-let mut x = Some(4);
-match x.iter_mut().next() {
-    Some(v) => *v = 42,
-    None => {},
-}
-assert_eq!(x, Some(42));
-
-let mut x: Option<u32> = None;
-assert_eq!(x.iter_mut().next(), None);
-

fn and<U>(self, optb: Option<U>) -> Option<U>

-

Returns None if the option is None, otherwise returns optb.

- -

Examples

-
-let x = Some(2);
-let y: Option<&str> = None;
-assert_eq!(x.and(y), None);
-
-let x: Option<u32> = None;
-let y = Some("foo");
-assert_eq!(x.and(y), None);
-
-let x = Some(2);
-let y = Some("foo");
-assert_eq!(x.and(y), Some("foo"));
-
-let x: Option<u32> = None;
-let y: Option<&str> = None;
-assert_eq!(x.and(y), None);
-

fn and_then<U, F>(self, f: F) -> Option<U> where F: FnOnce(T) -> Option<U>

-

Returns None if the option is None, otherwise calls f with the -wrapped value and returns the result.

- -

Some languages call this operation flatmap.

- -

Examples

-
-fn sq(x: u32) -> Option<u32> { Some(x * x) }
-fn nope(_: u32) -> Option<u32> { None }
-
-assert_eq!(Some(2).and_then(sq).and_then(sq), Some(16));
-assert_eq!(Some(2).and_then(sq).and_then(nope), None);
-assert_eq!(Some(2).and_then(nope).and_then(sq), None);
-assert_eq!(None.and_then(sq).and_then(sq), None);
-

fn or(self, optb: Option<T>) -> Option<T>

-

Returns the option if it contains a value, otherwise returns optb.

- -

Examples

-
-let x = Some(2);
-let y = None;
-assert_eq!(x.or(y), Some(2));
-
-let x = None;
-let y = Some(100);
-assert_eq!(x.or(y), Some(100));
-
-let x = Some(2);
-let y = Some(100);
-assert_eq!(x.or(y), Some(2));
-
-let x: Option<u32> = None;
-let y = None;
-assert_eq!(x.or(y), None);
-

fn or_else<F>(self, f: F) -> Option<T> where F: FnOnce() -> Option<T>

-

Returns the option if it contains a value, otherwise calls f and -returns the result.

- -

Examples

-
-fn nobody() -> Option<&'static str> { None }
-fn vikings() -> Option<&'static str> { Some("vikings") }
-
-assert_eq!(Some("barbarians").or_else(vikings), Some("barbarians"));
-assert_eq!(None.or_else(vikings), Some("vikings"));
-assert_eq!(None.or_else(nobody), None);
-

fn take(&mut self) -> Option<T>

-

Takes the value out of the option, leaving a None in its place.

- -

Examples

-
-let mut x = Some(2);
-x.take();
-assert_eq!(x, None);
-
-let mut x: Option<u32> = None;
-x.take();
-assert_eq!(x, None);
-

impl<'a, T> Option<&'a T> where T: Clone

fn cloned(self) -> Option<T>

-

Maps an Option<&T> to an Option<T> by cloning the contents of the -option.

-

impl<T> Option<T> where T: Default

fn unwrap_or_default(self) -> T

-

Returns the contained value or a default

- -

Consumes the self argument then, if Some, returns the contained -value, otherwise if None, returns the default value for that -type.

- -

Examples

-

Convert a string to an integer, turning poorly-formed strings -into 0 (the default value for integers). parse converts -a string to any other type that implements FromStr, returning -None on error.

- -
-let good_year_from_input = "1909";
-let bad_year_from_input = "190blarg";
-let good_year = good_year_from_input.parse().ok().unwrap_or_default();
-let bad_year = bad_year_from_input.parse().ok().unwrap_or_default();
-
-assert_eq!(1909, good_year);
-assert_eq!(0, bad_year);
-

Trait Implementations

impl<T> Default for Option<T>

fn default() -> Option<T>

-

impl<T> IntoIterator for Option<T>

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Returns a consuming iterator over the possibly contained value.

- -

Examples

-
-let x = Some("string");
-let v: Vec<&str> = x.into_iter().collect();
-assert_eq!(v, ["string"]);
-
-let x = None;
-let v: Vec<&str> = x.into_iter().collect();
-assert!(v.is_empty());
-

impl<'a, T> IntoIterator for &'a Option<T>1.4.0

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<'a, T> IntoIterator for &'a mut Option<T>1.4.0

type Item = &'a mut T

-

type IntoIter = IterMut<'a, T>

-

fn into_iter(self) -> IterMut<'a, T>

-

impl<A, V> FromIterator<Option<A>> for Option<V> where V: FromIterator<A>

fn from_iter<I>(iter: I) -> Option<V> where I: IntoIterator<Item=Option<A>>

-

Takes each element in the Iterator: if it is None, no further -elements are taken, and the None is returned. Should no None occur, a -container with the values of each Option is returned.

- -

Here is an example which increments every integer in a vector, -checking for overflow:

- -
-use std::u16;
-
-let v = vec!(1, 2);
-let res: Option<Vec<u16>> = v.iter().map(|&x: &u16|
-    if x == u16::MAX { None }
-    else { Some(x + 1) }
-).collect();
-assert!(res == Some(vec!(2, 3)));
-

Derived Implementations

impl<T> Hash for Option<T> where T: Hash

fn hash<__HT>(&self, __arg_0: &mut __HT) where __HT: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<T> Debug for Option<T> where T: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<T> Ord for Option<T> where T: Ord

fn cmp(&self, __arg_0: &Option<T>) -> Ordering

-

impl<T> Eq for Option<T> where T: Eq

impl<T> PartialOrd<Option<T>> for Option<T> where T: PartialOrd<T>

fn partial_cmp(&self, __arg_0: &Option<T>) -> Option<Ordering>

-

fn lt(&self, __arg_0: &Option<T>) -> bool

-

fn le(&self, __arg_0: &Option<T>) -> bool

-

fn gt(&self, __arg_0: &Option<T>) -> bool

-

fn ge(&self, __arg_0: &Option<T>) -> bool

-

impl<T> PartialEq<Option<T>> for Option<T> where T: PartialEq<T>

fn eq(&self, __arg_0: &Option<T>) -> bool

-

fn ne(&self, __arg_0: &Option<T>) -> bool

-

impl<T> Copy for Option<T> where T: Copy

impl<T> Clone for Option<T> where T: Clone

fn clone(&self) -> Option<T>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/option/index.html b/doc/bitflags/__core/option/index.html deleted file mode 100644 index f6a3901a..00000000 --- a/doc/bitflags/__core/option/index.html +++ /dev/null @@ -1,263 +0,0 @@ - - - - - - - - - - bitflags::__core::option - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::option - - [−] - - [src]

-

Optional values.

- -

Type Option represents an optional value: every Option -is either Some and contains a value, or None, and -does not. Option types are very common in Rust code, as -they have a number of uses:

- -
    -
  • Initial values
    • -
  • Return values for functions that are not defined -over their entire input range (partial functions)
    • -
  • Return value for otherwise reporting simple errors, where None is -returned on error
    • -
  • Optional struct fields
    • -
  • Struct fields that can be loaned or "taken"
    • -
  • Optional function arguments
    • -
  • Nullable pointers
    • -
  • Swapping things out of difficult situations
    • -
- -

Options are commonly paired with pattern matching to query the presence -of a value and take action, always accounting for the None case.

- -
-fn divide(numerator: f64, denominator: f64) -> Option<f64> {
-    if denominator == 0.0 {
-        None
-    } else {
-        Some(numerator / denominator)
-    }
-}
-
-// The return value of the function is an option
-let result = divide(2.0, 3.0);
-
-// Pattern match to retrieve the value
-match result {
-    // The division was valid
-    Some(x) => println!("Result: {}", x),
-    // The division was invalid
-    None    => println!("Cannot divide by 0"),
-}
- -

Options and pointers ("nullable" pointers)

-

Rust's pointer types must always point to a valid location; there are -no "null" pointers. Instead, Rust has optional pointers, like -the optional owned box, Option<Box<T>>.

- -

The following example uses Option to create an optional box of -i32. Notice that in order to use the inner i32 value first the -check_optional function needs to use pattern matching to -determine whether the box has a value (i.e. it is Some(...)) or -not (None).

- -
-let optional: Option<Box<i32>> = None;
-check_optional(&optional);
-
-let optional: Option<Box<i32>> = Some(Box::new(9000));
-check_optional(&optional);
-
-fn check_optional(optional: &Option<Box<i32>>) {
-    match *optional {
-        Some(ref p) => println!("have value {}", p),
-        None => println!("have no value"),
-    }
-}
- -

This usage of Option to create safe nullable pointers is so -common that Rust does special optimizations to make the -representation of Option<Box<T>> a single pointer. Optional pointers -in Rust are stored as efficiently as any other pointer type.

- -

Examples

-

Basic pattern matching on Option:

- -
-let msg = Some("howdy");
-
-// Take a reference to the contained string
-if let Some(ref m) = msg {
-    println!("{}", *m);
-}
-
-// Remove the contained string, destroying the Option
-let unwrapped_msg = msg.unwrap_or("default message");
- -

Initialize a result to None before a loop:

- -
-enum Kingdom { Plant(u32, &'static str), Animal(u32, &'static str) }
-
-// A list of data to search through.
-let all_the_big_things = [
-    Kingdom::Plant(250, "redwood"),
-    Kingdom::Plant(230, "noble fir"),
-    Kingdom::Plant(229, "sugar pine"),
-    Kingdom::Animal(25, "blue whale"),
-    Kingdom::Animal(19, "fin whale"),
-    Kingdom::Animal(15, "north pacific right whale"),
-];
-
-// We're going to search for the name of the biggest animal,
-// but to start with we've just got `None`.
-let mut name_of_biggest_animal = None;
-let mut size_of_biggest_animal = 0;
-for big_thing in &all_the_big_things {
-    match *big_thing {
-        Kingdom::Animal(size, name) if size > size_of_biggest_animal => {
-            // Now we've found the name of some big animal
-            size_of_biggest_animal = size;
-            name_of_biggest_animal = Some(name);
-        }
-        Kingdom::Animal(..) | Kingdom::Plant(..) => ()
-    }
-}
-
-match name_of_biggest_animal {
-    Some(name) => println!("the biggest animal is {}", name),
-    None => println!("there are no animals :("),
-}
-

Structs

- - - - - - - - - - - - -
IntoIter -

An iterator over the item contained inside an Option.

-
Iter -

An iterator over a reference of the contained item in an Option.

-
IterMut -

An iterator over a mutable reference of the contained item in an Option.

-

Enums

- - - - -
Option -

The Option type. See the module level documentation for more.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/option/sidebar-items.js b/doc/bitflags/__core/option/sidebar-items.js deleted file mode 100644 index 2543013c..00000000 --- a/doc/bitflags/__core/option/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["Option","The `Option` type. See the module level documentation for more."]],"struct":[["IntoIter","An iterator over the item contained inside an Option."],["Iter","An iterator over a reference of the contained item in an Option."],["IterMut","An iterator over a mutable reference of the contained item in an Option."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/option/struct.IntoIter.html b/doc/bitflags/__core/option/struct.IntoIter.html deleted file mode 100644 index 8456da11..00000000 --- a/doc/bitflags/__core/option/struct.IntoIter.html +++ /dev/null @@ -1,168 +0,0 @@ - - - - - - - - - - bitflags::__core::option::IntoIter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::option::IntoIter - - [−] - - [src]

-
pub struct IntoIter<A> {
-    // some fields omitted
-}
1.0.0

An iterator over the item contained inside an Option.

-

Trait Implementations

impl<A> Iterator for IntoIter<A>

type Item = A

-

fn next(&mut self) -> Option<A>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<A> DoubleEndedIterator for IntoIter<A>

fn next_back(&mut self) -> Option<A>

-

impl<A> ExactSizeIterator for IntoIter<A>

fn len(&self) -> usize

-

Derived Implementations

impl<A> Debug for IntoIter<A> where A: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<A> Clone for IntoIter<A> where A: Clone

fn clone(&self) -> IntoIter<A>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/option/struct.Iter.html b/doc/bitflags/__core/option/struct.Iter.html deleted file mode 100644 index 7553710d..00000000 --- a/doc/bitflags/__core/option/struct.Iter.html +++ /dev/null @@ -1,168 +0,0 @@ - - - - - - - - - - bitflags::__core::option::Iter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::option::Iter - - [−] - - [src]

-
pub struct Iter<'a, A> where A: 'a {
-    // some fields omitted
-}
1.0.0

An iterator over a reference of the contained item in an Option.

-

Trait Implementations

impl<'a, A> Iterator for Iter<'a, A>

type Item = &'a A

-

fn next(&mut self) -> Option<&'a A>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, A> DoubleEndedIterator for Iter<'a, A>

fn next_back(&mut self) -> Option<&'a A>

-

impl<'a, A> ExactSizeIterator for Iter<'a, A>

fn len(&self) -> usize

-

impl<'a, A> Clone for Iter<'a, A>

fn clone(&self) -> Iter<'a, A>

-

fn clone_from(&mut self, source: &Self)

-

Derived Implementations

impl<'a, A> Debug for Iter<'a, A> where A: 'a + Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/option/struct.IterMut.html b/doc/bitflags/__core/option/struct.IterMut.html deleted file mode 100644 index 70e2fe39..00000000 --- a/doc/bitflags/__core/option/struct.IterMut.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::option::IterMut - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::option::IterMut - - [−] - - [src]

-
pub struct IterMut<'a, A> where A: 'a {
-    // some fields omitted
-}
1.0.0

An iterator over a mutable reference of the contained item in an Option.

-

Trait Implementations

impl<'a, A> Iterator for IterMut<'a, A>

type Item = &'a mut A

-

fn next(&mut self) -> Option<&'a mut A>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, A> DoubleEndedIterator for IterMut<'a, A>

fn next_back(&mut self) -> Option<&'a mut A>

-

impl<'a, A> ExactSizeIterator for IterMut<'a, A>

fn len(&self) -> usize

-

Derived Implementations

impl<'a, A> Debug for IterMut<'a, A> where A: 'a + Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/ffi/index.html b/doc/bitflags/__core/os/ext/ffi/index.html deleted file mode 100644 index c554d519..00000000 --- a/doc/bitflags/__core/os/ext/ffi/index.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::ffi - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::os::ext::ffi - - [−] - - [src]

-

Unix-specific extension to the primitives in the std::ffi module

-

Traits

- - - - - - - - -
OsStrExt -

Unix-specific extensions to OsStr.

-
OsStringExt -

Unix-specific extensions to OsString.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/ffi/sidebar-items.js b/doc/bitflags/__core/os/ext/ffi/sidebar-items.js deleted file mode 100644 index 54670d3b..00000000 --- a/doc/bitflags/__core/os/ext/ffi/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"trait":[["OsStrExt","Unix-specific extensions to `OsStr`."],["OsStringExt","Unix-specific extensions to `OsString`."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/ffi/trait.OsStrExt.html b/doc/bitflags/__core/os/ext/ffi/trait.OsStrExt.html deleted file mode 100644 index 610af2e0..00000000 --- a/doc/bitflags/__core/os/ext/ffi/trait.OsStrExt.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::ffi::OsStrExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::ffi::OsStrExt - - [−] - - [src]

-
pub trait OsStrExt {
-    fn from_bytes(slice: &[u8]) -> &Self;
-    fn as_bytes(&self) -> &[u8];
-}

Unix-specific extensions to OsStr.

-
-

Required Methods

-
-

fn from_bytes(slice: &[u8]) -> &Self

fn as_bytes(&self) -> &[u8]

Gets the underlying byte view of the OsStr slice.

-
-

Implementors

-
    -
  • impl OsStrExt for OsStr
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/ffi/trait.OsStringExt.html b/doc/bitflags/__core/os/ext/ffi/trait.OsStringExt.html deleted file mode 100644 index 6b66210a..00000000 --- a/doc/bitflags/__core/os/ext/ffi/trait.OsStringExt.html +++ /dev/null @@ -1,127 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::ffi::OsStringExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::ffi::OsStringExt - - [−] - - [src]

-
pub trait OsStringExt {
-    fn from_vec(vec: Vec<u8>) -> Self;
-    fn into_vec(self) -> Vec<u8>;
-}

Unix-specific extensions to OsString.

-
-

Required Methods

-
-

fn from_vec(vec: Vec<u8>) -> Self

Creates an OsString from a byte vector.

-

fn into_vec(self) -> Vec<u8>

Yields the underlying byte vector of this OsString.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/fs/fn.symlink.html b/doc/bitflags/__core/os/ext/fs/fn.symlink.html deleted file mode 100644 index 190b35d5..00000000 --- a/doc/bitflags/__core/os/ext/fs/fn.symlink.html +++ /dev/null @@ -1,129 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::fs::symlink - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::os::ext::fs::symlink - - [−] - - [src]

-
pub fn symlink<P, Q>(src: P, dst: Q) -> Result<(), Error> where P: AsRef<Path>, Q: AsRef<Path>
1.1.0

Creates a new symbolic link on the filesystem.

- -

The dst path will be a symbolic link pointing to the src path.

- -

Note

-

On Windows, you must specify whether a symbolic link points to a file -or directory. Use os::windows::fs::symlink_file to create a -symbolic link to a file, or os::windows::fs::symlink_dir to create a -symbolic link to a directory. Additionally, the process must have -SeCreateSymbolicLinkPrivilege in order to be able to create a -symbolic link.

- -

Examples

-
-use std::os::unix::fs;
-
-try!(fs::symlink("a.txt", "b.txt"));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/fs/index.html b/doc/bitflags/__core/os/ext/fs/index.html deleted file mode 100644 index e1183319..00000000 --- a/doc/bitflags/__core/os/ext/fs/index.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::fs - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::os::ext::fs - - [−] - - [src]

-

Unix-specific extensions to primitives in the std::fs module.

-

Traits

- - - - - - - - - - - - - - - - - - - - - - - - -
DirBuilderExt -

An extension trait for fs::DirBuilder for unix-specific options.

-
DirEntryExt -

Unix-specific extension methods for fs::DirEntry

-
FileTypeExt -

Add special unix types (block/char device, fifo and socket)

-
MetadataExt - -
OpenOptionsExt -

Unix-specific extensions to OpenOptions

-
PermissionsExt -

Unix-specific extensions to Permissions

-

Functions

- - - - -
symlink -

Creates a new symbolic link on the filesystem.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/fs/sidebar-items.js b/doc/bitflags/__core/os/ext/fs/sidebar-items.js deleted file mode 100644 index b5c4c52a..00000000 --- a/doc/bitflags/__core/os/ext/fs/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["symlink","Creates a new symbolic link on the filesystem."]],"trait":[["DirBuilderExt","An extension trait for `fs::DirBuilder` for unix-specific options."],["DirEntryExt","Unix-specific extension methods for `fs::DirEntry`"],["FileTypeExt","Add special unix types (block/char device, fifo and socket)"],["MetadataExt",""],["OpenOptionsExt","Unix-specific extensions to `OpenOptions`"],["PermissionsExt","Unix-specific extensions to `Permissions`"]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/fs/trait.DirBuilderExt.html b/doc/bitflags/__core/os/ext/fs/trait.DirBuilderExt.html deleted file mode 100644 index 50afa9b5..00000000 --- a/doc/bitflags/__core/os/ext/fs/trait.DirBuilderExt.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::fs::DirBuilderExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::fs::DirBuilderExt - - [−] - - [src]

-
pub trait DirBuilderExt {
-    fn mode(&mut self, mode: u32) -> &mut Self;
-}

An extension trait for fs::DirBuilder for unix-specific options.

-
-

Required Methods

-
-

fn mode(&mut self, mode: u32) -> &mut Self

Sets the mode to create new directories with. This option defaults to -0o777.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/fs/trait.DirEntryExt.html b/doc/bitflags/__core/os/ext/fs/trait.DirEntryExt.html deleted file mode 100644 index ddf2ae25..00000000 --- a/doc/bitflags/__core/os/ext/fs/trait.DirEntryExt.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::fs::DirEntryExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::fs::DirEntryExt - - [−] - - [src]

-
pub trait DirEntryExt {
-    fn ino(&self) -> u64;
-}

Unix-specific extension methods for fs::DirEntry

-
-

Required Methods

-
-

fn ino(&self) -> u64

Returns the underlying d_ino field in the contained dirent -structure.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/fs/trait.FileTypeExt.html b/doc/bitflags/__core/os/ext/fs/trait.FileTypeExt.html deleted file mode 100644 index e7ca31e3..00000000 --- a/doc/bitflags/__core/os/ext/fs/trait.FileTypeExt.html +++ /dev/null @@ -1,131 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::fs::FileTypeExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::fs::FileTypeExt - - [−] - - [src]

-
pub trait FileTypeExt {
-    fn is_block_device(&self) -> bool;
-    fn is_char_device(&self) -> bool;
-    fn is_fifo(&self) -> bool;
-    fn is_socket(&self) -> bool;
-}

Add special unix types (block/char device, fifo and socket)

-
-

Required Methods

-
-

fn is_block_device(&self) -> bool

Returns whether this file type is a block device.

-

fn is_char_device(&self) -> bool

Returns whether this file type is a char device.

-

fn is_fifo(&self) -> bool

Returns whether this file type is a fifo.

-

fn is_socket(&self) -> bool

Returns whether this file type is a socket.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/fs/trait.MetadataExt.html b/doc/bitflags/__core/os/ext/fs/trait.MetadataExt.html deleted file mode 100644 index d24b30c9..00000000 --- a/doc/bitflags/__core/os/ext/fs/trait.MetadataExt.html +++ /dev/null @@ -1,138 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::fs::MetadataExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::fs::MetadataExt - - [−] - - [src]

-
pub trait MetadataExt {
-    fn dev(&self) -> u64;
-    fn ino(&self) -> u64;
-    fn mode(&self) -> u32;
-    fn nlink(&self) -> u64;
-    fn uid(&self) -> u32;
-    fn gid(&self) -> u32;
-    fn rdev(&self) -> u64;
-    fn size(&self) -> u64;
-    fn atime(&self) -> i64;
-    fn atime_nsec(&self) -> i64;
-    fn mtime(&self) -> i64;
-    fn mtime_nsec(&self) -> i64;
-    fn ctime(&self) -> i64;
-    fn ctime_nsec(&self) -> i64;
-    fn blksize(&self) -> u64;
-    fn blocks(&self) -> u64;
-}
-

Required Methods

-
-

fn dev(&self) -> u64

fn ino(&self) -> u64

fn mode(&self) -> u32

fn nlink(&self) -> u64

fn uid(&self) -> u32

fn gid(&self) -> u32

fn rdev(&self) -> u64

fn size(&self) -> u64

fn atime(&self) -> i64

fn atime_nsec(&self) -> i64

fn mtime(&self) -> i64

fn mtime_nsec(&self) -> i64

fn ctime(&self) -> i64

fn ctime_nsec(&self) -> i64

fn blksize(&self) -> u64

fn blocks(&self) -> u64

-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/fs/trait.OpenOptionsExt.html b/doc/bitflags/__core/os/ext/fs/trait.OpenOptionsExt.html deleted file mode 100644 index 9e4391f3..00000000 --- a/doc/bitflags/__core/os/ext/fs/trait.OpenOptionsExt.html +++ /dev/null @@ -1,153 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::fs::OpenOptionsExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::fs::OpenOptionsExt - - [−] - - [src]

-
pub trait OpenOptionsExt {
-    fn mode(&mut self, mode: u32) -> &mut Self;
-    fn custom_flags(&mut self, flags: i32) -> &mut Self;
-}

Unix-specific extensions to OpenOptions

-
-

Required Methods

-
-

fn mode(&mut self, mode: u32) -> &mut Self

Sets the mode bits that a new file will be created with.

- -

If a new file is created as part of a File::open_opts call then this -specified mode will be used as the permission bits for the new file. -If no mode is set, the default of 0o666 will be used. -The operating system masks out bits with the systems umask, to produce -the final permissions.

-

fn custom_flags(&mut self, flags: i32) -> &mut Self

Unstable (expand_open_options)

: recently added

-

Pass custom flags to the flags agument of open.

- -

The bits that define the access mode are masked out with O_ACCMODE, to -ensure they do not interfere with the access mode set by Rusts options.

- -

Custom flags can only set flags, not remove flags set by Rusts options. -This options overwrites any previously set custom flags.

- -

Examples

-
-extern crate libc;
-use std::fs::OpenOptions;
-use std::os::unix::fs::OpenOptionsExt;
-
-let mut options = OpenOptions::new();
-options.write(true);
-if cfg!(unix) {
-    options.custom_flags(libc::O_NOFOLLOW);
-}
-let file = options.open("foo.txt");
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/fs/trait.PermissionsExt.html b/doc/bitflags/__core/os/ext/fs/trait.PermissionsExt.html deleted file mode 100644 index 45bda35c..00000000 --- a/doc/bitflags/__core/os/ext/fs/trait.PermissionsExt.html +++ /dev/null @@ -1,131 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::fs::PermissionsExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::fs::PermissionsExt - - [−] - - [src]

-
pub trait PermissionsExt {
-    fn mode(&self) -> u32;
-    fn set_mode(&mut self, mode: u32);
-    fn from_mode(mode: u32) -> Self;
-}

Unix-specific extensions to Permissions

-
-

Required Methods

-
-

fn mode(&self) -> u32

Returns the underlying raw mode_t bits that are the standard Unix -permissions for this file.

-

fn set_mode(&mut self, mode: u32)

Sets the underlying raw bits for this set of permissions.

-

fn from_mode(mode: u32) -> Self

Creates a new instance of Permissions from the given set of Unix -permission bits.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/index.html b/doc/bitflags/__core/os/ext/index.html deleted file mode 100644 index 5711eef5..00000000 --- a/doc/bitflags/__core/os/ext/index.html +++ /dev/null @@ -1,185 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::os::ext - - [−] - - [src]

-

Experimental extensions to std for Unix platforms.

- -

For now, this module is limited to extracting file descriptors, -but its functionality will grow over time.

- -

Example

-
-use std::fs::File;
-use std::os::unix::prelude::*;
-
-fn main() {
-    let f = File::create("foo.txt").unwrap();
-    let fd = f.as_raw_fd();
-
-    // use fd with native unix bindings
-}
-

Modules

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
ffi -

Unix-specific extension to the primitives in the std::ffi module

-
fs -

Unix-specific extensions to primitives in the std::fs module.

-
io -

Unix-specific extensions to general I/O primitives

-
prelude -

A prelude for conveniently writing platform-specific code.

-
process -

Unix-specific extensions to primitives in the std::process module.

-
raw - [Deprecated]

Unix-specific primitives available on all unix platforms

-
thread -

Unix-specific extensions to primitives in the std::thread module.

-
net - [Unstable]

Unix-specific networking functionality

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/io/index.html b/doc/bitflags/__core/os/ext/io/index.html deleted file mode 100644 index b1bafc8f..00000000 --- a/doc/bitflags/__core/os/ext/io/index.html +++ /dev/null @@ -1,146 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::io - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::os::ext::io - - [−] - - [src]

-

Unix-specific extensions to general I/O primitives

-

Traits

- - - - - - - - - - - - -
AsRawFd -

A trait to extract the raw unix file descriptor from an underlying -object.

-
FromRawFd -

A trait to express the ability to construct an object from a raw file -descriptor.

-
IntoRawFd -

A trait to express the ability to consume an object and acquire ownership of -its raw file descriptor.

-

Type Definitions

- - - - -
RawFd - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/io/sidebar-items.js b/doc/bitflags/__core/os/ext/io/sidebar-items.js deleted file mode 100644 index 82c50259..00000000 --- a/doc/bitflags/__core/os/ext/io/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"trait":[["AsRawFd","A trait to extract the raw unix file descriptor from an underlying object."],["FromRawFd","A trait to express the ability to construct an object from a raw file descriptor."],["IntoRawFd","A trait to express the ability to consume an object and acquire ownership of its raw file descriptor."]],"type":[["RawFd",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/io/trait.AsRawFd.html b/doc/bitflags/__core/os/ext/io/trait.AsRawFd.html deleted file mode 100644 index 6bcee5ba..00000000 --- a/doc/bitflags/__core/os/ext/io/trait.AsRawFd.html +++ /dev/null @@ -1,143 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::io::AsRawFd - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::io::AsRawFd - - [−] - - [src]

-
pub trait AsRawFd {
-    fn as_raw_fd(&self) -> i32;
-}

A trait to extract the raw unix file descriptor from an underlying -object.

- -

This is only available on unix platforms and must be imported in order -to call the method. Windows platforms have a corresponding AsRawHandle -and AsRawSocket set of traits.

-
-

Required Methods

-
-

fn as_raw_fd(&self) -> i32

Extracts the raw file descriptor.

- -

This method does not pass ownership of the raw file descriptor -to the caller. The descriptor is only guaranteed to be valid while -the original object has not yet been destroyed.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/io/trait.FromRawFd.html b/doc/bitflags/__core/os/ext/io/trait.FromRawFd.html deleted file mode 100644 index cbde6eff..00000000 --- a/doc/bitflags/__core/os/ext/io/trait.FromRawFd.html +++ /dev/null @@ -1,144 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::io::FromRawFd - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::io::FromRawFd - - [−] - - [src]

-
pub trait FromRawFd {
-    unsafe fn from_raw_fd(fd: i32) -> Self;
-}

A trait to express the ability to construct an object from a raw file -descriptor.

-
-

Required Methods

-
-

unsafe fn from_raw_fd(fd: i32) -> Self

Constructs a new instances of Self from the given raw file -descriptor.

- -

This function consumes ownership of the specified file -descriptor. The returned object will take responsibility for closing -it when the object goes out of scope.

- -

This function is also unsafe as the primitives currently returned -have the contract that they are the sole owner of the file -descriptor they are wrapping. Usage of this function could -accidentally allow violating this contract which can cause memory -unsafety in code that relies on it being true.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/io/trait.IntoRawFd.html b/doc/bitflags/__core/os/ext/io/trait.IntoRawFd.html deleted file mode 100644 index bee4bd77..00000000 --- a/doc/bitflags/__core/os/ext/io/trait.IntoRawFd.html +++ /dev/null @@ -1,139 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::io::IntoRawFd - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::io::IntoRawFd - - [−] - - [src]

-
pub trait IntoRawFd {
-    fn into_raw_fd(self) -> i32;
-}

A trait to express the ability to consume an object and acquire ownership of -its raw file descriptor.

-
-

Required Methods

-
-

fn into_raw_fd(self) -> i32

Consumes this object, returning the raw underlying file descriptor.

- -

This function transfers ownership of the underlying file descriptor -to the caller. Callers are then the unique owners of the file descriptor -and must close the descriptor once it's no longer needed.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/io/type.RawFd.html b/doc/bitflags/__core/os/ext/io/type.RawFd.html deleted file mode 100644 index f79d6d05..00000000 --- a/doc/bitflags/__core/os/ext/io/type.RawFd.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::io::RawFd - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::ext::io::RawFd - - [−] - - [src]

-
type RawFd = i32;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/net/index.html b/doc/bitflags/__core/os/ext/net/index.html deleted file mode 100644 index de583d7b..00000000 --- a/doc/bitflags/__core/os/ext/net/index.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::net - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::os::ext::net - - [−] - - [src]

-
Unstable (unix_socket)

: newly added

-

Unix-specific networking functionality

-

Structs

- - - - - - - - - - - - - - - - - - - - -
Incoming - [Unstable]

An iterator over incoming connections to a UnixListener.

-
SocketAddr - [Unstable]

An address associated with a Unix socket.

-
UnixDatagram - [Unstable]

A Unix datagram socket.

-
UnixListener - [Unstable]

A structure representing a Unix domain socket server.

-
UnixStream - [Unstable]

A Unix stream socket.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/net/sidebar-items.js b/doc/bitflags/__core/os/ext/net/sidebar-items.js deleted file mode 100644 index 3b303779..00000000 --- a/doc/bitflags/__core/os/ext/net/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["Incoming","An iterator over incoming connections to a `UnixListener`."],["SocketAddr","An address associated with a Unix socket."],["UnixDatagram","A Unix datagram socket."],["UnixListener","A structure representing a Unix domain socket server."],["UnixStream","A Unix stream socket."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/net/struct.Incoming.html b/doc/bitflags/__core/os/ext/net/struct.Incoming.html deleted file mode 100644 index 2713ada7..00000000 --- a/doc/bitflags/__core/os/ext/net/struct.Incoming.html +++ /dev/null @@ -1,171 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::net::Incoming - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::os::ext::net::Incoming - - [−] - - [src]

-
pub struct Incoming<'a> {
-    // some fields omitted
-}
Unstable (unix_socket)

: newly added

-

An iterator over incoming connections to a UnixListener.

- -

It will never return None.

-

Trait Implementations

impl<'a> Iterator for Incoming<'a>

type Item = Result<UnixStream, Error>

-
Unstable (unix_socket)

: newly added

-

fn next(&mut self) -> Option<Result<UnixStream, Error>>

-
Unstable (unix_socket)

: newly added

-

fn size_hint(&self) -> (usize, Option<usize>)

-
Unstable (unix_socket)

: newly added

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl<'a> Debug for Incoming<'a>

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/net/struct.SocketAddr.html b/doc/bitflags/__core/os/ext/net/struct.SocketAddr.html deleted file mode 100644 index 2816a275..00000000 --- a/doc/bitflags/__core/os/ext/net/struct.SocketAddr.html +++ /dev/null @@ -1,127 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::net::SocketAddr - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::os::ext::net::SocketAddr - - [−] - - [src]

-
pub struct SocketAddr {
-    // some fields omitted
-}
Unstable (unix_socket)

: newly added

-

An address associated with a Unix socket.

-

Methods

impl SocketAddr

fn is_unnamed(&self) -> bool

-
Unstable (unix_socket)

: newly added

-

Returns true iff the address is unnamed.

-

fn as_pathname(&self) -> Option<&Path>

-
Unstable (unix_socket)

: newly added

-

Returns the contents of this address if it is a pathname address.

-

Trait Implementations

impl Debug for SocketAddr

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-

Derived Implementations

impl Clone for SocketAddr

fn clone(&self) -> SocketAddr

-
Unstable (unix_socket)

: newly added

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/net/struct.UnixDatagram.html b/doc/bitflags/__core/os/ext/net/struct.UnixDatagram.html deleted file mode 100644 index 7d435149..00000000 --- a/doc/bitflags/__core/os/ext/net/struct.UnixDatagram.html +++ /dev/null @@ -1,223 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::net::UnixDatagram - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::os::ext::net::UnixDatagram - - [−] - - [src]

-
pub struct UnixDatagram(_);
Unstable (unix_socket)

: newly added

-

A Unix datagram socket.

- -

Examples

-
-#![feature(unix_socket)]
-
-use std::os::unix::net::UnixDatagram;
-
-let socket = UnixDatagram::bind("/path/to/my/socket").unwrap();
-socket.send_to(b"hello world", "/path/to/other/socket").unwrap();
-let mut buf = [0; 100];
-let (count, address) = socket.recv_from(&mut buf).unwrap();
-println!("socket {:?} sent {:?}", address, &buf[..count]);
-

Methods

impl UnixDatagram

fn bind<P>(path: P) -> Result<UnixDatagram, Error> where P: AsRef<Path>

-
Unstable (unix_socket)

: newly added

-

Creates a Unix datagram socket bound to the given path.

-

fn unbound() -> Result<UnixDatagram, Error>

-
Unstable (unix_socket)

: newly added

-

Creates a Unix Datagram socket which is not bound to any address.

-

fn pair() -> Result<(UnixDatagram, UnixDatagram), Error>

-
Unstable (unix_socket)

: newly added

-

Create an unnamed pair of connected sockets.

- -

Returns two UnixDatagramss which are connected to each other.

-

fn connect<P>(&self, path: P) -> Result<(), Error> where P: AsRef<Path>

-
Unstable (unix_socket)

: newly added

-

Connects the socket to the specified address.

- -

The send method may be used to send data to the specified address. -recv and recv_from will only receive data from that address.

-

fn try_clone(&self) -> Result<UnixDatagram, Error>

-
Unstable (unix_socket)

: newly added

-

Creates a new independently owned handle to the underlying socket.

- -

The returned UnixListener is a reference to the same socket that this -object references. Both handles can be used to accept incoming -connections and options set on one listener will affect the other.

-

fn local_addr(&self) -> Result<SocketAddr, Error>

-
Unstable (unix_socket)

: newly added

-

Returns the address of this socket.

-

fn peer_addr(&self) -> Result<SocketAddr, Error>

-
Unstable (unix_socket)

: newly added

-

Returns the address of this socket's peer.

- -

The connect method will connect the socket to a peer.

-

fn recv_from(&self, buf: &mut [u8]) -> Result<(usize, SocketAddr), Error>

-
Unstable (unix_socket)

: newly added

-

Receives data from the socket.

- -

On success, returns the number of bytes read and the address from -whence the data came.

-

fn recv(&self, buf: &mut [u8]) -> Result<usize, Error>

-
Unstable (unix_socket)

: newly added

-

Receives data from the socket.

- -

On success, returns the number of bytes read.

-

fn send_to<P>(&self, buf: &[u8], path: P) -> Result<usize, Error> where P: AsRef<Path>

-
Unstable (unix_socket)

: newly added

-

Sends data on the socket to the specified address.

- -

On success, returns the number of bytes written.

-

fn send(&self, buf: &[u8]) -> Result<usize, Error>

-
Unstable (unix_socket)

: newly added

-

Sends data on the socket to the socket's peer.

- -

The peer address may be set by the connect method, and this method -will return an error if the socket has not already been connected.

- -

On success, returns the number of bytes written.

-

fn set_read_timeout(&self, timeout: Option<Duration>) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-

Sets the read timeout for the socket.

- -

If the provided value is None, then recv and recv_from calls will -block indefinitely. It is an error to pass the zero Duration to this -method.

-

fn set_write_timeout(&self, timeout: Option<Duration>) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-

Sets the write timeout for the socket.

- -

If the provided value is None, then send and send_to calls will -block indefinitely. It is an error to pass the zero Duration to this -method.

-

fn read_timeout(&self) -> Result<Option<Duration>, Error>

-
Unstable (unix_socket)

: newly added

-

Returns the read timeout of this socket.

-

fn write_timeout(&self) -> Result<Option<Duration>, Error>

-
Unstable (unix_socket)

: newly added

-

Returns the write timeout of this socket.

-

fn set_nonblocking(&self, nonblocking: bool) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-

Moves the socket into or out of nonblocking mode.

-

fn take_error(&self) -> Result<Option<Error>, Error>

-
Unstable (unix_socket)

: newly added

-

Returns the value of the SO_ERROR option.

-

fn shutdown(&self, how: Shutdown) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-

Shut down the read, write, or both halves of this connection.

- -

This function will cause all pending and future I/O calls on the -specified portions to immediately return with an appropriate value -(see the documentation of Shutdown).

-

Trait Implementations

impl Debug for UnixDatagram

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-

impl AsRawFd for UnixDatagram

fn as_raw_fd(&self) -> i32

-
Unstable (unix_socket)

: newly added

-

impl FromRawFd for UnixDatagram

unsafe fn from_raw_fd(fd: i32) -> UnixDatagram

-
Unstable (unix_socket)

: newly added

-

impl IntoRawFd for UnixDatagram

fn into_raw_fd(self) -> i32

-
Unstable (unix_socket)

: newly added

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/net/struct.UnixListener.html b/doc/bitflags/__core/os/ext/net/struct.UnixListener.html deleted file mode 100644 index 9282e1b3..00000000 --- a/doc/bitflags/__core/os/ext/net/struct.UnixListener.html +++ /dev/null @@ -1,190 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::net::UnixListener - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::os::ext::net::UnixListener - - [−] - - [src]

-
pub struct UnixListener(_);
Unstable (unix_socket)

: newly added

-

A structure representing a Unix domain socket server.

- -

Examples

-
-#![feature(unix_socket)]
-
-use std::thread;
-use std::os::unix::net::{UnixStream, UnixListener};
-
-fn handle_client(stream: UnixStream) {
-    // ...
-}
-
-let listener = UnixListener::bind("/path/to/the/socket").unwrap();
-
-// accept connections and process them, spawning a new thread for each one
-for stream in listener.incoming() {
-    match stream {
-        Ok(stream) => {
-            /* connection succeeded */
-            thread::spawn(|| handle_client(stream));
-        }
-        Err(err) => {
-            /* connection failed */
-            break;
-        }
-    }
-}
-
-// close the listener socket
-drop(listener);
-

Methods

impl UnixListener

fn bind<P>(path: P) -> Result<UnixListener, Error> where P: AsRef<Path>

-
Unstable (unix_socket)

: newly added

-

Creates a new UnixListener bound to the specified socket.

-

fn accept(&self) -> Result<(UnixStream, SocketAddr), Error>

-
Unstable (unix_socket)

: newly added

-

Accepts a new incoming connection to this listener.

- -

This function will block the calling thread until a new Unix connection -is established. When established, the corersponding UnixStream and -the remote peer's address will be returned.

-

fn try_clone(&self) -> Result<UnixListener, Error>

-
Unstable (unix_socket)

: newly added

-

Creates a new independently owned handle to the underlying socket.

- -

The returned UnixListener is a reference to the same socket that this -object references. Both handles can be used to accept incoming -connections and options set on one listener will affect the other.

-

fn local_addr(&self) -> Result<SocketAddr, Error>

-
Unstable (unix_socket)

: newly added

-

Returns the local socket address of this listener.

-

fn set_nonblocking(&self, nonblocking: bool) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-

Moves the socket into or out of nonblocking mode.

-

fn take_error(&self) -> Result<Option<Error>, Error>

-
Unstable (unix_socket)

: newly added

-

Returns the value of the SO_ERROR option.

-

fn incoming(&'a self) -> Incoming<'a>

-
Unstable (unix_socket)

: newly added

-

Returns an iterator over incoming connections.

- -

The iterator will never return None and will also not yield the -peer's SocketAddr structure.

-

Trait Implementations

impl Debug for UnixListener

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-

impl AsRawFd for UnixListener

fn as_raw_fd(&self) -> i32

-
Unstable (unix_socket)

: newly added

-

impl FromRawFd for UnixListener

unsafe fn from_raw_fd(fd: i32) -> UnixListener

-
Unstable (unix_socket)

: newly added

-

impl IntoRawFd for UnixListener

fn into_raw_fd(self) -> i32

-
Unstable (unix_socket)

: newly added

-

impl<'a> IntoIterator for &'a UnixListener

type Item = Result<UnixStream, Error>

-
Unstable (unix_socket)

: newly added

-

type IntoIter = Incoming<'a>

-
Unstable (unix_socket)

: newly added

-

fn into_iter(self) -> Incoming<'a>

-
Unstable (unix_socket)

: newly added

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/net/struct.UnixStream.html b/doc/bitflags/__core/os/ext/net/struct.UnixStream.html deleted file mode 100644 index 449c41f3..00000000 --- a/doc/bitflags/__core/os/ext/net/struct.UnixStream.html +++ /dev/null @@ -1,226 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::net::UnixStream - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::os::ext::net::UnixStream - - [−] - - [src]

-
pub struct UnixStream(_);
Unstable (unix_socket)

: newly added

-

A Unix stream socket.

- -

Examples

-
-#![feature(unix_socket)]
-
-use std::os::unix::net::UnixStream;
-use std::io::prelude::*;
-
-let mut stream = UnixStream::connect("/path/to/my/socket").unwrap();
-stream.write_all(b"hello world").unwrap();
-let mut response = String::new();
-stream.read_to_string(&mut response).unwrap();
-println!("{}", response);
-

Methods

impl UnixStream

fn connect<P>(path: P) -> Result<UnixStream, Error> where P: AsRef<Path>

-
Unstable (unix_socket)

: newly added

-

Connects to the socket named by path.

-

fn pair() -> Result<(UnixStream, UnixStream), Error>

-
Unstable (unix_socket)

: newly added

-

Creates an unnamed pair of connected sockets.

- -

Returns two UnixStreams which are connected to each other.

-

fn try_clone(&self) -> Result<UnixStream, Error>

-
Unstable (unix_socket)

: newly added

-

Creates a new independently owned handle to the underlying socket.

- -

The returned UnixStream is a reference to the same stream that this -object references. Both handles will read and write the same stream of -data, and options set on one stream will be propogated to the other -stream.

-

fn local_addr(&self) -> Result<SocketAddr, Error>

-
Unstable (unix_socket)

: newly added

-

Returns the socket address of the local half of this connection.

-

fn peer_addr(&self) -> Result<SocketAddr, Error>

-
Unstable (unix_socket)

: newly added

-

Returns the socket address of the remote half of this connection.

-

fn set_read_timeout(&self, timeout: Option<Duration>) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-

Sets the read timeout for the socket.

- -

If the provided value is None, then read calls will block -indefinitely. It is an error to pass the zero Duration to this -method.

-

fn set_write_timeout(&self, timeout: Option<Duration>) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-

Sets the write timeout for the socket.

- -

If the provided value is None, then write calls will block -indefinitely. It is an error to pass the zero Duration to this -method.

-

fn read_timeout(&self) -> Result<Option<Duration>, Error>

-
Unstable (unix_socket)

: newly added

-

Returns the read timeout of this socket.

-

fn write_timeout(&self) -> Result<Option<Duration>, Error>

-
Unstable (unix_socket)

: newly added

-

Returns the write timeout of this socket.

-

fn set_nonblocking(&self, nonblocking: bool) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-

Moves the socket into or out of nonblocking mode.

-

fn take_error(&self) -> Result<Option<Error>, Error>

-
Unstable (unix_socket)

: newly added

-

Returns the value of the SO_ERROR option.

-

fn shutdown(&self, how: Shutdown) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-

Shuts down the read, write, or both halves of this connection.

- -

This function will cause all pending and future I/O calls on the -specified portions to immediately return with an appropriate value -(see the documentation of Shutdown).

-

Trait Implementations

impl Debug for UnixStream

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-

impl Read for UnixStream

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-
Unstable (unix_socket)

: newly added

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-
Unstable (unix_socket)

: newly added

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>1.0.0

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn bytes(self) -> Bytes<Self>1.0.0

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read1.0.0

-

fn take(self, limit: u64) -> Take<Self>1.0.0

-

impl<'a> Read for &'a UnixStream

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-
Unstable (unix_socket)

: newly added

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-
Unstable (unix_socket)

: newly added

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>1.0.0

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn bytes(self) -> Bytes<Self>1.0.0

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read1.0.0

-

fn take(self, limit: u64) -> Take<Self>1.0.0

-

impl Write for UnixStream

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-
Unstable (unix_socket)

: newly added

-

fn flush(&mut self) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>1.0.0

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

impl<'a> Write for &'a UnixStream

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-
Unstable (unix_socket)

: newly added

-

fn flush(&mut self) -> Result<(), Error>

-
Unstable (unix_socket)

: newly added

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>1.0.0

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

impl AsRawFd for UnixStream

fn as_raw_fd(&self) -> i32

-
Unstable (unix_socket)

: newly added

-

impl FromRawFd for UnixStream

unsafe fn from_raw_fd(fd: i32) -> UnixStream

-
Unstable (unix_socket)

: newly added

-

impl IntoRawFd for UnixStream

fn into_raw_fd(self) -> i32

-
Unstable (unix_socket)

: newly added

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/index.html b/doc/bitflags/__core/os/ext/prelude/index.html deleted file mode 100644 index 6e7a4e8a..00000000 --- a/doc/bitflags/__core/os/ext/prelude/index.html +++ /dev/null @@ -1,218 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::prelude - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::os::ext::prelude - - [−] - - [src]

-

A prelude for conveniently writing platform-specific code.

- -

Includes all extension traits, and some important type definitions.

-

Traits

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
AsRawFd -

A trait to extract the raw unix file descriptor from an underlying -object.

-
CommandExt -

Unix-specific extensions to the std::process::Command builder

-
DirEntryExt -

Unix-specific extension methods for fs::DirEntry

-
ExitStatusExt -

Unix-specific extensions to std::process::ExitStatus

-
FileTypeExt -

Add special unix types (block/char device, fifo and socket)

-
FromRawFd -

A trait to express the ability to construct an object from a raw file -descriptor.

-
IntoRawFd -

A trait to express the ability to consume an object and acquire ownership of -its raw file descriptor.

-
JoinHandleExt -

Unix-specific extensions to std::thread::JoinHandle

-
MetadataExt - -
OpenOptionsExt -

Unix-specific extensions to OpenOptions

-
OsStrExt -

Unix-specific extensions to OsStr.

-
OsStringExt -

Unix-specific extensions to OsString.

-
PermissionsExt -

Unix-specific extensions to Permissions

-

Type Definitions

- - - - -
RawFd - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/sidebar-items.js b/doc/bitflags/__core/os/ext/prelude/sidebar-items.js deleted file mode 100644 index 7564ef29..00000000 --- a/doc/bitflags/__core/os/ext/prelude/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"trait":[["AsRawFd","A trait to extract the raw unix file descriptor from an underlying object."],["CommandExt","Unix-specific extensions to the `std::process::Command` builder"],["DirEntryExt","Unix-specific extension methods for `fs::DirEntry`"],["ExitStatusExt","Unix-specific extensions to `std::process::ExitStatus`"],["FileTypeExt","Add special unix types (block/char device, fifo and socket)"],["FromRawFd","A trait to express the ability to construct an object from a raw file descriptor."],["IntoRawFd","A trait to express the ability to consume an object and acquire ownership of its raw file descriptor."],["JoinHandleExt","Unix-specific extensions to `std::thread::JoinHandle`"],["MetadataExt",""],["OpenOptionsExt","Unix-specific extensions to `OpenOptions`"],["OsStrExt","Unix-specific extensions to `OsStr`."],["OsStringExt","Unix-specific extensions to `OsString`."],["PermissionsExt","Unix-specific extensions to `Permissions`"]],"type":[["RawFd",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/trait.AsRawFd.html b/doc/bitflags/__core/os/ext/prelude/trait.AsRawFd.html deleted file mode 100644 index 0d7aee7a..00000000 --- a/doc/bitflags/__core/os/ext/prelude/trait.AsRawFd.html +++ /dev/null @@ -1,143 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::prelude::AsRawFd - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::prelude::AsRawFd - - [−] - - [src]

-
pub trait AsRawFd {
-    fn as_raw_fd(&self) -> i32;
-}

A trait to extract the raw unix file descriptor from an underlying -object.

- -

This is only available on unix platforms and must be imported in order -to call the method. Windows platforms have a corresponding AsRawHandle -and AsRawSocket set of traits.

-
-

Required Methods

-
-

fn as_raw_fd(&self) -> i32

Extracts the raw file descriptor.

- -

This method does not pass ownership of the raw file descriptor -to the caller. The descriptor is only guaranteed to be valid while -the original object has not yet been destroyed.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/trait.CommandExt.html b/doc/bitflags/__core/os/ext/prelude/trait.CommandExt.html deleted file mode 100644 index 1d9869ce..00000000 --- a/doc/bitflags/__core/os/ext/prelude/trait.CommandExt.html +++ /dev/null @@ -1,185 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::prelude::CommandExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::prelude::CommandExt - - [−] - - [src]

-
pub trait CommandExt {
-    fn uid(&mut self, id: u32) -> &mut Command;
-    fn gid(&mut self, id: u32) -> &mut Command;
-    fn session_leader(&mut self, on: bool) -> &mut Command;
-    fn before_exec<F>(&mut self, f: F) -> &mut Command where F: FnMut() -> Result<(), Error> + Send + Sync + 'static;
-    fn exec(&mut self) -> Error;
-}

Unix-specific extensions to the std::process::Command builder

-
-

Required Methods

-
-

fn uid(&mut self, id: u32) -> &mut Command

Sets the child process's user id. This translates to a -setuid call in the child process. Failure in the setuid -call will cause the spawn to fail.

-

fn gid(&mut self, id: u32) -> &mut Command

Similar to uid, but sets the group id of the child process. This has -the same semantics as the uid field.

-

fn session_leader(&mut self, on: bool) -> &mut Command

Deprecated since 1.9.0

: use before_exec instead

-
Unstable (process_session_leader)

: use before_exec instead

-

Create a new session (cf. setsid(2)) for the child process. This means -that the child is the leader of a new process group. The parent process -remains the child reaper of the new process.

- -

This is not enough to create a daemon process. The init process should -be the child reaper of a daemon. This can be achieved if the parent -process exit. Moreover, a daemon should not have a controlling terminal. -To achieve this, a session leader (the child) must spawn another process -(the daemon) in the same session.

-

fn before_exec<F>(&mut self, f: F) -> &mut Command where F: FnMut() -> Result<(), Error> + Send + Sync + 'static

Unstable (process_exec)

Schedules a closure to be run just before the exec function is -invoked.

- -

The closure is allowed to return an I/O error whose OS error code will -be communicated back to the parent and returned as an error from when -the spawn was requested.

- -

Multiple closures can be registered and they will be called in order of -their registration. If a closure returns Err then no further closures -will be called and the spawn operation will immediately return with a -failure.

- -

Notes

-

This closure will be run in the context of the child process after a -fork. This primarily means that any modificatons made to memory on -behalf of this closure will not be visible to the parent process. -This is often a very constrained environment where normal operations -like malloc or acquiring a mutex are not guaranteed to work (due to -other threads perhaps still running when the fork was run).

- -

When this closure is run, aspects such as the stdio file descriptors and -working directory have successfully been changed, so output to these -locations may not appear where intended.

-

fn exec(&mut self) -> Error1.9.0

Performs all the required setup by this Command, followed by calling -the execvp syscall.

- -

On success this function will not return, and otherwise it will return -an error indicating why the exec (or another part of the setup of the -Command) failed.

- -

This function, unlike spawn, will not fork the process to create -a new child. Like spawn, however, the default behavior for the stdio -descriptors will be to inherited from the current process.

- -

Notes

-

The process may be in a "broken state" if this function returns in -error. For example the working directory, environment variables, signal -handling settings, various user/group information, or aspects of stdio -file descriptors may have changed. If a "transactional spawn" is -required to gracefully handle errors it is recommended to use the -cross-platform spawn instead.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/trait.DirEntryExt.html b/doc/bitflags/__core/os/ext/prelude/trait.DirEntryExt.html deleted file mode 100644 index f8d9af99..00000000 --- a/doc/bitflags/__core/os/ext/prelude/trait.DirEntryExt.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::prelude::DirEntryExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::prelude::DirEntryExt - - [−] - - [src]

-
pub trait DirEntryExt {
-    fn ino(&self) -> u64;
-}

Unix-specific extension methods for fs::DirEntry

-
-

Required Methods

-
-

fn ino(&self) -> u64

Returns the underlying d_ino field in the contained dirent -structure.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/trait.ExitStatusExt.html b/doc/bitflags/__core/os/ext/prelude/trait.ExitStatusExt.html deleted file mode 100644 index a42cdb00..00000000 --- a/doc/bitflags/__core/os/ext/prelude/trait.ExitStatusExt.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::prelude::ExitStatusExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::prelude::ExitStatusExt - - [−] - - [src]

-
pub trait ExitStatusExt {
-    fn signal(&self) -> Option<i32>;
-}

Unix-specific extensions to std::process::ExitStatus

-
-

Required Methods

-
-

fn signal(&self) -> Option<i32>

If the process was terminated by a signal, returns that signal.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/trait.FileTypeExt.html b/doc/bitflags/__core/os/ext/prelude/trait.FileTypeExt.html deleted file mode 100644 index 9bd5fb22..00000000 --- a/doc/bitflags/__core/os/ext/prelude/trait.FileTypeExt.html +++ /dev/null @@ -1,131 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::prelude::FileTypeExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::prelude::FileTypeExt - - [−] - - [src]

-
pub trait FileTypeExt {
-    fn is_block_device(&self) -> bool;
-    fn is_char_device(&self) -> bool;
-    fn is_fifo(&self) -> bool;
-    fn is_socket(&self) -> bool;
-}

Add special unix types (block/char device, fifo and socket)

-
-

Required Methods

-
-

fn is_block_device(&self) -> bool

Returns whether this file type is a block device.

-

fn is_char_device(&self) -> bool

Returns whether this file type is a char device.

-

fn is_fifo(&self) -> bool

Returns whether this file type is a fifo.

-

fn is_socket(&self) -> bool

Returns whether this file type is a socket.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/trait.FromRawFd.html b/doc/bitflags/__core/os/ext/prelude/trait.FromRawFd.html deleted file mode 100644 index fd4a22b5..00000000 --- a/doc/bitflags/__core/os/ext/prelude/trait.FromRawFd.html +++ /dev/null @@ -1,144 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::prelude::FromRawFd - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::prelude::FromRawFd - - [−] - - [src]

-
pub trait FromRawFd {
-    unsafe fn from_raw_fd(fd: i32) -> Self;
-}

A trait to express the ability to construct an object from a raw file -descriptor.

-
-

Required Methods

-
-

unsafe fn from_raw_fd(fd: i32) -> Self

Constructs a new instances of Self from the given raw file -descriptor.

- -

This function consumes ownership of the specified file -descriptor. The returned object will take responsibility for closing -it when the object goes out of scope.

- -

This function is also unsafe as the primitives currently returned -have the contract that they are the sole owner of the file -descriptor they are wrapping. Usage of this function could -accidentally allow violating this contract which can cause memory -unsafety in code that relies on it being true.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/trait.IntoRawFd.html b/doc/bitflags/__core/os/ext/prelude/trait.IntoRawFd.html deleted file mode 100644 index 866333ac..00000000 --- a/doc/bitflags/__core/os/ext/prelude/trait.IntoRawFd.html +++ /dev/null @@ -1,139 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::prelude::IntoRawFd - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::prelude::IntoRawFd - - [−] - - [src]

-
pub trait IntoRawFd {
-    fn into_raw_fd(self) -> i32;
-}

A trait to express the ability to consume an object and acquire ownership of -its raw file descriptor.

-
-

Required Methods

-
-

fn into_raw_fd(self) -> i32

Consumes this object, returning the raw underlying file descriptor.

- -

This function transfers ownership of the underlying file descriptor -to the caller. Callers are then the unique owners of the file descriptor -and must close the descriptor once it's no longer needed.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/trait.JoinHandleExt.html b/doc/bitflags/__core/os/ext/prelude/trait.JoinHandleExt.html deleted file mode 100644 index 2b9d6395..00000000 --- a/doc/bitflags/__core/os/ext/prelude/trait.JoinHandleExt.html +++ /dev/null @@ -1,131 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::prelude::JoinHandleExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::prelude::JoinHandleExt - - [−] - - [src]

-
pub trait JoinHandleExt {
-    fn as_pthread_t(&self) -> usize;
-    fn into_pthread_t(self) -> usize;
-}

Unix-specific extensions to std::thread::JoinHandle

-
-

Required Methods

-
-

fn as_pthread_t(&self) -> usize

Extracts the raw pthread_t without taking ownership

-

fn into_pthread_t(self) -> usize

Consumes the thread, returning the raw pthread_t

- -

This function transfers ownership of the underlying pthread_t to -the caller. Callers are then the unique owners of the pthread_t and -must either detach or join the pthread_t once it's no longer needed.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/trait.MetadataExt.html b/doc/bitflags/__core/os/ext/prelude/trait.MetadataExt.html deleted file mode 100644 index bbe00850..00000000 --- a/doc/bitflags/__core/os/ext/prelude/trait.MetadataExt.html +++ /dev/null @@ -1,138 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::prelude::MetadataExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::prelude::MetadataExt - - [−] - - [src]

-
pub trait MetadataExt {
-    fn dev(&self) -> u64;
-    fn ino(&self) -> u64;
-    fn mode(&self) -> u32;
-    fn nlink(&self) -> u64;
-    fn uid(&self) -> u32;
-    fn gid(&self) -> u32;
-    fn rdev(&self) -> u64;
-    fn size(&self) -> u64;
-    fn atime(&self) -> i64;
-    fn atime_nsec(&self) -> i64;
-    fn mtime(&self) -> i64;
-    fn mtime_nsec(&self) -> i64;
-    fn ctime(&self) -> i64;
-    fn ctime_nsec(&self) -> i64;
-    fn blksize(&self) -> u64;
-    fn blocks(&self) -> u64;
-}
-

Required Methods

-
-

fn dev(&self) -> u64

fn ino(&self) -> u64

fn mode(&self) -> u32

fn nlink(&self) -> u64

fn uid(&self) -> u32

fn gid(&self) -> u32

fn rdev(&self) -> u64

fn size(&self) -> u64

fn atime(&self) -> i64

fn atime_nsec(&self) -> i64

fn mtime(&self) -> i64

fn mtime_nsec(&self) -> i64

fn ctime(&self) -> i64

fn ctime_nsec(&self) -> i64

fn blksize(&self) -> u64

fn blocks(&self) -> u64

-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/trait.OpenOptionsExt.html b/doc/bitflags/__core/os/ext/prelude/trait.OpenOptionsExt.html deleted file mode 100644 index 6f64b25e..00000000 --- a/doc/bitflags/__core/os/ext/prelude/trait.OpenOptionsExt.html +++ /dev/null @@ -1,153 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::prelude::OpenOptionsExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::prelude::OpenOptionsExt - - [−] - - [src]

-
pub trait OpenOptionsExt {
-    fn mode(&mut self, mode: u32) -> &mut Self;
-    fn custom_flags(&mut self, flags: i32) -> &mut Self;
-}

Unix-specific extensions to OpenOptions

-
-

Required Methods

-
-

fn mode(&mut self, mode: u32) -> &mut Self

Sets the mode bits that a new file will be created with.

- -

If a new file is created as part of a File::open_opts call then this -specified mode will be used as the permission bits for the new file. -If no mode is set, the default of 0o666 will be used. -The operating system masks out bits with the systems umask, to produce -the final permissions.

-

fn custom_flags(&mut self, flags: i32) -> &mut Self

Unstable (expand_open_options)

: recently added

-

Pass custom flags to the flags agument of open.

- -

The bits that define the access mode are masked out with O_ACCMODE, to -ensure they do not interfere with the access mode set by Rusts options.

- -

Custom flags can only set flags, not remove flags set by Rusts options. -This options overwrites any previously set custom flags.

- -

Examples

-
-extern crate libc;
-use std::fs::OpenOptions;
-use std::os::unix::fs::OpenOptionsExt;
-
-let mut options = OpenOptions::new();
-options.write(true);
-if cfg!(unix) {
-    options.custom_flags(libc::O_NOFOLLOW);
-}
-let file = options.open("foo.txt");
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/trait.OsStrExt.html b/doc/bitflags/__core/os/ext/prelude/trait.OsStrExt.html deleted file mode 100644 index cb88ad27..00000000 --- a/doc/bitflags/__core/os/ext/prelude/trait.OsStrExt.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::prelude::OsStrExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::prelude::OsStrExt - - [−] - - [src]

-
pub trait OsStrExt {
-    fn from_bytes(slice: &[u8]) -> &Self;
-    fn as_bytes(&self) -> &[u8];
-}

Unix-specific extensions to OsStr.

-
-

Required Methods

-
-

fn from_bytes(slice: &[u8]) -> &Self

fn as_bytes(&self) -> &[u8]

Gets the underlying byte view of the OsStr slice.

-
-

Implementors

-
    -
  • impl OsStrExt for OsStr
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/trait.OsStringExt.html b/doc/bitflags/__core/os/ext/prelude/trait.OsStringExt.html deleted file mode 100644 index befb6c0c..00000000 --- a/doc/bitflags/__core/os/ext/prelude/trait.OsStringExt.html +++ /dev/null @@ -1,127 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::prelude::OsStringExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::prelude::OsStringExt - - [−] - - [src]

-
pub trait OsStringExt {
-    fn from_vec(vec: Vec<u8>) -> Self;
-    fn into_vec(self) -> Vec<u8>;
-}

Unix-specific extensions to OsString.

-
-

Required Methods

-
-

fn from_vec(vec: Vec<u8>) -> Self

Creates an OsString from a byte vector.

-

fn into_vec(self) -> Vec<u8>

Yields the underlying byte vector of this OsString.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/trait.PermissionsExt.html b/doc/bitflags/__core/os/ext/prelude/trait.PermissionsExt.html deleted file mode 100644 index 65f7468b..00000000 --- a/doc/bitflags/__core/os/ext/prelude/trait.PermissionsExt.html +++ /dev/null @@ -1,131 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::prelude::PermissionsExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::prelude::PermissionsExt - - [−] - - [src]

-
pub trait PermissionsExt {
-    fn mode(&self) -> u32;
-    fn set_mode(&mut self, mode: u32);
-    fn from_mode(mode: u32) -> Self;
-}

Unix-specific extensions to Permissions

-
-

Required Methods

-
-

fn mode(&self) -> u32

Returns the underlying raw mode_t bits that are the standard Unix -permissions for this file.

-

fn set_mode(&mut self, mode: u32)

Sets the underlying raw bits for this set of permissions.

-

fn from_mode(mode: u32) -> Self

Creates a new instance of Permissions from the given set of Unix -permission bits.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/prelude/type.RawFd.html b/doc/bitflags/__core/os/ext/prelude/type.RawFd.html deleted file mode 100644 index fc88ae21..00000000 --- a/doc/bitflags/__core/os/ext/prelude/type.RawFd.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::prelude::RawFd - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::ext::prelude::RawFd - - [−] - - [src]

-
type RawFd = i32;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/process/index.html b/doc/bitflags/__core/os/ext/process/index.html deleted file mode 100644 index 68d8046f..00000000 --- a/doc/bitflags/__core/os/ext/process/index.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::process - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::os::ext::process - - [−] - - [src]

-

Unix-specific extensions to primitives in the std::process module.

-

Traits

- - - - - - - - -
CommandExt -

Unix-specific extensions to the std::process::Command builder

-
ExitStatusExt -

Unix-specific extensions to std::process::ExitStatus

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/process/sidebar-items.js b/doc/bitflags/__core/os/ext/process/sidebar-items.js deleted file mode 100644 index e106c93a..00000000 --- a/doc/bitflags/__core/os/ext/process/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"trait":[["CommandExt","Unix-specific extensions to the `std::process::Command` builder"],["ExitStatusExt","Unix-specific extensions to `std::process::ExitStatus`"]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/process/trait.CommandExt.html b/doc/bitflags/__core/os/ext/process/trait.CommandExt.html deleted file mode 100644 index 7f36f282..00000000 --- a/doc/bitflags/__core/os/ext/process/trait.CommandExt.html +++ /dev/null @@ -1,185 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::process::CommandExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::process::CommandExt - - [−] - - [src]

-
pub trait CommandExt {
-    fn uid(&mut self, id: u32) -> &mut Command;
-    fn gid(&mut self, id: u32) -> &mut Command;
-    fn session_leader(&mut self, on: bool) -> &mut Command;
-    fn before_exec<F>(&mut self, f: F) -> &mut Command where F: FnMut() -> Result<(), Error> + Send + Sync + 'static;
-    fn exec(&mut self) -> Error;
-}

Unix-specific extensions to the std::process::Command builder

-
-

Required Methods

-
-

fn uid(&mut self, id: u32) -> &mut Command

Sets the child process's user id. This translates to a -setuid call in the child process. Failure in the setuid -call will cause the spawn to fail.

-

fn gid(&mut self, id: u32) -> &mut Command

Similar to uid, but sets the group id of the child process. This has -the same semantics as the uid field.

-

fn session_leader(&mut self, on: bool) -> &mut Command

Deprecated since 1.9.0

: use before_exec instead

-
Unstable (process_session_leader)

: use before_exec instead

-

Create a new session (cf. setsid(2)) for the child process. This means -that the child is the leader of a new process group. The parent process -remains the child reaper of the new process.

- -

This is not enough to create a daemon process. The init process should -be the child reaper of a daemon. This can be achieved if the parent -process exit. Moreover, a daemon should not have a controlling terminal. -To achieve this, a session leader (the child) must spawn another process -(the daemon) in the same session.

-

fn before_exec<F>(&mut self, f: F) -> &mut Command where F: FnMut() -> Result<(), Error> + Send + Sync + 'static

Unstable (process_exec)

Schedules a closure to be run just before the exec function is -invoked.

- -

The closure is allowed to return an I/O error whose OS error code will -be communicated back to the parent and returned as an error from when -the spawn was requested.

- -

Multiple closures can be registered and they will be called in order of -their registration. If a closure returns Err then no further closures -will be called and the spawn operation will immediately return with a -failure.

- -

Notes

-

This closure will be run in the context of the child process after a -fork. This primarily means that any modificatons made to memory on -behalf of this closure will not be visible to the parent process. -This is often a very constrained environment where normal operations -like malloc or acquiring a mutex are not guaranteed to work (due to -other threads perhaps still running when the fork was run).

- -

When this closure is run, aspects such as the stdio file descriptors and -working directory have successfully been changed, so output to these -locations may not appear where intended.

-

fn exec(&mut self) -> Error1.9.0

Performs all the required setup by this Command, followed by calling -the execvp syscall.

- -

On success this function will not return, and otherwise it will return -an error indicating why the exec (or another part of the setup of the -Command) failed.

- -

This function, unlike spawn, will not fork the process to create -a new child. Like spawn, however, the default behavior for the stdio -descriptors will be to inherited from the current process.

- -

Notes

-

The process may be in a "broken state" if this function returns in -error. For example the working directory, environment variables, signal -handling settings, various user/group information, or aspects of stdio -file descriptors may have changed. If a "transactional spawn" is -required to gracefully handle errors it is recommended to use the -cross-platform spawn instead.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/process/trait.ExitStatusExt.html b/doc/bitflags/__core/os/ext/process/trait.ExitStatusExt.html deleted file mode 100644 index 1b53355d..00000000 --- a/doc/bitflags/__core/os/ext/process/trait.ExitStatusExt.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::process::ExitStatusExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::process::ExitStatusExt - - [−] - - [src]

-
pub trait ExitStatusExt {
-    fn signal(&self) -> Option<i32>;
-}

Unix-specific extensions to std::process::ExitStatus

-
-

Required Methods

-
-

fn signal(&self) -> Option<i32>

If the process was terminated by a signal, returns that signal.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/raw/index.html b/doc/bitflags/__core/os/ext/raw/index.html deleted file mode 100644 index 321cb8e0..00000000 --- a/doc/bitflags/__core/os/ext/raw/index.html +++ /dev/null @@ -1,199 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::raw - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::os::ext::raw - - [−] - - [src]

-
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-

Unix-specific primitives available on all unix platforms

-

Type Definitions

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
blkcnt_t - [Deprecated] -
blksize_t - [Deprecated] -
dev_t - [Deprecated] -
gid_t - [Deprecated] -
ino_t - [Deprecated] -
mode_t - [Deprecated] -
nlink_t - [Deprecated] -
off_t - [Deprecated] -
pid_t - [Deprecated] -
time_t - [Deprecated] -
uid_t - [Deprecated] -
pthread_t - [Deprecated] [Unstable] -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/raw/sidebar-items.js b/doc/bitflags/__core/os/ext/raw/sidebar-items.js deleted file mode 100644 index 1c527ef4..00000000 --- a/doc/bitflags/__core/os/ext/raw/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"type":[["blkcnt_t",""],["blksize_t",""],["dev_t",""],["gid_t",""],["ino_t",""],["mode_t",""],["nlink_t",""],["off_t",""],["pid_t",""],["pthread_t",""],["time_t",""],["uid_t",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/raw/type.blkcnt_t.html b/doc/bitflags/__core/os/ext/raw/type.blkcnt_t.html deleted file mode 100644 index d9fb19ef..00000000 --- a/doc/bitflags/__core/os/ext/raw/type.blkcnt_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::raw::blkcnt_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::ext::raw::blkcnt_t - - [−] - - [src]

-
type blkcnt_t = u64;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/raw/type.blksize_t.html b/doc/bitflags/__core/os/ext/raw/type.blksize_t.html deleted file mode 100644 index 67a58eff..00000000 --- a/doc/bitflags/__core/os/ext/raw/type.blksize_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::raw::blksize_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::ext::raw::blksize_t - - [−] - - [src]

-
type blksize_t = u64;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/raw/type.dev_t.html b/doc/bitflags/__core/os/ext/raw/type.dev_t.html deleted file mode 100644 index fd97ee2b..00000000 --- a/doc/bitflags/__core/os/ext/raw/type.dev_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::raw::dev_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::ext::raw::dev_t - - [−] - - [src]

-
type dev_t = u64;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/raw/type.gid_t.html b/doc/bitflags/__core/os/ext/raw/type.gid_t.html deleted file mode 100644 index 540de960..00000000 --- a/doc/bitflags/__core/os/ext/raw/type.gid_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::raw::gid_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::ext::raw::gid_t - - [−] - - [src]

-
type gid_t = u32;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/raw/type.ino_t.html b/doc/bitflags/__core/os/ext/raw/type.ino_t.html deleted file mode 100644 index c1a2966c..00000000 --- a/doc/bitflags/__core/os/ext/raw/type.ino_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::raw::ino_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::ext::raw::ino_t - - [−] - - [src]

-
type ino_t = u64;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/raw/type.mode_t.html b/doc/bitflags/__core/os/ext/raw/type.mode_t.html deleted file mode 100644 index 42d0d5bb..00000000 --- a/doc/bitflags/__core/os/ext/raw/type.mode_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::raw::mode_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::ext::raw::mode_t - - [−] - - [src]

-
type mode_t = u32;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/raw/type.nlink_t.html b/doc/bitflags/__core/os/ext/raw/type.nlink_t.html deleted file mode 100644 index 193caa27..00000000 --- a/doc/bitflags/__core/os/ext/raw/type.nlink_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::raw::nlink_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::ext::raw::nlink_t - - [−] - - [src]

-
type nlink_t = u64;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/raw/type.off_t.html b/doc/bitflags/__core/os/ext/raw/type.off_t.html deleted file mode 100644 index 8022120d..00000000 --- a/doc/bitflags/__core/os/ext/raw/type.off_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::raw::off_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::ext::raw::off_t - - [−] - - [src]

-
type off_t = u64;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/raw/type.pid_t.html b/doc/bitflags/__core/os/ext/raw/type.pid_t.html deleted file mode 100644 index f29adef7..00000000 --- a/doc/bitflags/__core/os/ext/raw/type.pid_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::raw::pid_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::ext::raw::pid_t - - [−] - - [src]

-
type pid_t = i32;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/raw/type.pthread_t.html b/doc/bitflags/__core/os/ext/raw/type.pthread_t.html deleted file mode 100644 index 1b724050..00000000 --- a/doc/bitflags/__core/os/ext/raw/type.pthread_t.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::raw::pthread_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::ext::raw::pthread_t - - [−] - - [src]

-
type pthread_t = usize;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
Unstable (pthread_t)

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/raw/type.time_t.html b/doc/bitflags/__core/os/ext/raw/type.time_t.html deleted file mode 100644 index 89051bb8..00000000 --- a/doc/bitflags/__core/os/ext/raw/type.time_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::raw::time_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::ext::raw::time_t - - [−] - - [src]

-
type time_t = i64;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/raw/type.uid_t.html b/doc/bitflags/__core/os/ext/raw/type.uid_t.html deleted file mode 100644 index ddd54163..00000000 --- a/doc/bitflags/__core/os/ext/raw/type.uid_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::raw::uid_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::ext::raw::uid_t - - [−] - - [src]

-
type uid_t = u32;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/sidebar-items.js b/doc/bitflags/__core/os/ext/sidebar-items.js deleted file mode 100644 index b75d9e05..00000000 --- a/doc/bitflags/__core/os/ext/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"mod":[["ffi","Unix-specific extension to the primitives in the `std::ffi` module"],["fs","Unix-specific extensions to primitives in the `std::fs` module."],["io","Unix-specific extensions to general I/O primitives"],["net","Unix-specific networking functionality"],["prelude","A prelude for conveniently writing platform-specific code."],["process","Unix-specific extensions to primitives in the `std::process` module."],["raw","Unix-specific primitives available on all unix platforms"],["thread","Unix-specific extensions to primitives in the `std::thread` module."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/thread/index.html b/doc/bitflags/__core/os/ext/thread/index.html deleted file mode 100644 index 6fee2278..00000000 --- a/doc/bitflags/__core/os/ext/thread/index.html +++ /dev/null @@ -1,129 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::thread - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::os::ext::thread - - [−] - - [src]

-

Unix-specific extensions to primitives in the std::thread module.

-

Traits

- - - - -
JoinHandleExt -

Unix-specific extensions to std::thread::JoinHandle

-

Type Definitions

- - - - -
RawPthread - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/thread/sidebar-items.js b/doc/bitflags/__core/os/ext/thread/sidebar-items.js deleted file mode 100644 index 79a1561c..00000000 --- a/doc/bitflags/__core/os/ext/thread/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"trait":[["JoinHandleExt","Unix-specific extensions to `std::thread::JoinHandle`"]],"type":[["RawPthread",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/thread/trait.JoinHandleExt.html b/doc/bitflags/__core/os/ext/thread/trait.JoinHandleExt.html deleted file mode 100644 index 8a88d609..00000000 --- a/doc/bitflags/__core/os/ext/thread/trait.JoinHandleExt.html +++ /dev/null @@ -1,131 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::thread::JoinHandleExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::ext::thread::JoinHandleExt - - [−] - - [src]

-
pub trait JoinHandleExt {
-    fn as_pthread_t(&self) -> usize;
-    fn into_pthread_t(self) -> usize;
-}

Unix-specific extensions to std::thread::JoinHandle

-
-

Required Methods

-
-

fn as_pthread_t(&self) -> usize

Extracts the raw pthread_t without taking ownership

-

fn into_pthread_t(self) -> usize

Consumes the thread, returning the raw pthread_t

- -

This function transfers ownership of the underlying pthread_t to -the caller. Callers are then the unique owners of the pthread_t and -must either detach or join the pthread_t once it's no longer needed.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/ext/thread/type.RawPthread.html b/doc/bitflags/__core/os/ext/thread/type.RawPthread.html deleted file mode 100644 index 9287f12d..00000000 --- a/doc/bitflags/__core/os/ext/thread/type.RawPthread.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::ext::thread::RawPthread - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::ext::thread::RawPthread - - [−] - - [src]

-
type RawPthread = usize;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/index.html b/doc/bitflags/__core/os/index.html deleted file mode 100644 index 71cfdb31..00000000 --- a/doc/bitflags/__core/os/index.html +++ /dev/null @@ -1,135 +0,0 @@ - - - - - - - - - - bitflags::__core::os - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::os - - [−] - - [src]

-

OS-specific functionality.

-

Modules

- - - - - - - - - - - - -
ext -

Experimental extensions to std for Unix platforms.

-
macos -

MacOS-specific definitions

-
raw -

Raw OS-specific types for the current platform/architecture

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/fs/index.html b/doc/bitflags/__core/os/macos/fs/index.html deleted file mode 100644 index f0fca566..00000000 --- a/doc/bitflags/__core/os/macos/fs/index.html +++ /dev/null @@ -1,120 +0,0 @@ - - - - - - - - - - bitflags::__core::os::macos::fs - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::os::macos::fs - - [−] - - [src]

-

Traits

- - - - -
MetadataExt -

OS-specific extension methods for fs::Metadata

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/fs/sidebar-items.js b/doc/bitflags/__core/os/macos/fs/sidebar-items.js deleted file mode 100644 index 1a38e43f..00000000 --- a/doc/bitflags/__core/os/macos/fs/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"trait":[["MetadataExt","OS-specific extension methods for `fs::Metadata`"]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/fs/trait.MetadataExt.html b/doc/bitflags/__core/os/macos/fs/trait.MetadataExt.html deleted file mode 100644 index 06f923fc..00000000 --- a/doc/bitflags/__core/os/macos/fs/trait.MetadataExt.html +++ /dev/null @@ -1,153 +0,0 @@ - - - - - - - - - - bitflags::__core::os::macos::fs::MetadataExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::os::macos::fs::MetadataExt - - [−] - - [src]

-
pub trait MetadataExt {
-    fn as_raw_stat(&self) -> &stat;
-    fn st_dev(&self) -> u64;
-    fn st_ino(&self) -> u64;
-    fn st_mode(&self) -> u32;
-    fn st_nlink(&self) -> u64;
-    fn st_uid(&self) -> u32;
-    fn st_gid(&self) -> u32;
-    fn st_rdev(&self) -> u64;
-    fn st_size(&self) -> u64;
-    fn st_atime(&self) -> i64;
-    fn st_atime_nsec(&self) -> i64;
-    fn st_mtime(&self) -> i64;
-    fn st_mtime_nsec(&self) -> i64;
-    fn st_ctime(&self) -> i64;
-    fn st_ctime_nsec(&self) -> i64;
-    fn st_birthtime(&self) -> i64;
-    fn st_birthtime_nsec(&self) -> i64;
-    fn st_blksize(&self) -> u64;
-    fn st_blocks(&self) -> u64;
-    fn st_flags(&self) -> u32;
-    fn st_gen(&self) -> u32;
-    fn st_lspare(&self) -> u32;
-    fn st_qspare(&self) -> [u64; 2];
-}

OS-specific extension methods for fs::Metadata

-
-

Required Methods

-
-

fn as_raw_stat(&self) -> &stat

Deprecated since 1.8.0

: deprecated in favor of the accessor methods of this trait

-

Gain a reference to the underlying stat structure which contains -the raw information returned by the OS.

- -

The contents of the returned stat are not consistent across -Unix platforms. The os::unix::fs::MetadataExt trait contains the -cross-Unix abstractions contained within the raw stat.

-

fn st_dev(&self) -> u641.8.0

fn st_ino(&self) -> u641.8.0

fn st_mode(&self) -> u321.8.0

fn st_nlink(&self) -> u641.8.0

fn st_uid(&self) -> u321.8.0

fn st_gid(&self) -> u321.8.0

fn st_rdev(&self) -> u641.8.0

fn st_size(&self) -> u641.8.0

fn st_atime(&self) -> i641.8.0

fn st_atime_nsec(&self) -> i641.8.0

fn st_mtime(&self) -> i641.8.0

fn st_mtime_nsec(&self) -> i641.8.0

fn st_ctime(&self) -> i641.8.0

fn st_ctime_nsec(&self) -> i641.8.0

fn st_birthtime(&self) -> i641.8.0

fn st_birthtime_nsec(&self) -> i641.8.0

fn st_blksize(&self) -> u641.8.0

fn st_blocks(&self) -> u641.8.0

fn st_flags(&self) -> u321.8.0

fn st_gen(&self) -> u321.8.0

fn st_lspare(&self) -> u321.8.0

fn st_qspare(&self) -> [u64; 2]1.8.0

-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/index.html b/doc/bitflags/__core/os/macos/index.html deleted file mode 100644 index 68873513..00000000 --- a/doc/bitflags/__core/os/macos/index.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::os::macos - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::os::macos - - [−] - - [src]

-

MacOS-specific definitions

-

Modules

- - - - - - - - -
fs - -
raw - [Deprecated]

MacOS-specific raw type definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/raw/index.html b/doc/bitflags/__core/os/macos/raw/index.html deleted file mode 100644 index 69ce0007..00000000 --- a/doc/bitflags/__core/os/macos/raw/index.html +++ /dev/null @@ -1,186 +0,0 @@ - - - - - - - - - - bitflags::__core::os::macos::raw - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::os::macos::raw - - [−] - - [src]

-
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-

MacOS-specific raw type definitions

-

Structs

- - - - -
stat - [Deprecated] -

Type Definitions

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
blkcnt_t - [Deprecated] -
blksize_t - [Deprecated] -
dev_t - [Deprecated] -
ino_t - [Deprecated] -
mode_t - [Deprecated] -
nlink_t - [Deprecated] -
off_t - [Deprecated] -
time_t - [Deprecated] -
pthread_t - [Deprecated] [Unstable] -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/raw/sidebar-items.js b/doc/bitflags/__core/os/macos/raw/sidebar-items.js deleted file mode 100644 index a36019f5..00000000 --- a/doc/bitflags/__core/os/macos/raw/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["stat",""]],"type":[["blkcnt_t",""],["blksize_t",""],["dev_t",""],["ino_t",""],["mode_t",""],["nlink_t",""],["off_t",""],["pthread_t",""],["time_t",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/raw/struct.stat.html b/doc/bitflags/__core/os/macos/raw/struct.stat.html deleted file mode 100644 index 9a3c5167..00000000 --- a/doc/bitflags/__core/os/macos/raw/struct.stat.html +++ /dev/null @@ -1,183 +0,0 @@ - - - - - - - - - - bitflags::__core::os::macos::raw::stat - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::os::macos::raw::stat - - [−] - - [src]

-
pub struct stat {
-    pub st_dev: i32,
-    pub st_mode: u16,
-    pub st_nlink: u16,
-    pub st_ino: u64,
-    pub st_uid: u32,
-    pub st_gid: u32,
-    pub st_rdev: i32,
-    pub st_atime: i64,
-    pub st_atime_nsec: i64,
-    pub st_mtime: i64,
-    pub st_mtime_nsec: i64,
-    pub st_ctime: i64,
-    pub st_ctime_nsec: i64,
-    pub st_birthtime: i64,
-    pub st_birthtime_nsec: i64,
-    pub st_size: i64,
-    pub st_blocks: i64,
-    pub st_blksize: i32,
-    pub st_flags: u32,
-    pub st_gen: u32,
-    pub st_lspare: i32,
-    pub st_qspare: [i64; 2],
-}
1.1.0
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-

Fields

- - - - - - - - - - - - - - - - - - - - - - -
st_dev
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_mode
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_ino
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_uid
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_gid
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_rdev
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_atime
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_atime_nsec
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_mtime
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_mtime_nsec
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_ctime
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_ctime_nsec
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_birthtime
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_birthtime_nsec
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_size
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_blocks
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_blksize
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_flags
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_gen
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_lspare
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
st_qspare
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-

Trait Implementations

Derived Implementations

impl Clone for stat

fn clone(&self) -> stat

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/raw/type.blkcnt_t.html b/doc/bitflags/__core/os/macos/raw/type.blkcnt_t.html deleted file mode 100644 index e18e1b42..00000000 --- a/doc/bitflags/__core/os/macos/raw/type.blkcnt_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::macos::raw::blkcnt_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::macos::raw::blkcnt_t - - [−] - - [src]

-
type blkcnt_t = u64;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/raw/type.blksize_t.html b/doc/bitflags/__core/os/macos/raw/type.blksize_t.html deleted file mode 100644 index cbbe7300..00000000 --- a/doc/bitflags/__core/os/macos/raw/type.blksize_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::macos::raw::blksize_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::macos::raw::blksize_t - - [−] - - [src]

-
type blksize_t = u64;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/raw/type.dev_t.html b/doc/bitflags/__core/os/macos/raw/type.dev_t.html deleted file mode 100644 index 43d687c7..00000000 --- a/doc/bitflags/__core/os/macos/raw/type.dev_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::macos::raw::dev_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::macos::raw::dev_t - - [−] - - [src]

-
type dev_t = u64;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/raw/type.ino_t.html b/doc/bitflags/__core/os/macos/raw/type.ino_t.html deleted file mode 100644 index 72ed1c29..00000000 --- a/doc/bitflags/__core/os/macos/raw/type.ino_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::macos::raw::ino_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::macos::raw::ino_t - - [−] - - [src]

-
type ino_t = u64;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/raw/type.mode_t.html b/doc/bitflags/__core/os/macos/raw/type.mode_t.html deleted file mode 100644 index 7efa77ea..00000000 --- a/doc/bitflags/__core/os/macos/raw/type.mode_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::macos::raw::mode_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::macos::raw::mode_t - - [−] - - [src]

-
type mode_t = u32;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/raw/type.nlink_t.html b/doc/bitflags/__core/os/macos/raw/type.nlink_t.html deleted file mode 100644 index 398d3014..00000000 --- a/doc/bitflags/__core/os/macos/raw/type.nlink_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::macos::raw::nlink_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::macos::raw::nlink_t - - [−] - - [src]

-
type nlink_t = u64;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/raw/type.off_t.html b/doc/bitflags/__core/os/macos/raw/type.off_t.html deleted file mode 100644 index 6a68aa0a..00000000 --- a/doc/bitflags/__core/os/macos/raw/type.off_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::macos::raw::off_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::macos::raw::off_t - - [−] - - [src]

-
type off_t = u64;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/raw/type.pthread_t.html b/doc/bitflags/__core/os/macos/raw/type.pthread_t.html deleted file mode 100644 index 03caa029..00000000 --- a/doc/bitflags/__core/os/macos/raw/type.pthread_t.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::os::macos::raw::pthread_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::macos::raw::pthread_t - - [−] - - [src]

-
type pthread_t = usize;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
Unstable (pthread_t)

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/raw/type.time_t.html b/doc/bitflags/__core/os/macos/raw/type.time_t.html deleted file mode 100644 index 657cc7f0..00000000 --- a/doc/bitflags/__core/os/macos/raw/type.time_t.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::os::macos::raw::time_t - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::macos::raw::time_t - - [−] - - [src]

-
type time_t = i64;
Deprecated since 1.8.0

: these type aliases are no longer supported by the standard library, the libc crate on crates.io should be used instead for the correct definitions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/macos/sidebar-items.js b/doc/bitflags/__core/os/macos/sidebar-items.js deleted file mode 100644 index 5c642a4e..00000000 --- a/doc/bitflags/__core/os/macos/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"mod":[["fs",""],["raw","MacOS-specific raw type definitions"]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/enum.c_void.html b/doc/bitflags/__core/os/raw/enum.c_void.html deleted file mode 100644 index 8f793568..00000000 --- a/doc/bitflags/__core/os/raw/enum.c_void.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - - - - bitflags::__core::os::raw::c_void - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::os::raw::c_void - - [−] - - [src]

-
pub enum c_void {
-    // some variants omitted
-}
1.1.0

Type used to construct void pointers for use with C.

- -

This type is only useful as a pointer target. Do not use it as a -return type for FFI functions which have the void return type in -C. Use the unit type () or omit the return type instead.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/index.html b/doc/bitflags/__core/os/raw/index.html deleted file mode 100644 index c73254fa..00000000 --- a/doc/bitflags/__core/os/raw/index.html +++ /dev/null @@ -1,213 +0,0 @@ - - - - - - - - - - bitflags::__core::os::raw - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::os::raw - - [−] - - [src]

-

Raw OS-specific types for the current platform/architecture

-

Enums

- - - - -
c_void -

Type used to construct void pointers for use with C.

-

Type Definitions

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
c_char - -
c_double - -
c_float - -
c_int - -
c_long - -
c_longlong - -
c_schar - -
c_short - -
c_uchar - -
c_uint - -
c_ulong - -
c_ulonglong - -
c_ushort - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/sidebar-items.js b/doc/bitflags/__core/os/raw/sidebar-items.js deleted file mode 100644 index 403f657d..00000000 --- a/doc/bitflags/__core/os/raw/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["c_void","Type used to construct void pointers for use with C."]],"type":[["c_char",""],["c_double",""],["c_float",""],["c_int",""],["c_long",""],["c_longlong",""],["c_schar",""],["c_short",""],["c_uchar",""],["c_uint",""],["c_ulong",""],["c_ulonglong",""],["c_ushort",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/type.c_char.html b/doc/bitflags/__core/os/raw/type.c_char.html deleted file mode 100644 index 32664d02..00000000 --- a/doc/bitflags/__core/os/raw/type.c_char.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::raw::c_char - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::raw::c_char - - [−] - - [src]

-
type c_char = i8;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/type.c_double.html b/doc/bitflags/__core/os/raw/type.c_double.html deleted file mode 100644 index d0d652a0..00000000 --- a/doc/bitflags/__core/os/raw/type.c_double.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::raw::c_double - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::raw::c_double - - [−] - - [src]

-
type c_double = f64;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/type.c_float.html b/doc/bitflags/__core/os/raw/type.c_float.html deleted file mode 100644 index 0add619a..00000000 --- a/doc/bitflags/__core/os/raw/type.c_float.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::raw::c_float - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::raw::c_float - - [−] - - [src]

-
type c_float = f32;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/type.c_int.html b/doc/bitflags/__core/os/raw/type.c_int.html deleted file mode 100644 index d7366ef9..00000000 --- a/doc/bitflags/__core/os/raw/type.c_int.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::raw::c_int - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::raw::c_int - - [−] - - [src]

-
type c_int = i32;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/type.c_long.html b/doc/bitflags/__core/os/raw/type.c_long.html deleted file mode 100644 index 3f237c52..00000000 --- a/doc/bitflags/__core/os/raw/type.c_long.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::raw::c_long - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::raw::c_long - - [−] - - [src]

-
type c_long = i64;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/type.c_longlong.html b/doc/bitflags/__core/os/raw/type.c_longlong.html deleted file mode 100644 index db7d68d7..00000000 --- a/doc/bitflags/__core/os/raw/type.c_longlong.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::raw::c_longlong - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::raw::c_longlong - - [−] - - [src]

-
type c_longlong = i64;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/type.c_schar.html b/doc/bitflags/__core/os/raw/type.c_schar.html deleted file mode 100644 index feb2498f..00000000 --- a/doc/bitflags/__core/os/raw/type.c_schar.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::raw::c_schar - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::raw::c_schar - - [−] - - [src]

-
type c_schar = i8;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/type.c_short.html b/doc/bitflags/__core/os/raw/type.c_short.html deleted file mode 100644 index 5f5b7054..00000000 --- a/doc/bitflags/__core/os/raw/type.c_short.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::raw::c_short - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::raw::c_short - - [−] - - [src]

-
type c_short = i16;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/type.c_uchar.html b/doc/bitflags/__core/os/raw/type.c_uchar.html deleted file mode 100644 index cbee5092..00000000 --- a/doc/bitflags/__core/os/raw/type.c_uchar.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::raw::c_uchar - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::raw::c_uchar - - [−] - - [src]

-
type c_uchar = u8;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/type.c_uint.html b/doc/bitflags/__core/os/raw/type.c_uint.html deleted file mode 100644 index ab70a87a..00000000 --- a/doc/bitflags/__core/os/raw/type.c_uint.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::raw::c_uint - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::raw::c_uint - - [−] - - [src]

-
type c_uint = u32;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/type.c_ulong.html b/doc/bitflags/__core/os/raw/type.c_ulong.html deleted file mode 100644 index f7c01a79..00000000 --- a/doc/bitflags/__core/os/raw/type.c_ulong.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::raw::c_ulong - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::raw::c_ulong - - [−] - - [src]

-
type c_ulong = u64;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/type.c_ulonglong.html b/doc/bitflags/__core/os/raw/type.c_ulonglong.html deleted file mode 100644 index ccf3eea2..00000000 --- a/doc/bitflags/__core/os/raw/type.c_ulonglong.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::raw::c_ulonglong - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::raw::c_ulonglong - - [−] - - [src]

-
type c_ulonglong = u64;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/raw/type.c_ushort.html b/doc/bitflags/__core/os/raw/type.c_ushort.html deleted file mode 100644 index dc2594c4..00000000 --- a/doc/bitflags/__core/os/raw/type.c_ushort.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::os::raw::c_ushort - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::os::raw::c_ushort - - [−] - - [src]

-
type c_ushort = u16;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/os/sidebar-items.js b/doc/bitflags/__core/os/sidebar-items.js deleted file mode 100644 index 24aad5f2..00000000 --- a/doc/bitflags/__core/os/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"mod":[["ext","Experimental extensions to `std` for Unix platforms."],["macos","MacOS-specific definitions"],["raw","Raw OS-specific types for the current platform/architecture"]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/panic/fn.catch_unwind.html b/doc/bitflags/__core/panic/fn.catch_unwind.html deleted file mode 100644 index 099808d7..00000000 --- a/doc/bitflags/__core/panic/fn.catch_unwind.html +++ /dev/null @@ -1,156 +0,0 @@ - - - - - - - - - - bitflags::__core::panic::catch_unwind - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::panic::catch_unwind - - [−] - - [src]

-
pub fn catch_unwind<F, R>(f: F) -> Result<R, Box<Any + 'static + Send>> where F: UnwindSafe + FnOnce() -> R
1.9.0

Invokes a closure, capturing the cause of an unwinding panic if one occurs.

- -

This function will return Ok with the closure's result if the closure -does not panic, and will return Err(cause) if the closure panics. The -cause returned is the object with which panic was originally invoked.

- -

It is currently undefined behavior to unwind from Rust code into foreign -code, so this function is particularly useful when Rust is called from -another language (normally C). This can run arbitrary Rust code, capturing a -panic and allowing a graceful handling of the error.

- -

It is not recommended to use this function for a general try/catch -mechanism. The Result type is more appropriate to use for functions that -can fail on a regular basis. Additionally, this function is not guaranteed -to catch all panics, see the "Notes" section below.

- -

The closure provided is required to adhere to the UnwindSafe trait to ensure -that all captured variables are safe to cross this boundary. The purpose of -this bound is to encode the concept of exception safety in the type -system. Most usage of this function should not need to worry about this -bound as programs are naturally panic safe without unsafe code. If it -becomes a problem the associated AssertUnwindSafe wrapper type in this -module can be used to quickly assert that the usage here is indeed exception -safe.

- -

Notes

-

Note that this function may not catch all panics in Rust. A panic in -Rust is not always implemented via unwinding, but can be implemented by -aborting the process as well. This function only catches unwinding panics, -not those that abort the process.

- -

Examples

-
-use std::panic;
-
-let result = panic::catch_unwind(|| {
-    println!("hello!");
-});
-assert!(result.is_ok());
-
-let result = panic::catch_unwind(|| {
-    panic!("oh no!");
-});
-assert!(result.is_err());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/panic/fn.propagate.html b/doc/bitflags/__core/panic/fn.propagate.html deleted file mode 100644 index cdfe4e84..00000000 --- a/doc/bitflags/__core/panic/fn.propagate.html +++ /dev/null @@ -1,115 +0,0 @@ - - - - - - - - - - bitflags::__core::panic::propagate - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::panic::propagate - - [−] - - [src]

-
pub fn propagate(payload: Box<Any + 'static + Send>) -> !
Deprecated since 1.9.0

: renamed to resume_unwind

-
Unstable (panic_propagate)

: renamed to resume_unwind

-

Deprecated, use resume_unwind instead

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/panic/fn.recover.html b/doc/bitflags/__core/panic/fn.recover.html deleted file mode 100644 index fe4f697e..00000000 --- a/doc/bitflags/__core/panic/fn.recover.html +++ /dev/null @@ -1,115 +0,0 @@ - - - - - - - - - - bitflags::__core::panic::recover - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::panic::recover - - [−] - - [src]

-
pub fn recover<F, R>(f: F) -> Result<R, Box<Any + 'static + Send>> where F: UnwindSafe + FnOnce() -> R
Deprecated since 1.9.0

: renamed to catch_unwind

-
Unstable (recover)

: renamed to catch_unwind

-

Deprecated, renamed to catch_unwind

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/panic/fn.resume_unwind.html b/doc/bitflags/__core/panic/fn.resume_unwind.html deleted file mode 100644 index 0f2381b7..00000000 --- a/doc/bitflags/__core/panic/fn.resume_unwind.html +++ /dev/null @@ -1,134 +0,0 @@ - - - - - - - - - - bitflags::__core::panic::resume_unwind - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::panic::resume_unwind - - [−] - - [src]

-
pub fn resume_unwind(payload: Box<Any + 'static + Send>) -> !
1.9.0

Triggers a panic without invoking the panic handler.

- -

This is designed to be used in conjunction with catch_unwind to, for -example, carry a panic across a layer of C code.

- -

Notes

-

Note that panics in Rust are not always implemented via unwinding, but they -may be implemented by aborting the process. If this function is called when -panics are implemented this way then this function will abort the process, -not trigger an unwind.

- -

Examples

-
-use std::panic;
-
-let result = panic::catch_unwind(|| {
-    panic!("oh no!");
-});
-
-if let Err(err) = result {
-    panic::resume_unwind(err);
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/panic/fn.set_handler.html b/doc/bitflags/__core/panic/fn.set_handler.html deleted file mode 100644 index f8631f50..00000000 --- a/doc/bitflags/__core/panic/fn.set_handler.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::panic::set_handler - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::panic::set_handler - - [−] - - [src]

-
pub fn set_handler<F>(handler: F) where F: Fn(&PanicInfo) -> () + 'static + Sync + Send
Deprecated since 1.9.0

: renamed to set_hook

-
Unstable (panic_handler)

: renamed to set_hook

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/panic/fn.set_hook.html b/doc/bitflags/__core/panic/fn.set_hook.html deleted file mode 100644 index c8c303ba..00000000 --- a/doc/bitflags/__core/panic/fn.set_hook.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::panic::set_hook - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::panic::set_hook - - [−] - - [src]

-
pub fn set_hook(hook: Box<Fn(&PanicInfo) + 'static + Send + Sync>)
Unstable (panic_handler)

: awaiting feedback

-

Registers a custom panic hook, replacing any that was previously registered.

- -

The panic hook is invoked when a thread panics, but before it begins -unwinding the stack. The default hook prints a message to standard error -and generates a backtrace if requested, but this behavior can be customized -with the set_hook and take_hook functions.

- -

The hook is provided with a PanicInfo struct which contains information -about the origin of the panic, including the payload passed to panic! and -the source code location from which the panic originated.

- -

The panic hook is a global resource.

- -

Panics

-

Panics if called from a panicking thread.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/panic/fn.take_handler.html b/doc/bitflags/__core/panic/fn.take_handler.html deleted file mode 100644 index 01a93ebb..00000000 --- a/doc/bitflags/__core/panic/fn.take_handler.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::panic::take_handler - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::panic::take_handler - - [−] - - [src]

-
pub fn take_handler() -> Box<Fn(&PanicInfo) + 'static + Send + Sync>
Deprecated since 1.9.0

: renamed to take_hook

-
Unstable (panic_handler)

: renamed to take_hook

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/panic/fn.take_hook.html b/doc/bitflags/__core/panic/fn.take_hook.html deleted file mode 100644 index 037cfc36..00000000 --- a/doc/bitflags/__core/panic/fn.take_hook.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - - - - bitflags::__core::panic::take_hook - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::panic::take_hook - - [−] - - [src]

-
pub fn take_hook() -> Box<Fn(&PanicInfo) + 'static + Send + Sync>
Unstable (panic_handler)

: awaiting feedback

-

Unregisters the current panic hook, returning it.

- -

If no custom hook is registered, the default hook will be returned.

- -

Panics

-

Panics if called from a panicking thread.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/panic/index.html b/doc/bitflags/__core/panic/index.html deleted file mode 100644 index 0e9f15ca..00000000 --- a/doc/bitflags/__core/panic/index.html +++ /dev/null @@ -1,222 +0,0 @@ - - - - - - - - - - bitflags::__core::panic - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::panic - - [−] - - [src]

-

Panic support in the standard library

-

Structs

- - - - - - - - - - - - - - - - -
AssertUnwindSafe -

A simple wrapper around a type to assert that it is panic safe.

-
AssertRecoverSafe - [Deprecated] [Unstable]

Deprecated, renamed to AssertUnwindSafe

-
Location - [Unstable]

A struct containing information about the location of a panic.

-
PanicInfo - [Unstable]

A struct providing information about a panic.

-

Traits

- - - - - - - - - - - - -
RefUnwindSafe -

A marker trait representing types where a shared reference is considered -recover safe.

-
UnwindSafe -

A marker trait which represents "panic safe" types in Rust.

-
RecoverSafe - [Deprecated] [Unstable]

Deprecated, renamed to UnwindSafe

-

Functions

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
catch_unwind -

Invokes a closure, capturing the cause of an unwinding panic if one occurs.

-
resume_unwind -

Triggers a panic without invoking the panic handler.

-
propagate - [Deprecated] [Unstable]

Deprecated, use resume_unwind instead

-
recover - [Deprecated] [Unstable]

Deprecated, renamed to catch_unwind

-
set_handler - [Deprecated] [Unstable] -
set_hook - [Unstable]

Registers a custom panic hook, replacing any that was previously registered.

-
take_handler - [Deprecated] [Unstable] -
take_hook - [Unstable]

Unregisters the current panic hook, returning it.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/panic/sidebar-items.js b/doc/bitflags/__core/panic/sidebar-items.js deleted file mode 100644 index 94307c71..00000000 --- a/doc/bitflags/__core/panic/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["catch_unwind","Invokes a closure, capturing the cause of an unwinding panic if one occurs."],["propagate","Deprecated, use resume_unwind instead"],["recover","Deprecated, renamed to `catch_unwind`"],["resume_unwind","Triggers a panic without invoking the panic handler."],["set_handler",""],["set_hook","Registers a custom panic hook, replacing any that was previously registered."],["take_handler",""],["take_hook","Unregisters the current panic hook, returning it."]],"struct":[["AssertRecoverSafe","Deprecated, renamed to `AssertUnwindSafe`"],["AssertUnwindSafe","A simple wrapper around a type to assert that it is panic safe."],["Location","A struct containing information about the location of a panic."],["PanicInfo","A struct providing information about a panic."]],"trait":[["RecoverSafe","Deprecated, renamed to UnwindSafe"],["RefUnwindSafe","A marker trait representing types where a shared reference is considered recover safe."],["UnwindSafe","A marker trait which represents \"panic safe\" types in Rust."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/panic/struct.AssertRecoverSafe.html b/doc/bitflags/__core/panic/struct.AssertRecoverSafe.html deleted file mode 100644 index 082e43ed..00000000 --- a/doc/bitflags/__core/panic/struct.AssertRecoverSafe.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::panic::AssertRecoverSafe - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::panic::AssertRecoverSafe - - [−] - - [src]

-
pub struct AssertRecoverSafe<T>(pub T);
Deprecated since 1.9.0

: renamed to AssertUnwindSafe

-
Unstable (recover)

: renamed to AssertUnwindSafe

-

Deprecated, renamed to AssertUnwindSafe

-

Methods

impl<T> AssertRecoverSafe<T>

fn new(t: T) -> AssertRecoverSafe<T>

-
Deprecated since 1.9.0

: the type's field is now public, construct it directly

-
Unstable (recover)

: the type's field is now public, construct it directly

-

Creates a new AssertRecoverSafe wrapper around the provided type.

-

fn into_inner(self) -> T

-
Deprecated since 1.9.0

: the type's field is now public, access it directly

-
Unstable (recover)

: the type's field is now public, access it directly

-

Consumes the AssertRecoverSafe, returning the wrapped value.

-

Trait Implementations

impl<T> UnwindSafe for AssertRecoverSafe<T>

impl<T> RefUnwindSafe for AssertRecoverSafe<T>

impl<T> Deref for AssertRecoverSafe<T>

type Target = T

-
Unstable (recover)

fn deref(&self) -> &T

-
Unstable (recover)

impl<T> DerefMut for AssertRecoverSafe<T>

fn deref_mut(&mut self) -> &mut T

-
Unstable (recover)

impl<R, F> FnOnce() for AssertRecoverSafe<F> where F: FnOnce() -> R

type Output = R

-
Unstable (recover)

extern "rust-call" fn call_once(self, _args: ()) -> R

-
Unstable (recover)
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/panic/struct.AssertUnwindSafe.html b/doc/bitflags/__core/panic/struct.AssertUnwindSafe.html deleted file mode 100644 index a8d47946..00000000 --- a/doc/bitflags/__core/panic/struct.AssertUnwindSafe.html +++ /dev/null @@ -1,171 +0,0 @@ - - - - - - - - - - bitflags::__core::panic::AssertUnwindSafe - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::panic::AssertUnwindSafe - - [−] - - [src]

-
pub struct AssertUnwindSafe<T>(pub T);
1.9.0

A simple wrapper around a type to assert that it is panic safe.

- -

When using recover it may be the case that some of the closed over -variables are not panic safe. For example if &mut T is captured the -compiler will generate a warning indicating that it is not panic safe. It -may not be the case, however, that this is actually a problem due to the -specific usage of recover if panic safety is specifically taken into -account. This wrapper struct is useful for a quick and lightweight -annotation that a variable is indeed panic safe.

- -

Examples

-

One way to use AssertUnwindSafe is to assert that the entire closure -itself is recover safe, bypassing all checks for all variables:

- -
-use std::panic::{self, AssertUnwindSafe};
-
-let mut variable = 4;
-
-// This code will not compile because the closure captures `&mut variable`
-// which is not considered panic safe by default.
-
-// panic::catch_unwind(|| {
-//     variable += 3;
-// });
-
-// This, however, will compile due to the `AssertUnwindSafe` wrapper
-let result = panic::catch_unwind(AssertUnwindSafe(|| {
-    variable += 3;
-}));
-// ...
- -

Wrapping the entire closure amounts to a blanket assertion that all captured -variables are unwind safe. This has the downside that if new captures are -added in the future, they will also be considered unwind safe. Therefore, -you may prefer to just wrap individual captures, as shown below. This is -more annotation, but it ensures that if a new capture is added which is not -unwind safe, you will get a compilation error at that time, which will -allow you to consider whether that new capture in fact represent a bug or -not.

- -
-use std::panic::{self, AssertUnwindSafe};
-
-let mut variable = 4;
-let other_capture = 3;
-
-let result = {
-    let mut wrapper = AssertUnwindSafe(&mut variable);
-    panic::catch_unwind(move || {
-        **wrapper += other_capture;
-    })
-};
-// ...
-

Trait Implementations

impl<T> UnwindSafe for AssertUnwindSafe<T>

impl<T> RefUnwindSafe for AssertUnwindSafe<T>

impl<T> Deref for AssertUnwindSafe<T>

type Target = T

-

fn deref(&self) -> &T

-

impl<T> DerefMut for AssertUnwindSafe<T>

fn deref_mut(&mut self) -> &mut T

-

impl<R, F> FnOnce() for AssertUnwindSafe<F> where F: FnOnce() -> R

type Output = R

-

extern "rust-call" fn call_once(self, _args: ()) -> R

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/panic/struct.Location.html b/doc/bitflags/__core/panic/struct.Location.html deleted file mode 100644 index f0520221..00000000 --- a/doc/bitflags/__core/panic/struct.Location.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - bitflags::__core::panic::Location - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::panic::Location - - [−] - - [src]

-
pub struct Location<'a> {
-    // some fields omitted
-}
Unstable (panic_handler)

: awaiting feedback

-

A struct containing information about the location of a panic.

-

Methods

impl<'a> Location<'a>

fn file(&self) -> &str

-
Unstable (panic_handler)

: awaiting feedback

-

Returns the name of the source file from which the panic originated.

-

fn line(&self) -> u32

-
Unstable (panic_handler)

: awaiting feedback

-

Returns the line number from which the panic originated.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/panic/struct.PanicInfo.html b/doc/bitflags/__core/panic/struct.PanicInfo.html deleted file mode 100644 index 196fd05f..00000000 --- a/doc/bitflags/__core/panic/struct.PanicInfo.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::panic::PanicInfo - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::panic::PanicInfo - - [−] - - [src]

-
pub struct PanicInfo<'a> {
-    // some fields omitted
-}
Unstable (panic_handler)

: awaiting feedback

-

A struct providing information about a panic.

-

Methods

impl<'a> PanicInfo<'a>

fn payload(&self) -> &Any + 'static + Send

-
Unstable (panic_handler)

: awaiting feedback

-

Returns the payload associated with the panic.

- -

This will commonly, but not always, be a &'static str or String.

-

fn location(&self) -> Option<&Location>

-
Unstable (panic_handler)

: awaiting feedback

-

Returns information about the location from which the panic originated, -if available.

- -

This method will currently always return Some, but this may change -in future versions.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/panic/trait.RecoverSafe.html b/doc/bitflags/__core/panic/trait.RecoverSafe.html deleted file mode 100644 index 1bc98f81..00000000 --- a/doc/bitflags/__core/panic/trait.RecoverSafe.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - - - - bitflags::__core::panic::RecoverSafe - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::panic::RecoverSafe - - [−] - - [src]

-
pub trait RecoverSafe { }
Deprecated since 1.9.0

: renamed to UnwindSafe

-
Unstable (recover)

: renamed to UnwindSafe

-

Deprecated, renamed to UnwindSafe

-
-

Implementors

-
    -
  • impl<T> RecoverSafe for T where T: UnwindSafe
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/panic/trait.RefUnwindSafe.html b/doc/bitflags/__core/panic/trait.RefUnwindSafe.html deleted file mode 100644 index 23cde14c..00000000 --- a/doc/bitflags/__core/panic/trait.RefUnwindSafe.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::panic::RefUnwindSafe - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::panic::RefUnwindSafe - - [−] - - [src]

-
pub trait RefUnwindSafe { }

A marker trait representing types where a shared reference is considered -recover safe.

- -

This trait is namely not implemented by UnsafeCell, the root of all -interior mutability.

- -

This is a "helper marker trait" used to provide impl blocks for the -UnwindSafe trait, for more information see that documentation.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/panic/trait.UnwindSafe.html b/doc/bitflags/__core/panic/trait.UnwindSafe.html deleted file mode 100644 index 20669709..00000000 --- a/doc/bitflags/__core/panic/trait.UnwindSafe.html +++ /dev/null @@ -1,198 +0,0 @@ - - - - - - - - - - bitflags::__core::panic::UnwindSafe - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::panic::UnwindSafe - - [−] - - [src]

-
pub trait UnwindSafe { }

A marker trait which represents "panic safe" types in Rust.

- -

This trait is implemented by default for many types and behaves similarly in -terms of inference of implementation to the Send and Sync traits. The -purpose of this trait is to encode what types are safe to cross a recover -boundary with no fear of panic safety.

- -

What is panic safety?

-

In Rust a function can "return" early if it either panics or calls a -function which transitively panics. This sort of control flow is not always -anticipated, and has the possibility of causing subtle bugs through a -combination of two cricial components:

- -
    -
  1. A data structure is in a temporarily invalid state when the thread -panics.
    2. -
  2. This broken invariant is then later observed.
    3. -
- -

Typically in Rust, it is difficult to perform step (2) because catching a -panic involves either spawning a thread (which in turns makes it difficult -to later witness broken invariants) or using the recover function in this -module. Additionally, even if an invariant is witnessed, it typically isn't a -problem in Rust because there's no uninitialized values (like in C or C++).

- -

It is possible, however, for logical invariants to be broken in Rust, -which can end up causing behavioral bugs. Another key aspect of panic safety -in Rust is that, in the absence of unsafe code, a panic cannot lead to -memory unsafety.

- -

That was a bit of a whirlwind tour of panic safety, but for more information -about panic safety and how it applies to Rust, see an associated RFC.

- -

What is RecoverSafe?

-

Now that we've got an idea of what panic safety is in Rust, it's also -important to understand what this trait represents. As mentioned above, one -way to witness broken invariants is through the recover function in this -module as it allows catching a panic and then re-using the environment of -the closure.

- -

Simply put, a type T implements RecoverSafe if it cannot easily allow -witnessing a broken invariant through the use of recover (catching a -panic). This trait is a marker trait, so it is automatically implemented for -many types, and it is also structurally composed (e.g. a struct is recover -safe if all of its components are recover safe).

- -

Note, however, that this is not an unsafe trait, so there is not a succinct -contract that this trait is providing. Instead it is intended as more of a -"speed bump" to alert users of recover that broken invariants may be -witnessed and may need to be accounted for.

- -

Who implements UnwindSafe?

-

Types such as &mut T and &RefCell<T> are examples which are not -recover safe. The general idea is that any mutable state which can be shared -across recover is not recover safe by default. This is because it is very -easy to witness a broken invariant outside of recover as the data is -simply accessed as usual.

- -

Types like &Mutex<T>, however, are recover safe because they implement -poisoning by default. They still allow witnessing a broken invariant, but -they already provide their own "speed bumps" to do so.

- -

When should UnwindSafe be used?

-

Is not intended that most types or functions need to worry about this trait. -It is only used as a bound on the recover function and as mentioned above, -the lack of unsafe means it is mostly an advisory. The AssertRecoverSafe -wrapper struct in this module can be used to force this trait to be -implemented for any closed over variables passed to the recover function -(more on this below).

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/path/constant.MAIN_SEPARATOR.html b/doc/bitflags/__core/path/constant.MAIN_SEPARATOR.html deleted file mode 100644 index 53695bd0..00000000 --- a/doc/bitflags/__core/path/constant.MAIN_SEPARATOR.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::path::MAIN_SEPARATOR - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::path::MAIN_SEPARATOR - - [−] - - [src]

-
pub const MAIN_SEPARATOR: char = platform::MAIN_SEP

The primary separator for the current platform

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/path/enum.Component.html b/doc/bitflags/__core/path/enum.Component.html deleted file mode 100644 index c89f4afc..00000000 --- a/doc/bitflags/__core/path/enum.Component.html +++ /dev/null @@ -1,146 +0,0 @@ - - - - - - - - - - bitflags::__core::path::Component - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::path::Component - - [−] - - [src]

-
pub enum Component<'a> {
-    Prefix(PrefixComponent<'a>),
-    RootDir,
-    CurDir,
-    ParentDir,
-    Normal(&'a OsStr),
-}
1.0.0

A single component of a path.

- -

See the module documentation for an in-depth explanation of components and -their role in the API.

-

Variants

-
Prefix

A Windows path prefix, e.g. C: or \\server\share.

- -

Does not occur on Unix.

-
RootDir

The root directory component, appears after any prefix and before anything else

-
CurDir

A reference to the current directory, i.e. .

-
ParentDir

A reference to the parent directory, i.e. ..

-
Normal

A normal component, i.e. a and b in a/b

-

Methods

impl<'a> Component<'a>

fn as_os_str(self) -> &'a OsStr

-

Extracts the underlying OsStr slice

-

Trait Implementations

impl<'a> AsRef<OsStr> for Component<'a>

fn as_ref(&self) -> &OsStr

-

Derived Implementations

impl<'a> Debug for Component<'a>

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<'a> Hash for Component<'a>

fn hash<__H>(&self, __arg_0: &mut __H) where __H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<'a> Ord for Component<'a>

fn cmp(&self, __arg_0: &Component<'a>) -> Ordering

-

impl<'a> PartialOrd<Component<'a>> for Component<'a>

fn partial_cmp(&self, __arg_0: &Component<'a>) -> Option<Ordering>

-

fn lt(&self, __arg_0: &Component<'a>) -> bool

-

fn le(&self, __arg_0: &Component<'a>) -> bool

-

fn gt(&self, __arg_0: &Component<'a>) -> bool

-

fn ge(&self, __arg_0: &Component<'a>) -> bool

-

impl<'a> Eq for Component<'a>

impl<'a> PartialEq<Component<'a>> for Component<'a>

fn eq(&self, __arg_0: &Component<'a>) -> bool

-

fn ne(&self, __arg_0: &Component<'a>) -> bool

-

impl<'a> Clone for Component<'a>

fn clone(&self) -> Component<'a>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a> Copy for Component<'a>

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/path/enum.Prefix.html b/doc/bitflags/__core/path/enum.Prefix.html deleted file mode 100644 index 9bc33967..00000000 --- a/doc/bitflags/__core/path/enum.Prefix.html +++ /dev/null @@ -1,148 +0,0 @@ - - - - - - - - - - bitflags::__core::path::Prefix - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::path::Prefix - - [−] - - [src]

-
pub enum Prefix<'a> {
-    Verbatim(&'a OsStr),
-    VerbatimUNC(&'a OsStr, &'a OsStr),
-    VerbatimDisk(u8),
-    DeviceNS(&'a OsStr),
-    UNC(&'a OsStr, &'a OsStr),
-    Disk(u8),
-}
1.0.0

Path prefixes (Windows only).

- -

Windows uses a variety of path styles, including references to drive -volumes (like C:), network shared folders (like \\server\share) and -others. In addition, some path prefixes are "verbatim", in which case -/ is not treated as a separator and essentially no normalization is -performed.

-

Variants

-
Verbatim

Prefix \\?\, together with the given component immediately following it.

-
VerbatimUNC

Prefix \\?\UNC\, with the "server" and "share" components following it.

-
VerbatimDisk

Prefix like \\?\C:\, for the given drive letter

-
DeviceNS

Prefix \\.\, together with the given component immediately following it.

-
UNC

Prefix \\server\share, with the given "server" and "share" components.

-
Disk

Prefix C: for the given disk drive.

-

Methods

impl<'a> Prefix<'a>

fn is_verbatim(&self) -> bool

-

Determines if the prefix is verbatim, i.e. begins with \\?\.

-

Trait Implementations

Derived Implementations

impl<'a> Eq for Prefix<'a>

impl<'a> PartialEq<Prefix<'a>> for Prefix<'a>

fn eq(&self, __arg_0: &Prefix<'a>) -> bool

-

fn ne(&self, __arg_0: &Prefix<'a>) -> bool

-

impl<'a> Ord for Prefix<'a>

fn cmp(&self, __arg_0: &Prefix<'a>) -> Ordering

-

impl<'a> PartialOrd<Prefix<'a>> for Prefix<'a>

fn partial_cmp(&self, __arg_0: &Prefix<'a>) -> Option<Ordering>

-

fn lt(&self, __arg_0: &Prefix<'a>) -> bool

-

fn le(&self, __arg_0: &Prefix<'a>) -> bool

-

fn gt(&self, __arg_0: &Prefix<'a>) -> bool

-

fn ge(&self, __arg_0: &Prefix<'a>) -> bool

-

impl<'a> Hash for Prefix<'a>

fn hash<__H>(&self, __arg_0: &mut __H) where __H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<'a> Debug for Prefix<'a>

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<'a> Clone for Prefix<'a>

fn clone(&self) -> Prefix<'a>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a> Copy for Prefix<'a>

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/path/fn.is_separator.html b/doc/bitflags/__core/path/fn.is_separator.html deleted file mode 100644 index a9b242a7..00000000 --- a/doc/bitflags/__core/path/fn.is_separator.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - - - - bitflags::__core::path::is_separator - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::path::is_separator - - [−] - - [src]

-
pub fn is_separator(c: char) -> bool
1.0.0

Determines whether the character is one of the permitted path -separators for the current platform.

- -

Examples

-
-use std::path;
-
-assert!(path::is_separator('/'));
-assert!(!path::is_separator('❤'));
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/path/index.html b/doc/bitflags/__core/path/index.html deleted file mode 100644 index 7ad50763..00000000 --- a/doc/bitflags/__core/path/index.html +++ /dev/null @@ -1,280 +0,0 @@ - - - - - - - - - - bitflags::__core::path - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::path - - [−] - - [src]

-

Cross-platform path manipulation.

- -

This module provides two types, PathBuf and Path (akin to String and -str), for working with paths abstractly. These types are thin wrappers -around OsString and OsStr respectively, meaning that they work directly -on strings according to the local platform's path syntax.

- -

Simple usage

-

Path manipulation includes both parsing components from slices and building -new owned paths.

- -

To parse a path, you can create a Path slice from a str -slice and start asking questions:

- -
-use std::path::Path;
-
-let path = Path::new("/tmp/foo/bar.txt");
-let file = path.file_name();
-let extension = path.extension();
-let parent_dir = path.parent();
- -

To build or modify paths, use PathBuf:

- -
-use std::path::PathBuf;
-
-let mut path = PathBuf::from("c:\\");
-path.push("windows");
-path.push("system32");
-path.set_extension("dll");
- -

Path components and normalization

-

The path APIs are built around the notion of "components", which roughly -correspond to the substrings between path separators (/ and, on Windows, -\). The APIs for path parsing are largely specified in terms of the path's -components, so it's important to clearly understand how those are -determined.

- -

A path can always be reconstructed into an equivalent path by -putting together its components via push. Syntactically, the -paths may differ by the normalization described below.

- -

Component types

-

Components come in several types:

- -
    -

  • Normal components are the default: standard references to files or -directories. The path a/b has two normal components, a and b.

    • -

  • Current directory components represent the . character. For example, -./a has a current directory component and a normal component a.

    • -

  • The root directory component represents a separator that designates -starting from root. For example, /a/b has a root directory component -followed by normal components a and b.

    • -
- -

On Windows, an additional component type comes into play:

- -
    -
  • Prefix components, of which there is a large variety. For example, C: -and \\server\share are prefixes. The path C:windows has a prefix -component C: and a normal component windows; the path C:\windows has a -prefix component C:, a root directory component, and a normal component -windows.
    • -
- -

Normalization

-

Aside from splitting on the separator(s), there is a small amount of -"normalization":

- -
    -

  • Repeated separators are ignored: a/b and a//b both have components a -and b.

    • -

  • Occurrences of . are normalized away, except if they are at -the beginning of the path (in which case they are often meaningful -in terms of path searching). So, for example, a/./b, a/b/, -/a/b/. and a/b all have components a and b, but ./a/b -has a leading current directory component.

    • -
- -

No other normalization takes place by default. In particular, -a/c and a/b/../c are distinct, to account for the possibility -that b is a symbolic link (so its parent isn't a). Further -normalization is possible to build on top of the components APIs, -and will be included in this library in the near future.

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Components -

The core iterator giving the components of a path.

-
Display -

Helper struct for safely printing paths with format!() and {}

-
Iter -

An iterator over the components of a path, as OsStr slices.

-
Path -

A slice of a path (akin to str).

-
PathBuf -

An owned, mutable path (akin to String).

-
PrefixComponent -

A Windows path prefix, e.g. C: or \\server\share.

-
StripPrefixError -

An error returned from the Path::strip_prefix method indicating that the -prefix was not found in self.

-

Enums

- - - - - - - - -
Component -

A single component of a path.

-
Prefix -

Path prefixes (Windows only).

-

Constants

- - - - -
MAIN_SEPARATOR -

The primary separator for the current platform

-

Functions

- - - - -
is_separator -

Determines whether the character is one of the permitted path -separators for the current platform.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/path/sidebar-items.js b/doc/bitflags/__core/path/sidebar-items.js deleted file mode 100644 index de91086a..00000000 --- a/doc/bitflags/__core/path/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["MAIN_SEPARATOR","The primary separator for the current platform"]],"enum":[["Component","A single component of a path."],["Prefix","Path prefixes (Windows only)."]],"fn":[["is_separator","Determines whether the character is one of the permitted path separators for the current platform."]],"struct":[["Components","The core iterator giving the components of a path."],["Display","Helper struct for safely printing paths with `format!()` and `{}`"],["Iter","An iterator over the components of a path, as `OsStr` slices."],["Path","A slice of a path (akin to `str`)."],["PathBuf","An owned, mutable path (akin to `String`)."],["PrefixComponent","A Windows path prefix, e.g. `C:` or `\\server\\share`."],["StripPrefixError","An error returned from the `Path::strip_prefix` method indicating that the prefix was not found in `self`."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/path/struct.Components.html b/doc/bitflags/__core/path/struct.Components.html deleted file mode 100644 index a1f78cda..00000000 --- a/doc/bitflags/__core/path/struct.Components.html +++ /dev/null @@ -1,201 +0,0 @@ - - - - - - - - - - bitflags::__core::path::Components - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::path::Components - - [−] - - [src]

-
pub struct Components<'a> {
-    // some fields omitted
-}
1.0.0

The core iterator giving the components of a path.

- -

See the module documentation for an in-depth explanation of components and -their role in the API.

- -

Examples

-
-use std::path::Path;
-
-let path = Path::new("/tmp/foo/bar.txt");
-
-for component in path.components() {
-    println!("{:?}", component);
-}
-

Methods

impl<'a> Components<'a>

fn as_path(&self) -> &'a Path

-

Extracts a slice corresponding to the portion of the path remaining for iteration.

- -

Examples

-
-use std::path::Path;
-
-let mut components = Path::new("/tmp/foo/bar.txt").components();
-components.next();
-components.next();
-
-assert_eq!(Path::new("foo/bar.txt"), components.as_path());
-

Trait Implementations

impl<'a> AsRef<Path> for Components<'a>

fn as_ref(&self) -> &Path

-

impl<'a> AsRef<OsStr> for Components<'a>

fn as_ref(&self) -> &OsStr

-

impl<'a> Iterator for Components<'a>

type Item = Component<'a>

-

fn next(&mut self) -> Option<Component<'a>>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a> DoubleEndedIterator for Components<'a>

fn next_back(&mut self) -> Option<Component<'a>>

-

impl<'a> PartialEq<Components<'a>> for Components<'a>

fn eq(&self, other: &Components<'a>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a> Eq for Components<'a>

impl<'a> PartialOrd<Components<'a>> for Components<'a>

fn partial_cmp(&self, other: &Components<'a>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a> Ord for Components<'a>

fn cmp(&self, other: &Components<'a>) -> Ordering

-

Derived Implementations

impl<'a> Clone for Components<'a>

fn clone(&self) -> Components<'a>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/path/struct.Display.html b/doc/bitflags/__core/path/struct.Display.html deleted file mode 100644 index f1e2b8c3..00000000 --- a/doc/bitflags/__core/path/struct.Display.html +++ /dev/null @@ -1,117 +0,0 @@ - - - - - - - - - - bitflags::__core::path::Display - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::path::Display - - [−] - - [src]

-
pub struct Display<'a> {
-    // some fields omitted
-}
1.0.0

Helper struct for safely printing paths with format!() and {}

-

Trait Implementations

impl<'a> Debug for Display<'a>

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a> Display for Display<'a>

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/path/struct.Iter.html b/doc/bitflags/__core/path/struct.Iter.html deleted file mode 100644 index 45f7321a..00000000 --- a/doc/bitflags/__core/path/struct.Iter.html +++ /dev/null @@ -1,170 +0,0 @@ - - - - - - - - - - bitflags::__core::path::Iter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::path::Iter - - [−] - - [src]

-
pub struct Iter<'a> {
-    // some fields omitted
-}
1.0.0

An iterator over the components of a path, as OsStr slices.

-

Methods

impl<'a> Iter<'a>

fn as_path(&self) -> &'a Path

-

Extracts a slice corresponding to the portion of the path remaining for iteration.

-

Trait Implementations

impl<'a> AsRef<Path> for Iter<'a>

fn as_ref(&self) -> &Path

-

impl<'a> AsRef<OsStr> for Iter<'a>

fn as_ref(&self) -> &OsStr

-

impl<'a> Iterator for Iter<'a>

type Item = &'a OsStr

-

fn next(&mut self) -> Option<&'a OsStr>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a> DoubleEndedIterator for Iter<'a>

fn next_back(&mut self) -> Option<&'a OsStr>

-

Derived Implementations

impl<'a> Clone for Iter<'a>

fn clone(&self) -> Iter<'a>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/path/struct.Path.html b/doc/bitflags/__core/path/struct.Path.html deleted file mode 100644 index b72fc90a..00000000 --- a/doc/bitflags/__core/path/struct.Path.html +++ /dev/null @@ -1,561 +0,0 @@ - - - - - - - - - - bitflags::__core::path::Path - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::path::Path - - [−] - - [src]

-
pub struct Path {
-    // some fields omitted
-}
1.0.0

A slice of a path (akin to str).

- -

This type supports a number of operations for inspecting a path, including -breaking the path into its components (separated by / or \, depending on -the platform), extracting the file name, determining whether the path is -absolute, and so on. More details about the overall approach can be found in -the module documentation.

- -

This is an unsized type, meaning that it must always be used behind a -pointer like & or Box.

- -

Examples

-
-use std::path::Path;
-
-let path = Path::new("/tmp/foo/bar.txt");
-let file = path.file_name();
-let extension = path.extension();
-let parent_dir = path.parent();
-

Methods

impl Path

fn new<S>(s: &S) -> &Path where S: AsRef<OsStr> + ?Sized

-

Directly wrap a string slice as a Path slice.

- -

This is a cost-free conversion.

- -

Examples

-
-use std::path::Path;
-
-Path::new("foo.txt");
- -

You can create Paths from Strings, or even other Paths:

- -
-use std::path::Path;
-
-let string = String::from("foo.txt");
-let from_string = Path::new(&string);
-let from_path = Path::new(&from_string);
-assert_eq!(from_string, from_path);
-

fn as_os_str(&self) -> &OsStr

-

Yields the underlying OsStr slice.

- -

Examples

-
-use std::path::Path;
-
-let os_str = Path::new("foo.txt").as_os_str();
-assert_eq!(os_str, std::ffi::OsStr::new("foo.txt"));
-

fn to_str(&self) -> Option<&str>

-

Yields a &str slice if the Path is valid unicode.

- -

This conversion may entail doing a check for UTF-8 validity.

- -

Examples

-
-use std::path::Path;
-
-let path_str = Path::new("foo.txt").to_str();
-assert_eq!(path_str, Some("foo.txt"));
-

fn to_string_lossy(&self) -> Cow<str>

-

Converts a Path to a Cow<str>.

- -

Any non-Unicode sequences are replaced with U+FFFD REPLACEMENT CHARACTER.

- -

Examples

-
-use std::path::Path;
-
-let path_str = Path::new("foo.txt").to_string_lossy();
-assert_eq!(path_str, "foo.txt");
-

fn to_path_buf(&self) -> PathBuf

-

Converts a Path to an owned PathBuf.

- -

Examples

-
-use std::path::Path;
-
-let path_buf = Path::new("foo.txt").to_path_buf();
-assert_eq!(path_buf, std::path::PathBuf::from("foo.txt"));
-

fn is_absolute(&self) -> bool

-

A path is absolute if it is independent of the current directory.

- -
    -

  • On Unix, a path is absolute if it starts with the root, so -is_absolute and has_root are equivalent.

    • -

  • On Windows, a path is absolute if it has a prefix and starts with the -root: c:\windows is absolute, while c:temp and \temp are not. In -other words, path.is_absolute() == path.prefix().is_some() && path.has_root().

    • -
- -

Examples

-
-use std::path::Path;
-
-assert!(!Path::new("foo.txt").is_absolute());
-

fn is_relative(&self) -> bool

-

A path is relative if it is not absolute.

- -

Examples

-
-use std::path::Path;
-
-assert!(Path::new("foo.txt").is_relative());
-

fn has_root(&self) -> bool

-

A path has a root if the body of the path begins with the directory separator.

- -
    -

  • On Unix, a path has a root if it begins with /.

    • -

  • On Windows, a path has a root if it:

    - -
      -
    • has no prefix and begins with a separator, e.g. \\windows
      • -
    • has a prefix followed by a separator, e.g. c:\windows but not c:windows
      • -
    • has any non-disk prefix, e.g. \\server\share
      • -
    • -
- -

Examples

-
-use std::path::Path;
-
-assert!(Path::new("/etc/passwd").has_root());
-

fn parent(&self) -> Option<&Path>

-

The path without its final component, if any.

- -

Returns None if the path terminates in a root or prefix.

- -

Examples

-
-use std::path::Path;
-
-let path = Path::new("/foo/bar");
-let parent = path.parent().unwrap();
-assert_eq!(parent, Path::new("/foo"));
-
-let grand_parent = parent.parent().unwrap();
-assert_eq!(grand_parent, Path::new("/"));
-assert_eq!(grand_parent.parent(), None);
-

fn file_name(&self) -> Option<&OsStr>

-

The final component of the path, if it is a normal file.

- -

If the path terminates in ., .., or consists solely of a root of -prefix, file_name will return None.

- -

Examples

-
-use std::path::Path;
-use std::ffi::OsStr;
-
-let path = Path::new("foo.txt");
-let os_str = OsStr::new("foo.txt");
-
-assert_eq!(Some(os_str), path.file_name());
-

fn strip_prefix<P>(&'a self, base: &'a P) -> Result<&'a Path, StripPrefixError> where P: AsRef<Path> + ?Sized1.7.0

-

Returns a path that, when joined onto base, yields self.

- -

Errors

-

If base is not a prefix of self (i.e. starts_with -returns false), returns Err.

-

fn starts_with<P>(&self, base: P) -> bool where P: AsRef<Path>

-

Determines whether base is a prefix of self.

- -

Only considers whole path components to match.

- -

Examples

-
-use std::path::Path;
-
-let path = Path::new("/etc/passwd");
-
-assert!(path.starts_with("/etc"));
-
-assert!(!path.starts_with("/e"));
-

fn ends_with<P>(&self, child: P) -> bool where P: AsRef<Path>

-

Determines whether child is a suffix of self.

- -

Only considers whole path components to match.

- -

Examples

-
-use std::path::Path;
-
-let path = Path::new("/etc/passwd");
-
-assert!(path.ends_with("passwd"));
-

fn file_stem(&self) -> Option<&OsStr>

-

Extracts the stem (non-extension) portion of self.file_name().

- -

The stem is:

- -
    -
  • None, if there is no file name;
    • -
  • The entire file name if there is no embedded .;
    • -
  • The entire file name if the file name begins with . and has no other .s within;
    • -
  • Otherwise, the portion of the file name before the final .
    • -
- -

Examples

-
-use std::path::Path;
-
-let path = Path::new("foo.rs");
-
-assert_eq!("foo", path.file_stem().unwrap());
-

fn extension(&self) -> Option<&OsStr>

-

Extracts the extension of self.file_name(), if possible.

- -

The extension is:

- -
    -
  • None, if there is no file name;
    • -
  • None, if there is no embedded .;
    • -
  • None, if the file name begins with . and has no other .s within;
    • -
  • Otherwise, the portion of the file name after the final .
    • -
- -

Examples

-
-use std::path::Path;
-
-let path = Path::new("foo.rs");
-
-assert_eq!("rs", path.extension().unwrap());
-

fn join<P>(&self, path: P) -> PathBuf where P: AsRef<Path>

-

Creates an owned PathBuf with path adjoined to self.

- -

See PathBuf::push for more details on what it means to adjoin a path.

- -

Examples

-
-use std::path::{Path, PathBuf};
-
-assert_eq!(Path::new("/etc").join("passwd"), PathBuf::from("/etc/passwd"));
-

fn with_file_name<S>(&self, file_name: S) -> PathBuf where S: AsRef<OsStr>

-

Creates an owned PathBuf like self but with the given file name.

- -

See PathBuf::set_file_name for more details.

- -

Examples

-
-use std::path::{Path, PathBuf};
-
-let path = Path::new("/tmp/foo.txt");
-assert_eq!(path.with_file_name("bar.txt"), PathBuf::from("/tmp/bar.txt"));
-

fn with_extension<S>(&self, extension: S) -> PathBuf where S: AsRef<OsStr>

-

Creates an owned PathBuf like self but with the given extension.

- -

See PathBuf::set_extension for more details.

- -

Examples

-
-use std::path::{Path, PathBuf};
-
-let path = Path::new("foo.rs");
-assert_eq!(path.with_extension("txt"), PathBuf::from("foo.txt"));
-

fn components(&self) -> Components

-

Produce an iterator over the components of the path.

- -

Examples

-
-use std::path::{Path, Component};
-use std::ffi::OsStr;
-
-let mut components = Path::new("/tmp/foo.txt").components();
-
-assert_eq!(components.next(), Some(Component::RootDir));
-assert_eq!(components.next(), Some(Component::Normal(OsStr::new("tmp"))));
-assert_eq!(components.next(), Some(Component::Normal(OsStr::new("foo.txt"))));
-assert_eq!(components.next(), None)
-

fn iter(&self) -> Iter

-

Produce an iterator over the path's components viewed as OsStr slices.

- -

Examples

-
-use std::path::{self, Path};
-use std::ffi::OsStr;
-
-let mut it = Path::new("/tmp/foo.txt").iter();
-assert_eq!(it.next(), Some(OsStr::new(&path::MAIN_SEPARATOR.to_string())));
-assert_eq!(it.next(), Some(OsStr::new("tmp")));
-assert_eq!(it.next(), Some(OsStr::new("foo.txt")));
-assert_eq!(it.next(), None)
-

fn display(&self) -> Display

-

Returns an object that implements Display for safely printing paths -that may contain non-Unicode data.

- -

Examples

-
-use std::path::Path;
-
-let path = Path::new("/tmp/foo.rs");
-
-println!("{}", path.display());
-

fn metadata(&self) -> Result<Metadata, Error>1.5.0

-

Query the file system to get information about a file, directory, etc.

- -

This function will traverse symbolic links to query information about the -destination file.

- -

This is an alias to fs::metadata.

-
-

Query the metadata about a file without following symlinks.

- -

This is an alias to fs::symlink_metadata.

-

fn canonicalize(&self) -> Result<PathBuf, Error>1.5.0

-

Returns the canonical form of the path with all intermediate components -normalized and symbolic links resolved.

- -

This is an alias to fs::canonicalize.

-
-

Reads a symbolic link, returning the file that the link points to.

- -

This is an alias to fs::read_link.

-

fn read_dir(&self) -> Result<ReadDir, Error>1.5.0

-

Returns an iterator over the entries within a directory.

- -

The iterator will yield instances of io::Result<DirEntry>. New errors may -be encountered after an iterator is initially constructed.

- -

This is an alias to fs::read_dir.

-

fn exists(&self) -> bool1.5.0

-

Returns whether the path points at an existing entity.

- -

This function will traverse symbolic links to query information about the -destination file. In case of broken symbolic links this will return false.

- -

Examples

-
-use std::path::Path;
-assert_eq!(Path::new("does_not_exist.txt").exists(), false);
-

fn is_file(&self) -> bool1.5.0

-

Returns whether the path is pointing at a regular file.

- -

This function will traverse symbolic links to query information about the -destination file. In case of broken symbolic links this will return false.

- -

Examples

-
-use std::path::Path;
-assert_eq!(Path::new("./is_a_directory/").is_file(), false);
-assert_eq!(Path::new("a_file.txt").is_file(), true);
-

fn is_dir(&self) -> bool1.5.0

-

Returns whether the path is pointing at a directory.

- -

This function will traverse symbolic links to query information about the -destination file. In case of broken symbolic links this will return false.

- -

Examples

-
-use std::path::Path;
-assert_eq!(Path::new("./is_a_directory/").is_dir(), true);
-assert_eq!(Path::new("a_file.txt").is_dir(), false);
-

Trait Implementations

impl ToOwned for Path

type Owned = PathBuf

-

fn to_owned(&self) -> PathBuf

-

impl AsRef<OsStr> for Path

fn as_ref(&self) -> &OsStr

-

impl Debug for Path

fn fmt(&self, formatter: &mut Formatter) -> Result<(), Error>

-

impl PartialEq<Path> for Path

fn eq(&self, other: &Path) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl Hash for Path

fn hash<H>(&self, h: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl Eq for Path

impl PartialOrd<Path> for Path

fn partial_cmp(&self, other: &Path) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl Ord for Path

fn cmp(&self, other: &Path) -> Ordering

-

impl AsRef<Path> for Path

fn as_ref(&self) -> &Path

-

impl<'a> IntoIterator for &'a Path1.6.0

type Item = &'a OsStr

-

type IntoIter = Iter<'a>

-

fn into_iter(self) -> Iter<'a>

-

impl<'a, 'b> PartialEq<PathBuf> for Path1.6.0

fn eq(&self, other: &PathBuf) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<PathBuf> for Path1.8.0

fn partial_cmp(&self, other: &PathBuf) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<PathBuf> for &'a Path1.6.0

fn eq(&self, other: &PathBuf) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<PathBuf> for &'a Path1.8.0

fn partial_cmp(&self, other: &PathBuf) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Cow<'a, Path>> for Path1.6.0

fn eq(&self, other: &Cow<'a, Path>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Cow<'a, Path>> for Path1.8.0

fn partial_cmp(&self, other: &Cow<'a, Path>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Cow<'a, Path>> for &'b Path1.6.0

fn eq(&self, other: &Cow<'a, Path>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Cow<'a, Path>> for &'b Path1.8.0

fn partial_cmp(&self, other: &Cow<'a, Path>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<OsStr> for Path1.8.0

fn eq(&self, other: &OsStr) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<OsStr> for Path1.8.0

fn partial_cmp(&self, other: &OsStr) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<&'a OsStr> for Path1.8.0

fn eq(&self, other: &&'a OsStr) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<&'a OsStr> for Path1.8.0

fn partial_cmp(&self, other: &&'a OsStr) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Cow<'a, OsStr>> for Path1.8.0

fn eq(&self, other: &Cow<'a, OsStr>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for Path1.8.0

fn partial_cmp(&self, other: &Cow<'a, OsStr>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<OsString> for Path1.8.0

fn eq(&self, other: &OsString) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<OsString> for Path1.8.0

fn partial_cmp(&self, other: &OsString) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<OsStr> for &'a Path1.8.0

fn eq(&self, other: &OsStr) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<OsStr> for &'a Path1.8.0

fn partial_cmp(&self, other: &OsStr) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Cow<'b, OsStr>> for &'a Path1.8.0

fn eq(&self, other: &Cow<'b, OsStr>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Cow<'b, OsStr>> for &'a Path1.8.0

fn partial_cmp(&self, other: &Cow<'b, OsStr>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<OsString> for &'a Path1.8.0

fn eq(&self, other: &OsString) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<OsString> for &'a Path1.8.0

fn partial_cmp(&self, other: &OsString) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/path/struct.PathBuf.html b/doc/bitflags/__core/path/struct.PathBuf.html deleted file mode 100644 index 0398dee5..00000000 --- a/doc/bitflags/__core/path/struct.PathBuf.html +++ /dev/null @@ -1,580 +0,0 @@ - - - - - - - - - - bitflags::__core::path::PathBuf - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::path::PathBuf - - [−] - - [src]

-
pub struct PathBuf {
-    // some fields omitted
-}
1.0.0

An owned, mutable path (akin to String).

- -

This type provides methods like push and set_extension that mutate the -path in place. It also implements Deref to Path, meaning that all -methods on Path slices are available on PathBuf values as well.

- -

More details about the overall approach can be found in -the module documentation.

- -

Examples

-
-use std::path::PathBuf;
-
-let mut path = PathBuf::from("c:\\");
-path.push("windows");
-path.push("system32");
-path.set_extension("dll");
-

Methods

impl PathBuf

fn new() -> PathBuf

-

Allocates an empty PathBuf.

-

fn as_path(&self) -> &Path

-

Coerces to a Path slice.

-

fn push<P>(&mut self, path: P) where P: AsRef<Path>

-

Extends self with path.

- -

If path is absolute, it replaces the current path.

- -

On Windows:

- -
    -
  • if path has a root but no prefix (e.g. \windows), it -replaces everything except for the prefix (if any) of self.
    • -
  • if path has a prefix but no root, it replaces self.
    • -
- -

Examples

-
-use std::path::PathBuf;
-
-let mut path = PathBuf::new();
-path.push("/tmp");
-path.push("file.bk");
-assert_eq!(path, PathBuf::from("/tmp/file.bk"));
-
-// Pushing an absolute path replaces the current path
-path.push("/etc/passwd");
-assert_eq!(path, PathBuf::from("/etc/passwd"));
-

fn pop(&mut self) -> bool

-

Truncate self to self.parent().

- -

Returns false and does nothing if self.file_name() is None. -Otherwise, returns true.

-

fn set_file_name<S>(&mut self, file_name: S) where S: AsRef<OsStr>

-

Updates self.file_name() to file_name.

- -

If self.file_name() was None, this is equivalent to pushing -file_name.

- -

Examples

-
-use std::path::PathBuf;
-
-let mut buf = PathBuf::from("/");
-assert!(buf.file_name() == None);
-buf.set_file_name("bar");
-assert!(buf == PathBuf::from("/bar"));
-assert!(buf.file_name().is_some());
-buf.set_file_name("baz.txt");
-assert!(buf == PathBuf::from("/baz.txt"));
-

fn set_extension<S>(&mut self, extension: S) -> bool where S: AsRef<OsStr>

-

Updates self.extension() to extension.

- -

If self.file_name() is None, does nothing and returns false.

- -

Otherwise, returns true; if self.extension() is None, the extension -is added; otherwise it is replaced.

-

fn into_os_string(self) -> OsString

-

Consumes the PathBuf, yielding its internal OsString storage.

-

Methods from Deref<Target=Path>

fn as_os_str(&self) -> &OsStr

-

Yields the underlying OsStr slice.

- -

Examples

-
-use std::path::Path;
-
-let os_str = Path::new("foo.txt").as_os_str();
-assert_eq!(os_str, std::ffi::OsStr::new("foo.txt"));
-

fn to_str(&self) -> Option<&str>

-

Yields a &str slice if the Path is valid unicode.

- -

This conversion may entail doing a check for UTF-8 validity.

- -

Examples

-
-use std::path::Path;
-
-let path_str = Path::new("foo.txt").to_str();
-assert_eq!(path_str, Some("foo.txt"));
-

fn to_string_lossy(&self) -> Cow<str>

-

Converts a Path to a Cow<str>.

- -

Any non-Unicode sequences are replaced with U+FFFD REPLACEMENT CHARACTER.

- -

Examples

-
-use std::path::Path;
-
-let path_str = Path::new("foo.txt").to_string_lossy();
-assert_eq!(path_str, "foo.txt");
-

fn to_path_buf(&self) -> PathBuf

-

Converts a Path to an owned PathBuf.

- -

Examples

-
-use std::path::Path;
-
-let path_buf = Path::new("foo.txt").to_path_buf();
-assert_eq!(path_buf, std::path::PathBuf::from("foo.txt"));
-

fn is_absolute(&self) -> bool

-

A path is absolute if it is independent of the current directory.

- -
    -

  • On Unix, a path is absolute if it starts with the root, so -is_absolute and has_root are equivalent.

    • -

  • On Windows, a path is absolute if it has a prefix and starts with the -root: c:\windows is absolute, while c:temp and \temp are not. In -other words, path.is_absolute() == path.prefix().is_some() && path.has_root().

    • -
- -

Examples

-
-use std::path::Path;
-
-assert!(!Path::new("foo.txt").is_absolute());
-

fn is_relative(&self) -> bool

-

A path is relative if it is not absolute.

- -

Examples

-
-use std::path::Path;
-
-assert!(Path::new("foo.txt").is_relative());
-

fn has_root(&self) -> bool

-

A path has a root if the body of the path begins with the directory separator.

- -
    -

  • On Unix, a path has a root if it begins with /.

    • -

  • On Windows, a path has a root if it:

    - -
      -
    • has no prefix and begins with a separator, e.g. \\windows
      • -
    • has a prefix followed by a separator, e.g. c:\windows but not c:windows
      • -
    • has any non-disk prefix, e.g. \\server\share
      • -
    • -
- -

Examples

-
-use std::path::Path;
-
-assert!(Path::new("/etc/passwd").has_root());
-

fn parent(&self) -> Option<&Path>

-

The path without its final component, if any.

- -

Returns None if the path terminates in a root or prefix.

- -

Examples

-
-use std::path::Path;
-
-let path = Path::new("/foo/bar");
-let parent = path.parent().unwrap();
-assert_eq!(parent, Path::new("/foo"));
-
-let grand_parent = parent.parent().unwrap();
-assert_eq!(grand_parent, Path::new("/"));
-assert_eq!(grand_parent.parent(), None);
-

fn file_name(&self) -> Option<&OsStr>

-

The final component of the path, if it is a normal file.

- -

If the path terminates in ., .., or consists solely of a root of -prefix, file_name will return None.

- -

Examples

-
-use std::path::Path;
-use std::ffi::OsStr;
-
-let path = Path::new("foo.txt");
-let os_str = OsStr::new("foo.txt");
-
-assert_eq!(Some(os_str), path.file_name());
-

fn strip_prefix<P>(&'a self, base: &'a P) -> Result<&'a Path, StripPrefixError> where P: AsRef<Path> + ?Sized1.7.0

-

Returns a path that, when joined onto base, yields self.

- -

Errors

-

If base is not a prefix of self (i.e. starts_with -returns false), returns Err.

-

fn starts_with<P>(&self, base: P) -> bool where P: AsRef<Path>

-

Determines whether base is a prefix of self.

- -

Only considers whole path components to match.

- -

Examples

-
-use std::path::Path;
-
-let path = Path::new("/etc/passwd");
-
-assert!(path.starts_with("/etc"));
-
-assert!(!path.starts_with("/e"));
-

fn ends_with<P>(&self, child: P) -> bool where P: AsRef<Path>

-

Determines whether child is a suffix of self.

- -

Only considers whole path components to match.

- -

Examples

-
-use std::path::Path;
-
-let path = Path::new("/etc/passwd");
-
-assert!(path.ends_with("passwd"));
-

fn file_stem(&self) -> Option<&OsStr>

-

Extracts the stem (non-extension) portion of self.file_name().

- -

The stem is:

- -
    -
  • None, if there is no file name;
    • -
  • The entire file name if there is no embedded .;
    • -
  • The entire file name if the file name begins with . and has no other .s within;
    • -
  • Otherwise, the portion of the file name before the final .
    • -
- -

Examples

-
-use std::path::Path;
-
-let path = Path::new("foo.rs");
-
-assert_eq!("foo", path.file_stem().unwrap());
-

fn extension(&self) -> Option<&OsStr>

-

Extracts the extension of self.file_name(), if possible.

- -

The extension is:

- -
    -
  • None, if there is no file name;
    • -
  • None, if there is no embedded .;
    • -
  • None, if the file name begins with . and has no other .s within;
    • -
  • Otherwise, the portion of the file name after the final .
    • -
- -

Examples

-
-use std::path::Path;
-
-let path = Path::new("foo.rs");
-
-assert_eq!("rs", path.extension().unwrap());
-

fn join<P>(&self, path: P) -> PathBuf where P: AsRef<Path>

-

Creates an owned PathBuf with path adjoined to self.

- -

See PathBuf::push for more details on what it means to adjoin a path.

- -

Examples

-
-use std::path::{Path, PathBuf};
-
-assert_eq!(Path::new("/etc").join("passwd"), PathBuf::from("/etc/passwd"));
-

fn with_file_name<S>(&self, file_name: S) -> PathBuf where S: AsRef<OsStr>

-

Creates an owned PathBuf like self but with the given file name.

- -

See PathBuf::set_file_name for more details.

- -

Examples

-
-use std::path::{Path, PathBuf};
-
-let path = Path::new("/tmp/foo.txt");
-assert_eq!(path.with_file_name("bar.txt"), PathBuf::from("/tmp/bar.txt"));
-

fn with_extension<S>(&self, extension: S) -> PathBuf where S: AsRef<OsStr>

-

Creates an owned PathBuf like self but with the given extension.

- -

See PathBuf::set_extension for more details.

- -

Examples

-
-use std::path::{Path, PathBuf};
-
-let path = Path::new("foo.rs");
-assert_eq!(path.with_extension("txt"), PathBuf::from("foo.txt"));
-

fn components(&self) -> Components

-

Produce an iterator over the components of the path.

- -

Examples

-
-use std::path::{Path, Component};
-use std::ffi::OsStr;
-
-let mut components = Path::new("/tmp/foo.txt").components();
-
-assert_eq!(components.next(), Some(Component::RootDir));
-assert_eq!(components.next(), Some(Component::Normal(OsStr::new("tmp"))));
-assert_eq!(components.next(), Some(Component::Normal(OsStr::new("foo.txt"))));
-assert_eq!(components.next(), None)
-

fn iter(&self) -> Iter

-

Produce an iterator over the path's components viewed as OsStr slices.

- -

Examples

-
-use std::path::{self, Path};
-use std::ffi::OsStr;
-
-let mut it = Path::new("/tmp/foo.txt").iter();
-assert_eq!(it.next(), Some(OsStr::new(&path::MAIN_SEPARATOR.to_string())));
-assert_eq!(it.next(), Some(OsStr::new("tmp")));
-assert_eq!(it.next(), Some(OsStr::new("foo.txt")));
-assert_eq!(it.next(), None)
-

fn display(&self) -> Display

-

Returns an object that implements Display for safely printing paths -that may contain non-Unicode data.

- -

Examples

-
-use std::path::Path;
-
-let path = Path::new("/tmp/foo.rs");
-
-println!("{}", path.display());
-

fn metadata(&self) -> Result<Metadata, Error>1.5.0

-

Query the file system to get information about a file, directory, etc.

- -

This function will traverse symbolic links to query information about the -destination file.

- -

This is an alias to fs::metadata.

-
-

Query the metadata about a file without following symlinks.

- -

This is an alias to fs::symlink_metadata.

-

fn canonicalize(&self) -> Result<PathBuf, Error>1.5.0

-

Returns the canonical form of the path with all intermediate components -normalized and symbolic links resolved.

- -

This is an alias to fs::canonicalize.

-
-

Reads a symbolic link, returning the file that the link points to.

- -

This is an alias to fs::read_link.

-

fn read_dir(&self) -> Result<ReadDir, Error>1.5.0

-

Returns an iterator over the entries within a directory.

- -

The iterator will yield instances of io::Result<DirEntry>. New errors may -be encountered after an iterator is initially constructed.

- -

This is an alias to fs::read_dir.

-

fn exists(&self) -> bool1.5.0

-

Returns whether the path points at an existing entity.

- -

This function will traverse symbolic links to query information about the -destination file. In case of broken symbolic links this will return false.

- -

Examples

-
-use std::path::Path;
-assert_eq!(Path::new("does_not_exist.txt").exists(), false);
-

fn is_file(&self) -> bool1.5.0

-

Returns whether the path is pointing at a regular file.

- -

This function will traverse symbolic links to query information about the -destination file. In case of broken symbolic links this will return false.

- -

Examples

-
-use std::path::Path;
-assert_eq!(Path::new("./is_a_directory/").is_file(), false);
-assert_eq!(Path::new("a_file.txt").is_file(), true);
-

fn is_dir(&self) -> bool1.5.0

-

Returns whether the path is pointing at a directory.

- -

This function will traverse symbolic links to query information about the -destination file. In case of broken symbolic links this will return false.

- -

Examples

-
-use std::path::Path;
-assert_eq!(Path::new("./is_a_directory/").is_dir(), true);
-assert_eq!(Path::new("a_file.txt").is_dir(), false);
-

Trait Implementations

impl<'a, T> From<&'a T> for PathBuf where T: AsRef<OsStr> + ?Sized

fn from(s: &'a T) -> PathBuf

-

impl From<OsString> for PathBuf

fn from(s: OsString) -> PathBuf

-

impl From<String> for PathBuf

fn from(s: String) -> PathBuf

-

impl<P> FromIterator<P> for PathBuf where P: AsRef<Path>

fn from_iter<I>(iter: I) -> PathBuf where I: IntoIterator<Item=P>

-

impl<P> Extend<P> for PathBuf where P: AsRef<Path>

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=P>

-

impl Debug for PathBuf

fn fmt(&self, formatter: &mut Formatter) -> Result<(), Error>

-

impl Deref for PathBuf

type Target = Path

-

fn deref(&self) -> &Path

-

impl Borrow<Path> for PathBuf

fn borrow(&self) -> &Path

-

impl PartialEq<PathBuf> for PathBuf

fn eq(&self, other: &PathBuf) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl Hash for PathBuf

fn hash<H>(&self, h: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl Eq for PathBuf

impl PartialOrd<PathBuf> for PathBuf

fn partial_cmp(&self, other: &PathBuf) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl Ord for PathBuf

fn cmp(&self, other: &PathBuf) -> Ordering

-

impl AsRef<OsStr> for PathBuf

fn as_ref(&self) -> &OsStr

-

impl Into<OsString> for PathBuf

fn into(self) -> OsString

-

impl AsRef<Path> for PathBuf

fn as_ref(&self) -> &Path

-

impl<'a> IntoIterator for &'a PathBuf1.6.0

type Item = &'a OsStr

-

type IntoIter = Iter<'a>

-

fn into_iter(self) -> Iter<'a>

-

impl<'a, 'b> PartialEq<Path> for PathBuf1.6.0

fn eq(&self, other: &Path) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Path> for PathBuf1.8.0

fn partial_cmp(&self, other: &Path) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<&'a Path> for PathBuf1.6.0

fn eq(&self, other: &&'a Path) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<&'a Path> for PathBuf1.8.0

fn partial_cmp(&self, other: &&'a Path) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Cow<'a, Path>> for PathBuf1.6.0

fn eq(&self, other: &Cow<'a, Path>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Cow<'a, Path>> for PathBuf1.8.0

fn partial_cmp(&self, other: &Cow<'a, Path>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<OsStr> for PathBuf1.8.0

fn eq(&self, other: &OsStr) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<OsStr> for PathBuf1.8.0

fn partial_cmp(&self, other: &OsStr) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<&'a OsStr> for PathBuf1.8.0

fn eq(&self, other: &&'a OsStr) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<&'a OsStr> for PathBuf1.8.0

fn partial_cmp(&self, other: &&'a OsStr) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<Cow<'a, OsStr>> for PathBuf1.8.0

fn eq(&self, other: &Cow<'a, OsStr>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for PathBuf1.8.0

fn partial_cmp(&self, other: &Cow<'a, OsStr>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialEq<OsString> for PathBuf1.8.0

fn eq(&self, other: &OsString) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a, 'b> PartialOrd<OsString> for PathBuf1.8.0

fn partial_cmp(&self, other: &OsString) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

Derived Implementations

impl Clone for PathBuf

fn clone(&self) -> PathBuf

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/path/struct.PrefixComponent.html b/doc/bitflags/__core/path/struct.PrefixComponent.html deleted file mode 100644 index 6c93c6d8..00000000 --- a/doc/bitflags/__core/path/struct.PrefixComponent.html +++ /dev/null @@ -1,134 +0,0 @@ - - - - - - - - - - bitflags::__core::path::PrefixComponent - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::path::PrefixComponent - - [−] - - [src]

-
pub struct PrefixComponent<'a> {
-    // some fields omitted
-}
1.0.0

A Windows path prefix, e.g. C: or \\server\share.

- -

Does not occur on Unix.

-

Methods

impl<'a> PrefixComponent<'a>

fn kind(&self) -> Prefix<'a>

-

The parsed prefix data.

-

fn as_os_str(&self) -> &'a OsStr

-

The raw OsStr slice for this prefix.

-

Trait Implementations

impl<'a> PartialEq<PrefixComponent<'a>> for PrefixComponent<'a>

fn eq(&self, other: &PrefixComponent<'a>) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-

impl<'a> PartialOrd<PrefixComponent<'a>> for PrefixComponent<'a>

fn partial_cmp(&self, other: &PrefixComponent<'a>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<'a> Ord for PrefixComponent<'a>

fn cmp(&self, other: &PrefixComponent<'a>) -> Ordering

-

impl<'a> Hash for PrefixComponent<'a>

fn hash<H>(&self, h: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

Derived Implementations

impl<'a> Debug for PrefixComponent<'a>

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<'a> Eq for PrefixComponent<'a>

impl<'a> Clone for PrefixComponent<'a>

fn clone(&self) -> PrefixComponent<'a>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a> Copy for PrefixComponent<'a>

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/path/struct.StripPrefixError.html b/doc/bitflags/__core/path/struct.StripPrefixError.html deleted file mode 100644 index d387fc40..00000000 --- a/doc/bitflags/__core/path/struct.StripPrefixError.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - bitflags::__core::path::StripPrefixError - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::path::StripPrefixError - - [−] - - [src]

-
pub struct StripPrefixError(_);
1.7.0

An error returned from the Path::strip_prefix method indicating that the -prefix was not found in self.

-

Trait Implementations

impl Display for StripPrefixError

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl Error for StripPrefixError

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>1.0.0

-

Derived Implementations

impl Eq for StripPrefixError

impl PartialEq<StripPrefixError> for StripPrefixError

fn eq(&self, __arg_0: &StripPrefixError) -> bool

-

fn ne(&self, __arg_0: &StripPrefixError) -> bool

-

impl Clone for StripPrefixError

fn clone(&self) -> StripPrefixError

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Debug for StripPrefixError

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/index.html b/doc/bitflags/__core/prelude/index.html deleted file mode 100644 index d7c2e8ab..00000000 --- a/doc/bitflags/__core/prelude/index.html +++ /dev/null @@ -1,193 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::prelude - - [−] - - [src]

-

The Rust Prelude.

- -

Rust comes with a variety of things in its standard library. However, if -you had to manually import every single thing that you used, it would be -very verbose. But importing a lot of things that a program never uses isn't -good either. A balance needs to be struck.

- -

The prelude is the list of things that Rust automatically imports into -every Rust program. It's kept as small as possible, and is focused on -things, particularly traits, which are used in almost every single Rust -program.

- -

On a technical level, Rust inserts

- -
-extern crate std;
- -

into the crate root of every crate, and

- -
-use std::prelude::v1::*;
- -

into every module.

- -

Other preludes

-

Preludes can be seen as a pattern to make using multiple types more -convenient. As such, you'll find other preludes in the standard library, -such as std::io::prelude. Various libraries in the Rust ecosystem may -also define their own preludes.

- -

The difference between 'the prelude' and these other preludes is that they -are not automatically use'd, and must be imported manually. This is still -easier than importing all of their constituent components.

- -

Prelude contents

-

The current version of the prelude (version 1) lives in -std::prelude::v1, and reexports the following.

- - -

Modules

- - - - -
v1 -

The first version of the prelude of The Rust Standard Library.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/sidebar-items.js b/doc/bitflags/__core/prelude/sidebar-items.js deleted file mode 100644 index cf56ffab..00000000 --- a/doc/bitflags/__core/prelude/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"mod":[["v1","The first version of the prelude of The Rust Standard Library."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/enum.Option.html b/doc/bitflags/__core/prelude/v1/enum.Option.html deleted file mode 100644 index 9df65a42..00000000 --- a/doc/bitflags/__core/prelude/v1/enum.Option.html +++ /dev/null @@ -1,450 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Option - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::prelude::v1::Option - - [−] - - [src]

-
pub enum Option<T> {
-    None,
-    Some(T),
-}
1.0.0

The Option type. See the module level documentation for more.

-

Variants

-
None

No value

-
Some

Some value T

-

Methods

impl<T> Option<T>

fn is_some(&self) -> bool

-

Returns true if the option is a Some value

- -

Examples

-
-let x: Option<u32> = Some(2);
-assert_eq!(x.is_some(), true);
-
-let x: Option<u32> = None;
-assert_eq!(x.is_some(), false);
-

fn is_none(&self) -> bool

-

Returns true if the option is a None value

- -

Examples

-
-let x: Option<u32> = Some(2);
-assert_eq!(x.is_none(), false);
-
-let x: Option<u32> = None;
-assert_eq!(x.is_none(), true);
-

fn as_ref(&self) -> Option<&T>

-

Converts from Option<T> to Option<&T>

- -

Examples

-

Convert an Option<String> into an Option<usize>, preserving the original. -The map method takes the self argument by value, consuming the original, -so this technique uses as_ref to first take an Option to a reference -to the value inside the original.

- -
-let num_as_str: Option<String> = Some("10".to_string());
-// First, cast `Option<String>` to `Option<&String>` with `as_ref`,
-// then consume *that* with `map`, leaving `num_as_str` on the stack.
-let num_as_int: Option<usize> = num_as_str.as_ref().map(|n| n.len());
-println!("still can print num_as_str: {:?}", num_as_str);
-

fn as_mut(&mut self) -> Option<&mut T>

-

Converts from Option<T> to Option<&mut T>

- -

Examples

-
-let mut x = Some(2);
-match x.as_mut() {
-    Some(v) => *v = 42,
-    None => {},
-}
-assert_eq!(x, Some(42));
-

fn expect(self, msg: &str) -> T

-

Unwraps an option, yielding the content of a Some.

- -

Panics

-

Panics if the value is a None with a custom panic message provided by -msg.

- -

Examples

-
-let x = Some("value");
-assert_eq!(x.expect("the world is ending"), "value");
- -
-let x: Option<&str> = None;
-x.expect("the world is ending"); // panics with `the world is ending`
-

fn unwrap(self) -> T

-

Moves the value v out of the Option<T> if it is Some(v).

- -

Panics

-

Panics if the self value equals None.

- -

Safety note

-

In general, because this function may panic, its use is discouraged. -Instead, prefer to use pattern matching and handle the None -case explicitly.

- -

Examples

-
-let x = Some("air");
-assert_eq!(x.unwrap(), "air");
- -
-let x: Option<&str> = None;
-assert_eq!(x.unwrap(), "air"); // fails
-

fn unwrap_or(self, def: T) -> T

-

Returns the contained value or a default.

- -

Examples

-
-assert_eq!(Some("car").unwrap_or("bike"), "car");
-assert_eq!(None.unwrap_or("bike"), "bike");
-

fn unwrap_or_else<F>(self, f: F) -> T where F: FnOnce() -> T

-

Returns the contained value or computes it from a closure.

- -

Examples

-
-let k = 10;
-assert_eq!(Some(4).unwrap_or_else(|| 2 * k), 4);
-assert_eq!(None.unwrap_or_else(|| 2 * k), 20);
-

fn map<U, F>(self, f: F) -> Option<U> where F: FnOnce(T) -> U

-

Maps an Option<T> to Option<U> by applying a function to a contained value

- -

Examples

-

Convert an Option<String> into an Option<usize>, consuming the original:

- -
-let maybe_some_string = Some(String::from("Hello, World!"));
-// `Option::map` takes self *by value*, consuming `maybe_some_string`
-let maybe_some_len = maybe_some_string.map(|s| s.len());
-
-assert_eq!(maybe_some_len, Some(13));
-

fn map_or<U, F>(self, default: U, f: F) -> U where F: FnOnce(T) -> U

-

Applies a function to the contained value (if any), -or returns a default (if not).

- -

Examples

-
-let x = Some("foo");
-assert_eq!(x.map_or(42, |v| v.len()), 3);
-
-let x: Option<&str> = None;
-assert_eq!(x.map_or(42, |v| v.len()), 42);
-

fn map_or_else<U, D, F>(self, default: D, f: F) -> U where D: FnOnce() -> U, F: FnOnce(T) -> U

-

Applies a function to the contained value (if any), -or computes a default (if not).

- -

Examples

-
-let k = 21;
-
-let x = Some("foo");
-assert_eq!(x.map_or_else(|| 2 * k, |v| v.len()), 3);
-
-let x: Option<&str> = None;
-assert_eq!(x.map_or_else(|| 2 * k, |v| v.len()), 42);
-

fn ok_or<E>(self, err: E) -> Result<T, E>

-

Transforms the Option<T> into a Result<T, E>, mapping Some(v) to -Ok(v) and None to Err(err).

- -

Examples

-
-let x = Some("foo");
-assert_eq!(x.ok_or(0), Ok("foo"));
-
-let x: Option<&str> = None;
-assert_eq!(x.ok_or(0), Err(0));
-

fn ok_or_else<E, F>(self, err: F) -> Result<T, E> where F: FnOnce() -> E

-

Transforms the Option<T> into a Result<T, E>, mapping Some(v) to -Ok(v) and None to Err(err()).

- -

Examples

-
-let x = Some("foo");
-assert_eq!(x.ok_or_else(|| 0), Ok("foo"));
-
-let x: Option<&str> = None;
-assert_eq!(x.ok_or_else(|| 0), Err(0));
-

fn iter(&self) -> Iter<T>

-

Returns an iterator over the possibly contained value.

- -

Examples

-
-let x = Some(4);
-assert_eq!(x.iter().next(), Some(&4));
-
-let x: Option<u32> = None;
-assert_eq!(x.iter().next(), None);
-

fn iter_mut(&mut self) -> IterMut<T>

-

Returns a mutable iterator over the possibly contained value.

- -

Examples

-
-let mut x = Some(4);
-match x.iter_mut().next() {
-    Some(v) => *v = 42,
-    None => {},
-}
-assert_eq!(x, Some(42));
-
-let mut x: Option<u32> = None;
-assert_eq!(x.iter_mut().next(), None);
-

fn and<U>(self, optb: Option<U>) -> Option<U>

-

Returns None if the option is None, otherwise returns optb.

- -

Examples

-
-let x = Some(2);
-let y: Option<&str> = None;
-assert_eq!(x.and(y), None);
-
-let x: Option<u32> = None;
-let y = Some("foo");
-assert_eq!(x.and(y), None);
-
-let x = Some(2);
-let y = Some("foo");
-assert_eq!(x.and(y), Some("foo"));
-
-let x: Option<u32> = None;
-let y: Option<&str> = None;
-assert_eq!(x.and(y), None);
-

fn and_then<U, F>(self, f: F) -> Option<U> where F: FnOnce(T) -> Option<U>

-

Returns None if the option is None, otherwise calls f with the -wrapped value and returns the result.

- -

Some languages call this operation flatmap.

- -

Examples

-
-fn sq(x: u32) -> Option<u32> { Some(x * x) }
-fn nope(_: u32) -> Option<u32> { None }
-
-assert_eq!(Some(2).and_then(sq).and_then(sq), Some(16));
-assert_eq!(Some(2).and_then(sq).and_then(nope), None);
-assert_eq!(Some(2).and_then(nope).and_then(sq), None);
-assert_eq!(None.and_then(sq).and_then(sq), None);
-

fn or(self, optb: Option<T>) -> Option<T>

-

Returns the option if it contains a value, otherwise returns optb.

- -

Examples

-
-let x = Some(2);
-let y = None;
-assert_eq!(x.or(y), Some(2));
-
-let x = None;
-let y = Some(100);
-assert_eq!(x.or(y), Some(100));
-
-let x = Some(2);
-let y = Some(100);
-assert_eq!(x.or(y), Some(2));
-
-let x: Option<u32> = None;
-let y = None;
-assert_eq!(x.or(y), None);
-

fn or_else<F>(self, f: F) -> Option<T> where F: FnOnce() -> Option<T>

-

Returns the option if it contains a value, otherwise calls f and -returns the result.

- -

Examples

-
-fn nobody() -> Option<&'static str> { None }
-fn vikings() -> Option<&'static str> { Some("vikings") }
-
-assert_eq!(Some("barbarians").or_else(vikings), Some("barbarians"));
-assert_eq!(None.or_else(vikings), Some("vikings"));
-assert_eq!(None.or_else(nobody), None);
-

fn take(&mut self) -> Option<T>

-

Takes the value out of the option, leaving a None in its place.

- -

Examples

-
-let mut x = Some(2);
-x.take();
-assert_eq!(x, None);
-
-let mut x: Option<u32> = None;
-x.take();
-assert_eq!(x, None);
-

impl<'a, T> Option<&'a T> where T: Clone

fn cloned(self) -> Option<T>

-

Maps an Option<&T> to an Option<T> by cloning the contents of the -option.

-

impl<T> Option<T> where T: Default

fn unwrap_or_default(self) -> T

-

Returns the contained value or a default

- -

Consumes the self argument then, if Some, returns the contained -value, otherwise if None, returns the default value for that -type.

- -

Examples

-

Convert a string to an integer, turning poorly-formed strings -into 0 (the default value for integers). parse converts -a string to any other type that implements FromStr, returning -None on error.

- -
-let good_year_from_input = "1909";
-let bad_year_from_input = "190blarg";
-let good_year = good_year_from_input.parse().ok().unwrap_or_default();
-let bad_year = bad_year_from_input.parse().ok().unwrap_or_default();
-
-assert_eq!(1909, good_year);
-assert_eq!(0, bad_year);
-

Trait Implementations

impl<T> Default for Option<T>

fn default() -> Option<T>

-

impl<T> IntoIterator for Option<T>

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Returns a consuming iterator over the possibly contained value.

- -

Examples

-
-let x = Some("string");
-let v: Vec<&str> = x.into_iter().collect();
-assert_eq!(v, ["string"]);
-
-let x = None;
-let v: Vec<&str> = x.into_iter().collect();
-assert!(v.is_empty());
-

impl<'a, T> IntoIterator for &'a Option<T>1.4.0

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<'a, T> IntoIterator for &'a mut Option<T>1.4.0

type Item = &'a mut T

-

type IntoIter = IterMut<'a, T>

-

fn into_iter(self) -> IterMut<'a, T>

-

impl<A, V> FromIterator<Option<A>> for Option<V> where V: FromIterator<A>

fn from_iter<I>(iter: I) -> Option<V> where I: IntoIterator<Item=Option<A>>

-

Takes each element in the Iterator: if it is None, no further -elements are taken, and the None is returned. Should no None occur, a -container with the values of each Option is returned.

- -

Here is an example which increments every integer in a vector, -checking for overflow:

- -
-use std::u16;
-
-let v = vec!(1, 2);
-let res: Option<Vec<u16>> = v.iter().map(|&x: &u16|
-    if x == u16::MAX { None }
-    else { Some(x + 1) }
-).collect();
-assert!(res == Some(vec!(2, 3)));
-

Derived Implementations

impl<T> Hash for Option<T> where T: Hash

fn hash<__HT>(&self, __arg_0: &mut __HT) where __HT: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<T> Debug for Option<T> where T: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<T> Ord for Option<T> where T: Ord

fn cmp(&self, __arg_0: &Option<T>) -> Ordering

-

impl<T> Eq for Option<T> where T: Eq

impl<T> PartialOrd<Option<T>> for Option<T> where T: PartialOrd<T>

fn partial_cmp(&self, __arg_0: &Option<T>) -> Option<Ordering>

-

fn lt(&self, __arg_0: &Option<T>) -> bool

-

fn le(&self, __arg_0: &Option<T>) -> bool

-

fn gt(&self, __arg_0: &Option<T>) -> bool

-

fn ge(&self, __arg_0: &Option<T>) -> bool

-

impl<T> PartialEq<Option<T>> for Option<T> where T: PartialEq<T>

fn eq(&self, __arg_0: &Option<T>) -> bool

-

fn ne(&self, __arg_0: &Option<T>) -> bool

-

impl<T> Copy for Option<T> where T: Copy

impl<T> Clone for Option<T> where T: Clone

fn clone(&self) -> Option<T>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/enum.Result.html b/doc/bitflags/__core/prelude/v1/enum.Result.html deleted file mode 100644 index 025bc662..00000000 --- a/doc/bitflags/__core/prelude/v1/enum.Result.html +++ /dev/null @@ -1,475 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Result - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::prelude::v1::Result - - [−] - - [src]

-
#[must_use]
-pub enum Result<T, E> {
-    Ok(T),
-    Err(E),
-}
1.0.0

Result is a type that represents either success (Ok) or failure (Err).

- -

See the std::result module documentation for details.

-

Variants

-
Ok

Contains the success value

-
Err

Contains the error value

-

Methods

impl<T, E> Result<T, E>

fn is_ok(&self) -> bool

-

Returns true if the result is Ok

- -

Examples

-

Basic usage:

- -
-let x: Result<i32, &str> = Ok(-3);
-assert_eq!(x.is_ok(), true);
-
-let x: Result<i32, &str> = Err("Some error message");
-assert_eq!(x.is_ok(), false);
-

fn is_err(&self) -> bool

-

Returns true if the result is Err

- -

Examples

-

Basic usage:

- -
-let x: Result<i32, &str> = Ok(-3);
-assert_eq!(x.is_err(), false);
-
-let x: Result<i32, &str> = Err("Some error message");
-assert_eq!(x.is_err(), true);
-

fn ok(self) -> Option<T>

-

Converts from Result<T, E> to Option<T>

- -

Converts self into an Option<T>, consuming self, -and discarding the error, if any.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(2);
-assert_eq!(x.ok(), Some(2));
-
-let x: Result<u32, &str> = Err("Nothing here");
-assert_eq!(x.ok(), None);
-

fn err(self) -> Option<E>

-

Converts from Result<T, E> to Option<E>

- -

Converts self into an Option<E>, consuming self, -and discarding the success value, if any.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(2);
-assert_eq!(x.err(), None);
-
-let x: Result<u32, &str> = Err("Nothing here");
-assert_eq!(x.err(), Some("Nothing here"));
-

fn as_ref(&self) -> Result<&T, &E>

-

Converts from Result<T, E> to Result<&T, &E>

- -

Produces a new Result, containing a reference -into the original, leaving the original in place.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(2);
-assert_eq!(x.as_ref(), Ok(&2));
-
-let x: Result<u32, &str> = Err("Error");
-assert_eq!(x.as_ref(), Err(&"Error"));
-

fn as_mut(&mut self) -> Result<&mut T, &mut E>

-

Converts from Result<T, E> to Result<&mut T, &mut E>

- -

Examples

-

Basic usage:

- -
-fn mutate(r: &mut Result<i32, i32>) {
-    match r.as_mut() {
-        Ok(&mut ref mut v) => *v = 42,
-        Err(&mut ref mut e) => *e = 0,
-    }
-}
-
-let mut x: Result<i32, i32> = Ok(2);
-mutate(&mut x);
-assert_eq!(x.unwrap(), 42);
-
-let mut x: Result<i32, i32> = Err(13);
-mutate(&mut x);
-assert_eq!(x.unwrap_err(), 0);
-

fn map<U, F>(self, op: F) -> Result<U, E> where F: FnOnce(T) -> U

-

Maps a Result<T, E> to Result<U, E> by applying a function to a -contained Ok value, leaving an Err value untouched.

- -

This function can be used to compose the results of two functions.

- -

Examples

-

Print the numbers on each line of a string multiplied by two.

- -
-let line = "1\n2\n3\n4\n";
-
-for num in line.lines() {
-    match num.parse::<i32>().map(|i| i * 2) {
-        Ok(n) => println!("{}", n),
-        Err(..) => {}
-    }
-}
-

fn map_err<F, O>(self, op: O) -> Result<T, F> where O: FnOnce(E) -> F

-

Maps a Result<T, E> to Result<T, F> by applying a function to a -contained Err value, leaving an Ok value untouched.

- -

This function can be used to pass through a successful result while handling -an error.

- -

Examples

-

Basic usage:

- -
-fn stringify(x: u32) -> String { format!("error code: {}", x) }
-
-let x: Result<u32, u32> = Ok(2);
-assert_eq!(x.map_err(stringify), Ok(2));
-
-let x: Result<u32, u32> = Err(13);
-assert_eq!(x.map_err(stringify), Err("error code: 13".to_string()));
-

fn iter(&self) -> Iter<T>

-

Returns an iterator over the possibly contained value.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(7);
-assert_eq!(x.iter().next(), Some(&7));
-
-let x: Result<u32, &str> = Err("nothing!");
-assert_eq!(x.iter().next(), None);
-

fn iter_mut(&mut self) -> IterMut<T>

-

Returns a mutable iterator over the possibly contained value.

- -

Examples

-

Basic usage:

- -
-let mut x: Result<u32, &str> = Ok(7);
-match x.iter_mut().next() {
-    Some(v) => *v = 40,
-    None => {},
-}
-assert_eq!(x, Ok(40));
-
-let mut x: Result<u32, &str> = Err("nothing!");
-assert_eq!(x.iter_mut().next(), None);
-

fn and<U>(self, res: Result<U, E>) -> Result<U, E>

-

Returns res if the result is Ok, otherwise returns the Err value of self.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(2);
-let y: Result<&str, &str> = Err("late error");
-assert_eq!(x.and(y), Err("late error"));
-
-let x: Result<u32, &str> = Err("early error");
-let y: Result<&str, &str> = Ok("foo");
-assert_eq!(x.and(y), Err("early error"));
-
-let x: Result<u32, &str> = Err("not a 2");
-let y: Result<&str, &str> = Err("late error");
-assert_eq!(x.and(y), Err("not a 2"));
-
-let x: Result<u32, &str> = Ok(2);
-let y: Result<&str, &str> = Ok("different result type");
-assert_eq!(x.and(y), Ok("different result type"));
-

fn and_then<U, F>(self, op: F) -> Result<U, E> where F: FnOnce(T) -> Result<U, E>

-

Calls op if the result is Ok, otherwise returns the Err value of self.

- -

This function can be used for control flow based on result values.

- -

Examples

-

Basic usage:

- -
-fn sq(x: u32) -> Result<u32, u32> { Ok(x * x) }
-fn err(x: u32) -> Result<u32, u32> { Err(x) }
-
-assert_eq!(Ok(2).and_then(sq).and_then(sq), Ok(16));
-assert_eq!(Ok(2).and_then(sq).and_then(err), Err(4));
-assert_eq!(Ok(2).and_then(err).and_then(sq), Err(2));
-assert_eq!(Err(3).and_then(sq).and_then(sq), Err(3));
-

fn or<F>(self, res: Result<T, F>) -> Result<T, F>

-

Returns res if the result is Err, otherwise returns the Ok value of self.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(2);
-let y: Result<u32, &str> = Err("late error");
-assert_eq!(x.or(y), Ok(2));
-
-let x: Result<u32, &str> = Err("early error");
-let y: Result<u32, &str> = Ok(2);
-assert_eq!(x.or(y), Ok(2));
-
-let x: Result<u32, &str> = Err("not a 2");
-let y: Result<u32, &str> = Err("late error");
-assert_eq!(x.or(y), Err("late error"));
-
-let x: Result<u32, &str> = Ok(2);
-let y: Result<u32, &str> = Ok(100);
-assert_eq!(x.or(y), Ok(2));
-

fn or_else<F, O>(self, op: O) -> Result<T, F> where O: FnOnce(E) -> Result<T, F>

-

Calls op if the result is Err, otherwise returns the Ok value of self.

- -

This function can be used for control flow based on result values.

- -

Examples

-

Basic usage:

- -
-fn sq(x: u32) -> Result<u32, u32> { Ok(x * x) }
-fn err(x: u32) -> Result<u32, u32> { Err(x) }
-
-assert_eq!(Ok(2).or_else(sq).or_else(sq), Ok(2));
-assert_eq!(Ok(2).or_else(err).or_else(sq), Ok(2));
-assert_eq!(Err(3).or_else(sq).or_else(err), Ok(9));
-assert_eq!(Err(3).or_else(err).or_else(err), Err(3));
-

fn unwrap_or(self, optb: T) -> T

-

Unwraps a result, yielding the content of an Ok. -Else it returns optb.

- -

Examples

-

Basic usage:

- -
-let optb = 2;
-let x: Result<u32, &str> = Ok(9);
-assert_eq!(x.unwrap_or(optb), 9);
-
-let x: Result<u32, &str> = Err("error");
-assert_eq!(x.unwrap_or(optb), optb);
-

fn unwrap_or_else<F>(self, op: F) -> T where F: FnOnce(E) -> T

-

Unwraps a result, yielding the content of an Ok. -If the value is an Err then it calls op with its value.

- -

Examples

-

Basic usage:

- -
-fn count(x: &str) -> usize { x.len() }
-
-assert_eq!(Ok(2).unwrap_or_else(count), 2);
-assert_eq!(Err("foo").unwrap_or_else(count), 3);
-

impl<T, E> Result<T, E> where E: Debug

fn unwrap(self) -> T

-

Unwraps a result, yielding the content of an Ok.

- -

Panics

-

Panics if the value is an Err, with a panic message provided by the -Err's value.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(2);
-assert_eq!(x.unwrap(), 2);
- -
-let x: Result<u32, &str> = Err("emergency failure");
-x.unwrap(); // panics with `emergency failure`
-

fn expect(self, msg: &str) -> T1.4.0

-

Unwraps a result, yielding the content of an Ok.

- -

Panics

-

Panics if the value is an Err, with a panic message including the -passed message, and the content of the Err.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Err("emergency failure");
-x.expect("Testing expect"); // panics with `Testing expect: emergency failure`
-

impl<T, E> Result<T, E> where T: Debug

fn unwrap_err(self) -> E

-

Unwraps a result, yielding the content of an Err.

- -

Panics

-

Panics if the value is an Ok, with a custom panic message provided -by the Ok's value.

- -

Examples

-
-let x: Result<u32, &str> = Ok(2);
-x.unwrap_err(); // panics with `2`
- -
-let x: Result<u32, &str> = Err("emergency failure");
-assert_eq!(x.unwrap_err(), "emergency failure");
-

Trait Implementations

impl<T, E> IntoIterator for Result<T, E>

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Returns a consuming iterator over the possibly contained value.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(5);
-let v: Vec<u32> = x.into_iter().collect();
-assert_eq!(v, [5]);
-
-let x: Result<u32, &str> = Err("nothing!");
-let v: Vec<u32> = x.into_iter().collect();
-assert_eq!(v, []);
-

impl<'a, T, E> IntoIterator for &'a Result<T, E>1.4.0

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<'a, T, E> IntoIterator for &'a mut Result<T, E>1.4.0

type Item = &'a mut T

-

type IntoIter = IterMut<'a, T>

-

fn into_iter(self) -> IterMut<'a, T>

-

impl<A, E, V> FromIterator<Result<A, E>> for Result<V, E> where V: FromIterator<A>

fn from_iter<I>(iter: I) -> Result<V, E> where I: IntoIterator<Item=Result<A, E>>

-

Takes each element in the Iterator: if it is an Err, no further -elements are taken, and the Err is returned. Should no Err occur, a -container with the values of each Result is returned.

- -

Here is an example which increments every integer in a vector, -checking for overflow:

- -
-use std::u32;
-
-let v = vec!(1, 2);
-let res: Result<Vec<u32>, &'static str> = v.iter().map(|&x: &u32|
-    if x == u32::MAX { Err("Overflow!") }
-    else { Ok(x + 1) }
-).collect();
-assert!(res == Ok(vec!(2, 3)));
-

Derived Implementations

impl<T, E> Hash for Result<T, E> where E: Hash, T: Hash

fn hash<__HTE>(&self, __arg_0: &mut __HTE) where __HTE: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<T, E> Debug for Result<T, E> where T: Debug, E: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<T, E> Ord for Result<T, E> where E: Ord, T: Ord

fn cmp(&self, __arg_0: &Result<T, E>) -> Ordering

-

impl<T, E> Eq for Result<T, E> where E: Eq, T: Eq

impl<T, E> PartialOrd<Result<T, E>> for Result<T, E> where T: PartialOrd<T>, E: PartialOrd<E>

fn partial_cmp(&self, __arg_0: &Result<T, E>) -> Option<Ordering>

-

fn lt(&self, __arg_0: &Result<T, E>) -> bool

-

fn le(&self, __arg_0: &Result<T, E>) -> bool

-

fn gt(&self, __arg_0: &Result<T, E>) -> bool

-

fn ge(&self, __arg_0: &Result<T, E>) -> bool

-

impl<T, E> PartialEq<Result<T, E>> for Result<T, E> where T: PartialEq<T>, E: PartialEq<E>

fn eq(&self, __arg_0: &Result<T, E>) -> bool

-

fn ne(&self, __arg_0: &Result<T, E>) -> bool

-

impl<T, E> Copy for Result<T, E> where T: Copy, E: Copy

impl<T, E> Clone for Result<T, E> where T: Clone, E: Clone

fn clone(&self) -> Result<T, E>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/fn.drop.html b/doc/bitflags/__core/prelude/v1/fn.drop.html deleted file mode 100644 index 763b4779..00000000 --- a/doc/bitflags/__core/prelude/v1/fn.drop.html +++ /dev/null @@ -1,182 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::drop - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::prelude::v1::drop - - [−] - - [src]

-
pub fn drop<T>(_x: T)
1.0.0

Disposes of a value.

- -

While this does call the argument's implementation of Drop, it will not -release any borrows, as borrows are based on lexical scope.

- -

This effectively does nothing for -types which implement Copy, -e.g. integers. Such values are copied and then moved into the function, -so the value persists after this function call.

- -

Examples

-

Basic usage:

- -
-let v = vec![1, 2, 3];
-
-drop(v); // explicitly drop the vector
- -

Borrows are based on lexical scope, so this produces an error:

- -
-let mut v = vec![1, 2, 3];
-let x = &v[0];
-
-drop(x); // explicitly drop the reference, but the borrow still exists
-
-v.push(4); // error: cannot borrow `v` as mutable because it is also
-           // borrowed as immutable
- -

An inner scope is needed to fix this:

- -
-let mut v = vec![1, 2, 3];
-
-{
-    let x = &v[0];
-
-    drop(x); // this is now redundant, as `x` is going out of scope anyway
-}
-
-v.push(4); // no problems
- -

Since RefCell enforces the borrow rules at runtime, drop() can -seemingly release a borrow of one:

- -
-use std::cell::RefCell;
-
-let x = RefCell::new(1);
-
-let mut mutable_borrow = x.borrow_mut();
-*mutable_borrow = 1;
-
-drop(mutable_borrow); // relinquish the mutable borrow on this slot
-
-let borrow = x.borrow();
-println!("{}", *borrow);
- -

Integers and other types implementing Copy are unaffected by drop()

- -
-#[derive(Copy, Clone)]
-struct Foo(u8);
-
-let x = 1;
-let y = Foo(2);
-drop(x); // a copy of `x` is moved and dropped
-drop(y); // a copy of `y` is moved and dropped
-
-println!("x: {}, y: {}", x, y.0); // still available
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/index.html b/doc/bitflags/__core/prelude/v1/index.html deleted file mode 100644 index 2808e74e..00000000 --- a/doc/bitflags/__core/prelude/v1/index.html +++ /dev/null @@ -1,345 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1 - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::prelude::v1 - - [−] - - [src]

-

The first version of the prelude of The Rust Standard Library.

- -

See the module-level documentation for more.

-

Structs

- - - - - - - - - - - - -
Box -

A pointer type for heap allocation.

-
String -

A UTF-8 encoded, growable string.

-
Vec -

A contiguous growable array type, written Vec<T> but pronounced 'vector.'

-

Enums

- - - - - - - - -
Option -

The Option type. See the module level documentation for more.

-
Result -

Result is a type that represents either success (Ok) or failure (Err).

-

Traits

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
AsMut -

A cheap, mutable reference-to-mutable reference conversion.

-
AsRef -

A cheap, reference-to-reference conversion.

-
Clone -

A common trait for cloning an object.

-
Copy -

Types that can be copied by simply copying bits (i.e. memcpy).

-
Default -

A trait for giving a type a useful default value.

-
DoubleEndedIterator -

An iterator able to yield elements from both ends.

-
Drop -

The Drop trait is used to run some code when a value goes out of scope. -This is sometimes called a 'destructor'.

-
Eq -

Trait for equality comparisons which are equivalence relations.

-
ExactSizeIterator -

An iterator that knows its exact length.

-
Extend -

Extend a collection with the contents of an iterator.

-
Fn -

A version of the call operator that takes an immutable receiver.

-
FnMut -

A version of the call operator that takes a mutable receiver.

-
FnOnce -

A version of the call operator that takes a by-value receiver.

-
From -

Construct Self via a conversion.

-
Into -

A conversion that consumes self, which may or may not be expensive.

-
IntoIterator -

Conversion into an Iterator.

-
Iterator -

An interface for dealing with iterators.

-
Ord -

Trait for types that form a total order.

-
PartialEq -

Trait for equality comparisons which are partial equivalence -relations.

-
PartialOrd -

Trait for values that can be compared for a sort-order.

-
Send -

Types that can be transferred across thread boundaries.

-
Sized -

Types with a constant size known at compile-time.

-
Sync -

Types that can be safely shared between threads when aliased.

-
ToOwned -

A generalization of Clone to borrowed data.

-
ToString -

A trait for converting a value to a String.

-
SliceConcatExt - [Unstable]

An extension trait for concatenating slices

-

Functions

- - - - -
drop -

Disposes of a value.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/sidebar-items.js b/doc/bitflags/__core/prelude/v1/sidebar-items.js deleted file mode 100644 index cec01507..00000000 --- a/doc/bitflags/__core/prelude/v1/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["Option","The `Option` type. See the module level documentation for more."],["Result","`Result` is a type that represents either success (`Ok`) or failure (`Err`)."]],"fn":[["drop","Disposes of a value."]],"struct":[["Box","A pointer type for heap allocation."],["String","A UTF-8 encoded, growable string."],["Vec","A contiguous growable array type, written `Vec` but pronounced 'vector.'"]],"trait":[["AsMut","A cheap, mutable reference-to-mutable reference conversion."],["AsRef","A cheap, reference-to-reference conversion."],["Clone","A common trait for cloning an object."],["Copy","Types that can be copied by simply copying bits (i.e. `memcpy`)."],["Default","A trait for giving a type a useful default value."],["DoubleEndedIterator","An iterator able to yield elements from both ends."],["Drop","The `Drop` trait is used to run some code when a value goes out of scope. This is sometimes called a 'destructor'."],["Eq","Trait for equality comparisons which are equivalence relations."],["ExactSizeIterator","An iterator that knows its exact length."],["Extend","Extend a collection with the contents of an iterator."],["Fn","A version of the call operator that takes an immutable receiver."],["FnMut","A version of the call operator that takes a mutable receiver."],["FnOnce","A version of the call operator that takes a by-value receiver."],["From","Construct `Self` via a conversion."],["Into","A conversion that consumes `self`, which may or may not be expensive."],["IntoIterator","Conversion into an `Iterator`."],["Iterator","An interface for dealing with iterators."],["Ord","Trait for types that form a total order."],["PartialEq","Trait for equality comparisons which are partial equivalence relations."],["PartialOrd","Trait for values that can be compared for a sort-order."],["Send","Types that can be transferred across thread boundaries."],["Sized","Types with a constant size known at compile-time."],["SliceConcatExt","An extension trait for concatenating slices"],["Sync","Types that can be safely shared between threads when aliased."],["ToOwned","A generalization of `Clone` to borrowed data."],["ToString","A trait for converting a value to a `String`."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/struct.Box.html b/doc/bitflags/__core/prelude/v1/struct.Box.html deleted file mode 100644 index 01285434..00000000 --- a/doc/bitflags/__core/prelude/v1/struct.Box.html +++ /dev/null @@ -1,287 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Box - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::prelude::v1::Box - - [−] - - [src]

-
pub struct Box<T> where T: ?Sized(_);
1.0.0

A pointer type for heap allocation.

- -

See the module-level documentation for more.

-

Methods

impl<T> Box<T>

fn new(x: T) -> Box<T>

-

Allocates memory on the heap and then places x into it.

- -

Examples

-
-let five = Box::new(5);
-

impl<T> Box<T> where T: ?Sized

unsafe fn from_raw(raw: *mut T) -> Box<T>1.4.0

-

Constructs a box from a raw pointer.

- -

After calling this function, the raw pointer is owned by the -resulting Box. Specifically, the Box destructor will call -the destructor of T and free the allocated memory. Since the -way Box allocates and releases memory is unspecified, the -only valid pointer to pass to this function is the one taken -from another Box via the Box::into_raw function.

- -

This function is unsafe because improper use may lead to -memory problems. For example, a double-free may occur if the -function is called twice on the same raw pointer.

-

fn into_raw(b: Box<T>) -> *mut T1.4.0

-

Consumes the Box, returning the wrapped raw pointer.

- -

After calling this function, the caller is responsible for the -memory previously managed by the Box. In particular, the -caller should properly destroy T and release the memory. The -proper way to do so is to convert the raw pointer back into a -Box with the Box::from_raw function.

- -

Examples

-
-let seventeen = Box::new(17);
-let raw = Box::into_raw(seventeen);
-let boxed_again = unsafe { Box::from_raw(raw) };
-

impl Box<Any + 'static>

fn downcast<T>(self) -> Result<Box<T>, Box<Any + 'static>> where T: Any

-

Attempt to downcast the box to a concrete type.

-

impl Box<Any + 'static + Send>

fn downcast<T>(self) -> Result<Box<T>, Box<Any + 'static + Send>> where T: Any

-

Attempt to downcast the box to a concrete type.

-

Trait Implementations

impl<'a, E> From<E> for Box<Error + 'a> where E: 'a + Error

fn from(err: E) -> Box<Error + 'a>

-

impl<'a, E> From<E> for Box<Error + 'a + Send + Sync> where E: Send + Sync + 'a + Error

fn from(err: E) -> Box<Error + 'a + Send + Sync>

-

impl From<String> for Box<Error + 'static + Send + Sync>

fn from(err: String) -> Box<Error + 'static + Send + Sync>

-

impl From<String> for Box<Error + 'static>1.7.0

fn from(str_err: String) -> Box<Error + 'static>

-

impl<'a, 'b> From<&'b str> for Box<Error + 'a + Send + Sync>

fn from(err: &'b str) -> Box<Error + 'a + Send + Sync>

-

impl<'a> From<&'a str> for Box<Error + 'static>1.7.0

fn from(err: &'a str) -> Box<Error + 'static>

-

impl<T> Error for Box<T> where T: Error1.7.0

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

impl<R> Read for Box<R> where R: Read + ?Sized

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-

impl<W> Write for Box<W> where W: Write + ?Sized

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

impl<S> Seek for Box<S> where S: Seek + ?Sized

fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>

-

impl<B> BufRead for Box<B> where B: BufRead + ?Sized

fn fill_buf(&mut self) -> Result<&[u8], Error>

-

fn consume(&mut self, amt: usize)

-

fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn split(self, byte: u8) -> Split<Self>

-

fn lines(self) -> Lines<Self>

-

impl<T> Boxed for Box<T>

type Data = T

-
Unstable (placement_new_protocol)

type Place = IntermediateBox<T>

-
Unstable (placement_new_protocol)

unsafe fn finalize(b: IntermediateBox<T>) -> Box<T>

-
Unstable (placement_new_protocol)

impl<T> Default for Box<T> where T: Default

fn default() -> Box<T>

-

impl<T> Default for Box<[T]>

fn default() -> Box<[T]>

-

impl<T> Clone for Box<T> where T: Clone

fn clone(&self) -> Box<T>

-

Returns a new box with a clone() of this box's contents.

- -

Examples

-
-let x = Box::new(5);
-let y = x.clone();
-

fn clone_from(&mut self, source: &Box<T>)

-

Copies source's contents into self without creating a new allocation.

- -

Examples

-
-let x = Box::new(5);
-let mut y = Box::new(10);
-
-y.clone_from(&x);
-
-assert_eq!(*y, 5);
-

impl Clone for Box<str>1.3.0

fn clone(&self) -> Box<str>

-

fn clone_from(&mut self, source: &Self)

-

impl<T> PartialEq<Box<T>> for Box<T> where T: PartialEq<T> + ?Sized

fn eq(&self, other: &Box<T>) -> bool

-

fn ne(&self, other: &Box<T>) -> bool

-

impl<T> PartialOrd<Box<T>> for Box<T> where T: PartialOrd<T> + ?Sized

fn partial_cmp(&self, other: &Box<T>) -> Option<Ordering>

-

fn lt(&self, other: &Box<T>) -> bool

-

fn le(&self, other: &Box<T>) -> bool

-

fn ge(&self, other: &Box<T>) -> bool

-

fn gt(&self, other: &Box<T>) -> bool

-

impl<T> Ord for Box<T> where T: Ord + ?Sized

fn cmp(&self, other: &Box<T>) -> Ordering

-

impl<T> Eq for Box<T> where T: Eq + ?Sized

impl<T> Hash for Box<T> where T: Hash + ?Sized

fn hash<H>(&self, state: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<T> From<T> for Box<T>1.6.0

fn from(t: T) -> Box<T>

-

impl<T> Display for Box<T> where T: Display + ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Debug for Box<T> where T: Debug + ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Pointer for Box<T> where T: ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Deref for Box<T> where T: ?Sized

type Target = T

-

fn deref(&self) -> &T

-

impl<T> DerefMut for Box<T> where T: ?Sized

fn deref_mut(&mut self) -> &mut T

-

impl<I> Iterator for Box<I> where I: Iterator + ?Sized

type Item = I::Item

-

fn next(&mut self) -> Option<I::Item>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<I> DoubleEndedIterator for Box<I> where I: DoubleEndedIterator + ?Sized

fn next_back(&mut self) -> Option<I::Item>

-

impl<I> ExactSizeIterator for Box<I> where I: ExactSizeIterator + ?Sized

fn len(&self) -> usize

-

impl<'a, A, R> FnOnce<A> for Box<FnBox<A, Output=R> + 'a>

type Output = R

-
Unstable (fnbox)

: Newly introduced

-

extern "rust-call" fn call_once(self, args: A) -> R

-
Unstable (fnbox)

: Newly introduced

-

impl<'a, A, R> FnOnce<A> for Box<FnBox<A, Output=R> + 'a + Send>

type Output = R

-
Unstable (fnbox)

: Newly introduced

-

extern "rust-call" fn call_once(self, args: A) -> R

-
Unstable (fnbox)

: Newly introduced

-

impl<T, U> CoerceUnsized<Box<U>> for Box<T> where T: Unsize<U> + ?Sized, U: ?Sized

impl<T> Clone for Box<[T]> where T: Clone1.3.0

fn clone(&self) -> Box<[T]>

-

fn clone_from(&mut self, source: &Self)

-

impl<T> Borrow<T> for Box<T> where T: ?Sized

fn borrow(&self) -> &T

-

impl<T> BorrowMut<T> for Box<T> where T: ?Sized

fn borrow_mut(&mut self) -> &mut T

-

impl<T> AsRef<T> for Box<T> where T: ?Sized1.5.0

fn as_ref(&self) -> &T

-

impl<T> AsMut<T> for Box<T> where T: ?Sized1.5.0

fn as_mut(&mut self) -> &mut T

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/struct.String.html b/doc/bitflags/__core/prelude/v1/struct.String.html deleted file mode 100644 index 13406228..00000000 --- a/doc/bitflags/__core/prelude/v1/struct.String.html +++ /dev/null @@ -1,2118 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::String - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::prelude::v1::String - - [−] - - [src]

-
pub struct String {
-    // some fields omitted
-}
1.0.0

A UTF-8 encoded, growable string.

- -

The String type is the most common string type that has ownership over the -contents of the string. It has a close relationship with its borrowed -counterpart, the primitive str.

- -

Examples

-

You can create a String from a literal string with String::from:

- -
-let hello = String::from("Hello, world!");
- -

You can append a char to a String with the push() method, and -append a &str with the push_str() method:

- -
-let mut hello = String::from("Hello, ");
-
-hello.push('w');
-hello.push_str("orld!");
- -

If you have a vector of UTF-8 bytes, you can create a String from it with -the from_utf8() method:

- -
-// some bytes, in a vector
-let sparkle_heart = vec![240, 159, 146, 150];
-
-// We know these bytes are valid, so we'll use `unwrap()`.
-let sparkle_heart = String::from_utf8(sparkle_heart).unwrap();
-
-assert_eq!("💖", sparkle_heart);
- -

UTF-8

-

Strings are always valid UTF-8. This has a few implications, the first of -which is that if you need a non-UTF-8 string, consider OsString. It is -similar, but without the UTF-8 constraint. The second implication is that -you cannot index into a String:

- -
-let s = "hello";
-
-println!("The first letter of s is {}", s[0]); // ERROR!!!
- -

Indexing is intended to be a constant-time operation, but UTF-8 encoding -does not allow us to do this. Furtheremore, it's not clear what sort of -thing the index should return: a byte, a codepoint, or a grapheme cluster. -The as_bytes() and chars() methods return iterators over the first -two, respectively.

- -

Deref

-

Strings implement Deref<Target=str>, and so inherit all of str's -methods. In addition, this means that you can pass a String to any -function which takes a &str by using an ampersand (&):

- -
-fn takes_str(s: &str) { }
-
-let s = String::from("Hello");
-
-takes_str(&s);
- -

This will create a &str from the String and pass it in. This -conversion is very inexpensive, and so generally, functions will accept -&strs as arguments unless they need a String for some specific reason.

- -

Representation

-

A String is made up of three components: a pointer to some bytes, a -length, and a capacity. The pointer points to an internal buffer String -uses to store its data. The length is the number of bytes currently stored -in the buffer, and the capacity is the size of the buffer in bytes. As such, -the length will always be less than or equal to the capacity.

- -

This buffer is always stored on the heap.

- -

You can look at these with the as_ptr(), len(), and capacity() -methods:

- -
-use std::mem;
-
-let story = String::from("Once upon a time...");
-
-let ptr = story.as_ptr();
-let len = story.len();
-let capacity = story.capacity();
-
-// story has thirteen bytes
-assert_eq!(19, len);
-
-// Now that we have our parts, we throw the story away.
-mem::forget(story);
-
-// We can re-build a String out of ptr, len, and capacity. This is all
-// unsafe because we are responsible for making sure the components are
-// valid:
-let s = unsafe { String::from_raw_parts(ptr as *mut _, len, capacity) } ;
-
-assert_eq!(String::from("Once upon a time..."), s);
- -

If a String has enough capacity, adding elements to it will not -re-allocate. For example, consider this program:

- -
-let mut s = String::new();
-
-println!("{}", s.capacity());
-
-for _ in 0..5 {
-    s.push_str("hello");
-    println!("{}", s.capacity());
-}
- -

This will output the following:

- -
0
-5
-10
-20
-20
-40
-
- -

At first, we have no memory allocated at all, but as we append to the -string, it increases its capacity appropriately. If we instead use the -with_capacity() method to allocate the correct capacity initially:

- -
-let mut s = String::with_capacity(25);
-
-println!("{}", s.capacity());
-
-for _ in 0..5 {
-    s.push_str("hello");
-    println!("{}", s.capacity());
-}
- -

We end up with a different output:

- -
25
-25
-25
-25
-25
-25
-
- -

Here, there's no need to allocate more memory inside the loop.

-

Methods

impl String

fn new() -> String

-

Creates a new empty String.

- -

Given that the String is empty, this will not allocate any initial -buffer. While that means that this initial operation is very -inexpensive, but may cause excessive allocation later, when you add -data. If you have an idea of how much data the String will hold, -consider the with_capacity() method to prevent excessive -re-allocation.

- -

Examples

-

Basic usage:

- -
-let s = String::new();
-

fn with_capacity(capacity: usize) -> String

-

Creates a new empty String with a particular capacity.

- -

Strings have an internal buffer to hold their data. The capacity is -the length of that buffer, and can be queried with the capacity() -method. This method creates an empty String, but one with an initial -buffer that can hold capacity bytes. This is useful when you may be -appending a bunch of data to the String, reducing the number of -reallocations it needs to do.

- -

If the given capacity is 0, no allocation will occur, and this method -is identical to the new() method.

- -

Examples

-

Basic usage:

- -
-let mut s = String::with_capacity(10);
-
-// The String contains no chars, even though it has capacity for more
-assert_eq!(s.len(), 0);
-
-// These are all done without reallocating...
-let cap = s.capacity();
-for i in 0..10 {
-    s.push('a');
-}
-
-assert_eq!(s.capacity(), cap);
-
-// ...but this may make the vector reallocate
-s.push('a');
-

fn from_utf8(vec: Vec<u8>) -> Result<String, FromUtf8Error>

-

Converts a vector of bytes to a String.

- -

A string slice (&str) is made of bytes (u8), and a vector of bytes -(Vec<u8>) is made of bytes, so this function converts between the -two. Not all byte slices are valid Strings, however: String -requires that it is valid UTF-8. from_utf8() checks to ensure that -the bytes are valid UTF-8, and then does the conversion.

- -

If you are sure that the byte slice is valid UTF-8, and you don't want -to incur the overhead of the validity check, there is an unsafe version -of this function, from_utf8_unchecked(), which has the same behavior -but skips the check.

- -

This method will take care to not copy the vector, for efficiency's -sake.

- -

If you need a &str instead of a String, consider -str::from_utf8().

- -

Errors

-

Returns Err if the slice is not UTF-8 with a description as to why the -provided bytes are not UTF-8. The vector you moved in is also included.

- -

Examples

-

Basic usage:

- -
-// some bytes, in a vector
-let sparkle_heart = vec![240, 159, 146, 150];
-
-// We know these bytes are valid, so we'll use `unwrap()`.
-let sparkle_heart = String::from_utf8(sparkle_heart).unwrap();
-
-assert_eq!("💖", sparkle_heart);
- -

Incorrect bytes:

- -
-// some invalid bytes, in a vector
-let sparkle_heart = vec![0, 159, 146, 150];
-
-assert!(String::from_utf8(sparkle_heart).is_err());
- -

See the docs for FromUtf8Error for more details on what you can do -with this error.

-

fn from_utf8_lossy(v: &'a [u8]) -> Cow<'a, str>

-

Converts a slice of bytes to a string, including invalid characters.

- -

Strings are made of bytes (u8), and a slice of bytes -(&[u8]) is made of bytes, so this function converts -between the two. Not all byte slices are valid strings, however: strings -are required to be valid UTF-8. During this conversion, -from_utf8_lossy() will replace any invalid UTF-8 sequences with -U+FFFD REPLACEMENT CHARACTER, which looks like this: �

- -

If you are sure that the byte slice is valid UTF-8, and you don't want -to incur the overhead of the conversion, there is an unsafe version -of this function, from_utf8_unchecked(), which has the same behavior -but skips the checks.

- -

This function returns a Cow<'a, str>. If our byte slice is invalid -UTF-8, then we need to insert the replacement characters, which will -change the size of the string, and hence, require a String. But if -it's already valid UTF-8, we don't need a new allocation. This return -type allows us to handle both cases.

- -

Examples

-

Basic usage:

- -
-// some bytes, in a vector
-let sparkle_heart = vec![240, 159, 146, 150];
-
-let sparkle_heart = String::from_utf8_lossy(&sparkle_heart);
-
-assert_eq!("💖", sparkle_heart);
- -

Incorrect bytes:

- -
-// some invalid bytes
-let input = b"Hello \xF0\x90\x80World";
-let output = String::from_utf8_lossy(input);
-
-assert_eq!("Hello �World", output);
-

fn from_utf16(v: &[u16]) -> Result<String, FromUtf16Error>

-

Decode a UTF-16 encoded vector v into a String, returning Err -if v contains any invalid data.

- -

Examples

-

Basic usage:

- -
-// 𝄞music
-let v = &[0xD834, 0xDD1E, 0x006d, 0x0075,
-          0x0073, 0x0069, 0x0063];
-assert_eq!(String::from("𝄞music"),
-           String::from_utf16(v).unwrap());
-
-// 𝄞mu<invalid>ic
-let v = &[0xD834, 0xDD1E, 0x006d, 0x0075,
-          0xD800, 0x0069, 0x0063];
-assert!(String::from_utf16(v).is_err());
-

fn from_utf16_lossy(v: &[u16]) -> String

-

Decode a UTF-16 encoded vector v into a string, replacing -invalid data with the replacement character (U+FFFD).

- -

Examples

-

Basic usage:

- -
-// 𝄞mus<invalid>ic<invalid>
-let v = &[0xD834, 0xDD1E, 0x006d, 0x0075,
-          0x0073, 0xDD1E, 0x0069, 0x0063,
-          0xD834];
-
-assert_eq!(String::from("𝄞mus\u{FFFD}ic\u{FFFD}"),
-           String::from_utf16_lossy(v));
-

unsafe fn from_raw_parts(buf: *mut u8, length: usize, capacity: usize) -> String

-

Creates a new String from a length, capacity, and pointer.

- -

Safety

-

This is highly unsafe, due to the number of invariants that aren't -checked:

- -
    -
  • The memory at ptr needs to have been previously allocated by the -same allocator the standard library uses.
    • -
  • length needs to be less than or equal to capacity.
    • -
  • capacity needs to be the correct value.
    • -
- -

Violating these may cause problems like corrupting the allocator's -internal datastructures.

- -

Examples

-

Basic usage:

- -
-use std::mem;
-
-unsafe {
-    let s = String::from("hello");
-    let ptr = s.as_ptr();
-    let len = s.len();
-    let capacity = s.capacity();
-
-    mem::forget(s);
-
-    let s = String::from_raw_parts(ptr as *mut _, len, capacity);
-
-    assert_eq!(String::from("hello"), s);
-}
-

unsafe fn from_utf8_unchecked(bytes: Vec<u8>) -> String

-

Converts a vector of bytes to a String without checking that the -string contains valid UTF-8.

- -

See the safe version, from_utf8(), for more details.

- -

Safety

-

This function is unsafe because it does not check that the bytes passed -to it are valid UTF-8. If this constraint is violated, it may cause -memory unsafety issues with future users of the String, as the rest of -the standard library assumes that Strings are valid UTF-8.

- -

Examples

-

Basic usage:

- -
-// some bytes, in a vector
-let sparkle_heart = vec![240, 159, 146, 150];
-
-let sparkle_heart = unsafe {
-    String::from_utf8_unchecked(sparkle_heart)
-};
-
-assert_eq!("💖", sparkle_heart);
-

fn into_bytes(self) -> Vec<u8>

-

Converts a String into a byte vector.

- -

This consumes the String, so we do not need to copy its contents.

- -

Examples

-

Basic usage:

- -
-let s = String::from("hello");
-let bytes = s.into_bytes();
-
-assert_eq!(&[104, 101, 108, 108, 111][..], &bytes[..]);
-

fn as_str(&self) -> &str1.7.0

-

Extracts a string slice containing the entire string.

-

fn as_mut_str(&mut self) -> &mut str1.7.0

-

Extracts a string slice containing the entire string.

-

fn push_str(&mut self, string: &str)

-

Appends a given string slice onto the end of this String.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("foo");
-
-s.push_str("bar");
-
-assert_eq!("foobar", s);
-

fn capacity(&self) -> usize

-

Returns this String's capacity, in bytes.

- -

Examples

-

Basic usage:

- -
-let s = String::with_capacity(10);
-
-assert!(s.capacity() >= 10);
-

fn reserve(&mut self, additional: usize)

-

Ensures that this String's capacity is at least additional bytes -larger than its length.

- -

The capacity may be increased by more than additional bytes if it -chooses, to prevent frequent reallocations.

- -

If you do not want this "at least" behavior, see the reserve_exact() -method.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-

Basic usage:

- -
-let mut s = String::new();
-
-s.reserve(10);
-
-assert!(s.capacity() >= 10);
- -

This may not actually increase the capacity:

- -
-let mut s = String::with_capacity(10);
-s.push('a');
-s.push('b');
-
-// s now has a length of 2 and a capacity of 10
-assert_eq!(2, s.len());
-assert_eq!(10, s.capacity());
-
-// Since we already have an extra 8 capacity, calling this...
-s.reserve(8);
-
-// ... doesn't actually increase.
-assert_eq!(10, s.capacity());
-

fn reserve_exact(&mut self, additional: usize)

-

Ensures that this String's capacity is additional bytes -larger than its length.

- -

Consider using the reserve() method unless you absolutely know -better than the allocator.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-

Basic usage:

- -
-let mut s = String::new();
-
-s.reserve_exact(10);
-
-assert!(s.capacity() >= 10);
- -

This may not actually increase the capacity:

- -
-let mut s = String::with_capacity(10);
-s.push('a');
-s.push('b');
-
-// s now has a length of 2 and a capacity of 10
-assert_eq!(2, s.len());
-assert_eq!(10, s.capacity());
-
-// Since we already have an extra 8 capacity, calling this...
-s.reserve_exact(8);
-
-// ... doesn't actually increase.
-assert_eq!(10, s.capacity());
-

fn shrink_to_fit(&mut self)

-

Shrinks the capacity of this String to match its length.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("foo");
-
-s.reserve(100);
-assert!(s.capacity() >= 100);
-
-s.shrink_to_fit();
-assert_eq!(3, s.capacity());
-

fn push(&mut self, ch: char)

-

Appends the given char to the end of this String.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("abc");
-
-s.push('1');
-s.push('2');
-s.push('3');
-
-assert_eq!("abc123", s);
-

fn as_bytes(&self) -> &[u8]

-

Returns a byte slice of this String's contents.

- -

Examples

-

Basic usage:

- -
-let s = String::from("hello");
-
-assert_eq!(&[104, 101, 108, 108, 111], s.as_bytes());
-

fn truncate(&mut self, new_len: usize)

-

Shortens this String to the specified length.

- -

If new_len is greater than the string's current length, this has no -effect.

- -

Panics

-

Panics if new_len does not lie on a char boundary.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("hello");
-
-s.truncate(2);
-
-assert_eq!("he", s);
-

fn pop(&mut self) -> Option<char>

-

Removes the last character from the string buffer and returns it.

- -

Returns None if this String is empty.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("foo");
-
-assert_eq!(s.pop(), Some('o'));
-assert_eq!(s.pop(), Some('o'));
-assert_eq!(s.pop(), Some('f'));
-
-assert_eq!(s.pop(), None);
-

fn remove(&mut self, idx: usize) -> char

-

Removes a char from this String at a byte position and returns it.

- -

This is an O(n) operation, as it requires copying every element in the -buffer.

- -

Panics

-

Panics if idx is larger than or equal to the String's length, -or if it does not lie on a char boundary.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("foo");
-
-assert_eq!(s.remove(0), 'f');
-assert_eq!(s.remove(1), 'o');
-assert_eq!(s.remove(0), 'o');
-

fn insert(&mut self, idx: usize, ch: char)

-

Inserts a character into this String at a byte position.

- -

This is an O(n) operation as it requires copying every element in the -buffer.

- -

Panics

-

Panics if idx is larger than the String's length, or if it does not -lie on a char boundary.

- -

Examples

-

Basic usage:

- -
-let mut s = String::with_capacity(3);
-
-s.insert(0, 'f');
-s.insert(1, 'o');
-s.insert(2, 'o');
-
-assert_eq!("foo", s);
-

unsafe fn as_mut_vec(&mut self) -> &mut Vec<u8>

-

Returns a mutable reference to the contents of this String.

- -

Safety

-

This function is unsafe because it does not check that the bytes passed -to it are valid UTF-8. If this constraint is violated, it may cause -memory unsafety issues with future users of the String, as the rest of -the standard library assumes that Strings are valid UTF-8.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("hello");
-
-unsafe {
-    let vec = s.as_mut_vec();
-    assert_eq!(&[104, 101, 108, 108, 111][..], &vec[..]);
-
-    vec.reverse();
-}
-assert_eq!(s, "olleh");
-

fn len(&self) -> usize

-

Returns the length of this String, in bytes.

- -

Examples

-

Basic usage:

- -
-let a = String::from("foo");
-
-assert_eq!(a.len(), 3);
-

fn is_empty(&self) -> bool

-

Returns true if this String has a length of zero.

- -

Returns false otherwise.

- -

Examples

-

Basic usage:

- -
-let mut v = String::new();
-assert!(v.is_empty());
-
-v.push('a');
-assert!(!v.is_empty());
-

fn clear(&mut self)

-

Truncates this String, removing all contents.

- -

While this means the String will have a length of zero, it does not -touch its capacity.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("foo");
-
-s.clear();
-
-assert!(s.is_empty());
-assert_eq!(0, s.len());
-assert_eq!(3, s.capacity());
-

fn drain<R>(&mut self, range: R) -> Drain where R: RangeArgument<usize>1.6.0

-

Create a draining iterator that removes the specified range in the string -and yields the removed chars.

- -

Note: The element range is removed even if the iterator is not -consumed until the end.

- -

Panics

-

Panics if the starting point or end point do not lie on a char -boundary, or if they're out of bounds.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("α is alpha, β is beta");
-let beta_offset = s.find('β').unwrap_or(s.len());
-
-// Remove the range up until the β from the string
-let t: String = s.drain(..beta_offset).collect();
-assert_eq!(t, "α is alpha, ");
-assert_eq!(s, "β is beta");
-
-// A full range clears the string
-s.drain(..);
-assert_eq!(s, "");
-

fn into_boxed_str(self) -> Box<str>1.4.0

-

Converts this String into a Box<str>.

- -

This will drop any excess capacity.

- -

Examples

-

Basic usage:

- -
-let s = String::from("hello");
-
-let b = s.into_boxed_str();
-

Methods from Deref<Target=str>

fn len(&self) -> usize

-

Returns the length of self.

- -

This length is in bytes, not chars or graphemes. In other words, -it may not be what a human considers the length of the string.

- -

Examples

-

Basic usage:

- -
-let len = "foo".len();
-assert_eq!(3, len);
-
-let len = "ƒoo".len(); // fancy f!
-assert_eq!(4, len);
-

fn is_empty(&self) -> bool

-

Returns true if this slice has a length of zero bytes.

- -

Examples

-

Basic usage:

- -
-let s = "";
-assert!(s.is_empty());
-
-let s = "not empty";
-assert!(!s.is_empty());
-

fn is_char_boundary(&self, index: usize) -> bool1.9.0

-

Checks that index-th byte lies at the start and/or end of a -UTF-8 code point sequence.

- -

The start and end of the string (when index == self.len()) are -considered to be -boundaries.

- -

Returns false if index is greater than self.len().

- -

Examples

-
-let s = "Löwe 老虎 Léopard";
-assert!(s.is_char_boundary(0));
-// start of `老`
-assert!(s.is_char_boundary(6));
-assert!(s.is_char_boundary(s.len()));
-
-// second byte of `ö`
-assert!(!s.is_char_boundary(2));
-
-// third byte of `老`
-assert!(!s.is_char_boundary(8));
-

fn as_bytes(&self) -> &[u8]

-

Converts a string slice to a byte slice.

- -

Examples

-

Basic usage:

- -
-let bytes = "bors".as_bytes();
-assert_eq!(b"bors", bytes);
-

fn as_ptr(&self) -> *const u8

-

Converts a string slice to a raw pointer.

- -

As string slices are a slice of bytes, the raw pointer points to a -u8. This pointer will be pointing to the first byte of the string -slice.

- -

Examples

-

Basic usage:

- -
-let s = "Hello";
-let ptr = s.as_ptr();
-

unsafe fn slice_unchecked(&self, begin: usize, end: usize) -> &str

-

Creates a string slice from another string slice, bypassing safety -checks.

- -

This new slice goes from begin to end, including begin but -excluding end.

- -

To get a mutable string slice instead, see the -slice_mut_unchecked() method.

- -

Safety

-

Callers of this function are responsible that three preconditions are -satisfied:

- -
    -
  • begin must come before end.
    • -
  • begin and end must be byte positions within the string slice.
    • -
  • begin and end must lie on UTF-8 sequence boundaries.
    • -
- -

Examples

-

Basic usage:

- -
-let s = "Löwe 老虎 Léopard";
-
-unsafe {
-    assert_eq!("Löwe 老虎 Léopard", s.slice_unchecked(0, 21));
-}
-
-let s = "Hello, world!";
-
-unsafe {
-    assert_eq!("world", s.slice_unchecked(7, 12));
-}
-

unsafe fn slice_mut_unchecked(&mut self, begin: usize, end: usize) -> &mut str1.5.0

-

Creates a string slice from another string slice, bypassing safety -checks.

- -

This new slice goes from begin to end, including begin but -excluding end.

- -

To get an immutable string slice instead, see the -slice_unchecked() method.

- -

Safety

-

Callers of this function are responsible that three preconditions are -satisfied:

- -
    -
  • begin must come before end.
    • -
  • begin and end must be byte positions within the string slice.
    • -
  • begin and end must lie on UTF-8 sequence boundaries.
    • -
-

fn char_range_at(&self, start: usize) -> CharRange

-
Deprecated since 1.9.0

: use slicing plus chars() plus len_utf8

-
Unstable (str_char)

: use slicing plus chars() plus len_utf8

-

Given a byte position, returns the next char and its index.

- -

Panics

-

If i is greater than or equal to the length of the string. -If i is not the index of the beginning of a valid UTF-8 sequence.

- -

Examples

-

This example manually iterates through the code points of a string; -this should normally be -done by .chars() or .char_indices().

- -
-#![feature(str_char)]
-#![allow(deprecated)]
-
-use std::str::CharRange;
-
-let s = "中华Việt Nam";
-let mut i = 0;
-while i < s.len() {
-    let CharRange {ch, next} = s.char_range_at(i);
-    println!("{}: {}", i, ch);
-    i = next;
-}
- -

This outputs:

- -
0: 中
-3: 华
-6: V
-7: i
-8: e
-9:
-11:
-13: t
-14:
-15: N
-16: a
-17: m
-
-

fn char_range_at_reverse(&self, start: usize) -> CharRange

-
Deprecated since 1.9.0

: use slicing plus chars().rev() plus len_utf8

-
Unstable (str_char)

: use slicing plus chars().rev() plus len_utf8

-

Given a byte position, returns the previous char and its position.

- -

Note that Unicode has many features, such as combining marks, ligatures, -and direction marks, that need to be taken into account to correctly reverse a string.

- -

Returns 0 for next index if called on start index 0.

- -

Panics

-

If i is greater than the length of the string. -If i is not an index following a valid UTF-8 sequence.

- -

Examples

-

This example manually iterates through the code points of a string; -this should normally be -done by .chars().rev() or .char_indices().

- -
-#![feature(str_char)]
-#![allow(deprecated)]
-
-use std::str::CharRange;
-
-let s = "中华Việt Nam";
-let mut i = s.len();
-while i > 0 {
-    let CharRange {ch, next} = s.char_range_at_reverse(i);
-    println!("{}: {}", i, ch);
-    i = next;
-}
- -

This outputs:

- -
18: m
-17: a
-16: N
-15:
-14: t
-13:
-11:
-9: e
-8: i
-7: V
-6: 华
-3: 中
-
-

fn char_at(&self, i: usize) -> char

-
Deprecated since 1.9.0

: use slicing plus chars()

-
Unstable (str_char)

: use slicing plus chars()

-

Given a byte position, returns the char at that position.

- -

Panics

-

If i is greater than or equal to the length of the string. -If i is not the index of the beginning of a valid UTF-8 sequence.

- -

Examples

-
-#![feature(str_char)]
-#![allow(deprecated)]
-
-let s = "abπc";
-assert_eq!(s.char_at(1), 'b');
-assert_eq!(s.char_at(2), 'π');
-assert_eq!(s.char_at(4), 'c');
-

fn char_at_reverse(&self, i: usize) -> char

-
Deprecated since 1.9.0

: use slicing plus chars().rev()

-
Unstable (str_char)

: use slicing plus chars().rev()

-

Given a byte position, returns the char at that position, counting -from the end.

- -

Panics

-

If i is greater than the length of the string. -If i is not an index following a valid UTF-8 sequence.

- -

Examples

-
-#![feature(str_char)]
-#![allow(deprecated)]
-
-let s = "abπc";
-assert_eq!(s.char_at_reverse(1), 'a');
-assert_eq!(s.char_at_reverse(2), 'b');
-assert_eq!(s.char_at_reverse(3), 'π');
-

fn slice_shift_char(&self) -> Option<(char, &str)>

-
Deprecated since 1.9.0

: use chars() plus Chars::as_str

-
Unstable (str_char)

: use chars() plus Chars::as_str

-

Retrieves the first char from a &str and returns it.

- -

Note that a single Unicode character (grapheme cluster) -can be composed of multiple chars.

- -

This does not allocate a new string; instead, it returns a slice that -points one code point beyond the code point that was shifted.

- -

None is returned if the slice is empty.

- -

Examples

-
-#![feature(str_char)]
-#![allow(deprecated)]
-
-let s = "Łódź"; // \u{141}o\u{301}dz\u{301}
-let (c, s1) = s.slice_shift_char().unwrap();
-
-assert_eq!(c, 'Ł');
-assert_eq!(s1, "ódź");
-
-let (c, s2) = s1.slice_shift_char().unwrap();
-
-assert_eq!(c, 'o');
-assert_eq!(s2, "\u{301}dz\u{301}");
-

fn split_at(&self, mid: usize) -> (&str, &str)1.4.0

-

Divide one string slice into two at an index.

- -

The argument, mid, should be a byte offset from the start of the -string. It must also be on the boundary of a UTF-8 code point.

- -

The two slices returned go from the start of the string slice to mid, -and from mid to the end of the string slice.

- -

To get mutable string slices instead, see the split_at_mut() -method.

- -

Panics

-

Panics if mid is not on a UTF-8 code point boundary, or if it is -beyond the last code point of the string slice.

- -

Examples

-

Basic usage:

- -
-let s = "Per Martin-Löf";
-
-let (first, last) = s.split_at(3);
-
-assert_eq!("Per", first);
-assert_eq!(" Martin-Löf", last);
-

fn split_at_mut(&mut self, mid: usize) -> (&mut str, &mut str)1.4.0

-

Divide one mutable string slice into two at an index.

- -

The argument, mid, should be a byte offset from the start of the -string. It must also be on the boundary of a UTF-8 code point.

- -

The two slices returned go from the start of the string slice to mid, -and from mid to the end of the string slice.

- -

To get immutable string slices instead, see the split_at() method.

- -

Panics

-

Panics if mid is not on a UTF-8 code point boundary, or if it is -beyond the last code point of the string slice.

- -

Examples

-

Basic usage:

- -
-let mut s = "Per Martin-Löf".to_string();
-
-let (first, last) = s.split_at_mut(3);
-
-assert_eq!("Per", first);
-assert_eq!(" Martin-Löf", last);
-

fn chars(&self) -> Chars

-

Returns an iterator over the chars of a string slice.

- -

As a string slice consists of valid UTF-8, we can iterate through a -string slice by char. This method returns such an iterator.

- -

It's important to remember that char represents a Unicode Scalar -Value, and may not match your idea of what a 'character' is. Iteration -over grapheme clusters may be what you actually want.

- -

Examples

-

Basic usage:

- -
-let word = "goodbye";
-
-let count = word.chars().count();
-assert_eq!(7, count);
-
-let mut chars = word.chars();
-
-assert_eq!(Some('g'), chars.next());
-assert_eq!(Some('o'), chars.next());
-assert_eq!(Some('o'), chars.next());
-assert_eq!(Some('d'), chars.next());
-assert_eq!(Some('b'), chars.next());
-assert_eq!(Some('y'), chars.next());
-assert_eq!(Some('e'), chars.next());
-
-assert_eq!(None, chars.next());
- -

Remember, chars may not match your human intuition about characters:

- -
-let y = "y̆";
-
-let mut chars = y.chars();
-
-assert_eq!(Some('y'), chars.next()); // not 'y̆'
-assert_eq!(Some('\u{0306}'), chars.next());
-
-assert_eq!(None, chars.next());
-

fn char_indices(&self) -> CharIndices

-

Returns an iterator over the chars of a string slice, and their -positions.

- -

As a string slice consists of valid UTF-8, we can iterate through a -string slice by char. This method returns an iterator of both -these chars, as well as their byte positions.

- -

The iterator yields tuples. The position is first, the char is -second.

- -

Examples

-

Basic usage:

- -
-let word = "goodbye";
-
-let count = word.char_indices().count();
-assert_eq!(7, count);
-
-let mut char_indices = word.char_indices();
-
-assert_eq!(Some((0, 'g')), char_indices.next());
-assert_eq!(Some((1, 'o')), char_indices.next());
-assert_eq!(Some((2, 'o')), char_indices.next());
-assert_eq!(Some((3, 'd')), char_indices.next());
-assert_eq!(Some((4, 'b')), char_indices.next());
-assert_eq!(Some((5, 'y')), char_indices.next());
-assert_eq!(Some((6, 'e')), char_indices.next());
-
-assert_eq!(None, char_indices.next());
- -

Remember, chars may not match your human intuition about characters:

- -
-let y = "y̆";
-
-let mut char_indices = y.char_indices();
-
-assert_eq!(Some((0, 'y')), char_indices.next()); // not (0, 'y̆')
-assert_eq!(Some((1, '\u{0306}')), char_indices.next());
-
-assert_eq!(None, char_indices.next());
-

fn bytes(&self) -> Bytes

-

An iterator over the bytes of a string slice.

- -

As a string slice consists of a sequence of bytes, we can iterate -through a string slice by byte. This method returns such an iterator.

- -

Examples

-

Basic usage:

- -
-let mut bytes = "bors".bytes();
-
-assert_eq!(Some(b'b'), bytes.next());
-assert_eq!(Some(b'o'), bytes.next());
-assert_eq!(Some(b'r'), bytes.next());
-assert_eq!(Some(b's'), bytes.next());
-
-assert_eq!(None, bytes.next());
-

fn split_whitespace(&self) -> SplitWhitespace1.1.0

-

Split a string slice by whitespace.

- -

The iterator returned will return string slices that are sub-slices of -the original string slice, separated by any amount of whitespace.

- -

'Whitespace' is defined according to the terms of the Unicode Derived -Core Property White_Space.

- -

Examples

-

Basic usage:

- -
-let mut iter = "A few words".split_whitespace();
-
-assert_eq!(Some("A"), iter.next());
-assert_eq!(Some("few"), iter.next());
-assert_eq!(Some("words"), iter.next());
-
-assert_eq!(None, iter.next());
- -

All kinds of whitespace are considered:

- -
-let mut iter = " Mary   had\ta\u{2009}little  \n\t lamb".split_whitespace();
-assert_eq!(Some("Mary"), iter.next());
-assert_eq!(Some("had"), iter.next());
-assert_eq!(Some("a"), iter.next());
-assert_eq!(Some("little"), iter.next());
-assert_eq!(Some("lamb"), iter.next());
-
-assert_eq!(None, iter.next());
-

fn lines(&self) -> Lines

-

An iterator over the lines of a string, as string slices.

- -

Lines are ended with either a newline (\n) or a carriage return with -a line feed (\r\n).

- -

The final line ending is optional.

- -

Examples

-

Basic usage:

- -
-let text = "foo\r\nbar\n\nbaz\n";
-let mut lines = text.lines();
-
-assert_eq!(Some("foo"), lines.next());
-assert_eq!(Some("bar"), lines.next());
-assert_eq!(Some(""), lines.next());
-assert_eq!(Some("baz"), lines.next());
-
-assert_eq!(None, lines.next());
- -

The final line ending isn't required:

- -
-let text = "foo\nbar\n\r\nbaz";
-let mut lines = text.lines();
-
-assert_eq!(Some("foo"), lines.next());
-assert_eq!(Some("bar"), lines.next());
-assert_eq!(Some(""), lines.next());
-assert_eq!(Some("baz"), lines.next());
-
-assert_eq!(None, lines.next());
-

fn lines_any(&self) -> LinesAny

-
Deprecated since 1.4.0

: use lines() instead now

-

An iterator over the lines of a string.

-

fn utf16_units(&self) -> EncodeUtf16

-
Deprecated since 1.8.0

: renamed to encode_utf16

-
Unstable (str_utf16)

: renamed to encode_utf16

-

Returns an iterator of u16 over the string encoded as UTF-16.

-

fn encode_utf16(&self) -> EncodeUtf161.8.0

-

Returns an iterator of u16 over the string encoded as UTF-16.

-

fn contains<'a, P>(&'a self, pat: P) -> bool where P: Pattern<'a>

-

Returns true if the given pattern matches a sub-slice of -this string slice.

- -

Returns false if it does not.

- -

Examples

-

Basic usage:

- -
-let bananas = "bananas";
-
-assert!(bananas.contains("nana"));
-assert!(!bananas.contains("apples"));
-

fn starts_with<'a, P>(&'a self, pat: P) -> bool where P: Pattern<'a>

-

Returns true if the given pattern matches a prefix of this -string slice.

- -

Returns false if it does not.

- -

Examples

-

Basic usage:

- -
-let bananas = "bananas";
-
-assert!(bananas.starts_with("bana"));
-assert!(!bananas.starts_with("nana"));
-

fn ends_with<'a, P>(&'a self, pat: P) -> bool where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

-

Returns true if the given pattern matches a suffix of this -string slice.

- -

Returns false if it does not.

- -

Examples

-

Basic usage:

- -
-let bananas = "bananas";
-
-assert!(bananas.ends_with("anas"));
-assert!(!bananas.ends_with("nana"));
-

fn find<'a, P>(&'a self, pat: P) -> Option<usize> where P: Pattern<'a>

-

Returns the byte index of the first character of this string slice that -matches the pattern.

- -

Returns None if the pattern doesn't match.

- -

The pattern can be a &str, char, or a closure that determines if -a character matches.

- -

Examples

-

Simple patterns:

- -
-let s = "Löwe 老虎 Léopard";
-
-assert_eq!(s.find('L'), Some(0));
-assert_eq!(s.find('é'), Some(14));
-assert_eq!(s.find("Léopard"), Some(13));
- -

More complex patterns with closures:

- -
-let s = "Löwe 老虎 Léopard";
-
-assert_eq!(s.find(char::is_whitespace), Some(5));
-assert_eq!(s.find(char::is_lowercase), Some(1));
- -

Not finding the pattern:

- -
-let s = "Löwe 老虎 Léopard";
-let x: &[_] = &['1', '2'];
-
-assert_eq!(s.find(x), None);
-

fn rfind<'a, P>(&'a self, pat: P) -> Option<usize> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

-

Returns the byte index of the last character of this string slice that -matches the pattern.

- -

Returns None if the pattern doesn't match.

- -

The pattern can be a &str, char, or a closure that determines if -a character matches.

- -

Examples

-

Simple patterns:

- -
-let s = "Löwe 老虎 Léopard";
-
-assert_eq!(s.rfind('L'), Some(13));
-assert_eq!(s.rfind('é'), Some(14));
- -

More complex patterns with closures:

- -
-let s = "Löwe 老虎 Léopard";
-
-assert_eq!(s.rfind(char::is_whitespace), Some(12));
-assert_eq!(s.rfind(char::is_lowercase), Some(20));
- -

Not finding the pattern:

- -
-let s = "Löwe 老虎 Léopard";
-let x: &[_] = &['1', '2'];
-
-assert_eq!(s.rfind(x), None);
-

fn split<'a, P>(&'a self, pat: P) -> Split<'a, P> where P: Pattern<'a>

-

An iterator over substrings of this string slice, separated by -characters matched by a pattern.

- -

The pattern can be a &str, char, or a closure that determines the -split.

- -

Iterator behavior

-

The returned iterator will be a DoubleEndedIterator if the pattern -allows a reverse search and forward/reverse search yields the same -elements. This is true for, eg, char but not for &str.

- -

If the pattern allows a reverse search but its results might differ -from a forward search, the rsplit() method can be used.

- -

Examples

-

Simple patterns:

- -
-let v: Vec<&str> = "Mary had a little lamb".split(' ').collect();
-assert_eq!(v, ["Mary", "had", "a", "little", "lamb"]);
-
-let v: Vec<&str> = "".split('X').collect();
-assert_eq!(v, [""]);
-
-let v: Vec<&str> = "lionXXtigerXleopard".split('X').collect();
-assert_eq!(v, ["lion", "", "tiger", "leopard"]);
-
-let v: Vec<&str> = "lion::tiger::leopard".split("::").collect();
-assert_eq!(v, ["lion", "tiger", "leopard"]);
-
-let v: Vec<&str> = "abc1def2ghi".split(char::is_numeric).collect();
-assert_eq!(v, ["abc", "def", "ghi"]);
-
-let v: Vec<&str> = "lionXtigerXleopard".split(char::is_uppercase).collect();
-assert_eq!(v, ["lion", "tiger", "leopard"]);
- -

A more complex pattern, using a closure:

- -
-let v: Vec<&str> = "abc1defXghi".split(|c| c == '1' || c == 'X').collect();
-assert_eq!(v, ["abc", "def", "ghi"]);
- -

If a string contains multiple contiguous separators, you will end up -with empty strings in the output:

- -
-let x = "||||a||b|c".to_string();
-let d: Vec<_> = x.split('|').collect();
-
-assert_eq!(d, &["", "", "", "", "a", "", "b", "c"]);
- -

This can lead to possibly surprising behavior when whitespace is used -as the separator. This code is correct:

- -
-let x = "    a  b c".to_string();
-let d: Vec<_> = x.split(' ').collect();
-
-assert_eq!(d, &["", "", "", "", "a", "", "b", "c"]);
- -

It does not give you:

- -
-assert_eq!(d, &["a", "b", "c"]);
- -

Use split_whitespace() for this behavior.

-

fn rsplit<'a, P>(&'a self, pat: P) -> RSplit<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

-

An iterator over substrings of the given string slice, separated by -characters matched by a pattern and yielded in reverse order.

- -

The pattern can be a &str, char, or a closure that determines the -split.

- -

Iterator behavior

-

The returned iterator requires that the pattern supports a reverse -search, and it will be a DoubleEndedIterator if a forward/reverse -search yields the same elements.

- -

For iterating from the front, the split() method can be used.

- -

Examples

-

Simple patterns:

- -
-let v: Vec<&str> = "Mary had a little lamb".rsplit(' ').collect();
-assert_eq!(v, ["lamb", "little", "a", "had", "Mary"]);
-
-let v: Vec<&str> = "".rsplit('X').collect();
-assert_eq!(v, [""]);
-
-let v: Vec<&str> = "lionXXtigerXleopard".rsplit('X').collect();
-assert_eq!(v, ["leopard", "tiger", "", "lion"]);
-
-let v: Vec<&str> = "lion::tiger::leopard".rsplit("::").collect();
-assert_eq!(v, ["leopard", "tiger", "lion"]);
- -

A more complex pattern, using a closure:

- -
-let v: Vec<&str> = "abc1defXghi".rsplit(|c| c == '1' || c == 'X').collect();
-assert_eq!(v, ["ghi", "def", "abc"]);
-

fn split_terminator<'a, P>(&'a self, pat: P) -> SplitTerminator<'a, P> where P: Pattern<'a>

-

An iterator over substrings of the given string slice, separated by -characters matched by a pattern.

- -

The pattern can be a &str, char, or a closure that determines the -split.

- -

Equivalent to split(), except that the trailing substring -is skipped if empty.

- -

This method can be used for string data that is terminated, -rather than separated by a pattern.

- -

Iterator behavior

-

The returned iterator will be a DoubleEndedIterator if the pattern -allows a reverse search and forward/reverse search yields the same -elements. This is true for, eg, char but not for &str.

- -

If the pattern allows a reverse search but its results might differ -from a forward search, the rsplit_terminator() method can be used.

- -

Examples

-

Basic usage:

- -
-let v: Vec<&str> = "A.B.".split_terminator('.').collect();
-assert_eq!(v, ["A", "B"]);
-
-let v: Vec<&str> = "A..B..".split_terminator(".").collect();
-assert_eq!(v, ["A", "", "B", ""]);
-

fn rsplit_terminator<'a, P>(&'a self, pat: P) -> RSplitTerminator<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

-

An iterator over substrings of self, separated by characters -matched by a pattern and yielded in reverse order.

- -

The pattern can be a simple &str, char, or a closure that -determines the split. -Additional libraries might provide more complex patterns like -regular expressions.

- -

Equivalent to split(), except that the trailing substring is -skipped if empty.

- -

This method can be used for string data that is terminated, -rather than separated by a pattern.

- -

Iterator behavior

-

The returned iterator requires that the pattern supports a -reverse search, and it will be double ended if a forward/reverse -search yields the same elements.

- -

For iterating from the front, the split_terminator() method can be -used.

- -

Examples

-
-let v: Vec<&str> = "A.B.".rsplit_terminator('.').collect();
-assert_eq!(v, ["B", "A"]);
-
-let v: Vec<&str> = "A..B..".rsplit_terminator(".").collect();
-assert_eq!(v, ["", "B", "", "A"]);
-

fn splitn<'a, P>(&'a self, count: usize, pat: P) -> SplitN<'a, P> where P: Pattern<'a>

-

An iterator over substrings of the given string slice, separated by a -pattern, restricted to returning at most count items.

- -

The last element returned, if any, will contain the remainder of the -string slice.

- -

The pattern can be a &str, char, or a closure that determines the -split.

- -

Iterator behavior

-

The returned iterator will not be double ended, because it is -not efficient to support.

- -

If the pattern allows a reverse search, the rsplitn() method can be -used.

- -

Examples

-

Simple patterns:

- -
-let v: Vec<&str> = "Mary had a little lambda".splitn(3, ' ').collect();
-assert_eq!(v, ["Mary", "had", "a little lambda"]);
-
-let v: Vec<&str> = "lionXXtigerXleopard".splitn(3, "X").collect();
-assert_eq!(v, ["lion", "", "tigerXleopard"]);
-
-let v: Vec<&str> = "abcXdef".splitn(1, 'X').collect();
-assert_eq!(v, ["abcXdef"]);
-
-let v: Vec<&str> = "".splitn(1, 'X').collect();
-assert_eq!(v, [""]);
- -

A more complex pattern, using a closure:

- -
-let v: Vec<&str> = "abc1defXghi".splitn(2, |c| c == '1' || c == 'X').collect();
-assert_eq!(v, ["abc", "defXghi"]);
-

fn rsplitn<'a, P>(&'a self, count: usize, pat: P) -> RSplitN<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

-

An iterator over substrings of this string slice, separated by a -pattern, starting from the end of the string, restricted to returning -at most count items.

- -

The last element returned, if any, will contain the remainder of the -string slice.

- -

The pattern can be a &str, char, or a closure that -determines the split.

- -

Iterator behavior

-

The returned iterator will not be double ended, because it is not -efficient to support.

- -

For splitting from the front, the splitn() method can be used.

- -

Examples

-

Simple patterns:

- -
-let v: Vec<&str> = "Mary had a little lamb".rsplitn(3, ' ').collect();
-assert_eq!(v, ["lamb", "little", "Mary had a"]);
-
-let v: Vec<&str> = "lionXXtigerXleopard".rsplitn(3, 'X').collect();
-assert_eq!(v, ["leopard", "tiger", "lionX"]);
-
-let v: Vec<&str> = "lion::tiger::leopard".rsplitn(2, "::").collect();
-assert_eq!(v, ["leopard", "lion::tiger"]);
- -

A more complex pattern, using a closure:

- -
-let v: Vec<&str> = "abc1defXghi".rsplitn(2, |c| c == '1' || c == 'X').collect();
-assert_eq!(v, ["ghi", "abc1def"]);
-

fn matches<'a, P>(&'a self, pat: P) -> Matches<'a, P> where P: Pattern<'a>1.2.0

-

An iterator over the matches of a pattern within the given string -slice.

- -

The pattern can be a &str, char, or a closure that -determines if a character matches.

- -

Iterator behavior

-

The returned iterator will be a DoubleEndedIterator if the pattern -allows a reverse search and forward/reverse search yields the same -elements. This is true for, eg, char but not for &str.

- -

If the pattern allows a reverse search but its results might differ -from a forward search, the rmatches() method can be used.

- -

Examples

-

Basic usage:

- -
-let v: Vec<&str> = "abcXXXabcYYYabc".matches("abc").collect();
-assert_eq!(v, ["abc", "abc", "abc"]);
-
-let v: Vec<&str> = "1abc2abc3".matches(char::is_numeric).collect();
-assert_eq!(v, ["1", "2", "3"]);
-

fn rmatches<'a, P>(&'a self, pat: P) -> RMatches<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>1.2.0

-

An iterator over the matches of a pattern within this string slice, -yielded in reverse order.

- -

The pattern can be a &str, char, or a closure that determines if -a character matches.

- -

Iterator behavior

-

The returned iterator requires that the pattern supports a reverse -search, and it will be a DoubleEndedIterator if a forward/reverse -search yields the same elements.

- -

For iterating from the front, the matches() method can be used.

- -

Examples

-

Basic usage:

- -
-let v: Vec<&str> = "abcXXXabcYYYabc".rmatches("abc").collect();
-assert_eq!(v, ["abc", "abc", "abc"]);
-
-let v: Vec<&str> = "1abc2abc3".rmatches(char::is_numeric).collect();
-assert_eq!(v, ["3", "2", "1"]);
-

fn match_indices<'a, P>(&'a self, pat: P) -> MatchIndices<'a, P> where P: Pattern<'a>1.5.0

-

An iterator over the disjoint matches of a pattern within this string -slice as well as the index that the match starts at.

- -

For matches of pat within self that overlap, only the indices -corresponding to the first match are returned.

- -

The pattern can be a &str, char, or a closure that determines -if a character matches.

- -

Iterator behavior

-

The returned iterator will be a DoubleEndedIterator if the pattern -allows a reverse search and forward/reverse search yields the same -elements. This is true for, eg, char but not for &str.

- -

If the pattern allows a reverse search but its results might differ -from a forward search, the rmatch_indices() method can be used.

- -

Examples

-

Basic usage:

- -
-let v: Vec<_> = "abcXXXabcYYYabc".match_indices("abc").collect();
-assert_eq!(v, [(0, "abc"), (6, "abc"), (12, "abc")]);
-
-let v: Vec<_> = "1abcabc2".match_indices("abc").collect();
-assert_eq!(v, [(1, "abc"), (4, "abc")]);
-
-let v: Vec<_> = "ababa".match_indices("aba").collect();
-assert_eq!(v, [(0, "aba")]); // only the first `aba`
-

fn rmatch_indices<'a, P>(&'a self, pat: P) -> RMatchIndices<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>1.5.0

-

An iterator over the disjoint matches of a pattern within self, -yielded in reverse order along with the index of the match.

- -

For matches of pat within self that overlap, only the indices -corresponding to the last match are returned.

- -

The pattern can be a &str, char, or a closure that determines if a -character matches.

- -

Iterator behavior

-

The returned iterator requires that the pattern supports a reverse -search, and it will be a DoubleEndedIterator if a forward/reverse -search yields the same elements.

- -

For iterating from the front, the match_indices() method can be used.

- -

Examples

-

Basic usage:

- -
-let v: Vec<_> = "abcXXXabcYYYabc".rmatch_indices("abc").collect();
-assert_eq!(v, [(12, "abc"), (6, "abc"), (0, "abc")]);
-
-let v: Vec<_> = "1abcabc2".rmatch_indices("abc").collect();
-assert_eq!(v, [(4, "abc"), (1, "abc")]);
-
-let v: Vec<_> = "ababa".rmatch_indices("aba").collect();
-assert_eq!(v, [(2, "aba")]); // only the last `aba`
-

fn trim(&self) -> &str

-

Returns a string slice with leading and trailing whitespace removed.

- -

'Whitespace' is defined according to the terms of the Unicode Derived -Core Property White_Space.

- -

Examples

-

Basic usage:

- -
-let s = " Hello\tworld\t";
-
-assert_eq!("Hello\tworld", s.trim());
-

fn trim_left(&self) -> &str

-

Returns a string slice with leading whitespace removed.

- -

'Whitespace' is defined according to the terms of the Unicode Derived -Core Property White_Space.

- -

Text directionality

-

A string is a sequence of bytes. 'Left' in this context means the first -position of that byte string; for a language like Arabic or Hebrew -which are 'right to left' rather than 'left to right', this will be -the right side, not the left.

- -

Examples

-

Basic usage:

- -
-let s = " Hello\tworld\t";
-
-assert_eq!("Hello\tworld\t", s.trim_left());
- -

Directionality:

- -
-let s = "  English";
-assert!(Some('E') == s.trim_left().chars().next());
-
-let s = "  עברית";
-assert!(Some('ע') == s.trim_left().chars().next());
-

fn trim_right(&self) -> &str

-

Returns a string slice with trailing whitespace removed.

- -

'Whitespace' is defined according to the terms of the Unicode Derived -Core Property White_Space.

- -

Text directionality

-

A string is a sequence of bytes. 'Right' in this context means the last -position of that byte string; for a language like Arabic or Hebrew -which are 'right to left' rather than 'left to right', this will be -the left side, not the right.

- -

Examples

-

Basic usage:

- -
-let s = " Hello\tworld\t";
-
-assert_eq!(" Hello\tworld", s.trim_right());
- -

Directionality:

- -
-let s = "English  ";
-assert!(Some('h') == s.trim_right().chars().rev().next());
-
-let s = "עברית  ";
-assert!(Some('ת') == s.trim_right().chars().rev().next());
-

fn trim_matches<'a, P>(&'a self, pat: P) -> &'a str where P: Pattern<'a>, P::Searcher: DoubleEndedSearcher<'a>

-

Returns a string slice with all prefixes and suffixes that match a -pattern repeatedly removed.

- -

The pattern can be a &str, char, or a closure that determines -if a character matches.

- -

Examples

-

Simple patterns:

- -
-assert_eq!("11foo1bar11".trim_matches('1'), "foo1bar");
-assert_eq!("123foo1bar123".trim_matches(char::is_numeric), "foo1bar");
-
-let x: &[_] = &['1', '2'];
-assert_eq!("12foo1bar12".trim_matches(x), "foo1bar");
- -

A more complex pattern, using a closure:

- -
-assert_eq!("1foo1barXX".trim_matches(|c| c == '1' || c == 'X'), "foo1bar");
-

fn trim_left_matches<'a, P>(&'a self, pat: P) -> &'a str where P: Pattern<'a>

-

Returns a string slice with all prefixes that match a pattern -repeatedly removed.

- -

The pattern can be a &str, char, or a closure that determines if -a character matches.

- -

Text directionality

-

A string is a sequence of bytes. 'Left' in this context means the first -position of that byte string; for a language like Arabic or Hebrew -which are 'right to left' rather than 'left to right', this will be -the right side, not the left.

- -

Examples

-

Basic usage:

- -
-assert_eq!("11foo1bar11".trim_left_matches('1'), "foo1bar11");
-assert_eq!("123foo1bar123".trim_left_matches(char::is_numeric), "foo1bar123");
-
-let x: &[_] = &['1', '2'];
-assert_eq!("12foo1bar12".trim_left_matches(x), "foo1bar12");
-

fn trim_right_matches<'a, P>(&'a self, pat: P) -> &'a str where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

-

Returns a string slice with all suffixes that match a pattern -repeatedly removed.

- -

The pattern can be a &str, char, or a closure that -determines if a character matches.

- -

Text directionality

-

A string is a sequence of bytes. 'Right' in this context means the last -position of that byte string; for a language like Arabic or Hebrew -which are 'right to left' rather than 'left to right', this will be -the left side, not the right.

- -

Examples

-

Simple patterns:

- -
-assert_eq!("11foo1bar11".trim_right_matches('1'), "11foo1bar");
-assert_eq!("123foo1bar123".trim_right_matches(char::is_numeric), "123foo1bar");
-
-let x: &[_] = &['1', '2'];
-assert_eq!("12foo1bar12".trim_right_matches(x), "12foo1bar");
- -

A more complex pattern, using a closure:

- -
-assert_eq!("1fooX".trim_left_matches(|c| c == '1' || c == 'X'), "fooX");
-

fn parse<F>(&self) -> Result<F, F::Err> where F: FromStr

-

Parses this string slice into another type.

- -

Because parse() is so general, it can cause problems with type -inference. As such, parse() is one of the few times you'll see -the syntax affectionately known as the 'turbofish': ::<>. This -helps the inference algorithm understand specifically which type -you're trying to parse into.

- -

parse() can parse any type that implements the FromStr trait.

- -

Errors

-

Will return Err if it's not possible to parse this string slice into -the desired type.

- -

Example

-

Basic usage

- -
-let four: u32 = "4".parse().unwrap();
-
-assert_eq!(4, four);
- -

Using the 'turbofish' instead of annotating four:

- -
-let four = "4".parse::<u32>();
-
-assert_eq!(Ok(4), four);
- -

Failing to parse:

- -
-let nope = "j".parse::<u32>();
-
-assert!(nope.is_err());
-

fn replace<'a, P>(&'a self, from: P, to: &str) -> String where P: Pattern<'a>

-

Replaces all matches of a pattern with another string.

- -

replace creates a new String, and copies the data from this string slice into it. -While doing so, it attempts to find matches of a pattern. If it finds any, it -replaces them with the replacement string slice.

- -

Examples

-

Basic usage:

- -
-let s = "this is old";
-
-assert_eq!("this is new", s.replace("old", "new"));
- -

When the pattern doesn't match:

- -
-let s = "this is old";
-assert_eq!(s, s.replace("cookie monster", "little lamb"));
-

fn to_lowercase(&self) -> String1.2.0

-

Returns the lowercase equivalent of this string slice, as a new String.

- -

'Lowercase' is defined according to the terms of the Unicode Derived Core Property -Lowercase.

- -

Examples

-

Basic usage:

- -
-let s = "HELLO";
-
-assert_eq!("hello", s.to_lowercase());
- -

A tricky example, with sigma:

- -
-let sigma = "Σ";
-
-assert_eq!("σ", sigma.to_lowercase());
-
-// but at the end of a word, it's ς, not σ:
-let odysseus = "ὈΔΥΣΣΕΎΣ";
-
-assert_eq!("ὀδυσσεύς", odysseus.to_lowercase());
- -

Languages without case are not changed:

- -
-let new_year = "农历新年";
-
-assert_eq!(new_year, new_year.to_lowercase());
-

fn to_uppercase(&self) -> String1.2.0

-

Returns the uppercase equivalent of this string slice, as a new String.

- -

'Uppercase' is defined according to the terms of the Unicode Derived Core Property -Uppercase.

- -

Examples

-

Basic usage:

- -
-let s = "hello";
-
-assert_eq!("HELLO", s.to_uppercase());
- -

Scripts without case are not changed:

- -
-let new_year = "农历新年";
-
-assert_eq!(new_year, new_year.to_uppercase());
-

fn escape_default(&self) -> String

-
Unstable (str_escape)

: return type may change to be an iterator

-

Escapes each char in s with char::escape_default.

-

fn escape_unicode(&self) -> String

-
Unstable (str_escape)

: return type may change to be an iterator

-

Escapes each char in s with char::escape_unicode.

-

fn into_string(self: Box<str>) -> String1.4.0

-

Converts a Box<str> into a String without copying or allocating.

- -

Examples

-

Basic usage:

- -
-let string = String::from("birthday gift");
-let boxed_str = string.clone().into_boxed_str();
-
-assert_eq!(boxed_str.into_string(), string);
-

Trait Implementations

impl AsRef<OsStr> for String

fn as_ref(&self) -> &OsStr

-

impl AsRef<Path> for String

fn as_ref(&self) -> &Path

-

impl Borrow<str> for String

fn borrow(&self) -> &str

-

impl Clone for String

fn clone(&self) -> String

-

fn clone_from(&mut self, source: &String)

-

impl FromIterator<char> for String

fn from_iter<I>(iter: I) -> String where I: IntoIterator<Item=char>

-

impl<'a> FromIterator<&'a str> for String

fn from_iter<I>(iter: I) -> String where I: IntoIterator<Item=&'a str>

-

impl FromIterator<String> for String1.4.0

fn from_iter<I>(iter: I) -> String where I: IntoIterator<Item=String>

-

impl Extend<char> for String

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=char>

-

impl<'a> Extend<&'a char> for String1.2.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a char>

-

impl<'a> Extend<&'a str> for String

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a str>

-

impl Extend<String> for String1.4.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=String>

-

impl<'a, 'b> Pattern<'a> for &'b String

A convenience impl that delegates to the impl for &str

-

type Searcher = &'b str::Searcher

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn into_searcher(self, haystack: &'a str) -> &'b str::Searcher

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn is_contained_in(self, haystack: &'a str) -> bool

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn is_prefix_of(self, haystack: &'a str) -> bool

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn is_suffix_of(self, haystack: &'a str) -> bool where Self::Searcher: ReverseSearcher<'a>

-

impl PartialEq<String> for String

fn eq(&self, other: &String) -> bool

-

fn ne(&self, other: &String) -> bool

-

impl<'a, 'b> PartialEq<str> for String

fn eq(&self, other: &str) -> bool

-

fn ne(&self, other: &str) -> bool

-

impl<'a, 'b> PartialEq<&'a str> for String

fn eq(&self, other: &&'a str) -> bool

-

fn ne(&self, other: &&'a str) -> bool

-

impl<'a, 'b> PartialEq<Cow<'a, str>> for String

fn eq(&self, other: &Cow<'a, str>) -> bool

-

fn ne(&self, other: &Cow<'a, str>) -> bool

-

impl Default for String

fn default() -> String

-

impl Display for String

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl Debug for String

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl Hash for String

fn hash<H>(&self, hasher: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<'a> Add<&'a str> for String

type Output = String

-

fn add(self, other: &str) -> String

-

impl Index<Range<usize>> for String

type Output = str

-

fn index(&self, index: Range<usize>) -> &str

-

impl Index<RangeTo<usize>> for String

type Output = str

-

fn index(&self, index: RangeTo<usize>) -> &str

-

impl Index<RangeFrom<usize>> for String

type Output = str

-

fn index(&self, index: RangeFrom<usize>) -> &str

-

impl Index<RangeFull> for String

type Output = str

-

fn index(&self, _index: RangeFull) -> &str

-

impl Index<RangeInclusive<usize>> for String

type Output = str

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn index(&self, index: RangeInclusive<usize>) -> &str

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl Index<RangeToInclusive<usize>> for String

type Output = str

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn index(&self, index: RangeToInclusive<usize>) -> &str

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl IndexMut<Range<usize>> for String1.2.0

fn index_mut(&mut self, index: Range<usize>) -> &mut str

-

impl IndexMut<RangeTo<usize>> for String1.2.0

fn index_mut(&mut self, index: RangeTo<usize>) -> &mut str

-

impl IndexMut<RangeFrom<usize>> for String1.2.0

fn index_mut(&mut self, index: RangeFrom<usize>) -> &mut str

-

impl IndexMut<RangeFull> for String1.2.0

fn index_mut(&mut self, _index: RangeFull) -> &mut str

-

impl IndexMut<RangeInclusive<usize>> for String

fn index_mut(&mut self, index: RangeInclusive<usize>) -> &mut str

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl IndexMut<RangeToInclusive<usize>> for String

fn index_mut(&mut self, index: RangeToInclusive<usize>) -> &mut str

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl Deref for String

type Target = str

-

fn deref(&self) -> &str

-

impl DerefMut for String1.2.0

fn deref_mut(&mut self) -> &mut str

-

impl FromStr for String

type Err = ParseError

-

fn from_str(s: &str) -> Result<String, ParseError>

-

impl AsRef<str> for String

fn as_ref(&self) -> &str

-

impl AsRef<[u8]> for String

fn as_ref(&self) -> &[u8]

-

impl<'a> From<&'a str> for String

fn from(s: &'a str) -> String

-

impl Into<Vec<u8>> for String

fn into(self) -> Vec<u8>

-

impl Write for String

fn write_str(&mut self, s: &str) -> Result<(), Error>

-

fn write_char(&mut self, c: char) -> Result<(), Error>

-

fn write_fmt(&mut self, args: Arguments) -> Result<(), Error>

-

Derived Implementations

impl Ord for String

fn cmp(&self, __arg_0: &String) -> Ordering

-

impl Eq for String

impl PartialOrd<String> for String

fn partial_cmp(&self, __arg_0: &String) -> Option<Ordering>

-

fn lt(&self, __arg_0: &String) -> bool

-

fn le(&self, __arg_0: &String) -> bool

-

fn gt(&self, __arg_0: &String) -> bool

-

fn ge(&self, __arg_0: &String) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/struct.Vec.html b/doc/bitflags/__core/prelude/v1/struct.Vec.html deleted file mode 100644 index e14bf2c5..00000000 --- a/doc/bitflags/__core/prelude/v1/struct.Vec.html +++ /dev/null @@ -1,1330 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Vec - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::prelude::v1::Vec - - [−] - - [src]

-
pub struct Vec<T> {
-    // some fields omitted
-}
1.0.0

A contiguous growable array type, written Vec<T> but pronounced 'vector.'

- -

Examples

-
-let mut vec = Vec::new();
-vec.push(1);
-vec.push(2);
-
-assert_eq!(vec.len(), 2);
-assert_eq!(vec[0], 1);
-
-assert_eq!(vec.pop(), Some(2));
-assert_eq!(vec.len(), 1);
-
-vec[0] = 7;
-assert_eq!(vec[0], 7);
-
-vec.extend([1, 2, 3].iter().cloned());
-
-for x in &vec {
-    println!("{}", x);
-}
-assert_eq!(vec, [7, 1, 2, 3]);
- -

The vec! macro is provided to make initialization more convenient:

- -
-let mut vec = vec![1, 2, 3];
-vec.push(4);
-assert_eq!(vec, [1, 2, 3, 4]);
- -

It can also initialize each element of a Vec<T> with a given value:

- -
-let vec = vec![0; 5];
-assert_eq!(vec, [0, 0, 0, 0, 0]);
- -

Use a Vec<T> as an efficient stack:

- -
-let mut stack = Vec::new();
-
-stack.push(1);
-stack.push(2);
-stack.push(3);
-
-while let Some(top) = stack.pop() {
-    // Prints 3, 2, 1
-    println!("{}", top);
-}
- -

Indexing

-

The Vec type allows to access values by index, because it implements the -Index trait. An example will be more explicit:

- -
-let v = vec!(0, 2, 4, 6);
-println!("{}", v[1]); // it will display '2'
- -

However be careful: if you try to access an index which isn't in the Vec, -your software will panic! You cannot do this:

- -
-let v = vec!(0, 2, 4, 6);
-println!("{}", v[6]); // it will panic!
- -

In conclusion: always check if the index you want to get really exists -before doing it.

- -

Slicing

-

A Vec can be mutable. Slices, on the other hand, are read-only objects. -To get a slice, use "&". Example:

- -
-fn read_slice(slice: &[usize]) {
-    // ...
-}
-
-let v = vec!(0, 1);
-read_slice(&v);
-
-// ... and that's all!
-// you can also do it like this:
-let x : &[usize] = &v;
- -

In Rust, it's more common to pass slices as arguments rather than vectors -when you just want to provide a read access. The same goes for String and -&str.

- -

Capacity and reallocation

-

The capacity of a vector is the amount of space allocated for any future -elements that will be added onto the vector. This is not to be confused with -the length of a vector, which specifies the number of actual elements -within the vector. If a vector's length exceeds its capacity, its capacity -will automatically be increased, but its elements will have to be -reallocated.

- -

For example, a vector with capacity 10 and length 0 would be an empty vector -with space for 10 more elements. Pushing 10 or fewer elements onto the -vector will not change its capacity or cause reallocation to occur. However, -if the vector's length is increased to 11, it will have to reallocate, which -can be slow. For this reason, it is recommended to use Vec::with_capacity -whenever possible to specify how big the vector is expected to get.

- -

Guarantees

-

Due to its incredibly fundamental nature, Vec makes a lot of guarantees -about its design. This ensures that it's as low-overhead as possible in -the general case, and can be correctly manipulated in primitive ways -by unsafe code. Note that these guarantees refer to an unqualified Vec<T>. -If additional type parameters are added (e.g. to support custom allocators), -overriding their defaults may change the behavior.

- -

Most fundamentally, Vec is and always will be a (pointer, capacity, length) -triplet. No more, no less. The order of these fields is completely -unspecified, and you should use the appropriate methods to modify these. -The pointer will never be null, so this type is null-pointer-optimized.

- -

However, the pointer may not actually point to allocated memory. In particular, -if you construct a Vec with capacity 0 via Vec::new(), vec![], -Vec::with_capacity(0), or by calling shrink_to_fit() on an empty Vec, it -will not allocate memory. Similarly, if you store zero-sized types inside -a Vec, it will not allocate space for them. Note that in this case the -Vec may not report a capacity() of 0. Vec will allocate if and only -if mem::size_of::<T>() * capacity() > 0. In general, Vec's allocation -details are subtle enough that it is strongly recommended that you only -free memory allocated by a Vec by creating a new Vec and dropping it.

- -

If a Vec has allocated memory, then the memory it points to is on the heap -(as defined by the allocator Rust is configured to use by default), and its -pointer points to len() initialized elements in order (what you would see -if you coerced it to a slice), followed by capacity() - len() logically -uninitialized elements.

- -

Vec will never perform a "small optimization" where elements are actually -stored on the stack for two reasons:

- -
    -

  • It would make it more difficult for unsafe code to correctly manipulate -a Vec. The contents of a Vec wouldn't have a stable address if it were -only moved, and it would be more difficult to determine if a Vec had -actually allocated memory.

    • -

  • It would penalize the general case, incurring an additional branch -on every access.

    • -
- -

Vec will never automatically shrink itself, even if completely empty. This -ensures no unnecessary allocations or deallocations occur. Emptying a Vec -and then filling it back up to the same len() should incur no calls to -the allocator. If you wish to free up unused memory, use shrink_to_fit.

- -

push and insert will never (re)allocate if the reported capacity is -sufficient. push and insert will (re)allocate if len() == capacity(). -That is, the reported capacity is completely accurate, and can be relied on. -It can even be used to manually free the memory allocated by a Vec if -desired. Bulk insertion methods may reallocate, even when not necessary.

- -

Vec does not guarantee any particular growth strategy when reallocating -when full, nor when reserve is called. The current strategy is basic -and it may prove desirable to use a non-constant growth factor. Whatever -strategy is used will of course guarantee O(1) amortized push.

- -

vec![x; n], vec![a, b, c, d], and Vec::with_capacity(n), will all -produce a Vec with exactly the requested capacity. If len() == capacity(), -(as is the case for the vec! macro), then a Vec<T> can be converted -to and from a Box<[T]> without reallocating or moving the elements.

- -

Vec will not specifically overwrite any data that is removed from it, -but also won't specifically preserve it. Its uninitialized memory is -scratch space that it may use however it wants. It will generally just do -whatever is most efficient or otherwise easy to implement. Do not rely on -removed data to be erased for security purposes. Even if you drop a Vec, its -buffer may simply be reused by another Vec. Even if you zero a Vec's memory -first, that may not actually happen because the optimizer does not consider -this a side-effect that must be preserved.

- -

Vec does not currently guarantee the order in which elements are dropped -(the order has changed in the past, and may change again).

-

Methods

impl<T> Vec<T>

fn new() -> Vec<T>

-

Constructs a new, empty Vec<T>.

- -

The vector will not allocate until elements are pushed onto it.

- -

Examples

-
-let mut vec: Vec<i32> = Vec::new();
-

fn with_capacity(capacity: usize) -> Vec<T>

-

Constructs a new, empty Vec<T> with the specified capacity.

- -

The vector will be able to hold exactly capacity elements without -reallocating. If capacity is 0, the vector will not allocate.

- -

It is important to note that this function does not specify the length -of the returned vector, but only the capacity. (For an explanation of -the difference between length and capacity, see the main Vec<T> docs -above, 'Capacity and reallocation'.)

- -

Examples

-
-let mut vec = Vec::with_capacity(10);
-
-// The vector contains no items, even though it has capacity for more
-assert_eq!(vec.len(), 0);
-
-// These are all done without reallocating...
-for i in 0..10 {
-    vec.push(i);
-}
-
-// ...but this may make the vector reallocate
-vec.push(11);
-

unsafe fn from_raw_parts(ptr: *mut T, length: usize, capacity: usize) -> Vec<T>

-

Creates a Vec<T> directly from the raw components of another vector.

- -

Safety

-

This is highly unsafe, due to the number of invariants that aren't -checked:

- -
    -
  • ptr needs to have been previously allocated via String/Vec<T> -(at least, it's highly likely to be incorrect if it wasn't).
    • -
  • length needs to be the length that less than or equal to capacity.
    • -
  • capacity needs to be the capacity that the pointer was allocated with.
    • -
- -

Violating these may cause problems like corrupting the allocator's -internal datastructures.

- -

Examples

-
-use std::ptr;
-use std::mem;
-
-fn main() {
-    let mut v = vec![1, 2, 3];
-
-    // Pull out the various important pieces of information about `v`
-    let p = v.as_mut_ptr();
-    let len = v.len();
-    let cap = v.capacity();
-
-    unsafe {
-        // Cast `v` into the void: no destructor run, so we are in
-        // complete control of the allocation to which `p` points.
-        mem::forget(v);
-
-        // Overwrite memory with 4, 5, 6
-        for i in 0..len as isize {
-            ptr::write(p.offset(i), 4 + i);
-        }
-
-        // Put everything back together into a Vec
-        let rebuilt = Vec::from_raw_parts(p, len, cap);
-        assert_eq!(rebuilt, [4, 5, 6]);
-    }
-}
-

fn capacity(&self) -> usize

-

Returns the number of elements the vector can hold without -reallocating.

- -

Examples

-
-let vec: Vec<i32> = Vec::with_capacity(10);
-assert_eq!(vec.capacity(), 10);
-

fn reserve(&mut self, additional: usize)

-

Reserves capacity for at least additional more elements to be inserted -in the given Vec<T>. The collection may reserve more space to avoid -frequent reallocations.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-
-let mut vec = vec![1];
-vec.reserve(10);
-assert!(vec.capacity() >= 11);
-

fn reserve_exact(&mut self, additional: usize)

-

Reserves the minimum capacity for exactly additional more elements to -be inserted in the given Vec<T>. Does nothing if the capacity is already -sufficient.

- -

Note that the allocator may give the collection more space than it -requests. Therefore capacity can not be relied upon to be precisely -minimal. Prefer reserve if future insertions are expected.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-
-let mut vec = vec![1];
-vec.reserve_exact(10);
-assert!(vec.capacity() >= 11);
-

fn shrink_to_fit(&mut self)

-

Shrinks the capacity of the vector as much as possible.

- -

It will drop down as close as possible to the length but the allocator -may still inform the vector that there is space for a few more elements.

- -

Examples

-
-let mut vec = Vec::with_capacity(10);
-vec.extend([1, 2, 3].iter().cloned());
-assert_eq!(vec.capacity(), 10);
-vec.shrink_to_fit();
-assert!(vec.capacity() >= 3);
-

fn into_boxed_slice(self) -> Box<[T]>

-

Converts the vector into Box<[T]>.

- -

Note that this will drop any excess capacity. Calling this and -converting back to a vector with into_vec() is equivalent to calling -shrink_to_fit().

-

fn truncate(&mut self, len: usize)

-

Shorten a vector to be len elements long, dropping excess elements.

- -

If len is greater than the vector's current length, this has no -effect.

- -

Examples

-
-let mut vec = vec![1, 2, 3, 4, 5];
-vec.truncate(2);
-assert_eq!(vec, [1, 2]);
-

fn as_slice(&self) -> &[T]1.7.0

-

Extracts a slice containing the entire vector.

- -

Equivalent to &s[..].

-

fn as_mut_slice(&mut self) -> &mut [T]1.7.0

-

Extracts a mutable slice of the entire vector.

- -

Equivalent to &mut s[..].

-

unsafe fn set_len(&mut self, len: usize)

-

Sets the length of a vector.

- -

This will explicitly set the size of the vector, without actually -modifying its buffers, so it is up to the caller to ensure that the -vector is actually the specified size.

- -

Examples

-
-let mut v = vec![1, 2, 3, 4];
-unsafe {
-    v.set_len(1);
-}
-

fn swap_remove(&mut self, index: usize) -> T

-

Removes an element from anywhere in the vector and return it, replacing -it with the last element.

- -

This does not preserve ordering, but is O(1).

- -

Panics

-

Panics if index is out of bounds.

- -

Examples

-
-let mut v = vec!["foo", "bar", "baz", "qux"];
-
-assert_eq!(v.swap_remove(1), "bar");
-assert_eq!(v, ["foo", "qux", "baz"]);
-
-assert_eq!(v.swap_remove(0), "foo");
-assert_eq!(v, ["baz", "qux"]);
-

fn insert(&mut self, index: usize, element: T)

-

Inserts an element at position index within the vector, shifting all -elements after it to the right.

- -

Panics

-

Panics if index is greater than the vector's length.

- -

Examples

-
-let mut vec = vec![1, 2, 3];
-vec.insert(1, 4);
-assert_eq!(vec, [1, 4, 2, 3]);
-vec.insert(4, 5);
-assert_eq!(vec, [1, 4, 2, 3, 5]);
-

fn remove(&mut self, index: usize) -> T

-

Removes and returns the element at position index within the vector, -shifting all elements after it to the left.

- -

Panics

-

Panics if index is out of bounds.

- -

Examples

-
-let mut v = vec![1, 2, 3];
-assert_eq!(v.remove(1), 2);
-assert_eq!(v, [1, 3]);
-

fn retain<F>(&mut self, f: F) where F: FnMut(&T) -> bool

-

Retains only the elements specified by the predicate.

- -

In other words, remove all elements e such that f(&e) returns false. -This method operates in place and preserves the order of the retained -elements.

- -

Examples

-
-let mut vec = vec![1, 2, 3, 4];
-vec.retain(|&x| x%2 == 0);
-assert_eq!(vec, [2, 4]);
-

fn push(&mut self, value: T)

-

Appends an element to the back of a collection.

- -

Panics

-

Panics if the number of elements in the vector overflows a usize.

- -

Examples

-
-let mut vec = vec![1, 2];
-vec.push(3);
-assert_eq!(vec, [1, 2, 3]);
-

fn pop(&mut self) -> Option<T>

-

Removes the last element from a vector and returns it, or None if it -is empty.

- -

Examples

-
-let mut vec = vec![1, 2, 3];
-assert_eq!(vec.pop(), Some(3));
-assert_eq!(vec, [1, 2]);
-

fn append(&mut self, other: &mut Vec<T>)1.4.0

-

Moves all the elements of other into Self, leaving other empty.

- -

Panics

-

Panics if the number of elements in the vector overflows a usize.

- -

Examples

-
-let mut vec = vec![1, 2, 3];
-let mut vec2 = vec![4, 5, 6];
-vec.append(&mut vec2);
-assert_eq!(vec, [1, 2, 3, 4, 5, 6]);
-assert_eq!(vec2, []);
-

fn drain<R>(&mut self, range: R) -> Drain<T> where R: RangeArgument<usize>1.6.0

-

Create a draining iterator that removes the specified range in the vector -and yields the removed items.

- -

Note 1: The element range is removed even if the iterator is not -consumed until the end.

- -

Note 2: It is unspecified how many elements are removed from the vector, -if the Drain value is leaked.

- -

Panics

-

Panics if the starting point is greater than the end point or if -the end point is greater than the length of the vector.

- -

Examples

-
-let mut v = vec![1, 2, 3];
-let u: Vec<_> = v.drain(1..).collect();
-assert_eq!(v, &[1]);
-assert_eq!(u, &[2, 3]);
-
-// A full range clears the vector
-v.drain(..);
-assert_eq!(v, &[]);
-

fn clear(&mut self)

-

Clears the vector, removing all values.

- -

Examples

-
-let mut v = vec![1, 2, 3];
-
-v.clear();
-
-assert!(v.is_empty());
-

fn len(&self) -> usize

-

Returns the number of elements in the vector.

- -

Examples

-
-let a = vec![1, 2, 3];
-assert_eq!(a.len(), 3);
-

fn is_empty(&self) -> bool

-

Returns true if the vector contains no elements.

- -

Examples

-
-let mut v = Vec::new();
-assert!(v.is_empty());
-
-v.push(1);
-assert!(!v.is_empty());
-

fn split_off(&mut self, at: usize) -> Vec<T>1.4.0

-

Splits the collection into two at the given index.

- -

Returns a newly allocated Self. self contains elements [0, at), -and the returned Self contains elements [at, len).

- -

Note that the capacity of self does not change.

- -

Panics

-

Panics if at > len.

- -

Examples

-
-let mut vec = vec![1,2,3];
-let vec2 = vec.split_off(1);
-assert_eq!(vec, [1]);
-assert_eq!(vec2, [2, 3]);
-

impl<T> Vec<T> where T: Clone

fn resize(&mut self, new_len: usize, value: T)1.5.0

-

Resizes the Vec in-place so that len() is equal to new_len.

- -

If new_len is greater than len(), the Vec is extended by the -difference, with each additional slot filled with value. -If new_len is less than len(), the Vec is simply truncated.

- -

Examples

-
-let mut vec = vec!["hello"];
-vec.resize(3, "world");
-assert_eq!(vec, ["hello", "world", "world"]);
-
-let mut vec = vec![1, 2, 3, 4];
-vec.resize(2, 0);
-assert_eq!(vec, [1, 2]);
-

fn extend_from_slice(&mut self, other: &[T])1.6.0

-

Appends all elements in a slice to the Vec.

- -

Iterates over the slice other, clones each element, and then appends -it to this Vec. The other vector is traversed in-order.

- -

Note that this function is same as extend except that it is -specialized to work with slices instead. If and when Rust gets -specialization this function will likely be deprecated (but still -available).

- -

Examples

-
-let mut vec = vec![1];
-vec.extend_from_slice(&[2, 3, 4]);
-assert_eq!(vec, [1, 2, 3, 4]);
-

impl<T> Vec<T> where T: PartialEq<T>

fn dedup(&mut self)

-

Removes consecutive repeated elements in the vector.

- -

If the vector is sorted, this removes all duplicates.

- -

Examples

-
-let mut vec = vec![1, 2, 2, 3, 2];
-
-vec.dedup();
-
-assert_eq!(vec, [1, 2, 3, 2]);
-

Methods from Deref<Target=[T]>

fn len(&self) -> usize

-

Returns the number of elements in the slice.

- -

Example

-
-let a = [1, 2, 3];
-assert_eq!(a.len(), 3);
-

fn is_empty(&self) -> bool

-

Returns true if the slice has a length of 0

- -

Example

-
-let a = [1, 2, 3];
-assert!(!a.is_empty());
-

fn first(&self) -> Option<&T>

-

Returns the first element of a slice, or None if it is empty.

- -

Examples

-
-let v = [10, 40, 30];
-assert_eq!(Some(&10), v.first());
-
-let w: &[i32] = &[];
-assert_eq!(None, w.first());
-

fn first_mut(&mut self) -> Option<&mut T>

-

Returns a mutable pointer to the first element of a slice, or None if it is empty

-

fn split_first(&self) -> Option<(&T, &[T])>1.5.0

-

Returns the first and all the rest of the elements of a slice.

-

fn split_first_mut(&mut self) -> Option<(&mut T, &mut [T])>1.5.0

-

Returns the first and all the rest of the elements of a slice.

-

fn split_last(&self) -> Option<(&T, &[T])>1.5.0

-

Returns the last and all the rest of the elements of a slice.

-

fn split_last_mut(&mut self) -> Option<(&mut T, &mut [T])>1.5.0

-

Returns the last and all the rest of the elements of a slice.

-

fn last(&self) -> Option<&T>

-

Returns the last element of a slice, or None if it is empty.

- -

Examples

-
-let v = [10, 40, 30];
-assert_eq!(Some(&30), v.last());
-
-let w: &[i32] = &[];
-assert_eq!(None, w.last());
-

fn last_mut(&mut self) -> Option<&mut T>

-

Returns a mutable pointer to the last item in the slice.

-

fn get(&self, index: usize) -> Option<&T>

-

Returns the element of a slice at the given index, or None if the -index is out of bounds.

- -

Examples

-
-let v = [10, 40, 30];
-assert_eq!(Some(&40), v.get(1));
-assert_eq!(None, v.get(3));
-

fn get_mut(&mut self, index: usize) -> Option<&mut T>

-

Returns a mutable reference to the element at the given index, -or None if the index is out of bounds

-

unsafe fn get_unchecked(&self, index: usize) -> &T

-

Returns a pointer to the element at the given index, without doing -bounds checking.

-

unsafe fn get_unchecked_mut(&mut self, index: usize) -> &mut T

-

Returns an unsafe mutable pointer to the element in index

-

fn as_ptr(&self) -> *const T

-

Returns an raw pointer to the slice's buffer

- -

The caller must ensure that the slice outlives the pointer this -function returns, or else it will end up pointing to garbage.

- -

Modifying the slice may cause its buffer to be reallocated, which -would also make any pointers to it invalid.

-

fn as_mut_ptr(&mut self) -> *mut T

-

Returns an unsafe mutable pointer to the slice's buffer.

- -

The caller must ensure that the slice outlives the pointer this -function returns, or else it will end up pointing to garbage.

- -

Modifying the slice may cause its buffer to be reallocated, which -would also make any pointers to it invalid.

-

fn swap(&mut self, a: usize, b: usize)

-

Swaps two elements in a slice.

- -

Arguments

-
    -
  • a - The index of the first element
    • -
  • b - The index of the second element
    • -
- -

Panics

-

Panics if a or b are out of bounds.

- -

Example

-
-let mut v = ["a", "b", "c", "d"];
-v.swap(1, 3);
-assert!(v == ["a", "d", "c", "b"]);
-

fn reverse(&mut self)

-

Reverse the order of elements in a slice, in place.

- -

Example

-
-let mut v = [1, 2, 3];
-v.reverse();
-assert!(v == [3, 2, 1]);
-

fn iter(&self) -> Iter<T>

-

Returns an iterator over the slice.

-

fn iter_mut(&mut self) -> IterMut<T>

-

Returns an iterator that allows modifying each value

-

fn windows(&self, size: usize) -> Windows<T>

-

Returns an iterator over all contiguous windows of length -size. The windows overlap. If the slice is shorter than -size, the iterator returns no values.

- -

Panics

-

Panics if size is 0.

- -

Example

-

Print the adjacent pairs of a slice (i.e. [1,2], [2,3], -[3,4]):

- -
-let v = &[1, 2, 3, 4];
-for win in v.windows(2) {
-    println!("{:?}", win);
-}
-

fn chunks(&self, size: usize) -> Chunks<T>

-

Returns an iterator over size elements of the slice at a -time. The chunks are slices and do not overlap. If size does not divide the -length of the slice, then the last chunk will not have length -size.

- -

Panics

-

Panics if size is 0.

- -

Example

-

Print the slice two elements at a time (i.e. [1,2], -[3,4], [5]):

- -
-let v = &[1, 2, 3, 4, 5];
-for win in v.chunks(2) {
-    println!("{:?}", win);
-}
-

fn chunks_mut(&mut self, chunk_size: usize) -> ChunksMut<T>

-

Returns an iterator over chunk_size elements of the slice at a time. -The chunks are mutable slices, and do not overlap. If chunk_size does -not divide the length of the slice, then the last chunk will not -have length chunk_size.

- -

Panics

-

Panics if chunk_size is 0.

-

fn split_at(&self, mid: usize) -> (&[T], &[T])

-

Divides one slice into two at an index.

- -

The first will contain all indices from [0, mid) (excluding -the index mid itself) and the second will contain all -indices from [mid, len) (excluding the index len itself).

- -

Panics

-

Panics if mid > len.

- -

Examples

-
-let v = [10, 40, 30, 20, 50];
-let (v1, v2) = v.split_at(2);
-assert_eq!([10, 40], v1);
-assert_eq!([30, 20, 50], v2);
-

fn split_at_mut(&mut self, mid: usize) -> (&mut [T], &mut [T])

-

Divides one &mut into two at an index.

- -

The first will contain all indices from [0, mid) (excluding -the index mid itself) and the second will contain all -indices from [mid, len) (excluding the index len itself).

- -

Panics

-

Panics if mid > len.

- -

Example

-
-let mut v = [1, 2, 3, 4, 5, 6];
-
-// scoped to restrict the lifetime of the borrows
-{
-   let (left, right) = v.split_at_mut(0);
-   assert!(left == []);
-   assert!(right == [1, 2, 3, 4, 5, 6]);
-}
-
-{
-    let (left, right) = v.split_at_mut(2);
-    assert!(left == [1, 2]);
-    assert!(right == [3, 4, 5, 6]);
-}
-
-{
-    let (left, right) = v.split_at_mut(6);
-    assert!(left == [1, 2, 3, 4, 5, 6]);
-    assert!(right == []);
-}
-

fn split<F>(&self, pred: F) -> Split<T, F> where F: FnMut(&T) -> bool

-

Returns an iterator over subslices separated by elements that match -pred. The matched element is not contained in the subslices.

- -

Examples

-

Print the slice split by numbers divisible by 3 (i.e. [10, 40], -[20], [50]):

- -
-let v = [10, 40, 30, 20, 60, 50];
-for group in v.split(|num| *num % 3 == 0) {
-    println!("{:?}", group);
-}
-

fn split_mut<F>(&mut self, pred: F) -> SplitMut<T, F> where F: FnMut(&T) -> bool

-

Returns an iterator over mutable subslices separated by elements that -match pred. The matched element is not contained in the subslices.

-

fn splitn<F>(&self, n: usize, pred: F) -> SplitN<T, F> where F: FnMut(&T) -> bool

-

Returns an iterator over subslices separated by elements that match -pred, limited to returning at most n items. The matched element is -not contained in the subslices.

- -

The last element returned, if any, will contain the remainder of the -slice.

- -

Examples

-

Print the slice split once by numbers divisible by 3 (i.e. [10, 40], -[20, 60, 50]):

- -
-let v = [10, 40, 30, 20, 60, 50];
-for group in v.splitn(2, |num| *num % 3 == 0) {
-    println!("{:?}", group);
-}
-

fn splitn_mut<F>(&mut self, n: usize, pred: F) -> SplitNMut<T, F> where F: FnMut(&T) -> bool

-

Returns an iterator over subslices separated by elements that match -pred, limited to returning at most n items. The matched element is -not contained in the subslices.

- -

The last element returned, if any, will contain the remainder of the -slice.

-

fn rsplitn<F>(&self, n: usize, pred: F) -> RSplitN<T, F> where F: FnMut(&T) -> bool

-

Returns an iterator over subslices separated by elements that match -pred limited to returning at most n items. This starts at the end of -the slice and works backwards. The matched element is not contained in -the subslices.

- -

The last element returned, if any, will contain the remainder of the -slice.

- -

Examples

-

Print the slice split once, starting from the end, by numbers divisible -by 3 (i.e. [50], [10, 40, 30, 20]):

- -
-let v = [10, 40, 30, 20, 60, 50];
-for group in v.rsplitn(2, |num| *num % 3 == 0) {
-    println!("{:?}", group);
-}
-

fn rsplitn_mut<F>(&mut self, n: usize, pred: F) -> RSplitNMut<T, F> where F: FnMut(&T) -> bool

-

Returns an iterator over subslices separated by elements that match -pred limited to returning at most n items. This starts at the end of -the slice and works backwards. The matched element is not contained in -the subslices.

- -

The last element returned, if any, will contain the remainder of the -slice.

-

fn contains(&self, x: &T) -> bool where T: PartialEq<T>

-

Returns true if the slice contains an element with the given value.

- -

Examples

-
-let v = [10, 40, 30];
-assert!(v.contains(&30));
-assert!(!v.contains(&50));
-

fn starts_with(&self, needle: &[T]) -> bool where T: PartialEq<T>

-

Returns true if needle is a prefix of the slice.

- -

Examples

-
-let v = [10, 40, 30];
-assert!(v.starts_with(&[10]));
-assert!(v.starts_with(&[10, 40]));
-assert!(!v.starts_with(&[50]));
-assert!(!v.starts_with(&[10, 50]));
-

fn ends_with(&self, needle: &[T]) -> bool where T: PartialEq<T>

-

Returns true if needle is a suffix of the slice.

- -

Examples

-
-let v = [10, 40, 30];
-assert!(v.ends_with(&[30]));
-assert!(v.ends_with(&[40, 30]));
-assert!(!v.ends_with(&[50]));
-assert!(!v.ends_with(&[50, 30]));
-
-

Binary search a sorted slice for a given element.

- -

If the value is found then Ok is returned, containing the -index of the matching element; if the value is not found then -Err is returned, containing the index where a matching -element could be inserted while maintaining sorted order.

- -

Example

-

Looks up a series of four elements. The first is found, with a -uniquely determined position; the second and third are not -found; the fourth could match any position in [1,4].

- -
-let s = [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55];
-
-assert_eq!(s.binary_search(&13),  Ok(9));
-assert_eq!(s.binary_search(&4),   Err(7));
-assert_eq!(s.binary_search(&100), Err(13));
-let r = s.binary_search(&1);
-assert!(match r { Ok(1...4) => true, _ => false, });
-

fn binary_search_by<F>(&self, f: F) -> Result<usize, usize> where F: FnMut(&T) -> Ordering

-

Binary search a sorted slice with a comparator function.

- -

The comparator function should implement an order consistent -with the sort order of the underlying slice, returning an -order code that indicates whether its argument is Less, -Equal or Greater the desired target.

- -

If a matching value is found then returns Ok, containing -the index for the matched element; if no match is found then -Err is returned, containing the index where a matching -element could be inserted while maintaining sorted order.

- -

Example

-

Looks up a series of four elements. The first is found, with a -uniquely determined position; the second and third are not -found; the fourth could match any position in [1,4].

- -
-let s = [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55];
-
-let seek = 13;
-assert_eq!(s.binary_search_by(|probe| probe.cmp(&seek)), Ok(9));
-let seek = 4;
-assert_eq!(s.binary_search_by(|probe| probe.cmp(&seek)), Err(7));
-let seek = 100;
-assert_eq!(s.binary_search_by(|probe| probe.cmp(&seek)), Err(13));
-let seek = 1;
-let r = s.binary_search_by(|probe| probe.cmp(&seek));
-assert!(match r { Ok(1...4) => true, _ => false, });
-

fn binary_search_by_key<B, F>(&self, b: &B, f: F) -> Result<usize, usize> where F: FnMut(&T) -> B, B: Ord

-
Unstable (slice_binary_search_by_key)

: recently added

-

Binary search a sorted slice with a key extraction function.

- -

Assumes that the slice is sorted by the key, for instance with -sort_by_key using the same key extraction function.

- -

If a matching value is found then returns Ok, containing the -index for the matched element; if no match is found then Err -is returned, containing the index where a matching element could -be inserted while maintaining sorted order.

- -

Examples

-

Looks up a series of four elements in a slice of pairs sorted by -their second elements. The first is found, with a uniquely -determined position; the second and third are not found; the -fourth could match any position in [1,4].

- -
-#![feature(slice_binary_search_by_key)]
-let s = [(0, 0), (2, 1), (4, 1), (5, 1), (3, 1),
-         (1, 2), (2, 3), (4, 5), (5, 8), (3, 13),
-         (1, 21), (2, 34), (4, 55)];
-
-assert_eq!(s.binary_search_by_key(&13, |&(a,b)| b),  Ok(9));
-assert_eq!(s.binary_search_by_key(&4, |&(a,b)| b),   Err(7));
-assert_eq!(s.binary_search_by_key(&100, |&(a,b)| b), Err(13));
-let r = s.binary_search_by_key(&1, |&(a,b)| b);
-assert!(match r { Ok(1...4) => true, _ => false, });
-

fn sort(&mut self) where T: Ord

-

Sorts the slice, in place.

- -

This is equivalent to self.sort_by(|a, b| a.cmp(b)).

- -

This is a stable sort.

- -

Examples

-
-let mut v = [-5, 4, 1, -3, 2];
-
-v.sort();
-assert!(v == [-5, -3, 1, 2, 4]);
-

fn sort_by_key<B, F>(&mut self, f: F) where B: Ord, F: FnMut(&T) -> B1.7.0

-

Sorts the slice, in place, using key to extract a key by which to -order the sort by.

- -

This sort is O(n log n) worst-case and stable, but allocates -approximately 2 * n, where n is the length of self.

- -

This is a stable sort.

- -

Examples

-
-let mut v = [-5i32, 4, 1, -3, 2];
-
-v.sort_by_key(|k| k.abs());
-assert!(v == [1, 2, -3, 4, -5]);
-

fn sort_by<F>(&mut self, compare: F) where F: FnMut(&T, &T) -> Ordering

-

Sorts the slice, in place, using compare to compare -elements.

- -

This sort is O(n log n) worst-case and stable, but allocates -approximately 2 * n, where n is the length of self.

- -

Examples

-
-let mut v = [5, 4, 1, 3, 2];
-v.sort_by(|a, b| a.cmp(b));
-assert!(v == [1, 2, 3, 4, 5]);
-
-// reverse sorting
-v.sort_by(|a, b| b.cmp(a));
-assert!(v == [5, 4, 3, 2, 1]);
-

fn clone_from_slice(&mut self, src: &[T]) where T: Clone1.7.0

-

Copies the elements from src into self.

- -

The length of this slice must be the same as the slice passed in.

- -

Panics

-

This function will panic if the two slices have different lengths.

- -

Example

-
-let mut dst = [0, 0, 0];
-let src = [1, 2, 3];
-
-dst.clone_from_slice(&src);
-assert!(dst == [1, 2, 3]);
-

fn copy_from_slice(&mut self, src: &[T]) where T: Copy1.9.0

-

Copies all elements from src into self, using a memcpy.

- -

The length of src must be the same as self.

- -

Panics

-

This function will panic if the two slices have different lengths.

- -

Example

-
-let mut dst = [0, 0, 0];
-let src = [1, 2, 3];
-
-dst.copy_from_slice(&src);
-assert_eq!(src, dst);
-

fn to_vec(&self) -> Vec<T> where T: Clone

-

Copies self into a new Vec.

-

fn into_vec(self: Box<[T]>) -> Vec<T>

-

Converts self into a vector without clones or allocation.

-

Trait Implementations

impl<T> From<VecDeque<T>> for Vec<T>1.10.0

fn from(other: VecDeque<T>) -> Vec<T>

-

impl<T> From<BinaryHeap<T>> for Vec<T>

fn from(heap: BinaryHeap<T>) -> Vec<T>

-

impl From<CString> for Vec<u8>1.7.0

fn from(s: CString) -> Vec<u8>

-

impl Write for Vec<u8>

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

impl<T> Clone for Vec<T> where T: Clone

fn clone(&self) -> Vec<T>

-

fn clone_from(&mut self, other: &Vec<T>)

-

impl<T> Hash for Vec<T> where T: Hash

fn hash<H>(&self, state: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<T> Index<usize> for Vec<T>

type Output = T

-

fn index(&self, index: usize) -> &T

-

impl<T> IndexMut<usize> for Vec<T>

fn index_mut(&mut self, index: usize) -> &mut T

-

impl<T> Index<Range<usize>> for Vec<T>

type Output = [T]

-

fn index(&self, index: Range<usize>) -> &[T]

-

impl<T> Index<RangeTo<usize>> for Vec<T>

type Output = [T]

-

fn index(&self, index: RangeTo<usize>) -> &[T]

-

impl<T> Index<RangeFrom<usize>> for Vec<T>

type Output = [T]

-

fn index(&self, index: RangeFrom<usize>) -> &[T]

-

impl<T> Index<RangeFull> for Vec<T>

type Output = [T]

-

fn index(&self, _index: RangeFull) -> &[T]

-

impl<T> Index<RangeInclusive<usize>> for Vec<T>

type Output = [T]

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn index(&self, index: RangeInclusive<usize>) -> &[T]

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl<T> Index<RangeToInclusive<usize>> for Vec<T>

type Output = [T]

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn index(&self, index: RangeToInclusive<usize>) -> &[T]

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl<T> IndexMut<Range<usize>> for Vec<T>

fn index_mut(&mut self, index: Range<usize>) -> &mut [T]

-

impl<T> IndexMut<RangeTo<usize>> for Vec<T>

fn index_mut(&mut self, index: RangeTo<usize>) -> &mut [T]

-

impl<T> IndexMut<RangeFrom<usize>> for Vec<T>

fn index_mut(&mut self, index: RangeFrom<usize>) -> &mut [T]

-

impl<T> IndexMut<RangeFull> for Vec<T>

fn index_mut(&mut self, _index: RangeFull) -> &mut [T]

-

impl<T> IndexMut<RangeInclusive<usize>> for Vec<T>

fn index_mut(&mut self, index: RangeInclusive<usize>) -> &mut [T]

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl<T> IndexMut<RangeToInclusive<usize>> for Vec<T>

fn index_mut(&mut self, index: RangeToInclusive<usize>) -> &mut [T]

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl<T> Deref for Vec<T>

type Target = [T]

-

fn deref(&self) -> &[T]

-

impl<T> DerefMut for Vec<T>

fn deref_mut(&mut self) -> &mut [T]

-

impl<T> FromIterator<T> for Vec<T>

fn from_iter<I>(iter: I) -> Vec<T> where I: IntoIterator<Item=T>

-

impl<T> IntoIterator for Vec<T>

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Creates a consuming iterator, that is, one that moves each value out of -the vector (from start to end). The vector cannot be used after calling -this.

- -

Examples

-
-let v = vec!["a".to_string(), "b".to_string()];
-for s in v.into_iter() {
-    // s has type String, not &String
-    println!("{}", s);
-}
-

impl<'a, T> IntoIterator for &'a Vec<T>

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<'a, T> IntoIterator for &'a mut Vec<T>

type Item = &'a mut T

-

type IntoIter = IterMut<'a, T>

-

fn into_iter(self) -> IterMut<'a, T>

-

impl<T> Extend<T> for Vec<T>

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=T>

-

impl<'a, T> Extend<&'a T> for Vec<T> where T: Copy + 'a1.2.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a T>

-

impl<'a, 'b, A, B> PartialEq<Vec<B>> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &Vec<B>) -> bool

-

fn ne(&self, other: &Vec<B>) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B]) -> bool

-

fn ne(&self, other: &&'b [B]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b mut [B]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b mut [B]) -> bool

-

fn ne(&self, other: &&'b mut [B]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 0]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 0]) -> bool

-

fn ne(&self, other: &[B; 0]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 0]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 0]) -> bool

-

fn ne(&self, other: &&'b [B; 0]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 1]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 1]) -> bool

-

fn ne(&self, other: &[B; 1]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 1]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 1]) -> bool

-

fn ne(&self, other: &&'b [B; 1]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 2]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 2]) -> bool

-

fn ne(&self, other: &[B; 2]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 2]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 2]) -> bool

-

fn ne(&self, other: &&'b [B; 2]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 3]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 3]) -> bool

-

fn ne(&self, other: &[B; 3]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 3]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 3]) -> bool

-

fn ne(&self, other: &&'b [B; 3]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 4]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 4]) -> bool

-

fn ne(&self, other: &[B; 4]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 4]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 4]) -> bool

-

fn ne(&self, other: &&'b [B; 4]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 5]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 5]) -> bool

-

fn ne(&self, other: &[B; 5]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 5]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 5]) -> bool

-

fn ne(&self, other: &&'b [B; 5]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 6]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 6]) -> bool

-

fn ne(&self, other: &[B; 6]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 6]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 6]) -> bool

-

fn ne(&self, other: &&'b [B; 6]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 7]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 7]) -> bool

-

fn ne(&self, other: &[B; 7]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 7]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 7]) -> bool

-

fn ne(&self, other: &&'b [B; 7]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 8]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 8]) -> bool

-

fn ne(&self, other: &[B; 8]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 8]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 8]) -> bool

-

fn ne(&self, other: &&'b [B; 8]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 9]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 9]) -> bool

-

fn ne(&self, other: &[B; 9]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 9]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 9]) -> bool

-

fn ne(&self, other: &&'b [B; 9]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 10]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 10]) -> bool

-

fn ne(&self, other: &[B; 10]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 10]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 10]) -> bool

-

fn ne(&self, other: &&'b [B; 10]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 11]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 11]) -> bool

-

fn ne(&self, other: &[B; 11]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 11]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 11]) -> bool

-

fn ne(&self, other: &&'b [B; 11]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 12]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 12]) -> bool

-

fn ne(&self, other: &[B; 12]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 12]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 12]) -> bool

-

fn ne(&self, other: &&'b [B; 12]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 13]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 13]) -> bool

-

fn ne(&self, other: &[B; 13]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 13]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 13]) -> bool

-

fn ne(&self, other: &&'b [B; 13]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 14]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 14]) -> bool

-

fn ne(&self, other: &[B; 14]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 14]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 14]) -> bool

-

fn ne(&self, other: &&'b [B; 14]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 15]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 15]) -> bool

-

fn ne(&self, other: &[B; 15]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 15]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 15]) -> bool

-

fn ne(&self, other: &&'b [B; 15]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 16]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 16]) -> bool

-

fn ne(&self, other: &[B; 16]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 16]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 16]) -> bool

-

fn ne(&self, other: &&'b [B; 16]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 17]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 17]) -> bool

-

fn ne(&self, other: &[B; 17]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 17]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 17]) -> bool

-

fn ne(&self, other: &&'b [B; 17]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 18]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 18]) -> bool

-

fn ne(&self, other: &[B; 18]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 18]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 18]) -> bool

-

fn ne(&self, other: &&'b [B; 18]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 19]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 19]) -> bool

-

fn ne(&self, other: &[B; 19]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 19]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 19]) -> bool

-

fn ne(&self, other: &&'b [B; 19]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 20]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 20]) -> bool

-

fn ne(&self, other: &[B; 20]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 20]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 20]) -> bool

-

fn ne(&self, other: &&'b [B; 20]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 21]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 21]) -> bool

-

fn ne(&self, other: &[B; 21]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 21]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 21]) -> bool

-

fn ne(&self, other: &&'b [B; 21]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 22]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 22]) -> bool

-

fn ne(&self, other: &[B; 22]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 22]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 22]) -> bool

-

fn ne(&self, other: &&'b [B; 22]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 23]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 23]) -> bool

-

fn ne(&self, other: &[B; 23]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 23]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 23]) -> bool

-

fn ne(&self, other: &&'b [B; 23]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 24]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 24]) -> bool

-

fn ne(&self, other: &[B; 24]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 24]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 24]) -> bool

-

fn ne(&self, other: &&'b [B; 24]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 25]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 25]) -> bool

-

fn ne(&self, other: &[B; 25]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 25]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 25]) -> bool

-

fn ne(&self, other: &&'b [B; 25]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 26]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 26]) -> bool

-

fn ne(&self, other: &[B; 26]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 26]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 26]) -> bool

-

fn ne(&self, other: &&'b [B; 26]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 27]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 27]) -> bool

-

fn ne(&self, other: &[B; 27]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 27]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 27]) -> bool

-

fn ne(&self, other: &&'b [B; 27]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 28]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 28]) -> bool

-

fn ne(&self, other: &[B; 28]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 28]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 28]) -> bool

-

fn ne(&self, other: &&'b [B; 28]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 29]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 29]) -> bool

-

fn ne(&self, other: &[B; 29]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 29]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 29]) -> bool

-

fn ne(&self, other: &&'b [B; 29]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 30]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 30]) -> bool

-

fn ne(&self, other: &[B; 30]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 30]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 30]) -> bool

-

fn ne(&self, other: &&'b [B; 30]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 31]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 31]) -> bool

-

fn ne(&self, other: &[B; 31]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 31]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 31]) -> bool

-

fn ne(&self, other: &&'b [B; 31]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 32]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 32]) -> bool

-

fn ne(&self, other: &[B; 32]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 32]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 32]) -> bool

-

fn ne(&self, other: &&'b [B; 32]) -> bool

-

impl<T> PartialOrd<Vec<T>> for Vec<T> where T: PartialOrd<T>

fn partial_cmp(&self, other: &Vec<T>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<T> Eq for Vec<T> where T: Eq

impl<T> Ord for Vec<T> where T: Ord

fn cmp(&self, other: &Vec<T>) -> Ordering

-

impl<T> Drop for Vec<T>

fn drop(&mut self)

-

impl<T> Default for Vec<T>

fn default() -> Vec<T>

-

impl<T> Debug for Vec<T> where T: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> AsRef<Vec<T>> for Vec<T>

fn as_ref(&self) -> &Vec<T>

-

impl<T> AsMut<Vec<T>> for Vec<T>1.5.0

fn as_mut(&mut self) -> &mut Vec<T>

-

impl<T> AsRef<[T]> for Vec<T>

fn as_ref(&self) -> &[T]

-

impl<T> AsMut<[T]> for Vec<T>1.5.0

fn as_mut(&mut self) -> &mut [T]

-

impl<'a, T> From<&'a [T]> for Vec<T> where T: Clone

fn from(s: &'a [T]) -> Vec<T>

-

impl<'a> From<&'a str> for Vec<u8>

fn from(s: &'a str) -> Vec<u8>

-

impl<T> Borrow<[T]> for Vec<T>

fn borrow(&self) -> &[T]

-

impl<T> BorrowMut<[T]> for Vec<T>

fn borrow_mut(&mut self) -> &mut [T]

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.AsMut.html b/doc/bitflags/__core/prelude/v1/trait.AsMut.html deleted file mode 100644 index 60c50d4e..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.AsMut.html +++ /dev/null @@ -1,171 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::AsMut - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::AsMut - - [−] - - [src]

-
pub trait AsMut<T> where T: ?Sized {
-    fn as_mut(&mut self) -> &mut T;
-}

A cheap, mutable reference-to-mutable reference conversion.

- -

Note: this trait must not fail. If the conversion can fail, use a dedicated method which -returns an Option<T> or a Result<T, E>.

- -

Generic Impls

-
    -
  • AsMut auto-dereference if the inner type is a reference or a mutable -reference (eg: foo.as_ref() will work the same if foo has type &mut Foo or &&mut Foo)
    • -
-
-

Required Methods

-
-

fn as_mut(&mut self) -> &mut T

Performs the conversion.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.AsRef.html b/doc/bitflags/__core/prelude/v1/trait.AsRef.html deleted file mode 100644 index 4436f2e7..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.AsRef.html +++ /dev/null @@ -1,216 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::AsRef - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::AsRef - - [−] - - [src]

-
pub trait AsRef<T> where T: ?Sized {
-    fn as_ref(&self) -> &T;
-}

A cheap, reference-to-reference conversion.

- -

AsRef is very similar to, but different than, Borrow. See -the book for more.

- -

Note: this trait must not fail. If the conversion can fail, use a dedicated method which -returns an Option<T> or a Result<T, E>.

- -

Examples

-

Both String and &str implement AsRef<str>:

- -
-fn is_hello<T: AsRef<str>>(s: T) {
-   assert_eq!("hello", s.as_ref());
-}
-
-let s = "hello";
-is_hello(s);
-
-let s = "hello".to_string();
-is_hello(s);
- -

Generic Impls

-
    -
  • AsRef auto-dereference if the inner type is a reference or a mutable -reference (eg: foo.as_ref() will work the same if foo has type &mut Foo or &&mut Foo)
    • -
-
-

Required Methods

-
-

fn as_ref(&self) -> &T

Performs the conversion.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.Clone.html b/doc/bitflags/__core/prelude/v1/trait.Clone.html deleted file mode 100644 index 28991920..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.Clone.html +++ /dev/null @@ -1,495 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Clone - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::Clone - - [−] - - [src]

-
pub trait Clone {
-    fn clone(&self) -> Self;
-
-    fn clone_from(&mut self, source: &Self) { ... }
-}

A common trait for cloning an object.

- -

This trait can be used with #[derive].

-
-

Required Methods

-
-

fn clone(&self) -> Self

Returns a copy of the value.

- -

Examples

-
-let hello = "Hello"; // &str implements Clone
-
-assert_eq!("Hello", hello.clone());
-
-

Provided Methods

-
-

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

- -

a.clone_from(&b) is equivalent to a = b.clone() in functionality, -but can be overridden to reuse the resources of a to avoid unnecessary -allocations.

-
-

Implementors

-
    -
  • impl Clone for LocalKeyState
    • -
  • impl Clone for Thread
    • -
  • impl<K, V, S> Clone for HashMap<K, V, S> where S: Clone, V: Clone, K: Clone
    • -
  • impl<'a, K, V> Clone for Iter<'a, K, V>
    • -
  • impl<'a, K, V> Clone for Keys<'a, K, V>
    • -
  • impl<'a, K, V> Clone for Values<'a, K, V>
    • -
  • impl Clone for RandomState
    • -
  • impl<T, S> Clone for HashSet<T, S> where T: Clone, S: Clone
    • -
  • impl<'a, K> Clone for Iter<'a, K>
    • -
  • impl<'a, T, S> Clone for Intersection<'a, T, S>
    • -
  • impl<'a, T, S> Clone for Difference<'a, T, S>
    • -
  • impl<'a, T, S> Clone for SymmetricDifference<'a, T, S>
    • -
  • impl<'a, T, S> Clone for Union<'a, T, S>
    • -
  • impl<'a, T> Clone for Iter<'a, T>
    • -
  • impl<T> Clone for IntoIter<T> where T: Clone
    • -
  • impl<A> Clone for LinkedList<A> where A: Clone
    • -
  • impl<T> Clone for VecDeque<T> where T: Clone
    • -
  • impl<'a, T> Clone for Iter<'a, T>
    • -
  • impl<T> Clone for IntoIter<T> where T: Clone
    • -
  • impl<T> Clone for BinaryHeap<T> where T: Clone
    • -
  • impl<'a, T> Clone for Iter<'a, T>
    • -
  • impl<T> Clone for IntoIter<T> where T: Clone
    • -
  • impl Clone for VarError
    • -
  • impl Clone for CString
    • -
  • impl Clone for NulError
    • -
  • impl Clone for IntoStringError
    • -
  • impl Clone for OsString
    • -
  • impl Clone for Metadata
    • -
  • impl Clone for OpenOptions
    • -
  • impl Clone for Permissions
    • -
  • impl Clone for FileType
    • -
  • impl<T> Clone for Cursor<T> where T: Clone
    • -
  • impl Clone for ErrorKind
    • -
  • impl Clone for SeekFrom
    • -
  • impl Clone for IpAddr
    • -
  • impl Clone for Ipv6MulticastScope
    • -
  • impl Clone for Ipv4Addr
    • -
  • impl Clone for Ipv6Addr
    • -
  • impl Clone for SocketAddr
    • -
  • impl Clone for SocketAddrV4
    • -
  • impl Clone for SocketAddrV6
    • -
  • impl Clone for AddrParseError
    • -
  • impl Clone for Shutdown
    • -
  • impl Clone for stat
    • -
  • impl Clone for SocketAddr
    • -
  • impl<'a> Clone for Prefix<'a>
    • -
  • impl<'a> Clone for PrefixComponent<'a>
    • -
  • impl<'a> Clone for Component<'a>
    • -
  • impl<'a> Clone for Components<'a>
    • -
  • impl<'a> Clone for Iter<'a>
    • -
  • impl Clone for PathBuf
    • -
  • impl Clone for StripPrefixError
    • -
  • impl Clone for Output
    • -
  • impl Clone for ExitStatus
    • -
  • impl<T> Clone for SendError<T> where T: Clone
    • -
  • impl Clone for RecvError
    • -
  • impl Clone for TryRecvError
    • -
  • impl<T> Clone for TrySendError<T> where T: Clone
    • -
  • impl<T> Clone for Sender<T>
    • -
  • impl<T> Clone for SyncSender<T>
    • -
  • impl Clone for WaitTimeoutResult
    • -
  • impl Clone for Ordering
    • -
  • impl Clone for Duration
    • -
  • impl Clone for Instant
    • -
  • impl Clone for SystemTime
    • -
  • impl Clone for SystemTimeError
    • -
  • impl Clone for utimbuf
    • -
  • impl Clone for timeval
    • -
  • impl Clone for timespec
    • -
  • impl Clone for rlimit
    • -
  • impl Clone for rusage
    • -
  • impl Clone for in_addr
    • -
  • impl Clone for in6_addr
    • -
  • impl Clone for ip_mreq
    • -
  • impl Clone for ipv6_mreq
    • -
  • impl Clone for hostent
    • -
  • impl Clone for iovec
    • -
  • impl Clone for pollfd
    • -
  • impl Clone for winsize
    • -
  • impl Clone for sockaddr
    • -
  • impl Clone for sockaddr_in6
    • -
  • impl Clone for sockaddr_un
    • -
  • impl Clone for passwd
    • -
  • impl Clone for ifaddrs
    • -
  • impl Clone for fd_set
    • -
  • impl Clone for tm
    • -
  • impl Clone for utsname
    • -
  • impl Clone for msghdr
    • -
  • impl Clone for fsid_t
    • -
  • impl Clone for glob_t
    • -
  • impl Clone for sockaddr_storage
    • -
  • impl Clone for addrinfo
    • -
  • impl Clone for mach_timebase_info
    • -
  • impl Clone for stat
    • -
  • impl Clone for dirent
    • -
  • impl Clone for pthread_mutex_t
    • -
  • impl Clone for pthread_mutexattr_t
    • -
  • impl Clone for pthread_cond_t
    • -
  • impl Clone for pthread_rwlock_t
    • -
  • impl Clone for siginfo_t
    • -
  • impl Clone for sigaction
    • -
  • impl Clone for stack_t
    • -
  • impl Clone for fstore_t
    • -
  • impl Clone for radvisory
    • -
  • impl Clone for statvfs
    • -
  • impl Clone for Dl_info
    • -
  • impl Clone for sockaddr_in
    • -
  • impl Clone for statfs
    • -
  • impl Clone for kevent
    • -
  • impl Clone for kevent64_s
    • -
  • impl Clone for dqblk
    • -
  • impl Clone for termios
    • -
  • impl Clone for flock
    • -
  • impl Clone for sf_hdtr
    • -
  • impl Clone for lconv
    • -
  • impl Clone for pthread_attr_t
    • -
  • impl<T> Clone for Vec<T> where T: Clone
    • -
  • impl<T> Clone for IntoIter<T> where T: Clone
    • -
  • impl<A, R> Clone for StepBy<A, R> where A: Clone, R: Clone
    • -
  • impl<A> Clone for Repeat<A> where A: Clone
    • -
  • impl<T> Clone for Empty<T>
    • -
  • impl<T> Clone for Once<T> where T: Clone
    • -
  • impl<T> Clone for Rev<T> where T: Clone
    • -
  • impl<I> Clone for Cloned<I> where I: Clone
    • -
  • impl<I> Clone for Cycle<I> where I: Clone
    • -
  • impl<A, B> Clone for Chain<A, B> where A: Clone, B: Clone
    • -
  • impl<A, B> Clone for Zip<A, B> where A: Clone, B: Clone
    • -
  • impl<I, F> Clone for Map<I, F> where I: Clone, F: Clone
    • -
  • impl<I, P> Clone for Filter<I, P> where I: Clone, P: Clone
    • -
  • impl<I, F> Clone for FilterMap<I, F> where I: Clone, F: Clone
    • -
  • impl<I> Clone for Enumerate<I> where I: Clone
    • -
  • impl<I> Clone for Peekable<I> where I: Clone + Iterator, I::Item: Clone
    • -
  • impl<I, P> Clone for SkipWhile<I, P> where P: Clone, I: Clone
    • -
  • impl<I, P> Clone for TakeWhile<I, P> where I: Clone, P: Clone
    • -
  • impl<I> Clone for Skip<I> where I: Clone
    • -
  • impl<I> Clone for Take<I> where I: Clone
    • -
  • impl<I, St, F> Clone for Scan<I, St, F> where I: Clone, F: Clone, St: Clone
    • -
  • impl<I, U, F> Clone for FlatMap<I, U, F> where I: Clone, U: Clone + IntoIterator, F: Clone, U::IntoIter: Clone
    • -
  • impl<I> Clone for Fuse<I> where I: Clone
    • -
  • impl<I, F> Clone for Inspect<I, F> where I: Clone, F: Clone
    • -
  • impl Clone for Ordering
    • -
  • impl Clone for ExchangeHeapSingleton
    • -
  • impl<T> Clone for Box<T> where T: Clone
    • -
  • impl Clone for Box<str>
    • -
  • impl<T> Clone for Box<[T]> where T: Clone
    • -
  • impl Clone for TypeId
    • -
  • impl<T> Clone for Slice<T>
    • -
  • impl Clone for TraitObject
    • -
  • impl Clone for RangeFull
    • -
  • impl<Idx> Clone for Range<Idx> where Idx: Clone
    • -
  • impl<Idx> Clone for RangeFrom<Idx> where Idx: Clone
    • -
  • impl<Idx> Clone for RangeTo<Idx> where Idx: Clone
    • -
  • impl<Idx> Clone for RangeInclusive<Idx> where Idx: Clone
    • -
  • impl<Idx> Clone for RangeToInclusive<Idx> where Idx: Clone
    • -
  • impl<I> Clone for DecodeUtf16<I> where I: Clone + Iterator<Item=u16>
    • -
  • impl Clone for DecodeUtf16Error
    • -
  • impl<T> Clone for PhantomData<T> where T: ?Sized
    • -
  • impl Clone for SipHasher
    • -
  • impl<H> Clone for BuildHasherDefault<H>
    • -
  • impl<'a> Clone for EncodeUtf16<'a>
    • -
  • impl Clone for SearchStep
    • -
  • impl<'a> Clone for CharSearcher<'a>
    • -
  • impl<'a, 'b> Clone for CharSliceSearcher<'a, 'b>
    • -
  • impl<'a, F> Clone for CharPredicateSearcher<'a, F> where F: Clone + FnMut(char) -> bool
    • -
  • impl<'a, 'b> Clone for StrSearcher<'a, 'b>
    • -
  • impl<T> Clone for Cell<T> where T: Copy
    • -
  • impl Clone for BorrowState
    • -
  • impl<T> Clone for RefCell<T> where T: Clone
    • -
  • impl<T> Clone for Rc<T> where T: ?Sized
    • -
  • impl<T> Clone for Weak<T> where T: ?Sized
    • -
  • impl Clone for String
    • -
  • impl Clone for ParseError
    • -
  • impl<T, E> Clone for Result<T, E> where T: Clone, E: Clone
    • -
  • impl<'a, T> Clone for Iter<'a, T>
    • -
  • impl<T> Clone for *const T where T: ?Sized
    • -
  • impl<T> Clone for *mut T where T: ?Sized
    • -
  • impl<Ret> Clone for fn() -> Ret
    • -
  • impl<Ret> Clone for extern fn() -> Ret
    • -
  • impl<Ret> Clone for unsafe fn() -> Ret
    • -
  • impl<Ret> Clone for unsafe extern fn() -> Ret
    • -
  • impl<Ret, A> Clone for fn(A) -> Ret
    • -
  • impl<Ret, A> Clone for extern fn(A) -> Ret
    • -
  • impl<Ret, A> Clone for unsafe fn(A) -> Ret
    • -
  • impl<Ret, A> Clone for unsafe extern fn(A) -> Ret
    • -
  • impl<Ret, A, B> Clone for fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Clone for extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Clone for unsafe fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Clone for unsafe extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B, C> Clone for fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Clone for extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Clone for unsafe fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Clone for unsafe extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C, D> Clone for fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Clone for extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Clone for unsafe fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Clone for unsafe extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Clone for fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Clone for extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Clone for unsafe fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Clone for unsafe extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Clone for fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Clone for extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Clone for unsafe fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Clone for unsafe extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Clone for fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Clone for extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Clone for unsafe fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Clone for unsafe extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Clone for fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Clone for extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Clone for unsafe fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Clone for unsafe extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Clone for fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Clone for extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Clone for unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Clone for unsafe extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Clone for fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Clone for extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Clone for unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Clone for unsafe extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Clone for fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Clone for extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Clone for unsafe fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Clone for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Clone for fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Clone for extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Clone for unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Clone for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<T> Clone for Shared<T> where T: ?Sized
    • -
  • impl<'a, T> Clone for &'a T where T: ?Sized
    • -
  • impl Clone for isize
    • -
  • impl Clone for i8
    • -
  • impl Clone for i16
    • -
  • impl Clone for i32
    • -
  • impl Clone for i64
    • -
  • impl Clone for usize
    • -
  • impl Clone for u8
    • -
  • impl Clone for u16
    • -
  • impl Clone for u32
    • -
  • impl Clone for u64
    • -
  • impl Clone for f32
    • -
  • impl Clone for f64
    • -
  • impl Clone for ()
    • -
  • impl Clone for bool
    • -
  • impl Clone for char
    • -
  • impl<'a, B> Clone for Cow<'a, B> where B: ToOwned + ?Sized
    • -
  • impl<T> Clone for Option<T> where T: Clone
    • -
  • impl<'a, A> Clone for Iter<'a, A>
    • -
  • impl<A> Clone for IntoIter<A> where A: Clone
    • -
  • impl<T> Clone for Wrapping<T> where T: Clone
    • -
  • impl Clone for ParseFloatError
    • -
  • impl Clone for FpCategory
    • -
  • impl Clone for ParseIntError
    • -
  • impl<T> Clone for NonZero<T> where T: Zeroable + Clone
    • -
  • impl<T> Clone for [T; 0] where T: Copy
    • -
  • impl<T> Clone for [T; 1] where T: Copy
    • -
  • impl<T> Clone for [T; 2] where T: Copy
    • -
  • impl<T> Clone for [T; 3] where T: Copy
    • -
  • impl<T> Clone for [T; 4] where T: Copy
    • -
  • impl<T> Clone for [T; 5] where T: Copy
    • -
  • impl<T> Clone for [T; 6] where T: Copy
    • -
  • impl<T> Clone for [T; 7] where T: Copy
    • -
  • impl<T> Clone for [T; 8] where T: Copy
    • -
  • impl<T> Clone for [T; 9] where T: Copy
    • -
  • impl<T> Clone for [T; 10] where T: Copy
    • -
  • impl<T> Clone for [T; 11] where T: Copy
    • -
  • impl<T> Clone for [T; 12] where T: Copy
    • -
  • impl<T> Clone for [T; 13] where T: Copy
    • -
  • impl<T> Clone for [T; 14] where T: Copy
    • -
  • impl<T> Clone for [T; 15] where T: Copy
    • -
  • impl<T> Clone for [T; 16] where T: Copy
    • -
  • impl<T> Clone for [T; 17] where T: Copy
    • -
  • impl<T> Clone for [T; 18] where T: Copy
    • -
  • impl<T> Clone for [T; 19] where T: Copy
    • -
  • impl<T> Clone for [T; 20] where T: Copy
    • -
  • impl<T> Clone for [T; 21] where T: Copy
    • -
  • impl<T> Clone for [T; 22] where T: Copy
    • -
  • impl<T> Clone for [T; 23] where T: Copy
    • -
  • impl<T> Clone for [T; 24] where T: Copy
    • -
  • impl<T> Clone for [T; 25] where T: Copy
    • -
  • impl<T> Clone for [T; 26] where T: Copy
    • -
  • impl<T> Clone for [T; 27] where T: Copy
    • -
  • impl<T> Clone for [T; 28] where T: Copy
    • -
  • impl<T> Clone for [T; 29] where T: Copy
    • -
  • impl<T> Clone for [T; 30] where T: Copy
    • -
  • impl<T> Clone for [T; 31] where T: Copy
    • -
  • impl<T> Clone for [T; 32] where T: Copy
    • -
  • impl Clone for EscapeUnicode
    • -
  • impl Clone for EscapeDefault
    • -
  • impl<'a, T> Clone for Iter<'a, T>
    • -
  • impl<'a, T, P> Clone for Split<'a, T, P> where P: Clone + FnMut(&T) -> bool
    • -
  • impl<'a, T> Clone for Windows<'a, T>
    • -
  • impl<'a, T> Clone for Chunks<'a, T>
    • -
  • impl Clone for ParseBoolError
    • -
  • impl Clone for Utf8Error
    • -
  • impl<'a> Clone for Chars<'a>
    • -
  • impl<'a> Clone for CharIndices<'a>
    • -
  • impl<'a> Clone for Bytes<'a>
    • -
  • impl<'a, P> Clone for Split<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for RSplit<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for SplitTerminator<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for RSplitTerminator<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for SplitN<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for RSplitN<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for MatchIndices<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for RMatchIndices<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for Matches<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a, P> Clone for RMatches<'a, P> where P: Pattern<'a>, P::Searcher: Clone
    • -
  • impl<'a> Clone for Lines<'a>
    • -
  • impl<'a> Clone for LinesAny<'a>
    • -
  • impl Clone for CharRange
    • -
  • impl Clone for Error
    • -
  • impl<'a> Clone for Arguments<'a>
    • -
  • impl<A> Clone for (A,) where A: Clone
    • -
  • impl<A, B> Clone for (A, B) where B: Clone, A: Clone
    • -
  • impl<A, B, C> Clone for (A, B, C) where B: Clone, A: Clone, C: Clone
    • -
  • impl<A, B, C, D> Clone for (A, B, C, D) where A: Clone, C: Clone, D: Clone, B: Clone
    • -
  • impl<A, B, C, D, E> Clone for (A, B, C, D, E) where E: Clone, C: Clone, A: Clone, D: Clone, B: Clone
    • -
  • impl<A, B, C, D, E, F> Clone for (A, B, C, D, E, F) where D: Clone, C: Clone, E: Clone, A: Clone, B: Clone, F: Clone
    • -
  • impl<A, B, C, D, E, F, G> Clone for (A, B, C, D, E, F, G) where E: Clone, G: Clone, A: Clone, C: Clone, F: Clone, D: Clone, B: Clone
    • -
  • impl<A, B, C, D, E, F, G, H> Clone for (A, B, C, D, E, F, G, H) where H: Clone, D: Clone, B: Clone, A: Clone, E: Clone, G: Clone, F: Clone, C: Clone
    • -
  • impl<A, B, C, D, E, F, G, H, I> Clone for (A, B, C, D, E, F, G, H, I) where H: Clone, C: Clone, D: Clone, A: Clone, B: Clone, E: Clone, G: Clone, I: Clone, F: Clone
    • -
  • impl<A, B, C, D, E, F, G, H, I, J> Clone for (A, B, C, D, E, F, G, H, I, J) where C: Clone, H: Clone, I: Clone, B: Clone, D: Clone, G: Clone, A: Clone, F: Clone, J: Clone, E: Clone
    • -
  • impl<A, B, C, D, E, F, G, H, I, J, K> Clone for (A, B, C, D, E, F, G, H, I, J, K) where A: Clone, J: Clone, D: Clone, H: Clone, I: Clone, B: Clone, K: Clone, C: Clone, G: Clone, E: Clone, F: Clone
    • -
  • impl<A, B, C, D, E, F, G, H, I, J, K, L> Clone for (A, B, C, D, E, F, G, H, I, J, K, L) where F: Clone, A: Clone, G: Clone, H: Clone, K: Clone, I: Clone, C: Clone, E: Clone, J: Clone, B: Clone, L: Clone, D: Clone
    • -
  • impl<K, V> Clone for BTreeMap<K, V> where K: Clone, V: Clone
    • -
  • impl<'a, K, V> Clone for Iter<'a, K, V>
    • -
  • impl<'a, K, V> Clone for Keys<'a, K, V>
    • -
  • impl<'a, K, V> Clone for Values<'a, K, V>
    • -
  • impl<'a, K, V> Clone for Range<'a, K, V>
    • -
  • impl<T> Clone for BTreeSet<T> where T: Clone
    • -
  • impl<'a, T> Clone for Iter<'a, T>
    • -
  • impl<'a, T> Clone for Range<'a, T>
    • -
  • impl<'a, T> Clone for Difference<'a, T>
    • -
  • impl<'a, T> Clone for SymmetricDifference<'a, T>
    • -
  • impl<'a, T> Clone for Intersection<'a, T>
    • -
  • impl<'a, T> Clone for Union<'a, T>
    • -
  • impl<E> Clone for EnumSet<E>
    • -
  • impl<E> Clone for Iter<E>
    • -
  • impl<T> Clone for Bound<T> where T: Clone
    • -
  • impl<T> Clone for Arc<T> where T: ?Sized
    • -
  • impl<T> Clone for Weak<T> where T: ?Sized
    • -
  • impl Clone for StandardNormal
    • -
  • impl Clone for Normal
    • -
  • impl Clone for LogNormal
    • -
  • impl Clone for Exp1
    • -
  • impl Clone for Exp
    • -
  • impl Clone for IsaacRng
    • -
  • impl Clone for Isaac64Rng
    • -
  • impl Clone for ChaChaRng
    • -
  • impl Clone for ReseedWithDefault
    • -
  • impl Clone for XorShiftRng
    • -
  • impl<I> Clone for Utf16Encoder<I> where I: Clone
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.Copy.html b/doc/bitflags/__core/prelude/v1/trait.Copy.html deleted file mode 100644 index 3af3e640..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.Copy.html +++ /dev/null @@ -1,316 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Copy - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::Copy - - [−] - - [src]

-
pub trait Copy: Clone { }

Types that can be copied by simply copying bits (i.e. memcpy).

- -

By default, variable bindings have 'move semantics.' In other -words:

- -
-#[derive(Debug)]
-struct Foo;
-
-let x = Foo;
-
-let y = x;
-
-// `x` has moved into `y`, and so cannot be used
-
-// println!("{:?}", x); // error: use of moved value
- -

However, if a type implements Copy, it instead has 'copy semantics':

- -
-// we can just derive a `Copy` implementation
-#[derive(Debug, Copy, Clone)]
-struct Foo;
-
-let x = Foo;
-
-let y = x;
-
-// `y` is a copy of `x`
-
-println!("{:?}", x); // A-OK!
- -

It's important to note that in these two examples, the only difference is if you are allowed to -access x after the assignment: a move is also a bitwise copy under the hood.

- -

When can my type be Copy?

-

A type can implement Copy if all of its components implement Copy. For example, this -struct can be Copy:

- -
-struct Point {
-   x: i32,
-   y: i32,
-}
- -

A struct can be Copy, and i32 is Copy, so therefore, Point is eligible to be Copy.

- -
-struct PointList {
-    points: Vec<Point>,
-}
- -

The PointList struct cannot implement Copy, because Vec<T> is not Copy. If we -attempt to derive a Copy implementation, we'll get an error:

- -
the trait `Copy` may not be implemented for this type; field `points` does not implement `Copy`
-
- -

How can I implement Copy?

-

There are two ways to implement Copy on your type:

- -
-#[derive(Copy, Clone)]
-struct MyStruct;
- -

and

- -
-struct MyStruct;
-impl Copy for MyStruct {}
-impl Clone for MyStruct { fn clone(&self) -> MyStruct { *self } }
- -

There is a small difference between the two: the derive strategy will also place a Copy -bound on type parameters, which isn't always desired.

- -

When can my type not be Copy?

-

Some types can't be copied safely. For example, copying &mut T would create an aliased -mutable reference, and copying String would result in two attempts to free the same buffer.

- -

Generalizing the latter case, any type implementing Drop can't be Copy, because it's -managing some resource besides its own size_of::<T>() bytes.

- -

When should my type be Copy?

-

Generally speaking, if your type can implement Copy, it should. There's one important thing -to consider though: if you think your type may not be able to implement Copy in the future, -then it might be prudent to not implement Copy. This is because removing Copy is a breaking -change: that second example would fail to compile if we made Foo non-Copy.

- -

Derivable

-

This trait can be used with #[derive].

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.Default.html b/doc/bitflags/__core/prelude/v1/trait.Default.html deleted file mode 100644 index 6a0d1f4c..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.Default.html +++ /dev/null @@ -1,256 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Default - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::Default - - [−] - - [src]

-
pub trait Default {
-    fn default() -> Self;
-}

A trait for giving a type a useful default value.

- -

A struct can derive default implementations of Default for basic types using -#[derive(Default)].

- -

Examples

-
-#[derive(Default)]
-struct SomeOptions {
-    foo: i32,
-    bar: f32,
-}
-
-

Required Methods

-
-

fn default() -> Self

Returns the "default value" for a type.

- -

Default values are often some kind of initial value, identity value, or anything else that -may make sense as a default.

- -

Examples

-

Using built-in default values:

- -
-let i: i8 = Default::default();
-let (x, y): (Option<String>, f64) = Default::default();
-let (a, b, (c, d)): (i32, u32, (bool, bool)) = Default::default();
- -

Making your own:

- -
-enum Kind {
-    A,
-    B,
-    C,
-}
-
-impl Default for Kind {
-    fn default() -> Kind { Kind::A }
-}
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.DoubleEndedIterator.html b/doc/bitflags/__core/prelude/v1/trait.DoubleEndedIterator.html deleted file mode 100644 index 51593d5f..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.DoubleEndedIterator.html +++ /dev/null @@ -1,240 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::DoubleEndedIterator - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::DoubleEndedIterator - - [−] - - [src]

-
pub trait DoubleEndedIterator: Iterator {
-    fn next_back(&mut self) -> Option<Self::Item>;
-}

An iterator able to yield elements from both ends.

- -

Something that implements DoubleEndedIterator has one extra capability -over something that implements Iterator: the ability to also take -Items from the back, as well as the front.

- -

It is important to note that both back and forth work on the same range, -and do not cross: iteration is over when they meet in the middle.

- -

In a similar fashion to the Iterator protocol, once a -DoubleEndedIterator returns None from a next_back(), calling it again -may or may not ever return Some again. next() and next_back() are -interchangable for this purpose.

- -

Examples

-

Basic usage:

- -
-let numbers = vec![1, 2, 3];
-
-let mut iter = numbers.iter();
-
-assert_eq!(Some(&1), iter.next());
-assert_eq!(Some(&3), iter.next_back());
-assert_eq!(Some(&2), iter.next_back());
-assert_eq!(None, iter.next());
-assert_eq!(None, iter.next_back());
-
-

Required Methods

-
-

fn next_back(&mut self) -> Option<Self::Item>

An iterator able to yield elements from both ends.

- -

As this is the only method for this trait, the trait-level docs -contain more details.

- -

Examples

-

Basic usage:

- -
-let numbers = vec![1, 2, 3];
-
-let mut iter = numbers.iter();
-
-assert_eq!(Some(&1), iter.next());
-assert_eq!(Some(&3), iter.next_back());
-assert_eq!(Some(&2), iter.next_back());
-assert_eq!(None, iter.next());
-assert_eq!(None, iter.next_back());
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.Drop.html b/doc/bitflags/__core/prelude/v1/trait.Drop.html deleted file mode 100644 index 7f185b13..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.Drop.html +++ /dev/null @@ -1,178 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Drop - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::Drop - - [−] - - [src]

-
pub trait Drop {
-    fn drop(&mut self);
-}

The Drop trait is used to run some code when a value goes out of scope. -This is sometimes called a 'destructor'.

- -

Examples

-

A trivial implementation of Drop. The drop method is called when _x -goes out of scope, and therefore main prints Dropping!.

- -
-struct HasDrop;
-
-impl Drop for HasDrop {
-    fn drop(&mut self) {
-        println!("Dropping!");
-    }
-}
-
-fn main() {
-    let _x = HasDrop;
-}
-
-

Required Methods

-
-

fn drop(&mut self)

A method called when the value goes out of scope.

- -

When this method has been called, self has not yet been deallocated. -If it were, self would be a dangling reference.

- -

After this function is over, the memory of self will be deallocated.

- -

Panics

-

Given that a panic! will call drop() as it unwinds, any panic! in -a drop() implementation will likely abort.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.Eq.html b/doc/bitflags/__core/prelude/v1/trait.Eq.html deleted file mode 100644 index 798a7e53..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.Eq.html +++ /dev/null @@ -1,317 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Eq - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::Eq - - [−] - - [src]

-
pub trait Eq: PartialEq<Self> { }

Trait for equality comparisons which are equivalence relations.

- -

This means, that in addition to a == b and a != b being strict inverses, the equality must -be (for all a, b and c):

- -
    -
  • reflexive: a == a;
    • -
  • symmetric: a == b implies b == a; and
    • -
  • transitive: a == b and b == c implies a == c.
    • -
- -

This property cannot be checked by the compiler, and therefore Eq implies -PartialEq, and has no extra methods.

- -

This trait can be used with #[derive].

-
-

Implementors

-
    -
  • impl Eq for LocalKeyState
    • -
  • impl<K, V, S> Eq for HashMap<K, V, S> where K: Eq + Hash, V: Eq, S: BuildHasher
    • -
  • impl<T, S> Eq for HashSet<T, S> where T: Eq + Hash, S: BuildHasher
    • -
  • impl<A> Eq for LinkedList<A> where A: Eq
    • -
  • impl<A> Eq for VecDeque<A> where A: Eq
    • -
  • impl Eq for VarError
    • -
  • impl Eq for CString
    • -
  • impl Eq for CStr
    • -
  • impl Eq for OsString
    • -
  • impl Eq for OsStr
    • -
  • impl Eq for Permissions
    • -
  • impl Eq for FileType
    • -
  • impl Eq for ErrorKind
    • -
  • impl Eq for SeekFrom
    • -
  • impl Eq for IpAddr
    • -
  • impl Eq for Ipv6MulticastScope
    • -
  • impl Eq for Ipv4Addr
    • -
  • impl Eq for Ipv6Addr
    • -
  • impl Eq for SocketAddr
    • -
  • impl Eq for SocketAddrV4
    • -
  • impl Eq for SocketAddrV6
    • -
  • impl<'a> Eq for Prefix<'a>
    • -
  • impl<'a> Eq for PrefixComponent<'a>
    • -
  • impl<'a> Eq for Component<'a>
    • -
  • impl<'a> Eq for Components<'a>
    • -
  • impl Eq for PathBuf
    • -
  • impl Eq for StripPrefixError
    • -
  • impl Eq for Path
    • -
  • impl Eq for Output
    • -
  • impl Eq for ExitStatus
    • -
  • impl<T> Eq for SendError<T> where T: Eq
    • -
  • impl Eq for RecvError
    • -
  • impl Eq for TryRecvError
    • -
  • impl<T> Eq for TrySendError<T> where T: Eq
    • -
  • impl Eq for WaitTimeoutResult
    • -
  • impl Eq for Duration
    • -
  • impl Eq for Instant
    • -
  • impl Eq for SystemTime
    • -
  • impl<T> Eq for Vec<T> where T: Eq
    • -
  • impl Eq for Ordering
    • -
  • impl Eq for ()
    • -
  • impl Eq for bool
    • -
  • impl Eq for char
    • -
  • impl Eq for usize
    • -
  • impl Eq for u8
    • -
  • impl Eq for u16
    • -
  • impl Eq for u32
    • -
  • impl Eq for u64
    • -
  • impl Eq for isize
    • -
  • impl Eq for i8
    • -
  • impl Eq for i16
    • -
  • impl Eq for i32
    • -
  • impl Eq for i64
    • -
  • impl<'a, A> Eq for &'a A where A: Eq + ?Sized
    • -
  • impl<'a, A> Eq for &'a mut A where A: Eq + ?Sized
    • -
  • impl<T> Eq for Box<T> where T: Eq + ?Sized
    • -
  • impl Eq for TypeId
    • -
  • impl Eq for RangeFull
    • -
  • impl<Idx> Eq for Range<Idx> where Idx: Eq
    • -
  • impl<Idx> Eq for RangeFrom<Idx> where Idx: Eq
    • -
  • impl<Idx> Eq for RangeTo<Idx> where Idx: Eq
    • -
  • impl<Idx> Eq for RangeInclusive<Idx> where Idx: Eq
    • -
  • impl<Idx> Eq for RangeToInclusive<Idx> where Idx: Eq
    • -
  • impl Eq for DecodeUtf16Error
    • -
  • impl<T> Eq for PhantomData<T> where T: ?Sized
    • -
  • impl Eq for SearchStep
    • -
  • impl<T> Eq for Cell<T> where T: Copy + Eq
    • -
  • impl Eq for BorrowState
    • -
  • impl<T> Eq for RefCell<T> where T: Eq + ?Sized
    • -
  • impl<T> Eq for Rc<T> where T: Eq + ?Sized
    • -
  • impl Eq for String
    • -
  • impl Eq for ParseError
    • -
  • impl<T, E> Eq for Result<T, E> where E: Eq, T: Eq
    • -
  • impl<T> Eq for *const T where T: ?Sized
    • -
  • impl<T> Eq for *mut T where T: ?Sized
    • -
  • impl<Ret> Eq for fn() -> Ret
    • -
  • impl<Ret> Eq for extern fn() -> Ret
    • -
  • impl<Ret> Eq for unsafe fn() -> Ret
    • -
  • impl<Ret> Eq for unsafe extern fn() -> Ret
    • -
  • impl<Ret, A> Eq for fn(A) -> Ret
    • -
  • impl<Ret, A> Eq for extern fn(A) -> Ret
    • -
  • impl<Ret, A> Eq for unsafe fn(A) -> Ret
    • -
  • impl<Ret, A> Eq for unsafe extern fn(A) -> Ret
    • -
  • impl<Ret, A, B> Eq for fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Eq for extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Eq for unsafe fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Eq for unsafe extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B, C> Eq for fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Eq for extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Eq for unsafe fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Eq for unsafe extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C, D> Eq for fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Eq for extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Eq for unsafe fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Eq for unsafe extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Eq for fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Eq for extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Eq for unsafe fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Eq for unsafe extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Eq for fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Eq for extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Eq for unsafe fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Eq for unsafe extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Eq for fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Eq for extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Eq for unsafe fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Eq for unsafe extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Eq for fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Eq for extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Eq for unsafe fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Eq for unsafe extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Eq for fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Eq for extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Eq for unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Eq for unsafe extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Eq for fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Eq for extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Eq for unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Eq for unsafe extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Eq for fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Eq for extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Eq for unsafe fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Eq for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Eq for fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Eq for extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Eq for unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Eq for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<'a, B> Eq for Cow<'a, B> where B: Eq + ToOwned + ?Sized
    • -
  • impl<T> Eq for Option<T> where T: Eq
    • -
  • impl<T> Eq for Wrapping<T> where T: Eq
    • -
  • impl<T> Eq for NonZero<T> where T: Zeroable + Eq
    • -
  • impl<T> Eq for [T; 0] where T: Eq
    • -
  • impl<T> Eq for [T; 1] where T: Eq
    • -
  • impl<T> Eq for [T; 2] where T: Eq
    • -
  • impl<T> Eq for [T; 3] where T: Eq
    • -
  • impl<T> Eq for [T; 4] where T: Eq
    • -
  • impl<T> Eq for [T; 5] where T: Eq
    • -
  • impl<T> Eq for [T; 6] where T: Eq
    • -
  • impl<T> Eq for [T; 7] where T: Eq
    • -
  • impl<T> Eq for [T; 8] where T: Eq
    • -
  • impl<T> Eq for [T; 9] where T: Eq
    • -
  • impl<T> Eq for [T; 10] where T: Eq
    • -
  • impl<T> Eq for [T; 11] where T: Eq
    • -
  • impl<T> Eq for [T; 12] where T: Eq
    • -
  • impl<T> Eq for [T; 13] where T: Eq
    • -
  • impl<T> Eq for [T; 14] where T: Eq
    • -
  • impl<T> Eq for [T; 15] where T: Eq
    • -
  • impl<T> Eq for [T; 16] where T: Eq
    • -
  • impl<T> Eq for [T; 17] where T: Eq
    • -
  • impl<T> Eq for [T; 18] where T: Eq
    • -
  • impl<T> Eq for [T; 19] where T: Eq
    • -
  • impl<T> Eq for [T; 20] where T: Eq
    • -
  • impl<T> Eq for [T; 21] where T: Eq
    • -
  • impl<T> Eq for [T; 22] where T: Eq
    • -
  • impl<T> Eq for [T; 23] where T: Eq
    • -
  • impl<T> Eq for [T; 24] where T: Eq
    • -
  • impl<T> Eq for [T; 25] where T: Eq
    • -
  • impl<T> Eq for [T; 26] where T: Eq
    • -
  • impl<T> Eq for [T; 27] where T: Eq
    • -
  • impl<T> Eq for [T; 28] where T: Eq
    • -
  • impl<T> Eq for [T; 29] where T: Eq
    • -
  • impl<T> Eq for [T; 30] where T: Eq
    • -
  • impl<T> Eq for [T; 31] where T: Eq
    • -
  • impl<T> Eq for [T; 32] where T: Eq
    • -
  • impl<T> Eq for [T] where T: Eq
    • -
  • impl Eq for Utf8Error
    • -
  • impl Eq for str
    • -
  • impl Eq for Error
    • -
  • impl<A> Eq for (A,) where A: Eq
    • -
  • impl<A, B> Eq for (A, B) where B: Eq, A: Eq
    • -
  • impl<A, B, C> Eq for (A, B, C) where B: Eq, C: Eq, A: Eq
    • -
  • impl<A, B, C, D> Eq for (A, B, C, D) where B: Eq, D: Eq, C: Eq, A: Eq
    • -
  • impl<A, B, C, D, E> Eq for (A, B, C, D, E) where D: Eq, B: Eq, E: Eq, A: Eq, C: Eq
    • -
  • impl<A, B, C, D, E, F> Eq for (A, B, C, D, E, F) where E: Eq, C: Eq, A: Eq, B: Eq, D: Eq, F: Eq
    • -
  • impl<A, B, C, D, E, F, G> Eq for (A, B, C, D, E, F, G) where E: Eq, D: Eq, A: Eq, G: Eq, F: Eq, C: Eq, B: Eq
    • -
  • impl<A, B, C, D, E, F, G, H> Eq for (A, B, C, D, E, F, G, H) where D: Eq, F: Eq, G: Eq, H: Eq, E: Eq, B: Eq, A: Eq, C: Eq
    • -
  • impl<A, B, C, D, E, F, G, H, I> Eq for (A, B, C, D, E, F, G, H, I) where E: Eq, G: Eq, H: Eq, D: Eq, F: Eq, B: Eq, C: Eq, A: Eq, I: Eq
    • -
  • impl<A, B, C, D, E, F, G, H, I, J> Eq for (A, B, C, D, E, F, G, H, I, J) where J: Eq, E: Eq, A: Eq, C: Eq, H: Eq, B: Eq, I: Eq, D: Eq, G: Eq, F: Eq
    • -
  • impl<A, B, C, D, E, F, G, H, I, J, K> Eq for (A, B, C, D, E, F, G, H, I, J, K) where A: Eq, C: Eq, F: Eq, D: Eq, H: Eq, K: Eq, J: Eq, B: Eq, G: Eq, E: Eq, I: Eq
    • -
  • impl<A, B, C, D, E, F, G, H, I, J, K, L> Eq for (A, B, C, D, E, F, G, H, I, J, K, L) where J: Eq, F: Eq, D: Eq, A: Eq, L: Eq, G: Eq, B: Eq, K: Eq, H: Eq, E: Eq, C: Eq, I: Eq
    • -
  • impl<K, V> Eq for BTreeMap<K, V> where K: Eq, V: Eq
    • -
  • impl<T> Eq for BTreeSet<T> where T: Eq
    • -
  • impl<E> Eq for EnumSet<E> where E: Eq
    • -
  • impl<T> Eq for Bound<T> where T: Eq
    • -
  • impl<T> Eq for Arc<T> where T: Eq + ?Sized
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.ExactSizeIterator.html b/doc/bitflags/__core/prelude/v1/trait.ExactSizeIterator.html deleted file mode 100644 index 71dd55a1..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.ExactSizeIterator.html +++ /dev/null @@ -1,255 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::ExactSizeIterator - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::ExactSizeIterator - - [−] - - [src]

-
pub trait ExactSizeIterator: Iterator {
-    fn len(&self) -> usize { ... }
-}

An iterator that knows its exact length.

- -

Many Iterators don't know how many times they will iterate, but some do. -If an iterator knows how many times it can iterate, providing access to -that information can be useful. For example, if you want to iterate -backwards, a good start is to know where the end is.

- -

When implementing an ExactSizeIterator, You must also implement -Iterator. When doing so, the implementation of size_hint() must -return the exact size of the iterator.

- -

The len() method has a default implementation, so you usually shouldn't -implement it. However, you may be able to provide a more performant -implementation than the default, so overriding it in this case makes sense.

- -

Examples

-

Basic usage:

- -
-// a finite range knows exactly how many times it will iterate
-let five = 0..5;
-
-assert_eq!(5, five.len());
- -

In the module level docs, we implemented an Iterator, -Counter. Let's implement ExactSizeIterator for it as well:

- -
-impl ExactSizeIterator for Counter {
-    // We already have the number of iterations, so we can use it directly.
-    fn len(&self) -> usize {
-        self.count
-    }
-}
-
-// And now we can use it!
-
-let counter = Counter::new();
-
-assert_eq!(0, counter.len());
-
-

Provided Methods

-
-

fn len(&self) -> usize

Returns the exact number of times the iterator will iterate.

- -

This method has a default implementation, so you usually should not -implement it directly. However, if you can provide a more efficient -implementation, you can do so. See the trait-level docs for an -example.

- -

This function has the same safety guarantees as the size_hint() -function.

- -

Examples

-

Basic usage:

- -
-// a finite range knows exactly how many times it will iterate
-let five = 0..5;
-
-assert_eq!(5, five.len());
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.Extend.html b/doc/bitflags/__core/prelude/v1/trait.Extend.html deleted file mode 100644 index 5441d3ca..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.Extend.html +++ /dev/null @@ -1,223 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Extend - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::Extend - - [−] - - [src]

-
pub trait Extend<A> {
-    fn extend<T>(&mut self, iter: T) where T: IntoIterator<Item=A>;
-}

Extend a collection with the contents of an iterator.

- -

Iterators produce a series of values, and collections can also be thought -of as a series of values. The Extend trait bridges this gap, allowing you -to extend a collection by including the contents of that iterator.

- -

Examples

-

Basic usage:

- -
-// You can extend a String with some chars:
-let mut message = String::from("The first three letters are: ");
-
-message.extend(&['a', 'b', 'c']);
-
-assert_eq!("abc", &message[29..32]);
- -

Implementing Extend:

- -
-// A sample collection, that's just a wrapper over Vec<T>
-#[derive(Debug)]
-struct MyCollection(Vec<i32>);
-
-// Let's give it some methods so we can create one and add things
-// to it.
-impl MyCollection {
-    fn new() -> MyCollection {
-        MyCollection(Vec::new())
-    }
-
-    fn add(&mut self, elem: i32) {
-        self.0.push(elem);
-    }
-}
-
-// since MyCollection has a list of i32s, we implement Extend for i32
-impl Extend<i32> for MyCollection {
-
-    // This is a bit simpler with the concrete type signature: we can call
-    // extend on anything which can be turned into an Iterator which gives
-    // us i32s. Because we need i32s to put into MyCollection.
-    fn extend<T: IntoIterator<Item=i32>>(&mut self, iter: T) {
-
-        // The implementation is very straightforward: loop through the
-        // iterator, and add() each element to ourselves.
-        for elem in iter {
-            self.add(elem);
-        }
-    }
-}
-
-let mut c = MyCollection::new();
-
-c.add(5);
-c.add(6);
-c.add(7);
-
-// let's extend our collection with three more numbers
-c.extend(vec![1, 2, 3]);
-
-// we've added these elements onto the end
-assert_eq!("MyCollection([5, 6, 7, 1, 2, 3])", format!("{:?}", c));
-
-

Required Methods

-
-

fn extend<T>(&mut self, iter: T) where T: IntoIterator<Item=A>

Extends a collection with the contents of an iterator.

- -

As this is the only method for this trait, the trait-level docs -contain more details.

- -

Examples

-

Basic usage:

- -
-// You can extend a String with some chars:
-let mut message = String::from("abc");
-
-message.extend(['d', 'e', 'f'].iter());
-
-assert_eq!("abcdef", &message);
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.Fn.html b/doc/bitflags/__core/prelude/v1/trait.Fn.html deleted file mode 100644 index a9089313..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.Fn.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Fn - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::Fn - - [−] - - [src]

-
pub trait Fn<Args>: FnMut<Args> {
-    extern "rust-call" fn call(&self, args: Args) -> Self::Output;
-}

A version of the call operator that takes an immutable receiver.

-
-

Required Methods

-
-

extern "rust-call" fn call(&self, args: Args) -> Self::Output

Unstable (fn_traits)

This is called when the call operator is used.

-
-

Implementors

-
    -
  • impl<'a, A, F> Fn for &'a F where F: Fn<A> + ?Sized
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.FnMut.html b/doc/bitflags/__core/prelude/v1/trait.FnMut.html deleted file mode 100644 index 3ac745da..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.FnMut.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::FnMut - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::FnMut - - [−] - - [src]

-
pub trait FnMut<Args>: FnOnce<Args> {
-    extern "rust-call" fn call_mut(&mut self, args: Args) -> Self::Output;
-}

A version of the call operator that takes a mutable receiver.

-
-

Required Methods

-
-

extern "rust-call" fn call_mut(&mut self, args: Args) -> Self::Output

Unstable (fn_traits)

This is called when the call operator is used.

-
-

Implementors

-
    -
  • impl<'a, A, F> FnMut for &'a F where F: Fn<A> + ?Sized
    • -
  • impl<'a, A, F> FnMut for &'a mut F where F: FnMut<A> + ?Sized
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.FnOnce.html b/doc/bitflags/__core/prelude/v1/trait.FnOnce.html deleted file mode 100644 index a995adbf..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.FnOnce.html +++ /dev/null @@ -1,135 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::FnOnce - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::FnOnce - - [−] - - [src]

-
pub trait FnOnce<Args> {
-    type Output;
-    extern "rust-call" fn call_once(self, args: Args) -> Self::Output;
-}

A version of the call operator that takes a by-value receiver.

-
-

Associated Types

-
-

type Output

Unstable (fn_traits)

The returned type after the call operator is used.

-
-

Required Methods

-
-

extern "rust-call" fn call_once(self, args: Args) -> Self::Output

Unstable (fn_traits)

This is called when the call operator is used.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.From.html b/doc/bitflags/__core/prelude/v1/trait.From.html deleted file mode 100644 index c784093b..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.From.html +++ /dev/null @@ -1,211 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::From - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::From - - [−] - - [src]

-
pub trait From<T> {
-    fn from(T) -> Self;
-}

Construct Self via a conversion.

- -

Note: this trait must not fail. If the conversion can fail, use a dedicated method which -returns an Option<T> or a Result<T, E>.

- -

Examples

-

String implements From<&str>:

- -
-let string = "hello".to_string();
-let other_string = String::from("hello");
-
-assert_eq!(string, other_string);
- -

Generic impls

-
    -
  • From<T> for U implies Into<U> for T
    • -
  • from() is reflexive, which means that From<T> for T is implemented
    • -
-
-

Required Methods

-
-

fn from(T) -> Self

Performs the conversion.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.Into.html b/doc/bitflags/__core/prelude/v1/trait.Into.html deleted file mode 100644 index 4385a431..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.Into.html +++ /dev/null @@ -1,152 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Into - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::Into - - [−] - - [src]

-
pub trait Into<T> {
-    fn into(self) -> T;
-}

A conversion that consumes self, which may or may not be expensive.

- -

Note: this trait must not fail. If the conversion can fail, use a dedicated method which -returns an Option<T> or a Result<T, E>.

- -

Library authors should not directly implement this trait, but should prefer implementing -the From trait, which offers greater flexibility and provides an equivalent Into -implementation for free, thanks to a blanket implementation in the standard library.

- -

Examples

-

String implements Into<Vec<u8>>:

- -
-fn is_hello<T: Into<Vec<u8>>>(s: T) {
-   let bytes = b"hello".to_vec();
-   assert_eq!(bytes, s.into());
-}
-
-let s = "hello".to_string();
-is_hello(s);
- -

Generic Impls

-
    -
  • From<T> for U implies Into<U> for T
    • -
  • into() is reflexive, which means that Into<T> for T is implemented
    • -
-
-

Required Methods

-
-

fn into(self) -> T

Performs the conversion.

-
-

Implementors

-
    -
  • impl Into for PathBuf
    • -
  • impl<T, U> Into for T where U: From<T>
    • -
  • impl Into for String
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.IntoIterator.html b/doc/bitflags/__core/prelude/v1/trait.IntoIterator.html deleted file mode 100644 index 696e2850..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.IntoIterator.html +++ /dev/null @@ -1,326 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::IntoIterator - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::IntoIterator - - [−] - - [src]

-
pub trait IntoIterator where Self::IntoIter::Item == Self::Item {
-    type Item;
-    type IntoIter: Iterator;
-    fn into_iter(self) -> Self::IntoIter;
-}

Conversion into an Iterator.

- -

By implementing IntoIterator for a type, you define how it will be -converted to an iterator. This is common for types which describe a -collection of some kind.

- -

One benefit of implementing IntoIterator is that your type will work -with Rust's for loop syntax.

- -

See also: FromIterator.

- -

Examples

-

Basic usage:

- -
-let v = vec![1, 2, 3];
-
-let mut iter = v.into_iter();
-
-let n = iter.next();
-assert_eq!(Some(1), n);
-
-let n = iter.next();
-assert_eq!(Some(2), n);
-
-let n = iter.next();
-assert_eq!(Some(3), n);
-
-let n = iter.next();
-assert_eq!(None, n);
- -

Implementing IntoIterator for your type:

- -
-// A sample collection, that's just a wrapper over Vec<T>
-#[derive(Debug)]
-struct MyCollection(Vec<i32>);
-
-// Let's give it some methods so we can create one and add things
-// to it.
-impl MyCollection {
-    fn new() -> MyCollection {
-        MyCollection(Vec::new())
-    }
-
-    fn add(&mut self, elem: i32) {
-        self.0.push(elem);
-    }
-}
-
-// and we'll implement IntoIterator
-impl IntoIterator for MyCollection {
-    type Item = i32;
-    type IntoIter = ::std::vec::IntoIter<i32>;
-
-    fn into_iter(self) -> Self::IntoIter {
-        self.0.into_iter()
-    }
-}
-
-// Now we can make a new collection...
-let mut c = MyCollection::new();
-
-// ... add some stuff to it ...
-c.add(0);
-c.add(1);
-c.add(2);
-
-// ... and then turn it into an Iterator:
-for (i, n) in c.into_iter().enumerate() {
-    assert_eq!(i as i32, n);
-}
-
-

Associated Types

-
-

type Item

The type of the elements being iterated over.

-

type IntoIter: Iterator

Which kind of iterator are we turning this into?

-
-

Required Methods

-
-

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

- -

See the module-level documentation for more.

- -

Examples

-

Basic usage:

- -
-let v = vec![1, 2, 3];
-
-let mut iter = v.into_iter();
-
-let n = iter.next();
-assert_eq!(Some(1), n);
-
-let n = iter.next();
-assert_eq!(Some(2), n);
-
-let n = iter.next();
-assert_eq!(Some(3), n);
-
-let n = iter.next();
-assert_eq!(None, n);
-
-

Implementors

-
    -
  • impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher
    • -
  • impl<'a, K, V, S> IntoIterator for &'a mut HashMap<K, V, S> where S: BuildHasher, K: Eq + Hash
    • -
  • impl<K, V, S> IntoIterator for HashMap<K, V, S> where S: BuildHasher, K: Eq + Hash
    • -
  • impl<'a, T, S> IntoIterator for &'a HashSet<T, S> where S: BuildHasher, T: Eq + Hash
    • -
  • impl<T, S> IntoIterator for HashSet<T, S> where T: Eq + Hash, S: BuildHasher
    • -
  • impl<T> IntoIterator for LinkedList<T>
    • -
  • impl<'a, T> IntoIterator for &'a LinkedList<T>
    • -
  • impl<'a, T> IntoIterator for &'a mut LinkedList<T>
    • -
  • impl<T> IntoIterator for VecDeque<T>
    • -
  • impl<'a, T> IntoIterator for &'a VecDeque<T>
    • -
  • impl<'a, T> IntoIterator for &'a mut VecDeque<T>
    • -
  • impl<T> IntoIterator for BinaryHeap<T> where T: Ord
    • -
  • impl<'a, T> IntoIterator for &'a BinaryHeap<T> where T: Ord
    • -
  • impl<'a> IntoIterator for &'a UnixListener
    • -
  • impl<'a> IntoIterator for &'a PathBuf
    • -
  • impl<'a> IntoIterator for &'a Path
    • -
  • impl<'a, T> IntoIterator for &'a Receiver<T>
    • -
  • impl<T> IntoIterator for Receiver<T>
    • -
  • impl<T> IntoIterator for Vec<T>
    • -
  • impl<'a, T> IntoIterator for &'a Vec<T>
    • -
  • impl<'a, T> IntoIterator for &'a mut Vec<T>
    • -
  • impl<I> IntoIterator for I where I: Iterator
    • -
  • impl<T, E> IntoIterator for Result<T, E>
    • -
  • impl<'a, T, E> IntoIterator for &'a Result<T, E>
    • -
  • impl<'a, T, E> IntoIterator for &'a mut Result<T, E>
    • -
  • impl<T> IntoIterator for Option<T>
    • -
  • impl<'a, T> IntoIterator for &'a Option<T>
    • -
  • impl<'a, T> IntoIterator for &'a mut Option<T>
    • -
  • impl<'a, T> IntoIterator for &'a [T; 0]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 0]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 1]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 1]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 2]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 2]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 3]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 3]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 4]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 4]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 5]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 5]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 6]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 6]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 7]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 7]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 8]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 8]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 9]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 9]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 10]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 10]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 11]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 11]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 12]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 12]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 13]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 13]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 14]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 14]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 15]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 15]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 16]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 16]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 17]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 17]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 18]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 18]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 19]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 19]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 20]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 20]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 21]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 21]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 22]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 22]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 23]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 23]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 24]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 24]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 25]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 25]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 26]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 26]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 27]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 27]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 28]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 28]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 29]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 29]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 30]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 30]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 31]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 31]
    • -
  • impl<'a, T> IntoIterator for &'a [T; 32]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T; 32]
    • -
  • impl<'a, T> IntoIterator for &'a [T]
    • -
  • impl<'a, T> IntoIterator for &'a mut [T]
    • -
  • impl<'a, K, V> IntoIterator for &'a BTreeMap<K, V> where K: 'a, V: 'a
    • -
  • impl<'a, K, V> IntoIterator for &'a mut BTreeMap<K, V> where V: 'a, K: 'a
    • -
  • impl<K, V> IntoIterator for BTreeMap<K, V>
    • -
  • impl<T> IntoIterator for BTreeSet<T>
    • -
  • impl<'a, T> IntoIterator for &'a BTreeSet<T>
    • -
  • impl<'a, E> IntoIterator for &'a EnumSet<E> where E: CLike
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.Iterator.html b/doc/bitflags/__core/prelude/v1/trait.Iterator.html deleted file mode 100644 index 5e0e0fb7..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.Iterator.html +++ /dev/null @@ -1,1671 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Iterator - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::Iterator - - [−] - - [src]

-
pub trait Iterator {
-    type Item;
-    fn next(&mut self) -> Option<Self::Item>;
-
-    fn size_hint(&self) -> (usize, Option<usize>) { ... }
-    fn count(self) -> usize { ... }
-    fn last(self) -> Option<Self::Item> { ... }
-    fn nth(&mut self, n: usize) -> Option<Self::Item> { ... }
-    fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item> { ... }
-    fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator { ... }
-    fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B { ... }
-    fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool { ... }
-    fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B> { ... }
-    fn enumerate(self) -> Enumerate<Self> { ... }
-    fn peekable(self) -> Peekable<Self> { ... }
-    fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool { ... }
-    fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool { ... }
-    fn skip(self, n: usize) -> Skip<Self> { ... }
-    fn take(self, n: usize) -> Take<Self> { ... }
-    fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B> { ... }
-    fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator { ... }
-    fn fuse(self) -> Fuse<Self> { ... }
-    fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> () { ... }
-    fn by_ref(&mut self) -> &mut Self { ... }
-    fn collect<B>(self) -> B where B: FromIterator<Self::Item> { ... }
-    fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item> { ... }
-    fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B { ... }
-    fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool { ... }
-    fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool { ... }
-    fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool { ... }
-    fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool { ... }
-    fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator { ... }
-    fn max(self) -> Option<Self::Item> where Self::Item: Ord { ... }
-    fn min(self) -> Option<Self::Item> where Self::Item: Ord { ... }
-    fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord { ... }
-    fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord { ... }
-    fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator { ... }
-    fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where Self: Iterator<Item=(A, B)>, FromB: Default + Extend<B>, FromA: Default + Extend<A> { ... }
-    fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone { ... }
-    fn cycle(self) -> Cycle<Self> where Self: Clone { ... }
-    fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero { ... }
-    fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One { ... }
-    fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord { ... }
-    fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item> { ... }
-    fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item> { ... }
-    fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item> { ... }
-    fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item> { ... }
-    fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item> { ... }
-    fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item> { ... }
-    fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item> { ... }
-}

An interface for dealing with iterators.

- -

This is the main iterator trait. For more about the concept of iterators -generally, please see the module-level documentation. In particular, you -may want to know how to implement Iterator.

-
-

Associated Types

-
-

type Item

The type of the elements being iterated over.

-
-

Required Methods

-
-

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value.

- -

Returns None when iteration is finished. Individual iterator -implementations may choose to resume iteration, and so calling next() -again may or may not eventually start returning Some(Item) again at some -point.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter();
-
-// A call to next() returns the next value...
-assert_eq!(Some(&1), iter.next());
-assert_eq!(Some(&2), iter.next());
-assert_eq!(Some(&3), iter.next());
-
-// ... and then None once it's over.
-assert_eq!(None, iter.next());
-
-// More calls may or may not return None. Here, they always will.
-assert_eq!(None, iter.next());
-assert_eq!(None, iter.next());
-
-

Provided Methods

-
-

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

- -

Specifically, size_hint() returns a tuple where the first element -is the lower bound, and the second element is the upper bound.

- -

The second half of the tuple that is returned is an Option<usize>. A -None here means that either there is no known upper bound, or the -upper bound is larger than usize.

- -

Implementation notes

-

It is not enforced that an iterator implementation yields the declared -number of elements. A buggy iterator may yield less than the lower bound -or more than the upper bound of elements.

- -

size_hint() is primarily intended to be used for optimizations such as -reserving space for the elements of the iterator, but must not be -trusted to e.g. omit bounds checks in unsafe code. An incorrect -implementation of size_hint() should not lead to memory safety -violations.

- -

That said, the implementation should provide a correct estimation, -because otherwise it would be a violation of the trait's protocol.

- -

The default implementation returns (0, None) which is correct for any -iterator.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-let iter = a.iter();
-
-assert_eq!((3, Some(3)), iter.size_hint());
- -

A more complex example:

- -
-// The even numbers from zero to ten.
-let iter = (0..10).filter(|x| x % 2 == 0);
-
-// We might iterate from zero to ten times. Knowing that it's five
-// exactly wouldn't be possible without executing filter().
-assert_eq!((0, Some(10)), iter.size_hint());
-
-// Let's add one five more numbers with chain()
-let iter = (0..10).filter(|x| x % 2 == 0).chain(15..20);
-
-// now both bounds are increased by five
-assert_eq!((5, Some(15)), iter.size_hint());
- -

Returning None for an upper bound:

- -
-// an infinite iterator has no upper bound
-let iter = 0..;
-
-assert_eq!((0, None), iter.size_hint());
-

fn count(self) -> usize

Consumes the iterator, counting the number of iterations and returning it.

- -

This method will evaluate the iterator until its next() returns -None. Once None is encountered, count() returns the number of -times it called next().

- -

Overflow Behavior

-

The method does no guarding against overflows, so counting elements of -an iterator with more than usize::MAX elements either produces the -wrong result or panics. If debug assertions are enabled, a panic is -guaranteed.

- -

Panics

-

This function might panic if the iterator has more than usize::MAX -elements.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-assert_eq!(a.iter().count(), 3);
-
-let a = [1, 2, 3, 4, 5];
-assert_eq!(a.iter().count(), 5);
-

fn last(self) -> Option<Self::Item>

Consumes the iterator, returning the last element.

- -

This method will evaluate the iterator until it returns None. While -doing so, it keeps track of the current element. After None is -returned, last() will then return the last element it saw.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-assert_eq!(a.iter().last(), Some(&3));
-
-let a = [1, 2, 3, 4, 5];
-assert_eq!(a.iter().last(), Some(&5));
-

fn nth(&mut self, n: usize) -> Option<Self::Item>

Consumes the n first elements of the iterator, then returns the -next() one.

- -

This method will evaluate the iterator n times, discarding those elements. -After it does so, it will call next() and return its value.

- -

Like most indexing operations, the count starts from zero, so nth(0) -returns the first value, nth(1) the second, and so on.

- -

nth() will return None if n is larger than the length of the -iterator.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-assert_eq!(a.iter().nth(1), Some(&2));
- -

Calling nth() multiple times doesn't rewind the iterator:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter();
-
-assert_eq!(iter.nth(1), Some(&2));
-assert_eq!(iter.nth(1), None);
- -

Returning None if there are less than n elements:

- -
-let a = [1, 2, 3];
-assert_eq!(a.iter().nth(10), None);
-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

Takes two iterators and creates a new iterator over both in sequence.

- -

chain() will return a new iterator which will first iterate over -values from the first iterator and then over values from the second -iterator.

- -

In other words, it links two iterators together, in a chain. 🔗

- -

Examples

-

Basic usage:

- -
-let a1 = [1, 2, 3];
-let a2 = [4, 5, 6];
-
-let mut iter = a1.iter().chain(a2.iter());
-
-assert_eq!(iter.next(), Some(&1));
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), Some(&3));
-assert_eq!(iter.next(), Some(&4));
-assert_eq!(iter.next(), Some(&5));
-assert_eq!(iter.next(), Some(&6));
-assert_eq!(iter.next(), None);
- -

Since the argument to chain() uses IntoIterator, we can pass -anything that can be converted into an Iterator, not just an -Iterator itself. For example, slices (&[T]) implement -IntoIterator, and so can be passed to chain() directly:

- -
-let s1 = &[1, 2, 3];
-let s2 = &[4, 5, 6];
-
-let mut iter = s1.iter().chain(s2);
-
-assert_eq!(iter.next(), Some(&1));
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), Some(&3));
-assert_eq!(iter.next(), Some(&4));
-assert_eq!(iter.next(), Some(&5));
-assert_eq!(iter.next(), Some(&6));
-assert_eq!(iter.next(), None);
-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

'Zips up' two iterators into a single iterator of pairs.

- -

zip() returns a new iterator that will iterate over two other -iterators, returning a tuple where the first element comes from the -first iterator, and the second element comes from the second iterator.

- -

In other words, it zips two iterators together, into a single one.

- -

When either iterator returns None, all further calls to next() -will return None.

- -

Examples

-

Basic usage:

- -
-let a1 = [1, 2, 3];
-let a2 = [4, 5, 6];
-
-let mut iter = a1.iter().zip(a2.iter());
-
-assert_eq!(iter.next(), Some((&1, &4)));
-assert_eq!(iter.next(), Some((&2, &5)));
-assert_eq!(iter.next(), Some((&3, &6)));
-assert_eq!(iter.next(), None);
- -

Since the argument to zip() uses IntoIterator, we can pass -anything that can be converted into an Iterator, not just an -Iterator itself. For example, slices (&[T]) implement -IntoIterator, and so can be passed to zip() directly:

- -
-let s1 = &[1, 2, 3];
-let s2 = &[4, 5, 6];
-
-let mut iter = s1.iter().zip(s2);
-
-assert_eq!(iter.next(), Some((&1, &4)));
-assert_eq!(iter.next(), Some((&2, &5)));
-assert_eq!(iter.next(), Some((&3, &6)));
-assert_eq!(iter.next(), None);
- -

zip() is often used to zip an infinite iterator to a finite one. -This works because the finite iterator will eventually return None, -ending the zipper. Zipping with (0..) can look a lot like enumerate():

- -
-let enumerate: Vec<_> = "foo".chars().enumerate().collect();
-
-let zipper: Vec<_> = (0..).zip("foo".chars()).collect();
-
-assert_eq!((0, 'f'), enumerate[0]);
-assert_eq!((0, 'f'), zipper[0]);
-
-assert_eq!((1, 'o'), enumerate[1]);
-assert_eq!((1, 'o'), zipper[1]);
-
-assert_eq!((2, 'o'), enumerate[2]);
-assert_eq!((2, 'o'), zipper[2]);
-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

Takes a closure and creates an iterator which calls that closure on each -element.

- -

map() transforms one iterator into another, by means of its argument: -something that implements FnMut. It produces a new iterator which -calls this closure on each element of the original iterator.

- -

If you are good at thinking in types, you can think of map() like this: -If you have an iterator that gives you elements of some type A, and -you want an iterator of some other type B, you can use map(), -passing a closure that takes an A and returns a B.

- -

map() is conceptually similar to a for loop. However, as map() is -lazy, it is best used when you're already working with other iterators. -If you're doing some sort of looping for a side effect, it's considered -more idiomatic to use for than map().

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.into_iter().map(|x| 2 * x);
-
-assert_eq!(iter.next(), Some(2));
-assert_eq!(iter.next(), Some(4));
-assert_eq!(iter.next(), Some(6));
-assert_eq!(iter.next(), None);
- -

If you're doing some sort of side effect, prefer for to map():

- -
-// don't do this:
-(0..5).map(|x| println!("{}", x));
-
-// it won't even execute, as it is lazy. Rust will warn you about this.
-
-// Instead, use for:
-for x in 0..5 {
-    println!("{}", x);
-}
-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

Creates an iterator which uses a closure to determine if an element -should be yielded.

- -

The closure must return true or false. filter() creates an -iterator which calls this closure on each element. If the closure -returns true, then the element is returned. If the closure returns -false, it will try again, and call the closure on the next element, -seeing if it passes the test.

- -

Examples

-

Basic usage:

- -
-let a = [0i32, 1, 2];
-
-let mut iter = a.into_iter().filter(|x| x.is_positive());
-
-assert_eq!(iter.next(), Some(&1));
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), None);
- -

Because the closure passed to filter() takes a reference, and many -iterators iterate over references, this leads to a possibly confusing -situation, where the type of the closure is a double reference:

- -
-let a = [0, 1, 2];
-
-let mut iter = a.into_iter().filter(|x| **x > 1); // need two *s!
-
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), None);
- -

It's common to instead use destructuring on the argument to strip away -one:

- -
-let a = [0, 1, 2];
-
-let mut iter = a.into_iter().filter(|&x| *x > 1); // both & and *
-
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), None);
- -

or both:

- -
-let a = [0, 1, 2];
-
-let mut iter = a.into_iter().filter(|&&x| x > 1); // two &s
-
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), None);
- -

of these layers.

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

Creates an iterator that both filters and maps.

- -

The closure must return an Option<T>. filter_map() creates an -iterator which calls this closure on each element. If the closure -returns Some(element), then that element is returned. If the -closure returns None, it will try again, and call the closure on the -next element, seeing if it will return Some.

- -

Why filter_map() and not just filter().map()? The key is in this -part:

- -
-

If the closure returns Some(element), then that element is returned.

-
- -

In other words, it removes the Option<T> layer automatically. If your -mapping is already returning an Option<T> and you want to skip over -Nones, then filter_map() is much, much nicer to use.

- -

Examples

-

Basic usage:

- -
-let a = ["1", "2", "lol"];
-
-let mut iter = a.iter().filter_map(|s| s.parse().ok());
-
-assert_eq!(iter.next(), Some(1));
-assert_eq!(iter.next(), Some(2));
-assert_eq!(iter.next(), None);
- -

Here's the same example, but with filter() and map():

- -
-let a = ["1", "2", "lol"];
-
-let mut iter = a.iter()
-                .map(|s| s.parse().ok())
-                .filter(|s| s.is_some());
-
-assert_eq!(iter.next(), Some(Some(1)));
-assert_eq!(iter.next(), Some(Some(2)));
-assert_eq!(iter.next(), None);
- -

There's an extra layer of Some in there.

-

fn enumerate(self) -> Enumerate<Self>

Creates an iterator which gives the current iteration count as well as -the next value.

- -

The iterator returned yields pairs (i, val), where i is the -current index of iteration and val is the value returned by the -iterator.

- -

enumerate() keeps its count as a usize. If you want to count by a -different sized integer, the zip() function provides similar -functionality.

- -

Overflow Behavior

-

The method does no guarding against overflows, so enumerating more than -usize::MAX elements either produces the wrong result or panics. If -debug assertions are enabled, a panic is guaranteed.

- -

Panics

-

The returned iterator might panic if the to-be-returned index would -overflow a usize.

- -

Examples

-
-let a = ['a', 'b', 'c'];
-
-let mut iter = a.iter().enumerate();
-
-assert_eq!(iter.next(), Some((0, &'a')));
-assert_eq!(iter.next(), Some((1, &'b')));
-assert_eq!(iter.next(), Some((2, &'c')));
-assert_eq!(iter.next(), None);
-

fn peekable(self) -> Peekable<Self>

Creates an iterator which can use peek to look at the next element of -the iterator without consuming it.

- -

Adds a peek() method to an iterator. See its documentation for -more information.

- -

Note that the underlying iterator is still advanced when peek is -called for the first time: In order to retrieve the next element, -next is called on the underlying iterator, hence any side effects of -the next method will occur.

- -

Examples

-

Basic usage:

- -
-let xs = [1, 2, 3];
-
-let mut iter = xs.iter().peekable();
-
-// peek() lets us see into the future
-assert_eq!(iter.peek(), Some(&&1));
-assert_eq!(iter.next(), Some(&1));
-
-assert_eq!(iter.next(), Some(&2));
-
-// we can peek() multiple times, the iterator won't advance
-assert_eq!(iter.peek(), Some(&&3));
-assert_eq!(iter.peek(), Some(&&3));
-
-assert_eq!(iter.next(), Some(&3));
-
-// after the iterator is finished, so is peek()
-assert_eq!(iter.peek(), None);
-assert_eq!(iter.next(), None);
-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

Creates an iterator that skip()s elements based on a predicate.

- -

skip_while() takes a closure as an argument. It will call this -closure on each element of the iterator, and ignore elements -until it returns false.

- -

After false is returned, skip_while()'s job is over, and the -rest of the elements are yielded.

- -

Examples

-

Basic usage:

- -
-let a = [-1i32, 0, 1];
-
-let mut iter = a.into_iter().skip_while(|x| x.is_negative());
-
-assert_eq!(iter.next(), Some(&0));
-assert_eq!(iter.next(), Some(&1));
-assert_eq!(iter.next(), None);
- -

Because the closure passed to skip_while() takes a reference, and many -iterators iterate over references, this leads to a possibly confusing -situation, where the type of the closure is a double reference:

- -
-let a = [-1, 0, 1];
-
-let mut iter = a.into_iter().skip_while(|x| **x < 0); // need two *s!
-
-assert_eq!(iter.next(), Some(&0));
-assert_eq!(iter.next(), Some(&1));
-assert_eq!(iter.next(), None);
- -

Stopping after an initial false:

- -
-let a = [-1, 0, 1, -2];
-
-let mut iter = a.into_iter().skip_while(|x| **x < 0);
-
-assert_eq!(iter.next(), Some(&0));
-assert_eq!(iter.next(), Some(&1));
-
-// while this would have been false, since we already got a false,
-// skip_while() isn't used any more
-assert_eq!(iter.next(), Some(&-2));
-
-assert_eq!(iter.next(), None);
-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

Creates an iterator that yields elements based on a predicate.

- -

take_while() takes a closure as an argument. It will call this -closure on each element of the iterator, and yield elements -while it returns true.

- -

After false is returned, take_while()'s job is over, and the -rest of the elements are ignored.

- -

Examples

-

Basic usage:

- -
-let a = [-1i32, 0, 1];
-
-let mut iter = a.into_iter().take_while(|x| x.is_negative());
-
-assert_eq!(iter.next(), Some(&-1));
-assert_eq!(iter.next(), None);
- -

Because the closure passed to take_while() takes a reference, and many -iterators iterate over references, this leads to a possibly confusing -situation, where the type of the closure is a double reference:

- -
-let a = [-1, 0, 1];
-
-let mut iter = a.into_iter().take_while(|x| **x < 0); // need two *s!
-
-assert_eq!(iter.next(), Some(&-1));
-assert_eq!(iter.next(), None);
- -

Stopping after an initial false:

- -
-let a = [-1, 0, 1, -2];
-
-let mut iter = a.into_iter().take_while(|x| **x < 0);
-
-assert_eq!(iter.next(), Some(&-1));
-
-// We have more elements that are less than zero, but since we already
-// got a false, take_while() isn't used any more
-assert_eq!(iter.next(), None);
- -

Because take_while() needs to look at the value in order to see if it -should be included or not, consuming iterators will see that it is -removed:

- -
-let a = [1, 2, 3, 4];
-let mut iter = a.into_iter();
-
-let result: Vec<i32> = iter.by_ref()
-                           .take_while(|n| **n != 3)
-                           .cloned()
-                           .collect();
-
-assert_eq!(result, &[1, 2]);
-
-let result: Vec<i32> = iter.cloned().collect();
-
-assert_eq!(result, &[4]);
- -

The 3 is no longer there, because it was consumed in order to see if -the iteration should stop, but wasn't placed back into the iterator or -some similar thing.

-

fn skip(self, n: usize) -> Skip<Self>

Creates an iterator that skips the first n elements.

- -

After they have been consumed, the rest of the elements are yielded.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter().skip(2);
-
-assert_eq!(iter.next(), Some(&3));
-assert_eq!(iter.next(), None);
-

fn take(self, n: usize) -> Take<Self>

Creates an iterator that yields its first n elements.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter().take(2);
-
-assert_eq!(iter.next(), Some(&1));
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), None);
- -

take() is often used with an infinite iterator, to make it finite:

- -
-let mut iter = (0..).take(3);
-
-assert_eq!(iter.next(), Some(0));
-assert_eq!(iter.next(), Some(1));
-assert_eq!(iter.next(), Some(2));
-assert_eq!(iter.next(), None);
-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

An iterator adaptor similar to fold() that holds internal state and -produces a new iterator.

- -

scan() takes two arguments: an initial value which seeds the internal -state, and a closure with two arguments, the first being a mutable -reference to the internal state and the second an iterator element. -The closure can assign to the internal state to share state between -iterations.

- -

On iteration, the closure will be applied to each element of the -iterator and the return value from the closure, an Option, is -yielded by the iterator.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter().scan(1, |state, &x| {
-    // each iteration, we'll multiply the state by the element
-    *state = *state * x;
-
-    // the value passed on to the next iteration
-    Some(*state)
-});
-
-assert_eq!(iter.next(), Some(1));
-assert_eq!(iter.next(), Some(2));
-assert_eq!(iter.next(), Some(6));
-assert_eq!(iter.next(), None);
-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

Creates an iterator that works like map, but flattens nested structure.

- -

The map() adapter is very useful, but only when the closure -argument produces values. If it produces an iterator instead, there's -an extra layer of indirection. flat_map() will remove this extra layer -on its own.

- -

Another way of thinking about flat_map(): map()'s closure returns -one item for each element, and flat_map()'s closure returns an -iterator for each element.

- -

Examples

-

Basic usage:

- -
-let words = ["alpha", "beta", "gamma"];
-
-// chars() returns an iterator
-let merged: String = words.iter()
-                          .flat_map(|s| s.chars())
-                          .collect();
-assert_eq!(merged, "alphabetagamma");
-

fn fuse(self) -> Fuse<Self>

Creates an iterator which ends after the first None.

- -

After an iterator returns None, future calls may or may not yield -Some(T) again. fuse() adapts an iterator, ensuring that after a -None is given, it will always return None forever.

- -

Examples

-

Basic usage:

- -
-// an iterator which alternates between Some and None
-struct Alternate {
-    state: i32,
-}
-
-impl Iterator for Alternate {
-    type Item = i32;
-
-    fn next(&mut self) -> Option<i32> {
-        let val = self.state;
-        self.state = self.state + 1;
-
-        // if it's even, Some(i32), else None
-        if val % 2 == 0 {
-            Some(val)
-        } else {
-            None
-        }
-    }
-}
-
-let mut iter = Alternate { state: 0 };
-
-// we can see our iterator going back and forth
-assert_eq!(iter.next(), Some(0));
-assert_eq!(iter.next(), None);
-assert_eq!(iter.next(), Some(2));
-assert_eq!(iter.next(), None);
-
-// however, once we fuse it...
-let mut iter = iter.fuse();
-
-assert_eq!(iter.next(), Some(4));
-assert_eq!(iter.next(), None);
-
-// it will always return None after the first time.
-assert_eq!(iter.next(), None);
-assert_eq!(iter.next(), None);
-assert_eq!(iter.next(), None);
-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

Do something with each element of an iterator, passing the value on.

- -

When using iterators, you'll often chain several of them together. -While working on such code, you might want to check out what's -happening at various parts in the pipeline. To do that, insert -a call to inspect().

- -

It's much more common for inspect() to be used as a debugging tool -than to exist in your final code, but never say never.

- -

Examples

-

Basic usage:

- -
-let a = [1, 4, 2, 3];
-
-// this iterator sequence is complex.
-let sum = a.iter()
-            .cloned()
-            .filter(|&x| x % 2 == 0)
-            .fold(0, |sum, i| sum + i);
-
-println!("{}", sum);
-
-// let's add some inspect() calls to investigate what's happening
-let sum = a.iter()
-            .cloned()
-            .inspect(|x| println!("about to filter: {}", x))
-            .filter(|&x| x % 2 == 0)
-            .inspect(|x| println!("made it through filter: {}", x))
-            .fold(0, |sum, i| sum + i);
-
-println!("{}", sum);
- -

This will print:

- -
about to filter: 1
-about to filter: 4
-made it through filter: 4
-about to filter: 2
-made it through filter: 2
-about to filter: 3
-6
-
-

fn by_ref(&mut self) -> &mut Self

Borrows an iterator, rather than consuming it.

- -

This is useful to allow applying iterator adaptors while still -retaining ownership of the original iterator.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let iter = a.into_iter();
-
-let sum: i32 = iter.take(5)
-                   .fold(0, |acc, &i| acc + i );
-
-assert_eq!(sum, 6);
-
-// if we try to use iter again, it won't work. The following line
-// gives "error: use of moved value: `iter`
-// assert_eq!(iter.next(), None);
-
-// let's try that again
-let a = [1, 2, 3];
-
-let mut iter = a.into_iter();
-
-// instead, we add in a .by_ref()
-let sum: i32 = iter.by_ref()
-                   .take(2)
-                   .fold(0, |acc, &i| acc + i );
-
-assert_eq!(sum, 3);
-
-// now this is just fine:
-assert_eq!(iter.next(), Some(&3));
-assert_eq!(iter.next(), None);
-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

Transforms an iterator into a collection.

- -

collect() can take anything iterable, and turn it into a relevant -collection. This is one of the more powerful methods in the standard -library, used in a variety of contexts.

- -

The most basic pattern in which collect() is used is to turn one -collection into another. You take a collection, call iter() on it, -do a bunch of transformations, and then collect() at the end.

- -

One of the keys to collect()'s power is that many things you might -not think of as 'collections' actually are. For example, a String -is a collection of chars. And a collection of Result<T, E> can -be thought of as single Result<Collection<T>, E>. See the examples -below for more.

- -

Because collect() is so general, it can cause problems with type -inference. As such, collect() is one of the few times you'll see -the syntax affectionately known as the 'turbofish': ::<>. This -helps the inference algorithm understand specifically which collection -you're trying to collect into.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let doubled: Vec<i32> = a.iter()
-                         .map(|&x| x * 2)
-                         .collect();
-
-assert_eq!(vec![2, 4, 6], doubled);
- -

Note that we needed the : Vec<i32> on the left-hand side. This is because -we could collect into, for example, a VecDeque<T> instead:

- -
-use std::collections::VecDeque;
-
-let a = [1, 2, 3];
-
-let doubled: VecDeque<i32> = a.iter()
-                              .map(|&x| x * 2)
-                              .collect();
-
-assert_eq!(2, doubled[0]);
-assert_eq!(4, doubled[1]);
-assert_eq!(6, doubled[2]);
- -

Using the 'turbofish' instead of annotating doubled:

- -
-let a = [1, 2, 3];
-
-let doubled = a.iter()
-               .map(|&x| x * 2)
-               .collect::<Vec<i32>>();
-
-assert_eq!(vec![2, 4, 6], doubled);
- -

Because collect() cares about what you're collecting into, you can -still use a partial type hint, _, with the turbofish:

- -
-let a = [1, 2, 3];
-
-let doubled = a.iter()
-               .map(|&x| x * 2)
-               .collect::<Vec<_>>();
-
-assert_eq!(vec![2, 4, 6], doubled);
- -

Using collect() to make a String:

- -
-let chars = ['g', 'd', 'k', 'k', 'n'];
-
-let hello: String = chars.iter()
-                         .map(|&x| x as u8)
-                         .map(|x| (x + 1) as char)
-                         .collect();
-
-assert_eq!("hello", hello);
- -

If you have a list of Result<T, E>s, you can use collect() to -see if any of them failed:

- -
-let results = [Ok(1), Err("nope"), Ok(3), Err("bad")];
-
-let result: Result<Vec<_>, &str> = results.iter().cloned().collect();
-
-// gives us the first error
-assert_eq!(Err("nope"), result);
-
-let results = [Ok(1), Ok(3)];
-
-let result: Result<Vec<_>, &str> = results.iter().cloned().collect();
-
-// gives us the list of answers
-assert_eq!(Ok(vec![1, 3]), result);
-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

Consumes an iterator, creating two collections from it.

- -

The predicate passed to partition() can return true, or false. -partition() returns a pair, all of the elements for which it returned -true, and all of the elements for which it returned false.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let (even, odd): (Vec<i32>, Vec<i32>) = a.into_iter()
-                                         .partition(|&n| n % 2 == 0);
-
-assert_eq!(even, vec![2]);
-assert_eq!(odd, vec![1, 3]);
-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

An iterator adaptor that applies a function, producing a single, final value.

- -

fold() takes two arguments: an initial value, and a closure with two -arguments: an 'accumulator', and an element. The closure returns the value that -the accumulator should have for the next iteration.

- -

The initial value is the value the accumulator will have on the first -call.

- -

After applying this closure to every element of the iterator, fold() -returns the accumulator.

- -

This operation is sometimes called 'reduce' or 'inject'.

- -

Folding is useful whenever you have a collection of something, and want -to produce a single value from it.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-// the sum of all of the elements of a
-let sum = a.iter()
-           .fold(0, |acc, &x| acc + x);
-
-assert_eq!(sum, 6);
- -

Let's walk through each step of the iteration here:

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
elementaccxresult
0
1011
2123
3336
- -

And so, our final result, 6.

- -

It's common for people who haven't used iterators a lot to -use a for loop with a list of things to build up a result. Those -can be turned into fold()s:

- -
-let numbers = [1, 2, 3, 4, 5];
-
-let mut result = 0;
-
-// for loop:
-for i in &numbers {
-    result = result + i;
-}
-
-// fold:
-let result2 = numbers.iter().fold(0, |acc, &x| acc + x);
-
-// they're the same
-assert_eq!(result, result2);
-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

Tests if every element of the iterator matches a predicate.

- -

all() takes a closure that returns true or false. It applies -this closure to each element of the iterator, and if they all return -true, then so does all(). If any of them return false, it -returns false.

- -

all() is short-circuiting; in other words, it will stop processing -as soon as it finds a false, given that no matter what else happens, -the result will also be false.

- -

An empty iterator returns true.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-assert!(a.iter().all(|&x| x > 0));
-
-assert!(!a.iter().all(|&x| x > 2));
- -

Stopping at the first false:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter();
-
-assert!(!iter.all(|&x| x != 2));
-
-// we can still use `iter`, as there are more elements.
-assert_eq!(iter.next(), Some(&3));
-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

Tests if any element of the iterator matches a predicate.

- -

any() takes a closure that returns true or false. It applies -this closure to each element of the iterator, and if any of them return -true, then so does any(). If they all return false, it -returns false.

- -

any() is short-circuiting; in other words, it will stop processing -as soon as it finds a true, given that no matter what else happens, -the result will also be true.

- -

An empty iterator returns false.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-assert!(a.iter().any(|&x| x > 0));
-
-assert!(!a.iter().any(|&x| x > 5));
- -

Stopping at the first true:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter();
-
-assert!(iter.any(|&x| x != 2));
-
-// we can still use `iter`, as there are more elements.
-assert_eq!(iter.next(), Some(&2));
-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

Searches for an element of an iterator that satisfies a predicate.

- -

find() takes a closure that returns true or false. It applies -this closure to each element of the iterator, and if any of them return -true, then find() returns Some(element). If they all return -false, it returns None.

- -

find() is short-circuiting; in other words, it will stop processing -as soon as the closure returns true.

- -

Because find() takes a reference, and many iterators iterate over -references, this leads to a possibly confusing situation where the -argument is a double reference. You can see this effect in the -examples below, with &&x.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-assert_eq!(a.iter().find(|&&x| x == 2), Some(&2));
-
-assert_eq!(a.iter().find(|&&x| x == 5), None);
- -

Stopping at the first true:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter();
-
-assert_eq!(iter.find(|&&x| x == 2), Some(&2));
-
-// we can still use `iter`, as there are more elements.
-assert_eq!(iter.next(), Some(&3));
-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

Searches for an element in an iterator, returning its index.

- -

position() takes a closure that returns true or false. It applies -this closure to each element of the iterator, and if one of them -returns true, then position() returns Some(index). If all of -them return false, it returns None.

- -

position() is short-circuiting; in other words, it will stop -processing as soon as it finds a true.

- -

Overflow Behavior

-

The method does no guarding against overflows, so if there are more -than usize::MAX non-matching elements, it either produces the wrong -result or panics. If debug assertions are enabled, a panic is -guaranteed.

- -

Panics

-

This function might panic if the iterator has more than usize::MAX -non-matching elements.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-assert_eq!(a.iter().position(|&x| x == 2), Some(1));
-
-assert_eq!(a.iter().position(|&x| x == 5), None);
- -

Stopping at the first true:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter();
-
-assert_eq!(iter.position(|&x| x == 2), Some(1));
-
-// we can still use `iter`, as there are more elements.
-assert_eq!(iter.next(), Some(&3));
-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

Searches for an element in an iterator from the right, returning its -index.

- -

rposition() takes a closure that returns true or false. It applies -this closure to each element of the iterator, starting from the end, -and if one of them returns true, then rposition() returns -Some(index). If all of them return false, it returns None.

- -

rposition() is short-circuiting; in other words, it will stop -processing as soon as it finds a true.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-assert_eq!(a.iter().rposition(|&x| x == 3), Some(2));
-
-assert_eq!(a.iter().rposition(|&x| x == 5), None);
- -

Stopping at the first true:

- -
-let a = [1, 2, 3];
-
-let mut iter = a.iter();
-
-assert_eq!(iter.rposition(|&x| x == 2), Some(1));
-
-// we can still use `iter`, as there are more elements.
-assert_eq!(iter.next(), Some(&1));
-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

Returns the maximum element of an iterator.

- -

If the two elements are equally maximum, the latest element is -returned.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-assert_eq!(a.iter().max(), Some(&3));
-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

Returns the minimum element of an iterator.

- -

If the two elements are equally minimum, the first element is -returned.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-assert_eq!(a.iter().min(), Some(&1));
-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord1.6.0

Returns the element that gives the maximum value from the -specified function.

- -

Returns the rightmost element if the comparison determines two elements -to be equally maximum.

- -

Examples

-
-let a = [-3_i32, 0, 1, 5, -10];
-assert_eq!(*a.iter().max_by_key(|x| x.abs()).unwrap(), -10);
-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord1.6.0

Returns the element that gives the minimum value from the -specified function.

- -

Returns the latest element if the comparison determines two elements -to be equally minimum.

- -

Examples

-
-let a = [-3_i32, 0, 1, 5, -10];
-assert_eq!(*a.iter().min_by_key(|x| x.abs()).unwrap(), 0);
-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

Reverses an iterator's direction.

- -

Usually, iterators iterate from left to right. After using rev(), -an iterator will instead iterate from right to left.

- -

This is only possible if the iterator has an end, so rev() only -works on DoubleEndedIterators.

- -

Examples

-
-let a = [1, 2, 3];
-
-let mut iter = a.iter().rev();
-
-assert_eq!(iter.next(), Some(&3));
-assert_eq!(iter.next(), Some(&2));
-assert_eq!(iter.next(), Some(&1));
-
-assert_eq!(iter.next(), None);
-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where Self: Iterator<Item=(A, B)>, FromB: Default + Extend<B>, FromA: Default + Extend<A>

Converts an iterator of pairs into a pair of containers.

- -

unzip() consumes an entire iterator of pairs, producing two -collections: one from the left elements of the pairs, and one -from the right elements.

- -

This function is, in some sense, the opposite of zip().

- -

Examples

-

Basic usage:

- -
-let a = [(1, 2), (3, 4)];
-
-let (left, right): (Vec<_>, Vec<_>) = a.iter().cloned().unzip();
-
-assert_eq!(left, [1, 3]);
-assert_eq!(right, [2, 4]);
-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

Creates an iterator which clone()s all of its elements.

- -

This is useful when you have an iterator over &T, but you need an -iterator over T.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let v_cloned: Vec<_> = a.iter().cloned().collect();
-
-// cloned is the same as .map(|&x| x), for integers
-let v_map: Vec<_> = a.iter().map(|&x| x).collect();
-
-assert_eq!(v_cloned, vec![1, 2, 3]);
-assert_eq!(v_map, vec![1, 2, 3]);
-

fn cycle(self) -> Cycle<Self> where Self: Clone

Repeats an iterator endlessly.

- -

Instead of stopping at None, the iterator will instead start again, -from the beginning. After iterating again, it will start at the -beginning again. And again. And again. Forever.

- -

Examples

-

Basic usage:

- -
-let a = [1, 2, 3];
-
-let mut it = a.iter().cycle();
-
-assert_eq!(it.next(), Some(&1));
-assert_eq!(it.next(), Some(&2));
-assert_eq!(it.next(), Some(&3));
-assert_eq!(it.next(), Some(&1));
-assert_eq!(it.next(), Some(&2));
-assert_eq!(it.next(), Some(&3));
-assert_eq!(it.next(), Some(&1));
-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

Unstable (iter_arith)

: bounds recently changed

-

Sums the elements of an iterator.

- -

Takes each element, adds them together, and returns the result.

- -

An empty iterator returns the zero value of the type.

- -

Examples

-

Basic usage:

- -
-#![feature(iter_arith)]
-
-let a = [1, 2, 3];
-let sum: i32 = a.iter().sum();
-
-assert_eq!(sum, 6);
-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

Unstable (iter_arith)

: bounds recently changed

-

Iterates over the entire iterator, multiplying all the elements

- -

An empty iterator returns the one value of the type.

- -

Examples

-
-#![feature(iter_arith)]
-
-fn factorial(n: u32) -> u32 {
-    (1..).take_while(|&i| i <= n).product()
-}
-assert_eq!(factorial(0), 1);
-assert_eq!(factorial(1), 1);
-assert_eq!(factorial(5), 120);
-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

Lexicographically compares the elements of this Iterator with those -of another.

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

Lexicographically compares the elements of this Iterator with those -of another.

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

Determines if the elements of this Iterator are equal to those of -another.

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

Determines if the elements of this Iterator are unequal to those of -another.

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

Determines if the elements of this Iterator are lexicographically -less than those of another.

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

Determines if the elements of this Iterator are lexicographically -less or equal to those of another.

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

Determines if the elements of this Iterator are lexicographically -greater than those of another.

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

Determines if the elements of this Iterator are lexicographically -greater than or equal to those of another.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.Ord.html b/doc/bitflags/__core/prelude/v1/trait.Ord.html deleted file mode 100644 index e3c651f0..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.Ord.html +++ /dev/null @@ -1,295 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Ord - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::Ord - - [−] - - [src]

-
pub trait Ord: Eq + PartialOrd<Self> {
-    fn cmp(&self, other: &Self) -> Ordering;
-}

Trait for types that form a total order.

- -

An order is a total order if it is (for all a, b and c):

- -
    -
  • total and antisymmetric: exactly one of a < b, a == b or a > b is true; and
    • -
  • transitive, a < b and b < c implies a < c. The same must hold for both == and >.
    • -
- -

This trait can be used with #[derive]. When derived, it will produce a lexicographic -ordering based on the top-to-bottom declaration order of the struct's members.

-
-

Required Methods

-
-

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

- -

By convention, self.cmp(&other) returns the ordering matching the expression -self <operator> other if true.

- -

Examples

-
-use std::cmp::Ordering;
-
-assert_eq!(5.cmp(&10), Ordering::Less);
-assert_eq!(10.cmp(&5), Ordering::Greater);
-assert_eq!(5.cmp(&5), Ordering::Equal);
-
-

Implementors

-
    -
  • impl<A> Ord for LinkedList<A> where A: Ord
    • -
  • impl<A> Ord for VecDeque<A> where A: Ord
    • -
  • impl Ord for CString
    • -
  • impl Ord for CStr
    • -
  • impl Ord for OsString
    • -
  • impl Ord for OsStr
    • -
  • impl Ord for IpAddr
    • -
  • impl Ord for Ipv4Addr
    • -
  • impl Ord for Ipv6Addr
    • -
  • impl<'a> Ord for Prefix<'a>
    • -
  • impl<'a> Ord for PrefixComponent<'a>
    • -
  • impl<'a> Ord for Component<'a>
    • -
  • impl<'a> Ord for Components<'a>
    • -
  • impl Ord for PathBuf
    • -
  • impl Ord for Path
    • -
  • impl Ord for Duration
    • -
  • impl Ord for Instant
    • -
  • impl Ord for SystemTime
    • -
  • impl<T> Ord for Vec<T> where T: Ord
    • -
  • impl Ord for Ordering
    • -
  • impl Ord for ()
    • -
  • impl Ord for bool
    • -
  • impl Ord for char
    • -
  • impl Ord for usize
    • -
  • impl Ord for u8
    • -
  • impl Ord for u16
    • -
  • impl Ord for u32
    • -
  • impl Ord for u64
    • -
  • impl Ord for isize
    • -
  • impl Ord for i8
    • -
  • impl Ord for i16
    • -
  • impl Ord for i32
    • -
  • impl Ord for i64
    • -
  • impl<'a, A> Ord for &'a A where A: Ord + ?Sized
    • -
  • impl<'a, A> Ord for &'a mut A where A: Ord + ?Sized
    • -
  • impl<T> Ord for Box<T> where T: Ord + ?Sized
    • -
  • impl<T> Ord for PhantomData<T> where T: ?Sized
    • -
  • impl<T> Ord for Rc<T> where T: Ord + ?Sized
    • -
  • impl Ord for String
    • -
  • impl<T, E> Ord for Result<T, E> where E: Ord, T: Ord
    • -
  • impl<Ret> Ord for fn() -> Ret
    • -
  • impl<Ret> Ord for extern fn() -> Ret
    • -
  • impl<Ret> Ord for unsafe fn() -> Ret
    • -
  • impl<Ret> Ord for unsafe extern fn() -> Ret
    • -
  • impl<Ret, A> Ord for fn(A) -> Ret
    • -
  • impl<Ret, A> Ord for extern fn(A) -> Ret
    • -
  • impl<Ret, A> Ord for unsafe fn(A) -> Ret
    • -
  • impl<Ret, A> Ord for unsafe extern fn(A) -> Ret
    • -
  • impl<Ret, A, B> Ord for fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Ord for extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Ord for unsafe fn(A, B) -> Ret
    • -
  • impl<Ret, A, B> Ord for unsafe extern fn(A, B) -> Ret
    • -
  • impl<Ret, A, B, C> Ord for fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Ord for extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Ord for unsafe fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C> Ord for unsafe extern fn(A, B, C) -> Ret
    • -
  • impl<Ret, A, B, C, D> Ord for fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Ord for extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Ord for unsafe fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D> Ord for unsafe extern fn(A, B, C, D) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Ord for fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Ord for extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Ord for unsafe fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E> Ord for unsafe extern fn(A, B, C, D, E) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Ord for fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Ord for extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Ord for unsafe fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F> Ord for unsafe extern fn(A, B, C, D, E, F) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Ord for fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Ord for extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Ord for unsafe fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G> Ord for unsafe extern fn(A, B, C, D, E, F, G) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Ord for fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Ord for extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Ord for unsafe fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H> Ord for unsafe extern fn(A, B, C, D, E, F, G, H) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Ord for fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Ord for extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Ord for unsafe fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I> Ord for unsafe extern fn(A, B, C, D, E, F, G, H, I) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for unsafe fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J> Ord for unsafe extern fn(A, B, C, D, E, F, G, H, I, J) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for unsafe fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K> Ord for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for unsafe fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<Ret, A, B, C, D, E, F, G, H, I, J, K, L> Ord for unsafe extern fn(A, B, C, D, E, F, G, H, I, J, K, L) -> Ret
    • -
  • impl<T> Ord for *const T where T: ?Sized
    • -
  • impl<T> Ord for *mut T where T: ?Sized
    • -
  • impl<'a, B> Ord for Cow<'a, B> where B: Ord + ToOwned + ?Sized
    • -
  • impl<T> Ord for Option<T> where T: Ord
    • -
  • impl<T> Ord for Wrapping<T> where T: Ord
    • -
  • impl<T> Ord for NonZero<T> where T: Zeroable + Ord
    • -
  • impl<T> Ord for [T; 0] where T: Ord
    • -
  • impl<T> Ord for [T; 1] where T: Ord
    • -
  • impl<T> Ord for [T; 2] where T: Ord
    • -
  • impl<T> Ord for [T; 3] where T: Ord
    • -
  • impl<T> Ord for [T; 4] where T: Ord
    • -
  • impl<T> Ord for [T; 5] where T: Ord
    • -
  • impl<T> Ord for [T; 6] where T: Ord
    • -
  • impl<T> Ord for [T; 7] where T: Ord
    • -
  • impl<T> Ord for [T; 8] where T: Ord
    • -
  • impl<T> Ord for [T; 9] where T: Ord
    • -
  • impl<T> Ord for [T; 10] where T: Ord
    • -
  • impl<T> Ord for [T; 11] where T: Ord
    • -
  • impl<T> Ord for [T; 12] where T: Ord
    • -
  • impl<T> Ord for [T; 13] where T: Ord
    • -
  • impl<T> Ord for [T; 14] where T: Ord
    • -
  • impl<T> Ord for [T; 15] where T: Ord
    • -
  • impl<T> Ord for [T; 16] where T: Ord
    • -
  • impl<T> Ord for [T; 17] where T: Ord
    • -
  • impl<T> Ord for [T; 18] where T: Ord
    • -
  • impl<T> Ord for [T; 19] where T: Ord
    • -
  • impl<T> Ord for [T; 20] where T: Ord
    • -
  • impl<T> Ord for [T; 21] where T: Ord
    • -
  • impl<T> Ord for [T; 22] where T: Ord
    • -
  • impl<T> Ord for [T; 23] where T: Ord
    • -
  • impl<T> Ord for [T; 24] where T: Ord
    • -
  • impl<T> Ord for [T; 25] where T: Ord
    • -
  • impl<T> Ord for [T; 26] where T: Ord
    • -
  • impl<T> Ord for [T; 27] where T: Ord
    • -
  • impl<T> Ord for [T; 28] where T: Ord
    • -
  • impl<T> Ord for [T; 29] where T: Ord
    • -
  • impl<T> Ord for [T; 30] where T: Ord
    • -
  • impl<T> Ord for [T; 31] where T: Ord
    • -
  • impl<T> Ord for [T; 32] where T: Ord
    • -
  • impl<T> Ord for [T] where T: Ord
    • -
  • impl Ord for str
    • -
  • impl Ord for Error
    • -
  • impl<A> Ord for (A,) where A: Ord
    • -
  • impl<A, B> Ord for (A, B) where B: Ord, A: Ord
    • -
  • impl<A, B, C> Ord for (A, B, C) where C: Ord, A: Ord, B: Ord
    • -
  • impl<A, B, C, D> Ord for (A, B, C, D) where D: Ord, C: Ord, A: Ord, B: Ord
    • -
  • impl<A, B, C, D, E> Ord for (A, B, C, D, E) where A: Ord, E: Ord, D: Ord, C: Ord, B: Ord
    • -
  • impl<A, B, C, D, E, F> Ord for (A, B, C, D, E, F) where A: Ord, C: Ord, D: Ord, B: Ord, F: Ord, E: Ord
    • -
  • impl<A, B, C, D, E, F, G> Ord for (A, B, C, D, E, F, G) where B: Ord, A: Ord, F: Ord, D: Ord, G: Ord, E: Ord, C: Ord
    • -
  • impl<A, B, C, D, E, F, G, H> Ord for (A, B, C, D, E, F, G, H) where G: Ord, H: Ord, D: Ord, F: Ord, C: Ord, E: Ord, A: Ord, B: Ord
    • -
  • impl<A, B, C, D, E, F, G, H, I> Ord for (A, B, C, D, E, F, G, H, I) where G: Ord, C: Ord, B: Ord, H: Ord, A: Ord, F: Ord, I: Ord, E: Ord, D: Ord
    • -
  • impl<A, B, C, D, E, F, G, H, I, J> Ord for (A, B, C, D, E, F, G, H, I, J) where C: Ord, E: Ord, D: Ord, J: Ord, I: Ord, A: Ord, B: Ord, F: Ord, G: Ord, H: Ord
    • -
  • impl<A, B, C, D, E, F, G, H, I, J, K> Ord for (A, B, C, D, E, F, G, H, I, J, K) where D: Ord, J: Ord, C: Ord, G: Ord, F: Ord, I: Ord, E: Ord, A: Ord, B: Ord, K: Ord, H: Ord
    • -
  • impl<A, B, C, D, E, F, G, H, I, J, K, L> Ord for (A, B, C, D, E, F, G, H, I, J, K, L) where H: Ord, A: Ord, I: Ord, G: Ord, D: Ord, B: Ord, E: Ord, L: Ord, J: Ord, C: Ord, F: Ord, K: Ord
    • -
  • impl<K, V> Ord for BTreeMap<K, V> where K: Ord, V: Ord
    • -
  • impl<T> Ord for BTreeSet<T> where T: Ord
    • -
  • impl<E> Ord for EnumSet<E> where E: Ord
    • -
  • impl<T> Ord for Arc<T> where T: Ord + ?Sized
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.PartialEq.html b/doc/bitflags/__core/prelude/v1/trait.PartialEq.html deleted file mode 100644 index 0c0f20a5..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.PartialEq.html +++ /dev/null @@ -1,690 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::PartialEq - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::PartialEq - - [−] - - [src]

-
pub trait PartialEq<Rhs = Self> where Rhs: ?Sized {
-    fn eq(&self, other: &Rhs) -> bool;
-
-    fn ne(&self, other: &Rhs) -> bool { ... }
-}

Trait for equality comparisons which are partial equivalence -relations.

- -

This trait allows for partial equality, for types that do not have a full -equivalence relation. For example, in floating point numbers NaN != NaN, -so floating point types implement PartialEq but not Eq.

- -

Formally, the equality must be (for all a, b and c):

- -
    -
  • symmetric: a == b implies b == a; and
    • -
  • transitive: a == b and b == c implies a == c.
    • -
- -

Note that these requirements mean that the trait itself must be implemented -symmetrically and transitively: if T: PartialEq<U> and U: PartialEq<V> -then U: PartialEq<T> and T: PartialEq<V>.

- -

PartialEq only requires the eq method to be implemented; ne is defined -in terms of it by default. Any manual implementation of ne must respect -the rule that eq is a strict inverse of ne; that is, !(a == b) if and -only if a != b.

- -

This trait can be used with #[derive].

- -

Examples

-
-let x: u32 = 0;
-let y: u32 = 1;
-
-assert_eq!(x == y, false);
-assert_eq!(x.eq(&y), false);
-
-

Required Methods

-
-

fn eq(&self, other: &Rhs) -> bool

This method tests for self and other values to be equal, and is used -by ==.

-
-

Provided Methods

-
-

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.PartialOrd.html b/doc/bitflags/__core/prelude/v1/trait.PartialOrd.html deleted file mode 100644 index c77bb10a..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.PartialOrd.html +++ /dev/null @@ -1,418 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::PartialOrd - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::PartialOrd - - [−] - - [src]

-
pub trait PartialOrd<Rhs = Self>: PartialEq<Rhs> where Rhs: ?Sized {
-    fn partial_cmp(&self, other: &Rhs) -> Option<Ordering>;
-
-    fn lt(&self, other: &Rhs) -> bool { ... }
-    fn le(&self, other: &Rhs) -> bool { ... }
-    fn gt(&self, other: &Rhs) -> bool { ... }
-    fn ge(&self, other: &Rhs) -> bool { ... }
-}

Trait for values that can be compared for a sort-order.

- -

The comparison must satisfy, for all a, b and c:

- -
    -
  • antisymmetry: if a < b then !(a > b), as well as a > b implying !(a < b); and
    • -
  • transitivity: a < b and b < c implies a < c. The same must hold for both == and >.
    • -
- -

Note that these requirements mean that the trait itself must be implemented symmetrically and -transitively: if T: PartialOrd<U> and U: PartialOrd<V> then U: PartialOrd<T> and T: PartialOrd<V>.

- -

PartialOrd only requires implementation of the partial_cmp method, with the others generated -from default implementations.

- -

However it remains possible to implement the others separately for types which do not have a -total order. For example, for floating point numbers, NaN < 0 == false and NaN >= 0 == false (cf. IEEE 754-2008 section 5.11).

- -

This trait can be used with #[derive]. When derived, it will produce an ordering -based on the top-to-bottom declaration order of the struct's members.

- -

Examples

-
-let x : u32 = 0;
-let y : u32 = 1;
-
-assert_eq!(x < y, true);
-assert_eq!(x.lt(&y), true);
-
-

Required Methods

-
-

fn partial_cmp(&self, other: &Rhs) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

- -

Examples

-
-use std::cmp::Ordering;
-
-let result = 1.0.partial_cmp(&2.0);
-assert_eq!(result, Some(Ordering::Less));
-
-let result = 1.0.partial_cmp(&1.0);
-assert_eq!(result, Some(Ordering::Equal));
-
-let result = 2.0.partial_cmp(&1.0);
-assert_eq!(result, Some(Ordering::Greater));
- -

When comparison is impossible:

- -
-let result = std::f64::NAN.partial_cmp(&1.0);
-assert_eq!(result, None);
-
-

Provided Methods

-
-

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

- -

Examples

-
-let result = 1.0 < 2.0;
-assert_eq!(result, true);
-
-let result = 2.0 < 1.0;
-assert_eq!(result, false);
-

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= -operator.

- -

Examples

-
-let result = 1.0 <= 2.0;
-assert_eq!(result, true);
-
-let result = 2.0 <= 2.0;
-assert_eq!(result, true);
-

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

- -

Examples

-
-let result = 1.0 > 2.0;
-assert_eq!(result, false);
-
-let result = 2.0 > 2.0;
-assert_eq!(result, false);
-

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= -operator.

- -

Examples

-
-let result = 2.0 >= 1.0;
-assert_eq!(result, true);
-
-let result = 2.0 >= 2.0;
-assert_eq!(result, true);
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.Send.html b/doc/bitflags/__core/prelude/v1/trait.Send.html deleted file mode 100644 index 388726e2..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.Send.html +++ /dev/null @@ -1,149 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Send - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::Send - - [−] - - [src]

-
pub unsafe trait Send { }

Types that can be transferred across thread boundaries.

- -

This trait is automatically derived when the compiler determines it's appropriate.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.Sized.html b/doc/bitflags/__core/prelude/v1/trait.Sized.html deleted file mode 100644 index 2f9ec837..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.Sized.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Sized - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::Sized - - [−] - - [src]

-
pub trait Sized { }

Types with a constant size known at compile-time.

- -

All type parameters which can be bounded have an implicit bound of Sized. The special syntax -?Sized can be used to remove this bound if it is not appropriate.

- -
-struct Foo<T>(T);
-struct Bar<T: ?Sized>(T);
-
-// struct FooUse(Foo<[i32]>); // error: Sized is not implemented for [i32]
-struct BarUse(Bar<[i32]>); // OK
-
-

Implementors

-
    -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.SliceConcatExt.html b/doc/bitflags/__core/prelude/v1/trait.SliceConcatExt.html deleted file mode 100644 index 76251560..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.SliceConcatExt.html +++ /dev/null @@ -1,146 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::SliceConcatExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::SliceConcatExt - - [−] - - [src]

-
pub trait SliceConcatExt<T> where T: ?Sized {
-    type Output;
-    fn concat(&self) -> Self::Output;
-    fn join(&self, sep: &T) -> Self::Output;
-    fn connect(&self, sep: &T) -> Self::Output;
-}
Unstable (slice_concat_ext)

: trait should not have to exist

-

An extension trait for concatenating slices

-
-

Associated Types

-
-

type Output

Unstable (slice_concat_ext)

: trait should not have to exist

-

The resulting type after concatenation

-
-

Required Methods

-
-

fn concat(&self) -> Self::Output1.0.0

Flattens a slice of T into a single value Self::Output.

- -

Examples

-
-assert_eq!(["hello", "world"].concat(), "helloworld");
-

fn join(&self, sep: &T) -> Self::Output1.3.0

Flattens a slice of T into a single value Self::Output, placing a -given separator between each.

- -

Examples

-
-assert_eq!(["hello", "world"].join(" "), "hello world");
-

fn connect(&self, sep: &T) -> Self::Output1.0.0

Deprecated since 1.3.0

: renamed to join

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.Sync.html b/doc/bitflags/__core/prelude/v1/trait.Sync.html deleted file mode 100644 index ad16f4a6..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.Sync.html +++ /dev/null @@ -1,190 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::Sync - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::Sync - - [−] - - [src]

-
pub unsafe trait Sync { }

Types that can be safely shared between threads when aliased.

- -

The precise definition is: a type T is Sync if &T is -thread-safe. In other words, there is no possibility of data races -when passing &T references between threads.

- -

As one would expect, primitive types like u8 and f64 are all -Sync, and so are simple aggregate types containing them (like -tuples, structs and enums). More instances of basic Sync types -include "immutable" types like &T and those with simple -inherited mutability, such as Box<T>, Vec<T> and most other -collection types. (Generic parameters need to be Sync for their -container to be Sync.)

- -

A somewhat surprising consequence of the definition is &mut T is -Sync (if T is Sync) even though it seems that it might -provide unsynchronized mutation. The trick is a mutable reference -stored in an aliasable reference (that is, & &mut T) becomes -read-only, as if it were a & &T, hence there is no risk of a data -race.

- -

Types that are not Sync are those that have "interior -mutability" in a non-thread-safe way, such as Cell and RefCell -in std::cell. These types allow for mutation of their contents -even when in an immutable, aliasable slot, e.g. the contents of -&Cell<T> can be .set, and do not ensure data races are -impossible, hence they cannot be Sync. A higher level example -of a non-Sync type is the reference counted pointer -std::rc::Rc, because any reference &Rc<T> can clone a new -reference, which modifies the reference counts in a non-atomic -way.

- -

For cases when one does need thread-safe interior mutability, -types like the atomics in std::sync and Mutex & RWLock in -the sync crate do ensure that any mutation cannot cause data -races. Hence these types are Sync.

- -

Any types with interior mutability must also use the std::cell::UnsafeCell -wrapper around the value(s) which can be mutated when behind a & -reference; not doing this is undefined behavior (for example, -transmute-ing from &T to &mut T is invalid).

- -

This trait is automatically derived when the compiler determines it's appropriate.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.ToOwned.html b/doc/bitflags/__core/prelude/v1/trait.ToOwned.html deleted file mode 100644 index 43844861..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.ToOwned.html +++ /dev/null @@ -1,149 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::ToOwned - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::ToOwned - - [−] - - [src]

-
pub trait ToOwned {
-    type Owned: Borrow<Self>;
-    fn to_owned(&self) -> Self::Owned;
-}

A generalization of Clone to borrowed data.

- -

Some types make it possible to go from borrowed to owned, usually by -implementing the Clone trait. But Clone works only for going from &T -to T. The ToOwned trait generalizes Clone to construct owned data -from any borrow of a given type.

-
-

Associated Types

-
-

type Owned: Borrow<Self>

-

Required Methods

-
-

fn to_owned(&self) -> Self::Owned

Creates owned data from borrowed data, usually by cloning.

- -

Examples

-

Basic usage:

- -
-let s = "a"; // &str
-let ss = s.to_owned(); // String
-
-let v = &[1, 2]; // slice
-let vv = v.to_owned(); // Vec
-
-

Implementors

-
    -
  • impl ToOwned for CStr
    • -
  • impl ToOwned for OsStr
    • -
  • impl ToOwned for Path
    • -
  • impl ToOwned for str
    • -
  • impl<T> ToOwned for T where T: Clone
    • -
  • impl<T> ToOwned for [T] where T: Clone
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/prelude/v1/trait.ToString.html b/doc/bitflags/__core/prelude/v1/trait.ToString.html deleted file mode 100644 index a08958b7..00000000 --- a/doc/bitflags/__core/prelude/v1/trait.ToString.html +++ /dev/null @@ -1,140 +0,0 @@ - - - - - - - - - - bitflags::__core::prelude::v1::ToString - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::prelude::v1::ToString - - [−] - - [src]

-
pub trait ToString {
-    fn to_string(&self) -> String;
-}

A trait for converting a value to a String.

- -

This trait is automatically implemented for any type which implements the -Display trait. As such, ToString shouldn't be implemented directly: -Display should be implemented instead, and you get the ToString -implementation for free.

-
-

Required Methods

-
-

fn to_string(&self) -> String

Converts the given value to a String.

- -

Examples

-

Basic usage:

- -
-let i = 5;
-let five = String::from("5");
-
-assert_eq!(five, i.to_string());
-
-

Implementors

-
    -
  • impl<T> ToString for T where T: Display + ?Sized
    • -
  • impl ToString for str
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/process/fn.exit.html b/doc/bitflags/__core/process/fn.exit.html deleted file mode 100644 index 28e42086..00000000 --- a/doc/bitflags/__core/process/fn.exit.html +++ /dev/null @@ -1,123 +0,0 @@ - - - - - - - - - - bitflags::__core::process::exit - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::process::exit - - [−] - - [src]

-
pub fn exit(code: i32) -> !
1.0.0

Terminates the current process with the specified exit code.

- -

This function will never return and will immediately terminate the current -process. The exit code is passed through to the underlying OS and will be -available for consumption by another process.

- -

Note that because this function never returns, and that it terminates the -process, no destructors on the current stack or any other thread's stack -will be run. If a clean shutdown is needed it is recommended to only call -this function at a known point where there are no more destructors left -to run.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/process/index.html b/doc/bitflags/__core/process/index.html deleted file mode 100644 index 67953fea..00000000 --- a/doc/bitflags/__core/process/index.html +++ /dev/null @@ -1,182 +0,0 @@ - - - - - - - - - - bitflags::__core::process - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::process - - [−] - - [src]

-

Working with processes.

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Child -

Representation of a running or exited child process.

-
ChildStderr -

A handle to a child process's stderr

-
ChildStdin -

A handle to a child process's stdin

-
ChildStdout -

A handle to a child process's stdout

-
Command -

The Command type acts as a process builder, providing fine-grained control -over how a new process should be spawned. A default configuration can be -generated using Command::new(program), where program gives a path to the -program to be executed. Additional builder methods allow the configuration -to be changed (for example, by adding arguments) prior to spawning:

-
ExitStatus -

Describes the result of a process after it has terminated.

-
Output -

The output of a finished process.

-
Stdio -

Describes what to do with a standard I/O stream for a child process.

-

Functions

- - - - -
exit -

Terminates the current process with the specified exit code.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/process/sidebar-items.js b/doc/bitflags/__core/process/sidebar-items.js deleted file mode 100644 index 268a3b61..00000000 --- a/doc/bitflags/__core/process/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["exit","Terminates the current process with the specified exit code."]],"struct":[["Child","Representation of a running or exited child process."],["ChildStderr","A handle to a child process's stderr"],["ChildStdin","A handle to a child process's stdin"],["ChildStdout","A handle to a child process's stdout"],["Command","The `Command` type acts as a process builder, providing fine-grained control over how a new process should be spawned. A default configuration can be generated using `Command::new(program)`, where `program` gives a path to the program to be executed. Additional builder methods allow the configuration to be changed (for example, by adding arguments) prior to spawning:"],["ExitStatus","Describes the result of a process after it has terminated."],["Output","The output of a finished process."],["Stdio","Describes what to do with a standard I/O stream for a child process."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/process/struct.Child.html b/doc/bitflags/__core/process/struct.Child.html deleted file mode 100644 index 630fb855..00000000 --- a/doc/bitflags/__core/process/struct.Child.html +++ /dev/null @@ -1,195 +0,0 @@ - - - - - - - - - - bitflags::__core::process::Child - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::process::Child - - [−] - - [src]

-
pub struct Child {
-    pub stdin: Option<ChildStdin>,
-    pub stdout: Option<ChildStdout>,
-    pub stderr: Option<ChildStderr>,
-    // some fields omitted
-}
1.0.0

Representation of a running or exited child process.

- -

This structure is used to represent and manage child processes. A child -process is created via the Command struct, which configures the spawning -process and can itself be constructed using a builder-style interface.

- -

Examples

-
-use std::process::Command;
-
-let mut child = Command::new("/bin/cat")
-                        .arg("file.txt")
-                        .spawn()
-                        .expect("failed to execute child");
-
-let ecode = child.wait()
-                 .expect("failed to wait on child");
-
-assert!(ecode.success());
- -

Note

-

Take note that there is no implementation of -Drop for child processes, so if you -do not ensure the Child has exited then it will continue to run, even -after the Child handle to the child process has gone out of scope.

- -

Calling wait (or other functions that wrap around it) will make the -parent process wait until the child has actually exited before continuing.

-

Fields

- - - -
stdin

The handle for writing to the child's stdin, if it has been captured

-
stdout

The handle for reading from the child's stdout, if it has been captured

-
stderr

The handle for reading from the child's stderr, if it has been captured

-

Methods

impl Child

fn kill(&mut self) -> Result<(), Error>

-

Forces the child to exit. This is equivalent to sending a -SIGKILL on unix platforms.

-

fn id(&self) -> u321.3.0

-

Returns the OS-assigned process identifier associated with this child.

-

fn wait(&mut self) -> Result<ExitStatus, Error>

-

Waits for the child to exit completely, returning the status that it -exited with. This function will continue to have the same return value -after it has been called at least once.

- -

The stdin handle to the child process, if any, will be closed -before waiting. This helps avoid deadlock: it ensures that the -child does not block waiting for input from the parent, while -the parent waits for the child to exit.

-

fn wait_with_output(self) -> Result<Output, Error>

-

Simultaneously waits for the child to exit and collect all remaining -output on the stdout/stderr handles, returning an Output -instance.

- -

The stdin handle to the child process, if any, will be closed -before waiting. This helps avoid deadlock: it ensures that the -child does not block waiting for input from the parent, while -the parent waits for the child to exit.

- -

By default, stdin, stdout and stderr are inherited from the parent. -In order to capture the output into this Result<Output> it is -necessary to create new pipes between parent and child. Use -stdout(Stdio::piped()) or stderr(Stdio::piped()), respectively.

- -

Examples

-
-use std::process::{Command, Stdio};
-
-let mut child = Command::new("/bin/cat")
-                        .arg("file.txt")
-                        .stdout(Stdio::piped())
-                        .spawn()
-                        .expect("failed to execute child");
-
-let ecode = child.wait_with_output()
-                 .expect("failed to wait on child");
-
-assert!(ecode.status.success());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/process/struct.ChildStderr.html b/doc/bitflags/__core/process/struct.ChildStderr.html deleted file mode 100644 index cf9d72f3..00000000 --- a/doc/bitflags/__core/process/struct.ChildStderr.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::process::ChildStderr - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::process::ChildStderr - - [−] - - [src]

-
pub struct ChildStderr {
-    // some fields omitted
-}
1.0.0

A handle to a child process's stderr

-

Trait Implementations

impl AsRawFd for ChildStderr1.2.0

fn as_raw_fd(&self) -> i32

-

impl IntoRawFd for ChildStderr1.2.0

fn into_raw_fd(self) -> i32

-

impl Read for ChildStderr

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/process/struct.ChildStdin.html b/doc/bitflags/__core/process/struct.ChildStdin.html deleted file mode 100644 index f03f1e46..00000000 --- a/doc/bitflags/__core/process/struct.ChildStdin.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - bitflags::__core::process::ChildStdin - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::process::ChildStdin - - [−] - - [src]

-
pub struct ChildStdin {
-    // some fields omitted
-}
1.0.0

A handle to a child process's stdin

-

Trait Implementations

impl AsRawFd for ChildStdin1.2.0

fn as_raw_fd(&self) -> i32

-

impl IntoRawFd for ChildStdin1.2.0

fn into_raw_fd(self) -> i32

-

impl Write for ChildStdin

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/process/struct.ChildStdout.html b/doc/bitflags/__core/process/struct.ChildStdout.html deleted file mode 100644 index 0174427a..00000000 --- a/doc/bitflags/__core/process/struct.ChildStdout.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::process::ChildStdout - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::process::ChildStdout - - [−] - - [src]

-
pub struct ChildStdout {
-    // some fields omitted
-}
1.0.0

A handle to a child process's stdout

-

Trait Implementations

impl AsRawFd for ChildStdout1.2.0

fn as_raw_fd(&self) -> i32

-

impl IntoRawFd for ChildStdout1.2.0

fn into_raw_fd(self) -> i32

-

impl Read for ChildStdout

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

-

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

-

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

-

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>1.6.0

-

fn by_ref(&mut self) -> &mut Self

-

fn bytes(self) -> Bytes<Self>

-

fn chars(self) -> Chars<Self>

-

fn chain<R>(self, next: R) -> Chain<Self, R> where R: Read

-

fn take(self, limit: u64) -> Take<Self>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/process/struct.Command.html b/doc/bitflags/__core/process/struct.Command.html deleted file mode 100644 index 1a12f596..00000000 --- a/doc/bitflags/__core/process/struct.Command.html +++ /dev/null @@ -1,211 +0,0 @@ - - - - - - - - - - bitflags::__core::process::Command - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::process::Command - - [−] - - [src]

-
pub struct Command {
-    // some fields omitted
-}
1.0.0

The Command type acts as a process builder, providing fine-grained control -over how a new process should be spawned. A default configuration can be -generated using Command::new(program), where program gives a path to the -program to be executed. Additional builder methods allow the configuration -to be changed (for example, by adding arguments) prior to spawning:

- -
-use std::process::Command;
-
-let output = Command::new("sh")
-                     .arg("-c")
-                     .arg("echo hello")
-                     .output()
-                     .expect("failed to execute proces");
-
-let hello = output.stdout;
-

Methods

impl Command

fn new<S>(program: S) -> Command where S: AsRef<OsStr>

-

Constructs a new Command for launching the program at -path program, with the following default configuration:

- -
    -
  • No arguments to the program
    • -
  • Inherit the current process's environment
    • -
  • Inherit the current process's working directory
    • -
  • Inherit stdin/stdout/stderr for spawn or status, but create pipes for output
    • -
- -

Builder methods are provided to change these defaults and -otherwise configure the process.

-

fn arg<S>(&mut self, arg: S) -> &mut Command where S: AsRef<OsStr>

-

Add an argument to pass to the program.

-

fn args<S>(&mut self, args: &[S]) -> &mut Command where S: AsRef<OsStr>

-

Add multiple arguments to pass to the program.

-

fn env<K, V>(&mut self, key: K, val: V) -> &mut Command where V: AsRef<OsStr>, K: AsRef<OsStr>

-

Inserts or updates an environment variable mapping.

- -

Note that environment variable names are case-insensitive (but case-preserving) on Windows, -and case-sensitive on all other platforms.

-

fn env_remove<K>(&mut self, key: K) -> &mut Command where K: AsRef<OsStr>

-

Removes an environment variable mapping.

-

fn env_clear(&mut self) -> &mut Command

-

Clears the entire environment map for the child process.

-

fn current_dir<P>(&mut self, dir: P) -> &mut Command where P: AsRef<Path>

-

Sets the working directory for the child process.

-

fn stdin(&mut self, cfg: Stdio) -> &mut Command

-

Configuration for the child process's stdin handle (file descriptor 0).

-

fn stdout(&mut self, cfg: Stdio) -> &mut Command

-

Configuration for the child process's stdout handle (file descriptor 1).

-

fn stderr(&mut self, cfg: Stdio) -> &mut Command

-

Configuration for the child process's stderr handle (file descriptor 2).

-

fn spawn(&mut self) -> Result<Child, Error>

-

Executes the command as a child process, returning a handle to it.

- -

By default, stdin, stdout and stderr are inherited from the parent.

-

fn output(&mut self) -> Result<Output, Error>

-

Executes the command as a child process, waiting for it to finish and -collecting all of its output.

- -

By default, stdin, stdout and stderr are captured (and used to -provide the resulting output).

- -

Examples

-
-use std::process::Command;
-let output = Command::new("/bin/cat").arg("file.txt").output()
-    .expect("failed to execute process");
-
-println!("status: {}", output.status);
-println!("stdout: {}", String::from_utf8_lossy(&output.stdout));
-println!("stderr: {}", String::from_utf8_lossy(&output.stderr));
-
-assert!(output.status.success());
-

fn status(&mut self) -> Result<ExitStatus, Error>

-

Executes a command as a child process, waiting for it to finish and -collecting its exit status.

- -

By default, stdin, stdout and stderr are inherited from the parent.

- -

Examples

-
-use std::process::Command;
-
-let status = Command::new("/bin/cat").arg("file.txt").status()
-    .expect("failed to execute process");
-
-println!("process exited with: {}", status);
-
-assert!(status.success());
-

Trait Implementations

impl CommandExt for Command

fn uid(&mut self, id: u32) -> &mut Command

-

fn gid(&mut self, id: u32) -> &mut Command

-

fn session_leader(&mut self, on: bool) -> &mut Command

-

fn before_exec<F>(&mut self, f: F) -> &mut Command where F: FnMut() -> Result<(), Error> + Send + Sync + 'static

-

fn exec(&mut self) -> Error

-

impl Debug for Command

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Format the program and arguments of a Command for display. Any -non-utf8 data is lossily converted using the utf8 replacement -character.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/process/struct.ExitStatus.html b/doc/bitflags/__core/process/struct.ExitStatus.html deleted file mode 100644 index 4a12cb19..00000000 --- a/doc/bitflags/__core/process/struct.ExitStatus.html +++ /dev/null @@ -1,129 +0,0 @@ - - - - - - - - - - bitflags::__core::process::ExitStatus - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::process::ExitStatus - - [−] - - [src]

-
pub struct ExitStatus(_);
1.0.0

Describes the result of a process after it has terminated.

-

Methods

impl ExitStatus

fn success(&self) -> bool

-

Was termination successful? Signal termination not considered a success, -and success is defined as a zero exit status.

-

fn code(&self) -> Option<i32>

-

Returns the exit code of the process, if any.

- -

On Unix, this will return None if the process was terminated -by a signal; std::os::unix provides an extension trait for -extracting the signal and other details from the ExitStatus.

-

Trait Implementations

impl ExitStatusExt for ExitStatus

fn signal(&self) -> Option<i32>

-

impl Display for ExitStatus

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl Debug for ExitStatus

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl Copy for ExitStatus

impl Clone for ExitStatus

fn clone(&self) -> ExitStatus

-

fn clone_from(&mut self, source: &Self)

-

impl Eq for ExitStatus

impl PartialEq<ExitStatus> for ExitStatus

fn eq(&self, __arg_0: &ExitStatus) -> bool

-

fn ne(&self, __arg_0: &ExitStatus) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/process/struct.Output.html b/doc/bitflags/__core/process/struct.Output.html deleted file mode 100644 index 9a703cd5..00000000 --- a/doc/bitflags/__core/process/struct.Output.html +++ /dev/null @@ -1,129 +0,0 @@ - - - - - - - - - - bitflags::__core::process::Output - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::process::Output - - [−] - - [src]

-
pub struct Output {
-    pub status: ExitStatus,
-    pub stdout: Vec<u8>,
-    pub stderr: Vec<u8>,
-}
1.0.0

The output of a finished process.

-

Fields

- - - -
status

The status (exit code) of the process.

-
stdout

The data that the process wrote to stdout.

-
stderr

The data that the process wrote to stderr.

-

Trait Implementations

impl Debug for Output1.7.0

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl Clone for Output

fn clone(&self) -> Output

-

fn clone_from(&mut self, source: &Self)

-

impl Eq for Output

impl PartialEq<Output> for Output

fn eq(&self, __arg_0: &Output) -> bool

-

fn ne(&self, __arg_0: &Output) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/process/struct.Stdio.html b/doc/bitflags/__core/process/struct.Stdio.html deleted file mode 100644 index db0c8c57..00000000 --- a/doc/bitflags/__core/process/struct.Stdio.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - - - - bitflags::__core::process::Stdio - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::process::Stdio - - [−] - - [src]

-
pub struct Stdio(_);
1.0.0

Describes what to do with a standard I/O stream for a child process.

-

Methods

impl Stdio

fn piped() -> Stdio

-

A new pipe should be arranged to connect the parent and child processes.

-

fn inherit() -> Stdio

-

The child inherits from the corresponding parent descriptor.

-

fn null() -> Stdio

-

This stream will be ignored. This is the equivalent of attaching the -stream to /dev/null

-

Trait Implementations

impl FromRawFd for Stdio1.2.0

unsafe fn from_raw_fd(fd: i32) -> Stdio

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/fn.copy.html b/doc/bitflags/__core/ptr/fn.copy.html deleted file mode 100644 index 3717a548..00000000 --- a/doc/bitflags/__core/ptr/fn.copy.html +++ /dev/null @@ -1,135 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr::copy - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::ptr::copy - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn copy<T>(src: *const T, dst: *mut T, count: usize)
1.0.0

Copies count * size_of<T> bytes from src to dst. The source -and destination may overlap.

- -

copy is semantically equivalent to C's memmove.

- -

Safety

-

Care must be taken with the ownership of src and dst. -This method semantically moves the values of src into dst. -However it does not drop the contents of dst, or prevent the contents of src -from being dropped or used.

- -

Examples

-

Efficiently create a Rust vector from an unsafe buffer:

- -
-use std::ptr;
-
-unsafe fn from_buf_raw<T>(ptr: *const T, elts: usize) -> Vec<T> {
-    let mut dst = Vec::with_capacity(elts);
-    dst.set_len(elts);
-    ptr::copy(ptr, dst.as_mut_ptr(), elts);
-    dst
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/fn.copy_nonoverlapping.html b/doc/bitflags/__core/ptr/fn.copy_nonoverlapping.html deleted file mode 100644 index 8b0af5ae..00000000 --- a/doc/bitflags/__core/ptr/fn.copy_nonoverlapping.html +++ /dev/null @@ -1,147 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr::copy_nonoverlapping - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::ptr::copy_nonoverlapping - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn copy_nonoverlapping<T>(src: *const T, dst: *mut T, count: usize)
1.0.0

Copies count * size_of<T> bytes from src to dst. The source -and destination may not overlap.

- -

copy_nonoverlapping is semantically equivalent to C's memcpy.

- -

Safety

-

Beyond requiring that the program must be allowed to access both regions -of memory, it is Undefined Behavior for source and destination to -overlap. Care must also be taken with the ownership of src and -dst. This method semantically moves the values of src into dst. -However it does not drop the contents of dst, or prevent the contents -of src from being dropped or used.

- -

Examples

-

A safe swap function:

- -
-use std::mem;
-use std::ptr;
-
-fn swap<T>(x: &mut T, y: &mut T) {
-    unsafe {
-        // Give ourselves some scratch space to work with
-        let mut t: T = mem::uninitialized();
-
-        // Perform the swap, `&mut` pointers never alias
-        ptr::copy_nonoverlapping(x, &mut t, 1);
-        ptr::copy_nonoverlapping(y, x, 1);
-        ptr::copy_nonoverlapping(&t, y, 1);
-
-        // y and t now point to the same thing, but we need to completely forget `tmp`
-        // because it's no longer relevant.
-        mem::forget(t);
-    }
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/fn.drop_in_place.html b/doc/bitflags/__core/ptr/fn.drop_in_place.html deleted file mode 100644 index 0aabcf6e..00000000 --- a/doc/bitflags/__core/ptr/fn.drop_in_place.html +++ /dev/null @@ -1,129 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr::drop_in_place - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::ptr::drop_in_place - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn drop_in_place<T>(to_drop: *mut T) where T: ?Sized
1.8.0

Executes the destructor (if any) of the pointed-to value.

- -

This has two use cases:

- -
    -

  • It is required to use drop_in_place to drop unsized types like -trait objects, because they can't be read out onto the stack and -dropped normally.

    • -

  • It is friendlier to the optimizer to do this over ptr::read when -dropping manually allocated memory (e.g. when writing Box/Rc/Vec), -as the compiler doesn't need to prove that it's sound to elide the -copy.

    • -
- -

Undefined Behavior

-

This has all the same safety problems as ptr::read with respect to -invalid pointers, types, and double drops.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/fn.null.html b/doc/bitflags/__core/ptr/fn.null.html deleted file mode 100644 index 1906d7eb..00000000 --- a/doc/bitflags/__core/ptr/fn.null.html +++ /dev/null @@ -1,120 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr::null - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::ptr::null - - [−] - - [src]

-
pub const fn null<T>() -> *const T
1.0.0

Creates a null raw pointer.

- -

Examples

-
-use std::ptr;
-
-let p: *const i32 = ptr::null();
-assert!(p.is_null());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/fn.null_mut.html b/doc/bitflags/__core/ptr/fn.null_mut.html deleted file mode 100644 index 2c8da098..00000000 --- a/doc/bitflags/__core/ptr/fn.null_mut.html +++ /dev/null @@ -1,120 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr::null_mut - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::ptr::null_mut - - [−] - - [src]

-
pub const fn null_mut<T>() -> *mut T
1.0.0

Creates a null mutable raw pointer.

- -

Examples

-
-use std::ptr;
-
-let p: *mut i32 = ptr::null_mut();
-assert!(p.is_null());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/fn.read.html b/doc/bitflags/__core/ptr/fn.read.html deleted file mode 100644 index 3f61e10b..00000000 --- a/doc/bitflags/__core/ptr/fn.read.html +++ /dev/null @@ -1,131 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr::read - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::ptr::read - - [−] - - [src]

-
pub unsafe fn read<T>(src: *const T) -> T
1.0.0

Reads the value from src without moving it. This leaves the -memory in src unchanged.

- -

Safety

-

Beyond accepting a raw pointer, this is unsafe because it semantically -moves the value out of src without preventing further usage of src. -If T is not Copy, then care must be taken to ensure that the value at -src is not used before the data is overwritten again (e.g. with write, -zero_memory, or copy_memory). Note that *src = foo counts as a use -because it will attempt to drop the value previously at *src.

- -

Examples

-

Basic usage:

- -
-let x = 12;
-let y = &x as *const i32;
-
-unsafe { println!("{}", std::ptr::read(y)); }
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/fn.read_and_drop.html b/doc/bitflags/__core/ptr/fn.read_and_drop.html deleted file mode 100644 index a997ea45..00000000 --- a/doc/bitflags/__core/ptr/fn.read_and_drop.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr::read_and_drop - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::ptr::read_and_drop - - [−] - - [src]

-
pub unsafe fn read_and_drop<T>(dest: *mut T) -> T
Unstable (filling_drop)

: may play a larger role in std::ptr future extensions

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/fn.read_volatile.html b/doc/bitflags/__core/ptr/fn.read_volatile.html deleted file mode 100644 index 92f3302a..00000000 --- a/doc/bitflags/__core/ptr/fn.read_volatile.html +++ /dev/null @@ -1,141 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr::read_volatile - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::ptr::read_volatile - - [−] - - [src]

-
pub unsafe fn read_volatile<T>(src: *const T) -> T
1.9.0

Performs a volatile read of the value from src without moving it. This -leaves the memory in src unchanged.

- -

Volatile operations are intended to act on I/O memory, and are guaranteed -to not be elided or reordered by the compiler across other volatile -operations.

- -

Notes

-

Rust does not currently have a rigorously and formally defined memory model, -so the precise semantics of what "volatile" means here is subject to change -over time. That being said, the semantics will almost always end up pretty -similar to C11's definition of volatile.

- -

Safety

-

Beyond accepting a raw pointer, this is unsafe because it semantically -moves the value out of src without preventing further usage of src. -If T is not Copy, then care must be taken to ensure that the value at -src is not used before the data is overwritten again (e.g. with write, -zero_memory, or copy_memory). Note that *src = foo counts as a use -because it will attempt to drop the value previously at *src.

- -

Examples

-

Basic usage:

- -
-let x = 12;
-let y = &x as *const i32;
-
-unsafe { println!("{}", std::ptr::read_volatile(y)); }
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/fn.replace.html b/doc/bitflags/__core/ptr/fn.replace.html deleted file mode 100644 index 4e008c20..00000000 --- a/doc/bitflags/__core/ptr/fn.replace.html +++ /dev/null @@ -1,118 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr::replace - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::ptr::replace - - [−] - - [src]

-
pub unsafe fn replace<T>(dest: *mut T, src: T) -> T
1.0.0

Replaces the value at dest with src, returning the old -value, without dropping either.

- -

Safety

-

This is only unsafe because it accepts a raw pointer. -Otherwise, this operation is identical to mem::replace.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/fn.swap.html b/doc/bitflags/__core/ptr/fn.swap.html deleted file mode 100644 index 737de723..00000000 --- a/doc/bitflags/__core/ptr/fn.swap.html +++ /dev/null @@ -1,118 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr::swap - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::ptr::swap - - [−] - - [src]

-
pub unsafe fn swap<T>(x: *mut T, y: *mut T)
1.0.0

Swaps the values at two mutable locations of the same type, without -deinitializing either. They may overlap, unlike mem::swap which is -otherwise equivalent.

- -

Safety

-

This is only unsafe because it accepts a raw pointer.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/fn.write.html b/doc/bitflags/__core/ptr/fn.write.html deleted file mode 100644 index dc607d35..00000000 --- a/doc/bitflags/__core/ptr/fn.write.html +++ /dev/null @@ -1,137 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr::write - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::ptr::write - - [−] - - [src]

-
pub unsafe fn write<T>(dst: *mut T, src: T)
1.0.0

Overwrites a memory location with the given value without reading or -dropping the old value.

- -

Safety

-

This operation is marked unsafe because it accepts a raw pointer.

- -

It does not drop the contents of dst. This is safe, but it could leak -allocations or resources, so care must be taken not to overwrite an object -that should be dropped.

- -

This is appropriate for initializing uninitialized memory, or overwriting -memory that has previously been read from.

- -

Examples

-

Basic usage:

- -
-let mut x = 0;
-let y = &mut x as *mut i32;
-let z = 12;
-
-unsafe {
-    std::ptr::write(y, z);
-    println!("{}", std::ptr::read(y));
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/fn.write_bytes.html b/doc/bitflags/__core/ptr/fn.write_bytes.html deleted file mode 100644 index 7f8b327e..00000000 --- a/doc/bitflags/__core/ptr/fn.write_bytes.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr::write_bytes - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::ptr::write_bytes - - [−] - - [src]

-
pub unsafe extern "rust-intrinsic" fn write_bytes<T>(dst: *mut T, val: u8, count: usize)
1.0.0

Invokes memset on the specified pointer, setting count * size_of::<T>() -bytes of memory starting at dst to val.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/fn.write_volatile.html b/doc/bitflags/__core/ptr/fn.write_volatile.html deleted file mode 100644 index 14a0ff06..00000000 --- a/doc/bitflags/__core/ptr/fn.write_volatile.html +++ /dev/null @@ -1,147 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr::write_volatile - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::ptr::write_volatile - - [−] - - [src]

-
pub unsafe fn write_volatile<T>(dst: *mut T, src: T)
1.9.0

Performs a volatile write of a memory location with the given value without -reading or dropping the old value.

- -

Volatile operations are intended to act on I/O memory, and are guaranteed -to not be elided or reordered by the compiler across other volatile -operations.

- -

Notes

-

Rust does not currently have a rigorously and formally defined memory model, -so the precise semantics of what "volatile" means here is subject to change -over time. That being said, the semantics will almost always end up pretty -similar to C11's definition of volatile.

- -

Safety

-

This operation is marked unsafe because it accepts a raw pointer.

- -

It does not drop the contents of dst. This is safe, but it could leak -allocations or resources, so care must be taken not to overwrite an object -that should be dropped.

- -

This is appropriate for initializing uninitialized memory, or overwriting -memory that has previously been read from.

- -

Examples

-

Basic usage:

- -
-let mut x = 0;
-let y = &mut x as *mut i32;
-let z = 12;
-
-unsafe {
-    std::ptr::write_volatile(y, z);
-    println!("{}", std::ptr::read_volatile(y));
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/index.html b/doc/bitflags/__core/ptr/index.html deleted file mode 100644 index 9feb5b93..00000000 --- a/doc/bitflags/__core/ptr/index.html +++ /dev/null @@ -1,242 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::ptr - - [−] - - [src]

-

Raw, unsafe pointers, *const T, and *mut T.

- -

See also the pointer primitive types.

-

Structs

- - - - - - - - -
Shared - [Unstable]

A wrapper around a raw non-null *mut T that indicates that the possessor -of this wrapper has shared ownership of the referent. Useful for -building abstractions like Rc<T> or Arc<T>, which internally -use raw pointers to manage the memory that they own.

-
Unique - [Unstable]

A wrapper around a raw non-null *mut T that indicates that the possessor -of this wrapper owns the referent. This in turn implies that the -Unique<T> is Send/Sync if T is Send/Sync, unlike a raw -*mut T (which conveys no particular ownership semantics). It -also implies that the referent of the pointer should not be -modified without a unique path to the Unique reference. Useful -for building abstractions like Vec<T> or Box<T>, which -internally use raw pointers to manage the memory that they own.

-

Functions

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
copy -

Copies count * size_of<T> bytes from src to dst. The source -and destination may overlap.

-
copy_nonoverlapping -

Copies count * size_of<T> bytes from src to dst. The source -and destination may not overlap.

-
drop_in_place -

Executes the destructor (if any) of the pointed-to value.

-
null -

Creates a null raw pointer.

-
null_mut -

Creates a null mutable raw pointer.

-
read -

Reads the value from src without moving it. This leaves the -memory in src unchanged.

-
read_volatile -

Performs a volatile read of the value from src without moving it. This -leaves the memory in src unchanged.

-
replace -

Replaces the value at dest with src, returning the old -value, without dropping either.

-
swap -

Swaps the values at two mutable locations of the same type, without -deinitializing either. They may overlap, unlike mem::swap which is -otherwise equivalent.

-
write -

Overwrites a memory location with the given value without reading or -dropping the old value.

-
write_bytes -

Invokes memset on the specified pointer, setting count * size_of::<T>() -bytes of memory starting at dst to val.

-
write_volatile -

Performs a volatile write of a memory location with the given value without -reading or dropping the old value.

-
read_and_drop - [Unstable] -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/sidebar-items.js b/doc/bitflags/__core/ptr/sidebar-items.js deleted file mode 100644 index 0495ca08..00000000 --- a/doc/bitflags/__core/ptr/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["copy","Copies `count * size_of` bytes from `src` to `dst`. The source and destination may overlap."],["copy_nonoverlapping","Copies `count * size_of` bytes from `src` to `dst`. The source and destination may *not* overlap."],["drop_in_place","Executes the destructor (if any) of the pointed-to value."],["null","Creates a null raw pointer."],["null_mut","Creates a null mutable raw pointer."],["read","Reads the value from `src` without moving it. This leaves the memory in `src` unchanged."],["read_and_drop",""],["read_volatile","Performs a volatile read of the value from `src` without moving it. This leaves the memory in `src` unchanged."],["replace","Replaces the value at `dest` with `src`, returning the old value, without dropping either."],["swap","Swaps the values at two mutable locations of the same type, without deinitializing either. They may overlap, unlike `mem::swap` which is otherwise equivalent."],["write","Overwrites a memory location with the given value without reading or dropping the old value."],["write_bytes","Invokes memset on the specified pointer, setting `count * size_of::()` bytes of memory starting at `dst` to `val`."],["write_volatile","Performs a volatile write of a memory location with the given value without reading or dropping the old value."]],"struct":[["Shared","A wrapper around a raw non-null `*mut T` that indicates that the possessor of this wrapper has shared ownership of the referent. Useful for building abstractions like `Rc` or `Arc`, which internally use raw pointers to manage the memory that they own."],["Unique","A wrapper around a raw non-null `*mut T` that indicates that the possessor of this wrapper owns the referent. This in turn implies that the `Unique` is `Send`/`Sync` if `T` is `Send`/`Sync`, unlike a raw `*mut T` (which conveys no particular ownership semantics). It also implies that the referent of the pointer should not be modified without a unique path to the `Unique` reference. Useful for building abstractions like `Vec` or `Box`, which internally use raw pointers to manage the memory that they own."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/struct.Shared.html b/doc/bitflags/__core/ptr/struct.Shared.html deleted file mode 100644 index 852d52fb..00000000 --- a/doc/bitflags/__core/ptr/struct.Shared.html +++ /dev/null @@ -1,258 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr::Shared - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::ptr::Shared - - [−] - - [src]

-
pub struct Shared<T> where T: ?Sized {
-    // some fields omitted
-}
Unstable (shared)

: needs an RFC to flesh out design

-

A wrapper around a raw non-null *mut T that indicates that the possessor -of this wrapper has shared ownership of the referent. Useful for -building abstractions like Rc<T> or Arc<T>, which internally -use raw pointers to manage the memory that they own.

-

Methods

impl<T> Shared<T> where T: ?Sized

unsafe fn new(ptr: *mut T) -> Shared<T>

-
Unstable (shared)

Creates a new Shared.

- -

Safety

-

ptr must be non-null.

-

Methods from Deref<Target=*mut T>

fn is_null(self) -> bool1.0.0

-

Returns true if the pointer is null.

- -

Examples

-

Basic usage:

- -
-let s: &str = "Follow the rabbit";
-let ptr: *const u8 = s.as_ptr();
-assert!(!ptr.is_null());
-

unsafe fn as_ref(self) -> Option<&'a T>1.9.0

-

Returns None if the pointer is null, or else returns a reference to -the value wrapped in Some.

- -

Safety

-

While this method and its mutable counterpart are useful for -null-safety, it is important to note that this is still an unsafe -operation because the returned value could be pointing to invalid -memory.

- -

Additionally, the lifetime 'a returned is arbitrarily chosen and does -not necessarily reflect the actual lifetime of the data.

- -

Examples

-

Basic usage:

- -
-let val: *const u8 = &10u8 as *const u8;
-
-unsafe {
-    if let Some(val_back) = val.as_ref() {
-        println!("We got back the value: {}!", val_back);
-    }
-}
-

unsafe fn offset(self, count: isize) -> *const T1.0.0

-

Calculates the offset from a pointer. count is in units of T; e.g. a -count of 3 represents a pointer offset of 3 * sizeof::<T>() bytes.

- -

Safety

-

Both the starting and resulting pointer must be either in bounds or one -byte past the end of an allocated object. If either pointer is out of -bounds or arithmetic overflow occurs then -any further use of the returned value will result in undefined behavior.

- -

Examples

-

Basic usage:

- -
-let s: &str = "123";
-let ptr: *const u8 = s.as_ptr();
-
-unsafe {
-    println!("{}", *ptr.offset(1) as char);
-    println!("{}", *ptr.offset(2) as char);
-}
-

fn is_null(self) -> bool1.0.0

-

Returns true if the pointer is null.

- -

Examples

-

Basic usage:

- -
-let mut s = [1, 2, 3];
-let ptr: *mut u32 = s.as_mut_ptr();
-assert!(!ptr.is_null());
-

unsafe fn as_ref(self) -> Option<&'a T>1.9.0

-

Returns None if the pointer is null, or else returns a reference to -the value wrapped in Some.

- -

Safety

-

While this method and its mutable counterpart are useful for -null-safety, it is important to note that this is still an unsafe -operation because the returned value could be pointing to invalid -memory.

- -

Additionally, the lifetime 'a returned is arbitrarily chosen and does -not necessarily reflect the actual lifetime of the data.

- -

Examples

-

Basic usage:

- -
-let val: *mut u8 = &mut 10u8 as *mut u8;
-
-unsafe {
-    if let Some(val_back) = val.as_ref() {
-        println!("We got back the value: {}!", val_back);
-    }
-}
-

unsafe fn offset(self, count: isize) -> *mut T1.0.0

-

Calculates the offset from a pointer. count is in units of T; e.g. a -count of 3 represents a pointer offset of 3 * sizeof::<T>() bytes.

- -

Safety

-

The offset must be in-bounds of the object, or one-byte-past-the-end. -Otherwise offset invokes Undefined Behavior, regardless of whether -the pointer is used.

- -

Examples

-

Basic usage:

- -
-let mut s = [1, 2, 3];
-let ptr: *mut u32 = s.as_mut_ptr();
-
-unsafe {
-    println!("{}", *ptr.offset(1));
-    println!("{}", *ptr.offset(2));
-}
-

unsafe fn as_mut(self) -> Option<&'a mut T>1.9.0

-

Returns None if the pointer is null, or else returns a mutable -reference to the value wrapped in Some.

- -

Safety

-

As with as_ref, this is unsafe because it cannot verify the validity -of the returned pointer, nor can it ensure that the lifetime 'a -returned is indeed a valid lifetime for the contained data.

- -

Examples

-

Basic usage:

- -
-let mut s = [1, 2, 3];
-let ptr: *mut u32 = s.as_mut_ptr();
-let first_value = unsafe { ptr.as_mut().unwrap() };
-*first_value = 4;
-println!("{:?}", s); // It'll print: "[4, 2, 3]".
-

Trait Implementations

impl<T> UnwindSafe for Shared<T> where T: RefUnwindSafe + ?Sized1.9.0

impl<T> !Send for Shared<T> where T: ?Sized

Shared pointers are not Send because the data they reference may be aliased.

-

impl<T> !Sync for Shared<T> where T: ?Sized

Shared pointers are not Sync because the data they reference may be aliased.

-

impl<T> Clone for Shared<T> where T: ?Sized

fn clone(&self) -> Shared<T>

-
Unstable (shared)

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<T> Copy for Shared<T> where T: ?Sized

impl<T, U> CoerceUnsized<Shared<U>> for Shared<T> where T: Unsize<U> + ?Sized, U: ?Sized

impl<T> Deref for Shared<T> where T: ?Sized

type Target = *mut T

-
Unstable (shared)

fn deref(&self) -> &*mut T

-
Unstable (shared)

impl<T> Pointer for Shared<T>

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
Unstable (shared)
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/ptr/struct.Unique.html b/doc/bitflags/__core/ptr/struct.Unique.html deleted file mode 100644 index 21268f82..00000000 --- a/doc/bitflags/__core/ptr/struct.Unique.html +++ /dev/null @@ -1,270 +0,0 @@ - - - - - - - - - - bitflags::__core::ptr::Unique - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::ptr::Unique - - [−] - - [src]

-
pub struct Unique<T> where T: ?Sized {
-    // some fields omitted
-}
Unstable (unique)

: needs an RFC to flesh out design

-

A wrapper around a raw non-null *mut T that indicates that the possessor -of this wrapper owns the referent. This in turn implies that the -Unique<T> is Send/Sync if T is Send/Sync, unlike a raw -*mut T (which conveys no particular ownership semantics). It -also implies that the referent of the pointer should not be -modified without a unique path to the Unique reference. Useful -for building abstractions like Vec<T> or Box<T>, which -internally use raw pointers to manage the memory that they own.

-

Methods

impl<T> Unique<T> where T: ?Sized

const unsafe fn new(ptr: *mut T) -> Unique<T>

-
Unstable (unique)

Creates a new Unique.

- -

Safety

-

ptr must be non-null.

-

unsafe fn get(&self) -> &T

-
Unstable (unique)

Dereferences the content.

-

unsafe fn get_mut(&mut self) -> &mut T

-
Unstable (unique)

Mutably dereferences the content.

-

Methods from Deref<Target=*mut T>

fn is_null(self) -> bool1.0.0

-

Returns true if the pointer is null.

- -

Examples

-

Basic usage:

- -
-let s: &str = "Follow the rabbit";
-let ptr: *const u8 = s.as_ptr();
-assert!(!ptr.is_null());
-

unsafe fn as_ref(self) -> Option<&'a T>1.9.0

-

Returns None if the pointer is null, or else returns a reference to -the value wrapped in Some.

- -

Safety

-

While this method and its mutable counterpart are useful for -null-safety, it is important to note that this is still an unsafe -operation because the returned value could be pointing to invalid -memory.

- -

Additionally, the lifetime 'a returned is arbitrarily chosen and does -not necessarily reflect the actual lifetime of the data.

- -

Examples

-

Basic usage:

- -
-let val: *const u8 = &10u8 as *const u8;
-
-unsafe {
-    if let Some(val_back) = val.as_ref() {
-        println!("We got back the value: {}!", val_back);
-    }
-}
-

unsafe fn offset(self, count: isize) -> *const T1.0.0

-

Calculates the offset from a pointer. count is in units of T; e.g. a -count of 3 represents a pointer offset of 3 * sizeof::<T>() bytes.

- -

Safety

-

Both the starting and resulting pointer must be either in bounds or one -byte past the end of an allocated object. If either pointer is out of -bounds or arithmetic overflow occurs then -any further use of the returned value will result in undefined behavior.

- -

Examples

-

Basic usage:

- -
-let s: &str = "123";
-let ptr: *const u8 = s.as_ptr();
-
-unsafe {
-    println!("{}", *ptr.offset(1) as char);
-    println!("{}", *ptr.offset(2) as char);
-}
-

fn is_null(self) -> bool1.0.0

-

Returns true if the pointer is null.

- -

Examples

-

Basic usage:

- -
-let mut s = [1, 2, 3];
-let ptr: *mut u32 = s.as_mut_ptr();
-assert!(!ptr.is_null());
-

unsafe fn as_ref(self) -> Option<&'a T>1.9.0

-

Returns None if the pointer is null, or else returns a reference to -the value wrapped in Some.

- -

Safety

-

While this method and its mutable counterpart are useful for -null-safety, it is important to note that this is still an unsafe -operation because the returned value could be pointing to invalid -memory.

- -

Additionally, the lifetime 'a returned is arbitrarily chosen and does -not necessarily reflect the actual lifetime of the data.

- -

Examples

-

Basic usage:

- -
-let val: *mut u8 = &mut 10u8 as *mut u8;
-
-unsafe {
-    if let Some(val_back) = val.as_ref() {
-        println!("We got back the value: {}!", val_back);
-    }
-}
-

unsafe fn offset(self, count: isize) -> *mut T1.0.0

-

Calculates the offset from a pointer. count is in units of T; e.g. a -count of 3 represents a pointer offset of 3 * sizeof::<T>() bytes.

- -

Safety

-

The offset must be in-bounds of the object, or one-byte-past-the-end. -Otherwise offset invokes Undefined Behavior, regardless of whether -the pointer is used.

- -

Examples

-

Basic usage:

- -
-let mut s = [1, 2, 3];
-let ptr: *mut u32 = s.as_mut_ptr();
-
-unsafe {
-    println!("{}", *ptr.offset(1));
-    println!("{}", *ptr.offset(2));
-}
-

unsafe fn as_mut(self) -> Option<&'a mut T>1.9.0

-

Returns None if the pointer is null, or else returns a mutable -reference to the value wrapped in Some.

- -

Safety

-

As with as_ref, this is unsafe because it cannot verify the validity -of the returned pointer, nor can it ensure that the lifetime 'a -returned is indeed a valid lifetime for the contained data.

- -

Examples

-

Basic usage:

- -
-let mut s = [1, 2, 3];
-let ptr: *mut u32 = s.as_mut_ptr();
-let first_value = unsafe { ptr.as_mut().unwrap() };
-*first_value = 4;
-println!("{:?}", s); // It'll print: "[4, 2, 3]".
-

Trait Implementations

impl<T> UnwindSafe for Unique<T> where T: UnwindSafe1.9.0

impl<T> Send for Unique<T> where T: Send + ?Sized

Unique pointers are Send if T is Send because the data they -reference is unaliased. Note that this aliasing invariant is -unenforced by the type system; the abstraction using the -Unique must enforce it.

-

impl<T> Sync for Unique<T> where T: Sync + ?Sized

Unique pointers are Sync if T is Sync because the data they -reference is unaliased. Note that this aliasing invariant is -unenforced by the type system; the abstraction using the -Unique must enforce it.

-

impl<T, U> CoerceUnsized<Unique<U>> for Unique<T> where U: ?Sized, T: Unsize<U> + ?Sized

impl<T> Deref for Unique<T> where T: ?Sized

type Target = *mut T

-
Unstable (unique)

fn deref(&self) -> &*mut T

-
Unstable (unique)

impl<T> Pointer for Unique<T>1.0.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/raw/index.html b/doc/bitflags/__core/raw/index.html deleted file mode 100644 index 09aad387..00000000 --- a/doc/bitflags/__core/raw/index.html +++ /dev/null @@ -1,142 +0,0 @@ - - - - - - - - - - bitflags::__core::raw - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::raw - - [−] - - [src]

-
Unstable (raw)

Contains struct definitions for the layout of compiler built-in types.

- -

They can be used as targets of transmutes in unsafe code for manipulating -the raw representations directly.

- -

Their definition should always match the ABI defined in rustc::back::abi.

-

Structs

- - - - - - - - -
Slice - [Deprecated] [Unstable]

The representation of a slice like &[T].

-
TraitObject - [Unstable]

The representation of a trait object like &SomeTrait.

-

Traits

- - - - -
Repr - [Deprecated] [Unstable]

This trait is meant to map equivalences between raw structs and their -corresponding rust values.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/raw/sidebar-items.js b/doc/bitflags/__core/raw/sidebar-items.js deleted file mode 100644 index 6a57a75b..00000000 --- a/doc/bitflags/__core/raw/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["Slice","The representation of a slice like `&[T]`."],["TraitObject","The representation of a trait object like `&SomeTrait`."]],"trait":[["Repr","This trait is meant to map equivalences between raw structs and their corresponding rust values."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/raw/struct.Slice.html b/doc/bitflags/__core/raw/struct.Slice.html deleted file mode 100644 index f7821bf5..00000000 --- a/doc/bitflags/__core/raw/struct.Slice.html +++ /dev/null @@ -1,162 +0,0 @@ - - - - - - - - - - bitflags::__core::raw::Slice - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::raw::Slice - - [−] - - [src]

-
pub struct Slice<T> {
-    pub data: *const T,
-    pub len: usize,
-}
Deprecated since 1.9.0

: use raw accessors/constructors in slice module

-
Unstable (raw)

: use raw accessors/constructors in slice module

-

The representation of a slice like &[T].

- -

This struct is guaranteed to have the layout of types like &[T], -&str, and Box<[T]>, but is not the type of such slices -(e.g. the fields are not directly accessible on a &[T]) nor does -it control that layout (changing the definition will not change -the layout of a &[T]). It is only designed to be used by unsafe -code that needs to manipulate the low-level details.

- -

However, it is not recommended to use this type for such code, -since there are alternatives which may be safer:

- -
    -
  • Creating a slice from a data pointer and length can be done with -std::slice::from_raw_parts or std::slice::from_raw_parts_mut -instead of std::mem::transmuteing a value of type Slice.
    • -
  • Extracting the data pointer and length from a slice can be -performed with the as_ptr (or as_mut_ptr) and len -methods.
    • -
- -

If one does decide to convert a slice value to a Slice, the -Repr trait in this module provides a method for a safe -conversion from &[T] (and &str) to a Slice, more type-safe -than a call to transmute.

- -

Examples

-
-#![feature(raw)]
-
-use std::raw::{self, Repr};
-
-let slice: &[u16] = &[1, 2, 3, 4];
-
-let repr: raw::Slice<u16> = slice.repr();
-println!("data pointer = {:?}, length = {}", repr.data, repr.len);
-

Fields

- - -
data
Deprecated since 1.9.0

: use raw accessors/constructors in slice module

-
Unstable (raw)

: use raw accessors/constructors in slice module

-
len
Deprecated since 1.9.0

: use raw accessors/constructors in slice module

-
Unstable (raw)

: use raw accessors/constructors in slice module

-

Trait Implementations

impl<T> Copy for Slice<T>

impl<T> Clone for Slice<T>

fn clone(&self) -> Slice<T>

-
Unstable (raw)

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/raw/struct.TraitObject.html b/doc/bitflags/__core/raw/struct.TraitObject.html deleted file mode 100644 index 60ac6c96..00000000 --- a/doc/bitflags/__core/raw/struct.TraitObject.html +++ /dev/null @@ -1,188 +0,0 @@ - - - - - - - - - - bitflags::__core::raw::TraitObject - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::raw::TraitObject - - [−] - - [src]

-
pub struct TraitObject {
-    pub data: *mut (),
-    pub vtable: *mut (),
-}
Unstable (raw)

The representation of a trait object like &SomeTrait.

- -

This struct has the same layout as types like &SomeTrait and -Box<AnotherTrait>. The Trait Objects chapter of the -Book contains more details about the precise nature of -these internals.

- -

TraitObject is guaranteed to match layouts, but it is not the -type of trait objects (e.g. the fields are not directly accessible -on a &SomeTrait) nor does it control that layout (changing the -definition will not change the layout of a &SomeTrait). It is -only designed to be used by unsafe code that needs to manipulate -the low-level details.

- -

There is no Repr implementation for TraitObject because there -is no way to refer to all trait objects generically, so the only -way to create values of this type is with functions like -std::mem::transmute. Similarly, the only way to create a true -trait object from a TraitObject value is with transmute.

- -

Synthesizing a trait object with mismatched types—one where the -vtable does not correspond to the type of the value to which the -data pointer points—is highly likely to lead to undefined -behavior.

- -

Examples

-
-#![feature(raw)]
-
-use std::mem;
-use std::raw;
-
-// an example trait
-trait Foo {
-    fn bar(&self) -> i32;
-}
-impl Foo for i32 {
-    fn bar(&self) -> i32 {
-         *self + 1
-    }
-}
-
-let value: i32 = 123;
-
-// let the compiler make a trait object
-let object: &Foo = &value;
-
-// look at the raw representation
-let raw_object: raw::TraitObject = unsafe { mem::transmute(object) };
-
-// the data pointer is the address of `value`
-assert_eq!(raw_object.data as *const i32, &value as *const _);
-
-
-let other_value: i32 = 456;
-
-// construct a new object, pointing to a different `i32`, being
-// careful to use the `i32` vtable from `object`
-let synthesized: &Foo = unsafe {
-     mem::transmute(raw::TraitObject {
-         data: &other_value as *const _ as *mut (),
-         vtable: raw_object.vtable
-     })
-};
-
-// it should work just like we constructed a trait object out of
-// `other_value` directly
-assert_eq!(synthesized.bar(), 457);
-

Fields

- - -
data
Unstable (raw)
vtable
Unstable (raw)

Trait Implementations

Derived Implementations

impl Clone for TraitObject

fn clone(&self) -> TraitObject

-
Unstable (raw)

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Copy for TraitObject

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/raw/trait.Repr.html b/doc/bitflags/__core/raw/trait.Repr.html deleted file mode 100644 index ed78f03e..00000000 --- a/doc/bitflags/__core/raw/trait.Repr.html +++ /dev/null @@ -1,134 +0,0 @@ - - - - - - - - - - bitflags::__core::raw::Repr - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::raw::Repr - - [−] - - [src]

-
pub unsafe trait Repr<T> {
-    fn repr(&self) -> T { ... }
-}
Deprecated since 1.9.0

: use raw accessors/constructors in slice module

-
Unstable (raw)

: use raw accessors/constructors in slice module

-

This trait is meant to map equivalences between raw structs and their -corresponding rust values.

-
-

Provided Methods

-
-

fn repr(&self) -> T

Deprecated since 1.9.0

: use raw accessors/constructors in slice module

-
Unstable (raw)

: use raw accessors/constructors in slice module

-

This function "unwraps" a rust value (without consuming it) into its raw -struct representation. This can be used to read/write different values -for the struct. This is a safe method because by default it does not -enable write-access to the fields of the return value in safe code.

-
-

Implementors

-
    -
  • impl<T> Repr for [T]
    • -
  • impl Repr for str
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/rc/index.html b/doc/bitflags/__core/rc/index.html deleted file mode 100644 index 65a30267..00000000 --- a/doc/bitflags/__core/rc/index.html +++ /dev/null @@ -1,261 +0,0 @@ - - - - - - - - - - bitflags::__core::rc - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::rc - - [−] - - [src]

-

Thread-local reference-counted boxes (the Rc<T> type).

- -

The Rc<T> type provides shared ownership of an immutable value. -Destruction is deterministic, and will occur as soon as the last owner is -gone. It is marked as non-sendable because it avoids the overhead of atomic -reference counting.

- -

The downgrade method can be used to create a non-owning Weak<T> pointer -to the box. A Weak<T> pointer can be upgraded to an Rc<T> pointer, but -will return None if the value has already been dropped.

- -

For example, a tree with parent pointers can be represented by putting the -nodes behind strong Rc<T> pointers, and then storing the parent pointers -as Weak<T> pointers.

- -

Examples

-

Consider a scenario where a set of Gadgets are owned by a given Owner. -We want to have our Gadgets point to their Owner. We can't do this with -unique ownership, because more than one gadget may belong to the same -Owner. Rc<T> allows us to share an Owner between multiple Gadgets, -and have the Owner remain allocated as long as any Gadget points at it.

- -
-use std::rc::Rc;
-
-struct Owner {
-    name: String
-    // ...other fields
-}
-
-struct Gadget {
-    id: i32,
-    owner: Rc<Owner>
-    // ...other fields
-}
-
-fn main() {
-    // Create a reference counted Owner.
-    let gadget_owner : Rc<Owner> = Rc::new(
-        Owner { name: String::from("Gadget Man") }
-    );
-
-    // Create Gadgets belonging to gadget_owner. To increment the reference
-    // count we clone the `Rc<T>` object.
-    let gadget1 = Gadget { id: 1, owner: gadget_owner.clone() };
-    let gadget2 = Gadget { id: 2, owner: gadget_owner.clone() };
-
-    drop(gadget_owner);
-
-    // Despite dropping gadget_owner, we're still able to print out the name
-    // of the Owner of the Gadgets. This is because we've only dropped the
-    // reference count object, not the Owner it wraps. As long as there are
-    // other `Rc<T>` objects pointing at the same Owner, it will remain
-    // allocated. Notice that the `Rc<T>` wrapper around Gadget.owner gets
-    // automatically dereferenced for us.
-    println!("Gadget {} owned by {}", gadget1.id, gadget1.owner.name);
-    println!("Gadget {} owned by {}", gadget2.id, gadget2.owner.name);
-
-    // At the end of the method, gadget1 and gadget2 get destroyed, and with
-    // them the last counted references to our Owner. Gadget Man now gets
-    // destroyed as well.
-}
- -

If our requirements change, and we also need to be able to traverse from -Owner → Gadget, we will run into problems: an Rc<T> pointer from Owner -→ Gadget introduces a cycle between the objects. This means that their -reference counts can never reach 0, and the objects will remain allocated: a -memory leak. In order to get around this, we can use Weak<T> pointers. -These pointers don't contribute to the total count.

- -

Rust actually makes it somewhat difficult to produce this loop in the first -place: in order to end up with two objects that point at each other, one of -them needs to be mutable. This is problematic because Rc<T> enforces -memory safety by only giving out shared references to the object it wraps, -and these don't allow direct mutation. We need to wrap the part of the -object we wish to mutate in a RefCell, which provides interior -mutability: a method to achieve mutability through a shared reference. -RefCell enforces Rust's borrowing rules at runtime. Read the Cell -documentation for more details on interior mutability.

- -
-use std::rc::Rc;
-use std::rc::Weak;
-use std::cell::RefCell;
-
-struct Owner {
-    name: String,
-    gadgets: RefCell<Vec<Weak<Gadget>>>,
-    // ...other fields
-}
-
-struct Gadget {
-    id: i32,
-    owner: Rc<Owner>,
-    // ...other fields
-}
-
-fn main() {
-    // Create a reference counted Owner. Note the fact that we've put the
-    // Owner's vector of Gadgets inside a RefCell so that we can mutate it
-    // through a shared reference.
-    let gadget_owner : Rc<Owner> = Rc::new(
-        Owner {
-            name: "Gadget Man".to_string(),
-            gadgets: RefCell::new(Vec::new()),
-        }
-    );
-
-    // Create Gadgets belonging to gadget_owner as before.
-    let gadget1 = Rc::new(Gadget{id: 1, owner: gadget_owner.clone()});
-    let gadget2 = Rc::new(Gadget{id: 2, owner: gadget_owner.clone()});
-
-    // Add the Gadgets to their Owner. To do this we mutably borrow from
-    // the RefCell holding the Owner's Gadgets.
-    gadget_owner.gadgets.borrow_mut().push(Rc::downgrade(&gadget1));
-    gadget_owner.gadgets.borrow_mut().push(Rc::downgrade(&gadget2));
-
-    // Iterate over our Gadgets, printing their details out
-    for gadget_opt in gadget_owner.gadgets.borrow().iter() {
-
-        // gadget_opt is a Weak<Gadget>. Since weak pointers can't guarantee
-        // that their object is still allocated, we need to call upgrade()
-        // on them to turn them into a strong reference. This returns an
-        // Option, which contains a reference to our object if it still
-        // exists.
-        let gadget = gadget_opt.upgrade().unwrap();
-        println!("Gadget {} owned by {}", gadget.id, gadget.owner.name);
-    }
-
-    // At the end of the method, gadget_owner, gadget1 and gadget2 get
-    // destroyed. There are now no strong (`Rc<T>`) references to the gadgets.
-    // Once they get destroyed, the Gadgets get destroyed. This zeroes the
-    // reference count on Gadget Man, they get destroyed as well.
-}
-

Structs

- - - - - - - - -
Rc -

A reference-counted pointer type over an immutable value.

-
Weak -

A weak version of Rc<T>.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/rc/sidebar-items.js b/doc/bitflags/__core/rc/sidebar-items.js deleted file mode 100644 index e9932b80..00000000 --- a/doc/bitflags/__core/rc/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["Rc","A reference-counted pointer type over an immutable value."],["Weak","A weak version of `Rc`."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/rc/struct.Rc.html b/doc/bitflags/__core/rc/struct.Rc.html deleted file mode 100644 index 89c4222c..00000000 --- a/doc/bitflags/__core/rc/struct.Rc.html +++ /dev/null @@ -1,366 +0,0 @@ - - - - - - - - - - bitflags::__core::rc::Rc - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::rc::Rc - - [−] - - [src]

-
pub struct Rc<T> where T: ?Sized {
-    // some fields omitted
-}
1.0.0

A reference-counted pointer type over an immutable value.

- -

See the module level documentation for more details.

-

Methods

impl<T> Rc<T>

fn new(value: T) -> Rc<T>

-

Constructs a new Rc<T>.

- -

Examples

-
-use std::rc::Rc;
-
-let five = Rc::new(5);
-

fn try_unwrap(this: Rc<T>) -> Result<T, Rc<T>>1.4.0

-

Unwraps the contained value if the Rc<T> has exactly one strong reference.

- -

Otherwise, an Err is returned with the same Rc<T>.

- -

This will succeed even if there are outstanding weak references.

- -

Examples

-
-use std::rc::Rc;
-
-let x = Rc::new(3);
-assert_eq!(Rc::try_unwrap(x), Ok(3));
-
-let x = Rc::new(4);
-let _y = x.clone();
-assert_eq!(Rc::try_unwrap(x), Err(Rc::new(4)));
-

fn would_unwrap(this: &Rc<T>) -> bool

-
Unstable (rc_would_unwrap)

: just added for niche usecase

-

Checks if Rc::try_unwrap would return Ok.

-

impl<T> Rc<T> where T: ?Sized

fn downgrade(this: &Rc<T>) -> Weak<T>1.4.0

-

Downgrades the Rc<T> to a Weak<T> reference.

- -

Examples

-
-use std::rc::Rc;
-
-let five = Rc::new(5);
-
-let weak_five = Rc::downgrade(&five);
-

fn weak_count(this: &Rc<T>) -> usize

-
Unstable (rc_counts)

: not clearly useful

-

Get the number of weak references to this value.

-

fn strong_count(this: &Rc<T>) -> usize

-
Unstable (rc_counts)

: not clearly useful

-

Get the number of strong references to this value.

-

fn is_unique(this: &Rc<T>) -> bool

-
Unstable (rc_counts)

: uniqueness has unclear meaning

-

Returns true if there are no other Rc or Weak<T> values that share -the same inner value.

- -

Examples

-
-#![feature(rc_counts)]
-
-use std::rc::Rc;
-
-let five = Rc::new(5);
-
-assert!(Rc::is_unique(&five));
-

fn get_mut(this: &mut Rc<T>) -> Option<&mut T>1.4.0

-

Returns a mutable reference to the contained value if the Rc<T> has -one strong reference and no weak references.

- -

Returns None if the Rc<T> is not unique.

- -

Examples

-
-use std::rc::Rc;
-
-let mut x = Rc::new(3);
-*Rc::get_mut(&mut x).unwrap() = 4;
-assert_eq!(*x, 4);
-
-let _y = x.clone();
-assert!(Rc::get_mut(&mut x).is_none());
-

impl<T> Rc<T> where T: Clone

fn make_mut(this: &mut Rc<T>) -> &mut T1.4.0

-

Make a mutable reference into the given Rc<T> by cloning the inner -data if the Rc<T> doesn't have one strong reference and no weak -references.

- -

This is also referred to as a copy-on-write.

- -

Examples

-
-use std::rc::Rc;
-
-let mut data = Rc::new(5);
-
-*Rc::make_mut(&mut data) += 1;             // Won't clone anything
-let mut other_data = data.clone(); // Won't clone inner data
-*Rc::make_mut(&mut data) += 1;             // Clones inner data
-*Rc::make_mut(&mut data) += 1;             // Won't clone anything
-*Rc::make_mut(&mut other_data) *= 2;       // Won't clone anything
-
-// Note: data and other_data now point to different numbers
-assert_eq!(*data, 8);
-assert_eq!(*other_data, 12);
-
-

Trait Implementations

impl<T> UnwindSafe for Rc<T> where T: RefUnwindSafe + ?Sized1.9.0

impl<T> !Send for Rc<T> where T: ?Sized

impl<T> !Sync for Rc<T> where T: ?Sized

impl<T, U> CoerceUnsized<Rc<U>> for Rc<T> where U: ?Sized, T: Unsize<U> + ?Sized

impl<T> Deref for Rc<T> where T: ?Sized

type Target = T

-

fn deref(&self) -> &T

-

impl<T> Drop for Rc<T> where T: ?Sized

fn drop(&mut self)

-

Drops the Rc<T>.

- -

This will decrement the strong reference count. If the strong reference -count becomes zero and the only other references are Weak<T> ones, -drops the inner value.

- -

Examples

-
-use std::rc::Rc;
-
-{
-    let five = Rc::new(5);
-
-    // stuff
-
-    drop(five); // explicit drop
-}
-{
-    let five = Rc::new(5);
-
-    // stuff
-
-} // implicit drop
-

impl<T> Clone for Rc<T> where T: ?Sized

fn clone(&self) -> Rc<T>

-

Makes a clone of the Rc<T>.

- -

When you clone an Rc<T>, it will create another pointer to the data and -increase the strong reference counter.

- -

Examples

-
-use std::rc::Rc;
-
-let five = Rc::new(5);
-
-five.clone();
-

fn clone_from(&mut self, source: &Self)

-

impl<T> Default for Rc<T> where T: Default

fn default() -> Rc<T>

-

Creates a new Rc<T>, with the Default value for T.

- -

Examples

-
-use std::rc::Rc;
-
-let x: Rc<i32> = Default::default();
-

impl<T> PartialEq<Rc<T>> for Rc<T> where T: PartialEq<T> + ?Sized

fn eq(&self, other: &Rc<T>) -> bool

-

Equality for two Rc<T>s.

- -

Two Rc<T>s are equal if their inner value are equal.

- -

Examples

-
-use std::rc::Rc;
-
-let five = Rc::new(5);
-
-five == Rc::new(5);
-

fn ne(&self, other: &Rc<T>) -> bool

-

Inequality for two Rc<T>s.

- -

Two Rc<T>s are unequal if their inner value are unequal.

- -

Examples

-
-use std::rc::Rc;
-
-let five = Rc::new(5);
-
-five != Rc::new(5);
-

impl<T> Eq for Rc<T> where T: Eq + ?Sized

impl<T> PartialOrd<Rc<T>> for Rc<T> where T: PartialOrd<T> + ?Sized

fn partial_cmp(&self, other: &Rc<T>) -> Option<Ordering>

-

Partial comparison for two Rc<T>s.

- -

The two are compared by calling partial_cmp() on their inner values.

- -

Examples

-
-use std::rc::Rc;
-
-let five = Rc::new(5);
-
-five.partial_cmp(&Rc::new(5));
-

fn lt(&self, other: &Rc<T>) -> bool

-

Less-than comparison for two Rc<T>s.

- -

The two are compared by calling < on their inner values.

- -

Examples

-
-use std::rc::Rc;
-
-let five = Rc::new(5);
-
-five < Rc::new(5);
-

fn le(&self, other: &Rc<T>) -> bool

-

'Less-than or equal to' comparison for two Rc<T>s.

- -

The two are compared by calling <= on their inner values.

- -

Examples

-
-use std::rc::Rc;
-
-let five = Rc::new(5);
-
-five <= Rc::new(5);
-

fn gt(&self, other: &Rc<T>) -> bool

-

Greater-than comparison for two Rc<T>s.

- -

The two are compared by calling > on their inner values.

- -

Examples

-
-use std::rc::Rc;
-
-let five = Rc::new(5);
-
-five > Rc::new(5);
-

fn ge(&self, other: &Rc<T>) -> bool

-

'Greater-than or equal to' comparison for two Rc<T>s.

- -

The two are compared by calling >= on their inner values.

- -

Examples

-
-use std::rc::Rc;
-
-let five = Rc::new(5);
-
-five >= Rc::new(5);
-

impl<T> Ord for Rc<T> where T: Ord + ?Sized

fn cmp(&self, other: &Rc<T>) -> Ordering

-

Comparison for two Rc<T>s.

- -

The two are compared by calling cmp() on their inner values.

- -

Examples

-
-use std::rc::Rc;
-
-let five = Rc::new(5);
-
-five.partial_cmp(&Rc::new(5));
-

impl<T> Hash for Rc<T> where T: Hash + ?Sized

fn hash<H>(&self, state: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<T> Display for Rc<T> where T: Display + ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Debug for Rc<T> where T: Debug + ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Pointer for Rc<T> where T: ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> From<T> for Rc<T>1.6.0

fn from(t: T) -> Rc<T>

-

impl<T> Borrow<T> for Rc<T> where T: ?Sized

fn borrow(&self) -> &T

-

impl<T> AsRef<T> for Rc<T> where T: ?Sized1.5.0

fn as_ref(&self) -> &T

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/rc/struct.Weak.html b/doc/bitflags/__core/rc/struct.Weak.html deleted file mode 100644 index a9b5a58f..00000000 --- a/doc/bitflags/__core/rc/struct.Weak.html +++ /dev/null @@ -1,189 +0,0 @@ - - - - - - - - - - bitflags::__core::rc::Weak - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::rc::Weak - - [−] - - [src]

-
pub struct Weak<T> where T: ?Sized {
-    // some fields omitted
-}
1.4.0

A weak version of Rc<T>.

- -

Weak references do not count when determining if the inner value should be -dropped.

- -

See the module level documentation for more.

-

Methods

impl<T> Weak<T> where T: ?Sized

fn upgrade(&self) -> Option<Rc<T>>

-

Upgrades a weak reference to a strong reference.

- -

Upgrades the Weak<T> reference to an Rc<T>, if possible.

- -

Returns None if there were no strong references and the data was -destroyed.

- -

Examples

-
-use std::rc::Rc;
-
-let five = Rc::new(5);
-
-let weak_five = Rc::downgrade(&five);
-
-let strong_five: Option<Rc<_>> = weak_five.upgrade();
-

impl<T> Weak<T>

fn new() -> Weak<T>

-
Unstable (downgraded_weak)

: recently added

-

Constructs a new Weak<T> without an accompanying instance of T.

- -

This allocates memory for T, but does not initialize it. Calling -Weak::upgrade() on the return value always gives None.

- -

Examples

-
-#![feature(downgraded_weak)]
-
-use std::rc::Weak;
-
-let empty: Weak<i64> = Weak::new();
-

Trait Implementations

impl<T> !Send for Weak<T> where T: ?Sized

impl<T> !Sync for Weak<T> where T: ?Sized

impl<T, U> CoerceUnsized<Weak<U>> for Weak<T> where U: ?Sized, T: Unsize<U> + ?Sized

impl<T> Drop for Weak<T> where T: ?Sized

fn drop(&mut self)

-

Drops the Weak<T>.

- -

This will decrement the weak reference count.

- -

Examples

-
-use std::rc::Rc;
-
-{
-    let five = Rc::new(5);
-    let weak_five = Rc::downgrade(&five);
-
-    // stuff
-
-    drop(weak_five); // explicit drop
-}
-{
-    let five = Rc::new(5);
-    let weak_five = Rc::downgrade(&five);
-
-    // stuff
-
-} // implicit drop
-

impl<T> Clone for Weak<T> where T: ?Sized

fn clone(&self) -> Weak<T>

-

Makes a clone of the Weak<T>.

- -

This increases the weak reference count.

- -

Examples

-
-use std::rc::Rc;
-
-let weak_five = Rc::downgrade(&Rc::new(5));
-
-weak_five.clone();
-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<T> Debug for Weak<T> where T: Debug + ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/result/enum.Result.html b/doc/bitflags/__core/result/enum.Result.html deleted file mode 100644 index 9b430cef..00000000 --- a/doc/bitflags/__core/result/enum.Result.html +++ /dev/null @@ -1,475 +0,0 @@ - - - - - - - - - - bitflags::__core::result::Result - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::result::Result - - [−] - - [src]

-
#[must_use]
-pub enum Result<T, E> {
-    Ok(T),
-    Err(E),
-}
1.0.0

Result is a type that represents either success (Ok) or failure (Err).

- -

See the std::result module documentation for details.

-

Variants

-
Ok

Contains the success value

-
Err

Contains the error value

-

Methods

impl<T, E> Result<T, E>

fn is_ok(&self) -> bool

-

Returns true if the result is Ok

- -

Examples

-

Basic usage:

- -
-let x: Result<i32, &str> = Ok(-3);
-assert_eq!(x.is_ok(), true);
-
-let x: Result<i32, &str> = Err("Some error message");
-assert_eq!(x.is_ok(), false);
-

fn is_err(&self) -> bool

-

Returns true if the result is Err

- -

Examples

-

Basic usage:

- -
-let x: Result<i32, &str> = Ok(-3);
-assert_eq!(x.is_err(), false);
-
-let x: Result<i32, &str> = Err("Some error message");
-assert_eq!(x.is_err(), true);
-

fn ok(self) -> Option<T>

-

Converts from Result<T, E> to Option<T>

- -

Converts self into an Option<T>, consuming self, -and discarding the error, if any.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(2);
-assert_eq!(x.ok(), Some(2));
-
-let x: Result<u32, &str> = Err("Nothing here");
-assert_eq!(x.ok(), None);
-

fn err(self) -> Option<E>

-

Converts from Result<T, E> to Option<E>

- -

Converts self into an Option<E>, consuming self, -and discarding the success value, if any.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(2);
-assert_eq!(x.err(), None);
-
-let x: Result<u32, &str> = Err("Nothing here");
-assert_eq!(x.err(), Some("Nothing here"));
-

fn as_ref(&self) -> Result<&T, &E>

-

Converts from Result<T, E> to Result<&T, &E>

- -

Produces a new Result, containing a reference -into the original, leaving the original in place.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(2);
-assert_eq!(x.as_ref(), Ok(&2));
-
-let x: Result<u32, &str> = Err("Error");
-assert_eq!(x.as_ref(), Err(&"Error"));
-

fn as_mut(&mut self) -> Result<&mut T, &mut E>

-

Converts from Result<T, E> to Result<&mut T, &mut E>

- -

Examples

-

Basic usage:

- -
-fn mutate(r: &mut Result<i32, i32>) {
-    match r.as_mut() {
-        Ok(&mut ref mut v) => *v = 42,
-        Err(&mut ref mut e) => *e = 0,
-    }
-}
-
-let mut x: Result<i32, i32> = Ok(2);
-mutate(&mut x);
-assert_eq!(x.unwrap(), 42);
-
-let mut x: Result<i32, i32> = Err(13);
-mutate(&mut x);
-assert_eq!(x.unwrap_err(), 0);
-

fn map<U, F>(self, op: F) -> Result<U, E> where F: FnOnce(T) -> U

-

Maps a Result<T, E> to Result<U, E> by applying a function to a -contained Ok value, leaving an Err value untouched.

- -

This function can be used to compose the results of two functions.

- -

Examples

-

Print the numbers on each line of a string multiplied by two.

- -
-let line = "1\n2\n3\n4\n";
-
-for num in line.lines() {
-    match num.parse::<i32>().map(|i| i * 2) {
-        Ok(n) => println!("{}", n),
-        Err(..) => {}
-    }
-}
-

fn map_err<F, O>(self, op: O) -> Result<T, F> where O: FnOnce(E) -> F

-

Maps a Result<T, E> to Result<T, F> by applying a function to a -contained Err value, leaving an Ok value untouched.

- -

This function can be used to pass through a successful result while handling -an error.

- -

Examples

-

Basic usage:

- -
-fn stringify(x: u32) -> String { format!("error code: {}", x) }
-
-let x: Result<u32, u32> = Ok(2);
-assert_eq!(x.map_err(stringify), Ok(2));
-
-let x: Result<u32, u32> = Err(13);
-assert_eq!(x.map_err(stringify), Err("error code: 13".to_string()));
-

fn iter(&self) -> Iter<T>

-

Returns an iterator over the possibly contained value.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(7);
-assert_eq!(x.iter().next(), Some(&7));
-
-let x: Result<u32, &str> = Err("nothing!");
-assert_eq!(x.iter().next(), None);
-

fn iter_mut(&mut self) -> IterMut<T>

-

Returns a mutable iterator over the possibly contained value.

- -

Examples

-

Basic usage:

- -
-let mut x: Result<u32, &str> = Ok(7);
-match x.iter_mut().next() {
-    Some(v) => *v = 40,
-    None => {},
-}
-assert_eq!(x, Ok(40));
-
-let mut x: Result<u32, &str> = Err("nothing!");
-assert_eq!(x.iter_mut().next(), None);
-

fn and<U>(self, res: Result<U, E>) -> Result<U, E>

-

Returns res if the result is Ok, otherwise returns the Err value of self.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(2);
-let y: Result<&str, &str> = Err("late error");
-assert_eq!(x.and(y), Err("late error"));
-
-let x: Result<u32, &str> = Err("early error");
-let y: Result<&str, &str> = Ok("foo");
-assert_eq!(x.and(y), Err("early error"));
-
-let x: Result<u32, &str> = Err("not a 2");
-let y: Result<&str, &str> = Err("late error");
-assert_eq!(x.and(y), Err("not a 2"));
-
-let x: Result<u32, &str> = Ok(2);
-let y: Result<&str, &str> = Ok("different result type");
-assert_eq!(x.and(y), Ok("different result type"));
-

fn and_then<U, F>(self, op: F) -> Result<U, E> where F: FnOnce(T) -> Result<U, E>

-

Calls op if the result is Ok, otherwise returns the Err value of self.

- -

This function can be used for control flow based on result values.

- -

Examples

-

Basic usage:

- -
-fn sq(x: u32) -> Result<u32, u32> { Ok(x * x) }
-fn err(x: u32) -> Result<u32, u32> { Err(x) }
-
-assert_eq!(Ok(2).and_then(sq).and_then(sq), Ok(16));
-assert_eq!(Ok(2).and_then(sq).and_then(err), Err(4));
-assert_eq!(Ok(2).and_then(err).and_then(sq), Err(2));
-assert_eq!(Err(3).and_then(sq).and_then(sq), Err(3));
-

fn or<F>(self, res: Result<T, F>) -> Result<T, F>

-

Returns res if the result is Err, otherwise returns the Ok value of self.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(2);
-let y: Result<u32, &str> = Err("late error");
-assert_eq!(x.or(y), Ok(2));
-
-let x: Result<u32, &str> = Err("early error");
-let y: Result<u32, &str> = Ok(2);
-assert_eq!(x.or(y), Ok(2));
-
-let x: Result<u32, &str> = Err("not a 2");
-let y: Result<u32, &str> = Err("late error");
-assert_eq!(x.or(y), Err("late error"));
-
-let x: Result<u32, &str> = Ok(2);
-let y: Result<u32, &str> = Ok(100);
-assert_eq!(x.or(y), Ok(2));
-

fn or_else<F, O>(self, op: O) -> Result<T, F> where O: FnOnce(E) -> Result<T, F>

-

Calls op if the result is Err, otherwise returns the Ok value of self.

- -

This function can be used for control flow based on result values.

- -

Examples

-

Basic usage:

- -
-fn sq(x: u32) -> Result<u32, u32> { Ok(x * x) }
-fn err(x: u32) -> Result<u32, u32> { Err(x) }
-
-assert_eq!(Ok(2).or_else(sq).or_else(sq), Ok(2));
-assert_eq!(Ok(2).or_else(err).or_else(sq), Ok(2));
-assert_eq!(Err(3).or_else(sq).or_else(err), Ok(9));
-assert_eq!(Err(3).or_else(err).or_else(err), Err(3));
-

fn unwrap_or(self, optb: T) -> T

-

Unwraps a result, yielding the content of an Ok. -Else it returns optb.

- -

Examples

-

Basic usage:

- -
-let optb = 2;
-let x: Result<u32, &str> = Ok(9);
-assert_eq!(x.unwrap_or(optb), 9);
-
-let x: Result<u32, &str> = Err("error");
-assert_eq!(x.unwrap_or(optb), optb);
-

fn unwrap_or_else<F>(self, op: F) -> T where F: FnOnce(E) -> T

-

Unwraps a result, yielding the content of an Ok. -If the value is an Err then it calls op with its value.

- -

Examples

-

Basic usage:

- -
-fn count(x: &str) -> usize { x.len() }
-
-assert_eq!(Ok(2).unwrap_or_else(count), 2);
-assert_eq!(Err("foo").unwrap_or_else(count), 3);
-

impl<T, E> Result<T, E> where E: Debug

fn unwrap(self) -> T

-

Unwraps a result, yielding the content of an Ok.

- -

Panics

-

Panics if the value is an Err, with a panic message provided by the -Err's value.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(2);
-assert_eq!(x.unwrap(), 2);
- -
-let x: Result<u32, &str> = Err("emergency failure");
-x.unwrap(); // panics with `emergency failure`
-

fn expect(self, msg: &str) -> T1.4.0

-

Unwraps a result, yielding the content of an Ok.

- -

Panics

-

Panics if the value is an Err, with a panic message including the -passed message, and the content of the Err.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Err("emergency failure");
-x.expect("Testing expect"); // panics with `Testing expect: emergency failure`
-

impl<T, E> Result<T, E> where T: Debug

fn unwrap_err(self) -> E

-

Unwraps a result, yielding the content of an Err.

- -

Panics

-

Panics if the value is an Ok, with a custom panic message provided -by the Ok's value.

- -

Examples

-
-let x: Result<u32, &str> = Ok(2);
-x.unwrap_err(); // panics with `2`
- -
-let x: Result<u32, &str> = Err("emergency failure");
-assert_eq!(x.unwrap_err(), "emergency failure");
-

Trait Implementations

impl<T, E> IntoIterator for Result<T, E>

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Returns a consuming iterator over the possibly contained value.

- -

Examples

-

Basic usage:

- -
-let x: Result<u32, &str> = Ok(5);
-let v: Vec<u32> = x.into_iter().collect();
-assert_eq!(v, [5]);
-
-let x: Result<u32, &str> = Err("nothing!");
-let v: Vec<u32> = x.into_iter().collect();
-assert_eq!(v, []);
-

impl<'a, T, E> IntoIterator for &'a Result<T, E>1.4.0

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<'a, T, E> IntoIterator for &'a mut Result<T, E>1.4.0

type Item = &'a mut T

-

type IntoIter = IterMut<'a, T>

-

fn into_iter(self) -> IterMut<'a, T>

-

impl<A, E, V> FromIterator<Result<A, E>> for Result<V, E> where V: FromIterator<A>

fn from_iter<I>(iter: I) -> Result<V, E> where I: IntoIterator<Item=Result<A, E>>

-

Takes each element in the Iterator: if it is an Err, no further -elements are taken, and the Err is returned. Should no Err occur, a -container with the values of each Result is returned.

- -

Here is an example which increments every integer in a vector, -checking for overflow:

- -
-use std::u32;
-
-let v = vec!(1, 2);
-let res: Result<Vec<u32>, &'static str> = v.iter().map(|&x: &u32|
-    if x == u32::MAX { Err("Overflow!") }
-    else { Ok(x + 1) }
-).collect();
-assert!(res == Ok(vec!(2, 3)));
-

Derived Implementations

impl<T, E> Hash for Result<T, E> where E: Hash, T: Hash

fn hash<__HTE>(&self, __arg_0: &mut __HTE) where __HTE: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<T, E> Debug for Result<T, E> where T: Debug, E: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<T, E> Ord for Result<T, E> where E: Ord, T: Ord

fn cmp(&self, __arg_0: &Result<T, E>) -> Ordering

-

impl<T, E> Eq for Result<T, E> where E: Eq, T: Eq

impl<T, E> PartialOrd<Result<T, E>> for Result<T, E> where T: PartialOrd<T>, E: PartialOrd<E>

fn partial_cmp(&self, __arg_0: &Result<T, E>) -> Option<Ordering>

-

fn lt(&self, __arg_0: &Result<T, E>) -> bool

-

fn le(&self, __arg_0: &Result<T, E>) -> bool

-

fn gt(&self, __arg_0: &Result<T, E>) -> bool

-

fn ge(&self, __arg_0: &Result<T, E>) -> bool

-

impl<T, E> PartialEq<Result<T, E>> for Result<T, E> where T: PartialEq<T>, E: PartialEq<E>

fn eq(&self, __arg_0: &Result<T, E>) -> bool

-

fn ne(&self, __arg_0: &Result<T, E>) -> bool

-

impl<T, E> Copy for Result<T, E> where T: Copy, E: Copy

impl<T, E> Clone for Result<T, E> where T: Clone, E: Clone

fn clone(&self) -> Result<T, E>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/result/index.html b/doc/bitflags/__core/result/index.html deleted file mode 100644 index 41c5e14b..00000000 --- a/doc/bitflags/__core/result/index.html +++ /dev/null @@ -1,340 +0,0 @@ - - - - - - - - - - bitflags::__core::result - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::result - - [−] - - [src]

-

Error handling with the Result type.

- -

Result<T, E> is the type used for returning and propagating -errors. It is an enum with the variants, Ok(T), representing -success and containing a value, and Err(E), representing error -and containing an error value.

- -
-enum Result<T, E> {
-   Ok(T),
-   Err(E),
-}
- -

Functions return Result whenever errors are expected and -recoverable. In the std crate Result is most prominently used -for I/O.

- -

A simple function returning Result might be -defined and used like so:

- -
-#[derive(Debug)]
-enum Version { Version1, Version2 }
-
-fn parse_version(header: &[u8]) -> Result<Version, &'static str> {
-    match header.get(0) {
-        None => Err("invalid header length"),
-        Some(&1) => Ok(Version::Version1),
-        Some(&2) => Ok(Version::Version2),
-        Some(_) => Err("invalid version"),
-    }
-}
-
-let version = parse_version(&[1, 2, 3, 4]);
-match version {
-    Ok(v) => println!("working with version: {:?}", v),
-    Err(e) => println!("error parsing header: {:?}", e),
-}
- -

Pattern matching on Results is clear and straightforward for -simple cases, but Result comes with some convenience methods -that make working with it more succinct.

- -
-let good_result: Result<i32, i32> = Ok(10);
-let bad_result: Result<i32, i32> = Err(10);
-
-// The `is_ok` and `is_err` methods do what they say.
-assert!(good_result.is_ok() && !good_result.is_err());
-assert!(bad_result.is_err() && !bad_result.is_ok());
-
-// `map` consumes the `Result` and produces another.
-let good_result: Result<i32, i32> = good_result.map(|i| i + 1);
-let bad_result: Result<i32, i32> = bad_result.map(|i| i - 1);
-
-// Use `and_then` to continue the computation.
-let good_result: Result<bool, i32> = good_result.and_then(|i| Ok(i == 11));
-
-// Use `or_else` to handle the error.
-let bad_result: Result<i32, i32> = bad_result.or_else(|i| Ok(i + 20));
-
-// Consume the result and return the contents with `unwrap`.
-let final_awesome_result = good_result.unwrap();
- -

Results must be used

-

A common problem with using return values to indicate errors is -that it is easy to ignore the return value, thus failing to handle -the error. Result is annotated with the #[must_use] attribute, -which will cause the compiler to issue a warning when a Result -value is ignored. This makes Result especially useful with -functions that may encounter errors but don't otherwise return a -useful value.

- -

Consider the write_all method defined for I/O types -by the Write trait:

- -
-use std::io;
-
-trait Write {
-    fn write_all(&mut self, bytes: &[u8]) -> Result<(), io::Error>;
-}
- -

Note: The actual definition of Write uses io::Result, which -is just a synonym for Result<T, io::Error>.

- -

This method doesn't produce a value, but the write may -fail. It's crucial to handle the error case, and not write -something like this:

- -
-use std::fs::File;
-use std::io::prelude::*;
-
-let mut file = File::create("valuable_data.txt").unwrap();
-// If `write_all` errors, then we'll never know, because the return
-// value is ignored.
-file.write_all(b"important message");
- -

If you do write that in Rust, the compiler will give you a -warning (by default, controlled by the unused_must_use lint).

- -

You might instead, if you don't want to handle the error, simply -assert success with expect. This will panic if the -write fails, providing a marginally useful message indicating why:

- -
-use std::fs::File;
-use std::io::prelude::*;
-
-let mut file = File::create("valuable_data.txt").unwrap();
-file.write_all(b"important message").expect("failed to write message");
- -

You might also simply assert success:

- -
-assert!(file.write_all(b"important message").is_ok());
- -

Or propagate the error up the call stack with try!:

- -
-fn write_message() -> io::Result<()> {
-    let mut file = try!(File::create("valuable_data.txt"));
-    try!(file.write_all(b"important message"));
-    Ok(())
-}
- -

The try! macro

-

When writing code that calls many functions that return the -Result type, the error handling can be tedious. The try! -macro hides some of the boilerplate of propagating errors up the -call stack.

- -

It replaces this:

- -
-use std::fs::File;
-use std::io::prelude::*;
-use std::io;
-
-struct Info {
-    name: String,
-    age: i32,
-    rating: i32,
-}
-
-fn write_info(info: &Info) -> io::Result<()> {
-    let mut file = try!(File::create("my_best_friends.txt"));
-    // Early return on error
-    if let Err(e) = file.write_all(format!("name: {}\n", info.name).as_bytes()) {
-        return Err(e)
-    }
-    if let Err(e) = file.write_all(format!("age: {}\n", info.age).as_bytes()) {
-        return Err(e)
-    }
-    if let Err(e) = file.write_all(format!("rating: {}\n", info.rating).as_bytes()) {
-        return Err(e)
-    }
-    Ok(())
-}
- -

With this:

- -
-use std::fs::File;
-use std::io::prelude::*;
-use std::io;
-
-struct Info {
-    name: String,
-    age: i32,
-    rating: i32,
-}
-
-fn write_info(info: &Info) -> io::Result<()> {
-    let mut file = try!(File::create("my_best_friends.txt"));
-    // Early return on error
-    try!(file.write_all(format!("name: {}\n", info.name).as_bytes()));
-    try!(file.write_all(format!("age: {}\n", info.age).as_bytes()));
-    try!(file.write_all(format!("rating: {}\n", info.rating).as_bytes()));
-    Ok(())
-}
- -

It's much nicer!

- -

Wrapping an expression in try! will result in the unwrapped -success (Ok) value, unless the result is Err, in which case -Err is returned early from the enclosing function. Its simple definition -makes it clear:

- -
-macro_rules! try {
-    ($e:expr) => (match $e { Ok(e) => e, Err(e) => return Err(e) })
-}
- -

try! is imported by the prelude and is available everywhere, but it can only -be used in functions that return Result because of the early return of -Err that it provides.

-

Structs

- - - - - - - - - - - - -
IntoIter -

An iterator over the value in a Ok variant of a Result.

-
Iter -

An iterator over a reference to the Ok variant of a Result.

-
IterMut -

An iterator over a mutable reference to the Ok variant of a Result.

-

Enums

- - - - -
Result -

Result is a type that represents either success (Ok) or failure (Err).

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/result/sidebar-items.js b/doc/bitflags/__core/result/sidebar-items.js deleted file mode 100644 index 54d05b5d..00000000 --- a/doc/bitflags/__core/result/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["Result","`Result` is a type that represents either success (`Ok`) or failure (`Err`)."]],"struct":[["IntoIter","An iterator over the value in a `Ok` variant of a `Result`."],["Iter","An iterator over a reference to the `Ok` variant of a `Result`."],["IterMut","An iterator over a mutable reference to the `Ok` variant of a `Result`."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/result/struct.IntoIter.html b/doc/bitflags/__core/result/struct.IntoIter.html deleted file mode 100644 index 59022b64..00000000 --- a/doc/bitflags/__core/result/struct.IntoIter.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::result::IntoIter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::result::IntoIter - - [−] - - [src]

-
pub struct IntoIter<T> {
-    // some fields omitted
-}
1.0.0

An iterator over the value in a Ok variant of a Result.

-

Trait Implementations

impl<T> Iterator for IntoIter<T>

type Item = T

-

fn next(&mut self) -> Option<T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<T> DoubleEndedIterator for IntoIter<T>

fn next_back(&mut self) -> Option<T>

-

impl<T> ExactSizeIterator for IntoIter<T>

fn len(&self) -> usize

-

Derived Implementations

impl<T> Debug for IntoIter<T> where T: Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/result/struct.Iter.html b/doc/bitflags/__core/result/struct.Iter.html deleted file mode 100644 index 2bf1b2d6..00000000 --- a/doc/bitflags/__core/result/struct.Iter.html +++ /dev/null @@ -1,168 +0,0 @@ - - - - - - - - - - bitflags::__core::result::Iter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::result::Iter - - [−] - - [src]

-
pub struct Iter<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

An iterator over a reference to the Ok variant of a Result.

-

Trait Implementations

impl<'a, T> Iterator for Iter<'a, T>

type Item = &'a T

-

fn next(&mut self) -> Option<&'a T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T> DoubleEndedIterator for Iter<'a, T>

fn next_back(&mut self) -> Option<&'a T>

-

impl<'a, T> ExactSizeIterator for Iter<'a, T>

fn len(&self) -> usize

-

impl<'a, T> Clone for Iter<'a, T>

fn clone(&self) -> Iter<'a, T>

-

fn clone_from(&mut self, source: &Self)

-

Derived Implementations

impl<'a, T> Debug for Iter<'a, T> where T: 'a + Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/result/struct.IterMut.html b/doc/bitflags/__core/result/struct.IterMut.html deleted file mode 100644 index 8b5602c8..00000000 --- a/doc/bitflags/__core/result/struct.IterMut.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::result::IterMut - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::result::IterMut - - [−] - - [src]

-
pub struct IterMut<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

An iterator over a mutable reference to the Ok variant of a Result.

-

Trait Implementations

impl<'a, T> Iterator for IterMut<'a, T>

type Item = &'a mut T

-

fn next(&mut self) -> Option<&'a mut T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T> DoubleEndedIterator for IterMut<'a, T>

fn next_back(&mut self) -> Option<&'a mut T>

-

impl<'a, T> ExactSizeIterator for IterMut<'a, T>

fn len(&self) -> usize

-

Derived Implementations

impl<'a, T> Debug for IterMut<'a, T> where T: 'a + Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/rt/fn.begin_unwind.html b/doc/bitflags/__core/rt/fn.begin_unwind.html deleted file mode 100644 index b50294cf..00000000 --- a/doc/bitflags/__core/rt/fn.begin_unwind.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../std/sys_common/unwind/fn.begin_unwind.html...

- - - \ No newline at end of file diff --git a/doc/bitflags/__core/rt/fn.begin_unwind_fmt.html b/doc/bitflags/__core/rt/fn.begin_unwind_fmt.html deleted file mode 100644 index 0dc27236..00000000 --- a/doc/bitflags/__core/rt/fn.begin_unwind_fmt.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../std/sys_common/unwind/fn.begin_unwind_fmt.html...

- - - \ No newline at end of file diff --git a/doc/bitflags/__core/rt/index.html b/doc/bitflags/__core/rt/index.html deleted file mode 100644 index 5b1212c4..00000000 --- a/doc/bitflags/__core/rt/index.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../std/rt/index.html...

- - - \ No newline at end of file diff --git a/doc/bitflags/__core/rt/sidebar-items.js b/doc/bitflags/__core/rt/sidebar-items.js deleted file mode 100644 index 8940637a..00000000 --- a/doc/bitflags/__core/rt/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["begin_unwind","This is the entry point of unwinding for panic!() and assert!()."],["begin_unwind_fmt","The entry point for unwinding with a formatted message."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/sidebar-items.js b/doc/bitflags/__core/sidebar-items.js deleted file mode 100644 index 97e8c24c..00000000 --- a/doc/bitflags/__core/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"mod":[["any","This module implements the `Any` trait, which enables dynamic typing of any `'static` type through runtime reflection."],["ascii","Operations on ASCII strings and characters."],["borrow","A module for working with borrowed data."],["boxed","A pointer type for heap allocation."],["cell","Shareable mutable containers."],["char","A character type."],["clone","The `Clone` trait for types that cannot be 'implicitly copied'."],["cmp","Functionality for ordering and comparison."],["collections","Collection types."],["convert","Traits for conversions between types."],["default","The `Default` trait for types which may have meaningful default values."],["env","Inspection and manipulation of the process's environment."],["error","Traits for working with Errors."],["f32","The 32-bit floating point type."],["f64","The 64-bit floating point type."],["ffi","Utilities related to FFI bindings."],["fmt","Utilities for formatting and printing strings"],["fs","Filesystem manipulation operations."],["hash","Generic hashing support."],["i16","The 16-bit signed integer type."],["i32","The 32-bit signed integer type."],["i64","The 64-bit signed integer type."],["i8","The 8-bit signed integer type."],["intrinsics","rustc compiler intrinsics."],["io","Traits, helpers, and type definitions for core I/O functionality."],["isize","The pointer-sized signed integer type."],["iter","Composable external iteration."],["marker","Primitive traits and marker types representing basic 'kinds' of types."],["mem","Basic functions for dealing with memory."],["net","Networking primitives for TCP/UDP communication."],["num","Additional functionality for numerics."],["ops","Overloadable operators."],["option","Optional values."],["os","OS-specific functionality."],["panic","Panic support in the standard library"],["path","Cross-platform path manipulation."],["prelude","The Rust Prelude."],["process","Working with processes."],["ptr","Raw, unsafe pointers, `*const T`, and `*mut T`."],["raw","Contains struct definitions for the layout of compiler built-in types."],["rc","Thread-local reference-counted boxes (the `Rc` type)."],["result","Error handling with the `Result` type."],["slice","A dynamically-sized view into a contiguous sequence, `[T]`."],["str","Unicode string slices."],["string","A UTF-8 encoded, growable string."],["sync","Useful synchronization primitives."],["thread","Native threads."],["time","Temporal quantification."],["u16","The 16-bit unsigned integer type."],["u32","The 32-bit unsigned integer type."],["u64","The 64-bit unsigned integer type."],["u8","The 8-bit unsigned integer type."],["usize","The pointer-sized unsigned integer type."],["vec","A contiguous growable array type with heap-allocated contents, written `Vec` but pronounced 'vector.'"]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/slice/fn.from_raw_parts.html b/doc/bitflags/__core/slice/fn.from_raw_parts.html deleted file mode 100644 index 00d3fdfe..00000000 --- a/doc/bitflags/__core/slice/fn.from_raw_parts.html +++ /dev/null @@ -1,140 +0,0 @@ - - - - - - - - - - bitflags::__core::slice::from_raw_parts - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::slice::from_raw_parts - - [−] - - [src]

-
pub unsafe fn from_raw_parts<T>(p: *const T, len: usize) -> &'a [T]
1.0.0

Forms a slice from a pointer and a length.

- -

The len argument is the number of elements, not the number of bytes.

- -

Safety

-

This function is unsafe as there is no guarantee that the given pointer is -valid for len elements, nor whether the lifetime inferred is a suitable -lifetime for the returned slice.

- -

p must be non-null, even for zero-length slices.

- -

Caveat

-

The lifetime for the returned slice is inferred from its usage. To -prevent accidental misuse, it's suggested to tie the lifetime to whichever -source lifetime is safe in the context, such as by providing a helper -function taking the lifetime of a host value for the slice, or by explicit -annotation.

- -

Examples

-
-use std::slice;
-
-// manifest a slice out of thin air!
-let ptr = 0x1234 as *const usize;
-let amt = 10;
-unsafe {
-    let slice = slice::from_raw_parts(ptr, amt);
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/slice/fn.from_raw_parts_mut.html b/doc/bitflags/__core/slice/fn.from_raw_parts_mut.html deleted file mode 100644 index 7fb06ece..00000000 --- a/doc/bitflags/__core/slice/fn.from_raw_parts_mut.html +++ /dev/null @@ -1,118 +0,0 @@ - - - - - - - - - - bitflags::__core::slice::from_raw_parts_mut - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::slice::from_raw_parts_mut - - [−] - - [src]

-
pub unsafe fn from_raw_parts_mut<T>(p: *mut T, len: usize) -> &'a mut [T]
1.0.0

Performs the same functionality as from_raw_parts, except that a mutable -slice is returned.

- -

This function is unsafe for the same reasons as from_raw_parts, as well -as not being able to provide a non-aliasing guarantee of the returned -mutable slice.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/slice/index.html b/doc/bitflags/__core/slice/index.html deleted file mode 100644 index b2ae71a5..00000000 --- a/doc/bitflags/__core/slice/index.html +++ /dev/null @@ -1,293 +0,0 @@ - - - - - - - - - - bitflags::__core::slice - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::slice - - [−] - - [src]

-

A dynamically-sized view into a contiguous sequence, [T].

- -

Slices are a view into a block of memory represented as a pointer and a -length.

- -
-// slicing a Vec
-let vec = vec![1, 2, 3];
-let int_slice = &vec[..];
-// coercing an array to a slice
-let str_slice: &[&str] = &["one", "two", "three"];
- -

Slices are either mutable or shared. The shared slice type is &[T], -while the mutable slice type is &mut [T], where T represents the element -type. For example, you can mutate the block of memory that a mutable slice -points to:

- -
-let x = &mut [1, 2, 3];
-x[1] = 7;
-assert_eq!(x, &[1, 7, 3]);
- -

Here are some of the things this module contains:

- -

Structs

-

There are several structs that are useful for slices, such as Iter, which -represents iteration over a slice.

- -

Trait Implementations

-

There are several implementations of common traits for slices. Some examples -include:

- -
    -
  • Clone
    • -
  • Eq, Ord - for slices whose element type are Eq or Ord.
    • -
  • Hash - for slices whose element type is Hash
    • -
- -

Iteration

-

The slices implement IntoIterator. The iterator yields references to the -slice elements.

- -
-let numbers = &[0, 1, 2];
-for n in numbers {
-    println!("{} is a number!", n);
-}
- -

The mutable slice yields mutable references to the elements:

- -
-let mut scores = [7, 8, 9];
-for score in &mut scores[..] {
-    *score += 1;
-}
- -

This iterator yields mutable references to the slice's elements, so while -the element type of the slice is i32, the element type of the iterator is -&mut i32.

- -
    -
  • .iter() and .iter_mut() are the explicit methods to return the default -iterators.
    • -
  • Further methods that return iterators are .split(), .splitn(), -.chunks(), .windows() and more.
    • -
- -

See also the slice primitive type.

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Chunks -

An iterator over a slice in (non-overlapping) chunks (size elements at a -time).

-
ChunksMut -

An iterator over a slice in (non-overlapping) mutable chunks (size -elements at a time). When the slice len is not evenly divided by the chunk -size, the last slice of the iteration will be the remainder.

-
Iter -

Immutable slice iterator

-
IterMut -

Mutable slice iterator.

-
RSplitN -

An iterator over subslices separated by elements that match a -predicate function, limited to a given number of splits, starting -from the end of the slice.

-
RSplitNMut -

An iterator over subslices separated by elements that match a -predicate function, limited to a given number of splits, starting -from the end of the slice.

-
Split -

An iterator over subslices separated by elements that match a predicate -function.

-
SplitMut -

An iterator over the subslices of the vector which are separated -by elements that match pred.

-
SplitN -

An iterator over subslices separated by elements that match a predicate -function, limited to a given number of splits.

-
SplitNMut -

An iterator over subslices separated by elements that match a predicate -function, limited to a given number of splits.

-
Windows -

An iterator over overlapping subslices of length size.

-

Traits

- - - - -
SliceConcatExt - [Unstable]

An extension trait for concatenating slices

-

Functions

- - - - - - - - -
from_raw_parts -

Forms a slice from a pointer and a length.

-
from_raw_parts_mut -

Performs the same functionality as from_raw_parts, except that a mutable -slice is returned.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/slice/sidebar-items.js b/doc/bitflags/__core/slice/sidebar-items.js deleted file mode 100644 index f8c3a713..00000000 --- a/doc/bitflags/__core/slice/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["from_raw_parts","Forms a slice from a pointer and a length."],["from_raw_parts_mut","Performs the same functionality as `from_raw_parts`, except that a mutable slice is returned."]],"struct":[["Chunks","An iterator over a slice in (non-overlapping) chunks (`size` elements at a time)."],["ChunksMut","An iterator over a slice in (non-overlapping) mutable chunks (`size` elements at a time). When the slice len is not evenly divided by the chunk size, the last slice of the iteration will be the remainder."],["Iter","Immutable slice iterator"],["IterMut","Mutable slice iterator."],["RSplitN","An iterator over subslices separated by elements that match a predicate function, limited to a given number of splits, starting from the end of the slice."],["RSplitNMut","An iterator over subslices separated by elements that match a predicate function, limited to a given number of splits, starting from the end of the slice."],["Split","An iterator over subslices separated by elements that match a predicate function."],["SplitMut","An iterator over the subslices of the vector which are separated by elements that match `pred`."],["SplitN","An iterator over subslices separated by elements that match a predicate function, limited to a given number of splits."],["SplitNMut","An iterator over subslices separated by elements that match a predicate function, limited to a given number of splits."],["Windows","An iterator over overlapping subslices of length `size`."]],"trait":[["SliceConcatExt","An extension trait for concatenating slices"]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/slice/struct.Chunks.html b/doc/bitflags/__core/slice/struct.Chunks.html deleted file mode 100644 index b4c6d675..00000000 --- a/doc/bitflags/__core/slice/struct.Chunks.html +++ /dev/null @@ -1,172 +0,0 @@ - - - - - - - - - - bitflags::__core::slice::Chunks - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::slice::Chunks - - [−] - - [src]

-
pub struct Chunks<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

An iterator over a slice in (non-overlapping) chunks (size elements at a -time).

- -

When the slice len is not evenly divided by the chunk size, the last slice -of the iteration will be the remainder.

-

Trait Implementations

impl<'a, T> Clone for Chunks<'a, T>

fn clone(&self) -> Chunks<'a, T>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, T> Iterator for Chunks<'a, T>

type Item = &'a [T]

-

fn next(&mut self) -> Option<&'a [T]>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn nth(&mut self, n: usize) -> Option<Chunks<'a, T>::Item>

-

fn last(self) -> Option<Chunks<'a, T>::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T> DoubleEndedIterator for Chunks<'a, T>

fn next_back(&mut self) -> Option<&'a [T]>

-

impl<'a, T> ExactSizeIterator for Chunks<'a, T>

fn len(&self) -> usize

-

Derived Implementations

impl<'a, T> Debug for Chunks<'a, T> where T: 'a + Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/slice/struct.ChunksMut.html b/doc/bitflags/__core/slice/struct.ChunksMut.html deleted file mode 100644 index 37216e4b..00000000 --- a/doc/bitflags/__core/slice/struct.ChunksMut.html +++ /dev/null @@ -1,168 +0,0 @@ - - - - - - - - - - bitflags::__core::slice::ChunksMut - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::slice::ChunksMut - - [−] - - [src]

-
pub struct ChunksMut<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

An iterator over a slice in (non-overlapping) mutable chunks (size -elements at a time). When the slice len is not evenly divided by the chunk -size, the last slice of the iteration will be the remainder.

-

Trait Implementations

impl<'a, T> Iterator for ChunksMut<'a, T>

type Item = &'a mut [T]

-

fn next(&mut self) -> Option<&'a mut [T]>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn nth(&mut self, n: usize) -> Option<&'a mut [T]>

-

fn last(self) -> Option<ChunksMut<'a, T>::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T> DoubleEndedIterator for ChunksMut<'a, T>

fn next_back(&mut self) -> Option<&'a mut [T]>

-

impl<'a, T> ExactSizeIterator for ChunksMut<'a, T>

fn len(&self) -> usize

-

Derived Implementations

impl<'a, T> Debug for ChunksMut<'a, T> where T: 'a + Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/slice/struct.Iter.html b/doc/bitflags/__core/slice/struct.Iter.html deleted file mode 100644 index 9f8ff5ca..00000000 --- a/doc/bitflags/__core/slice/struct.Iter.html +++ /dev/null @@ -1,203 +0,0 @@ - - - - - - - - - - bitflags::__core::slice::Iter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::slice::Iter - - [−] - - [src]

-
pub struct Iter<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

Immutable slice iterator

- -

Examples

-

Basic usage:

- -
-// First, we declare a type which has `iter` method to get the `Iter` struct (&[usize here]):
-let slice = &[1, 2, 3];
-
-// Then, we iterate over it:
-for element in slice.iter() {
-    println!("{}", element);
-}
-

Methods

impl<'a, T> Iter<'a, T>

fn as_slice(&self) -> &'a [T]1.4.0

-

View the underlying data as a subslice of the original data.

- -

This has the same lifetime as the original slice, and so the -iterator can continue to be used while this exists.

- -

Examples

-

Basic usage:

- -
-// First, we declare a type which has the `iter` method to get the `Iter`
-// struct (&[usize here]):
-let slice = &[1, 2, 3];
-
-// Then, we get the iterator:
-let mut iter = slice.iter();
-// So if we print what `as_slice` method returns here, we have "[1, 2, 3]":
-println!("{:?}", iter.as_slice());
-
-// Next, we move to the second element of the slice:
-iter.next();
-// Now `as_slice` returns "[2, 3]":
-println!("{:?}", iter.as_slice());
-

Trait Implementations

impl<'a, T> Debug for Iter<'a, T> where T: 'a + Debug1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, T> Sync for Iter<'a, T> where T: Sync

impl<'a, T> Send for Iter<'a, T> where T: Sync

impl<'a, T> Iterator for Iter<'a, T>

type Item = &'a T

-

fn next(&mut self) -> Option<&'a T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn nth(&mut self, n: usize) -> Option<&'a T>

-

fn last(self) -> Option<&'a T>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T> DoubleEndedIterator for Iter<'a, T>

fn next_back(&mut self) -> Option<&'a T>

-

impl<'a, T> ExactSizeIterator for Iter<'a, T>

fn len(&self) -> usize

-

impl<'a, T> Clone for Iter<'a, T>

fn clone(&self) -> Iter<'a, T>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/slice/struct.IterMut.html b/doc/bitflags/__core/slice/struct.IterMut.html deleted file mode 100644 index b0fca465..00000000 --- a/doc/bitflags/__core/slice/struct.IterMut.html +++ /dev/null @@ -1,216 +0,0 @@ - - - - - - - - - - bitflags::__core::slice::IterMut - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::slice::IterMut - - [−] - - [src]

-
pub struct IterMut<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

Mutable slice iterator.

- -

Examples

-

Basic usage:

- -
-// First, we declare a type which has `iter_mut` method to get the `IterMut`
-// struct (&[usize here]):
-let mut slice = &mut [1, 2, 3];
-
-// Then, we iterate over it and increment each element value:
-for element in slice.iter_mut() {
-    *element += 1;
-}
-
-// We now have "[2, 3, 4]":
-println!("{:?}", slice);
-

Methods

impl<'a, T> IterMut<'a, T>

fn into_slice(self) -> &'a mut [T]1.4.0

-

View the underlying data as a subslice of the original data.

- -

To avoid creating &mut references that alias, this is forced -to consume the iterator. Consider using the Slice and -SliceMut implementations for obtaining slices with more -restricted lifetimes that do not consume the iterator.

- -

Examples

-

Basic usage:

- -
-// First, we declare a type which has `iter_mut` method to get the `IterMut`
-// struct (&[usize here]):
-let mut slice = &mut [1, 2, 3];
-
-{
-    // Then, we get the iterator:
-    let mut iter = slice.iter_mut();
-    // We move to next element:
-    iter.next();
-    // So if we print what `into_slice` method returns here, we have "[2, 3]":
-    println!("{:?}", iter.into_slice());
-}
-
-// Now let's modify a value of the slice:
-{
-    // First we get back the iterator:
-    let mut iter = slice.iter_mut();
-    // We change the value of the first element of the slice returned by the `next` method:
-    *iter.next().unwrap() += 1;
-}
-// Now slice is "[2, 2, 3]":
-println!("{:?}", slice);
-

Trait Implementations

impl<'a, T> Debug for IterMut<'a, T> where T: 'a + Debug1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, T> Sync for IterMut<'a, T> where T: Sync

impl<'a, T> Send for IterMut<'a, T> where T: Send

impl<'a, T> Iterator for IterMut<'a, T>

type Item = &'a mut T

-

fn next(&mut self) -> Option<&'a mut T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn nth(&mut self, n: usize) -> Option<&'a mut T>

-

fn last(self) -> Option<&'a mut T>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T> DoubleEndedIterator for IterMut<'a, T>

fn next_back(&mut self) -> Option<&'a mut T>

-

impl<'a, T> ExactSizeIterator for IterMut<'a, T>

fn len(&self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/slice/struct.RSplitN.html b/doc/bitflags/__core/slice/struct.RSplitN.html deleted file mode 100644 index 682e0c01..00000000 --- a/doc/bitflags/__core/slice/struct.RSplitN.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::slice::RSplitN - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::slice::RSplitN - - [−] - - [src]

-
pub struct RSplitN<'a, T, P> where T: 'a, P: FnMut(&T) -> bool {
-    // some fields omitted
-}
1.0.0

An iterator over subslices separated by elements that match a -predicate function, limited to a given number of splits, starting -from the end of the slice.

-

Trait Implementations

impl<'a, T, P> Debug for RSplitN<'a, T, P> where T: 'a + Debug, P: FnMut(&T) -> bool1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, T, P> Iterator for RSplitN<'a, T, P> where P: FnMut(&T) -> bool

type Item = &'a [T]

-

fn next(&mut self) -> Option<&'a [T]>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/slice/struct.RSplitNMut.html b/doc/bitflags/__core/slice/struct.RSplitNMut.html deleted file mode 100644 index 6579f594..00000000 --- a/doc/bitflags/__core/slice/struct.RSplitNMut.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::slice::RSplitNMut - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::slice::RSplitNMut - - [−] - - [src]

-
pub struct RSplitNMut<'a, T, P> where T: 'a, P: FnMut(&T) -> bool {
-    // some fields omitted
-}
1.0.0

An iterator over subslices separated by elements that match a -predicate function, limited to a given number of splits, starting -from the end of the slice.

-

Trait Implementations

impl<'a, T, P> Debug for RSplitNMut<'a, T, P> where T: 'a + Debug, P: FnMut(&T) -> bool1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, T, P> Iterator for RSplitNMut<'a, T, P> where P: FnMut(&T) -> bool

type Item = &'a mut [T]

-

fn next(&mut self) -> Option<&'a mut [T]>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/slice/struct.Split.html b/doc/bitflags/__core/slice/struct.Split.html deleted file mode 100644 index feb86756..00000000 --- a/doc/bitflags/__core/slice/struct.Split.html +++ /dev/null @@ -1,168 +0,0 @@ - - - - - - - - - - bitflags::__core::slice::Split - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::slice::Split - - [−] - - [src]

-
pub struct Split<'a, T, P> where T: 'a, P: FnMut(&T) -> bool {
-    // some fields omitted
-}
1.0.0

An iterator over subslices separated by elements that match a predicate -function.

-

Trait Implementations

impl<'a, T, P> Debug for Split<'a, T, P> where P: FnMut(&T) -> bool, T: 'a + Debug1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, T, P> Clone for Split<'a, T, P> where P: Clone + FnMut(&T) -> bool

fn clone(&self) -> Split<'a, T, P>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, T, P> Iterator for Split<'a, T, P> where P: FnMut(&T) -> bool

type Item = &'a [T]

-

fn next(&mut self) -> Option<&'a [T]>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T, P> DoubleEndedIterator for Split<'a, T, P> where P: FnMut(&T) -> bool

fn next_back(&mut self) -> Option<&'a [T]>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/slice/struct.SplitMut.html b/doc/bitflags/__core/slice/struct.SplitMut.html deleted file mode 100644 index f35da815..00000000 --- a/doc/bitflags/__core/slice/struct.SplitMut.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::slice::SplitMut - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::slice::SplitMut - - [−] - - [src]

-
pub struct SplitMut<'a, T, P> where T: 'a, P: FnMut(&T) -> bool {
-    // some fields omitted
-}
1.0.0

An iterator over the subslices of the vector which are separated -by elements that match pred.

-

Trait Implementations

impl<'a, T, P> Debug for SplitMut<'a, T, P> where P: FnMut(&T) -> bool, T: 'a + Debug1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, T, P> Iterator for SplitMut<'a, T, P> where P: FnMut(&T) -> bool

type Item = &'a mut [T]

-

fn next(&mut self) -> Option<&'a mut [T]>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T, P> DoubleEndedIterator for SplitMut<'a, T, P> where P: FnMut(&T) -> bool

fn next_back(&mut self) -> Option<&'a mut [T]>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/slice/struct.SplitN.html b/doc/bitflags/__core/slice/struct.SplitN.html deleted file mode 100644 index 07e22bc5..00000000 --- a/doc/bitflags/__core/slice/struct.SplitN.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::slice::SplitN - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::slice::SplitN - - [−] - - [src]

-
pub struct SplitN<'a, T, P> where T: 'a, P: FnMut(&T) -> bool {
-    // some fields omitted
-}
1.0.0

An iterator over subslices separated by elements that match a predicate -function, limited to a given number of splits.

-

Trait Implementations

impl<'a, T, P> Debug for SplitN<'a, T, P> where P: FnMut(&T) -> bool, T: 'a + Debug1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, T, P> Iterator for SplitN<'a, T, P> where P: FnMut(&T) -> bool

type Item = &'a [T]

-

fn next(&mut self) -> Option<&'a [T]>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/slice/struct.SplitNMut.html b/doc/bitflags/__core/slice/struct.SplitNMut.html deleted file mode 100644 index 8d880808..00000000 --- a/doc/bitflags/__core/slice/struct.SplitNMut.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::slice::SplitNMut - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::slice::SplitNMut - - [−] - - [src]

-
pub struct SplitNMut<'a, T, P> where P: FnMut(&T) -> bool, T: 'a {
-    // some fields omitted
-}
1.0.0

An iterator over subslices separated by elements that match a predicate -function, limited to a given number of splits.

-

Trait Implementations

impl<'a, T, P> Debug for SplitNMut<'a, T, P> where P: FnMut(&T) -> bool, T: 'a + Debug1.9.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, T, P> Iterator for SplitNMut<'a, T, P> where P: FnMut(&T) -> bool

type Item = &'a mut [T]

-

fn next(&mut self) -> Option<&'a mut [T]>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/slice/struct.Windows.html b/doc/bitflags/__core/slice/struct.Windows.html deleted file mode 100644 index c0bf5886..00000000 --- a/doc/bitflags/__core/slice/struct.Windows.html +++ /dev/null @@ -1,168 +0,0 @@ - - - - - - - - - - bitflags::__core::slice::Windows - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::slice::Windows - - [−] - - [src]

-
pub struct Windows<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

An iterator over overlapping subslices of length size.

-

Trait Implementations

impl<'a, T> Clone for Windows<'a, T>

fn clone(&self) -> Windows<'a, T>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, T> Iterator for Windows<'a, T>

type Item = &'a [T]

-

fn next(&mut self) -> Option<&'a [T]>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn nth(&mut self, n: usize) -> Option<Windows<'a, T>::Item>

-

fn last(self) -> Option<Windows<'a, T>::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T> DoubleEndedIterator for Windows<'a, T>

fn next_back(&mut self) -> Option<&'a [T]>

-

impl<'a, T> ExactSizeIterator for Windows<'a, T>

fn len(&self) -> usize

-

Derived Implementations

impl<'a, T> Debug for Windows<'a, T> where T: 'a + Debug

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/slice/trait.SliceConcatExt.html b/doc/bitflags/__core/slice/trait.SliceConcatExt.html deleted file mode 100644 index 423832b4..00000000 --- a/doc/bitflags/__core/slice/trait.SliceConcatExt.html +++ /dev/null @@ -1,146 +0,0 @@ - - - - - - - - - - bitflags::__core::slice::SliceConcatExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::slice::SliceConcatExt - - [−] - - [src]

-
pub trait SliceConcatExt<T> where T: ?Sized {
-    type Output;
-    fn concat(&self) -> Self::Output;
-    fn join(&self, sep: &T) -> Self::Output;
-    fn connect(&self, sep: &T) -> Self::Output;
-}
Unstable (slice_concat_ext)

: trait should not have to exist

-

An extension trait for concatenating slices

-
-

Associated Types

-
-

type Output

Unstable (slice_concat_ext)

: trait should not have to exist

-

The resulting type after concatenation

-
-

Required Methods

-
-

fn concat(&self) -> Self::Output1.0.0

Flattens a slice of T into a single value Self::Output.

- -

Examples

-
-assert_eq!(["hello", "world"].concat(), "helloworld");
-

fn join(&self, sep: &T) -> Self::Output1.3.0

Flattens a slice of T into a single value Self::Output, placing a -given separator between each.

- -

Examples

-
-assert_eq!(["hello", "world"].join(" "), "hello world");
-

fn connect(&self, sep: &T) -> Self::Output1.0.0

Deprecated since 1.3.0

: renamed to join

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/fn.from_utf8.html b/doc/bitflags/__core/str/fn.from_utf8.html deleted file mode 100644 index 744c29ae..00000000 --- a/doc/bitflags/__core/str/fn.from_utf8.html +++ /dev/null @@ -1,175 +0,0 @@ - - - - - - - - - - bitflags::__core::str::from_utf8 - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::str::from_utf8 - - [−] - - [src]

-
pub fn from_utf8(v: &[u8]) -> Result<&str, Utf8Error>
1.0.0

Converts a slice of bytes to a string slice.

- -

A string slice (&str) is made of bytes (u8), and a byte slice (&[u8]) -is made of bytes, so this function converts between the two. Not all byte -slices are valid string slices, however: &str requires that it is valid -UTF-8. from_utf8() checks to ensure that the bytes are valid UTF-8, and -then does the conversion.

- -

If you are sure that the byte slice is valid UTF-8, and you don't want to -incur the overhead of the validity check, there is an unsafe version of -this function, from_utf8_unchecked(), which has the same -behavior but skips the check.

- -

If you need a String instead of a &str, consider -String::from_utf8().

- -

Because you can stack-allocate a [u8; N], and you can take a &[u8] of -it, this function is one way to have a stack-allocated string. There is -an example of this in the examples section below.

- -

Errors

-

Returns Err if the slice is not UTF-8 with a description as to why the -provided slice is not UTF-8.

- -

Examples

-

Basic usage:

- -
-use std::str;
-
-// some bytes, in a vector
-let sparkle_heart = vec![240, 159, 146, 150];
-
-// We know these bytes are valid, so just use `unwrap()`.
-let sparkle_heart = str::from_utf8(&sparkle_heart).unwrap();
-
-assert_eq!("💖", sparkle_heart);
- -

Incorrect bytes:

- -
-use std::str;
-
-// some invalid bytes, in a vector
-let sparkle_heart = vec![0, 159, 146, 150];
-
-assert!(str::from_utf8(&sparkle_heart).is_err());
- -

See the docs for Utf8Error for more details on the kinds of -errors that can be returned.

- -

A "stack allocated string":

- -
-use std::str;
-
-// some bytes, in a stack-allocated array
-let sparkle_heart = [240, 159, 146, 150];
-
-// We know these bytes are valid, so just use `unwrap()`.
-let sparkle_heart = str::from_utf8(&sparkle_heart).unwrap();
-
-assert_eq!("💖", sparkle_heart);
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/fn.from_utf8_unchecked.html b/doc/bitflags/__core/str/fn.from_utf8_unchecked.html deleted file mode 100644 index 6404d5a4..00000000 --- a/doc/bitflags/__core/str/fn.from_utf8_unchecked.html +++ /dev/null @@ -1,136 +0,0 @@ - - - - - - - - - - bitflags::__core::str::from_utf8_unchecked - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::str::from_utf8_unchecked - - [−] - - [src]

-
pub unsafe fn from_utf8_unchecked(v: &[u8]) -> &str
1.0.0

Converts a slice of bytes to a string slice without checking -that the string contains valid UTF-8.

- -

See the safe version, from_utf8(), for more information.

- -

Safety

-

This function is unsafe because it does not check that the bytes passed to -it are valid UTF-8. If this constraint is violated, undefined behavior -results, as the rest of Rust assumes that &strs are valid UTF-8.

- -

Examples

-

Basic usage:

- -
-use std::str;
-
-// some bytes, in a vector
-let sparkle_heart = vec![240, 159, 146, 150];
-
-let sparkle_heart = unsafe {
-    str::from_utf8_unchecked(&sparkle_heart)
-};
-
-assert_eq!("💖", sparkle_heart);
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/index.html b/doc/bitflags/__core/str/index.html deleted file mode 100644 index e92b2c87..00000000 --- a/doc/bitflags/__core/str/index.html +++ /dev/null @@ -1,302 +0,0 @@ - - - - - - - - - - bitflags::__core::str - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::str - - [−] - - [src]

-

Unicode string slices.

- -

See also the str primitive type.

-

Modules

- - - - -
pattern - [Unstable]

The string Pattern API.

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Bytes -

External iterator for a string's bytes. -Use with the std::iter module.

-
CharIndices -

Iterator for a string's characters and their byte offsets.

-
Chars -

Iterator for the char (representing Unicode Scalar Values) of a string

-
EncodeUtf16 -

External iterator for a string's UTF-16 code units.

-
Lines -

Created with the method lines().

-
LinesAny - [Deprecated]

Created with the method lines_any().

-
MatchIndices -

Created with the method match_indices().

-
Matches -

Created with the method matches().

-
ParseBoolError -

An error returned when parsing a bool from a string fails.

-
RMatchIndices -

Created with the method rmatch_indices().

-
RMatches -

Created with the method rmatches().

-
RSplit -

Created with the method rsplit().

-
RSplitN -

Created with the method rsplitn().

-
RSplitTerminator -

Created with the method rsplit_terminator().

-
Split -

Created with the method split().

-
SplitN -

Created with the method splitn().

-
SplitTerminator -

Created with the method split_terminator().

-
SplitWhitespace -

An iterator over the non-whitespace substrings of a string, -separated by any amount of whitespace.

-
Utf8Error -

Errors which can occur when attempting to interpret a sequence of u8 -as a string.

-
CharRange - [Unstable]

Struct that contains a char and the index of the first byte of -the next char in a string. This can be used as a data structure -for iterating over the UTF-8 bytes of a string.

-

Traits

- - - - -
FromStr -

A trait to abstract the idea of creating a new instance of a type from a -string.

-

Functions

- - - - - - - - -
from_utf8 -

Converts a slice of bytes to a string slice.

-
from_utf8_unchecked -

Converts a slice of bytes to a string slice without checking -that the string contains valid UTF-8.

-

Type Definitions

- - - - -
Utf16Units - [Deprecated] [Unstable] -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/pattern/enum.SearchStep.html b/doc/bitflags/__core/str/pattern/enum.SearchStep.html deleted file mode 100644 index 49348f65..00000000 --- a/doc/bitflags/__core/str/pattern/enum.SearchStep.html +++ /dev/null @@ -1,140 +0,0 @@ - - - - - - - - - - bitflags::__core::str::pattern::SearchStep - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::str::pattern::SearchStep - - [−] - - [src]

-
pub enum SearchStep {
-    Match(usize, usize),
-    Reject(usize, usize),
-    Done,
-}
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Result of calling Searcher::next() or ReverseSearcher::next_back().

-

Variants

-
Match
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Expresses that a match of the pattern has been found at -haystack[a..b].

-
Reject
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Expresses that haystack[a..b] has been rejected as a possible match -of the pattern.

- -

Note that there might be more than one Reject between two Matches, -there is no requirement for them to be combined into one.

-
Done
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Expresses that every byte of the haystack has been visted, ending -the iteration.

-

Trait Implementations

Derived Implementations

impl Debug for SearchStep

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

impl PartialEq<SearchStep> for SearchStep

fn eq(&self, __arg_0: &SearchStep) -> bool

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn ne(&self, __arg_0: &SearchStep) -> bool

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

impl Eq for SearchStep

impl Clone for SearchStep

fn clone(&self) -> SearchStep

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Copy for SearchStep

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/pattern/index.html b/doc/bitflags/__core/str/pattern/index.html deleted file mode 100644 index 1253b183..00000000 --- a/doc/bitflags/__core/str/pattern/index.html +++ /dev/null @@ -1,184 +0,0 @@ - - - - - - - - - - bitflags::__core::str::pattern - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::str::pattern - - [−] - - [src]

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

The string Pattern API.

- -

For more details, see the traits Pattern, Searcher, -ReverseSearcher and DoubleEndedSearcher.

-

Structs

- - - - - - - - - - - - - - - - -
CharPredicateSearcher - [Unstable]

Associated type for <F as Pattern<'a>>::Searcher.

-
CharSearcher - [Unstable]

Associated type for <char as Pattern<'a>>::Searcher.

-
CharSliceSearcher - [Unstable]

Associated type for <&[char] as Pattern<'a>>::Searcher.

-
StrSearcher - [Unstable]

Associated type for <&str as Pattern<'a>>::Searcher.

-

Enums

- - - - -
SearchStep - [Unstable]

Result of calling Searcher::next() or ReverseSearcher::next_back().

-

Traits

- - - - - - - - - - - - - - - - -
DoubleEndedSearcher - [Unstable]

A marker trait to express that a ReverseSearcher -can be used for a DoubleEndedIterator implementation.

-
Pattern - [Unstable]

A string pattern.

-
ReverseSearcher - [Unstable]

A reverse searcher for a string pattern.

-
Searcher - [Unstable]

A searcher for a string pattern.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/pattern/sidebar-items.js b/doc/bitflags/__core/str/pattern/sidebar-items.js deleted file mode 100644 index cb556347..00000000 --- a/doc/bitflags/__core/str/pattern/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["SearchStep","Result of calling `Searcher::next()` or `ReverseSearcher::next_back()`."]],"struct":[["CharPredicateSearcher","Associated type for `>::Searcher`."],["CharSearcher","Associated type for `>::Searcher`."],["CharSliceSearcher","Associated type for `<&[char] as Pattern<'a>>::Searcher`."],["StrSearcher","Associated type for `<&str as Pattern<'a>>::Searcher`."]],"trait":[["DoubleEndedSearcher","A marker trait to express that a `ReverseSearcher` can be used for a `DoubleEndedIterator` implementation."],["Pattern","A string pattern."],["ReverseSearcher","A reverse searcher for a string pattern."],["Searcher","A searcher for a string pattern."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/str/pattern/struct.CharPredicateSearcher.html b/doc/bitflags/__core/str/pattern/struct.CharPredicateSearcher.html deleted file mode 100644 index c16414fe..00000000 --- a/doc/bitflags/__core/str/pattern/struct.CharPredicateSearcher.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - bitflags::__core::str::pattern::CharPredicateSearcher - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::pattern::CharPredicateSearcher - - [−] - - [src]

-
pub struct CharPredicateSearcher<'a, F> where F: FnMut(char) -> bool(_);
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Associated type for <F as Pattern<'a>>::Searcher.

-

Trait Implementations

impl<'a, F> Debug for CharPredicateSearcher<'a, F> where F: FnMut(char) -> bool

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

impl<'a, F> Searcher<'a> for CharPredicateSearcher<'a, F> where F: FnMut(char) -> bool

fn haystack(&self) -> &'a str

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next(&mut self) -> SearchStep

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_match(&mut self) -> Option<(usize, usize)>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_reject(&mut self) -> Option<(usize, usize)>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

impl<'a, F> ReverseSearcher<'a> for CharPredicateSearcher<'a, F> where F: FnMut(char) -> bool

fn next_back(&mut self) -> SearchStep

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_match_back(&mut self) -> Option<(usize, usize)>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_reject_back(&mut self) -> Option<(usize, usize)>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

impl<'a, F> DoubleEndedSearcher<'a> for CharPredicateSearcher<'a, F> where F: FnMut(char) -> bool

Derived Implementations

impl<'a, F> Clone for CharPredicateSearcher<'a, F> where F: Clone + FnMut(char) -> bool

fn clone(&self) -> CharPredicateSearcher<'a, F>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/pattern/struct.CharSearcher.html b/doc/bitflags/__core/str/pattern/struct.CharSearcher.html deleted file mode 100644 index 84eda58c..00000000 --- a/doc/bitflags/__core/str/pattern/struct.CharSearcher.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - bitflags::__core::str::pattern::CharSearcher - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::pattern::CharSearcher - - [−] - - [src]

-
pub struct CharSearcher<'a>(_);
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Associated type for <char as Pattern<'a>>::Searcher.

-

Trait Implementations

impl<'a> Searcher<'a> for CharSearcher<'a>

fn haystack(&self) -> &'a str

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next(&mut self) -> SearchStep

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_match(&mut self) -> Option<(usize, usize)>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_reject(&mut self) -> Option<(usize, usize)>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

impl<'a> ReverseSearcher<'a> for CharSearcher<'a>

fn next_back(&mut self) -> SearchStep

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_match_back(&mut self) -> Option<(usize, usize)>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_reject_back(&mut self) -> Option<(usize, usize)>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

impl<'a> DoubleEndedSearcher<'a> for CharSearcher<'a>

Derived Implementations

impl<'a> Debug for CharSearcher<'a>

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

impl<'a> Clone for CharSearcher<'a>

fn clone(&self) -> CharSearcher<'a>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/pattern/struct.CharSliceSearcher.html b/doc/bitflags/__core/str/pattern/struct.CharSliceSearcher.html deleted file mode 100644 index efa421a6..00000000 --- a/doc/bitflags/__core/str/pattern/struct.CharSliceSearcher.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - bitflags::__core::str::pattern::CharSliceSearcher - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::pattern::CharSliceSearcher - - [−] - - [src]

-
pub struct CharSliceSearcher<'a, 'b>(_);
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Associated type for <&[char] as Pattern<'a>>::Searcher.

-

Trait Implementations

impl<'a, 'b> Searcher<'a> for CharSliceSearcher<'a, 'b>

fn haystack(&self) -> &'a str

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next(&mut self) -> SearchStep

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_match(&mut self) -> Option<(usize, usize)>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_reject(&mut self) -> Option<(usize, usize)>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

impl<'a, 'b> ReverseSearcher<'a> for CharSliceSearcher<'a, 'b>

fn next_back(&mut self) -> SearchStep

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_match_back(&mut self) -> Option<(usize, usize)>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_reject_back(&mut self) -> Option<(usize, usize)>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

impl<'a, 'b> DoubleEndedSearcher<'a> for CharSliceSearcher<'a, 'b>

Derived Implementations

impl<'a, 'b> Debug for CharSliceSearcher<'a, 'b>

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

impl<'a, 'b> Clone for CharSliceSearcher<'a, 'b>

fn clone(&self) -> CharSliceSearcher<'a, 'b>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/pattern/struct.StrSearcher.html b/doc/bitflags/__core/str/pattern/struct.StrSearcher.html deleted file mode 100644 index 74bc5da3..00000000 --- a/doc/bitflags/__core/str/pattern/struct.StrSearcher.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - bitflags::__core::str::pattern::StrSearcher - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::pattern::StrSearcher - - [−] - - [src]

-
pub struct StrSearcher<'a, 'b> {
-    // some fields omitted
-}
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Associated type for <&str as Pattern<'a>>::Searcher.

-

Trait Implementations

impl<'a, 'b> Searcher<'a> for StrSearcher<'a, 'b>

fn haystack(&self) -> &'a str

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next(&mut self) -> SearchStep

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_match(&mut self) -> Option<(usize, usize)>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_reject(&mut self) -> Option<(usize, usize)>

-

impl<'a, 'b> ReverseSearcher<'a> for StrSearcher<'a, 'b>

fn next_back(&mut self) -> SearchStep

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_match_back(&mut self) -> Option<(usize, usize)>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn next_reject_back(&mut self) -> Option<(usize, usize)>

-

Derived Implementations

impl<'a, 'b> Debug for StrSearcher<'a, 'b>

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

impl<'a, 'b> Clone for StrSearcher<'a, 'b>

fn clone(&self) -> StrSearcher<'a, 'b>

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/pattern/trait.DoubleEndedSearcher.html b/doc/bitflags/__core/str/pattern/trait.DoubleEndedSearcher.html deleted file mode 100644 index d9737654..00000000 --- a/doc/bitflags/__core/str/pattern/trait.DoubleEndedSearcher.html +++ /dev/null @@ -1,143 +0,0 @@ - - - - - - - - - - bitflags::__core::str::pattern::DoubleEndedSearcher - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::str::pattern::DoubleEndedSearcher - - [−] - - [src]

-
pub trait DoubleEndedSearcher<'a>: ReverseSearcher<'a> { }
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

A marker trait to express that a ReverseSearcher -can be used for a DoubleEndedIterator implementation.

- -

For this, the impl of Searcher and ReverseSearcher need -to follow these conditions:

- -
    -
  • All results of next() need to be identical -to the results of next_back() in reverse order.
    • -
  • next() and next_back() need to behave as -the two ends of a range of values, that is they -can not "walk past each other".
    • -
- -

Examples

-

char::Searcher is a DoubleEndedSearcher because searching for a -char only requires looking at one at a time, which behaves the same -from both ends.

- -

(&str)::Searcher is not a DoubleEndedSearcher because -the pattern "aa" in the haystack "aaa" matches as either -"[aa]a" or "a[aa]", depending from which side it is searched.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/pattern/trait.Pattern.html b/doc/bitflags/__core/str/pattern/trait.Pattern.html deleted file mode 100644 index a22491e1..00000000 --- a/doc/bitflags/__core/str/pattern/trait.Pattern.html +++ /dev/null @@ -1,162 +0,0 @@ - - - - - - - - - - bitflags::__core::str::pattern::Pattern - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::str::pattern::Pattern - - [−] - - [src]

-
pub trait Pattern<'a> {
-    type Searcher: Searcher<'a>;
-    fn into_searcher(self, haystack: &'a str) -> Self::Searcher;
-
-    fn is_contained_in(self, haystack: &'a str) -> bool { ... }
-    fn is_prefix_of(self, haystack: &'a str) -> bool { ... }
-    fn is_suffix_of(self, haystack: &'a str) -> bool where Self::Searcher: ReverseSearcher<'a> { ... }
-}
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

A string pattern.

- -

A Pattern<'a> expresses that the implementing type -can be used as a string pattern for searching in a &'a str.

- -

For example, both 'a' and "aa" are patterns that -would match at index 1 in the string "baaaab".

- -

The trait itself acts as a builder for an associated -Searcher type, which does the actual work of finding -occurrences of the pattern in a string.

-
-

Associated Types

-
-

type Searcher: Searcher<'a>

Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Associated searcher for this pattern

-
-

Required Methods

-
-

fn into_searcher(self, haystack: &'a str) -> Self::Searcher

Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Constructs the associated searcher from -self and the haystack to search in.

-
-

Provided Methods

-
-

fn is_contained_in(self, haystack: &'a str) -> bool

Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Checks whether the pattern matches anywhere in the haystack

-

fn is_prefix_of(self, haystack: &'a str) -> bool

Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Checks whether the pattern matches at the front of the haystack

-

fn is_suffix_of(self, haystack: &'a str) -> bool where Self::Searcher: ReverseSearcher<'a>

Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Checks whether the pattern matches at the back of the haystack

-
-

Implementors

-
    -
  • impl<'a> Pattern for char
    • -
  • impl<'a, 'b> Pattern for &'b [char]
    • -
  • impl<'a, F> Pattern for F where F: FnMut(char) -> bool
    • -
  • impl<'a, 'b, 'c> Pattern for &'c &'b str
    • -
  • impl<'a, 'b> Pattern for &'b str
    • -
  • impl<'a, 'b> Pattern for &'b String
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/pattern/trait.ReverseSearcher.html b/doc/bitflags/__core/str/pattern/trait.ReverseSearcher.html deleted file mode 100644 index b7686eae..00000000 --- a/doc/bitflags/__core/str/pattern/trait.ReverseSearcher.html +++ /dev/null @@ -1,172 +0,0 @@ - - - - - - - - - - bitflags::__core::str::pattern::ReverseSearcher - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::str::pattern::ReverseSearcher - - [−] - - [src]

-
pub unsafe trait ReverseSearcher<'a>: Searcher<'a> {
-    fn next_back(&mut self) -> SearchStep;
-
-    fn next_match_back(&mut self) -> Option<(usize, usize)> { ... }
-    fn next_reject_back(&mut self) -> Option<(usize, usize)> { ... }
-}
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

A reverse searcher for a string pattern.

- -

This trait provides methods for searching for non-overlapping -matches of a pattern starting from the back (right) of a string.

- -

It will be implemented by associated Searcher -types of the Pattern trait if the pattern supports searching -for it from the back.

- -

The index ranges returned by this trait are not required -to exactly match those of the forward search in reverse.

- -

For the reason why this trait is marked unsafe, see them -parent trait Searcher.

-
-

Required Methods

-
-

fn next_back(&mut self) -> SearchStep

Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Performs the next search step starting from the back.

- -
    -
  • Returns Match(a, b) if haystack[a..b] matches the pattern.
    • -
  • Returns Reject(a, b) if haystack[a..b] can not match the -pattern, even partially.
    • -
  • Returns Done if every byte of the haystack has been visited
    • -
- -

The stream of Match and Reject values up to a Done -will contain index ranges that are adjacent, non-overlapping, -covering the whole haystack, and laying on utf8 boundaries.

- -

A Match result needs to contain the whole matched pattern, -however Reject results may be split up into arbitrary -many adjacent fragments. Both ranges may have zero length.

- -

As an example, the pattern "aaa" and the haystack "cbaaaaab" -might produce the stream -[Reject(7, 8), Match(4, 7), Reject(1, 4), Reject(0, 1)]

-
-

Provided Methods

-
-

fn next_match_back(&mut self) -> Option<(usize, usize)>

Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Find the next Match result. See next_back()

-

fn next_reject_back(&mut self) -> Option<(usize, usize)>

Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Find the next Reject result. See next_back()

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/pattern/trait.Searcher.html b/doc/bitflags/__core/str/pattern/trait.Searcher.html deleted file mode 100644 index 0055c643..00000000 --- a/doc/bitflags/__core/str/pattern/trait.Searcher.html +++ /dev/null @@ -1,175 +0,0 @@ - - - - - - - - - - bitflags::__core::str::pattern::Searcher - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::str::pattern::Searcher - - [−] - - [src]

-
pub unsafe trait Searcher<'a> {
-    fn haystack(&self) -> &'a str;
-    fn next(&mut self) -> SearchStep;
-
-    fn next_match(&mut self) -> Option<(usize, usize)> { ... }
-    fn next_reject(&mut self) -> Option<(usize, usize)> { ... }
-}
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

A searcher for a string pattern.

- -

This trait provides methods for searching for non-overlapping -matches of a pattern starting from the front (left) of a string.

- -

It will be implemented by associated Searcher -types of the Pattern trait.

- -

The trait is marked unsafe because the indices returned by the -next() methods are required to lie on valid utf8 boundaries in -the haystack. This enables consumers of this trait to -slice the haystack without additional runtime checks.

-
-

Required Methods

-
-

fn haystack(&self) -> &'a str

Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Getter for the underlaying string to be searched in

- -

Will always return the same &str

-

fn next(&mut self) -> SearchStep

Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Performs the next search step starting from the front.

- -
    -
  • Returns Match(a, b) if haystack[a..b] matches the pattern.
    • -
  • Returns Reject(a, b) if haystack[a..b] can not match the -pattern, even partially.
    • -
  • Returns Done if every byte of the haystack has been visited
    • -
- -

The stream of Match and Reject values up to a Done -will contain index ranges that are adjacent, non-overlapping, -covering the whole haystack, and laying on utf8 boundaries.

- -

A Match result needs to contain the whole matched pattern, -however Reject results may be split up into arbitrary -many adjacent fragments. Both ranges may have zero length.

- -

As an example, the pattern "aaa" and the haystack "cbaaaaab" -might produce the stream -[Reject(0, 1), Reject(1, 2), Match(2, 5), Reject(5, 8)]

-
-

Provided Methods

-
-

fn next_match(&mut self) -> Option<(usize, usize)>

Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Find the next Match result. See next()

-

fn next_reject(&mut self) -> Option<(usize, usize)>

Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

Find the next Reject result. See next()

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/sidebar-items.js b/doc/bitflags/__core/str/sidebar-items.js deleted file mode 100644 index 85675d32..00000000 --- a/doc/bitflags/__core/str/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["from_utf8","Converts a slice of bytes to a string slice."],["from_utf8_unchecked","Converts a slice of bytes to a string slice without checking that the string contains valid UTF-8."]],"mod":[["pattern","The string Pattern API."]],"struct":[["Bytes","External iterator for a string's bytes. Use with the `std::iter` module."],["CharIndices","Iterator for a string's characters and their byte offsets."],["CharRange","Struct that contains a `char` and the index of the first byte of the next `char` in a string. This can be used as a data structure for iterating over the UTF-8 bytes of a string."],["Chars","Iterator for the char (representing *Unicode Scalar Values*) of a string"],["EncodeUtf16","External iterator for a string's UTF-16 code units."],["Lines","Created with the method [`lines()`]."],["LinesAny","Created with the method [`lines_any()`]."],["MatchIndices","Created with the method [`match_indices()`]."],["Matches","Created with the method [`matches()`]."],["ParseBoolError","An error returned when parsing a `bool` from a string fails."],["RMatchIndices","Created with the method [`rmatch_indices()`]."],["RMatches","Created with the method [`rmatches()`]."],["RSplit","Created with the method [`rsplit()`]."],["RSplitN","Created with the method [`rsplitn()`]."],["RSplitTerminator","Created with the method [`rsplit_terminator()`]."],["Split","Created with the method [`split()`]."],["SplitN","Created with the method [`splitn()`]."],["SplitTerminator","Created with the method [`split_terminator()`]."],["SplitWhitespace","An iterator over the non-whitespace substrings of a string, separated by any amount of whitespace."],["Utf8Error","Errors which can occur when attempting to interpret a sequence of `u8` as a string."]],"trait":[["FromStr","A trait to abstract the idea of creating a new instance of a type from a string."]],"type":[["Utf16Units",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.Bytes.html b/doc/bitflags/__core/str/struct.Bytes.html deleted file mode 100644 index c1104111..00000000 --- a/doc/bitflags/__core/str/struct.Bytes.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - bitflags::__core::str::Bytes - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::Bytes - - [−] - - [src]

-
pub struct Bytes<'a>(_);
1.0.0

External iterator for a string's bytes. -Use with the std::iter module.

- -

Created with the method bytes().

-

Trait Implementations

impl<'a> Iterator for Bytes<'a>

type Item = u8

-

fn next(&mut self) -> Option<u8>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Bytes<'a>::Item>

-

fn nth(&mut self, n: usize) -> Option<Bytes<'a>::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a> DoubleEndedIterator for Bytes<'a>

fn next_back(&mut self) -> Option<u8>

-

impl<'a> ExactSizeIterator for Bytes<'a>

fn len(&self) -> usize

-

Derived Implementations

impl<'a> Debug for Bytes<'a>

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<'a> Clone for Bytes<'a>

fn clone(&self) -> Bytes<'a>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.CharIndices.html b/doc/bitflags/__core/str/struct.CharIndices.html deleted file mode 100644 index bdb22fe4..00000000 --- a/doc/bitflags/__core/str/struct.CharIndices.html +++ /dev/null @@ -1,172 +0,0 @@ - - - - - - - - - - bitflags::__core::str::CharIndices - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::CharIndices - - [−] - - [src]

-
pub struct CharIndices<'a> {
-    // some fields omitted
-}
1.0.0

Iterator for a string's characters and their byte offsets.

-

Methods

impl<'a> CharIndices<'a>

fn as_str(&self) -> &'a str1.4.0

-

View the underlying data as a subslice of the original data.

- -

This has the same lifetime as the original slice, and so the -iterator can continue to be used while this exists.

-

Trait Implementations

impl<'a> Iterator for CharIndices<'a>

type Item = (usize, char)

-

fn next(&mut self) -> Option<(usize, char)>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a> DoubleEndedIterator for CharIndices<'a>

fn next_back(&mut self) -> Option<(usize, char)>

-

Derived Implementations

impl<'a> Debug for CharIndices<'a>

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<'a> Clone for CharIndices<'a>

fn clone(&self) -> CharIndices<'a>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.CharRange.html b/doc/bitflags/__core/str/struct.CharRange.html deleted file mode 100644 index 6fa498cf..00000000 --- a/doc/bitflags/__core/str/struct.CharRange.html +++ /dev/null @@ -1,131 +0,0 @@ - - - - - - - - - - bitflags::__core::str::CharRange - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::CharRange - - [−] - - [src]

-
pub struct CharRange {
-    pub ch: char,
-    pub next: usize,
-}
Unstable (str_char)

: existence of this struct is uncertain as it is frequently able to be replaced with char.len_utf8() and/or char/char_indices iterators

-

Struct that contains a char and the index of the first byte of -the next char in a string. This can be used as a data structure -for iterating over the UTF-8 bytes of a string.

-

Fields

- - -
ch
Unstable (str_char)

: existence of this struct is uncertain as it is frequently able to be replaced with char.len_utf8() and/or char/char_indices iterators

-

Current char

-
next
Unstable (str_char)

: existence of this struct is uncertain as it is frequently able to be replaced with char.len_utf8() and/or char/char_indices iterators

-

Index of the first byte of the next char

-

Trait Implementations

Derived Implementations

impl Debug for CharRange

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
Unstable (str_char)

: existence of this struct is uncertain as it is frequently able to be replaced with char.len_utf8() and/or char/char_indices iterators

-

impl Clone for CharRange

fn clone(&self) -> CharRange

-
Unstable (str_char)

: existence of this struct is uncertain as it is frequently able to be replaced with char.len_utf8() and/or char/char_indices iterators

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Copy for CharRange

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.Chars.html b/doc/bitflags/__core/str/struct.Chars.html deleted file mode 100644 index f35525c8..00000000 --- a/doc/bitflags/__core/str/struct.Chars.html +++ /dev/null @@ -1,174 +0,0 @@ - - - - - - - - - - bitflags::__core::str::Chars - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::Chars - - [−] - - [src]

-
pub struct Chars<'a> {
-    // some fields omitted
-}
1.0.0

Iterator for the char (representing Unicode Scalar Values) of a string

- -

Created with the method chars().

-

Methods

impl<'a> Chars<'a>

fn as_str(&self) -> &'a str1.4.0

-

View the underlying data as a subslice of the original data.

- -

This has the same lifetime as the original slice, and so the -iterator can continue to be used while this exists.

-

Trait Implementations

impl<'a> Iterator for Chars<'a>

type Item = char

-

fn next(&mut self) -> Option<char>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a> DoubleEndedIterator for Chars<'a>

fn next_back(&mut self) -> Option<char>

-

Derived Implementations

impl<'a> Debug for Chars<'a>

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<'a> Clone for Chars<'a>

fn clone(&self) -> Chars<'a>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.EncodeUtf16.html b/doc/bitflags/__core/str/struct.EncodeUtf16.html deleted file mode 100644 index bc4f7aed..00000000 --- a/doc/bitflags/__core/str/struct.EncodeUtf16.html +++ /dev/null @@ -1,167 +0,0 @@ - - - - - - - - - - bitflags::__core::str::EncodeUtf16 - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::EncodeUtf16 - - [−] - - [src]

-
pub struct EncodeUtf16<'a> {
-    // some fields omitted
-}
1.8.0

External iterator for a string's UTF-16 code units.

- -

For use with the std::iter module.

-

Trait Implementations

impl<'a> Iterator for EncodeUtf16<'a>1.0.0

type Item = u16

-

fn next(&mut self) -> Option<u16>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

Derived Implementations

impl<'a> Clone for EncodeUtf16<'a>

fn clone(&self) -> EncodeUtf16<'a>

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.Lines.html b/doc/bitflags/__core/str/struct.Lines.html deleted file mode 100644 index 3f3cad96..00000000 --- a/doc/bitflags/__core/str/struct.Lines.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::str::Lines - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::Lines - - [−] - - [src]

-
pub struct Lines<'a>(_);
1.0.0

Created with the method lines().

-

Trait Implementations

impl<'a> Iterator for Lines<'a>

type Item = &'a str

-

fn next(&mut self) -> Option<&'a str>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a> DoubleEndedIterator for Lines<'a>

fn next_back(&mut self) -> Option<&'a str>

-

Derived Implementations

impl<'a> Debug for Lines<'a>

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<'a> Clone for Lines<'a>

fn clone(&self) -> Lines<'a>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.LinesAny.html b/doc/bitflags/__core/str/struct.LinesAny.html deleted file mode 100644 index c92a543a..00000000 --- a/doc/bitflags/__core/str/struct.LinesAny.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::str::LinesAny - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::LinesAny - - [−] - - [src]

-
pub struct LinesAny<'a>(_);
1.0.0
Deprecated since 1.4.0

: use lines()/Lines instead now

-

Created with the method lines_any().

-

Trait Implementations

impl<'a> Iterator for LinesAny<'a>

type Item = &'a str

-

fn next(&mut self) -> Option<&'a str>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a> DoubleEndedIterator for LinesAny<'a>

fn next_back(&mut self) -> Option<&'a str>

-

Derived Implementations

impl<'a> Debug for LinesAny<'a>

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl<'a> Clone for LinesAny<'a>

fn clone(&self) -> LinesAny<'a>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.MatchIndices.html b/doc/bitflags/__core/str/struct.MatchIndices.html deleted file mode 100644 index 728eec8c..00000000 --- a/doc/bitflags/__core/str/struct.MatchIndices.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::str::MatchIndices - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::MatchIndices - - [−] - - [src]

-
pub struct MatchIndices<'a, P> where P: Pattern<'a>(_);
1.5.0

Created with the method match_indices().

-

Trait Implementations

impl<'a, P> Debug for MatchIndices<'a, P> where P: Pattern<'a>, P::Searcher: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, P> Iterator for MatchIndices<'a, P> where P: Pattern<'a>

type Item = (usize, &'a str)

-

fn next(&mut self) -> Option<(usize, &'a str)>

-

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

-

impl<'a, P> Clone for MatchIndices<'a, P> where P: Pattern<'a>, P::Searcher: Clone

fn clone(&self) -> MatchIndices<'a, P>

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<'a, P> DoubleEndedIterator for MatchIndices<'a, P> where P: Pattern<'a>, P::Searcher: DoubleEndedSearcher<'a>

fn next_back(&mut self) -> Option<(usize, &'a str)>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.Matches.html b/doc/bitflags/__core/str/struct.Matches.html deleted file mode 100644 index 85cde177..00000000 --- a/doc/bitflags/__core/str/struct.Matches.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::str::Matches - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::Matches - - [−] - - [src]

-
pub struct Matches<'a, P> where P: Pattern<'a>(_);
1.2.0

Created with the method matches().

-

Trait Implementations

impl<'a, P> Debug for Matches<'a, P> where P: Pattern<'a>, P::Searcher: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, P> Iterator for Matches<'a, P> where P: Pattern<'a>

type Item = &'a str

-

fn next(&mut self) -> Option<&'a str>

-

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, P> Clone for Matches<'a, P> where P: Pattern<'a>, P::Searcher: Clone

fn clone(&self) -> Matches<'a, P>

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<'a, P> DoubleEndedIterator for Matches<'a, P> where P: Pattern<'a>, P::Searcher: DoubleEndedSearcher<'a>

fn next_back(&mut self) -> Option<&'a str>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.ParseBoolError.html b/doc/bitflags/__core/str/struct.ParseBoolError.html deleted file mode 100644 index 2cc9e219..00000000 --- a/doc/bitflags/__core/str/struct.ParseBoolError.html +++ /dev/null @@ -1,123 +0,0 @@ - - - - - - - - - - bitflags::__core::str::ParseBoolError - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::ParseBoolError - - [−] - - [src]

-
pub struct ParseBoolError {
-    // some fields omitted
-}
1.0.0

An error returned when parsing a bool from a string fails.

-

Trait Implementations

impl Error for ParseBoolError

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

impl Display for ParseBoolError

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl PartialEq<ParseBoolError> for ParseBoolError

fn eq(&self, __arg_0: &ParseBoolError) -> bool

-

fn ne(&self, __arg_0: &ParseBoolError) -> bool

-

impl Clone for ParseBoolError

fn clone(&self) -> ParseBoolError

-

fn clone_from(&mut self, source: &Self)

-

impl Debug for ParseBoolError

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.RMatchIndices.html b/doc/bitflags/__core/str/struct.RMatchIndices.html deleted file mode 100644 index aeb57fea..00000000 --- a/doc/bitflags/__core/str/struct.RMatchIndices.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::str::RMatchIndices - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::RMatchIndices - - [−] - - [src]

-
pub struct RMatchIndices<'a, P> where P: Pattern<'a>(_);
1.5.0

Created with the method rmatch_indices().

-

Trait Implementations

impl<'a, P> Debug for RMatchIndices<'a, P> where P: Pattern<'a>, P::Searcher: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, P> Iterator for RMatchIndices<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

type Item = (usize, &'a str)

-

fn next(&mut self) -> Option<(usize, &'a str)>

-

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>

-

impl<'a, P> Clone for RMatchIndices<'a, P> where P: Pattern<'a>, P::Searcher: Clone

fn clone(&self) -> RMatchIndices<'a, P>

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<'a, P> DoubleEndedIterator for RMatchIndices<'a, P> where P: Pattern<'a>, P::Searcher: DoubleEndedSearcher<'a>

fn next_back(&mut self) -> Option<(usize, &'a str)>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.RMatches.html b/doc/bitflags/__core/str/struct.RMatches.html deleted file mode 100644 index 7b3cbd5b..00000000 --- a/doc/bitflags/__core/str/struct.RMatches.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::str::RMatches - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::RMatches - - [−] - - [src]

-
pub struct RMatches<'a, P> where P: Pattern<'a>(_);
1.2.0

Created with the method rmatches().

-

Trait Implementations

impl<'a, P> Debug for RMatches<'a, P> where P: Pattern<'a>, P::Searcher: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, P> Iterator for RMatches<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

type Item = &'a str

-

fn next(&mut self) -> Option<&'a str>

-

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, P> Clone for RMatches<'a, P> where P: Pattern<'a>, P::Searcher: Clone

fn clone(&self) -> RMatches<'a, P>

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<'a, P> DoubleEndedIterator for RMatches<'a, P> where P: Pattern<'a>, P::Searcher: DoubleEndedSearcher<'a>

fn next_back(&mut self) -> Option<&'a str>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.RSplit.html b/doc/bitflags/__core/str/struct.RSplit.html deleted file mode 100644 index 1660913d..00000000 --- a/doc/bitflags/__core/str/struct.RSplit.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::str::RSplit - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::RSplit - - [−] - - [src]

-
pub struct RSplit<'a, P> where P: Pattern<'a>(_);
1.0.0

Created with the method rsplit().

-

Trait Implementations

impl<'a, P> Debug for RSplit<'a, P> where P: Pattern<'a>, P::Searcher: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, P> Iterator for RSplit<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

type Item = &'a str

-

fn next(&mut self) -> Option<&'a str>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, P> Clone for RSplit<'a, P> where P: Pattern<'a>, P::Searcher: Clone

fn clone(&self) -> RSplit<'a, P>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, P> DoubleEndedIterator for RSplit<'a, P> where P: Pattern<'a>, P::Searcher: DoubleEndedSearcher<'a>

fn next_back(&mut self) -> Option<&'a str>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.RSplitN.html b/doc/bitflags/__core/str/struct.RSplitN.html deleted file mode 100644 index f454d427..00000000 --- a/doc/bitflags/__core/str/struct.RSplitN.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - - - - - - - bitflags::__core::str::RSplitN - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::RSplitN - - [−] - - [src]

-
pub struct RSplitN<'a, P> where P: Pattern<'a>(_);
1.0.0

Created with the method rsplitn().

-

Trait Implementations

impl<'a, P> Debug for RSplitN<'a, P> where P: Pattern<'a>, P::Searcher: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, P> Iterator for RSplitN<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

type Item = &'a str

-

fn next(&mut self) -> Option<&'a str>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, P> Clone for RSplitN<'a, P> where P: Pattern<'a>, P::Searcher: Clone

fn clone(&self) -> RSplitN<'a, P>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.RSplitTerminator.html b/doc/bitflags/__core/str/struct.RSplitTerminator.html deleted file mode 100644 index 60350098..00000000 --- a/doc/bitflags/__core/str/struct.RSplitTerminator.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::str::RSplitTerminator - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::RSplitTerminator - - [−] - - [src]

-
pub struct RSplitTerminator<'a, P> where P: Pattern<'a>(_);
1.0.0

Created with the method rsplit_terminator().

-

Trait Implementations

impl<'a, P> Debug for RSplitTerminator<'a, P> where P: Pattern<'a>, P::Searcher: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, P> Iterator for RSplitTerminator<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

type Item = &'a str

-

fn next(&mut self) -> Option<&'a str>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, P> Clone for RSplitTerminator<'a, P> where P: Pattern<'a>, P::Searcher: Clone

fn clone(&self) -> RSplitTerminator<'a, P>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, P> DoubleEndedIterator for RSplitTerminator<'a, P> where P: Pattern<'a>, P::Searcher: DoubleEndedSearcher<'a>

fn next_back(&mut self) -> Option<&'a str>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.Split.html b/doc/bitflags/__core/str/struct.Split.html deleted file mode 100644 index 4b0c9614..00000000 --- a/doc/bitflags/__core/str/struct.Split.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::str::Split - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::Split - - [−] - - [src]

-
pub struct Split<'a, P> where P: Pattern<'a>(_);
1.0.0

Created with the method split().

-

Trait Implementations

impl<'a, P> Debug for Split<'a, P> where P: Pattern<'a>, P::Searcher: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, P> Iterator for Split<'a, P> where P: Pattern<'a>

type Item = &'a str

-

fn next(&mut self) -> Option<&'a str>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, P> Clone for Split<'a, P> where P: Pattern<'a>, P::Searcher: Clone

fn clone(&self) -> Split<'a, P>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, P> DoubleEndedIterator for Split<'a, P> where P: Pattern<'a>, P::Searcher: DoubleEndedSearcher<'a>

fn next_back(&mut self) -> Option<&'a str>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.SplitN.html b/doc/bitflags/__core/str/struct.SplitN.html deleted file mode 100644 index de601040..00000000 --- a/doc/bitflags/__core/str/struct.SplitN.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - - - - - - - bitflags::__core::str::SplitN - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::SplitN - - [−] - - [src]

-
pub struct SplitN<'a, P> where P: Pattern<'a>(_);
1.0.0

Created with the method splitn().

-

Trait Implementations

impl<'a, P> Debug for SplitN<'a, P> where P: Pattern<'a>, P::Searcher: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, P> Iterator for SplitN<'a, P> where P: Pattern<'a>

type Item = &'a str

-

fn next(&mut self) -> Option<&'a str>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, P> Clone for SplitN<'a, P> where P: Pattern<'a>, P::Searcher: Clone

fn clone(&self) -> SplitN<'a, P>

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.SplitTerminator.html b/doc/bitflags/__core/str/struct.SplitTerminator.html deleted file mode 100644 index 5c869be8..00000000 --- a/doc/bitflags/__core/str/struct.SplitTerminator.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::str::SplitTerminator - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::SplitTerminator - - [−] - - [src]

-
pub struct SplitTerminator<'a, P> where P: Pattern<'a>(_);
1.0.0

Created with the method split_terminator().

-

Trait Implementations

impl<'a, P> Debug for SplitTerminator<'a, P> where P: Pattern<'a>, P::Searcher: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<'a, P> Iterator for SplitTerminator<'a, P> where P: Pattern<'a>

type Item = &'a str

-

fn next(&mut self) -> Option<&'a str>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, P> Clone for SplitTerminator<'a, P> where P: Pattern<'a>, P::Searcher: Clone

fn clone(&self) -> SplitTerminator<'a, P>

-

fn clone_from(&mut self, source: &Self)

-

impl<'a, P> DoubleEndedIterator for SplitTerminator<'a, P> where P: Pattern<'a>, P::Searcher: DoubleEndedSearcher<'a>

fn next_back(&mut self) -> Option<&'a str>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.SplitWhitespace.html b/doc/bitflags/__core/str/struct.SplitWhitespace.html deleted file mode 100644 index 11601d61..00000000 --- a/doc/bitflags/__core/str/struct.SplitWhitespace.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::str::SplitWhitespace - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::SplitWhitespace - - [−] - - [src]

-
pub struct SplitWhitespace<'a> {
-    // some fields omitted
-}
1.1.0

An iterator over the non-whitespace substrings of a string, -separated by any amount of whitespace.

-

Trait Implementations

impl<'a> Iterator for SplitWhitespace<'a>

type Item = &'a str

-
Unstable (unicode)

fn next(&mut self) -> Option<&'a str>

-
Unstable (unicode)

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a> DoubleEndedIterator for SplitWhitespace<'a>

fn next_back(&mut self) -> Option<&'a str>

-
Unstable (unicode)
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/struct.Utf8Error.html b/doc/bitflags/__core/str/struct.Utf8Error.html deleted file mode 100644 index ec63a820..00000000 --- a/doc/bitflags/__core/str/struct.Utf8Error.html +++ /dev/null @@ -1,148 +0,0 @@ - - - - - - - - - - bitflags::__core::str::Utf8Error - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::str::Utf8Error - - [−] - - [src]

-
pub struct Utf8Error {
-    // some fields omitted
-}
1.0.0

Errors which can occur when attempting to interpret a sequence of u8 -as a string.

- -

As such, the from_utf8 family of functions and methods for both Strings -and &strs make use of this error, for example.

-

Methods

impl Utf8Error

fn valid_up_to(&self) -> usize1.5.0

-

Returns the index in the given string up to which valid UTF-8 was -verified.

- -

It is the maximum index such that from_utf8(input[..index]) -would return Some(_).

- -

Examples

-

Basic usage:

- -
-use std::str;
-
-// some invalid bytes, in a vector
-let sparkle_heart = vec![0, 159, 146, 150];
-
-// std::str::from_utf8 returns a Utf8Error
-let error = str::from_utf8(&sparkle_heart).unwrap_err();
-
-// the second byte is invalid here
-assert_eq!(1, error.valid_up_to());
-

Trait Implementations

impl Error for Utf8Error

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

impl Display for Utf8Error

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl Debug for Utf8Error

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl Clone for Utf8Error

fn clone(&self) -> Utf8Error

-

fn clone_from(&mut self, source: &Self)

-

impl PartialEq<Utf8Error> for Utf8Error

fn eq(&self, __arg_0: &Utf8Error) -> bool

-

fn ne(&self, __arg_0: &Utf8Error) -> bool

-

impl Eq for Utf8Error

impl Copy for Utf8Error

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/trait.FromStr.html b/doc/bitflags/__core/str/trait.FromStr.html deleted file mode 100644 index e4443489..00000000 --- a/doc/bitflags/__core/str/trait.FromStr.html +++ /dev/null @@ -1,168 +0,0 @@ - - - - - - - - - - bitflags::__core::str::FromStr - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::str::FromStr - - [−] - - [src]

-
pub trait FromStr {
-    type Err;
-    fn from_str(s: &str) -> Result<Self, Self::Err>;
-}

A trait to abstract the idea of creating a new instance of a type from a -string.

- -

FromStr's from_str() method is often used implicitly, through -str's parse() method. See parse()'s documentation for examples.

-
-

Associated Types

-
-

type Err

The associated error which can be returned from parsing.

-
-

Required Methods

-
-

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

- -

If parsing succeeds, return the value inside Ok, otherwise -when the string is ill-formatted return an error specific to the -inside Err. The error type is specific to implementation of the trait.

- -

Examples

-

Basic usage with i32, a type that implements FromStr:

- -
-use std::str::FromStr;
-
-let s = "5";
-let x = i32::from_str(s).unwrap();
-
-assert_eq!(5, x);
-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/str/type.Utf16Units.html b/doc/bitflags/__core/str/type.Utf16Units.html deleted file mode 100644 index 7601c87f..00000000 --- a/doc/bitflags/__core/str/type.Utf16Units.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::str::Utf16Units - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::str::Utf16Units - - [−] - - [src]

-
type Utf16Units<'a> = EncodeUtf16<'a>;
Deprecated since 1.8.0

: renamed to EncodeUtf16

-
Unstable (str_utf16)

: renamed to EncodeUtf16

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/string/enum.ParseError.html b/doc/bitflags/__core/string/enum.ParseError.html deleted file mode 100644 index 5effdca9..00000000 --- a/doc/bitflags/__core/string/enum.ParseError.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::string::ParseError - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::string::ParseError - - [−] - - [src]

-
pub enum ParseError {}
1.5.0

An error when parsing a String.

- -

This enum is slightly awkward: it will never actually exist. This error is -part of the type signature of the implementation of FromStr on -String. The return type of from_str(), requires that an error be -defined, but, given that a String can always be made into a new -String without error, this type will never actually be returned. As -such, it is only here to satisfy said signature, and is useless otherwise.

-

Trait Implementations

impl Error for ParseError1.8.0

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>1.0.0

-

impl Clone for ParseError

fn clone(&self) -> ParseError

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Debug for ParseError

fn fmt(&self, &mut Formatter) -> Result<(), Error>

-

impl Display for ParseError1.8.0

fn fmt(&self, &mut Formatter) -> Result<(), Error>

-

impl PartialEq<ParseError> for ParseError

fn eq(&self, &ParseError) -> bool

-

fn ne(&self, other: &Rhs) -> bool1.0.0

-

impl Eq for ParseError

Derived Implementations

impl Copy for ParseError

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/string/index.html b/doc/bitflags/__core/string/index.html deleted file mode 100644 index 353450eb..00000000 --- a/doc/bitflags/__core/string/index.html +++ /dev/null @@ -1,194 +0,0 @@ - - - - - - - - - - bitflags::__core::string - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::string - - [−] - - [src]

-

A UTF-8 encoded, growable string.

- -

This module contains the String type, a trait for converting -ToStrings, and several error types that may result from working with -Strings.

- -

Examples

-

There are multiple ways to create a new String from a string literal:

- -
-let s = "Hello".to_string();
-
-let s = String::from("world");
-let s: String = "also this".into();
- -

You can create a new String from an existing one by concatenating with -+:

- -
-let s = "Hello".to_string();
-
-let message = s + " world!";
- -

If you have a vector of valid UTF-8 bytes, you can make a String out of -it. You can do the reverse too.

- -
-let sparkle_heart = vec![240, 159, 146, 150];
-
-// We know these bytes are valid, so we'll use `unwrap()`.
-let sparkle_heart = String::from_utf8(sparkle_heart).unwrap();
-
-assert_eq!("💖", sparkle_heart);
-
-let bytes = sparkle_heart.into_bytes();
-
-assert_eq!(bytes, [240, 159, 146, 150]);
-

Structs

- - - - - - - - - - - - - - - - -
Drain -

A draining iterator for String.

-
FromUtf16Error -

A possible error value when converting a String from a UTF-16 byte slice.

-
FromUtf8Error -

A possible error value when converting a String from a UTF-8 byte vector.

-
String -

A UTF-8 encoded, growable string.

-

Enums

- - - - -
ParseError -

An error when parsing a String.

-

Traits

- - - - -
ToString -

A trait for converting a value to a String.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/string/sidebar-items.js b/doc/bitflags/__core/string/sidebar-items.js deleted file mode 100644 index 7cd3a05c..00000000 --- a/doc/bitflags/__core/string/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["ParseError","An error when parsing a `String`."]],"struct":[["Drain","A draining iterator for `String`."],["FromUtf16Error","A possible error value when converting a `String` from a UTF-16 byte slice."],["FromUtf8Error","A possible error value when converting a `String` from a UTF-8 byte vector."],["String","A UTF-8 encoded, growable string."]],"trait":[["ToString","A trait for converting a value to a `String`."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/string/struct.Drain.html b/doc/bitflags/__core/string/struct.Drain.html deleted file mode 100644 index bfba6031..00000000 --- a/doc/bitflags/__core/string/struct.Drain.html +++ /dev/null @@ -1,168 +0,0 @@ - - - - - - - - - - bitflags::__core::string::Drain - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::string::Drain - - [−] - - [src]

-
pub struct Drain<'a> {
-    // some fields omitted
-}
1.6.0

A draining iterator for String.

- -

This struct is created by the drain() method on String. See its -documentation for more.

-

Trait Implementations

impl<'a> Sync for Drain<'a>

impl<'a> Send for Drain<'a>

impl<'a> Drop for Drain<'a>

fn drop(&mut self)

-

impl<'a> Iterator for Drain<'a>

type Item = char

-

fn next(&mut self) -> Option<char>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a> DoubleEndedIterator for Drain<'a>

fn next_back(&mut self) -> Option<char>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/string/struct.FromUtf16Error.html b/doc/bitflags/__core/string/struct.FromUtf16Error.html deleted file mode 100644 index 7eb68b94..00000000 --- a/doc/bitflags/__core/string/struct.FromUtf16Error.html +++ /dev/null @@ -1,129 +0,0 @@ - - - - - - - - - - bitflags::__core::string::FromUtf16Error - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::string::FromUtf16Error - - [−] - - [src]

-
pub struct FromUtf16Error(_);
1.0.0

A possible error value when converting a String from a UTF-16 byte slice.

- -

This type is the error type for the from_utf16() method on String.

- -

Examples

-

Basic usage:

- -
-// 𝄞mu<invalid>ic
-let v = &[0xD834, 0xDD1E, 0x006d, 0x0075,
-          0xD800, 0x0069, 0x0063];
-
-assert!(String::from_utf16(v).is_err());
-

Trait Implementations

impl Error for FromUtf16Error

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

impl Display for FromUtf16Error

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl Debug for FromUtf16Error

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/string/struct.FromUtf8Error.html b/doc/bitflags/__core/string/struct.FromUtf8Error.html deleted file mode 100644 index 82aa0bd1..00000000 --- a/doc/bitflags/__core/string/struct.FromUtf8Error.html +++ /dev/null @@ -1,177 +0,0 @@ - - - - - - - - - - bitflags::__core::string::FromUtf8Error - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::string::FromUtf8Error - - [−] - - [src]

-
pub struct FromUtf8Error {
-    // some fields omitted
-}
1.0.0

A possible error value when converting a String from a UTF-8 byte vector.

- -

This type is the error type for the from_utf8() method on String. It -is designed in such a way to carefully avoid reallocations: the -into_bytes() method will give back the byte vector that was used in the -conversion attempt.

- -

The Utf8Error type provided by std::str represents an error that may -occur when converting a slice of u8s to a &str. In this sense, it's -an analogue to FromUtf8Error, and you can get one from a FromUtf8Error -through the utf8_error() method.

- -

Examples

-

Basic usage:

- -
-// some invalid bytes, in a vector
-let bytes = vec![0, 159];
-
-let value = String::from_utf8(bytes);
-
-assert!(value.is_err());
-assert_eq!(vec![0, 159], value.unwrap_err().into_bytes());
-

Methods

impl FromUtf8Error

fn into_bytes(self) -> Vec<u8>

-

Returns the bytes that were attempted to convert to a String.

- -

This method is carefully constructed to avoid allocation. It will -consume the error, moving out the bytes, so that a copy of the bytes -does not need to be made.

- -

Examples

-

Basic usage:

- -
-// some invalid bytes, in a vector
-let bytes = vec![0, 159];
-
-let value = String::from_utf8(bytes);
-
-assert_eq!(vec![0, 159], value.unwrap_err().into_bytes());
-

fn utf8_error(&self) -> Utf8Error

-

Fetch a Utf8Error to get more details about the conversion failure.

- -

The Utf8Error type provided by std::str represents an error that may -occur when converting a slice of u8s to a &str. In this sense, it's -an analogue to FromUtf8Error. See its documentation for more details -on using it.

- -

Examples

-

Basic usage:

- -
-// some invalid bytes, in a vector
-let bytes = vec![0, 159];
-
-let error = String::from_utf8(bytes).unwrap_err().utf8_error();
-
-// the first byte is invalid here
-assert_eq!(1, error.valid_up_to());
-

Trait Implementations

impl Error for FromUtf8Error

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

impl Display for FromUtf8Error

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl Debug for FromUtf8Error

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/string/struct.String.html b/doc/bitflags/__core/string/struct.String.html deleted file mode 100644 index f6f6ea55..00000000 --- a/doc/bitflags/__core/string/struct.String.html +++ /dev/null @@ -1,2118 +0,0 @@ - - - - - - - - - - bitflags::__core::string::String - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::string::String - - [−] - - [src]

-
pub struct String {
-    // some fields omitted
-}
1.0.0

A UTF-8 encoded, growable string.

- -

The String type is the most common string type that has ownership over the -contents of the string. It has a close relationship with its borrowed -counterpart, the primitive str.

- -

Examples

-

You can create a String from a literal string with String::from:

- -
-let hello = String::from("Hello, world!");
- -

You can append a char to a String with the push() method, and -append a &str with the push_str() method:

- -
-let mut hello = String::from("Hello, ");
-
-hello.push('w');
-hello.push_str("orld!");
- -

If you have a vector of UTF-8 bytes, you can create a String from it with -the from_utf8() method:

- -
-// some bytes, in a vector
-let sparkle_heart = vec![240, 159, 146, 150];
-
-// We know these bytes are valid, so we'll use `unwrap()`.
-let sparkle_heart = String::from_utf8(sparkle_heart).unwrap();
-
-assert_eq!("💖", sparkle_heart);
- -

UTF-8

-

Strings are always valid UTF-8. This has a few implications, the first of -which is that if you need a non-UTF-8 string, consider OsString. It is -similar, but without the UTF-8 constraint. The second implication is that -you cannot index into a String:

- -
-let s = "hello";
-
-println!("The first letter of s is {}", s[0]); // ERROR!!!
- -

Indexing is intended to be a constant-time operation, but UTF-8 encoding -does not allow us to do this. Furtheremore, it's not clear what sort of -thing the index should return: a byte, a codepoint, or a grapheme cluster. -The as_bytes() and chars() methods return iterators over the first -two, respectively.

- -

Deref

-

Strings implement Deref<Target=str>, and so inherit all of str's -methods. In addition, this means that you can pass a String to any -function which takes a &str by using an ampersand (&):

- -
-fn takes_str(s: &str) { }
-
-let s = String::from("Hello");
-
-takes_str(&s);
- -

This will create a &str from the String and pass it in. This -conversion is very inexpensive, and so generally, functions will accept -&strs as arguments unless they need a String for some specific reason.

- -

Representation

-

A String is made up of three components: a pointer to some bytes, a -length, and a capacity. The pointer points to an internal buffer String -uses to store its data. The length is the number of bytes currently stored -in the buffer, and the capacity is the size of the buffer in bytes. As such, -the length will always be less than or equal to the capacity.

- -

This buffer is always stored on the heap.

- -

You can look at these with the as_ptr(), len(), and capacity() -methods:

- -
-use std::mem;
-
-let story = String::from("Once upon a time...");
-
-let ptr = story.as_ptr();
-let len = story.len();
-let capacity = story.capacity();
-
-// story has thirteen bytes
-assert_eq!(19, len);
-
-// Now that we have our parts, we throw the story away.
-mem::forget(story);
-
-// We can re-build a String out of ptr, len, and capacity. This is all
-// unsafe because we are responsible for making sure the components are
-// valid:
-let s = unsafe { String::from_raw_parts(ptr as *mut _, len, capacity) } ;
-
-assert_eq!(String::from("Once upon a time..."), s);
- -

If a String has enough capacity, adding elements to it will not -re-allocate. For example, consider this program:

- -
-let mut s = String::new();
-
-println!("{}", s.capacity());
-
-for _ in 0..5 {
-    s.push_str("hello");
-    println!("{}", s.capacity());
-}
- -

This will output the following:

- -
0
-5
-10
-20
-20
-40
-
- -

At first, we have no memory allocated at all, but as we append to the -string, it increases its capacity appropriately. If we instead use the -with_capacity() method to allocate the correct capacity initially:

- -
-let mut s = String::with_capacity(25);
-
-println!("{}", s.capacity());
-
-for _ in 0..5 {
-    s.push_str("hello");
-    println!("{}", s.capacity());
-}
- -

We end up with a different output:

- -
25
-25
-25
-25
-25
-25
-
- -

Here, there's no need to allocate more memory inside the loop.

-

Methods

impl String

fn new() -> String

-

Creates a new empty String.

- -

Given that the String is empty, this will not allocate any initial -buffer. While that means that this initial operation is very -inexpensive, but may cause excessive allocation later, when you add -data. If you have an idea of how much data the String will hold, -consider the with_capacity() method to prevent excessive -re-allocation.

- -

Examples

-

Basic usage:

- -
-let s = String::new();
-

fn with_capacity(capacity: usize) -> String

-

Creates a new empty String with a particular capacity.

- -

Strings have an internal buffer to hold their data. The capacity is -the length of that buffer, and can be queried with the capacity() -method. This method creates an empty String, but one with an initial -buffer that can hold capacity bytes. This is useful when you may be -appending a bunch of data to the String, reducing the number of -reallocations it needs to do.

- -

If the given capacity is 0, no allocation will occur, and this method -is identical to the new() method.

- -

Examples

-

Basic usage:

- -
-let mut s = String::with_capacity(10);
-
-// The String contains no chars, even though it has capacity for more
-assert_eq!(s.len(), 0);
-
-// These are all done without reallocating...
-let cap = s.capacity();
-for i in 0..10 {
-    s.push('a');
-}
-
-assert_eq!(s.capacity(), cap);
-
-// ...but this may make the vector reallocate
-s.push('a');
-

fn from_utf8(vec: Vec<u8>) -> Result<String, FromUtf8Error>

-

Converts a vector of bytes to a String.

- -

A string slice (&str) is made of bytes (u8), and a vector of bytes -(Vec<u8>) is made of bytes, so this function converts between the -two. Not all byte slices are valid Strings, however: String -requires that it is valid UTF-8. from_utf8() checks to ensure that -the bytes are valid UTF-8, and then does the conversion.

- -

If you are sure that the byte slice is valid UTF-8, and you don't want -to incur the overhead of the validity check, there is an unsafe version -of this function, from_utf8_unchecked(), which has the same behavior -but skips the check.

- -

This method will take care to not copy the vector, for efficiency's -sake.

- -

If you need a &str instead of a String, consider -str::from_utf8().

- -

Errors

-

Returns Err if the slice is not UTF-8 with a description as to why the -provided bytes are not UTF-8. The vector you moved in is also included.

- -

Examples

-

Basic usage:

- -
-// some bytes, in a vector
-let sparkle_heart = vec![240, 159, 146, 150];
-
-// We know these bytes are valid, so we'll use `unwrap()`.
-let sparkle_heart = String::from_utf8(sparkle_heart).unwrap();
-
-assert_eq!("💖", sparkle_heart);
- -

Incorrect bytes:

- -
-// some invalid bytes, in a vector
-let sparkle_heart = vec![0, 159, 146, 150];
-
-assert!(String::from_utf8(sparkle_heart).is_err());
- -

See the docs for FromUtf8Error for more details on what you can do -with this error.

-

fn from_utf8_lossy(v: &'a [u8]) -> Cow<'a, str>

-

Converts a slice of bytes to a string, including invalid characters.

- -

Strings are made of bytes (u8), and a slice of bytes -(&[u8]) is made of bytes, so this function converts -between the two. Not all byte slices are valid strings, however: strings -are required to be valid UTF-8. During this conversion, -from_utf8_lossy() will replace any invalid UTF-8 sequences with -U+FFFD REPLACEMENT CHARACTER, which looks like this: �

- -

If you are sure that the byte slice is valid UTF-8, and you don't want -to incur the overhead of the conversion, there is an unsafe version -of this function, from_utf8_unchecked(), which has the same behavior -but skips the checks.

- -

This function returns a Cow<'a, str>. If our byte slice is invalid -UTF-8, then we need to insert the replacement characters, which will -change the size of the string, and hence, require a String. But if -it's already valid UTF-8, we don't need a new allocation. This return -type allows us to handle both cases.

- -

Examples

-

Basic usage:

- -
-// some bytes, in a vector
-let sparkle_heart = vec![240, 159, 146, 150];
-
-let sparkle_heart = String::from_utf8_lossy(&sparkle_heart);
-
-assert_eq!("💖", sparkle_heart);
- -

Incorrect bytes:

- -
-// some invalid bytes
-let input = b"Hello \xF0\x90\x80World";
-let output = String::from_utf8_lossy(input);
-
-assert_eq!("Hello �World", output);
-

fn from_utf16(v: &[u16]) -> Result<String, FromUtf16Error>

-

Decode a UTF-16 encoded vector v into a String, returning Err -if v contains any invalid data.

- -

Examples

-

Basic usage:

- -
-// 𝄞music
-let v = &[0xD834, 0xDD1E, 0x006d, 0x0075,
-          0x0073, 0x0069, 0x0063];
-assert_eq!(String::from("𝄞music"),
-           String::from_utf16(v).unwrap());
-
-// 𝄞mu<invalid>ic
-let v = &[0xD834, 0xDD1E, 0x006d, 0x0075,
-          0xD800, 0x0069, 0x0063];
-assert!(String::from_utf16(v).is_err());
-

fn from_utf16_lossy(v: &[u16]) -> String

-

Decode a UTF-16 encoded vector v into a string, replacing -invalid data with the replacement character (U+FFFD).

- -

Examples

-

Basic usage:

- -
-// 𝄞mus<invalid>ic<invalid>
-let v = &[0xD834, 0xDD1E, 0x006d, 0x0075,
-          0x0073, 0xDD1E, 0x0069, 0x0063,
-          0xD834];
-
-assert_eq!(String::from("𝄞mus\u{FFFD}ic\u{FFFD}"),
-           String::from_utf16_lossy(v));
-

unsafe fn from_raw_parts(buf: *mut u8, length: usize, capacity: usize) -> String

-

Creates a new String from a length, capacity, and pointer.

- -

Safety

-

This is highly unsafe, due to the number of invariants that aren't -checked:

- -
    -
  • The memory at ptr needs to have been previously allocated by the -same allocator the standard library uses.
    • -
  • length needs to be less than or equal to capacity.
    • -
  • capacity needs to be the correct value.
    • -
- -

Violating these may cause problems like corrupting the allocator's -internal datastructures.

- -

Examples

-

Basic usage:

- -
-use std::mem;
-
-unsafe {
-    let s = String::from("hello");
-    let ptr = s.as_ptr();
-    let len = s.len();
-    let capacity = s.capacity();
-
-    mem::forget(s);
-
-    let s = String::from_raw_parts(ptr as *mut _, len, capacity);
-
-    assert_eq!(String::from("hello"), s);
-}
-

unsafe fn from_utf8_unchecked(bytes: Vec<u8>) -> String

-

Converts a vector of bytes to a String without checking that the -string contains valid UTF-8.

- -

See the safe version, from_utf8(), for more details.

- -

Safety

-

This function is unsafe because it does not check that the bytes passed -to it are valid UTF-8. If this constraint is violated, it may cause -memory unsafety issues with future users of the String, as the rest of -the standard library assumes that Strings are valid UTF-8.

- -

Examples

-

Basic usage:

- -
-// some bytes, in a vector
-let sparkle_heart = vec![240, 159, 146, 150];
-
-let sparkle_heart = unsafe {
-    String::from_utf8_unchecked(sparkle_heart)
-};
-
-assert_eq!("💖", sparkle_heart);
-

fn into_bytes(self) -> Vec<u8>

-

Converts a String into a byte vector.

- -

This consumes the String, so we do not need to copy its contents.

- -

Examples

-

Basic usage:

- -
-let s = String::from("hello");
-let bytes = s.into_bytes();
-
-assert_eq!(&[104, 101, 108, 108, 111][..], &bytes[..]);
-

fn as_str(&self) -> &str1.7.0

-

Extracts a string slice containing the entire string.

-

fn as_mut_str(&mut self) -> &mut str1.7.0

-

Extracts a string slice containing the entire string.

-

fn push_str(&mut self, string: &str)

-

Appends a given string slice onto the end of this String.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("foo");
-
-s.push_str("bar");
-
-assert_eq!("foobar", s);
-

fn capacity(&self) -> usize

-

Returns this String's capacity, in bytes.

- -

Examples

-

Basic usage:

- -
-let s = String::with_capacity(10);
-
-assert!(s.capacity() >= 10);
-

fn reserve(&mut self, additional: usize)

-

Ensures that this String's capacity is at least additional bytes -larger than its length.

- -

The capacity may be increased by more than additional bytes if it -chooses, to prevent frequent reallocations.

- -

If you do not want this "at least" behavior, see the reserve_exact() -method.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-

Basic usage:

- -
-let mut s = String::new();
-
-s.reserve(10);
-
-assert!(s.capacity() >= 10);
- -

This may not actually increase the capacity:

- -
-let mut s = String::with_capacity(10);
-s.push('a');
-s.push('b');
-
-// s now has a length of 2 and a capacity of 10
-assert_eq!(2, s.len());
-assert_eq!(10, s.capacity());
-
-// Since we already have an extra 8 capacity, calling this...
-s.reserve(8);
-
-// ... doesn't actually increase.
-assert_eq!(10, s.capacity());
-

fn reserve_exact(&mut self, additional: usize)

-

Ensures that this String's capacity is additional bytes -larger than its length.

- -

Consider using the reserve() method unless you absolutely know -better than the allocator.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-

Basic usage:

- -
-let mut s = String::new();
-
-s.reserve_exact(10);
-
-assert!(s.capacity() >= 10);
- -

This may not actually increase the capacity:

- -
-let mut s = String::with_capacity(10);
-s.push('a');
-s.push('b');
-
-// s now has a length of 2 and a capacity of 10
-assert_eq!(2, s.len());
-assert_eq!(10, s.capacity());
-
-// Since we already have an extra 8 capacity, calling this...
-s.reserve_exact(8);
-
-// ... doesn't actually increase.
-assert_eq!(10, s.capacity());
-

fn shrink_to_fit(&mut self)

-

Shrinks the capacity of this String to match its length.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("foo");
-
-s.reserve(100);
-assert!(s.capacity() >= 100);
-
-s.shrink_to_fit();
-assert_eq!(3, s.capacity());
-

fn push(&mut self, ch: char)

-

Appends the given char to the end of this String.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("abc");
-
-s.push('1');
-s.push('2');
-s.push('3');
-
-assert_eq!("abc123", s);
-

fn as_bytes(&self) -> &[u8]

-

Returns a byte slice of this String's contents.

- -

Examples

-

Basic usage:

- -
-let s = String::from("hello");
-
-assert_eq!(&[104, 101, 108, 108, 111], s.as_bytes());
-

fn truncate(&mut self, new_len: usize)

-

Shortens this String to the specified length.

- -

If new_len is greater than the string's current length, this has no -effect.

- -

Panics

-

Panics if new_len does not lie on a char boundary.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("hello");
-
-s.truncate(2);
-
-assert_eq!("he", s);
-

fn pop(&mut self) -> Option<char>

-

Removes the last character from the string buffer and returns it.

- -

Returns None if this String is empty.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("foo");
-
-assert_eq!(s.pop(), Some('o'));
-assert_eq!(s.pop(), Some('o'));
-assert_eq!(s.pop(), Some('f'));
-
-assert_eq!(s.pop(), None);
-

fn remove(&mut self, idx: usize) -> char

-

Removes a char from this String at a byte position and returns it.

- -

This is an O(n) operation, as it requires copying every element in the -buffer.

- -

Panics

-

Panics if idx is larger than or equal to the String's length, -or if it does not lie on a char boundary.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("foo");
-
-assert_eq!(s.remove(0), 'f');
-assert_eq!(s.remove(1), 'o');
-assert_eq!(s.remove(0), 'o');
-

fn insert(&mut self, idx: usize, ch: char)

-

Inserts a character into this String at a byte position.

- -

This is an O(n) operation as it requires copying every element in the -buffer.

- -

Panics

-

Panics if idx is larger than the String's length, or if it does not -lie on a char boundary.

- -

Examples

-

Basic usage:

- -
-let mut s = String::with_capacity(3);
-
-s.insert(0, 'f');
-s.insert(1, 'o');
-s.insert(2, 'o');
-
-assert_eq!("foo", s);
-

unsafe fn as_mut_vec(&mut self) -> &mut Vec<u8>

-

Returns a mutable reference to the contents of this String.

- -

Safety

-

This function is unsafe because it does not check that the bytes passed -to it are valid UTF-8. If this constraint is violated, it may cause -memory unsafety issues with future users of the String, as the rest of -the standard library assumes that Strings are valid UTF-8.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("hello");
-
-unsafe {
-    let vec = s.as_mut_vec();
-    assert_eq!(&[104, 101, 108, 108, 111][..], &vec[..]);
-
-    vec.reverse();
-}
-assert_eq!(s, "olleh");
-

fn len(&self) -> usize

-

Returns the length of this String, in bytes.

- -

Examples

-

Basic usage:

- -
-let a = String::from("foo");
-
-assert_eq!(a.len(), 3);
-

fn is_empty(&self) -> bool

-

Returns true if this String has a length of zero.

- -

Returns false otherwise.

- -

Examples

-

Basic usage:

- -
-let mut v = String::new();
-assert!(v.is_empty());
-
-v.push('a');
-assert!(!v.is_empty());
-

fn clear(&mut self)

-

Truncates this String, removing all contents.

- -

While this means the String will have a length of zero, it does not -touch its capacity.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("foo");
-
-s.clear();
-
-assert!(s.is_empty());
-assert_eq!(0, s.len());
-assert_eq!(3, s.capacity());
-

fn drain<R>(&mut self, range: R) -> Drain where R: RangeArgument<usize>1.6.0

-

Create a draining iterator that removes the specified range in the string -and yields the removed chars.

- -

Note: The element range is removed even if the iterator is not -consumed until the end.

- -

Panics

-

Panics if the starting point or end point do not lie on a char -boundary, or if they're out of bounds.

- -

Examples

-

Basic usage:

- -
-let mut s = String::from("α is alpha, β is beta");
-let beta_offset = s.find('β').unwrap_or(s.len());
-
-// Remove the range up until the β from the string
-let t: String = s.drain(..beta_offset).collect();
-assert_eq!(t, "α is alpha, ");
-assert_eq!(s, "β is beta");
-
-// A full range clears the string
-s.drain(..);
-assert_eq!(s, "");
-

fn into_boxed_str(self) -> Box<str>1.4.0

-

Converts this String into a Box<str>.

- -

This will drop any excess capacity.

- -

Examples

-

Basic usage:

- -
-let s = String::from("hello");
-
-let b = s.into_boxed_str();
-

Methods from Deref<Target=str>

fn len(&self) -> usize

-

Returns the length of self.

- -

This length is in bytes, not chars or graphemes. In other words, -it may not be what a human considers the length of the string.

- -

Examples

-

Basic usage:

- -
-let len = "foo".len();
-assert_eq!(3, len);
-
-let len = "ƒoo".len(); // fancy f!
-assert_eq!(4, len);
-

fn is_empty(&self) -> bool

-

Returns true if this slice has a length of zero bytes.

- -

Examples

-

Basic usage:

- -
-let s = "";
-assert!(s.is_empty());
-
-let s = "not empty";
-assert!(!s.is_empty());
-

fn is_char_boundary(&self, index: usize) -> bool1.9.0

-

Checks that index-th byte lies at the start and/or end of a -UTF-8 code point sequence.

- -

The start and end of the string (when index == self.len()) are -considered to be -boundaries.

- -

Returns false if index is greater than self.len().

- -

Examples

-
-let s = "Löwe 老虎 Léopard";
-assert!(s.is_char_boundary(0));
-// start of `老`
-assert!(s.is_char_boundary(6));
-assert!(s.is_char_boundary(s.len()));
-
-// second byte of `ö`
-assert!(!s.is_char_boundary(2));
-
-// third byte of `老`
-assert!(!s.is_char_boundary(8));
-

fn as_bytes(&self) -> &[u8]

-

Converts a string slice to a byte slice.

- -

Examples

-

Basic usage:

- -
-let bytes = "bors".as_bytes();
-assert_eq!(b"bors", bytes);
-

fn as_ptr(&self) -> *const u8

-

Converts a string slice to a raw pointer.

- -

As string slices are a slice of bytes, the raw pointer points to a -u8. This pointer will be pointing to the first byte of the string -slice.

- -

Examples

-

Basic usage:

- -
-let s = "Hello";
-let ptr = s.as_ptr();
-

unsafe fn slice_unchecked(&self, begin: usize, end: usize) -> &str

-

Creates a string slice from another string slice, bypassing safety -checks.

- -

This new slice goes from begin to end, including begin but -excluding end.

- -

To get a mutable string slice instead, see the -slice_mut_unchecked() method.

- -

Safety

-

Callers of this function are responsible that three preconditions are -satisfied:

- -
    -
  • begin must come before end.
    • -
  • begin and end must be byte positions within the string slice.
    • -
  • begin and end must lie on UTF-8 sequence boundaries.
    • -
- -

Examples

-

Basic usage:

- -
-let s = "Löwe 老虎 Léopard";
-
-unsafe {
-    assert_eq!("Löwe 老虎 Léopard", s.slice_unchecked(0, 21));
-}
-
-let s = "Hello, world!";
-
-unsafe {
-    assert_eq!("world", s.slice_unchecked(7, 12));
-}
-

unsafe fn slice_mut_unchecked(&mut self, begin: usize, end: usize) -> &mut str1.5.0

-

Creates a string slice from another string slice, bypassing safety -checks.

- -

This new slice goes from begin to end, including begin but -excluding end.

- -

To get an immutable string slice instead, see the -slice_unchecked() method.

- -

Safety

-

Callers of this function are responsible that three preconditions are -satisfied:

- -
    -
  • begin must come before end.
    • -
  • begin and end must be byte positions within the string slice.
    • -
  • begin and end must lie on UTF-8 sequence boundaries.
    • -
-

fn char_range_at(&self, start: usize) -> CharRange

-
Deprecated since 1.9.0

: use slicing plus chars() plus len_utf8

-
Unstable (str_char)

: use slicing plus chars() plus len_utf8

-

Given a byte position, returns the next char and its index.

- -

Panics

-

If i is greater than or equal to the length of the string. -If i is not the index of the beginning of a valid UTF-8 sequence.

- -

Examples

-

This example manually iterates through the code points of a string; -this should normally be -done by .chars() or .char_indices().

- -
-#![feature(str_char)]
-#![allow(deprecated)]
-
-use std::str::CharRange;
-
-let s = "中华Việt Nam";
-let mut i = 0;
-while i < s.len() {
-    let CharRange {ch, next} = s.char_range_at(i);
-    println!("{}: {}", i, ch);
-    i = next;
-}
- -

This outputs:

- -
0: 中
-3: 华
-6: V
-7: i
-8: e
-9:
-11:
-13: t
-14:
-15: N
-16: a
-17: m
-
-

fn char_range_at_reverse(&self, start: usize) -> CharRange

-
Deprecated since 1.9.0

: use slicing plus chars().rev() plus len_utf8

-
Unstable (str_char)

: use slicing plus chars().rev() plus len_utf8

-

Given a byte position, returns the previous char and its position.

- -

Note that Unicode has many features, such as combining marks, ligatures, -and direction marks, that need to be taken into account to correctly reverse a string.

- -

Returns 0 for next index if called on start index 0.

- -

Panics

-

If i is greater than the length of the string. -If i is not an index following a valid UTF-8 sequence.

- -

Examples

-

This example manually iterates through the code points of a string; -this should normally be -done by .chars().rev() or .char_indices().

- -
-#![feature(str_char)]
-#![allow(deprecated)]
-
-use std::str::CharRange;
-
-let s = "中华Việt Nam";
-let mut i = s.len();
-while i > 0 {
-    let CharRange {ch, next} = s.char_range_at_reverse(i);
-    println!("{}: {}", i, ch);
-    i = next;
-}
- -

This outputs:

- -
18: m
-17: a
-16: N
-15:
-14: t
-13:
-11:
-9: e
-8: i
-7: V
-6: 华
-3: 中
-
-

fn char_at(&self, i: usize) -> char

-
Deprecated since 1.9.0

: use slicing plus chars()

-
Unstable (str_char)

: use slicing plus chars()

-

Given a byte position, returns the char at that position.

- -

Panics

-

If i is greater than or equal to the length of the string. -If i is not the index of the beginning of a valid UTF-8 sequence.

- -

Examples

-
-#![feature(str_char)]
-#![allow(deprecated)]
-
-let s = "abπc";
-assert_eq!(s.char_at(1), 'b');
-assert_eq!(s.char_at(2), 'π');
-assert_eq!(s.char_at(4), 'c');
-

fn char_at_reverse(&self, i: usize) -> char

-
Deprecated since 1.9.0

: use slicing plus chars().rev()

-
Unstable (str_char)

: use slicing plus chars().rev()

-

Given a byte position, returns the char at that position, counting -from the end.

- -

Panics

-

If i is greater than the length of the string. -If i is not an index following a valid UTF-8 sequence.

- -

Examples

-
-#![feature(str_char)]
-#![allow(deprecated)]
-
-let s = "abπc";
-assert_eq!(s.char_at_reverse(1), 'a');
-assert_eq!(s.char_at_reverse(2), 'b');
-assert_eq!(s.char_at_reverse(3), 'π');
-

fn slice_shift_char(&self) -> Option<(char, &str)>

-
Deprecated since 1.9.0

: use chars() plus Chars::as_str

-
Unstable (str_char)

: use chars() plus Chars::as_str

-

Retrieves the first char from a &str and returns it.

- -

Note that a single Unicode character (grapheme cluster) -can be composed of multiple chars.

- -

This does not allocate a new string; instead, it returns a slice that -points one code point beyond the code point that was shifted.

- -

None is returned if the slice is empty.

- -

Examples

-
-#![feature(str_char)]
-#![allow(deprecated)]
-
-let s = "Łódź"; // \u{141}o\u{301}dz\u{301}
-let (c, s1) = s.slice_shift_char().unwrap();
-
-assert_eq!(c, 'Ł');
-assert_eq!(s1, "ódź");
-
-let (c, s2) = s1.slice_shift_char().unwrap();
-
-assert_eq!(c, 'o');
-assert_eq!(s2, "\u{301}dz\u{301}");
-

fn split_at(&self, mid: usize) -> (&str, &str)1.4.0

-

Divide one string slice into two at an index.

- -

The argument, mid, should be a byte offset from the start of the -string. It must also be on the boundary of a UTF-8 code point.

- -

The two slices returned go from the start of the string slice to mid, -and from mid to the end of the string slice.

- -

To get mutable string slices instead, see the split_at_mut() -method.

- -

Panics

-

Panics if mid is not on a UTF-8 code point boundary, or if it is -beyond the last code point of the string slice.

- -

Examples

-

Basic usage:

- -
-let s = "Per Martin-Löf";
-
-let (first, last) = s.split_at(3);
-
-assert_eq!("Per", first);
-assert_eq!(" Martin-Löf", last);
-

fn split_at_mut(&mut self, mid: usize) -> (&mut str, &mut str)1.4.0

-

Divide one mutable string slice into two at an index.

- -

The argument, mid, should be a byte offset from the start of the -string. It must also be on the boundary of a UTF-8 code point.

- -

The two slices returned go from the start of the string slice to mid, -and from mid to the end of the string slice.

- -

To get immutable string slices instead, see the split_at() method.

- -

Panics

-

Panics if mid is not on a UTF-8 code point boundary, or if it is -beyond the last code point of the string slice.

- -

Examples

-

Basic usage:

- -
-let mut s = "Per Martin-Löf".to_string();
-
-let (first, last) = s.split_at_mut(3);
-
-assert_eq!("Per", first);
-assert_eq!(" Martin-Löf", last);
-

fn chars(&self) -> Chars

-

Returns an iterator over the chars of a string slice.

- -

As a string slice consists of valid UTF-8, we can iterate through a -string slice by char. This method returns such an iterator.

- -

It's important to remember that char represents a Unicode Scalar -Value, and may not match your idea of what a 'character' is. Iteration -over grapheme clusters may be what you actually want.

- -

Examples

-

Basic usage:

- -
-let word = "goodbye";
-
-let count = word.chars().count();
-assert_eq!(7, count);
-
-let mut chars = word.chars();
-
-assert_eq!(Some('g'), chars.next());
-assert_eq!(Some('o'), chars.next());
-assert_eq!(Some('o'), chars.next());
-assert_eq!(Some('d'), chars.next());
-assert_eq!(Some('b'), chars.next());
-assert_eq!(Some('y'), chars.next());
-assert_eq!(Some('e'), chars.next());
-
-assert_eq!(None, chars.next());
- -

Remember, chars may not match your human intuition about characters:

- -
-let y = "y̆";
-
-let mut chars = y.chars();
-
-assert_eq!(Some('y'), chars.next()); // not 'y̆'
-assert_eq!(Some('\u{0306}'), chars.next());
-
-assert_eq!(None, chars.next());
-

fn char_indices(&self) -> CharIndices

-

Returns an iterator over the chars of a string slice, and their -positions.

- -

As a string slice consists of valid UTF-8, we can iterate through a -string slice by char. This method returns an iterator of both -these chars, as well as their byte positions.

- -

The iterator yields tuples. The position is first, the char is -second.

- -

Examples

-

Basic usage:

- -
-let word = "goodbye";
-
-let count = word.char_indices().count();
-assert_eq!(7, count);
-
-let mut char_indices = word.char_indices();
-
-assert_eq!(Some((0, 'g')), char_indices.next());
-assert_eq!(Some((1, 'o')), char_indices.next());
-assert_eq!(Some((2, 'o')), char_indices.next());
-assert_eq!(Some((3, 'd')), char_indices.next());
-assert_eq!(Some((4, 'b')), char_indices.next());
-assert_eq!(Some((5, 'y')), char_indices.next());
-assert_eq!(Some((6, 'e')), char_indices.next());
-
-assert_eq!(None, char_indices.next());
- -

Remember, chars may not match your human intuition about characters:

- -
-let y = "y̆";
-
-let mut char_indices = y.char_indices();
-
-assert_eq!(Some((0, 'y')), char_indices.next()); // not (0, 'y̆')
-assert_eq!(Some((1, '\u{0306}')), char_indices.next());
-
-assert_eq!(None, char_indices.next());
-

fn bytes(&self) -> Bytes

-

An iterator over the bytes of a string slice.

- -

As a string slice consists of a sequence of bytes, we can iterate -through a string slice by byte. This method returns such an iterator.

- -

Examples

-

Basic usage:

- -
-let mut bytes = "bors".bytes();
-
-assert_eq!(Some(b'b'), bytes.next());
-assert_eq!(Some(b'o'), bytes.next());
-assert_eq!(Some(b'r'), bytes.next());
-assert_eq!(Some(b's'), bytes.next());
-
-assert_eq!(None, bytes.next());
-

fn split_whitespace(&self) -> SplitWhitespace1.1.0

-

Split a string slice by whitespace.

- -

The iterator returned will return string slices that are sub-slices of -the original string slice, separated by any amount of whitespace.

- -

'Whitespace' is defined according to the terms of the Unicode Derived -Core Property White_Space.

- -

Examples

-

Basic usage:

- -
-let mut iter = "A few words".split_whitespace();
-
-assert_eq!(Some("A"), iter.next());
-assert_eq!(Some("few"), iter.next());
-assert_eq!(Some("words"), iter.next());
-
-assert_eq!(None, iter.next());
- -

All kinds of whitespace are considered:

- -
-let mut iter = " Mary   had\ta\u{2009}little  \n\t lamb".split_whitespace();
-assert_eq!(Some("Mary"), iter.next());
-assert_eq!(Some("had"), iter.next());
-assert_eq!(Some("a"), iter.next());
-assert_eq!(Some("little"), iter.next());
-assert_eq!(Some("lamb"), iter.next());
-
-assert_eq!(None, iter.next());
-

fn lines(&self) -> Lines

-

An iterator over the lines of a string, as string slices.

- -

Lines are ended with either a newline (\n) or a carriage return with -a line feed (\r\n).

- -

The final line ending is optional.

- -

Examples

-

Basic usage:

- -
-let text = "foo\r\nbar\n\nbaz\n";
-let mut lines = text.lines();
-
-assert_eq!(Some("foo"), lines.next());
-assert_eq!(Some("bar"), lines.next());
-assert_eq!(Some(""), lines.next());
-assert_eq!(Some("baz"), lines.next());
-
-assert_eq!(None, lines.next());
- -

The final line ending isn't required:

- -
-let text = "foo\nbar\n\r\nbaz";
-let mut lines = text.lines();
-
-assert_eq!(Some("foo"), lines.next());
-assert_eq!(Some("bar"), lines.next());
-assert_eq!(Some(""), lines.next());
-assert_eq!(Some("baz"), lines.next());
-
-assert_eq!(None, lines.next());
-

fn lines_any(&self) -> LinesAny

-
Deprecated since 1.4.0

: use lines() instead now

-

An iterator over the lines of a string.

-

fn utf16_units(&self) -> EncodeUtf16

-
Deprecated since 1.8.0

: renamed to encode_utf16

-
Unstable (str_utf16)

: renamed to encode_utf16

-

Returns an iterator of u16 over the string encoded as UTF-16.

-

fn encode_utf16(&self) -> EncodeUtf161.8.0

-

Returns an iterator of u16 over the string encoded as UTF-16.

-

fn contains<'a, P>(&'a self, pat: P) -> bool where P: Pattern<'a>

-

Returns true if the given pattern matches a sub-slice of -this string slice.

- -

Returns false if it does not.

- -

Examples

-

Basic usage:

- -
-let bananas = "bananas";
-
-assert!(bananas.contains("nana"));
-assert!(!bananas.contains("apples"));
-

fn starts_with<'a, P>(&'a self, pat: P) -> bool where P: Pattern<'a>

-

Returns true if the given pattern matches a prefix of this -string slice.

- -

Returns false if it does not.

- -

Examples

-

Basic usage:

- -
-let bananas = "bananas";
-
-assert!(bananas.starts_with("bana"));
-assert!(!bananas.starts_with("nana"));
-

fn ends_with<'a, P>(&'a self, pat: P) -> bool where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

-

Returns true if the given pattern matches a suffix of this -string slice.

- -

Returns false if it does not.

- -

Examples

-

Basic usage:

- -
-let bananas = "bananas";
-
-assert!(bananas.ends_with("anas"));
-assert!(!bananas.ends_with("nana"));
-

fn find<'a, P>(&'a self, pat: P) -> Option<usize> where P: Pattern<'a>

-

Returns the byte index of the first character of this string slice that -matches the pattern.

- -

Returns None if the pattern doesn't match.

- -

The pattern can be a &str, char, or a closure that determines if -a character matches.

- -

Examples

-

Simple patterns:

- -
-let s = "Löwe 老虎 Léopard";
-
-assert_eq!(s.find('L'), Some(0));
-assert_eq!(s.find('é'), Some(14));
-assert_eq!(s.find("Léopard"), Some(13));
- -

More complex patterns with closures:

- -
-let s = "Löwe 老虎 Léopard";
-
-assert_eq!(s.find(char::is_whitespace), Some(5));
-assert_eq!(s.find(char::is_lowercase), Some(1));
- -

Not finding the pattern:

- -
-let s = "Löwe 老虎 Léopard";
-let x: &[_] = &['1', '2'];
-
-assert_eq!(s.find(x), None);
-

fn rfind<'a, P>(&'a self, pat: P) -> Option<usize> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

-

Returns the byte index of the last character of this string slice that -matches the pattern.

- -

Returns None if the pattern doesn't match.

- -

The pattern can be a &str, char, or a closure that determines if -a character matches.

- -

Examples

-

Simple patterns:

- -
-let s = "Löwe 老虎 Léopard";
-
-assert_eq!(s.rfind('L'), Some(13));
-assert_eq!(s.rfind('é'), Some(14));
- -

More complex patterns with closures:

- -
-let s = "Löwe 老虎 Léopard";
-
-assert_eq!(s.rfind(char::is_whitespace), Some(12));
-assert_eq!(s.rfind(char::is_lowercase), Some(20));
- -

Not finding the pattern:

- -
-let s = "Löwe 老虎 Léopard";
-let x: &[_] = &['1', '2'];
-
-assert_eq!(s.rfind(x), None);
-

fn split<'a, P>(&'a self, pat: P) -> Split<'a, P> where P: Pattern<'a>

-

An iterator over substrings of this string slice, separated by -characters matched by a pattern.

- -

The pattern can be a &str, char, or a closure that determines the -split.

- -

Iterator behavior

-

The returned iterator will be a DoubleEndedIterator if the pattern -allows a reverse search and forward/reverse search yields the same -elements. This is true for, eg, char but not for &str.

- -

If the pattern allows a reverse search but its results might differ -from a forward search, the rsplit() method can be used.

- -

Examples

-

Simple patterns:

- -
-let v: Vec<&str> = "Mary had a little lamb".split(' ').collect();
-assert_eq!(v, ["Mary", "had", "a", "little", "lamb"]);
-
-let v: Vec<&str> = "".split('X').collect();
-assert_eq!(v, [""]);
-
-let v: Vec<&str> = "lionXXtigerXleopard".split('X').collect();
-assert_eq!(v, ["lion", "", "tiger", "leopard"]);
-
-let v: Vec<&str> = "lion::tiger::leopard".split("::").collect();
-assert_eq!(v, ["lion", "tiger", "leopard"]);
-
-let v: Vec<&str> = "abc1def2ghi".split(char::is_numeric).collect();
-assert_eq!(v, ["abc", "def", "ghi"]);
-
-let v: Vec<&str> = "lionXtigerXleopard".split(char::is_uppercase).collect();
-assert_eq!(v, ["lion", "tiger", "leopard"]);
- -

A more complex pattern, using a closure:

- -
-let v: Vec<&str> = "abc1defXghi".split(|c| c == '1' || c == 'X').collect();
-assert_eq!(v, ["abc", "def", "ghi"]);
- -

If a string contains multiple contiguous separators, you will end up -with empty strings in the output:

- -
-let x = "||||a||b|c".to_string();
-let d: Vec<_> = x.split('|').collect();
-
-assert_eq!(d, &["", "", "", "", "a", "", "b", "c"]);
- -

This can lead to possibly surprising behavior when whitespace is used -as the separator. This code is correct:

- -
-let x = "    a  b c".to_string();
-let d: Vec<_> = x.split(' ').collect();
-
-assert_eq!(d, &["", "", "", "", "a", "", "b", "c"]);
- -

It does not give you:

- -
-assert_eq!(d, &["a", "b", "c"]);
- -

Use split_whitespace() for this behavior.

-

fn rsplit<'a, P>(&'a self, pat: P) -> RSplit<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

-

An iterator over substrings of the given string slice, separated by -characters matched by a pattern and yielded in reverse order.

- -

The pattern can be a &str, char, or a closure that determines the -split.

- -

Iterator behavior

-

The returned iterator requires that the pattern supports a reverse -search, and it will be a DoubleEndedIterator if a forward/reverse -search yields the same elements.

- -

For iterating from the front, the split() method can be used.

- -

Examples

-

Simple patterns:

- -
-let v: Vec<&str> = "Mary had a little lamb".rsplit(' ').collect();
-assert_eq!(v, ["lamb", "little", "a", "had", "Mary"]);
-
-let v: Vec<&str> = "".rsplit('X').collect();
-assert_eq!(v, [""]);
-
-let v: Vec<&str> = "lionXXtigerXleopard".rsplit('X').collect();
-assert_eq!(v, ["leopard", "tiger", "", "lion"]);
-
-let v: Vec<&str> = "lion::tiger::leopard".rsplit("::").collect();
-assert_eq!(v, ["leopard", "tiger", "lion"]);
- -

A more complex pattern, using a closure:

- -
-let v: Vec<&str> = "abc1defXghi".rsplit(|c| c == '1' || c == 'X').collect();
-assert_eq!(v, ["ghi", "def", "abc"]);
-

fn split_terminator<'a, P>(&'a self, pat: P) -> SplitTerminator<'a, P> where P: Pattern<'a>

-

An iterator over substrings of the given string slice, separated by -characters matched by a pattern.

- -

The pattern can be a &str, char, or a closure that determines the -split.

- -

Equivalent to split(), except that the trailing substring -is skipped if empty.

- -

This method can be used for string data that is terminated, -rather than separated by a pattern.

- -

Iterator behavior

-

The returned iterator will be a DoubleEndedIterator if the pattern -allows a reverse search and forward/reverse search yields the same -elements. This is true for, eg, char but not for &str.

- -

If the pattern allows a reverse search but its results might differ -from a forward search, the rsplit_terminator() method can be used.

- -

Examples

-

Basic usage:

- -
-let v: Vec<&str> = "A.B.".split_terminator('.').collect();
-assert_eq!(v, ["A", "B"]);
-
-let v: Vec<&str> = "A..B..".split_terminator(".").collect();
-assert_eq!(v, ["A", "", "B", ""]);
-

fn rsplit_terminator<'a, P>(&'a self, pat: P) -> RSplitTerminator<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

-

An iterator over substrings of self, separated by characters -matched by a pattern and yielded in reverse order.

- -

The pattern can be a simple &str, char, or a closure that -determines the split. -Additional libraries might provide more complex patterns like -regular expressions.

- -

Equivalent to split(), except that the trailing substring is -skipped if empty.

- -

This method can be used for string data that is terminated, -rather than separated by a pattern.

- -

Iterator behavior

-

The returned iterator requires that the pattern supports a -reverse search, and it will be double ended if a forward/reverse -search yields the same elements.

- -

For iterating from the front, the split_terminator() method can be -used.

- -

Examples

-
-let v: Vec<&str> = "A.B.".rsplit_terminator('.').collect();
-assert_eq!(v, ["B", "A"]);
-
-let v: Vec<&str> = "A..B..".rsplit_terminator(".").collect();
-assert_eq!(v, ["", "B", "", "A"]);
-

fn splitn<'a, P>(&'a self, count: usize, pat: P) -> SplitN<'a, P> where P: Pattern<'a>

-

An iterator over substrings of the given string slice, separated by a -pattern, restricted to returning at most count items.

- -

The last element returned, if any, will contain the remainder of the -string slice.

- -

The pattern can be a &str, char, or a closure that determines the -split.

- -

Iterator behavior

-

The returned iterator will not be double ended, because it is -not efficient to support.

- -

If the pattern allows a reverse search, the rsplitn() method can be -used.

- -

Examples

-

Simple patterns:

- -
-let v: Vec<&str> = "Mary had a little lambda".splitn(3, ' ').collect();
-assert_eq!(v, ["Mary", "had", "a little lambda"]);
-
-let v: Vec<&str> = "lionXXtigerXleopard".splitn(3, "X").collect();
-assert_eq!(v, ["lion", "", "tigerXleopard"]);
-
-let v: Vec<&str> = "abcXdef".splitn(1, 'X').collect();
-assert_eq!(v, ["abcXdef"]);
-
-let v: Vec<&str> = "".splitn(1, 'X').collect();
-assert_eq!(v, [""]);
- -

A more complex pattern, using a closure:

- -
-let v: Vec<&str> = "abc1defXghi".splitn(2, |c| c == '1' || c == 'X').collect();
-assert_eq!(v, ["abc", "defXghi"]);
-

fn rsplitn<'a, P>(&'a self, count: usize, pat: P) -> RSplitN<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

-

An iterator over substrings of this string slice, separated by a -pattern, starting from the end of the string, restricted to returning -at most count items.

- -

The last element returned, if any, will contain the remainder of the -string slice.

- -

The pattern can be a &str, char, or a closure that -determines the split.

- -

Iterator behavior

-

The returned iterator will not be double ended, because it is not -efficient to support.

- -

For splitting from the front, the splitn() method can be used.

- -

Examples

-

Simple patterns:

- -
-let v: Vec<&str> = "Mary had a little lamb".rsplitn(3, ' ').collect();
-assert_eq!(v, ["lamb", "little", "Mary had a"]);
-
-let v: Vec<&str> = "lionXXtigerXleopard".rsplitn(3, 'X').collect();
-assert_eq!(v, ["leopard", "tiger", "lionX"]);
-
-let v: Vec<&str> = "lion::tiger::leopard".rsplitn(2, "::").collect();
-assert_eq!(v, ["leopard", "lion::tiger"]);
- -

A more complex pattern, using a closure:

- -
-let v: Vec<&str> = "abc1defXghi".rsplitn(2, |c| c == '1' || c == 'X').collect();
-assert_eq!(v, ["ghi", "abc1def"]);
-

fn matches<'a, P>(&'a self, pat: P) -> Matches<'a, P> where P: Pattern<'a>1.2.0

-

An iterator over the matches of a pattern within the given string -slice.

- -

The pattern can be a &str, char, or a closure that -determines if a character matches.

- -

Iterator behavior

-

The returned iterator will be a DoubleEndedIterator if the pattern -allows a reverse search and forward/reverse search yields the same -elements. This is true for, eg, char but not for &str.

- -

If the pattern allows a reverse search but its results might differ -from a forward search, the rmatches() method can be used.

- -

Examples

-

Basic usage:

- -
-let v: Vec<&str> = "abcXXXabcYYYabc".matches("abc").collect();
-assert_eq!(v, ["abc", "abc", "abc"]);
-
-let v: Vec<&str> = "1abc2abc3".matches(char::is_numeric).collect();
-assert_eq!(v, ["1", "2", "3"]);
-

fn rmatches<'a, P>(&'a self, pat: P) -> RMatches<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>1.2.0

-

An iterator over the matches of a pattern within this string slice, -yielded in reverse order.

- -

The pattern can be a &str, char, or a closure that determines if -a character matches.

- -

Iterator behavior

-

The returned iterator requires that the pattern supports a reverse -search, and it will be a DoubleEndedIterator if a forward/reverse -search yields the same elements.

- -

For iterating from the front, the matches() method can be used.

- -

Examples

-

Basic usage:

- -
-let v: Vec<&str> = "abcXXXabcYYYabc".rmatches("abc").collect();
-assert_eq!(v, ["abc", "abc", "abc"]);
-
-let v: Vec<&str> = "1abc2abc3".rmatches(char::is_numeric).collect();
-assert_eq!(v, ["3", "2", "1"]);
-

fn match_indices<'a, P>(&'a self, pat: P) -> MatchIndices<'a, P> where P: Pattern<'a>1.5.0

-

An iterator over the disjoint matches of a pattern within this string -slice as well as the index that the match starts at.

- -

For matches of pat within self that overlap, only the indices -corresponding to the first match are returned.

- -

The pattern can be a &str, char, or a closure that determines -if a character matches.

- -

Iterator behavior

-

The returned iterator will be a DoubleEndedIterator if the pattern -allows a reverse search and forward/reverse search yields the same -elements. This is true for, eg, char but not for &str.

- -

If the pattern allows a reverse search but its results might differ -from a forward search, the rmatch_indices() method can be used.

- -

Examples

-

Basic usage:

- -
-let v: Vec<_> = "abcXXXabcYYYabc".match_indices("abc").collect();
-assert_eq!(v, [(0, "abc"), (6, "abc"), (12, "abc")]);
-
-let v: Vec<_> = "1abcabc2".match_indices("abc").collect();
-assert_eq!(v, [(1, "abc"), (4, "abc")]);
-
-let v: Vec<_> = "ababa".match_indices("aba").collect();
-assert_eq!(v, [(0, "aba")]); // only the first `aba`
-

fn rmatch_indices<'a, P>(&'a self, pat: P) -> RMatchIndices<'a, P> where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>1.5.0

-

An iterator over the disjoint matches of a pattern within self, -yielded in reverse order along with the index of the match.

- -

For matches of pat within self that overlap, only the indices -corresponding to the last match are returned.

- -

The pattern can be a &str, char, or a closure that determines if a -character matches.

- -

Iterator behavior

-

The returned iterator requires that the pattern supports a reverse -search, and it will be a DoubleEndedIterator if a forward/reverse -search yields the same elements.

- -

For iterating from the front, the match_indices() method can be used.

- -

Examples

-

Basic usage:

- -
-let v: Vec<_> = "abcXXXabcYYYabc".rmatch_indices("abc").collect();
-assert_eq!(v, [(12, "abc"), (6, "abc"), (0, "abc")]);
-
-let v: Vec<_> = "1abcabc2".rmatch_indices("abc").collect();
-assert_eq!(v, [(4, "abc"), (1, "abc")]);
-
-let v: Vec<_> = "ababa".rmatch_indices("aba").collect();
-assert_eq!(v, [(2, "aba")]); // only the last `aba`
-

fn trim(&self) -> &str

-

Returns a string slice with leading and trailing whitespace removed.

- -

'Whitespace' is defined according to the terms of the Unicode Derived -Core Property White_Space.

- -

Examples

-

Basic usage:

- -
-let s = " Hello\tworld\t";
-
-assert_eq!("Hello\tworld", s.trim());
-

fn trim_left(&self) -> &str

-

Returns a string slice with leading whitespace removed.

- -

'Whitespace' is defined according to the terms of the Unicode Derived -Core Property White_Space.

- -

Text directionality

-

A string is a sequence of bytes. 'Left' in this context means the first -position of that byte string; for a language like Arabic or Hebrew -which are 'right to left' rather than 'left to right', this will be -the right side, not the left.

- -

Examples

-

Basic usage:

- -
-let s = " Hello\tworld\t";
-
-assert_eq!("Hello\tworld\t", s.trim_left());
- -

Directionality:

- -
-let s = "  English";
-assert!(Some('E') == s.trim_left().chars().next());
-
-let s = "  עברית";
-assert!(Some('ע') == s.trim_left().chars().next());
-

fn trim_right(&self) -> &str

-

Returns a string slice with trailing whitespace removed.

- -

'Whitespace' is defined according to the terms of the Unicode Derived -Core Property White_Space.

- -

Text directionality

-

A string is a sequence of bytes. 'Right' in this context means the last -position of that byte string; for a language like Arabic or Hebrew -which are 'right to left' rather than 'left to right', this will be -the left side, not the right.

- -

Examples

-

Basic usage:

- -
-let s = " Hello\tworld\t";
-
-assert_eq!(" Hello\tworld", s.trim_right());
- -

Directionality:

- -
-let s = "English  ";
-assert!(Some('h') == s.trim_right().chars().rev().next());
-
-let s = "עברית  ";
-assert!(Some('ת') == s.trim_right().chars().rev().next());
-

fn trim_matches<'a, P>(&'a self, pat: P) -> &'a str where P: Pattern<'a>, P::Searcher: DoubleEndedSearcher<'a>

-

Returns a string slice with all prefixes and suffixes that match a -pattern repeatedly removed.

- -

The pattern can be a &str, char, or a closure that determines -if a character matches.

- -

Examples

-

Simple patterns:

- -
-assert_eq!("11foo1bar11".trim_matches('1'), "foo1bar");
-assert_eq!("123foo1bar123".trim_matches(char::is_numeric), "foo1bar");
-
-let x: &[_] = &['1', '2'];
-assert_eq!("12foo1bar12".trim_matches(x), "foo1bar");
- -

A more complex pattern, using a closure:

- -
-assert_eq!("1foo1barXX".trim_matches(|c| c == '1' || c == 'X'), "foo1bar");
-

fn trim_left_matches<'a, P>(&'a self, pat: P) -> &'a str where P: Pattern<'a>

-

Returns a string slice with all prefixes that match a pattern -repeatedly removed.

- -

The pattern can be a &str, char, or a closure that determines if -a character matches.

- -

Text directionality

-

A string is a sequence of bytes. 'Left' in this context means the first -position of that byte string; for a language like Arabic or Hebrew -which are 'right to left' rather than 'left to right', this will be -the right side, not the left.

- -

Examples

-

Basic usage:

- -
-assert_eq!("11foo1bar11".trim_left_matches('1'), "foo1bar11");
-assert_eq!("123foo1bar123".trim_left_matches(char::is_numeric), "foo1bar123");
-
-let x: &[_] = &['1', '2'];
-assert_eq!("12foo1bar12".trim_left_matches(x), "foo1bar12");
-

fn trim_right_matches<'a, P>(&'a self, pat: P) -> &'a str where P: Pattern<'a>, P::Searcher: ReverseSearcher<'a>

-

Returns a string slice with all suffixes that match a pattern -repeatedly removed.

- -

The pattern can be a &str, char, or a closure that -determines if a character matches.

- -

Text directionality

-

A string is a sequence of bytes. 'Right' in this context means the last -position of that byte string; for a language like Arabic or Hebrew -which are 'right to left' rather than 'left to right', this will be -the left side, not the right.

- -

Examples

-

Simple patterns:

- -
-assert_eq!("11foo1bar11".trim_right_matches('1'), "11foo1bar");
-assert_eq!("123foo1bar123".trim_right_matches(char::is_numeric), "123foo1bar");
-
-let x: &[_] = &['1', '2'];
-assert_eq!("12foo1bar12".trim_right_matches(x), "12foo1bar");
- -

A more complex pattern, using a closure:

- -
-assert_eq!("1fooX".trim_left_matches(|c| c == '1' || c == 'X'), "fooX");
-

fn parse<F>(&self) -> Result<F, F::Err> where F: FromStr

-

Parses this string slice into another type.

- -

Because parse() is so general, it can cause problems with type -inference. As such, parse() is one of the few times you'll see -the syntax affectionately known as the 'turbofish': ::<>. This -helps the inference algorithm understand specifically which type -you're trying to parse into.

- -

parse() can parse any type that implements the FromStr trait.

- -

Errors

-

Will return Err if it's not possible to parse this string slice into -the desired type.

- -

Example

-

Basic usage

- -
-let four: u32 = "4".parse().unwrap();
-
-assert_eq!(4, four);
- -

Using the 'turbofish' instead of annotating four:

- -
-let four = "4".parse::<u32>();
-
-assert_eq!(Ok(4), four);
- -

Failing to parse:

- -
-let nope = "j".parse::<u32>();
-
-assert!(nope.is_err());
-

fn replace<'a, P>(&'a self, from: P, to: &str) -> String where P: Pattern<'a>

-

Replaces all matches of a pattern with another string.

- -

replace creates a new String, and copies the data from this string slice into it. -While doing so, it attempts to find matches of a pattern. If it finds any, it -replaces them with the replacement string slice.

- -

Examples

-

Basic usage:

- -
-let s = "this is old";
-
-assert_eq!("this is new", s.replace("old", "new"));
- -

When the pattern doesn't match:

- -
-let s = "this is old";
-assert_eq!(s, s.replace("cookie monster", "little lamb"));
-

fn to_lowercase(&self) -> String1.2.0

-

Returns the lowercase equivalent of this string slice, as a new String.

- -

'Lowercase' is defined according to the terms of the Unicode Derived Core Property -Lowercase.

- -

Examples

-

Basic usage:

- -
-let s = "HELLO";
-
-assert_eq!("hello", s.to_lowercase());
- -

A tricky example, with sigma:

- -
-let sigma = "Σ";
-
-assert_eq!("σ", sigma.to_lowercase());
-
-// but at the end of a word, it's ς, not σ:
-let odysseus = "ὈΔΥΣΣΕΎΣ";
-
-assert_eq!("ὀδυσσεύς", odysseus.to_lowercase());
- -

Languages without case are not changed:

- -
-let new_year = "农历新年";
-
-assert_eq!(new_year, new_year.to_lowercase());
-

fn to_uppercase(&self) -> String1.2.0

-

Returns the uppercase equivalent of this string slice, as a new String.

- -

'Uppercase' is defined according to the terms of the Unicode Derived Core Property -Uppercase.

- -

Examples

-

Basic usage:

- -
-let s = "hello";
-
-assert_eq!("HELLO", s.to_uppercase());
- -

Scripts without case are not changed:

- -
-let new_year = "农历新年";
-
-assert_eq!(new_year, new_year.to_uppercase());
-

fn escape_default(&self) -> String

-
Unstable (str_escape)

: return type may change to be an iterator

-

Escapes each char in s with char::escape_default.

-

fn escape_unicode(&self) -> String

-
Unstable (str_escape)

: return type may change to be an iterator

-

Escapes each char in s with char::escape_unicode.

-

fn into_string(self: Box<str>) -> String1.4.0

-

Converts a Box<str> into a String without copying or allocating.

- -

Examples

-

Basic usage:

- -
-let string = String::from("birthday gift");
-let boxed_str = string.clone().into_boxed_str();
-
-assert_eq!(boxed_str.into_string(), string);
-

Trait Implementations

impl AsRef<OsStr> for String

fn as_ref(&self) -> &OsStr

-

impl AsRef<Path> for String

fn as_ref(&self) -> &Path

-

impl Borrow<str> for String

fn borrow(&self) -> &str

-

impl Clone for String

fn clone(&self) -> String

-

fn clone_from(&mut self, source: &String)

-

impl FromIterator<char> for String

fn from_iter<I>(iter: I) -> String where I: IntoIterator<Item=char>

-

impl<'a> FromIterator<&'a str> for String

fn from_iter<I>(iter: I) -> String where I: IntoIterator<Item=&'a str>

-

impl FromIterator<String> for String1.4.0

fn from_iter<I>(iter: I) -> String where I: IntoIterator<Item=String>

-

impl Extend<char> for String

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=char>

-

impl<'a> Extend<&'a char> for String1.2.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a char>

-

impl<'a> Extend<&'a str> for String

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a str>

-

impl Extend<String> for String1.4.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=String>

-

impl<'a, 'b> Pattern<'a> for &'b String

A convenience impl that delegates to the impl for &str

-

type Searcher = &'b str::Searcher

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn into_searcher(self, haystack: &'a str) -> &'b str::Searcher

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn is_contained_in(self, haystack: &'a str) -> bool

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn is_prefix_of(self, haystack: &'a str) -> bool

-
Unstable (pattern)

: API not fully fleshed out and ready to be stabilized

-

fn is_suffix_of(self, haystack: &'a str) -> bool where Self::Searcher: ReverseSearcher<'a>

-

impl PartialEq<String> for String

fn eq(&self, other: &String) -> bool

-

fn ne(&self, other: &String) -> bool

-

impl<'a, 'b> PartialEq<str> for String

fn eq(&self, other: &str) -> bool

-

fn ne(&self, other: &str) -> bool

-

impl<'a, 'b> PartialEq<&'a str> for String

fn eq(&self, other: &&'a str) -> bool

-

fn ne(&self, other: &&'a str) -> bool

-

impl<'a, 'b> PartialEq<Cow<'a, str>> for String

fn eq(&self, other: &Cow<'a, str>) -> bool

-

fn ne(&self, other: &Cow<'a, str>) -> bool

-

impl Default for String

fn default() -> String

-

impl Display for String

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl Debug for String

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl Hash for String

fn hash<H>(&self, hasher: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<'a> Add<&'a str> for String

type Output = String

-

fn add(self, other: &str) -> String

-

impl Index<Range<usize>> for String

type Output = str

-

fn index(&self, index: Range<usize>) -> &str

-

impl Index<RangeTo<usize>> for String

type Output = str

-

fn index(&self, index: RangeTo<usize>) -> &str

-

impl Index<RangeFrom<usize>> for String

type Output = str

-

fn index(&self, index: RangeFrom<usize>) -> &str

-

impl Index<RangeFull> for String

type Output = str

-

fn index(&self, _index: RangeFull) -> &str

-

impl Index<RangeInclusive<usize>> for String

type Output = str

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn index(&self, index: RangeInclusive<usize>) -> &str

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl Index<RangeToInclusive<usize>> for String

type Output = str

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn index(&self, index: RangeToInclusive<usize>) -> &str

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl IndexMut<Range<usize>> for String1.2.0

fn index_mut(&mut self, index: Range<usize>) -> &mut str

-

impl IndexMut<RangeTo<usize>> for String1.2.0

fn index_mut(&mut self, index: RangeTo<usize>) -> &mut str

-

impl IndexMut<RangeFrom<usize>> for String1.2.0

fn index_mut(&mut self, index: RangeFrom<usize>) -> &mut str

-

impl IndexMut<RangeFull> for String1.2.0

fn index_mut(&mut self, _index: RangeFull) -> &mut str

-

impl IndexMut<RangeInclusive<usize>> for String

fn index_mut(&mut self, index: RangeInclusive<usize>) -> &mut str

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl IndexMut<RangeToInclusive<usize>> for String

fn index_mut(&mut self, index: RangeToInclusive<usize>) -> &mut str

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl Deref for String

type Target = str

-

fn deref(&self) -> &str

-

impl DerefMut for String1.2.0

fn deref_mut(&mut self) -> &mut str

-

impl FromStr for String

type Err = ParseError

-

fn from_str(s: &str) -> Result<String, ParseError>

-

impl AsRef<str> for String

fn as_ref(&self) -> &str

-

impl AsRef<[u8]> for String

fn as_ref(&self) -> &[u8]

-

impl<'a> From<&'a str> for String

fn from(s: &'a str) -> String

-

impl Into<Vec<u8>> for String

fn into(self) -> Vec<u8>

-

impl Write for String

fn write_str(&mut self, s: &str) -> Result<(), Error>

-

fn write_char(&mut self, c: char) -> Result<(), Error>

-

fn write_fmt(&mut self, args: Arguments) -> Result<(), Error>

-

Derived Implementations

impl Ord for String

fn cmp(&self, __arg_0: &String) -> Ordering

-

impl Eq for String

impl PartialOrd<String> for String

fn partial_cmp(&self, __arg_0: &String) -> Option<Ordering>

-

fn lt(&self, __arg_0: &String) -> bool

-

fn le(&self, __arg_0: &String) -> bool

-

fn gt(&self, __arg_0: &String) -> bool

-

fn ge(&self, __arg_0: &String) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/string/trait.ToString.html b/doc/bitflags/__core/string/trait.ToString.html deleted file mode 100644 index bf0b16c3..00000000 --- a/doc/bitflags/__core/string/trait.ToString.html +++ /dev/null @@ -1,140 +0,0 @@ - - - - - - - - - - bitflags::__core::string::ToString - Rust - - - - - - - - - - - - - - - - - -
-

Trait bitflags::__core::string::ToString - - [−] - - [src]

-
pub trait ToString {
-    fn to_string(&self) -> String;
-}

A trait for converting a value to a String.

- -

This trait is automatically implemented for any type which implements the -Display trait. As such, ToString shouldn't be implemented directly: -Display should be implemented instead, and you get the ToString -implementation for free.

-
-

Required Methods

-
-

fn to_string(&self) -> String

Converts the given value to a String.

- -

Examples

-

Basic usage:

- -
-let i = 5;
-let five = String::from("5");
-
-assert_eq!(five, i.to_string());
-
-

Implementors

-
    -
  • impl<T> ToString for T where T: Display + ?Sized
    • -
  • impl ToString for str
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/atomic/constant.ATOMIC_BOOL_INIT.html b/doc/bitflags/__core/sync/atomic/constant.ATOMIC_BOOL_INIT.html deleted file mode 100644 index 6686de66..00000000 --- a/doc/bitflags/__core/sync/atomic/constant.ATOMIC_BOOL_INIT.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::atomic::ATOMIC_BOOL_INIT - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::sync::atomic::ATOMIC_BOOL_INIT - - [−] - - [src]

-
pub const ATOMIC_BOOL_INIT: AtomicBool = AtomicBool::new(false)

An AtomicBool initialized to false.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/atomic/constant.ATOMIC_ISIZE_INIT.html b/doc/bitflags/__core/sync/atomic/constant.ATOMIC_ISIZE_INIT.html deleted file mode 100644 index a89fda85..00000000 --- a/doc/bitflags/__core/sync/atomic/constant.ATOMIC_ISIZE_INIT.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::atomic::ATOMIC_ISIZE_INIT - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::sync::atomic::ATOMIC_ISIZE_INIT - - [−] - - [src]

-
pub const ATOMIC_ISIZE_INIT: AtomicIsize = AtomicIsize::new(0)

An AtomicIsize initialized to 0.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/atomic/constant.ATOMIC_USIZE_INIT.html b/doc/bitflags/__core/sync/atomic/constant.ATOMIC_USIZE_INIT.html deleted file mode 100644 index 86d43de8..00000000 --- a/doc/bitflags/__core/sync/atomic/constant.ATOMIC_USIZE_INIT.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::atomic::ATOMIC_USIZE_INIT - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::sync::atomic::ATOMIC_USIZE_INIT - - [−] - - [src]

-
pub const ATOMIC_USIZE_INIT: AtomicUsize = AtomicUsize::new(0)

An AtomicUsize initialized to 0.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/atomic/enum.Ordering.html b/doc/bitflags/__core/sync/atomic/enum.Ordering.html deleted file mode 100644 index 161d01a2..00000000 --- a/doc/bitflags/__core/sync/atomic/enum.Ordering.html +++ /dev/null @@ -1,144 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::atomic::Ordering - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::sync::atomic::Ordering - - [−] - - [src]

-
pub enum Ordering {
-    Relaxed,
-    Release,
-    Acquire,
-    AcqRel,
-    SeqCst,
-}
1.0.0

Atomic memory orderings

- -

Memory orderings limit the ways that both the compiler and CPU may reorder -instructions around atomic operations. At its most restrictive, -"sequentially consistent" atomics allow neither reads nor writes -to be moved either before or after the atomic operation; on the other end -"relaxed" atomics allow all reorderings.

- -

Rust's memory orderings are the same as -LLVM's.

-

Variants

-
Relaxed

No ordering constraints, only atomic operations. Corresponds to LLVM's -Monotonic ordering.

-
Release

When coupled with a store, all previous writes become visible -to another thread that performs a load with Acquire ordering -on the same value.

-
Acquire

When coupled with a load, all subsequent loads will see data -written before a store with Release ordering on the same value -in another thread.

-
AcqRel

When coupled with a load, uses Acquire ordering, and with a store -Release ordering.

-
SeqCst

Like AcqRel with the additional guarantee that all threads see all -sequentially consistent operations in the same order.

-

Trait Implementations

Derived Implementations

impl Debug for Ordering

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl Clone for Ordering

fn clone(&self) -> Ordering

-

fn clone_from(&mut self, source: &Self)

-

impl Copy for Ordering

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/atomic/fn.fence.html b/doc/bitflags/__core/sync/atomic/fn.fence.html deleted file mode 100644 index 5fd663fa..00000000 --- a/doc/bitflags/__core/sync/atomic/fn.fence.html +++ /dev/null @@ -1,131 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::atomic::fence - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::sync::atomic::fence - - [−] - - [src]

-
pub fn fence(order: Ordering)
1.0.0

An atomic fence.

- -

A fence 'A' which has Release ordering semantics, synchronizes with a -fence 'B' with (at least) Acquire semantics, if and only if there exists -atomic operations X and Y, both operating on some atomic object 'M' such -that A is sequenced before X, Y is synchronized before B and Y observes -the change to M. This provides a happens-before dependence between A and B.

- -

Atomic operations with Release or Acquire semantics can also synchronize -with a fence.

- -

A fence which has SeqCst ordering, in addition to having both Acquire -and Release semantics, participates in the global program order of the -other SeqCst operations and/or fences.

- -

Accepts Acquire, Release, AcqRel and SeqCst orderings.

- -

Panics

-

Panics if order is Relaxed.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/atomic/index.html b/doc/bitflags/__core/sync/atomic/index.html deleted file mode 100644 index 750aaac2..00000000 --- a/doc/bitflags/__core/sync/atomic/index.html +++ /dev/null @@ -1,232 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::atomic - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::sync::atomic - - [−] - - [src]

-

Atomic types

- -

Atomic types provide primitive shared-memory communication between -threads, and are the building blocks of other concurrent -types.

- -

This module defines atomic versions of a select number of primitive -types, including AtomicBool, AtomicIsize, and AtomicUsize. -Atomic types present operations that, when used correctly, synchronize -updates between threads.

- -

Each method takes an Ordering which represents the strength of -the memory barrier for that operation. These orderings are the -same as LLVM atomic orderings.

- -

Atomic variables are safe to share between threads (they implement Sync) -but they do not themselves provide the mechanism for sharing. The most -common way to share an atomic variable is to put it into an Arc (an -atomically-reference-counted shared pointer).

- -

Most atomic types may be stored in static variables, initialized using -the provided static initializers like INIT_ATOMIC_BOOL. Atomic statics -are often used for lazy global initialization.

- -

Examples

-

A simple spinlock:

- -
-use std::sync::Arc;
-use std::sync::atomic::{AtomicUsize, Ordering};
-use std::thread;
-
-fn main() {
-    let spinlock = Arc::new(AtomicUsize::new(1));
-
-    let spinlock_clone = spinlock.clone();
-    thread::spawn(move|| {
-        spinlock_clone.store(0, Ordering::SeqCst);
-    });
-
-    // Wait for the other thread to release the lock
-    while spinlock.load(Ordering::SeqCst) != 0 {}
-}
- -

Keep a global count of live threads:

- -
-use std::sync::atomic::{AtomicUsize, Ordering, ATOMIC_USIZE_INIT};
-
-static GLOBAL_THREAD_COUNT: AtomicUsize = ATOMIC_USIZE_INIT;
-
-let old_thread_count = GLOBAL_THREAD_COUNT.fetch_add(1, Ordering::SeqCst);
-println!("live threads: {}", old_thread_count + 1);
-

Structs

- - - - - - - - - - - - - - - - -
AtomicBool -

A boolean type which can be safely shared between threads.

-
AtomicIsize -

A signed integer type which can be safely shared between threads.

-
AtomicPtr -

A raw pointer type which can be safely shared between threads.

-
AtomicUsize -

An unsigned integer type which can be safely shared between threads.

-

Enums

- - - - -
Ordering -

Atomic memory orderings

-

Constants

- - - - - - - - - - - - -
ATOMIC_BOOL_INIT -

An AtomicBool initialized to false.

-
ATOMIC_ISIZE_INIT -

An AtomicIsize initialized to 0.

-
ATOMIC_USIZE_INIT -

An AtomicUsize initialized to 0.

-

Functions

- - - - -
fence -

An atomic fence.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/atomic/sidebar-items.js b/doc/bitflags/__core/sync/atomic/sidebar-items.js deleted file mode 100644 index 3e16cc84..00000000 --- a/doc/bitflags/__core/sync/atomic/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["ATOMIC_BOOL_INIT","An `AtomicBool` initialized to `false`."],["ATOMIC_ISIZE_INIT","An `AtomicIsize` initialized to `0`."],["ATOMIC_USIZE_INIT","An `AtomicUsize` initialized to `0`."]],"enum":[["Ordering","Atomic memory orderings"]],"fn":[["fence","An atomic fence."]],"struct":[["AtomicBool","A boolean type which can be safely shared between threads."],["AtomicIsize","A signed integer type which can be safely shared between threads."],["AtomicPtr","A raw pointer type which can be safely shared between threads."],["AtomicUsize","An unsigned integer type which can be safely shared between threads."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/sync/atomic/struct.AtomicBool.html b/doc/bitflags/__core/sync/atomic/struct.AtomicBool.html deleted file mode 100644 index af3786cf..00000000 --- a/doc/bitflags/__core/sync/atomic/struct.AtomicBool.html +++ /dev/null @@ -1,342 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::atomic::AtomicBool - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::atomic::AtomicBool - - [−] - - [src]

-
pub struct AtomicBool {
-    // some fields omitted
-}
1.0.0

A boolean type which can be safely shared between threads.

-

Methods

impl AtomicBool

const fn new(v: bool) -> AtomicBool

-

Creates a new AtomicBool.

- -

Examples

-
-use std::sync::atomic::AtomicBool;
-
-let atomic_true  = AtomicBool::new(true);
-let atomic_false = AtomicBool::new(false);
-

fn load(&self, order: Ordering) -> bool

-

Loads a value from the bool.

- -

load takes an Ordering argument which describes the memory ordering of this operation.

- -

Panics

-

Panics if order is Release or AcqRel.

- -

Examples

-
-use std::sync::atomic::{AtomicBool, Ordering};
-
-let some_bool = AtomicBool::new(true);
-
-assert_eq!(some_bool.load(Ordering::Relaxed), true);
-

fn store(&self, val: bool, order: Ordering)

-

Stores a value into the bool.

- -

store takes an Ordering argument which describes the memory ordering of this operation.

- -

Examples

-
-use std::sync::atomic::{AtomicBool, Ordering};
-
-let some_bool = AtomicBool::new(true);
-
-some_bool.store(false, Ordering::Relaxed);
-assert_eq!(some_bool.load(Ordering::Relaxed), false);
- -

Panics

-

Panics if order is Acquire or AcqRel.

-

fn swap(&self, val: bool, order: Ordering) -> bool

-

Stores a value into the bool, returning the old value.

- -

swap takes an Ordering argument which describes the memory ordering of this operation.

- -

Examples

-
-use std::sync::atomic::{AtomicBool, Ordering};
-
-let some_bool = AtomicBool::new(true);
-
-assert_eq!(some_bool.swap(false, Ordering::Relaxed), true);
-assert_eq!(some_bool.load(Ordering::Relaxed), false);
-

fn compare_and_swap(&self, current: bool, new: bool, order: Ordering) -> bool

-

Stores a value into the bool if the current value is the same as the current value.

- -

The return value is always the previous value. If it is equal to current, then the value -was updated.

- -

compare_and_swap also takes an Ordering argument which describes the memory ordering of -this operation.

- -

Examples

-
-use std::sync::atomic::{AtomicBool, Ordering};
-
-let some_bool = AtomicBool::new(true);
-
-assert_eq!(some_bool.compare_and_swap(true, false, Ordering::Relaxed), true);
-assert_eq!(some_bool.load(Ordering::Relaxed), false);
-
-assert_eq!(some_bool.compare_and_swap(true, true, Ordering::Relaxed), false);
-assert_eq!(some_bool.load(Ordering::Relaxed), false);
-

fn compare_exchange(&self, current: bool, new: bool, success: Ordering, failure: Ordering) -> Result<bool, bool>

-
Unstable (extended_compare_and_swap)

: recently added

-

Stores a value into the bool if the current value is the same as the current value.

- -

The return value is a result indicating whether the new value was written and containing -the previous value. On success this value is guaranteed to be equal to new.

- -

compare_exchange takes two Ordering arguments to describe the memory ordering of this -operation. The first describes the required ordering if the operation succeeds while the -second describes the required ordering when the operation fails. The failure ordering can't -be Release or AcqRel and must be equivalent or weaker than the success ordering.

- -

Examples

-
-use std::sync::atomic::{AtomicBool, Ordering};
-
-let some_bool = AtomicBool::new(true);
-
-assert_eq!(some_bool.compare_exchange(true,
-                                      false,
-                                      Ordering::Acquire,
-                                      Ordering::Relaxed),
-           Ok(true));
-assert_eq!(some_bool.load(Ordering::Relaxed), false);
-
-assert_eq!(some_bool.compare_exchange(true, true,
-                                      Ordering::SeqCst,
-                                      Ordering::Acquire),
-           Err(false));
-assert_eq!(some_bool.load(Ordering::Relaxed), false);
-

fn compare_exchange_weak(&self, current: bool, new: bool, success: Ordering, failure: Ordering) -> Result<bool, bool>

-
Unstable (extended_compare_and_swap)

: recently added

-

Stores a value into the bool if the current value is the same as the current value.

- -

Unlike compare_exchange, this function is allowed to spuriously fail even when the -comparison succeeds, which can result in more efficient code on some platforms. The -return value is a result indicating whether the new value was written and containing the -previous value.

- -

compare_exchange_weak takes two Ordering arguments to describe the memory -ordering of this operation. The first describes the required ordering if the operation -succeeds while the second describes the required ordering when the operation fails. The -failure ordering can't be Release or AcqRel and must be equivalent or weaker than the -success ordering.

- -

Examples

-
-use std::sync::atomic::{AtomicBool, Ordering};
-
-let val = AtomicBool::new(false);
-
-let new = true;
-let mut old = val.load(Ordering::Relaxed);
-loop {
-    match val.compare_exchange_weak(old, new, Ordering::SeqCst, Ordering::Relaxed) {
-        Ok(_) => break,
-        Err(x) => old = x,
-    }
-}
-

fn fetch_and(&self, val: bool, order: Ordering) -> bool

-

Logical "and" with a boolean value.

- -

Performs a logical "and" operation on the current value and the argument val, and sets -the new value to the result.

- -

Returns the previous value.

- -

Examples

-
-use std::sync::atomic::{AtomicBool, Ordering};
-
-let foo = AtomicBool::new(true);
-assert_eq!(foo.fetch_and(false, Ordering::SeqCst), true);
-assert_eq!(foo.load(Ordering::SeqCst), false);
-
-let foo = AtomicBool::new(true);
-assert_eq!(foo.fetch_and(true, Ordering::SeqCst), true);
-assert_eq!(foo.load(Ordering::SeqCst), true);
-
-let foo = AtomicBool::new(false);
-assert_eq!(foo.fetch_and(false, Ordering::SeqCst), false);
-assert_eq!(foo.load(Ordering::SeqCst), false);
-

fn fetch_nand(&self, val: bool, order: Ordering) -> bool

-

Logical "nand" with a boolean value.

- -

Performs a logical "nand" operation on the current value and the argument val, and sets -the new value to the result.

- -

Returns the previous value.

- -

Examples

-
-use std::sync::atomic::{AtomicBool, Ordering};
-
-let foo = AtomicBool::new(true);
-assert_eq!(foo.fetch_nand(false, Ordering::SeqCst), true);
-assert_eq!(foo.load(Ordering::SeqCst), true);
-
-let foo = AtomicBool::new(true);
-assert_eq!(foo.fetch_nand(true, Ordering::SeqCst), true);
-assert_eq!(foo.load(Ordering::SeqCst) as usize, 0);
-assert_eq!(foo.load(Ordering::SeqCst), false);
-
-let foo = AtomicBool::new(false);
-assert_eq!(foo.fetch_nand(false, Ordering::SeqCst), false);
-assert_eq!(foo.load(Ordering::SeqCst), true);
-

fn fetch_or(&self, val: bool, order: Ordering) -> bool

-

Logical "or" with a boolean value.

- -

Performs a logical "or" operation on the current value and the argument val, and sets the -new value to the result.

- -

Returns the previous value.

- -

Examples

-
-use std::sync::atomic::{AtomicBool, Ordering};
-
-let foo = AtomicBool::new(true);
-assert_eq!(foo.fetch_or(false, Ordering::SeqCst), true);
-assert_eq!(foo.load(Ordering::SeqCst), true);
-
-let foo = AtomicBool::new(true);
-assert_eq!(foo.fetch_or(true, Ordering::SeqCst), true);
-assert_eq!(foo.load(Ordering::SeqCst), true);
-
-let foo = AtomicBool::new(false);
-assert_eq!(foo.fetch_or(false, Ordering::SeqCst), false);
-assert_eq!(foo.load(Ordering::SeqCst), false);
-

fn fetch_xor(&self, val: bool, order: Ordering) -> bool

-

Logical "xor" with a boolean value.

- -

Performs a logical "xor" operation on the current value and the argument val, and sets -the new value to the result.

- -

Returns the previous value.

- -

Examples

-
-use std::sync::atomic::{AtomicBool, Ordering};
-
-let foo = AtomicBool::new(true);
-assert_eq!(foo.fetch_xor(false, Ordering::SeqCst), true);
-assert_eq!(foo.load(Ordering::SeqCst), true);
-
-let foo = AtomicBool::new(true);
-assert_eq!(foo.fetch_xor(true, Ordering::SeqCst), true);
-assert_eq!(foo.load(Ordering::SeqCst), false);
-
-let foo = AtomicBool::new(false);
-assert_eq!(foo.fetch_xor(false, Ordering::SeqCst), false);
-assert_eq!(foo.load(Ordering::SeqCst), false);
-

Trait Implementations

impl Default for AtomicBool

fn default() -> AtomicBool

-

impl Sync for AtomicBool

impl Debug for AtomicBool1.3.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/atomic/struct.AtomicIsize.html b/doc/bitflags/__core/sync/atomic/struct.AtomicIsize.html deleted file mode 100644 index 6eaed21d..00000000 --- a/doc/bitflags/__core/sync/atomic/struct.AtomicIsize.html +++ /dev/null @@ -1,296 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::atomic::AtomicIsize - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::atomic::AtomicIsize - - [−] - - [src]

-
pub struct AtomicIsize {
-    // some fields omitted
-}
1.0.0

A signed integer type which can be safely shared between threads.

-

Methods

impl AtomicIsize

const fn new(v: isize) -> AtomicIsize

-

Creates a new AtomicIsize.

- -

Examples

-
-use std::sync::atomic::AtomicIsize;
-
-let atomic_forty_two  = AtomicIsize::new(42);
-

fn load(&self, order: Ordering) -> isize

-

Loads a value from the isize.

- -

load takes an Ordering argument which describes the memory ordering of this operation.

- -

Panics

-

Panics if order is Release or AcqRel.

- -

Examples

-
-use std::sync::atomic::{AtomicIsize, Ordering};
-
-let some_isize = AtomicIsize::new(5);
-
-assert_eq!(some_isize.load(Ordering::Relaxed), 5);
-

fn store(&self, val: isize, order: Ordering)

-

Stores a value into the isize.

- -

store takes an Ordering argument which describes the memory ordering of this operation.

- -

Examples

-
-use std::sync::atomic::{AtomicIsize, Ordering};
-
-let some_isize = AtomicIsize::new(5);
-
-some_isize.store(10, Ordering::Relaxed);
-assert_eq!(some_isize.load(Ordering::Relaxed), 10);
- -

Panics

-

Panics if order is Acquire or AcqRel.

-

fn swap(&self, val: isize, order: Ordering) -> isize

-

Stores a value into the isize, returning the old value.

- -

swap takes an Ordering argument which describes the memory ordering of this operation.

- -

Examples

-
-use std::sync::atomic::{AtomicIsize, Ordering};
-
-let some_isize = AtomicIsize::new(5);
-
-assert_eq!(some_isize.swap(10, Ordering::Relaxed), 5);
-

fn compare_and_swap(&self, current: isize, new: isize, order: Ordering) -> isize

-

Stores a value into the isize if the current value is the same as the current value.

- -

The return value is always the previous value. If it is equal to current, then the value -was updated.

- -

compare_and_swap also takes an Ordering argument which describes the memory ordering of -this operation.

- -

Examples

-
-use std::sync::atomic::{AtomicIsize, Ordering};
-
-let some_isize = AtomicIsize::new(5);
-
-assert_eq!(some_isize.compare_and_swap(5, 10, Ordering::Relaxed), 5);
-assert_eq!(some_isize.load(Ordering::Relaxed), 10);
-
-assert_eq!(some_isize.compare_and_swap(6, 12, Ordering::Relaxed), 10);
-assert_eq!(some_isize.load(Ordering::Relaxed), 10);
-

fn compare_exchange(&self, current: isize, new: isize, success: Ordering, failure: Ordering) -> Result<isize, isize>

-
Unstable (extended_compare_and_swap)

: recently added

-

Stores a value into the isize if the current value is the same as the current value.

- -

The return value is a result indicating whether the new value was written and containing -the previous value. On success this value is guaranteed to be equal to new.

- -

compare_exchange takes two Ordering arguments to describe the memory ordering of this -operation. The first describes the required ordering if the operation succeeds while the -second describes the required ordering when the operation fails. The failure ordering can't -be Release or AcqRel and must be equivalent or weaker than the success ordering.

- -

Examples

-
-use std::sync::atomic::{AtomicIsize, Ordering};
-
-let some_isize = AtomicIsize::new(5);
-
-assert_eq!(some_isize.compare_exchange(5, 10,
-                                       Ordering::Acquire,
-                                       Ordering::Relaxed),
-           Ok(5));
-assert_eq!(some_isize.load(Ordering::Relaxed), 10);
-
-assert_eq!(some_isize.compare_exchange(6, 12,
-                                       Ordering::SeqCst,
-                                       Ordering::Acquire),
-           Err(10));
-assert_eq!(some_isize.load(Ordering::Relaxed), 10);
-

fn compare_exchange_weak(&self, current: isize, new: isize, success: Ordering, failure: Ordering) -> Result<isize, isize>

-
Unstable (extended_compare_and_swap)

: recently added

-

Stores a value into the isize if the current value is the same as the current value.

- -

Unlike compare_exchange, this function is allowed to spuriously fail even when the -comparison succeeds, which can result in more efficient code on some platforms. The -return value is a result indicating whether the new value was written and containing the -previous value.

- -

compare_exchange_weak takes two Ordering arguments to describe the memory -ordering of this operation. The first describes the required ordering if the operation -succeeds while the second describes the required ordering when the operation fails. The -failure ordering can't be Release or AcqRel and must be equivalent or weaker than the -success ordering.

- -

Examples

-
-use std::sync::atomic::{AtomicIsize, Ordering};
-
-let val = AtomicIsize::new(4);
-
-let mut old = val.load(Ordering::Relaxed);
-loop {
-    let new = old * 2;
-    match val.compare_exchange_weak(old, new, Ordering::SeqCst, Ordering::Relaxed) {
-        Ok(_) => break,
-        Err(x) => old = x,
-    }
-}
-

fn fetch_add(&self, val: isize, order: Ordering) -> isize

-

Add an isize to the current value, returning the previous value.

- -

Examples

-
-use std::sync::atomic::{AtomicIsize, Ordering};
-
-let foo = AtomicIsize::new(0);
-assert_eq!(foo.fetch_add(10, Ordering::SeqCst), 0);
-assert_eq!(foo.load(Ordering::SeqCst), 10);
-

fn fetch_sub(&self, val: isize, order: Ordering) -> isize

-

Subtract an isize from the current value, returning the previous value.

- -

Examples

-
-use std::sync::atomic::{AtomicIsize, Ordering};
-
-let foo = AtomicIsize::new(0);
-assert_eq!(foo.fetch_sub(10, Ordering::SeqCst), 0);
-assert_eq!(foo.load(Ordering::SeqCst), -10);
-

fn fetch_and(&self, val: isize, order: Ordering) -> isize

-

Bitwise and with the current isize, returning the previous value.

- -

Examples

-
-use std::sync::atomic::{AtomicIsize, Ordering};
-
-let foo = AtomicIsize::new(0b101101);
-assert_eq!(foo.fetch_and(0b110011, Ordering::SeqCst), 0b101101);
-assert_eq!(foo.load(Ordering::SeqCst), 0b100001);
-

fn fetch_or(&self, val: isize, order: Ordering) -> isize

-

Bitwise or with the current isize, returning the previous value.

- -

Examples

-
-use std::sync::atomic::{AtomicIsize, Ordering};
-
-let foo = AtomicIsize::new(0b101101);
-assert_eq!(foo.fetch_or(0b110011, Ordering::SeqCst), 0b101101);
-assert_eq!(foo.load(Ordering::SeqCst), 0b111111);
-

fn fetch_xor(&self, val: isize, order: Ordering) -> isize

-

Bitwise xor with the current isize, returning the previous value.

- -

Examples

-
-use std::sync::atomic::{AtomicIsize, Ordering};
-
-let foo = AtomicIsize::new(0b101101);
-assert_eq!(foo.fetch_xor(0b110011, Ordering::SeqCst), 0b101101);
-assert_eq!(foo.load(Ordering::SeqCst), 0b011110);
-

Trait Implementations

impl Default for AtomicIsize

fn default() -> AtomicIsize

-

impl Sync for AtomicIsize

impl Debug for AtomicIsize1.3.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/atomic/struct.AtomicPtr.html b/doc/bitflags/__core/sync/atomic/struct.AtomicPtr.html deleted file mode 100644 index 42978c38..00000000 --- a/doc/bitflags/__core/sync/atomic/struct.AtomicPtr.html +++ /dev/null @@ -1,248 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::atomic::AtomicPtr - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::atomic::AtomicPtr - - [−] - - [src]

-
pub struct AtomicPtr<T> {
-    // some fields omitted
-}
1.0.0

A raw pointer type which can be safely shared between threads.

-

Methods

impl<T> AtomicPtr<T>

const fn new(p: *mut T) -> AtomicPtr<T>

-

Creates a new AtomicPtr.

- -

Examples

-
-use std::sync::atomic::AtomicPtr;
-
-let ptr = &mut 5;
-let atomic_ptr  = AtomicPtr::new(ptr);
-

fn load(&self, order: Ordering) -> *mut T

-

Loads a value from the pointer.

- -

load takes an Ordering argument which describes the memory ordering of this operation.

- -

Panics

-

Panics if order is Release or AcqRel.

- -

Examples

-
-use std::sync::atomic::{AtomicPtr, Ordering};
-
-let ptr = &mut 5;
-let some_ptr  = AtomicPtr::new(ptr);
-
-let value = some_ptr.load(Ordering::Relaxed);
-

fn store(&self, ptr: *mut T, order: Ordering)

-

Stores a value into the pointer.

- -

store takes an Ordering argument which describes the memory ordering of this operation.

- -

Examples

-
-use std::sync::atomic::{AtomicPtr, Ordering};
-
-let ptr = &mut 5;
-let some_ptr  = AtomicPtr::new(ptr);
-
-let other_ptr = &mut 10;
-
-some_ptr.store(other_ptr, Ordering::Relaxed);
- -

Panics

-

Panics if order is Acquire or AcqRel.

-

fn swap(&self, ptr: *mut T, order: Ordering) -> *mut T

-

Stores a value into the pointer, returning the old value.

- -

swap takes an Ordering argument which describes the memory ordering of this operation.

- -

Examples

-
-use std::sync::atomic::{AtomicPtr, Ordering};
-
-let ptr = &mut 5;
-let some_ptr  = AtomicPtr::new(ptr);
-
-let other_ptr = &mut 10;
-
-let value = some_ptr.swap(other_ptr, Ordering::Relaxed);
-

fn compare_and_swap(&self, current: *mut T, new: *mut T, order: Ordering) -> *mut T

-

Stores a value into the pointer if the current value is the same as the current value.

- -

The return value is always the previous value. If it is equal to current, then the value -was updated.

- -

compare_and_swap also takes an Ordering argument which describes the memory ordering of -this operation.

- -

Examples

-
-use std::sync::atomic::{AtomicPtr, Ordering};
-
-let ptr = &mut 5;
-let some_ptr  = AtomicPtr::new(ptr);
-
-let other_ptr   = &mut 10;
-let another_ptr = &mut 10;
-
-let value = some_ptr.compare_and_swap(other_ptr, another_ptr, Ordering::Relaxed);
-

fn compare_exchange(&self, current: *mut T, new: *mut T, success: Ordering, failure: Ordering) -> Result<*mut T, *mut T>

-
Unstable (extended_compare_and_swap)

: recently added

-

Stores a value into the pointer if the current value is the same as the current value.

- -

The return value is a result indicating whether the new value was written and containing -the previous value. On success this value is guaranteed to be equal to new.

- -

compare_exchange takes two Ordering arguments to describe the memory ordering of this -operation. The first describes the required ordering if the operation succeeds while the -second describes the required ordering when the operation fails. The failure ordering can't -be Release or AcqRel and must be equivalent or weaker than the success ordering.

- -

Examples

-
-use std::sync::atomic::{AtomicPtr, Ordering};
-
-let ptr = &mut 5;
-let some_ptr  = AtomicPtr::new(ptr);
-
-let other_ptr   = &mut 10;
-let another_ptr = &mut 10;
-
-let value = some_ptr.compare_exchange(other_ptr, another_ptr,
-                                      Ordering::SeqCst, Ordering::Relaxed);
-

fn compare_exchange_weak(&self, current: *mut T, new: *mut T, success: Ordering, failure: Ordering) -> Result<*mut T, *mut T>

-
Unstable (extended_compare_and_swap)

: recently added

-

Stores a value into the pointer if the current value is the same as the current value.

- -

Unlike compare_exchange, this function is allowed to spuriously fail even when the -comparison succeeds, which can result in more efficient code on some platforms. The -return value is a result indicating whether the new value was written and containing the -previous value.

- -

compare_exchange_weak takes two Ordering arguments to describe the memory -ordering of this operation. The first describes the required ordering if the operation -succeeds while the second describes the required ordering when the operation fails. The -failure ordering can't be Release or AcqRel and must be equivalent or weaker than the -success ordering.

- -

Examples

-
-use std::sync::atomic::{AtomicPtr, Ordering};
-
-let some_ptr = AtomicPtr::new(&mut 5);
-
-let new = &mut 10;
-let mut old = some_ptr.load(Ordering::Relaxed);
-loop {
-    match some_ptr.compare_exchange_weak(old, new, Ordering::SeqCst, Ordering::Relaxed) {
-        Ok(_) => break,
-        Err(x) => old = x,
-    }
-}
-

Trait Implementations

impl<T> Default for AtomicPtr<T>

fn default() -> AtomicPtr<T>

-

impl<T> Send for AtomicPtr<T>

impl<T> Sync for AtomicPtr<T>

impl<T> Debug for AtomicPtr<T>1.3.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/atomic/struct.AtomicUsize.html b/doc/bitflags/__core/sync/atomic/struct.AtomicUsize.html deleted file mode 100644 index 244e12f0..00000000 --- a/doc/bitflags/__core/sync/atomic/struct.AtomicUsize.html +++ /dev/null @@ -1,297 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::atomic::AtomicUsize - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::atomic::AtomicUsize - - [−] - - [src]

-
pub struct AtomicUsize {
-    // some fields omitted
-}
1.0.0

An unsigned integer type which can be safely shared between threads.

-

Methods

impl AtomicUsize

const fn new(v: usize) -> AtomicUsize

-

Creates a new AtomicUsize.

- -

Examples

-
-use std::sync::atomic::AtomicUsize;
-
-let atomic_forty_two = AtomicUsize::new(42);
-

fn load(&self, order: Ordering) -> usize

-

Loads a value from the usize.

- -

load takes an Ordering argument which describes the memory ordering of this operation.

- -

Panics

-

Panics if order is Release or AcqRel.

- -

Examples

-
-use std::sync::atomic::{AtomicUsize, Ordering};
-
-let some_usize = AtomicUsize::new(5);
-
-assert_eq!(some_usize.load(Ordering::Relaxed), 5);
-

fn store(&self, val: usize, order: Ordering)

-

Stores a value into the usize.

- -

store takes an Ordering argument which describes the memory ordering of this operation.

- -

Examples

-
-use std::sync::atomic::{AtomicUsize, Ordering};
-
-let some_usize = AtomicUsize::new(5);
-
-some_usize.store(10, Ordering::Relaxed);
-assert_eq!(some_usize.load(Ordering::Relaxed), 10);
- -

Panics

-

Panics if order is Acquire or AcqRel.

-

fn swap(&self, val: usize, order: Ordering) -> usize

-

Stores a value into the usize, returning the old value.

- -

swap takes an Ordering argument which describes the memory ordering of this operation.

- -

Examples

-
-use std::sync::atomic::{AtomicUsize, Ordering};
-
-let some_usize = AtomicUsize::new(5);
-
-assert_eq!(some_usize.swap(10, Ordering::Relaxed), 5);
-assert_eq!(some_usize.load(Ordering::Relaxed), 10);
-

fn compare_and_swap(&self, current: usize, new: usize, order: Ordering) -> usize

-

Stores a value into the usize if the current value is the same as the current value.

- -

The return value is always the previous value. If it is equal to current, then the value -was updated.

- -

compare_and_swap also takes an Ordering argument which describes the memory ordering of -this operation.

- -

Examples

-
-use std::sync::atomic::{AtomicUsize, Ordering};
-
-let some_usize = AtomicUsize::new(5);
-
-assert_eq!(some_usize.compare_and_swap(5, 10, Ordering::Relaxed), 5);
-assert_eq!(some_usize.load(Ordering::Relaxed), 10);
-
-assert_eq!(some_usize.compare_and_swap(6, 12, Ordering::Relaxed), 10);
-assert_eq!(some_usize.load(Ordering::Relaxed), 10);
-

fn compare_exchange(&self, current: usize, new: usize, success: Ordering, failure: Ordering) -> Result<usize, usize>

-
Unstable (extended_compare_and_swap)

: recently added

-

Stores a value into the usize if the current value is the same as the current value.

- -

The return value is a result indicating whether the new value was written and containing -the previous value. On success this value is guaranteed to be equal to new.

- -

compare_exchange takes two Ordering arguments to describe the memory ordering of this -operation. The first describes the required ordering if the operation succeeds while the -second describes the required ordering when the operation fails. The failure ordering can't -be Release or AcqRel and must be equivalent or weaker than the success ordering.

- -

Examples

-
-use std::sync::atomic::{AtomicUsize, Ordering};
-
-let some_isize = AtomicUsize::new(5);
-
-assert_eq!(some_isize.compare_exchange(5, 10,
-                                       Ordering::Acquire,
-                                       Ordering::Relaxed),
-           Ok(5));
-assert_eq!(some_isize.load(Ordering::Relaxed), 10);
-
-assert_eq!(some_isize.compare_exchange(6, 12,
-                                       Ordering::SeqCst,
-                                       Ordering::Acquire),
-           Err(10));
-assert_eq!(some_isize.load(Ordering::Relaxed), 10);
-

fn compare_exchange_weak(&self, current: usize, new: usize, success: Ordering, failure: Ordering) -> Result<usize, usize>

-
Unstable (extended_compare_and_swap)

: recently added

-

Stores a value into the usize if the current value is the same as the current value.

- -

Unlike compare_exchange, this function is allowed to spuriously fail even when the -comparison succeeds, which can result in more efficient code on some platforms. The -return value is a result indicating whether the new value was written and containing the -previous value.

- -

compare_exchange_weak takes two Ordering arguments to describe the memory -ordering of this operation. The first describes the required ordering if the operation -succeeds while the second describes the required ordering when the operation fails. The -failure ordering can't be Release or AcqRel and must be equivalent or weaker than the -success ordering.

- -

Examples

-
-use std::sync::atomic::{AtomicUsize, Ordering};
-
-let val = AtomicUsize::new(4);
-
-let mut old = val.load(Ordering::Relaxed);
-loop {
-    let new = old * 2;
-    match val.compare_exchange_weak(old, new, Ordering::SeqCst, Ordering::Relaxed) {
-        Ok(_) => break,
-        Err(x) => old = x,
-    }
-}
-

fn fetch_add(&self, val: usize, order: Ordering) -> usize

-

Add to the current usize, returning the previous value.

- -

Examples

-
-use std::sync::atomic::{AtomicUsize, Ordering};
-
-let foo = AtomicUsize::new(0);
-assert_eq!(foo.fetch_add(10, Ordering::SeqCst), 0);
-assert_eq!(foo.load(Ordering::SeqCst), 10);
-

fn fetch_sub(&self, val: usize, order: Ordering) -> usize

-

Subtract from the current usize, returning the previous value.

- -

Examples

-
-use std::sync::atomic::{AtomicUsize, Ordering};
-
-let foo = AtomicUsize::new(10);
-assert_eq!(foo.fetch_sub(10, Ordering::SeqCst), 10);
-assert_eq!(foo.load(Ordering::SeqCst), 0);
-

fn fetch_and(&self, val: usize, order: Ordering) -> usize

-

Bitwise and with the current usize, returning the previous value.

- -

Examples

-
-use std::sync::atomic::{AtomicUsize, Ordering};
-
-let foo = AtomicUsize::new(0b101101);
-assert_eq!(foo.fetch_and(0b110011, Ordering::SeqCst), 0b101101);
-assert_eq!(foo.load(Ordering::SeqCst), 0b100001);
-

fn fetch_or(&self, val: usize, order: Ordering) -> usize

-

Bitwise or with the current usize, returning the previous value.

- -

Examples

-
-use std::sync::atomic::{AtomicUsize, Ordering};
-
-let foo = AtomicUsize::new(0b101101);
-assert_eq!(foo.fetch_or(0b110011, Ordering::SeqCst), 0b101101);
-assert_eq!(foo.load(Ordering::SeqCst), 0b111111);
-

fn fetch_xor(&self, val: usize, order: Ordering) -> usize

-

Bitwise xor with the current usize, returning the previous value.

- -

Examples

-
-use std::sync::atomic::{AtomicUsize, Ordering};
-
-let foo = AtomicUsize::new(0b101101);
-assert_eq!(foo.fetch_xor(0b110011, Ordering::SeqCst), 0b101101);
-assert_eq!(foo.load(Ordering::SeqCst), 0b011110);
-

Trait Implementations

impl Default for AtomicUsize

fn default() -> AtomicUsize

-

impl Sync for AtomicUsize

impl Debug for AtomicUsize1.3.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/constant.CONDVAR_INIT.html b/doc/bitflags/__core/sync/constant.CONDVAR_INIT.html deleted file mode 100644 index 8402572b..00000000 --- a/doc/bitflags/__core/sync/constant.CONDVAR_INIT.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::CONDVAR_INIT - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::sync::CONDVAR_INIT - - [−] - - [src]

-
pub const CONDVAR_INIT: StaticCondvar = StaticCondvar::new()
Unstable (static_condvar)

: may be merged with Condvar in the future

-

Constant initializer for a statically allocated condition variable.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/constant.MUTEX_INIT.html b/doc/bitflags/__core/sync/constant.MUTEX_INIT.html deleted file mode 100644 index c0736437..00000000 --- a/doc/bitflags/__core/sync/constant.MUTEX_INIT.html +++ /dev/null @@ -1,115 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::MUTEX_INIT - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::sync::MUTEX_INIT - - [−] - - [src]

-
pub const MUTEX_INIT: StaticMutex = StaticMutex::new()
Unstable (static_mutex)

: may be merged with Mutex in the future

-

Static initialization of a mutex. This constant can be used to initialize -other mutex constants.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/constant.ONCE_INIT.html b/doc/bitflags/__core/sync/constant.ONCE_INIT.html deleted file mode 100644 index 8f19ae5b..00000000 --- a/doc/bitflags/__core/sync/constant.ONCE_INIT.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::ONCE_INIT - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::sync::ONCE_INIT - - [−] - - [src]

-
pub const ONCE_INIT: Once = Once::new()

Initialization value for static Once values.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/constant.RW_LOCK_INIT.html b/doc/bitflags/__core/sync/constant.RW_LOCK_INIT.html deleted file mode 100644 index 90ae68a1..00000000 --- a/doc/bitflags/__core/sync/constant.RW_LOCK_INIT.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::RW_LOCK_INIT - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::sync::RW_LOCK_INIT - - [−] - - [src]

-
pub const RW_LOCK_INIT: StaticRwLock = StaticRwLock::new()
Unstable (static_rwlock)

: may be merged with RwLock in the future

-

Constant initialization for a statically-initialized rwlock.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/enum.TryLockError.html b/doc/bitflags/__core/sync/enum.TryLockError.html deleted file mode 100644 index 1493185d..00000000 --- a/doc/bitflags/__core/sync/enum.TryLockError.html +++ /dev/null @@ -1,127 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::TryLockError - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::sync::TryLockError - - [−] - - [src]

-
pub enum TryLockError<T> {
-    Poisoned(PoisonError<T>),
-    WouldBlock,
-}
1.0.0

An enumeration of possible errors which can occur while calling the -try_lock method.

-

Variants

-
Poisoned

The lock could not be acquired because another thread failed while holding -the lock.

-
WouldBlock

The lock could not be acquired at this time because the operation would -otherwise block.

-

Trait Implementations

impl<T> From<PoisonError<T>> for TryLockError<T>

fn from(err: PoisonError<T>) -> TryLockError<T>

-

impl<T> Debug for TryLockError<T>

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Display for TryLockError<T>

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Error for TryLockError<T> where T: Reflect

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/index.html b/doc/bitflags/__core/sync/index.html deleted file mode 100644 index 752e2c4d..00000000 --- a/doc/bitflags/__core/sync/index.html +++ /dev/null @@ -1,308 +0,0 @@ - - - - - - - - - - bitflags::__core::sync - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::sync - - [−] - - [src]

-

Useful synchronization primitives.

- -

This module contains useful safe and unsafe synchronization primitives. -Most of the primitives in this module do not provide any sort of locking -and/or blocking at all, but rather provide the necessary tools to build -other types of concurrent primitives.

-

Modules

- - - - - - - - -
atomic -

Atomic types

-
mpsc -

Multi-producer, single-consumer FIFO queue communication primitives.

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Arc -

An atomically reference counted wrapper for shared state.

-
Barrier -

A barrier enables multiple threads to synchronize the beginning -of some computation.

-
BarrierWaitResult -

A result returned from wait.

-
Condvar -

A Condition Variable

-
Mutex -

A mutual exclusion primitive useful for protecting shared data

-
MutexGuard -

An RAII implementation of a "scoped lock" of a mutex. When this structure is -dropped (falls out of scope), the lock will be unlocked.

-
Once -

A synchronization primitive which can be used to run a one-time global -initialization. Useful for one-time initialization for FFI or related -functionality. This type can only be constructed with the ONCE_INIT -value.

-
PoisonError -

A type of error which can be returned whenever a lock is acquired.

-
RwLock -

A reader-writer lock

-
RwLockReadGuard -

RAII structure used to release the shared read access of a lock when -dropped.

-
RwLockWriteGuard -

RAII structure used to release the exclusive write access of a lock when -dropped.

-
WaitTimeoutResult -

A type indicating whether a timed wait on a condition variable returned -due to a time out or not.

-
Weak -

A weak pointer to an Arc.

-
StaticCondvar - [Unstable]

Statically allocated condition variables.

-
StaticMutex - [Unstable]

The static mutex type is provided to allow for static allocation of mutexes.

-
StaticRwLock - [Unstable]

Structure representing a statically allocated RwLock.

-

Enums

- - - - -
TryLockError -

An enumeration of possible errors which can occur while calling the -try_lock method.

-

Constants

- - - - - - - - - - - - - - - - -
ONCE_INIT -

Initialization value for static Once values.

-
CONDVAR_INIT - [Unstable]

Constant initializer for a statically allocated condition variable.

-
MUTEX_INIT - [Unstable]

Static initialization of a mutex. This constant can be used to initialize -other mutex constants.

-
RW_LOCK_INIT - [Unstable]

Constant initialization for a statically-initialized rwlock.

-

Type Definitions

- - - - - - - - -
LockResult - -
TryLockResult - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/mpsc/enum.TryRecvError.html b/doc/bitflags/__core/sync/mpsc/enum.TryRecvError.html deleted file mode 100644 index 164957d9..00000000 --- a/doc/bitflags/__core/sync/mpsc/enum.TryRecvError.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::mpsc::TryRecvError - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::sync::mpsc::TryRecvError - - [−] - - [src]

-
pub enum TryRecvError {
-    Empty,
-    Disconnected,
-}
1.0.0

This enumeration is the list of the possible reasons that try_recv could -not return data when called.

-

Variants

-
Empty

This channel is currently empty, but the sender(s) have not yet -disconnected, so data may yet become available.

-
Disconnected

This channel's sending half has become disconnected, and there will -never be any more data received on this channel

-

Trait Implementations

impl Display for TryRecvError

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl Error for TryRecvError

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

Derived Implementations

impl Debug for TryRecvError

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl Copy for TryRecvError

impl Clone for TryRecvError

fn clone(&self) -> TryRecvError

-

fn clone_from(&mut self, source: &Self)

-

impl Eq for TryRecvError

impl PartialEq<TryRecvError> for TryRecvError

fn eq(&self, __arg_0: &TryRecvError) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/mpsc/enum.TrySendError.html b/doc/bitflags/__core/sync/mpsc/enum.TrySendError.html deleted file mode 100644 index 03987db3..00000000 --- a/doc/bitflags/__core/sync/mpsc/enum.TrySendError.html +++ /dev/null @@ -1,134 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::mpsc::TrySendError - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::sync::mpsc::TrySendError - - [−] - - [src]

-
pub enum TrySendError<T> {
-    Full(T),
-    Disconnected(T),
-}
1.0.0

This enumeration is the list of the possible error outcomes for the -SyncSender::try_send method.

-

Variants

-
Full

The data could not be sent on the channel because it would require that -the callee block to send the data.

- -

If this is a buffered channel, then the buffer is full at this time. If -this is not a buffered channel, then there is no receiver available to -acquire the data.

-
Disconnected

This channel's receiving half has disconnected, so the data could not be -sent. The data is returned back to the callee in this case.

-

Trait Implementations

impl<T> Debug for TrySendError<T>

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Display for TrySendError<T>

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Error for TrySendError<T> where T: Send + Reflect

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

Derived Implementations

impl<T> Copy for TrySendError<T> where T: Copy

impl<T> Clone for TrySendError<T> where T: Clone

fn clone(&self) -> TrySendError<T>

-

fn clone_from(&mut self, source: &Self)

-

impl<T> Eq for TrySendError<T> where T: Eq

impl<T> PartialEq<TrySendError<T>> for TrySendError<T> where T: PartialEq<T>

fn eq(&self, __arg_0: &TrySendError<T>) -> bool

-

fn ne(&self, __arg_0: &TrySendError<T>) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/mpsc/fn.channel.html b/doc/bitflags/__core/sync/mpsc/fn.channel.html deleted file mode 100644 index 87e65cc5..00000000 --- a/doc/bitflags/__core/sync/mpsc/fn.channel.html +++ /dev/null @@ -1,135 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::mpsc::channel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::sync::mpsc::channel - - [−] - - [src]

-
pub fn channel<T>() -> (Sender<T>, Receiver<T>)
1.0.0

Creates a new asynchronous channel, returning the sender/receiver halves.

- -

All data sent on the sender will become available on the receiver, and no -send will block the calling thread (this channel has an "infinite buffer").

- -

Examples

-
-use std::sync::mpsc::channel;
-use std::thread;
-
-// tx is the sending half (tx for transmission), and rx is the receiving
-// half (rx for receiving).
-let (tx, rx) = channel();
-
-// Spawn off an expensive computation
-thread::spawn(move|| {
-    tx.send(expensive_computation()).unwrap();
-});
-
-// Do some useful work for awhile
-
-// Let's see what that answer was
-println!("{:?}", rx.recv().unwrap());
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/mpsc/fn.sync_channel.html b/doc/bitflags/__core/sync/mpsc/fn.sync_channel.html deleted file mode 100644 index b0b28293..00000000 --- a/doc/bitflags/__core/sync/mpsc/fn.sync_channel.html +++ /dev/null @@ -1,144 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::mpsc::sync_channel - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::sync::mpsc::sync_channel - - [−] - - [src]

-
pub fn sync_channel<T>(bound: usize) -> (SyncSender<T>, Receiver<T>)
1.0.0

Creates a new synchronous, bounded channel.

- -

Like asynchronous channels, the Receiver will block until a message -becomes available. These channels differ greatly in the semantics of the -sender from asynchronous channels, however.

- -

This channel has an internal buffer on which messages will be queued. When -the internal buffer becomes full, future sends will block waiting for the -buffer to open up. Note that a buffer size of 0 is valid, in which case this -becomes "rendezvous channel" where each send will not return until a recv -is paired with it.

- -

As with asynchronous channels, all senders will panic in send if the -Receiver has been destroyed.

- -

Examples

-
-use std::sync::mpsc::sync_channel;
-use std::thread;
-
-let (tx, rx) = sync_channel(1);
-
-// this returns immediately
-tx.send(1).unwrap();
-
-thread::spawn(move|| {
-    // this will block until the previous message has been received
-    tx.send(2).unwrap();
-});
-
-assert_eq!(rx.recv().unwrap(), 1);
-assert_eq!(rx.recv().unwrap(), 2);
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/mpsc/index.html b/doc/bitflags/__core/sync/mpsc/index.html deleted file mode 100644 index e6d8b6df..00000000 --- a/doc/bitflags/__core/sync/mpsc/index.html +++ /dev/null @@ -1,319 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::mpsc - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::sync::mpsc - - [−] - - [src]

-

Multi-producer, single-consumer FIFO queue communication primitives.

- -

This module provides message-based communication over channels, concretely -defined among three types:

- -
    -
  • Sender
    • -
  • SyncSender
    • -
  • Receiver
    • -
- -

A Sender or SyncSender is used to send data to a Receiver. Both -senders are clone-able (multi-producer) such that many threads can send -simultaneously to one receiver (single-consumer).

- -

These channels come in two flavors:

- -
    -

  1. An asynchronous, infinitely buffered channel. The channel() function -will return a (Sender, Receiver) tuple where all sends will be -asynchronous (they never block). The channel conceptually has an -infinite buffer.

    2. -

  2. A synchronous, bounded channel. The sync_channel() function will return -a (SyncSender, Receiver) tuple where the storage for pending messages -is a pre-allocated buffer of a fixed size. All sends will be -synchronous by blocking until there is buffer space available. Note -that a bound of 0 is allowed, causing the channel to become a -"rendezvous" channel where each sender atomically hands off a message to -a receiver.

    3. -
- -

Disconnection

-

The send and receive operations on channels will all return a Result -indicating whether the operation succeeded or not. An unsuccessful operation -is normally indicative of the other half of a channel having "hung up" by -being dropped in its corresponding thread.

- -

Once half of a channel has been deallocated, most operations can no longer -continue to make progress, so Err will be returned. Many applications will -continue to unwrap() the results returned from this module, instigating a -propagation of failure among threads if one unexpectedly dies.

- -

Examples

-

Simple usage:

- -
-use std::thread;
-use std::sync::mpsc::channel;
-
-// Create a simple streaming channel
-let (tx, rx) = channel();
-thread::spawn(move|| {
-    tx.send(10).unwrap();
-});
-assert_eq!(rx.recv().unwrap(), 10);
- -

Shared usage:

- -
-use std::thread;
-use std::sync::mpsc::channel;
-
-// Create a shared channel that can be sent along from many threads
-// where tx is the sending half (tx for transmission), and rx is the receiving
-// half (rx for receiving).
-let (tx, rx) = channel();
-for i in 0..10 {
-    let tx = tx.clone();
-    thread::spawn(move|| {
-        tx.send(i).unwrap();
-    });
-}
-
-for _ in 0..10 {
-    let j = rx.recv().unwrap();
-    assert!(0 <= j && j < 10);
-}
- -

Propagating panics:

- -
-use std::sync::mpsc::channel;
-
-// The call to recv() will return an error because the channel has already
-// hung up (or been deallocated)
-let (tx, rx) = channel::<i32>();
-drop(tx);
-assert!(rx.recv().is_err());
- -

Synchronous channels:

- -
-use std::thread;
-use std::sync::mpsc::sync_channel;
-
-let (tx, rx) = sync_channel::<i32>(0);
-thread::spawn(move|| {
-    // This will wait for the parent thread to start receiving
-    tx.send(53).unwrap();
-});
-rx.recv().unwrap();
-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
IntoIter -

An owning iterator over messages on a receiver, this iterator will block -whenever next is called, waiting for a new message, and None will be -returned when the corresponding channel has hung up.

-
Iter -

An iterator over messages on a receiver, this iterator will block -whenever next is called, waiting for a new message, and None will be -returned when the corresponding channel has hung up.

-
Receiver -

The receiving-half of Rust's channel type. This half can only be owned by -one thread

-
RecvError -

An error returned from the recv function on a Receiver.

-
SendError -

An error returned from the send function on channels.

-
Sender -

The sending-half of Rust's asynchronous channel type. This half can only be -owned by one thread, but it can be cloned to send to other threads.

-
SyncSender -

The sending-half of Rust's synchronous channel type. This half can only be -owned by one thread, but it can be cloned to send to other threads.

-
Handle - [Unstable]

A handle to a receiver which is currently a member of a Select set of -receivers. This handle is used to keep the receiver in the set as well as -interact with the underlying receiver.

-
Select - [Unstable]

The "receiver set" of the select interface. This structure is used to manage -a set of receivers which are being selected over.

-

Enums

- - - - - - - - -
TryRecvError -

This enumeration is the list of the possible reasons that try_recv could -not return data when called.

-
TrySendError -

This enumeration is the list of the possible error outcomes for the -SyncSender::try_send method.

-

Functions

- - - - - - - - -
channel -

Creates a new asynchronous channel, returning the sender/receiver halves.

-
sync_channel -

Creates a new synchronous, bounded channel.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/mpsc/sidebar-items.js b/doc/bitflags/__core/sync/mpsc/sidebar-items.js deleted file mode 100644 index a9d4dce9..00000000 --- a/doc/bitflags/__core/sync/mpsc/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["TryRecvError","This enumeration is the list of the possible reasons that `try_recv` could not return data when called."],["TrySendError","This enumeration is the list of the possible error outcomes for the `SyncSender::try_send` method."]],"fn":[["channel","Creates a new asynchronous channel, returning the sender/receiver halves."],["sync_channel","Creates a new synchronous, bounded channel."]],"struct":[["Handle","A handle to a receiver which is currently a member of a `Select` set of receivers. This handle is used to keep the receiver in the set as well as interact with the underlying receiver."],["IntoIter","An owning iterator over messages on a receiver, this iterator will block whenever `next` is called, waiting for a new message, and `None` will be returned when the corresponding channel has hung up."],["Iter","An iterator over messages on a receiver, this iterator will block whenever `next` is called, waiting for a new message, and `None` will be returned when the corresponding channel has hung up."],["Receiver","The receiving-half of Rust's channel type. This half can only be owned by one thread"],["RecvError","An error returned from the `recv` function on a `Receiver`."],["Select","The \"receiver set\" of the select interface. This structure is used to manage a set of receivers which are being selected over."],["SendError","An error returned from the `send` function on channels."],["Sender","The sending-half of Rust's asynchronous channel type. This half can only be owned by one thread, but it can be cloned to send to other threads."],["SyncSender","The sending-half of Rust's synchronous channel type. This half can only be owned by one thread, but it can be cloned to send to other threads."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/sync/mpsc/struct.Handle.html b/doc/bitflags/__core/sync/mpsc/struct.Handle.html deleted file mode 100644 index b6115fbb..00000000 --- a/doc/bitflags/__core/sync/mpsc/struct.Handle.html +++ /dev/null @@ -1,142 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::mpsc::Handle - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::mpsc::Handle - - [−] - - [src]

-
pub struct Handle<'rx, T> where T: Send + 'rx {
-    // some fields omitted
-}
Unstable (mpsc_select)

: This implementation, while likely sufficient, is unsafe and likely to be error prone. At some point in the future this module will likely be replaced, and it is currently unknown how much API breakage that will cause. The ability to select over a number of channels will remain forever, but no guarantees beyond this are being made

-

A handle to a receiver which is currently a member of a Select set of -receivers. This handle is used to keep the receiver in the set as well as -interact with the underlying receiver.

-

Methods

impl<'rx, T> Handle<'rx, T> where T: Send

fn id(&self) -> usize

-
Unstable (mpsc_select)

: This implementation, while likely sufficient, is unsafe and likely to be error prone. At some point in the future this module will likely be replaced, and it is currently unknown how much API breakage that will cause. The ability to select over a number of channels will remain forever, but no guarantees beyond this are being made

-

Retrieves the id of this handle.

-

fn recv(&mut self) -> Result<T, RecvError>

-
Unstable (mpsc_select)

: This implementation, while likely sufficient, is unsafe and likely to be error prone. At some point in the future this module will likely be replaced, and it is currently unknown how much API breakage that will cause. The ability to select over a number of channels will remain forever, but no guarantees beyond this are being made

-

Blocks to receive a value on the underlying receiver, returning Some on -success or None if the channel disconnects. This function has the same -semantics as Receiver.recv

-

unsafe fn add(&mut self)

-
Unstable (mpsc_select)

: This implementation, while likely sufficient, is unsafe and likely to be error prone. At some point in the future this module will likely be replaced, and it is currently unknown how much API breakage that will cause. The ability to select over a number of channels will remain forever, but no guarantees beyond this are being made

-

Adds this handle to the receiver set that the handle was created from. This -method can be called multiple times, but it has no effect if add was -called previously.

- -

This method is unsafe because it requires that the Handle is not moved -while it is added to the Select set.

-

unsafe fn remove(&mut self)

-
Unstable (mpsc_select)

: This implementation, while likely sufficient, is unsafe and likely to be error prone. At some point in the future this module will likely be replaced, and it is currently unknown how much API breakage that will cause. The ability to select over a number of channels will remain forever, but no guarantees beyond this are being made

-

Removes this handle from the Select set. This method is unsafe because -it has no guarantee that the Handle was not moved since add was -called.

-

Trait Implementations

impl<'rx, T> Drop for Handle<'rx, T> where T: Send

fn drop(&mut self)

-
Unstable (mpsc_select)

: This implementation, while likely sufficient, is unsafe and likely to be error prone. At some point in the future this module will likely be replaced, and it is currently unknown how much API breakage that will cause. The ability to select over a number of channels will remain forever, but no guarantees beyond this are being made

-

impl<'rx, T> Debug for Handle<'rx, T> where T: Send + 'rx1.7.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/mpsc/struct.IntoIter.html b/doc/bitflags/__core/sync/mpsc/struct.IntoIter.html deleted file mode 100644 index f4dea6aa..00000000 --- a/doc/bitflags/__core/sync/mpsc/struct.IntoIter.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::mpsc::IntoIter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::mpsc::IntoIter - - [−] - - [src]

-
pub struct IntoIter<T> {
-    // some fields omitted
-}
1.1.0

An owning iterator over messages on a receiver, this iterator will block -whenever next is called, waiting for a new message, and None will be -returned when the corresponding channel has hung up.

-

Trait Implementations

impl<T> Iterator for IntoIter<T>

type Item = T

-

fn next(&mut self) -> Option<T>

-

fn size_hint(&self) -> (usize, Option<usize>)1.0.0

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/mpsc/struct.Iter.html b/doc/bitflags/__core/sync/mpsc/struct.Iter.html deleted file mode 100644 index 6c30d23b..00000000 --- a/doc/bitflags/__core/sync/mpsc/struct.Iter.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::mpsc::Iter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::mpsc::Iter - - [−] - - [src]

-
pub struct Iter<'a, T> where T: 'a {
-    // some fields omitted
-}
1.0.0

An iterator over messages on a receiver, this iterator will block -whenever next is called, waiting for a new message, and None will be -returned when the corresponding channel has hung up.

-

Trait Implementations

impl<'a, T> Iterator for Iter<'a, T>

type Item = T

-

fn next(&mut self) -> Option<T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/mpsc/struct.Receiver.html b/doc/bitflags/__core/sync/mpsc/struct.Receiver.html deleted file mode 100644 index 4eab8efd..00000000 --- a/doc/bitflags/__core/sync/mpsc/struct.Receiver.html +++ /dev/null @@ -1,187 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::mpsc::Receiver - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::mpsc::Receiver - - [−] - - [src]

-
pub struct Receiver<T> {
-    // some fields omitted
-}
1.0.0

The receiving-half of Rust's channel type. This half can only be owned by -one thread

-

Methods

impl<T> Receiver<T>

fn try_recv(&self) -> Result<T, TryRecvError>

-

Attempts to return a pending value on this receiver without blocking

- -

This method will never block the caller in order to wait for data to -become available. Instead, this will always return immediately with a -possible option of pending data on the channel.

- -

This is useful for a flavor of "optimistic check" before deciding to -block on a receiver.

-

fn recv(&self) -> Result<T, RecvError>

-

Attempts to wait for a value on this receiver, returning an error if the -corresponding channel has hung up.

- -

This function will always block the current thread if there is no data -available and it's possible for more data to be sent. Once a message is -sent to the corresponding Sender, then this receiver will wake up and -return that message.

- -

If the corresponding Sender has disconnected, or it disconnects while -this call is blocking, this call will wake up and return Err to -indicate that no more messages can ever be received on this channel. -However, since channels are buffered, messages sent before the disconnect -will still be properly received.

- -

Examples

-
-use std::sync::mpsc;
-use std::thread;
-
-let (send, recv) = mpsc::channel();
-let handle = thread::spawn(move || {
-    send.send(1u8).unwrap();
-});
-
-handle.join().unwrap();
-
-assert_eq!(Ok(1), recv.recv());
- -

Buffering behavior:

- -
-use std::sync::mpsc;
-use std::thread;
-use std::sync::mpsc::RecvError;
-
-let (send, recv) = mpsc::channel();
-let handle = thread::spawn(move || {
-    send.send(1u8).unwrap();
-    send.send(2).unwrap();
-    send.send(3).unwrap();
-    drop(send);
-});
-
-// wait for the thread to join so we ensure the sender is dropped
-handle.join().unwrap();
-
-assert_eq!(Ok(1), recv.recv());
-assert_eq!(Ok(2), recv.recv());
-assert_eq!(Ok(3), recv.recv());
-assert_eq!(Err(RecvError), recv.recv());
-

fn iter(&self) -> Iter<T>

-

Returns an iterator that will block waiting for messages, but never -panic!. It will return None when the channel has hung up.

-

Trait Implementations

impl<T> Send for Receiver<T> where T: Send

impl<T> !Sync for Receiver<T>

impl<'a, T> IntoIterator for &'a Receiver<T>1.1.0

type Item = T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<T> IntoIterator for Receiver<T>1.1.0

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

impl<T> Drop for Receiver<T>

fn drop(&mut self)

-

impl<T> Debug for Receiver<T>1.7.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/mpsc/struct.RecvError.html b/doc/bitflags/__core/sync/mpsc/struct.RecvError.html deleted file mode 100644 index 5f549a6d..00000000 --- a/doc/bitflags/__core/sync/mpsc/struct.RecvError.html +++ /dev/null @@ -1,124 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::mpsc::RecvError - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::mpsc::RecvError - - [−] - - [src]

-
pub struct RecvError;
1.0.0

An error returned from the recv function on a Receiver.

- -

The recv operation can only fail if the sending half of a channel is -disconnected, implying that no further messages will ever be received.

-

Trait Implementations

impl Display for RecvError

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl Error for RecvError

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

Derived Implementations

impl Debug for RecvError

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl Copy for RecvError

impl Clone for RecvError

fn clone(&self) -> RecvError

-

fn clone_from(&mut self, source: &Self)

-

impl Eq for RecvError

impl PartialEq<RecvError> for RecvError

fn eq(&self, __arg_0: &RecvError) -> bool

-

fn ne(&self, other: &Rhs) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/mpsc/struct.Select.html b/doc/bitflags/__core/sync/mpsc/struct.Select.html deleted file mode 100644 index 0dda54cd..00000000 --- a/doc/bitflags/__core/sync/mpsc/struct.Select.html +++ /dev/null @@ -1,147 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::mpsc::Select - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::mpsc::Select - - [−] - - [src]

-
pub struct Select {
-    // some fields omitted
-}
Unstable (mpsc_select)

: This implementation, while likely sufficient, is unsafe and likely to be error prone. At some point in the future this module will likely be replaced, and it is currently unknown how much API breakage that will cause. The ability to select over a number of channels will remain forever, but no guarantees beyond this are being made

-

The "receiver set" of the select interface. This structure is used to manage -a set of receivers which are being selected over.

-

Methods

impl Select

fn new() -> Select

-
Unstable (mpsc_select)

: This implementation, while likely sufficient, is unsafe and likely to be error prone. At some point in the future this module will likely be replaced, and it is currently unknown how much API breakage that will cause. The ability to select over a number of channels will remain forever, but no guarantees beyond this are being made

-

Creates a new selection structure. This set is initially empty.

- -

Usage of this struct directly can sometimes be burdensome, and usage is much easier through -the select! macro.

- -

Examples

-
-#![feature(mpsc_select)]
-
-use std::sync::mpsc::Select;
-
-let select = Select::new();
-

fn handle<T>(&'a self, rx: &'a Receiver<T>) -> Handle<'a, T> where T: Send

-
Unstable (mpsc_select)

: This implementation, while likely sufficient, is unsafe and likely to be error prone. At some point in the future this module will likely be replaced, and it is currently unknown how much API breakage that will cause. The ability to select over a number of channels will remain forever, but no guarantees beyond this are being made

-

Creates a new handle into this receiver set for a new receiver. Note -that this does not add the receiver to the receiver set, for that you -must call the add method on the handle itself.

-

fn wait(&self) -> usize

-
Unstable (mpsc_select)

: This implementation, while likely sufficient, is unsafe and likely to be error prone. At some point in the future this module will likely be replaced, and it is currently unknown how much API breakage that will cause. The ability to select over a number of channels will remain forever, but no guarantees beyond this are being made

-

Waits for an event on this receiver set. The returned value is not an -index, but rather an id. This id can be queried against any active -Handle structures (each one has an id method). The handle with -the matching id will have some sort of event available on it. The -event could either be that data is available or the corresponding -channel has been closed.

-

Trait Implementations

impl !Send for Select

impl Drop for Select

fn drop(&mut self)

-
Unstable (mpsc_select)

: This implementation, while likely sufficient, is unsafe and likely to be error prone. At some point in the future this module will likely be replaced, and it is currently unknown how much API breakage that will cause. The ability to select over a number of channels will remain forever, but no guarantees beyond this are being made

-

impl Debug for Select1.7.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/mpsc/struct.SendError.html b/doc/bitflags/__core/sync/mpsc/struct.SendError.html deleted file mode 100644 index 45945c22..00000000 --- a/doc/bitflags/__core/sync/mpsc/struct.SendError.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::mpsc::SendError - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::mpsc::SendError - - [−] - - [src]

-
pub struct SendError<T>(pub T);
1.0.0

An error returned from the send function on channels.

- -

A send operation can only fail if the receiving end of a channel is -disconnected, implying that the data could never be received. The error -contains the data being sent as a payload so it can be recovered.

-

Trait Implementations

impl<T> Debug for SendError<T>

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Display for SendError<T>

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Error for SendError<T> where T: Send + Reflect

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-

Derived Implementations

impl<T> Copy for SendError<T> where T: Copy

impl<T> Clone for SendError<T> where T: Clone

fn clone(&self) -> SendError<T>

-

fn clone_from(&mut self, source: &Self)

-

impl<T> Eq for SendError<T> where T: Eq

impl<T> PartialEq<SendError<T>> for SendError<T> where T: PartialEq<T>

fn eq(&self, __arg_0: &SendError<T>) -> bool

-

fn ne(&self, __arg_0: &SendError<T>) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/mpsc/struct.Sender.html b/doc/bitflags/__core/sync/mpsc/struct.Sender.html deleted file mode 100644 index 90b53d66..00000000 --- a/doc/bitflags/__core/sync/mpsc/struct.Sender.html +++ /dev/null @@ -1,146 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::mpsc::Sender - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::mpsc::Sender - - [−] - - [src]

-
pub struct Sender<T> {
-    // some fields omitted
-}
1.0.0

The sending-half of Rust's asynchronous channel type. This half can only be -owned by one thread, but it can be cloned to send to other threads.

-

Methods

impl<T> Sender<T>

fn send(&self, t: T) -> Result<(), SendError<T>>

-

Attempts to send a value on this channel, returning it back if it could -not be sent.

- -

A successful send occurs when it is determined that the other end of -the channel has not hung up already. An unsuccessful send would be one -where the corresponding receiver has already been deallocated. Note -that a return value of Err means that the data will never be -received, but a return value of Ok does not mean that the data -will be received. It is possible for the corresponding receiver to -hang up immediately after this function returns Ok.

- -

This method will never block the current thread.

- -

Examples

-
-use std::sync::mpsc::channel;
-
-let (tx, rx) = channel();
-
-// This send is always successful
-tx.send(1).unwrap();
-
-// This send will fail because the receiver is gone
-drop(rx);
-assert_eq!(tx.send(1).err().unwrap().0, 1);
-

Trait Implementations

impl<T> Send for Sender<T> where T: Send

impl<T> !Sync for Sender<T>

impl<T> Clone for Sender<T>

fn clone(&self) -> Sender<T>

-

fn clone_from(&mut self, source: &Self)

-

impl<T> Drop for Sender<T>

fn drop(&mut self)

-

impl<T> Debug for Sender<T>1.7.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/mpsc/struct.SyncSender.html b/doc/bitflags/__core/sync/mpsc/struct.SyncSender.html deleted file mode 100644 index ab09615d..00000000 --- a/doc/bitflags/__core/sync/mpsc/struct.SyncSender.html +++ /dev/null @@ -1,145 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::mpsc::SyncSender - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::mpsc::SyncSender - - [−] - - [src]

-
pub struct SyncSender<T> {
-    // some fields omitted
-}
1.0.0

The sending-half of Rust's synchronous channel type. This half can only be -owned by one thread, but it can be cloned to send to other threads.

-

Methods

impl<T> SyncSender<T>

fn send(&self, t: T) -> Result<(), SendError<T>>

-

Sends a value on this synchronous channel.

- -

This function will block until space in the internal buffer becomes -available or a receiver is available to hand off the message to.

- -

Note that a successful send does not guarantee that the receiver will -ever see the data if there is a buffer on this channel. Items may be -enqueued in the internal buffer for the receiver to receive at a later -time. If the buffer size is 0, however, it can be guaranteed that the -receiver has indeed received the data if this function returns success.

- -

This function will never panic, but it may return Err if the -Receiver has disconnected and is no longer able to receive -information.

-

fn try_send(&self, t: T) -> Result<(), TrySendError<T>>

-

Attempts to send a value on this channel without blocking.

- -

This method differs from send by returning immediately if the -channel's buffer is full or no receiver is waiting to acquire some -data. Compared with send, this function has two failure cases -instead of one (one for disconnection, one for a full buffer).

- -

See SyncSender::send for notes about guarantees of whether the -receiver has received the data or not if this function is successful.

-

Trait Implementations

impl<T> Send for SyncSender<T> where T: Send

impl<T> !Sync for SyncSender<T>

impl<T> Clone for SyncSender<T>

fn clone(&self) -> SyncSender<T>

-

fn clone_from(&mut self, source: &Self)

-

impl<T> Drop for SyncSender<T>

fn drop(&mut self)

-

impl<T> Debug for SyncSender<T>1.7.0

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/sidebar-items.js b/doc/bitflags/__core/sync/sidebar-items.js deleted file mode 100644 index 45c00689..00000000 --- a/doc/bitflags/__core/sync/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["CONDVAR_INIT","Constant initializer for a statically allocated condition variable."],["MUTEX_INIT","Static initialization of a mutex. This constant can be used to initialize other mutex constants."],["ONCE_INIT","Initialization value for static `Once` values."],["RW_LOCK_INIT","Constant initialization for a statically-initialized rwlock."]],"enum":[["TryLockError","An enumeration of possible errors which can occur while calling the `try_lock` method."]],"mod":[["atomic","Atomic types"],["mpsc","Multi-producer, single-consumer FIFO queue communication primitives."]],"struct":[["Arc","An atomically reference counted wrapper for shared state."],["Barrier","A barrier enables multiple threads to synchronize the beginning of some computation."],["BarrierWaitResult","A result returned from wait."],["Condvar","A Condition Variable"],["Mutex","A mutual exclusion primitive useful for protecting shared data"],["MutexGuard","An RAII implementation of a \"scoped lock\" of a mutex. When this structure is dropped (falls out of scope), the lock will be unlocked."],["Once","A synchronization primitive which can be used to run a one-time global initialization. Useful for one-time initialization for FFI or related functionality. This type can only be constructed with the `ONCE_INIT` value."],["PoisonError","A type of error which can be returned whenever a lock is acquired."],["RwLock","A reader-writer lock"],["RwLockReadGuard","RAII structure used to release the shared read access of a lock when dropped."],["RwLockWriteGuard","RAII structure used to release the exclusive write access of a lock when dropped."],["StaticCondvar","Statically allocated condition variables."],["StaticMutex","The static mutex type is provided to allow for static allocation of mutexes."],["StaticRwLock","Structure representing a statically allocated RwLock."],["WaitTimeoutResult","A type indicating whether a timed wait on a condition variable returned due to a time out or not."],["Weak","A weak pointer to an `Arc`."]],"type":[["LockResult",""],["TryLockResult",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.Arc.html b/doc/bitflags/__core/sync/struct.Arc.html deleted file mode 100644 index 8065e429..00000000 --- a/doc/bitflags/__core/sync/struct.Arc.html +++ /dev/null @@ -1,353 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::Arc - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::Arc - - [−] - - [src]

-
pub struct Arc<T> where T: ?Sized {
-    // some fields omitted
-}
1.0.0

An atomically reference counted wrapper for shared state.

- -

Examples

-

In this example, a large vector is shared between several threads. -With simple pipes, without Arc, a copy would have to be made for each -thread.

- -

When you clone an Arc<T>, it will create another pointer to the data and -increase the reference counter.

- -
-use std::sync::Arc;
-use std::thread;
-
-fn main() {
-    let numbers: Vec<_> = (0..100).collect();
-    let shared_numbers = Arc::new(numbers);
-
-    for _ in 0..10 {
-        let child_numbers = shared_numbers.clone();
-
-        thread::spawn(move || {
-            let local_numbers = &child_numbers[..];
-
-            // Work with the local numbers
-        });
-    }
-}
-

Methods

impl<T> Arc<T>

fn new(data: T) -> Arc<T>

-

Constructs a new Arc<T>.

- -

Examples

-
-use std::sync::Arc;
-
-let five = Arc::new(5);
-

fn try_unwrap(this: Arc<T>) -> Result<T, Arc<T>>1.4.0

-

Unwraps the contained value if the Arc<T> has exactly one strong reference.

- -

Otherwise, an Err is returned with the same Arc<T>.

- -

This will succeed even if there are outstanding weak references.

- -

Examples

-
-use std::sync::Arc;
-
-let x = Arc::new(3);
-assert_eq!(Arc::try_unwrap(x), Ok(3));
-
-let x = Arc::new(4);
-let _y = x.clone();
-assert_eq!(Arc::try_unwrap(x), Err(Arc::new(4)));
-

impl<T> Arc<T> where T: ?Sized

fn downgrade(this: &Arc<T>) -> Weak<T>1.4.0

-

Downgrades the Arc<T> to a Weak<T> reference.

- -

Examples

-
-use std::sync::Arc;
-
-let five = Arc::new(5);
-
-let weak_five = Arc::downgrade(&five);
-

fn weak_count(this: &Arc<T>) -> usize

-
Unstable (arc_counts)

: not clearly useful, and racy

-

Get the number of weak references to this value.

-

fn strong_count(this: &Arc<T>) -> usize

-
Unstable (arc_counts)

: not clearly useful, and racy

-

Get the number of strong references to this value.

-

impl<T> Arc<T> where T: Clone

fn make_mut(this: &mut Arc<T>) -> &mut T1.4.0

-

Make a mutable reference into the given Arc<T>. -If the Arc<T> has more than one strong reference, or any weak -references, the inner data is cloned.

- -

This is also referred to as a copy-on-write.

- -

Examples

-
-use std::sync::Arc;
-
-let mut data = Arc::new(5);
-
-*Arc::make_mut(&mut data) += 1;         // Won't clone anything
-let mut other_data = data.clone();      // Won't clone inner data
-*Arc::make_mut(&mut data) += 1;         // Clones inner data
-*Arc::make_mut(&mut data) += 1;         // Won't clone anything
-*Arc::make_mut(&mut other_data) *= 2;   // Won't clone anything
-
-// Note: data and other_data now point to different numbers
-assert_eq!(*data, 8);
-assert_eq!(*other_data, 12);
-
-

impl<T> Arc<T> where T: ?Sized

fn get_mut(this: &mut Arc<T>) -> Option<&mut T>1.4.0

-

Returns a mutable reference to the contained value if the Arc<T> has -one strong reference and no weak references.

- -

Examples

-
-use std::sync::Arc;
-
-let mut x = Arc::new(3);
-*Arc::get_mut(&mut x).unwrap() = 4;
-assert_eq!(*x, 4);
-
-let _y = x.clone();
-assert!(Arc::get_mut(&mut x).is_none());
-

Trait Implementations

impl<T> UnwindSafe for Arc<T> where T: RefUnwindSafe + ?Sized1.9.0

impl<T> Send for Arc<T> where T: Send + Sync + ?Sized

impl<T> Sync for Arc<T> where T: Send + Sync + ?Sized

impl<T, U> CoerceUnsized<Arc<U>> for Arc<T> where U: ?Sized, T: Unsize<U> + ?Sized

impl<T> Clone for Arc<T> where T: ?Sized

fn clone(&self) -> Arc<T>

-

Makes a clone of the Arc<T>.

- -

This increases the strong reference count.

- -

Examples

-
-use std::sync::Arc;
-
-let five = Arc::new(5);
-
-five.clone();
-

fn clone_from(&mut self, source: &Self)

-

impl<T> Deref for Arc<T> where T: ?Sized

type Target = T

-

fn deref(&self) -> &T

-

impl<T> Drop for Arc<T> where T: ?Sized

fn drop(&mut self)

-

Drops the Arc<T>.

- -

This will decrement the strong reference count. If the strong reference -count becomes zero and the only other references are Weak<T> ones, -drops the inner value.

- -

Examples

-
-use std::sync::Arc;
-
-{
-    let five = Arc::new(5);
-
-    // stuff
-
-    drop(five); // explicit drop
-}
-{
-    let five = Arc::new(5);
-
-    // stuff
-
-} // implicit drop
-

impl<T> PartialEq<Arc<T>> for Arc<T> where T: PartialEq<T> + ?Sized

fn eq(&self, other: &Arc<T>) -> bool

-

Equality for two Arc<T>s.

- -

Two Arc<T>s are equal if their inner value are equal.

- -

Examples

-
-use std::sync::Arc;
-
-let five = Arc::new(5);
-
-five == Arc::new(5);
-

fn ne(&self, other: &Arc<T>) -> bool

-

Inequality for two Arc<T>s.

- -

Two Arc<T>s are unequal if their inner value are unequal.

- -

Examples

-
-use std::sync::Arc;
-
-let five = Arc::new(5);
-
-five != Arc::new(5);
-

impl<T> PartialOrd<Arc<T>> for Arc<T> where T: PartialOrd<T> + ?Sized

fn partial_cmp(&self, other: &Arc<T>) -> Option<Ordering>

-

Partial comparison for two Arc<T>s.

- -

The two are compared by calling partial_cmp() on their inner values.

- -

Examples

-
-use std::sync::Arc;
-
-let five = Arc::new(5);
-
-five.partial_cmp(&Arc::new(5));
-

fn lt(&self, other: &Arc<T>) -> bool

-

Less-than comparison for two Arc<T>s.

- -

The two are compared by calling < on their inner values.

- -

Examples

-
-use std::sync::Arc;
-
-let five = Arc::new(5);
-
-five < Arc::new(5);
-

fn le(&self, other: &Arc<T>) -> bool

-

'Less-than or equal to' comparison for two Arc<T>s.

- -

The two are compared by calling <= on their inner values.

- -

Examples

-
-use std::sync::Arc;
-
-let five = Arc::new(5);
-
-five <= Arc::new(5);
-

fn gt(&self, other: &Arc<T>) -> bool

-

Greater-than comparison for two Arc<T>s.

- -

The two are compared by calling > on their inner values.

- -

Examples

-
-use std::sync::Arc;
-
-let five = Arc::new(5);
-
-five > Arc::new(5);
-

fn ge(&self, other: &Arc<T>) -> bool

-

'Greater-than or equal to' comparison for two Arc<T>s.

- -

The two are compared by calling >= on their inner values.

- -

Examples

-
-use std::sync::Arc;
-
-let five = Arc::new(5);
-
-five >= Arc::new(5);
-

impl<T> Ord for Arc<T> where T: Ord + ?Sized

fn cmp(&self, other: &Arc<T>) -> Ordering

-

impl<T> Eq for Arc<T> where T: Eq + ?Sized

impl<T> Display for Arc<T> where T: Display + ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Debug for Arc<T> where T: Debug + ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Pointer for Arc<T> where T: ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Default for Arc<T> where T: Default

fn default() -> Arc<T>

-

impl<T> Hash for Arc<T> where T: Hash + ?Sized

fn hash<H>(&self, state: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<T> From<T> for Arc<T>1.6.0

fn from(t: T) -> Arc<T>

-

impl<T> Borrow<T> for Arc<T> where T: ?Sized

fn borrow(&self) -> &T

-

impl<T> AsRef<T> for Arc<T> where T: ?Sized1.5.0

fn as_ref(&self) -> &T

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.Barrier.html b/doc/bitflags/__core/sync/struct.Barrier.html deleted file mode 100644 index 97849bef..00000000 --- a/doc/bitflags/__core/sync/struct.Barrier.html +++ /dev/null @@ -1,152 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::Barrier - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::Barrier - - [−] - - [src]

-
pub struct Barrier {
-    // some fields omitted
-}
1.0.0

A barrier enables multiple threads to synchronize the beginning -of some computation.

- -
-use std::sync::{Arc, Barrier};
-use std::thread;
-
-let mut handles = Vec::with_capacity(10);
-let barrier = Arc::new(Barrier::new(10));
-for _ in 0..10 {
-    let c = barrier.clone();
-    // The same messages will be printed together.
-    // You will NOT see any interleaving.
-    handles.push(thread::spawn(move|| {
-        println!("before wait");
-        c.wait();
-        println!("after wait");
-    }));
-}
-// Wait for other threads to finish.
-for handle in handles {
-    handle.join().unwrap();
-}
-

Methods

impl Barrier

fn new(n: usize) -> Barrier

-

Creates a new barrier that can block a given number of threads.

- -

A barrier will block n-1 threads which call wait and then wake up -all threads at once when the nth thread calls wait.

-

fn wait(&self) -> BarrierWaitResult

-

Blocks the current thread until all threads has rendezvoused here.

- -

Barriers are re-usable after all threads have rendezvoused once, and can -be used continuously.

- -

A single (arbitrary) thread will receive a BarrierWaitResult that -returns true from is_leader when returning from this function, and -all other threads will receive a result that will return false from -is_leader

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.BarrierWaitResult.html b/doc/bitflags/__core/sync/struct.BarrierWaitResult.html deleted file mode 100644 index 303c13f6..00000000 --- a/doc/bitflags/__core/sync/struct.BarrierWaitResult.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::BarrierWaitResult - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::BarrierWaitResult - - [−] - - [src]

-
pub struct BarrierWaitResult(_);
1.0.0

A result returned from wait.

- -

Currently this opaque structure only has one method, .is_leader(). Only -one thread will receive a result that will return true from this function.

-

Methods

impl BarrierWaitResult

fn is_leader(&self) -> bool

-

Returns whether this thread from wait is the "leader thread".

- -

Only one thread will have true returned from their result, all other -threads will have false returned.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.Condvar.html b/doc/bitflags/__core/sync/struct.Condvar.html deleted file mode 100644 index 010d13cf..00000000 --- a/doc/bitflags/__core/sync/struct.Condvar.html +++ /dev/null @@ -1,230 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::Condvar - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::Condvar - - [−] - - [src]

-
pub struct Condvar {
-    // some fields omitted
-}
1.0.0

A Condition Variable

- -

Condition variables represent the ability to block a thread such that it -consumes no CPU time while waiting for an event to occur. Condition -variables are typically associated with a boolean predicate (a condition) -and a mutex. The predicate is always verified inside of the mutex before -determining that thread must block.

- -

Functions in this module will block the current thread of execution and -are bindings to system-provided condition variables where possible. Note -that this module places one additional restriction over the system condition -variables: each condvar can be used with precisely one mutex at runtime. Any -attempt to use multiple mutexes on the same condition variable will result -in a runtime panic. If this is not desired, then the unsafe primitives in -sys do not have this restriction but may result in undefined behavior.

- -

Examples

-
-use std::sync::{Arc, Mutex, Condvar};
-use std::thread;
-
-let pair = Arc::new((Mutex::new(false), Condvar::new()));
-let pair2 = pair.clone();
-
-// Inside of our lock, spawn a new thread, and then wait for it to start
-thread::spawn(move|| {
-    let &(ref lock, ref cvar) = &*pair2;
-    let mut started = lock.lock().unwrap();
-    *started = true;
-    cvar.notify_one();
-});
-
-// wait for the thread to start up
-let &(ref lock, ref cvar) = &*pair;
-let mut started = lock.lock().unwrap();
-while !*started {
-    started = cvar.wait(started).unwrap();
-}
-

Methods

impl Condvar

fn new() -> Condvar

-

Creates a new condition variable which is ready to be waited on and -notified.

-

fn wait<T>(&self, guard: MutexGuard<'a, T>) -> Result<MutexGuard<'a, T>, PoisonError<MutexGuard<'a, T>>>

-

Blocks the current thread until this condition variable receives a -notification.

- -

This function will atomically unlock the mutex specified (represented by -mutex_guard) and block the current thread. This means that any calls -to notify_*() which happen logically after the mutex is unlocked are -candidates to wake this thread up. When this function call returns, the -lock specified will have been re-acquired.

- -

Note that this function is susceptible to spurious wakeups. Condition -variables normally have a boolean predicate associated with them, and -the predicate must always be checked each time this function returns to -protect against spurious wakeups.

- -

Errors

-

This function will return an error if the mutex being waited on is -poisoned when this thread re-acquires the lock. For more information, -see information about poisoning on the Mutex type.

- -

Panics

-

This function will panic!() if it is used with more than one mutex -over time. Each condition variable is dynamically bound to exactly one -mutex to ensure defined behavior across platforms. If this functionality -is not desired, then unsafe primitives in sys are provided.

-

fn wait_timeout_ms<T>(&self, guard: MutexGuard<'a, T>, ms: u32) -> Result<(MutexGuard<'a, T>, bool), PoisonError<(MutexGuard<'a, T>, bool)>>

-
Deprecated since 1.6.0

: replaced by std::sync::Condvar::wait_timeout

-

Waits on this condition variable for a notification, timing out after a -specified duration.

- -

The semantics of this function are equivalent to wait() -except that the thread will be blocked for roughly no longer -than ms milliseconds. This method should not be used for -precise timing due to anomalies such as preemption or platform -differences that may not cause the maximum amount of time -waited to be precisely ms.

- -

The returned boolean is false only if the timeout is known -to have elapsed.

- -

Like wait, the lock specified will be re-acquired when this function -returns, regardless of whether the timeout elapsed or not.

-

fn wait_timeout<T>(&self, guard: MutexGuard<'a, T>, dur: Duration) -> Result<(MutexGuard<'a, T>, WaitTimeoutResult), PoisonError<(MutexGuard<'a, T>, WaitTimeoutResult)>>1.5.0

-

Waits on this condition variable for a notification, timing out after a -specified duration.

- -

The semantics of this function are equivalent to wait() except that -the thread will be blocked for roughly no longer than dur. This -method should not be used for precise timing due to anomalies such as -preemption or platform differences that may not cause the maximum -amount of time waited to be precisely dur.

- -

The returned WaitTimeoutResult value indicates if the timeout is -known to have elapsed.

- -

Like wait, the lock specified will be re-acquired when this function -returns, regardless of whether the timeout elapsed or not.

-

fn notify_one(&self)

-

Wakes up one blocked thread on this condvar.

- -

If there is a blocked thread on this condition variable, then it will -be woken up from its call to wait or wait_timeout. Calls to -notify_one are not buffered in any way.

- -

To wake up all threads, see notify_all().

-

fn notify_all(&self)

-

Wakes up all blocked threads on this condvar.

- -

This method will ensure that any current waiters on the condition -variable are awoken. Calls to notify_all() are not buffered in any -way.

- -

To wake up only one thread, see notify_one().

-

Trait Implementations

impl Default for Condvar1.9.0

fn default() -> Condvar

-

impl Drop for Condvar

fn drop(&mut self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.Mutex.html b/doc/bitflags/__core/sync/struct.Mutex.html deleted file mode 100644 index eef92a5f..00000000 --- a/doc/bitflags/__core/sync/struct.Mutex.html +++ /dev/null @@ -1,261 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::Mutex - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::Mutex - - [−] - - [src]

-
pub struct Mutex<T> where T: ?Sized {
-    // some fields omitted
-}
1.0.0

A mutual exclusion primitive useful for protecting shared data

- -

This mutex will block threads waiting for the lock to become available. The -mutex can also be statically initialized or created via a new -constructor. Each mutex has a type parameter which represents the data that -it is protecting. The data can only be accessed through the RAII guards -returned from lock and try_lock, which guarantees that the data is only -ever accessed when the mutex is locked.

- -

Poisoning

-

The mutexes in this module implement a strategy called "poisoning" where a -mutex is considered poisoned whenever a thread panics while holding the -lock. Once a mutex is poisoned, all other threads are unable to access the -data by default as it is likely tainted (some invariant is not being -upheld).

- -

For a mutex, this means that the lock and try_lock methods return a -Result which indicates whether a mutex has been poisoned or not. Most -usage of a mutex will simply unwrap() these results, propagating panics -among threads to ensure that a possibly invalid invariant is not witnessed.

- -

A poisoned mutex, however, does not prevent all access to the underlying -data. The PoisonError type has an into_inner method which will return -the guard that would have otherwise been returned on a successful lock. This -allows access to the data, despite the lock being poisoned.

- -

Examples

-
-use std::sync::{Arc, Mutex};
-use std::thread;
-use std::sync::mpsc::channel;
-
-const N: usize = 10;
-
-// Spawn a few threads to increment a shared variable (non-atomically), and
-// let the main thread know once all increments are done.
-//
-// Here we're using an Arc to share memory among threads, and the data inside
-// the Arc is protected with a mutex.
-let data = Arc::new(Mutex::new(0));
-
-let (tx, rx) = channel();
-for _ in 0..10 {
-    let (data, tx) = (data.clone(), tx.clone());
-    thread::spawn(move || {
-        // The shared state can only be accessed once the lock is held.
-        // Our non-atomic increment is safe because we're the only thread
-        // which can access the shared state when the lock is held.
-        //
-        // We unwrap() the return value to assert that we are not expecting
-        // threads to ever fail while holding the lock.
-        let mut data = data.lock().unwrap();
-        *data += 1;
-        if *data == N {
-            tx.send(()).unwrap();
-        }
-        // the lock is unlocked here when `data` goes out of scope.
-    });
-}
-
-rx.recv().unwrap();
- -

To recover from a poisoned mutex:

- -
-use std::sync::{Arc, Mutex};
-use std::thread;
-
-let lock = Arc::new(Mutex::new(0_u32));
-let lock2 = lock.clone();
-
-let _ = thread::spawn(move || -> () {
-    // This thread will acquire the mutex first, unwrapping the result of
-    // `lock` because the lock has not been poisoned.
-    let _guard = lock2.lock().unwrap();
-
-    // This panic while holding the lock (`_guard` is in scope) will poison
-    // the mutex.
-    panic!();
-}).join();
-
-// The lock is poisoned by this point, but the returned result can be
-// pattern matched on to return the underlying guard on both branches.
-let mut guard = match lock.lock() {
-    Ok(guard) => guard,
-    Err(poisoned) => poisoned.into_inner(),
-};
-
-*guard += 1;
-

Methods

impl<T> Mutex<T>

fn new(t: T) -> Mutex<T>

-

Creates a new mutex in an unlocked state ready for use.

-

impl<T> Mutex<T> where T: ?Sized

fn lock(&self) -> Result<MutexGuard<T>, PoisonError<MutexGuard<T>>>

-

Acquires a mutex, blocking the current thread until it is able to do so.

- -

This function will block the local thread until it is available to acquire -the mutex. Upon returning, the thread is the only thread with the mutex -held. An RAII guard is returned to allow scoped unlock of the lock. When -the guard goes out of scope, the mutex will be unlocked.

- -

The exact behavior on locking a mutex in the thread which already holds -the lock is left unspecified. However, this function will not return on -the second call (it might panic or deadlock, for example).

- -

Errors

-

If another user of this mutex panicked while holding the mutex, then -this call will return an error once the mutex is acquired.

- -

Panics

-

This function might panic when called if the lock is already held by -the current thread.

-

fn try_lock(&self) -> Result<MutexGuard<T>, TryLockError<MutexGuard<T>>>

-

Attempts to acquire this lock.

- -

If the lock could not be acquired at this time, then Err is returned. -Otherwise, an RAII guard is returned. The lock will be unlocked when the -guard is dropped.

- -

This function does not block.

- -

Errors

-

If another user of this mutex panicked while holding the mutex, then -this call will return failure if the mutex would otherwise be -acquired.

-

fn is_poisoned(&self) -> bool1.2.0

-

Determines whether the lock is poisoned.

- -

If another thread is active, the lock can still become poisoned at any -time. You should not trust a false value for program correctness -without additional synchronization.

-

fn into_inner(self) -> Result<T, PoisonError<T>>1.6.0

-

Consumes this mutex, returning the underlying data.

- -

Errors

-

If another user of this mutex panicked while holding the mutex, then -this call will return an error instead.

-

fn get_mut(&mut self) -> Result<&mut T, PoisonError<&mut T>>1.6.0

-

Returns a mutable reference to the underlying data.

- -

Since this call borrows the Mutex mutably, no actual locking needs to -take place---the mutable borrow statically guarantees no locks exist.

- -

Errors

-

If another user of this mutex panicked while holding the mutex, then -this call will return an error instead.

-

Trait Implementations

impl<T> UnwindSafe for Mutex<T> where T: ?Sized1.9.0

impl<T> Send for Mutex<T> where T: Send + ?Sized

impl<T> Sync for Mutex<T> where T: Send + ?Sized

impl<T> Drop for Mutex<T> where T: ?Sized

fn drop(&mut self)

-

impl<T> Default for Mutex<T> where T: Default + ?Sized1.9.0

fn default() -> Mutex<T>

-

impl<T> Debug for Mutex<T> where T: Debug + ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.MutexGuard.html b/doc/bitflags/__core/sync/struct.MutexGuard.html deleted file mode 100644 index 4234dc64..00000000 --- a/doc/bitflags/__core/sync/struct.MutexGuard.html +++ /dev/null @@ -1,124 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::MutexGuard - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::MutexGuard - - [−] - - [src]

-
#[must_use]
-pub struct MutexGuard<'a, T> where T: 'a + ?Sized {
-    // some fields omitted
-}
1.0.0

An RAII implementation of a "scoped lock" of a mutex. When this structure is -dropped (falls out of scope), the lock will be unlocked.

- -

The data protected by the mutex can be access through this guard via its -Deref and DerefMut implementations

-

Trait Implementations

impl<'a, T> !Send for MutexGuard<'a, T> where T: ?Sized

impl<'mutex, T> Deref for MutexGuard<'mutex, T> where T: ?Sized

type Target = T

-

fn deref(&self) -> &T

-

impl<'mutex, T> DerefMut for MutexGuard<'mutex, T> where T: ?Sized

fn deref_mut(&mut self) -> &mut T

-

impl<'a, T> Drop for MutexGuard<'a, T> where T: ?Sized

fn drop(&mut self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.Once.html b/doc/bitflags/__core/sync/struct.Once.html deleted file mode 100644 index 7ce0182c..00000000 --- a/doc/bitflags/__core/sync/struct.Once.html +++ /dev/null @@ -1,189 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::Once - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::Once - - [−] - - [src]

-
pub struct Once {
-    // some fields omitted
-}
1.0.0

A synchronization primitive which can be used to run a one-time global -initialization. Useful for one-time initialization for FFI or related -functionality. This type can only be constructed with the ONCE_INIT -value.

- -

Examples

-
-use std::sync::{Once, ONCE_INIT};
-
-static START: Once = ONCE_INIT;
-
-START.call_once(|| {
-    // run initialization here
-});
-

Methods

impl Once

const fn new() -> Once1.2.0

-

Creates a new Once value.

-

fn call_once<F>(&'static self, f: F) where F: FnOnce() -> ()

-

Performs an initialization routine once and only once. The given closure -will be executed if this is the first time call_once has been called, -and otherwise the routine will not be invoked.

- -

This method will block the calling thread if another initialization -routine is currently running.

- -

When this function returns, it is guaranteed that some initialization -has run and completed (it may not be the closure specified). It is also -guaranteed that any memory writes performed by the executed closure can -be reliably observed by other threads at this point (there is a -happens-before relation between the closure and code executing after the -return).

- -

Examples

-
-use std::sync::{Once, ONCE_INIT};
-
-static mut VAL: usize = 0;
-static INIT: Once = ONCE_INIT;
-
-// Accessing a `static mut` is unsafe much of the time, but if we do so
-// in a synchronized fashion (e.g. write once or read all) then we're
-// good to go!
-//
-// This function will only call `expensive_computation` once, and will
-// otherwise always return the value returned from the first invocation.
-fn get_cached_val() -> usize {
-    unsafe {
-        INIT.call_once(|| {
-            VAL = expensive_computation();
-        });
-        VAL
-    }
-}
-
-fn expensive_computation() -> usize {
-    // ...
-}
- -

Panics

-

The closure f will only be executed once if this is called -concurrently amongst many threads. If that closure panics, however, then -it will poison this Once instance, causing all future invocations of -call_once to also panic.

- -

This is similar to poisoning with mutexes.

-

fn call_once_force<F>(&'static self, f: F) where F: FnOnce(&OnceState) -> ()

-
Unstable (once_poison)

Performs the same function as call_once except ignores poisoning.

- -

If this Once has been poisoned (some initialization panicked) then -this function will continue to attempt to call initialization functions -until one of them doesn't panic.

- -

The closure f is yielded a structure which can be used to query the -state of this Once (whether initialization has previously panicked or -not). -poisoned or not.

-

Trait Implementations

impl Sync for Once

impl Send for Once

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.PoisonError.html b/doc/bitflags/__core/sync/struct.PoisonError.html deleted file mode 100644 index 9867aa56..00000000 --- a/doc/bitflags/__core/sync/struct.PoisonError.html +++ /dev/null @@ -1,135 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::PoisonError - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::PoisonError - - [−] - - [src]

-
pub struct PoisonError<T> {
-    // some fields omitted
-}
1.0.0

A type of error which can be returned whenever a lock is acquired.

- -

Both Mutexes and RwLocks are poisoned whenever a thread fails while the lock -is held. The precise semantics for when a lock is poisoned is documented on -each lock, but once a lock is poisoned then all future acquisitions will -return this error.

-

Methods

impl<T> PoisonError<T>

fn new(guard: T) -> PoisonError<T>1.2.0

-

Creates a PoisonError.

-

fn into_inner(self) -> T1.2.0

-

Consumes this error indicating that a lock is poisoned, returning the -underlying guard to allow access regardless.

-

fn get_ref(&self) -> &T1.2.0

-

Reaches into this error indicating that a lock is poisoned, returning a -reference to the underlying guard to allow access regardless.

-

fn get_mut(&mut self) -> &mut T1.2.0

-

Reaches into this error indicating that a lock is poisoned, returning a -mutable reference to the underlying guard to allow access regardless.

-

Trait Implementations

impl<T> Debug for PoisonError<T>

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Display for PoisonError<T>

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Error for PoisonError<T> where T: Reflect

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.RwLock.html b/doc/bitflags/__core/sync/struct.RwLock.html deleted file mode 100644 index 104986ab..00000000 --- a/doc/bitflags/__core/sync/struct.RwLock.html +++ /dev/null @@ -1,258 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::RwLock - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::RwLock - - [−] - - [src]

-
pub struct RwLock<T> where T: ?Sized {
-    // some fields omitted
-}
1.0.0

A reader-writer lock

- -

This type of lock allows a number of readers or at most one writer at any -point in time. The write portion of this lock typically allows modification -of the underlying data (exclusive access) and the read portion of this lock -typically allows for read-only access (shared access).

- -

The priority policy of the lock is dependent on the underlying operating -system's implementation, and this type does not guarantee that any -particular policy will be used.

- -

The type parameter T represents the data that this lock protects. It is -required that T satisfies Send to be shared across threads and Sync to -allow concurrent access through readers. The RAII guards returned from the -locking methods implement Deref (and DerefMut for the write methods) -to allow access to the contained of the lock.

- -

Poisoning

-

RwLocks, like Mutexes, will become poisoned on panics. Note, however, that -an RwLock may only be poisoned if a panic occurs while it is locked -exclusively (write mode). If a panic occurs in any reader, then the lock -will not be poisoned.

- -

Examples

-
-use std::sync::RwLock;
-
-let lock = RwLock::new(5);
-
-// many reader locks can be held at once
-{
-    let r1 = lock.read().unwrap();
-    let r2 = lock.read().unwrap();
-    assert_eq!(*r1, 5);
-    assert_eq!(*r2, 5);
-} // read locks are dropped at this point
-
-// only one write lock may be held, however
-{
-    let mut w = lock.write().unwrap();
-    *w += 1;
-    assert_eq!(*w, 6);
-} // write lock is dropped here
-

Methods

impl<T> RwLock<T>

fn new(t: T) -> RwLock<T>

-

Creates a new instance of an RwLock<T> which is unlocked.

- -

Examples

-
-use std::sync::RwLock;
-
-let lock = RwLock::new(5);
-

impl<T> RwLock<T> where T: ?Sized

fn read(&self) -> Result<RwLockReadGuard<T>, PoisonError<RwLockReadGuard<T>>>

-

Locks this rwlock with shared read access, blocking the current thread -until it can be acquired.

- -

The calling thread will be blocked until there are no more writers which -hold the lock. There may be other readers currently inside the lock when -this method returns. This method does not provide any guarantees with -respect to the ordering of whether contentious readers or writers will -acquire the lock first.

- -

Returns an RAII guard which will release this thread's shared access -once it is dropped.

- -

Errors

-

This function will return an error if the RwLock is poisoned. An RwLock -is poisoned whenever a writer panics while holding an exclusive lock. -The failure will occur immediately after the lock has been acquired.

-

fn try_read(&self) -> Result<RwLockReadGuard<T>, TryLockError<RwLockReadGuard<T>>>

-

Attempts to acquire this rwlock with shared read access.

- -

If the access could not be granted at this time, then Err is returned. -Otherwise, an RAII guard is returned which will release the shared access -when it is dropped.

- -

This function does not block.

- -

This function does not provide any guarantees with respect to the ordering -of whether contentious readers or writers will acquire the lock first.

- -

Errors

-

This function will return an error if the RwLock is poisoned. An RwLock -is poisoned whenever a writer panics while holding an exclusive lock. An -error will only be returned if the lock would have otherwise been -acquired.

-

fn write(&self) -> Result<RwLockWriteGuard<T>, PoisonError<RwLockWriteGuard<T>>>

-

Locks this rwlock with exclusive write access, blocking the current -thread until it can be acquired.

- -

This function will not return while other writers or other readers -currently have access to the lock.

- -

Returns an RAII guard which will drop the write access of this rwlock -when dropped.

- -

Errors

-

This function will return an error if the RwLock is poisoned. An RwLock -is poisoned whenever a writer panics while holding an exclusive lock. -An error will be returned when the lock is acquired.

-

fn try_write(&self) -> Result<RwLockWriteGuard<T>, TryLockError<RwLockWriteGuard<T>>>

-

Attempts to lock this rwlock with exclusive write access.

- -

If the lock could not be acquired at this time, then Err is returned. -Otherwise, an RAII guard is returned which will release the lock when -it is dropped.

- -

This function does not block.

- -

This function does not provide any guarantees with respect to the ordering -of whether contentious readers or writers will acquire the lock first.

- -

Errors

-

This function will return an error if the RwLock is poisoned. An RwLock -is poisoned whenever a writer panics while holding an exclusive lock. An -error will only be returned if the lock would have otherwise been -acquired.

-

fn is_poisoned(&self) -> bool1.2.0

-

Determines whether the lock is poisoned.

- -

If another thread is active, the lock can still become poisoned at any -time. You should not trust a false value for program correctness -without additional synchronization.

-

fn into_inner(self) -> Result<T, PoisonError<T>>1.6.0

-

Consumes this RwLock, returning the underlying data.

- -

Errors

-

This function will return an error if the RwLock is poisoned. An RwLock -is poisoned whenever a writer panics while holding an exclusive lock. An -error will only be returned if the lock would have otherwise been -acquired.

-

fn get_mut(&mut self) -> Result<&mut T, PoisonError<&mut T>>1.6.0

-

Returns a mutable reference to the underlying data.

- -

Since this call borrows the RwLock mutably, no actual locking needs to -take place---the mutable borrow statically guarantees no locks exist.

- -

Errors

-

This function will return an error if the RwLock is poisoned. An RwLock -is poisoned whenever a writer panics while holding an exclusive lock. An -error will only be returned if the lock would have otherwise been -acquired.

-

Trait Implementations

impl<T> UnwindSafe for RwLock<T> where T: ?Sized1.9.0

impl<T> Send for RwLock<T> where T: Send + Sync + ?Sized

impl<T> Sync for RwLock<T> where T: Send + Sync + ?Sized

impl<T> Drop for RwLock<T> where T: ?Sized

fn drop(&mut self)

-

impl<T> Debug for RwLock<T> where T: Debug + ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Default for RwLock<T> where T: Default1.9.0

fn default() -> RwLock<T>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.RwLockReadGuard.html b/doc/bitflags/__core/sync/struct.RwLockReadGuard.html deleted file mode 100644 index a140b9e9..00000000 --- a/doc/bitflags/__core/sync/struct.RwLockReadGuard.html +++ /dev/null @@ -1,134 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::RwLockReadGuard - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::RwLockReadGuard - - [−] - - [src]

-
#[must_use]
-pub struct RwLockReadGuard<'a, T> where T: 'a + ?Sized {
-    // some fields omitted
-}
1.0.0

RAII structure used to release the shared read access of a lock when -dropped.

-

Methods

impl<'rwlock, T> RwLockReadGuard<'rwlock, T> where T: ?Sized

fn map<U, F>(this: RwLockReadGuard<'rwlock, T>, cb: F) -> RwLockReadGuard<'rwlock, U> where U: ?Sized, F: FnOnce(&T) -> &U

-
Deprecated since 1.8.0

: unsound on Mutex because of Condvar and RwLock may also with to be used with Condvar one day

-
Unstable (guard_map)

: unsound on Mutex because of Condvar and RwLock may also with to be used with Condvar one day

-

Transform this guard to hold a sub-borrow of the original data.

- -

Applies the supplied closure to the data, returning a new lock -guard referencing the borrow returned by the closure.

- -

Examples

-
-let x = RwLock::new(vec![1, 2]);
-
-let y = RwLockReadGuard::map(x.read().unwrap(), |v| &v[0]);
-assert_eq!(*y, 1);
-

Trait Implementations

impl<'a, T> !Send for RwLockReadGuard<'a, T> where T: ?Sized

impl<'rwlock, T> Deref for RwLockReadGuard<'rwlock, T> where T: ?Sized

type Target = T

-

fn deref(&self) -> &T

-

impl<'a, T> Drop for RwLockReadGuard<'a, T> where T: ?Sized

fn drop(&mut self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.RwLockWriteGuard.html b/doc/bitflags/__core/sync/struct.RwLockWriteGuard.html deleted file mode 100644 index 6c26f8a4..00000000 --- a/doc/bitflags/__core/sync/struct.RwLockWriteGuard.html +++ /dev/null @@ -1,141 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::RwLockWriteGuard - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::RwLockWriteGuard - - [−] - - [src]

-
#[must_use]
-pub struct RwLockWriteGuard<'a, T> where T: 'a + ?Sized {
-    // some fields omitted
-}
1.0.0

RAII structure used to release the exclusive write access of a lock when -dropped.

-

Methods

impl<'rwlock, T> RwLockWriteGuard<'rwlock, T> where T: ?Sized

fn map<U, F>(this: RwLockWriteGuard<'rwlock, T>, cb: F) -> RwLockWriteGuard<'rwlock, U> where F: FnOnce(&mut T) -> &mut U, U: ?Sized

-
Deprecated since 1.8.0

: unsound on Mutex because of Condvar and RwLock may also with to be used with Condvar one day

-
Unstable (guard_map)

: unsound on Mutex because of Condvar and RwLock may also with to be used with Condvar one day

-

Transform this guard to hold a sub-borrow of the original data.

- -

Applies the supplied closure to the data, returning a new lock -guard referencing the borrow returned by the closure.

- -

Examples

-
-let x = RwLock::new(vec![1, 2]);
-
-{
-    let mut y = RwLockWriteGuard::map(x.write().unwrap(), |v| &mut v[0]);
-    assert_eq!(*y, 1);
-
-    *y = 10;
-}
-
-assert_eq!(&**x.read().unwrap(), &[10, 2]);
-

Trait Implementations

impl<'a, T> !Send for RwLockWriteGuard<'a, T> where T: ?Sized

impl<'rwlock, T> Deref for RwLockWriteGuard<'rwlock, T> where T: ?Sized

type Target = T

-

fn deref(&self) -> &T

-

impl<'rwlock, T> DerefMut for RwLockWriteGuard<'rwlock, T> where T: ?Sized

fn deref_mut(&mut self) -> &mut T

-

impl<'a, T> Drop for RwLockWriteGuard<'a, T> where T: ?Sized

fn drop(&mut self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.StaticCondvar.html b/doc/bitflags/__core/sync/struct.StaticCondvar.html deleted file mode 100644 index 1e7632bb..00000000 --- a/doc/bitflags/__core/sync/struct.StaticCondvar.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::StaticCondvar - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::StaticCondvar - - [−] - - [src]

-
pub struct StaticCondvar {
-    // some fields omitted
-}
Unstable (static_condvar)

: may be merged with Condvar in the future

-

Statically allocated condition variables.

- -

This structure is identical to Condvar except that it is suitable for use -in static initializers for other structures.

- -

Examples

-
-#![feature(static_condvar)]
-
-use std::sync::{StaticCondvar, CONDVAR_INIT};
-
-static CVAR: StaticCondvar = CONDVAR_INIT;
-

Methods

impl StaticCondvar

const fn new() -> StaticCondvar

-
Unstable (static_condvar)

: may be merged with Condvar in the future

-

Creates a new condition variable

-

fn wait<T>(&'static self, guard: MutexGuard<'a, T>) -> Result<MutexGuard<'a, T>, PoisonError<MutexGuard<'a, T>>>

-
Unstable (static_condvar)

: may be merged with Condvar in the future

-

Blocks the current thread until this condition variable receives a -notification.

- -

See Condvar::wait.

-

fn wait_timeout<T>(&'static self, guard: MutexGuard<'a, T>, timeout: Duration) -> Result<(MutexGuard<'a, T>, WaitTimeoutResult), PoisonError<(MutexGuard<'a, T>, WaitTimeoutResult)>>

-
Unstable (static_condvar)

: may be merged with Condvar in the future

-

Waits on this condition variable for a notification, timing out after a -specified duration.

- -

See Condvar::wait_timeout.

-

fn wait_timeout_with<T, F>(&'static self, guard: MutexGuard<'a, T>, dur: Duration, f: F) -> Result<(MutexGuard<'a, T>, WaitTimeoutResult), PoisonError<(MutexGuard<'a, T>, WaitTimeoutResult)>> where F: FnMut(Result<&mut T, PoisonError<&mut T>>) -> bool

-
Unstable (static_condvar)

: may be merged with Condvar in the future

-

Waits on this condition variable for a notification, timing out after a -specified duration.

- -

The implementation will repeatedly wait while the duration has not -passed and the function returns false.

- -

See Condvar::wait_timeout_with.

-

fn notify_one(&'static self)

-
Unstable (static_condvar)

: may be merged with Condvar in the future

-

Wakes up one blocked thread on this condvar.

- -

See Condvar::notify_one.

-

fn notify_all(&'static self)

-
Unstable (static_condvar)

: may be merged with Condvar in the future

-

Wakes up all blocked threads on this condvar.

- -

See Condvar::notify_all.

-

unsafe fn destroy(&'static self)

-
Unstable (static_condvar)

: may be merged with Condvar in the future

-

Deallocates all resources associated with this static condvar.

- -

This method is unsafe to call as there is no guarantee that there are no -active users of the condvar, and this also doesn't prevent any future -users of the condvar. This method is required to be called to not leak -memory on all platforms.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.StaticMutex.html b/doc/bitflags/__core/sync/struct.StaticMutex.html deleted file mode 100644 index 403fc3c5..00000000 --- a/doc/bitflags/__core/sync/struct.StaticMutex.html +++ /dev/null @@ -1,157 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::StaticMutex - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::StaticMutex - - [−] - - [src]

-
pub struct StaticMutex {
-    // some fields omitted
-}
Unstable (static_mutex)

: may be merged with Mutex in the future

-

The static mutex type is provided to allow for static allocation of mutexes.

- -

Note that this is a separate type because using a Mutex correctly means that -it needs to have a destructor run. In Rust, statics are not allowed to have -destructors. As a result, a StaticMutex has one extra method when compared -to a Mutex, a destroy method. This method is unsafe to call, and -documentation can be found directly on the method.

- -

Examples

-
-#![feature(static_mutex)]
-
-use std::sync::{StaticMutex, MUTEX_INIT};
-
-static LOCK: StaticMutex = MUTEX_INIT;
-
-{
-    let _g = LOCK.lock().unwrap();
-    // do some productive work
-}
-// lock is unlocked here.
-

Methods

impl StaticMutex

const fn new() -> StaticMutex

-
Unstable (static_mutex)

: may be merged with Mutex in the future

-

Creates a new mutex in an unlocked state ready for use.

-

fn lock(&'static self) -> Result<MutexGuard<'static, ()>, PoisonError<MutexGuard<'static, ()>>>

-
Unstable (static_mutex)

: may be merged with Mutex in the future

-

Acquires this lock, see Mutex::lock

-

fn try_lock(&'static self) -> Result<MutexGuard<'static, ()>, TryLockError<MutexGuard<'static, ()>>>

-
Unstable (static_mutex)

: may be merged with Mutex in the future

-

Attempts to grab this lock, see Mutex::try_lock

-

unsafe fn destroy(&'static self)

-
Unstable (static_mutex)

: may be merged with Mutex in the future

-

Deallocates resources associated with this static mutex.

- -

This method is unsafe because it provides no guarantees that there are -no active users of this mutex, and safety is not guaranteed if there are -active users of this mutex.

- -

This method is required to ensure that there are no memory leaks on -all platforms. It may be the case that some platforms do not leak -memory if this method is not called, but this is not guaranteed to be -true on all platforms.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.StaticRwLock.html b/doc/bitflags/__core/sync/struct.StaticRwLock.html deleted file mode 100644 index f763a362..00000000 --- a/doc/bitflags/__core/sync/struct.StaticRwLock.html +++ /dev/null @@ -1,171 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::StaticRwLock - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::StaticRwLock - - [−] - - [src]

-
pub struct StaticRwLock {
-    // some fields omitted
-}
Unstable (static_rwlock)

: may be merged with RwLock in the future

-

Structure representing a statically allocated RwLock.

- -

This structure is intended to be used inside of a static and will provide -automatic global access as well as lazy initialization. The internal -resources of this RwLock, however, must be manually deallocated.

- -

Examples

-
-#![feature(static_rwlock)]
-
-use std::sync::{StaticRwLock, RW_LOCK_INIT};
-
-static LOCK: StaticRwLock = RW_LOCK_INIT;
-
-{
-    let _g = LOCK.read().unwrap();
-    // ... shared read access
-}
-{
-    let _g = LOCK.write().unwrap();
-    // ... exclusive write access
-}
-unsafe { LOCK.destroy() } // free all resources
-

Methods

impl StaticRwLock

const fn new() -> StaticRwLock

-
Unstable (static_rwlock)

: may be merged with RwLock in the future

-

Creates a new rwlock.

-

fn read(&'static self) -> Result<RwLockReadGuard<'static, ()>, PoisonError<RwLockReadGuard<'static, ()>>>

-
Unstable (static_rwlock)

: may be merged with RwLock in the future

-

Locks this rwlock with shared read access, blocking the current thread -until it can be acquired.

- -

See RwLock::read.

-

fn try_read(&'static self) -> Result<RwLockReadGuard<'static, ()>, TryLockError<RwLockReadGuard<'static, ()>>>

-
Unstable (static_rwlock)

: may be merged with RwLock in the future

-

Attempts to acquire this lock with shared read access.

- -

See RwLock::try_read.

-

fn write(&'static self) -> Result<RwLockWriteGuard<'static, ()>, PoisonError<RwLockWriteGuard<'static, ()>>>

-
Unstable (static_rwlock)

: may be merged with RwLock in the future

-

Locks this rwlock with exclusive write access, blocking the current -thread until it can be acquired.

- -

See RwLock::write.

-

fn try_write(&'static self) -> Result<RwLockWriteGuard<'static, ()>, TryLockError<RwLockWriteGuard<'static, ()>>>

-
Unstable (static_rwlock)

: may be merged with RwLock in the future

-

Attempts to lock this rwlock with exclusive write access.

- -

See RwLock::try_write.

-

unsafe fn destroy(&'static self)

-
Unstable (static_rwlock)

: may be merged with RwLock in the future

-

Deallocates all resources associated with this static lock.

- -

This method is unsafe to call as there is no guarantee that there are no -active users of the lock, and this also doesn't prevent any future users -of this lock. This method is required to be called to not leak memory on -all platforms.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.WaitTimeoutResult.html b/doc/bitflags/__core/sync/struct.WaitTimeoutResult.html deleted file mode 100644 index 101bd082..00000000 --- a/doc/bitflags/__core/sync/struct.WaitTimeoutResult.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::WaitTimeoutResult - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::WaitTimeoutResult - - [−] - - [src]

-
pub struct WaitTimeoutResult(_);
1.5.0

A type indicating whether a timed wait on a condition variable returned -due to a time out or not.

-

Methods

impl WaitTimeoutResult

fn timed_out(&self) -> bool

-

Returns whether the wait was known to have timed out.

-

Trait Implementations

Derived Implementations

impl Clone for WaitTimeoutResult

fn clone(&self) -> WaitTimeoutResult

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Copy for WaitTimeoutResult

impl Eq for WaitTimeoutResult

impl PartialEq<WaitTimeoutResult> for WaitTimeoutResult

fn eq(&self, __arg_0: &WaitTimeoutResult) -> bool

-

fn ne(&self, __arg_0: &WaitTimeoutResult) -> bool

-

impl Debug for WaitTimeoutResult

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/struct.Weak.html b/doc/bitflags/__core/sync/struct.Weak.html deleted file mode 100644 index 24f24383..00000000 --- a/doc/bitflags/__core/sync/struct.Weak.html +++ /dev/null @@ -1,187 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::Weak - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::sync::Weak - - [−] - - [src]

-
pub struct Weak<T> where T: ?Sized {
-    // some fields omitted
-}
1.4.0

A weak pointer to an Arc.

- -

Weak pointers will not keep the data inside of the Arc alive, and can be -used to break cycles between Arc pointers.

-

Methods

impl<T> Weak<T> where T: ?Sized

fn upgrade(&self) -> Option<Arc<T>>

-

Upgrades a weak reference to a strong reference.

- -

Upgrades the Weak<T> reference to an Arc<T>, if possible.

- -

Returns None if there were no strong references and the data was -destroyed.

- -

Examples

-
-use std::sync::Arc;
-
-let five = Arc::new(5);
-
-let weak_five = Arc::downgrade(&five);
-
-let strong_five: Option<Arc<_>> = weak_five.upgrade();
-

impl<T> Weak<T>

fn new() -> Weak<T>

-
Unstable (downgraded_weak)

: recently added

-

Constructs a new Weak<T> without an accompanying instance of T.

- -

This allocates memory for T, but does not initialize it. Calling -Weak::upgrade() on the return value always gives None.

- -

Examples

-
-#![feature(downgraded_weak)]
-
-use std::sync::Weak;
-
-let empty: Weak<i64> = Weak::new();
-

Trait Implementations

impl<T> Send for Weak<T> where T: Send + Sync + ?Sized

impl<T> Sync for Weak<T> where T: Send + Sync + ?Sized

impl<T, U> CoerceUnsized<Weak<U>> for Weak<T> where T: Unsize<U> + ?Sized, U: ?Sized

impl<T> Debug for Weak<T> where T: Debug + ?Sized

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> Clone for Weak<T> where T: ?Sized

fn clone(&self) -> Weak<T>

-

Makes a clone of the Weak<T>.

- -

This increases the weak reference count.

- -

Examples

-
-use std::sync::Arc;
-
-let weak_five = Arc::downgrade(&Arc::new(5));
-
-weak_five.clone();
-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<T> Drop for Weak<T> where T: ?Sized

fn drop(&mut self)

-

Drops the Weak<T>.

- -

This will decrement the weak reference count.

- -

Examples

-
-use std::sync::Arc;
-
-{
-    let five = Arc::new(5);
-    let weak_five = Arc::downgrade(&five);
-
-    // stuff
-
-    drop(weak_five); // explicit drop
-}
-{
-    let five = Arc::new(5);
-    let weak_five = Arc::downgrade(&five);
-
-    // stuff
-
-} // implicit drop
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/type.LockResult.html b/doc/bitflags/__core/sync/type.LockResult.html deleted file mode 100644 index 5c7a6d05..00000000 --- a/doc/bitflags/__core/sync/type.LockResult.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::LockResult - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::sync::LockResult - - [−] - - [src]

-
type LockResult<Guard> = Result<Guard, PoisonError<Guard>>;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/sync/type.TryLockResult.html b/doc/bitflags/__core/sync/type.TryLockResult.html deleted file mode 100644 index 2fb5d40e..00000000 --- a/doc/bitflags/__core/sync/type.TryLockResult.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::sync::TryLockResult - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::sync::TryLockResult - - [−] - - [src]

-
type TryLockResult<Guard> = Result<Guard, TryLockError<Guard>>;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/enum.LocalKeyState.html b/doc/bitflags/__core/thread/enum.LocalKeyState.html deleted file mode 100644 index e42c4286..00000000 --- a/doc/bitflags/__core/thread/enum.LocalKeyState.html +++ /dev/null @@ -1,147 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::LocalKeyState - Rust - - - - - - - - - - - - - - - - - -
-

Enum bitflags::__core::thread::LocalKeyState - - [−] - - [src]

-
pub enum LocalKeyState {
-    Uninitialized,
-    Valid,
-    Destroyed,
-}
Unstable (thread_local_state)

: state querying was recently added

-

Indicator of the state of a thread local storage key.

-

Variants

-
Uninitialized
Unstable (thread_local_state)

: state querying was recently added

-

All keys are in this state whenever a thread starts. Keys will -transition to the Valid state once the first call to with happens -and the initialization expression succeeds.

- -

Keys in the Uninitialized state will yield a reference to the closure -passed to with so long as the initialization routine does not panic.

-
Valid
Unstable (thread_local_state)

: state querying was recently added

-

Once a key has been accessed successfully, it will enter the Valid -state. Keys in the Valid state will remain so until the thread exits, -at which point the destructor will be run and the key will enter the -Destroyed state.

- -

Keys in the Valid state will be guaranteed to yield a reference to the -closure passed to with.

-
Destroyed
Unstable (thread_local_state)

: state querying was recently added

-

When a thread exits, the destructors for keys will be run (if -necessary). While a destructor is running, and possibly after a -destructor has run, a key is in the Destroyed state.

- -

Keys in the Destroyed states will trigger a panic when accessed via -with.

-

Trait Implementations

Derived Implementations

impl Clone for LocalKeyState

fn clone(&self) -> LocalKeyState

-
Unstable (thread_local_state)

: state querying was recently added

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Copy for LocalKeyState

impl PartialEq<LocalKeyState> for LocalKeyState

fn eq(&self, __arg_0: &LocalKeyState) -> bool

-
Unstable (thread_local_state)

: state querying was recently added

-

fn ne(&self, other: &Rhs) -> bool1.0.0

-

impl Eq for LocalKeyState

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/fn.current.html b/doc/bitflags/__core/thread/fn.current.html deleted file mode 100644 index 6e81e3cb..00000000 --- a/doc/bitflags/__core/thread/fn.current.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::current - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::thread::current - - [−] - - [src]

-
pub fn current() -> Thread
1.0.0

Gets a handle to the thread that invokes it.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/fn.panicking.html b/doc/bitflags/__core/thread/fn.panicking.html deleted file mode 100644 index e5543d15..00000000 --- a/doc/bitflags/__core/thread/fn.panicking.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::panicking - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::thread::panicking - - [−] - - [src]

-
pub fn panicking() -> bool
1.0.0

Determines whether the current thread is unwinding because of panic.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/fn.park.html b/doc/bitflags/__core/thread/fn.park.html deleted file mode 100644 index 4c6db132..00000000 --- a/doc/bitflags/__core/thread/fn.park.html +++ /dev/null @@ -1,127 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::park - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::thread::park - - [−] - - [src]

-
pub fn park()
1.0.0

Blocks unless or until the current thread's token is made available.

- -

Every thread is equipped with some basic low-level blocking support, via -the park() function and the unpark() method. These can be -used as a more CPU-efficient implementation of a spinlock.

- -

The API is typically used by acquiring a handle to the current thread, -placing that handle in a shared data structure so that other threads can -find it, and then parking (in a loop with a check for the token actually -being acquired).

- -

A call to park does not guarantee that the thread will remain parked -forever, and callers should be prepared for this possibility.

- -

See the module documentation for more detail.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/fn.park_timeout.html b/doc/bitflags/__core/thread/fn.park_timeout.html deleted file mode 100644 index bbc8dd87..00000000 --- a/doc/bitflags/__core/thread/fn.park_timeout.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::park_timeout - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::thread::park_timeout - - [−] - - [src]

-
pub fn park_timeout(dur: Duration)
1.4.0

Blocks unless or until the current thread's token is made available or -the specified duration has been reached (may wake spuriously).

- -

The semantics of this function are equivalent to park() except that the -thread will be blocked for roughly no longer than dur. This method -should not be used for precise timing due to anomalies such as -preemption or platform differences that may not cause the maximum -amount of time waited to be precisely dur long.

- -

See the module doc for more detail.

- -

Platform behavior

-

Platforms which do not support nanosecond precision for sleeping will have -dur rounded up to the nearest granularity of time they can sleep for.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/fn.park_timeout_ms.html b/doc/bitflags/__core/thread/fn.park_timeout_ms.html deleted file mode 100644 index ff00a017..00000000 --- a/doc/bitflags/__core/thread/fn.park_timeout_ms.html +++ /dev/null @@ -1,123 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::park_timeout_ms - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::thread::park_timeout_ms - - [−] - - [src]

-
pub fn park_timeout_ms(ms: u32)
1.0.0
Deprecated since 1.6.0

: replaced by std::thread::park_timeout

-

Blocks unless or until the current thread's token is made available or -the specified duration has been reached (may wake spuriously).

- -

The semantics of this function are equivalent to park() except that the -thread will be blocked for roughly no longer than ms. This method -should not be used for precise timing due to anomalies such as -preemption or platform differences that may not cause the maximum -amount of time waited to be precisely ms long.

- -

See the module doc for more detail.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/fn.sleep.html b/doc/bitflags/__core/thread/fn.sleep.html deleted file mode 100644 index 60ed93c9..00000000 --- a/doc/bitflags/__core/thread/fn.sleep.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::sleep - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::thread::sleep - - [−] - - [src]

-
pub fn sleep(dur: Duration)
1.4.0

Puts the current thread to sleep for the specified amount of time.

- -

The thread may sleep longer than the duration specified due to scheduling -specifics or platform-dependent functionality.

- -

Platform behavior

-

On Unix platforms this function will not return early due to a -signal being received or a spurious wakeup. Platforms which do not support -nanosecond precision for sleeping will have dur rounded up to the nearest -granularity of time they can sleep for.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/fn.sleep_ms.html b/doc/bitflags/__core/thread/fn.sleep_ms.html deleted file mode 100644 index 4a21874c..00000000 --- a/doc/bitflags/__core/thread/fn.sleep_ms.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::sleep_ms - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::thread::sleep_ms - - [−] - - [src]

-
pub fn sleep_ms(ms: u32)
1.0.0
Deprecated since 1.6.0

: replaced by std::thread::sleep

-

Puts the current thread to sleep for the specified amount of time.

- -

The thread may sleep longer than the duration specified due to scheduling -specifics or platform-dependent functionality. Note that on unix platforms -this function will not return early due to a signal being received or a -spurious wakeup.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/fn.spawn.html b/doc/bitflags/__core/thread/fn.spawn.html deleted file mode 100644 index b93cfa1f..00000000 --- a/doc/bitflags/__core/thread/fn.spawn.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::spawn - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::thread::spawn - - [−] - - [src]

-
pub fn spawn<F, T>(f: F) -> JoinHandle<T> where F: FnOnce() -> T + Send + 'static, T: Send + 'static
1.0.0

Spawns a new thread, returning a JoinHandle for it.

- -

The join handle will implicitly detach the child thread upon being -dropped. In this case, the child thread may outlive the parent (unless -the parent thread is the main thread; the whole process is terminated when -the main thread finishes.) Additionally, the join handle provides a join -method that can be used to join the child thread. If the child thread -panics, join will return an Err containing the argument given to -panic.

- -

Panics

-

Panics if the OS fails to create a thread; use Builder::spawn -to recover from such errors.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/fn.yield_now.html b/doc/bitflags/__core/thread/fn.yield_now.html deleted file mode 100644 index 95865d95..00000000 --- a/doc/bitflags/__core/thread/fn.yield_now.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::yield_now - Rust - - - - - - - - - - - - - - - - - -
-

Function bitflags::__core::thread::yield_now - - [−] - - [src]

-
pub fn yield_now()
1.0.0

Cooperatively gives up a timeslice to the OS scheduler.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/index.html b/doc/bitflags/__core/thread/index.html deleted file mode 100644 index ac97552c..00000000 --- a/doc/bitflags/__core/thread/index.html +++ /dev/null @@ -1,397 +0,0 @@ - - - - - - - - - - bitflags::__core::thread - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::thread - - [−] - - [src]

-

Native threads.

- -

The threading model

-

An executing Rust program consists of a collection of native OS threads, -each with their own stack and local state.

- -

Communication between threads can be done through -channels, Rust's message-passing -types, along with other forms of thread -synchronization and shared-memory data -structures. In particular, types that are guaranteed to be -threadsafe are easily shared between threads using the -atomically-reference-counted container, -Arc.

- -

Fatal logic errors in Rust cause thread panic, during which -a thread will unwind the stack, running destructors and freeing -owned resources. Thread panic is unrecoverable from within -the panicking thread (i.e. there is no 'try/catch' in Rust), but -the panic may optionally be detected from a different thread. If -the main thread panics, the application will exit with a non-zero -exit code.

- -

When the main thread of a Rust program terminates, the entire program shuts -down, even if other threads are still running. However, this module provides -convenient facilities for automatically waiting for the termination of a -child thread (i.e., join).

- -

The Thread type

-

Threads are represented via the Thread type, which you can -get in one of two ways:

- -
    -
  • By spawning a new thread, e.g. using the thread::spawn function.
    • -
  • By requesting the current thread, using the thread::current function.
    • -
- -

Threads can be named, and provide some built-in support for low-level -synchronization (described below).

- -

The thread::current() function is available even for threads not spawned -by the APIs of this module.

- -

Spawning a thread

-

A new thread can be spawned using the thread::spawn function:

- -
-use std::thread;
-
-thread::spawn(move || {
-    // some work here
-});
- -

In this example, the spawned thread is "detached" from the current -thread. This means that it can outlive its parent (the thread that spawned -it), unless this parent is the main thread.

- -

The parent thread can also wait on the completion of the child -thread; a call to spawn produces a JoinHandle, which provides -a join method for waiting:

- -
-use std::thread;
-
-let child = thread::spawn(move || {
-    // some work here
-});
-// some work here
-let res = child.join();
- -

The join method returns a Result containing Ok of the final -value produced by the child thread, or Err of the value given to -a call to panic! if the child panicked.

- -

Configuring threads

-

A new thread can be configured before it is spawned via the Builder type, -which currently allows you to set the name and stack size for the child thread:

- -
-use std::thread;
-
-thread::Builder::new().name("child1".to_string()).spawn(move || {
-    println!("Hello, world!");
-});
- -

Blocking support: park and unpark

-

Every thread is equipped with some basic low-level blocking support, via the -park and unpark functions.

- -

Conceptually, each Thread handle has an associated token, which is -initially not present:

- -
    -

  • The thread::park() function blocks the current thread unless or until -the token is available for its thread handle, at which point it atomically -consumes the token. It may also return spuriously, without consuming the -token. thread::park_timeout() does the same, but allows specifying a -maximum time to block the thread for.

    • -

  • The unpark() method on a Thread atomically makes the token available -if it wasn't already.

    • -
- -

In other words, each Thread acts a bit like a semaphore with initial count -0, except that the semaphore is saturating (the count cannot go above 1), -and can return spuriously.

- -

The API is typically used by acquiring a handle to the current thread, -placing that handle in a shared data structure so that other threads can -find it, and then parking. When some desired condition is met, another -thread calls unpark on the handle.

- -

The motivation for this design is twofold:

- -
    -

  • It avoids the need to allocate mutexes and condvars when building new -synchronization primitives; the threads already provide basic blocking/signaling.

    • -

  • It can be implemented very efficiently on many platforms.

    • -
- -

Thread-local storage

-

This module also provides an implementation of thread local storage for Rust -programs. Thread local storage is a method of storing data into a global -variable which each thread in the program will have its own copy of. -Threads do not share this data, so accesses do not need to be synchronized.

- -

At a high level, this module provides two variants of storage:

- -
    -

  • Owned thread-local storage. This is a type of thread local key which -owns the value that it contains, and will destroy the value when the -thread exits. This variant is created with the thread_local! macro and -can contain any value which is 'static (no borrowed pointers).

    • -

  • Scoped thread-local storage. This type of key is used to store a reference -to a value into local storage temporarily for the scope of a function -call. There are no restrictions on what types of values can be placed -into this key.

    • -
- -

Both forms of thread local storage provide an accessor function, with, -which will yield a shared reference to the value to the specified -closure. Thread-local keys only allow shared access to values as there is no -way to guarantee uniqueness if a mutable borrow was allowed. Most values -will want to make use of some form of interior mutability through the -Cell or RefCell types.

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Builder -

Thread configuration. Provides detailed control over the properties -and behavior of new threads.

-
JoinHandle -

An owned permission to join on a thread (block on its termination).

-
LocalKey -

A thread local storage key which owns its contents.

-
Thread -

A handle to a thread.

-
Key - [Unstable] -
Key - [Unstable] -
KeyInner - [Unstable] -
ScopedKey - [Deprecated] [Unstable]

Type representing a thread local storage key corresponding to a reference -to the type parameter T.

-

Enums

- - - - -
LocalKeyState - [Unstable]

Indicator of the state of a thread local storage key.

-

Functions

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
current -

Gets a handle to the thread that invokes it.

-
panicking -

Determines whether the current thread is unwinding because of panic.

-
park -

Blocks unless or until the current thread's token is made available.

-
park_timeout -

Blocks unless or until the current thread's token is made available or -the specified duration has been reached (may wake spuriously).

-
park_timeout_ms - [Deprecated]

Blocks unless or until the current thread's token is made available or -the specified duration has been reached (may wake spuriously).

-
sleep -

Puts the current thread to sleep for the specified amount of time.

-
sleep_ms - [Deprecated]

Puts the current thread to sleep for the specified amount of time.

-
spawn -

Spawns a new thread, returning a JoinHandle for it.

-
yield_now -

Cooperatively gives up a timeslice to the OS scheduler.

-

Type Definitions

- - - - -
Result - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/sidebar-items.js b/doc/bitflags/__core/thread/sidebar-items.js deleted file mode 100644 index 63f030de..00000000 --- a/doc/bitflags/__core/thread/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["LocalKeyState","Indicator of the state of a thread local storage key."]],"fn":[["current","Gets a handle to the thread that invokes it."],["panicking","Determines whether the current thread is unwinding because of panic."],["park","Blocks unless or until the current thread's token is made available."],["park_timeout","Blocks unless or until the current thread's token is made available or the specified duration has been reached (may wake spuriously)."],["park_timeout_ms","Blocks unless or until the current thread's token is made available or the specified duration has been reached (may wake spuriously)."],["sleep","Puts the current thread to sleep for the specified amount of time."],["sleep_ms","Puts the current thread to sleep for the specified amount of time."],["spawn","Spawns a new thread, returning a `JoinHandle` for it."],["yield_now","Cooperatively gives up a timeslice to the OS scheduler."]],"struct":[["Builder","Thread configuration. Provides detailed control over the properties and behavior of new threads."],["JoinHandle","An owned permission to join on a thread (block on its termination)."],["Key",""],["Key",""],["KeyInner",""],["LocalKey","A thread local storage key which owns its contents."],["ScopedKey","Type representing a thread local storage key corresponding to a reference to the type parameter `T`."],["Thread","A handle to a thread."]],"type":[["Result",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/thread/struct.Builder.html b/doc/bitflags/__core/thread/struct.Builder.html deleted file mode 100644 index cb79b237..00000000 --- a/doc/bitflags/__core/thread/struct.Builder.html +++ /dev/null @@ -1,136 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::Builder - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::thread::Builder - - [−] - - [src]

-
pub struct Builder {
-    // some fields omitted
-}
1.0.0

Thread configuration. Provides detailed control over the properties -and behavior of new threads.

-

Methods

impl Builder

fn new() -> Builder

-

Generates the base configuration for spawning a thread, from which -configuration methods can be chained.

-

fn name(self, name: String) -> Builder

-

Names the thread-to-be. Currently the name is used for identification -only in panic messages.

-

fn stack_size(self, size: usize) -> Builder

-

Sets the size of the stack for the new thread.

-

fn spawn<F, T>(self, f: F) -> Result<JoinHandle<T>, Error> where T: Send + 'static, F: FnOnce() -> T + Send + 'static

-

Spawns a new thread, and returns a join handle for it.

- -

The child thread may outlive the parent (unless the parent thread -is the main thread; the whole process is terminated when the main -thread finishes). The join handle can be used to block on -termination of the child thread, including recovering its panics.

- -

Errors

-

Unlike the spawn free function, this method yields an -io::Result to capture any failure to create the thread at -the OS level.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/struct.JoinHandle.html b/doc/bitflags/__core/thread/struct.JoinHandle.html deleted file mode 100644 index a2940dda..00000000 --- a/doc/bitflags/__core/thread/struct.JoinHandle.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::JoinHandle - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::thread::JoinHandle - - [−] - - [src]

-
pub struct JoinHandle<T>(_);
1.0.0

An owned permission to join on a thread (block on its termination).

- -

A JoinHandle detaches the child thread when it is dropped.

- -

Due to platform restrictions, it is not possible to Clone this -handle: the ability to join a child thread is a uniquely-owned -permission.

-

Methods

impl<T> JoinHandle<T>

fn thread(&self) -> &Thread

-

Extracts a handle to the underlying thread

-

fn join(self) -> Result<T, Box<Any + 'static + Send>>

-

Waits for the associated thread to finish.

- -

If the child thread panics, Err is returned with the parameter given -to panic.

-

Trait Implementations

impl<T> JoinHandleExt for JoinHandle<T>1.9.0

fn as_pthread_t(&self) -> usize

-

fn into_pthread_t(self) -> usize

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/struct.Key.html b/doc/bitflags/__core/thread/struct.Key.html deleted file mode 100644 index b864415b..00000000 --- a/doc/bitflags/__core/thread/struct.Key.html +++ /dev/null @@ -1,116 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::Key - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::thread::Key - - [−] - - [src]

-
pub struct Key<T> {
-    // some fields omitted
-}
Unstable (thread_local_internals)

Methods

impl<T> Key<T> where T: 'static

const fn new() -> Key<T>

-
Unstable (thread_local_internals)

fn get(&'static self) -> Option<&'static UnsafeCell<Option<T>>>

-
Unstable (thread_local_internals)

Trait Implementations

impl<T> Sync for Key<T>

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/struct.KeyInner.html b/doc/bitflags/__core/thread/struct.KeyInner.html deleted file mode 100644 index 22366796..00000000 --- a/doc/bitflags/__core/thread/struct.KeyInner.html +++ /dev/null @@ -1,117 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::KeyInner - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::thread::KeyInner - - [−] - - [src]

-
pub struct KeyInner<T> {
-    // some fields omitted
-}
Unstable (thread_local_internals)

Methods

impl<T> KeyInner<T>

const fn new() -> KeyInner<T>

-
Unstable (thread_local_internals)

unsafe fn set(&self, ptr: *mut T)

-
Unstable (thread_local_internals)

unsafe fn get(&self) -> *mut T

-
Unstable (thread_local_internals)

Trait Implementations

impl<T> Sync for KeyInner<T>

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/struct.LocalKey.html b/doc/bitflags/__core/thread/struct.LocalKey.html deleted file mode 100644 index c85d09d2..00000000 --- a/doc/bitflags/__core/thread/struct.LocalKey.html +++ /dev/null @@ -1,205 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::LocalKey - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::thread::LocalKey - - [−] - - [src]

-
pub struct LocalKey<T> where T: 'static {
-    // some fields omitted
-}
1.0.0

A thread local storage key which owns its contents.

- -

This key uses the fastest possible implementation available to it for the -target platform. It is instantiated with the thread_local! macro and the -primary method is the with method.

- -

The with method yields a reference to the contained value which cannot be -sent across threads or escape the given closure.

- -

Initialization and Destruction

-

Initialization is dynamically performed on the first call to with() -within a thread, and values support destructors which will be run when a -thread exits.

- -

Examples

-
-use std::cell::RefCell;
-use std::thread;
-
-thread_local!(static FOO: RefCell<u32> = RefCell::new(1));
-
-FOO.with(|f| {
-    assert_eq!(*f.borrow(), 1);
-    *f.borrow_mut() = 2;
-});
-
-// each thread starts out with the initial value of 1
-thread::spawn(move|| {
-    FOO.with(|f| {
-        assert_eq!(*f.borrow(), 1);
-        *f.borrow_mut() = 3;
-    });
-});
-
-// we retain our original value of 2 despite the child thread
-FOO.with(|f| {
-    assert_eq!(*f.borrow(), 2);
-});
- -

Platform-specific behavior

-

Note that a "best effort" is made to ensure that destructors for types -stored in thread local storage are run, but not all platforms can guarantee -that destructors will be run for all types in thread local storage. For -example, there are a number of known caveats where destructors are not run:

- -
    -
  1. On Unix systems when pthread-based TLS is being used, destructors will -not be run for TLS values on the main thread when it exits. Note that the -application will exit immediately after the main thread exits as well.
    2. -
  2. On all platforms it's possible for TLS to re-initialize other TLS slots -during destruction. Some platforms ensure that this cannot happen -infinitely by preventing re-initialization of any slot that has been -destroyed, but not all platforms have this guard. Those platforms that do -not guard typically have a synthetic limit after which point no more -destructors are run.
    3. -
  3. On OSX, initializing TLS during destruction of other TLS slots can -sometimes cancel all destructors for the current thread, whether or not -the slots have already had their destructors run or not.
    4. -
-

Methods

impl<T> LocalKey<T> where T: 'static

fn with<F, R>(&'static self, f: F) -> R where F: FnOnce(&T) -> R

-

Acquires a reference to the value in this TLS key.

- -

This will lazily initialize the value if this thread has not referenced -this key yet.

- -

Panics

-

This function will panic!() if the key currently has its -destructor running, and it may panic if the destructor has -previously been run for this thread.

-

fn state(&'static self) -> LocalKeyState

-
Unstable (thread_local_state)

: state querying was recently added

-

Query the current state of this key.

- -

A key is initially in the Uninitialized state whenever a thread -starts. It will remain in this state up until the first call to with -within a thread has run the initialization expression successfully.

- -

Once the initialization expression succeeds, the key transitions to the -Valid state which will guarantee that future calls to with will -succeed within the thread.

- -

When a thread exits, each key will be destroyed in turn, and as keys are -destroyed they will enter the Destroyed state just before the -destructor starts to run. Keys may remain in the Destroyed state after -destruction has completed. Keys without destructors (e.g. with types -that are Copy), may never enter the Destroyed state.

- -

Keys in the Uninitialized state can be accessed so long as the -initialization does not panic. Keys in the Valid state are guaranteed -to be able to be accessed. Keys in the Destroyed state will panic on -any call to with.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/struct.ScopedKey.html b/doc/bitflags/__core/thread/struct.ScopedKey.html deleted file mode 100644 index 43c5f958..00000000 --- a/doc/bitflags/__core/thread/struct.ScopedKey.html +++ /dev/null @@ -1,178 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::ScopedKey - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::thread::ScopedKey - - [−] - - [src]

-
pub struct ScopedKey<T> where T: 'static {
-    // some fields omitted
-}
Deprecated since 1.8.0

: hasn't proven itself over LocalKey

-
Unstable (scoped_tls)

: hasn't proven itself over LocalKey

-

Type representing a thread local storage key corresponding to a reference -to the type parameter T.

- -

Keys are statically allocated and can contain a reference to an instance of -type T scoped to a particular lifetime. Keys provides two methods, set -and with, both of which currently use closures to control the scope of -their contents.

-

Methods

impl<T> ScopedKey<T>

fn set<R, F>(&'static self, t: &T, cb: F) -> R where F: FnOnce() -> R

-
Deprecated since 1.8.0

: hasn't proven itself over LocalKey

-
Unstable (scoped_tls)

: hasn't proven itself over LocalKey

-

Inserts a value into this scoped thread local storage slot for a -duration of a closure.

- -

While cb is running, the value t will be returned by get unless -this function is called recursively inside of cb.

- -

Upon return, this function will restore the previous value, if any -was available.

- -

Examples

-
-#![feature(scoped_tls)]
-
-scoped_thread_local!(static FOO: u32);
-
-FOO.set(&100, || {
-    let val = FOO.with(|v| *v);
-    assert_eq!(val, 100);
-
-    // set can be called recursively
-    FOO.set(&101, || {
-        // ...
-    });
-
-    // Recursive calls restore the previous value.
-    let val = FOO.with(|v| *v);
-    assert_eq!(val, 100);
-});
-

fn with<R, F>(&'static self, cb: F) -> R where F: FnOnce(&T) -> R

-
Deprecated since 1.8.0

: hasn't proven itself over LocalKey

-
Unstable (scoped_tls)

: hasn't proven itself over LocalKey

-

Gets a value out of this scoped variable.

- -

This function takes a closure which receives the value of this -variable.

- -

Panics

-

This function will panic if set has not previously been called.

- -

Examples

-
-#![feature(scoped_tls)]
-
-scoped_thread_local!(static FOO: u32);
-
-FOO.with(|slot| {
-    // work with `slot`
-});
-

fn is_set(&'static self) -> bool

-
Deprecated since 1.8.0

: hasn't proven itself over LocalKey

-
Unstable (scoped_tls)

: hasn't proven itself over LocalKey

-

Test whether this TLS key has been set for the current thread.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/struct.Thread.html b/doc/bitflags/__core/thread/struct.Thread.html deleted file mode 100644 index 2e5390cc..00000000 --- a/doc/bitflags/__core/thread/struct.Thread.html +++ /dev/null @@ -1,124 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::Thread - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::thread::Thread - - [−] - - [src]

-
pub struct Thread {
-    // some fields omitted
-}
1.0.0

A handle to a thread.

-

Methods

impl Thread

fn unpark(&self)

-

Atomically makes the handle's token available if it is not already.

- -

See the module doc for more detail.

-

fn name(&self) -> Option<&str>

-

Gets the thread's name.

-

Trait Implementations

impl Debug for Thread

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl Clone for Thread

fn clone(&self) -> Thread

-

fn clone_from(&mut self, source: &Self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/thread/type.Result.html b/doc/bitflags/__core/thread/type.Result.html deleted file mode 100644 index 095d625b..00000000 --- a/doc/bitflags/__core/thread/type.Result.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::thread::Result - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::thread::Result - - [−] - - [src]

-
type Result<T> = Result<T, Box<Any + 'static + Send>>;
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/time/constant.UNIX_EPOCH.html b/doc/bitflags/__core/time/constant.UNIX_EPOCH.html deleted file mode 100644 index 6ebdf9a9..00000000 --- a/doc/bitflags/__core/time/constant.UNIX_EPOCH.html +++ /dev/null @@ -1,120 +0,0 @@ - - - - - - - - - - bitflags::__core::time::UNIX_EPOCH - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::time::UNIX_EPOCH - - [−] - - [src]

-
pub const UNIX_EPOCH: SystemTime = SystemTime(time::UNIX_EPOCH)

An anchor in time which can be used to create new SystemTime instances or -learn about where in time a SystemTime lies.

- -

This constant is defined to be "1970-01-01 00:00:00 UTC" on all systems with -respect to the system clock. Using duration_since on an existing -SystemTime instance can tell how far away from this point in time a -measurement lies, and using UNIX_EPOCH + duration can be used to create a -SystemTime instance to represent another fixed point in time.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/time/index.html b/doc/bitflags/__core/time/index.html deleted file mode 100644 index 62aa0b5c..00000000 --- a/doc/bitflags/__core/time/index.html +++ /dev/null @@ -1,164 +0,0 @@ - - - - - - - - - - bitflags::__core::time - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::time - - [−] - - [src]

-

Temporal quantification.

- -

Example:

- -
-use std::time::Duration;
-
-let five_seconds = Duration::new(5, 0);
-// both declarations are equivalent
-assert_eq!(Duration::new(5, 0), Duration::from_secs(5));
-

Structs

- - - - - - - - - - - - - - - - -
Duration -

A duration type to represent a span of time, typically used for system -timeouts.

-
Instant -

A measurement of a monotonically increasing clock. - Opaque and useful only with Duration.

-
SystemTime -

A measurement of the system clock, useful for talking to -external entities like the file system or other processes.

-
SystemTimeError -

An error returned from the duration_since method on SystemTime, -used to learn about why how far in the opposite direction a timestamp lies.

-

Constants

- - - - -
UNIX_EPOCH -

An anchor in time which can be used to create new SystemTime instances or -learn about where in time a SystemTime lies.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/time/sidebar-items.js b/doc/bitflags/__core/time/sidebar-items.js deleted file mode 100644 index 9b891e05..00000000 --- a/doc/bitflags/__core/time/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["UNIX_EPOCH","An anchor in time which can be used to create new `SystemTime` instances or learn about where in time a `SystemTime` lies."]],"struct":[["Duration","A duration type to represent a span of time, typically used for system timeouts."],["Instant","A measurement of a monotonically increasing clock. Opaque and useful only with `Duration`."],["SystemTime","A measurement of the system clock, useful for talking to external entities like the file system or other processes."],["SystemTimeError","An error returned from the `duration_since` method on `SystemTime`, used to learn about why how far in the opposite direction a timestamp lies."]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/time/struct.Duration.html b/doc/bitflags/__core/time/struct.Duration.html deleted file mode 100644 index e41ce97c..00000000 --- a/doc/bitflags/__core/time/struct.Duration.html +++ /dev/null @@ -1,182 +0,0 @@ - - - - - - - - - - bitflags::__core::time::Duration - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::time::Duration - - [−] - - [src]

-
pub struct Duration {
-    // some fields omitted
-}
1.3.0

A duration type to represent a span of time, typically used for system -timeouts.

- -

Each duration is composed of a number of seconds and nanosecond precision. -APIs binding a system timeout will typically round up the nanosecond -precision if the underlying system does not support that level of precision.

- -

Durations implement many common traits, including Add, Sub, and other -ops traits. Currently a duration may only be inspected for its number of -seconds and its nanosecond precision.

- -

Examples

-
-use std::time::Duration;
-
-let five_seconds = Duration::new(5, 0);
-let five_seconds_and_five_nanos = five_seconds + Duration::new(0, 5);
-
-assert_eq!(five_seconds_and_five_nanos.as_secs(), 5);
-assert_eq!(five_seconds_and_five_nanos.subsec_nanos(), 5);
-
-let ten_millis = Duration::from_millis(10);
-

Methods

impl Duration

fn new(secs: u64, nanos: u32) -> Duration

-

Creates a new Duration from the specified number of seconds and -additional nanosecond precision.

- -

If the nanoseconds is greater than 1 billion (the number of nanoseconds -in a second), then it will carry over into the seconds provided.

-

fn from_secs(secs: u64) -> Duration

-

Creates a new Duration from the specified number of seconds.

-

fn from_millis(millis: u64) -> Duration

-

Creates a new Duration from the specified number of milliseconds.

-

fn as_secs(&self) -> u64

-

Returns the number of whole seconds represented by this duration.

- -

The extra precision represented by this duration is ignored (e.g. extra -nanoseconds are not represented in the returned value).

-

fn subsec_nanos(&self) -> u32

-

Returns the nanosecond precision represented by this duration.

- -

This method does not return the length of the duration when -represented by nanoseconds. The returned number always represents a -fractional portion of a second (e.g. it is less than one billion).

-

Trait Implementations

impl Add<Duration> for Duration

type Output = Duration

-

fn add(self, rhs: Duration) -> Duration

-

impl AddAssign<Duration> for Duration1.9.0

fn add_assign(&mut self, rhs: Duration)

-

impl Sub<Duration> for Duration

type Output = Duration

-

fn sub(self, rhs: Duration) -> Duration

-

impl SubAssign<Duration> for Duration1.9.0

fn sub_assign(&mut self, rhs: Duration)

-

impl Mul<u32> for Duration

type Output = Duration

-

fn mul(self, rhs: u32) -> Duration

-

impl MulAssign<u32> for Duration1.9.0

fn mul_assign(&mut self, rhs: u32)

-

impl Div<u32> for Duration

type Output = Duration

-

fn div(self, rhs: u32) -> Duration

-

impl DivAssign<u32> for Duration1.9.0

fn div_assign(&mut self, rhs: u32)

-

Derived Implementations

impl Hash for Duration

fn hash<__H>(&self, __arg_0: &mut __H) where __H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher

-

impl Debug for Duration

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl Ord for Duration

fn cmp(&self, __arg_0: &Duration) -> Ordering

-

impl PartialOrd<Duration> for Duration

fn partial_cmp(&self, __arg_0: &Duration) -> Option<Ordering>

-

fn lt(&self, __arg_0: &Duration) -> bool

-

fn le(&self, __arg_0: &Duration) -> bool

-

fn gt(&self, __arg_0: &Duration) -> bool

-

fn ge(&self, __arg_0: &Duration) -> bool

-

impl Eq for Duration

impl PartialEq<Duration> for Duration

fn eq(&self, __arg_0: &Duration) -> bool

-

fn ne(&self, __arg_0: &Duration) -> bool

-

impl Copy for Duration

impl Clone for Duration

fn clone(&self) -> Duration

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/time/struct.Instant.html b/doc/bitflags/__core/time/struct.Instant.html deleted file mode 100644 index a1b2fec8..00000000 --- a/doc/bitflags/__core/time/struct.Instant.html +++ /dev/null @@ -1,184 +0,0 @@ - - - - - - - - - - bitflags::__core::time::Instant - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::time::Instant - - [−] - - [src]

-
pub struct Instant(_);
1.8.0

A measurement of a monotonically increasing clock. - Opaque and useful only with Duration.

- -

Instants are always guaranteed to be greater than any previously measured -instant when created, and are often useful for tasks such as measuring -benchmarks or timing how long an operation takes.

- -

Note, however, that instants are not guaranteed to be steady. In other -words, each tick of the underlying clock may not be the same length (e.g. -some seconds may be longer than others). An instant may jump forwards or -experience time dilation (slow down or speed up), but it will never go -backwards.

- -

Instants are opaque types that can only be compared to one another. There is -no method to get "the number of seconds" from an instant. Instead, it only -allows measuring the duration between two instants (or comparing two -instants).

- -

Example:

- -
-use std::time::{Duration, Instant};
-use std::thread::sleep;
-
-fn main() {
-   let now = Instant::now();
-
-   // we sleep for 2 seconds
-   sleep(Duration::new(2, 0));
-   // it prints '2'
-   println!("{}", now.elapsed().as_secs());
-}
-

Methods

impl Instant

fn now() -> Instant

-

Returns an instant corresponding to "now".

-

fn duration_since(&self, earlier: Instant) -> Duration

-

Returns the amount of time elapsed from another instant to this one.

- -

Panics

-

This function will panic if earlier is later than self, which should -only be possible if earlier was created after self. Because -Instant is monotonic, the only time that this should happen should be -a bug.

-

fn duration_from_earlier(&self, earlier: Instant) -> Duration

-
Deprecated since 1.8.0

: renamed to duration_since

-
Unstable (time2_old)

: renamed to duration_since

-

Deprecated, renamed to duration_since

-

fn elapsed(&self) -> Duration

-

Returns the amount of time elapsed since this instant was created.

- -

Panics

-

This function may panic if the current time is earlier than this -instant, which is something that can happen if an Instant is -produced synthetically.

-

Trait Implementations

impl Add<Duration> for Instant

type Output = Instant

-

fn add(self, other: Duration) -> Instant

-

impl AddAssign<Duration> for Instant1.9.0

fn add_assign(&mut self, other: Duration)

-

impl Sub<Duration> for Instant

type Output = Instant

-

fn sub(self, other: Duration) -> Instant

-

impl SubAssign<Duration> for Instant1.9.0

fn sub_assign(&mut self, other: Duration)

-

impl Sub<Instant> for Instant

type Output = Duration

-

fn sub(self, other: Instant) -> Duration

-

impl Debug for Instant

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl Ord for Instant

fn cmp(&self, __arg_0: &Instant) -> Ordering

-

impl PartialOrd<Instant> for Instant

fn partial_cmp(&self, __arg_0: &Instant) -> Option<Ordering>

-

fn lt(&self, __arg_0: &Instant) -> bool

-

fn le(&self, __arg_0: &Instant) -> bool

-

fn gt(&self, __arg_0: &Instant) -> bool

-

fn ge(&self, __arg_0: &Instant) -> bool

-

impl Eq for Instant

impl PartialEq<Instant> for Instant

fn eq(&self, __arg_0: &Instant) -> bool

-

fn ne(&self, __arg_0: &Instant) -> bool

-

impl Clone for Instant

fn clone(&self) -> Instant

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Copy for Instant

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/time/struct.SystemTime.html b/doc/bitflags/__core/time/struct.SystemTime.html deleted file mode 100644 index 90a09347..00000000 --- a/doc/bitflags/__core/time/struct.SystemTime.html +++ /dev/null @@ -1,200 +0,0 @@ - - - - - - - - - - bitflags::__core::time::SystemTime - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::time::SystemTime - - [−] - - [src]

-
pub struct SystemTime(_);
1.8.0

A measurement of the system clock, useful for talking to -external entities like the file system or other processes.

- -

Distinct from the Instant type, this time measurement is not -monotonic. This means that you can save a file to the file system, then -save another file to the file system, and the second file has a -SystemTime measurement earlier than the second. In other words, an -operation that happens after another operation in real time may have an -earlier SystemTime!

- -

Consequently, comparing two SystemTime instances to learn about the -duration between them returns a Result instead of an infallible Duration -to indicate that this sort of time drift may happen and needs to be handled.

- -

Although a SystemTime cannot be directly inspected, the UNIX_EPOCH -constant is provided in this module as an anchor in time to learn -information about a SystemTime. By calculating the duration from this -fixed point in time, a SystemTime can be converted to a human-readable time, -or perhaps some other string representation.

- -

Example:

- -
-use std::time::{Duration, SystemTime};
-use std::thread::sleep;
-
-fn main() {
-   let now = SystemTime::now();
-
-   // we sleep for 2 seconds
-   sleep(Duration::new(2, 0));
-   match now.elapsed() {
-       Ok(elapsed) => {
-           // it prints '2'
-           println!("{}", elapsed.as_secs());
-       }
-       Err(e) => {
-           // an error occured!
-           println!("Error: {:?}", e);
-       }
-   }
-}
-

Methods

impl SystemTime

fn now() -> SystemTime

-

Returns the system time corresponding to "now".

-

fn duration_since(&self, earlier: SystemTime) -> Result<Duration, SystemTimeError>

-

Returns the amount of time elapsed from an earlier point in time.

- -

This function may fail because measurements taken earlier are not -guaranteed to always be before later measurements (due to anomalies such -as the system clock being adjusted either forwards or backwards).

- -

If successful, Ok(Duration) is returned where the duration represents -the amount of time elapsed from the specified measurement to this one.

- -

Returns an Err if earlier is later than self, and the error -contains how far from self the time is.

-

fn duration_from_earlier(&self, earlier: SystemTime) -> Result<Duration, SystemTimeError>

-
Deprecated since 1.8.0

: renamed to duration_since

-
Unstable (time2_old)

: renamed to duration_since

-

Deprecated, renamed to duration_since

-

fn elapsed(&self) -> Result<Duration, SystemTimeError>

-

Returns the amount of time elapsed since this system time was created.

- -

This function may fail as the underlying system clock is susceptible to -drift and updates (e.g. the system clock could go backwards), so this -function may not always succeed. If successful, Ok(duration) is -returned where the duration represents the amount of time elapsed from -this time measurement to the current time.

- -

Returns an Err if self is later than the current system time, and -the error contains how far from the current system time self is.

-

Trait Implementations

impl Add<Duration> for SystemTime

type Output = SystemTime

-

fn add(self, dur: Duration) -> SystemTime

-

impl AddAssign<Duration> for SystemTime1.9.0

fn add_assign(&mut self, other: Duration)

-

impl Sub<Duration> for SystemTime

type Output = SystemTime

-

fn sub(self, dur: Duration) -> SystemTime

-

impl SubAssign<Duration> for SystemTime1.9.0

fn sub_assign(&mut self, other: Duration)

-

impl Debug for SystemTime

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl Ord for SystemTime

fn cmp(&self, __arg_0: &SystemTime) -> Ordering

-

impl PartialOrd<SystemTime> for SystemTime

fn partial_cmp(&self, __arg_0: &SystemTime) -> Option<Ordering>

-

fn lt(&self, __arg_0: &SystemTime) -> bool

-

fn le(&self, __arg_0: &SystemTime) -> bool

-

fn gt(&self, __arg_0: &SystemTime) -> bool

-

fn ge(&self, __arg_0: &SystemTime) -> bool

-

impl Eq for SystemTime

impl PartialEq<SystemTime> for SystemTime

fn eq(&self, __arg_0: &SystemTime) -> bool

-

fn ne(&self, __arg_0: &SystemTime) -> bool

-

impl Clone for SystemTime

fn clone(&self) -> SystemTime

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Copy for SystemTime

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/time/struct.SystemTimeError.html b/doc/bitflags/__core/time/struct.SystemTimeError.html deleted file mode 100644 index 759c85b4..00000000 --- a/doc/bitflags/__core/time/struct.SystemTimeError.html +++ /dev/null @@ -1,127 +0,0 @@ - - - - - - - - - - bitflags::__core::time::SystemTimeError - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::time::SystemTimeError - - [−] - - [src]

-
pub struct SystemTimeError(_);
1.8.0

An error returned from the duration_since method on SystemTime, -used to learn about why how far in the opposite direction a timestamp lies.

-

Methods

impl SystemTimeError

fn duration(&self) -> Duration

-

Returns the positive duration which represents how far forward the -second system time was from the first.

- -

A SystemTimeError is returned from the duration_since -operation whenever the second system time represents a point later -in time than the self of the method call.

-

Trait Implementations

impl Error for SystemTimeError

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>1.0.0

-

impl Display for SystemTimeError

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

Derived Implementations

impl Debug for SystemTimeError

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

-

impl Clone for SystemTimeError

fn clone(&self) -> SystemTimeError

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/u16/constant.MAX.html b/doc/bitflags/__core/u16/constant.MAX.html deleted file mode 100644 index df0f0094..00000000 --- a/doc/bitflags/__core/u16/constant.MAX.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::u16::MAX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::u16::MAX - - [−] - - [src]

-
pub const MAX: u16 = !0 as u16
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/u16/constant.MIN.html b/doc/bitflags/__core/u16/constant.MIN.html deleted file mode 100644 index 2de3cd45..00000000 --- a/doc/bitflags/__core/u16/constant.MIN.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::u16::MIN - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::u16::MIN - - [−] - - [src]

-
pub const MIN: u16 = 0 as u16
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/u16/index.html b/doc/bitflags/__core/u16/index.html deleted file mode 100644 index bbe46c57..00000000 --- a/doc/bitflags/__core/u16/index.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::u16 - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::u16 - - [−] - - [src]

-

The 16-bit unsigned integer type.

- -

See also the u16 primitive type.

-

Constants

- - - - - - - - -
MAX - -
MIN - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/u16/sidebar-items.js b/doc/bitflags/__core/u16/sidebar-items.js deleted file mode 100644 index 147ce9bf..00000000 --- a/doc/bitflags/__core/u16/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["MAX",""],["MIN",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/u32/constant.MAX.html b/doc/bitflags/__core/u32/constant.MAX.html deleted file mode 100644 index c7459152..00000000 --- a/doc/bitflags/__core/u32/constant.MAX.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::u32::MAX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::u32::MAX - - [−] - - [src]

-
pub const MAX: u32 = !0 as u32
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/u32/constant.MIN.html b/doc/bitflags/__core/u32/constant.MIN.html deleted file mode 100644 index 20482034..00000000 --- a/doc/bitflags/__core/u32/constant.MIN.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::u32::MIN - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::u32::MIN - - [−] - - [src]

-
pub const MIN: u32 = 0 as u32
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/u32/index.html b/doc/bitflags/__core/u32/index.html deleted file mode 100644 index f64f1d1e..00000000 --- a/doc/bitflags/__core/u32/index.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::u32 - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::u32 - - [−] - - [src]

-

The 32-bit unsigned integer type.

- -

See also the u32 primitive type.

-

Constants

- - - - - - - - -
MAX - -
MIN - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/u32/sidebar-items.js b/doc/bitflags/__core/u32/sidebar-items.js deleted file mode 100644 index 147ce9bf..00000000 --- a/doc/bitflags/__core/u32/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["MAX",""],["MIN",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/u64/constant.MAX.html b/doc/bitflags/__core/u64/constant.MAX.html deleted file mode 100644 index 7ddd7e90..00000000 --- a/doc/bitflags/__core/u64/constant.MAX.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::u64::MAX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::u64::MAX - - [−] - - [src]

-
pub const MAX: u64 = !0 as u64
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/u64/constant.MIN.html b/doc/bitflags/__core/u64/constant.MIN.html deleted file mode 100644 index 1422c51d..00000000 --- a/doc/bitflags/__core/u64/constant.MIN.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::u64::MIN - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::u64::MIN - - [−] - - [src]

-
pub const MIN: u64 = 0 as u64
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/u64/index.html b/doc/bitflags/__core/u64/index.html deleted file mode 100644 index 7017fc0b..00000000 --- a/doc/bitflags/__core/u64/index.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::u64 - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::u64 - - [−] - - [src]

-

The 64-bit unsigned integer type.

- -

See also the u64 primitive type.

-

Constants

- - - - - - - - -
MAX - -
MIN - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/u64/sidebar-items.js b/doc/bitflags/__core/u64/sidebar-items.js deleted file mode 100644 index 147ce9bf..00000000 --- a/doc/bitflags/__core/u64/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["MAX",""],["MIN",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/u8/constant.MAX.html b/doc/bitflags/__core/u8/constant.MAX.html deleted file mode 100644 index 6b4910ae..00000000 --- a/doc/bitflags/__core/u8/constant.MAX.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::u8::MAX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::u8::MAX - - [−] - - [src]

-
pub const MAX: u8 = !0 as u8
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/u8/constant.MIN.html b/doc/bitflags/__core/u8/constant.MIN.html deleted file mode 100644 index 09f87c5d..00000000 --- a/doc/bitflags/__core/u8/constant.MIN.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::u8::MIN - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::u8::MIN - - [−] - - [src]

-
pub const MIN: u8 = 0 as u8
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/u8/index.html b/doc/bitflags/__core/u8/index.html deleted file mode 100644 index 34695f3c..00000000 --- a/doc/bitflags/__core/u8/index.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::u8 - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::u8 - - [−] - - [src]

-

The 8-bit unsigned integer type.

- -

See also the u8 primitive type.

-

Constants

- - - - - - - - -
MAX - -
MIN - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/u8/sidebar-items.js b/doc/bitflags/__core/u8/sidebar-items.js deleted file mode 100644 index 147ce9bf..00000000 --- a/doc/bitflags/__core/u8/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["MAX",""],["MIN",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/usize/constant.MAX.html b/doc/bitflags/__core/usize/constant.MAX.html deleted file mode 100644 index 0344f207..00000000 --- a/doc/bitflags/__core/usize/constant.MAX.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::usize::MAX - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::usize::MAX - - [−] - - [src]

-
pub const MAX: usize = !0 as usize
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/usize/constant.MIN.html b/doc/bitflags/__core/usize/constant.MIN.html deleted file mode 100644 index aee7bf5e..00000000 --- a/doc/bitflags/__core/usize/constant.MIN.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - bitflags::__core::usize::MIN - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::__core::usize::MIN - - [−] - - [src]

-
pub const MIN: usize = 0 as usize
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/usize/index.html b/doc/bitflags/__core/usize/index.html deleted file mode 100644 index 155eab2f..00000000 --- a/doc/bitflags/__core/usize/index.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags::__core::usize - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::usize - - [−] - - [src]

-

The pointer-sized unsigned integer type.

- -

See also the usize primitive type.

-

Constants

- - - - - - - - -
MAX - -
MIN - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/usize/sidebar-items.js b/doc/bitflags/__core/usize/sidebar-items.js deleted file mode 100644 index 147ce9bf..00000000 --- a/doc/bitflags/__core/usize/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["MAX",""],["MIN",""]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/vec/index.html b/doc/bitflags/__core/vec/index.html deleted file mode 100644 index ed753b9b..00000000 --- a/doc/bitflags/__core/vec/index.html +++ /dev/null @@ -1,176 +0,0 @@ - - - - - - - - - - bitflags::__core::vec - Rust - - - - - - - - - - - - - - - - - -
-

Module bitflags::__core::vec - - [−] - - [src]

-

A contiguous growable array type with heap-allocated contents, written -Vec<T> but pronounced 'vector.'

- -

Vectors have O(1) indexing, amortized O(1) push (to the end) and -O(1) pop (from the end).

- -

Examples

-

You can explicitly create a Vec<T> with new():

- -
-let v: Vec<i32> = Vec::new();
- -

...or by using the vec! macro:

- -
-let v: Vec<i32> = vec![];
-
-let v = vec![1, 2, 3, 4, 5];
-
-let v = vec![0; 10]; // ten zeroes
- -

You can push values onto the end of a vector (which will grow the vector -as needed):

- -
-let mut v = vec![1, 2];
-
-v.push(3);
- -

Popping values works in much the same way:

- -
-let mut v = vec![1, 2];
-
-let two = v.pop();
- -

Vectors also support indexing (through the Index and IndexMut traits):

- -
-let mut v = vec![1, 2, 3];
-let three = v[2];
-v[1] = v[1] + 5;
-

Structs

- - - - - - - - - - - - -
Drain -

A draining iterator for Vec<T>.

-
IntoIter -

An iterator that moves out of a vector.

-
Vec -

A contiguous growable array type, written Vec<T> but pronounced 'vector.'

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/vec/sidebar-items.js b/doc/bitflags/__core/vec/sidebar-items.js deleted file mode 100644 index 8a918d9f..00000000 --- a/doc/bitflags/__core/vec/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["Drain","A draining iterator for `Vec`."],["IntoIter","An iterator that moves out of a vector."],["Vec","A contiguous growable array type, written `Vec` but pronounced 'vector.'"]]}); \ No newline at end of file diff --git a/doc/bitflags/__core/vec/struct.Drain.html b/doc/bitflags/__core/vec/struct.Drain.html deleted file mode 100644 index e4a70e3d..00000000 --- a/doc/bitflags/__core/vec/struct.Drain.html +++ /dev/null @@ -1,166 +0,0 @@ - - - - - - - - - - bitflags::__core::vec::Drain - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::vec::Drain - - [−] - - [src]

-
pub struct Drain<'a, T> where T: 'a {
-    // some fields omitted
-}
1.6.0

A draining iterator for Vec<T>.

-

Trait Implementations

impl<'a, T> Sync for Drain<'a, T> where T: Sync

impl<'a, T> Send for Drain<'a, T> where T: Send

impl<'a, T> Iterator for Drain<'a, T>1.0.0

type Item = T

-

fn next(&mut self) -> Option<T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize1.0.0

-

fn last(self) -> Option<Self::Item>1.0.0

-

fn nth(&mut self, n: usize) -> Option<Self::Item>1.0.0

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>1.0.0

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator1.0.0

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B1.0.0

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>1.0.0

-

fn enumerate(self) -> Enumerate<Self>1.0.0

-

fn peekable(self) -> Peekable<Self>1.0.0

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn skip(self, n: usize) -> Skip<Self>1.0.0

-

fn take(self, n: usize) -> Take<Self>1.0.0

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>1.0.0

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator1.0.0

-

fn fuse(self) -> Fuse<Self>1.0.0

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()1.0.0

-

fn by_ref(&mut self) -> &mut Self1.0.0

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>1.0.0

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>1.0.0

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B1.0.0

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool1.0.0

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool1.0.0

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool1.0.0

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator1.0.0

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord1.0.0

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator1.0.0

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>1.0.0

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone1.0.0

-

fn cycle(self) -> Cycle<Self> where Self: Clone1.0.0

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<'a, T> DoubleEndedIterator for Drain<'a, T>1.0.0

fn next_back(&mut self) -> Option<T>

-

impl<'a, T> Drop for Drain<'a, T>1.0.0

fn drop(&mut self)

-

impl<'a, T> ExactSizeIterator for Drain<'a, T>1.0.0

fn len(&self) -> usize1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/vec/struct.IntoIter.html b/doc/bitflags/__core/vec/struct.IntoIter.html deleted file mode 100644 index 8cc75efe..00000000 --- a/doc/bitflags/__core/vec/struct.IntoIter.html +++ /dev/null @@ -1,168 +0,0 @@ - - - - - - - - - - bitflags::__core::vec::IntoIter - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::vec::IntoIter - - [−] - - [src]

-
pub struct IntoIter<T> {
-    // some fields omitted
-}
1.0.0

An iterator that moves out of a vector.

-

Trait Implementations

impl<T> Send for IntoIter<T> where T: Send

impl<T> Sync for IntoIter<T> where T: Sync

impl<T> Iterator for IntoIter<T>

type Item = T

-

fn next(&mut self) -> Option<T>

-

fn size_hint(&self) -> (usize, Option<usize>)

-

fn count(self) -> usize

-

fn last(self) -> Option<Self::Item>

-

fn nth(&mut self, n: usize) -> Option<Self::Item>

-

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

-

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

-

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

-

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

-

fn enumerate(self) -> Enumerate<Self>

-

fn peekable(self) -> Peekable<Self>

-

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

-

fn skip(self, n: usize) -> Skip<Self>

-

fn take(self, n: usize) -> Take<Self>

-

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

-

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator

-

fn fuse(self) -> Fuse<Self>

-

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

-

fn by_ref(&mut self) -> &mut Self

-

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

-

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

-

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

-

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

-

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

-

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

-

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

-

fn max(self) -> Option<Self::Item> where Self::Item: Ord

-

fn min(self) -> Option<Self::Item> where Self::Item: Ord

-

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B1.6.0

-

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

-

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromB: Default + Extend<B>, FromA: Default + Extend<A>, Self: Iterator<Item=(A, B)>

-

fn cloned<'a, T>(self) -> Cloned<Self> where Self: Iterator<Item=&'a T>, T: 'a + Clone

-

fn cycle(self) -> Cycle<Self> where Self: Clone

-

fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero

-

fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One

-

fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord1.5.0

-

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>1.5.0

-

fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>1.5.0

-

impl<T> DoubleEndedIterator for IntoIter<T>

fn next_back(&mut self) -> Option<T>

-

impl<T> ExactSizeIterator for IntoIter<T>

fn len(&self) -> usize

-

impl<T> Clone for IntoIter<T> where T: Clone1.8.0

fn clone(&self) -> IntoIter<T>

-

fn clone_from(&mut self, source: &Self)

-

impl<T> Drop for IntoIter<T>

fn drop(&mut self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/__core/vec/struct.Vec.html b/doc/bitflags/__core/vec/struct.Vec.html deleted file mode 100644 index 2360cc70..00000000 --- a/doc/bitflags/__core/vec/struct.Vec.html +++ /dev/null @@ -1,1330 +0,0 @@ - - - - - - - - - - bitflags::__core::vec::Vec - Rust - - - - - - - - - - - - - - - - - -
-

Struct bitflags::__core::vec::Vec - - [−] - - [src]

-
pub struct Vec<T> {
-    // some fields omitted
-}
1.0.0

A contiguous growable array type, written Vec<T> but pronounced 'vector.'

- -

Examples

-
-let mut vec = Vec::new();
-vec.push(1);
-vec.push(2);
-
-assert_eq!(vec.len(), 2);
-assert_eq!(vec[0], 1);
-
-assert_eq!(vec.pop(), Some(2));
-assert_eq!(vec.len(), 1);
-
-vec[0] = 7;
-assert_eq!(vec[0], 7);
-
-vec.extend([1, 2, 3].iter().cloned());
-
-for x in &vec {
-    println!("{}", x);
-}
-assert_eq!(vec, [7, 1, 2, 3]);
- -

The vec! macro is provided to make initialization more convenient:

- -
-let mut vec = vec![1, 2, 3];
-vec.push(4);
-assert_eq!(vec, [1, 2, 3, 4]);
- -

It can also initialize each element of a Vec<T> with a given value:

- -
-let vec = vec![0; 5];
-assert_eq!(vec, [0, 0, 0, 0, 0]);
- -

Use a Vec<T> as an efficient stack:

- -
-let mut stack = Vec::new();
-
-stack.push(1);
-stack.push(2);
-stack.push(3);
-
-while let Some(top) = stack.pop() {
-    // Prints 3, 2, 1
-    println!("{}", top);
-}
- -

Indexing

-

The Vec type allows to access values by index, because it implements the -Index trait. An example will be more explicit:

- -
-let v = vec!(0, 2, 4, 6);
-println!("{}", v[1]); // it will display '2'
- -

However be careful: if you try to access an index which isn't in the Vec, -your software will panic! You cannot do this:

- -
-let v = vec!(0, 2, 4, 6);
-println!("{}", v[6]); // it will panic!
- -

In conclusion: always check if the index you want to get really exists -before doing it.

- -

Slicing

-

A Vec can be mutable. Slices, on the other hand, are read-only objects. -To get a slice, use "&". Example:

- -
-fn read_slice(slice: &[usize]) {
-    // ...
-}
-
-let v = vec!(0, 1);
-read_slice(&v);
-
-// ... and that's all!
-// you can also do it like this:
-let x : &[usize] = &v;
- -

In Rust, it's more common to pass slices as arguments rather than vectors -when you just want to provide a read access. The same goes for String and -&str.

- -

Capacity and reallocation

-

The capacity of a vector is the amount of space allocated for any future -elements that will be added onto the vector. This is not to be confused with -the length of a vector, which specifies the number of actual elements -within the vector. If a vector's length exceeds its capacity, its capacity -will automatically be increased, but its elements will have to be -reallocated.

- -

For example, a vector with capacity 10 and length 0 would be an empty vector -with space for 10 more elements. Pushing 10 or fewer elements onto the -vector will not change its capacity or cause reallocation to occur. However, -if the vector's length is increased to 11, it will have to reallocate, which -can be slow. For this reason, it is recommended to use Vec::with_capacity -whenever possible to specify how big the vector is expected to get.

- -

Guarantees

-

Due to its incredibly fundamental nature, Vec makes a lot of guarantees -about its design. This ensures that it's as low-overhead as possible in -the general case, and can be correctly manipulated in primitive ways -by unsafe code. Note that these guarantees refer to an unqualified Vec<T>. -If additional type parameters are added (e.g. to support custom allocators), -overriding their defaults may change the behavior.

- -

Most fundamentally, Vec is and always will be a (pointer, capacity, length) -triplet. No more, no less. The order of these fields is completely -unspecified, and you should use the appropriate methods to modify these. -The pointer will never be null, so this type is null-pointer-optimized.

- -

However, the pointer may not actually point to allocated memory. In particular, -if you construct a Vec with capacity 0 via Vec::new(), vec![], -Vec::with_capacity(0), or by calling shrink_to_fit() on an empty Vec, it -will not allocate memory. Similarly, if you store zero-sized types inside -a Vec, it will not allocate space for them. Note that in this case the -Vec may not report a capacity() of 0. Vec will allocate if and only -if mem::size_of::<T>() * capacity() > 0. In general, Vec's allocation -details are subtle enough that it is strongly recommended that you only -free memory allocated by a Vec by creating a new Vec and dropping it.

- -

If a Vec has allocated memory, then the memory it points to is on the heap -(as defined by the allocator Rust is configured to use by default), and its -pointer points to len() initialized elements in order (what you would see -if you coerced it to a slice), followed by capacity() - len() logically -uninitialized elements.

- -

Vec will never perform a "small optimization" where elements are actually -stored on the stack for two reasons:

- -
    -

  • It would make it more difficult for unsafe code to correctly manipulate -a Vec. The contents of a Vec wouldn't have a stable address if it were -only moved, and it would be more difficult to determine if a Vec had -actually allocated memory.

    • -

  • It would penalize the general case, incurring an additional branch -on every access.

    • -
- -

Vec will never automatically shrink itself, even if completely empty. This -ensures no unnecessary allocations or deallocations occur. Emptying a Vec -and then filling it back up to the same len() should incur no calls to -the allocator. If you wish to free up unused memory, use shrink_to_fit.

- -

push and insert will never (re)allocate if the reported capacity is -sufficient. push and insert will (re)allocate if len() == capacity(). -That is, the reported capacity is completely accurate, and can be relied on. -It can even be used to manually free the memory allocated by a Vec if -desired. Bulk insertion methods may reallocate, even when not necessary.

- -

Vec does not guarantee any particular growth strategy when reallocating -when full, nor when reserve is called. The current strategy is basic -and it may prove desirable to use a non-constant growth factor. Whatever -strategy is used will of course guarantee O(1) amortized push.

- -

vec![x; n], vec![a, b, c, d], and Vec::with_capacity(n), will all -produce a Vec with exactly the requested capacity. If len() == capacity(), -(as is the case for the vec! macro), then a Vec<T> can be converted -to and from a Box<[T]> without reallocating or moving the elements.

- -

Vec will not specifically overwrite any data that is removed from it, -but also won't specifically preserve it. Its uninitialized memory is -scratch space that it may use however it wants. It will generally just do -whatever is most efficient or otherwise easy to implement. Do not rely on -removed data to be erased for security purposes. Even if you drop a Vec, its -buffer may simply be reused by another Vec. Even if you zero a Vec's memory -first, that may not actually happen because the optimizer does not consider -this a side-effect that must be preserved.

- -

Vec does not currently guarantee the order in which elements are dropped -(the order has changed in the past, and may change again).

-

Methods

impl<T> Vec<T>

fn new() -> Vec<T>

-

Constructs a new, empty Vec<T>.

- -

The vector will not allocate until elements are pushed onto it.

- -

Examples

-
-let mut vec: Vec<i32> = Vec::new();
-

fn with_capacity(capacity: usize) -> Vec<T>

-

Constructs a new, empty Vec<T> with the specified capacity.

- -

The vector will be able to hold exactly capacity elements without -reallocating. If capacity is 0, the vector will not allocate.

- -

It is important to note that this function does not specify the length -of the returned vector, but only the capacity. (For an explanation of -the difference between length and capacity, see the main Vec<T> docs -above, 'Capacity and reallocation'.)

- -

Examples

-
-let mut vec = Vec::with_capacity(10);
-
-// The vector contains no items, even though it has capacity for more
-assert_eq!(vec.len(), 0);
-
-// These are all done without reallocating...
-for i in 0..10 {
-    vec.push(i);
-}
-
-// ...but this may make the vector reallocate
-vec.push(11);
-

unsafe fn from_raw_parts(ptr: *mut T, length: usize, capacity: usize) -> Vec<T>

-

Creates a Vec<T> directly from the raw components of another vector.

- -

Safety

-

This is highly unsafe, due to the number of invariants that aren't -checked:

- -
    -
  • ptr needs to have been previously allocated via String/Vec<T> -(at least, it's highly likely to be incorrect if it wasn't).
    • -
  • length needs to be the length that less than or equal to capacity.
    • -
  • capacity needs to be the capacity that the pointer was allocated with.
    • -
- -

Violating these may cause problems like corrupting the allocator's -internal datastructures.

- -

Examples

-
-use std::ptr;
-use std::mem;
-
-fn main() {
-    let mut v = vec![1, 2, 3];
-
-    // Pull out the various important pieces of information about `v`
-    let p = v.as_mut_ptr();
-    let len = v.len();
-    let cap = v.capacity();
-
-    unsafe {
-        // Cast `v` into the void: no destructor run, so we are in
-        // complete control of the allocation to which `p` points.
-        mem::forget(v);
-
-        // Overwrite memory with 4, 5, 6
-        for i in 0..len as isize {
-            ptr::write(p.offset(i), 4 + i);
-        }
-
-        // Put everything back together into a Vec
-        let rebuilt = Vec::from_raw_parts(p, len, cap);
-        assert_eq!(rebuilt, [4, 5, 6]);
-    }
-}
-

fn capacity(&self) -> usize

-

Returns the number of elements the vector can hold without -reallocating.

- -

Examples

-
-let vec: Vec<i32> = Vec::with_capacity(10);
-assert_eq!(vec.capacity(), 10);
-

fn reserve(&mut self, additional: usize)

-

Reserves capacity for at least additional more elements to be inserted -in the given Vec<T>. The collection may reserve more space to avoid -frequent reallocations.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-
-let mut vec = vec![1];
-vec.reserve(10);
-assert!(vec.capacity() >= 11);
-

fn reserve_exact(&mut self, additional: usize)

-

Reserves the minimum capacity for exactly additional more elements to -be inserted in the given Vec<T>. Does nothing if the capacity is already -sufficient.

- -

Note that the allocator may give the collection more space than it -requests. Therefore capacity can not be relied upon to be precisely -minimal. Prefer reserve if future insertions are expected.

- -

Panics

-

Panics if the new capacity overflows usize.

- -

Examples

-
-let mut vec = vec![1];
-vec.reserve_exact(10);
-assert!(vec.capacity() >= 11);
-

fn shrink_to_fit(&mut self)

-

Shrinks the capacity of the vector as much as possible.

- -

It will drop down as close as possible to the length but the allocator -may still inform the vector that there is space for a few more elements.

- -

Examples

-
-let mut vec = Vec::with_capacity(10);
-vec.extend([1, 2, 3].iter().cloned());
-assert_eq!(vec.capacity(), 10);
-vec.shrink_to_fit();
-assert!(vec.capacity() >= 3);
-

fn into_boxed_slice(self) -> Box<[T]>

-

Converts the vector into Box<[T]>.

- -

Note that this will drop any excess capacity. Calling this and -converting back to a vector with into_vec() is equivalent to calling -shrink_to_fit().

-

fn truncate(&mut self, len: usize)

-

Shorten a vector to be len elements long, dropping excess elements.

- -

If len is greater than the vector's current length, this has no -effect.

- -

Examples

-
-let mut vec = vec![1, 2, 3, 4, 5];
-vec.truncate(2);
-assert_eq!(vec, [1, 2]);
-

fn as_slice(&self) -> &[T]1.7.0

-

Extracts a slice containing the entire vector.

- -

Equivalent to &s[..].

-

fn as_mut_slice(&mut self) -> &mut [T]1.7.0

-

Extracts a mutable slice of the entire vector.

- -

Equivalent to &mut s[..].

-

unsafe fn set_len(&mut self, len: usize)

-

Sets the length of a vector.

- -

This will explicitly set the size of the vector, without actually -modifying its buffers, so it is up to the caller to ensure that the -vector is actually the specified size.

- -

Examples

-
-let mut v = vec![1, 2, 3, 4];
-unsafe {
-    v.set_len(1);
-}
-

fn swap_remove(&mut self, index: usize) -> T

-

Removes an element from anywhere in the vector and return it, replacing -it with the last element.

- -

This does not preserve ordering, but is O(1).

- -

Panics

-

Panics if index is out of bounds.

- -

Examples

-
-let mut v = vec!["foo", "bar", "baz", "qux"];
-
-assert_eq!(v.swap_remove(1), "bar");
-assert_eq!(v, ["foo", "qux", "baz"]);
-
-assert_eq!(v.swap_remove(0), "foo");
-assert_eq!(v, ["baz", "qux"]);
-

fn insert(&mut self, index: usize, element: T)

-

Inserts an element at position index within the vector, shifting all -elements after it to the right.

- -

Panics

-

Panics if index is greater than the vector's length.

- -

Examples

-
-let mut vec = vec![1, 2, 3];
-vec.insert(1, 4);
-assert_eq!(vec, [1, 4, 2, 3]);
-vec.insert(4, 5);
-assert_eq!(vec, [1, 4, 2, 3, 5]);
-

fn remove(&mut self, index: usize) -> T

-

Removes and returns the element at position index within the vector, -shifting all elements after it to the left.

- -

Panics

-

Panics if index is out of bounds.

- -

Examples

-
-let mut v = vec![1, 2, 3];
-assert_eq!(v.remove(1), 2);
-assert_eq!(v, [1, 3]);
-

fn retain<F>(&mut self, f: F) where F: FnMut(&T) -> bool

-

Retains only the elements specified by the predicate.

- -

In other words, remove all elements e such that f(&e) returns false. -This method operates in place and preserves the order of the retained -elements.

- -

Examples

-
-let mut vec = vec![1, 2, 3, 4];
-vec.retain(|&x| x%2 == 0);
-assert_eq!(vec, [2, 4]);
-

fn push(&mut self, value: T)

-

Appends an element to the back of a collection.

- -

Panics

-

Panics if the number of elements in the vector overflows a usize.

- -

Examples

-
-let mut vec = vec![1, 2];
-vec.push(3);
-assert_eq!(vec, [1, 2, 3]);
-

fn pop(&mut self) -> Option<T>

-

Removes the last element from a vector and returns it, or None if it -is empty.

- -

Examples

-
-let mut vec = vec![1, 2, 3];
-assert_eq!(vec.pop(), Some(3));
-assert_eq!(vec, [1, 2]);
-

fn append(&mut self, other: &mut Vec<T>)1.4.0

-

Moves all the elements of other into Self, leaving other empty.

- -

Panics

-

Panics if the number of elements in the vector overflows a usize.

- -

Examples

-
-let mut vec = vec![1, 2, 3];
-let mut vec2 = vec![4, 5, 6];
-vec.append(&mut vec2);
-assert_eq!(vec, [1, 2, 3, 4, 5, 6]);
-assert_eq!(vec2, []);
-

fn drain<R>(&mut self, range: R) -> Drain<T> where R: RangeArgument<usize>1.6.0

-

Create a draining iterator that removes the specified range in the vector -and yields the removed items.

- -

Note 1: The element range is removed even if the iterator is not -consumed until the end.

- -

Note 2: It is unspecified how many elements are removed from the vector, -if the Drain value is leaked.

- -

Panics

-

Panics if the starting point is greater than the end point or if -the end point is greater than the length of the vector.

- -

Examples

-
-let mut v = vec![1, 2, 3];
-let u: Vec<_> = v.drain(1..).collect();
-assert_eq!(v, &[1]);
-assert_eq!(u, &[2, 3]);
-
-// A full range clears the vector
-v.drain(..);
-assert_eq!(v, &[]);
-

fn clear(&mut self)

-

Clears the vector, removing all values.

- -

Examples

-
-let mut v = vec![1, 2, 3];
-
-v.clear();
-
-assert!(v.is_empty());
-

fn len(&self) -> usize

-

Returns the number of elements in the vector.

- -

Examples

-
-let a = vec![1, 2, 3];
-assert_eq!(a.len(), 3);
-

fn is_empty(&self) -> bool

-

Returns true if the vector contains no elements.

- -

Examples

-
-let mut v = Vec::new();
-assert!(v.is_empty());
-
-v.push(1);
-assert!(!v.is_empty());
-

fn split_off(&mut self, at: usize) -> Vec<T>1.4.0

-

Splits the collection into two at the given index.

- -

Returns a newly allocated Self. self contains elements [0, at), -and the returned Self contains elements [at, len).

- -

Note that the capacity of self does not change.

- -

Panics

-

Panics if at > len.

- -

Examples

-
-let mut vec = vec![1,2,3];
-let vec2 = vec.split_off(1);
-assert_eq!(vec, [1]);
-assert_eq!(vec2, [2, 3]);
-

impl<T> Vec<T> where T: Clone

fn resize(&mut self, new_len: usize, value: T)1.5.0

-

Resizes the Vec in-place so that len() is equal to new_len.

- -

If new_len is greater than len(), the Vec is extended by the -difference, with each additional slot filled with value. -If new_len is less than len(), the Vec is simply truncated.

- -

Examples

-
-let mut vec = vec!["hello"];
-vec.resize(3, "world");
-assert_eq!(vec, ["hello", "world", "world"]);
-
-let mut vec = vec![1, 2, 3, 4];
-vec.resize(2, 0);
-assert_eq!(vec, [1, 2]);
-

fn extend_from_slice(&mut self, other: &[T])1.6.0

-

Appends all elements in a slice to the Vec.

- -

Iterates over the slice other, clones each element, and then appends -it to this Vec. The other vector is traversed in-order.

- -

Note that this function is same as extend except that it is -specialized to work with slices instead. If and when Rust gets -specialization this function will likely be deprecated (but still -available).

- -

Examples

-
-let mut vec = vec![1];
-vec.extend_from_slice(&[2, 3, 4]);
-assert_eq!(vec, [1, 2, 3, 4]);
-

impl<T> Vec<T> where T: PartialEq<T>

fn dedup(&mut self)

-

Removes consecutive repeated elements in the vector.

- -

If the vector is sorted, this removes all duplicates.

- -

Examples

-
-let mut vec = vec![1, 2, 2, 3, 2];
-
-vec.dedup();
-
-assert_eq!(vec, [1, 2, 3, 2]);
-

Methods from Deref<Target=[T]>

fn len(&self) -> usize

-

Returns the number of elements in the slice.

- -

Example

-
-let a = [1, 2, 3];
-assert_eq!(a.len(), 3);
-

fn is_empty(&self) -> bool

-

Returns true if the slice has a length of 0

- -

Example

-
-let a = [1, 2, 3];
-assert!(!a.is_empty());
-

fn first(&self) -> Option<&T>

-

Returns the first element of a slice, or None if it is empty.

- -

Examples

-
-let v = [10, 40, 30];
-assert_eq!(Some(&10), v.first());
-
-let w: &[i32] = &[];
-assert_eq!(None, w.first());
-

fn first_mut(&mut self) -> Option<&mut T>

-

Returns a mutable pointer to the first element of a slice, or None if it is empty

-

fn split_first(&self) -> Option<(&T, &[T])>1.5.0

-

Returns the first and all the rest of the elements of a slice.

-

fn split_first_mut(&mut self) -> Option<(&mut T, &mut [T])>1.5.0

-

Returns the first and all the rest of the elements of a slice.

-

fn split_last(&self) -> Option<(&T, &[T])>1.5.0

-

Returns the last and all the rest of the elements of a slice.

-

fn split_last_mut(&mut self) -> Option<(&mut T, &mut [T])>1.5.0

-

Returns the last and all the rest of the elements of a slice.

-

fn last(&self) -> Option<&T>

-

Returns the last element of a slice, or None if it is empty.

- -

Examples

-
-let v = [10, 40, 30];
-assert_eq!(Some(&30), v.last());
-
-let w: &[i32] = &[];
-assert_eq!(None, w.last());
-

fn last_mut(&mut self) -> Option<&mut T>

-

Returns a mutable pointer to the last item in the slice.

-

fn get(&self, index: usize) -> Option<&T>

-

Returns the element of a slice at the given index, or None if the -index is out of bounds.

- -

Examples

-
-let v = [10, 40, 30];
-assert_eq!(Some(&40), v.get(1));
-assert_eq!(None, v.get(3));
-

fn get_mut(&mut self, index: usize) -> Option<&mut T>

-

Returns a mutable reference to the element at the given index, -or None if the index is out of bounds

-

unsafe fn get_unchecked(&self, index: usize) -> &T

-

Returns a pointer to the element at the given index, without doing -bounds checking.

-

unsafe fn get_unchecked_mut(&mut self, index: usize) -> &mut T

-

Returns an unsafe mutable pointer to the element in index

-

fn as_ptr(&self) -> *const T

-

Returns an raw pointer to the slice's buffer

- -

The caller must ensure that the slice outlives the pointer this -function returns, or else it will end up pointing to garbage.

- -

Modifying the slice may cause its buffer to be reallocated, which -would also make any pointers to it invalid.

-

fn as_mut_ptr(&mut self) -> *mut T

-

Returns an unsafe mutable pointer to the slice's buffer.

- -

The caller must ensure that the slice outlives the pointer this -function returns, or else it will end up pointing to garbage.

- -

Modifying the slice may cause its buffer to be reallocated, which -would also make any pointers to it invalid.

-

fn swap(&mut self, a: usize, b: usize)

-

Swaps two elements in a slice.

- -

Arguments

-
    -
  • a - The index of the first element
    • -
  • b - The index of the second element
    • -
- -

Panics

-

Panics if a or b are out of bounds.

- -

Example

-
-let mut v = ["a", "b", "c", "d"];
-v.swap(1, 3);
-assert!(v == ["a", "d", "c", "b"]);
-

fn reverse(&mut self)

-

Reverse the order of elements in a slice, in place.

- -

Example

-
-let mut v = [1, 2, 3];
-v.reverse();
-assert!(v == [3, 2, 1]);
-

fn iter(&self) -> Iter<T>

-

Returns an iterator over the slice.

-

fn iter_mut(&mut self) -> IterMut<T>

-

Returns an iterator that allows modifying each value

-

fn windows(&self, size: usize) -> Windows<T>

-

Returns an iterator over all contiguous windows of length -size. The windows overlap. If the slice is shorter than -size, the iterator returns no values.

- -

Panics

-

Panics if size is 0.

- -

Example

-

Print the adjacent pairs of a slice (i.e. [1,2], [2,3], -[3,4]):

- -
-let v = &[1, 2, 3, 4];
-for win in v.windows(2) {
-    println!("{:?}", win);
-}
-

fn chunks(&self, size: usize) -> Chunks<T>

-

Returns an iterator over size elements of the slice at a -time. The chunks are slices and do not overlap. If size does not divide the -length of the slice, then the last chunk will not have length -size.

- -

Panics

-

Panics if size is 0.

- -

Example

-

Print the slice two elements at a time (i.e. [1,2], -[3,4], [5]):

- -
-let v = &[1, 2, 3, 4, 5];
-for win in v.chunks(2) {
-    println!("{:?}", win);
-}
-

fn chunks_mut(&mut self, chunk_size: usize) -> ChunksMut<T>

-

Returns an iterator over chunk_size elements of the slice at a time. -The chunks are mutable slices, and do not overlap. If chunk_size does -not divide the length of the slice, then the last chunk will not -have length chunk_size.

- -

Panics

-

Panics if chunk_size is 0.

-

fn split_at(&self, mid: usize) -> (&[T], &[T])

-

Divides one slice into two at an index.

- -

The first will contain all indices from [0, mid) (excluding -the index mid itself) and the second will contain all -indices from [mid, len) (excluding the index len itself).

- -

Panics

-

Panics if mid > len.

- -

Examples

-
-let v = [10, 40, 30, 20, 50];
-let (v1, v2) = v.split_at(2);
-assert_eq!([10, 40], v1);
-assert_eq!([30, 20, 50], v2);
-

fn split_at_mut(&mut self, mid: usize) -> (&mut [T], &mut [T])

-

Divides one &mut into two at an index.

- -

The first will contain all indices from [0, mid) (excluding -the index mid itself) and the second will contain all -indices from [mid, len) (excluding the index len itself).

- -

Panics

-

Panics if mid > len.

- -

Example

-
-let mut v = [1, 2, 3, 4, 5, 6];
-
-// scoped to restrict the lifetime of the borrows
-{
-   let (left, right) = v.split_at_mut(0);
-   assert!(left == []);
-   assert!(right == [1, 2, 3, 4, 5, 6]);
-}
-
-{
-    let (left, right) = v.split_at_mut(2);
-    assert!(left == [1, 2]);
-    assert!(right == [3, 4, 5, 6]);
-}
-
-{
-    let (left, right) = v.split_at_mut(6);
-    assert!(left == [1, 2, 3, 4, 5, 6]);
-    assert!(right == []);
-}
-

fn split<F>(&self, pred: F) -> Split<T, F> where F: FnMut(&T) -> bool

-

Returns an iterator over subslices separated by elements that match -pred. The matched element is not contained in the subslices.

- -

Examples

-

Print the slice split by numbers divisible by 3 (i.e. [10, 40], -[20], [50]):

- -
-let v = [10, 40, 30, 20, 60, 50];
-for group in v.split(|num| *num % 3 == 0) {
-    println!("{:?}", group);
-}
-

fn split_mut<F>(&mut self, pred: F) -> SplitMut<T, F> where F: FnMut(&T) -> bool

-

Returns an iterator over mutable subslices separated by elements that -match pred. The matched element is not contained in the subslices.

-

fn splitn<F>(&self, n: usize, pred: F) -> SplitN<T, F> where F: FnMut(&T) -> bool

-

Returns an iterator over subslices separated by elements that match -pred, limited to returning at most n items. The matched element is -not contained in the subslices.

- -

The last element returned, if any, will contain the remainder of the -slice.

- -

Examples

-

Print the slice split once by numbers divisible by 3 (i.e. [10, 40], -[20, 60, 50]):

- -
-let v = [10, 40, 30, 20, 60, 50];
-for group in v.splitn(2, |num| *num % 3 == 0) {
-    println!("{:?}", group);
-}
-

fn splitn_mut<F>(&mut self, n: usize, pred: F) -> SplitNMut<T, F> where F: FnMut(&T) -> bool

-

Returns an iterator over subslices separated by elements that match -pred, limited to returning at most n items. The matched element is -not contained in the subslices.

- -

The last element returned, if any, will contain the remainder of the -slice.

-

fn rsplitn<F>(&self, n: usize, pred: F) -> RSplitN<T, F> where F: FnMut(&T) -> bool

-

Returns an iterator over subslices separated by elements that match -pred limited to returning at most n items. This starts at the end of -the slice and works backwards. The matched element is not contained in -the subslices.

- -

The last element returned, if any, will contain the remainder of the -slice.

- -

Examples

-

Print the slice split once, starting from the end, by numbers divisible -by 3 (i.e. [50], [10, 40, 30, 20]):

- -
-let v = [10, 40, 30, 20, 60, 50];
-for group in v.rsplitn(2, |num| *num % 3 == 0) {
-    println!("{:?}", group);
-}
-

fn rsplitn_mut<F>(&mut self, n: usize, pred: F) -> RSplitNMut<T, F> where F: FnMut(&T) -> bool

-

Returns an iterator over subslices separated by elements that match -pred limited to returning at most n items. This starts at the end of -the slice and works backwards. The matched element is not contained in -the subslices.

- -

The last element returned, if any, will contain the remainder of the -slice.

-

fn contains(&self, x: &T) -> bool where T: PartialEq<T>

-

Returns true if the slice contains an element with the given value.

- -

Examples

-
-let v = [10, 40, 30];
-assert!(v.contains(&30));
-assert!(!v.contains(&50));
-

fn starts_with(&self, needle: &[T]) -> bool where T: PartialEq<T>

-

Returns true if needle is a prefix of the slice.

- -

Examples

-
-let v = [10, 40, 30];
-assert!(v.starts_with(&[10]));
-assert!(v.starts_with(&[10, 40]));
-assert!(!v.starts_with(&[50]));
-assert!(!v.starts_with(&[10, 50]));
-

fn ends_with(&self, needle: &[T]) -> bool where T: PartialEq<T>

-

Returns true if needle is a suffix of the slice.

- -

Examples

-
-let v = [10, 40, 30];
-assert!(v.ends_with(&[30]));
-assert!(v.ends_with(&[40, 30]));
-assert!(!v.ends_with(&[50]));
-assert!(!v.ends_with(&[50, 30]));
-
-

Binary search a sorted slice for a given element.

- -

If the value is found then Ok is returned, containing the -index of the matching element; if the value is not found then -Err is returned, containing the index where a matching -element could be inserted while maintaining sorted order.

- -

Example

-

Looks up a series of four elements. The first is found, with a -uniquely determined position; the second and third are not -found; the fourth could match any position in [1,4].

- -
-let s = [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55];
-
-assert_eq!(s.binary_search(&13),  Ok(9));
-assert_eq!(s.binary_search(&4),   Err(7));
-assert_eq!(s.binary_search(&100), Err(13));
-let r = s.binary_search(&1);
-assert!(match r { Ok(1...4) => true, _ => false, });
-

fn binary_search_by<F>(&self, f: F) -> Result<usize, usize> where F: FnMut(&T) -> Ordering

-

Binary search a sorted slice with a comparator function.

- -

The comparator function should implement an order consistent -with the sort order of the underlying slice, returning an -order code that indicates whether its argument is Less, -Equal or Greater the desired target.

- -

If a matching value is found then returns Ok, containing -the index for the matched element; if no match is found then -Err is returned, containing the index where a matching -element could be inserted while maintaining sorted order.

- -

Example

-

Looks up a series of four elements. The first is found, with a -uniquely determined position; the second and third are not -found; the fourth could match any position in [1,4].

- -
-let s = [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55];
-
-let seek = 13;
-assert_eq!(s.binary_search_by(|probe| probe.cmp(&seek)), Ok(9));
-let seek = 4;
-assert_eq!(s.binary_search_by(|probe| probe.cmp(&seek)), Err(7));
-let seek = 100;
-assert_eq!(s.binary_search_by(|probe| probe.cmp(&seek)), Err(13));
-let seek = 1;
-let r = s.binary_search_by(|probe| probe.cmp(&seek));
-assert!(match r { Ok(1...4) => true, _ => false, });
-

fn binary_search_by_key<B, F>(&self, b: &B, f: F) -> Result<usize, usize> where F: FnMut(&T) -> B, B: Ord

-
Unstable (slice_binary_search_by_key)

: recently added

-

Binary search a sorted slice with a key extraction function.

- -

Assumes that the slice is sorted by the key, for instance with -sort_by_key using the same key extraction function.

- -

If a matching value is found then returns Ok, containing the -index for the matched element; if no match is found then Err -is returned, containing the index where a matching element could -be inserted while maintaining sorted order.

- -

Examples

-

Looks up a series of four elements in a slice of pairs sorted by -their second elements. The first is found, with a uniquely -determined position; the second and third are not found; the -fourth could match any position in [1,4].

- -
-#![feature(slice_binary_search_by_key)]
-let s = [(0, 0), (2, 1), (4, 1), (5, 1), (3, 1),
-         (1, 2), (2, 3), (4, 5), (5, 8), (3, 13),
-         (1, 21), (2, 34), (4, 55)];
-
-assert_eq!(s.binary_search_by_key(&13, |&(a,b)| b),  Ok(9));
-assert_eq!(s.binary_search_by_key(&4, |&(a,b)| b),   Err(7));
-assert_eq!(s.binary_search_by_key(&100, |&(a,b)| b), Err(13));
-let r = s.binary_search_by_key(&1, |&(a,b)| b);
-assert!(match r { Ok(1...4) => true, _ => false, });
-

fn sort(&mut self) where T: Ord

-

Sorts the slice, in place.

- -

This is equivalent to self.sort_by(|a, b| a.cmp(b)).

- -

This is a stable sort.

- -

Examples

-
-let mut v = [-5, 4, 1, -3, 2];
-
-v.sort();
-assert!(v == [-5, -3, 1, 2, 4]);
-

fn sort_by_key<B, F>(&mut self, f: F) where B: Ord, F: FnMut(&T) -> B1.7.0

-

Sorts the slice, in place, using key to extract a key by which to -order the sort by.

- -

This sort is O(n log n) worst-case and stable, but allocates -approximately 2 * n, where n is the length of self.

- -

This is a stable sort.

- -

Examples

-
-let mut v = [-5i32, 4, 1, -3, 2];
-
-v.sort_by_key(|k| k.abs());
-assert!(v == [1, 2, -3, 4, -5]);
-

fn sort_by<F>(&mut self, compare: F) where F: FnMut(&T, &T) -> Ordering

-

Sorts the slice, in place, using compare to compare -elements.

- -

This sort is O(n log n) worst-case and stable, but allocates -approximately 2 * n, where n is the length of self.

- -

Examples

-
-let mut v = [5, 4, 1, 3, 2];
-v.sort_by(|a, b| a.cmp(b));
-assert!(v == [1, 2, 3, 4, 5]);
-
-// reverse sorting
-v.sort_by(|a, b| b.cmp(a));
-assert!(v == [5, 4, 3, 2, 1]);
-

fn clone_from_slice(&mut self, src: &[T]) where T: Clone1.7.0

-

Copies the elements from src into self.

- -

The length of this slice must be the same as the slice passed in.

- -

Panics

-

This function will panic if the two slices have different lengths.

- -

Example

-
-let mut dst = [0, 0, 0];
-let src = [1, 2, 3];
-
-dst.clone_from_slice(&src);
-assert!(dst == [1, 2, 3]);
-

fn copy_from_slice(&mut self, src: &[T]) where T: Copy1.9.0

-

Copies all elements from src into self, using a memcpy.

- -

The length of src must be the same as self.

- -

Panics

-

This function will panic if the two slices have different lengths.

- -

Example

-
-let mut dst = [0, 0, 0];
-let src = [1, 2, 3];
-
-dst.copy_from_slice(&src);
-assert_eq!(src, dst);
-

fn to_vec(&self) -> Vec<T> where T: Clone

-

Copies self into a new Vec.

-

fn into_vec(self: Box<[T]>) -> Vec<T>

-

Converts self into a vector without clones or allocation.

-

Trait Implementations

impl<T> From<VecDeque<T>> for Vec<T>1.10.0

fn from(other: VecDeque<T>) -> Vec<T>

-

impl<T> From<BinaryHeap<T>> for Vec<T>

fn from(heap: BinaryHeap<T>) -> Vec<T>

-

impl From<CString> for Vec<u8>1.7.0

fn from(s: CString) -> Vec<u8>

-

impl Write for Vec<u8>

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

-

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

-

fn flush(&mut self) -> Result<(), Error>

-

fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>

-

fn by_ref(&mut self) -> &mut Self

-

impl<T> Clone for Vec<T> where T: Clone

fn clone(&self) -> Vec<T>

-

fn clone_from(&mut self, other: &Vec<T>)

-

impl<T> Hash for Vec<T> where T: Hash

fn hash<H>(&self, state: &mut H) where H: Hasher

-

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher1.3.0

-

impl<T> Index<usize> for Vec<T>

type Output = T

-

fn index(&self, index: usize) -> &T

-

impl<T> IndexMut<usize> for Vec<T>

fn index_mut(&mut self, index: usize) -> &mut T

-

impl<T> Index<Range<usize>> for Vec<T>

type Output = [T]

-

fn index(&self, index: Range<usize>) -> &[T]

-

impl<T> Index<RangeTo<usize>> for Vec<T>

type Output = [T]

-

fn index(&self, index: RangeTo<usize>) -> &[T]

-

impl<T> Index<RangeFrom<usize>> for Vec<T>

type Output = [T]

-

fn index(&self, index: RangeFrom<usize>) -> &[T]

-

impl<T> Index<RangeFull> for Vec<T>

type Output = [T]

-

fn index(&self, _index: RangeFull) -> &[T]

-

impl<T> Index<RangeInclusive<usize>> for Vec<T>

type Output = [T]

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn index(&self, index: RangeInclusive<usize>) -> &[T]

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl<T> Index<RangeToInclusive<usize>> for Vec<T>

type Output = [T]

-
Unstable (inclusive_range)

: recently added, follows RFC

-

fn index(&self, index: RangeToInclusive<usize>) -> &[T]

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl<T> IndexMut<Range<usize>> for Vec<T>

fn index_mut(&mut self, index: Range<usize>) -> &mut [T]

-

impl<T> IndexMut<RangeTo<usize>> for Vec<T>

fn index_mut(&mut self, index: RangeTo<usize>) -> &mut [T]

-

impl<T> IndexMut<RangeFrom<usize>> for Vec<T>

fn index_mut(&mut self, index: RangeFrom<usize>) -> &mut [T]

-

impl<T> IndexMut<RangeFull> for Vec<T>

fn index_mut(&mut self, _index: RangeFull) -> &mut [T]

-

impl<T> IndexMut<RangeInclusive<usize>> for Vec<T>

fn index_mut(&mut self, index: RangeInclusive<usize>) -> &mut [T]

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl<T> IndexMut<RangeToInclusive<usize>> for Vec<T>

fn index_mut(&mut self, index: RangeToInclusive<usize>) -> &mut [T]

-
Unstable (inclusive_range)

: recently added, follows RFC

-

impl<T> Deref for Vec<T>

type Target = [T]

-

fn deref(&self) -> &[T]

-

impl<T> DerefMut for Vec<T>

fn deref_mut(&mut self) -> &mut [T]

-

impl<T> FromIterator<T> for Vec<T>

fn from_iter<I>(iter: I) -> Vec<T> where I: IntoIterator<Item=T>

-

impl<T> IntoIterator for Vec<T>

type Item = T

-

type IntoIter = IntoIter<T>

-

fn into_iter(self) -> IntoIter<T>

-

Creates a consuming iterator, that is, one that moves each value out of -the vector (from start to end). The vector cannot be used after calling -this.

- -

Examples

-
-let v = vec!["a".to_string(), "b".to_string()];
-for s in v.into_iter() {
-    // s has type String, not &String
-    println!("{}", s);
-}
-

impl<'a, T> IntoIterator for &'a Vec<T>

type Item = &'a T

-

type IntoIter = Iter<'a, T>

-

fn into_iter(self) -> Iter<'a, T>

-

impl<'a, T> IntoIterator for &'a mut Vec<T>

type Item = &'a mut T

-

type IntoIter = IterMut<'a, T>

-

fn into_iter(self) -> IterMut<'a, T>

-

impl<T> Extend<T> for Vec<T>

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=T>

-

impl<'a, T> Extend<&'a T> for Vec<T> where T: Copy + 'a1.2.0

fn extend<I>(&mut self, iter: I) where I: IntoIterator<Item=&'a T>

-

impl<'a, 'b, A, B> PartialEq<Vec<B>> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &Vec<B>) -> bool

-

fn ne(&self, other: &Vec<B>) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B]) -> bool

-

fn ne(&self, other: &&'b [B]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b mut [B]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b mut [B]) -> bool

-

fn ne(&self, other: &&'b mut [B]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 0]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 0]) -> bool

-

fn ne(&self, other: &[B; 0]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 0]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 0]) -> bool

-

fn ne(&self, other: &&'b [B; 0]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 1]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 1]) -> bool

-

fn ne(&self, other: &[B; 1]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 1]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 1]) -> bool

-

fn ne(&self, other: &&'b [B; 1]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 2]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 2]) -> bool

-

fn ne(&self, other: &[B; 2]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 2]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 2]) -> bool

-

fn ne(&self, other: &&'b [B; 2]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 3]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 3]) -> bool

-

fn ne(&self, other: &[B; 3]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 3]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 3]) -> bool

-

fn ne(&self, other: &&'b [B; 3]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 4]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 4]) -> bool

-

fn ne(&self, other: &[B; 4]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 4]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 4]) -> bool

-

fn ne(&self, other: &&'b [B; 4]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 5]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 5]) -> bool

-

fn ne(&self, other: &[B; 5]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 5]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 5]) -> bool

-

fn ne(&self, other: &&'b [B; 5]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 6]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 6]) -> bool

-

fn ne(&self, other: &[B; 6]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 6]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 6]) -> bool

-

fn ne(&self, other: &&'b [B; 6]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 7]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 7]) -> bool

-

fn ne(&self, other: &[B; 7]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 7]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 7]) -> bool

-

fn ne(&self, other: &&'b [B; 7]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 8]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 8]) -> bool

-

fn ne(&self, other: &[B; 8]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 8]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 8]) -> bool

-

fn ne(&self, other: &&'b [B; 8]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 9]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 9]) -> bool

-

fn ne(&self, other: &[B; 9]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 9]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 9]) -> bool

-

fn ne(&self, other: &&'b [B; 9]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 10]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 10]) -> bool

-

fn ne(&self, other: &[B; 10]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 10]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 10]) -> bool

-

fn ne(&self, other: &&'b [B; 10]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 11]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 11]) -> bool

-

fn ne(&self, other: &[B; 11]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 11]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 11]) -> bool

-

fn ne(&self, other: &&'b [B; 11]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 12]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 12]) -> bool

-

fn ne(&self, other: &[B; 12]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 12]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 12]) -> bool

-

fn ne(&self, other: &&'b [B; 12]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 13]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 13]) -> bool

-

fn ne(&self, other: &[B; 13]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 13]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 13]) -> bool

-

fn ne(&self, other: &&'b [B; 13]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 14]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 14]) -> bool

-

fn ne(&self, other: &[B; 14]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 14]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 14]) -> bool

-

fn ne(&self, other: &&'b [B; 14]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 15]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 15]) -> bool

-

fn ne(&self, other: &[B; 15]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 15]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 15]) -> bool

-

fn ne(&self, other: &&'b [B; 15]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 16]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 16]) -> bool

-

fn ne(&self, other: &[B; 16]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 16]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 16]) -> bool

-

fn ne(&self, other: &&'b [B; 16]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 17]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 17]) -> bool

-

fn ne(&self, other: &[B; 17]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 17]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 17]) -> bool

-

fn ne(&self, other: &&'b [B; 17]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 18]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 18]) -> bool

-

fn ne(&self, other: &[B; 18]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 18]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 18]) -> bool

-

fn ne(&self, other: &&'b [B; 18]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 19]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 19]) -> bool

-

fn ne(&self, other: &[B; 19]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 19]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 19]) -> bool

-

fn ne(&self, other: &&'b [B; 19]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 20]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 20]) -> bool

-

fn ne(&self, other: &[B; 20]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 20]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 20]) -> bool

-

fn ne(&self, other: &&'b [B; 20]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 21]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 21]) -> bool

-

fn ne(&self, other: &[B; 21]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 21]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 21]) -> bool

-

fn ne(&self, other: &&'b [B; 21]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 22]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 22]) -> bool

-

fn ne(&self, other: &[B; 22]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 22]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 22]) -> bool

-

fn ne(&self, other: &&'b [B; 22]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 23]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 23]) -> bool

-

fn ne(&self, other: &[B; 23]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 23]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 23]) -> bool

-

fn ne(&self, other: &&'b [B; 23]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 24]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 24]) -> bool

-

fn ne(&self, other: &[B; 24]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 24]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 24]) -> bool

-

fn ne(&self, other: &&'b [B; 24]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 25]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 25]) -> bool

-

fn ne(&self, other: &[B; 25]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 25]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 25]) -> bool

-

fn ne(&self, other: &&'b [B; 25]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 26]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 26]) -> bool

-

fn ne(&self, other: &[B; 26]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 26]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 26]) -> bool

-

fn ne(&self, other: &&'b [B; 26]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 27]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 27]) -> bool

-

fn ne(&self, other: &[B; 27]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 27]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 27]) -> bool

-

fn ne(&self, other: &&'b [B; 27]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 28]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 28]) -> bool

-

fn ne(&self, other: &[B; 28]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 28]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 28]) -> bool

-

fn ne(&self, other: &&'b [B; 28]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 29]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 29]) -> bool

-

fn ne(&self, other: &[B; 29]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 29]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 29]) -> bool

-

fn ne(&self, other: &&'b [B; 29]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 30]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 30]) -> bool

-

fn ne(&self, other: &[B; 30]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 30]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 30]) -> bool

-

fn ne(&self, other: &&'b [B; 30]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 31]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 31]) -> bool

-

fn ne(&self, other: &[B; 31]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 31]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 31]) -> bool

-

fn ne(&self, other: &&'b [B; 31]) -> bool

-

impl<'a, 'b, A, B> PartialEq<[B; 32]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &[B; 32]) -> bool

-

fn ne(&self, other: &[B; 32]) -> bool

-

impl<'a, 'b, A, B> PartialEq<&'b [B; 32]> for Vec<A> where A: PartialEq<B>

fn eq(&self, other: &&'b [B; 32]) -> bool

-

fn ne(&self, other: &&'b [B; 32]) -> bool

-

impl<T> PartialOrd<Vec<T>> for Vec<T> where T: PartialOrd<T>

fn partial_cmp(&self, other: &Vec<T>) -> Option<Ordering>

-

fn lt(&self, other: &Rhs) -> bool

-

fn le(&self, other: &Rhs) -> bool

-

fn gt(&self, other: &Rhs) -> bool

-

fn ge(&self, other: &Rhs) -> bool

-

impl<T> Eq for Vec<T> where T: Eq

impl<T> Ord for Vec<T> where T: Ord

fn cmp(&self, other: &Vec<T>) -> Ordering

-

impl<T> Drop for Vec<T>

fn drop(&mut self)

-

impl<T> Default for Vec<T>

fn default() -> Vec<T>

-

impl<T> Debug for Vec<T> where T: Debug

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

-

impl<T> AsRef<Vec<T>> for Vec<T>

fn as_ref(&self) -> &Vec<T>

-

impl<T> AsMut<Vec<T>> for Vec<T>1.5.0

fn as_mut(&mut self) -> &mut Vec<T>

-

impl<T> AsRef<[T]> for Vec<T>

fn as_ref(&self) -> &[T]

-

impl<T> AsMut<[T]> for Vec<T>1.5.0

fn as_mut(&mut self) -> &mut [T]

-

impl<'a, T> From<&'a [T]> for Vec<T> where T: Clone

fn from(s: &'a [T]) -> Vec<T>

-

impl<'a> From<&'a str> for Vec<u8>

fn from(s: &'a str) -> Vec<u8>

-

impl<T> Borrow<[T]> for Vec<T>

fn borrow(&self) -> &[T]

-

impl<T> BorrowMut<[T]> for Vec<T>

fn borrow_mut(&mut self) -> &mut [T]

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/index.html b/doc/bitflags/index.html deleted file mode 100644 index 1eb064de..00000000 --- a/doc/bitflags/index.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - - - - - - - bitflags - Rust - - - - - - - - - - - - - - - - - -
-

Crate bitflags - - [−] - - [src]

-

A typesafe bitmask flag generator.

-

Modules

- - - - -
__core - -

Macros

- - - - -
bitflags! -

The bitflags! macro generates a struct that holds a set of C-style -bitmask flags. It is useful for creating typesafe wrappers for C APIs.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/macro.bitflags!.html b/doc/bitflags/macro.bitflags!.html deleted file mode 100644 index d47059e0..00000000 --- a/doc/bitflags/macro.bitflags!.html +++ /dev/null @@ -1,278 +0,0 @@ - - - - - - - - - - bitflags::bitflags! - Rust - - - - - - - - - - - - - - - - - -
-

bitflags::bitflags! - - [−] - - [src]

-
-macro_rules! bitflags {
-    ($(#[$attr:meta])* pub flags $BitFlags:ident: $T:ty {
-        $($(#[$Flag_attr:meta])* const $Flag:ident = $value:expr),+
-    }) => { ... };
-    ($(#[$attr:meta])* flags $BitFlags:ident: $T:ty {
-        $($(#[$Flag_attr:meta])* const $Flag:ident = $value:expr),+
-    }) => { ... };
-    (@_impl flags $BitFlags:ident: $T:ty {
-        $($(#[$Flag_attr:meta])* const $Flag:ident = $value:expr),+
-    }) => { ... };
-    ($(#[$attr:meta])* pub flags $BitFlags:ident: $T:ty {
-        $($(#[$Flag_attr:meta])* const $Flag:ident = $value:expr),+,
-    }) => { ... };
-    ($(#[$attr:meta])* flags $BitFlags:ident: $T:ty {
-        $($(#[$Flag_attr:meta])* const $Flag:ident = $value:expr),+,
-    }) => { ... };
-}
-

The bitflags! macro generates a struct that holds a set of C-style -bitmask flags. It is useful for creating typesafe wrappers for C APIs.

- -

The flags should only be defined for integer types, otherwise unexpected -type errors may occur at compile time.

- -

Example

-
-#![cfg_attr(feature = "assignment_operators", feature(augmented_assignments, op_assign_traits))]
-#[macro_use]
-extern crate bitflags;
-
-bitflags! {
-    flags Flags: u32 {
-        const FLAG_A       = 0b00000001,
-        const FLAG_B       = 0b00000010,
-        const FLAG_C       = 0b00000100,
-        const FLAG_ABC     = FLAG_A.bits
-                           | FLAG_B.bits
-                           | FLAG_C.bits,
-    }
-}
-
-fn main() {
-    let e1 = FLAG_A | FLAG_C;
-    let e2 = FLAG_B | FLAG_C;
-    assert!((e1 | e2) == FLAG_ABC);   // union
-    assert!((e1 & e2) == FLAG_C);     // intersection
-    assert!((e1 - e2) == FLAG_A);     // set difference
-    assert!(!e2 == FLAG_A);           // set complement
-}
- -

The generated structs can also be extended with type and trait -implementations:

- -
-#![cfg_attr(feature = "assignment_operators", feature(augmented_assignments, op_assign_traits))]
-#[macro_use]
-extern crate bitflags;
-
-use std::fmt;
-
-bitflags! {
-    flags Flags: u32 {
-        const FLAG_A   = 0b00000001,
-        const FLAG_B   = 0b00000010,
-    }
-}
-
-impl Flags {
-    pub fn clear(&mut self) {
-        self.bits = 0;  // The `bits` field can be accessed from within the
-                        // same module where the `bitflags!` macro was invoked.
-    }
-}
-
-impl fmt::Display for Flags {
-    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
-        write!(f, "hi!")
-    }
-}
-
-fn main() {
-    let mut flags = FLAG_A | FLAG_B;
-    flags.clear();
-    assert!(flags.is_empty());
-    assert_eq!(format!("{}", flags), "hi!");
-    assert_eq!(format!("{:?}", FLAG_A | FLAG_B), "FLAG_A | FLAG_B");
-    assert_eq!(format!("{:?}", FLAG_B), "FLAG_B");
-}
- -

Visibility

-

The generated struct and its associated flag constants are not exported -out of the current module by default. A definition can be exported out of -the current module by adding pub before flags:

- -
-#[macro_use]
-extern crate bitflags;
-
-mod example {
-    bitflags! {
-        pub flags Flags1: u32 {
-            const FLAG_A   = 0b00000001,
-        }
-    }
-    bitflags! {
-        flags Flags2: u32 {
-            const FLAG_B   = 0b00000010,
-        }
-    }
-}
-
-fn main() {
-    let flag1 = example::FLAG_A;
-    let flag2 = example::FLAG_B; // error: const `FLAG_B` is private
-}
- -

Attributes

-

Attributes can be attached to the generated struct by placing them -before the flags keyword.

- -

Trait implementations

-

The Copy, Clone, PartialEq, Eq, PartialOrd, Ord and Hash -traits automatically derived for the struct using the derive attribute. -Additional traits can be derived by providing an explicit derive -attribute on flags.

- -

The FromIterator trait is implemented for the struct, too, calculating -the union of the instances of the struct iterated over.

- -

The Debug trait is also implemented by displaying the bits value of the -internal struct.

- -

Operators

-

The following operator traits are implemented for the generated struct:

- -
    -
  • BitOr and BitOrAssign: union
    • -
  • BitAnd and BitAndAssign: intersection
    • -
  • BitXor and BitXorAssign: toggle
    • -
  • Sub and SubAssign: set difference
    • -
  • Not: set complement
    • -
- -

As long as the assignment operators are unstable rust feature they are only -available with the crate feature assignment_ops enabled.

- -

Methods

-

The following methods are defined for the generated struct:

- -
    -
  • empty: an empty set of flags
    • -
  • all: the set of all flags
    • -
  • bits: the raw value of the flags currently stored
    • -
  • from_bits: convert from underlying bit representation, unless that - representation contains bits that do not correspond to a flag
    • -
  • from_bits_truncate: convert from underlying bit representation, dropping - any bits that do not correspond to flags
    • -
  • is_empty: true if no flags are currently stored
    • -
  • is_all: true if all flags are currently set
    • -
  • intersects: true if there are flags common to both self and other
    • -
  • contains: true all of the flags in other are contained within self
    • -
  • insert: inserts the specified flags in-place
    • -
  • remove: removes the specified flags in-place
    • -
  • toggle: the specified flags will be inserted if not present, and removed - if they are.
    • -
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/bitflags/sidebar-items.js b/doc/bitflags/sidebar-items.js deleted file mode 100644 index 4ad9f234..00000000 --- a/doc/bitflags/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"macro":[["bitflags!","The `bitflags!` macro generates a `struct` that holds a set of C-style bitmask flags. It is useful for creating typesafe wrappers for C APIs."]],"mod":[["__core",""]]}); \ No newline at end of file diff --git a/doc/byteorder/enum.BigEndian.html b/doc/byteorder/enum.BigEndian.html deleted file mode 100644 index 752acac2..00000000 --- a/doc/byteorder/enum.BigEndian.html +++ /dev/null @@ -1,136 +0,0 @@ - - - - - - - - - - byteorder::BigEndian - Rust - - - - - - - - - - - - - - - - - -
-

Enum byteorder::BigEndian - - [−] - - [src]

-
pub enum BigEndian {}

Defines big-endian serialization.

- -

Note that this type has no value constructor. It is used purely at the -type level.

-

Trait Implementations

impl ByteOrder for BigEndian

fn read_u16(buf: &[u8]) -> u16

-

fn read_u32(buf: &[u8]) -> u32

-

fn read_u64(buf: &[u8]) -> u64

-

fn read_uint(buf: &[u8], nbytes: usize) -> u64

-

fn write_u16(buf: &mut [u8], n: u16)

-

fn write_u32(buf: &mut [u8], n: u32)

-

fn write_u64(buf: &mut [u8], n: u64)

-

fn write_uint(buf: &mut [u8], n: u64, nbytes: usize)

-

fn read_i16(buf: &[u8]) -> i16

-

fn read_i32(buf: &[u8]) -> i32

-

fn read_i64(buf: &[u8]) -> i64

-

fn read_int(buf: &[u8], nbytes: usize) -> i64

-

fn read_f32(buf: &[u8]) -> f32

-

fn read_f64(buf: &[u8]) -> f64

-

fn write_i16(buf: &mut [u8], n: i16)

-

fn write_i32(buf: &mut [u8], n: i32)

-

fn write_i64(buf: &mut [u8], n: i64)

-

fn write_int(buf: &mut [u8], n: i64, nbytes: usize)

-

fn write_f32(buf: &mut [u8], n: f32)

-

fn write_f64(buf: &mut [u8], n: f64)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/byteorder/enum.LittleEndian.html b/doc/byteorder/enum.LittleEndian.html deleted file mode 100644 index 246fbd1a..00000000 --- a/doc/byteorder/enum.LittleEndian.html +++ /dev/null @@ -1,136 +0,0 @@ - - - - - - - - - - byteorder::LittleEndian - Rust - - - - - - - - - - - - - - - - - -
-

Enum byteorder::LittleEndian - - [−] - - [src]

-
pub enum LittleEndian {}

Defines little-endian serialization.

- -

Note that this type has no value constructor. It is used purely at the -type level.

-

Trait Implementations

impl ByteOrder for LittleEndian

fn read_u16(buf: &[u8]) -> u16

-

fn read_u32(buf: &[u8]) -> u32

-

fn read_u64(buf: &[u8]) -> u64

-

fn read_uint(buf: &[u8], nbytes: usize) -> u64

-

fn write_u16(buf: &mut [u8], n: u16)

-

fn write_u32(buf: &mut [u8], n: u32)

-

fn write_u64(buf: &mut [u8], n: u64)

-

fn write_uint(buf: &mut [u8], n: u64, nbytes: usize)

-

fn read_i16(buf: &[u8]) -> i16

-

fn read_i32(buf: &[u8]) -> i32

-

fn read_i64(buf: &[u8]) -> i64

-

fn read_int(buf: &[u8], nbytes: usize) -> i64

-

fn read_f32(buf: &[u8]) -> f32

-

fn read_f64(buf: &[u8]) -> f64

-

fn write_i16(buf: &mut [u8], n: i16)

-

fn write_i32(buf: &mut [u8], n: i32)

-

fn write_i64(buf: &mut [u8], n: i64)

-

fn write_int(buf: &mut [u8], n: i64, nbytes: usize)

-

fn write_f32(buf: &mut [u8], n: f32)

-

fn write_f64(buf: &mut [u8], n: f64)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/byteorder/index.html b/doc/byteorder/index.html deleted file mode 100644 index 9fda8231..00000000 --- a/doc/byteorder/index.html +++ /dev/null @@ -1,196 +0,0 @@ - - - - - - - - - - byteorder - Rust - - - - - - - - - - - - - - - - - -
-

Crate byteorder - - [−] - - [src]

-

This crate provides convenience methods for encoding and decoding numbers -in either big-endian or little-endian order.

- -

The organization of the crate is pretty simple. A trait, ByteOrder, specifies -byte conversion methods for each type of number in Rust (sans numbers that have -a platform dependent size like usize and isize). Two types, BigEndian -and LittleEndian implement these methods. Finally, ReadBytesExt and -WriteBytesExt provide convenience methods available to all types that -implement Read and Write.

- -

Examples

-

Read unsigned 16 bit big-endian integers from a Read type:

- -
-use std::io::Cursor;
-use byteorder::{BigEndian, ReadBytesExt};
-
-let mut rdr = Cursor::new(vec![2, 5, 3, 0]);
-// Note that we use type parameters to indicate which kind of byte order
-// we want!
-assert_eq!(517, rdr.read_u16::<BigEndian>().unwrap());
-assert_eq!(768, rdr.read_u16::<BigEndian>().unwrap());
- -

Write unsigned 16 bit little-endian integers to a Write type:

- -
-use byteorder::{LittleEndian, WriteBytesExt};
-
-let mut wtr = vec![];
-wtr.write_u16::<LittleEndian>(517).unwrap();
-wtr.write_u16::<LittleEndian>(768).unwrap();
-assert_eq!(wtr, vec![5, 2, 0, 3]);
-

Enums

- - - - - - - - -
BigEndian -

Defines big-endian serialization.

-
LittleEndian -

Defines little-endian serialization.

-

Traits

- - - - - - - - - - - - -
ByteOrder -

ByteOrder describes types that can serialize integers as bytes.

-
ReadBytesExt -

Extends Read with methods for reading numbers. (For std::io.)

-
WriteBytesExt -

Extends Write with methods for writing numbers. (For std::io.)

-

Type Definitions

- - - - - - - - -
NativeEndian -

Defines system native-endian serialization.

-
NetworkEndian -

Defines network byte order serialization.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/byteorder/new/index.html b/doc/byteorder/new/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/byteorder/new/sidebar-items.js b/doc/byteorder/new/sidebar-items.js deleted file mode 100644 index 9494fcf3..00000000 --- a/doc/byteorder/new/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"trait":[["ReadBytesExt","Extends `Read` with methods for reading numbers. (For `std::io`.)"],["WriteBytesExt","Extends `Write` with methods for writing numbers. (For `std::io`.)"]]}); \ No newline at end of file diff --git a/doc/byteorder/new/trait.ReadBytesExt.html b/doc/byteorder/new/trait.ReadBytesExt.html deleted file mode 100644 index c93c35ff..00000000 --- a/doc/byteorder/new/trait.ReadBytesExt.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../byteorder/trait.ReadBytesExt.html...

- - - \ No newline at end of file diff --git a/doc/byteorder/new/trait.WriteBytesExt.html b/doc/byteorder/new/trait.WriteBytesExt.html deleted file mode 100644 index bd7d12d0..00000000 --- a/doc/byteorder/new/trait.WriteBytesExt.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../byteorder/trait.WriteBytesExt.html...

- - - \ No newline at end of file diff --git a/doc/byteorder/sidebar-items.js b/doc/byteorder/sidebar-items.js deleted file mode 100644 index 094ed8d4..00000000 --- a/doc/byteorder/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["BigEndian","Defines big-endian serialization."],["LittleEndian","Defines little-endian serialization."]],"trait":[["ByteOrder","ByteOrder describes types that can serialize integers as bytes."],["ReadBytesExt","Extends `Read` with methods for reading numbers. (For `std::io`.)"],["WriteBytesExt","Extends `Write` with methods for writing numbers. (For `std::io`.)"]],"type":[["NativeEndian","Defines system native-endian serialization."],["NetworkEndian","Defines network byte order serialization."]]}); \ No newline at end of file diff --git a/doc/byteorder/trait.ByteOrder.html b/doc/byteorder/trait.ByteOrder.html deleted file mode 100644 index 29bf78ba..00000000 --- a/doc/byteorder/trait.ByteOrder.html +++ /dev/null @@ -1,238 +0,0 @@ - - - - - - - - - - byteorder::ByteOrder - Rust - - - - - - - - - - - - - - - - - -
-

Trait byteorder::ByteOrder - - [−] - - [src]

-
pub trait ByteOrder {
-    fn read_u16(buf: &[u8]) -> u16;
-    fn read_u32(buf: &[u8]) -> u32;
-    fn read_u64(buf: &[u8]) -> u64;
-    fn read_uint(buf: &[u8], nbytes: usize) -> u64;
-    fn write_u16(buf: &mut [u8], n: u16);
-    fn write_u32(buf: &mut [u8], n: u32);
-    fn write_u64(buf: &mut [u8], n: u64);
-    fn write_uint(buf: &mut [u8], n: u64, nbytes: usize);
-
-    fn read_i16(buf: &[u8]) -> i16 { ... }
-    fn read_i32(buf: &[u8]) -> i32 { ... }
-    fn read_i64(buf: &[u8]) -> i64 { ... }
-    fn read_int(buf: &[u8], nbytes: usize) -> i64 { ... }
-    fn read_f32(buf: &[u8]) -> f32 { ... }
-    fn read_f64(buf: &[u8]) -> f64 { ... }
-    fn write_i16(buf: &mut [u8], n: i16) { ... }
-    fn write_i32(buf: &mut [u8], n: i32) { ... }
-    fn write_i64(buf: &mut [u8], n: i64) { ... }
-    fn write_int(buf: &mut [u8], n: i64, nbytes: usize) { ... }
-    fn write_f32(buf: &mut [u8], n: f32) { ... }
-    fn write_f64(buf: &mut [u8], n: f64) { ... }
-}

ByteOrder describes types that can serialize integers as bytes.

- -

Note that Self does not appear anywhere in this trait's definition! -Therefore, in order to use it, you'll need to use syntax like -T::read_u16(&[0, 1]) where T implements ByteOrder.

- -

This crate provides two types that implement ByteOrder: BigEndian -and LittleEndian.

- -

Examples

-

Write and read u32 numbers in little endian order:

- -
-use byteorder::{ByteOrder, LittleEndian};
-
-let mut buf = [0; 4];
-LittleEndian::write_u32(&mut buf, 1_000_000);
-assert_eq!(1_000_000, LittleEndian::read_u32(&buf));
- -

Write and read i16 numbers in big endian order:

- -
-use byteorder::{ByteOrder, BigEndian};
-
-let mut buf = [0; 2];
-BigEndian::write_i16(&mut buf, -50_000);
-assert_eq!(-50_000, BigEndian::read_i16(&buf));
-
-

Required Methods

-
-

fn read_u16(buf: &[u8]) -> u16

Reads an unsigned 16 bit integer from buf.

- -

Panics when buf.len() < 2.

-

fn read_u32(buf: &[u8]) -> u32

Reads an unsigned 32 bit integer from buf.

- -

Panics when buf.len() < 4.

-

fn read_u64(buf: &[u8]) -> u64

Reads an unsigned 64 bit integer from buf.

- -

Panics when buf.len() < 8.

-

fn read_uint(buf: &[u8], nbytes: usize) -> u64

Reads an unsigned n-bytes integer from buf.

- -

Panics when nbytes < 1 or nbytes > 8 or -buf.len() < nbytes

-

fn write_u16(buf: &mut [u8], n: u16)

Writes an unsigned 16 bit integer n to buf.

- -

Panics when buf.len() < 2.

-

fn write_u32(buf: &mut [u8], n: u32)

Writes an unsigned 32 bit integer n to buf.

- -

Panics when buf.len() < 4.

-

fn write_u64(buf: &mut [u8], n: u64)

Writes an unsigned 64 bit integer n to buf.

- -

Panics when buf.len() < 8.

-

fn write_uint(buf: &mut [u8], n: u64, nbytes: usize)

Writes an unsigned integer n to buf using only nbytes.

- -

If n is not representable in nbytes, or if nbytes is > 8, then -this method panics.

-
-

Provided Methods

-
-

fn read_i16(buf: &[u8]) -> i16

Reads a signed 16 bit integer from buf.

- -

Panics when buf.len() < 2.

-

fn read_i32(buf: &[u8]) -> i32

Reads a signed 32 bit integer from buf.

- -

Panics when buf.len() < 4.

-

fn read_i64(buf: &[u8]) -> i64

Reads a signed 64 bit integer from buf.

- -

Panics when buf.len() < 8.

-

fn read_int(buf: &[u8], nbytes: usize) -> i64

Reads a signed n-bytes integer from buf.

- -

Panics when nbytes < 1 or nbytes > 8 or -buf.len() < nbytes

-

fn read_f32(buf: &[u8]) -> f32

Reads a IEEE754 single-precision (4 bytes) floating point number.

- -

Panics when buf.len() < 4.

-

fn read_f64(buf: &[u8]) -> f64

Reads a IEEE754 double-precision (8 bytes) floating point number.

- -

Panics when buf.len() < 8.

-

fn write_i16(buf: &mut [u8], n: i16)

Writes a signed 16 bit integer n to buf.

- -

Panics when buf.len() < 2.

-

fn write_i32(buf: &mut [u8], n: i32)

Writes a signed 32 bit integer n to buf.

- -

Panics when buf.len() < 4.

-

fn write_i64(buf: &mut [u8], n: i64)

Writes a signed 64 bit integer n to buf.

- -

Panics when buf.len() < 8.

-

fn write_int(buf: &mut [u8], n: i64, nbytes: usize)

Writes a signed integer n to buf using only nbytes.

- -

If n is not representable in nbytes, or if nbytes is > 8, then -this method panics.

-

fn write_f32(buf: &mut [u8], n: f32)

Writes a IEEE754 single-precision (4 bytes) floating point number.

- -

Panics when buf.len() < 4.

-

fn write_f64(buf: &mut [u8], n: f64)

Writes a IEEE754 double-precision (8 bytes) floating point number.

- -

Panics when buf.len() < 8.

-
-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/byteorder/trait.ReadBytesExt.html b/doc/byteorder/trait.ReadBytesExt.html deleted file mode 100644 index d91d8d53..00000000 --- a/doc/byteorder/trait.ReadBytesExt.html +++ /dev/null @@ -1,169 +0,0 @@ - - - - - - - - - - byteorder::ReadBytesExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait byteorder::ReadBytesExt - - [−] - - [src]

-
pub trait ReadBytesExt: Read {
-    fn read_u8(&mut self) -> Result<u8> { ... }
-    fn read_i8(&mut self) -> Result<i8> { ... }
-    fn read_u16<T: ByteOrder>(&mut self) -> Result<u16> { ... }
-    fn read_i16<T: ByteOrder>(&mut self) -> Result<i16> { ... }
-    fn read_u32<T: ByteOrder>(&mut self) -> Result<u32> { ... }
-    fn read_i32<T: ByteOrder>(&mut self) -> Result<i32> { ... }
-    fn read_u64<T: ByteOrder>(&mut self) -> Result<u64> { ... }
-    fn read_i64<T: ByteOrder>(&mut self) -> Result<i64> { ... }
-    fn read_uint<T: ByteOrder>(&mut self, nbytes: usize) -> Result<u64> { ... }
-    fn read_int<T: ByteOrder>(&mut self, nbytes: usize) -> Result<i64> { ... }
-    fn read_f32<T: ByteOrder>(&mut self) -> Result<f32> { ... }
-    fn read_f64<T: ByteOrder>(&mut self) -> Result<f64> { ... }
-}

Extends Read with methods for reading numbers. (For std::io.)

- -

Most of the methods defined here have an unconstrained type parameter that -must be explicitly instantiated. Typically, it is instantiated with either -the BigEndian or LittleEndian types defined in this crate.

- -

Examples

-

Read unsigned 16 bit big-endian integers from a Read:

- -
-use std::io::Cursor;
-use byteorder::{BigEndian, ReadBytesExt};
-
-let mut rdr = Cursor::new(vec![2, 5, 3, 0]);
-assert_eq!(517, rdr.read_u16::<BigEndian>().unwrap());
-assert_eq!(768, rdr.read_u16::<BigEndian>().unwrap());
-
-

Provided Methods

-
-

fn read_u8(&mut self) -> Result<u8>

Reads an unsigned 8 bit integer from the underlying reader.

- -

Note that since this reads a single byte, no byte order conversions -are used. It is included for completeness.

-

fn read_i8(&mut self) -> Result<i8>

Reads a signed 8 bit integer from the underlying reader.

- -

Note that since this reads a single byte, no byte order conversions -are used. It is included for completeness.

-

fn read_u16<T: ByteOrder>(&mut self) -> Result<u16>

Reads an unsigned 16 bit integer from the underlying reader.

-

fn read_i16<T: ByteOrder>(&mut self) -> Result<i16>

Reads a signed 16 bit integer from the underlying reader.

-

fn read_u32<T: ByteOrder>(&mut self) -> Result<u32>

Reads an unsigned 32 bit integer from the underlying reader.

-

fn read_i32<T: ByteOrder>(&mut self) -> Result<i32>

Reads a signed 32 bit integer from the underlying reader.

-

fn read_u64<T: ByteOrder>(&mut self) -> Result<u64>

Reads an unsigned 64 bit integer from the underlying reader.

-

fn read_i64<T: ByteOrder>(&mut self) -> Result<i64>

Reads a signed 64 bit integer from the underlying reader.

-

fn read_uint<T: ByteOrder>(&mut self, nbytes: usize) -> Result<u64>

Reads an unsigned n-bytes integer from the underlying reader.

-

fn read_int<T: ByteOrder>(&mut self, nbytes: usize) -> Result<i64>

Reads a signed n-bytes integer from the underlying reader.

-

fn read_f32<T: ByteOrder>(&mut self) -> Result<f32>

Reads a IEEE754 single-precision (4 bytes) floating point number from -the underlying reader.

-

fn read_f64<T: ByteOrder>(&mut self) -> Result<f64>

Reads a IEEE754 double-precision (8 bytes) floating point number from -the underlying reader.

-
-

Implementors

-
    -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/byteorder/trait.WriteBytesExt.html b/doc/byteorder/trait.WriteBytesExt.html deleted file mode 100644 index 31aeb533..00000000 --- a/doc/byteorder/trait.WriteBytesExt.html +++ /dev/null @@ -1,175 +0,0 @@ - - - - - - - - - - byteorder::WriteBytesExt - Rust - - - - - - - - - - - - - - - - - -
-

Trait byteorder::WriteBytesExt - - [−] - - [src]

-
pub trait WriteBytesExt: Write {
-    fn write_u8(&mut self, n: u8) -> Result<()> { ... }
-    fn write_i8(&mut self, n: i8) -> Result<()> { ... }
-    fn write_u16<T: ByteOrder>(&mut self, n: u16) -> Result<()> { ... }
-    fn write_i16<T: ByteOrder>(&mut self, n: i16) -> Result<()> { ... }
-    fn write_u32<T: ByteOrder>(&mut self, n: u32) -> Result<()> { ... }
-    fn write_i32<T: ByteOrder>(&mut self, n: i32) -> Result<()> { ... }
-    fn write_u64<T: ByteOrder>(&mut self, n: u64) -> Result<()> { ... }
-    fn write_i64<T: ByteOrder>(&mut self, n: i64) -> Result<()> { ... }
-    fn write_uint<T: ByteOrder>(&mut self, n: u64, nbytes: usize) -> Result<()> { ... }
-    fn write_int<T: ByteOrder>(&mut self, n: i64, nbytes: usize) -> Result<()> { ... }
-    fn write_f32<T: ByteOrder>(&mut self, n: f32) -> Result<()> { ... }
-    fn write_f64<T: ByteOrder>(&mut self, n: f64) -> Result<()> { ... }
-}

Extends Write with methods for writing numbers. (For std::io.)

- -

Most of the methods defined here have an unconstrained type parameter that -must be explicitly instantiated. Typically, it is instantiated with either -the BigEndian or LittleEndian types defined in this crate.

- -

Examples

-

Write unsigned 16 bit big-endian integers to a Write:

- -
-use byteorder::{BigEndian, WriteBytesExt};
-
-let mut wtr = vec![];
-wtr.write_u16::<BigEndian>(517).unwrap();
-wtr.write_u16::<BigEndian>(768).unwrap();
-assert_eq!(wtr, vec![2, 5, 3, 0]);
-
-

Provided Methods

-
-

fn write_u8(&mut self, n: u8) -> Result<()>

Writes an unsigned 8 bit integer to the underlying writer.

- -

Note that since this writes a single byte, no byte order conversions -are used. It is included for completeness.

-

fn write_i8(&mut self, n: i8) -> Result<()>

Writes a signed 8 bit integer to the underlying writer.

- -

Note that since this writes a single byte, no byte order conversions -are used. It is included for completeness.

-

fn write_u16<T: ByteOrder>(&mut self, n: u16) -> Result<()>

Writes an unsigned 16 bit integer to the underlying writer.

-

fn write_i16<T: ByteOrder>(&mut self, n: i16) -> Result<()>

Writes a signed 16 bit integer to the underlying writer.

-

fn write_u32<T: ByteOrder>(&mut self, n: u32) -> Result<()>

Writes an unsigned 32 bit integer to the underlying writer.

-

fn write_i32<T: ByteOrder>(&mut self, n: i32) -> Result<()>

Writes a signed 32 bit integer to the underlying writer.

-

fn write_u64<T: ByteOrder>(&mut self, n: u64) -> Result<()>

Writes an unsigned 64 bit integer to the underlying writer.

-

fn write_i64<T: ByteOrder>(&mut self, n: i64) -> Result<()>

Writes a signed 64 bit integer to the underlying writer.

-

fn write_uint<T: ByteOrder>(&mut self, n: u64, nbytes: usize) -> Result<()>

Writes an unsigned n-bytes integer to the underlying writer.

- -

If the given integer is not representable in the given number of bytes, -this method panics. If nbytes > 8, this method panics.

-

fn write_int<T: ByteOrder>(&mut self, n: i64, nbytes: usize) -> Result<()>

Writes a signed n-bytes integer to the underlying writer.

- -

If the given integer is not representable in the given number of bytes, -this method panics. If nbytes > 8, this method panics.

-

fn write_f32<T: ByteOrder>(&mut self, n: f32) -> Result<()>

Writes a IEEE754 single-precision (4 bytes) floating point number to -the underlying writer.

-

fn write_f64<T: ByteOrder>(&mut self, n: f64) -> Result<()>

Writes a IEEE754 double-precision (8 bytes) floating point number to -the underlying writer.

-
-

Implementors

-
    -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/byteorder/type.NativeEndian.html b/doc/byteorder/type.NativeEndian.html deleted file mode 100644 index 9c1cbab1..00000000 --- a/doc/byteorder/type.NativeEndian.html +++ /dev/null @@ -1,116 +0,0 @@ - - - - - - - - - - byteorder::NativeEndian - Rust - - - - - - - - - - - - - - - - - -
-

byteorder::NativeEndian - - [−] - - [src]

-
type NativeEndian = LittleEndian;

Defines system native-endian serialization.

- -

Note that this type has no value constructor. It is used purely at the -type level.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/byteorder/type.NetworkEndian.html b/doc/byteorder/type.NetworkEndian.html deleted file mode 100644 index 0235e50f..00000000 --- a/doc/byteorder/type.NetworkEndian.html +++ /dev/null @@ -1,120 +0,0 @@ - - - - - - - - - - byteorder::NetworkEndian - Rust - - - - - - - - - - - - - - - - - -
-

byteorder::NetworkEndian - - [−] - - [src]

-
type NetworkEndian = BigEndian;

Defines network byte order serialization.

- -

Network byte order is defined by RFC 1700 to be big-endian, and is -referred to in several protocol specifications. This type is an alias of -BigEndian.

- -

Note that this type has no value constructor. It is used purely at the -type level.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/app/enum.AppSettings.html b/doc/clap/app/enum.AppSettings.html deleted file mode 100644 index 8ea40af4..00000000 --- a/doc/clap/app/enum.AppSettings.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../clap/enum.AppSettings.html...

- - - \ No newline at end of file diff --git a/doc/clap/app/help/index.html b/doc/clap/app/help/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/app/help/sidebar-items.js b/doc/clap/app/help/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/app/help/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/app/index.html b/doc/clap/app/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/app/macros/index.html b/doc/clap/app/macros/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/app/macros/sidebar-items.js b/doc/clap/app/macros/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/app/macros/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/app/meta/index.html b/doc/clap/app/meta/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/app/meta/sidebar-items.js b/doc/clap/app/meta/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/app/meta/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/app/parser/index.html b/doc/clap/app/parser/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/app/parser/sidebar-items.js b/doc/clap/app/parser/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/app/parser/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/app/settings/enum.AppSettings.html b/doc/clap/app/settings/enum.AppSettings.html deleted file mode 100644 index 12aff316..00000000 --- a/doc/clap/app/settings/enum.AppSettings.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../clap/enum.AppSettings.html...

- - - \ No newline at end of file diff --git a/doc/clap/app/settings/index.html b/doc/clap/app/settings/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/app/settings/sidebar-items.js b/doc/clap/app/settings/sidebar-items.js deleted file mode 100644 index 0e8b09bc..00000000 --- a/doc/clap/app/settings/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["AppSettings","Application level settings, which affect how `App` operates"]]}); \ No newline at end of file diff --git a/doc/clap/app/sidebar-items.js b/doc/clap/app/sidebar-items.js deleted file mode 100644 index cc6e1577..00000000 --- a/doc/clap/app/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["AppSettings","Application level settings, which affect how `App` operates"]],"struct":[["App","Used to create a representation of a command line program and all possible command line arguments. Application settings are set using the \"builder pattern\" with the `.get_matches()` family of methods being the terminal methods that starts the runtime-parsing process. These methods then return information about the user supplied arguments (or lack there of)."]]}); \ No newline at end of file diff --git a/doc/clap/app/struct.App.html b/doc/clap/app/struct.App.html deleted file mode 100644 index 7fb5a751..00000000 --- a/doc/clap/app/struct.App.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../clap/struct.App.html...

- - - \ No newline at end of file diff --git a/doc/clap/args/any_arg/index.html b/doc/clap/args/any_arg/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/args/any_arg/sidebar-items.js b/doc/clap/args/any_arg/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/args/any_arg/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/args/arg/index.html b/doc/clap/args/arg/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/args/arg/sidebar-items.js b/doc/clap/args/arg/sidebar-items.js deleted file mode 100644 index babfc7ce..00000000 --- a/doc/clap/args/arg/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["Arg","The abstract representation of a command line argument. Used to set all the options and relationships that define a valid argument for the program."]]}); \ No newline at end of file diff --git a/doc/clap/args/arg/struct.Arg.html b/doc/clap/args/arg/struct.Arg.html deleted file mode 100644 index 66cac627..00000000 --- a/doc/clap/args/arg/struct.Arg.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../clap/struct.Arg.html...

- - - \ No newline at end of file diff --git a/doc/clap/args/arg_builder/flag/index.html b/doc/clap/args/arg_builder/flag/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/args/arg_builder/flag/sidebar-items.js b/doc/clap/args/arg_builder/flag/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/args/arg_builder/flag/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/args/arg_builder/index.html b/doc/clap/args/arg_builder/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/args/arg_builder/option/index.html b/doc/clap/args/arg_builder/option/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/args/arg_builder/option/sidebar-items.js b/doc/clap/args/arg_builder/option/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/args/arg_builder/option/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/args/arg_builder/positional/index.html b/doc/clap/args/arg_builder/positional/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/args/arg_builder/positional/sidebar-items.js b/doc/clap/args/arg_builder/positional/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/args/arg_builder/positional/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/args/arg_builder/sidebar-items.js b/doc/clap/args/arg_builder/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/args/arg_builder/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/args/arg_matcher/index.html b/doc/clap/args/arg_matcher/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/args/arg_matcher/sidebar-items.js b/doc/clap/args/arg_matcher/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/args/arg_matcher/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/args/arg_matches/index.html b/doc/clap/args/arg_matches/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/args/arg_matches/sidebar-items.js b/doc/clap/args/arg_matches/sidebar-items.js deleted file mode 100644 index ed2929f0..00000000 --- a/doc/clap/args/arg_matches/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["ArgMatches","Used to get information about the arguments that where supplied to the program at runtime by the user. New instances of this struct are obtained by using the `App::get_matches` family of methods."]]}); \ No newline at end of file diff --git a/doc/clap/args/arg_matches/struct.ArgMatches.html b/doc/clap/args/arg_matches/struct.ArgMatches.html deleted file mode 100644 index 7cb34723..00000000 --- a/doc/clap/args/arg_matches/struct.ArgMatches.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../clap/struct.ArgMatches.html...

- - - \ No newline at end of file diff --git a/doc/clap/args/group/index.html b/doc/clap/args/group/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/args/group/sidebar-items.js b/doc/clap/args/group/sidebar-items.js deleted file mode 100644 index be905c9b..00000000 --- a/doc/clap/args/group/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["ArgGroup","`ArgGroup`s are a family of related arguments and way for you to express, \"Any of these arguments\". By placing arguments in a logical group, you can create easier requirement and exclusion rules instead of having to list each argument individually, or when you want a rule to apply \"any but not all\" arguments."]]}); \ No newline at end of file diff --git a/doc/clap/args/group/struct.ArgGroup.html b/doc/clap/args/group/struct.ArgGroup.html deleted file mode 100644 index 6084eb59..00000000 --- a/doc/clap/args/group/struct.ArgGroup.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../clap/struct.ArgGroup.html...

- - - \ No newline at end of file diff --git a/doc/clap/args/index.html b/doc/clap/args/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/args/matched_arg/index.html b/doc/clap/args/matched_arg/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/args/matched_arg/sidebar-items.js b/doc/clap/args/matched_arg/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/args/matched_arg/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/args/settings/index.html b/doc/clap/args/settings/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/args/settings/sidebar-items.js b/doc/clap/args/settings/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/args/settings/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/args/sidebar-items.js b/doc/clap/args/sidebar-items.js deleted file mode 100644 index 3dd7d46b..00000000 --- a/doc/clap/args/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"mod":[["any_arg",""],["settings",""]],"struct":[["Arg","The abstract representation of a command line argument. Used to set all the options and relationships that define a valid argument for the program."],["ArgGroup","`ArgGroup`s are a family of related arguments and way for you to express, \"Any of these arguments\". By placing arguments in a logical group, you can create easier requirement and exclusion rules instead of having to list each argument individually, or when you want a rule to apply \"any but not all\" arguments."],["ArgMatches","Used to get information about the arguments that where supplied to the program at runtime by the user. New instances of this struct are obtained by using the `App::get_matches` family of methods."],["SubCommand","The abstract representation of a command line subcommand."]]}); \ No newline at end of file diff --git a/doc/clap/args/struct.Arg.html b/doc/clap/args/struct.Arg.html deleted file mode 100644 index 31e9776e..00000000 --- a/doc/clap/args/struct.Arg.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../clap/struct.Arg.html...

- - - \ No newline at end of file diff --git a/doc/clap/args/struct.ArgGroup.html b/doc/clap/args/struct.ArgGroup.html deleted file mode 100644 index 452ca3bc..00000000 --- a/doc/clap/args/struct.ArgGroup.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../clap/struct.ArgGroup.html...

- - - \ No newline at end of file diff --git a/doc/clap/args/struct.ArgMatches.html b/doc/clap/args/struct.ArgMatches.html deleted file mode 100644 index 23f44eff..00000000 --- a/doc/clap/args/struct.ArgMatches.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../clap/struct.ArgMatches.html...

- - - \ No newline at end of file diff --git a/doc/clap/args/struct.SubCommand.html b/doc/clap/args/struct.SubCommand.html deleted file mode 100644 index 3f25d990..00000000 --- a/doc/clap/args/struct.SubCommand.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../clap/struct.SubCommand.html...

- - - \ No newline at end of file diff --git a/doc/clap/args/subcommand/index.html b/doc/clap/args/subcommand/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/args/subcommand/sidebar-items.js b/doc/clap/args/subcommand/sidebar-items.js deleted file mode 100644 index d63064e5..00000000 --- a/doc/clap/args/subcommand/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["SubCommand","The abstract representation of a command line subcommand."]]}); \ No newline at end of file diff --git a/doc/clap/args/subcommand/struct.SubCommand.html b/doc/clap/args/subcommand/struct.SubCommand.html deleted file mode 100644 index 88a4e642..00000000 --- a/doc/clap/args/subcommand/struct.SubCommand.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../clap/struct.SubCommand.html...

- - - \ No newline at end of file diff --git a/doc/clap/enum.AppSettings.html b/doc/clap/enum.AppSettings.html deleted file mode 100644 index 36e65d1b..00000000 --- a/doc/clap/enum.AppSettings.html +++ /dev/null @@ -1,441 +0,0 @@ - - - - - - - - - - clap::AppSettings - Rust - - - - - - - - - - - - - - - - - -
-

Enum clap::AppSettings - - [−] - - [src]

-
pub enum AppSettings {
-    SubcommandsNegateReqs,
-    SubcommandRequired,
-    ArgRequiredElseHelp,
-    GlobalVersion,
-    VersionlessSubcommands,
-    UnifiedHelpMessage,
-    WaitOnError,
-    SubcommandRequiredElseHelp,
-    Hidden,
-    TrailingVarArg,
-    NoBinaryName,
-    AllowExternalSubcommands,
-    StrictUtf8,
-    AllowInvalidUtf8,
-    AllowLeadingHyphen,
-    HidePossibleValuesInHelp,
-    NextLineHelp,
-    DeriveDisplayOrder,
-    ColoredHelp,
-    // some variants omitted
-}

Application level settings, which affect how App operates

- -

NOTE: When these settings are used, they apply only to current command, and are not -propagated down or up through child or parent subcommands

-

Variants

-
SubcommandsNegateReqs

Allows subcommands to override all requirements of the parent command. For example -if you had a subcommand or top level application which had a required argument that -are only required as long as there is no subcommand present, using this setting would allow -you set those arguments to required(true) and yet receive no error so long as the user -uses a valid subcommand instead.

- -

NOTE: This defaults to false (using subcommand does not negate requirements)

- -

Examples

-

This first example shows that it is an error to not use a required argument

- -
-let err = App::new("myprog")
-    .setting(AppSettings::SubcommandsNegateReqs)
-    .arg(Arg::with_name("opt").required(true))
-    .subcommand(SubCommand::with_name("test"))
-    .get_matches_from_safe(vec![
-        "myprog"
-    ]);
-assert!(err.is_err());
-assert_eq!(err.unwrap_err().kind, ErrorKind::MissingRequiredArgument);
- -

This next example shows that it is no longer error to not use a required argument if a -valid subcommand is used.

- -
-let noerr = App::new("myprog")
-    .setting(AppSettings::SubcommandsNegateReqs)
-    .arg(Arg::with_name("opt").required(true))
-    .subcommand(SubCommand::with_name("test"))
-    .get_matches_from_safe(vec![
-        "myprog", "test"
-    ]);
-assert!(noerr.is_ok());
-
SubcommandRequired

Allows specifying that if no subcommand is present at runtime, error and exit gracefully

- -

NOTE: This defaults to false (subcommands do not need to be present)

- -

Examples

-
-let err = App::new("myprog")
-    .setting(AppSettings::SubcommandRequired)
-    .subcommand(SubCommand::with_name("test"))
-    .get_matches_from_safe(vec![
-        "myprog",
-    ]);
-assert!(err.is_err());
-assert_eq!(err.unwrap_err().kind, ErrorKind::MissingSubcommand);
-
ArgRequiredElseHelp

Specifies that the help text should be displayed (and then exit gracefully), if no -arguments are present at runtime (i.e. an empty run such as, $ myprog.

- -

NOTE: Subcommands count as arguments

- -

Examples

-
-App::new("myprog")
-    .setting(AppSettings::ArgRequiredElseHelp)
-
GlobalVersion

Specifies to version of the current command for all child subcommands. (Defaults to false; -subcommands have independant version strings from their parents)

- -

NOTE: The version for the current command and this setting must be set prior to -adding any child subcommands

- -

Examples

-
-App::new("myprog")
-    .version("v1.1")
-    .setting(AppSettings::GlobalVersion)
-    .subcommand(SubCommand::with_name("test"))
-    .get_matches();
-// running `$ myprog test --version` will display
-// "myprog-test v1.1"
-
VersionlessSubcommands

Disables -V and --version for all subcommands (Defaults to false; subcommands have -version flags)

- -

NOTE: This setting must be set prior adding any subcommands

- -

Examples

-
-let res = App::new("myprog")
-    .version("v1.1")
-    .setting(AppSettings::VersionlessSubcommands)
-    .subcommand(SubCommand::with_name("test"))
-    .get_matches_from_safe(vec![
-        "myprog", "test", "-V"
-    ]);
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::UnknownArgument);
-
UnifiedHelpMessage

Groups flags and options together presenting a more unified help message (a la getopts or -docopt style). The default is the auto-generated help message groups flags, options -separately.

- -

NOTE: This setting is cosmetic only and does not affect any functionality.

- -

Examples

-
-App::new("myprog")
-    .setting(AppSettings::UnifiedHelpMessage)
-    .get_matches();
-// running `myprog --help` will display a unified "docopt" or "getopts" style help message
-
WaitOnError

Will display a message "Press [ENTER]/[RETURN] to continue..." and wait user before -exiting

- -

This is most useful when writing an application which is run from a GUI shortcut, or on -Windows where a user tries to open the binary by double-clicking instead of using the -command line.

- -

NOTE: This setting is not recursive with subcommands, meaning if you wish this -behavior for all subcommands, you must set this on each command (needing this is extremely -rare)

- -

Examples

-
-App::new("myprog")
-    .setting(AppSettings::WaitOnError)
-
SubcommandRequiredElseHelp

Specifies that the help text should be displayed (and then exit gracefully), if no -subcommands are present at runtime (i.e. an empty run such as, $ myprog.

- -

NOTE: This should not be used with .subcommand_required() as they do the same -thing, except this prints the help text, and the other prints an error.

- -

NOTE: If the user specifies arguments at runtime, but no subcommand the help text will -still be displayed and exit. If this is not the desired result, consider using -ArgRequiredElseHelp instead.

- -

Examples

-
-App::new("myprog")
-    .setting(AppSettings::SubcommandRequiredElseHelp)
-
Hidden

Specifies that this subcommand should be hidden from help messages

- -

Examples

-
-App::new("myprog")
-    .subcommand(SubCommand::with_name("test")
-    .setting(AppSettings::Hidden))
-
TrailingVarArg

Specifies that the final positional argument is a "VarArg" and that clap should not -attempt to parse any further args.

- -

The values of the trailing positional argument will contain all args from itself on.

- -

NOTE: The final positional argument must have .multiple(true) or the usage string -equivalent.

- -

Examples

-
-let m = App::new("myprog")
-    .setting(AppSettings::TrailingVarArg)
-    .arg(Arg::from_usage("<cmd>... 'commands to run'"))
-    .get_matches_from(vec!["myprog", "arg1", "-r", "val1"]);
-
-let trail: Vec<&str> = m.values_of("cmd").unwrap().collect();
-assert_eq!(trail, ["arg1", "-r", "val1"]);
-
NoBinaryName

Specifies that the parser should not assume the first argument passed is the binary name. -This is normally the case when using a "daemon" style mode, or an interactive CLI where one -one would not normally type the binary or program name for each command.

- -

Examples

-
-let m = App::new("myprog")
-    .setting(AppSettings::NoBinaryName)
-    .arg(Arg::from_usage("<cmd>... 'commands to run'"))
-    .get_matches_from(vec!["command", "set"]);
-
-let cmds: Vec<&str> = m.values_of("cmd").unwrap().collect();
-assert_eq!(cmds, ["command", "set"]);
-
AllowExternalSubcommands

Specifies that an unexpected argument positional arguments which would otherwise cause a -ErrorKind::UnknownArgument error, should instead be treated as a subcommand in the -ArgMatches struct.

- -

NOTE: Use this setting with caution, as a truly unexpected argument (i.e. one that is -NOT an external subcommand) will not cause an error and instead be treatd as a potential -subcommand. You shoud inform the user appropriatly.

- -

Examples

-
-// Assume there is an external subcommand named "subcmd"
-let m = App::new("myprog")
-    .setting(AppSettings::AllowExternalSubcommands)
-    .get_matches_from(vec![
-        "myprog", "subcmd", "--option", "value", "-fff", "--flag"
-    ]);
-
-// All trailing arguments will be stored under the subcommand's sub-matches using a value
-// of the runtime subcommand name (in this case "subcmd")
-match m.subcommand() {
-    (external, Some(ext_m)) => {
-         let ext_args: Vec<&str> = ext_m.values_of(external).unwrap().collect();
-         assert_eq!(ext_args, ["--option", "value", "-fff", "--flag"]);
-    },
-    _ => {},
-}
-
StrictUtf8

Specifies that any invalid UTF-8 code points should be treated as an error and fail -with a ErrorKind::InvalidUtf8 error.

- -

NOTE: This rule only applies to argument values, as flags, options, and subcommands -themselves only allow valid UTF-8 code points.

- -

Platform Specific

-

Non Windows systems only

- -

Examples

-
-use std::ffi::OsString;
-
-let m = App::new("myprog")
-    .setting(AppSettings::StrictUtf8)
-    .arg_from_usage("<arg> 'some positional arg'")
-    .get_matches_from_safe(
-        vec![
-            OsString::from("myprog"),
-            OsString::from_vec(vec![0xe9])]);
-
-assert!(m.is_err());
-assert_eq!(m.unwrap_err().kind, ErrorKind::InvalidUtf8);
-}
-
AllowInvalidUtf8

Specifies that any invalid UTF-8 code points should not be treated as an error. This is -the default behavior of clap

- -

NOTE: Using argument values with invalid UTF-8 code points requires using Either -ArgMatches::os_value(s)_of or ArgMatches::lossy_value(s)_of for those particular -arguments which may contain invalid UTF-8 values

- -

NOTE: This rule only applies to argument values, as flags, options, and subcommands -themselves only allow valid UTF-8 code points.

- -

Platform Specific

-

Non Windows systems only

- -

Examples

-
-use std::ffi::OsString;
-use std::os::unix::ffi::OsStrExt;
-
-let r = App::new("myprog")
-    .setting(AppSettings::StrictUtf8)
-    .arg_from_usage("<arg> 'some positional arg'")
-    .get_matches_from_safe(
-        vec![
-            OsString::from("myprog"),
-            OsString::from_vec(vec![0xe9])]);
-
-assert!(r.is_ok());
-let m = r.unwrap();
-assert_eq!(m.value_of_os("arg").unwrap().as_bytes(), &[0xe9]);
-
AllowLeadingHyphen

Specifies that leading hyphens are allowed in argument values, such as negative numbers --10

- -

NOTE: This can only be set application wide and not on a per argument basis.

- -

NOTE: Use this setting with caution as it silences certain circumstances which would -otherwise be an error (such as accidentally forgetting to specify a value for leading -option)

- -

Examples

-
-// Imagine you needed to represent negative numbers as well, such as -10
-let m = App::new("nums")
-    .setting(AppSettings::AllowLeadingHyphen)
-    .arg(Arg::with_name("neg").index(1))
-    .get_matches_from(vec![
-        "nums", "-20"
-    ]);
-
-assert_eq!(m.value_of("neg"), Some("-20"));
-
HidePossibleValuesInHelp

Tells clap not to print possible values when displaying help information. This can be -useful if there are many values, or they are explained elsewhere.

-
NextLineHelp

Places the help string for all arguments on the line after the argument

- -

NOTE: This setting is cosmetic only and does not affect any functionality.

- -

Examples

-
-App::new("myprog")
-    .setting(AppSettings::NextLineHelp)
-    .get_matches();
-
DeriveDisplayOrder

Displays the arguments and subcommands in the help message in the order that they were -declared in, vice alphabetically which is the default.

- -

Examples

-
-App::new("myprog")
-    .setting(AppSettings::DeriveDisplayOrder)
-    .get_matches();
-
ColoredHelp

Uses colorized help messages.

- -

NOTE: Must be compiled with the color cargo feature

- -

Platform Specific

-

This setting only applies to Unix, Linux, and OSX (i.e. non-Windows platforms)

- -

Examples

-
-App::new("myprog")
-    .setting(AppSettings::ColoredHelp)
-    .get_matches();
-

Trait Implementations

impl FromStr for AppSettings

type Err = String

-

fn from_str(s: &str) -> Result<Self, Self::Err>

-

Derived Implementations

impl Clone for AppSettings

fn clone(&self) -> AppSettings

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Copy for AppSettings

impl PartialEq for AppSettings

fn eq(&self, __arg_0: &AppSettings) -> bool

-

fn ne(&self, other: &Rhs) -> bool1.0.0

-

impl Debug for AppSettings

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/enum.ErrorKind.html b/doc/clap/enum.ErrorKind.html deleted file mode 100644 index 42463dd7..00000000 --- a/doc/clap/enum.ErrorKind.html +++ /dev/null @@ -1,369 +0,0 @@ - - - - - - - - - - clap::ErrorKind - Rust - - - - - - - - - - - - - - - - - -
-

Enum clap::ErrorKind - - [−] - - [src]

-
pub enum ErrorKind {
-    InvalidValue,
-    UnknownArgument,
-    InvalidSubcommand,
-    UnrecognizedSubcommand,
-    EmptyValue,
-    ValueValidation,
-    TooManyValues,
-    TooFewValues,
-    WrongNumberOfValues,
-    ArgumentConflict,
-    MissingRequiredArgument,
-    MissingSubcommand,
-    MissingArgumentOrSubcommand,
-    UnexpectedMultipleUsage,
-    InvalidUtf8,
-    HelpDisplayed,
-    VersionDisplayed,
-    ArgumentNotFound,
-    Io,
-    Format,
-}

Command line argument parser kind of error

-

Variants

-
InvalidValue

Occurs when an Arg has a set of possible values, and the user provides a value which -isn't in that set.

- -

Examples

-
-let result = App::new("myprog")
-    .arg(Arg::with_name("speed")
-        .possible_value("fast")
-        .possible_value("slow"))
-    .get_matches_from_safe(vec!["myprog", "other"]);
-assert!(result.is_err());
-assert_eq!(result.unwrap_err().kind, ErrorKind::InvalidValue);
-
UnknownArgument

Occurs when a user provides a flag, option, or argument which wasn't defined.

- -

Examples

-
-let result = App::new("myprog")
-    .arg(Arg::from_usage("--flag 'some flag'"))
-    .get_matches_from_safe(vec!["myprog", "--other"]);
-assert!(result.is_err());
-assert_eq!(result.unwrap_err().kind, ErrorKind::UnknownArgument);
-
InvalidSubcommand

Occurs when the user provids an unrecognized subcommand which meets the threshold for being -similar enough to an existing subcommand so as to not cause the more general -UnknownArgument error.

- -

Examples

-
-let result = App::new("myprog")
-    .subcommand(SubCommand::with_name("config")
-        .about("Used for configuration")
-        .arg(Arg::with_name("config_file")
-            .help("The configuration file to use")
-            .index(1)))
-    .get_matches_from_safe(vec!["myprog", "confi"]);
-assert!(result.is_err());
-assert_eq!(result.unwrap_err().kind, ErrorKind::InvalidSubcommand);
-
UnrecognizedSubcommand

Occurs when the user provids an unrecognized subcommand which does not meet the threshold -for being similar enough to an existing subcommand so as to not cause the more detailed -InvalidSubcommand error.

- -

This error typically happens when passing additional subcommand names to the help -subcommand. Otherwise, the more general UnknownArgument error is used.

- -

Examples

-
-let result = App::new("myprog")
-    .subcommand(SubCommand::with_name("config")
-        .about("Used for configuration")
-        .arg(Arg::with_name("config_file")
-            .help("The configuration file to use")
-            .index(1)))
-    .get_matches_from_safe(vec!["myprog", "help", "nothing"]);
-assert!(result.is_err());
-assert_eq!(result.unwrap_err().kind, ErrorKind::UnrecognizedSubcommand);
-
EmptyValue

Occurs when the user provides an empty value for an option that does not allow empty -values.

- -

Examples

-
-let res = App::new("myprog")
-    .arg(Arg::with_name("color")
-         .long("color")
-         .empty_values(false))
-    .get_matches_from_safe(vec!["myprog", "--color="]);
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::EmptyValue);
-
ValueValidation

Occurs when the user provides a value for an argument with a custom validation and the -value fails that validation.

- -

Examples

-
-fn is_numeric(val: String) -> Result<(), String> {
-    match val.parse::<i64>() {
-        Ok(..) => Ok(()),
-        Err(..) => Err(String::from("Value wasn't a number!")),
-    }
-}
-
-let result = App::new("myprog")
-    .arg(Arg::with_name("num")
-         .validator(is_numeric))
-    .get_matches_from_safe(vec!["myprog", "NotANumber"]);
-assert!(result.is_err());
-assert_eq!(result.unwrap_err().kind, ErrorKind::ValueValidation);
-
TooManyValues

Occurs when a user provides more values for an argument than were defined by setting -Arg::max_values.

- -

Examples

-
-let result = App::new("myprog")
-    .arg(Arg::with_name("arg")
-        .multiple(true)
-        .max_values(2))
-    .get_matches_from_safe(vec!["myprog", "too", "many", "values"]);
-assert!(result.is_err());
-assert_eq!(result.unwrap_err().kind, ErrorKind::TooManyValues);
-
TooFewValues

Occurs when the user provides fewer values for an argument than were defined by setting -Arg::min_values.

- -

Examples

-
-let result = App::new("myprog")
-    .arg(Arg::with_name("some_opt")
-        .long("opt")
-        .min_values(3))
-    .get_matches_from_safe(vec!["myprog", "--opt", "too", "few"]);
-assert!(result.is_err());
-assert_eq!(result.unwrap_err().kind, ErrorKind::TooFewValues);
-
WrongNumberOfValues

Occurs when the user provides a different number of values for an argument than what's -been defined by setting Arg::number_of_values or than was implicitly set by -Arg::value_names.

- -

Examples

-
-let result = App::new("myprog")
-    .arg(Arg::with_name("some_opt")
-        .long("opt")
-        .takes_value(true)
-        .number_of_values(2))
-    .get_matches_from_safe(vec!["myprog", "--opt", "wrong"]);
-assert!(result.is_err());
-assert_eq!(result.unwrap_err().kind, ErrorKind::WrongNumberOfValues);
-
ArgumentConflict

Occurs when the user provides two values which conflict with each other and can't be used -together.

- -

Examples

-
-let result = App::new("myprog")
-    .arg(Arg::with_name("debug")
-        .long("debug")
-        .conflicts_with("color"))
-    .arg(Arg::with_name("color")
-        .long("color"))
-    .get_matches_from_safe(vec!["myprog", "--debug", "--color"]);
-assert!(result.is_err());
-assert_eq!(result.unwrap_err().kind, ErrorKind::ArgumentConflict);
-
MissingRequiredArgument

Occurs when the user does not provide one or more required arguments.

- -

Examples

-
-let result = App::new("myprog")
-    .arg(Arg::with_name("debug")
-        .required(true))
-    .get_matches_from_safe(vec!["myprog"]);
-assert!(result.is_err());
-assert_eq!(result.unwrap_err().kind, ErrorKind::MissingRequiredArgument);
-
MissingSubcommand

Occurs when a subcommand is required (as defined by AppSettings::SubcommandRequired), but -the user does not provide one.

- -

Examples

-
-let err = App::new("myprog")
-    .setting(AppSettings::SubcommandRequired)
-    .subcommand(SubCommand::with_name("test"))
-    .get_matches_from_safe(vec![
-        "myprog",
-    ]);
-assert!(err.is_err());
-assert_eq!(err.unwrap_err().kind, ErrorKind::MissingSubcommand);
-
MissingArgumentOrSubcommand

Occurs when either an argument or subcommand is required, as defined by -AppSettings::ArgRequiredElseHelp but the user did not provide one.

- -

Examples

-
-let result = App::new("myprog")
-    .setting(AppSettings::ArgRequiredElseHelp)
-    .subcommand(SubCommand::with_name("config")
-        .about("Used for configuration")
-        .arg(Arg::with_name("config_file")
-            .help("The configuration file to use")))
-    .get_matches_from_safe(vec!["myprog"]);
-assert!(result.is_err());
-assert_eq!(result.unwrap_err().kind, ErrorKind::MissingArgumentOrSubcommand);
-
UnexpectedMultipleUsage

Occurs when the user provides an argument multiple times which has not been set to allow -multiple uses.

- -

Examples

-
-let result = App::new("myprog")
-    .arg(Arg::with_name("debug")
-        .long("debug")
-        .multiple(false))
-    .get_matches_from_safe(vec!["myprog", "--debug", "--debug"]);
-assert!(result.is_err());
-assert_eq!(result.unwrap_err().kind, ErrorKind::UnexpectedMultipleUsage);
-
InvalidUtf8

Occurs when the user provides a value containing invalid UTF-8 for an argument and -AppSettings::StrictUtf8 is set.

- -

Platform Speicific

-

Non-Windows platforms only (such as Linux, Unix, OSX, etc.)

- -

Examples

-
-let result = App::new("myprog")
-    .setting(AppSettings::StrictUtf8)
-    .arg(Arg::with_name("utf8")
-        .short("u")
-        .takes_value(true))
-    .get_matches_from_safe(vec![OsString::from("myprog"),
-                                OsString::from("-u")
-                                OsString::from_vec(vec![0xE9])]);
-assert!(result.is_err());
-assert_eq!(result.unwrap_err().kind, ErrorKind::InvalidUtf8);
-
HelpDisplayed

Not a true "error" as it means --help or similar was used. The help message will be sent -to stdout.

- -

Note: If the help is displayed due to an error (such as missing subcommands) it will -be sent to stderr instead of stdout.

- -

Examples

-
-let result = App::new("myprog")
-    .get_matches_from_safe(vec!["myprog", "--help"]);
-assert!(result.is_err());
-assert_eq!(result.unwrap_err().kind, ErrorKind::HelpDisplayed);
-
VersionDisplayed

Not a true "error" as it means --version or similar was used. The message will be sent -to stdout.

- -

Examples

-
-let result = App::new("myprog")
-    .get_matches_from_safe(vec!["myprog", "--version"]);
-assert!(result.is_err());
-assert_eq!(result.unwrap_err().kind, ErrorKind::VersionDisplayed);
-
ArgumentNotFound

Occurs when using the value_t! and values_t! macros to convert an argument value into -type T, but the argument you requested wasn't used. I.e. you asked for an argument with -name config to be converted, but config wasn't used by the user.

-
Io

Represents an I/O error, typically while writing to stderr or stdout.

-
Format

Represents an Rust Display Format error, typically white writing to stderr or stdout.

-

Trait Implementations

Derived Implementations

impl PartialEq for ErrorKind

fn eq(&self, __arg_0: &ErrorKind) -> bool

-

fn ne(&self, other: &Rhs) -> bool1.0.0

-

impl Clone for ErrorKind

fn clone(&self) -> ErrorKind

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl Copy for ErrorKind

impl Debug for ErrorKind

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/errors/enum.ErrorKind.html b/doc/clap/errors/enum.ErrorKind.html deleted file mode 100644 index 1ee7cd7f..00000000 --- a/doc/clap/errors/enum.ErrorKind.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../clap/enum.ErrorKind.html...

- - - \ No newline at end of file diff --git a/doc/clap/errors/index.html b/doc/clap/errors/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/errors/sidebar-items.js b/doc/clap/errors/sidebar-items.js deleted file mode 100644 index a9c345e2..00000000 --- a/doc/clap/errors/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["ErrorKind","Command line argument parser kind of error"]],"struct":[["Error","Command Line Argument Parser Error"]],"type":[["Result","Short hand for result type"]]}); \ No newline at end of file diff --git a/doc/clap/errors/struct.Error.html b/doc/clap/errors/struct.Error.html deleted file mode 100644 index 8783fd1a..00000000 --- a/doc/clap/errors/struct.Error.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../clap/struct.Error.html...

- - - \ No newline at end of file diff --git a/doc/clap/errors/type.Result.html b/doc/clap/errors/type.Result.html deleted file mode 100644 index 7ed1fa4c..00000000 --- a/doc/clap/errors/type.Result.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../clap/type.Result.html...

- - - \ No newline at end of file diff --git a/doc/clap/fmt/index.html b/doc/clap/fmt/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/fmt/sidebar-items.js b/doc/clap/fmt/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/fmt/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/index.html b/doc/clap/index.html deleted file mode 100644 index 4e7e8d99..00000000 --- a/doc/clap/index.html +++ /dev/null @@ -1,603 +0,0 @@ - - - - - - - - - - clap - Rust - - - - - - - - - - - - - - - - - -
-

Crate clap - - [−] - - [src]

-

A simple to use, efficient, and full featured library for parsing command line arguments and subcommands when writing console, or terminal applications.

- -

About

-

clap is used to parse and validate the string of command line arguments provided by the user at runtime. You provide the list of valid possibilities, and clap handles the rest. This means you focus on your applications functionality, and less on the parsing and validating of arguments.

- -

clap also provides the traditional version and help switches (or flags) 'for free' meaning automatically with no configuration. It does this by checking list of valid possibilities you supplied and adding only the ones you haven't already defined. If you are using subcommands, clap will also auto-generate a help subcommand for you in addition to the traditional flags.

- -

Once clap parses the user provided string of arguments, it returns the matches along with any applicable values. If the user made an error or typo, clap informs them of the mistake and exits gracefully (or returns a Result type and allows you to perform any clean up prior to exit). Because of this, you can make reasonable assumptions in your code about the validity of the arguments.

- -

FAQ

-

For a full FAQ and more in depth details, see the wiki page

- -

Comparisons

-

First, let me say that these comparisons are highly subjective, and not meant in a critical or harsh manner. All the argument parsing libraries out there (to include clap) have their own strengths and weaknesses. Sometimes it just comes down to personal taste when all other factors are equal. When in doubt, try them all and pick one that you enjoy :) There's plenty of room in the Rust community for multiple implementations!

- -

How does clap compare to getopts?

-

getopts is a very basic, fairly minimalist argument parsing library. This isn't a bad thing, sometimes you don't need tons of features, you just want to parse some simple arguments, and have some help text generated for you based on valid arguments you specify. The downside to this approach is that you must manually implement most of the common features (such as checking to display help messages, usage strings, etc.). If you want a highly custom argument parser, and don't mind writing the majority of the functionality yourself, getopts is an excellent base.

- -

getopts also doesn't allocate much, or at all. This gives it a very small performance boost. Although, as you start implementing additional features, that boost quickly disappears.

- -

Personally, I find many, many uses of getopts are manually implementing features that clap provides by default. Using clap simplifies your codebase allowing you to focus on your application, and not argument parsing.

- -

How does clap compare to docopt.rs?

-

I first want to say I'm a big a fan of BurntSushi's work, the creator of Docopt.rs. I aspire to produce the quality of libraries that this man does! When it comes to comparing these two libraries they are very different. docopt tasks you with writing a help message, and then it parsers that message for you to determine all valid arguments and their use. Some people LOVE this approach, others do not. If you're willing to write a detailed help message, it's nice that you can stick that in your program and have docopt do the rest. On the downside, it's far less flexible.

- -

docopt is also excellent at translating arguments into Rust types automatically. There is even a syntax extension which will do all this for you, if you're willing to use a nightly compiler (use of a stable compiler requires you to somewhat manually translate from arguments to Rust types). To use BurntSushi's words, docopt is also a sort of black box. You get what you get, and it's hard to tweak implementation or customize the experience for your use case.

- -

Because docopt is doing a ton of work to parse your help messages and determine what you were trying to communicate as valid arguments, it's also one of the more heavy weight parsers performance-wise. For most applications this isn't a concern and this isn't to say docopt is slow, in fact from it. This is just something to keep in mind while comparing.

- -

All else being equal, what are some reasons to use clap?

-

clap is as fast, and as lightweight as possible while still giving all the features you'd expect from a modern argument parser. In fact, for the amount and type of features clap offers it remains about as fast as getopts. If you use clap when just need some simple arguments parsed, you'll find its a walk in the park. clap also makes it possible to represent extremely complex, and advanced requirements, without too much thought. clap aims to be intuitive, easy to use, and fully capable for wide variety use cases and needs.

- -

Quick Example

-

The following examples show a quick example of some of the very basic functionality of clap. For more advanced usage, such as requirements, conflicts, groups, multiple values and occurrences see the documentation, examples/ directory of this repository or the video tutorials (which are quite outdated by now).

- -

NOTE: All these examples are functionally the same, but show three different styles in which to use clap

- -

The following example is show a method that allows more advanced configuration options (not shown in this small example), or even dynamically generating arguments when desired. The downside is it's more verbose.

- -
-// (Full example with detailed comments in examples/01b_quick_example.rs)
-//
-// This example demonstrates clap's full 'builder pattern' style of creating arguments which is
-// more verbose, but allows easier editing, and at times more advanced options, or the possibility
-// to generate arguments dynamically.
-extern crate clap;
-use clap::{Arg, App, SubCommand};
-
-fn main() {
-    let matches = App::new("My Super Program")
-                          .version("1.0")
-                          .author("Kevin K. <kbknapp@gmail.com>")
-                          .about("Does awesome things")
-                          .arg(Arg::with_name("config")
-                               .short("c")
-                               .long("config")
-                               .value_name("FILE")
-                               .help("Sets a custom config file")
-                               .takes_value(true))
-                          .arg(Arg::with_name("INPUT")
-                               .help("Sets the input file to use")
-                               .required(true)
-                               .index(1))
-                          .arg(Arg::with_name("v")
-                               .short("v")
-                               .multiple(true)
-                               .help("Sets the level of verbosity"))
-                          .subcommand(SubCommand::with_name("test")
-                                      .about("controls testing features")
-                                      .version("1.3")
-                                      .author("Someone E. <someone_else@other.com>")
-                                      .arg(Arg::with_name("debug")
-                                          .short("d")
-                                          .help("print debug information verbosely")))
-                          .get_matches();
-
-    // Gets a value for config if supplied by user, or defaults to "default.conf"
-    let config = matches.value_of("config").unwrap_or("default.conf");
-    println!("Value for config: {}", config);
-
-    // Calling .unwrap() is safe here because "INPUT" is required (if "INPUT" wasn't
-    // required we could have used an 'if let' to conditionally get the value)
-    println!("Using input file: {}", matches.value_of("INPUT").unwrap());
-
-    // Vary the output based on how many times the user used the "verbose" flag
-    // (i.e. 'myprog -v -v -v' or 'myprog -vvv' vs 'myprog -v'
-    match matches.occurrences_of("v") {
-        0 => println!("No verbose info"),
-        1 => println!("Some verbose info"),
-        2 => println!("Tons of verbose info"),
-        3 | _ => println!("Don't be crazy"),
-    }
-
-    // You can handle information about subcommands by requesting their matches by name
-    // (as below), requesting just the name used, or both at the same time
-    if let Some(matches) = matches.subcommand_matches("test") {
-        if matches.is_present("debug") {
-            println!("Printing debug info...");
-        } else {
-            println!("Printing normally...");
-        }
-    }
-
-    // more program logic goes here...
-}
- -

The following example is functionally the same as the one above, but shows a far less verbose method but sacrifices some of the advanced configuration options (not shown in this small example).

- -
-// (Full example with detailed comments in examples/01a_quick_example.rs)
-//
-// This example demonstrates clap's "usage strings" method of creating arguments which is less
-// less verbose
-extern crate clap;
-use clap::{Arg, App, SubCommand};
-
-fn main() {
-    let matches = App::new("myapp")
-                          .version("1.0")
-                          .author("Kevin K. <kbknapp@gmail.com>")
-                          .about("Does awesome things")
-                          .args_from_usage(
-                              "-c, --config=[FILE] 'Sets a custom config file'
-                              <INPUT>              'Sets the input file to use'
-                              -v...                'Sets the level of verbosity'")
-                          .subcommand(SubCommand::with_name("test")
-                                      .about("controls testing features")
-                                      .version("1.3")
-                                      .author("Someone E. <someone_else@other.com>")
-                                      .arg_from_usage("-d, --debug 'Print debug information'"))
-                          .get_matches();
-
-    // Same as previous example...
-}
- -

The following combines the previous two examples by using the less verbose from_usage methods and the performance of the Builder Pattern.

- -
-// (Full example with detailed comments in examples/01c_quick_example.rs)
-// Must be compiled with `--features unstable`
-//
-// This example demonstrates clap's "usage strings" method of creating arguments which is less
-// less verbose
-#[macro_use]
-extern crate clap;
-
-fn main() {
-    let matches = clap_app!(myapp =>
-        (version: "1.0")
-        (author: "Kevin K. <kbknapp@gmail.com>")
-        (about: "Does awesome things")
-        (@arg config: -c --config +takes_value "Sets a custom config file")
-        (@arg INPUT: +required "Sets the input file to use")
-        (@arg verbose: -v ... "Sets the level of verbosity")
-        (@subcommand test =>
-            (about: "controls testing features")
-            (version: "1.3")
-            (author: "Someone E. <someone_else@other.com>")
-            (@arg verbose: -d --debug "Print debug information")
-        )
-    ).get_matches();
-
-// Same as previous examples...
-}
- -

This final method shows how you can use a YAML file to build your CLI and keep your Rust source tidy or support multiple localized translations by having different YAML files for each localization. First, create the cli.yml file to hold your CLI options, but it could be called anything we like (we'll use the same both examples above to keep it functionally equivalent):

- -
name: myapp
-version: 1.0
-author: Kevin K. <kbknapp@gmail.com>
-about: Does awesome things
-args:
-    - config:
-        short: c
-        long: config
-        value_name: FILE
-        help: Sets a custom config file
-        takes_value: true
-    - INPUT:
-        help: Sets the input file to use
-        required: true
-        index: 1
-    - verbose:
-        short: v
-        multiple: true
-        help: Sets the level of verbosity
-subcommands:
-    - test:
-        about: controls testing features
-        version: 1.3
-        author: Someone E. <someone_else@other.com>
-        args:
-            - debug:
-                short: d
-                help: print debug information
-
- -

Now we create our main.rs file just like we would have with the previous two examples:

- -
-// (Full example with detailed comments in examples/17_yaml.rs)
-//
-// This example demonstrates clap's building from YAML style of creating arguments which is far
-// more clean, but takes a very small performance hit compared to the other two methods.
-#[macro_use]
-extern crate clap;
-use clap::App;
-
-fn main() {
-    // The YAML file is found relative to the current file, similar to how modules are found
-    let yaml = load_yaml!("cli.yml");
-    let matches = App::from_yaml(yaml).get_matches();
-
-    // Same as previous examples...
-}
- -

NOTE: The YAML and macro builder options require adding a special features flag when compiling clap because they are not compiled by default. Simply change your clap = "2" to clap = {version = "2", features = ["yaml"]} for YAML, or features = ["unstable"] for the macro builder, in your Cargo.toml.

- -

If you were to compile any of the above programs and run them with the flag --help or -h (or help subcommand, since we defined test as a subcommand) the following would be output

- -
-$ myprog --help
-My Super Program 1.0
-Kevin K. <kbknapp@gmail.com>
-Does awesome things
-
-USAGE:
-    MyApp [FLAGS] [OPTIONS] <INPUT> [SUBCOMMAND]
-
-FLAGS:
-    -h, --help       Prints this message
-    -v               Sets the level of verbosity
-    -V, --version    Prints version information
-
-OPTIONS:
-    -c, --config <FILE>    Sets a custom config file
-
-ARGS:
-    INPUT    The input file to use
-
-SUBCOMMANDS:
-    help    Prints this message
-    test    Controls testing features
- -

NOTE: You could also run myapp test --help to see similar output and options for the test subcommand.

- -

Try it!

-

Pre-Built Test

-

To try out the pre-built example, use the following steps:

- -
    -
  • Clone the repository $ git clone https://github.com/kbknapp/clap-rs && cd clap-rs/clap-tests
    • -
  • Compile the example $ cargo build --release
    • -
  • Run the help info $ ./target/release/claptests --help
    • -
  • Play with the arguments!
    • -
- -

BYOB (Build Your Own Binary)

-

To test out clap's default auto-generated help/version follow these steps: -* Create a new cargo project $ cargo new fake --bin && cd fake -* Add clap to your Cargo.toml -* -toml [dependencies] clap = "2"

- -
    -
  • Add the following to your src/main.rs
    • -
- -
-extern crate clap;
-use clap::App;
-
-fn main() {
-  App::new("fake").version("v1.0-beta").get_matches();
-}
- -
    -
  • Build your program $ cargo build --release
    • -
  • Run with help or version $ ./target/release/fake --help or $ ./target/release/fake --version
    • -
- -

Usage

-

For full usage, add clap as a dependency in your Cargo.toml file to use from crates.io:

- -
 [dependencies]
- clap = "2"
-
- -

Or track the latest on the master branch at github:

- -
[dependencies.clap]
-git = "https://github.com/kbknapp/clap-rs.git"
-
- -

Add extern crate clap; to your crate root.

- -

Define a list of valid arguments for your program (see the documentation or examples/ directory of this repo)

- -

Then run cargo build or cargo update && cargo build for your project.

- -

Optional Dependencies / Features

-

If you'd like to keep your dependency list to only clap, you can disable any features that require an additional dependency. To do this, add this to your Cargo.toml:

- -
[dependencies.clap]
-version = "2"
-default-features = false
-
- -

You can also selectively enable only the features you'd like to include, by adding:

- -
[dependencies.clap]
-version = "2"
-default-features = false
-
-# Cherry-pick the features you'd like to use
-features = [ "suggestions", "color" ]
-
- -

The following is a list of optional clap features:

- -
    -
  • "suggestions": Turns on the Did you mean '--myoption' ? feature for when users make typos.
    • -
  • "color": Turns on colored error messages. This feature only works on non-Windows OSs.
    • -
  • "lints": This is not included by default and should only be used while developing to run basic lints against changes. This can only be used on Rust nightly.
    • -
  • "debug": This is not included by default and should only be used while developing to display debugging information.
    • -
  • "yaml": This is not included by default. Enables building CLIs from YAML documents.
    • -
  • "unstable": This is not included by default. Enables unstable features, unstable refers to whether or not they may change, not performance stability.
    • -
- -

More Information

-

You can find complete documentation on the github-pages site for this project.

- -

You can also find usage examples in the examples/ directory of this repo.

- -

Video Tutorials

-

There's also the video tutorial series Argument Parsing with Rust that I've been working on.

- -

Note: Two new videos have just been added (08 From Usage, and 09 Typed Values), if you're already familiar with clap but want to know more about these two details you can check out those videos without watching the previous few.

- -

Note: Apologies for the resolution of the first video, it will be updated to a better resolution soon. The other videos have a proper resolution.

- -

Running the tests

-

If contributing, you can run the tests as follows (assuming you're in the clap-rs directory)

- -
-$ cargo test && make -C clap-tests test
-$ cargo test --features yaml
-
-$ cargo build --features lints
- -

License

-

clap is licensed under the MIT license. Please read the LICENSE-MIT file in this repository for more information.

-

Macros

- - - - - - - - - - - - - - - - - - - - - - - - - - - - -
_clap_count_exprs! -

Counts the number of comma-delimited expressions passed to it. The result is a compile-time -evaluable expression, suitable for use as a static array size, or the value of a const.

-
arg_enum! -

Convenience macro to generate more complete enums with variants to be used as a type when -parsing arguments. This enum also provides a variants() function which can be used to -retrieve a Vec<&'static str> of the variant names, as well as implementing FromStr and -Display automatically.

-
crate_version! -

Allows you to pull the version from your Cargo.toml at compile time as -MAJOR.MINOR.PATCH_PKGVERSION_PRE

-
value_t! -

Convenience macro getting a typed value T where T implements std::str::FromStr from an -argument value. This macro returns a Result<T,String> which allows you as the developer to -decide what you'd like to do on a failed parse. There are two types of errors, parse failures -and those where the argument wasn't present (such as a non-required argument). You can use -it to get a single value, or a iterator as with the ArgMatches::values_of

-
value_t_or_exit! -

Convenience macro getting a typed value T where T implements std::str::FromStr or -exiting upon error instead of returning a Result

-
values_t! -

Convenience macro getting a typed value Vec<T> where T implements std::str::FromStr This -macro returns a clap::Result<Vec<T>> (Result<Vec<T>, clap::Error>) which allows you as the -developer to decide what you'd like to do on a failed parse.

-
values_t_or_exit! -

Convenience macro getting a typed value Vec<T> where T implements std::str::FromStr or -exiting upon error.

-

Structs

- - - - - - - - - - - - - - - - - - - - - - - - -
App -

Used to create a representation of a command line program and all possible command line -arguments. Application settings are set using the "builder pattern" with the -.get_matches() family of methods being the terminal methods that starts the runtime-parsing -process. These methods then return information about the user supplied arguments (or lack there -of).

-
Arg -

The abstract representation of a command line argument. Used to set all the options and -relationships that define a valid argument for the program.

-
ArgGroup -

ArgGroups are a family of related arguments and way for you to express, "Any of these -arguments". By placing arguments in a logical group, you can create easier requirement and -exclusion rules instead of having to list each argument individually, or when you want a rule -to apply "any but not all" arguments.

-
ArgMatches -

Used to get information about the arguments that where supplied to the program at runtime by -the user. New instances of this struct are obtained by using the App::get_matches family of -methods.

-
Error -

Command Line Argument Parser Error

-
SubCommand -

The abstract representation of a command line subcommand.

-

Enums

- - - - - - - - -
AppSettings -

Application level settings, which affect how App operates

-
ErrorKind -

Command line argument parser kind of error

-

Type Definitions

- - - - -
Result -

Short hand for result type

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/macro._clap_count_exprs!.html b/doc/clap/macro._clap_count_exprs!.html deleted file mode 100644 index 12e4aaf8..00000000 --- a/doc/clap/macro._clap_count_exprs!.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - clap::_clap_count_exprs! - Rust - - - - - - - - - - - - - - - - - -
-

clap::_clap_count_exprs! - - [−] - - [src]

-
-macro_rules! _clap_count_exprs {
-    () => { ... };
-    ($e:expr) => { ... };
-    ($e:expr, $($es:expr),+) => { ... };
-}
-

Counts the number of comma-delimited expressions passed to it. The result is a compile-time -evaluable expression, suitable for use as a static array size, or the value of a const.

- -

Examples

-
-const COUNT: usize = _clap_count_exprs!(a, 5+1, "hi there!".into_string());
-assert_eq!(COUNT, 3);
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/macro.arg_enum!.html b/doc/clap/macro.arg_enum!.html deleted file mode 100644 index 208c1566..00000000 --- a/doc/clap/macro.arg_enum!.html +++ /dev/null @@ -1,152 +0,0 @@ - - - - - - - - - - clap::arg_enum! - Rust - - - - - - - - - - - - - - - - - -
-

clap::arg_enum! - - [−] - - [src]

-
-macro_rules! arg_enum {
-    (@as_item $($i:item)*) => { ... };
-    (@impls ( $($tts:tt)* ) -> ($e:ident, $($v:ident),+)) => { ... };
-    (#[$($m:meta),+] pub enum $e:ident { $($v:ident),+ } ) => { ... };
-    (#[$($m:meta),+] enum $e:ident { $($v:ident),+ } ) => { ... };
-    (pub enum $e:ident { $($v:ident),+ } ) => { ... };
-    (enum $e:ident { $($v:ident),+ } ) => { ... };
-}
-

Convenience macro to generate more complete enums with variants to be used as a type when -parsing arguments. This enum also provides a variants() function which can be used to -retrieve a Vec<&'static str> of the variant names, as well as implementing FromStr and -Display automatically.

- -

NOTE: Case insensitivity is supported for ASCII characters only

- -

NOTE: This macro automatically implements std::str::FromStr and std::fmt::Display

- -

NOTE: These enums support pub (or not) and uses of the #[derive()] traits

- -

Examples

-
-arg_enum!{
-    #[derive(Debug)]
-    pub enum Foo {
-        Bar,
-        Baz,
-        Qux
-    }
-}
-// Foo enum can now be used via Foo::Bar, or Foo::Baz, etc
-// and implements std::str::FromStr to use with the value_t! macros
-fn main() {
-    let m = App::new("app")
-                .arg_from_usage("<foo> 'the foo'")
-                .get_matches();
-    let f = value_t!(m, "foo", Foo).unwrap_or_else(|e| e.exit());
-
-    // Use f like any other Foo variant...
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/macro.crate_version!.html b/doc/clap/macro.crate_version!.html deleted file mode 100644 index b8dbeeeb..00000000 --- a/doc/clap/macro.crate_version!.html +++ /dev/null @@ -1,124 +0,0 @@ - - - - - - - - - - clap::crate_version! - Rust - - - - - - - - - - - - - - - - - -
-

clap::crate_version! - - [−] - - [src]

-
-macro_rules! crate_version {
-    () => { ... };
-}
-

Allows you to pull the version from your Cargo.toml at compile time as -MAJOR.MINOR.PATCH_PKGVERSION_PRE

- -

Examples

-
-    let m = App::new("app")
-                .version(crate_version!())
-                .get_matches();
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/macro.value_t!.html b/doc/clap/macro.value_t!.html deleted file mode 100644 index 58969728..00000000 --- a/doc/clap/macro.value_t!.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - clap::value_t! - Rust - - - - - - - - - - - - - - - - - -
-

clap::value_t! - - [−] - - [src]

-
-macro_rules! value_t {
-    ($m:ident, $v:expr, $t:ty) => { ... };
-    ($m:ident.value_of($v:expr), $t:ty) => { ... };
-}
-

Convenience macro getting a typed value T where T implements std::str::FromStr from an -argument value. This macro returns a Result<T,String> which allows you as the developer to -decide what you'd like to do on a failed parse. There are two types of errors, parse failures -and those where the argument wasn't present (such as a non-required argument). You can use -it to get a single value, or a iterator as with the ArgMatches::values_of

- -

Examples

-
-let matches = App::new("myapp")
-              .arg_from_usage("[length] 'Set the length to use as a pos whole num, i.e. 20'")
-              .get_matches();
-
-let len      = value_t!(matches.value_of("length"), u32).unwrap_or_else(|e| e.exit());
-let also_len = value_t!(matches, "length", u32).unwrap_or_else(|e| e.exit());
-
-println!("{} + 2: {}", len, len + 2);
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/macro.value_t_or_exit!.html b/doc/clap/macro.value_t_or_exit!.html deleted file mode 100644 index a7f107a3..00000000 --- a/doc/clap/macro.value_t_or_exit!.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - clap::value_t_or_exit! - Rust - - - - - - - - - - - - - - - - - -
-

clap::value_t_or_exit! - - [−] - - [src]

-
-macro_rules! value_t_or_exit {
-    ($m:ident, $v:expr, $t:ty) => { ... };
-    ($m:ident.value_of($v:expr), $t:ty) => { ... };
-}
-

Convenience macro getting a typed value T where T implements std::str::FromStr or -exiting upon error instead of returning a Result

- -

NOTE: This macro is for backwards compatibility sake. Prefer -value_t!(/* ... */).unwrap_or_else(|e| e.exit())

- -

Examples

-
-let matches = App::new("myapp")
-              .arg_from_usage("[length] 'Set the length to use as a pos whole num, i.e. 20'")
-              .get_matches();
-
-let len      = value_t_or_exit!(matches.value_of("length"), u32);
-let also_len = value_t_or_exit!(matches, "length", u32);
-
-println!("{} + 2: {}", len, len + 2);
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/macro.values_t!.html b/doc/clap/macro.values_t!.html deleted file mode 100644 index 6098f4b8..00000000 --- a/doc/clap/macro.values_t!.html +++ /dev/null @@ -1,136 +0,0 @@ - - - - - - - - - - clap::values_t! - Rust - - - - - - - - - - - - - - - - - -
-

clap::values_t! - - [−] - - [src]

-
-macro_rules! values_t {
-    ($m:ident, $v:expr, $t:ty) => { ... };
-    ($m:ident.values_of($v:expr), $t:ty) => { ... };
-}
-

Convenience macro getting a typed value Vec<T> where T implements std::str::FromStr This -macro returns a clap::Result<Vec<T>> (Result<Vec<T>, clap::Error>) which allows you as the -developer to decide what you'd like to do on a failed parse.

- -

Examples

-
-let matches = App::new("myapp")
-              .arg_from_usage("[seq]... 'A sequence of pos whole nums, i.e. 20 45'")
-              .get_matches();
-
-let vals = values_t!(matches.values_of("seq"), u32).unwrap_or_else(|e| e.exit());
-for v in &vals {
-    println!("{} + 2: {}", v, v + 2);
-}
-
-let vals = values_t!(matches, "seq", u32).unwrap_or_else(|e| e.exit());
-for v in &vals {
-    println!("{} + 2: {}", v, v + 2);
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/macro.values_t_or_exit!.html b/doc/clap/macro.values_t_or_exit!.html deleted file mode 100644 index cb9c3291..00000000 --- a/doc/clap/macro.values_t_or_exit!.html +++ /dev/null @@ -1,139 +0,0 @@ - - - - - - - - - - clap::values_t_or_exit! - Rust - - - - - - - - - - - - - - - - - -
-

clap::values_t_or_exit! - - [−] - - [src]

-
-macro_rules! values_t_or_exit {
-    ($m:ident, $v:expr, $t:ty) => { ... };
-    ($m:ident.values_of($v:expr), $t:ty) => { ... };
-}
-

Convenience macro getting a typed value Vec<T> where T implements std::str::FromStr or -exiting upon error.

- -

NOTE: This macro is for backwards compatibility sake. Prefer -values_t!(/* ... */).unwrap_or_else(|e| e.exit())

- -

Examples

-
-let matches = App::new("myapp")
-              .arg_from_usage("[seq]... 'A sequence of pos whole nums, i.e. 20 45'")
-              .get_matches();
-
-let vals = values_t_or_exit!(matches.values_of("seq"), u32);
-for v in &vals {
-    println!("{} + 2: {}", v, v + 2);
-}
-
-// type for example only
-let vals: Vec<u32> = values_t_or_exit!(matches, "seq", u32);
-for v in &vals {
-    println!("{} + 2: {}", v, v + 2);
-}
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/macros/debug_macros/index.html b/doc/clap/macros/debug_macros/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/macros/debug_macros/sidebar-items.js b/doc/clap/macros/debug_macros/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/macros/debug_macros/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/macros/index.html b/doc/clap/macros/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/macros/sidebar-items.js b/doc/clap/macros/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/macros/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/osstringext/index.html b/doc/clap/osstringext/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/osstringext/sidebar-items.js b/doc/clap/osstringext/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/osstringext/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/sidebar-items.js b/doc/clap/sidebar-items.js deleted file mode 100644 index d6186f44..00000000 --- a/doc/clap/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["AppSettings","Application level settings, which affect how `App` operates"],["ErrorKind","Command line argument parser kind of error"]],"macro":[["_clap_count_exprs!","Counts the number of comma-delimited expressions passed to it. The result is a compile-time evaluable expression, suitable for use as a static array size, or the value of a `const`."],["arg_enum!","Convenience macro to generate more complete enums with variants to be used as a type when parsing arguments. This enum also provides a `variants()` function which can be used to retrieve a `Vec<&'static str>` of the variant names, as well as implementing `FromStr` and `Display` automatically."],["crate_version!","Allows you to pull the version from your Cargo.toml at compile time as MAJOR.MINOR.PATCH_PKGVERSION_PRE"],["value_t!","Convenience macro getting a typed value `T` where `T` implements `std::str::FromStr` from an argument value. This macro returns a `Result` which allows you as the developer to decide what you'd like to do on a failed parse. There are two types of errors, parse failures and those where the argument wasn't present (such as a non-required argument). You can use it to get a single value, or a iterator as with the `ArgMatches::values_of`"],["value_t_or_exit!","Convenience macro getting a typed value `T` where `T` implements `std::str::FromStr` or exiting upon error instead of returning a `Result`"],["values_t!","Convenience macro getting a typed value `Vec` where `T` implements `std::str::FromStr` This macro returns a `clap::Result>` (`Result, clap::Error>`) which allows you as the developer to decide what you'd like to do on a failed parse."],["values_t_or_exit!","Convenience macro getting a typed value `Vec` where `T` implements `std::str::FromStr` or exiting upon error."]],"struct":[["App","Used to create a representation of a command line program and all possible command line arguments. Application settings are set using the \"builder pattern\" with the `.get_matches()` family of methods being the terminal methods that starts the runtime-parsing process. These methods then return information about the user supplied arguments (or lack there of)."],["Arg","The abstract representation of a command line argument. Used to set all the options and relationships that define a valid argument for the program."],["ArgGroup","`ArgGroup`s are a family of related arguments and way for you to express, \"Any of these arguments\". By placing arguments in a logical group, you can create easier requirement and exclusion rules instead of having to list each argument individually, or when you want a rule to apply \"any but not all\" arguments."],["ArgMatches","Used to get information about the arguments that where supplied to the program at runtime by the user. New instances of this struct are obtained by using the `App::get_matches` family of methods."],["Error","Command Line Argument Parser Error"],["SubCommand","The abstract representation of a command line subcommand."]],"type":[["Result","Short hand for result type"]]}); \ No newline at end of file diff --git a/doc/clap/strext/index.html b/doc/clap/strext/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/strext/sidebar-items.js b/doc/clap/strext/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/strext/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/struct.App.html b/doc/clap/struct.App.html deleted file mode 100644 index 0af3d9c5..00000000 --- a/doc/clap/struct.App.html +++ /dev/null @@ -1,599 +0,0 @@ - - - - - - - - - - clap::App - Rust - - - - - - - - - - - - - - - - - -
-

Struct clap::App - - [−] - - [src]

-
pub struct App<'a, 'b> where 'a: 'b {
-    // some fields omitted
-}

Used to create a representation of a command line program and all possible command line -arguments. Application settings are set using the "builder pattern" with the -.get_matches() family of methods being the terminal methods that starts the runtime-parsing -process. These methods then return information about the user supplied arguments (or lack there -of).

- -

NOTE: There aren't any mandatory "options" that one must set. The "options" may -also appear in any order (so long as one of the App::get_matches* methods is the last method -called).

- -

Examples

-
-let m = App::new("My Program")
-    .author("Me, me@mail.com")
-    .version("1.0.2")
-    .about("Explains in brief what the program does")
-    .arg(
-        Arg::with_name("in_file").index(1)
-    )
-    .after_help("Longer explaination to appear after the options when \
-                 displaying the help information from --help or -h")
-    .get_matches();
-
-// Your program logic starts here...
-

Methods

impl<'a, 'b> App<'a, 'b>

fn new<S: Into<String>>(n: S) -> Self

-

Creates a new instance of an application requiring a name. The name may be, but doesn't -have to be same as the binary. The name will be displayed to the user when they request to -print version or help and usage information.

- -

Examples

-
-let prog = App::new("My Program")
-

fn author<S: Into<&'b str>>(self, author: S) -> Self

-

Sets a string of author(s) that will be displayed to the user when they -request the help information with --help or -h.

- -

Pro-tip: If you turn on unstable features you can use claps -convienience macro crate_authors! to automatically set your -application's author to the same thing as your crate at compile time. -See the examples/ -directory for more information

- -

Examples

-
-App::new("myprog")
-     .author("Me, me@mymain.com")
-

fn bin_name<S: Into<String>>(self, name: S) -> Self

-

Overrides the system-determined binary name. This should only be used when absolutely -neccessary, such as when the binary name for your application is misleading, or perhaps -not how the user should invoke your program.

- -

Pro-tip: When building things such as third party cargo subcommands, this setting -should be used!

- -

NOTE: This command should not be used for SubCommands.

- -

Examples

-
-App::new("My Program")
-     .bin_name("my_binary")
-

fn about<S: Into<&'b str>>(self, about: S) -> Self

-

Sets a string describing what the program does. This will be displayed when displaying help -information.

- -

Examples

-
-App::new("myprog")
-    .about("Does really amazing things to great people")
-

fn after_help<S: Into<&'b str>>(self, help: S) -> Self

-

Adds additional help information to be displayed in addition to auto-generated help. This -information is displayed after the auto-generated help information. This is often used -to describe how to use the arguments, or caveats to be noted.

- -

Examples

-
-App::new("myprog")
-    .after_help("Does really amazing things to great people...but be careful with -R")
-

fn before_help<S: Into<&'b str>>(self, help: S) -> Self

-

Adds additional help information to be displayed in addition to auto-generated help. This -information is displayed before the auto-generated help information. This is often used -for header information.

- -

Examples

-
-App::new("myprog")
-    .before_help("Some info I'd like to appear before the help info")
-

fn version<S: Into<&'b str>>(self, ver: S) -> Self

-

Sets a string of the version number to be displayed when displaying version or help -information.

- -

Pro-tip: Use claps convienience macro crate_version! to automatically set your -application's version to the same thing as your crate at compile time. See the examples/ -directory for more information

- -

Examples

-
-App::new("myprog")
-    .version("v0.1.24")
-

fn usage<S: Into<&'b str>>(self, usage: S) -> Self

-

Sets a custom usage string to override the auto-generated usage string.

- -

This will be displayed to the user when errors are found in argument parsing, or when you -call ArgMatches::usage

- -

CAUTION: Using this setting disables claps "context-aware" usage strings. After this -setting is set, this will be the only usage string displayed to the user!

- -

NOTE: You do not need to specify the "USAGE: \n\t" portion, as that will -still be applied by clap, you only need to specify the portion starting -with the binary name.

- -

NOTE: This will not replace the entire help message, only the portion -showing the usage.

- -

Examples

-
-App::new("myprog")
-    .usage("myapp [-clDas] <some_file>")
-

fn help<S: Into<&'b str>>(self, help: S) -> Self

-

Sets a custom help message and overrides the auto-generated one. This should only be used -when the auto-generated message does not suffice.

- -

This will be displayed to the user when they use --help or -h

- -

NOTE: This replaces the entire help message, so nothing will be auto-generated.

- -

NOTE: This only replaces the help message for the current command, meaning if you -are using subcommands, those help messages will still be auto-generated unless you -specify a .help() for them as well.

- -

Examples

-
-App::new("myapp")
-    .help("myapp v1.0\n\
-           Does awesome things\n\
-           (C) me@mail.com\n\n\
-
-           USAGE: myapp <opts> <comamnd>\n\n\
-
-           Options:\n\
-           -h, --helpe      Dispay this message\n\
-           -V, --version    Display version info\n\
-           -s <stuff>       Do something with stuff\n\
-           -v               Be verbose\n\n\
-
-           Commmands:\n\
-           help             Prints this message\n\
-           work             Do some work")
-

fn help_short<S: AsRef<str> + 'b>(self, s: S) -> Self

-

Sets the short version of the help argument without the preceding -.

- -

By default clap automatically assigns h, but this can be overridden by defining your -own argument with a lowercase h as the short. clap lazily generates these help -arguments after you've defined any arguments of your own.

- -

NOTE: Any leading - characters will be stripped, and only the first -non - chacter will be used as the short version

- -

Examples

-
-App::new("myprog")
-    .help_short("H") // Using an uppercase `H` instead of the default lowercase `h`
-

fn version_short<S: AsRef<str>>(self, s: S) -> Self

-

Sets the short version of the version argument without the preceding -.

- -

By default clap automatically assigns V, but this can be overridden by defining your -own argument with a uppercase V as the short. clap lazily generates these version -arguments after you've defined any arguments of your own.

- -

NOTE: Any leading - characters will be stripped, and only the first -non - chacter will be used as the short version

- -

Examples

-
-App::new("myprog")
-    .version_short("v") // Using a lowercase `v` instead of the default capital `V`
-

fn template<S: Into<&'b str>>(self, s: S) -> Self

-

Sets the help template to be used, overriding the default format.

- -

Tags arg given inside curly brackets: -Valid tags are: - * {bin} - Binary name. - * {version} - Version number. - * {author} - Author information. - * {usage} - Automatically generated or given usage string. - * {all-args} - Help for all arguments (options, flags, positionals arguments, - and subcommands) including titles. - * {unified} - Unified help for options and flags. - * {flags} - Help for flags. - * {options} - Help for options. - * {positionals} - Help for positionals arguments. - * {subcommands} - Help for subcommands. - * {after-help} - Help for flags.

- -

Examples

-
-App::new("myprog")
-    .version("1.0")
-    .template("{bin} ({version}) - {usage}")
- -

NOTE:The template system is, on purpose, very simple. Therefore the tags have to writen -in the lowercase and without spacing.

-

fn setting(self, setting: AppSettings) -> Self

-

Enables a single Application level settings.

- -

See AppSettings for a full list of possibilities and examples.

- -

Examples

-
-App::new("myprog")
-    .setting(AppSettings::SubcommandRequired)
-    .setting(AppSettings::WaitOnError)
-

fn settings(self, settings: &[AppSettings]) -> Self

-

Enables multiple Application level settings

- -

See AppSettings for a full list of possibilities and examples.

- -

Examples

-
-App::new("myprog")
-    .settings(&[AppSettings::SubcommandRequired,
-                 AppSettings::WaitOnError])
-

fn arg<A: Borrow<Arg<'a, 'b>> + 'a>(self, a: A) -> Self

-

Adds an argument to the list of valid possibilties.

- -

Examples

-
-App::new("myprog")
-    // Adding a single "flag" argument with a short and help text, using Arg::with_name()
-    .arg(
-        Arg::with_name("debug")
-           .short("d")
-           .help("turns on debugging mode")
-    )
-    // Adding a single "option" argument with a short, a long, and help text using the less
-    // verbose Arg::from_usage()
-    .arg(
-        Arg::from_usage("-c --config=[CONFIG] 'Optionally sets a config file to use'")
-    )
-

fn args(self, args: &[Arg<'a, 'b>]) -> Self

-

Adds multiple arguments to the list of valid possibilties

- -

Examples

-
-App::new("myprog")
-    .args(
-        &[Arg::from_usage("[debug] -d 'turns on debugging info'"),
-         Arg::with_name("input").index(1).help("the input file to use")]
-    )
-

fn arg_from_usage(self, usage: &'a str) -> Self

-

A convienience method for adding a single argument from a usage type string. The string -used follows the same rules and syntax as Arg::from_usage()

- -

NOTE: The downside to using this method is that you can not set any additional -properties of the Arg other than what Arg::from_usage() supports.

- -

Examples

-
-App::new("myprog")
-    .arg_from_usage("-c --config=<FILE> 'Sets a configuration file to use'")
-

fn args_from_usage(self, usage: &'a str) -> Self

-

Adds multiple arguments at once from a usage string, one per line. See Arg::from_usage() -for details on the syntax and rules supported.

- -

NOTE: Like App::arg_from_usage() the downside is you only set properties for the -Args which Arg::from_usage() supports.

- -

Examples

-
-App::new("myprog")
-    .args_from_usage(
-        "-c --config=[FILE] 'Sets a configuration file to use'
-         [debug]... -d 'Sets the debugging level'
-         <FILE> 'The input file to use'"
-    )
-

fn group(self, group: ArgGroup<'a>) -> Self

-

Adds an ArgGroup to the application. ArgGroups are a family of related arguments. By -placing them in a logical group, you can build easier requirement and exclusion rules. For -instance, you can make an entire ArgGroup required, meaning that one (and only one) argument -from that group must be present at runtime.

- -

You can also do things such as name an ArgGroup as a conflict to another argument. -Meaning any of the arguments that belong to that group will cause a failure if present with -the conflicting argument.

- -

Another added benfit of ArgGroups is that you can extract a value from a group instead of -determining exactly which argument was used.

- -

Finally, using ArgGroups to ensure exclusion between arguments is another very common use

- -

Examples

-

The following example demonstrates using an ArgGroup to ensure that one, and only one, of -the arguments from the specified group is present at runtime.

- -
-App::new("app")
-    .args_from_usage(
-        "--set-ver [ver] 'set the version manually'
-         --major         'auto increase major'
-         --minor         'auto increase minor'
-         --patch         'auto increase patch'")
-    .group(ArgGroup::with_name("vers")
-         .args(&["set-ver", "major", "minor","patch"])
-         .required(true))
-

fn groups(self, groups: &[ArgGroup<'a>]) -> Self

-

Adds multiple ArgGroups to the application at once.

- -

Examples

-
-App::new("app")
-    .args_from_usage(
-        "--set-ver [ver] 'set the version manually'
-         --major         'auto increase major'
-         --minor         'auto increase minor'
-         --patch         'auto increase patch'
-         -c [FILE]       'a config file'
-         -i [IFACE]      'an interface'")
-    .groups(&[
-        ArgGroup::with_name("vers")
-            .args(&["set-ver", "major", "minor","patch"])
-            .required(true),
-        ArgGroup::with_name("input")
-            .args(&["c", "i"])
-    ])
-

fn subcommand(self, subcmd: App<'a, 'b>) -> Self

-

Adds a subcommand to the list of valid possibilties. Subcommands are effectively sub-apps, -because they can contain their own arguments, subcommands, version, usage, etc. They also -function just like apps, in that they get their own auto generated help, version, and -usage.

- -

Examples

-
-App::new("myprog")
-    .subcommand(SubCommand::with_name("config")
-        .about("Controls configuration features")
-        .arg_from_usage("<config> 'Required configuration file to use'"))
-

fn subcommands<I>(self, subcmds: I) -> Self where I: IntoIterator<Item=App<'a, 'b>>

-

Adds multiple subcommands to the list of valid possibilties by iterating over a Vec of -SubCommands

- -

Examples

-
-.subcommands( vec![
-       SubCommand::with_name("config").about("Controls configuration functionality")
-                                .arg(Arg::with_name("config_file").index(1)),
-       SubCommand::with_name("debug").about("Controls debug functionality")])
-

fn display_order(self, ord: usize) -> Self

-

Allows custom ordering of subcommands within the help message. Subcommands with a lower -value will be displayed first in the help message. This is helpful when one would like to -emphasise frequently used subcommands, or prioritize those towards the top of the list. -Duplicate values are allowed. Subcommands with duplicate display orders will be -displayed in alphabetical order.

- -

NOTE: The default is 999 for all subcommands.

- -

Examples

-
-let m = App::new("cust-ord")
-    .subcommand(SubCommand::with_name("alpha") // typically subcommands are grouped
-                                               // alphabetically by name. Subcommands
-                                               // without a display_order have a value of
-                                               // 999 and are displayed alphabetically with
-                                               // all other 999 subcommands
-        .about("Some help and text"))
-    .subcommand(SubCommand::with_name("beta")
-        .display_order(1)   // In order to force this subcommand to appear *first*
-                            // all we have to do is give it a value lower than 999.
-                            // Any other subcommands with a value of 1 will be displayed
-                            // alphabetically with this one...then 2 values, then 3, etc.
-        .about("I should be first!"))
-    .get_matches_from(vec![
-        "cust-ord", "--help"
-    ]);
- -

The above example displays the following help message

- -
-cust-ord
-
-USAGE:
-    cust-ord [FLAGS] [OPTIONS]
-
-FLAGS:
-    -h, --help       Prints help information
-    -V, --version    Prints version information
-
-SUBCOMMANDS:
-    beta    I should be first!
-    alpha   Some help and text
-

fn print_help(&self) -> ClapResult<()>

-

Prints the full help message to io::stdout() using a BufWriter

- -

Examples

-
-let app = App::new("myprog");
-app.print_help();
-

fn write_help<W: Write>(&self, w: &mut W) -> ClapResult<()>

-

Writes the full help message to the user to a io::Write object

- -

Examples

-
-use std::io;
-let mut app = App::new("myprog");
-let mut out = io::stdout();
-app.write_help(&mut out).ok().expect("failed to write to stdout");
-

fn get_matches(self) -> ArgMatches<'a>

-

Starts the parsing process, upon a failed parse an error will be displayed to the user and -the process with exit with the appropriate error code. By default this method gets matches -from env::args_os

- -

Examples

-
-let matches = App::new("myprog")
-    // Args and options go here...
-    .get_matches();
-

fn get_matches_safe(self) -> ClapResult<ArgMatches<'a>>

-

Starts the parsing process. This method will return a Result type instead of exiting the -the process on failed parse. By default this method gets matches -from env::args_os

- -

NOTE: This method WILL NOT exit when --help or --version (or short versions) are -used. It will return an error, where the kind is a ErrorKind::HelpDisplayed -or ErrorKind::VersionDisplayed respectively. You must call error.exit() or -perform a std::process::exit.

- -

Examples

-
-let matches = App::new("myprog")
-    // Args and options go here...
-    .get_matches_safe()
-    .unwrap_or_else( |e| e.exit() );
-

fn get_matches_from<I, T>(self, itr: I) -> ArgMatches<'a> where I: IntoIterator<Item=T>, T: Into<OsString>

-

Starts the parsing process. Like App::get_matches this method does not return a Result -and will automatically exit with an error message. This method, however, lets you specify -what iterator to use when performing matches, such as a Vec of your making.

- -

NOTE: The first argument will be parsed as the binary name unless -AppSettings::NoBinaryName is used

- -

Examples

-
-let arg_vec = vec!["my_prog", "some", "args", "to", "parse"];
-
-let matches = App::new("myprog")
-    // Args and options go here...
-    .get_matches_from(arg_vec);
-

fn get_matches_from_safe<I, T>(self, itr: I) -> ClapResult<ArgMatches<'a>> where I: IntoIterator<Item=T>, T: Into<OsString>

-

Starts the parsing process. A combination of App::get_matches_from, and -App::get_matches_safe

- -

NOTE: This method WILL NOT exit when --help or --version (or short versions) are -used. It will return an error, where the kind is a ErrorKind::HelpDisplayed -or ErrorKind::VersionDisplayed respectively. You must call error.exit() or -perform a std::process::exit yourself.

- -

NOTE: The first argument will be parsed as the binary name unless -AppSettings::NoBinaryName is used

- -

Examples

-
-let arg_vec = vec!["my_prog", "some", "args", "to", "parse"];
-
-let matches = App::new("myprog")
-    // Args and options go here...
-    .get_matches_from_safe(arg_vec)
-    .unwrap_or_else( |e| { panic!("An error occurs: {}", e) });
-

fn get_matches_from_safe_borrow<I, T>(&mut self, itr: I) -> ClapResult<ArgMatches<'a>> where I: IntoIterator<Item=T>, T: Into<OsString>

-

Starts the parsing process without consuming the App struct self. This is normally not -the desired functionality, instead prefer App::get_matches_from_safe which does -consume self.

- -

NOTE: The first argument will be parsed as the binary name unless -AppSettings::NoBinaryName is used

- -

Examples

-
-let arg_vec = vec!["my_prog", "some", "args", "to", "parse"];
-
-let mut app = App::new("myprog");
-    // Args and options go here...
-let matches = app.get_matches_from_safe_borrow(arg_vec)
-    .unwrap_or_else( |e| { panic!("An error occurs: {}", e) });
-

Trait Implementations

impl<'a, 'b> Clone for App<'a, 'b>

fn clone(&self) -> Self

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<'n, 'e> Display for App<'n, 'e>

fn fmt(&self, f: &mut Formatter) -> Result

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/struct.Arg.html b/doc/clap/struct.Arg.html deleted file mode 100644 index 48f42dd9..00000000 --- a/doc/clap/struct.Arg.html +++ /dev/null @@ -1,1564 +0,0 @@ - - - - - - - - - - clap::Arg - Rust - - - - - - - - - - - - - - - - - -
-

Struct clap::Arg - - [−] - - [src]

-
pub struct Arg<'a, 'b> where 'a: 'b {
-    // some fields omitted
-}

The abstract representation of a command line argument. Used to set all the options and -relationships that define a valid argument for the program.

- -

There are two methods for constructing Args, using the builder pattern and setting options -manually, or using a usage string which is far less verbose but has fewer options. You can also -use a combination of the two methods to achieve the best of both worlds.

- -

Examples

-
-// Using the traditional builder pattern and setting each option manually
-let cfg = Arg::with_name("config")
-      .short("c")
-      .long("config")
-      .takes_value(true)
-      .value_name("FILE")
-      .help("Provides a config file to myprog");
-// Using a usage string (setting a similar argument to the one above)
-let input = Arg::from_usage("-i, --input=[FILE] 'Provides an input file to the program'");
-

Methods

impl<'a, 'b> Arg<'a, 'b>

fn with_name(n: &'a str) -> Self

-

Creates a new instance of Arg using a unique string name. The name will be used to get -information about whether or not the argument was used at runtime, get values, set -relationships with other args, etc..

- -

NOTE: In the case of arguments that take values (i.e. takes_value(true)) -and positional arguments (i.e. those without a preceding - or --) the name will also -be displayed when the user prints the usage/help information of the program.

- -

Examples

-
-Arg::with_name("config")
-

fn from_usage(u: &'a str) -> Self

-

Creates a new instance of Arg from a usage string. Allows creation of basic settings for -the Arg. The syntax is flexible, but there are some rules to follow.

- -

NOTE: Not all settings may be set using the usage string method. Some properties are -only available via the builder pattern.

- -

NOTE: Only ASCII values in from_usage strings are officially supported. Some UTF-8 -codepoints may work just fine, but this is not guaranteed.

- -

Syntax

-

Usage strings typically following the form:

- -
[explicit name] [short] [long] [value names] [help string]
-
- -

This is not a hard rule as the attributes can appear in other orders. There are also -several additional sigils which denote additional settings. Below are the details of each -portion of the string.

- -

Explicit Name

-

This is an optional field, if it's omitted the argumenet will use one of the additioinal -fields as the name using the following priority order:

- -
    -
  • Explicit Name (This always takes precedence when present)
    • -
  • Long
    • -
  • Short
    • -
  • Value Name
    • -
- -

clap determines explicit names as the first string of characters between either [] or -<> where [] has the dual notation of meaning the argument is optional, and <> meaning -the argument is required.

- -

Explicit names may be followed by: - * The multiple denotation ...

- -

Example explicit names as follows (ename for an optional argument, and rname for a -required argument):

- -
[ename] -s, --long 'some flag'
-<rname> -r, --longer 'some other flag'
-
- -

Short

-

This is set by placing a single character after a leading -.

- -

Shorts may be followed by - * The multiple denotation ... - * An optional comma , which is cosmetic only - * Value notation

- -

Example shorts are as follows (-s, and -r):

- -
-s, --long 'some flag'
-<rname> -r [val], --longer 'some option'
-
- -

Long

-

This is set by placing a word (no spaces) after a leading --.

- -

Shorts may be followed by - * The multiple denotation ... - * Value notation

- -

Example longs are as follows (--some, and --rapid):

- -
-s, --some 'some flag'
---rapid=[FILE] 'some option'
-
- -

Values (Value Notation)

-

This is set by placing a word(s) between [] or <> optionally after = (although this -is cosmetic only and does not affect functionality). If an explicit name has not been -set, using <> will denote a required argument, and [] will denote an optional argument

- -

Values may be followed by - * The multiple denotation ... - * More Value notation

- -

More than one value will also implicitly set the arguments number of values, i.e. having -two values, --option [val1] [val2] specifies that in order for option to be satisified it -must receive exactly two values

- -

Example values are as follows (FILE, and SPEED):

- -
-s, --some [FILE] 'some option'
---rapid=<SPEED>... 'some required multiple option'
-
- -

Help String

-

The help string is denoted between a pair of single quotes '' and may contain any characters.

- -

Example help strings are as follows:

- -
-s, --some [FILE] 'some option'
---rapid=<SPEED>... 'some required multiple option'
-
- -

Additional Sigils

-

Multiple notation ... (three consecutive dots/periods) specifies that this argument may -be used multiple times. Do not confuse multiple occurrences (...) with multiple values. ---option val1 val2 is a single occurrence with multiple values. --flag --flag is -multiple occurrences (and then you can obviously have instances of both as well)

- -

Examples

-
-App::new("myprog")
-    .args(&[
-        Arg::from_usage("--config <FILE> 'a required file for the configuration and no short'"),
-        Arg::from_usage("-d, --debug... 'turns on debugging information and allows multiples'"),
-        Arg::from_usage("[input] 'an optional input file to use'")
-])
-

fn short<S: AsRef<str>>(self, s: S) -> Self

-

Sets the short version of the argument without the preceding -.

- -

By default clap automatically assigns V and h to display version and help information -respectively. You may use V or h for your own purposes, in which case clap simply -will not assign those to the displaying of version or help.

- -

NOTE: Any leading - characters will be stripped, and only the first -non - character will be used as the short version

- -

Examples

-

To set short use a single valid UTF-8 codepoint. If you supply a leading - such as -c -it will be stripped.

- -
-Arg::with_name("config")
-    .short("c")
- -

Setting short allows using the argument via a single hyphen (-) such as -c

- -
-let m = App::new("shorttest")
-    .arg(Arg::with_name("config")
-        .short("c"))
-    .get_matches_from(vec![
-        "shorttest", "-c"
-    ]);
-
-assert!(m.is_present("config"));
-

fn long(self, l: &'b str) -> Self

-

Sets the long version of the argument without the preceding --.

- -

By default clap automatically assigns version and help to display version and help -information respectively. You may use version or help for your own purposes, in which -case clap simply will not assign those to the displaying of version or help automatically, -and you will have to do so manually.

- -

NOTE: Any leading - characters will be stripped

- -

Examples

-

To set long use a word containing valid UTF-8 codepoints. If you supply a dobule leading --- such as --config they will be stripped. Hyphens in the middle of the word, however, -will not be stripped (i.e. config-file is allowed)

- -
-Arg::with_name("cfg")
-    .long("config")
- -

Setting long allows using the argument via a double hyphen (--) such as --config

- -
-let m = App::new("longtest")
-    .arg(Arg::with_name("cfg")
-        .long("config"))
-    .get_matches_from(vec![
-        "shorttest", "--config"
-    ]);
-
-assert!(m.is_present("cfg"));
-

fn help(self, h: &'b str) -> Self

-

Sets the help text of the argument that will be displayed to the user when they print the -usage/help information.

- -

Examples

-

Any valid String slice is allowed as help (i.e. only valid UTF-8). The one exception is -one wishes to include a newline in the help text. To include a newline and be properly -aligned with all other arguments help text, it must be specified via {n} instead of \n.

- -
-Arg::with_name("config")
-    .help("The config file used by the myprog")
- -

Setting help displays a short message to the side of the argument when the user passes --h or --help (by default).

- -
-let m = App::new("helptest")
-    .arg(Arg::with_name("cfg")
-        .long("config")
-        .help("Some help text describing the --config arg"))
-    .get_matches_from(vec![
-        "shorttest", "--help"
-    ]);
-
-// ...
- -

The above example displays

- -
helptest
-
-USAGE:
-   helptest [FLAGS]
-
-FLAGS:
-    --config     Some help text describing the --config arg
--h, --help       Prints help information
--V, --version    Prints version information
-
-

fn required(self, r: bool) -> Self

-

Sets whether or not the argument is required by default. Required by default means it is -required, when no other conflicting rules have been evaluated. Conflicting rules take -precedence over being required. Default: false

- -

NOTE: Flags (i.e. not positional, or arguments that take values) cannot be required.

- -

Examples

-
-Arg::with_name("config")
-    .required(true)
- -

Setting required(true) requires that the argument be used at runtime.

- -
-let res = App::new("longtest")
-    .arg(Arg::with_name("cfg")
-        .required(true)
-        .takes_value(true)
-        .long("config"))
-    .get_matches_from_safe(vec![
-        "shorttest", "--config", "file.conf"
-    ]);
-
-assert!(res.is_ok());
- -

Setting required(true) and not supplying that argument is an error.

- -
-let res = App::new("longtest")
-    .arg(Arg::with_name("cfg")
-        .required(true)
-        .takes_value(true)
-        .long("config"))
-    .get_matches_from_safe(vec![
-        "shorttest"
-    ]);
-
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::MissingRequiredArgument);
-

fn required_unless(self, name: &'a str) -> Self

-

Sets an arg that override this arg's required setting. (i.e. this arg will be required -unless this other argument is present).

- -

Pro Tip: Using Arg::required_unless implies Arg::required and is therefore not -mandatory to also set.

- -

Examples

-
-Arg::with_name("config")
-    .required_unless("debug")
- -

Setting required_unless(name) requires that the argument be used at runtime unless -name is present. In the following example, the required argument is not provided, but -it's not an error because the unless arg has been supplied.

- -
-let res = App::new("unlesstest")
-    .arg(Arg::with_name("cfg")
-        .required_unless("dbg")
-        .takes_value(true)
-        .long("config"))
-    .arg(Arg::with_name("dbg")
-        .long("debug"))
-    .get_matches_from_safe(vec![
-        "unlesstest", "--debug"
-    ]);
-
-assert!(res.is_ok());
- -

Setting required_unless(name) and not supplying name or this arg is an error.

- -
-let res = App::new("unlesstest")
-    .arg(Arg::with_name("cfg")
-        .required_unless("dbg")
-        .takes_value(true)
-        .long("config"))
-    .arg(Arg::with_name("dbg")
-        .long("debug"))
-    .get_matches_from_safe(vec![
-        "unlesstest"
-    ]);
-
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::MissingRequiredArgument);
-

fn required_unless_all(self, names: &[&'a str]) -> Self

-

Sets args that override this arg's required setting. (i.e. this arg will be required unless -all these other argument are present).

- -

NOTE: If you wish for the this argument to only be required if one of these args are -present see Arg::required_unless_one

- -

Examples

-
-Arg::with_name("config")
-    .required_unless_all(&["cfg", "dbg"])
- -

Setting required_unless_all(names) requires that the argument be used at runtime unless -all the args in names are present. In the following example, the required argument is -not provided, but it's not an error because all the unless args have been supplied.

- -
-let res = App::new("unlessall")
-    .arg(Arg::with_name("cfg")
-        .required_unless_all(&["dbg", "infile"])
-        .takes_value(true)
-        .long("config"))
-    .arg(Arg::with_name("dbg")
-        .long("debug"))
-    .arg(Arg::with_name("infile")
-        .short("i")
-        .takes_value(true))
-    .get_matches_from_safe(vec![
-        "unlessall", "--debug", "-i", "file"
-    ]);
-
-assert!(res.is_ok());
- -

Setting required_unless_all(names) and not supplying all of names or this arg is an -error.

- -
-let res = App::new("unlessall")
-    .arg(Arg::with_name("cfg")
-        .required_unless_all(&["dbg", "infile"])
-        .takes_value(true)
-        .long("config"))
-    .arg(Arg::with_name("dbg")
-        .long("debug"))
-    .arg(Arg::with_name("infile")
-        .short("i")
-        .takes_value(true))
-    .get_matches_from_safe(vec![
-        "unlessall"
-    ]);
-
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::MissingRequiredArgument);
-

fn required_unless_one(self, names: &[&'a str]) -> Self

-

Sets args that override this arg's required setting. (i.e. this arg will be required unless -at least one of these other argument are present).

- -

NOTE: If you wish for the this argument to only be required if all of these args are -present see Arg::required_unless_all

- -

Examples

-
-Arg::with_name("config")
-    .required_unless_all(&["cfg", "dbg"])
- -

Setting required_unless_one(names) requires that the argument be used at runtime unless -at least one of the args in names are present. In the following example, the required -argument is not provided, but it's not an error because one the unless args have been -supplied.

- -
-let res = App::new("unlessone")
-    .arg(Arg::with_name("cfg")
-        .required_unless_one(&["dbg", "infile"])
-        .takes_value(true)
-        .long("config"))
-    .arg(Arg::with_name("dbg")
-        .long("debug"))
-    .arg(Arg::with_name("infile")
-        .short("i")
-        .takes_value(true))
-    .get_matches_from_safe(vec![
-        "unlessone", "--debug"
-    ]);
-
-assert!(res.is_ok());
- -

Setting required_unless_one(names) and not supplying at least one of names or this -arg is an error.

- -
-let res = App::new("unlessone")
-    .arg(Arg::with_name("cfg")
-        .required_unless_one(&["dbg", "infile"])
-        .takes_value(true)
-        .long("config"))
-    .arg(Arg::with_name("dbg")
-        .long("debug"))
-    .arg(Arg::with_name("infile")
-        .short("i")
-        .takes_value(true))
-    .get_matches_from_safe(vec![
-        "unlessone"
-    ]);
-
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::MissingRequiredArgument);
-

fn conflicts_with(self, name: &'a str) -> Self

-

Sets a conflicting argument by name. I.e. when using this argument, -the following argument can't be present and vice versa.

- -

NOTE: Conflicting rules take precedence over being required by default. Conflict rules -only need to be set for one of the two arguments, they do not need to be set for each.

- -

NOTE: Defining a conflict is two-way, but does not need to defined for both arguments -(i.e. if A conflicts with B, defining A.conflicts_with(B) is sufficient. You do not need -need to also do B.conflicts_with(A))

- -

Examples

-
-Arg::with_name("config")
-    .conflicts_with("debug")
- -

Setting conflicting argument, and having both arguments present at runtime is an error.

- -
-let res = App::new("conflictions")
-    .arg(Arg::with_name("cfg")
-        .takes_value(true)
-        .conflicts_with("debug")
-        .long("config"))
-    .arg(Arg::with_name("debug")
-        .long("debug"))
-    .get_matches_from_safe(vec![
-        "conflictions", "--debug", "--config", "file.conf"
-    ]);
-
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::ArgumentConflict);
-

fn conflicts_with_all(self, names: &[&'a str]) -> Self

-

The same as Arg::conflicts_with but allows specifying multiple two-way conlicts per -argument.

- -

NOTE: Conflicting rules take precedence over being required by default. Conflict rules -only need to be set for one of the two arguments, they do not need to be set for each.

- -

NOTE: Defining a conflict is two-way, but does not need to defined for both arguments -(i.e. if A conflicts with B, defining A.conflicts_with(B) is sufficient. You do not need -need to also do B.conflicts_with(A))

- -

Examples

-
-Arg::with_name("config")
-    .conflicts_with_all(&["debug", "input"])
- -

Setting conflicting argument, and having any of the arguments present at runtime with a -conflicting argument is an error.

- -
-let res = App::new("conflictions")
-    .arg(Arg::with_name("cfg")
-        .takes_value(true)
-        .conflicts_with_all(&["debug", "input"])
-        .long("config"))
-    .arg(Arg::with_name("debug")
-        .long("debug"))
-    .arg(Arg::with_name("input")
-        .index(1))
-    .get_matches_from_safe(vec![
-        "conflictions", "--config", "file.conf", "file.txt"
-    ]);
-
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::ArgumentConflict);
-

fn overrides_with(self, name: &'a str) -> Self

-

Sets a overridable argument by name. I.e. this argument and the following argument -will override each other in POSIX style (whichever argument was specified at runtime -last "wins")

- -

NOTE: When an argument is overriden it is essentially as if it never was used, any -conflicts, requirements, etc. are evaluated after all "overrides" have been removed

- -

Examples

-
-let m = App::new("posix")
-    .arg(Arg::from_usage("-f, --flag 'some flag'")
-        .conflicts_with("debug"))
-    .arg(Arg::from_usage("-d, --debug 'other flag'"))
-    .arg(Arg::from_usage("-c, --color 'third flag'")
-        .overrides_with("flag"))
-    .get_matches_from(vec!["posix", "-f", "-d", "-c"]);
-                                //    ^~~~~~~~~~~~^~~~~ flag is overriden by color
-
-assert!(m.is_present("color"));
-assert!(m.is_present("debug")); // even though flag conflicts with debug, it's as if flag
-                                // was never used because it was overriden with color
-assert!(!m.is_present("flag"));
-

fn overrides_with_all(self, names: &[&'a str]) -> Self

-

Sets multiple mutually overridable arguments by name. I.e. this argument and the following -argument will override each other in POSIX style (whichever argument was specified at -runtime last "wins")

- -

NOTE: When an argument is overriden it is essentially as if it never was used, any -conflicts, requirements, etc. are evaluated after all "overrides" have been removed

- -

Examples

-
-let m = App::new("posix")
-    .arg(Arg::from_usage("-f, --flag 'some flag'")
-        .conflicts_with("color"))
-    .arg(Arg::from_usage("-d, --debug 'other flag'"))
-    .arg(Arg::from_usage("-c, --color 'third flag'")
-        .overrides_with_all(&["flag", "debug"]))
-    .get_matches_from(vec!["posix", "-f", "-d", "-c"]);
-                                //    ^~~~~~^~~~~~~~~ flag and debug are overriden by color
-
-assert!(m.is_present("color")); // even though flag conflicts with color, it's as if flag
-                                // and debug were never used because they were overriden
-                                // with color
-assert!(!m.is_present("debug"));
-assert!(!m.is_present("flag"));
-

fn requires(self, name: &'a str) -> Self

-

Sets an argument by name that is required when this one is present I.e. when -using this argument, the following argument must be present.

- -

NOTE: Conflicting rules and override rules take precedence over being required

- -

Examples

-
-Arg::with_name("config")
-    .requires("input")
- -

Setting requires("arg") requires that the argument be used at runtime if the defining -argument is used. If the defining argument isn't used, the other arguemnt isn't required

- -
-let res = App::new("reqtest")
-    .arg(Arg::with_name("cfg")
-        .takes_value(true)
-        .requires("input")
-        .long("config"))
-    .arg(Arg::with_name("input")
-        .index(1))
-    .get_matches_from_safe(vec![
-        "reqtest"
-    ]);
-
-assert!(res.is_ok()); // We didn't use cfg, so input wasn't required
- -

Setting requires("arg") and not supplying that argument is an error.

- -
-let res = App::new("reqtest")
-    .arg(Arg::with_name("cfg")
-        .takes_value(true)
-        .requires("input")
-        .long("config"))
-    .arg(Arg::with_name("input")
-        .index(1))
-    .get_matches_from_safe(vec![
-        "reqtest", "--config", "file.conf"
-    ]);
-
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::MissingRequiredArgument);
-

fn requires_all(self, names: &[&'a str]) -> Self

-

Sets multiple arguments by names that are required when this one is present I.e. when -using this argument, the following arguments must be present.

- -

NOTE: Mutually exclusive and override rules take precedence over being required -by default.

- -

Examples

-
-Arg::with_name("config")
-    .requires_all(&["input", "output"])
- -

Setting requires_all(&["arg", "arg2"]) requires that all the arguments be used at runtime -if the defining argument is used. If the defining argument isn't used, the other arguemnt -isn't required

- -
-let res = App::new("reqtest")
-    .arg(Arg::with_name("cfg")
-        .takes_value(true)
-        .requires("input")
-        .long("config"))
-    .arg(Arg::with_name("input")
-        .index(1))
-    .arg(Arg::with_name("output")
-        .index(2))
-    .get_matches_from_safe(vec![
-        "reqtest"
-    ]);
-
-assert!(res.is_ok()); // We didn't use cfg, so input and output weren't required
- -

Setting requires_all(&["arg", "arg2"]) and not supplying all the arguments is an error.

- -
-let res = App::new("reqtest")
-    .arg(Arg::with_name("cfg")
-        .takes_value(true)
-        .requires_all(&["input", "output"])
-        .long("config"))
-    .arg(Arg::with_name("input")
-        .index(1))
-    .arg(Arg::with_name("output")
-        .index(2))
-    .get_matches_from_safe(vec![
-        "reqtest", "--config", "file.conf", "in.txt"
-    ]);
-
-assert!(res.is_err());
-// We didn't use output
-assert_eq!(res.unwrap_err().kind, ErrorKind::MissingRequiredArgument);
-

fn takes_value(self, tv: bool) -> Self

-

Specifies that the argument takes a value at run time.

- -

NOTE: values for arguments may be specified in any of the following methods

- -
    -
  • Using a space such as -o value or --option value
    • -
  • Using an equals and no space such as -o=value or --option=value
    • -
  • Use a short and no space such as -ovalue
    • -
- -

NOTE: By default, values are delimted by commas, meaning --option=val1,val2,val3 is -is three values for the --option argument. If you wish to change the delimiter to another -character you can use Arg::value_delimiter(char), alternatively you can delimiting values -OFF by using Arg::use_delimiter(false)

- -

Examples

-
-Arg::with_name("config")
-    .takes_value(true)
- -
-let m = App::new("posvals")
-    .arg(Arg::with_name("mode")
-        .long("mode")
-        .takes_value(true))
-    .get_matches_from(vec!["posvals", "--mode", "fast"]);
-
-assert!(m.is_present("mode"));
-assert_eq!(m.value_of("mode"), Some("fast"));
-

fn index(self, idx: u64) -> Self

-

Specifies the index of a positional argument starting at 1.

- -

NOTE: The index refers to position according to other positional argument. It does -not define position in the argument list as a whole.

- -

NOTE: If no short, or long have been defined, you can optionally leave off the -index method, and the index will be assigned in order of evaluation. Utilizing the -index method allows for setting indexes out of order

- -

NOTE: When utilized with multiple(true), only the last psoitional argument may -be defined as multiple (i.e. with the highest index)

- -

Panics

-

Although not in this method directly, App will panic! if indexes are skipped (such as -defining index(1) and index(3) but not index(2), or a positional argument is defined -as multiple and is not the highest index

- -

Examples

-
-Arg::with_name("config")
-    .index(1)
- -
-let m = App::new("posvals")
-    .arg(Arg::with_name("mode")
-        .index(1))
-    .arg(Arg::with_name("debug")
-        .long("debug"))
-    .get_matches_from(vec!["posvals", "--debug", "fast"]);
-
-assert!(m.is_present("mode"));
-assert_eq!(m.value_of("mode"), Some("fast")); // notice index(1) means "first positional"
-                                              // *not* first argument
-

fn multiple(self, multi: bool) -> Self

-

Specifies that the argument may appear more than once. For flags, this results -in the number of occurrences of the flag being recorded. For example -ddd or -d -d -d -would count as three occurrences. For options there is a distinct difference in multiple -occurrences vs multiple values.

- -

For example, --opt val1 val2 is one occurrence, but two values. Whereas ---opt val1 --opt val2 is two occurrences.

- -

WARNING:

- -

Setting multipe(true) for an option allows multiple values and multiple occurrences -because it isn't possible to more occurrences than values for options. Because multiple -values are allowed, --option val1 val2 val3 is perfectly valid, be careful when designing -a CLI where positional arguments are expectd after a option which accepts multiple values, -as clap will continue parsing values until it reaches the max or specific number of values defined, or another flag -or option.

- -

Pro Tip:

- -

It's possible to define an option which allows multiple occurrences, but only one value per -occurrence. To do this use Arg::number_of_values(1) in coordination with -Arg::multiple(true).

- -

Examples

-
-Arg::with_name("debug")
-    .short("d")
-    .multiple(true)
- -

An example with flags

- -
-let m = App::new("mults")
-    .arg(Arg::with_name("verbose")
-        .multiple(true)
-        .short("v"))
-    .get_matches_from(vec!["mults", "-v", "-v", "-v"]); // note, -vvv would have same result
-
-assert!(m.is_present("verbose"));
-assert_eq!(m.occurrences_of("verbose"), 3);
- -

An example with options

- -
-let m = App::new("mults")
-    .arg(Arg::with_name("file")
-        .multiple(true)
-        .takes_value(true)
-        .short("F"))
-    .get_matches_from(vec!["mults", "-F", "file1", "file2", "file3"]);
-
-assert!(m.is_present("file"));
-assert_eq!(m.occurrences_of("file"), 1); // notice only one occurrence
-let files: Vec<_> = m.values_of("file").unwrap().collect();
-assert_eq!(files, ["file1", "file2", "file3"]);
- -

This is functionally equivilant to the example above

- -
-let m = App::new("mults")
-    .arg(Arg::with_name("file")
-        .multiple(true)
-        .takes_value(true)
-        .short("F"))
-    .get_matches_from(vec!["mults", "-F", "file1", "-F", "file2", "-F", "file3"]);
-let files: Vec<_> = m.values_of("file").unwrap().collect();
-assert_eq!(files, ["file1", "file2", "file3"]);
-
-assert!(m.is_present("file"));
-assert_eq!(m.occurrences_of("file"), 3); // Notice 3 occurrences
-let files: Vec<_> = m.values_of("file").unwrap().collect();
-assert_eq!(files, ["file1", "file2", "file3"]);
- -

A common mistake is to define an option which allows multiples, and a positional argument

- -
-let m = App::new("mults")
-    .arg(Arg::with_name("file")
-        .multiple(true)
-        .takes_value(true)
-        .short("F"))
-    .arg(Arg::with_name("word")
-        .index(1))
-    .get_matches_from(vec!["mults", "-F", "file1", "file2", "file3", "word"]);
-
-assert!(m.is_present("file"));
-let files: Vec<_> = m.values_of("file").unwrap().collect();
-assert_eq!(files, ["file1", "file2", "file3", "word"]); // wait...what?!
-assert!(!m.is_present("word")); // but we clearly used word!
- -

The problem is clap doesn't know when to stop parsing values for "files". This is further -compounded by if we'd said word -F file1 file2 it would have worked fine, so it would -appear to only fail sometimes...not good!

- -

A solution for the example above is to specify that -F only accepts one value, but is -allowed to appear multiple times

- -
-let m = App::new("mults")
-    .arg(Arg::with_name("file")
-        .multiple(true)
-        .takes_value(true)
-        .number_of_values(1)
-        .short("F"))
-    .arg(Arg::with_name("word")
-        .index(1))
-    .get_matches_from(vec!["mults", "-F", "file1", "-F", "file2", "-F", "file3", "word"]);
-
-assert!(m.is_present("file"));
-let files: Vec<_> = m.values_of("file").unwrap().collect();
-assert_eq!(files, ["file1", "file2", "file3"]);
-assert!(m.is_present("word"));
-assert_eq!(m.value_of("word"), Some("word"));
- -

As a final example, notice if we define number_of_values(1) and try to run the problem -example above, it would have been a runtime error with a pretty message to the user :)

- -
-let res = App::new("mults")
-    .arg(Arg::with_name("file")
-        .multiple(true)
-        .takes_value(true)
-        .number_of_values(1)
-        .short("F"))
-    .arg(Arg::with_name("word")
-        .index(1))
-    .get_matches_from_safe(vec!["mults", "-F", "file1", "file2", "file3", "word"]);
-
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::UnknownArgument);
-

fn global(self, g: bool) -> Self

-

Specifies that an argument can be matched to all child subcommands.

- -

NOTE: Global arguments only propagate down, not up (to parent commands)

- -

NOTE: Global arguments cannot be required.

- -

NOTE: Global arguments, when matched, only exist in the command's matches that they -were matched to. For example, if you defined a --flag global argument in the top most -parent command, but the user supplied the arguments top cmd1 cmd2 --flag only cmd2's -ArgMatches would return true if tested for .is_present("flag").

- -

Examples

-
-Arg::with_name("debug")
-    .short("d")
-    .global(true)
- -

For example, assume an appliction with two subcommands, and you'd like to define a ---verbose flag that can be called on any of the subcommands and parent, but you don't -want to clutter the source with three duplicate Arg definitions.

- -
-let m = App::new("mults")
-    .arg(Arg::with_name("verb")
-        .long("verbose")
-        .short("v")
-        .global(true))
-    .subcommand(SubCommand::with_name("test"))
-    .subcommand(SubCommand::with_name("do-stuff"))
-    .get_matches_from(vec!["mults", "do-stuff", "--verbose"]);
-
-assert_eq!(m.subcommand_name(), Some("do-stuff"));
-let sub_m = m.subcommand_matches("do-stuff").unwrap();
-assert!(sub_m.is_present("verb"));
-

fn empty_values(self, ev: bool) -> Self

-

Allows an argument to accept explicitly empty values. An empty value must be specified at -the command line with an explicit "", or ''

- -

NOTE: Defaults to true (Explicitly empty values are allowed)

- -

NOTE: Implicitly sets takes_value(true) when set to false

- -

Examples

-
-Arg::with_name("file")
-    .long("file")
-    .empty_values(false)
- -

The default is to allow empty values, such as --option "" would be an empty value. But -we can change to make empty values become an error.

- -
-let res = App::new("evals")
-    .arg(Arg::with_name("cfg")
-        .long("config")
-        .short("v")
-        .empty_values(false))
-    .get_matches_from_safe(vec!["evals", "--config="]);
-
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::EmptyValue);
-

fn hidden(self, h: bool) -> Self

-

Hides an argument from help message output.

- -

NOTE: This does not hide the argument from usage strings on error

- -

Examples

-
-Arg::with_name("debug")
-    .hidden(true)
- -

Setting hidden(true) will hide the argument when displaying help text

- -
-let m = App::new("helptest")
-    .arg(Arg::with_name("cfg")
-        .long("config")
-        .hidden(true)
-        .help("Some help text describing the --config arg"))
-    .get_matches_from(vec![
-        "shorttest", "--help"
-    ]);
-
-// ...
- -

The above example displays

- -
helptest
-
-USAGE:
-   helptest [FLAGS]
-
-FLAGS:
--h, --help       Prints help information
--V, --version    Prints version information
-
-

fn possible_values(self, names: &[&'b str]) -> Self

-

Specifies a list of possible values for this argument. At runtime, clap verifies that only -one of the specified values was used, or fails with an error message.

- -

NOTE: This setting only applies to options and positional arguments

- -

Examples

-
-Arg::with_name("mode")
-    .takes_value(true)
-    .possible_values(&["fast", "slow", "medium"])
- -
-let m = App::new("posvals")
-    .arg(Arg::with_name("mode")
-        .long("mode")
-        .takes_value(true)
-        .possible_values(&["fast", "slow", "medium"]))
-    .get_matches_from(vec!["posvals", "--mode", "fast"]);
-assert!(m.is_present("mode"));
-assert_eq!(m.value_of("mode"), Some("fast"));
- -

The next example shows a failed parse from using a value which wasn't defined as one of the -possible values.

- -
-let res = App::new("posvals")
-    .arg(Arg::with_name("mode")
-        .long("mode")
-        .takes_value(true)
-        .possible_values(&["fast", "slow", "medium"]))
-    .get_matches_from_safe(vec!["myprog", "--mode", "wrong"]);
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::InvalidValue);
-

fn possible_value(self, name: &'b str) -> Self

-

Specifies a possible value for this argument, one at a time. At runtime, clap verifies -that only one of the specified values was used, or fails with error message.

- -

Examples

-
-Arg::with_name("mode")
-    .takes_value(true)
-    .possible_value("fast")
-    .possible_value("slow")
-    .possible_value("medium")
- -
-let m = App::new("posvals")
-    .arg(Arg::with_name("mode")
-        .long("mode")
-        .takes_value(true)
-        .possible_value("fast")
-        .possible_value("slow")
-        .possible_value("medium"))
-    .get_matches_from(vec!["posvals", "--mode", "fast"]);
-assert!(m.is_present("mode"));
-assert_eq!(m.value_of("mode"), Some("fast"));
- -

The next example shows a failed parse from using a value which wasn't defined as one of the -possible values.

- -
-let res = App::new("posvals")
-    .arg(Arg::with_name("mode")
-        .long("mode")
-        .takes_value(true)
-        .possible_value("fast")
-        .possible_value("slow")
-        .possible_value("medium"))
-    .get_matches_from_safe(vec!["myprog", "--mode", "wrong"]);
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::InvalidValue);
-

fn group(self, name: &'a str) -> Self

-

Specifies the name of the group the argument belongs to.

- -

Examples

-
-Arg::with_name("debug")
-    .long("debug")
-    .group("mode")
- -

Multiple arguments can be a member of a single group and then the group checked as if it -was one of said arguments.

- -
-let m = App::new("groups")
-    .arg(Arg::with_name("debug")
-        .long("debug")
-        .group("mode"))
-    .arg(Arg::with_name("verbose")
-        .long("verbose")
-        .group("mode"))
-    .get_matches_from(vec!["posvals", "--debug"]);
-assert!(m.is_present("mode"));
-

fn number_of_values(self, qty: u64) -> Self

-

Specifies how many values are required to satisfy this argument. For example, if you had a --f <file> argument where you wanted exactly 3 'files' you would set -.number_of_values(3), and this argument wouldn't be satisfied unless the user provided -3 and only 3 values.

- -

NOTE: Does not require .multiple(true) to be set. Setting .multiple(true) would -allow -f <file> <file> <file> -f <file> <file> <file> where as not setting -.multiple(true) would only allow one occurrence of this argument.

- -

Examples

-
-Arg::with_name("file")
-    .short("f")
-    .number_of_values(3)
- -

Not supplying the correct number of values is an error

- -
-let res = App::new("numvals")
-    .arg(Arg::with_name("file")
-        .takes_value(true)
-        .number_of_values(2)
-        .short("F"))
-    .get_matches_from_safe(vec!["mults", "-F", "file1"]);
-
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::WrongNumberOfValues);
-

fn validator<F>(self, f: F) -> Self where F: Fn(String) -> Result<(), String> + 'static

-

Allows one to perform a custom validation on the argument value. You provide a closure which -accepts a String value, a Result where the Err(String) is a message displayed to the -user.

- -

NOTE: The error message does not need to contain the error: portion, only the -message.

- -

NOTE: There is a small performance hit for using validators, as they are implemented -with Rc pointers. And the value to be checked will be allocated an extra time in order to -to be passed to the closure. This performance hit is extremely minimal in the grand scheme -of things.

- -

Examples

-
-fn has_at(v: String) -> Result<(), String> {
-    if v.contains("@") { return Ok(()); }
-    Err(String::from("The value did not contain the required @ sigil"))
-}
-let res = App::new("validators")
-    .arg(Arg::with_name("file")
-        .index(1)
-        .validator(has_at))
-    .get_matches_from_safe(vec![
-        "validators", "some@file"
-    ]);
-assert!(res.is_ok());
-assert_eq!(res.unwrap().value_of("file"), Some("some@file"));
-

fn max_values(self, qty: u64) -> Self

-

Specifies the maximum number of values are for this argument. For example, if you had a --f <file> argument where you wanted up to 3 'files' you would set -.max_values(3), and this argument would be satisfied if the user provided, 1, 2, or 3 -values.

- -

NOTE: This does not implicitly set mulitple(true). This is because -o val -o val is -multiples occurrences but a single value and -o val1 val2 is a single occurence with -multple values. For positional arguments this does set multiple(true) because there -is no way to determine the diffrence between multiple occureces and multiple values.

- -

Examples

-
-Arg::with_name("file")
-    .short("f")
-    .max_values(3)
- -

Supplying less than the maximum number of values is allowed

- -
-let res = App::new("numvals")
-    .arg(Arg::with_name("file")
-        .takes_value(true)
-        .max_values(3)
-        .short("F"))
-    .get_matches_from_safe(vec!["mults", "-F", "file1", "file2"]);
-
-assert!(res.is_ok());
-let m = res.unwrap();
-let files: Vec<_> = m.values_of("file").unwrap().collect();
-assert_eq!(files, ["file1", "file2"]);
- -

Supplying more than the maximum number of values is an error

- -
-let res = App::new("numvals")
-    .arg(Arg::with_name("file")
-        .takes_value(true)
-        .max_values(2)
-        .short("F"))
-    .get_matches_from_safe(vec!["mults", "-F", "file1", "file2", "file3"]);
-
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::TooManyValues);
-

fn min_values(self, qty: u64) -> Self

-

Specifies the minimum number of values are for this argument. For example, if you had a --f <file> argument where you wanted at least 2 'files' you would set -.min_values(2), and this argument would be satisfied if the user provided, 2 or more -values.

- -

NOTE: This does not implicitly set mulitple(true). This is because -o val -o val is -multiples occurrences but a single value and -o val1 val2 is a single occurence with -multple values. For positional arguments this does set multiple(true) because there -is no way to determine the diffrence between multiple occureces and multiple values.

- -

Examples

-
-Arg::with_name("file")
-    .short("f")
-    .min_values(3)
- -

Supplying more than the minimum number of values is allowed

- -
-let res = App::new("numvals")
-    .arg(Arg::with_name("file")
-        .takes_value(true)
-        .min_values(2)
-        .short("F"))
-    .get_matches_from_safe(vec!["mults", "-F", "file1", "file2", "file3"]);
-
-assert!(res.is_ok());
-let m = res.unwrap();
-let files: Vec<_> = m.values_of("file").unwrap().collect();
-assert_eq!(files, ["file1", "file2", "file3"]);
- -

Supplying less than the mainimum number of values is an error

- -
-let res = App::new("numvals")
-    .arg(Arg::with_name("file")
-        .takes_value(true)
-        .min_values(2)
-        .short("F"))
-    .get_matches_from_safe(vec!["mults", "-F", "file1"]);
-
-assert!(res.is_err());
-assert_eq!(res.unwrap_err().kind, ErrorKind::TooFewValues);
-

fn use_delimiter(self, d: bool) -> Self

-

Specifies whether or not an arugment should allow grouping of multiple values via a -delimter. I.e. shoulde --option=val1,val2,val3 be parsed as three values (val1, val2, -and val3) or as a single value (val1,val2,val3). Defaults to using , (comma) as the -value delimiter for all arguments that accept values (options and positional arguments)

- -

NOTE: The defalt is true. Setting the value to true will reset any previous use of -Arg::value_delimiter back to the default of , (comma).

- -

Examples

-

The following example shows the default behavior.

- -
-let delims = App::new("delims")
-    .arg(Arg::with_name("option")
-        .long("option")
-        .takes_value(true))
-    .get_matches_from(vec![
-        "delims",
-        "--option=val1,val2,val3",
-    ]);
-
-assert!(delims.is_present("option"));
-assert_eq!(delims.occurrences_of("option"), 1);
-assert_eq!(delims.values_of("option").unwrap().collect::<Vec<_>>(), ["val1", "val2", "val3"]);
- -

The next example shows the difference when turning delimiters off.

- -
-let nodelims = App::new("nodelims")
-    .arg(Arg::with_name("option")
-        .long("option")
-        .use_delimiter(false)
-        .takes_value(true))
-    .get_matches_from(vec![
-        "nodelims",
-        "--option=val1,val2,val3",
-    ]);
-
-assert!(nodelims.is_present("option"));
-assert_eq!(nodelims.occurrences_of("option"), 1);
-assert_eq!(nodelims.value_of("option").unwrap(), "val1,val2,val3");
-

fn value_delimiter(self, d: &str) -> Self

-

Specifies the separator to use when values are clumped together, defaults to , (comma).

- -

NOTE: implicitly sets Arg::use_delimiter(true)

- -

NOTE: implicitly sets Arg::takes_value(true)

- -

Examples

-
-let app = App::new("fake")
-    .arg(Arg::with_name("config")
-        .short("c")
-        .long("config")
-        .value_delimiter(";"));
-
-let m = app.get_matches_from(vec![
-    "fake", "--config=val1;val2;val3"
-]);
-
-assert_eq!(m.values_of("config").unwrap().collect::<Vec<_>>(), ["val1", "val2", "val3"])
-

fn value_names(self, names: &[&'b str]) -> Self

-

Specify multiple names for values of option arguments. These names are cosmetic only, used -for help and usage strings only. The names are not used to access arguments. The values -of the arguments are accessed in numeric order (i.e. if you specify two names one and -two one will be the first matched value, two will be the second).

- -

This setting can be very helpful when describing the type of input the user should be -using, such as FILE, INTERFACE, etc. Although not required, it's somewhat convention to -use all capital letters for the value name.

- -

Pro Tip: It may help to use Arg::next_line_help(true) if there are long, or multiple -value names in order to not throw off the help text alignment of all options.

- -

NOTE: This implicitly sets .number_of_values() if the number of value names is -greater than one. I.e. be aware that the number of "names" you set for the values, will be -the exact number of values required to satisfy this argument

- -

NOTE: implicitly sets Arg::takes_value(true)

- -

NOTE: Does not require or imply .multiple(true).

- -

Examples

-
-Arg::with_name("speed")
-    .short("s")
-    .value_names(&["fast", "slow"])
- -
-let app = App::new("valnames")
-    .arg(Arg::with_name("io")
-        .long("io-files")
-        .value_names(&["INFILE", "OUTFILE"]))
-    .get_matches_from(vec![
-        "valnames", "--help"
-    ]);
- -

Running the above program produces the following output

- -
valnames
-
-USAGE:
-   valnames [FLAGS] [OPTIONS]
-
-FLAGS:
-    -h, --help       Prints help information
-    -V, --version    Prints version information
-
-OPTIONS:
-    --io-files <INFILE> <OUTFILE>    Some help text
-
-

fn value_name(self, name: &'b str) -> Self

-

Specifies the name for value of option or positional arguments inside of help documenation. -This name is cosmetic only, the name is not used to access arguments. This setting can -be very helpful when describing the type of input the user should be using, such as FILE, -INTERFACE, etc. Although not required, it's somewhat convention to use all capital -letters for the value name.

- -

NOTE: implicitly sets Arg::takes_value(true)

- -

Examples

-
-Arg::with_name("cfg")
-    .long("config")
-    .value_name("FILE")
- -
-let app = App::new("valnames")
-    .arg(Arg::with_name("config")
-        .long("config")
-        .value_name("FILE"))
-    .get_matches_from(vec![
-        "valnames", "--help"
-    ]);
- -

Running the above program produces the following output

- -
valnames
-
-USAGE:
-   valnames [FLAGS] [OPTIONS]
-
-FLAGS:
-    -h, --help       Prints help information
-    -V, --version    Prints version information
-
-OPTIONS:
-    --config <FILE>     Some help text
-
-

fn default_value(self, val: &'a str) -> Self

-

Specifies the value of the argument when not specified at runtime.

- -

NOTE: If the user does not use this argument at runtime, ArgMatches::occurrences_of -will return 0 even though the value_of will return the default specified.

- -

NOTE: If the user does not use this argument at runtime ArgMatches::is_present will -still return true. If you wish to determine whether the argument was used at runtime or -not, consider ArgMatches::occurrences_of which will return 0 if the argument was not -used at runtmie.

- -

NOTE: This implicitly sets Arg::takes_value(true).

- -

Examples

-
-let m = App::new("defvals")
-    .arg(Arg::with_name("opt")
-        .long("myopt")
-        .default_value("myval"))
-    .get_matches_from(vec![
-        "defvals"
-    ]);
-
-assert_eq!(m.value_of("opt"), Some("myval"));
-assert!(m.is_present("opt"));
-assert_eq!(m.occurrences_of("opt"), 0);
-

fn next_line_help(self, nlh: bool) -> Self

-

When set to true the help string will be displayed on the line after the argument and -indented once. This can be helpful for arguments with very long or complex help messages. -This can also be helpful for arguments with very long flag names, or many/long value names.

- -

NOTE: To apply this setting to all arguments consider using AppSettings::NextLineHelp

- -

Examples

-
-let m = App::new("nlh")
-    .arg(Arg::with_name("opt")
-        .long("long-option-flag")
-        .short("o")
-        .takes_value(true)
-        .value_names(&["value1", "value2"])
-        .help("Some really long help and complex{n}\
-               help that makes more sense to be{n}\
-               on a line after the option")
-        .next_line_help(true))
-    .get_matches_from(vec![
-        "nlh", "--help"
-    ]);
- -

The above example displays the following help message

- -
-nlh
-
-USAGE:
-    nlh [FLAGS] [OPTIONS]
-
-FLAGS:
-    -h, --help       Prints help information
-    -V, --version    Prints version information
-
-OPTIONS:
-    -o, --long-option-flag <value1> <value2>
-        Some really long help and complex
-        help that makes more sense to be
-        on a line after the option
-

fn display_order(self, ord: usize) -> Self

-

Allows custom ordering of args within the help message. Args with a lower value will be -displayed first in the help message. This is helpful when one would like to emphasise -frequently used args, or prioritize those towards the top of the list. Duplicate values -are allowed. Args with duplicate display orders will be displayed in alphabetical -order.

- -

NOTE: The default is 999 for all arguments.

- -

NOTE: This setting is ignored for positional arguments which are always displayed in -index order.

- -

Examples

-
-let m = App::new("cust-ord")
-    .arg(Arg::with_name("a") // Typically args are grouped alphabetically by name.
-                             // Args without a display_order have a value of 999 and are
-                             // displayed alphabetically with all other 999 valued args.
-        .long("long-option")
-        .short("o")
-        .takes_value(true)
-        .help("Some help and text"))
-    .arg(Arg::with_name("b")
-        .long("other-option")
-        .short("O")
-        .takes_value(true)
-        .display_order(1)   // In order to force this arg to appear *first*
-                            // all we have to do is give it a value lower than 999.
-                            // Any other args with a value of 1 will be displayed
-                            // alphabetically with this one...then 2 values, then 3, etc.
-        .help("I should be first!"))
-    .get_matches_from(vec![
-        "cust-ord", "--help"
-    ]);
- -

The above example displays the following help message

- -
-cust-ord
-
-USAGE:
-    cust-ord [FLAGS] [OPTIONS]
-
-FLAGS:
-    -h, --help       Prints help information
-    -V, --version    Prints version information
-
-OPTIONS:
-    -O, --other-option <b>    I should be first!
-    -o, --long-option <a>     Some help and text
-

fn is_set(&self, s: ArgSettings) -> bool

-

Checks if one of the ArgSettings settings is set for the argument

-

fn set(self, s: ArgSettings) -> Self

-

Sets one of the ArgSettings settings for the argument

-

fn unset(self, s: ArgSettings) -> Self

-

Unsets one of the ArgSettings settings for the argument

-

Trait Implementations

impl<'a, 'b> Default for Arg<'a, 'b>

fn default() -> Self

-

impl<'a, 'b, 'z> From<&'z Arg<'a, 'b>> for Arg<'a, 'b>

fn from(a: &'z Arg<'a, 'b>) -> Self

-

impl<'a, 'b> Clone for Arg<'a, 'b>

fn clone(&self) -> Self

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/struct.ArgGroup.html b/doc/clap/struct.ArgGroup.html deleted file mode 100644 index 056f82b7..00000000 --- a/doc/clap/struct.ArgGroup.html +++ /dev/null @@ -1,269 +0,0 @@ - - - - - - - - - - clap::ArgGroup - Rust - - - - - - - - - - - - - - - - - -
-

Struct clap::ArgGroup - - [−] - - [src]

-
pub struct ArgGroup<'a> {
-    // some fields omitted
-}

ArgGroups are a family of related arguments and way for you to express, "Any of these -arguments". By placing arguments in a logical group, you can create easier requirement and -exclusion rules instead of having to list each argument individually, or when you want a rule -to apply "any but not all" arguments.

- -

For instance, you can make an entire ArgGroup required, this means that one (and only one) -argument from that group must be present. Using more than one argument from an ArgGroup -causes a parsing failure.

- -

You can also do things such as name an entire ArgGroup as a conflict or requirement for -another argument, meaning any of the arguments that belong to that group will cause a failure -if present, or must present respectively.

- -

Perhaps the most common use of ArgGroups is to require one and only one argument to be -present out of a given set. Imagine that you had multiple arguments, and you want one of them -to be required, but making all of them required isn't feasible because perhaps they conflict -with each other. For example, lets say that you were building an application where one could -set a given version number by supplying a string with an option argument, i.e. ---set-ver v1.2.3, you also wanted to support automatically using a previous version number -and simply incrementing one of the three numbers. So you create three flags --major, ---minor, and --patch. All of these arguments shouldn't be used at one time but you want to -specify that at least one of them is used. For this, you can create a group.

- -

Finally, you may use ArgGroups to pull a value from a group of arguments when you don't care -exaclty which argument was actually used at runtime.

- -

Examples

-

The following example demonstrates using an ArgGroup to ensure that one, and only one, of -the arguments from the specified group is present at runtime.

- -
-App::new("app")
-    .args_from_usage(
-        "--set-ver [ver] 'set the version manually'
-         --major         'auto increase major'
-         --minor         'auto increase minor'
-         --patch         'auto increase patch'")
-    .group(ArgGroup::with_name("vers")
-         .args(&["set-ver", "major", "minor","patch"])
-         .required(true))
-

Methods

impl<'a> ArgGroup<'a>

fn with_name(n: &'a str) -> Self

-

Creates a new instance of ArgGroup using a unique string name. The name will be used to -get values from the group or refer to the group inside of conflict and requirement rules.

- -

Examples

-
-ArgGroup::with_name("config")
-

fn arg(self, n: &'a str) -> Self

-

Adds an argument to this group by name

- -

Examples

-
-let cfg_arg = Arg::with_name("config");
-// ...
-ArgGroup::with_name("files")
-    .arg("config")
-

fn args(self, ns: &[&'a str]) -> Self

-

Adds multiple arguments to this group by name

- -

Examples

-
-let cfg_arg = Arg::with_name("config");
-let in_arg = Arg::with_name("input");
-// ...
-ArgGroup::with_name("files")
-    .args(&["config", "input"])
-

fn required(self, r: bool) -> Self

-

Sets the group as required or not. A required group will be displayed in the usage string -of the application in the format [arg|arg2|arg3]. A required ArgGroup simply states -that one, and only one argument from this group must be present at runtime (unless -conflicting with another argument).

- -

NOTE: This setting only applies to the current App / SubCommand, and not globally.

- -

Examples

-
-let cfg_arg = Arg::with_name("config");
-let in_arg = Arg::with_name("input");
-// ...
-ArgGroup::with_name("cfg")
-    .args(&["config", "input"])
-    .required(true)
-

fn requires(self, n: &'a str) -> Self

-

Sets the requirement rules of this group. This is not to be confused with a required group. -Requirement rules function just like argument requirement rules, you can name other -arguments or groups that must be present when one of the arguments from this group is used.

- -

NOTE: The name provided may be an argument, or group name

- -

Examples

-
-let cfg_arg = Arg::with_name("config");
-let in_arg = Arg::with_name("input");
-// ...
-ArgGroup::with_name("files")
-    .args(&["config", "input"])
-// ...
-ArgGroup::with_name("other_group")
-    .requires("files")
-

fn requires_all(self, ns: &[&'a str]) -> Self

-

Sets the requirement rules of this group. This is not to be confused with a required group. -Requirement rules function just like argument requirement rules, you can name other -arguments or groups that must be present when one of the arguments from this group is used.

- -

NOTE: The names provided may be an argument, or group name

- -

Examples

-
-let cfg_arg = Arg::with_name("config");
-let in_arg = Arg::with_name("input");
-// ...
-ArgGroup::with_name("files")
-    .args(&["config", "input"])
-// ...
-ArgGroup::with_name("other_group")
-    .requires_all(&["config", "input"]) // No different than saying, .requires("files")
-

fn conflicts_with(self, n: &'a str) -> Self

-

Sets the exclusion rules of this group. Exclusion (aka conflict) rules function just like -argument exclusion rules, you can name other arguments or groups that must not be present -when one of the arguments from this group are used.

- -

NOTE: The name provided may be an argument, or group name

- -

Examples

-
-let cfg_arg = Arg::with_name("config");
-let in_arg = Arg::with_name("input");
-// ...
-ArgGroup::with_name("files")
-    .args(&["config", "input"])
-// ...
-ArgGroup::with_name("other_group")
-    .conflicts_with("files")
-

fn conflicts_with_all(self, ns: &[&'a str]) -> Self

-

Sets the exclusion rules of this group. Exclusion rules function just like argument -exclusion rules, you can name other arguments or groups that must not be present when one -of the arguments from this group are used.

- -

NOTE: The names provided may be an argument, or group name

- -

Examples

-
-let cfg_arg = Arg::with_name("config");
-let in_arg = Arg::with_name("input");
-// ...
-ArgGroup::with_name("files")
-    .args(&["config", "input"])
-// ...
-ArgGroup::with_name("other_group")
-    .conflicts_with_all(&["files", "input"]) // same as saying, conflicts_with("files")
-

Trait Implementations

impl<'a> Debug for ArgGroup<'a>

fn fmt(&self, f: &mut Formatter) -> Result

-

impl<'a, 'z> From<&'z ArgGroup<'a>> for ArgGroup<'a>

fn from(g: &'z ArgGroup<'a>) -> Self

-

impl<'a> Clone for ArgGroup<'a>

fn clone(&self) -> Self

-

fn clone_from(&mut self, source: &Self)1.0.0

-

Derived Implementations

impl<'a> Default for ArgGroup<'a>

fn default() -> ArgGroup<'a>

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/struct.ArgMatches.html b/doc/clap/struct.ArgMatches.html deleted file mode 100644 index aa63b43f..00000000 --- a/doc/clap/struct.ArgMatches.html +++ /dev/null @@ -1,455 +0,0 @@ - - - - - - - - - - clap::ArgMatches - Rust - - - - - - - - - - - - - - - - - -
-

Struct clap::ArgMatches - - [−] - - [src]

-
pub struct ArgMatches<'a> {
-    // some fields omitted
-}

Used to get information about the arguments that where supplied to the program at runtime by -the user. New instances of this struct are obtained by using the App::get_matches family of -methods.

- -

Examples

-
-let matches = App::new("MyApp")
-    .arg(Arg::with_name("out")
-        .long("output")
-        .required(true)
-        .takes_value(true))
-    .arg(Arg::with_name("debug")
-        .short("d")
-        .multiple(true))
-    .arg(Arg::with_name("cfg")
-        .short("c")
-        .takes_value(true))
-    .get_matches(); // builds the instance of ArgMatches
-
-// to get information about the "cfg" argument we created, such as the value supplied we use
-// various ArgMatches methods, such as ArgMatches::value_of
-if let Some(c) = matches.value_of("cfg") {
-    println!("Value for -c: {}", c);
-}
-
-// The ArgMatches::value_of method returns an Option because the user may not have supplied
-// that argument at runtime. But if we specified that the argument was "required" as we did
-// with the "out" argument, we can safely unwrap because `clap` verifies that was actually
-// used at runtime.
-println!("Value for --output: {}", matches.value_of("out").unwrap());
-
-// You can check the presence of an argument
-if matches.is_present("out") {
-    // Another way to check if an argument was present, or if it occurred multiple times is to
-    // use occurrences_of() which returns 0 if an argument isn't found at runtime, or the
-    // number of times that it occurred, if it was. To allow an argument to appear more than
-    // once, you must use the .multiple(true) method, otherwise it will only return 1 or 0.
-    if matches.occurrences_of("debug") > 2 {
-        println!("Debug mode is REALLY on, don't be crazy");
-    } else {
-        println!("Debug mode kind of on");
-    }
-}
-

Methods

impl<'a> ArgMatches<'a>

fn value_of<S: AsRef<str>>(&self, name: S) -> Option<&str>

-

Gets the value of a specific option or positional argument (i.e. an argument that takes -an additional value at runtime). If the option wasn't present at runtime -it returns None.

- -

NOTE: If getting a value for an option or positional argument that allows multiples, -prefer values_of() as value_of() will only return the first value.

- -

Panics

-

This method will panic! if the value contains invalid UTF-8 code points.

- -

Examples

-
-let m = App::new("myapp")
-    .arg(Arg::with_name("output")
-        .takes_value(true))
-    .get_matches_from(vec!["myapp", "something"]);
-
-assert_eq!(m.value_of("output"), Some("something"));
-

fn value_of_lossy<S: AsRef<str>>(&'a self, name: S) -> Option<Cow<'a, str>>

-

Gets the lossy value of a specific argument. If the argument wasn't present at runtime -it returns None. A lossy value is one which contains invalid UTF-8 code points, those -invalid points will be replaced with \u{FFFD}

- -

NOTE: If getting a value for an option or positional argument that allows multiples, -prefer values_of_lossy() as value_of_lossy() will only return the first value.

- -

Examples

-
-use std::ffi::OsString;
-use std::os::unix::ffi::OsStrExt;
-
-let m = App::new("utf8")
-    .arg(Arg::from_usage("<arg> 'some arg'"))
-    .get_matches_from(vec![OsString::from("myprog"),
-                            // "Hi {0xe9}!"
-                            OsString::from_vec(vec![b'H', b'i', b' ', 0xe9, b'!'])]);
-assert_eq!(&*m.value_of_lossy("arg").unwrap(), "Hi \u{FFFD}!");
-

fn value_of_os<S: AsRef<str>>(&self, name: S) -> Option<&OsStr>

-

Gets the OS version of a string value of a specific argument. If the option wasn't present -at runtime it returns None. An OS value on Unix-like systems is any series of bytes, -regardless of whether or not they contain valid UTF-8 code points. Since Strings in Rust -are guaranteed to be valid UTF-8, a valid filename on a Unix system as an argument value may -contain invalid UTF-8 code points.

- -

NOTE: If getting a value for an option or positional argument that allows multiples, -prefer values_of_os() as value_of_os() will only return the first value.

- -

Examples

-
-use std::ffi::OsString;
-use std::os::unix::ffi::OsStrExt;
-
-let m = App::new("utf8")
-    .arg(Arg::from_usage("<arg> 'some arg'"))
-    .get_matches_from(vec![OsString::from("myprog"),
-                            // "Hi {0xe9}!"
-                            OsString::from_vec(vec![b'H', b'i', b' ', 0xe9, b'!'])]);
-assert_eq!(&*m.value_of_os("arg").unwrap().as_bytes(), [b'H', b'i', b' ', 0xe9, b'!']);
-

fn values_of<S: AsRef<str>>(&'a self, name: S) -> Option<Values<'a>>

-

Gets an Iterator of values of a specific argument (i.e. an argument that takes multiple -values at runtime). If the option wasn't present at runtime it returns None

- -

Panics

-

This method will panic if any of the values contain invalid UTF-8 code points.

- -

Examples

-
-let m = App::new("myprog")
-    .arg(Arg::with_name("output")
-        .multiple(true)
-        .short("o")
-        .takes_value(true))
-    .get_matches_from(vec![
-        "myprog", "-o", "val1", "val2", "val3"
-    ]);
-let vals: Vec<&str> = m.values_of("output").unwrap().collect();
-assert_eq!(vals, ["val1", "val2", "val3"]);
-

fn values_of_lossy<S: AsRef<str>>(&'a self, name: S) -> Option<Vec<String>>

-

Gets the lossy values of a specific argument If the option wasn't present at runtime -it returns None. A lossy value is one which contains invalid UTF-8 code points, those -invalid points will be replaced with \u{FFFD}

- -

Examples

-
-use std::ffi::OsString;
-use std::os::unix::ffi::OsStrExt;
-
-let m = App::new("utf8")
-    .arg(Arg::from_usage("<arg> 'some arg'"))
-    .get_matches_from(vec![OsString::from("myprog"),
-                            // "Hi {0xe9}!"
-                            OsString::from_vec(vec![b'H', b'i', b' ', 0xe9, b'!'])]);
-let itr = m.values_of_lossy("arg").unwrap();
-assert_eq!(&*itr.next().unwrap(), "Hi");
-assert_eq!(&*itr.next().unwrap(), "\u{FFFD}!");
-assert_eq!(itr.next(), None);
-

fn values_of_os<S: AsRef<str>>(&'a self, name: S) -> Option<OsValues<'a>>

-

Gets the OS version of a string value of a specific argument If the option wasn't present -at runtime it returns None. An OS value on Unix-like systems is any series of bytes, -regardless of whether or not they contain valid UTF-8 code points. Since Strings in Rust -are guaranteed to be valid UTF-8, a valid filename as an argument value on Linux (for -example) may contain invalid UTF-8 code points.

- -

Examples

-
-use std::ffi::OsString;
-use std::os::unix::ffi::OsStrExt;
-
-let m = App::new("utf8")
-    .arg(Arg::from_usage("<arg> 'some arg'"))
-    .get_matches_from(vec![OsString::from("myprog"),
-                                // "Hi"
-                                OsString::from_vec(vec![b'H', b'i']),
-                                // "{0xe9}!"
-                                OsString::from_vec(vec![0xe9, b'!'])]);
-
-let itr = m.values_of_os("arg").unwrap();
-assert_eq!(itr.next(), Some(&*OsString::from("Hi")));
-assert_eq!(itr.next(), Some(&*OsString::from_vec(vec![0xe9, b'!'])));
-assert_eq!(itr.next(), None);
-

fn is_present<S: AsRef<str>>(&self, name: S) -> bool

-

Returns true if an argument was present at runtime, otherwise false.

- -

Examples

-
-let m = App::new("myprog")
-    .arg(Arg::with_name("debug")
-        .short("d"))
-    .get_matches_from(vec![
-        "myprog", "-d"
-    ]);
-
-assert!(m.is_present("debug"));
-

fn occurrences_of<S: AsRef<str>>(&self, name: S) -> u64

-

Returns the number of times an argument was used at runtime. If an argument isn't present -it will return 0.

- -

NOTE: This returns the number of times the argument was used, not the number of -values. For example, -o val1 val2 val3 -o val4 would return 2.

- -

Examples

-
-let m = App::new("myprog")
-    .arg(Arg::with_name("debug")
-        .short("d")
-        .multiple(true))
-    .get_matches_from(vec![
-        "myprog", "-d", "-d", "-d"
-    ]);
-
-assert_eq!(m.occurrences_of("debug"), 3);
- -

This next example shows that counts actual uses of the argument, not just -'s

- -
-let m = App::new("myprog")
-    .arg(Arg::with_name("debug")
-        .short("d")
-        .multiple(true))
-    .arg(Arg::with_name("flag")
-        .short("f"))
-    .get_matches_from(vec![
-        "myprog", "-ddfd"
-    ]);
-
-assert_eq!(m.occurrences_of("debug"), 3);
-assert_eq!(m.occurrences_of("flag"), 1);
-

fn subcommand_matches<S: AsRef<str>>(&self, name: S) -> Option<&ArgMatches<'a>>

-

Because subcommands are essentially "sub-apps" they have their own ArgMatches as well. -This method returns the ArgMatches for a particular subcommand or None if the subcommand -wasn't present at runtime.

- -

Examples

-
-let app_m = App::new("myprog")
-    .arg(Arg::with_name("debug")
-        .short("d"))
-    .subcommand(SubCommand::with_name("test")
-        .arg(Arg::with_name("opt")
-            .long("option")
-            .takes_value(true)))
-    .get_matches_from(vec![
-        "myprog", "-d", "test", "--option", "val"
-    ]);
-
-// Both parent commands, and child subcommands can have arguments present at the same times
-assert!(app_m.is_present("debug"));
-
-// Get the subcommand's ArgMatches instance
-if let Some(sub_m) = app_m.subcommand_matches("test") {
-    // Use the struct like normal
-    assert_eq!(sub_m.value_of("opt"), Some("val"));
-}
-

fn subcommand_name(&self) -> Option<&str>

-

Because subcommands are essentially "sub-apps" they have their own ArgMatches as well. -But simply getting the sub-ArgMatches doesn't help much if we don't also know which -subcommand was actually used. This method returns the name of the subcommand that was used -at runtime, or None if one wasn't.

- -

NOTE: Subcommands form a hierarchy, where multiple subcommands can be used at runtime, -but only a single subcommand from any group of sibling commands may used at once.

- -

An ASCII art depiction may help explain this better...Using a fictional version of git as -the demo subject. Imagine the following are all subcommands of git (note, the author is -aware these aren't actually all subcommands in the real git interface, but it makes -explaination easier)

- -
             Top Level App (git)                         TOP
-                             |
-      -----------------------------------------
-     /             |                \          \
-  clone          push              add       commit      LEVEL 1
-    |           /    \            /    \       |
-   url      origin   remote    ref    name   message     LEVEL 2
-            /                  /\
-         path            remote  local                   LEVEL 3
-
- -

Given the above fictional subcommand hierarchy, valid runtime uses would be (not an all -inclusive list, and not including argument options per command for brevity and clarity):

- -
-$ git clone url
-$ git push origin path
-$ git add ref local
-$ git commit message
- -

Notice only one command per "level" may be used. You could not, for example, do $ git clone url push origin path

- -

Examples

-
- let app_m = App::new("git")
-     .subcommand(SubCommand::with_name("clone"))
-     .subcommand(SubCommand::with_name("push"))
-     .subcommand(SubCommand::with_name("commit"))
-     .get_matches();
-
-match app_m.subcommand_name() {
-    Some("clone")  => {}, // clone was used
-    Some("push")   => {}, // push was used
-    Some("commit") => {}, // commit was used
-    _              => {}, // Either no subcommand or one not tested for...
-}
-

fn subcommand(&self) -> (&str, Option<&ArgMatches<'a>>)

-

This brings together ArgMatches::subcommand_matches and ArgMatches::subcommand_name by -returning a tuple with both pieces of information.

- -

Examples

-
- let app_m = App::new("git")
-     .subcommand(SubCommand::with_name("clone"))
-     .subcommand(SubCommand::with_name("push"))
-     .subcommand(SubCommand::with_name("commit"))
-     .get_matches();
-
-match app_m.subcommand() {
-    ("clone",  Some(sub_m)) => {}, // clone was used
-    ("push",   Some(sub_m)) => {}, // push was used
-    ("commit", Some(sub_m)) => {}, // commit was used
-    _                       => {}, // Either no subcommand or one not tested for...
-}
- -

Another useful scenario is when you want to support third party, or external, subcommands. -In these cases you can't know the subcommand name ahead of time, so use a variable instead -with pattern matching!

- -
-// Assume there is an external subcommand named "subcmd"
-let app_m = App::new("myprog")
-    .setting(AppSettings::AllowExternalSubcommands)
-    .get_matches_from(vec![
-        "myprog", "subcmd", "--option", "value", "-fff", "--flag"
-    ]);
-
-// All trailing arguments will be stored under the subcommand's sub-matches using a value
-// of the runtime subcommand name (in this case "subcmd")
-match app_m.subcommand() {
-    (external, Some(sub_m)) => {
-         let ext_args: Vec<&str> = sub_m.values_of(external).unwrap().collect();
-         assert_eq!(ext_args, ["--option", "value", "-fff", "--flag"]);
-    },
-    _ => {},
-}
-

fn usage(&self) -> &str

-

Returns a string slice of the usage statement for the App (or SubCommand)

- -

Examples

-
-let app_m = App::new("myprog")
-    .subcommand(SubCommand::with_name("test"))
-    .get_matches();
-
-println!("{}", app_m.usage());
-

Trait Implementations

impl<'a> Default for ArgMatches<'a>

fn default() -> Self

-

Derived Implementations

impl<'a> Clone for ArgMatches<'a>

fn clone(&self) -> ArgMatches<'a>

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<'a> Debug for ArgMatches<'a>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/struct.Error.html b/doc/clap/struct.Error.html deleted file mode 100644 index 4a27fb01..00000000 --- a/doc/clap/struct.Error.html +++ /dev/null @@ -1,134 +0,0 @@ - - - - - - - - - - clap::Error - Rust - - - - - - - - - - - - - - - - - -
-

Struct clap::Error - - [−] - - [src]

-
pub struct Error {
-    pub message: String,
-    pub kind: ErrorKind,
-    pub info: Option<Vec<String>>,
-}

Command Line Argument Parser Error

-

Fields

- - - -
message

Formated error message

-
kind

The type of error

-
info

Any additional information passed along, such as the argument name that caused the error

-

Methods

impl Error

fn use_stderr(&self) -> bool

-

Should the message be written to stdout or not

-

fn exit(&self) -> !

-

Prints the error to stderr and exits with a status of 1

-

Trait Implementations

impl StdError for Error

fn description(&self) -> &str

-

fn cause(&self) -> Option<&Error>1.0.0

-

impl Display for Error

fn fmt(&self, f: &mut Formatter) -> Result

-

impl From<Error> for Error

fn from(e: Error) -> Self

-

impl From<Error> for Error

fn from(e: Error) -> Self

-

Derived Implementations

impl Debug for Error

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/struct.SubCommand.html b/doc/clap/struct.SubCommand.html deleted file mode 100644 index 41423549..00000000 --- a/doc/clap/struct.SubCommand.html +++ /dev/null @@ -1,141 +0,0 @@ - - - - - - - - - - clap::SubCommand - Rust - - - - - - - - - - - - - - - - - -
-

Struct clap::SubCommand - - [−] - - [src]

-
pub struct SubCommand<'a> {
-    // some fields omitted
-}

The abstract representation of a command line subcommand.

- -

This struct describes all the valid options of the subcommand for the program. Subcommands are -essentially "sub apps" and contain all the same possibilities (such as their own arguments, -subcommands, and settings).

- -

Examples

-
-App::new("myprog")
-    .subcommand(
-        SubCommand::with_name("config")
-            .about("Used for configuration")
-            .arg(Arg::with_name("config_file")
-                .help("The configuration file to use")
-                .index(1)))
-

Methods

impl<'a> SubCommand<'a>

fn with_name<'b>(name: &str) -> App<'a, 'b>

-

Creates a new instance of a subcommand requiring a name. The name will be displayed -to the user when they print version or help and usage information.

- -

Examples

-
-App::new("myprog")
-    .subcommand(
-        SubCommand::with_name("config"))
-

Trait Implementations

Derived Implementations

impl<'a> Clone for SubCommand<'a>

fn clone(&self) -> SubCommand<'a>

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<'a> Debug for SubCommand<'a>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/suggestions/index.html b/doc/clap/suggestions/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/suggestions/sidebar-items.js b/doc/clap/suggestions/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/suggestions/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/term/index.html b/doc/clap/term/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/term/sidebar-items.js b/doc/clap/term/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/term/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/clap/type.Result.html b/doc/clap/type.Result.html deleted file mode 100644 index 6aa96851..00000000 --- a/doc/clap/type.Result.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - clap::Result - Rust - - - - - - - - - - - - - - - - - -
-

clap::Result - - [−] - - [src]

-
type Result<T> = StdResult<T, Error>;

Short hand for result type

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/clap/usage_parser/index.html b/doc/clap/usage_parser/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/clap/usage_parser/sidebar-items.js b/doc/clap/usage_parser/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/clap/usage_parser/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/crc/crc32/constant.CASTAGNOLI.html b/doc/crc/crc32/constant.CASTAGNOLI.html deleted file mode 100644 index 60772548..00000000 --- a/doc/crc/crc32/constant.CASTAGNOLI.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - crc::crc32::CASTAGNOLI - Rust - - - - - - - - - - - - - - - - - -
-

crc::crc32::CASTAGNOLI - - [−] - - [src]

-
pub const CASTAGNOLI: u32 = 0x82f63b78
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc32/constant.IEEE.html b/doc/crc/crc32/constant.IEEE.html deleted file mode 100644 index 80fd3143..00000000 --- a/doc/crc/crc32/constant.IEEE.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - crc::crc32::IEEE - Rust - - - - - - - - - - - - - - - - - -
-

crc::crc32::IEEE - - [−] - - [src]

-
pub const IEEE: u32 = 0xedb88320
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc32/constant.KOOPMAN.html b/doc/crc/crc32/constant.KOOPMAN.html deleted file mode 100644 index 4b86a69c..00000000 --- a/doc/crc/crc32/constant.KOOPMAN.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - crc::crc32::KOOPMAN - Rust - - - - - - - - - - - - - - - - - -
-

crc::crc32::KOOPMAN - - [−] - - [src]

-
pub const KOOPMAN: u32 = 0xeb31d82e
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc32/fn.checksum_castagnoli.html b/doc/crc/crc32/fn.checksum_castagnoli.html deleted file mode 100644 index 29343fea..00000000 --- a/doc/crc/crc32/fn.checksum_castagnoli.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - crc::crc32::checksum_castagnoli - Rust - - - - - - - - - - - - - - - - - -
-

Function crc::crc32::checksum_castagnoli - - [−] - - [src]

-
pub fn checksum_castagnoli(bytes: &[u8]) -> u32
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc32/fn.checksum_ieee.html b/doc/crc/crc32/fn.checksum_ieee.html deleted file mode 100644 index e1a98b7e..00000000 --- a/doc/crc/crc32/fn.checksum_ieee.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - crc::crc32::checksum_ieee - Rust - - - - - - - - - - - - - - - - - -
-

Function crc::crc32::checksum_ieee - - [−] - - [src]

-
pub fn checksum_ieee(bytes: &[u8]) -> u32
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc32/fn.checksum_koopman.html b/doc/crc/crc32/fn.checksum_koopman.html deleted file mode 100644 index 55949ce0..00000000 --- a/doc/crc/crc32/fn.checksum_koopman.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - crc::crc32::checksum_koopman - Rust - - - - - - - - - - - - - - - - - -
-

Function crc::crc32::checksum_koopman - - [−] - - [src]

-
pub fn checksum_koopman(bytes: &[u8]) -> u32
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc32/fn.make_table.html b/doc/crc/crc32/fn.make_table.html deleted file mode 100644 index 10a6a614..00000000 --- a/doc/crc/crc32/fn.make_table.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - crc::crc32::make_table - Rust - - - - - - - - - - - - - - - - - -
-

Function crc::crc32::make_table - - [−] - - [src]

-
pub fn make_table(poly: u32) -> [u32; 256]
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc32/fn.update.html b/doc/crc/crc32/fn.update.html deleted file mode 100644 index 3aa6844f..00000000 --- a/doc/crc/crc32/fn.update.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - crc::crc32::update - Rust - - - - - - - - - - - - - - - - - -
-

Function crc::crc32::update - - [−] - - [src]

-
pub fn update(value: u32, table: &[u32; 256], bytes: &[u8]) -> u32
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc32/index.html b/doc/crc/crc32/index.html deleted file mode 100644 index ad13b0d6..00000000 --- a/doc/crc/crc32/index.html +++ /dev/null @@ -1,207 +0,0 @@ - - - - - - - - - - crc::crc32 - Rust - - - - - - - - - - - - - - - - - -
-

Module crc::crc32 - - [−] - - [src]

-

Structs

- - - - - - - - - - - - - - - - -
CASTAGNOLI_TABLE - -
Digest - -
IEEE_TABLE - -
KOOPMAN_TABLE - -

Constants

- - - - - - - - - - - - -
CASTAGNOLI - -
IEEE - -
KOOPMAN - -

Traits

- - - - -
Hasher32 - -

Functions

- - - - - - - - - - - - - - - - - - - - -
checksum_castagnoli - -
checksum_ieee - -
checksum_koopman - -
make_table - -
update - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc32/sidebar-items.js b/doc/crc/crc32/sidebar-items.js deleted file mode 100644 index 1db6213d..00000000 --- a/doc/crc/crc32/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["CASTAGNOLI",""],["IEEE",""],["KOOPMAN",""]],"fn":[["checksum_castagnoli",""],["checksum_ieee",""],["checksum_koopman",""],["make_table",""],["update",""]],"struct":[["CASTAGNOLI_TABLE",""],["Digest",""],["IEEE_TABLE",""],["KOOPMAN_TABLE",""]],"trait":[["Hasher32",""]]}); \ No newline at end of file diff --git a/doc/crc/crc32/struct.CASTAGNOLI_TABLE.html b/doc/crc/crc32/struct.CASTAGNOLI_TABLE.html deleted file mode 100644 index 8aeffdaa..00000000 --- a/doc/crc/crc32/struct.CASTAGNOLI_TABLE.html +++ /dev/null @@ -1,116 +0,0 @@ - - - - - - - - - - crc::crc32::CASTAGNOLI_TABLE - Rust - - - - - - - - - - - - - - - - - -
-

Struct crc::crc32::CASTAGNOLI_TABLE - - [−] - -

-
pub struct CASTAGNOLI_TABLE {
-    // some fields omitted
-}

Trait Implementations

impl Deref for CASTAGNOLI_TABLE

type Target = [u32; 256]

-

fn deref<'a>(&'a self) -> &'a [u32; 256]

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc32/struct.Digest.html b/doc/crc/crc32/struct.Digest.html deleted file mode 100644 index 95937b56..00000000 --- a/doc/crc/crc32/struct.Digest.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - - - - crc::crc32::Digest - Rust - - - - - - - - - - - - - - - - - -
-

Struct crc::crc32::Digest - - [−] - - [src]

-
pub struct Digest {
-    // some fields omitted
-}

Methods

impl Digest

fn new(poly: u32) -> Digest

-

fn new_with_initial(poly: u32, initial: u32) -> Digest

-

Trait Implementations

impl Hasher32 for Digest

fn reset(&mut self)

-

fn write(&mut self, bytes: &[u8])

-

fn sum32(&self) -> u32

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc32/struct.IEEE_TABLE.html b/doc/crc/crc32/struct.IEEE_TABLE.html deleted file mode 100644 index 48944f16..00000000 --- a/doc/crc/crc32/struct.IEEE_TABLE.html +++ /dev/null @@ -1,116 +0,0 @@ - - - - - - - - - - crc::crc32::IEEE_TABLE - Rust - - - - - - - - - - - - - - - - - -
-

Struct crc::crc32::IEEE_TABLE - - [−] - -

-
pub struct IEEE_TABLE {
-    // some fields omitted
-}

Trait Implementations

impl Deref for IEEE_TABLE

type Target = [u32; 256]

-

fn deref<'a>(&'a self) -> &'a [u32; 256]

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc32/struct.KOOPMAN_TABLE.html b/doc/crc/crc32/struct.KOOPMAN_TABLE.html deleted file mode 100644 index 0d8fab2e..00000000 --- a/doc/crc/crc32/struct.KOOPMAN_TABLE.html +++ /dev/null @@ -1,116 +0,0 @@ - - - - - - - - - - crc::crc32::KOOPMAN_TABLE - Rust - - - - - - - - - - - - - - - - - -
-

Struct crc::crc32::KOOPMAN_TABLE - - [−] - -

-
pub struct KOOPMAN_TABLE {
-    // some fields omitted
-}

Trait Implementations

impl Deref for KOOPMAN_TABLE

type Target = [u32; 256]

-

fn deref<'a>(&'a self) -> &'a [u32; 256]

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc32/trait.Hasher32.html b/doc/crc/crc32/trait.Hasher32.html deleted file mode 100644 index e6d811b5..00000000 --- a/doc/crc/crc32/trait.Hasher32.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - crc::crc32::Hasher32 - Rust - - - - - - - - - - - - - - - - - -
-

Trait crc::crc32::Hasher32 - - [−] - - [src]

-
pub trait Hasher32 {
-    fn reset(&mut self);
-    fn write(&mut self, bytes: &[u8]);
-    fn sum32(&self) -> u32;
-}
-

Required Methods

-
-

fn reset(&mut self)

fn write(&mut self, bytes: &[u8])

fn sum32(&self) -> u32

-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc64/constant.ECMA.html b/doc/crc/crc64/constant.ECMA.html deleted file mode 100644 index a3f6a768..00000000 --- a/doc/crc/crc64/constant.ECMA.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - crc::crc64::ECMA - Rust - - - - - - - - - - - - - - - - - -
-

crc::crc64::ECMA - - [−] - - [src]

-
pub const ECMA: u64 = 0xc96c5795d7870f42
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc64/constant.ISO.html b/doc/crc/crc64/constant.ISO.html deleted file mode 100644 index 8328aa38..00000000 --- a/doc/crc/crc64/constant.ISO.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - crc::crc64::ISO - Rust - - - - - - - - - - - - - - - - - -
-

crc::crc64::ISO - - [−] - - [src]

-
pub const ISO: u64 = 0xd800000000000000
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc64/fn.checksum_ecma.html b/doc/crc/crc64/fn.checksum_ecma.html deleted file mode 100644 index 921bb833..00000000 --- a/doc/crc/crc64/fn.checksum_ecma.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - crc::crc64::checksum_ecma - Rust - - - - - - - - - - - - - - - - - -
-

Function crc::crc64::checksum_ecma - - [−] - - [src]

-
pub fn checksum_ecma(bytes: &[u8]) -> u64
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc64/fn.checksum_iso.html b/doc/crc/crc64/fn.checksum_iso.html deleted file mode 100644 index 8a8660c0..00000000 --- a/doc/crc/crc64/fn.checksum_iso.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - crc::crc64::checksum_iso - Rust - - - - - - - - - - - - - - - - - -
-

Function crc::crc64::checksum_iso - - [−] - - [src]

-
pub fn checksum_iso(bytes: &[u8]) -> u64
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc64/fn.make_table.html b/doc/crc/crc64/fn.make_table.html deleted file mode 100644 index 82710f8c..00000000 --- a/doc/crc/crc64/fn.make_table.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - crc::crc64::make_table - Rust - - - - - - - - - - - - - - - - - -
-

Function crc::crc64::make_table - - [−] - - [src]

-
pub fn make_table(poly: u64) -> [u64; 256]
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc64/fn.update.html b/doc/crc/crc64/fn.update.html deleted file mode 100644 index 92334b64..00000000 --- a/doc/crc/crc64/fn.update.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - - - - - - - crc::crc64::update - Rust - - - - - - - - - - - - - - - - - -
-

Function crc::crc64::update - - [−] - - [src]

-
pub fn update(value: u64, table: &[u64; 256], bytes: &[u8]) -> u64
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc64/index.html b/doc/crc/crc64/index.html deleted file mode 100644 index 16b2b680..00000000 --- a/doc/crc/crc64/index.html +++ /dev/null @@ -1,186 +0,0 @@ - - - - - - - - - - crc::crc64 - Rust - - - - - - - - - - - - - - - - - -
-

Module crc::crc64 - - [−] - - [src]

-

Structs

- - - - - - - - - - - - -
Digest - -
ECMA_TABLE - -
ISO_TABLE - -

Constants

- - - - - - - - -
ECMA - -
ISO - -

Traits

- - - - -
Hasher64 - -

Functions

- - - - - - - - - - - - - - - - -
checksum_ecma - -
checksum_iso - -
make_table - -
update - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc64/sidebar-items.js b/doc/crc/crc64/sidebar-items.js deleted file mode 100644 index b7dbcecc..00000000 --- a/doc/crc/crc64/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"constant":[["ECMA",""],["ISO",""]],"fn":[["checksum_ecma",""],["checksum_iso",""],["make_table",""],["update",""]],"struct":[["Digest",""],["ECMA_TABLE",""],["ISO_TABLE",""]],"trait":[["Hasher64",""]]}); \ No newline at end of file diff --git a/doc/crc/crc64/struct.Digest.html b/doc/crc/crc64/struct.Digest.html deleted file mode 100644 index 50ac9b76..00000000 --- a/doc/crc/crc64/struct.Digest.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - - - - crc::crc64::Digest - Rust - - - - - - - - - - - - - - - - - -
-

Struct crc::crc64::Digest - - [−] - - [src]

-
pub struct Digest {
-    // some fields omitted
-}

Methods

impl Digest

fn new(poly: u64) -> Digest

-

fn new_with_initial(poly: u64, initial: u64) -> Digest

-

Trait Implementations

impl Hasher64 for Digest

fn reset(&mut self)

-

fn write(&mut self, bytes: &[u8])

-

fn sum64(&self) -> u64

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc64/struct.ECMA_TABLE.html b/doc/crc/crc64/struct.ECMA_TABLE.html deleted file mode 100644 index 0ff2bdbb..00000000 --- a/doc/crc/crc64/struct.ECMA_TABLE.html +++ /dev/null @@ -1,116 +0,0 @@ - - - - - - - - - - crc::crc64::ECMA_TABLE - Rust - - - - - - - - - - - - - - - - - -
-

Struct crc::crc64::ECMA_TABLE - - [−] - -

-
pub struct ECMA_TABLE {
-    // some fields omitted
-}

Trait Implementations

impl Deref for ECMA_TABLE

type Target = [u64; 256]

-

fn deref<'a>(&'a self) -> &'a [u64; 256]

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc64/struct.ISO_TABLE.html b/doc/crc/crc64/struct.ISO_TABLE.html deleted file mode 100644 index ae538d4e..00000000 --- a/doc/crc/crc64/struct.ISO_TABLE.html +++ /dev/null @@ -1,116 +0,0 @@ - - - - - - - - - - crc::crc64::ISO_TABLE - Rust - - - - - - - - - - - - - - - - - -
-

Struct crc::crc64::ISO_TABLE - - [−] - -

-
pub struct ISO_TABLE {
-    // some fields omitted
-}

Trait Implementations

impl Deref for ISO_TABLE

type Target = [u64; 256]

-

fn deref<'a>(&'a self) -> &'a [u64; 256]

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/crc64/trait.Hasher64.html b/doc/crc/crc64/trait.Hasher64.html deleted file mode 100644 index 2be57e35..00000000 --- a/doc/crc/crc64/trait.Hasher64.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - crc::crc64::Hasher64 - Rust - - - - - - - - - - - - - - - - - -
-

Trait crc::crc64::Hasher64 - - [−] - - [src]

-
pub trait Hasher64 {
-    fn reset(&mut self);
-    fn write(&mut self, bytes: &[u8]);
-    fn sum64(&self) -> u64;
-}
-

Required Methods

-
-

fn reset(&mut self)

fn write(&mut self, bytes: &[u8])

fn sum64(&self) -> u64

-

Implementors

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/index.html b/doc/crc/index.html deleted file mode 100644 index e03856ea..00000000 --- a/doc/crc/index.html +++ /dev/null @@ -1,170 +0,0 @@ - - - - - - - - - - crc - Rust - - - - - - - - - - - - - - - - - -
-

Crate crc - - [−] - - [src]

-
-

crc

-

Rust implementation of CRC(32, 64)

- -

Usage

-

Compute CRC32

-
-use crc::{crc32, Hasher32};
-
-// CRC-32-IEEE being the most commonly used one
-assert_eq!(crc32::checksum_ieee(b"123456789"), 0xcbf43926);
-assert_eq!(crc32::checksum_castagnoli(b"123456789"), 0xe3069283);
-assert_eq!(crc32::checksum_koopman(b"123456789"), 0x2d3dd0ae);
-
-// use provided or custom polynomial
-let mut digest = crc32::Digest::new(crc32::IEEE);
-digest.write(b"123456789");
-assert_eq!(digest.sum32(), 0xcbf43926);
-
-// with initial
-let mut digest = crc32::Digest::new_with_initial(crc32::IEEE, 0u32);
-digest.write(b"123456789");
-assert_eq!(digest.sum32(), 0xcbf43926);
- -

Compute CRC64

-
-use crc::{crc64, Hasher64};
-
-assert_eq!(crc64::checksum_ecma(b"123456789"), 0x995dc9bbdf1939fa);
-assert_eq!(crc64::checksum_iso(b"123456789"), 0xb90956c775a41001);
-
-// use provided or custom polynomial
-let mut digest = crc64::Digest::new(crc64::ECMA);
-digest.write(b"123456789");
-assert_eq!(digest.sum64(), 0x995dc9bbdf1939fa);
-
-// with initial
-let mut digest = crc64::Digest::new_with_initial(crc64::ECMA, 0u64);
-digest.write(b"123456789");
-assert_eq!(digest.sum64(), 0x995dc9bbdf1939fa);
-

Reexports

-
pub use self::crc32::Hasher32;
pub use self::crc64::Hasher64;

Modules

- - - - - - - - -
crc32 - -
crc64 - -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crc/sidebar-items.js b/doc/crc/sidebar-items.js deleted file mode 100644 index a20c760c..00000000 --- a/doc/crc/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"mod":[["crc32",""],["crc64",""]]}); \ No newline at end of file diff --git a/doc/crossbeam/fn.scope.html b/doc/crossbeam/fn.scope.html deleted file mode 100644 index 0b2445a3..00000000 --- a/doc/crossbeam/fn.scope.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - crossbeam::scope - Rust - - - - - - - - - - - - - - - - - -
-

Function crossbeam::scope - - [−] - - [src]

-
pub fn scope<'a, F, R>(f: F) -> R where F: FnOnce(&Scope<'a>) -> R

Create a new scope, for deferred destructors.

- -

Scopes, in particular, support scoped thread spawning.

- -

Examples

-

Creating and using a scope:

- -
-crossbeam::scope(|scope| {
-    scope.defer(|| println!("Exiting scope"));
-    scope.spawn(|| println!("Running child thread in scope"))
-});
-// Prints messages in the reverse order written
-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/fn.spawn_unsafe.html b/doc/crossbeam/fn.spawn_unsafe.html deleted file mode 100644 index 5f79d6c0..00000000 --- a/doc/crossbeam/fn.spawn_unsafe.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - crossbeam::spawn_unsafe - Rust - - - - - - - - - - - - - - - - - -
-

Function crossbeam::spawn_unsafe - - [−] - - [src]

-
pub unsafe fn spawn_unsafe<'a, F>(f: F) -> JoinHandle<()> where F: FnOnce() + Send + 'a

Like std::thread::spawn, but without the closure bounds.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/index.html b/doc/crossbeam/index.html deleted file mode 100644 index f0983417..00000000 --- a/doc/crossbeam/index.html +++ /dev/null @@ -1,179 +0,0 @@ - - - - - - - - - - crossbeam - Rust - - - - - - - - - - - - - - - - - -
-

Crate crossbeam - - [−] - - [src]

-

Support for concurrent and parallel programming.

- -

This crate is an early work in progress. The focus for the moment is -concurrency:

- -
    -

  • Non-blocking data structures. These data structures allow for high -performance, highly-concurrent access, much superior to wrapping with a -Mutex. Ultimately the goal is to include stacks, queues, deques, bags, -sets and maps. These live in the sync module.

    • -

  • Memory management. Because non-blocking data structures avoid global -synchronization, it is not easy to tell when internal data can be safely -freed. The mem module provides generic, easy to use, and high-performance -APIs for managing memory in these cases. These live in the mem module.

    • -

  • Synchronization. The standard library provides a few synchronization -primitives (locks, semaphores, barriers, etc) but this crate seeks to expand -that set to include more advanced/niche primitives, as well as userspace -alternatives. These live in the sync module.

    • -

  • Scoped thread API. Finally, the crate provides a "scoped" thread API, -making it possible to spawn threads that share stack data with their -parents. This functionality is exported at the top-level.

    • -
-

Modules

- - - - - - - - -
mem -

Memory management for concurrent data structures

-
sync -

Synchronization primitives.

-

Structs

- - - - - - - - -
Scope - -
ScopedJoinHandle -

A handle to a scoped thread

-

Functions

- - - - - - - - -
scope -

Create a new scope, for deferred destructors.

-
spawn_unsafe -

Like std::thread::spawn, but without the closure bounds.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/mem/cache_padded/index.html b/doc/crossbeam/mem/cache_padded/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/crossbeam/mem/cache_padded/sidebar-items.js b/doc/crossbeam/mem/cache_padded/sidebar-items.js deleted file mode 100644 index 25d09ad3..00000000 --- a/doc/crossbeam/mem/cache_padded/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["CachePadded","Pad `T` to the length of a cacheline."]],"trait":[["ZerosValid","Types for which mem::zeroed() is safe."]]}); \ No newline at end of file diff --git a/doc/crossbeam/mem/cache_padded/struct.CachePadded.html b/doc/crossbeam/mem/cache_padded/struct.CachePadded.html deleted file mode 100644 index 86b1ab1d..00000000 --- a/doc/crossbeam/mem/cache_padded/struct.CachePadded.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../crossbeam/mem/struct.CachePadded.html...

- - - \ No newline at end of file diff --git a/doc/crossbeam/mem/cache_padded/trait.ZerosValid.html b/doc/crossbeam/mem/cache_padded/trait.ZerosValid.html deleted file mode 100644 index db14e0ae..00000000 --- a/doc/crossbeam/mem/cache_padded/trait.ZerosValid.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../crossbeam/mem/trait.ZerosValid.html...

- - - \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/atomic/index.html b/doc/crossbeam/mem/epoch/atomic/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/crossbeam/mem/epoch/atomic/sidebar-items.js b/doc/crossbeam/mem/epoch/atomic/sidebar-items.js deleted file mode 100644 index 56496e8c..00000000 --- a/doc/crossbeam/mem/epoch/atomic/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["Atomic","Like `std::sync::atomic::AtomicPtr`."]]}); \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/atomic/struct.Atomic.html b/doc/crossbeam/mem/epoch/atomic/struct.Atomic.html deleted file mode 100644 index 10d62587..00000000 --- a/doc/crossbeam/mem/epoch/atomic/struct.Atomic.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../../crossbeam/mem/epoch/struct.Atomic.html...

- - - \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/fn.pin.html b/doc/crossbeam/mem/epoch/fn.pin.html deleted file mode 100644 index 27200e75..00000000 --- a/doc/crossbeam/mem/epoch/fn.pin.html +++ /dev/null @@ -1,120 +0,0 @@ - - - - - - - - - - crossbeam::mem::epoch::pin - Rust - - - - - - - - - - - - - - - - - -
-

Function crossbeam::mem::epoch::pin - - [−] - - [src]

-
pub fn pin() -> Guard

Pin the current epoch.

- -

Threads generally pin before interacting with a lock-free data -structure. Pinning requires a full memory barrier, so is somewhat -expensive. It is rentrant -- you can safely acquire nested guards, and only -the first guard requires a barrier. Thus, in cases where you expect to -perform several lock-free operations in quick succession, you may consider -pinning around the entire set of operations.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/garbage/index.html b/doc/crossbeam/mem/epoch/garbage/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/crossbeam/mem/epoch/garbage/sidebar-items.js b/doc/crossbeam/mem/epoch/garbage/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/crossbeam/mem/epoch/garbage/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/global/imp/index.html b/doc/crossbeam/mem/epoch/global/imp/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/crossbeam/mem/epoch/global/imp/sidebar-items.js b/doc/crossbeam/mem/epoch/global/imp/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/crossbeam/mem/epoch/global/imp/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/global/index.html b/doc/crossbeam/mem/epoch/global/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/crossbeam/mem/epoch/global/sidebar-items.js b/doc/crossbeam/mem/epoch/global/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/crossbeam/mem/epoch/global/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/guard/fn.pin.html b/doc/crossbeam/mem/epoch/guard/fn.pin.html deleted file mode 100644 index 255e668a..00000000 --- a/doc/crossbeam/mem/epoch/guard/fn.pin.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../../crossbeam/mem/epoch/fn.pin.html...

- - - \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/guard/index.html b/doc/crossbeam/mem/epoch/guard/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/crossbeam/mem/epoch/guard/sidebar-items.js b/doc/crossbeam/mem/epoch/guard/sidebar-items.js deleted file mode 100644 index 8b764040..00000000 --- a/doc/crossbeam/mem/epoch/guard/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["pin","Pin the current epoch."]],"struct":[["Guard","An RAII-style guard for pinning the current epoch."]]}); \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/guard/struct.Guard.html b/doc/crossbeam/mem/epoch/guard/struct.Guard.html deleted file mode 100644 index d398185b..00000000 --- a/doc/crossbeam/mem/epoch/guard/struct.Guard.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../../crossbeam/mem/epoch/struct.Guard.html...

- - - \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/index.html b/doc/crossbeam/mem/epoch/index.html deleted file mode 100644 index b289d0e0..00000000 --- a/doc/crossbeam/mem/epoch/index.html +++ /dev/null @@ -1,274 +0,0 @@ - - - - - - - - - - crossbeam::mem::epoch - Rust - - - - - - - - - - - - - - - - - -
-

Module crossbeam::mem::epoch - - [−] - - [src]

-

Epoch-based memory management

- -

This module provides fast, easy to use memory management for lock free data -structures. It's inspired by Keir Fraser's epoch-based -reclamation.

- -

The basic problem this is solving is the fact that when one thread has -removed a node from a data structure, other threads may still have pointers -to that node (in the form of snapshots that will be validated through things -like compare-and-swap), so the memory cannot be immediately freed. Put differently:

- -
    -

  1. There are two sources of reachability at play -- the data structure, and -the snapshots in threads accessing it. Before we delete a node, we need to know -that it cannot be reached in either of these ways.

    2. -

  2. Once a node has been unliked from the data structure, no new snapshots -reaching it will be created.

    3. -
- -

Using the epoch scheme is fairly straightforward, and does not require -understanding any of the implementation details:

- -
    -

  • When operating on a shared data structure, a thread must "pin the current -epoch", which is done by calling pin(). This function returns a Guard -which unpins the epoch when destroyed.

    • -

  • When the thread subsequently reads from a lock-free data structure, the -pointers it extracts act like references with lifetime tied to the -Guard. This allows threads to safely read from snapshotted data, being -guaranteed that the data will remain allocated until they exit the epoch.

    • -
- -

To put the Guard to use, Crossbeam provides a set of three pointer types meant to work together:

- -
    -

  • Owned<T>, akin to Box<T>, which points to uniquely-owned data that has -not yet been published in a concurrent data structure.

    • -

  • Shared<'a, T>, akin to &'a T, which points to shared data that may or may -not be reachable from a data structure, but it guaranteed not to be freed -during lifetime 'a.

    • -

  • Atomic<T>, akin to std::sync::atomic::AtomicPtr, which provides atomic -updates to a pointer using the Owned and Shared types, and connects them -to a Guard.

    • -
- -

Each of these types provides further documentation on usage.

- -

Example

-
-use std::sync::atomic::Ordering::{Acquire, Release, Relaxed};
-use std::ptr;
-
-use crossbeam::mem::epoch::{self, Atomic, Owned};
-
-struct TreiberStack<T> {
-    head: Atomic<Node<T>>,
-}
-
-struct Node<T> {
-    data: T,
-    next: Atomic<Node<T>>,
-}
-
-impl<T> TreiberStack<T> {
-    fn new() -> TreiberStack<T> {
-        TreiberStack {
-            head: Atomic::null()
-        }
-    }
-
-    fn push(&self, t: T) {
-        // allocate the node via Owned
-        let mut n = Owned::new(Node {
-            data: t,
-            next: Atomic::null(),
-        });
-
-        // become active
-        let guard = epoch::pin();
-
-        loop {
-            // snapshot current head
-            let head = self.head.load(Relaxed, &guard);
-
-            // update `next` pointer with snapshot
-            n.next.store_shared(head, Relaxed);
-
-            // if snapshot is still good, link in the new node
-            match self.head.cas_and_ref(head, n, Release, &guard) {
-                Ok(_) => return,
-                Err(owned) => n = owned,
-            }
-        }
-    }
-
-    fn pop(&self) -> Option<T> {
-        // become active
-        let guard = epoch::pin();
-
-        loop {
-            // take a snapshot
-            match self.head.load(Acquire, &guard) {
-                // the stack is non-empty
-                Some(head) => {
-                    // read through the snapshot, *safely*!
-                    let next = head.next.load(Relaxed, &guard);
-
-                    // if snapshot is still good, update from `head` to `next`
-                    if self.head.cas_shared(Some(head), next, Release) {
-                        unsafe {
-                            // mark the node as unlinked
-                            guard.unlinked(head);
-
-                            // extract out the data from the now-unlinked node
-                            return Some(ptr::read(&(*head).data))
-                        }
-                    }
-                }
-
-                // we observed the stack empty
-                None => return None
-            }
-        }
-    }
-}
-

Structs

- - - - - - - - - - - - - - - - -
Atomic -

Like std::sync::atomic::AtomicPtr.

-
Guard -

An RAII-style guard for pinning the current epoch.

-
Owned -

Like Box<T>: an owned, heap-allocated data value of type T.

-
Shared -

Like &'a T: a shared reference valid for lifetime 'a.

-

Functions

- - - - -
pin -

Pin the current epoch.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/local/index.html b/doc/crossbeam/mem/epoch/local/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/crossbeam/mem/epoch/local/sidebar-items.js b/doc/crossbeam/mem/epoch/local/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/crossbeam/mem/epoch/local/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/participant/index.html b/doc/crossbeam/mem/epoch/participant/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/crossbeam/mem/epoch/participant/sidebar-items.js b/doc/crossbeam/mem/epoch/participant/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/crossbeam/mem/epoch/participant/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/participants/index.html b/doc/crossbeam/mem/epoch/participants/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/crossbeam/mem/epoch/participants/sidebar-items.js b/doc/crossbeam/mem/epoch/participants/sidebar-items.js deleted file mode 100644 index 48333d31..00000000 --- a/doc/crossbeam/mem/epoch/participants/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({}); \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/sidebar-items.js b/doc/crossbeam/mem/epoch/sidebar-items.js deleted file mode 100644 index be7217ee..00000000 --- a/doc/crossbeam/mem/epoch/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["pin","Pin the current epoch."]],"struct":[["Atomic","Like `std::sync::atomic::AtomicPtr`."],["Guard","An RAII-style guard for pinning the current epoch."],["Owned","Like `Box`: an owned, heap-allocated data value of type `T`."],["Shared","Like `&'a T`: a shared reference valid for lifetime `'a`."]]}); \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/struct.Atomic.html b/doc/crossbeam/mem/epoch/struct.Atomic.html deleted file mode 100644 index 65c09b74..00000000 --- a/doc/crossbeam/mem/epoch/struct.Atomic.html +++ /dev/null @@ -1,180 +0,0 @@ - - - - - - - - - - crossbeam::mem::epoch::Atomic - Rust - - - - - - - - - - - - - - - - - -
-

Struct crossbeam::mem::epoch::Atomic - - [−] - - [src]

-
pub struct Atomic<T> {
-    // some fields omitted
-}

Like std::sync::atomic::AtomicPtr.

- -

Provides atomic access to a (nullable) pointer of type T, interfacing with -the Owned and Shared types.

-

Methods

impl<T> Atomic<T>

fn null() -> Atomic<T>

-

fn new(data: T) -> Atomic<T>

-

Create a new atomic pointer

-

fn load<'a>(&self, ord: Ordering, _: &'a Guard) -> Option<Shared<'a, T>>

-

Do an atomic load with the given memory ordering.

- -

In order to perform the load, we must pass in a borrow of a -Guard. This is a way of guaranteeing that the thread has pinned the -epoch for the entire lifetime 'a. In return, you get an optional -Shared pointer back (None if the Atomic is currently null), with -lifetime tied to the guard.

- -

Panics

-

Panics if ord is Release or AcqRel.

-

fn store(&self, val: Option<Owned<T>>, ord: Ordering)

-

Do an atomic store with the given memory ordering.

- -

Transfers ownership of the given Owned pointer, if any. Since no -lifetime information is acquired, no Guard value is needed.

- -

Panics

-

Panics if ord is Acquire or AcqRel.

-

fn store_and_ref<'a>(&self, val: Owned<T>, ord: Ordering, _: &'a Guard) -> Shared<'a, T>

-

Do an atomic store with the given memory ordering, immediately yielding -a shared reference to the pointer that was stored.

- -

Transfers ownership of the given Owned pointer, yielding a Shared -reference to it. Since the reference is valid only for the curent epoch, -it's lifetime is tied to a Guard value.

- -

Panics

-

Panics if ord is Acquire or AcqRel.

-

fn store_shared(&self, val: Option<Shared<T>>, ord: Ordering)

-

Do an atomic store of a Shared pointer with the given memory ordering.

- -

This operation does not require a guard, because it does not yield any -new information about the lifetime of a pointer.

- -

Panics

-

Panics if ord is Acquire or AcqRel.

-

fn cas(&self, old: Option<Shared<T>>, new: Option<Owned<T>>, ord: Ordering) -> Result<(), Option<Owned<T>>>

-

Do a compare-and-set from a Shared to an Owned pointer with the -given memory ordering.

- -

As with store, this operation does not require a guard; it produces no new -lifetime information. The Result indicates whether the CAS succeeded; if -not, ownership of the new pointer is returned to the caller.

-

fn cas_and_ref<'a>(&self, old: Option<Shared<T>>, new: Owned<T>, ord: Ordering, _: &'a Guard) -> Result<Shared<'a, T>, Owned<T>>

-

Do a compare-and-set from a Shared to an Owned pointer with the -given memory ordering, immediatley acquiring a new Shared reference to -the previously-owned pointer if successful.

- -

This operation is analogous to store_and_ref.

-

fn cas_shared(&self, old: Option<Shared<T>>, new: Option<Shared<T>>, ord: Ordering) -> bool

-

Do a compare-and-set from a Shared to another Shared pointer with -the given memory ordering.

- -

The boolean return value is true when the CAS is successful.

-

fn swap<'a>(&self, new: Option<Owned<T>>, ord: Ordering, _: &'a Guard) -> Option<Shared<'a, T>>

-

Do an atomic swap with an Owned pointer with the given memory ordering.

-

fn swap_shared<'a>(&self, new: Option<Shared<T>>, ord: Ordering, _: &'a Guard) -> Option<Shared<'a, T>>

-

Do an atomic swap with a Shared pointer with the given memory ordering.

-

Trait Implementations

impl<T: Sync> Send for Atomic<T>

impl<T: Sync> Sync for Atomic<T>

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/struct.Guard.html b/doc/crossbeam/mem/epoch/struct.Guard.html deleted file mode 100644 index c0447b36..00000000 --- a/doc/crossbeam/mem/epoch/struct.Guard.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - crossbeam::mem::epoch::Guard - Rust - - - - - - - - - - - - - - - - - -
-

Struct crossbeam::mem::epoch::Guard - - [−] - - [src]

-
#[must_use]
-pub struct Guard {
-    // some fields omitted
-}

An RAII-style guard for pinning the current epoch.

- -

A guard must be acquired before most operations on an Atomic pointer. On -destruction, it unpins the epoch.

-

Methods

impl Guard

unsafe fn unlinked<T>(&self, val: Shared<T>)

-

Assert that the value is no longer reachable from a lock-free data -structure and should be collected when sufficient epochs have passed.

-

fn migrate_garbage(&self)

-

Move the thread-local garbage into the global set of garbage.

-

Trait Implementations

impl Drop for Guard

fn drop(&mut self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/struct.Owned.html b/doc/crossbeam/mem/epoch/struct.Owned.html deleted file mode 100644 index 8d272bb6..00000000 --- a/doc/crossbeam/mem/epoch/struct.Owned.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - crossbeam::mem::epoch::Owned - Rust - - - - - - - - - - - - - - - - - -
-

Struct crossbeam::mem::epoch::Owned - - [−] - - [src]

-
pub struct Owned<T> {
-    // some fields omitted
-}

Like Box<T>: an owned, heap-allocated data value of type T.

-

Methods

impl<T> Owned<T>

fn new(t: T) -> Owned<T>

-

Move t to a new heap allocation.

-

fn into_inner(self) -> T

-

Move data out of the owned box, deallocating the box.

-

Trait Implementations

impl<T> Deref for Owned<T>

type Target = T

-

fn deref(&self) -> &T

-

impl<T> DerefMut for Owned<T>

fn deref_mut(&mut self) -> &mut T

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/mem/epoch/struct.Shared.html b/doc/crossbeam/mem/epoch/struct.Shared.html deleted file mode 100644 index fa02f6a0..00000000 --- a/doc/crossbeam/mem/epoch/struct.Shared.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - - - - - - - crossbeam::mem::epoch::Shared - Rust - - - - - - - - - - - - - - - - - -
-

Struct crossbeam::mem::epoch::Shared - - [−] - - [src]

-
pub struct Shared<'a, T: 'a> {
-    // some fields omitted
-}

Like &'a T: a shared reference valid for lifetime 'a.

-

Methods

impl<'a, T> Shared<'a, T>

fn as_raw(&self) -> *mut T

-

Trait Implementations

impl<'a, T> Copy for Shared<'a, T>

impl<'a, T> Clone for Shared<'a, T>

fn clone(&self) -> Shared<'a, T>

-

fn clone_from(&mut self, source: &Self)1.0.0

-

impl<'a, T> Deref for Shared<'a, T>

type Target = &'a T

-

fn deref(&self) -> &&'a T

-

Derived Implementations

impl<'a, T: Eq + 'a> Eq for Shared<'a, T>

impl<'a, T: PartialEq + 'a> PartialEq for Shared<'a, T>

fn eq(&self, __arg_0: &Shared<'a, T>) -> bool

-

fn ne(&self, __arg_0: &Shared<'a, T>) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/mem/index.html b/doc/crossbeam/mem/index.html deleted file mode 100644 index b6b05892..00000000 --- a/doc/crossbeam/mem/index.html +++ /dev/null @@ -1,140 +0,0 @@ - - - - - - - - - - crossbeam::mem - Rust - - - - - - - - - - - - - - - - - -
-

Module crossbeam::mem - - [−] - - [src]

-

Memory management for concurrent data structures

- -

At the moment, the only memory management scheme is epoch-based reclamation, -found in the epoch submodule.

-

Modules

- - - - -
epoch -

Epoch-based memory management

-

Structs

- - - - -
CachePadded -

Pad T to the length of a cacheline.

-

Traits

- - - - -
ZerosValid -

Types for which mem::zeroed() is safe.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/mem/sidebar-items.js b/doc/crossbeam/mem/sidebar-items.js deleted file mode 100644 index 5af3d456..00000000 --- a/doc/crossbeam/mem/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"mod":[["epoch","Epoch-based memory management"]],"struct":[["CachePadded","Pad `T` to the length of a cacheline."]],"trait":[["ZerosValid","Types for which mem::zeroed() is safe."]]}); \ No newline at end of file diff --git a/doc/crossbeam/mem/struct.CachePadded.html b/doc/crossbeam/mem/struct.CachePadded.html deleted file mode 100644 index 85ea1b1a..00000000 --- a/doc/crossbeam/mem/struct.CachePadded.html +++ /dev/null @@ -1,136 +0,0 @@ - - - - - - - - - - crossbeam::mem::CachePadded - Rust - - - - - - - - - - - - - - - - - -
-

Struct crossbeam::mem::CachePadded - - [−] - - [src]

-
pub struct CachePadded<T> {
-    // some fields omitted
-}

Pad T to the length of a cacheline.

- -

Sometimes concurrent programming requires a piece of data to be padded out -to the size of a cacheline to avoid "false sharing": cachelines being -invalidated due to unrelated concurrent activity. Use the CachePadded type -when you want to avoid cache locality.

- -

At the moment, cache lines are assumed to be 32 * sizeof(usize) on all -architectures.

- -

Warning: the wrapped data is never dropped; move out using ptr::read -if you need to run dtors.

-

Methods

impl<T: ZerosValid> CachePadded<T>

fn zeroed() -> CachePadded<T>

-

A const fn equivalent to mem::zeroed().

-

impl<T> CachePadded<T>

fn new(t: T) -> CachePadded<T>

-

Wrap t with cacheline padding.

- -

Warning: the wrapped data is never dropped; move out using -ptr:read if you need to run dtors.

-

Trait Implementations

impl<T: Send> Send for CachePadded<T>

impl<T: Sync> Sync for CachePadded<T>

impl<T> Deref for CachePadded<T>

type Target = T

-

fn deref(&self) -> &T

-

impl<T> DerefMut for CachePadded<T>

fn deref_mut(&mut self) -> &mut T

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/mem/trait.ZerosValid.html b/doc/crossbeam/mem/trait.ZerosValid.html deleted file mode 100644 index 5f94eb97..00000000 --- a/doc/crossbeam/mem/trait.ZerosValid.html +++ /dev/null @@ -1,133 +0,0 @@ - - - - - - - - - - crossbeam::mem::ZerosValid - Rust - - - - - - - - - - - - - - - - - -
-

Trait crossbeam::mem::ZerosValid - - [−] - - [src]

-
pub unsafe trait ZerosValid { }

Types for which mem::zeroed() is safe.

- -

If a type T: ZerosValid, then a sequence of zeros the size of T must be -a valid member of the type T.

-
-

Implementors

-
    -
  • impl ZerosValid for u8
    • -
  • impl ZerosValid for u16
    • -
  • impl ZerosValid for u32
    • -
  • impl ZerosValid for u64
    • -
  • impl ZerosValid for usize
    • -
  • impl ZerosValid for i8
    • -
  • impl ZerosValid for i16
    • -
  • impl ZerosValid for i32
    • -
  • impl ZerosValid for i64
    • -
  • impl ZerosValid for isize
    • -
  • impl ZerosValid for AtomicUsize
    • -
  • impl<T> ZerosValid for AtomicPtr<T>
    • -
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/scoped/fn.scope.html b/doc/crossbeam/scoped/fn.scope.html deleted file mode 100644 index 7a01c598..00000000 --- a/doc/crossbeam/scoped/fn.scope.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../crossbeam/fn.scope.html...

- - - \ No newline at end of file diff --git a/doc/crossbeam/scoped/index.html b/doc/crossbeam/scoped/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/crossbeam/scoped/sidebar-items.js b/doc/crossbeam/scoped/sidebar-items.js deleted file mode 100644 index 0ff528c1..00000000 --- a/doc/crossbeam/scoped/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["scope","Create a new `scope`, for deferred destructors."]],"struct":[["Scope",""],["ScopedJoinHandle","A handle to a scoped thread"]]}); \ No newline at end of file diff --git a/doc/crossbeam/scoped/struct.Scope.html b/doc/crossbeam/scoped/struct.Scope.html deleted file mode 100644 index 0b7f08a9..00000000 --- a/doc/crossbeam/scoped/struct.Scope.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../crossbeam/struct.Scope.html...

- - - \ No newline at end of file diff --git a/doc/crossbeam/scoped/struct.ScopedJoinHandle.html b/doc/crossbeam/scoped/struct.ScopedJoinHandle.html deleted file mode 100644 index 91020d4d..00000000 --- a/doc/crossbeam/scoped/struct.ScopedJoinHandle.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../crossbeam/struct.ScopedJoinHandle.html...

- - - \ No newline at end of file diff --git a/doc/crossbeam/sidebar-items.js b/doc/crossbeam/sidebar-items.js deleted file mode 100644 index d4163a36..00000000 --- a/doc/crossbeam/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"fn":[["scope","Create a new `scope`, for deferred destructors."],["spawn_unsafe","Like `std::thread::spawn`, but without the closure bounds."]],"mod":[["mem","Memory management for concurrent data structures"],["sync","Synchronization primitives."]],"struct":[["Scope",""],["ScopedJoinHandle","A handle to a scoped thread"]]}); \ No newline at end of file diff --git a/doc/crossbeam/struct.Scope.html b/doc/crossbeam/struct.Scope.html deleted file mode 100644 index 2c66495a..00000000 --- a/doc/crossbeam/struct.Scope.html +++ /dev/null @@ -1,228 +0,0 @@ - - - - - - - - - - crossbeam::Scope - Rust - - - - - - - - - - - - - - - - - -
-

Struct crossbeam::Scope - - [−] - - [src]

-
pub struct Scope<'a> {
-    // some fields omitted
-}

Methods

impl<'a> Scope<'a>

fn defer<F>(&self, f: F) where F: FnOnce() + 'a

-

Schedule code to be executed when exiting the scope.

- -

This is akin to having a destructor on the stack, except that it is -guaranteed to be run.

-

fn spawn<F, T>(&self, f: F) -> ScopedJoinHandle<T> where F: FnOnce() -> T + Send + 'a, T: Send + 'a

-

Create a scoped thread.

- -

spawn is similar to the spawn function in Rust's standard library. The -difference is that this thread is scoped, meaning that it's guaranteed to terminate -before the current stack frame goes away, allowing you to reference the parent stack frame -directly. This is ensured by having the parent thread join on the child thread before the -scope exits.

- -

Examples

-

A basic scoped thread:

- -
-crossbeam::scope(|scope| {
-    scope.spawn(|| {
-        println!("Hello from a scoped thread!");
-    });
-});
- -

When writing concurrent Rust programs, you'll sometimes see a pattern like this, using -std::thread::spawn:

- -
-let array = [1, 2, 3];
-let mut guards = vec![];
-
-for i in &array {
-    let guard = std::thread::spawn(move || {
-        println!("element: {}", i);
-    });
-
-    guards.push(guard);
-}
-
-for guard in guards {
-    guard.join().unwrap();
-}
- -

The basic pattern is:

- -
    -
  1. Iterate over some collection.
    2. -
  2. Spin up a thread to operate on each part of the collection.
    3. -
  3. Join all the threads.
    4. -
- -

However, this code actually gives an error:

- -
error: `array` does not live long enough
-for i in &array {
-          ^~~~~
-in expansion of for loop expansion
-note: expansion site
-note: reference must be valid for the static lifetime...
-note: ...but borrowed value is only valid for the block suffix following statement 0 at ...
-    let array = [1, 2, 3];
-    let mut guards = vec![];
-
-    for i in &array {
-        let guard = std::thread::spawn(move || {
-            println!("element: {}", i);
-...
-error: aborting due to previous error
-
- -

Because std::thread::spawn doesn't know about this scope, it requires a -'static lifetime. One way of giving it a proper lifetime is to use an Arc:

- -
-use std::sync::Arc;
-
-let array = Arc::new([1, 2, 3]);
-let mut guards = vec![];
-
-for i in (0..array.len()) {
-    let a = array.clone();
-
-    let guard = std::thread::spawn(move || {
-        println!("element: {}", a[i]);
-    });
-
-    guards.push(guard);
-}
-
-for guard in guards {
-    guard.join().unwrap();
-}
- -

But this introduces unnecessary allocation, as Arc<T> puts its data on the heap, and we -also end up dealing with reference counts. We know that we're joining the threads before -our function returns, so just taking a reference should be safe. Rust can't know that, -though.

- -

Enter scoped threads. Here's our original example, using spawn from crossbeam rather -than from std::thread:

- -
-let array = [1, 2, 3];
-
-crossbeam::scope(|scope| {
-    for i in &array {
-        scope.spawn(move || {
-            println!("element: {}", i);
-        });
-    }
-});
- -

Much more straightforward.

-

Trait Implementations

impl<'a> Drop for Scope<'a>

fn drop(&mut self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/struct.ScopedJoinHandle.html b/doc/crossbeam/struct.ScopedJoinHandle.html deleted file mode 100644 index 7de0250b..00000000 --- a/doc/crossbeam/struct.ScopedJoinHandle.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - - - - crossbeam::ScopedJoinHandle - Rust - - - - - - - - - - - - - - - - - -
-

Struct crossbeam::ScopedJoinHandle - - [−] - - [src]

-
pub struct ScopedJoinHandle<T> {
-    // some fields omitted
-}

A handle to a scoped thread

-

Methods

impl<T> ScopedJoinHandle<T>

fn join(self) -> T

-

Join the scoped thread, returning the result it produced.

-

fn thread(&self) -> &Thread

-

Get the underlying thread handle.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/sync/arc_cell/index.html b/doc/crossbeam/sync/arc_cell/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/crossbeam/sync/arc_cell/sidebar-items.js b/doc/crossbeam/sync/arc_cell/sidebar-items.js deleted file mode 100644 index 16b6b9fb..00000000 --- a/doc/crossbeam/sync/arc_cell/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["ArcCell","A type providing atomic storage and retrieval of an `Arc`."]]}); \ No newline at end of file diff --git a/doc/crossbeam/sync/arc_cell/struct.ArcCell.html b/doc/crossbeam/sync/arc_cell/struct.ArcCell.html deleted file mode 100644 index aa633eb8..00000000 --- a/doc/crossbeam/sync/arc_cell/struct.ArcCell.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../crossbeam/sync/struct.ArcCell.html...

- - - \ No newline at end of file diff --git a/doc/crossbeam/sync/atomic_option/index.html b/doc/crossbeam/sync/atomic_option/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/crossbeam/sync/atomic_option/sidebar-items.js b/doc/crossbeam/sync/atomic_option/sidebar-items.js deleted file mode 100644 index 620e3755..00000000 --- a/doc/crossbeam/sync/atomic_option/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["AtomicOption",""]]}); \ No newline at end of file diff --git a/doc/crossbeam/sync/atomic_option/struct.AtomicOption.html b/doc/crossbeam/sync/atomic_option/struct.AtomicOption.html deleted file mode 100644 index 4fa12723..00000000 --- a/doc/crossbeam/sync/atomic_option/struct.AtomicOption.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../crossbeam/sync/struct.AtomicOption.html...

- - - \ No newline at end of file diff --git a/doc/crossbeam/sync/chase_lev/enum.Steal.html b/doc/crossbeam/sync/chase_lev/enum.Steal.html deleted file mode 100644 index 6b20b9b3..00000000 --- a/doc/crossbeam/sync/chase_lev/enum.Steal.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - - - - - - - crossbeam::sync::chase_lev::Steal - Rust - - - - - - - - - - - - - - - - - -
-

Enum crossbeam::sync::chase_lev::Steal - - [−] - - [src]

-
pub enum Steal<T> {
-    Empty,
-    Abort,
-    Data(T),
-}

When stealing some data, this is an enumeration of the possible outcomes.

-

Variants

-
Empty

The deque was empty at the time of stealing

-
Abort

The stealer lost the race for stealing data, and a retry may return more -data.

-
Data

The stealer has successfully stolen some data.

-

Trait Implementations

Derived Implementations

impl<T: Debug> Debug for Steal<T>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

-

impl<T: Eq> Eq for Steal<T>

impl<T: PartialEq> PartialEq for Steal<T>

fn eq(&self, __arg_0: &Steal<T>) -> bool

-

fn ne(&self, __arg_0: &Steal<T>) -> bool

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/sync/chase_lev/fn.deque.html b/doc/crossbeam/sync/chase_lev/fn.deque.html deleted file mode 100644 index 0660f095..00000000 --- a/doc/crossbeam/sync/chase_lev/fn.deque.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - - - - - - - crossbeam::sync::chase_lev::deque - Rust - - - - - - - - - - - - - - - - - -
-

Function crossbeam::sync::chase_lev::deque - - [−] - - [src]

-
pub fn deque<T>() -> (Worker<T>, Stealer<T>)

Creates a new empty deque

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/sync/chase_lev/index.html b/doc/crossbeam/sync/chase_lev/index.html deleted file mode 100644 index bdee9e5b..00000000 --- a/doc/crossbeam/sync/chase_lev/index.html +++ /dev/null @@ -1,170 +0,0 @@ - - - - - - - - - - crossbeam::sync::chase_lev - Rust - - - - - - - - - - - - - - - - - -
-

Module crossbeam::sync::chase_lev - - [−] - - [src]

-

A lock-free concurrent work-stealing deque

- -

This module contains a hybrid implementation of the Chase-Lev work stealing deque -described in "Dynamic Circular Work-Stealing Deque" and the improved version -described in "Correct and Efficient Work-Stealing for Weak Memory Models". -The implementation is heavily based on the pseudocode found in the papers.

- -

Example

-
-use crossbeam::sync::chase_lev;
-let (mut worker, stealer) = chase_lev::deque();
-
-// Only the worker may push/try_pop
-worker.push(1);
-worker.try_pop();
-
-// Stealers take data from the other end of the deque
-worker.push(1);
-stealer.steal();
-
-// Stealers can be cloned to have many stealers stealing in parallel
-worker.push(1);
-let stealer2 = stealer.clone();
-stealer2.steal();
-

Structs

- - - - - - - - -
Stealer -

The stealing half of the work-stealing deque. Stealers have access to the -opposite end of the deque from the worker, and they only have access to the -steal method.

-
Worker -

Worker half of the work-stealing deque. This worker has exclusive access to -one side of the deque, and uses push and try_pop method to manipulate it.

-

Enums

- - - - -
Steal -

When stealing some data, this is an enumeration of the possible outcomes.

-

Functions

- - - - -
deque -

Creates a new empty deque

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/sync/chase_lev/sidebar-items.js b/doc/crossbeam/sync/chase_lev/sidebar-items.js deleted file mode 100644 index ed6dd85c..00000000 --- a/doc/crossbeam/sync/chase_lev/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"enum":[["Steal","When stealing some data, this is an enumeration of the possible outcomes."]],"fn":[["deque","Creates a new empty deque"]],"struct":[["Stealer","The stealing half of the work-stealing deque. Stealers have access to the opposite end of the deque from the worker, and they only have access to the `steal` method."],["Worker","Worker half of the work-stealing deque. This worker has exclusive access to one side of the deque, and uses `push` and `try_pop` method to manipulate it."]]}); \ No newline at end of file diff --git a/doc/crossbeam/sync/chase_lev/struct.Stealer.html b/doc/crossbeam/sync/chase_lev/struct.Stealer.html deleted file mode 100644 index edd4d53e..00000000 --- a/doc/crossbeam/sync/chase_lev/struct.Stealer.html +++ /dev/null @@ -1,123 +0,0 @@ - - - - - - - - - - crossbeam::sync::chase_lev::Stealer - Rust - - - - - - - - - - - - - - - - - -
-

Struct crossbeam::sync::chase_lev::Stealer - - [−] - - [src]

-
pub struct Stealer<T> {
-    // some fields omitted
-}

The stealing half of the work-stealing deque. Stealers have access to the -opposite end of the deque from the worker, and they only have access to the -steal method.

- -

Stealers can be cloned to have more than one handle active at a time.

-

Methods

impl<T> Stealer<T>

fn steal(&self) -> Steal<T>

-

Steals work off the end of the queue (opposite of the worker's end)

-

Trait Implementations

impl<T> Clone for Stealer<T>

fn clone(&self) -> Stealer<T>

-

fn clone_from(&mut self, source: &Self)1.0.0

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/sync/chase_lev/struct.Worker.html b/doc/crossbeam/sync/chase_lev/struct.Worker.html deleted file mode 100644 index 2e190a1c..00000000 --- a/doc/crossbeam/sync/chase_lev/struct.Worker.html +++ /dev/null @@ -1,124 +0,0 @@ - - - - - - - - - - crossbeam::sync::chase_lev::Worker - Rust - - - - - - - - - - - - - - - - - -
-

Struct crossbeam::sync::chase_lev::Worker - - [−] - - [src]

-
pub struct Worker<T> {
-    // some fields omitted
-}

Worker half of the work-stealing deque. This worker has exclusive access to -one side of the deque, and uses push and try_pop method to manipulate it.

- -

There may only be one worker per deque, and operations on the worker -require mutable access to the worker itself.

-

Methods

impl<T> Worker<T>

fn push(&mut self, t: T)

-

Pushes data onto the front of this work queue.

-

fn try_pop(&mut self) -> Option<T>

-

Pops data off the front of the work queue, returning None on an empty -queue.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/sync/index.html b/doc/crossbeam/sync/index.html deleted file mode 100644 index 29bb1085..00000000 --- a/doc/crossbeam/sync/index.html +++ /dev/null @@ -1,158 +0,0 @@ - - - - - - - - - - crossbeam::sync - Rust - - - - - - - - - - - - - - - - - -
-

Module crossbeam::sync - - [−] - - [src]

-

Synchronization primitives.

-

Modules

- - - - -
chase_lev -

A lock-free concurrent work-stealing deque

-

Structs

- - - - - - - - - - - - - - - - - - - - -
ArcCell -

A type providing atomic storage and retrieval of an Arc<T>.

-
AtomicOption - -
MsQueue -

A Michael-Scott lock-free queue, with support for blocking pops.

-
SegQueue -

A Michael-Scott queue that allocates "segments" (arrays of nodes) -for efficiency.

-
TreiberStack -

Treiber's lock-free stack.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/sync/ms_queue/index.html b/doc/crossbeam/sync/ms_queue/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/crossbeam/sync/ms_queue/sidebar-items.js b/doc/crossbeam/sync/ms_queue/sidebar-items.js deleted file mode 100644 index 01cffea0..00000000 --- a/doc/crossbeam/sync/ms_queue/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["MsQueue","A Michael-Scott lock-free queue, with support for blocking `pop`s."]]}); \ No newline at end of file diff --git a/doc/crossbeam/sync/ms_queue/struct.MsQueue.html b/doc/crossbeam/sync/ms_queue/struct.MsQueue.html deleted file mode 100644 index 52405d28..00000000 --- a/doc/crossbeam/sync/ms_queue/struct.MsQueue.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../crossbeam/sync/struct.MsQueue.html...

- - - \ No newline at end of file diff --git a/doc/crossbeam/sync/seg_queue/index.html b/doc/crossbeam/sync/seg_queue/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/crossbeam/sync/seg_queue/sidebar-items.js b/doc/crossbeam/sync/seg_queue/sidebar-items.js deleted file mode 100644 index bcacb2b8..00000000 --- a/doc/crossbeam/sync/seg_queue/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["SegQueue","A Michael-Scott queue that allocates \"segments\" (arrays of nodes) for efficiency."]]}); \ No newline at end of file diff --git a/doc/crossbeam/sync/seg_queue/struct.SegQueue.html b/doc/crossbeam/sync/seg_queue/struct.SegQueue.html deleted file mode 100644 index 5553e063..00000000 --- a/doc/crossbeam/sync/seg_queue/struct.SegQueue.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../crossbeam/sync/struct.SegQueue.html...

- - - \ No newline at end of file diff --git a/doc/crossbeam/sync/sidebar-items.js b/doc/crossbeam/sync/sidebar-items.js deleted file mode 100644 index 75349f1f..00000000 --- a/doc/crossbeam/sync/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"mod":[["chase_lev","A lock-free concurrent work-stealing deque"]],"struct":[["ArcCell","A type providing atomic storage and retrieval of an `Arc`."],["AtomicOption",""],["MsQueue","A Michael-Scott lock-free queue, with support for blocking `pop`s."],["SegQueue","A Michael-Scott queue that allocates \"segments\" (arrays of nodes) for efficiency."],["TreiberStack","Treiber's lock-free stack."]]}); \ No newline at end of file diff --git a/doc/crossbeam/sync/struct.ArcCell.html b/doc/crossbeam/sync/struct.ArcCell.html deleted file mode 100644 index 5c1b0504..00000000 --- a/doc/crossbeam/sync/struct.ArcCell.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - - - - crossbeam::sync::ArcCell - Rust - - - - - - - - - - - - - - - - - -
-

Struct crossbeam::sync::ArcCell - - [−] - - [src]

-
pub struct ArcCell<T>(_, _);

A type providing atomic storage and retrieval of an Arc<T>.

-

Methods

impl<T> ArcCell<T>

fn new(t: Arc<T>) -> ArcCell<T>

-

Creates a new ArcCell.

-

fn set(&self, t: Arc<T>) -> Arc<T>

-

Stores a new value in the ArcCell, returning the previous -value.

-

fn get(&self) -> Arc<T>

-

Returns a copy of the value stored by the ArcCell.

-

Trait Implementations

impl<T> Drop for ArcCell<T>

fn drop(&mut self)

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/sync/struct.AtomicOption.html b/doc/crossbeam/sync/struct.AtomicOption.html deleted file mode 100644 index d4ef69f2..00000000 --- a/doc/crossbeam/sync/struct.AtomicOption.html +++ /dev/null @@ -1,118 +0,0 @@ - - - - - - - - - - crossbeam::sync::AtomicOption - Rust - - - - - - - - - - - - - - - - - -
-

Struct crossbeam::sync::AtomicOption - - [−] - - [src]

-
pub struct AtomicOption<T> {
-    // some fields omitted
-}

Methods

impl<T> AtomicOption<T>

fn new() -> AtomicOption<T>

-

fn swap_box(&self, t: Box<T>, order: Ordering) -> Option<Box<T>>

-

fn swap(&self, t: T, order: Ordering) -> Option<T>

-

fn take(&self, order: Ordering) -> Option<T>

-

Trait Implementations

impl<T: Send> Send for AtomicOption<T>

impl<T: Send> Sync for AtomicOption<T>

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/sync/struct.MsQueue.html b/doc/crossbeam/sync/struct.MsQueue.html deleted file mode 100644 index 30ed6f36..00000000 --- a/doc/crossbeam/sync/struct.MsQueue.html +++ /dev/null @@ -1,131 +0,0 @@ - - - - - - - - - - crossbeam::sync::MsQueue - Rust - - - - - - - - - - - - - - - - - -
-

Struct crossbeam::sync::MsQueue - - [−] - - [src]

-
pub struct MsQueue<T> {
-    // some fields omitted
-}

A Michael-Scott lock-free queue, with support for blocking pops.

- -

Usable with any number of producers and consumers.

-

Methods

impl<T> MsQueue<T>

fn new() -> MsQueue<T>

-

Create a new, empty queue.

-

fn push(&self, t: T)

-

Add t to the back of the queue, possibly waking up threads -blocked on pop.

-

fn is_empty(&self) -> bool

-

Check if this queue is empty.

-

fn try_pop(&self) -> Option<T>

-

Attempt to dequeue from the front.

- -

Returns None if the queue is observed to be empty.

-

fn pop(&self) -> T

-

Dequeue an element from the front of the queue, blocking if the queue is -empty.

-

Trait Implementations

impl<T: Send> Sync for MsQueue<T>

impl<T: Send> Send for MsQueue<T>

- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/sync/struct.SegQueue.html b/doc/crossbeam/sync/struct.SegQueue.html deleted file mode 100644 index baec2094..00000000 --- a/doc/crossbeam/sync/struct.SegQueue.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - - - - - - - crossbeam::sync::SegQueue - Rust - - - - - - - - - - - - - - - - - -
-

Struct crossbeam::sync::SegQueue - - [−] - - [src]

-
pub struct SegQueue<T> {
-    // some fields omitted
-}

A Michael-Scott queue that allocates "segments" (arrays of nodes) -for efficiency.

- -

Usable with any number of producers and consumers.

-

Methods

impl<T> SegQueue<T>

fn new() -> SegQueue<T>

-

Create a new, empty queue.

-

fn push(&self, t: T)

-

Add t to the back of the queue.

-

fn try_pop(&self) -> Option<T>

-

Attempt to dequeue from the front.

- -

Returns None if the queue is observed to be empty.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/sync/struct.TreiberStack.html b/doc/crossbeam/sync/struct.TreiberStack.html deleted file mode 100644 index fb2b2781..00000000 --- a/doc/crossbeam/sync/struct.TreiberStack.html +++ /dev/null @@ -1,127 +0,0 @@ - - - - - - - - - - crossbeam::sync::TreiberStack - Rust - - - - - - - - - - - - - - - - - -
-

Struct crossbeam::sync::TreiberStack - - [−] - - [src]

-
pub struct TreiberStack<T> {
-    // some fields omitted
-}

Treiber's lock-free stack.

- -

Usable with any number of producers and consumers.

-

Methods

impl<T> TreiberStack<T>

fn new() -> TreiberStack<T>

-

Create a new, empty stack.

-

fn push(&self, t: T)

-

Push t on top of the stack.

-

fn pop(&self) -> Option<T>

-

Attempt to pop the top element of the stack.

- -

Returns None if the stack is observed to be empty.

-

fn is_empty(&self) -> bool

-

Check if this queue is empty.

-
- - -
- - - - - - - - - - - - \ No newline at end of file diff --git a/doc/crossbeam/sync/treiber_stack/index.html b/doc/crossbeam/sync/treiber_stack/index.html deleted file mode 100644 index e69de29b..00000000 diff --git a/doc/crossbeam/sync/treiber_stack/sidebar-items.js b/doc/crossbeam/sync/treiber_stack/sidebar-items.js deleted file mode 100644 index 24a16d01..00000000 --- a/doc/crossbeam/sync/treiber_stack/sidebar-items.js +++ /dev/null @@ -1 +0,0 @@ -initSidebarItems({"struct":[["TreiberStack","Treiber's lock-free stack."]]}); \ No newline at end of file diff --git a/doc/crossbeam/sync/treiber_stack/struct.TreiberStack.html b/doc/crossbeam/sync/treiber_stack/struct.TreiberStack.html deleted file mode 100644 index 2373c4a3..00000000 --- a/doc/crossbeam/sync/treiber_stack/struct.TreiberStack.html +++ /dev/null @@ -1,10 +0,0 @@ - - - - - - -

Redirecting to ../../../crossbeam/sync/struct.TreiberStack.html...

- - - \ No newline at end of file diff --git a/doc/implementors/aho_corasick/trait.Automaton.js b/doc/implementors/aho_corasick/trait.Automaton.js deleted file mode 100644 index 343d2169..00000000 --- a/doc/implementors/aho_corasick/trait.Automaton.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['aho_corasick'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/aho_corasick/trait.Transitions.js b/doc/implementors/aho_corasick/trait.Transitions.js deleted file mode 100644 index 343d2169..00000000 --- a/doc/implementors/aho_corasick/trait.Transitions.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['aho_corasick'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/alloc/boxed/trait.FnBox.js b/doc/implementors/alloc/boxed/trait.FnBox.js deleted file mode 100644 index eadb6556..00000000 --- a/doc/implementors/alloc/boxed/trait.FnBox.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bit_vec/trait.BitBlock.js b/doc/implementors/bit_vec/trait.BitBlock.js deleted file mode 100644 index 4c678990..00000000 --- a/doc/implementors/bit_vec/trait.BitBlock.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bit_vec'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/any/trait.Any.js b/doc/implementors/bitflags/__core/any/trait.Any.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/any/trait.Any.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ascii/trait.AsciiExt.js b/doc/implementors/bitflags/__core/ascii/trait.AsciiExt.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/ascii/trait.AsciiExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/borrow/trait.Borrow.js b/doc/implementors/bitflags/__core/borrow/trait.Borrow.js deleted file mode 100644 index 5ff75654..00000000 --- a/doc/implementors/bitflags/__core/borrow/trait.Borrow.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl Borrow<CStr> for CString","impl Borrow<OsStr> for OsString","impl Borrow<Path> for PathBuf","impl<T> Borrow<T> for Box<T> where T: ?Sized","impl Borrow<str> for String","impl<T> Borrow<T> for Rc<T> where T: ?Sized","impl<'a, B> Borrow<B> for Cow<'a, B> where B: ToOwned + ?Sized, B::Owned: 'a","impl<T> Borrow<[T]> for Vec<T>","impl<T> Borrow<T> for Arc<T> where T: ?Sized",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/borrow/trait.BorrowMut.js b/doc/implementors/bitflags/__core/borrow/trait.BorrowMut.js deleted file mode 100644 index 63eb357e..00000000 --- a/doc/implementors/bitflags/__core/borrow/trait.BorrowMut.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<T> BorrowMut<T> for Box<T> where T: ?Sized","impl<T> BorrowMut<[T]> for Vec<T>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/borrow/trait.ToOwned.js b/doc/implementors/bitflags/__core/borrow/trait.ToOwned.js deleted file mode 100644 index 92813179..00000000 --- a/doc/implementors/bitflags/__core/borrow/trait.ToOwned.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl ToOwned for CStr","impl ToOwned for OsStr","impl ToOwned for Path",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/boxed/trait.FnBox.js b/doc/implementors/bitflags/__core/boxed/trait.FnBox.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/boxed/trait.FnBox.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/clone/trait.Clone.js b/doc/implementors/bitflags/__core/clone/trait.Clone.js deleted file mode 100644 index ed55faf8..00000000 --- a/doc/implementors/bitflags/__core/clone/trait.Clone.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl Clone for LocalKeyState","impl Clone for Thread","impl<K, V, S> Clone for HashMap<K, V, S> where S: Clone, V: Clone, K: Clone","impl<'a, K, V> Clone for Iter<'a, K, V>","impl<'a, K, V> Clone for Keys<'a, K, V>","impl<'a, K, V> Clone for Values<'a, K, V>","impl Clone for RandomState","impl<T, S> Clone for HashSet<T, S> where T: Clone, S: Clone","impl<'a, K> Clone for Iter<'a, K>","impl<'a, T, S> Clone for Intersection<'a, T, S>","impl<'a, T, S> Clone for Difference<'a, T, S>","impl<'a, T, S> Clone for SymmetricDifference<'a, T, S>","impl<'a, T, S> Clone for Union<'a, T, S>","impl<'a, T> Clone for Iter<'a, T>","impl<T> Clone for IntoIter<T> where T: Clone","impl<A> Clone for LinkedList<A> where A: Clone","impl<T> Clone for VecDeque<T> where T: Clone","impl<'a, T> Clone for Iter<'a, T>","impl<T> Clone for IntoIter<T> where T: Clone","impl<T> Clone for BinaryHeap<T> where T: Clone","impl<'a, T> Clone for Iter<'a, T>","impl<T> Clone for IntoIter<T> where T: Clone","impl Clone for VarError","impl Clone for CString","impl Clone for NulError","impl Clone for IntoStringError","impl Clone for OsString","impl Clone for Metadata","impl Clone for OpenOptions","impl Clone for Permissions","impl Clone for FileType","impl<T> Clone for Cursor<T> where T: Clone","impl Clone for ErrorKind","impl Clone for SeekFrom","impl Clone for IpAddr","impl Clone for Ipv6MulticastScope","impl Clone for Ipv4Addr","impl Clone for Ipv6Addr","impl Clone for SocketAddr","impl Clone for SocketAddrV4","impl Clone for SocketAddrV6","impl Clone for AddrParseError","impl Clone for Shutdown","impl Clone for stat","impl Clone for SocketAddr","impl<'a> Clone for Prefix<'a>","impl<'a> Clone for PrefixComponent<'a>","impl<'a> Clone for Component<'a>","impl<'a> Clone for Components<'a>","impl<'a> Clone for Iter<'a>","impl Clone for PathBuf","impl Clone for StripPrefixError","impl Clone for Output","impl Clone for ExitStatus","impl<T> Clone for SendError<T> where T: Clone","impl Clone for RecvError","impl Clone for TryRecvError","impl<T> Clone for TrySendError<T> where T: Clone","impl<T> Clone for Sender<T>","impl<T> Clone for SyncSender<T>","impl Clone for WaitTimeoutResult","impl Clone for Duration","impl Clone for Instant","impl Clone for SystemTime","impl Clone for SystemTimeError","impl Clone for utimbuf","impl Clone for timeval","impl Clone for timespec","impl Clone for rlimit","impl Clone for rusage","impl Clone for in_addr","impl Clone for in6_addr","impl Clone for ip_mreq","impl Clone for ipv6_mreq","impl Clone for hostent","impl Clone for iovec","impl Clone for pollfd","impl Clone for winsize","impl Clone for sockaddr","impl Clone for sockaddr_in6","impl Clone for sockaddr_un","impl Clone for passwd","impl Clone for ifaddrs","impl Clone for fd_set","impl Clone for tm","impl Clone for utsname","impl Clone for msghdr","impl Clone for fsid_t","impl Clone for glob_t","impl Clone for sockaddr_storage","impl Clone for addrinfo","impl Clone for mach_timebase_info","impl Clone for stat","impl Clone for dirent","impl Clone for pthread_mutex_t","impl Clone for pthread_mutexattr_t","impl Clone for pthread_cond_t","impl Clone for pthread_rwlock_t","impl Clone for siginfo_t","impl Clone for sigaction","impl Clone for stack_t","impl Clone for fstore_t","impl Clone for radvisory","impl Clone for statvfs","impl Clone for Dl_info","impl Clone for sockaddr_in","impl Clone for statfs","impl Clone for kevent","impl Clone for kevent64_s","impl Clone for dqblk","impl Clone for termios","impl Clone for flock","impl Clone for sf_hdtr","impl Clone for lconv","impl Clone for pthread_attr_t","impl<T> Clone for Vec<T> where T: Clone","impl<T> Clone for IntoIter<T> where T: Clone","impl Clone for ExchangeHeapSingleton","impl<T> Clone for Box<T> where T: Clone","impl Clone for Box<str>","impl<T> Clone for Box<[T]> where T: Clone","impl<I> Clone for DecodeUtf16<I> where I: Clone + Iterator<Item=u16>","impl Clone for DecodeUtf16Error","impl<'a> Clone for EncodeUtf16<'a>","impl<T> Clone for Rc<T> where T: ?Sized","impl<T> Clone for Weak<T> where T: ?Sized","impl Clone for String","impl Clone for ParseError","impl<'a, B> Clone for Cow<'a, B> where B: ToOwned + ?Sized","impl<K, V> Clone for BTreeMap<K, V> where K: Clone, V: Clone","impl<'a, K, V> Clone for Iter<'a, K, V>","impl<'a, K, V> Clone for Keys<'a, K, V>","impl<'a, K, V> Clone for Values<'a, K, V>","impl<'a, K, V> Clone for Range<'a, K, V>","impl<T> Clone for BTreeSet<T> where T: Clone","impl<'a, T> Clone for Iter<'a, T>","impl<'a, T> Clone for Range<'a, T>","impl<'a, T> Clone for Difference<'a, T>","impl<'a, T> Clone for SymmetricDifference<'a, T>","impl<'a, T> Clone for Intersection<'a, T>","impl<'a, T> Clone for Union<'a, T>","impl<E> Clone for EnumSet<E>","impl<E> Clone for Iter<E>","impl<T> Clone for Bound<T> where T: Clone","impl<T> Clone for Arc<T> where T: ?Sized","impl<T> Clone for Weak<T> where T: ?Sized","impl Clone for StandardNormal","impl Clone for Normal","impl Clone for LogNormal","impl Clone for Exp1","impl Clone for Exp","impl Clone for IsaacRng","impl Clone for Isaac64Rng","impl Clone for ChaChaRng","impl Clone for ReseedWithDefault","impl Clone for XorShiftRng","impl<I> Clone for Utf16Encoder<I> where I: Clone",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/cmp/trait.Eq.js b/doc/implementors/bitflags/__core/cmp/trait.Eq.js deleted file mode 100644 index e9298af1..00000000 --- a/doc/implementors/bitflags/__core/cmp/trait.Eq.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl Eq for LocalKeyState","impl<K, V, S> Eq for HashMap<K, V, S> where K: Eq + Hash, V: Eq, S: BuildHasher","impl<T, S> Eq for HashSet<T, S> where T: Eq + Hash, S: BuildHasher","impl<A> Eq for LinkedList<A> where A: Eq","impl<A> Eq for VecDeque<A> where A: Eq","impl Eq for VarError","impl Eq for CString","impl Eq for CStr","impl Eq for OsString","impl Eq for OsStr","impl Eq for Permissions","impl Eq for FileType","impl Eq for ErrorKind","impl Eq for SeekFrom","impl Eq for IpAddr","impl Eq for Ipv6MulticastScope","impl Eq for Ipv4Addr","impl Eq for Ipv6Addr","impl Eq for SocketAddr","impl Eq for SocketAddrV4","impl Eq for SocketAddrV6","impl<'a> Eq for Prefix<'a>","impl<'a> Eq for PrefixComponent<'a>","impl<'a> Eq for Component<'a>","impl<'a> Eq for Components<'a>","impl Eq for PathBuf","impl Eq for StripPrefixError","impl Eq for Path","impl Eq for Output","impl Eq for ExitStatus","impl<T> Eq for SendError<T> where T: Eq","impl Eq for RecvError","impl Eq for TryRecvError","impl<T> Eq for TrySendError<T> where T: Eq","impl Eq for WaitTimeoutResult","impl Eq for Duration","impl Eq for Instant","impl Eq for SystemTime","impl<T> Eq for Vec<T> where T: Eq","impl<T> Eq for Box<T> where T: Eq + ?Sized","impl Eq for DecodeUtf16Error","impl<T> Eq for Rc<T> where T: Eq + ?Sized","impl Eq for String","impl Eq for ParseError","impl<'a, B> Eq for Cow<'a, B> where B: Eq + ToOwned + ?Sized","impl<K, V> Eq for BTreeMap<K, V> where K: Eq, V: Eq","impl<T> Eq for BTreeSet<T> where T: Eq","impl<E> Eq for EnumSet<E> where E: Eq","impl<T> Eq for Bound<T> where T: Eq","impl<T> Eq for Arc<T> where T: Eq + ?Sized",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/cmp/trait.Ord.js b/doc/implementors/bitflags/__core/cmp/trait.Ord.js deleted file mode 100644 index 53a7e9fd..00000000 --- a/doc/implementors/bitflags/__core/cmp/trait.Ord.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<A> Ord for LinkedList<A> where A: Ord","impl<A> Ord for VecDeque<A> where A: Ord","impl Ord for CString","impl Ord for CStr","impl Ord for OsString","impl Ord for OsStr","impl Ord for IpAddr","impl Ord for Ipv4Addr","impl Ord for Ipv6Addr","impl<'a> Ord for Prefix<'a>","impl<'a> Ord for PrefixComponent<'a>","impl<'a> Ord for Component<'a>","impl<'a> Ord for Components<'a>","impl Ord for PathBuf","impl Ord for Path","impl Ord for Duration","impl Ord for Instant","impl Ord for SystemTime","impl<T> Ord for Vec<T> where T: Ord","impl<T> Ord for Box<T> where T: Ord + ?Sized","impl<T> Ord for Rc<T> where T: Ord + ?Sized","impl Ord for String","impl<'a, B> Ord for Cow<'a, B> where B: Ord + ToOwned + ?Sized","impl<K, V> Ord for BTreeMap<K, V> where K: Ord, V: Ord","impl<T> Ord for BTreeSet<T> where T: Ord","impl<E> Ord for EnumSet<E> where E: Ord","impl<T> Ord for Arc<T> where T: Ord + ?Sized",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/cmp/trait.PartialEq.js b/doc/implementors/bitflags/__core/cmp/trait.PartialEq.js deleted file mode 100644 index 68b097d3..00000000 --- a/doc/implementors/bitflags/__core/cmp/trait.PartialEq.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl PartialEq<LocalKeyState> for LocalKeyState","impl<K, V, S> PartialEq<HashMap<K, V, S>> for HashMap<K, V, S> where S: BuildHasher, K: Eq + Hash, V: PartialEq<V>","impl<T, S> PartialEq<HashSet<T, S>> for HashSet<T, S> where S: BuildHasher, T: Eq + Hash","impl<A> PartialEq<LinkedList<A>> for LinkedList<A> where A: PartialEq<A>","impl<A> PartialEq<VecDeque<A>> for VecDeque<A> where A: PartialEq<A>","impl PartialEq<VarError> for VarError","impl PartialEq<CString> for CString","impl PartialEq<NulError> for NulError","impl PartialEq<IntoStringError> for IntoStringError","impl PartialEq<CStr> for CStr","impl PartialEq<OsString> for OsString","impl PartialEq<str> for OsString","impl PartialEq<OsString> for str","impl PartialEq<OsStr> for OsStr","impl PartialEq<str> for OsStr","impl PartialEq<OsStr> for str","impl<'a, 'b> PartialEq<OsStr> for OsString","impl<'a, 'b> PartialEq<OsString> for OsStr","impl<'a, 'b> PartialEq<&'a OsStr> for OsString","impl<'a, 'b> PartialEq<OsString> for &'a OsStr","impl<'a, 'b> PartialEq<OsStr> for Cow<'a, OsStr>","impl<'a, 'b> PartialEq<Cow<'a, OsStr>> for OsStr","impl<'a, 'b> PartialEq<&'b OsStr> for Cow<'a, OsStr>","impl<'a, 'b> PartialEq<Cow<'a, OsStr>> for &'b OsStr","impl<'a, 'b> PartialEq<OsString> for Cow<'a, OsStr>","impl<'a, 'b> PartialEq<Cow<'a, OsStr>> for OsString","impl PartialEq<Permissions> for Permissions","impl PartialEq<FileType> for FileType","impl PartialEq<ErrorKind> for ErrorKind","impl PartialEq<SeekFrom> for SeekFrom","impl PartialEq<IpAddr> for IpAddr","impl PartialEq<Ipv6MulticastScope> for Ipv6MulticastScope","impl PartialEq<Ipv4Addr> for Ipv4Addr","impl PartialEq<Ipv6Addr> for Ipv6Addr","impl PartialEq<SocketAddr> for SocketAddr","impl PartialEq<SocketAddrV4> for SocketAddrV4","impl PartialEq<SocketAddrV6> for SocketAddrV6","impl PartialEq<AddrParseError> for AddrParseError","impl PartialEq<Shutdown> for Shutdown","impl<'a> PartialEq<Prefix<'a>> for Prefix<'a>","impl<'a> PartialEq<PrefixComponent<'a>> for PrefixComponent<'a>","impl<'a> PartialEq<Component<'a>> for Component<'a>","impl<'a> PartialEq<Components<'a>> for Components<'a>","impl PartialEq<PathBuf> for PathBuf","impl PartialEq<StripPrefixError> for StripPrefixError","impl PartialEq<Path> for Path","impl<'a, 'b> PartialEq<Path> for PathBuf","impl<'a, 'b> PartialEq<PathBuf> for Path","impl<'a, 'b> PartialEq<&'a Path> for PathBuf","impl<'a, 'b> PartialEq<PathBuf> for &'a Path","impl<'a, 'b> PartialEq<Path> for Cow<'a, Path>","impl<'a, 'b> PartialEq<Cow<'a, Path>> for Path","impl<'a, 'b> PartialEq<&'b Path> for Cow<'a, Path>","impl<'a, 'b> PartialEq<Cow<'a, Path>> for &'b Path","impl<'a, 'b> PartialEq<PathBuf> for Cow<'a, Path>","impl<'a, 'b> PartialEq<Cow<'a, Path>> for PathBuf","impl<'a, 'b> PartialEq<OsStr> for PathBuf","impl<'a, 'b> PartialEq<PathBuf> for OsStr","impl<'a, 'b> PartialEq<&'a OsStr> for PathBuf","impl<'a, 'b> PartialEq<PathBuf> for &'a OsStr","impl<'a, 'b> PartialEq<Cow<'a, OsStr>> for PathBuf","impl<'a, 'b> PartialEq<PathBuf> for Cow<'a, OsStr>","impl<'a, 'b> PartialEq<OsString> for PathBuf","impl<'a, 'b> PartialEq<PathBuf> for OsString","impl<'a, 'b> PartialEq<OsStr> for Path","impl<'a, 'b> PartialEq<Path> for OsStr","impl<'a, 'b> PartialEq<&'a OsStr> for Path","impl<'a, 'b> PartialEq<Path> for &'a OsStr","impl<'a, 'b> PartialEq<Cow<'a, OsStr>> for Path","impl<'a, 'b> PartialEq<Path> for Cow<'a, OsStr>","impl<'a, 'b> PartialEq<OsString> for Path","impl<'a, 'b> PartialEq<Path> for OsString","impl<'a, 'b> PartialEq<OsStr> for &'a Path","impl<'a, 'b> PartialEq<&'a Path> for OsStr","impl<'a, 'b> PartialEq<Cow<'b, OsStr>> for &'a Path","impl<'a, 'b> PartialEq<&'a Path> for Cow<'b, OsStr>","impl<'a, 'b> PartialEq<OsString> for &'a Path","impl<'a, 'b> PartialEq<&'a Path> for OsString","impl<'a, 'b> PartialEq<OsStr> for Cow<'a, Path>","impl<'a, 'b> PartialEq<Cow<'a, Path>> for OsStr","impl<'a, 'b> PartialEq<&'b OsStr> for Cow<'a, Path>","impl<'a, 'b> PartialEq<Cow<'a, Path>> for &'b OsStr","impl<'a, 'b> PartialEq<OsString> for Cow<'a, Path>","impl<'a, 'b> PartialEq<Cow<'a, Path>> for OsString","impl PartialEq<Output> for Output","impl PartialEq<ExitStatus> for ExitStatus","impl<T> PartialEq<SendError<T>> for SendError<T> where T: PartialEq<T>","impl PartialEq<RecvError> for RecvError","impl PartialEq<TryRecvError> for TryRecvError","impl<T> PartialEq<TrySendError<T>> for TrySendError<T> where T: PartialEq<T>","impl PartialEq<WaitTimeoutResult> for WaitTimeoutResult","impl PartialEq<Duration> for Duration","impl PartialEq<Instant> for Instant","impl PartialEq<SystemTime> for SystemTime","impl<'a, 'b, A, B> PartialEq<Vec<B>> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b mut [B]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B]> for Cow<'a, [A]> where A: Clone + PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b mut [B]> for Cow<'a, [A]> where A: Clone + PartialEq<B>","impl<'a, 'b, A, B> PartialEq<Vec<B>> for Cow<'a, [A]> where A: Clone + PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 0]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 0]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 1]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 1]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 2]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 2]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 3]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 3]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 4]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 4]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 5]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 5]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 6]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 6]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 7]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 7]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 8]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 8]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 9]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 9]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 10]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 10]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 11]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 11]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 12]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 12]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 13]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 13]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 14]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 14]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 15]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 15]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 16]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 16]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 17]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 17]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 18]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 18]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 19]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 19]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 20]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 20]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 21]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 21]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 22]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 22]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 23]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 23]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 24]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 24]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 25]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 25]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 26]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 26]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 27]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 27]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 28]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 28]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 29]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 29]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 30]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 30]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 31]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 31]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 32]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 32]> for Vec<A> where A: PartialEq<B>","impl<T> PartialEq<Box<T>> for Box<T> where T: PartialEq<T> + ?Sized","impl PartialEq<DecodeUtf16Error> for DecodeUtf16Error","impl<T> PartialEq<Rc<T>> for Rc<T> where T: PartialEq<T> + ?Sized","impl PartialEq<String> for String","impl<'a, 'b> PartialEq<str> for String","impl<'a, 'b> PartialEq<String> for str","impl<'a, 'b> PartialEq<&'a str> for String","impl<'a, 'b> PartialEq<String> for &'a str","impl<'a, 'b> PartialEq<str> for Cow<'a, str>","impl<'a, 'b> PartialEq<Cow<'a, str>> for str","impl<'a, 'b> PartialEq<&'b str> for Cow<'a, str>","impl<'a, 'b> PartialEq<Cow<'a, str>> for &'b str","impl<'a, 'b> PartialEq<String> for Cow<'a, str>","impl<'a, 'b> PartialEq<Cow<'a, str>> for String","impl PartialEq<ParseError> for ParseError","impl<'a, 'b, B, C> PartialEq<Cow<'b, C>> for Cow<'a, B> where B: PartialEq<C> + ToOwned + ?Sized, C: ToOwned + ?Sized","impl<K, V> PartialEq<BTreeMap<K, V>> for BTreeMap<K, V> where K: PartialEq<K>, V: PartialEq<V>","impl<T> PartialEq<BTreeSet<T>> for BTreeSet<T> where T: PartialEq<T>","impl<E> PartialEq<EnumSet<E>> for EnumSet<E> where E: PartialEq<E>","impl<T> PartialEq<Bound<T>> for Bound<T> where T: PartialEq<T>","impl<T> PartialEq<Arc<T>> for Arc<T> where T: PartialEq<T> + ?Sized",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/cmp/trait.PartialOrd.js b/doc/implementors/bitflags/__core/cmp/trait.PartialOrd.js deleted file mode 100644 index 1ddb7a30..00000000 --- a/doc/implementors/bitflags/__core/cmp/trait.PartialOrd.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<A> PartialOrd<LinkedList<A>> for LinkedList<A> where A: PartialOrd<A>","impl<A> PartialOrd<VecDeque<A>> for VecDeque<A> where A: PartialOrd<A>","impl PartialOrd<CString> for CString","impl PartialOrd<CStr> for CStr","impl PartialOrd<OsString> for OsString","impl PartialOrd<str> for OsString","impl PartialOrd<OsStr> for OsStr","impl PartialOrd<str> for OsStr","impl<'a, 'b> PartialOrd<OsStr> for OsString","impl<'a, 'b> PartialOrd<OsString> for OsStr","impl<'a, 'b> PartialOrd<&'a OsStr> for OsString","impl<'a, 'b> PartialOrd<OsString> for &'a OsStr","impl<'a, 'b> PartialOrd<OsStr> for Cow<'a, OsStr>","impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for OsStr","impl<'a, 'b> PartialOrd<&'b OsStr> for Cow<'a, OsStr>","impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for &'b OsStr","impl<'a, 'b> PartialOrd<OsString> for Cow<'a, OsStr>","impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for OsString","impl PartialOrd<IpAddr> for IpAddr","impl PartialOrd<Ipv4Addr> for Ipv4Addr","impl PartialOrd<Ipv6Addr> for Ipv6Addr","impl<'a> PartialOrd<Prefix<'a>> for Prefix<'a>","impl<'a> PartialOrd<PrefixComponent<'a>> for PrefixComponent<'a>","impl<'a> PartialOrd<Component<'a>> for Component<'a>","impl<'a> PartialOrd<Components<'a>> for Components<'a>","impl PartialOrd<PathBuf> for PathBuf","impl PartialOrd<Path> for Path","impl<'a, 'b> PartialOrd<Path> for PathBuf","impl<'a, 'b> PartialOrd<PathBuf> for Path","impl<'a, 'b> PartialOrd<&'a Path> for PathBuf","impl<'a, 'b> PartialOrd<PathBuf> for &'a Path","impl<'a, 'b> PartialOrd<Path> for Cow<'a, Path>","impl<'a, 'b> PartialOrd<Cow<'a, Path>> for Path","impl<'a, 'b> PartialOrd<&'b Path> for Cow<'a, Path>","impl<'a, 'b> PartialOrd<Cow<'a, Path>> for &'b Path","impl<'a, 'b> PartialOrd<PathBuf> for Cow<'a, Path>","impl<'a, 'b> PartialOrd<Cow<'a, Path>> for PathBuf","impl<'a, 'b> PartialOrd<OsStr> for PathBuf","impl<'a, 'b> PartialOrd<PathBuf> for OsStr","impl<'a, 'b> PartialOrd<&'a OsStr> for PathBuf","impl<'a, 'b> PartialOrd<PathBuf> for &'a OsStr","impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for PathBuf","impl<'a, 'b> PartialOrd<PathBuf> for Cow<'a, OsStr>","impl<'a, 'b> PartialOrd<OsString> for PathBuf","impl<'a, 'b> PartialOrd<PathBuf> for OsString","impl<'a, 'b> PartialOrd<OsStr> for Path","impl<'a, 'b> PartialOrd<Path> for OsStr","impl<'a, 'b> PartialOrd<&'a OsStr> for Path","impl<'a, 'b> PartialOrd<Path> for &'a OsStr","impl<'a, 'b> PartialOrd<Cow<'a, OsStr>> for Path","impl<'a, 'b> PartialOrd<Path> for Cow<'a, OsStr>","impl<'a, 'b> PartialOrd<OsString> for Path","impl<'a, 'b> PartialOrd<Path> for OsString","impl<'a, 'b> PartialOrd<OsStr> for &'a Path","impl<'a, 'b> PartialOrd<&'a Path> for OsStr","impl<'a, 'b> PartialOrd<Cow<'b, OsStr>> for &'a Path","impl<'a, 'b> PartialOrd<&'a Path> for Cow<'b, OsStr>","impl<'a, 'b> PartialOrd<OsString> for &'a Path","impl<'a, 'b> PartialOrd<&'a Path> for OsString","impl<'a, 'b> PartialOrd<OsStr> for Cow<'a, Path>","impl<'a, 'b> PartialOrd<Cow<'a, Path>> for OsStr","impl<'a, 'b> PartialOrd<&'b OsStr> for Cow<'a, Path>","impl<'a, 'b> PartialOrd<Cow<'a, Path>> for &'b OsStr","impl<'a, 'b> PartialOrd<OsString> for Cow<'a, Path>","impl<'a, 'b> PartialOrd<Cow<'a, Path>> for OsString","impl PartialOrd<Duration> for Duration","impl PartialOrd<Instant> for Instant","impl PartialOrd<SystemTime> for SystemTime","impl<T> PartialOrd<Vec<T>> for Vec<T> where T: PartialOrd<T>","impl<T> PartialOrd<Box<T>> for Box<T> where T: PartialOrd<T> + ?Sized","impl<T> PartialOrd<Rc<T>> for Rc<T> where T: PartialOrd<T> + ?Sized","impl PartialOrd<String> for String","impl<'a, B> PartialOrd<Cow<'a, B>> for Cow<'a, B> where B: PartialOrd<B> + ToOwned + ?Sized","impl<K, V> PartialOrd<BTreeMap<K, V>> for BTreeMap<K, V> where K: PartialOrd<K>, V: PartialOrd<V>","impl<T> PartialOrd<BTreeSet<T>> for BTreeSet<T> where T: PartialOrd<T>","impl<E> PartialOrd<EnumSet<E>> for EnumSet<E> where E: PartialOrd<E>","impl<T> PartialOrd<Arc<T>> for Arc<T> where T: PartialOrd<T> + ?Sized",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/convert/trait.AsMut.js b/doc/implementors/bitflags/__core/convert/trait.AsMut.js deleted file mode 100644 index 47134f90..00000000 --- a/doc/implementors/bitflags/__core/convert/trait.AsMut.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<T> AsMut<Vec<T>> for Vec<T>","impl<T> AsMut<[T]> for Vec<T>","impl<T> AsMut<T> for Box<T> where T: ?Sized",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/convert/trait.AsRef.js b/doc/implementors/bitflags/__core/convert/trait.AsRef.js deleted file mode 100644 index 310dc7ab..00000000 --- a/doc/implementors/bitflags/__core/convert/trait.AsRef.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl AsRef<CStr> for CStr","impl AsRef<CStr> for CString","impl AsRef<OsStr> for OsStr","impl AsRef<OsStr> for OsString","impl AsRef<OsStr> for str","impl AsRef<OsStr> for String","impl<'a> AsRef<OsStr> for Component<'a>","impl<'a> AsRef<Path> for Components<'a>","impl<'a> AsRef<OsStr> for Components<'a>","impl<'a> AsRef<Path> for Iter<'a>","impl<'a> AsRef<OsStr> for Iter<'a>","impl AsRef<OsStr> for PathBuf","impl AsRef<OsStr> for Path","impl AsRef<Path> for Path","impl AsRef<Path> for OsStr","impl<'a> AsRef<Path> for Cow<'a, OsStr>","impl AsRef<Path> for OsString","impl AsRef<Path> for str","impl AsRef<Path> for String","impl AsRef<Path> for PathBuf","impl<T> AsRef<Vec<T>> for Vec<T>","impl<T> AsRef<[T]> for Vec<T>","impl<T> AsRef<T> for Box<T> where T: ?Sized","impl<T> AsRef<T> for Rc<T> where T: ?Sized","impl AsRef<str> for String","impl AsRef<[u8]> for String","impl<'a, T> AsRef<T> for Cow<'a, T> where T: ToOwned + ?Sized","impl<T> AsRef<T> for Arc<T> where T: ?Sized",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/convert/trait.From.js b/doc/implementors/bitflags/__core/convert/trait.From.js deleted file mode 100644 index b13c3f03..00000000 --- a/doc/implementors/bitflags/__core/convert/trait.From.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<'a, E> From<E> for Box<Error + 'a> where E: 'a + Error","impl<'a, E> From<E> for Box<Error + 'a + Send + Sync> where E: Send + Sync + 'a + Error","impl From<String> for Box<Error + 'static + Send + Sync>","impl From<String> for Box<Error + 'static>","impl<'a, 'b> From<&'b str> for Box<Error + 'a + Send + Sync>","impl<'a> From<&'a str> for Box<Error + 'static>","impl<T> From<Vec<T>> for VecDeque<T>","impl<T> From<VecDeque<T>> for Vec<T>","impl<T> From<Vec<T>> for BinaryHeap<T> where T: Ord","impl<T> From<BinaryHeap<T>> for Vec<T>","impl From<CString> for Vec<u8>","impl From<NulError> for Error","impl<'a> From<&'a CStr> for CString","impl From<String> for OsString","impl<'a, T> From<&'a T> for OsString where T: AsRef<OsStr> + ?Sized","impl<W> From<IntoInnerError<W>> for Error","impl From<Ipv4Addr> for u32","impl From<u32> for Ipv4Addr","impl From<[u8; 4]> for Ipv4Addr","impl From<[u8; 16]> for Ipv6Addr","impl<'a, T> From<&'a T> for PathBuf where T: AsRef<OsStr> + ?Sized","impl From<OsString> for PathBuf","impl From<String> for PathBuf","impl<'a> From<&'a Path> for Cow<'a, Path>","impl<'a> From<PathBuf> for Cow<'a, Path>","impl<T> From<PoisonError<T>> for TryLockError<T>","impl<'a, T> From<&'a [T]> for Vec<T> where T: Clone","impl<'a> From<&'a str> for Vec<u8>","impl<'a, T> From<&'a [T]> for Cow<'a, [T]> where T: Clone","impl<'a, T> From<Vec<T>> for Cow<'a, [T]> where T: Clone","impl<T> From<T> for Box<T>","impl<T> From<T> for Rc<T>","impl<'a> From<&'a str> for String","impl<'a> From<&'a str> for Cow<'a, str>","impl<'a> From<String> for Cow<'a, str>","impl<T> From<T> for Arc<T>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/convert/trait.Into.js b/doc/implementors/bitflags/__core/convert/trait.Into.js deleted file mode 100644 index f239433e..00000000 --- a/doc/implementors/bitflags/__core/convert/trait.Into.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl Into<OsString> for PathBuf","impl Into<Vec<u8>> for String",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/default/trait.Default.js b/doc/implementors/bitflags/__core/default/trait.Default.js deleted file mode 100644 index d6471f2d..00000000 --- a/doc/implementors/bitflags/__core/default/trait.Default.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<K, V, S> Default for HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher + Default","impl Default for RandomState","impl<T, S> Default for HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash","impl<T> Default for LinkedList<T>","impl<T> Default for VecDeque<T>","impl<T> Default for BinaryHeap<T> where T: Ord","impl Default for OsString","impl<'a> Default for &'a OsStr","impl Default for Condvar","impl<T> Default for Mutex<T> where T: Default + ?Sized","impl<T> Default for RwLock<T> where T: Default","impl<T> Default for Vec<T>","impl<T> Default for Box<T> where T: Default","impl<T> Default for Box<[T]>","impl<T> Default for Rc<T> where T: Default","impl Default for String","impl<K, V> Default for BTreeMap<K, V> where K: Ord","impl<T> Default for BTreeSet<T> where T: Ord","impl<T> Default for Arc<T> where T: Default","impl Default for ReseedWithDefault",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/error/trait.Error.js b/doc/implementors/bitflags/__core/error/trait.Error.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/error/trait.Error.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/fmt/trait.Binary.js b/doc/implementors/bitflags/__core/fmt/trait.Binary.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/fmt/trait.Binary.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/fmt/trait.Debug.js b/doc/implementors/bitflags/__core/fmt/trait.Debug.js deleted file mode 100644 index 631aaf07..00000000 --- a/doc/implementors/bitflags/__core/fmt/trait.Debug.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl Debug for Thread","impl<K, V, S> Debug for HashMap<K, V, S> where V: Debug, K: Eq + Hash + Debug, S: BuildHasher","impl<T, S> Debug for HashSet<T, S> where T: Eq + Hash + Debug, S: BuildHasher","impl<A> Debug for LinkedList<A> where A: Debug","impl<T> Debug for VecDeque<T> where T: Debug","impl<T> Debug for BinaryHeap<T> where T: Ord + Debug","impl Debug for VarError","impl Debug for JoinPathsError","impl Debug for NulError","impl Debug for IntoStringError","impl Debug for CString","impl Debug for CStr","impl Debug for OsString","impl Debug for OsStr","impl Debug for Permissions","impl Debug for File","impl<R> Debug for BufReader<R> where R: Debug","impl<W> Debug for IntoInnerError<W> where W: Debug","impl<W> Debug for BufWriter<W> where W: Write + Debug","impl<W> Debug for LineWriter<W> where W: Write + Debug","impl<T> Debug for Cursor<T> where T: Debug","impl Debug for Error","impl Debug for ErrorKind","impl Debug for SeekFrom","impl Debug for CharsError","impl Debug for IpAddr","impl Debug for Ipv6MulticastScope","impl Debug for Ipv4Addr","impl Debug for Ipv6Addr","impl Debug for SocketAddr","impl Debug for SocketAddrV4","impl Debug for SocketAddrV6","impl Debug for TcpStream","impl Debug for TcpListener","impl Debug for UdpSocket","impl Debug for AddrParseError","impl Debug for Shutdown","impl Debug for SocketAddr","impl Debug for UnixStream","impl Debug for UnixListener","impl<'a> Debug for Incoming<'a>","impl Debug for UnixDatagram","impl<'a> Debug for Prefix<'a>","impl<'a> Debug for PrefixComponent<'a>","impl<'a> Debug for Component<'a>","impl Debug for PathBuf","impl Debug for StripPrefixError","impl Debug for Path","impl<'a> Debug for Display<'a>","impl Debug for Command","impl Debug for Output","impl Debug for ExitStatus","impl Debug for Select","impl<'rx, T> Debug for Handle<'rx, T> where T: Send + 'rx","impl Debug for RecvError","impl Debug for TryRecvError","impl<T> Debug for Sender<T>","impl<T> Debug for SyncSender<T>","impl<T> Debug for Receiver<T>","impl<T> Debug for SendError<T>","impl<T> Debug for TrySendError<T>","impl Debug for WaitTimeoutResult","impl<T> Debug for Mutex<T> where T: Debug + ?Sized","impl<T> Debug for RwLock<T> where T: Debug + ?Sized","impl Debug for Duration","impl Debug for SystemTimeError","impl Debug for Instant","impl Debug for SystemTime","impl<T> Debug for PoisonError<T>","impl<T> Debug for TryLockError<T>","impl<T> Debug for Vec<T> where T: Debug","impl<T> Debug for Box<T> where T: Debug + ?Sized","impl Debug for DecodeUtf16Error","impl<T> Debug for Rc<T> where T: Debug + ?Sized","impl<T> Debug for Weak<T> where T: Debug + ?Sized","impl Debug for FromUtf8Error","impl Debug for FromUtf16Error","impl Debug for String","impl Debug for ParseError","impl<'a, B> Debug for Cow<'a, B> where B: Debug + ToOwned + ?Sized, B::Owned: Debug","impl<K, V> Debug for BTreeMap<K, V> where V: Debug, K: Debug","impl<T> Debug for BTreeSet<T> where T: Debug","impl<E> Debug for EnumSet<E> where E: CLike + Debug","impl<T> Debug for Bound<T> where T: Debug","impl<T> Debug for Weak<T> where T: Debug + ?Sized","impl<T> Debug for Arc<T> where T: Debug + ?Sized",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/fmt/trait.Display.js b/doc/implementors/bitflags/__core/fmt/trait.Display.js deleted file mode 100644 index 736adacb..00000000 --- a/doc/implementors/bitflags/__core/fmt/trait.Display.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl Display for VarError","impl Display for JoinPathsError","impl Display for NulError","impl Display for IntoStringError","impl<W> Display for IntoInnerError<W>","impl Display for Error","impl Display for CharsError","impl Display for IpAddr","impl Display for Ipv4Addr","impl Display for Ipv6Addr","impl Display for SocketAddr","impl Display for SocketAddrV4","impl Display for SocketAddrV6","impl Display for AddrParseError","impl<'a> Display for Display<'a>","impl Display for StripPrefixError","impl Display for ExitStatus","impl<T> Display for SendError<T>","impl<T> Display for TrySendError<T>","impl Display for RecvError","impl Display for TryRecvError","impl Display for SystemTimeError","impl<T> Display for PoisonError<T>","impl<T> Display for TryLockError<T>","impl<T> Display for Box<T> where T: Display + ?Sized","impl Display for DecodeUtf16Error","impl<T> Display for Rc<T> where T: Display + ?Sized","impl Display for FromUtf8Error","impl Display for FromUtf16Error","impl Display for String","impl Display for ParseError","impl<'a, B> Display for Cow<'a, B> where B: Display + ToOwned + ?Sized, B::Owned: Display","impl<T> Display for Arc<T> where T: Display + ?Sized",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/fmt/trait.LowerExp.js b/doc/implementors/bitflags/__core/fmt/trait.LowerExp.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/fmt/trait.LowerExp.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/fmt/trait.LowerHex.js b/doc/implementors/bitflags/__core/fmt/trait.LowerHex.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/fmt/trait.LowerHex.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/fmt/trait.Octal.js b/doc/implementors/bitflags/__core/fmt/trait.Octal.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/fmt/trait.Octal.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/fmt/trait.Pointer.js b/doc/implementors/bitflags/__core/fmt/trait.Pointer.js deleted file mode 100644 index 0e33c4a3..00000000 --- a/doc/implementors/bitflags/__core/fmt/trait.Pointer.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<T> Pointer for Box<T> where T: ?Sized","impl<T> Pointer for Rc<T> where T: ?Sized","impl<T> Pointer for Arc<T> where T: ?Sized",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/fmt/trait.UpperExp.js b/doc/implementors/bitflags/__core/fmt/trait.UpperExp.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/fmt/trait.UpperExp.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/fmt/trait.UpperHex.js b/doc/implementors/bitflags/__core/fmt/trait.UpperHex.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/fmt/trait.UpperHex.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/fmt/trait.Write.js b/doc/implementors/bitflags/__core/fmt/trait.Write.js deleted file mode 100644 index e0debaf7..00000000 --- a/doc/implementors/bitflags/__core/fmt/trait.Write.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl Write for String",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/hash/trait.BuildHasher.js b/doc/implementors/bitflags/__core/hash/trait.BuildHasher.js deleted file mode 100644 index 5fcee5d2..00000000 --- a/doc/implementors/bitflags/__core/hash/trait.BuildHasher.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl BuildHasher for RandomState",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/hash/trait.Hash.js b/doc/implementors/bitflags/__core/hash/trait.Hash.js deleted file mode 100644 index 85952ab9..00000000 --- a/doc/implementors/bitflags/__core/hash/trait.Hash.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<A> Hash for LinkedList<A> where A: Hash","impl<A> Hash for VecDeque<A> where A: Hash","impl Hash for CString","impl Hash for CStr","impl Hash for OsString","impl Hash for OsStr","impl Hash for FileType","impl Hash for IpAddr","impl Hash for Ipv6MulticastScope","impl Hash for Ipv4Addr","impl Hash for Ipv6Addr","impl Hash for SocketAddr","impl Hash for SocketAddrV4","impl Hash for SocketAddrV6","impl<'a> Hash for Prefix<'a>","impl<'a> Hash for PrefixComponent<'a>","impl<'a> Hash for Component<'a>","impl Hash for PathBuf","impl Hash for Path","impl Hash for Duration","impl<T> Hash for Vec<T> where T: Hash","impl<T> Hash for Box<T> where T: Hash + ?Sized","impl<T> Hash for Rc<T> where T: Hash + ?Sized","impl Hash for String","impl<'a, B> Hash for Cow<'a, B> where B: Hash + ToOwned + ?Sized","impl<K, V> Hash for BTreeMap<K, V> where K: Hash, V: Hash","impl<T> Hash for BTreeSet<T> where T: Hash","impl<E> Hash for EnumSet<E> where E: Hash","impl<T> Hash for Bound<T> where T: Hash","impl<T> Hash for Arc<T> where T: Hash + ?Sized",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/hash/trait.Hasher.js b/doc/implementors/bitflags/__core/hash/trait.Hasher.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/hash/trait.Hasher.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/io/trait.BufRead.js b/doc/implementors/bitflags/__core/io/trait.BufRead.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/io/trait.BufRead.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/io/trait.Read.js b/doc/implementors/bitflags/__core/io/trait.Read.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/io/trait.Read.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/io/trait.Seek.js b/doc/implementors/bitflags/__core/io/trait.Seek.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/io/trait.Seek.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/io/trait.Write.js b/doc/implementors/bitflags/__core/io/trait.Write.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/io/trait.Write.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/iter/trait.DoubleEndedIterator.js b/doc/implementors/bitflags/__core/iter/trait.DoubleEndedIterator.js deleted file mode 100644 index 9be8f93c..00000000 --- a/doc/implementors/bitflags/__core/iter/trait.DoubleEndedIterator.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl DoubleEndedIterator for EscapeDefault","impl<'a, A> DoubleEndedIterator for Iter<'a, A>","impl<'a, A> DoubleEndedIterator for IterMut<'a, A>","impl<A> DoubleEndedIterator for IntoIter<A>","impl<'a, T> DoubleEndedIterator for Iter<'a, T>","impl<'a, T> DoubleEndedIterator for IterMut<'a, T>","impl<T> DoubleEndedIterator for IntoIter<T>","impl<'a, T> DoubleEndedIterator for Drain<'a, T> where T: 'a","impl<'a, T> DoubleEndedIterator for Iter<'a, T>","impl<T> DoubleEndedIterator for IntoIter<T>","impl<'a, T> DoubleEndedIterator for Drain<'a, T> where T: 'a","impl<'a> DoubleEndedIterator for Iter<'a>","impl<'a> DoubleEndedIterator for Components<'a>","impl<T> DoubleEndedIterator for IntoIter<T>","impl<'a, T> DoubleEndedIterator for Drain<'a, T>","impl<I> DoubleEndedIterator for Box<I> where I: DoubleEndedIterator + ?Sized","impl<'a> DoubleEndedIterator for Drain<'a>","impl<'a, K, V> DoubleEndedIterator for Iter<'a, K, V> where V: 'a, K: 'a","impl<'a, K, V> DoubleEndedIterator for IterMut<'a, K, V> where V: 'a, K: 'a","impl<K, V> DoubleEndedIterator for IntoIter<K, V>","impl<'a, K, V> DoubleEndedIterator for Keys<'a, K, V>","impl<'a, K, V> DoubleEndedIterator for Values<'a, K, V>","impl<'a, K, V> DoubleEndedIterator for ValuesMut<'a, K, V>","impl<'a, K, V> DoubleEndedIterator for Range<'a, K, V>","impl<'a, K, V> DoubleEndedIterator for RangeMut<'a, K, V>","impl<'a, T> DoubleEndedIterator for Iter<'a, T>","impl<T> DoubleEndedIterator for IntoIter<T>","impl<'a, T> DoubleEndedIterator for Range<'a, T>","impl<'a> DoubleEndedIterator for SplitWhitespace<'a>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/iter/trait.ExactSizeIterator.js b/doc/implementors/bitflags/__core/iter/trait.ExactSizeIterator.js deleted file mode 100644 index 2ce33a0a..00000000 --- a/doc/implementors/bitflags/__core/iter/trait.ExactSizeIterator.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl ExactSizeIterator for EscapeDefault","impl<'a, K, V> ExactSizeIterator for Iter<'a, K, V>","impl<'a, K, V> ExactSizeIterator for IterMut<'a, K, V>","impl<K, V> ExactSizeIterator for IntoIter<K, V>","impl<'a, K, V> ExactSizeIterator for Keys<'a, K, V>","impl<'a, K, V> ExactSizeIterator for Values<'a, K, V>","impl<'a, K, V> ExactSizeIterator for ValuesMut<'a, K, V>","impl<'a, K, V> ExactSizeIterator for Drain<'a, K, V>","impl<'a, K> ExactSizeIterator for Iter<'a, K>","impl<K> ExactSizeIterator for IntoIter<K>","impl<'a, K> ExactSizeIterator for Drain<'a, K>","impl<'a, A> ExactSizeIterator for Iter<'a, A>","impl<'a, A> ExactSizeIterator for IterMut<'a, A>","impl<A> ExactSizeIterator for IntoIter<A>","impl<'a, T> ExactSizeIterator for Iter<'a, T>","impl<'a, T> ExactSizeIterator for IterMut<'a, T>","impl<T> ExactSizeIterator for IntoIter<T>","impl<'a, T> ExactSizeIterator for Drain<'a, T> where T: 'a","impl<'a, T> ExactSizeIterator for Iter<'a, T>","impl<T> ExactSizeIterator for IntoIter<T>","impl<'a, T> ExactSizeIterator for Drain<'a, T> where T: 'a","impl ExactSizeIterator for Args","impl ExactSizeIterator for ArgsOs","impl<T> ExactSizeIterator for IntoIter<T>","impl<'a, T> ExactSizeIterator for Drain<'a, T>","impl<I> ExactSizeIterator for Box<I> where I: ExactSizeIterator + ?Sized","impl<'a, K, V> ExactSizeIterator for Iter<'a, K, V> where V: 'a, K: 'a","impl<'a, K, V> ExactSizeIterator for IterMut<'a, K, V> where K: 'a, V: 'a","impl<K, V> ExactSizeIterator for IntoIter<K, V>","impl<'a, K, V> ExactSizeIterator for Keys<'a, K, V>","impl<'a, K, V> ExactSizeIterator for Values<'a, K, V>","impl<'a, K, V> ExactSizeIterator for ValuesMut<'a, K, V>","impl<'a, T> ExactSizeIterator for Iter<'a, T>","impl<T> ExactSizeIterator for IntoIter<T>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/iter/trait.Extend.js b/doc/implementors/bitflags/__core/iter/trait.Extend.js deleted file mode 100644 index 64a8bec8..00000000 --- a/doc/implementors/bitflags/__core/iter/trait.Extend.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<K, V, S> Extend<(K, V)> for HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher","impl<'a, K, V, S> Extend<(&'a K, &'a V)> for HashMap<K, V, S> where V: Copy, K: Eq + Hash + Copy, S: BuildHasher","impl<T, S> Extend<T> for HashSet<T, S> where S: BuildHasher, T: Eq + Hash","impl<'a, T, S> Extend<&'a T> for HashSet<T, S> where S: BuildHasher, T: 'a + Eq + Hash + Copy","impl<A> Extend<A> for LinkedList<A>","impl<'a, T> Extend<&'a T> for LinkedList<T> where T: Copy + 'a","impl<A> Extend<A> for VecDeque<A>","impl<'a, T> Extend<&'a T> for VecDeque<T> where T: Copy + 'a","impl<T> Extend<T> for BinaryHeap<T> where T: Ord","impl<'a, T> Extend<&'a T> for BinaryHeap<T> where T: Copy + 'a + Ord","impl<P> Extend<P> for PathBuf where P: AsRef<Path>","impl<T> Extend<T> for Vec<T>","impl<'a, T> Extend<&'a T> for Vec<T> where T: Copy + 'a","impl Extend<char> for String","impl<'a> Extend<&'a char> for String","impl<'a> Extend<&'a str> for String","impl Extend<String> for String","impl<K, V> Extend<(K, V)> for BTreeMap<K, V> where K: Ord","impl<'a, K, V> Extend<(&'a K, &'a V)> for BTreeMap<K, V> where K: Copy + Ord, V: Copy","impl<T> Extend<T> for BTreeSet<T> where T: Ord","impl<'a, T> Extend<&'a T> for BTreeSet<T> where T: Copy + 'a + Ord","impl<E> Extend<E> for EnumSet<E> where E: CLike","impl<'a, E> Extend<&'a E> for EnumSet<E> where E: Copy + 'a + CLike",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/iter/trait.FromIterator.js b/doc/implementors/bitflags/__core/iter/trait.FromIterator.js deleted file mode 100644 index 19568c9e..00000000 --- a/doc/implementors/bitflags/__core/iter/trait.FromIterator.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<K, V, S> FromIterator<(K, V)> for HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher + Default","impl<T, S> FromIterator<T> for HashSet<T, S> where T: Eq + Hash, S: BuildHasher + Default","impl<A> FromIterator<A> for LinkedList<A>","impl<A> FromIterator<A> for VecDeque<A>","impl<T> FromIterator<T> for BinaryHeap<T> where T: Ord","impl<P> FromIterator<P> for PathBuf where P: AsRef<Path>","impl<T> FromIterator<T> for Vec<T>","impl<'a, T> FromIterator<T> for Cow<'a, [T]> where T: Clone","impl FromIterator<char> for String","impl<'a> FromIterator<&'a str> for String","impl FromIterator<String> for String","impl<K, V> FromIterator<(K, V)> for BTreeMap<K, V> where K: Ord","impl<T> FromIterator<T> for BTreeSet<T> where T: Ord","impl<E> FromIterator<E> for EnumSet<E> where E: CLike",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/iter/trait.IntoIterator.js b/doc/implementors/bitflags/__core/iter/trait.IntoIterator.js deleted file mode 100644 index 20c1ebbd..00000000 --- a/doc/implementors/bitflags/__core/iter/trait.IntoIterator.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S> where K: Eq + Hash, S: BuildHasher","impl<'a, K, V, S> IntoIterator for &'a mut HashMap<K, V, S> where S: BuildHasher, K: Eq + Hash","impl<K, V, S> IntoIterator for HashMap<K, V, S> where S: BuildHasher, K: Eq + Hash","impl<'a, T, S> IntoIterator for &'a HashSet<T, S> where S: BuildHasher, T: Eq + Hash","impl<T, S> IntoIterator for HashSet<T, S> where T: Eq + Hash, S: BuildHasher","impl<T> IntoIterator for LinkedList<T>","impl<'a, T> IntoIterator for &'a LinkedList<T>","impl<'a, T> IntoIterator for &'a mut LinkedList<T>","impl<T> IntoIterator for VecDeque<T>","impl<'a, T> IntoIterator for &'a VecDeque<T>","impl<'a, T> IntoIterator for &'a mut VecDeque<T>","impl<T> IntoIterator for BinaryHeap<T> where T: Ord","impl<'a, T> IntoIterator for &'a BinaryHeap<T> where T: Ord","impl<'a> IntoIterator for &'a UnixListener","impl<'a> IntoIterator for &'a PathBuf","impl<'a> IntoIterator for &'a Path","impl<'a, T> IntoIterator for &'a Receiver<T>","impl<T> IntoIterator for Receiver<T>","impl<T> IntoIterator for Vec<T>","impl<'a, T> IntoIterator for &'a Vec<T>","impl<'a, T> IntoIterator for &'a mut Vec<T>","impl<'a, K, V> IntoIterator for &'a BTreeMap<K, V> where K: 'a, V: 'a","impl<'a, K, V> IntoIterator for &'a mut BTreeMap<K, V> where V: 'a, K: 'a","impl<K, V> IntoIterator for BTreeMap<K, V>","impl<T> IntoIterator for BTreeSet<T>","impl<'a, T> IntoIterator for &'a BTreeSet<T>","impl<'a, E> IntoIterator for &'a EnumSet<E> where E: CLike",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/iter/trait.Iterator.js b/doc/implementors/bitflags/__core/iter/trait.Iterator.js deleted file mode 100644 index 46dbdb74..00000000 --- a/doc/implementors/bitflags/__core/iter/trait.Iterator.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl Iterator for EscapeDefault","impl<'a, K, V> Iterator for Iter<'a, K, V>","impl<'a, K, V> Iterator for IterMut<'a, K, V>","impl<K, V> Iterator for IntoIter<K, V>","impl<'a, K, V> Iterator for Keys<'a, K, V>","impl<'a, K, V> Iterator for Values<'a, K, V>","impl<'a, K, V> Iterator for ValuesMut<'a, K, V>","impl<'a, K, V> Iterator for Drain<'a, K, V>","impl<'a, K> Iterator for Iter<'a, K>","impl<K> Iterator for IntoIter<K>","impl<'a, K> Iterator for Drain<'a, K>","impl<'a, T, S> Iterator for Intersection<'a, T, S> where T: Eq + Hash, S: BuildHasher","impl<'a, T, S> Iterator for Difference<'a, T, S> where S: BuildHasher, T: Eq + Hash","impl<'a, T, S> Iterator for SymmetricDifference<'a, T, S> where S: BuildHasher, T: Eq + Hash","impl<'a, T, S> Iterator for Union<'a, T, S> where S: BuildHasher, T: Eq + Hash","impl<'a, A> Iterator for Iter<'a, A>","impl<'a, A> Iterator for IterMut<'a, A>","impl<A> Iterator for IntoIter<A>","impl<'a, T> Iterator for Iter<'a, T>","impl<'a, T> Iterator for IterMut<'a, T>","impl<T> Iterator for IntoIter<T>","impl<'a, T> Iterator for Drain<'a, T> where T: 'a","impl<'a, T> Iterator for Iter<'a, T>","impl<T> Iterator for IntoIter<T>","impl<'a, T> Iterator for Drain<'a, T> where T: 'a","impl Iterator for Vars","impl Iterator for VarsOs","impl<'a> Iterator for SplitPaths<'a>","impl Iterator for Args","impl Iterator for ArgsOs","impl Iterator for ReadDir","impl<R> Iterator for Bytes<R> where R: Read","impl<R> Iterator for Chars<R> where R: Read","impl<B> Iterator for Split<B> where B: BufRead","impl<B> Iterator for Lines<B> where B: BufRead","impl<'a> Iterator for Incoming<'a>","impl Iterator for LookupHost","impl<'a> Iterator for Incoming<'a>","impl<'a> Iterator for Iter<'a>","impl<'a> Iterator for Components<'a>","impl<'a, T> Iterator for Iter<'a, T>","impl<T> Iterator for IntoIter<T>","impl<T> Iterator for IntoIter<T>","impl<'a, T> Iterator for Drain<'a, T>","impl<I> Iterator for Box<I> where I: Iterator + ?Sized","impl Iterator for ToLowercase","impl Iterator for ToUppercase","impl<I> Iterator for DecodeUtf16<I> where I: Iterator<Item=u16>","impl<'a> Iterator for EncodeUtf16<'a>","impl<'a> Iterator for Drain<'a>","impl<'a, K, V> Iterator for Iter<'a, K, V> where K: 'a, V: 'a","impl<'a, K, V> Iterator for IterMut<'a, K, V> where K: 'a, V: 'a","impl<K, V> Iterator for IntoIter<K, V>","impl<'a, K, V> Iterator for Keys<'a, K, V>","impl<'a, K, V> Iterator for Values<'a, K, V>","impl<'a, K, V> Iterator for Range<'a, K, V>","impl<'a, K, V> Iterator for ValuesMut<'a, K, V>","impl<'a, K, V> Iterator for RangeMut<'a, K, V>","impl<'a, T> Iterator for Iter<'a, T>","impl<T> Iterator for IntoIter<T>","impl<'a, T> Iterator for Range<'a, T>","impl<'a, T> Iterator for Difference<'a, T> where T: Ord","impl<'a, T> Iterator for SymmetricDifference<'a, T> where T: Ord","impl<'a, T> Iterator for Intersection<'a, T> where T: Ord","impl<'a, T> Iterator for Union<'a, T> where T: Ord","impl<E> Iterator for Iter<E> where E: CLike","impl<'a, T, R> Iterator for Generator<'a, T, R> where T: Rand, R: Rng","impl<'a, R> Iterator for AsciiGenerator<'a, R> where R: Rng","impl<I> Iterator for Utf16Encoder<I> where I: Iterator<Item=char>","impl<'a> Iterator for SplitWhitespace<'a>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/iter/trait.Step.js b/doc/implementors/bitflags/__core/iter/trait.Step.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/iter/trait.Step.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/marker/trait.Copy.js b/doc/implementors/bitflags/__core/marker/trait.Copy.js deleted file mode 100644 index b56629a8..00000000 --- a/doc/implementors/bitflags/__core/marker/trait.Copy.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl Copy for LocalKeyState","impl Copy for FileType","impl Copy for ErrorKind","impl Copy for SeekFrom","impl Copy for IpAddr","impl Copy for Ipv4Addr","impl Copy for Ipv6Addr","impl Copy for Ipv6MulticastScope","impl Copy for SocketAddr","impl Copy for SocketAddrV4","impl Copy for SocketAddrV6","impl Copy for Shutdown","impl<'a> Copy for Prefix<'a>","impl<'a> Copy for PrefixComponent<'a>","impl<'a> Copy for Component<'a>","impl Copy for ExitStatus","impl<T> Copy for SendError<T> where T: Copy","impl Copy for RecvError","impl Copy for TryRecvError","impl<T> Copy for TrySendError<T> where T: Copy","impl Copy for WaitTimeoutResult","impl Copy for Duration","impl Copy for Instant","impl Copy for SystemTime","impl Copy for utimbuf","impl Copy for timeval","impl Copy for timespec","impl Copy for rlimit","impl Copy for rusage","impl Copy for in_addr","impl Copy for in6_addr","impl Copy for ip_mreq","impl Copy for ipv6_mreq","impl Copy for hostent","impl Copy for iovec","impl Copy for pollfd","impl Copy for winsize","impl Copy for sockaddr","impl Copy for sockaddr_in6","impl Copy for sockaddr_un","impl Copy for passwd","impl Copy for ifaddrs","impl Copy for fd_set","impl Copy for tm","impl Copy for utsname","impl Copy for msghdr","impl Copy for fsid_t","impl Copy for glob_t","impl Copy for sockaddr_storage","impl Copy for addrinfo","impl Copy for mach_timebase_info","impl Copy for stat","impl Copy for dirent","impl Copy for pthread_mutex_t","impl Copy for pthread_mutexattr_t","impl Copy for pthread_cond_t","impl Copy for pthread_rwlock_t","impl Copy for siginfo_t","impl Copy for sigaction","impl Copy for stack_t","impl Copy for fstore_t","impl Copy for radvisory","impl Copy for statvfs","impl Copy for Dl_info","impl Copy for sockaddr_in","impl Copy for statfs","impl Copy for kevent","impl Copy for kevent64_s","impl Copy for dqblk","impl Copy for termios","impl Copy for flock","impl Copy for sf_hdtr","impl Copy for lconv","impl Copy for pthread_attr_t","impl Copy for ExchangeHeapSingleton","impl Copy for ParseError","impl<E> Copy for EnumSet<E>","impl<T> Copy for Bound<T> where T: Copy","impl Copy for StandardNormal","impl Copy for Normal","impl Copy for LogNormal","impl Copy for Exp1","impl Copy for Exp","impl Copy for IsaacRng","impl Copy for Isaac64Rng","impl Copy for ChaChaRng","impl Copy for ReseedWithDefault",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/marker/trait.Send.js b/doc/implementors/bitflags/__core/marker/trait.Send.js deleted file mode 100644 index 5663ab0c..00000000 --- a/doc/implementors/bitflags/__core/marker/trait.Send.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<'a, T> Send for Drain<'a, T> where T: Send","impl !Send for Select","impl<T> Send for Receiver<T> where T: Send","impl<T> Send for Sender<T> where T: Send","impl<T> Send for SyncSender<T> where T: Send","impl<T> Send for Mutex<T> where T: Send + ?Sized","impl<'a, T> !Send for MutexGuard<'a, T> where T: ?Sized","impl Send for Once","impl<T> Send for RwLock<T> where T: Send + Sync + ?Sized","impl<'a, T> !Send for RwLockReadGuard<'a, T> where T: ?Sized","impl<'a, T> !Send for RwLockWriteGuard<'a, T> where T: ?Sized","impl<T> Send for IntoIter<T> where T: Send","impl<'a, T> Send for Drain<'a, T> where T: Send","impl<T> !Send for Rc<T> where T: ?Sized","impl<T> !Send for Weak<T> where T: ?Sized","impl<'a> Send for Drain<'a>","impl<T> Send for Arc<T> where T: Send + Sync + ?Sized","impl<T> Send for Weak<T> where T: Send + Sync + ?Sized",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/marker/trait.Sync.js b/doc/implementors/bitflags/__core/marker/trait.Sync.js deleted file mode 100644 index bbc187fe..00000000 --- a/doc/implementors/bitflags/__core/marker/trait.Sync.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<T> Sync for Key<T>","impl<T> Sync for Key<T>","impl<T> Sync for KeyInner<T>","impl<'a, T> Sync for Drain<'a, T> where T: Sync","impl<T> !Sync for Receiver<T>","impl<T> !Sync for Sender<T>","impl<T> !Sync for SyncSender<T>","impl<T> Sync for Mutex<T> where T: Send + ?Sized","impl Sync for Once","impl<T> Sync for RwLock<T> where T: Send + Sync + ?Sized","impl<T> Sync for IntoIter<T> where T: Sync","impl<'a, T> Sync for Drain<'a, T> where T: Sync","impl<T> !Sync for Rc<T> where T: ?Sized","impl<T> !Sync for Weak<T> where T: ?Sized","impl<'a> Sync for Drain<'a>","impl<T> Sync for Arc<T> where T: Send + Sync + ?Sized","impl<T> Sync for Weak<T> where T: Send + Sync + ?Sized",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/net/trait.ToSocketAddrs.js b/doc/implementors/bitflags/__core/net/trait.ToSocketAddrs.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/net/trait.ToSocketAddrs.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/num/trait.One.js b/doc/implementors/bitflags/__core/num/trait.One.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/num/trait.One.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/num/trait.Zero.js b/doc/implementors/bitflags/__core/num/trait.Zero.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/num/trait.Zero.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Add.js b/doc/implementors/bitflags/__core/ops/trait.Add.js deleted file mode 100644 index 0f4d939a..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Add.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl Add<Duration> for Duration","impl Add<Duration> for Instant","impl Add<Duration> for SystemTime","impl<'a> Add<&'a str> for String",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.AddAssign.js b/doc/implementors/bitflags/__core/ops/trait.AddAssign.js deleted file mode 100644 index 273c3edc..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.AddAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl AddAssign<Duration> for Duration","impl AddAssign<Duration> for Instant","impl AddAssign<Duration> for SystemTime",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.BitAnd.js b/doc/implementors/bitflags/__core/ops/trait.BitAnd.js deleted file mode 100644 index f0d3229f..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.BitAnd.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<'a, 'b, T, S> BitAnd<&'b HashSet<T, S>> for &'a HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash + Clone","impl<'a, 'b, T> BitAnd<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone","impl<E> BitAnd<EnumSet<E>> for EnumSet<E> where E: CLike",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.BitAndAssign.js b/doc/implementors/bitflags/__core/ops/trait.BitAndAssign.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.BitAndAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.BitOr.js b/doc/implementors/bitflags/__core/ops/trait.BitOr.js deleted file mode 100644 index 499a37e4..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.BitOr.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<'a, 'b, T, S> BitOr<&'b HashSet<T, S>> for &'a HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash + Clone","impl<'a, 'b, T> BitOr<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone","impl<E> BitOr<EnumSet<E>> for EnumSet<E> where E: CLike",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.BitOrAssign.js b/doc/implementors/bitflags/__core/ops/trait.BitOrAssign.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.BitOrAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.BitXor.js b/doc/implementors/bitflags/__core/ops/trait.BitXor.js deleted file mode 100644 index 767b70cf..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.BitXor.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<'a, 'b, T, S> BitXor<&'b HashSet<T, S>> for &'a HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash + Clone","impl<'a, 'b, T> BitXor<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone","impl<E> BitXor<EnumSet<E>> for EnumSet<E> where E: CLike",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.BitXorAssign.js b/doc/implementors/bitflags/__core/ops/trait.BitXorAssign.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.BitXorAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.BoxPlace.js b/doc/implementors/bitflags/__core/ops/trait.BoxPlace.js deleted file mode 100644 index 25febd0e..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.BoxPlace.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<T> BoxPlace<T> for IntermediateBox<T>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Boxed.js b/doc/implementors/bitflags/__core/ops/trait.Boxed.js deleted file mode 100644 index c98fee84..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Boxed.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<T> Boxed for Box<T>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.CoerceUnsized.js b/doc/implementors/bitflags/__core/ops/trait.CoerceUnsized.js deleted file mode 100644 index 7334247b..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.CoerceUnsized.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<T, U> CoerceUnsized<Box<U>> for Box<T> where T: Unsize<U> + ?Sized, U: ?Sized","impl<T, U> CoerceUnsized<Rc<U>> for Rc<T> where U: ?Sized, T: Unsize<U> + ?Sized","impl<T, U> CoerceUnsized<Weak<U>> for Weak<T> where U: ?Sized, T: Unsize<U> + ?Sized","impl<T, U> CoerceUnsized<Arc<U>> for Arc<T> where U: ?Sized, T: Unsize<U> + ?Sized","impl<T, U> CoerceUnsized<Weak<U>> for Weak<T> where T: Unsize<U> + ?Sized, U: ?Sized",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Deref.js b/doc/implementors/bitflags/__core/ops/trait.Deref.js deleted file mode 100644 index bf4165a4..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Deref.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl Deref for CString","impl Deref for OsString","impl<T> Deref for AssertUnwindSafe<T>","impl<T> Deref for AssertRecoverSafe<T>","impl Deref for PathBuf","impl<'mutex, T> Deref for MutexGuard<'mutex, T> where T: ?Sized","impl<'rwlock, T> Deref for RwLockReadGuard<'rwlock, T> where T: ?Sized","impl<'rwlock, T> Deref for RwLockWriteGuard<'rwlock, T> where T: ?Sized","impl<T> Deref for Vec<T>","impl<T> Deref for Box<T> where T: ?Sized","impl<T> Deref for Rc<T> where T: ?Sized","impl Deref for String","impl<'a, B> Deref for Cow<'a, B> where B: ToOwned + ?Sized","impl<T> Deref for Arc<T> where T: ?Sized",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.DerefMut.js b/doc/implementors/bitflags/__core/ops/trait.DerefMut.js deleted file mode 100644 index a4dd29a8..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.DerefMut.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<T> DerefMut for AssertUnwindSafe<T>","impl<T> DerefMut for AssertRecoverSafe<T>","impl<'mutex, T> DerefMut for MutexGuard<'mutex, T> where T: ?Sized","impl<'rwlock, T> DerefMut for RwLockWriteGuard<'rwlock, T> where T: ?Sized","impl<T> DerefMut for Vec<T>","impl<T> DerefMut for Box<T> where T: ?Sized","impl DerefMut for String",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Div.js b/doc/implementors/bitflags/__core/ops/trait.Div.js deleted file mode 100644 index 0e666a02..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Div.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl Div<u32> for Duration",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.DivAssign.js b/doc/implementors/bitflags/__core/ops/trait.DivAssign.js deleted file mode 100644 index b79c87e7..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.DivAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl DivAssign<u32> for Duration",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Drop.js b/doc/implementors/bitflags/__core/ops/trait.Drop.js deleted file mode 100644 index c9ac9c88..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Drop.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<T> Drop for LinkedList<T>","impl<T> Drop for VecDeque<T>","impl<'a, T> Drop for Drain<'a, T> where T: 'a","impl<W> Drop for BufWriter<W> where W: Write","impl Drop for Select","impl<'rx, T> Drop for Handle<'rx, T> where T: Send","impl<T> Drop for Sender<T>","impl<T> Drop for SyncSender<T>","impl<T> Drop for Receiver<T>","impl Drop for Condvar","impl<T> Drop for Mutex<T> where T: ?Sized","impl<'a, T> Drop for MutexGuard<'a, T> where T: ?Sized","impl<T> Drop for RwLock<T> where T: ?Sized","impl<'a, T> Drop for RwLockReadGuard<'a, T> where T: ?Sized","impl<'a, T> Drop for RwLockWriteGuard<'a, T> where T: ?Sized","impl<T> Drop for Vec<T>","impl<T> Drop for IntoIter<T>","impl<'a, T> Drop for Drain<'a, T>","impl<T> Drop for IntermediateBox<T> where T: ?Sized","impl<T> Drop for Rc<T> where T: ?Sized","impl<T> Drop for Weak<T> where T: ?Sized","impl<'a> Drop for Drain<'a>","impl<K, V> Drop for BTreeMap<K, V>","impl<K, V> Drop for IntoIter<K, V>","impl<T> Drop for Arc<T> where T: ?Sized","impl<T> Drop for Weak<T> where T: ?Sized","impl<T> Drop for RawVec<T>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Fn.js b/doc/implementors/bitflags/__core/ops/trait.Fn.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Fn.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.FnMut.js b/doc/implementors/bitflags/__core/ops/trait.FnMut.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.FnMut.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.FnOnce.js b/doc/implementors/bitflags/__core/ops/trait.FnOnce.js deleted file mode 100644 index f24c22b7..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.FnOnce.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<R, F> FnOnce() for AssertUnwindSafe<F> where F: FnOnce() -> R","impl<R, F> FnOnce() for AssertRecoverSafe<F> where F: FnOnce() -> R","impl<'a, A, R> FnOnce<A> for Box<FnBox<A, Output=R> + 'a>","impl<'a, A, R> FnOnce<A> for Box<FnBox<A, Output=R> + 'a + Send>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.InPlace.js b/doc/implementors/bitflags/__core/ops/trait.InPlace.js deleted file mode 100644 index cdaa75ab..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.InPlace.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<'a, T> InPlace<T> for FrontPlace<'a, T>","impl<'a, T> InPlace<T> for BackPlace<'a, T>","impl<T> InPlace<T> for IntermediateBox<T>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Index.js b/doc/implementors/bitflags/__core/ops/trait.Index.js deleted file mode 100644 index e84d1e19..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Index.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<'a, K, Q, V, S> Index<&'a Q> for HashMap<K, V, S> where Q: Eq + Hash + ?Sized, S: BuildHasher, K: Eq + Hash + Borrow<Q>","impl<A> Index<usize> for VecDeque<A>","impl Index<RangeFull> for CString","impl Index<RangeFull> for OsString","impl<T> Index<usize> for Vec<T>","impl<T> Index<Range<usize>> for Vec<T>","impl<T> Index<RangeTo<usize>> for Vec<T>","impl<T> Index<RangeFrom<usize>> for Vec<T>","impl<T> Index<RangeFull> for Vec<T>","impl<T> Index<RangeInclusive<usize>> for Vec<T>","impl<T> Index<RangeToInclusive<usize>> for Vec<T>","impl Index<Range<usize>> for String","impl Index<RangeTo<usize>> for String","impl Index<RangeFrom<usize>> for String","impl Index<RangeFull> for String","impl Index<RangeInclusive<usize>> for String","impl Index<RangeToInclusive<usize>> for String","impl<'a, K, Q, V> Index<&'a Q> for BTreeMap<K, V> where Q: Ord + ?Sized, K: Ord + Borrow<Q>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.IndexMut.js b/doc/implementors/bitflags/__core/ops/trait.IndexMut.js deleted file mode 100644 index 5d6da193..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.IndexMut.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<A> IndexMut<usize> for VecDeque<A>","impl<T> IndexMut<usize> for Vec<T>","impl<T> IndexMut<Range<usize>> for Vec<T>","impl<T> IndexMut<RangeTo<usize>> for Vec<T>","impl<T> IndexMut<RangeFrom<usize>> for Vec<T>","impl<T> IndexMut<RangeFull> for Vec<T>","impl<T> IndexMut<RangeInclusive<usize>> for Vec<T>","impl<T> IndexMut<RangeToInclusive<usize>> for Vec<T>","impl IndexMut<Range<usize>> for String","impl IndexMut<RangeTo<usize>> for String","impl IndexMut<RangeFrom<usize>> for String","impl IndexMut<RangeFull> for String","impl IndexMut<RangeInclusive<usize>> for String","impl IndexMut<RangeToInclusive<usize>> for String",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Mul.js b/doc/implementors/bitflags/__core/ops/trait.Mul.js deleted file mode 100644 index c15b48b3..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Mul.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl Mul<u32> for Duration",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.MulAssign.js b/doc/implementors/bitflags/__core/ops/trait.MulAssign.js deleted file mode 100644 index 386a6f52..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.MulAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl MulAssign<u32> for Duration",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Neg.js b/doc/implementors/bitflags/__core/ops/trait.Neg.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Neg.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Not.js b/doc/implementors/bitflags/__core/ops/trait.Not.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Not.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Place.js b/doc/implementors/bitflags/__core/ops/trait.Place.js deleted file mode 100644 index 7414ceda..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Place.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<'a, T> Place<T> for FrontPlace<'a, T>","impl<'a, T> Place<T> for BackPlace<'a, T>","impl<T> Place<T> for IntermediateBox<T>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Placer.js b/doc/implementors/bitflags/__core/ops/trait.Placer.js deleted file mode 100644 index e4435c11..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Placer.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<'a, T> Placer<T> for FrontPlace<'a, T>","impl<'a, T> Placer<T> for BackPlace<'a, T>","impl<T> Placer<T> for ExchangeHeapSingleton",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Rem.js b/doc/implementors/bitflags/__core/ops/trait.Rem.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Rem.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.RemAssign.js b/doc/implementors/bitflags/__core/ops/trait.RemAssign.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.RemAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Shl.js b/doc/implementors/bitflags/__core/ops/trait.Shl.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Shl.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.ShlAssign.js b/doc/implementors/bitflags/__core/ops/trait.ShlAssign.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.ShlAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Shr.js b/doc/implementors/bitflags/__core/ops/trait.Shr.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Shr.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.ShrAssign.js b/doc/implementors/bitflags/__core/ops/trait.ShrAssign.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.ShrAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.Sub.js b/doc/implementors/bitflags/__core/ops/trait.Sub.js deleted file mode 100644 index 2a1e1c3e..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.Sub.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<'a, 'b, T, S> Sub<&'b HashSet<T, S>> for &'a HashSet<T, S> where S: BuildHasher + Default, T: Eq + Hash + Clone","impl Sub<Duration> for Duration","impl Sub<Duration> for Instant","impl Sub<Instant> for Instant","impl Sub<Duration> for SystemTime","impl<'a, 'b, T> Sub<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone","impl<E> Sub<EnumSet<E>> for EnumSet<E> where E: CLike",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/ops/trait.SubAssign.js b/doc/implementors/bitflags/__core/ops/trait.SubAssign.js deleted file mode 100644 index 0b526a70..00000000 --- a/doc/implementors/bitflags/__core/ops/trait.SubAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl SubAssign<Duration> for Duration","impl SubAssign<Duration> for Instant","impl SubAssign<Duration> for SystemTime",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/os/ext/fs/trait.DirBuilderExt.js b/doc/implementors/bitflags/__core/os/ext/fs/trait.DirBuilderExt.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/os/ext/fs/trait.DirBuilderExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/os/ext/prelude/trait.AsRawFd.js b/doc/implementors/bitflags/__core/os/ext/prelude/trait.AsRawFd.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/os/ext/prelude/trait.AsRawFd.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/os/ext/prelude/trait.CommandExt.js b/doc/implementors/bitflags/__core/os/ext/prelude/trait.CommandExt.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/os/ext/prelude/trait.CommandExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/os/ext/prelude/trait.DirEntryExt.js b/doc/implementors/bitflags/__core/os/ext/prelude/trait.DirEntryExt.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/os/ext/prelude/trait.DirEntryExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/os/ext/prelude/trait.ExitStatusExt.js b/doc/implementors/bitflags/__core/os/ext/prelude/trait.ExitStatusExt.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/os/ext/prelude/trait.ExitStatusExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/os/ext/prelude/trait.FileTypeExt.js b/doc/implementors/bitflags/__core/os/ext/prelude/trait.FileTypeExt.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/os/ext/prelude/trait.FileTypeExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/os/ext/prelude/trait.FromRawFd.js b/doc/implementors/bitflags/__core/os/ext/prelude/trait.FromRawFd.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/os/ext/prelude/trait.FromRawFd.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/os/ext/prelude/trait.IntoRawFd.js b/doc/implementors/bitflags/__core/os/ext/prelude/trait.IntoRawFd.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/os/ext/prelude/trait.IntoRawFd.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/os/ext/prelude/trait.JoinHandleExt.js b/doc/implementors/bitflags/__core/os/ext/prelude/trait.JoinHandleExt.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/os/ext/prelude/trait.JoinHandleExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/os/ext/prelude/trait.MetadataExt.js b/doc/implementors/bitflags/__core/os/ext/prelude/trait.MetadataExt.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/os/ext/prelude/trait.MetadataExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/os/ext/prelude/trait.OpenOptionsExt.js b/doc/implementors/bitflags/__core/os/ext/prelude/trait.OpenOptionsExt.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/os/ext/prelude/trait.OpenOptionsExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/os/ext/prelude/trait.OsStrExt.js b/doc/implementors/bitflags/__core/os/ext/prelude/trait.OsStrExt.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/os/ext/prelude/trait.OsStrExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/os/ext/prelude/trait.OsStringExt.js b/doc/implementors/bitflags/__core/os/ext/prelude/trait.OsStringExt.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/os/ext/prelude/trait.OsStringExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/os/ext/prelude/trait.PermissionsExt.js b/doc/implementors/bitflags/__core/os/ext/prelude/trait.PermissionsExt.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/os/ext/prelude/trait.PermissionsExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/os/macos/fs/trait.MetadataExt.js b/doc/implementors/bitflags/__core/os/macos/fs/trait.MetadataExt.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/os/macos/fs/trait.MetadataExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/panic/trait.RecoverSafe.js b/doc/implementors/bitflags/__core/panic/trait.RecoverSafe.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/panic/trait.RecoverSafe.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/panic/trait.RefUnwindSafe.js b/doc/implementors/bitflags/__core/panic/trait.RefUnwindSafe.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/panic/trait.RefUnwindSafe.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/panic/trait.UnwindSafe.js b/doc/implementors/bitflags/__core/panic/trait.UnwindSafe.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/panic/trait.UnwindSafe.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/raw/trait.Repr.js b/doc/implementors/bitflags/__core/raw/trait.Repr.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/raw/trait.Repr.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/slice/trait.SliceConcatExt.js b/doc/implementors/bitflags/__core/slice/trait.SliceConcatExt.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/slice/trait.SliceConcatExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/str/pattern/trait.DoubleEndedSearcher.js b/doc/implementors/bitflags/__core/str/pattern/trait.DoubleEndedSearcher.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/str/pattern/trait.DoubleEndedSearcher.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/str/pattern/trait.Pattern.js b/doc/implementors/bitflags/__core/str/pattern/trait.Pattern.js deleted file mode 100644 index 2c8c6488..00000000 --- a/doc/implementors/bitflags/__core/str/pattern/trait.Pattern.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl<'a, 'b> Pattern<'a> for &'b String",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/str/pattern/trait.ReverseSearcher.js b/doc/implementors/bitflags/__core/str/pattern/trait.ReverseSearcher.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/str/pattern/trait.ReverseSearcher.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/str/pattern/trait.Searcher.js b/doc/implementors/bitflags/__core/str/pattern/trait.Searcher.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/str/pattern/trait.Searcher.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/str/trait.FromStr.js b/doc/implementors/bitflags/__core/str/trait.FromStr.js deleted file mode 100644 index f5054631..00000000 --- a/doc/implementors/bitflags/__core/str/trait.FromStr.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = ["impl FromStr for IpAddr","impl FromStr for Ipv4Addr","impl FromStr for Ipv6Addr","impl FromStr for SocketAddrV4","impl FromStr for SocketAddrV6","impl FromStr for SocketAddr","impl FromStr for String",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/bitflags/__core/string/trait.ToString.js b/doc/implementors/bitflags/__core/string/trait.ToString.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/bitflags/__core/string/trait.ToString.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/byteorder/trait.ByteOrder.js b/doc/implementors/byteorder/trait.ByteOrder.js deleted file mode 100644 index 24602e10..00000000 --- a/doc/implementors/byteorder/trait.ByteOrder.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['byteorder'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/collections/borrow/trait.ToOwned.js b/doc/implementors/collections/borrow/trait.ToOwned.js deleted file mode 100644 index eadb6556..00000000 --- a/doc/implementors/collections/borrow/trait.ToOwned.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/collections/range/trait.RangeArgument.js b/doc/implementors/collections/range/trait.RangeArgument.js deleted file mode 100644 index 82e4e9d2..00000000 --- a/doc/implementors/collections/range/trait.RangeArgument.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = [];implementors['regex_syntax'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/collections/slice/trait.SliceConcatExt.js b/doc/implementors/collections/slice/trait.SliceConcatExt.js deleted file mode 100644 index eadb6556..00000000 --- a/doc/implementors/collections/slice/trait.SliceConcatExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/collections/string/trait.ToString.js b/doc/implementors/collections/string/trait.ToString.js deleted file mode 100644 index eadb6556..00000000 --- a/doc/implementors/collections/string/trait.ToString.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/any/trait.Any.js b/doc/implementors/core/any/trait.Any.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/any/trait.Any.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/array/trait.FixedSizeArray.js b/doc/implementors/core/array/trait.FixedSizeArray.js deleted file mode 100644 index 56e4546c..00000000 --- a/doc/implementors/core/array/trait.FixedSizeArray.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = [];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/borrow/trait.Borrow.js b/doc/implementors/core/borrow/trait.Borrow.js deleted file mode 100644 index 872810c4..00000000 --- a/doc/implementors/core/borrow/trait.Borrow.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<'a, B> Borrow<B> for Cow<'a, B> where B: ToOwned + ?Sized, B::Owned: 'a","impl<T> Borrow<[T]> for Vec<T>","impl Borrow<str> for String","impl<T> Borrow<T> for Box<T> where T: ?Sized",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/borrow/trait.BorrowMut.js b/doc/implementors/core/borrow/trait.BorrowMut.js deleted file mode 100644 index 957c682d..00000000 --- a/doc/implementors/core/borrow/trait.BorrowMut.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<T> BorrowMut<[T]> for Vec<T>","impl<T> BorrowMut<T> for Box<T> where T: ?Sized",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/clone/trait.Clone.js b/doc/implementors/core/clone/trait.Clone.js deleted file mode 100644 index 8a7ca24b..00000000 --- a/doc/implementors/core/clone/trait.Clone.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['vec_map'] = ["impl<V: Clone> Clone for VecMap<V>","impl<'a, V> Clone for Iter<'a, V>","impl<'a, V> Clone for Keys<'a, V>","impl<'a, V> Clone for Values<'a, V>",];implementors['utf8_ranges'] = ["impl Clone for Utf8Sequence","impl Clone for Utf8Range",];implementors['ansi_term'] = ["impl<'a> Clone for ANSIString<'a>","impl Clone for Colour","impl Clone for Style",];implementors['bit_vec'] = ["impl<B: BitBlock> Clone for BitVec<B>","impl<'a, B: Clone + 'a> Clone for Iter<'a, B>","impl<'a, B: Clone + 'a> Clone for Blocks<'a, B>",];implementors['variance'] = ["impl<T> Clone for Invariant<T>","impl<'id> Clone for InvariantLifetime<'id>",];implementors['crossbeam'] = ["impl<'a, T> Clone for Shared<'a, T>","impl<T> Clone for Stealer<T>",];implementors['scoped_pool'] = ["impl Clone for Pool",];implementors['regex_syntax'] = ["impl Clone for Literals","impl Clone for Lit","impl<T> Clone for BinaryHeap<T> where T: Clone","impl<'a, T> Clone for Iter<'a, T>","impl<T> Clone for IntoIter<T> where T: Clone","impl<K, V> Clone for BTreeMap<K, V> where K: Clone, V: Clone","impl<'a, K, V> Clone for Iter<'a, K, V>","impl<'a, K, V> Clone for Keys<'a, K, V>","impl<'a, K, V> Clone for Values<'a, K, V>","impl<'a, K, V> Clone for Range<'a, K, V>","impl<T> Clone for BTreeSet<T> where T: Clone","impl<'a, T> Clone for Iter<'a, T>","impl<'a, T> Clone for Range<'a, T>","impl<'a, T> Clone for Difference<'a, T>","impl<'a, T> Clone for SymmetricDifference<'a, T>","impl<'a, T> Clone for Intersection<'a, T>","impl<'a, T> Clone for Union<'a, T>","impl<'a, B> Clone for Cow<'a, B> where B: ToOwned + ?Sized","impl<E> Clone for EnumSet<E>","impl<E> Clone for Iter<E>","impl<'a, T> Clone for Iter<'a, T>","impl<T> Clone for IntoIter<T> where T: Clone","impl<A> Clone for LinkedList<A> where A: Clone","impl<'a> Clone for EncodeUtf16<'a>","impl Clone for String","impl Clone for ParseError","impl<T> Clone for Vec<T> where T: Clone","impl<T> Clone for IntoIter<T> where T: Clone","impl<T> Clone for VecDeque<T> where T: Clone","impl<'a, T> Clone for Iter<'a, T>","impl<T> Clone for IntoIter<T> where T: Clone","impl<T> Clone for Bound<T> where T: Clone","impl Clone for ExchangeHeapSingleton","impl<T> Clone for Box<T> where T: Clone","impl Clone for Box<str>","impl<T> Clone for Box<[T]> where T: Clone","impl Clone for Expr","impl Clone for Repeater","impl Clone for CharClass","impl Clone for ClassRange","impl Clone for ByteClass","impl Clone for ByteRange","impl Clone for ExprBuilder","impl Clone for Error","impl Clone for ErrorKind",];implementors['libc'] = ["impl Clone for pthread_attr_t","impl Clone for glob_t","impl Clone for sockaddr_storage","impl Clone for addrinfo","impl Clone for mach_timebase_info","impl Clone for stat","impl Clone for dirent","impl Clone for pthread_mutex_t","impl Clone for pthread_mutexattr_t","impl Clone for pthread_cond_t","impl Clone for pthread_rwlock_t","impl Clone for siginfo_t","impl Clone for sigaction","impl Clone for stack_t","impl Clone for fstore_t","impl Clone for radvisory","impl Clone for statvfs","impl Clone for Dl_info","impl Clone for sockaddr_in","impl Clone for statfs","impl Clone for kevent","impl Clone for kevent64_s","impl Clone for dqblk","impl Clone for termios","impl Clone for flock","impl Clone for sf_hdtr","impl Clone for lconv","impl Clone for sockaddr","impl Clone for sockaddr_in6","impl Clone for sockaddr_un","impl Clone for passwd","impl Clone for ifaddrs","impl Clone for fd_set","impl Clone for tm","impl Clone for utsname","impl Clone for msghdr","impl Clone for fsid_t","impl Clone for utimbuf","impl Clone for timeval","impl Clone for timespec","impl Clone for rlimit","impl Clone for rusage","impl Clone for in_addr","impl Clone for in6_addr","impl Clone for ip_mreq","impl Clone for ipv6_mreq","impl Clone for hostent","impl Clone for iovec","impl Clone for pollfd","impl Clone for winsize",];implementors['aho_corasick'] = ["impl Clone for Match","impl<P: Clone> Clone for FullAcAutomaton<P>","impl<P: Clone, T: Clone> Clone for AcAutomaton<P, T>","impl Clone for Dense","impl Clone for Sparse",];implementors['regex'] = ["impl Clone for Exec","impl Clone for InputAt","impl<'t> Clone for CharInput<'t>","impl Clone for Char","impl Clone for LiteralSearcher","impl Clone for Program","impl Clone for Inst","impl Clone for EmptyLook","impl Clone for InstRanges","impl Clone for Regex","impl Clone for RegexSet","impl Clone for SetMatches","impl<'a> Clone for SetMatchesIter<'a>","impl Clone for RegexSet","impl Clone for SetMatches","impl<'a> Clone for SetMatchesIter<'a>","impl Clone for Regex",];implementors['clap'] = ["impl Clone for AppSettings","impl<'a, 'b> Clone for App<'a, 'b>","impl<'a, 'b> Clone for Arg<'a, 'b>","impl<'a> Clone for ArgMatches<'a>","impl<'a> Clone for SubCommand<'a>","impl<'a> Clone for ArgGroup<'a>","impl Clone for ErrorKind",];implementors['oxipng'] = ["impl Clone for ColorType","impl Clone for BitDepth","impl Clone for Headers","impl<'a> Clone for ScanLines<'a>","impl Clone for ScanLine","impl Clone for PngData","impl Clone for IhdrData","impl Clone for Options",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/cmp/trait.Eq.js b/doc/implementors/core/cmp/trait.Eq.js deleted file mode 100644 index b4caa665..00000000 --- a/doc/implementors/core/cmp/trait.Eq.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['vec_map'] = ["impl<V: Eq> Eq for VecMap<V>",];implementors['utf8_ranges'] = ["impl Eq for Utf8Sequence","impl Eq for Utf8Range",];implementors['bit_vec'] = ["impl<B: BitBlock> Eq for BitVec<B>",];implementors['variance'] = ["impl<T> Eq for Invariant<T>","impl<'id> Eq for InvariantLifetime<'id>",];implementors['crossbeam'] = ["impl<'a, T: Eq + 'a> Eq for Shared<'a, T>","impl<T: Eq> Eq for Steal<T>",];implementors['regex_syntax'] = ["impl Eq for Literals","impl Eq for Lit","impl<K, V> Eq for BTreeMap<K, V> where K: Eq, V: Eq","impl<T> Eq for BTreeSet<T> where T: Eq","impl<'a, B> Eq for Cow<'a, B> where B: Eq + ToOwned + ?Sized","impl<E> Eq for EnumSet<E> where E: Eq","impl<A> Eq for LinkedList<A> where A: Eq","impl Eq for String","impl Eq for ParseError","impl<T> Eq for Vec<T> where T: Eq","impl<A> Eq for VecDeque<A> where A: Eq","impl<T> Eq for Bound<T> where T: Eq","impl<T> Eq for Box<T> where T: Eq + ?Sized","impl Eq for Expr","impl Eq for Repeater","impl Eq for CharClass","impl Eq for ClassRange","impl Eq for ByteClass","impl Eq for ByteRange",];implementors['libc'] = [];implementors['aho_corasick'] = ["impl Eq for Match",];implementors['regex'] = ["impl Eq for Char","impl Eq for EmptyLook","impl Eq for Regex",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/cmp/trait.Ord.js b/doc/implementors/core/cmp/trait.Ord.js deleted file mode 100644 index 294c0c58..00000000 --- a/doc/implementors/core/cmp/trait.Ord.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['vec_map'] = ["impl<V: Ord> Ord for VecMap<V>",];implementors['bit_vec'] = ["impl<B: BitBlock> Ord for BitVec<B>",];implementors['variance'] = ["impl<T> Ord for Invariant<T>","impl<'id> Ord for InvariantLifetime<'id>",];implementors['regex_syntax'] = ["impl Ord for Lit","impl<K, V> Ord for BTreeMap<K, V> where V: Ord, K: Ord","impl<T> Ord for BTreeSet<T> where T: Ord","impl<'a, B> Ord for Cow<'a, B> where B: Ord + ToOwned + ?Sized","impl<E> Ord for EnumSet<E> where E: Ord","impl<A> Ord for LinkedList<A> where A: Ord","impl Ord for String","impl<T> Ord for Vec<T> where T: Ord","impl<A> Ord for VecDeque<A> where A: Ord","impl<T> Ord for Box<T> where T: Ord + ?Sized","impl Ord for ClassRange","impl Ord for ByteRange",];implementors['libc'] = [];implementors['regex'] = ["impl Ord for Char",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/cmp/trait.PartialEq.js b/doc/implementors/core/cmp/trait.PartialEq.js deleted file mode 100644 index 5d0bf2bd..00000000 --- a/doc/implementors/core/cmp/trait.PartialEq.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['strsim'] = ["impl PartialEq for StrSimError",];implementors['vec_map'] = ["impl<V: PartialEq> PartialEq for VecMap<V>",];implementors['utf8_ranges'] = ["impl PartialEq for Utf8Sequence","impl PartialEq for Utf8Range",];implementors['ansi_term'] = ["impl<'a> PartialEq for ANSIString<'a>","impl PartialEq for Colour","impl PartialEq for Style",];implementors['bit_vec'] = ["impl<B: BitBlock> PartialEq for BitVec<B>",];implementors['variance'] = ["impl<T> PartialEq<Invariant<T>> for Invariant<T>","impl<'id> PartialEq for InvariantLifetime<'id>",];implementors['crossbeam'] = ["impl<'a, T: PartialEq + 'a> PartialEq for Shared<'a, T>","impl<T: PartialEq> PartialEq for Steal<T>",];implementors['regex_syntax'] = ["impl PartialEq for Literals","impl PartialEq for Lit","impl<K, V> PartialEq<BTreeMap<K, V>> for BTreeMap<K, V> where K: PartialEq<K>, V: PartialEq<V>","impl<T> PartialEq<BTreeSet<T>> for BTreeSet<T> where T: PartialEq<T>","impl<'a, 'b, B, C> PartialEq<Cow<'b, C>> for Cow<'a, B> where C: ToOwned + ?Sized, B: PartialEq<C> + ToOwned + ?Sized","impl<E> PartialEq<EnumSet<E>> for EnumSet<E> where E: PartialEq<E>","impl<A> PartialEq<LinkedList<A>> for LinkedList<A> where A: PartialEq<A>","impl PartialEq<String> for String","impl<'a, 'b> PartialEq<str> for String","impl<'a, 'b> PartialEq<String> for str","impl<'a, 'b> PartialEq<&'a str> for String","impl<'a, 'b> PartialEq<String> for &'a str","impl<'a, 'b> PartialEq<str> for Cow<'a, str>","impl<'a, 'b> PartialEq<Cow<'a, str>> for str","impl<'a, 'b> PartialEq<&'b str> for Cow<'a, str>","impl<'a, 'b> PartialEq<Cow<'a, str>> for &'b str","impl<'a, 'b> PartialEq<String> for Cow<'a, str>","impl<'a, 'b> PartialEq<Cow<'a, str>> for String","impl PartialEq<ParseError> for ParseError","impl<'a, 'b, A, B> PartialEq<Vec<B>> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b mut [B]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B]> for Cow<'a, [A]> where A: Clone + PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b mut [B]> for Cow<'a, [A]> where A: Clone + PartialEq<B>","impl<'a, 'b, A, B> PartialEq<Vec<B>> for Cow<'a, [A]> where A: Clone + PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 0]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 0]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 1]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 1]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 2]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 2]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 3]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 3]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 4]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 4]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 5]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 5]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 6]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 6]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 7]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 7]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 8]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 8]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 9]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 9]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 10]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 10]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 11]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 11]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 12]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 12]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 13]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 13]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 14]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 14]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 15]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 15]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 16]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 16]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 17]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 17]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 18]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 18]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 19]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 19]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 20]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 20]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 21]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 21]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 22]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 22]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 23]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 23]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 24]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 24]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 25]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 25]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 26]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 26]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 27]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 27]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 28]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 28]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 29]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 29]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 30]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 30]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 31]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 31]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<[B; 32]> for Vec<A> where A: PartialEq<B>","impl<'a, 'b, A, B> PartialEq<&'b [B; 32]> for Vec<A> where A: PartialEq<B>","impl<A> PartialEq<VecDeque<A>> for VecDeque<A> where A: PartialEq<A>","impl<T> PartialEq<Bound<T>> for Bound<T> where T: PartialEq<T>","impl<T> PartialEq<Box<T>> for Box<T> where T: PartialEq<T> + ?Sized","impl PartialEq for Expr","impl PartialEq for Repeater","impl PartialEq for CharClass","impl PartialEq for ClassRange","impl PartialEq for ByteClass","impl PartialEq for ByteRange","impl PartialEq<char> for ClassRange","impl PartialEq<ClassRange> for char","impl PartialEq<u8> for ByteRange","impl PartialEq<ByteRange> for u8","impl PartialEq for Error","impl PartialEq for ErrorKind",];implementors['libc'] = [];implementors['aho_corasick'] = ["impl PartialEq for Match",];implementors['regex'] = ["impl PartialEq for Char","impl PartialEq<char> for Char","impl PartialEq<Char> for char","impl PartialEq for EmptyLook","impl PartialEq for Regex",];implementors['clap'] = ["impl PartialEq for AppSettings","impl PartialEq for ErrorKind",];implementors['oxipng'] = ["impl PartialEq for ColorType","impl PartialEq for BitDepth","impl PartialEq for Headers",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/cmp/trait.PartialOrd.js b/doc/implementors/core/cmp/trait.PartialOrd.js deleted file mode 100644 index b541ec69..00000000 --- a/doc/implementors/core/cmp/trait.PartialOrd.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['vec_map'] = ["impl<V: PartialOrd> PartialOrd for VecMap<V>",];implementors['bit_vec'] = ["impl<B: BitBlock> PartialOrd for BitVec<B>",];implementors['variance'] = ["impl<T> PartialOrd<Invariant<T>> for Invariant<T>","impl<'id> PartialOrd for InvariantLifetime<'id>",];implementors['regex_syntax'] = ["impl PartialOrd for Lit","impl<K, V> PartialOrd<BTreeMap<K, V>> for BTreeMap<K, V> where V: PartialOrd<V>, K: PartialOrd<K>","impl<T> PartialOrd<BTreeSet<T>> for BTreeSet<T> where T: PartialOrd<T>","impl<'a, B> PartialOrd<Cow<'a, B>> for Cow<'a, B> where B: PartialOrd<B> + ToOwned + ?Sized","impl<E> PartialOrd<EnumSet<E>> for EnumSet<E> where E: PartialOrd<E>","impl<A> PartialOrd<LinkedList<A>> for LinkedList<A> where A: PartialOrd<A>","impl PartialOrd<String> for String","impl<T> PartialOrd<Vec<T>> for Vec<T> where T: PartialOrd<T>","impl<A> PartialOrd<VecDeque<A>> for VecDeque<A> where A: PartialOrd<A>","impl<T> PartialOrd<Box<T>> for Box<T> where T: PartialOrd<T> + ?Sized","impl PartialOrd for ClassRange","impl PartialOrd for ByteRange","impl PartialOrd<char> for ClassRange","impl PartialOrd<ClassRange> for char","impl PartialOrd<u8> for ByteRange","impl PartialOrd<ByteRange> for u8",];implementors['libc'] = [];implementors['regex'] = ["impl PartialOrd for Char","impl PartialOrd<char> for Char","impl PartialOrd<Char> for char",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/convert/trait.AsMut.js b/doc/implementors/core/convert/trait.AsMut.js deleted file mode 100644 index 038b4ae8..00000000 --- a/doc/implementors/core/convert/trait.AsMut.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<T> AsMut<Vec<T>> for Vec<T>","impl<T> AsMut<[T]> for Vec<T>","impl<T> AsMut<T> for Box<T> where T: ?Sized",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/convert/trait.AsRef.js b/doc/implementors/core/convert/trait.AsRef.js deleted file mode 100644 index 3387d90f..00000000 --- a/doc/implementors/core/convert/trait.AsRef.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl AsRef<[u8]> for Lit","impl<'a, T> AsRef<T> for Cow<'a, T> where T: ToOwned + ?Sized","impl AsRef<str> for String","impl AsRef<[u8]> for String","impl<T> AsRef<Vec<T>> for Vec<T>","impl<T> AsRef<[T]> for Vec<T>","impl<T> AsRef<T> for Box<T> where T: ?Sized",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/convert/trait.From.js b/doc/implementors/core/convert/trait.From.js deleted file mode 100644 index 965658b5..00000000 --- a/doc/implementors/core/convert/trait.From.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['ansi_term'] = ["impl<'a, S> From<S> for ANSIString<'a> where S: Into<Cow<'a, str>>",];implementors['regex_syntax'] = ["impl<T> From<Vec<T>> for BinaryHeap<T> where T: Ord","impl<T> From<BinaryHeap<T>> for Vec<T>","impl<'a> From<&'a str> for String","impl<'a> From<&'a str> for Cow<'a, str>","impl<'a> From<String> for Cow<'a, str>","impl<'a, T> From<&'a [T]> for Vec<T> where T: Clone","impl<'a> From<&'a str> for Vec<u8>","impl<'a, T> From<&'a [T]> for Cow<'a, [T]> where T: Clone","impl<'a, T> From<Vec<T>> for Cow<'a, [T]> where T: Clone","impl<T> From<Vec<T>> for VecDeque<T>","impl<T> From<VecDeque<T>> for Vec<T>","impl<T> From<T> for Box<T>",];implementors['libc'] = [];implementors['regex'] = ["impl From<Error> for Error","impl From<char> for Char","impl From<Option<char>> for Char",];implementors['clap'] = ["impl<'a, 'b, 'z> From<&'z Arg<'a, 'b>> for Arg<'a, 'b>","impl<'a, 'z> From<&'z ArgGroup<'a>> for ArgGroup<'a>","impl From<Error> for Error","impl From<Error> for Error",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/convert/trait.Into.js b/doc/implementors/core/convert/trait.Into.js deleted file mode 100644 index a400d733..00000000 --- a/doc/implementors/core/convert/trait.Into.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl Into<Vec<u8>> for String",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/default/trait.Default.js b/doc/implementors/core/default/trait.Default.js deleted file mode 100644 index 05f955bd..00000000 --- a/doc/implementors/core/default/trait.Default.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['vec_map'] = ["impl<V> Default for VecMap<V>",];implementors['ansi_term'] = ["impl Default for Style",];implementors['bit_vec'] = ["impl<B: BitBlock> Default for BitVec<B>",];implementors['variance'] = ["impl<T> Default for Invariant<T>","impl<'id> Default for InvariantLifetime<'id>",];implementors['regex_syntax'] = ["impl<T> Default for BinaryHeap<T> where T: Ord","impl<K, V> Default for BTreeMap<K, V> where K: Ord","impl<T> Default for BTreeSet<T> where T: Ord","impl<T> Default for LinkedList<T>","impl Default for String","impl<T> Default for Vec<T>","impl<T> Default for VecDeque<T>","impl<T> Default for Box<T> where T: Default","impl<T> Default for Box<[T]>",];implementors['libc'] = [];implementors['thread_local'] = ["impl<T: ?Sized + Send> Default for ThreadLocal<T>","impl<T: ?Sized + Send> Default for CachedThreadLocal<T>",];implementors['clap'] = ["impl<'a, 'b> Default for Arg<'a, 'b>","impl<'a> Default for ArgMatches<'a>","impl<'a> Default for ArgGroup<'a>",];implementors['oxipng'] = ["impl Default for Options",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/fmt/trait.Binary.js b/doc/implementors/core/fmt/trait.Binary.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/fmt/trait.Binary.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/fmt/trait.Debug.js b/doc/implementors/core/fmt/trait.Debug.js deleted file mode 100644 index a95ffdb1..00000000 --- a/doc/implementors/core/fmt/trait.Debug.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['strsim'] = ["impl Debug for StrSimError",];implementors['vec_map'] = ["impl<V: Debug> Debug for VecMap<V>",];implementors['utf8_ranges'] = ["impl Debug for Utf8Sequence","impl Debug for Utf8Range",];implementors['ansi_term'] = ["impl<'a> Debug for ANSIString<'a>","impl Debug for Colour","impl Debug for Style",];implementors['bit_vec'] = ["impl<B: BitBlock> Debug for BitVec<B>",];implementors['variance'] = ["impl<T> Debug for Invariant<T>","impl<'id> Debug for InvariantLifetime<'id>",];implementors['crossbeam'] = ["impl<T: Debug> Debug for Steal<T>",];implementors['regex_syntax'] = ["impl Debug for Literals","impl Debug for Lit","impl<T> Debug for BinaryHeap<T> where T: Ord + Debug","impl<K, V> Debug for BTreeMap<K, V> where K: Debug, V: Debug","impl<T> Debug for BTreeSet<T> where T: Debug","impl<'a, B> Debug for Cow<'a, B> where B: Debug + ToOwned + ?Sized, B::Owned: Debug","impl<E> Debug for EnumSet<E> where E: CLike + Debug","impl<A> Debug for LinkedList<A> where A: Debug","impl Debug for FromUtf8Error","impl Debug for FromUtf16Error","impl Debug for String","impl Debug for ParseError","impl<T> Debug for Vec<T> where T: Debug","impl<T> Debug for VecDeque<T> where T: Debug","impl<T> Debug for Bound<T> where T: Debug","impl<T> Debug for Box<T> where T: Debug + ?Sized","impl Debug for Expr","impl Debug for Repeater","impl Debug for CharClass","impl Debug for ClassRange","impl Debug for ByteClass","impl Debug for ByteRange","impl Debug for ExprBuilder","impl Debug for Error","impl Debug for ErrorKind",];implementors['libc'] = [];implementors['aho_corasick'] = ["impl Debug for Match","impl<'a, 's, P: Debug, A: Debug + 'a + Automaton<P> + ?Sized> Debug for Matches<'a, 's, P, A>","impl<'a, R: Debug, P: Debug, A: Debug + 'a + Automaton<P> + ?Sized> Debug for StreamMatches<'a, R, P, A>","impl<'a, 's, P: Debug, A: Debug + 'a + Automaton<P> + ?Sized> Debug for MatchesOverlapping<'a, 's, P, A>","impl<'a, R: Debug, P: Debug, A: Debug + 'a + Automaton<P> + ?Sized> Debug for StreamMatchesOverlapping<'a, R, P, A>","impl<P: AsRef<[u8]> + Debug> Debug for FullAcAutomaton<P>","impl Debug for Dense","impl Debug for Sparse","impl<P: AsRef<[u8]> + Debug, T: Transitions> Debug for AcAutomaton<P, T>",];implementors['regex'] = ["impl Debug for Error","impl Debug for InputAt","impl<'t> Debug for CharInput<'t>","impl Debug for Char","impl Debug for LiteralSearcher","impl Debug for Program","impl Debug for Inst","impl Debug for EmptyLook","impl Debug for InstRanges","impl Debug for Regex","impl<'t> Debug for Captures<'t>","impl Debug for SetMatches","impl Debug for RegexSet","impl Debug for SetMatches","impl Debug for RegexSet","impl Debug for Regex","impl<'t> Debug for Captures<'t>",];implementors['clap'] = ["impl Debug for AppSettings","impl<'a> Debug for ArgMatches<'a>","impl<'a> Debug for SubCommand<'a>","impl<'a> Debug for ArgGroup<'a>","impl Debug for ErrorKind","impl Debug for Error",];implementors['oxipng'] = ["impl Debug for ColorType","impl Debug for BitDepth","impl Debug for Headers","impl<'a> Debug for ScanLines<'a>","impl Debug for ScanLine","impl Debug for PngData","impl Debug for IhdrData","impl Debug for Options",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/fmt/trait.Display.js b/doc/implementors/core/fmt/trait.Display.js deleted file mode 100644 index b1451543..00000000 --- a/doc/implementors/core/fmt/trait.Display.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['ansi_term'] = ["impl<'a> Display for ANSIString<'a>","impl<'a> Display for ANSIStrings<'a>",];implementors['regex_syntax'] = ["impl<'a, B> Display for Cow<'a, B> where B: Display + ToOwned + ?Sized, B::Owned: Display","impl Display for FromUtf8Error","impl Display for FromUtf16Error","impl Display for String","impl Display for ParseError","impl<T> Display for Box<T> where T: Display + ?Sized","impl Display for Expr","impl Display for Repeater","impl Display for CharClass","impl Display for ClassRange","impl Display for ByteClass","impl Display for ByteRange","impl Display for Error","impl Display for ErrorKind",];implementors['libc'] = [];implementors['regex'] = ["impl Display for Error","impl Display for Regex","impl Display for Regex",];implementors['clap'] = ["impl<'n, 'e> Display for App<'n, 'e>","impl Display for Error",];implementors['oxipng'] = ["impl Display for ColorType","impl Display for BitDepth",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/fmt/trait.LowerExp.js b/doc/implementors/core/fmt/trait.LowerExp.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/fmt/trait.LowerExp.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/fmt/trait.LowerHex.js b/doc/implementors/core/fmt/trait.LowerHex.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/fmt/trait.LowerHex.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/fmt/trait.Octal.js b/doc/implementors/core/fmt/trait.Octal.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/fmt/trait.Octal.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/fmt/trait.Pointer.js b/doc/implementors/core/fmt/trait.Pointer.js deleted file mode 100644 index 43e0011f..00000000 --- a/doc/implementors/core/fmt/trait.Pointer.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<T> Pointer for Box<T> where T: ?Sized",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/fmt/trait.UpperExp.js b/doc/implementors/core/fmt/trait.UpperExp.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/fmt/trait.UpperExp.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/fmt/trait.UpperHex.js b/doc/implementors/core/fmt/trait.UpperHex.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/fmt/trait.UpperHex.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/fmt/trait.Write.js b/doc/implementors/core/fmt/trait.Write.js deleted file mode 100644 index 7043af6e..00000000 --- a/doc/implementors/core/fmt/trait.Write.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl Write for String",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/hash/trait.BuildHasher.js b/doc/implementors/core/hash/trait.BuildHasher.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/hash/trait.BuildHasher.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/hash/trait.Hash.js b/doc/implementors/core/hash/trait.Hash.js deleted file mode 100644 index 4ada274d..00000000 --- a/doc/implementors/core/hash/trait.Hash.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['vec_map'] = ["impl<V: Hash> Hash for VecMap<V>",];implementors['bit_vec'] = ["impl<B: BitBlock> Hash for BitVec<B>",];implementors['variance'] = ["impl<T> Hash for Invariant<T>","impl<'id> Hash for InvariantLifetime<'id>",];implementors['regex_syntax'] = ["impl<K, V> Hash for BTreeMap<K, V> where V: Hash, K: Hash","impl<T> Hash for BTreeSet<T> where T: Hash","impl<'a, B> Hash for Cow<'a, B> where B: Hash + ToOwned + ?Sized","impl<E> Hash for EnumSet<E> where E: Hash","impl<A> Hash for LinkedList<A> where A: Hash","impl Hash for String","impl<T> Hash for Vec<T> where T: Hash","impl<A> Hash for VecDeque<A> where A: Hash","impl<T> Hash for Bound<T> where T: Hash","impl<T> Hash for Box<T> where T: Hash + ?Sized",];implementors['libc'] = [];implementors['aho_corasick'] = ["impl Hash for Match",];implementors['regex'] = ["impl Hash for Char",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/hash/trait.Hasher.js b/doc/implementors/core/hash/trait.Hasher.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/hash/trait.Hasher.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/iter/iterator/trait.Iterator.js b/doc/implementors/core/iter/iterator/trait.Iterator.js deleted file mode 100644 index 05b81f95..00000000 --- a/doc/implementors/core/iter/iterator/trait.Iterator.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['vec_map'] = ["impl<'a, V> Iterator for Iter<'a, V>","impl<'a, V> Iterator for IterMut<'a, V>","impl<'a, V> Iterator for Drain<'a, V>","impl<'a, V> Iterator for Keys<'a, V>","impl<'a, V> Iterator for Values<'a, V>","impl<V> Iterator for IntoIter<V>",];implementors['utf8_ranges'] = ["impl Iterator for Utf8Sequences",];implementors['bit_vec'] = ["impl<'a, B: BitBlock> Iterator for Iter<'a, B>","impl<B: BitBlock> Iterator for IntoIter<B>","impl<'a, B: BitBlock> Iterator for Blocks<'a, B>",];implementors['regex_syntax'] = ["impl<'a, T> Iterator for Iter<'a, T>","impl<T> Iterator for IntoIter<T>","impl<'a, T> Iterator for Drain<'a, T> where T: 'a","impl<'a, K, V> Iterator for Iter<'a, K, V> where V: 'a, K: 'a","impl<'a, K, V> Iterator for IterMut<'a, K, V> where V: 'a, K: 'a","impl<K, V> Iterator for IntoIter<K, V>","impl<'a, K, V> Iterator for Keys<'a, K, V>","impl<'a, K, V> Iterator for Values<'a, K, V>","impl<'a, K, V> Iterator for Range<'a, K, V>","impl<'a, K, V> Iterator for ValuesMut<'a, K, V>","impl<'a, K, V> Iterator for RangeMut<'a, K, V>","impl<'a, T> Iterator for Iter<'a, T>","impl<T> Iterator for IntoIter<T>","impl<'a, T> Iterator for Range<'a, T>","impl<'a, T> Iterator for Difference<'a, T> where T: Ord","impl<'a, T> Iterator for SymmetricDifference<'a, T> where T: Ord","impl<'a, T> Iterator for Intersection<'a, T> where T: Ord","impl<'a, T> Iterator for Union<'a, T> where T: Ord","impl<E> Iterator for Iter<E> where E: CLike","impl<'a, A> Iterator for Iter<'a, A>","impl<'a, A> Iterator for IterMut<'a, A>","impl<A> Iterator for IntoIter<A>","impl<'a> Iterator for EncodeUtf16<'a>","impl<'a> Iterator for Drain<'a>","impl<T> Iterator for IntoIter<T>","impl<'a, T> Iterator for Drain<'a, T>","impl<'a, T> Iterator for Iter<'a, T>","impl<'a, T> Iterator for IterMut<'a, T>","impl<T> Iterator for IntoIter<T>","impl<'a, T> Iterator for Drain<'a, T> where T: 'a","impl<I> Iterator for Box<I> where I: Iterator + ?Sized",];implementors['libc'] = [];implementors['aho_corasick'] = ["impl<'a, 's, P, A: Automaton<P> + ?Sized> Iterator for Matches<'a, 's, P, A>","impl<'a, R: Read, P, A: Automaton<P>> Iterator for StreamMatches<'a, R, P, A>","impl<'a, 's, P, A: Automaton<P> + ?Sized> Iterator for MatchesOverlapping<'a, 's, P, A>","impl<'a, R: Read, P, A: Automaton<P> + ?Sized> Iterator for StreamMatchesOverlapping<'a, R, P, A>",];implementors['regex'] = ["impl<'r, 't> Iterator for FindMatches<'r, 't>","impl<'r, 't> Iterator for FindCaptures<'r, 't>","impl<'r, 't> Iterator for Splits<'r, 't>","impl<'r, 't> Iterator for SplitsN<'r, 't>","impl<'r> Iterator for CaptureNames<'r>","impl<'c, 't> Iterator for SubCaptures<'c, 't>","impl<'c> Iterator for SubCapturesPos<'c>","impl<'c, 't> Iterator for SubCapturesNamed<'c, 't>","impl Iterator for SetMatchesIntoIter","impl<'a> Iterator for SetMatchesIter<'a>","impl Iterator for SetMatchesIntoIter","impl<'a> Iterator for SetMatchesIter<'a>","impl<'r> Iterator for CaptureNames<'r>","impl<'r, 't> Iterator for RegexSplits<'r, 't>","impl<'r, 't> Iterator for RegexSplitsN<'r, 't>","impl<'c> Iterator for SubCaptures<'c>","impl<'c> Iterator for SubCapturesPos<'c>","impl<'c> Iterator for SubCapturesNamed<'c>","impl<'r, 't> Iterator for FindCaptures<'r, 't>","impl<'r, 't> Iterator for FindMatches<'r, 't>",];implementors['oxipng'] = ["impl<'a> Iterator for ScanLines<'a>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/iter/range/trait.Step.js b/doc/implementors/core/iter/range/trait.Step.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/iter/range/trait.Step.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/iter/traits/trait.DoubleEndedIterator.js b/doc/implementors/core/iter/traits/trait.DoubleEndedIterator.js deleted file mode 100644 index 3eb1f622..00000000 --- a/doc/implementors/core/iter/traits/trait.DoubleEndedIterator.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['vec_map'] = ["impl<'a, V> DoubleEndedIterator for Iter<'a, V>","impl<'a, V> DoubleEndedIterator for IterMut<'a, V>","impl<'a, V> DoubleEndedIterator for Drain<'a, V>","impl<'a, V> DoubleEndedIterator for Keys<'a, V>","impl<'a, V> DoubleEndedIterator for Values<'a, V>","impl<V> DoubleEndedIterator for IntoIter<V>",];implementors['bit_vec'] = ["impl<'a, B: BitBlock> DoubleEndedIterator for Iter<'a, B>","impl<B: BitBlock> DoubleEndedIterator for IntoIter<B>","impl<'a, B: BitBlock> DoubleEndedIterator for Blocks<'a, B>",];implementors['regex_syntax'] = ["impl<'a, T> DoubleEndedIterator for Iter<'a, T>","impl<T> DoubleEndedIterator for IntoIter<T>","impl<'a, T> DoubleEndedIterator for Drain<'a, T> where T: 'a","impl<'a, K, V> DoubleEndedIterator for Iter<'a, K, V> where V: 'a, K: 'a","impl<'a, K, V> DoubleEndedIterator for IterMut<'a, K, V> where K: 'a, V: 'a","impl<K, V> DoubleEndedIterator for IntoIter<K, V>","impl<'a, K, V> DoubleEndedIterator for Keys<'a, K, V>","impl<'a, K, V> DoubleEndedIterator for Values<'a, K, V>","impl<'a, K, V> DoubleEndedIterator for ValuesMut<'a, K, V>","impl<'a, K, V> DoubleEndedIterator for Range<'a, K, V>","impl<'a, K, V> DoubleEndedIterator for RangeMut<'a, K, V>","impl<'a, T> DoubleEndedIterator for Iter<'a, T>","impl<T> DoubleEndedIterator for IntoIter<T>","impl<'a, T> DoubleEndedIterator for Range<'a, T>","impl<'a, A> DoubleEndedIterator for Iter<'a, A>","impl<'a, A> DoubleEndedIterator for IterMut<'a, A>","impl<A> DoubleEndedIterator for IntoIter<A>","impl<'a> DoubleEndedIterator for Drain<'a>","impl<T> DoubleEndedIterator for IntoIter<T>","impl<'a, T> DoubleEndedIterator for Drain<'a, T>","impl<'a, T> DoubleEndedIterator for Iter<'a, T>","impl<'a, T> DoubleEndedIterator for IterMut<'a, T>","impl<T> DoubleEndedIterator for IntoIter<T>","impl<'a, T> DoubleEndedIterator for Drain<'a, T> where T: 'a","impl<I> DoubleEndedIterator for Box<I> where I: DoubleEndedIterator + ?Sized",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/iter/traits/trait.ExactSizeIterator.js b/doc/implementors/core/iter/traits/trait.ExactSizeIterator.js deleted file mode 100644 index b8fc6eae..00000000 --- a/doc/implementors/core/iter/traits/trait.ExactSizeIterator.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bit_vec'] = ["impl<'a, B: BitBlock> ExactSizeIterator for Iter<'a, B>","impl<B: BitBlock> ExactSizeIterator for IntoIter<B>","impl<'a, B: BitBlock> ExactSizeIterator for Blocks<'a, B>",];implementors['regex_syntax'] = ["impl<'a, T> ExactSizeIterator for Iter<'a, T>","impl<T> ExactSizeIterator for IntoIter<T>","impl<'a, T> ExactSizeIterator for Drain<'a, T> where T: 'a","impl<'a, K, V> ExactSizeIterator for Iter<'a, K, V> where K: 'a, V: 'a","impl<'a, K, V> ExactSizeIterator for IterMut<'a, K, V> where V: 'a, K: 'a","impl<K, V> ExactSizeIterator for IntoIter<K, V>","impl<'a, K, V> ExactSizeIterator for Keys<'a, K, V>","impl<'a, K, V> ExactSizeIterator for Values<'a, K, V>","impl<'a, K, V> ExactSizeIterator for ValuesMut<'a, K, V>","impl<'a, T> ExactSizeIterator for Iter<'a, T>","impl<T> ExactSizeIterator for IntoIter<T>","impl<'a, A> ExactSizeIterator for Iter<'a, A>","impl<'a, A> ExactSizeIterator for IterMut<'a, A>","impl<A> ExactSizeIterator for IntoIter<A>","impl<T> ExactSizeIterator for IntoIter<T>","impl<'a, T> ExactSizeIterator for Drain<'a, T>","impl<'a, T> ExactSizeIterator for Iter<'a, T>","impl<'a, T> ExactSizeIterator for IterMut<'a, T>","impl<T> ExactSizeIterator for IntoIter<T>","impl<'a, T> ExactSizeIterator for Drain<'a, T> where T: 'a","impl<I> ExactSizeIterator for Box<I> where I: ExactSizeIterator + ?Sized",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/iter/traits/trait.Extend.js b/doc/implementors/core/iter/traits/trait.Extend.js deleted file mode 100644 index e70b6af6..00000000 --- a/doc/implementors/core/iter/traits/trait.Extend.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['vec_map'] = ["impl<V> Extend<(usize, V)> for VecMap<V>","impl<'a, V: Copy> Extend<(usize, &'a V)> for VecMap<V>",];implementors['bit_vec'] = ["impl<B: BitBlock> Extend<bool> for BitVec<B>",];implementors['regex_syntax'] = ["impl<T> Extend<T> for BinaryHeap<T> where T: Ord","impl<'a, T> Extend<&'a T> for BinaryHeap<T> where T: Copy + 'a + Ord","impl<K, V> Extend<(K, V)> for BTreeMap<K, V> where K: Ord","impl<'a, K, V> Extend<(&'a K, &'a V)> for BTreeMap<K, V> where K: Copy + Ord, V: Copy","impl<T> Extend<T> for BTreeSet<T> where T: Ord","impl<'a, T> Extend<&'a T> for BTreeSet<T> where T: Copy + 'a + Ord","impl<E> Extend<E> for EnumSet<E> where E: CLike","impl<'a, E> Extend<&'a E> for EnumSet<E> where E: Copy + 'a + CLike","impl<A> Extend<A> for LinkedList<A>","impl<'a, T> Extend<&'a T> for LinkedList<T> where T: Copy + 'a","impl Extend<char> for String","impl<'a> Extend<&'a char> for String","impl<'a> Extend<&'a str> for String","impl Extend<String> for String","impl<T> Extend<T> for Vec<T>","impl<'a, T> Extend<&'a T> for Vec<T> where T: Copy + 'a","impl<A> Extend<A> for VecDeque<A>","impl<'a, T> Extend<&'a T> for VecDeque<T> where T: Copy + 'a",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/iter/traits/trait.FromIterator.js b/doc/implementors/core/iter/traits/trait.FromIterator.js deleted file mode 100644 index 20dda565..00000000 --- a/doc/implementors/core/iter/traits/trait.FromIterator.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['vec_map'] = ["impl<V> FromIterator<(usize, V)> for VecMap<V>",];implementors['bit_vec'] = ["impl<B: BitBlock> FromIterator<bool> for BitVec<B>",];implementors['regex_syntax'] = ["impl<T> FromIterator<T> for BinaryHeap<T> where T: Ord","impl<K, V> FromIterator<(K, V)> for BTreeMap<K, V> where K: Ord","impl<T> FromIterator<T> for BTreeSet<T> where T: Ord","impl<E> FromIterator<E> for EnumSet<E> where E: CLike","impl<A> FromIterator<A> for LinkedList<A>","impl FromIterator<char> for String","impl<'a> FromIterator<&'a str> for String","impl FromIterator<String> for String","impl<T> FromIterator<T> for Vec<T>","impl<'a, T> FromIterator<T> for Cow<'a, [T]> where T: Clone","impl<A> FromIterator<A> for VecDeque<A>",];implementors['libc'] = [];implementors['aho_corasick'] = ["impl<S: AsRef<[u8]>> FromIterator<S> for AcAutomaton<S>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/iter/traits/trait.IntoIterator.js b/doc/implementors/core/iter/traits/trait.IntoIterator.js deleted file mode 100644 index 8fd803d6..00000000 --- a/doc/implementors/core/iter/traits/trait.IntoIterator.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['vec_map'] = ["impl<T> IntoIterator for VecMap<T>","impl<'a, T> IntoIterator for &'a VecMap<T>","impl<'a, T> IntoIterator for &'a mut VecMap<T>",];implementors['utf8_ranges'] = ["impl<'a> IntoIterator for &'a Utf8Sequence",];implementors['bit_vec'] = ["impl<'a, B: BitBlock> IntoIterator for &'a BitVec<B>","impl<B: BitBlock> IntoIterator for BitVec<B>",];implementors['regex_syntax'] = ["impl<T> IntoIterator for BinaryHeap<T> where T: Ord","impl<'a, T> IntoIterator for &'a BinaryHeap<T> where T: Ord","impl<'a, K, V> IntoIterator for &'a BTreeMap<K, V> where V: 'a, K: 'a","impl<'a, K, V> IntoIterator for &'a mut BTreeMap<K, V> where K: 'a, V: 'a","impl<K, V> IntoIterator for BTreeMap<K, V>","impl<T> IntoIterator for BTreeSet<T>","impl<'a, T> IntoIterator for &'a BTreeSet<T>","impl<'a, E> IntoIterator for &'a EnumSet<E> where E: CLike","impl<T> IntoIterator for LinkedList<T>","impl<'a, T> IntoIterator for &'a LinkedList<T>","impl<'a, T> IntoIterator for &'a mut LinkedList<T>","impl<T> IntoIterator for Vec<T>","impl<'a, T> IntoIterator for &'a Vec<T>","impl<'a, T> IntoIterator for &'a mut Vec<T>","impl<T> IntoIterator for VecDeque<T>","impl<'a, T> IntoIterator for &'a VecDeque<T>","impl<'a, T> IntoIterator for &'a mut VecDeque<T>","impl IntoIterator for CharClass","impl<'a> IntoIterator for &'a CharClass","impl IntoIterator for ByteClass","impl<'a> IntoIterator for &'a ByteClass",];implementors['libc'] = [];implementors['regex'] = ["impl<'a> IntoIterator for &'a Program","impl IntoIterator for SetMatches","impl<'a> IntoIterator for &'a SetMatches","impl IntoIterator for SetMatches","impl<'a> IntoIterator for &'a SetMatches","impl<'a> IntoIterator for &'a SparseSet",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/marker/trait.Copy.js b/doc/implementors/core/marker/trait.Copy.js deleted file mode 100644 index 095680a0..00000000 --- a/doc/implementors/core/marker/trait.Copy.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['utf8_ranges'] = ["impl Copy for Utf8Sequence","impl Copy for Utf8Range",];implementors['ansi_term'] = ["impl Copy for Colour","impl Copy for Style",];implementors['variance'] = ["impl<T> Copy for Invariant<T>","impl<'id> Copy for InvariantLifetime<'id>",];implementors['crossbeam'] = ["impl<'a, T> Copy for Shared<'a, T>",];implementors['regex_syntax'] = ["impl<E> Copy for EnumSet<E>","impl Copy for ParseError","impl<T> Copy for Bound<T> where T: Copy","impl Copy for ExchangeHeapSingleton","impl Copy for Repeater","impl Copy for ClassRange","impl Copy for ByteRange",];implementors['libc'] = ["impl Copy for pthread_attr_t","impl Copy for glob_t","impl Copy for sockaddr_storage","impl Copy for addrinfo","impl Copy for mach_timebase_info","impl Copy for stat","impl Copy for dirent","impl Copy for pthread_mutex_t","impl Copy for pthread_mutexattr_t","impl Copy for pthread_cond_t","impl Copy for pthread_rwlock_t","impl Copy for siginfo_t","impl Copy for sigaction","impl Copy for stack_t","impl Copy for fstore_t","impl Copy for radvisory","impl Copy for statvfs","impl Copy for Dl_info","impl Copy for sockaddr_in","impl Copy for statfs","impl Copy for kevent","impl Copy for kevent64_s","impl Copy for dqblk","impl Copy for termios","impl Copy for flock","impl Copy for sf_hdtr","impl Copy for lconv","impl Copy for sockaddr","impl Copy for sockaddr_in6","impl Copy for sockaddr_un","impl Copy for passwd","impl Copy for ifaddrs","impl Copy for fd_set","impl Copy for tm","impl Copy for utsname","impl Copy for msghdr","impl Copy for fsid_t","impl Copy for utimbuf","impl Copy for timeval","impl Copy for timespec","impl Copy for rlimit","impl Copy for rusage","impl Copy for in_addr","impl Copy for in6_addr","impl Copy for ip_mreq","impl Copy for ipv6_mreq","impl Copy for hostent","impl Copy for iovec","impl Copy for pollfd","impl Copy for winsize",];implementors['aho_corasick'] = ["impl Copy for Match",];implementors['regex'] = ["impl Copy for InputAt","impl<'t> Copy for CharInput<'t>","impl Copy for Char","impl Copy for EmptyLook",];implementors['clap'] = ["impl Copy for AppSettings","impl Copy for ErrorKind",];implementors['oxipng'] = ["impl Copy for ColorType","impl Copy for BitDepth","impl Copy for IhdrData",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/marker/trait.Send.js b/doc/implementors/core/marker/trait.Send.js deleted file mode 100644 index efddac8c..00000000 --- a/doc/implementors/core/marker/trait.Send.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['variance'] = ["impl<T> Send for Invariant<T>",];implementors['crossbeam'] = ["impl<T: Sync> Send for Atomic<T>","impl<T: Send> Send for CachePadded<T>","impl<T: Send> Send for AtomicOption<T>","impl<T: Send> Send for MsQueue<T>",];implementors['regex_syntax'] = ["impl<'a> Send for Drain<'a>","impl<T> Send for IntoIter<T> where T: Send","impl<'a, T> Send for Drain<'a, T> where T: Send","impl<'a, T> Send for Drain<'a, T> where T: Send",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/marker/trait.Sync.js b/doc/implementors/core/marker/trait.Sync.js deleted file mode 100644 index f15b6670..00000000 --- a/doc/implementors/core/marker/trait.Sync.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['variance'] = ["impl<T> Sync for Invariant<T>",];implementors['crossbeam'] = ["impl<T: Sync> Sync for Atomic<T>","impl<T: Sync> Sync for CachePadded<T>","impl<T: Send> Sync for AtomicOption<T>","impl<T: Send> Sync for MsQueue<T>",];implementors['regex_syntax'] = ["impl<'a> Sync for Drain<'a>","impl<T> Sync for IntoIter<T> where T: Sync","impl<'a, T> Sync for Drain<'a, T> where T: Sync","impl<'a, T> Sync for Drain<'a, T> where T: Sync",];implementors['libc'] = [];implementors['thread_local'] = ["impl<T: ?Sized + Send> Sync for ThreadLocal<T>","impl<T: ?Sized + Send> Sync for CachedThreadLocal<T>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/nonzero/trait.Zeroable.js b/doc/implementors/core/nonzero/trait.Zeroable.js deleted file mode 100644 index 56e4546c..00000000 --- a/doc/implementors/core/nonzero/trait.Zeroable.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = [];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/num/trait.One.js b/doc/implementors/core/num/trait.One.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/num/trait.One.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/num/trait.Zero.js b/doc/implementors/core/num/trait.Zero.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/num/trait.Zero.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Add.js b/doc/implementors/core/ops/trait.Add.js deleted file mode 100644 index 0a8b5668..00000000 --- a/doc/implementors/core/ops/trait.Add.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<'a> Add<&'a str> for String",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.AddAssign.js b/doc/implementors/core/ops/trait.AddAssign.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.AddAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.BitAnd.js b/doc/implementors/core/ops/trait.BitAnd.js deleted file mode 100644 index 98e8c0db..00000000 --- a/doc/implementors/core/ops/trait.BitAnd.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<'a, 'b, T> BitAnd<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone","impl<E> BitAnd<EnumSet<E>> for EnumSet<E> where E: CLike",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.BitAndAssign.js b/doc/implementors/core/ops/trait.BitAndAssign.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.BitAndAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.BitOr.js b/doc/implementors/core/ops/trait.BitOr.js deleted file mode 100644 index 62d77646..00000000 --- a/doc/implementors/core/ops/trait.BitOr.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<'a, 'b, T> BitOr<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone","impl<E> BitOr<EnumSet<E>> for EnumSet<E> where E: CLike",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.BitOrAssign.js b/doc/implementors/core/ops/trait.BitOrAssign.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.BitOrAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.BitXor.js b/doc/implementors/core/ops/trait.BitXor.js deleted file mode 100644 index af4055b5..00000000 --- a/doc/implementors/core/ops/trait.BitXor.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<'a, 'b, T> BitXor<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone","impl<E> BitXor<EnumSet<E>> for EnumSet<E> where E: CLike",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.BitXorAssign.js b/doc/implementors/core/ops/trait.BitXorAssign.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.BitXorAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.BoxPlace.js b/doc/implementors/core/ops/trait.BoxPlace.js deleted file mode 100644 index 5784c6e1..00000000 --- a/doc/implementors/core/ops/trait.BoxPlace.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<T> BoxPlace<T> for IntermediateBox<T>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Boxed.js b/doc/implementors/core/ops/trait.Boxed.js deleted file mode 100644 index 2e4ab32d..00000000 --- a/doc/implementors/core/ops/trait.Boxed.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<T> Boxed for Box<T>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.CoerceUnsized.js b/doc/implementors/core/ops/trait.CoerceUnsized.js deleted file mode 100644 index 3714a4fd..00000000 --- a/doc/implementors/core/ops/trait.CoerceUnsized.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<T, U> CoerceUnsized<Box<U>> for Box<T> where U: ?Sized, T: Unsize<U> + ?Sized",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Deref.js b/doc/implementors/core/ops/trait.Deref.js deleted file mode 100644 index 068b7913..00000000 --- a/doc/implementors/core/ops/trait.Deref.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['scopeguard'] = ["impl<T, F> Deref for Guard<T, F> where F: FnMut(&mut T)",];implementors['ansi_term'] = ["impl<'a> Deref for ANSIString<'a>",];implementors['crc'] = ["impl Deref for IEEE_TABLE","impl Deref for CASTAGNOLI_TABLE","impl Deref for KOOPMAN_TABLE","impl Deref for ECMA_TABLE","impl Deref for ISO_TABLE",];implementors['crossbeam'] = ["impl<T> Deref for Owned<T>","impl<'a, T> Deref for Shared<'a, T>","impl<T> Deref for CachePadded<T>",];implementors['regex_syntax'] = ["impl<'a, B> Deref for Cow<'a, B> where B: ToOwned + ?Sized","impl Deref for String","impl<T> Deref for Vec<T>","impl<T> Deref for Box<T> where T: ?Sized","impl Deref for Lit","impl Deref for CharClass","impl Deref for ByteClass",];implementors['libc'] = [];implementors['regex'] = ["impl<'t> Deref for CharInput<'t>","impl Deref for Program",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.DerefMut.js b/doc/implementors/core/ops/trait.DerefMut.js deleted file mode 100644 index f9d530ef..00000000 --- a/doc/implementors/core/ops/trait.DerefMut.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['scopeguard'] = ["impl<T, F> DerefMut for Guard<T, F> where F: FnMut(&mut T)",];implementors['crossbeam'] = ["impl<T> DerefMut for Owned<T>","impl<T> DerefMut for CachePadded<T>",];implementors['regex_syntax'] = ["impl DerefMut for String","impl<T> DerefMut for Vec<T>","impl<T> DerefMut for Box<T> where T: ?Sized","impl DerefMut for Lit",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Div.js b/doc/implementors/core/ops/trait.Div.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.Div.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.DivAssign.js b/doc/implementors/core/ops/trait.DivAssign.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.DivAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Drop.js b/doc/implementors/core/ops/trait.Drop.js deleted file mode 100644 index 80f328fe..00000000 --- a/doc/implementors/core/ops/trait.Drop.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['scopeguard'] = ["impl<T, F> Drop for Guard<T, F> where F: FnMut(&mut T)",];implementors['crossbeam'] = ["impl Drop for Guard","impl<T> Drop for ArcCell<T>","impl<'a> Drop for Scope<'a>",];implementors['regex_syntax'] = ["impl<K, V> Drop for BTreeMap<K, V>","impl<K, V> Drop for IntoIter<K, V>","impl<T> Drop for LinkedList<T>","impl<'a> Drop for Drain<'a>","impl<T> Drop for Vec<T>","impl<T> Drop for IntoIter<T>","impl<'a, T> Drop for Drain<'a, T>","impl<T> Drop for VecDeque<T>","impl<'a, T> Drop for Drain<'a, T> where T: 'a","impl<T> Drop for IntermediateBox<T> where T: ?Sized",];implementors['thread_local'] = ["impl<T: ?Sized + Send> Drop for ThreadLocal<T>",];implementors['oxipng'] = ["impl<D: Direction> Drop for Stream<D>","impl<D: Direction> Drop for Stream<D>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Fn.js b/doc/implementors/core/ops/trait.Fn.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.Fn.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.FnMut.js b/doc/implementors/core/ops/trait.FnMut.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.FnMut.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.FnOnce.js b/doc/implementors/core/ops/trait.FnOnce.js deleted file mode 100644 index 340c9299..00000000 --- a/doc/implementors/core/ops/trait.FnOnce.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<'a, A, R> FnOnce<A> for Box<FnBox<A, Output=R> + 'a>","impl<'a, A, R> FnOnce<A> for Box<FnBox<A, Output=R> + 'a + Send>",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.InPlace.js b/doc/implementors/core/ops/trait.InPlace.js deleted file mode 100644 index a50b1111..00000000 --- a/doc/implementors/core/ops/trait.InPlace.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<'a, T> InPlace<T> for FrontPlace<'a, T>","impl<'a, T> InPlace<T> for BackPlace<'a, T>","impl<T> InPlace<T> for IntermediateBox<T>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Index.js b/doc/implementors/core/ops/trait.Index.js deleted file mode 100644 index 42413e24..00000000 --- a/doc/implementors/core/ops/trait.Index.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['vec_map'] = ["impl<V> Index<usize> for VecMap<V>","impl<'a, V> Index<&'a usize> for VecMap<V>",];implementors['bit_vec'] = ["impl<B: BitBlock> Index<usize> for BitVec<B>",];implementors['regex_syntax'] = ["impl<'a, K, Q, V> Index<&'a Q> for BTreeMap<K, V> where Q: Ord + ?Sized, K: Ord + Borrow<Q>","impl Index<Range<usize>> for String","impl Index<RangeTo<usize>> for String","impl Index<RangeFrom<usize>> for String","impl Index<RangeFull> for String","impl Index<RangeInclusive<usize>> for String","impl Index<RangeToInclusive<usize>> for String","impl<T> Index<usize> for Vec<T>","impl<T> Index<Range<usize>> for Vec<T>","impl<T> Index<RangeTo<usize>> for Vec<T>","impl<T> Index<RangeFrom<usize>> for Vec<T>","impl<T> Index<RangeFull> for Vec<T>","impl<T> Index<RangeInclusive<usize>> for Vec<T>","impl<T> Index<RangeToInclusive<usize>> for Vec<T>","impl<A> Index<usize> for VecDeque<A>",];implementors['libc'] = [];implementors['regex'] = ["impl<'t> Index<usize> for Captures<'t>","impl<'t, 'i> Index<&'i str> for Captures<'t>","impl<'t> Index<usize> for Captures<'t>","impl<'t, 'i> Index<&'i str> for Captures<'t>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.IndexMut.js b/doc/implementors/core/ops/trait.IndexMut.js deleted file mode 100644 index 276173e2..00000000 --- a/doc/implementors/core/ops/trait.IndexMut.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['vec_map'] = ["impl<V> IndexMut<usize> for VecMap<V>","impl<'a, V> IndexMut<&'a usize> for VecMap<V>",];implementors['regex_syntax'] = ["impl IndexMut<Range<usize>> for String","impl IndexMut<RangeTo<usize>> for String","impl IndexMut<RangeFrom<usize>> for String","impl IndexMut<RangeFull> for String","impl IndexMut<RangeInclusive<usize>> for String","impl IndexMut<RangeToInclusive<usize>> for String","impl<T> IndexMut<usize> for Vec<T>","impl<T> IndexMut<Range<usize>> for Vec<T>","impl<T> IndexMut<RangeTo<usize>> for Vec<T>","impl<T> IndexMut<RangeFrom<usize>> for Vec<T>","impl<T> IndexMut<RangeFull> for Vec<T>","impl<T> IndexMut<RangeInclusive<usize>> for Vec<T>","impl<T> IndexMut<RangeToInclusive<usize>> for Vec<T>","impl<A> IndexMut<usize> for VecDeque<A>",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Mul.js b/doc/implementors/core/ops/trait.Mul.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.Mul.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.MulAssign.js b/doc/implementors/core/ops/trait.MulAssign.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.MulAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Neg.js b/doc/implementors/core/ops/trait.Neg.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.Neg.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Not.js b/doc/implementors/core/ops/trait.Not.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.Not.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Place.js b/doc/implementors/core/ops/trait.Place.js deleted file mode 100644 index f7a93417..00000000 --- a/doc/implementors/core/ops/trait.Place.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<'a, T> Place<T> for FrontPlace<'a, T>","impl<'a, T> Place<T> for BackPlace<'a, T>","impl<T> Place<T> for IntermediateBox<T>",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Placer.js b/doc/implementors/core/ops/trait.Placer.js deleted file mode 100644 index 6238a1d1..00000000 --- a/doc/implementors/core/ops/trait.Placer.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<'a, T> Placer<T> for FrontPlace<'a, T>","impl<'a, T> Placer<T> for BackPlace<'a, T>","impl<T> Placer<T> for ExchangeHeapSingleton",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Rem.js b/doc/implementors/core/ops/trait.Rem.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.Rem.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.RemAssign.js b/doc/implementors/core/ops/trait.RemAssign.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.RemAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Shl.js b/doc/implementors/core/ops/trait.Shl.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.Shl.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.ShlAssign.js b/doc/implementors/core/ops/trait.ShlAssign.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.ShlAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Shr.js b/doc/implementors/core/ops/trait.Shr.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.Shr.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.ShrAssign.js b/doc/implementors/core/ops/trait.ShrAssign.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.ShrAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.Sub.js b/doc/implementors/core/ops/trait.Sub.js deleted file mode 100644 index 10a16e47..00000000 --- a/doc/implementors/core/ops/trait.Sub.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<'a, 'b, T> Sub<&'b BTreeSet<T>> for &'a BTreeSet<T> where T: Ord + Clone","impl<E> Sub<EnumSet<E>> for EnumSet<E> where E: CLike",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/ops/trait.SubAssign.js b/doc/implementors/core/ops/trait.SubAssign.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/ops/trait.SubAssign.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/raw/trait.Repr.js b/doc/implementors/core/raw/trait.Repr.js deleted file mode 100644 index 5fd020f3..00000000 --- a/doc/implementors/core/raw/trait.Repr.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/slice/trait.SliceExt.js b/doc/implementors/core/slice/trait.SliceExt.js deleted file mode 100644 index 56e4546c..00000000 --- a/doc/implementors/core/slice/trait.SliceExt.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = [];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/str/pattern/trait.DoubleEndedSearcher.js b/doc/implementors/core/str/pattern/trait.DoubleEndedSearcher.js deleted file mode 100644 index 02991517..00000000 --- a/doc/implementors/core/str/pattern/trait.DoubleEndedSearcher.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = [];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/str/pattern/trait.Pattern.js b/doc/implementors/core/str/pattern/trait.Pattern.js deleted file mode 100644 index 3564bca7..00000000 --- a/doc/implementors/core/str/pattern/trait.Pattern.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl<'a, 'b> Pattern<'a> for &'b String",];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/str/pattern/trait.ReverseSearcher.js b/doc/implementors/core/str/pattern/trait.ReverseSearcher.js deleted file mode 100644 index 02991517..00000000 --- a/doc/implementors/core/str/pattern/trait.ReverseSearcher.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = [];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/str/pattern/trait.Searcher.js b/doc/implementors/core/str/pattern/trait.Searcher.js deleted file mode 100644 index 02991517..00000000 --- a/doc/implementors/core/str/pattern/trait.Searcher.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = [];implementors['libc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/core/str/trait.FromStr.js b/doc/implementors/core/str/trait.FromStr.js deleted file mode 100644 index 47307ac6..00000000 --- a/doc/implementors/core/str/trait.FromStr.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl FromStr for String",];implementors['libc'] = [];implementors['regex'] = ["impl FromStr for Regex","impl FromStr for Regex",];implementors['clap'] = ["impl FromStr for AppSettings",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/crc/crc32/trait.Hasher32.js b/doc/implementors/crc/crc32/trait.Hasher32.js deleted file mode 100644 index a7def232..00000000 --- a/doc/implementors/crc/crc32/trait.Hasher32.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['crc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/crc/crc64/trait.Hasher64.js b/doc/implementors/crc/crc64/trait.Hasher64.js deleted file mode 100644 index a7def232..00000000 --- a/doc/implementors/crc/crc64/trait.Hasher64.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['crc'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/crossbeam/mem/trait.ZerosValid.js b/doc/implementors/crossbeam/mem/trait.ZerosValid.js deleted file mode 100644 index 255a999e..00000000 --- a/doc/implementors/crossbeam/mem/trait.ZerosValid.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['crossbeam'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/rand/distributions/trait.IndependentSample.js b/doc/implementors/rand/distributions/trait.IndependentSample.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/rand/distributions/trait.IndependentSample.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/rand/distributions/trait.Sample.js b/doc/implementors/rand/distributions/trait.Sample.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/rand/distributions/trait.Sample.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/rand/reseeding/trait.Reseeder.js b/doc/implementors/rand/reseeding/trait.Reseeder.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/rand/reseeding/trait.Reseeder.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/rand/trait.Rng.js b/doc/implementors/rand/trait.Rng.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/rand/trait.Rng.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/rand/trait.SeedableRng.js b/doc/implementors/rand/trait.SeedableRng.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/rand/trait.SeedableRng.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/regex/bytes/trait.Replacer.js b/doc/implementors/regex/bytes/trait.Replacer.js deleted file mode 100644 index 274f2013..00000000 --- a/doc/implementors/regex/bytes/trait.Replacer.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/regex/trait.Replacer.js b/doc/implementors/regex/trait.Replacer.js deleted file mode 100644 index 274f2013..00000000 --- a/doc/implementors/regex/trait.Replacer.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/rustc_unicode/u_str/trait.UnicodeStr.js b/doc/implementors/rustc_unicode/u_str/trait.UnicodeStr.js deleted file mode 100644 index 0fb160e3..00000000 --- a/doc/implementors/rustc_unicode/u_str/trait.UnicodeStr.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['bitflags'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/std/error/trait.Error.js b/doc/implementors/std/error/trait.Error.js deleted file mode 100644 index 2cc188d1..00000000 --- a/doc/implementors/std/error/trait.Error.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['regex_syntax'] = ["impl Error for Error",];implementors['regex'] = ["impl Error for Error",];implementors['clap'] = ["impl StdError for Error",]; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/unicode_width/trait.UnicodeWidthChar.js b/doc/implementors/unicode_width/trait.UnicodeWidthChar.js deleted file mode 100644 index 771f3b07..00000000 --- a/doc/implementors/unicode_width/trait.UnicodeWidthChar.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['unicode_width'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/implementors/unicode_width/trait.UnicodeWidthStr.js b/doc/implementors/unicode_width/trait.UnicodeWidthStr.js deleted file mode 100644 index 771f3b07..00000000 --- a/doc/implementors/unicode_width/trait.UnicodeWidthStr.js +++ /dev/null @@ -1,10 +0,0 @@ -(function() {var implementors = {}; -implementors['unicode_width'] = []; - - if (window.register_implementors) { - window.register_implementors(implementors); - } else { - window.pending_implementors = implementors; - } - -})() diff --git a/doc/jquery.js b/doc/jquery.js deleted file mode 100644 index 49990d6e..00000000 --- a/doc/jquery.js +++ /dev/null @@ -1,4 +0,0 @@ -/*! jQuery v2.1.4 | (c) 2005, 2015 jQuery Foundation, Inc. | jquery.org/license */ -!function(a,b){"object"==typeof module&&"object"==typeof module.exports?module.exports=a.document?b(a,!0):function(a){if(!a.document)throw new Error("jQuery requires a window with a document");return b(a)}:b(a)}("undefined"!=typeof window?window:this,function(a,b){var c=[],d=c.slice,e=c.concat,f=c.push,g=c.indexOf,h={},i=h.toString,j=h.hasOwnProperty,k={},l=a.document,m="2.1.4",n=function(a,b){return new n.fn.init(a,b)},o=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g,p=/^-ms-/,q=/-([\da-z])/gi,r=function(a,b){return b.toUpperCase()};n.fn=n.prototype={jquery:m,constructor:n,selector:"",length:0,toArray:function(){return d.call(this)},get:function(a){return null!=a?0>a?this[a+this.length]:this[a]:d.call(this)},pushStack:function(a){var b=n.merge(this.constructor(),a);return b.prevObject=this,b.context=this.context,b},each:function(a,b){return n.each(this,a,b)},map:function(a){return this.pushStack(n.map(this,function(b,c){return a.call(b,c,b)}))},slice:function(){return this.pushStack(d.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},eq:function(a){var b=this.length,c=+a+(0>a?b:0);return this.pushStack(c>=0&&b>c?[this[c]]:[])},end:function(){return this.prevObject||this.constructor(null)},push:f,sort:c.sort,splice:c.splice},n.extend=n.fn.extend=function(){var a,b,c,d,e,f,g=arguments[0]||{},h=1,i=arguments.length,j=!1;for("boolean"==typeof g&&(j=g,g=arguments[h]||{},h++),"object"==typeof g||n.isFunction(g)||(g={}),h===i&&(g=this,h--);i>h;h++)if(null!=(a=arguments[h]))for(b in a)c=g[b],d=a[b],g!==d&&(j&&d&&(n.isPlainObject(d)||(e=n.isArray(d)))?(e?(e=!1,f=c&&n.isArray(c)?c:[]):f=c&&n.isPlainObject(c)?c:{},g[b]=n.extend(j,f,d)):void 0!==d&&(g[b]=d));return g},n.extend({expando:"jQuery"+(m+Math.random()).replace(/\D/g,""),isReady:!0,error:function(a){throw new Error(a)},noop:function(){},isFunction:function(a){return"function"===n.type(a)},isArray:Array.isArray,isWindow:function(a){return null!=a&&a===a.window},isNumeric:function(a){return!n.isArray(a)&&a-parseFloat(a)+1>=0},isPlainObject:function(a){return"object"!==n.type(a)||a.nodeType||n.isWindow(a)?!1:a.constructor&&!j.call(a.constructor.prototype,"isPrototypeOf")?!1:!0},isEmptyObject:function(a){var b;for(b in a)return!1;return!0},type:function(a){return null==a?a+"":"object"==typeof a||"function"==typeof a?h[i.call(a)]||"object":typeof a},globalEval:function(a){var b,c=eval;a=n.trim(a),a&&(1===a.indexOf("use strict")?(b=l.createElement("script"),b.text=a,l.head.appendChild(b).parentNode.removeChild(b)):c(a))},camelCase:function(a){return a.replace(p,"ms-").replace(q,r)},nodeName:function(a,b){return a.nodeName&&a.nodeName.toLowerCase()===b.toLowerCase()},each:function(a,b,c){var d,e=0,f=a.length,g=s(a);if(c){if(g){for(;f>e;e++)if(d=b.apply(a[e],c),d===!1)break}else for(e in a)if(d=b.apply(a[e],c),d===!1)break}else if(g){for(;f>e;e++)if(d=b.call(a[e],e,a[e]),d===!1)break}else for(e in a)if(d=b.call(a[e],e,a[e]),d===!1)break;return a},trim:function(a){return null==a?"":(a+"").replace(o,"")},makeArray:function(a,b){var c=b||[];return null!=a&&(s(Object(a))?n.merge(c,"string"==typeof a?[a]:a):f.call(c,a)),c},inArray:function(a,b,c){return null==b?-1:g.call(b,a,c)},merge:function(a,b){for(var c=+b.length,d=0,e=a.length;c>d;d++)a[e++]=b[d];return a.length=e,a},grep:function(a,b,c){for(var d,e=[],f=0,g=a.length,h=!c;g>f;f++)d=!b(a[f],f),d!==h&&e.push(a[f]);return e},map:function(a,b,c){var d,f=0,g=a.length,h=s(a),i=[];if(h)for(;g>f;f++)d=b(a[f],f,c),null!=d&&i.push(d);else for(f in a)d=b(a[f],f,c),null!=d&&i.push(d);return e.apply([],i)},guid:1,proxy:function(a,b){var c,e,f;return"string"==typeof b&&(c=a[b],b=a,a=c),n.isFunction(a)?(e=d.call(arguments,2),f=function(){return a.apply(b||this,e.concat(d.call(arguments)))},f.guid=a.guid=a.guid||n.guid++,f):void 0},now:Date.now,support:k}),n.each("Boolean Number String Function Array Date RegExp Object Error".split(" "),function(a,b){h["[object "+b+"]"]=b.toLowerCase()});function s(a){var b="length"in a&&a.length,c=n.type(a);return"function"===c||n.isWindow(a)?!1:1===a.nodeType&&b?!0:"array"===c||0===b||"number"==typeof b&&b>0&&b-1 in a}var t=function(a){var b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u="sizzle"+1*new Date,v=a.document,w=0,x=0,y=ha(),z=ha(),A=ha(),B=function(a,b){return a===b&&(l=!0),0},C=1<<31,D={}.hasOwnProperty,E=[],F=E.pop,G=E.push,H=E.push,I=E.slice,J=function(a,b){for(var c=0,d=a.length;d>c;c++)if(a[c]===b)return c;return-1},K="checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped",L="[\\x20\\t\\r\\n\\f]",M="(?:\\\\.|[\\w-]|[^\\x00-\\xa0])+",N=M.replace("w","w#"),O="\\["+L+"*("+M+")(?:"+L+"*([*^$|!~]?=)"+L+"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|("+N+"))|)"+L+"*\\]",P=":("+M+")(?:\\((('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|((?:\\\\.|[^\\\\()[\\]]|"+O+")*)|.*)\\)|)",Q=new RegExp(L+"+","g"),R=new RegExp("^"+L+"+|((?:^|[^\\\\])(?:\\\\.)*)"+L+"+$","g"),S=new RegExp("^"+L+"*,"+L+"*"),T=new RegExp("^"+L+"*([>+~]|"+L+")"+L+"*"),U=new RegExp("="+L+"*([^\\]'\"]*?)"+L+"*\\]","g"),V=new RegExp(P),W=new RegExp("^"+N+"$"),X={ID:new RegExp("^#("+M+")"),CLASS:new RegExp("^\\.("+M+")"),TAG:new RegExp("^("+M.replace("w","w*")+")"),ATTR:new RegExp("^"+O),PSEUDO:new RegExp("^"+P),CHILD:new RegExp("^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\("+L+"*(even|odd|(([+-]|)(\\d*)n|)"+L+"*(?:([+-]|)"+L+"*(\\d+)|))"+L+"*\\)|)","i"),bool:new RegExp("^(?:"+K+")$","i"),needsContext:new RegExp("^"+L+"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\("+L+"*((?:-\\d)?\\d*)"+L+"*\\)|)(?=[^-]|$)","i")},Y=/^(?:input|select|textarea|button)$/i,Z=/^h\d$/i,$=/^[^{]+\{\s*\[native \w/,_=/^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,aa=/[+~]/,ba=/'|\\/g,ca=new RegExp("\\\\([\\da-f]{1,6}"+L+"?|("+L+")|.)","ig"),da=function(a,b,c){var d="0x"+b-65536;return d!==d||c?b:0>d?String.fromCharCode(d+65536):String.fromCharCode(d>>10|55296,1023&d|56320)},ea=function(){m()};try{H.apply(E=I.call(v.childNodes),v.childNodes),E[v.childNodes.length].nodeType}catch(fa){H={apply:E.length?function(a,b){G.apply(a,I.call(b))}:function(a,b){var c=a.length,d=0;while(a[c++]=b[d++]);a.length=c-1}}}function ga(a,b,d,e){var f,h,j,k,l,o,r,s,w,x;if((b?b.ownerDocument||b:v)!==n&&m(b),b=b||n,d=d||[],k=b.nodeType,"string"!=typeof a||!a||1!==k&&9!==k&&11!==k)return d;if(!e&&p){if(11!==k&&(f=_.exec(a)))if(j=f[1]){if(9===k){if(h=b.getElementById(j),!h||!h.parentNode)return d;if(h.id===j)return d.push(h),d}else if(b.ownerDocument&&(h=b.ownerDocument.getElementById(j))&&t(b,h)&&h.id===j)return d.push(h),d}else{if(f[2])return H.apply(d,b.getElementsByTagName(a)),d;if((j=f[3])&&c.getElementsByClassName)return H.apply(d,b.getElementsByClassName(j)),d}if(c.qsa&&(!q||!q.test(a))){if(s=r=u,w=b,x=1!==k&&a,1===k&&"object"!==b.nodeName.toLowerCase()){o=g(a),(r=b.getAttribute("id"))?s=r.replace(ba,"\\$&"):b.setAttribute("id",s),s="[id='"+s+"'] ",l=o.length;while(l--)o[l]=s+ra(o[l]);w=aa.test(a)&&pa(b.parentNode)||b,x=o.join(",")}if(x)try{return H.apply(d,w.querySelectorAll(x)),d}catch(y){}finally{r||b.removeAttribute("id")}}}return i(a.replace(R,"$1"),b,d,e)}function ha(){var a=[];function b(c,e){return a.push(c+" ")>d.cacheLength&&delete b[a.shift()],b[c+" "]=e}return b}function ia(a){return a[u]=!0,a}function ja(a){var b=n.createElement("div");try{return!!a(b)}catch(c){return!1}finally{b.parentNode&&b.parentNode.removeChild(b),b=null}}function ka(a,b){var c=a.split("|"),e=a.length;while(e--)d.attrHandle[c[e]]=b}function la(a,b){var c=b&&a,d=c&&1===a.nodeType&&1===b.nodeType&&(~b.sourceIndex||C)-(~a.sourceIndex||C);if(d)return d;if(c)while(c=c.nextSibling)if(c===b)return-1;return a?1:-1}function ma(a){return function(b){var c=b.nodeName.toLowerCase();return"input"===c&&b.type===a}}function na(a){return function(b){var c=b.nodeName.toLowerCase();return("input"===c||"button"===c)&&b.type===a}}function oa(a){return ia(function(b){return b=+b,ia(function(c,d){var e,f=a([],c.length,b),g=f.length;while(g--)c[e=f[g]]&&(c[e]=!(d[e]=c[e]))})})}function pa(a){return a&&"undefined"!=typeof a.getElementsByTagName&&a}c=ga.support={},f=ga.isXML=function(a){var b=a&&(a.ownerDocument||a).documentElement;return b?"HTML"!==b.nodeName:!1},m=ga.setDocument=function(a){var b,e,g=a?a.ownerDocument||a:v;return g!==n&&9===g.nodeType&&g.documentElement?(n=g,o=g.documentElement,e=g.defaultView,e&&e!==e.top&&(e.addEventListener?e.addEventListener("unload",ea,!1):e.attachEvent&&e.attachEvent("onunload",ea)),p=!f(g),c.attributes=ja(function(a){return a.className="i",!a.getAttribute("className")}),c.getElementsByTagName=ja(function(a){return a.appendChild(g.createComment("")),!a.getElementsByTagName("*").length}),c.getElementsByClassName=$.test(g.getElementsByClassName),c.getById=ja(function(a){return o.appendChild(a).id=u,!g.getElementsByName||!g.getElementsByName(u).length}),c.getById?(d.find.ID=function(a,b){if("undefined"!=typeof b.getElementById&&p){var c=b.getElementById(a);return c&&c.parentNode?[c]:[]}},d.filter.ID=function(a){var b=a.replace(ca,da);return function(a){return a.getAttribute("id")===b}}):(delete d.find.ID,d.filter.ID=function(a){var b=a.replace(ca,da);return function(a){var c="undefined"!=typeof a.getAttributeNode&&a.getAttributeNode("id");return c&&c.value===b}}),d.find.TAG=c.getElementsByTagName?function(a,b){return"undefined"!=typeof b.getElementsByTagName?b.getElementsByTagName(a):c.qsa?b.querySelectorAll(a):void 0}:function(a,b){var c,d=[],e=0,f=b.getElementsByTagName(a);if("*"===a){while(c=f[e++])1===c.nodeType&&d.push(c);return d}return f},d.find.CLASS=c.getElementsByClassName&&function(a,b){return p?b.getElementsByClassName(a):void 0},r=[],q=[],(c.qsa=$.test(g.querySelectorAll))&&(ja(function(a){o.appendChild(a).innerHTML="",a.querySelectorAll("[msallowcapture^='']").length&&q.push("[*^$]="+L+"*(?:''|\"\")"),a.querySelectorAll("[selected]").length||q.push("\\["+L+"*(?:value|"+K+")"),a.querySelectorAll("[id~="+u+"-]").length||q.push("~="),a.querySelectorAll(":checked").length||q.push(":checked"),a.querySelectorAll("a#"+u+"+*").length||q.push(".#.+[+~]")}),ja(function(a){var b=g.createElement("input");b.setAttribute("type","hidden"),a.appendChild(b).setAttribute("name","D"),a.querySelectorAll("[name=d]").length&&q.push("name"+L+"*[*^$|!~]?="),a.querySelectorAll(":enabled").length||q.push(":enabled",":disabled"),a.querySelectorAll("*,:x"),q.push(",.*:")})),(c.matchesSelector=$.test(s=o.matches||o.webkitMatchesSelector||o.mozMatchesSelector||o.oMatchesSelector||o.msMatchesSelector))&&ja(function(a){c.disconnectedMatch=s.call(a,"div"),s.call(a,"[s!='']:x"),r.push("!=",P)}),q=q.length&&new RegExp(q.join("|")),r=r.length&&new RegExp(r.join("|")),b=$.test(o.compareDocumentPosition),t=b||$.test(o.contains)?function(a,b){var c=9===a.nodeType?a.documentElement:a,d=b&&b.parentNode;return a===d||!(!d||1!==d.nodeType||!(c.contains?c.contains(d):a.compareDocumentPosition&&16&a.compareDocumentPosition(d)))}:function(a,b){if(b)while(b=b.parentNode)if(b===a)return!0;return!1},B=b?function(a,b){if(a===b)return l=!0,0;var d=!a.compareDocumentPosition-!b.compareDocumentPosition;return d?d:(d=(a.ownerDocument||a)===(b.ownerDocument||b)?a.compareDocumentPosition(b):1,1&d||!c.sortDetached&&b.compareDocumentPosition(a)===d?a===g||a.ownerDocument===v&&t(v,a)?-1:b===g||b.ownerDocument===v&&t(v,b)?1:k?J(k,a)-J(k,b):0:4&d?-1:1)}:function(a,b){if(a===b)return l=!0,0;var c,d=0,e=a.parentNode,f=b.parentNode,h=[a],i=[b];if(!e||!f)return a===g?-1:b===g?1:e?-1:f?1:k?J(k,a)-J(k,b):0;if(e===f)return la(a,b);c=a;while(c=c.parentNode)h.unshift(c);c=b;while(c=c.parentNode)i.unshift(c);while(h[d]===i[d])d++;return d?la(h[d],i[d]):h[d]===v?-1:i[d]===v?1:0},g):n},ga.matches=function(a,b){return ga(a,null,null,b)},ga.matchesSelector=function(a,b){if((a.ownerDocument||a)!==n&&m(a),b=b.replace(U,"='$1']"),!(!c.matchesSelector||!p||r&&r.test(b)||q&&q.test(b)))try{var d=s.call(a,b);if(d||c.disconnectedMatch||a.document&&11!==a.document.nodeType)return d}catch(e){}return ga(b,n,null,[a]).length>0},ga.contains=function(a,b){return(a.ownerDocument||a)!==n&&m(a),t(a,b)},ga.attr=function(a,b){(a.ownerDocument||a)!==n&&m(a);var e=d.attrHandle[b.toLowerCase()],f=e&&D.call(d.attrHandle,b.toLowerCase())?e(a,b,!p):void 0;return void 0!==f?f:c.attributes||!p?a.getAttribute(b):(f=a.getAttributeNode(b))&&f.specified?f.value:null},ga.error=function(a){throw new Error("Syntax error, unrecognized expression: "+a)},ga.uniqueSort=function(a){var b,d=[],e=0,f=0;if(l=!c.detectDuplicates,k=!c.sortStable&&a.slice(0),a.sort(B),l){while(b=a[f++])b===a[f]&&(e=d.push(f));while(e--)a.splice(d[e],1)}return k=null,a},e=ga.getText=function(a){var b,c="",d=0,f=a.nodeType;if(f){if(1===f||9===f||11===f){if("string"==typeof a.textContent)return a.textContent;for(a=a.firstChild;a;a=a.nextSibling)c+=e(a)}else if(3===f||4===f)return a.nodeValue}else while(b=a[d++])c+=e(b);return c},d=ga.selectors={cacheLength:50,createPseudo:ia,match:X,attrHandle:{},find:{},relative:{">":{dir:"parentNode",first:!0}," ":{dir:"parentNode"},"+":{dir:"previousSibling",first:!0},"~":{dir:"previousSibling"}},preFilter:{ATTR:function(a){return a[1]=a[1].replace(ca,da),a[3]=(a[3]||a[4]||a[5]||"").replace(ca,da),"~="===a[2]&&(a[3]=" "+a[3]+" "),a.slice(0,4)},CHILD:function(a){return a[1]=a[1].toLowerCase(),"nth"===a[1].slice(0,3)?(a[3]||ga.error(a[0]),a[4]=+(a[4]?a[5]+(a[6]||1):2*("even"===a[3]||"odd"===a[3])),a[5]=+(a[7]+a[8]||"odd"===a[3])):a[3]&&ga.error(a[0]),a},PSEUDO:function(a){var b,c=!a[6]&&a[2];return X.CHILD.test(a[0])?null:(a[3]?a[2]=a[4]||a[5]||"":c&&V.test(c)&&(b=g(c,!0))&&(b=c.indexOf(")",c.length-b)-c.length)&&(a[0]=a[0].slice(0,b),a[2]=c.slice(0,b)),a.slice(0,3))}},filter:{TAG:function(a){var b=a.replace(ca,da).toLowerCase();return"*"===a?function(){return!0}:function(a){return a.nodeName&&a.nodeName.toLowerCase()===b}},CLASS:function(a){var b=y[a+" "];return b||(b=new RegExp("(^|"+L+")"+a+"("+L+"|$)"))&&y(a,function(a){return b.test("string"==typeof a.className&&a.className||"undefined"!=typeof a.getAttribute&&a.getAttribute("class")||"")})},ATTR:function(a,b,c){return function(d){var e=ga.attr(d,a);return null==e?"!="===b:b?(e+="","="===b?e===c:"!="===b?e!==c:"^="===b?c&&0===e.indexOf(c):"*="===b?c&&e.indexOf(c)>-1:"$="===b?c&&e.slice(-c.length)===c:"~="===b?(" "+e.replace(Q," ")+" ").indexOf(c)>-1:"|="===b?e===c||e.slice(0,c.length+1)===c+"-":!1):!0}},CHILD:function(a,b,c,d,e){var f="nth"!==a.slice(0,3),g="last"!==a.slice(-4),h="of-type"===b;return 1===d&&0===e?function(a){return!!a.parentNode}:function(b,c,i){var j,k,l,m,n,o,p=f!==g?"nextSibling":"previousSibling",q=b.parentNode,r=h&&b.nodeName.toLowerCase(),s=!i&&!h;if(q){if(f){while(p){l=b;while(l=l[p])if(h?l.nodeName.toLowerCase()===r:1===l.nodeType)return!1;o=p="only"===a&&!o&&"nextSibling"}return!0}if(o=[g?q.firstChild:q.lastChild],g&&s){k=q[u]||(q[u]={}),j=k[a]||[],n=j[0]===w&&j[1],m=j[0]===w&&j[2],l=n&&q.childNodes[n];while(l=++n&&l&&l[p]||(m=n=0)||o.pop())if(1===l.nodeType&&++m&&l===b){k[a]=[w,n,m];break}}else if(s&&(j=(b[u]||(b[u]={}))[a])&&j[0]===w)m=j[1];else while(l=++n&&l&&l[p]||(m=n=0)||o.pop())if((h?l.nodeName.toLowerCase()===r:1===l.nodeType)&&++m&&(s&&((l[u]||(l[u]={}))[a]=[w,m]),l===b))break;return m-=e,m===d||m%d===0&&m/d>=0}}},PSEUDO:function(a,b){var c,e=d.pseudos[a]||d.setFilters[a.toLowerCase()]||ga.error("unsupported pseudo: "+a);return e[u]?e(b):e.length>1?(c=[a,a,"",b],d.setFilters.hasOwnProperty(a.toLowerCase())?ia(function(a,c){var d,f=e(a,b),g=f.length;while(g--)d=J(a,f[g]),a[d]=!(c[d]=f[g])}):function(a){return e(a,0,c)}):e}},pseudos:{not:ia(function(a){var b=[],c=[],d=h(a.replace(R,"$1"));return d[u]?ia(function(a,b,c,e){var f,g=d(a,null,e,[]),h=a.length;while(h--)(f=g[h])&&(a[h]=!(b[h]=f))}):function(a,e,f){return b[0]=a,d(b,null,f,c),b[0]=null,!c.pop()}}),has:ia(function(a){return function(b){return ga(a,b).length>0}}),contains:ia(function(a){return a=a.replace(ca,da),function(b){return(b.textContent||b.innerText||e(b)).indexOf(a)>-1}}),lang:ia(function(a){return W.test(a||"")||ga.error("unsupported lang: "+a),a=a.replace(ca,da).toLowerCase(),function(b){var c;do if(c=p?b.lang:b.getAttribute("xml:lang")||b.getAttribute("lang"))return c=c.toLowerCase(),c===a||0===c.indexOf(a+"-");while((b=b.parentNode)&&1===b.nodeType);return!1}}),target:function(b){var c=a.location&&a.location.hash;return c&&c.slice(1)===b.id},root:function(a){return a===o},focus:function(a){return a===n.activeElement&&(!n.hasFocus||n.hasFocus())&&!!(a.type||a.href||~a.tabIndex)},enabled:function(a){return a.disabled===!1},disabled:function(a){return a.disabled===!0},checked:function(a){var b=a.nodeName.toLowerCase();return"input"===b&&!!a.checked||"option"===b&&!!a.selected},selected:function(a){return a.parentNode&&a.parentNode.selectedIndex,a.selected===!0},empty:function(a){for(a=a.firstChild;a;a=a.nextSibling)if(a.nodeType<6)return!1;return!0},parent:function(a){return!d.pseudos.empty(a)},header:function(a){return Z.test(a.nodeName)},input:function(a){return Y.test(a.nodeName)},button:function(a){var b=a.nodeName.toLowerCase();return"input"===b&&"button"===a.type||"button"===b},text:function(a){var b;return"input"===a.nodeName.toLowerCase()&&"text"===a.type&&(null==(b=a.getAttribute("type"))||"text"===b.toLowerCase())},first:oa(function(){return[0]}),last:oa(function(a,b){return[b-1]}),eq:oa(function(a,b,c){return[0>c?c+b:c]}),even:oa(function(a,b){for(var c=0;b>c;c+=2)a.push(c);return a}),odd:oa(function(a,b){for(var c=1;b>c;c+=2)a.push(c);return a}),lt:oa(function(a,b,c){for(var d=0>c?c+b:c;--d>=0;)a.push(d);return a}),gt:oa(function(a,b,c){for(var d=0>c?c+b:c;++db;b++)d+=a[b].value;return d}function sa(a,b,c){var d=b.dir,e=c&&"parentNode"===d,f=x++;return b.first?function(b,c,f){while(b=b[d])if(1===b.nodeType||e)return a(b,c,f)}:function(b,c,g){var h,i,j=[w,f];if(g){while(b=b[d])if((1===b.nodeType||e)&&a(b,c,g))return!0}else while(b=b[d])if(1===b.nodeType||e){if(i=b[u]||(b[u]={}),(h=i[d])&&h[0]===w&&h[1]===f)return j[2]=h[2];if(i[d]=j,j[2]=a(b,c,g))return!0}}}function ta(a){return a.length>1?function(b,c,d){var e=a.length;while(e--)if(!a[e](b,c,d))return!1;return!0}:a[0]}function ua(a,b,c){for(var d=0,e=b.length;e>d;d++)ga(a,b[d],c);return c}function va(a,b,c,d,e){for(var f,g=[],h=0,i=a.length,j=null!=b;i>h;h++)(f=a[h])&&(!c||c(f,d,e))&&(g.push(f),j&&b.push(h));return g}function wa(a,b,c,d,e,f){return d&&!d[u]&&(d=wa(d)),e&&!e[u]&&(e=wa(e,f)),ia(function(f,g,h,i){var j,k,l,m=[],n=[],o=g.length,p=f||ua(b||"*",h.nodeType?[h]:h,[]),q=!a||!f&&b?p:va(p,m,a,h,i),r=c?e||(f?a:o||d)?[]:g:q;if(c&&c(q,r,h,i),d){j=va(r,n),d(j,[],h,i),k=j.length;while(k--)(l=j[k])&&(r[n[k]]=!(q[n[k]]=l))}if(f){if(e||a){if(e){j=[],k=r.length;while(k--)(l=r[k])&&j.push(q[k]=l);e(null,r=[],j,i)}k=r.length;while(k--)(l=r[k])&&(j=e?J(f,l):m[k])>-1&&(f[j]=!(g[j]=l))}}else r=va(r===g?r.splice(o,r.length):r),e?e(null,g,r,i):H.apply(g,r)})}function xa(a){for(var b,c,e,f=a.length,g=d.relative[a[0].type],h=g||d.relative[" "],i=g?1:0,k=sa(function(a){return a===b},h,!0),l=sa(function(a){return J(b,a)>-1},h,!0),m=[function(a,c,d){var e=!g&&(d||c!==j)||((b=c).nodeType?k(a,c,d):l(a,c,d));return b=null,e}];f>i;i++)if(c=d.relative[a[i].type])m=[sa(ta(m),c)];else{if(c=d.filter[a[i].type].apply(null,a[i].matches),c[u]){for(e=++i;f>e;e++)if(d.relative[a[e].type])break;return wa(i>1&&ta(m),i>1&&ra(a.slice(0,i-1).concat({value:" "===a[i-2].type?"*":""})).replace(R,"$1"),c,e>i&&xa(a.slice(i,e)),f>e&&xa(a=a.slice(e)),f>e&&ra(a))}m.push(c)}return ta(m)}function ya(a,b){var c=b.length>0,e=a.length>0,f=function(f,g,h,i,k){var l,m,o,p=0,q="0",r=f&&[],s=[],t=j,u=f||e&&d.find.TAG("*",k),v=w+=null==t?1:Math.random()||.1,x=u.length;for(k&&(j=g!==n&&g);q!==x&&null!=(l=u[q]);q++){if(e&&l){m=0;while(o=a[m++])if(o(l,g,h)){i.push(l);break}k&&(w=v)}c&&((l=!o&&l)&&p--,f&&r.push(l))}if(p+=q,c&&q!==p){m=0;while(o=b[m++])o(r,s,g,h);if(f){if(p>0)while(q--)r[q]||s[q]||(s[q]=F.call(i));s=va(s)}H.apply(i,s),k&&!f&&s.length>0&&p+b.length>1&&ga.uniqueSort(i)}return k&&(w=v,j=t),r};return c?ia(f):f}return h=ga.compile=function(a,b){var c,d=[],e=[],f=A[a+" "];if(!f){b||(b=g(a)),c=b.length;while(c--)f=xa(b[c]),f[u]?d.push(f):e.push(f);f=A(a,ya(e,d)),f.selector=a}return f},i=ga.select=function(a,b,e,f){var i,j,k,l,m,n="function"==typeof a&&a,o=!f&&g(a=n.selector||a);if(e=e||[],1===o.length){if(j=o[0]=o[0].slice(0),j.length>2&&"ID"===(k=j[0]).type&&c.getById&&9===b.nodeType&&p&&d.relative[j[1].type]){if(b=(d.find.ID(k.matches[0].replace(ca,da),b)||[])[0],!b)return e;n&&(b=b.parentNode),a=a.slice(j.shift().value.length)}i=X.needsContext.test(a)?0:j.length;while(i--){if(k=j[i],d.relative[l=k.type])break;if((m=d.find[l])&&(f=m(k.matches[0].replace(ca,da),aa.test(j[0].type)&&pa(b.parentNode)||b))){if(j.splice(i,1),a=f.length&&ra(j),!a)return H.apply(e,f),e;break}}}return(n||h(a,o))(f,b,!p,e,aa.test(a)&&pa(b.parentNode)||b),e},c.sortStable=u.split("").sort(B).join("")===u,c.detectDuplicates=!!l,m(),c.sortDetached=ja(function(a){return 1&a.compareDocumentPosition(n.createElement("div"))}),ja(function(a){return a.innerHTML="","#"===a.firstChild.getAttribute("href")})||ka("type|href|height|width",function(a,b,c){return c?void 0:a.getAttribute(b,"type"===b.toLowerCase()?1:2)}),c.attributes&&ja(function(a){return a.innerHTML="",a.firstChild.setAttribute("value",""),""===a.firstChild.getAttribute("value")})||ka("value",function(a,b,c){return c||"input"!==a.nodeName.toLowerCase()?void 0:a.defaultValue}),ja(function(a){return null==a.getAttribute("disabled")})||ka(K,function(a,b,c){var d;return c?void 0:a[b]===!0?b.toLowerCase():(d=a.getAttributeNode(b))&&d.specified?d.value:null}),ga}(a);n.find=t,n.expr=t.selectors,n.expr[":"]=n.expr.pseudos,n.unique=t.uniqueSort,n.text=t.getText,n.isXMLDoc=t.isXML,n.contains=t.contains;var u=n.expr.match.needsContext,v=/^<(\w+)\s*\/?>(?:<\/\1>|)$/,w=/^.[^:#\[\.,]*$/;function x(a,b,c){if(n.isFunction(b))return n.grep(a,function(a,d){return!!b.call(a,d,a)!==c});if(b.nodeType)return n.grep(a,function(a){return a===b!==c});if("string"==typeof b){if(w.test(b))return n.filter(b,a,c);b=n.filter(b,a)}return n.grep(a,function(a){return g.call(b,a)>=0!==c})}n.filter=function(a,b,c){var d=b[0];return c&&(a=":not("+a+")"),1===b.length&&1===d.nodeType?n.find.matchesSelector(d,a)?[d]:[]:n.find.matches(a,n.grep(b,function(a){return 1===a.nodeType}))},n.fn.extend({find:function(a){var b,c=this.length,d=[],e=this;if("string"!=typeof a)return this.pushStack(n(a).filter(function(){for(b=0;c>b;b++)if(n.contains(e[b],this))return!0}));for(b=0;c>b;b++)n.find(a,e[b],d);return d=this.pushStack(c>1?n.unique(d):d),d.selector=this.selector?this.selector+" "+a:a,d},filter:function(a){return this.pushStack(x(this,a||[],!1))},not:function(a){return this.pushStack(x(this,a||[],!0))},is:function(a){return!!x(this,"string"==typeof a&&u.test(a)?n(a):a||[],!1).length}});var y,z=/^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]*))$/,A=n.fn.init=function(a,b){var c,d;if(!a)return this;if("string"==typeof a){if(c="<"===a[0]&&">"===a[a.length-1]&&a.length>=3?[null,a,null]:z.exec(a),!c||!c[1]&&b)return!b||b.jquery?(b||y).find(a):this.constructor(b).find(a);if(c[1]){if(b=b instanceof n?b[0]:b,n.merge(this,n.parseHTML(c[1],b&&b.nodeType?b.ownerDocument||b:l,!0)),v.test(c[1])&&n.isPlainObject(b))for(c in b)n.isFunction(this[c])?this[c](b[c]):this.attr(c,b[c]);return this}return d=l.getElementById(c[2]),d&&d.parentNode&&(this.length=1,this[0]=d),this.context=l,this.selector=a,this}return a.nodeType?(this.context=this[0]=a,this.length=1,this):n.isFunction(a)?"undefined"!=typeof y.ready?y.ready(a):a(n):(void 0!==a.selector&&(this.selector=a.selector,this.context=a.context),n.makeArray(a,this))};A.prototype=n.fn,y=n(l);var B=/^(?:parents|prev(?:Until|All))/,C={children:!0,contents:!0,next:!0,prev:!0};n.extend({dir:function(a,b,c){var d=[],e=void 0!==c;while((a=a[b])&&9!==a.nodeType)if(1===a.nodeType){if(e&&n(a).is(c))break;d.push(a)}return d},sibling:function(a,b){for(var c=[];a;a=a.nextSibling)1===a.nodeType&&a!==b&&c.push(a);return c}}),n.fn.extend({has:function(a){var b=n(a,this),c=b.length;return this.filter(function(){for(var a=0;c>a;a++)if(n.contains(this,b[a]))return!0})},closest:function(a,b){for(var c,d=0,e=this.length,f=[],g=u.test(a)||"string"!=typeof a?n(a,b||this.context):0;e>d;d++)for(c=this[d];c&&c!==b;c=c.parentNode)if(c.nodeType<11&&(g?g.index(c)>-1:1===c.nodeType&&n.find.matchesSelector(c,a))){f.push(c);break}return this.pushStack(f.length>1?n.unique(f):f)},index:function(a){return a?"string"==typeof a?g.call(n(a),this[0]):g.call(this,a.jquery?a[0]:a):this[0]&&this[0].parentNode?this.first().prevAll().length:-1},add:function(a,b){return this.pushStack(n.unique(n.merge(this.get(),n(a,b))))},addBack:function(a){return this.add(null==a?this.prevObject:this.prevObject.filter(a))}});function D(a,b){while((a=a[b])&&1!==a.nodeType);return a}n.each({parent:function(a){var b=a.parentNode;return b&&11!==b.nodeType?b:null},parents:function(a){return n.dir(a,"parentNode")},parentsUntil:function(a,b,c){return n.dir(a,"parentNode",c)},next:function(a){return D(a,"nextSibling")},prev:function(a){return D(a,"previousSibling")},nextAll:function(a){return n.dir(a,"nextSibling")},prevAll:function(a){return n.dir(a,"previousSibling")},nextUntil:function(a,b,c){return n.dir(a,"nextSibling",c)},prevUntil:function(a,b,c){return n.dir(a,"previousSibling",c)},siblings:function(a){return n.sibling((a.parentNode||{}).firstChild,a)},children:function(a){return n.sibling(a.firstChild)},contents:function(a){return a.contentDocument||n.merge([],a.childNodes)}},function(a,b){n.fn[a]=function(c,d){var e=n.map(this,b,c);return"Until"!==a.slice(-5)&&(d=c),d&&"string"==typeof d&&(e=n.filter(d,e)),this.length>1&&(C[a]||n.unique(e),B.test(a)&&e.reverse()),this.pushStack(e)}});var E=/\S+/g,F={};function G(a){var b=F[a]={};return n.each(a.match(E)||[],function(a,c){b[c]=!0}),b}n.Callbacks=function(a){a="string"==typeof a?F[a]||G(a):n.extend({},a);var b,c,d,e,f,g,h=[],i=!a.once&&[],j=function(l){for(b=a.memory&&l,c=!0,g=e||0,e=0,f=h.length,d=!0;h&&f>g;g++)if(h[g].apply(l[0],l[1])===!1&&a.stopOnFalse){b=!1;break}d=!1,h&&(i?i.length&&j(i.shift()):b?h=[]:k.disable())},k={add:function(){if(h){var c=h.length;!function g(b){n.each(b,function(b,c){var d=n.type(c);"function"===d?a.unique&&k.has(c)||h.push(c):c&&c.length&&"string"!==d&&g(c)})}(arguments),d?f=h.length:b&&(e=c,j(b))}return this},remove:function(){return h&&n.each(arguments,function(a,b){var c;while((c=n.inArray(b,h,c))>-1)h.splice(c,1),d&&(f>=c&&f--,g>=c&&g--)}),this},has:function(a){return a?n.inArray(a,h)>-1:!(!h||!h.length)},empty:function(){return h=[],f=0,this},disable:function(){return h=i=b=void 0,this},disabled:function(){return!h},lock:function(){return i=void 0,b||k.disable(),this},locked:function(){return!i},fireWith:function(a,b){return!h||c&&!i||(b=b||[],b=[a,b.slice?b.slice():b],d?i.push(b):j(b)),this},fire:function(){return k.fireWith(this,arguments),this},fired:function(){return!!c}};return k},n.extend({Deferred:function(a){var b=[["resolve","done",n.Callbacks("once memory"),"resolved"],["reject","fail",n.Callbacks("once memory"),"rejected"],["notify","progress",n.Callbacks("memory")]],c="pending",d={state:function(){return c},always:function(){return e.done(arguments).fail(arguments),this},then:function(){var a=arguments;return n.Deferred(function(c){n.each(b,function(b,f){var g=n.isFunction(a[b])&&a[b];e[f[1]](function(){var a=g&&g.apply(this,arguments);a&&n.isFunction(a.promise)?a.promise().done(c.resolve).fail(c.reject).progress(c.notify):c[f[0]+"With"](this===d?c.promise():this,g?[a]:arguments)})}),a=null}).promise()},promise:function(a){return null!=a?n.extend(a,d):d}},e={};return d.pipe=d.then,n.each(b,function(a,f){var g=f[2],h=f[3];d[f[1]]=g.add,h&&g.add(function(){c=h},b[1^a][2].disable,b[2][2].lock),e[f[0]]=function(){return e[f[0]+"With"](this===e?d:this,arguments),this},e[f[0]+"With"]=g.fireWith}),d.promise(e),a&&a.call(e,e),e},when:function(a){var b=0,c=d.call(arguments),e=c.length,f=1!==e||a&&n.isFunction(a.promise)?e:0,g=1===f?a:n.Deferred(),h=function(a,b,c){return function(e){b[a]=this,c[a]=arguments.length>1?d.call(arguments):e,c===i?g.notifyWith(b,c):--f||g.resolveWith(b,c)}},i,j,k;if(e>1)for(i=new Array(e),j=new Array(e),k=new Array(e);e>b;b++)c[b]&&n.isFunction(c[b].promise)?c[b].promise().done(h(b,k,c)).fail(g.reject).progress(h(b,j,i)):--f;return f||g.resolveWith(k,c),g.promise()}});var H;n.fn.ready=function(a){return n.ready.promise().done(a),this},n.extend({isReady:!1,readyWait:1,holdReady:function(a){a?n.readyWait++:n.ready(!0)},ready:function(a){(a===!0?--n.readyWait:n.isReady)||(n.isReady=!0,a!==!0&&--n.readyWait>0||(H.resolveWith(l,[n]),n.fn.triggerHandler&&(n(l).triggerHandler("ready"),n(l).off("ready"))))}});function I(){l.removeEventListener("DOMContentLoaded",I,!1),a.removeEventListener("load",I,!1),n.ready()}n.ready.promise=function(b){return H||(H=n.Deferred(),"complete"===l.readyState?setTimeout(n.ready):(l.addEventListener("DOMContentLoaded",I,!1),a.addEventListener("load",I,!1))),H.promise(b)},n.ready.promise();var J=n.access=function(a,b,c,d,e,f,g){var h=0,i=a.length,j=null==c;if("object"===n.type(c)){e=!0;for(h in c)n.access(a,b,h,c[h],!0,f,g)}else if(void 0!==d&&(e=!0,n.isFunction(d)||(g=!0),j&&(g?(b.call(a,d),b=null):(j=b,b=function(a,b,c){return j.call(n(a),c)})),b))for(;i>h;h++)b(a[h],c,g?d:d.call(a[h],h,b(a[h],c)));return e?a:j?b.call(a):i?b(a[0],c):f};n.acceptData=function(a){return 1===a.nodeType||9===a.nodeType||!+a.nodeType};function K(){Object.defineProperty(this.cache={},0,{get:function(){return{}}}),this.expando=n.expando+K.uid++}K.uid=1,K.accepts=n.acceptData,K.prototype={key:function(a){if(!K.accepts(a))return 0;var b={},c=a[this.expando];if(!c){c=K.uid++;try{b[this.expando]={value:c},Object.defineProperties(a,b)}catch(d){b[this.expando]=c,n.extend(a,b)}}return this.cache[c]||(this.cache[c]={}),c},set:function(a,b,c){var d,e=this.key(a),f=this.cache[e];if("string"==typeof b)f[b]=c;else if(n.isEmptyObject(f))n.extend(this.cache[e],b);else for(d in b)f[d]=b[d];return f},get:function(a,b){var c=this.cache[this.key(a)];return void 0===b?c:c[b]},access:function(a,b,c){var d;return void 0===b||b&&"string"==typeof b&&void 0===c?(d=this.get(a,b),void 0!==d?d:this.get(a,n.camelCase(b))):(this.set(a,b,c),void 0!==c?c:b)},remove:function(a,b){var c,d,e,f=this.key(a),g=this.cache[f];if(void 0===b)this.cache[f]={};else{n.isArray(b)?d=b.concat(b.map(n.camelCase)):(e=n.camelCase(b),b in g?d=[b,e]:(d=e,d=d in g?[d]:d.match(E)||[])),c=d.length;while(c--)delete g[d[c]]}},hasData:function(a){return!n.isEmptyObject(this.cache[a[this.expando]]||{})},discard:function(a){a[this.expando]&&delete this.cache[a[this.expando]]}};var L=new K,M=new K,N=/^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,O=/([A-Z])/g;function P(a,b,c){var d;if(void 0===c&&1===a.nodeType)if(d="data-"+b.replace(O,"-$1").toLowerCase(),c=a.getAttribute(d),"string"==typeof c){try{c="true"===c?!0:"false"===c?!1:"null"===c?null:+c+""===c?+c:N.test(c)?n.parseJSON(c):c}catch(e){}M.set(a,b,c)}else c=void 0;return c}n.extend({hasData:function(a){return M.hasData(a)||L.hasData(a)},data:function(a,b,c){ -return M.access(a,b,c)},removeData:function(a,b){M.remove(a,b)},_data:function(a,b,c){return L.access(a,b,c)},_removeData:function(a,b){L.remove(a,b)}}),n.fn.extend({data:function(a,b){var c,d,e,f=this[0],g=f&&f.attributes;if(void 0===a){if(this.length&&(e=M.get(f),1===f.nodeType&&!L.get(f,"hasDataAttrs"))){c=g.length;while(c--)g[c]&&(d=g[c].name,0===d.indexOf("data-")&&(d=n.camelCase(d.slice(5)),P(f,d,e[d])));L.set(f,"hasDataAttrs",!0)}return e}return"object"==typeof a?this.each(function(){M.set(this,a)}):J(this,function(b){var c,d=n.camelCase(a);if(f&&void 0===b){if(c=M.get(f,a),void 0!==c)return c;if(c=M.get(f,d),void 0!==c)return c;if(c=P(f,d,void 0),void 0!==c)return c}else this.each(function(){var c=M.get(this,d);M.set(this,d,b),-1!==a.indexOf("-")&&void 0!==c&&M.set(this,a,b)})},null,b,arguments.length>1,null,!0)},removeData:function(a){return this.each(function(){M.remove(this,a)})}}),n.extend({queue:function(a,b,c){var d;return a?(b=(b||"fx")+"queue",d=L.get(a,b),c&&(!d||n.isArray(c)?d=L.access(a,b,n.makeArray(c)):d.push(c)),d||[]):void 0},dequeue:function(a,b){b=b||"fx";var c=n.queue(a,b),d=c.length,e=c.shift(),f=n._queueHooks(a,b),g=function(){n.dequeue(a,b)};"inprogress"===e&&(e=c.shift(),d--),e&&("fx"===b&&c.unshift("inprogress"),delete f.stop,e.call(a,g,f)),!d&&f&&f.empty.fire()},_queueHooks:function(a,b){var c=b+"queueHooks";return L.get(a,c)||L.access(a,c,{empty:n.Callbacks("once memory").add(function(){L.remove(a,[b+"queue",c])})})}}),n.fn.extend({queue:function(a,b){var c=2;return"string"!=typeof a&&(b=a,a="fx",c--),arguments.lengthx",k.noCloneChecked=!!b.cloneNode(!0).lastChild.defaultValue}();var U="undefined";k.focusinBubbles="onfocusin"in a;var V=/^key/,W=/^(?:mouse|pointer|contextmenu)|click/,X=/^(?:focusinfocus|focusoutblur)$/,Y=/^([^.]*)(?:\.(.+)|)$/;function Z(){return!0}function $(){return!1}function _(){try{return l.activeElement}catch(a){}}n.event={global:{},add:function(a,b,c,d,e){var f,g,h,i,j,k,l,m,o,p,q,r=L.get(a);if(r){c.handler&&(f=c,c=f.handler,e=f.selector),c.guid||(c.guid=n.guid++),(i=r.events)||(i=r.events={}),(g=r.handle)||(g=r.handle=function(b){return typeof n!==U&&n.event.triggered!==b.type?n.event.dispatch.apply(a,arguments):void 0}),b=(b||"").match(E)||[""],j=b.length;while(j--)h=Y.exec(b[j])||[],o=q=h[1],p=(h[2]||"").split(".").sort(),o&&(l=n.event.special[o]||{},o=(e?l.delegateType:l.bindType)||o,l=n.event.special[o]||{},k=n.extend({type:o,origType:q,data:d,handler:c,guid:c.guid,selector:e,needsContext:e&&n.expr.match.needsContext.test(e),namespace:p.join(".")},f),(m=i[o])||(m=i[o]=[],m.delegateCount=0,l.setup&&l.setup.call(a,d,p,g)!==!1||a.addEventListener&&a.addEventListener(o,g,!1)),l.add&&(l.add.call(a,k),k.handler.guid||(k.handler.guid=c.guid)),e?m.splice(m.delegateCount++,0,k):m.push(k),n.event.global[o]=!0)}},remove:function(a,b,c,d,e){var f,g,h,i,j,k,l,m,o,p,q,r=L.hasData(a)&&L.get(a);if(r&&(i=r.events)){b=(b||"").match(E)||[""],j=b.length;while(j--)if(h=Y.exec(b[j])||[],o=q=h[1],p=(h[2]||"").split(".").sort(),o){l=n.event.special[o]||{},o=(d?l.delegateType:l.bindType)||o,m=i[o]||[],h=h[2]&&new RegExp("(^|\\.)"+p.join("\\.(?:.*\\.|)")+"(\\.|$)"),g=f=m.length;while(f--)k=m[f],!e&&q!==k.origType||c&&c.guid!==k.guid||h&&!h.test(k.namespace)||d&&d!==k.selector&&("**"!==d||!k.selector)||(m.splice(f,1),k.selector&&m.delegateCount--,l.remove&&l.remove.call(a,k));g&&!m.length&&(l.teardown&&l.teardown.call(a,p,r.handle)!==!1||n.removeEvent(a,o,r.handle),delete i[o])}else for(o in i)n.event.remove(a,o+b[j],c,d,!0);n.isEmptyObject(i)&&(delete r.handle,L.remove(a,"events"))}},trigger:function(b,c,d,e){var f,g,h,i,k,m,o,p=[d||l],q=j.call(b,"type")?b.type:b,r=j.call(b,"namespace")?b.namespace.split("."):[];if(g=h=d=d||l,3!==d.nodeType&&8!==d.nodeType&&!X.test(q+n.event.triggered)&&(q.indexOf(".")>=0&&(r=q.split("."),q=r.shift(),r.sort()),k=q.indexOf(":")<0&&"on"+q,b=b[n.expando]?b:new n.Event(q,"object"==typeof b&&b),b.isTrigger=e?2:3,b.namespace=r.join("."),b.namespace_re=b.namespace?new RegExp("(^|\\.)"+r.join("\\.(?:.*\\.|)")+"(\\.|$)"):null,b.result=void 0,b.target||(b.target=d),c=null==c?[b]:n.makeArray(c,[b]),o=n.event.special[q]||{},e||!o.trigger||o.trigger.apply(d,c)!==!1)){if(!e&&!o.noBubble&&!n.isWindow(d)){for(i=o.delegateType||q,X.test(i+q)||(g=g.parentNode);g;g=g.parentNode)p.push(g),h=g;h===(d.ownerDocument||l)&&p.push(h.defaultView||h.parentWindow||a)}f=0;while((g=p[f++])&&!b.isPropagationStopped())b.type=f>1?i:o.bindType||q,m=(L.get(g,"events")||{})[b.type]&&L.get(g,"handle"),m&&m.apply(g,c),m=k&&g[k],m&&m.apply&&n.acceptData(g)&&(b.result=m.apply(g,c),b.result===!1&&b.preventDefault());return b.type=q,e||b.isDefaultPrevented()||o._default&&o._default.apply(p.pop(),c)!==!1||!n.acceptData(d)||k&&n.isFunction(d[q])&&!n.isWindow(d)&&(h=d[k],h&&(d[k]=null),n.event.triggered=q,d[q](),n.event.triggered=void 0,h&&(d[k]=h)),b.result}},dispatch:function(a){a=n.event.fix(a);var b,c,e,f,g,h=[],i=d.call(arguments),j=(L.get(this,"events")||{})[a.type]||[],k=n.event.special[a.type]||{};if(i[0]=a,a.delegateTarget=this,!k.preDispatch||k.preDispatch.call(this,a)!==!1){h=n.event.handlers.call(this,a,j),b=0;while((f=h[b++])&&!a.isPropagationStopped()){a.currentTarget=f.elem,c=0;while((g=f.handlers[c++])&&!a.isImmediatePropagationStopped())(!a.namespace_re||a.namespace_re.test(g.namespace))&&(a.handleObj=g,a.data=g.data,e=((n.event.special[g.origType]||{}).handle||g.handler).apply(f.elem,i),void 0!==e&&(a.result=e)===!1&&(a.preventDefault(),a.stopPropagation()))}return k.postDispatch&&k.postDispatch.call(this,a),a.result}},handlers:function(a,b){var c,d,e,f,g=[],h=b.delegateCount,i=a.target;if(h&&i.nodeType&&(!a.button||"click"!==a.type))for(;i!==this;i=i.parentNode||this)if(i.disabled!==!0||"click"!==a.type){for(d=[],c=0;h>c;c++)f=b[c],e=f.selector+" ",void 0===d[e]&&(d[e]=f.needsContext?n(e,this).index(i)>=0:n.find(e,this,null,[i]).length),d[e]&&d.push(f);d.length&&g.push({elem:i,handlers:d})}return h]*)\/>/gi,ba=/<([\w:]+)/,ca=/<|&#?\w+;/,da=/<(?:script|style|link)/i,ea=/checked\s*(?:[^=]|=\s*.checked.)/i,fa=/^$|\/(?:java|ecma)script/i,ga=/^true\/(.*)/,ha=/^\s*\s*$/g,ia={option:[1,""],thead:[1,"","
"],col:[2,"","
"],tr:[2,"","
"],td:[3,"","
"],_default:[0,"",""]};ia.optgroup=ia.option,ia.tbody=ia.tfoot=ia.colgroup=ia.caption=ia.thead,ia.th=ia.td;function ja(a,b){return n.nodeName(a,"table")&&n.nodeName(11!==b.nodeType?b:b.firstChild,"tr")?a.getElementsByTagName("tbody")[0]||a.appendChild(a.ownerDocument.createElement("tbody")):a}function ka(a){return a.type=(null!==a.getAttribute("type"))+"/"+a.type,a}function la(a){var b=ga.exec(a.type);return b?a.type=b[1]:a.removeAttribute("type"),a}function ma(a,b){for(var c=0,d=a.length;d>c;c++)L.set(a[c],"globalEval",!b||L.get(b[c],"globalEval"))}function na(a,b){var c,d,e,f,g,h,i,j;if(1===b.nodeType){if(L.hasData(a)&&(f=L.access(a),g=L.set(b,f),j=f.events)){delete g.handle,g.events={};for(e in j)for(c=0,d=j[e].length;d>c;c++)n.event.add(b,e,j[e][c])}M.hasData(a)&&(h=M.access(a),i=n.extend({},h),M.set(b,i))}}function oa(a,b){var c=a.getElementsByTagName?a.getElementsByTagName(b||"*"):a.querySelectorAll?a.querySelectorAll(b||"*"):[];return void 0===b||b&&n.nodeName(a,b)?n.merge([a],c):c}function pa(a,b){var c=b.nodeName.toLowerCase();"input"===c&&T.test(a.type)?b.checked=a.checked:("input"===c||"textarea"===c)&&(b.defaultValue=a.defaultValue)}n.extend({clone:function(a,b,c){var d,e,f,g,h=a.cloneNode(!0),i=n.contains(a.ownerDocument,a);if(!(k.noCloneChecked||1!==a.nodeType&&11!==a.nodeType||n.isXMLDoc(a)))for(g=oa(h),f=oa(a),d=0,e=f.length;e>d;d++)pa(f[d],g[d]);if(b)if(c)for(f=f||oa(a),g=g||oa(h),d=0,e=f.length;e>d;d++)na(f[d],g[d]);else na(a,h);return g=oa(h,"script"),g.length>0&&ma(g,!i&&oa(a,"script")),h},buildFragment:function(a,b,c,d){for(var e,f,g,h,i,j,k=b.createDocumentFragment(),l=[],m=0,o=a.length;o>m;m++)if(e=a[m],e||0===e)if("object"===n.type(e))n.merge(l,e.nodeType?[e]:e);else if(ca.test(e)){f=f||k.appendChild(b.createElement("div")),g=(ba.exec(e)||["",""])[1].toLowerCase(),h=ia[g]||ia._default,f.innerHTML=h[1]+e.replace(aa,"<$1>")+h[2],j=h[0];while(j--)f=f.lastChild;n.merge(l,f.childNodes),f=k.firstChild,f.textContent=""}else l.push(b.createTextNode(e));k.textContent="",m=0;while(e=l[m++])if((!d||-1===n.inArray(e,d))&&(i=n.contains(e.ownerDocument,e),f=oa(k.appendChild(e),"script"),i&&ma(f),c)){j=0;while(e=f[j++])fa.test(e.type||"")&&c.push(e)}return k},cleanData:function(a){for(var b,c,d,e,f=n.event.special,g=0;void 0!==(c=a[g]);g++){if(n.acceptData(c)&&(e=c[L.expando],e&&(b=L.cache[e]))){if(b.events)for(d in b.events)f[d]?n.event.remove(c,d):n.removeEvent(c,d,b.handle);L.cache[e]&&delete L.cache[e]}delete M.cache[c[M.expando]]}}}),n.fn.extend({text:function(a){return J(this,function(a){return void 0===a?n.text(this):this.empty().each(function(){(1===this.nodeType||11===this.nodeType||9===this.nodeType)&&(this.textContent=a)})},null,a,arguments.length)},append:function(){return this.domManip(arguments,function(a){if(1===this.nodeType||11===this.nodeType||9===this.nodeType){var b=ja(this,a);b.appendChild(a)}})},prepend:function(){return this.domManip(arguments,function(a){if(1===this.nodeType||11===this.nodeType||9===this.nodeType){var b=ja(this,a);b.insertBefore(a,b.firstChild)}})},before:function(){return this.domManip(arguments,function(a){this.parentNode&&this.parentNode.insertBefore(a,this)})},after:function(){return this.domManip(arguments,function(a){this.parentNode&&this.parentNode.insertBefore(a,this.nextSibling)})},remove:function(a,b){for(var c,d=a?n.filter(a,this):this,e=0;null!=(c=d[e]);e++)b||1!==c.nodeType||n.cleanData(oa(c)),c.parentNode&&(b&&n.contains(c.ownerDocument,c)&&ma(oa(c,"script")),c.parentNode.removeChild(c));return this},empty:function(){for(var a,b=0;null!=(a=this[b]);b++)1===a.nodeType&&(n.cleanData(oa(a,!1)),a.textContent="");return this},clone:function(a,b){return a=null==a?!1:a,b=null==b?a:b,this.map(function(){return n.clone(this,a,b)})},html:function(a){return J(this,function(a){var b=this[0]||{},c=0,d=this.length;if(void 0===a&&1===b.nodeType)return b.innerHTML;if("string"==typeof a&&!da.test(a)&&!ia[(ba.exec(a)||["",""])[1].toLowerCase()]){a=a.replace(aa,"<$1>");try{for(;d>c;c++)b=this[c]||{},1===b.nodeType&&(n.cleanData(oa(b,!1)),b.innerHTML=a);b=0}catch(e){}}b&&this.empty().append(a)},null,a,arguments.length)},replaceWith:function(){var a=arguments[0];return this.domManip(arguments,function(b){a=this.parentNode,n.cleanData(oa(this)),a&&a.replaceChild(b,this)}),a&&(a.length||a.nodeType)?this:this.remove()},detach:function(a){return this.remove(a,!0)},domManip:function(a,b){a=e.apply([],a);var c,d,f,g,h,i,j=0,l=this.length,m=this,o=l-1,p=a[0],q=n.isFunction(p);if(q||l>1&&"string"==typeof p&&!k.checkClone&&ea.test(p))return this.each(function(c){var d=m.eq(c);q&&(a[0]=p.call(this,c,d.html())),d.domManip(a,b)});if(l&&(c=n.buildFragment(a,this[0].ownerDocument,!1,this),d=c.firstChild,1===c.childNodes.length&&(c=d),d)){for(f=n.map(oa(c,"script"),ka),g=f.length;l>j;j++)h=c,j!==o&&(h=n.clone(h,!0,!0),g&&n.merge(f,oa(h,"script"))),b.call(this[j],h,j);if(g)for(i=f[f.length-1].ownerDocument,n.map(f,la),j=0;g>j;j++)h=f[j],fa.test(h.type||"")&&!L.access(h,"globalEval")&&n.contains(i,h)&&(h.src?n._evalUrl&&n._evalUrl(h.src):n.globalEval(h.textContent.replace(ha,"")))}return this}}),n.each({appendTo:"append",prependTo:"prepend",insertBefore:"before",insertAfter:"after",replaceAll:"replaceWith"},function(a,b){n.fn[a]=function(a){for(var c,d=[],e=n(a),g=e.length-1,h=0;g>=h;h++)c=h===g?this:this.clone(!0),n(e[h])[b](c),f.apply(d,c.get());return this.pushStack(d)}});var qa,ra={};function sa(b,c){var d,e=n(c.createElement(b)).appendTo(c.body),f=a.getDefaultComputedStyle&&(d=a.getDefaultComputedStyle(e[0]))?d.display:n.css(e[0],"display");return e.detach(),f}function ta(a){var b=l,c=ra[a];return c||(c=sa(a,b),"none"!==c&&c||(qa=(qa||n("

Redirecting to ../../aho_corasick/struct.Match.html...