Enum ArrayStrategy 

#[non_exhaustive]
pub enum ArrayStrategy {
    Replace,
    Concat,
}

How to combine two arrays found at the same key during a merge.

The strategy is chosen per key by the caller (see merge_with); the merge mechanism itself is policy-free — it does not know what any key “means”.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Replace

The overlay array replaces the base array wholesale (last-wins).

Concat

The overlay array is appended to the base array (concatenation).

Trait Implementations

impl Clone for ArrayStrategy

fn clone(&self) -> ArrayStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for ArrayStrategy

impl Debug for ArrayStrategy

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

Formats the value using the given formatter.

impl Eq for ArrayStrategy

impl PartialEq for ArrayStrategy

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

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for ArrayStrategy