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

// Copyright 2018-2022 Parity Technologies (UK) Ltd.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

use crate::traits::{
    KeyPtr,
    PackedAllocate,
    PackedLayout,
    SpreadAllocate,
    SpreadLayout,
};
use array_init::array_init;
use ink_primitives::Key;

impl<T, const N: usize> SpreadLayout for [T; N]
where
    T: SpreadLayout,
{
    const FOOTPRINT: u64 = N as u64 * <T as SpreadLayout>::FOOTPRINT;
    const REQUIRES_DEEP_CLEAN_UP: bool = <T as SpreadLayout>::REQUIRES_DEEP_CLEAN_UP;

    fn push_spread(&self, ptr: &mut KeyPtr) {
        for elem in self {
            <T as SpreadLayout>::push_spread(elem, ptr)
        }
    }

    fn clear_spread(&self, ptr: &mut KeyPtr) {
        for elem in self {
            <T as SpreadLayout>::clear_spread(elem, ptr)
        }
    }

    #[inline]
    fn pull_spread(ptr: &mut KeyPtr) -> Self {
        array_init::<_, T, N>(|_| <T as SpreadLayout>::pull_spread(ptr))
    }
}

impl<T, const N: usize> SpreadAllocate for [T; N]
where
    T: SpreadAllocate,
{
    #[inline]
    fn allocate_spread(ptr: &mut KeyPtr) -> Self {
        array_init::<_, T, N>(|_| <T as SpreadAllocate>::allocate_spread(ptr))
    }
}

impl<T, const N: usize> PackedLayout for [T; N]
where
    T: PackedLayout,
{
    #[inline]
    fn push_packed(&self, at: &Key) {
        for elem in self {
            <T as PackedLayout>::push_packed(elem, at)
        }
    }

    #[inline]
    fn clear_packed(&self, at: &Key) {
        for elem in self {
            <T as PackedLayout>::clear_packed(elem, at)
        }
    }

    #[inline]
    fn pull_packed(&mut self, at: &Key) {
        for elem in self {
            <T as PackedLayout>::pull_packed(elem, at)
        }
    }
}

impl<T, const N: usize> PackedAllocate for [T; N]
where
    T: PackedAllocate,
{
    #[inline]
    fn allocate_packed(&mut self, at: &Key) {
        for elem in self {
            <T as PackedAllocate>::allocate_packed(elem, at)
        }
    }
}

#[cfg(test)]
mod tests {
    use crate::push_pull_works_for_primitive;

    type Array = [i32; 4];
    push_pull_works_for_primitive!(
        Array,
        [
            [0, 1, 2, 3],
            [i32::MAX, i32::MIN, i32::MAX, i32::MIN],
            [Default::default(), i32::MAX, Default::default(), i32::MIN]
        ]
    );

    type ArrayTuples = [(i32, i32); 2];
    push_pull_works_for_primitive!(
        ArrayTuples,
        [
            [(0, 1), (2, 3)],
            [(i32::MAX, i32::MIN), (i32::MIN, i32::MAX)],
            [
                (Default::default(), i32::MAX),
                (Default::default(), i32::MIN)
            ]
        ]
    );
}