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
//use crate::common::validate_inputs;
use crate::common_simd::assets::validate_inputs;
use crate::indicators::pvi::{
min_data, output_length, IndicatorState as State, INPUTS_WIDTH, OPTIONS_WIDTH,
};
use crate::indicators::simd_indicators::road_train::{Asset, Driver, PrimeMover};
use crate::types::IndicatorError;
use std::simd::Simd;
//use crate::indicators::ad::output_length;
use crate::indicators::simd_indicators::pvi_simd::SimdState;
/// SIMD driver that advances the Positive Volume Index (PVI) across `N` asset lanes per scheduling epoch.
struct PviDriver;
impl Driver<State> for PviDriver {
/// Processes one epoch of bars for `N` assets simultaneously using SIMD.
fn next_run<const N: usize>(
&mut self,
inputs: Vec<Vec<&[f64]>>,
mut outputs: Vec<Vec<&mut [f64]>>,
mut states: Vec<&mut State>,
_options: Vec<Option<&()>>,
) {
let len = inputs[0][0].len();
// Optimization 1: Direct array construction instead of collect+try_into
let mut state = SimdState::new(&states);
// Optimization 2: Pre-compute all input and output pointers
let (close_ptrs, volume_ptrs) =
crate::extract_input_ptrs!(inputs, N, close_ptrs, volume_ptrs);
let output_ptrs = crate::extract_output_ptrs!(outputs, N, output_ptr);
// Optimization 3: Simplified main loop with pre-computed offsets
for i in 0..len {
let (close, volume) = crate::extract_simd_inputs_at_index!(i, N,
close @ close_ptrs,
volume @ volume_ptrs
);
let pvi = state.calc_simd(close, volume);
// Store results using pre-computed pointers
crate::write_simd_at_indices!(N, i,
output_ptrs => pvi
);
}
// Update states efficiently
state.write_states(&mut states);
}
}
/// Calculates the Positive Volume Index (PVI) for `N` assets simultaneously using SIMD
/// parallelism.
///
/// PVI accumulates price-change contributions only on bars where volume rises.
/// It requires no configurable options. Uses the [`PrimeMover`] scheduler to batch
/// assets into SIMD-width groups.
///
/// # Arguments
/// * `inputs` - An array of `N` asset input sets; `inputs[i]` is `[&[f64]; INPUTS_WIDTH]`
/// containing `[close, volume]` for asset `i`.
/// * `_options` - Unused; PVI has no configurable options.
/// * `_optional_outputs` - Unused; PVI produces only the single PVI line output.
///
/// # Returns
/// `Ok((outputs, states))` where `outputs[i][0]` is the PVI line for asset `i`
/// and `states[i]` is the final [`State`] for asset `i`.
/// Returns `Err(IndicatorError)` if any input slice is too short.
pub fn indicator_by_assets<const N: usize>(
inputs: &[&[&[f64]; INPUTS_WIDTH]; N], //stock[ fields [ field [f64] ] ]
_options: &[f64; OPTIONS_WIDTH],
_optional_outputs: Option<&[bool]>,
) -> Result<(Vec<Vec<Vec<f64>>>, Vec<State>), IndicatorError> {
validate_inputs::<INPUTS_WIDTH>(inputs, min_data(_options))?;
let mut road_train = PrimeMover::<N, State>::new();
let mut output_buffers: Vec<Vec<Vec<f64>>> = (0..N)
.map(|i| {
vec![{
let capacity = output_length(inputs[i][0].len(), &[]);
crate::uninit_vec!(f64, capacity)
}]
})
.collect();
for i in 0..N {
let state = State::new(1000.0, inputs[i][0][0], inputs[i][1][0]);
let asset_inputs = vec![&inputs[i][0][1..], &inputs[i][1][1..]];
unsafe {
// Get a mutable reference to the output buffer for this asset
let output_buffer = &mut output_buffers[i][0];
let asset_outputs = vec![std::slice::from_raw_parts_mut(
output_buffer.as_mut_ptr(),
output_buffer.len(),
)];
road_train.add_asset(Asset::new(
asset_inputs,
asset_outputs,
i,
0,
0,
state,
None,
));
}
}
let mut driver = PviDriver;
let states = road_train.drive(&mut driver);
Ok((output_buffers, states))
}