Function malachite_base::chars::exhaustive::exhaustive_chars
source · pub const fn exhaustive_chars() -> ExhaustiveChars ⓘ
Expand description
Generates all char
s, in a friendly order, so that more familiar char
s come first.
The order is
- Lowercase ASCII letters,
- Uppercase ASCII letters,
- ASCII digits,
- Graphic ASCII
char
(not alphanumeric and not control), including' '
but no other whitespace, - Graphic Non-ASCII
char
s; all non-ASCIIchar
s whoseDebug
representations don’t start with'\'
, - All remaining
char
s.
Within each group, the char
s are ordered according to their usual order.
If you want to generate char
s in their usual order, try chars_increasing
.
The output length is 1,112,064.
Complexity per iteration
Constant time and additional memory.
Examples
use malachite_base::chars::exhaustive::exhaustive_chars;
assert_eq!(
exhaustive_chars().take(200).collect::<String>(),
"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789 !\"#$%&\'()*+,-./:;<=>?@[\\\
]^_`{|}~¡¢£¤¥¦§¨©ª«¬®¯°±²³´µ¶·¸¹º»¼½¾¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâãäåæçèéêëìíîïðñòóô\
õö÷øùúûüýþÿĀāĂ㥹ĆćĈĉĊ"
);
Examples found in repository?
src/strings/exhaustive.rs (line 79)
76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285
pub fn lex_fixed_length_strings(
len: u64,
) -> StringsFromCharVecs<LexFixedLengthVecsFromSingle<ExhaustiveChars>> {
lex_fixed_length_strings_using_chars(len, exhaustive_chars())
}
/// Generates all `String`s of a given length with [`char`]s from a single iterator.
///
/// If `cs` is finite, the output length is $\ell^n$, where $\ell$ is `cs.count()` and $n$ is `len`.
/// If `cs` is infinite, the output is also infinite.
///
/// If `len` is 0, the output consists of one empty [`String`].
///
/// If `cs` is empty, the output is also empty, unless `len` is 0.
///
/// # Examples
/// ```
/// use itertools::Itertools;
/// use malachite_base::strings::exhaustive::exhaustive_fixed_length_strings_using_chars;
///
/// let ss = exhaustive_fixed_length_strings_using_chars(2, ['c', 'a', 't'].iter().cloned())
/// .collect_vec();
/// assert_eq!(
/// ss.iter().map(|cs| cs.as_str()).collect_vec().as_slice(),
/// &["cc", "ca", "ac", "aa", "ct", "at", "tc", "ta", "tt"]
/// );
/// ```
#[inline]
pub fn exhaustive_fixed_length_strings_using_chars<I: Iterator<Item = char>>(
len: u64,
cs: I,
) -> StringsFromCharVecs<ExhaustiveFixedLengthVecs1Input<I>> {
strings_from_char_vecs(exhaustive_vecs_fixed_length_from_single(len, cs))
}
/// Generates all [`String`]s of a given length.
///
/// The output length is $1112064^n$, where $n$ is `len`.
///
/// If `len` is 0, the output consists of one empty [`String`].
///
/// # Examples
/// ```
/// use itertools::Itertools;
/// use malachite_base::strings::exhaustive::exhaustive_fixed_length_strings;
///
/// let ss = exhaustive_fixed_length_strings(2).take(20).collect_vec();
/// assert_eq!(
/// ss.iter().map(|cs| cs.as_str()).collect_vec().as_slice(),
/// &[
/// "aa", "ab", "ba", "bb", "ac", "ad", "bc", "bd", "ca", "cb", "da", "db", "cc", "cd",
/// "dc", "dd", "ae", "af", "be", "bf"
/// ]
/// );
/// ```
#[inline]
pub fn exhaustive_fixed_length_strings(
len: u64,
) -> StringsFromCharVecs<ExhaustiveFixedLengthVecs1Input<ExhaustiveChars>> {
exhaustive_fixed_length_strings_using_chars(len, exhaustive_chars())
}
/// Generates [`String`]s with [`char`]s from a specified iterator, in shortlex order.
///
/// Shortlex order means that the [`String`]s are output from shortest to longest, and [`String`]s
/// of the same length are output in lexicographic order with respect to the ordering of the
/// [`char`]s specified by the input iterator.
///
/// `cs` must be finite; if it's infinite, only [`String`]s of length 0 and 1 are ever produced.
///
/// If `cs` is empty, the output length is 1; otherwise, the output is infinite.
///
/// The lengths of the output [`String`]s grow logarithmically.
///
/// # Complexity per iteration
/// $T(i) = O(\log i)$
///
/// $M(i) = O(\log i)$
///
/// where $T$ is time and $M$ is additional memory.
///
/// # Examples
/// ```
/// use itertools::Itertools;
/// use malachite_base::strings::exhaustive::shortlex_strings_using_chars;
///
/// let ss = shortlex_strings_using_chars('x'..='z')
/// .take(20)
/// .collect_vec();
/// assert_eq!(
/// ss.iter().map(String::as_str).collect_vec().as_slice(),
/// &[
/// "", "x", "y", "z", "xx", "xy", "xz", "yx", "yy", "yz", "zx", "zy", "zz", "xxx", "xxy",
/// "xxz", "xyx", "xyy", "xyz", "xzx"
/// ]
/// );
/// ```
#[inline]
pub fn shortlex_strings_using_chars<I: Clone + Iterator<Item = char>>(
cs: I,
) -> StringsFromCharVecs<ShortlexVecs<char, PrimitiveIntIncreasingRange<u64>, I>> {
strings_from_char_vecs(shortlex_vecs(cs))
}
/// Generates [`String`]s in shortlex order.
///
/// Shortlex order means that the [`String`]s are output from shortest to longest, and [`String`]s
/// of the same length are output in lexicographic order with respect to the order of
/// [`exhaustive_chars`](crate::chars::exhaustive::exhaustive_chars), which is not the default
/// lexicographic order for [`char`]s. (For example, the first characters are not control
/// characters, but lowercase Latin letters.) If you want the default [`char`] order, use
/// `shortlex_strings_using_chars(chars_increasing())`.
///
/// The output is infinite.
///
/// The lengths of the output [`String`]s grow logarithmically.
///
/// # Complexity per iteration
/// $T(i) = O(\log i)$
///
/// $M(i) = O(\log i)$
///
/// where $T$ is time and $M$ is additional memory.
///
/// # Examples
/// ```
/// use itertools::Itertools;
/// use malachite_base::strings::exhaustive::shortlex_strings;
///
/// let ss = shortlex_strings().take(20).collect_vec();
/// assert_eq!(
/// ss.iter().map(String::as_str).collect_vec().as_slice(),
/// &[
/// "", "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p",
/// "q", "r", "s"
/// ]
/// );
/// ```
#[inline]
pub fn shortlex_strings(
) -> StringsFromCharVecs<ShortlexVecs<char, PrimitiveIntIncreasingRange<u64>, ExhaustiveChars>> {
shortlex_strings_using_chars(exhaustive_chars())
}
/// Generates all [`String`]s with [`char`]s from a specified iterator.
///
/// If `cs` is empty, the output length is 1; otherwise, the output is infinite.
///
/// The lengths of the output [`String`]s grow logarithmically.
///
/// # Complexity per iteration
/// $T(i) = O(\log i)$
///
/// $M(i) = O(\log i)$
///
/// where $T$ is time and $M$ is additional memory.
///
/// # Examples
/// ```
/// use itertools::Itertools;
/// use malachite_base::strings::exhaustive::exhaustive_strings_using_chars;
///
/// let ss = exhaustive_strings_using_chars('x'..='z')
/// .take(20)
/// .collect_vec();
/// assert_eq!(
/// ss.iter().map(String::as_str).collect_vec().as_slice(),
/// &[
/// "", "x", "y", "xxx", "z", "xx", "xy", "xxxxx", "yx", "xxy", "yy", "xxxx", "xz", "xyx",
/// "yz", "xxxxxx", "zx", "xyy", "zy", "xxxy"
/// ]
/// );
/// ```
#[inline]
pub fn exhaustive_strings_using_chars<I: Clone + Iterator<Item = char>>(
cs: I,
) -> StringsFromCharVecs<ExhaustiveVecs<char, PrimitiveIntIncreasingRange<u64>, I>> {
strings_from_char_vecs(exhaustive_vecs(cs))
}
/// Generates all [`String`]s.
///
/// The lengths of the output [`String`]s grow logarithmically.
///
/// # Complexity per iteration
/// $T(i) = O(\log i)$
///
/// $M(i) = O(\log i)$
///
/// where $T$ is time and $M$ is additional memory.
///
/// # Examples
/// ```
/// use itertools::Itertools;
/// use malachite_base::strings::exhaustive::exhaustive_strings;
///
/// let ss = exhaustive_strings().take(20).collect_vec();
/// assert_eq!(
/// ss.iter().map(String::as_str).collect_vec().as_slice(),
/// &[
/// "", "a", "b", "aaa", "c", "aa", "d", "aaaa", "e", "ab", "f", "aab", "g", "ba", "h",
/// "aaaaa", "i", "bb", "j", "aba"
/// ]
/// );
/// ```
#[inline]
pub fn exhaustive_strings(
) -> StringsFromCharVecs<ExhaustiveVecs<char, PrimitiveIntIncreasingRange<u64>, ExhaustiveChars>> {
exhaustive_strings_using_chars(exhaustive_chars())
}