ruPRIM 0.1.3

Parallel primitives, reductions, scans, and indexing for Ruda.
Documentation 
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

//! Operators shared by device, block and logical-warp collectives.

use ruda_kernel::dsl as kernel_dsl;
use ruda_kernel::dsl::prelude::*;

pub(crate) mod merge;
pub mod radix;
pub mod record;
pub mod decompose;
pub mod tile;

#[ruda]
pub trait RudaUnaryOp<T: RudaType, U: RudaType>: RudaType {
    fn apply(&self, value: T) -> U;
}

/// A binary operator. Scans and reductions require associativity and preserve
/// operand order; adjacent-difference operations do not require associativity.
#[ruda]
pub trait RudaBinaryOp<T: RudaType>: RudaType {
    fn combine(&self, left: T, right: T) -> T;
}

/// A strict weak ordering for comparison-based algorithms.
#[ruda]
pub trait RudaCompare<T: RudaType>: RudaType {
    fn before(&self, left: T, right: T) -> bool;
}

/// An equivalence relation for adjacent-key operations.
#[ruda]
pub trait RudaKeyEqual<T: RudaType>: RudaType {
    fn equal(&self, left: T, right: T) -> bool;
}

#[derive(Clone, Copy, Debug, RudaType, RudaLaunch)]
pub struct RudaSum;

#[ruda]
impl<T: Numeric> RudaBinaryOp<T> for RudaSum {
    fn combine(&self, left: T, right: T) -> T {
        left + right
    }
}

#[derive(Clone, Copy, Debug, RudaType, RudaLaunch)]
pub struct RudaProduct;

#[ruda]
impl<T: Numeric> RudaBinaryOp<T> for RudaProduct {
    fn combine(&self, left: T, right: T) -> T {
        left * right
    }
}

#[derive(Clone, Copy, Debug, RudaType, RudaLaunch)]
pub struct RudaSubtract;

#[ruda]
impl<T: Numeric> RudaBinaryOp<T> for RudaSubtract {
    fn combine(&self, left: T, right: T) -> T { left - right }
}

#[derive(Clone, Copy, Debug, RudaType, RudaLaunch)]
pub struct RudaMinimum;

#[ruda]
impl<T: Numeric> RudaBinaryOp<T> for RudaMinimum {
    fn combine(&self, left: T, right: T) -> T {
        if right < left { right } else { left }
    }
}

#[derive(Clone, Copy, Debug, RudaType, RudaLaunch)]
pub struct RudaMaximum;

#[ruda]
impl<T: Numeric> RudaBinaryOp<T> for RudaMaximum {
    fn combine(&self, left: T, right: T) -> T {
        if left < right { right } else { left }
    }
}

#[derive(Clone, Copy, Debug, RudaType, RudaLaunch)]
pub struct RudaAscending;

#[ruda]
impl<T: Numeric> RudaCompare<T> for RudaAscending {
    fn before(&self, left: T, right: T) -> bool {
        left < right
    }
}

#[derive(Clone, Copy, Debug, RudaType, RudaLaunch)]
pub struct RudaDescending;

#[ruda]
impl<T: Numeric> RudaCompare<T> for RudaDescending {
    fn before(&self, left: T, right: T) -> bool {
        left > right
    }
}

#[derive(Clone, Copy, Debug, RudaType, RudaLaunch)]
pub struct RudaEqual;

macro_rules! clone_operator_launch {
    ($($name:ident),* $(,)?) => {$(
        impl<R: Runtime> Clone for $name<R> {
            fn clone(&self) -> Self { Self::new() }
        }
    )*};
}

clone_operator_launch!(RudaSumLaunch, RudaProductLaunch, RudaSubtractLaunch,
    RudaMinimumLaunch, RudaMaximumLaunch, RudaAscendingLaunch, RudaDescendingLaunch,
    RudaEqualLaunch);

#[ruda]
impl<T: Scalar> RudaKeyEqual<T> for RudaEqual {
    fn equal(&self, left: T, right: T) -> bool {
        left == right
    }
}