[INFO] fetching crate ranges 0.3.0... [INFO] documenting ranges-0.3.0 against master#394e1b40d264aa6928811919c1124fa248e7d802 for pr-73566 [INFO] extracting crate ranges 0.3.0 into /workspace/builds/worker-2/source [INFO] validating manifest of crates.io crate ranges 0.3.0 on toolchain 394e1b40d264aa6928811919c1124fa248e7d802 [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+394e1b40d264aa6928811919c1124fa248e7d802" "read-manifest" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] started tweaking crates.io crate ranges 0.3.0 [INFO] finished tweaking crates.io crate ranges 0.3.0 [INFO] tweaked toml for crates.io crate ranges 0.3.0 written to /workspace/builds/worker-2/source/Cargo.toml [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+394e1b40d264aa6928811919c1124fa248e7d802" "generate-lockfile" "--manifest-path" "Cargo.toml" "-Zno-index-update", kill_on_drop: false }` [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+394e1b40d264aa6928811919c1124fa248e7d802" "fetch" "--locked" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "MAP_USER_ID=0" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--network" "none" "rustops/crates-build-env@sha256:819119df93c0f5eca3f29186f14981ef29945a311854d7222af07488600a2584" "/opt/rustwide/cargo-home/bin/cargo" "+394e1b40d264aa6928811919c1124fa248e7d802" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 452e2e173b00e4045f0ff61523ed6c97cad8cfb219b4121df31e7db1a8de2487 [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] running `Command { std: "docker" "start" "-a" "452e2e173b00e4045f0ff61523ed6c97cad8cfb219b4121df31e7db1a8de2487", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "452e2e173b00e4045f0ff61523ed6c97cad8cfb219b4121df31e7db1a8de2487", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "452e2e173b00e4045f0ff61523ed6c97cad8cfb219b4121df31e7db1a8de2487", kill_on_drop: false }` [INFO] [stdout] 452e2e173b00e4045f0ff61523ed6c97cad8cfb219b4121df31e7db1a8de2487 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "MAP_USER_ID=0" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--network" "none" "rustops/crates-build-env@sha256:819119df93c0f5eca3f29186f14981ef29945a311854d7222af07488600a2584" "/opt/rustwide/cargo-home/bin/cargo" "+394e1b40d264aa6928811919c1124fa248e7d802" "doc" "--frozen" "--no-deps" "--document-private-items" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 568f3de4d36d1073a5c1701063e602e2cecbd40c07068fca890750ad72fe8fd2 [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] running `Command { std: "docker" "start" "-a" "568f3de4d36d1073a5c1701063e602e2cecbd40c07068fca890750ad72fe8fd2", kill_on_drop: false }` [INFO] [stderr] Documenting ranges v0.3.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/generic_range/contains.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | / /// Returns true if the given `item` is contained in the range. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Example [INFO] [stdout] 9 | | ///``` [INFO] [stdout] ... | [INFO] [stdout] 13 | | /// assert!(range.contains(&3)); [INFO] [stdout] 14 | | ///``` [INFO] [stdout] | |__________^ [INFO] [stdout] | [INFO] [stdout] note: the lint level is defined here [INFO] [stdout] --> src/lib.rs:88:5 [INFO] [stdout] | [INFO] [stdout] 88 | rustdoc, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] = note: `#[warn(private_doc_tests)]` implied by `#[warn(rustdoc)]` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/generic_range/difference.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | / /// Returns the difference of two ranges. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Examples [INFO] [stdout] 9 | | ///``` [INFO] [stdout] ... | [INFO] [stdout] 28 | | /// assert_eq!(range - range2, OperationResult::Double((1..3).into(), (5..=10).into())); [INFO] [stdout] 29 | | ///``` [INFO] [stdout] | |__________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/generic_range/empty.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | / /// Returns true if the range is empty. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Examples [INFO] [stdout] 9 | | /// ``` [INFO] [stdout] ... | [INFO] [stdout] 14 | | /// assert!(!GenericRange::from(1..2).is_empty()); [INFO] [stdout] 15 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/generic_range/intersect.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | / /// Results in either a single or, if the inputs are disjoint, empty range. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Note [INFO] [stdout] 9 | | /// The `OperationResult::Double` discriminant can safely be marked `unreachable!()` when [INFO] [stdout] ... | [INFO] [stdout] 27 | | /// assert_eq!(range & range2, OperationResult::Single(GenericRange::from(5..10))); [INFO] [stdout] 28 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/generic_range/invert.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | / /// Inverts a range border, so a start becomes an end and vice versa. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Example [INFO] [stdout] 9 | | /// ``` [INFO] [stdout] ... | [INFO] [stdout] 15 | | /// assert_eq!(GenericRange::invert_border(Bound::Included(42)), Bound::Excluded(42)); [INFO] [stdout] 16 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/generic_range/invert.rs:36:5 [INFO] [stdout] | [INFO] [stdout] 36 | / /// Inverts the given range and returns two if no bound is unbounded. [INFO] [stdout] 37 | | /// [INFO] [stdout] 38 | | /// # Example [INFO] [stdout] 39 | | /// ``` [INFO] [stdout] ... | [INFO] [stdout] 54 | | /// ) [INFO] [stdout] 55 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/generic_range/relation.rs:717:5 [INFO] [stdout] | [INFO] [stdout] 717 | / /// Returns true if the two ranges are equal. [INFO] [stdout] 718 | | /// [INFO] [stdout] 719 | | /// This method is the basis for the `PartialEq` and `Eq` trait implementations. [INFO] [stdout] 720 | | /// [INFO] [stdout] ... | [INFO] [stdout] 730 | | /// assert_eq!(GenericRange::new_open(0, 5), (1..=4).into()); [INFO] [stdout] 731 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/generic_range/singleton.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | / /// Constructs a singleton by cloning the input storing it in included bounds for both start [INFO] [stdout] 7 | | /// and end. [INFO] [stdout] 8 | | /// [INFO] [stdout] 9 | | /// # Example [INFO] [stdout] ... | [INFO] [stdout] 17 | | /// ); [INFO] [stdout] 18 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/generic_range/singleton.rs:27:5 [INFO] [stdout] | [INFO] [stdout] 27 | / /// Returns true if the range only contains a single item. [INFO] [stdout] 28 | | /// [INFO] [stdout] 29 | | /// # Examples [INFO] [stdout] 30 | | /// ``` [INFO] [stdout] ... | [INFO] [stdout] 40 | | /// assert!(GenericRange::from((Bound::Excluded(1), Bound::Included(2))).is_singleton()); [INFO] [stdout] 41 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/generic_range/symmetric_difference.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | / /// Results in two ranges if the inputs are disjoint or touching. [INFO] [stdout] 7 | | /// Results in two ranges (the "left" and "right" disjoint parts) if the inputs are overlapping or contain one another. [INFO] [stdout] 8 | | /// Results in a single range (the disjoint part) if the inputs start or end on the same value. [INFO] [stdout] 9 | | /// Returns empty if the inputs are equal. [INFO] [stdout] ... | [INFO] [stdout] 37 | | /// assert_eq!(a ^ b, OperationResult::Empty); [INFO] [stdout] 38 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/generic_range/union.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | / /// Results in either a single or, if the inputs are disjoint, two ranges. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Examples [INFO] [stdout] 9 | | /// Disjoint ranges. [INFO] [stdout] ... | [INFO] [stdout] 25 | | /// assert_eq!(range | range2, OperationResult::Single((0..=15).into())); [INFO] [stdout] 26 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/ranges/contains.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | / /// Returns true if the given `item` is contained in any of the internal disjoint ranges. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Note [INFO] [stdout] 9 | | /// In contrast to the `GenericRange` constructor, item values will not be clamped to [INFO] [stdout] ... | [INFO] [stdout] 20 | | /// [INFO] [stdout] 21 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/ranges/difference.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | / /// Calculates the relative complement (difference) of two ranges. [INFO] [stdout] 8 | | /// [INFO] [stdout] 9 | | /// # Examples [INFO] [stdout] 10 | | /// Overlapping ranges: [INFO] [stdout] ... | [INFO] [stdout] 26 | | /// assert!((ranges1 - ranges2).is_empty()); [INFO] [stdout] 27 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/ranges/insert.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | / /// Returns `true` if any element or the internal vector was modified to accommodate `range`. [INFO] [stdout] 7 | | /// This means `false` is returned if and only if nothing has changed. [INFO] [stdout] 8 | | /// [INFO] [stdout] 9 | | /// # Examples [INFO] [stdout] ... | [INFO] [stdout] 32 | | /// assert_eq!(ranges, (0..10).into()) [INFO] [stdout] 33 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/ranges/intersect.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | / /// Calculates the intersection of two ranges. [INFO] [stdout] 8 | | /// [INFO] [stdout] 9 | | /// # Examples [INFO] [stdout] 10 | | /// Single overlapping ranges: [INFO] [stdout] ... | [INFO] [stdout] 26 | | /// assert_eq!(ranges1 & ranges2, vec![0..3, 6..9].into()) [INFO] [stdout] 27 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/ranges/invert.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | / /// Inverts the range set. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Examples [INFO] [stdout] 9 | | /// Empty set: [INFO] [stdout] ... | [INFO] [stdout] 37 | | /// ); [INFO] [stdout] 38 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/ranges/remove.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | / /// Returns `true` if any element or the internal vector was modified to remove `range`. [INFO] [stdout] 7 | | /// This means `false` is returned if and only if nothing has changed. [INFO] [stdout] 8 | | /// [INFO] [stdout] 9 | | /// # Examples [INFO] [stdout] ... | [INFO] [stdout] 31 | | /// assert_eq!(ranges, vec![0..2, 5..10].into()) [INFO] [stdout] 32 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/ranges/symmetric_difference.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | / /// Calculates the relative complement (difference) of two ranges. [INFO] [stdout] 8 | | /// [INFO] [stdout] 9 | | /// # Examples [INFO] [stdout] 10 | | /// Empty range. [INFO] [stdout] ... | [INFO] [stdout] 38 | | /// ); [INFO] [stdout] 39 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/ranges/union.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | / /// Calculates the union of two ranges. [INFO] [stdout] 8 | | /// [INFO] [stdout] 9 | | /// # Examples [INFO] [stdout] 10 | | /// Empty and single-entry ranges. [INFO] [stdout] ... | [INFO] [stdout] 35 | | /// assert_eq!(ranges1 | ranges2, (0..9).into()); [INFO] [stdout] 36 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/ranges.rs:96:5 [INFO] [stdout] | [INFO] [stdout] 96 | / /// Find the `GenericRange`s in `self` which at least touch `other`. [INFO] [stdout] 97 | | /// [INFO] [stdout] 98 | | /// Since `other` is a `GenericRange` (i.e. contiguous), [INFO] [stdout] 99 | | /// the overlapping ranges must all be consecutive. [INFO] [stdout] ... | [INFO] [stdout] 109 | | /// assert_eq!(ranges.find_intersecting_ranges(&(7..47).into()), Some((1, 3))) [INFO] [stdout] 110 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/domain/char.rs:64:5 [INFO] [stdout] | [INFO] [stdout] 64 | / /// This method does _not_ ignore invalid code points. [INFO] [stdout] 65 | | /// [INFO] [stdout] 66 | | /// # Example [INFO] [stdout] 67 | | /// ``` [INFO] [stdout] ... | [INFO] [stdout] 70 | | /// assert!(!'\u{df777}'.shares_neighbour_with(&'\u{e001}')); [INFO] [stdout] 71 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/domain/char.rs:79:1 [INFO] [stdout] | [INFO] [stdout] 79 | / /// Iterates over valid UTF-8 codepoint range. Invalid values are skipped over. [INFO] [stdout] 80 | | /// ``` [INFO] [stdout] 81 | | /// use ranges::GenericRange; [INFO] [stdout] 82 | | /// [INFO] [stdout] ... | [INFO] [stdout] 87 | | /// assert_eq!(iter.last().unwrap(), '\u{10ffff}'); [INFO] [stdout] 88 | | /// ``` [INFO] [stdout] | |_______^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/generic_range/format.rs:9:13 [INFO] [stdout] | [INFO] [stdout] 9 | / /// Non-Debug formatting uses interval notation and formats the bound values [INFO] [stdout] 10 | | /// according to the given formatting arguments. [INFO] [stdout] 11 | | /// [INFO] [stdout] 12 | | /// # Note [INFO] [stdout] ... | [INFO] [stdout] 27 | | /// assert_eq!(format!("{:-#}", GenericRange::from(42..=100)), "[42,100]"); [INFO] [stdout] 28 | | /// ``` [INFO] [stdout] | |___________________^ [INFO] [stdout] ... [INFO] [stdout] 85 | format_range_with!(Binary, Display, LowerExp, LowerHex, Octal, Pointer, UpperExp, UpperHex); [INFO] [stdout] | -------------------------------------------------------------------------------------------- in this macro invocation [INFO] [stdout] | [INFO] [stdout] = note: this warning originates in a macro (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: documentation test in private item [INFO] [stdout] --> src/ranges/format.rs:9:13 [INFO] [stdout] | [INFO] [stdout] 9 | / /// Non-Debug formatting uses interval notation and formats the bound values [INFO] [stdout] 10 | | /// according to the given formatting arguments. [INFO] [stdout] 11 | | /// [INFO] [stdout] 12 | | /// # Note [INFO] [stdout] ... | [INFO] [stdout] 41 | | /// ); [INFO] [stdout] 42 | | /// ``` [INFO] [stdout] | |___________________^ [INFO] [stdout] ... [INFO] [stdout] 104 | format_ranges_with!(Binary, Display, LowerExp, LowerHex, Octal, Pointer, UpperExp, UpperHex); [INFO] [stdout] | --------------------------------------------------------------------------------------------- in this macro invocation [INFO] [stdout] | [INFO] [stdout] = note: this warning originates in a macro (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | / //! # Ranges [INFO] [stdout] 2 | | //! This crate provides a generic alternative to core/std ranges, set-operations to work with them [INFO] [stdout] 3 | | //! and a range set that can efficiently store them with the least amount of memory [INFO] [stdout] 4 | | //! possible. [INFO] [stdout] ... | [INFO] [stdout] 18 | | //! [`bool`]: trait.Domain.html#impl-Domain-for-bool [INFO] [stdout] 19 | | //! [`char`]: trait.Domain.html#impl-Domain-for-char [INFO] [stdout] | |____________________________________________________^ [INFO] [stdout] | [INFO] [stdout] note: the lint level is defined here [INFO] [stdout] --> src/lib.rs:88:5 [INFO] [stdout] | [INFO] [stdout] 88 | rustdoc, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] = note: `#[warn(missing_doc_code_examples)]` implied by `#[warn(rustdoc)]` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:38:1 [INFO] [stdout] | [INFO] [stdout] 38 | / /// A generic analog to core/std ranges. [INFO] [stdout] 39 | | /// [INFO] [stdout] 40 | | /// Because this type allows more range types, it comes with the cost of a few guarantees that need [INFO] [stdout] 41 | | /// to be uphold. [INFO] [stdout] ... | [INFO] [stdout] 49 | | /// The notation of `(-inf` and `+inf)` is used as an equivalent to the domain minimum and maximum, [INFO] [stdout] 50 | | /// even if the implementing domain may not be unbound or excluding in either direction. [INFO] [stdout] | |________________________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:53:5 [INFO] [stdout] | [INFO] [stdout] 53 | /// Start of range. It is assumed to be smaller or equal to `end`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:55:5 [INFO] [stdout] | [INFO] [stdout] 55 | /// End of range. It is assumed to be bigger or equal to `start`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:32:1 [INFO] [stdout] | [INFO] [stdout] 32 | / /// A range set storing `GenericRange`s in the most memory-optimal fashion possible. [INFO] [stdout] 33 | | /// [INFO] [stdout] 34 | | /// The two guarantees of storing ranges disjoint and sorted allows for the following optimizations: [INFO] [stdout] 35 | | /// - keeping them ordered, upper and lower bounds for searches can be used to keep the search [INFO] [stdout] ... | [INFO] [stdout] 38 | | /// additionally helps to reduce reindexing of the internal vector [INFO] [stdout] 39 | | /// [INFO] [stdout] | |___^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | / /// Inner storage - can and probably will be replaced with something more efficient [INFO] [stdout] 44 | | /// as soon as const generics are available (like an array with a pre-defined size, [INFO] [stdout] 45 | | /// which makes sense if you know how many discrete singletons you may have, e.g. for integers). [INFO] [stdout] | |____________________________________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:166:1 [INFO] [stdout] | [INFO] [stdout] 166 | / /// This enum represents all possible arrangements of two `GenericRange`s. [INFO] [stdout] 167 | | /// [INFO] [stdout] 168 | | /// # Note [INFO] [stdout] 169 | | /// The following information is additionally contained if applicable: [INFO] [stdout] ... | [INFO] [stdout] 176 | | /// obtained "for free" and should thus be used preferably to other methods like [INFO] [stdout] 177 | | /// `GenericRange::is_singleton()`. [INFO] [stdout] | |___________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:182:5 [INFO] [stdout] | [INFO] [stdout] 182 | / /// The two ranges have no overlap. [INFO] [stdout] 183 | | /// # Diagram [INFO] [stdout] 184 | | /// ```text [INFO] [stdout] 185 | | /// first : |----------| [INFO] [stdout] 186 | | /// second: |----------| [INFO] [stdout] 187 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:189:9 [INFO] [stdout] | [INFO] [stdout] 189 | / /// When `GenericRange::arrangement(&self, &other)` was invoked, either `self` or `other` [INFO] [stdout] 190 | | /// was less. [INFO] [stdout] | |_____________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:194:5 [INFO] [stdout] | [INFO] [stdout] 194 | / /// The two ranges have no overlap but the end of the first touches the start of the second. [INFO] [stdout] 195 | | /// # Diagram [INFO] [stdout] 196 | | /// ```text [INFO] [stdout] 197 | | /// first : |----------| [INFO] [stdout] 198 | | /// second: |----------| [INFO] [stdout] 199 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:201:9 [INFO] [stdout] | [INFO] [stdout] 201 | / /// When `GenericRange::arrangement(&self, &other)` was invoked, either `self` or `other` [INFO] [stdout] 202 | | /// was less. [INFO] [stdout] | |_____________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:206:5 [INFO] [stdout] | [INFO] [stdout] 206 | / /// The two ranges have an overlap of one or more elements. [INFO] [stdout] 207 | | /// # Diagram [INFO] [stdout] 208 | | /// ```text [INFO] [stdout] 209 | | /// first : |----------| [INFO] [stdout] ... | [INFO] [stdout] 213 | | /// overlap : |--| [INFO] [stdout] 214 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:216:9 [INFO] [stdout] | [INFO] [stdout] 216 | / /// When `GenericRange::arrangement(&self, &other)` was invoked, either `self` or `other` [INFO] [stdout] 217 | | /// was less. [INFO] [stdout] | |_____________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:219:9 [INFO] [stdout] | [INFO] [stdout] 219 | /// Indicates whether or not the overlap is by a single element, allowing optimization. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:223:5 [INFO] [stdout] | [INFO] [stdout] 223 | / /// One range is contained in the other. [INFO] [stdout] 224 | | /// # Diagram [INFO] [stdout] 225 | | /// ```text [INFO] [stdout] 226 | | /// first : |--------------------| [INFO] [stdout] ... | [INFO] [stdout] 230 | | /// overlap : |----------| [INFO] [stdout] 231 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:233:9 [INFO] [stdout] | [INFO] [stdout] 233 | / /// When `GenericRange::arrangement(&self, &other)` was invoked, either `self` or `other` [INFO] [stdout] 234 | | /// was shorter. [INFO] [stdout] | |________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:238:5 [INFO] [stdout] | [INFO] [stdout] 238 | / /// Both ranges have the same start but varying endings. [INFO] [stdout] 239 | | /// # Diagram [INFO] [stdout] 240 | | /// ```text [INFO] [stdout] 241 | | /// first : |-----| [INFO] [stdout] ... | [INFO] [stdout] 244 | | /// disjoint: |----| [INFO] [stdout] 245 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:247:9 [INFO] [stdout] | [INFO] [stdout] 247 | / /// Indicates whether `self` or `other` in `GenericRange::arrangement(&self, &other)` [INFO] [stdout] 248 | | /// was shorter. [INFO] [stdout] | |________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:250:9 [INFO] [stdout] | [INFO] [stdout] 250 | / /// Depending on which of `self` or `other` is shorter, this boolean indicates that it is a [INFO] [stdout] 251 | | /// singleton. [INFO] [stdout] | |______________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:255:5 [INFO] [stdout] | [INFO] [stdout] 255 | / /// Both ranges have the same end but varying starts. [INFO] [stdout] 256 | | /// # Diagram [INFO] [stdout] 257 | | /// ```text [INFO] [stdout] 258 | | /// first : |----------| [INFO] [stdout] ... | [INFO] [stdout] 261 | | /// overlap : |----| [INFO] [stdout] 262 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:264:9 [INFO] [stdout] | [INFO] [stdout] 264 | / /// Indicates whether `self` or `other` in `GenericRange::arrangement(&self, &other)` [INFO] [stdout] 265 | | /// was shorter. [INFO] [stdout] | |________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:267:9 [INFO] [stdout] | [INFO] [stdout] 267 | / /// Depending on which of `self` or `other` is shorter, this boolean indicates that it is a [INFO] [stdout] 268 | | /// singleton. [INFO] [stdout] | |______________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:272:5 [INFO] [stdout] | [INFO] [stdout] 272 | / /// The starts and ends of both ranges are equal. [INFO] [stdout] 273 | | /// # Diagram [INFO] [stdout] 274 | | /// ```text [INFO] [stdout] 275 | | /// first : |----------| [INFO] [stdout] 276 | | /// second: |----------| [INFO] [stdout] 277 | | /// equal : |----------| [INFO] [stdout] 278 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:281:5 [INFO] [stdout] | [INFO] [stdout] 281 | / /// One or both ranges are empty and can therefore not be compared. [INFO] [stdout] 282 | | /// # Diagram [INFO] [stdout] 283 | | /// ```text [INFO] [stdout] 284 | | /// first : [INFO] [stdout] 285 | | /// second: |----| [INFO] [stdout] 286 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:288:9 [INFO] [stdout] | [INFO] [stdout] 288 | / /// Indicates which of the two inputs of `GenericRange::arrangement(&self, &other)` were [INFO] [stdout] 289 | | /// empty. Returns `None` if both were empty. [INFO] [stdout] | |_____________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / /// This enum represents all possible arrangements of two `GenericRange`s. [INFO] [stdout] 7 | | /// The original values were moved, possibly modified, and then stored. [INFO] [stdout] 8 | | /// [INFO] [stdout] 9 | | /// # Note [INFO] [stdout] ... | [INFO] [stdout] 17 | | /// obtained "for free" and should thus be used preferably to other methods like [INFO] [stdout] 18 | | /// `GenericRange::is_singleton()`. [INFO] [stdout] | |___________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:23:5 [INFO] [stdout] | [INFO] [stdout] 23 | / /// The two ranges have no overlap. [INFO] [stdout] 24 | | /// # Diagram [INFO] [stdout] 25 | | /// ```text [INFO] [stdout] 26 | | /// first : |----------| [INFO] [stdout] 27 | | /// second: |----------| [INFO] [stdout] 28 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:30:9 [INFO] [stdout] | [INFO] [stdout] 30 | /// The end of this range is less than the start of `second`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:32:9 [INFO] [stdout] | [INFO] [stdout] 32 | /// The start of this range is greater than the end of `first`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:34:9 [INFO] [stdout] | [INFO] [stdout] 34 | / /// When `GenericRange::relation(self, other)` was invoked, either `self` or `other` [INFO] [stdout] 35 | | /// were less. [INFO] [stdout] | |______________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:39:5 [INFO] [stdout] | [INFO] [stdout] 39 | / /// The two ranges have no overlap but the end of the first touches the start of the second. [INFO] [stdout] 40 | | /// # Diagram [INFO] [stdout] 41 | | /// ```text [INFO] [stdout] 42 | | /// first : |----------| [INFO] [stdout] 43 | | /// second: |----------| [INFO] [stdout] 44 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:46:9 [INFO] [stdout] | [INFO] [stdout] 46 | /// The end of this range touches the start of `second`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:48:9 [INFO] [stdout] | [INFO] [stdout] 48 | /// The start of this range touches the end of `first`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:50:9 [INFO] [stdout] | [INFO] [stdout] 50 | / /// When `GenericRange::relation(self, other)` was invoked, either `self` or `other` [INFO] [stdout] 51 | | /// were less when sorted using `Ord`. [INFO] [stdout] | |______________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:55:5 [INFO] [stdout] | [INFO] [stdout] 55 | / /// The two ranges have an overlap of one or more elements. [INFO] [stdout] 56 | | /// # Diagram [INFO] [stdout] 57 | | /// ```text [INFO] [stdout] 58 | | /// first : |----------| [INFO] [stdout] ... | [INFO] [stdout] 62 | | /// overlap : |--| [INFO] [stdout] 63 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:65:9 [INFO] [stdout] | [INFO] [stdout] 65 | /// Range representing the disjoint part of two ranges before the overlap. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:67:9 [INFO] [stdout] | [INFO] [stdout] 67 | /// Range representing the disjoint part of two ranges after the overlap. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:69:9 [INFO] [stdout] | [INFO] [stdout] 69 | /// Range representing the overlapping part of two ranges. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:71:9 [INFO] [stdout] | [INFO] [stdout] 71 | / /// When `GenericRange::relation(self, other)` was invoked, either `self` or `other` [INFO] [stdout] 72 | | /// was less. [INFO] [stdout] | |_____________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:74:9 [INFO] [stdout] | [INFO] [stdout] 74 | /// Indicates whether or not the overlap is by a single element, allowing optimization. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:78:5 [INFO] [stdout] | [INFO] [stdout] 78 | / /// One range is contained in the other. [INFO] [stdout] 79 | | /// # Diagram [INFO] [stdout] 80 | | /// ```text [INFO] [stdout] 81 | | /// first : |--------------------| [INFO] [stdout] ... | [INFO] [stdout] 85 | | /// overlap : |----------| [INFO] [stdout] 86 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:88:9 [INFO] [stdout] | [INFO] [stdout] 88 | /// Range representing the disjoint part of two ranges before the overlap. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:90:9 [INFO] [stdout] | [INFO] [stdout] 90 | /// Range representing the disjoint part of two ranges after the overlap. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:92:9 [INFO] [stdout] | [INFO] [stdout] 92 | /// Range representing the overlapping part of two ranges. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:94:9 [INFO] [stdout] | [INFO] [stdout] 94 | / /// When `GenericRange::relation(self, other)` was invoked, either `self` or `other` [INFO] [stdout] 95 | | /// was shorter. [INFO] [stdout] | |________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:99:5 [INFO] [stdout] | [INFO] [stdout] 99 | / /// Both ranges have the same start but varying endings. [INFO] [stdout] 100 | | /// # Diagram [INFO] [stdout] 101 | | /// ```text [INFO] [stdout] 102 | | /// first : |-----| [INFO] [stdout] ... | [INFO] [stdout] 105 | | /// disjoint: |----| [INFO] [stdout] 106 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:108:9 [INFO] [stdout] | [INFO] [stdout] 108 | /// Range representing the overlapping part of two ranges. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:110:9 [INFO] [stdout] | [INFO] [stdout] 110 | /// Range representing the disjoint part of two ranges. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:112:9 [INFO] [stdout] | [INFO] [stdout] 112 | / /// Indicates if `self` or `other` in `GenericRange::relation(self, other)` [INFO] [stdout] 113 | | /// is shorter. [INFO] [stdout] | |_______________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:115:9 [INFO] [stdout] | [INFO] [stdout] 115 | / /// Depending on which of `self` or `other` is shorter, this boolean indicates that it is a [INFO] [stdout] 116 | | /// singleton. [INFO] [stdout] | |______________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:120:5 [INFO] [stdout] | [INFO] [stdout] 120 | / /// Both ranges have the same end but varying starts. [INFO] [stdout] 121 | | /// # Diagram [INFO] [stdout] 122 | | /// ```text [INFO] [stdout] 123 | | /// first : |----------| [INFO] [stdout] ... | [INFO] [stdout] 126 | | /// overlap : |----| [INFO] [stdout] 127 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:129:9 [INFO] [stdout] | [INFO] [stdout] 129 | /// Range representing the disjoint part of two ranges. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:131:9 [INFO] [stdout] | [INFO] [stdout] 131 | /// Range representing the overlapping part of two ranges. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:133:9 [INFO] [stdout] | [INFO] [stdout] 133 | / /// Indicates if `self` or `other` in `GenericRange::relation(self, other)` [INFO] [stdout] 134 | | /// is shorter. [INFO] [stdout] | |_______________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:136:9 [INFO] [stdout] | [INFO] [stdout] 136 | / /// Depending on which of `self` or `other` is shorter, this boolean indicates that it is a [INFO] [stdout] 137 | | /// singleton. [INFO] [stdout] | |______________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:141:5 [INFO] [stdout] | [INFO] [stdout] 141 | / /// The starts and ends of both ranges are equal. [INFO] [stdout] 142 | | /// # Diagram [INFO] [stdout] 143 | | /// ```text [INFO] [stdout] 144 | | /// first : |----------| [INFO] [stdout] 145 | | /// second: |----------| [INFO] [stdout] 146 | | /// equal : |----------| [INFO] [stdout] 147 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:150:5 [INFO] [stdout] | [INFO] [stdout] 150 | / /// One or both ranges are empty and can therefore not be compared. [INFO] [stdout] 151 | | /// # Diagram [INFO] [stdout] 152 | | /// ```text [INFO] [stdout] 153 | | /// first : [INFO] [stdout] 154 | | /// second : |----| [INFO] [stdout] 155 | | /// non_empty: |----| [INFO] [stdout] 156 | | /// ``` [INFO] [stdout] | |___________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:158:9 [INFO] [stdout] | [INFO] [stdout] 158 | /// The non empty range of the two ranges, if it exists. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:160:9 [INFO] [stdout] | [INFO] [stdout] 160 | / /// Indicates which of the two inputs of `GenericRange::arrangement(&self, &other)` were [INFO] [stdout] 161 | | /// empty. Returns `None` if both were empty. [INFO] [stdout] | |_____________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:473:1 [INFO] [stdout] | [INFO] [stdout] 473 | /// Result of a unary or binary operation. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:478:5 [INFO] [stdout] | [INFO] [stdout] 478 | /// The operation resulted in an empty range. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:480:5 [INFO] [stdout] | [INFO] [stdout] 480 | /// The operation resulted in a single range. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:482:5 [INFO] [stdout] | [INFO] [stdout] 482 | /// The operation resulted in two ranges. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:128:1 [INFO] [stdout] | [INFO] [stdout] 128 | / /// Trait and required function to correctly distinguish between discrete and continuous types. [INFO] [stdout] 129 | | /// Already contains base implementations for all primitive and some `Ord` implementing types. [INFO] [stdout] | |______________________________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:3:1 [INFO] [stdout] | [INFO] [stdout] 3 | /// Base implementation of `Domain` for a primitive type. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | /// Base implementation of `Domain` for a primitive type. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:7:1 [INFO] [stdout] | [INFO] [stdout] 7 | /// Base implementation of `Domain` for a primitive type. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:9:1 [INFO] [stdout] | [INFO] [stdout] 9 | /// Base implementation of `Domain` for a primitive type. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:11:1 [INFO] [stdout] | [INFO] [stdout] 11 | /// Base implementation of `Domain` for a primitive type. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:13:1 [INFO] [stdout] | [INFO] [stdout] 13 | /// Base implementation of `Domain` for a primitive type. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:16:1 [INFO] [stdout] | [INFO] [stdout] 16 | /// Base implementation of `Domain` for a primitive type. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:18:1 [INFO] [stdout] | [INFO] [stdout] 18 | /// Base implementation of `Domain` for a primitive type. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:20:1 [INFO] [stdout] | [INFO] [stdout] 20 | /// Base implementation of `Domain` for a primitive type. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:22:1 [INFO] [stdout] | [INFO] [stdout] 22 | /// Base implementation of `Domain` for a primitive type. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:24:1 [INFO] [stdout] | [INFO] [stdout] 24 | /// Base implementation of `Domain` for a primitive type. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:26:1 [INFO] [stdout] | [INFO] [stdout] 26 | /// Base implementation of `Domain` for a primitive type. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:29:1 [INFO] [stdout] | [INFO] [stdout] 29 | /// Base implementation of `Domain` for a primitive type. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:31:1 [INFO] [stdout] | [INFO] [stdout] 31 | /// Base implementation of `Domain` for a primitive type. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:33:1 [INFO] [stdout] | [INFO] [stdout] 33 | /// Base implementation of `Domain` for the `Ordering` enum. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:47:1 [INFO] [stdout] | [INFO] [stdout] 47 | / /// Provides otherwise unknown information about the type it is being implemented for. [INFO] [stdout] 48 | | /// [INFO] [stdout] 49 | | /// There are five properties which can be combined into six categories a domain can be in, [INFO] [stdout] 50 | | /// each with their own implementation requirements and assumptions. [INFO] [stdout] ... | [INFO] [stdout] 92 | | /// If you would like to suggest a crate that provides this type (it must implement `Ord`!), please [INFO] [stdout] 93 | | /// leave an issue. [INFO] [stdout] | |___________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:95:5 [INFO] [stdout] | [INFO] [stdout] 95 | /// Defines if the domain is discrete or continuous. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:98:5 [INFO] [stdout] | [INFO] [stdout] 98 | / /// Returns the predecessor of `self`. [INFO] [stdout] 99 | | /// [INFO] [stdout] 100 | | /// # Note [INFO] [stdout] 101 | | /// This method is only required if implemented on a discrete type and therefore has a default [INFO] [stdout] ... | [INFO] [stdout] 104 | | /// # Panics [INFO] [stdout] 105 | | /// This function should panic if implemented on continuous types! [INFO] [stdout] | |______________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:112:5 [INFO] [stdout] | [INFO] [stdout] 112 | / /// Returns the successor of `self`. [INFO] [stdout] 113 | | /// [INFO] [stdout] 114 | | /// # Note [INFO] [stdout] 115 | | /// This method is only required if implemented on a discrete type and therefore has a default [INFO] [stdout] ... | [INFO] [stdout] 118 | | /// # Panics [INFO] [stdout] 119 | | /// This function should panic if implemented on continuous types! [INFO] [stdout] | |______________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:126:5 [INFO] [stdout] | [INFO] [stdout] 126 | / /// Returns the smallest possible start bound. [INFO] [stdout] 127 | | /// The reason this returns a `Bound` instead of `Option` is that domains with this range [INFO] [stdout] 128 | | /// exist: `(0.0, 1.0]`, making it necessary to allow for excluded values. [INFO] [stdout] 129 | | /// [INFO] [stdout] ... | [INFO] [stdout] 134 | | /// It is assumed, that the full `Domain` range is _not_ empty, and therefore `Self` should be [INFO] [stdout] 135 | | /// smaller or equal to the value contained in `Self::maximum()`. [INFO] [stdout] | |_____________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:141:5 [INFO] [stdout] | [INFO] [stdout] 141 | / /// Returns the greatest possible end bound. [INFO] [stdout] 142 | | /// The reason this returns a `Bound` instead of `Option` is that domains with this range [INFO] [stdout] 143 | | /// exist: `[0.0, 1.0)`, making it necessary to allow for excluded values. [INFO] [stdout] 144 | | /// [INFO] [stdout] ... | [INFO] [stdout] 149 | | /// It is assumed, that the full `Domain` range is _not_ empty, and therefore `Self` should be [INFO] [stdout] 150 | | /// greater or equal to the value contained in `Self::minimum()`. [INFO] [stdout] | |_____________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:156:5 [INFO] [stdout] | [INFO] [stdout] 156 | / /// Calculates or statically defines if two values in a domain are next to each other. [INFO] [stdout] 157 | | /// [INFO] [stdout] 158 | | /// # Panics [INFO] [stdout] 159 | | /// This function should panic if implemented on continuous types! [INFO] [stdout] ... | [INFO] [stdout] 162 | | /// The default implementation uses `predecessor()` and `successor()`, [INFO] [stdout] 163 | | /// which should always panic if the domain is continuous. [INFO] [stdout] | |______________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:173:5 [INFO] [stdout] | [INFO] [stdout] 173 | / /// Returns true if there exists a `b` so that with inputs `a` and `c`: [INFO] [stdout] 174 | | /// - `b.is_next_to(a) == true` [INFO] [stdout] 175 | | /// - `b.is_next_to(c) == true` [INFO] [stdout] 176 | | /// [INFO] [stdout] 177 | | /// # Panics [INFO] [stdout] 178 | | /// This function should panic if implemented on continuous types! [INFO] [stdout] | |______________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:186:1 [INFO] [stdout] | [INFO] [stdout] 186 | /// `Domain`-driven trait required to implement iterators on discrete types. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:188:5 [INFO] [stdout] | [INFO] [stdout] 188 | /// Type to be yielded for the iterator generated by `IntoIter`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain.rs:190:5 [INFO] [stdout] | [INFO] [stdout] 190 | /// State transition function from one element in the domain to the next. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:131:1 [INFO] [stdout] | [INFO] [stdout] 131 | /// Everything related to a single generic range. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:399:1 [INFO] [stdout] | [INFO] [stdout] 399 | /// Converts a reference of a bound with owned data to a owned Bound with referenced data. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:9:1 [INFO] [stdout] | [INFO] [stdout] 9 | /// Method implementation to calculate if an object is contained in a range. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/contains.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / impl GenericRange { [INFO] [stdout] 6 | | /// Returns true if the given `item` is contained in the range. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Example [INFO] [stdout] ... | [INFO] [stdout] 36 | | } [INFO] [stdout] 37 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/contains.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | /// Returns true if the given `item` is contained between the start and end. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:11:1 [INFO] [stdout] | [INFO] [stdout] 11 | /// Method implementations to calculate difference of two ranges. Includes support for `Sub` operation trait. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/difference.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / impl GenericRange { [INFO] [stdout] 6 | | /// Returns the difference of two ranges. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Examples [INFO] [stdout] ... | [INFO] [stdout] 72 | | } [INFO] [stdout] 73 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:13:1 [INFO] [stdout] | [INFO] [stdout] 13 | / /// Method implementation to calculate if a range is empty. [INFO] [stdout] 14 | | /// Range inversion ending in an empty range is in the `invert` module. [INFO] [stdout] | |_______________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/empty.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / impl GenericRange { [INFO] [stdout] 6 | | /// Returns true if the range is empty. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Examples [INFO] [stdout] ... | [INFO] [stdout] 36 | | } [INFO] [stdout] 37 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:16:1 [INFO] [stdout] | [INFO] [stdout] 16 | /// Range formatting with several base implementations for all formatting traits. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:18:1 [INFO] [stdout] | [INFO] [stdout] 18 | /// Trait implementation of `Hash`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:20:1 [INFO] [stdout] | [INFO] [stdout] 20 | /// Method implementations for intersecting two ranges. Includes support for `BitAnd` operation trait. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/intersect.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / impl GenericRange { [INFO] [stdout] 6 | | /// Results in either a single or, if the inputs are disjoint, empty range. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Note [INFO] [stdout] ... | [INFO] [stdout] 53 | | } [INFO] [stdout] 54 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:22:1 [INFO] [stdout] | [INFO] [stdout] 22 | /// Method implementations for making a discrete start-bound range into an `Iterator`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/into_iter.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | /// A stateful `Iterator` over a `GenericRange`, yielding `T`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/into_iter.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | /// The current state of the `Iterator`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/into_iter.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | /// The end of the `GenericRange` of values to be iterated over. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:24:1 [INFO] [stdout] | [INFO] [stdout] 24 | /// Method implementation, related functions and structs to invert a range. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/invert.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / impl GenericRange { [INFO] [stdout] 6 | | /// Inverts a range border, so a start becomes an end and vice versa. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Example [INFO] [stdout] ... | [INFO] [stdout] 101 | | } [INFO] [stdout] 102 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/invert.rs:26:5 [INFO] [stdout] | [INFO] [stdout] 26 | / /// Inverts a range border, so a start becomes an end and vice versa. [INFO] [stdout] 27 | | /// Explicitly clones the contents. [INFO] [stdout] | |_______________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:29:1 [INFO] [stdout] | [INFO] [stdout] 29 | /// Method implementation and related functions to calculate relation of ranges. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:294:1 [INFO] [stdout] | [INFO] [stdout] 294 | / /// This is the "core" of this library. Everything basically relies on this one way or another. [INFO] [stdout] 295 | | /// [INFO] [stdout] 296 | | /// # Note [INFO] [stdout] 297 | | /// If you need to know only one of the possible outcomes it is generally better to use `is_*()` [INFO] [stdout] ... | [INFO] [stdout] 300 | | /// requested arrangement is the case. If, however, a broad knowledge about or even computation with [INFO] [stdout] 301 | | /// two ranges is required, `arrangement()` and `relation()` are the way to go. [INFO] [stdout] | |_______________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:303:5 [INFO] [stdout] | [INFO] [stdout] 303 | / /// Compares a start bound with another. [INFO] [stdout] 304 | | /// [INFO] [stdout] 305 | | /// # Note [INFO] [stdout] 306 | | /// Because the generic `Bound` enum is used, it is not verified if the two bounds are actually [INFO] [stdout] 307 | | /// starts. This responsibility rests on the caller. [INFO] [stdout] | |________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:361:5 [INFO] [stdout] | [INFO] [stdout] 361 | / /// Compares a start bound with an end bound. [INFO] [stdout] 362 | | /// [INFO] [stdout] 363 | | /// # Note [INFO] [stdout] 364 | | /// Because the generic `Bound` enum is used, it is not verified if the two bounds are actually [INFO] [stdout] 365 | | /// start and end. This responsibility rests on the caller. [INFO] [stdout] | |_______________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:417:5 [INFO] [stdout] | [INFO] [stdout] 417 | / /// Compares an end bound with a start bound. [INFO] [stdout] 418 | | /// [INFO] [stdout] 419 | | /// # Note [INFO] [stdout] 420 | | /// Because the generic `Bound` enum is used, it is not verified if the two bounds are actually [INFO] [stdout] 421 | | /// end and start. This responsibility rests on the caller. [INFO] [stdout] | |_______________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:474:5 [INFO] [stdout] | [INFO] [stdout] 474 | / /// Compares an end bound with another. [INFO] [stdout] 475 | | /// [INFO] [stdout] 476 | | /// # Note [INFO] [stdout] 477 | | /// Because the generic `Bound` enum is used, it is not verified if the two bounds are actually [INFO] [stdout] 478 | | /// ends. This responsibility rests on the caller. [INFO] [stdout] | |______________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:532:5 [INFO] [stdout] | [INFO] [stdout] 532 | /// Returns true if two bounds are touching. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:544:5 [INFO] [stdout] | [INFO] [stdout] 544 | / /// Returns true if two ranges are disjoint. [INFO] [stdout] 545 | | /// [INFO] [stdout] 546 | | /// # Note [INFO] [stdout] 547 | | /// No information regarding their arrangement is obtained or returned. [INFO] [stdout] 548 | | /// Please refer to `GenericRange::arrangement()` or `GenericRange::relation()` and match the [INFO] [stdout] 549 | | /// result on their respective `Disjoint` discriminant. [INFO] [stdout] | |___________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:567:5 [INFO] [stdout] | [INFO] [stdout] 567 | / /// Returns true if two ranges are touching. [INFO] [stdout] 568 | | /// [INFO] [stdout] 569 | | /// # Note [INFO] [stdout] 570 | | /// No information regarding their arrangement is obtained or returned. [INFO] [stdout] 571 | | /// Please refer to `GenericRange::arrangement()` or `GenericRange::relation()` and match the [INFO] [stdout] 572 | | /// result on their respective `Touching` discriminant. [INFO] [stdout] | |___________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:586:5 [INFO] [stdout] | [INFO] [stdout] 586 | / /// Returns true if two ranges are overlapping. [INFO] [stdout] 587 | | /// [INFO] [stdout] 588 | | /// # Note [INFO] [stdout] 589 | | /// No information regarding their arrangement is obtained or returned. [INFO] [stdout] 590 | | /// Please refer to `GenericRange::arrangement()` or `GenericRange::relation()` and match the [INFO] [stdout] 591 | | /// result on their respective `Overlapping` discriminant. [INFO] [stdout] | |______________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:639:5 [INFO] [stdout] | [INFO] [stdout] 639 | / /// Returns true if `self` contains `other`. [INFO] [stdout] 640 | | /// [INFO] [stdout] 641 | | /// # Note [INFO] [stdout] 642 | | /// This method and `is_contained_by()` are the only two that differentiate by arrangement. [INFO] [stdout] 643 | | /// If knowledge about containment (in either orientation) is the only information you need, [INFO] [stdout] 644 | | /// it is still generally faster to call these two instead of using [INFO] [stdout] 645 | | /// `GenericRange::arrangement()` or `GenericRange::relation()`. [INFO] [stdout] | |____________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:659:5 [INFO] [stdout] | [INFO] [stdout] 659 | / /// Returns true if `self` is contained in `other`. [INFO] [stdout] 660 | | /// [INFO] [stdout] 661 | | /// # Note [INFO] [stdout] 662 | | /// This method and `is_containing()` are the only two that differentiate by arrangement. [INFO] [stdout] 663 | | /// If knowledge about containment (in either orientation) is the only information you need, [INFO] [stdout] 664 | | /// it is still generally faster to call these two instead of using [INFO] [stdout] 665 | | /// `GenericRange::arrangement()` or `GenericRange::relation()`. [INFO] [stdout] | |____________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:679:5 [INFO] [stdout] | [INFO] [stdout] 679 | / /// Returns true if two ranges are starting on the same element. [INFO] [stdout] 680 | | /// [INFO] [stdout] 681 | | /// # Note [INFO] [stdout] 682 | | /// No information regarding their arrangement is obtained or returned. [INFO] [stdout] 683 | | /// Please refer to `GenericRange::arrangement()` or `GenericRange::relation()` and match the [INFO] [stdout] 684 | | /// result on their respective `Starting` discriminant. [INFO] [stdout] | |___________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:698:5 [INFO] [stdout] | [INFO] [stdout] 698 | / /// Returns true if two ranges are ending on the same element. [INFO] [stdout] 699 | | /// [INFO] [stdout] 700 | | /// # Note [INFO] [stdout] 701 | | /// No information regarding their arrangement is obtained or returned. [INFO] [stdout] 702 | | /// Please refer to `GenericRange::arrangement()` or `GenericRange::relation()` and match the [INFO] [stdout] 703 | | /// result on their respective `Ending` discriminant. [INFO] [stdout] | |_________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:741:5 [INFO] [stdout] | [INFO] [stdout] 741 | / /// Compares this `GenericRange` with another one. [INFO] [stdout] 742 | | /// The relation is expressed as an enum containing only the arrangement in form of the [INFO] [stdout] 743 | | /// discriminant and some additionally obtained information about the original inputs and, [INFO] [stdout] 744 | | /// if applicable, either one is less, shorter, or a singleton. [INFO] [stdout] 745 | | /// [INFO] [stdout] 746 | | /// In addition to the same data obtained by `GenericRange::arrangement()`, the original ranges [INFO] [stdout] 747 | | /// are moved into the struct to allow direct processing. [INFO] [stdout] | |_____________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/relation.rs:843:5 [INFO] [stdout] | [INFO] [stdout] 843 | / /// Compares this `GenericRange` with another one. [INFO] [stdout] 844 | | /// The relation is expressed as an enum containing only the arrangement in form of the [INFO] [stdout] 845 | | /// discriminant and some additionally obtained information about the original inputs and, [INFO] [stdout] 846 | | /// if applicable, either one is less, shorter, or a singleton. [INFO] [stdout] | |___________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:31:1 [INFO] [stdout] | [INFO] [stdout] 31 | /// Method implementations for singleton construction and checking. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/singleton.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / impl GenericRange { [INFO] [stdout] 6 | | /// Constructs a singleton by cloning the input storing it in included bounds for both start [INFO] [stdout] 7 | | /// and end. [INFO] [stdout] 8 | | /// [INFO] [stdout] ... | [INFO] [stdout] 65 | | } [INFO] [stdout] 66 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:33:1 [INFO] [stdout] | [INFO] [stdout] 33 | /// Method implementations to calculate symmetric difference of two ranges. Includes support for `BitXor` operation trait. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/symmetric_difference.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / impl GenericRange { [INFO] [stdout] 6 | | /// Results in two ranges if the inputs are disjoint or touching. [INFO] [stdout] 7 | | /// Results in two ranges (the "left" and "right" disjoint parts) if the inputs are overlapping or contain one another. [INFO] [stdout] 8 | | /// Results in a single range (the disjoint part) if the inputs start or end on the same value. [INFO] [stdout] ... | [INFO] [stdout] 108 | | } [INFO] [stdout] 109 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:35:1 [INFO] [stdout] | [INFO] [stdout] 35 | /// Method implementations to calculate union of two ranges. Includes support for `BitOr` operation trait. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/union.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / impl GenericRange { [INFO] [stdout] 6 | | /// Results in either a single or, if the inputs are disjoint, two ranges. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Examples [INFO] [stdout] ... | [INFO] [stdout] 62 | | } [INFO] [stdout] 63 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:59:1 [INFO] [stdout] | [INFO] [stdout] 59 | /// Constructors and relevant comparison methods. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:61:5 [INFO] [stdout] | [INFO] [stdout] 61 | / /// Creates a new [`GenericRange`](#) using the domain minimum and maximum as start and end. [INFO] [stdout] 62 | | /// [INFO] [stdout] 63 | | /// # core/std equivalent [INFO] [stdout] 64 | | /// [`RangeFull`](https://doc.rust-lang.org/core/ops/struct.RangeFull.html) or `..`. [INFO] [stdout] 65 | | /// [INFO] [stdout] 66 | | /// # Interval notation [INFO] [stdout] 67 | | /// `(-inf, +inf)` [INFO] [stdout] | |______________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:76:5 [INFO] [stdout] | [INFO] [stdout] 76 | /// Returns true if the start is the domain minimum and the end is the domain maximum. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:82:5 [INFO] [stdout] | [INFO] [stdout] 82 | /// Returns true if the range start is open/excluded. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:91:5 [INFO] [stdout] | [INFO] [stdout] 91 | /// Returns true if the range start is closed/included. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:100:5 [INFO] [stdout] | [INFO] [stdout] 100 | /// Returns true if the range start is unbounded. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:109:5 [INFO] [stdout] | [INFO] [stdout] 109 | /// Returns true if the range end is open/excluded. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:118:5 [INFO] [stdout] | [INFO] [stdout] 118 | /// Returns true if the range end is closed/included. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:127:5 [INFO] [stdout] | [INFO] [stdout] 127 | /// Returns true if the range end is unbounded. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:138:5 [INFO] [stdout] | [INFO] [stdout] 138 | /// Convenience method calling [`new_left_open_right_unbounded`](#method.new_left_open_right_unbounded). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:144:5 [INFO] [stdout] | [INFO] [stdout] 144 | / /// Creates a new [`GenericRange`](#) with an open/excluded start and an unbound end. [INFO] [stdout] 145 | | /// Convenience method equivalent is [`new_greater_than`](#method.new_greater_than). [INFO] [stdout] 146 | | /// [INFO] [stdout] 147 | | /// # core/std equivalent [INFO] [stdout] ... | [INFO] [stdout] 150 | | /// # Interval notation [INFO] [stdout] 151 | | /// `(start, +inf)` [INFO] [stdout] | |_______________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:157:5 [INFO] [stdout] | [INFO] [stdout] 157 | /// Returns true if the range start is open/excluded and the end is unbounded. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:165:5 [INFO] [stdout] | [INFO] [stdout] 165 | /// Convenience method calling [`new_left_closed_right_unbounded`](#method.new_left_closed_right_unbounded). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:171:5 [INFO] [stdout] | [INFO] [stdout] 171 | / /// Creates a new [`GenericRange`](#) with a closed/included start and an unbound end. [INFO] [stdout] 172 | | /// Convenience method equivalent is [`new_at_least`](#method.new_at_least). [INFO] [stdout] 173 | | /// [INFO] [stdout] 174 | | /// # core/std equivalent [INFO] [stdout] ... | [INFO] [stdout] 177 | | /// # Interval notation [INFO] [stdout] 178 | | /// `[start, +inf)` [INFO] [stdout] | |_______________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:184:5 [INFO] [stdout] | [INFO] [stdout] 184 | /// Returns true if the range start is closed/included and the end is unbounded. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:192:5 [INFO] [stdout] | [INFO] [stdout] 192 | /// Convenience method calling [`new_left_unbounded_right_open`](#method.new_left_unbounded_right_open). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:198:5 [INFO] [stdout] | [INFO] [stdout] 198 | / /// Creates a new [`GenericRange`](#) with an unbounded start and an open/excluded end. [INFO] [stdout] 199 | | /// Convenience method equivalent is [`new_less_than`](#method.new_less_than). [INFO] [stdout] 200 | | /// [INFO] [stdout] 201 | | /// # core/std equivalent [INFO] [stdout] ... | [INFO] [stdout] 204 | | /// # Interval notation [INFO] [stdout] 205 | | /// `(-inf, end)` [INFO] [stdout] | |_____________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:211:5 [INFO] [stdout] | [INFO] [stdout] 211 | /// Returns true if the range start is unbounded and the end is open/excluded. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:219:5 [INFO] [stdout] | [INFO] [stdout] 219 | /// Convenience method calling [`new_left_unbounded_right_closed`](#method.new_left_unbounded_right_closed). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:225:5 [INFO] [stdout] | [INFO] [stdout] 225 | / /// Creates a new [`GenericRange`](#) with an unbounded start and a closed/included end. [INFO] [stdout] 226 | | /// Convenience method equivalent is [`new_at_most`](#method.new_at_most). [INFO] [stdout] 227 | | /// [INFO] [stdout] 228 | | /// # core/std equivalent [INFO] [stdout] ... | [INFO] [stdout] 231 | | /// # Interval notation [INFO] [stdout] 232 | | /// `(-inf, end]` [INFO] [stdout] | |_____________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:238:5 [INFO] [stdout] | [INFO] [stdout] 238 | /// Returns true if the range start is unbounded and the end is closed/included. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:246:5 [INFO] [stdout] | [INFO] [stdout] 246 | /// Convenience method calling [`new_left_open_right_open`](#method.new_left_open_right_open). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:252:5 [INFO] [stdout] | [INFO] [stdout] 252 | / /// Creates a new [`GenericRange`](#) with an open/excluded start and end. [INFO] [stdout] 253 | | /// Convenience method equivalent is [`new_open`](#method.new_open). [INFO] [stdout] 254 | | /// [INFO] [stdout] 255 | | /// # core/std equivalent [INFO] [stdout] ... | [INFO] [stdout] 258 | | /// # Interval notation [INFO] [stdout] 259 | | /// `(start, end)` [INFO] [stdout] | |______________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:265:5 [INFO] [stdout] | [INFO] [stdout] 265 | /// Returns true if the range start and end are open/excluded. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:273:5 [INFO] [stdout] | [INFO] [stdout] 273 | /// Convenience method calling [`new_left_closed_right_closed`](#method.new_left_closed_right_closed). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:279:5 [INFO] [stdout] | [INFO] [stdout] 279 | / /// Creates a new [`GenericRange`](#) with a closed/included start and end. [INFO] [stdout] 280 | | /// Convenience method equivalent is [`new_closed`](#method.new_closed). [INFO] [stdout] 281 | | /// [INFO] [stdout] 282 | | /// # core/std equivalent [INFO] [stdout] ... | [INFO] [stdout] 285 | | /// # Interval notation [INFO] [stdout] 286 | | /// `[start, end]` [INFO] [stdout] | |______________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:292:5 [INFO] [stdout] | [INFO] [stdout] 292 | /// Returns true if the range start and end are closed/included. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:300:5 [INFO] [stdout] | [INFO] [stdout] 300 | /// Convenience method calling [`new_left_closed_right_open`](#method.new_left_closed_right_open). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:306:5 [INFO] [stdout] | [INFO] [stdout] 306 | / /// Creates a new [`GenericRange`](#) with a closed/included start and an open/excluded end. [INFO] [stdout] 307 | | /// Convenience method equivalent is [`new_closed_open`](#method.new_closed_open). [INFO] [stdout] 308 | | /// [INFO] [stdout] 309 | | /// # core/std equivalent [INFO] [stdout] ... | [INFO] [stdout] 312 | | /// # Interval notation [INFO] [stdout] 313 | | /// `[start, end)` [INFO] [stdout] | |______________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:319:5 [INFO] [stdout] | [INFO] [stdout] 319 | /// Returns true if the range start is closed/included and the end is open/excluded. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:327:5 [INFO] [stdout] | [INFO] [stdout] 327 | /// Convenience method calling [`new_left_open_right_closed`](#method.new_left_open_right_closed). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:333:5 [INFO] [stdout] | [INFO] [stdout] 333 | / /// Creates a new [`GenericRange`](#) with a closed/included start and an open/excluded end. [INFO] [stdout] 334 | | /// Convenience method equivalent is [`new_open_closed`](#method.new_open_closed). [INFO] [stdout] 335 | | /// [INFO] [stdout] 336 | | /// # core/std equivalent [INFO] [stdout] ... | [INFO] [stdout] 339 | | /// # Interval notation [INFO] [stdout] 340 | | /// `(start, end]` [INFO] [stdout] | |______________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:346:5 [INFO] [stdout] | [INFO] [stdout] 346 | /// Returns true if the range start is open/excluded and the end is closed/included. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:354:5 [INFO] [stdout] | [INFO] [stdout] 354 | / /// Custom range from [`Bound`s](https://doc.rust-lang.org/core/ops/enum.Bound.html). [INFO] [stdout] 355 | | /// [INFO] [stdout] 356 | | /// # Panics [INFO] [stdout] 357 | | /// It is asserted that `start <= end`. [INFO] [stdout] | |___________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:133:1 [INFO] [stdout] | [INFO] [stdout] 133 | /// Range-set and combinatory logic. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:10:1 [INFO] [stdout] | [INFO] [stdout] 10 | /// Ranges methods to find out if a value is contained within. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/contains.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / impl Ranges { [INFO] [stdout] 6 | | /// Returns true if the given `item` is contained in any of the internal disjoint ranges. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Note [INFO] [stdout] ... | [INFO] [stdout] 85 | | } [INFO] [stdout] 86 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:12:1 [INFO] [stdout] | [INFO] [stdout] 12 | /// Ranges difference. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/difference.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Ranges { [INFO] [stdout] 7 | | /// Calculates the relative complement (difference) of two ranges. [INFO] [stdout] 8 | | /// [INFO] [stdout] 9 | | /// # Examples [INFO] [stdout] ... | [INFO] [stdout] 159 | | } [INFO] [stdout] 160 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:14:1 [INFO] [stdout] | [INFO] [stdout] 14 | /// Ranges formatting. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:16:1 [INFO] [stdout] | [INFO] [stdout] 16 | /// Ranges insertion. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/insert.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / impl Ranges { [INFO] [stdout] 6 | | /// Returns `true` if any element or the internal vector was modified to accommodate `range`. [INFO] [stdout] 7 | | /// This means `false` is returned if and only if nothing has changed. [INFO] [stdout] 8 | | /// [INFO] [stdout] ... | [INFO] [stdout] 155 | | } [INFO] [stdout] 156 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:18:1 [INFO] [stdout] | [INFO] [stdout] 18 | /// Ranges intersection. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/intersect.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Ranges { [INFO] [stdout] 7 | | /// Calculates the intersection of two ranges. [INFO] [stdout] 8 | | /// [INFO] [stdout] 9 | | /// # Examples [INFO] [stdout] ... | [INFO] [stdout] 146 | | } [INFO] [stdout] 147 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:20:1 [INFO] [stdout] | [INFO] [stdout] 20 | /// Ranges inversion. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/invert.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / impl Ranges { [INFO] [stdout] 6 | | /// Inverts the range set. [INFO] [stdout] 7 | | /// [INFO] [stdout] 8 | | /// # Examples [INFO] [stdout] ... | [INFO] [stdout] 42 | | } [INFO] [stdout] 43 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:25:1 [INFO] [stdout] | [INFO] [stdout] 25 | /// Ranges removal. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/remove.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / impl Ranges { [INFO] [stdout] 6 | | /// Returns `true` if any element or the internal vector was modified to remove `range`. [INFO] [stdout] 7 | | /// This means `false` is returned if and only if nothing has changed. [INFO] [stdout] 8 | | /// [INFO] [stdout] ... | [INFO] [stdout] 105 | | } [INFO] [stdout] 106 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:27:1 [INFO] [stdout] | [INFO] [stdout] 27 | /// Ranges symmetric difference. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/symmetric_difference.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Ranges { [INFO] [stdout] 7 | | /// Calculates the relative complement (difference) of two ranges. [INFO] [stdout] 8 | | /// [INFO] [stdout] 9 | | /// # Examples [INFO] [stdout] ... | [INFO] [stdout] 267 | | } [INFO] [stdout] 268 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:29:1 [INFO] [stdout] | [INFO] [stdout] 29 | /// Ranges unionization. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/union.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Ranges { [INFO] [stdout] 7 | | /// Calculates the union of two ranges. [INFO] [stdout] 8 | | /// [INFO] [stdout] 9 | | /// # Examples [INFO] [stdout] ... | [INFO] [stdout] 168 | | } [INFO] [stdout] 169 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:49:1 [INFO] [stdout] | [INFO] [stdout] 49 | / impl Ranges { [INFO] [stdout] 50 | | /// Creates a new empty `Ranges` with an initial capacity of 0. [INFO] [stdout] 51 | | #[must_use] [INFO] [stdout] 52 | | pub fn new() -> Self { [INFO] [stdout] ... | [INFO] [stdout] 174 | | } [INFO] [stdout] 175 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:50:5 [INFO] [stdout] | [INFO] [stdout] 50 | /// Creates a new empty `Ranges` with an initial capacity of 0. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:56:5 [INFO] [stdout] | [INFO] [stdout] 56 | /// Initializes the underlying vector with a given capacity. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:64:5 [INFO] [stdout] | [INFO] [stdout] 64 | /// Initializes the underlying vector with a single full range. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:72:5 [INFO] [stdout] | [INFO] [stdout] 72 | /// Returns true if the whole domain is in this range. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:84:5 [INFO] [stdout] | [INFO] [stdout] 84 | /// Returns the amount of saved disjoint ranges. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:90:5 [INFO] [stdout] | [INFO] [stdout] 90 | /// Returns true if there are no ranges and we have an empty set. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:170:5 [INFO] [stdout] | [INFO] [stdout] 170 | /// Returns the internal vector of `GenericRange`s as a slice. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i128.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Domain for i128 { [INFO] [stdout] 7 | | const DISCRETE: bool = true; [INFO] [stdout] 8 | | [INFO] [stdout] 9 | | /// Always returns `Some(self - 1)` unless `self` is `Self::MIN`. [INFO] [stdout] ... | [INFO] [stdout] 56 | | } [INFO] [stdout] 57 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i128.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | const DISCRETE: bool = true; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i128.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | /// Always returns `Some(self - 1)` unless `self` is `Self::MIN`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i128.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | /// Always returns `Some(self + 1)` unless `self` is `Self::MAX`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i128.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | /// Returns `Included(Self::MIN)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i128.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | /// Returns `Included(Self::MAX)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i128.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | / fn shares_neighbour_with(&self, other: &Self) -> bool { [INFO] [stdout] 44 | | let (big, small) = match self.cmp(other) { [INFO] [stdout] 45 | | Ordering::Less => (other, self), [INFO] [stdout] 46 | | Ordering::Equal => return false, [INFO] [stdout] ... | [INFO] [stdout] 55 | | big - small == 2 [INFO] [stdout] 56 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i16.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Domain for i16 { [INFO] [stdout] 7 | | const DISCRETE: bool = true; [INFO] [stdout] 8 | | [INFO] [stdout] 9 | | /// Always returns `Some(self - 1)` unless `self` is `Self::MIN`. [INFO] [stdout] ... | [INFO] [stdout] 56 | | } [INFO] [stdout] 57 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i16.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | const DISCRETE: bool = true; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i16.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | /// Always returns `Some(self - 1)` unless `self` is `Self::MIN`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i16.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | /// Always returns `Some(self + 1)` unless `self` is `Self::MAX`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i16.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | /// Returns `Included(Self::MIN)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i16.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | /// Returns `Included(Self::MAX)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i16.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | / fn shares_neighbour_with(&self, other: &Self) -> bool { [INFO] [stdout] 44 | | let (big, small) = match self.cmp(other) { [INFO] [stdout] 45 | | Ordering::Less => (other, self), [INFO] [stdout] 46 | | Ordering::Equal => return false, [INFO] [stdout] ... | [INFO] [stdout] 55 | | big - small == 2 [INFO] [stdout] 56 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i32.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Domain for i32 { [INFO] [stdout] 7 | | const DISCRETE: bool = true; [INFO] [stdout] 8 | | [INFO] [stdout] 9 | | /// Always returns `Some(self - 1)` unless `self` is `Self::MIN`. [INFO] [stdout] ... | [INFO] [stdout] 56 | | } [INFO] [stdout] 57 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i32.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | const DISCRETE: bool = true; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i32.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | /// Always returns `Some(self - 1)` unless `self` is `Self::MIN`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i32.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | /// Always returns `Some(self + 1)` unless `self` is `Self::MAX`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i32.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | /// Returns `Included(Self::MIN)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i32.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | /// Returns `Included(Self::MAX)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i32.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | / fn shares_neighbour_with(&self, other: &Self) -> bool { [INFO] [stdout] 44 | | let (big, small) = match self.cmp(other) { [INFO] [stdout] 45 | | Ordering::Less => (other, self), [INFO] [stdout] 46 | | Ordering::Equal => return false, [INFO] [stdout] ... | [INFO] [stdout] 55 | | big - small == 2 [INFO] [stdout] 56 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i64.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Domain for i64 { [INFO] [stdout] 7 | | const DISCRETE: bool = true; [INFO] [stdout] 8 | | [INFO] [stdout] 9 | | /// Always returns `Some(self - 1)` unless `self` is `Self::MIN`. [INFO] [stdout] ... | [INFO] [stdout] 56 | | } [INFO] [stdout] 57 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i64.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | const DISCRETE: bool = true; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i64.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | /// Always returns `Some(self - 1)` unless `self` is `Self::MIN`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i64.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | /// Always returns `Some(self + 1)` unless `self` is `Self::MAX`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i64.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | /// Returns `Included(Self::MIN)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i64.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | /// Returns `Included(Self::MAX)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i64.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | / fn shares_neighbour_with(&self, other: &Self) -> bool { [INFO] [stdout] 44 | | let (big, small) = match self.cmp(other) { [INFO] [stdout] 45 | | Ordering::Less => (other, self), [INFO] [stdout] 46 | | Ordering::Equal => return false, [INFO] [stdout] ... | [INFO] [stdout] 55 | | big - small == 2 [INFO] [stdout] 56 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i8.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Domain for i8 { [INFO] [stdout] 7 | | const DISCRETE: bool = true; [INFO] [stdout] 8 | | [INFO] [stdout] 9 | | /// Always returns `Some(self - 1)` unless `self` is `Self::MIN`. [INFO] [stdout] ... | [INFO] [stdout] 56 | | } [INFO] [stdout] 57 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i8.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | const DISCRETE: bool = true; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i8.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | /// Always returns `Some(self - 1)` unless `self` is `Self::MIN`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i8.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | /// Always returns `Some(self + 1)` unless `self` is `Self::MAX`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i8.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | /// Returns `Included(Self::MIN)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i8.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | /// Returns `Included(Self::MAX)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i8.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | / fn shares_neighbour_with(&self, other: &Self) -> bool { [INFO] [stdout] 44 | | let (big, small) = match self.cmp(other) { [INFO] [stdout] 45 | | Ordering::Less => (other, self), [INFO] [stdout] 46 | | Ordering::Equal => return false, [INFO] [stdout] ... | [INFO] [stdout] 55 | | big - small == 2 [INFO] [stdout] 56 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/isize.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Domain for isize { [INFO] [stdout] 7 | | const DISCRETE: bool = true; [INFO] [stdout] 8 | | [INFO] [stdout] 9 | | /// Always returns `Some(self - 1)` unless `self` is `Self::MIN`. [INFO] [stdout] ... | [INFO] [stdout] 56 | | } [INFO] [stdout] 57 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/isize.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | const DISCRETE: bool = true; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/isize.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | /// Always returns `Some(self - 1)` unless `self` is `Self::MIN`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/isize.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | /// Always returns `Some(self + 1)` unless `self` is `Self::MAX`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/isize.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | /// Returns `Included(Self::MIN)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/isize.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | /// Returns `Included(Self::MAX)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/isize.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | / fn shares_neighbour_with(&self, other: &Self) -> bool { [INFO] [stdout] 44 | | let (big, small) = match self.cmp(other) { [INFO] [stdout] 45 | | Ordering::Less => (other, self), [INFO] [stdout] 46 | | Ordering::Equal => return false, [INFO] [stdout] ... | [INFO] [stdout] 55 | | big - small == 2 [INFO] [stdout] 56 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u128.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Domain for u128 { [INFO] [stdout] 7 | | const DISCRETE: bool = true; [INFO] [stdout] 8 | | [INFO] [stdout] 9 | | /// Always returns `Some(self - 1)` unless `self` is zero. [INFO] [stdout] ... | [INFO] [stdout] 51 | | } [INFO] [stdout] 52 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u128.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | const DISCRETE: bool = true; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u128.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | /// Always returns `Some(self - 1)` unless `self` is zero. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u128.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | /// Always returns `Some(self + 1)` unless `self` is `Self::MAX`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u128.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | /// Returns `Included(Self::MIN)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u128.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | /// Returns `Included(Self::MAX)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u128.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | / fn shares_neighbour_with(&self, other: &Self) -> bool { [INFO] [stdout] 44 | | let (big, small) = match self.cmp(other) { [INFO] [stdout] 45 | | Ordering::Less => (other, self), [INFO] [stdout] 46 | | Ordering::Equal => return false, [INFO] [stdout] ... | [INFO] [stdout] 50 | | big - small == 2 [INFO] [stdout] 51 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u16.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Domain for u16 { [INFO] [stdout] 7 | | const DISCRETE: bool = true; [INFO] [stdout] 8 | | [INFO] [stdout] 9 | | /// Always returns `Some(self - 1)` unless `self` is zero. [INFO] [stdout] ... | [INFO] [stdout] 51 | | } [INFO] [stdout] 52 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u16.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | const DISCRETE: bool = true; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u16.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | /// Always returns `Some(self - 1)` unless `self` is zero. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u16.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | /// Always returns `Some(self + 1)` unless `self` is `Self::MAX`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u16.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | /// Returns `Included(Self::MIN)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u16.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | /// Returns `Included(Self::MAX)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u16.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | / fn shares_neighbour_with(&self, other: &Self) -> bool { [INFO] [stdout] 44 | | let (big, small) = match self.cmp(other) { [INFO] [stdout] 45 | | Ordering::Less => (other, self), [INFO] [stdout] 46 | | Ordering::Equal => return false, [INFO] [stdout] ... | [INFO] [stdout] 50 | | big - small == 2 [INFO] [stdout] 51 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u32.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Domain for u32 { [INFO] [stdout] 7 | | const DISCRETE: bool = true; [INFO] [stdout] 8 | | [INFO] [stdout] 9 | | /// Always returns `Some(self - 1)` unless `self` is zero. [INFO] [stdout] ... | [INFO] [stdout] 51 | | } [INFO] [stdout] 52 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u32.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | const DISCRETE: bool = true; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u32.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | /// Always returns `Some(self - 1)` unless `self` is zero. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u32.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | /// Always returns `Some(self + 1)` unless `self` is `Self::MAX`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u32.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | /// Returns `Included(Self::MIN)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u32.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | /// Returns `Included(Self::MAX)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u32.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | / fn shares_neighbour_with(&self, other: &Self) -> bool { [INFO] [stdout] 44 | | let (big, small) = match self.cmp(other) { [INFO] [stdout] 45 | | Ordering::Less => (other, self), [INFO] [stdout] 46 | | Ordering::Equal => return false, [INFO] [stdout] ... | [INFO] [stdout] 50 | | big - small == 2 [INFO] [stdout] 51 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u64.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Domain for u64 { [INFO] [stdout] 7 | | const DISCRETE: bool = true; [INFO] [stdout] 8 | | [INFO] [stdout] 9 | | /// Always returns `Some(self - 1)` unless `self` is zero. [INFO] [stdout] ... | [INFO] [stdout] 51 | | } [INFO] [stdout] 52 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u64.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | const DISCRETE: bool = true; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u64.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | /// Always returns `Some(self - 1)` unless `self` is zero. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u64.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | /// Always returns `Some(self + 1)` unless `self` is `Self::MAX`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u64.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | /// Returns `Included(Self::MIN)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u64.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | /// Returns `Included(Self::MAX)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u64.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | / fn shares_neighbour_with(&self, other: &Self) -> bool { [INFO] [stdout] 44 | | let (big, small) = match self.cmp(other) { [INFO] [stdout] 45 | | Ordering::Less => (other, self), [INFO] [stdout] 46 | | Ordering::Equal => return false, [INFO] [stdout] ... | [INFO] [stdout] 50 | | big - small == 2 [INFO] [stdout] 51 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u8.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Domain for u8 { [INFO] [stdout] 7 | | const DISCRETE: bool = true; [INFO] [stdout] 8 | | [INFO] [stdout] 9 | | /// Always returns `Some(self - 1)` unless `self` is zero. [INFO] [stdout] ... | [INFO] [stdout] 51 | | } [INFO] [stdout] 52 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u8.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | const DISCRETE: bool = true; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u8.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | /// Always returns `Some(self - 1)` unless `self` is zero. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u8.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | /// Always returns `Some(self + 1)` unless `self` is `Self::MAX`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u8.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | /// Returns `Included(Self::MIN)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u8.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | /// Returns `Included(Self::MAX)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u8.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | / fn shares_neighbour_with(&self, other: &Self) -> bool { [INFO] [stdout] 44 | | let (big, small) = match self.cmp(other) { [INFO] [stdout] 45 | | Ordering::Less => (other, self), [INFO] [stdout] 46 | | Ordering::Equal => return false, [INFO] [stdout] ... | [INFO] [stdout] 50 | | big - small == 2 [INFO] [stdout] 51 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/usize.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Domain for usize { [INFO] [stdout] 7 | | const DISCRETE: bool = true; [INFO] [stdout] 8 | | [INFO] [stdout] 9 | | /// Always returns `Some(self - 1)` unless `self` is zero. [INFO] [stdout] ... | [INFO] [stdout] 51 | | } [INFO] [stdout] 52 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/usize.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | const DISCRETE: bool = true; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/usize.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | /// Always returns `Some(self - 1)` unless `self` is zero. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/usize.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | /// Always returns `Some(self + 1)` unless `self` is `Self::MAX`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/usize.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | /// Returns `Included(Self::MIN)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/usize.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | /// Returns `Included(Self::MAX)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/usize.rs:43:5 [INFO] [stdout] | [INFO] [stdout] 43 | / fn shares_neighbour_with(&self, other: &Self) -> bool { [INFO] [stdout] 44 | | let (big, small) = match self.cmp(other) { [INFO] [stdout] 45 | | Ordering::Less => (other, self), [INFO] [stdout] 46 | | Ordering::Equal => return false, [INFO] [stdout] ... | [INFO] [stdout] 50 | | big - small == 2 [INFO] [stdout] 51 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/bool.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / impl Domain for bool { [INFO] [stdout] 6 | | const DISCRETE: bool = true; [INFO] [stdout] 7 | | [INFO] [stdout] 8 | | /// Returns: [INFO] [stdout] ... | [INFO] [stdout] 56 | | } [INFO] [stdout] 57 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/bool.rs:6:5 [INFO] [stdout] | [INFO] [stdout] 6 | const DISCRETE: bool = true; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/bool.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | / /// Returns: [INFO] [stdout] 9 | | /// [INFO] [stdout] 10 | | /// | `self` | Output | [INFO] [stdout] 11 | | /// |---------|--------------| [INFO] [stdout] 12 | | /// | true | Some(false) | [INFO] [stdout] 13 | | /// | false | None | [INFO] [stdout] | |__________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/bool.rs:22:5 [INFO] [stdout] | [INFO] [stdout] 22 | / /// Returns: [INFO] [stdout] 23 | | /// [INFO] [stdout] 24 | | /// | `self` | Output | [INFO] [stdout] 25 | | /// |---------|--------------| [INFO] [stdout] 26 | | /// | true | None | [INFO] [stdout] 27 | | /// | false | Some(true) | [INFO] [stdout] | |__________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/bool.rs:36:5 [INFO] [stdout] | [INFO] [stdout] 36 | /// Returns `Included(false)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/bool.rs:42:5 [INFO] [stdout] | [INFO] [stdout] 42 | /// Returns `Included(true)`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/bool.rs:49:5 [INFO] [stdout] | [INFO] [stdout] 49 | / fn is_next_to(&self, other: &Self) -> bool { [INFO] [stdout] 50 | | self != other [INFO] [stdout] 51 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/bool.rs:54:5 [INFO] [stdout] | [INFO] [stdout] 54 | / fn shares_neighbour_with(&self, _other: &Self) -> bool { [INFO] [stdout] 55 | | false [INFO] [stdout] 56 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/char.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / /// This implementation recognizes invalid characters and skips them, [INFO] [stdout] 6 | | /// reserved characters, however, are not. [INFO] [stdout] | |__________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/char.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | const DISCRETE: bool = true; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/char.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | / /// If the invalid character boundary from the right side is hit, meaning `self` is `\u{0xe000}`, [INFO] [stdout] 11 | | /// the returned value will be `\u{0xd7ff}`. [INFO] [stdout] | |________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/char.rs:32:5 [INFO] [stdout] | [INFO] [stdout] 32 | / /// If the invalid character boundary from the left side is hit, meaning `self` is `\u{0xd7ff}`, [INFO] [stdout] 33 | | /// the returned value will be `\u{0xe000}`. [INFO] [stdout] | |________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/char.rs:54:5 [INFO] [stdout] | [INFO] [stdout] 54 | /// Returns `\u{0x0}`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/char.rs:59:5 [INFO] [stdout] | [INFO] [stdout] 59 | /// Returns `\u{10ffff}`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/ordering.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Domain for Ordering { [INFO] [stdout] 7 | | const DISCRETE: bool = true; [INFO] [stdout] 8 | | [INFO] [stdout] 9 | | fn predecessor(&self) -> Option { [INFO] [stdout] ... | [INFO] [stdout] 60 | | } [INFO] [stdout] 61 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/ordering.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | const DISCRETE: bool = true; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/ordering.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | / fn predecessor(&self) -> Option { [INFO] [stdout] 10 | | match self { [INFO] [stdout] 11 | | Ordering::Less => None, [INFO] [stdout] 12 | | Ordering::Equal => Some(Ordering::Less), [INFO] [stdout] 13 | | Ordering::Greater => Some(Ordering::Equal), [INFO] [stdout] 14 | | } [INFO] [stdout] 15 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/ordering.rs:17:5 [INFO] [stdout] | [INFO] [stdout] 17 | / fn successor(&self) -> Option { [INFO] [stdout] 18 | | match self { [INFO] [stdout] 19 | | Ordering::Less => Some(Ordering::Equal), [INFO] [stdout] 20 | | Ordering::Equal => Some(Ordering::Greater), [INFO] [stdout] 21 | | Ordering::Greater => None, [INFO] [stdout] 22 | | } [INFO] [stdout] 23 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/ordering.rs:25:5 [INFO] [stdout] | [INFO] [stdout] 25 | / fn minimum() -> Bound { [INFO] [stdout] 26 | | Bound::Included(Ordering::Less) [INFO] [stdout] 27 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/ordering.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | / fn maximum() -> Bound { [INFO] [stdout] 30 | | Bound::Included(Ordering::Greater) [INFO] [stdout] 31 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/ordering.rs:33:5 [INFO] [stdout] | [INFO] [stdout] 33 | / fn is_next_to(&self, other: &Self) -> bool { [INFO] [stdout] 34 | | match (self, other) { [INFO] [stdout] 35 | | // when they're equal [INFO] [stdout] 36 | | (Ordering::Less, Ordering::Less) [INFO] [stdout] ... | [INFO] [stdout] 47 | | } [INFO] [stdout] 48 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/ordering.rs:50:5 [INFO] [stdout] | [INFO] [stdout] 50 | / fn shares_neighbour_with(&self, other: &Self) -> bool { [INFO] [stdout] 51 | | match (self, other) { [INFO] [stdout] 52 | | // when they're next to `Equal` [INFO] [stdout] 53 | | | (Ordering::Equal, _) [INFO] [stdout] ... | [INFO] [stdout] 59 | | } [INFO] [stdout] 60 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i128.rs:59:1 [INFO] [stdout] | [INFO] [stdout] 59 | / impl Iterable for i128 { [INFO] [stdout] 60 | | type Output = Self; [INFO] [stdout] 61 | | [INFO] [stdout] 62 | | #[must_use] [INFO] [stdout] ... | [INFO] [stdout] 70 | | } [INFO] [stdout] 71 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i128.rs:60:5 [INFO] [stdout] | [INFO] [stdout] 60 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i128.rs:63:5 [INFO] [stdout] | [INFO] [stdout] 63 | / fn next(&self) -> Option { [INFO] [stdout] 64 | | if *self == Self::max_value() { [INFO] [stdout] 65 | | None [INFO] [stdout] 66 | | } else { [INFO] [stdout] ... | [INFO] [stdout] 69 | | } [INFO] [stdout] 70 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i16.rs:59:1 [INFO] [stdout] | [INFO] [stdout] 59 | / impl Iterable for i16 { [INFO] [stdout] 60 | | type Output = Self; [INFO] [stdout] 61 | | [INFO] [stdout] 62 | | fn next(&self) -> Option { [INFO] [stdout] ... | [INFO] [stdout] 69 | | } [INFO] [stdout] 70 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i16.rs:60:5 [INFO] [stdout] | [INFO] [stdout] 60 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i16.rs:62:5 [INFO] [stdout] | [INFO] [stdout] 62 | / fn next(&self) -> Option { [INFO] [stdout] 63 | | if *self == Self::max_value() { [INFO] [stdout] 64 | | None [INFO] [stdout] 65 | | } else { [INFO] [stdout] ... | [INFO] [stdout] 68 | | } [INFO] [stdout] 69 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i32.rs:59:1 [INFO] [stdout] | [INFO] [stdout] 59 | / impl Iterable for i32 { [INFO] [stdout] 60 | | type Output = Self; [INFO] [stdout] 61 | | [INFO] [stdout] 62 | | #[must_use] [INFO] [stdout] ... | [INFO] [stdout] 70 | | } [INFO] [stdout] 71 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i32.rs:60:5 [INFO] [stdout] | [INFO] [stdout] 60 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i32.rs:63:5 [INFO] [stdout] | [INFO] [stdout] 63 | / fn next(&self) -> Option { [INFO] [stdout] 64 | | if *self == Self::max_value() { [INFO] [stdout] 65 | | None [INFO] [stdout] 66 | | } else { [INFO] [stdout] ... | [INFO] [stdout] 69 | | } [INFO] [stdout] 70 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i64.rs:59:1 [INFO] [stdout] | [INFO] [stdout] 59 | / impl Iterable for i64 { [INFO] [stdout] 60 | | type Output = Self; [INFO] [stdout] 61 | | [INFO] [stdout] 62 | | fn next(&self) -> Option { [INFO] [stdout] ... | [INFO] [stdout] 69 | | } [INFO] [stdout] 70 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i64.rs:60:5 [INFO] [stdout] | [INFO] [stdout] 60 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i64.rs:62:5 [INFO] [stdout] | [INFO] [stdout] 62 | / fn next(&self) -> Option { [INFO] [stdout] 63 | | if *self == Self::max_value() { [INFO] [stdout] 64 | | None [INFO] [stdout] 65 | | } else { [INFO] [stdout] ... | [INFO] [stdout] 68 | | } [INFO] [stdout] 69 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i8.rs:59:1 [INFO] [stdout] | [INFO] [stdout] 59 | / impl Iterable for i8 { [INFO] [stdout] 60 | | type Output = Self; [INFO] [stdout] 61 | | [INFO] [stdout] 62 | | #[must_use] [INFO] [stdout] ... | [INFO] [stdout] 70 | | } [INFO] [stdout] 71 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i8.rs:60:5 [INFO] [stdout] | [INFO] [stdout] 60 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/i8.rs:63:5 [INFO] [stdout] | [INFO] [stdout] 63 | / fn next(&self) -> Option { [INFO] [stdout] 64 | | if *self == Self::max_value() { [INFO] [stdout] 65 | | None [INFO] [stdout] 66 | | } else { [INFO] [stdout] ... | [INFO] [stdout] 69 | | } [INFO] [stdout] 70 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/isize.rs:59:1 [INFO] [stdout] | [INFO] [stdout] 59 | / impl Iterable for isize { [INFO] [stdout] 60 | | type Output = Self; [INFO] [stdout] 61 | | [INFO] [stdout] 62 | | #[must_use] [INFO] [stdout] ... | [INFO] [stdout] 70 | | } [INFO] [stdout] 71 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/isize.rs:60:5 [INFO] [stdout] | [INFO] [stdout] 60 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/isize.rs:63:5 [INFO] [stdout] | [INFO] [stdout] 63 | / fn next(&self) -> Option { [INFO] [stdout] 64 | | if *self == Self::max_value() { [INFO] [stdout] 65 | | None [INFO] [stdout] 66 | | } else { [INFO] [stdout] ... | [INFO] [stdout] 69 | | } [INFO] [stdout] 70 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u128.rs:54:1 [INFO] [stdout] | [INFO] [stdout] 54 | / impl Iterable for u128 { [INFO] [stdout] 55 | | type Output = Self; [INFO] [stdout] 56 | | [INFO] [stdout] 57 | | fn next(&self) -> Option { [INFO] [stdout] ... | [INFO] [stdout] 64 | | } [INFO] [stdout] 65 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u128.rs:55:5 [INFO] [stdout] | [INFO] [stdout] 55 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u128.rs:57:5 [INFO] [stdout] | [INFO] [stdout] 57 | / fn next(&self) -> Option { [INFO] [stdout] 58 | | if *self == Self::max_value() { [INFO] [stdout] 59 | | None [INFO] [stdout] 60 | | } else { [INFO] [stdout] ... | [INFO] [stdout] 63 | | } [INFO] [stdout] 64 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u16.rs:54:1 [INFO] [stdout] | [INFO] [stdout] 54 | / impl Iterable for u16 { [INFO] [stdout] 55 | | type Output = Self; [INFO] [stdout] 56 | | [INFO] [stdout] 57 | | fn next(&self) -> Option { [INFO] [stdout] ... | [INFO] [stdout] 64 | | } [INFO] [stdout] 65 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u16.rs:55:5 [INFO] [stdout] | [INFO] [stdout] 55 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u16.rs:57:5 [INFO] [stdout] | [INFO] [stdout] 57 | / fn next(&self) -> Option { [INFO] [stdout] 58 | | if *self == Self::max_value() { [INFO] [stdout] 59 | | None [INFO] [stdout] 60 | | } else { [INFO] [stdout] ... | [INFO] [stdout] 63 | | } [INFO] [stdout] 64 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u32.rs:54:1 [INFO] [stdout] | [INFO] [stdout] 54 | / impl Iterable for u32 { [INFO] [stdout] 55 | | type Output = Self; [INFO] [stdout] 56 | | [INFO] [stdout] 57 | | fn next(&self) -> Option { [INFO] [stdout] ... | [INFO] [stdout] 64 | | } [INFO] [stdout] 65 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u32.rs:55:5 [INFO] [stdout] | [INFO] [stdout] 55 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u32.rs:57:5 [INFO] [stdout] | [INFO] [stdout] 57 | / fn next(&self) -> Option { [INFO] [stdout] 58 | | if *self == Self::max_value() { [INFO] [stdout] 59 | | None [INFO] [stdout] 60 | | } else { [INFO] [stdout] ... | [INFO] [stdout] 63 | | } [INFO] [stdout] 64 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u64.rs:54:1 [INFO] [stdout] | [INFO] [stdout] 54 | / impl Iterable for u64 { [INFO] [stdout] 55 | | type Output = Self; [INFO] [stdout] 56 | | [INFO] [stdout] 57 | | fn next(&self) -> Option { [INFO] [stdout] ... | [INFO] [stdout] 64 | | } [INFO] [stdout] 65 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u64.rs:55:5 [INFO] [stdout] | [INFO] [stdout] 55 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u64.rs:57:5 [INFO] [stdout] | [INFO] [stdout] 57 | / fn next(&self) -> Option { [INFO] [stdout] 58 | | if *self == Self::max_value() { [INFO] [stdout] 59 | | None [INFO] [stdout] 60 | | } else { [INFO] [stdout] ... | [INFO] [stdout] 63 | | } [INFO] [stdout] 64 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u8.rs:54:1 [INFO] [stdout] | [INFO] [stdout] 54 | / impl Iterable for u8 { [INFO] [stdout] 55 | | type Output = Self; [INFO] [stdout] 56 | | [INFO] [stdout] 57 | | #[must_use] [INFO] [stdout] ... | [INFO] [stdout] 65 | | } [INFO] [stdout] 66 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u8.rs:55:5 [INFO] [stdout] | [INFO] [stdout] 55 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/u8.rs:58:5 [INFO] [stdout] | [INFO] [stdout] 58 | / fn next(&self) -> Option { [INFO] [stdout] 59 | | if *self == Self::max_value() { [INFO] [stdout] 60 | | None [INFO] [stdout] 61 | | } else { [INFO] [stdout] ... | [INFO] [stdout] 64 | | } [INFO] [stdout] 65 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/usize.rs:54:1 [INFO] [stdout] | [INFO] [stdout] 54 | / impl Iterable for usize { [INFO] [stdout] 55 | | type Output = Self; [INFO] [stdout] 56 | | [INFO] [stdout] 57 | | fn next(&self) -> Option { [INFO] [stdout] ... | [INFO] [stdout] 64 | | } [INFO] [stdout] 65 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/usize.rs:55:5 [INFO] [stdout] | [INFO] [stdout] 55 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/usize.rs:57:5 [INFO] [stdout] | [INFO] [stdout] 57 | / fn next(&self) -> Option { [INFO] [stdout] 58 | | if *self == Self::max_value() { [INFO] [stdout] 59 | | None [INFO] [stdout] 60 | | } else { [INFO] [stdout] ... | [INFO] [stdout] 63 | | } [INFO] [stdout] 64 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/bool.rs:59:1 [INFO] [stdout] | [INFO] [stdout] 59 | / impl Iterable for bool { [INFO] [stdout] 60 | | type Output = Self; [INFO] [stdout] 61 | | [INFO] [stdout] 62 | | #[must_use] [INFO] [stdout] ... | [INFO] [stdout] 65 | | } [INFO] [stdout] 66 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/bool.rs:60:5 [INFO] [stdout] | [INFO] [stdout] 60 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/bool.rs:63:5 [INFO] [stdout] | [INFO] [stdout] 63 | / fn next(&self) -> Option { [INFO] [stdout] 64 | | self.successor() [INFO] [stdout] 65 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/char.rs:90:5 [INFO] [stdout] | [INFO] [stdout] 90 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/domain/char.rs:93:5 [INFO] [stdout] | [INFO] [stdout] 93 | / fn next(&self) -> Option { [INFO] [stdout] 94 | | self.successor() [INFO] [stdout] 95 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/singleton.rs:68:1 [INFO] [stdout] | [INFO] [stdout] 68 | / impl From for GenericRange { [INFO] [stdout] 69 | | #[must_use] [INFO] [stdout] 70 | | fn from(val: T) -> Self { [INFO] [stdout] 71 | | Self::singleton(val) [INFO] [stdout] 72 | | } [INFO] [stdout] 73 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/singleton.rs:70:5 [INFO] [stdout] | [INFO] [stdout] 70 | / fn from(val: T) -> Self { [INFO] [stdout] 71 | | Self::singleton(val) [INFO] [stdout] 72 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:416:1 [INFO] [stdout] | [INFO] [stdout] 416 | /// Converts the `Range` using [`Self::closed_open(range.start, range.end)`](#method.closed_open). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:419:5 [INFO] [stdout] | [INFO] [stdout] 419 | / fn from(range: Range) -> Self { [INFO] [stdout] 420 | | Self::new_closed_open(range.start, range.end) [INFO] [stdout] 421 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:424:1 [INFO] [stdout] | [INFO] [stdout] 424 | /// Converts the `RangeFrom` using [`Self::at_least(range.start)`](#method.at_least). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:427:5 [INFO] [stdout] | [INFO] [stdout] 427 | / fn from(range: RangeFrom) -> Self { [INFO] [stdout] 428 | | Self::new_at_least(range.start) [INFO] [stdout] 429 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:432:1 [INFO] [stdout] | [INFO] [stdout] 432 | /// Converts the `RangeFull` using [`Self::full()`](#method.full). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:435:5 [INFO] [stdout] | [INFO] [stdout] 435 | / fn from(_range: RangeFull) -> Self { [INFO] [stdout] 436 | | Self::full() [INFO] [stdout] 437 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:440:1 [INFO] [stdout] | [INFO] [stdout] 440 | /// Converts the `RangeInclusive` using [`Self::closed(start, end)`](#method.closed). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:443:5 [INFO] [stdout] | [INFO] [stdout] 443 | / fn from(range: RangeInclusive) -> Self { [INFO] [stdout] 444 | | let (start, end) = range.into_inner(); [INFO] [stdout] 445 | | Self::new_closed(start, end) [INFO] [stdout] 446 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:449:1 [INFO] [stdout] | [INFO] [stdout] 449 | /// Converts the `RangeTo` using [`Self::less_than(range.end)`](#method.less_than). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:452:5 [INFO] [stdout] | [INFO] [stdout] 452 | / fn from(range: RangeTo) -> Self { [INFO] [stdout] 453 | | Self::new_less_than(range.end) [INFO] [stdout] 454 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:457:1 [INFO] [stdout] | [INFO] [stdout] 457 | /// Converts the `RangeToInclusive` using [`Self::at_most(range.end)`](#method.at_most). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:460:5 [INFO] [stdout] | [INFO] [stdout] 460 | / fn from(range: RangeToInclusive) -> Self { [INFO] [stdout] 461 | | Self::new_at_most(range.end) [INFO] [stdout] 462 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:465:1 [INFO] [stdout] | [INFO] [stdout] 465 | /// Converts the tuple using [`Self::with_bounds(tuple.0, tuple.1)`](#method.with_bounds). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:468:5 [INFO] [stdout] | [INFO] [stdout] 468 | / fn from(range: (Bound, Bound)) -> Self { [INFO] [stdout] 469 | | Self::new_with_bounds(range.0, range.1) [INFO] [stdout] 470 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:177:1 [INFO] [stdout] | [INFO] [stdout] 177 | / impl From for Ranges [INFO] [stdout] 178 | | where [INFO] [stdout] 179 | | U: Into>, [INFO] [stdout] 180 | | { [INFO] [stdout] ... | [INFO] [stdout] 189 | | } [INFO] [stdout] 190 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:182:5 [INFO] [stdout] | [INFO] [stdout] 182 | / fn from(r: U) -> Self { [INFO] [stdout] 183 | | let range = r.into(); [INFO] [stdout] 184 | | [INFO] [stdout] 185 | | let mut ranges = Self::new(); [INFO] [stdout] ... | [INFO] [stdout] 188 | | ranges [INFO] [stdout] 189 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:192:1 [INFO] [stdout] | [INFO] [stdout] 192 | / impl From> for Ranges [INFO] [stdout] 193 | | where [INFO] [stdout] 194 | | U: Into>, [INFO] [stdout] 195 | | { [INFO] [stdout] ... | [INFO] [stdout] 205 | | } [INFO] [stdout] 206 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:197:5 [INFO] [stdout] | [INFO] [stdout] 197 | / fn from(v: Vec) -> Self { [INFO] [stdout] 198 | | let mut ranges = Self::with_capacity(v.capacity()); [INFO] [stdout] 199 | | // we can not just transfer the contents, as there might be overlapping entries [INFO] [stdout] 200 | | for range in v { [INFO] [stdout] ... | [INFO] [stdout] 204 | | ranges [INFO] [stdout] 205 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/format.rs:30:17 [INFO] [stdout] | [INFO] [stdout] 30 | / fn fmt(&self, f: &mut Formatter<'_>) -> Result { [INFO] [stdout] 31 | | if self.is_singleton() { [INFO] [stdout] 32 | | f.write_str("{")?; [INFO] [stdout] 33 | | [INFO] [stdout] ... | [INFO] [stdout] 78 | | } [INFO] [stdout] 79 | | } [INFO] [stdout] | |_________________^ [INFO] [stdout] ... [INFO] [stdout] 85 | format_range_with!(Binary, Display, LowerExp, LowerHex, Octal, Pointer, UpperExp, UpperHex); [INFO] [stdout] | -------------------------------------------------------------------------------------------- in this macro invocation [INFO] [stdout] | [INFO] [stdout] = note: this warning originates in a macro (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/format.rs:44:17 [INFO] [stdout] | [INFO] [stdout] 44 | / fn fmt(&self, f: &mut Formatter<'_>) -> Result { [INFO] [stdout] 45 | | let amount = self.ranges.len(); [INFO] [stdout] 46 | | [INFO] [stdout] 47 | | match amount { [INFO] [stdout] ... | [INFO] [stdout] 97 | | } [INFO] [stdout] 98 | | } [INFO] [stdout] | |_________________^ [INFO] [stdout] ... [INFO] [stdout] 104 | format_ranges_with!(Binary, Display, LowerExp, LowerHex, Octal, Pointer, UpperExp, UpperHex); [INFO] [stdout] | --------------------------------------------------------------------------------------------- in this macro invocation [INFO] [stdout] | [INFO] [stdout] = note: this warning originates in a macro (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/difference.rs:75:1 [INFO] [stdout] | [INFO] [stdout] 75 | /// This calls [`self.difference(other)`](#method.difference). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/difference.rs:81:5 [INFO] [stdout] | [INFO] [stdout] 81 | type Output = OperationResult; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/difference.rs:84:5 [INFO] [stdout] | [INFO] [stdout] 84 | / fn sub(self, rhs: I) -> Self::Output { [INFO] [stdout] 85 | | self.difference(rhs.into()) [INFO] [stdout] 86 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/difference.rs:162:1 [INFO] [stdout] | [INFO] [stdout] 162 | /// This calls [`self.difference(other)`](#method.difference). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/difference.rs:165:5 [INFO] [stdout] | [INFO] [stdout] 165 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/difference.rs:168:5 [INFO] [stdout] | [INFO] [stdout] 168 | / fn sub(self, rhs: Self) -> Self::Output { [INFO] [stdout] 169 | | self.difference(rhs) [INFO] [stdout] 170 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/remove.rs:108:1 [INFO] [stdout] | [INFO] [stdout] 108 | /// This calls [`self.remove(other)`](#method.remove). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/remove.rs:114:5 [INFO] [stdout] | [INFO] [stdout] 114 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/remove.rs:117:5 [INFO] [stdout] | [INFO] [stdout] 117 | / fn sub(mut self, rhs: I) -> Self::Output { [INFO] [stdout] 118 | | let _ = self.remove(rhs.into()); [INFO] [stdout] 119 | | [INFO] [stdout] 120 | | self [INFO] [stdout] 121 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:408:1 [INFO] [stdout] | [INFO] [stdout] 408 | / impl PartialEq for GenericRange { [INFO] [stdout] 409 | | fn eq(&self, other: &Self) -> bool { [INFO] [stdout] 410 | | self.is_equal(other) [INFO] [stdout] 411 | | } [INFO] [stdout] 412 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:409:5 [INFO] [stdout] | [INFO] [stdout] 409 | / fn eq(&self, other: &Self) -> bool { [INFO] [stdout] 410 | | self.is_equal(other) [INFO] [stdout] 411 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:414:1 [INFO] [stdout] | [INFO] [stdout] 414 | impl Eq for GenericRange {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/insert.rs:158:1 [INFO] [stdout] | [INFO] [stdout] 158 | /// This calls [`self.insert(other)`](#method.insert). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/insert.rs:164:5 [INFO] [stdout] | [INFO] [stdout] 164 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/insert.rs:167:5 [INFO] [stdout] | [INFO] [stdout] 167 | / fn add(mut self, rhs: I) -> Self::Output { [INFO] [stdout] 168 | | let _ = self.insert(rhs.into()); [INFO] [stdout] 169 | | [INFO] [stdout] 170 | | self [INFO] [stdout] 171 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/insert.rs:174:1 [INFO] [stdout] | [INFO] [stdout] 174 | /// This calls [`self.insert(other)`](#method.insert). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/insert.rs:180:5 [INFO] [stdout] | [INFO] [stdout] 180 | / fn add_assign(&mut self, rhs: I) { [INFO] [stdout] 181 | | let _ = self.insert(rhs.into()); [INFO] [stdout] 182 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/difference.rs:173:1 [INFO] [stdout] | [INFO] [stdout] 173 | /// This calls [`self.difference(other)`](#method.difference) and replaces `self` with the result. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/difference.rs:175:5 [INFO] [stdout] | [INFO] [stdout] 175 | / fn sub_assign(&mut self, rhs: Ranges) { [INFO] [stdout] 176 | | let lhs = core::mem::replace(self, Self::new()); [INFO] [stdout] 177 | | let result = lhs.difference(rhs); [INFO] [stdout] 178 | | *self = result; [INFO] [stdout] 179 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/remove.rs:124:1 [INFO] [stdout] | [INFO] [stdout] 124 | /// This calls [`self.remove(other)`](#method.remove). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/remove.rs:130:5 [INFO] [stdout] | [INFO] [stdout] 130 | / fn sub_assign(&mut self, rhs: I) { [INFO] [stdout] 131 | | let _ = self.remove(rhs.into()); [INFO] [stdout] 132 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/invert.rs:104:1 [INFO] [stdout] | [INFO] [stdout] 104 | /// This calls [`self.invert()`](#method.invert). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/invert.rs:106:5 [INFO] [stdout] | [INFO] [stdout] 106 | type Output = OperationResult; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/invert.rs:109:5 [INFO] [stdout] | [INFO] [stdout] 109 | / fn not(self) -> Self::Output { [INFO] [stdout] 110 | | self.invert() [INFO] [stdout] 111 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/invert.rs:45:1 [INFO] [stdout] | [INFO] [stdout] 45 | /// This calls [`self.invert()`](#method.invert). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/invert.rs:47:5 [INFO] [stdout] | [INFO] [stdout] 47 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/invert.rs:50:5 [INFO] [stdout] | [INFO] [stdout] 50 | / fn not(self) -> Self::Output { [INFO] [stdout] 51 | | self.invert() [INFO] [stdout] 52 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/intersect.rs:56:1 [INFO] [stdout] | [INFO] [stdout] 56 | /// This calls [`self.intersect(other)`](#method.intersect). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/intersect.rs:62:5 [INFO] [stdout] | [INFO] [stdout] 62 | type Output = OperationResult; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/intersect.rs:65:5 [INFO] [stdout] | [INFO] [stdout] 65 | / fn bitand(self, rhs: I) -> Self::Output { [INFO] [stdout] 66 | | self.intersect(rhs.into()) [INFO] [stdout] 67 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/intersect.rs:149:1 [INFO] [stdout] | [INFO] [stdout] 149 | /// This calls [`self.intersect(other)`](#method.intersect). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/intersect.rs:155:5 [INFO] [stdout] | [INFO] [stdout] 155 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/intersect.rs:158:5 [INFO] [stdout] | [INFO] [stdout] 158 | / fn bitand(self, rhs: I) -> Self::Output { [INFO] [stdout] 159 | | self.intersect(rhs.into()) [INFO] [stdout] 160 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/union.rs:65:1 [INFO] [stdout] | [INFO] [stdout] 65 | /// This calls [`self.union(other)`](#method.union). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/union.rs:71:5 [INFO] [stdout] | [INFO] [stdout] 71 | type Output = OperationResult; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/union.rs:74:5 [INFO] [stdout] | [INFO] [stdout] 74 | / fn bitor(self, rhs: I) -> Self::Output { [INFO] [stdout] 75 | | self.union(rhs.into()) [INFO] [stdout] 76 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/union.rs:171:1 [INFO] [stdout] | [INFO] [stdout] 171 | /// This calls [`self.union(other)`](#method.union). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/union.rs:177:5 [INFO] [stdout] | [INFO] [stdout] 177 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/union.rs:180:5 [INFO] [stdout] | [INFO] [stdout] 180 | / fn bitor(self, rhs: I) -> Self::Output { [INFO] [stdout] 181 | | self.union(rhs.into()) [INFO] [stdout] 182 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/symmetric_difference.rs:111:1 [INFO] [stdout] | [INFO] [stdout] 111 | /// This calls [`self.symmetric_difference(other)`](#method.symmetric_difference). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/symmetric_difference.rs:117:5 [INFO] [stdout] | [INFO] [stdout] 117 | type Output = OperationResult; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/symmetric_difference.rs:120:5 [INFO] [stdout] | [INFO] [stdout] 120 | / fn bitxor(self, rhs: I) -> Self::Output { [INFO] [stdout] 121 | | self.symmetric_difference(rhs.into()) [INFO] [stdout] 122 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/symmetric_difference.rs:270:1 [INFO] [stdout] | [INFO] [stdout] 270 | /// This calls [`self.symmetric_difference(other)`](#method.symmetric_difference). [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/symmetric_difference.rs:276:5 [INFO] [stdout] | [INFO] [stdout] 276 | type Output = Self; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/symmetric_difference.rs:279:5 [INFO] [stdout] | [INFO] [stdout] 279 | / fn bitxor(self, rhs: I) -> Self::Output { [INFO] [stdout] 280 | | self.symmetric_difference(rhs.into()) [INFO] [stdout] 281 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/intersect.rs:163:1 [INFO] [stdout] | [INFO] [stdout] 163 | /// This calls [`self.intersect(other)`](#method.intersect) and replaces `self` with the result. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/intersect.rs:165:5 [INFO] [stdout] | [INFO] [stdout] 165 | / fn bitand_assign(&mut self, rhs: Ranges) { [INFO] [stdout] 166 | | let lhs = core::mem::replace(self, Self::new()); [INFO] [stdout] 167 | | let result = lhs.intersect(rhs); [INFO] [stdout] 168 | | *self = result; [INFO] [stdout] 169 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/union.rs:185:1 [INFO] [stdout] | [INFO] [stdout] 185 | /// This calls [`self.union(other)`](#method.union) and replaces `self` with the result. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/union.rs:191:5 [INFO] [stdout] | [INFO] [stdout] 191 | / fn bitor_assign(&mut self, rhs: I) { [INFO] [stdout] 192 | | let lhs = core::mem::replace(self, Self::new()); [INFO] [stdout] 193 | | let result = lhs.union(rhs); [INFO] [stdout] 194 | | *self = result; [INFO] [stdout] 195 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/symmetric_difference.rs:284:1 [INFO] [stdout] | [INFO] [stdout] 284 | /// This calls [`self.symmetric_difference(other)`](#method.symmetric_difference) and replaces `self` with the result. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges/symmetric_difference.rs:290:5 [INFO] [stdout] | [INFO] [stdout] 290 | / fn bitxor_assign(&mut self, rhs: I) { [INFO] [stdout] 291 | | let lhs = core::mem::replace(self, Self::new()); [INFO] [stdout] 292 | | let result = lhs.symmetric_difference(rhs); [INFO] [stdout] 293 | | *self = result; [INFO] [stdout] 294 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:387:1 [INFO] [stdout] | [INFO] [stdout] 387 | / impl RangeBounds for GenericRange { [INFO] [stdout] 388 | | #[must_use] [INFO] [stdout] 389 | | fn start_bound(&self) -> Bound<&T> { [INFO] [stdout] 390 | | bound_owned_to_ref(&self.start) [INFO] [stdout] ... | [INFO] [stdout] 396 | | } [INFO] [stdout] 397 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:389:5 [INFO] [stdout] | [INFO] [stdout] 389 | / fn start_bound(&self) -> Bound<&T> { [INFO] [stdout] 390 | | bound_owned_to_ref(&self.start) [INFO] [stdout] 391 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range.rs:394:5 [INFO] [stdout] | [INFO] [stdout] 394 | / fn end_bound(&self) -> Bound<&T> { [INFO] [stdout] 395 | | bound_owned_to_ref(&self.end) [INFO] [stdout] 396 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/hash.rs:6:1 [INFO] [stdout] | [INFO] [stdout] 6 | / impl Hash for GenericRange { [INFO] [stdout] 7 | | fn hash(&self, state: &mut H) { [INFO] [stdout] 8 | | if ::DISCRETE { [INFO] [stdout] 9 | | // canonicalize start and end [INFO] [stdout] ... | [INFO] [stdout] 29 | | } [INFO] [stdout] 30 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/hash.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | / fn hash(&self, state: &mut H) { [INFO] [stdout] 8 | | if ::DISCRETE { [INFO] [stdout] 9 | | // canonicalize start and end [INFO] [stdout] 10 | | match &self.start { [INFO] [stdout] ... | [INFO] [stdout] 28 | | } [INFO] [stdout] 29 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/into_iter.rs:39:1 [INFO] [stdout] | [INFO] [stdout] 39 | /// A stateful `Iterator` that acts like a state machine, generating the next value in a `GenericRange`. [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/into_iter.rs:44:5 [INFO] [stdout] | [INFO] [stdout] 44 | type Item = T; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/into_iter.rs:46:5 [INFO] [stdout] | [INFO] [stdout] 46 | / fn next(&mut self) -> Option { [INFO] [stdout] 47 | | match self.current.take() { [INFO] [stdout] 48 | | None => None, [INFO] [stdout] 49 | | Some(val) => { [INFO] [stdout] ... | [INFO] [stdout] 71 | | } [INFO] [stdout] 72 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:208:1 [INFO] [stdout] | [INFO] [stdout] 208 | / impl FromIterator> for Ranges { [INFO] [stdout] 209 | | #[allow(clippy::shadow_reuse)] [INFO] [stdout] 210 | | fn from_iter>>(iter: I) -> Self { [INFO] [stdout] 211 | | let iter = iter.into_iter(); [INFO] [stdout] ... | [INFO] [stdout] 224 | | } [INFO] [stdout] 225 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:210:5 [INFO] [stdout] | [INFO] [stdout] 210 | / fn from_iter>>(iter: I) -> Self { [INFO] [stdout] 211 | | let iter = iter.into_iter(); [INFO] [stdout] 212 | | // edge case: n ranges, all being empty, would unnecessarily allocate but is better [INFO] [stdout] 213 | | // than the alternative: n ranges all being separately allocated. [INFO] [stdout] ... | [INFO] [stdout] 223 | | ranges [INFO] [stdout] 224 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/into_iter.rs:15:1 [INFO] [stdout] | [INFO] [stdout] 15 | / impl IntoIterator for GenericRange [INFO] [stdout] 16 | | where [INFO] [stdout] 17 | | T: Iterable, [INFO] [stdout] 18 | | { [INFO] [stdout] ... | [INFO] [stdout] 36 | | } [INFO] [stdout] 37 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/into_iter.rs:19:5 [INFO] [stdout] | [INFO] [stdout] 19 | type Item = T; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/into_iter.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | type IntoIter = GenericIterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/generic_range/into_iter.rs:22:5 [INFO] [stdout] | [INFO] [stdout] 22 | / /// # Panics [INFO] [stdout] 23 | | /// This function panics when trying to convert a range with an unbound start, as there is no [INFO] [stdout] 24 | | /// way to determine where to start iterating at. However, if the domain of `T` has a minimum, [INFO] [stdout] 25 | | /// calling this is safe, as it was set as the start when the range was constructed. [INFO] [stdout] | |________________________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:227:1 [INFO] [stdout] | [INFO] [stdout] 227 | / impl AsRef>> for Ranges { [INFO] [stdout] 228 | | fn as_ref(&self) -> &Vec> { [INFO] [stdout] 229 | | &self.ranges [INFO] [stdout] 230 | | } [INFO] [stdout] 231 | | } [INFO] [stdout] | |_^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/ranges.rs:228:5 [INFO] [stdout] | [INFO] [stdout] 228 | / fn as_ref(&self) -> &Vec> { [INFO] [stdout] 229 | | &self.ranges [INFO] [stdout] 230 | | } [INFO] [stdout] | |_____^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 452 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 1.31s [INFO] running `Command { std: "docker" "inspect" "568f3de4d36d1073a5c1701063e602e2cecbd40c07068fca890750ad72fe8fd2", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "568f3de4d36d1073a5c1701063e602e2cecbd40c07068fca890750ad72fe8fd2", kill_on_drop: false }` [INFO] [stdout] 568f3de4d36d1073a5c1701063e602e2cecbd40c07068fca890750ad72fe8fd2