lamellar 0.8.0

Lamellar is an asynchronous tasking runtime for HPC systems developed in RUST.
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

use crate::array::iterator::distributed_iterator::*;

#[derive(Clone, Debug)]
pub struct Zip<A, B> {
    a: A,
    b: B,
}

impl<A: InnerIter, B: InnerIter> InnerIter for Zip<A, B> {
fn lock_if_needed(&self, _s: Sealed) -> Option<IterLockFuture> {
            None
        }
    fn iter_clone(&self, _s: Sealed) -> Self {
        Zip {
            a: self.a.clone(),
            b: self.b.clone(),
        }
    }
}

impl<A, B> Zip<A, B>
where
    A: IndexedDistributedIterator,
    B: IndexedDistributedIterator,
{
    pub(crate) fn new(a: A, b: B) -> Zip<A, B> {
        // println!("new Zip {:?} ",count);
        Zip { a, b }
    }
}

// impl<A, B> Zip<A, B>
// where
//     A: DistributedIterator + 'static,
//     B: DistributedIterator + 'static,
// {
//     pub fn for_each<F>(&self, op: F)
//     where
//         F: Fn(
//                 (
//                     <A as DistributedIterator>::Item,
//                     <B as DistributedIterator>::Item,
//                 ),
//             )

//             + Clone
//             + 'static,
//     {
//         self.a.array().for_each(self, op);
//     }
//     pub fn for_each_async<F, Fut>(&self, op: F)
//     where
//         F: Fn(
//                 (
//                     <A as DistributedIterator>::Item,
//                     <B as DistributedIterator>::Item,
//                 ),
//             ) -> Fut

//             + Clone
//             + 'static,
//         Fut: Future<Output = ()>   + Clone + 'static,
//     {
//         self.a.array().for_each_async(self, op);
//     }
// }

impl<A, B> DistributedIterator for Zip<A, B>
where
    A: IndexedDistributedIterator,
    B: IndexedDistributedIterator,
{
    type Item = (
        <A as DistributedIterator>::Item,
        <B as DistributedIterator>::Item,
    );
    type Array = <A as DistributedIterator>::Array;
    fn init(&self, start_i: usize, cnt: usize, _s: Sealed) -> Zip<A, B> {
        // println!("init zip start_i: {:?} cnt {:?} end_i {:?}",start_i, cnt, start_i+cnt );
        Zip::new(self.a.init(start_i, cnt,_s), self.b.init(start_i, cnt,_s))
    }
    fn array(&self) -> Self::Array {
        self.a.array()
    }
    fn next(&mut self) -> Option<Self::Item> {
        // println!("zip next");
        let a = self.a.next()?;
        let b = self.b.next()?;
        Some((a, b))
    }
    fn elems(&self, in_elems: usize) -> usize {
        let in_elems = std::cmp::min(self.a.elems(in_elems), self.b.elems(in_elems));
        // println!("enumerate elems {:?}",in_elems);
        in_elems
    }
    // fn global_index(&self, index: usize) -> Option<usize> {
    //     let g_index = self.a.global_index(index);
    //                                               // println!("enumerate index: {:?} global_index {:?}", index,g_index);
    //     g_index
    // }
    // fn subarray_index(&self, index: usize) -> Option<usize> {
    //     let g_index = self.a.subarray_index(index);
    //                                                 // println!("enumerate index: {:?} global_index {:?}", index,g_index);
    //     g_index
    // }
    // fn chunk_size(&self) -> usize {
    //     self.iter.chunk_size()
    // }
    fn advance_index(&mut self, count: usize) {
        self.a.advance_index(count);
        self.b.advance_index(count);
    }
}

impl<A, B> IndexedDistributedIterator for Zip<A, B>
where
    A: IndexedDistributedIterator,
    B: IndexedDistributedIterator,
{
}