serde_json_merge 0.0.7

Merge, index, iterate, and sort a serde_json::Value (recursively)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
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

//! Sorting operations for JSON object keys and array values.

pub mod keys;
pub mod sortable_value;
pub mod values;

use super::index::Path as IndexPath;
use super::iter::{Iter, Traverser, dfs::Dfs};
pub use keys::Sort as Keys;
use serde_json::Value;
pub use sortable_value::Ord as ValueOrd;
pub use values::Sort as Values;

/// Compares values while preserving traversal order.
pub trait PartialEqOrdered {
    /// Compares values and their paths in traversal order.
    fn eq(&self, other: &Self) -> bool;
}

impl PartialEqOrdered for Value {
    fn eq(&self, other: &Self) -> bool {
        let entries = self.iter_recursive::<Dfs>();
        let other_entries = other.iter_recursive::<Dfs>();
        entries.into_iter().eq(other_entries)
    }
}

impl PartialEqOrdered for &Value {
    fn eq(&self, other: &Self) -> bool {
        PartialEqOrdered::eq(*self, *other)
    }
}

/// Sorts object keys and array values.
pub trait Sort: Keys + Values {
    /// Sorts keys and values in place.
    #[inline]
    fn sort(&mut self) {
        self.sort_keys();
        self.sort_values();
    }

    /// Recursively sorts keys and values in place.
    #[inline]
    fn sort_recursive<T>(&mut self)
    where
        T: Traverser,
    {
        self.sort_keys_recursive::<T>();
        self.sort_values_recursive::<T>();
    }

    /// Sorts keys and values in place using unstable ordering.
    #[inline]
    fn sort_unstable(&mut self) {
        self.sort_keys_unstable();
        self.sort_values_unstable();
    }

    /// Recursively sorts keys and values in place using unstable ordering.
    #[inline]
    fn sort_unstable_recursive<T>(&mut self)
    where
        T: Traverser,
    {
        self.sort_keys_unstable_recursive::<T>();
        self.sort_values_unstable_recursive::<T>();
    }

    /// Returns the sorted value.
    #[inline]
    #[must_use]
    fn sorted(mut self) -> Self {
        self.sort();
        self
    }

    /// Returns the recursively sorted value.
    #[inline]
    #[must_use]
    fn sorted_recursive<T>(mut self) -> Self
    where
        T: Traverser,
    {
        self.sort_recursive::<T>();
        self
    }

    /// Returns the unstably sorted value.
    #[inline]
    #[must_use]
    fn sorted_unstable(mut self) -> Self {
        self.sort_unstable();
        self
    }

    /// Returns the recursively unstably sorted value.
    #[inline]
    #[must_use]
    fn sorted_unstable_recursive<T>(mut self) -> Self
    where
        T: Traverser,
    {
        self.sort_unstable_recursive::<T>();
        self
    }
}

impl Sort for Value {}

#[cfg(test)]
mod test {

    #[cfg(feature = "preserve_order")]
    #[test]
    fn preserves_order() {
        use crate::test::{assert_eq_ordered, assert_ne_ordered};
        use serde_json::json;

        let value = json!({
            "b": "b",
            "a": "a",
            "d": { "1": "1", "2": "2" },
            "c": "c",
        });
        assert_ne_ordered!(
            &value,
            &json!({
                "a": "a",
                "b": "b",
                "c": "c",
                "d": { "1": "1", "2": "2" },
            })
        );
        assert_ne_ordered!(
            &value,
            &json!({
                "b": "b",
                "a": "a",
                "d": { "2": "2", "1": "1" },
                "c": "c",
            })
        );
        assert_eq_ordered!(&value, &value,);
    }
}