pub struct CharStrategy<'a> { /* private fields */ }
Expand description
Strategy for generating char
s.
Character selection is more sophisticated than integer selection. Naïve
selection (particularly in the larger context of generating strings) would
result in starting inputs like ꂡ螧轎ቶᢹ糦狥芹ᘆ㶏曊ᒀ踔虙ჲ
and “simplified”
inputs consisting mostly of control characters. It also has difficulty
locating edge cases, since the vast majority of code points (such as the
enormous CJK regions) don’t cause problems for anything with even basic
Unicode support.
Instead, character selection is always based on explicit ranges, and is designed to bias to specifically chosen characters and character ranges to produce inputs that are both more useful and easier for humans to understand. There are also hard-wired simplification targets based on ASCII instead of simply simplifying towards NUL to avoid problematic inputs being reduced to a bunch of NUL characters.
Shrinking never crosses ranges. If you have a complex range like [A-Za-z]
and the starting point x
is chosen, it will not shrink to the first A-Z
group, but rather simply to a
.
The usual way to get instances of this class is with the module-level ANY
constant or range
function. Directly constructing a CharStrategy
is
only necessary for complex ranges or to override the default biases.
Implementations§
Source§impl<'a> CharStrategy<'a>
impl<'a> CharStrategy<'a>
Sourcepub fn new(
special: Cow<'a, [char]>,
preferred: Cow<'a, [RangeInclusive<char>]>,
ranges: Cow<'a, [RangeInclusive<char>]>,
) -> Self
pub fn new( special: Cow<'a, [char]>, preferred: Cow<'a, [RangeInclusive<char>]>, ranges: Cow<'a, [RangeInclusive<char>]>, ) -> Self
Construct a new CharStrategy
with the parameters it will pass to the
function underlying select_char()
.
All arguments as per select_char()
.
Sourcepub fn new_borrowed(
special: &'a [char],
preferred: &'a [RangeInclusive<char>],
ranges: &'a [RangeInclusive<char>],
) -> Self
pub fn new_borrowed( special: &'a [char], preferred: &'a [RangeInclusive<char>], ranges: &'a [RangeInclusive<char>], ) -> Self
Same as CharStrategy::new()
but using Cow::Borrowed
for all parts.
Trait Implementations§
Source§impl<'a> Clone for CharStrategy<'a>
impl<'a> Clone for CharStrategy<'a>
Source§fn clone(&self) -> CharStrategy<'a>
fn clone(&self) -> CharStrategy<'a>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl<'a> Debug for CharStrategy<'a>
impl<'a> Debug for CharStrategy<'a>
Source§impl<'a> Strategy for CharStrategy<'a>
impl<'a> Strategy for CharStrategy<'a>
Source§type Tree = CharValueTree
type Tree = CharValueTree
Strategy
.Source§type Value = char
type Value = char
Source§fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self>
fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self>
Source§fn prop_map<O: Debug, F: Fn(Self::Value) -> O>(self, fun: F) -> Map<Self, F>where
Self: Sized,
fn prop_map<O: Debug, F: Fn(Self::Value) -> O>(self, fun: F) -> Map<Self, F>where
Self: Sized,
fun
. Read moreSource§fn prop_map_into<O: Debug>(self) -> MapInto<Self, O>
fn prop_map_into<O: Debug>(self) -> MapInto<Self, O>
Source§fn prop_perturb<O: Debug, F: Fn(Self::Value, TestRng) -> O>(
self,
fun: F,
) -> Perturb<Self, F>where
Self: Sized,
fn prop_perturb<O: Debug, F: Fn(Self::Value, TestRng) -> O>(
self,
fun: F,
) -> Perturb<Self, F>where
Self: Sized,
fun
, which is additionally given a random number generator. Read moreSource§fn prop_flat_map<S: Strategy, F: Fn(Self::Value) -> S>(
self,
fun: F,
) -> Flatten<Map<Self, F>>where
Self: Sized,
fn prop_flat_map<S: Strategy, F: Fn(Self::Value) -> S>(
self,
fun: F,
) -> Flatten<Map<Self, F>>where
Self: Sized,
Source§fn prop_ind_flat_map<S: Strategy, F: Fn(Self::Value) -> S>(
self,
fun: F,
) -> IndFlatten<Map<Self, F>>where
Self: Sized,
fn prop_ind_flat_map<S: Strategy, F: Fn(Self::Value) -> S>(
self,
fun: F,
) -> IndFlatten<Map<Self, F>>where
Self: Sized,
Source§fn prop_ind_flat_map2<S: Strategy, F: Fn(Self::Value) -> S>(
self,
fun: F,
) -> IndFlattenMap<Self, F>where
Self: Sized,
fn prop_ind_flat_map2<S: Strategy, F: Fn(Self::Value) -> S>(
self,
fun: F,
) -> IndFlattenMap<Self, F>where
Self: Sized,
prop_ind_flat_map()
, but produces 2-tuples with the input
generated from self
in slot 0 and the derived strategy in slot 1. Read moreSource§fn prop_filter<R: Into<Reason>, F: Fn(&Self::Value) -> bool>(
self,
whence: R,
fun: F,
) -> Filter<Self, F>where
Self: Sized,
fn prop_filter<R: Into<Reason>, F: Fn(&Self::Value) -> bool>(
self,
whence: R,
fun: F,
) -> Filter<Self, F>where
Self: Sized,
fun
. Read moreSource§fn prop_filter_map<F: Fn(Self::Value) -> Option<O>, O: Debug>(
self,
whence: impl Into<Reason>,
fun: F,
) -> FilterMap<Self, F>where
Self: Sized,
fn prop_filter_map<F: Fn(Self::Value) -> Option<O>, O: Debug>(
self,
whence: impl Into<Reason>,
fun: F,
) -> FilterMap<Self, F>where
Self: Sized,
fun
returns Some(value)
and rejects those where fun
returns None
. Read moreSource§fn prop_union(self, other: Self) -> Union<Self>where
Self: Sized,
fn prop_union(self, other: Self) -> Union<Self>where
Self: Sized,
Source§fn prop_recursive<R: Strategy<Value = Self::Value> + 'static, F: Fn(BoxedStrategy<Self::Value>) -> R>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F,
) -> Recursive<Self::Value, F>where
Self: Sized + 'static,
fn prop_recursive<R: Strategy<Value = Self::Value> + 'static, F: Fn(BoxedStrategy<Self::Value>) -> R>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F,
) -> Recursive<Self::Value, F>where
Self: Sized + 'static,
self
items as leaves. Read moreSource§fn boxed(self) -> BoxedStrategy<Self::Value>where
Self: Sized + 'static,
fn boxed(self) -> BoxedStrategy<Self::Value>where
Self: Sized + 'static,
Strategy
so it can be passed around as a
simple trait object. Read more