修复 异常BUG

This commit is contained in:
YuWuKunCheng
2026-06-08 23:29:00 +08:00
parent 8a2afb9ed0
commit 34c42ecd68
14 changed files with 1113 additions and 307 deletions
+13 -11
View File
@@ -800,7 +800,12 @@ impl 线段 {
seg.
.store(线..load(Ordering::Relaxed) + 1, Ordering::Relaxed);
*seg..write().unwrap() = Self::(线);
*seg..write().unwrap() = if 线..load(Ordering::Relaxed)
{
None
} else {
Self::(线)
};
*seg..write().unwrap() = Some(Arc::clone(
线..read().unwrap().last().unwrap(),
));
@@ -970,6 +975,7 @@ impl 线段 {
}
let = Arc::clone(&[.len() - 3]);
let = Arc::clone(&[.len() - 2]);
let = Arc::clone(&[.len() - 1]);
// 方向条件
@@ -987,7 +993,8 @@ impl 线段 {
);
let = 线..read().unwrap().clone();
// Reassign to full copy (matching Python pattern)
let = 线..read().unwrap().clone();
Self::_弹出线段(
线,
&Arc::clone(线.last().unwrap()),
@@ -1021,13 +1028,13 @@ impl 线段 {
cur..write().unwrap()[2] = None;
let = Arc::clone(cur..read().unwrap().last().unwrap());
let =
let =
.iter()
.position(|x| Arc::as_ptr(x) == Arc::as_ptr(&));
_opt = ;
if let Some() = {
= [ + 1..].to_vec();
= [ + 1..].to_vec();
} else {
= Vec::new();
}
@@ -1047,19 +1054,14 @@ impl 线段 {
let 线 = Arc::clone(&线[idx]);
线..store(true, Ordering::Relaxed);
if 线..read().unwrap()[2].is_some() {
let = 线::线(&[
Arc::clone(&[.len() - 3]),
Arc::clone(&[.len() - 2]),
Arc::clone(&[.len() - 1]),
]);
let = 线::线(&[Arc::clone(&), Arc::clone(&), Arc::clone(&)]);
let _rc = Arc::new();
Self::_添加线段(线, _rc, , format!("{}, {}", line!(), ));
// Set feature sequence [0]
let = Self::(线.last_mut().unwrap());
let = Arc::clone(&[.len() - 2]);
..write().unwrap()[0] =
Some(Arc::new(线::(vec![], .())));
Some(Arc::new(线::(vec![], .())));
}
true
+66 -27
View File
@@ -32,18 +32,15 @@ use std::sync::RwLock;
use tracing::{error, info};
/// 立体分析器 — 多周期协调器
///
/// 包含一个K线合成器和每周期一个观察者。
/// 输入最小周期K线,合成大周期后分发到对应观察者。
pub struct {
pub : Vec<i64>,
: i64,
K线合成器: K线合成器,
: HashMap<i64, Arc<RwLock<>>>,
pub K线合成器: K线合成器,
pub : HashMap<i64, Arc<RwLock<>>>,
}
impl {
/// 创建立体分析器,自动创建K线合成器 + 每周期一个观察者
/// 创建立体分析器 — 对应 Python 立体分析器.__init__
pub fn new(
: String,
: Vec<i64>,
@@ -58,9 +55,7 @@ impl 立体分析器 {
let = .unwrap_or_default();
let = .unwrap_or_default();
let K线合成器 = K线合成器::new(.clone(), .clone());
let mut = HashMap::new();
let mut : HashMap<i64, Arc<RwLock<>>> = HashMap::new();
for & in & {
let mut =
.get(&)
@@ -101,6 +96,18 @@ impl 立体分析器 {
}
}
// 对应 Python: K线合成器(符号, 周期组, self.__K线回调)
let _回调 = .clone();
let K线合成器 = K线合成器::new(
.clone(),
.clone(),
Some(Box::new(
move |_信号类型: String, _标识: String, : i64, K线: K线| {
::__K线回调_调度(&_回调, , K线);
},
)),
);
Self {
,
,
@@ -109,8 +116,28 @@ impl 立体分析器 {
}
}
/// 投喂K线 — 统一入口,接收最小周期K线
/// 匹配 Python __K线回调:合成器完成K线时喂给观察者
/// __K线回调 — 对应 Python 立体分析器.__K线回调
fn __K线回调(&self, _信号类型: String, _标识: String, : i64, K线: K线) {
if let Some() = self..get(&) {
let mut obs = .write().unwrap();
obs.K线(K线);
// 对应 Python: if 当前K线 := self._K线合成器.获取当前K线(周期)
// _完成K线刚清空当前K线,获取当前K线返回 None,所以这里不添加
}
}
/// 静态调度版本 — 用于回调闭包
fn __K线回调_调度(
: &HashMap<i64, Arc<RwLock<>>>,
: i64,
K线: K线,
) {
if let Some() = .get(&) {
.write().unwrap().K线(K线);
}
}
/// 投喂K线 — 对应 Python 立体分析器.投喂K线
pub fn K线(&mut self, K: K线) {
if K. != self. {
panic!(
@@ -118,19 +145,7 @@ impl 立体分析器 {
K., self.
);
}
// Feed to synthesizer, get completion events
let = self.K线合成器.K线(K);
// Dispatch on completion events (matching Python's __K线回调)
for (, K线) in {
if let Some() = self..get(&) {
.write().unwrap().K线(K线);
if let Some(K线) = self.K线合成器.K线() {
.write().unwrap().K线(K线.clone());
}
}
}
self.K线合成器.K线(K);
}
/// 获取指定周期的观察者
@@ -138,8 +153,7 @@ impl 立体分析器 {
self..get(&).cloned()
}
/// 测试_保存数据 — 多级别数据拆分保存
/// 创建父目录 PyM_{标识}_{起始时间}_{结束时间},各周期观察者保存到子目录
/// 测试_保存数据 — 对应 Python 立体分析器.测试_保存数据
pub fn _保存数据(&self, root: Option<&str>) {
let = match root {
Some(r) => std::path::PathBuf::from(r),
@@ -163,7 +177,6 @@ impl 立体分析器 {
.get(&self.)
.map(|o| o.read().unwrap()..clone())
.unwrap_or_default();
let = self
.
.get(&self.)
@@ -189,4 +202,30 @@ impl 立体分析器 {
info!("多级别数据拆分保存完成,目录:{}", .display());
}
/// 相等 — 各周期观察者全量比对,对应 Python `立体分析器相等`
pub fn (&self, other: &Self, : f64) -> (bool, String) {
let = format!("立体分析器校验[A={:?},B={:?}]", self., other.);
if self. != other. {
return (false, format!("{标签}: 周期组不一致"));
}
for in &self. {
let a_obs = match self..get() {
Some(o) => o.read().unwrap(),
None => return (false, format!("{标签}: 周期{周期} 观察者不存在 (A)")),
};
let b_obs = match other..get() {
Some(o) => o.read().unwrap(),
None => return (false, format!("{标签}: 周期{周期} 观察者不存在 (B)")),
};
let (eq, msg) = a_obs.(&b_obs, );
if !eq {
return (false, format!("{标签}: 周期{周期} >> {msg}"));
}
}
(true, format!("{标签}:所有周期观察者全量校验全部一致"))
}
}
+260 -114
View File
@@ -261,78 +261,103 @@ impl 观察者 {
None => return,
};
// Step 2: 笔分析(无条件)
::(
,
&mut self.,
&mut self.,
&self.K线序列,
&self.K线序列,
0,
&self.,
);
// Step 2: 笔分析
if self.. {
::(
,
&mut self.,
&mut self.,
&self.K线序列,
&self.K线序列,
0,
&self.,
);
}
if self..is_empty() {
return;
}
// Step 3: 笔中枢分析(无条件)
::(&self., &mut self._中枢序列, true, "", 0);
// Step 3: 笔中枢分析
if self.. {
::(&self., &mut self._中枢序列, true, "", 0);
}
if self..is_empty() {
return;
}
// Step 4: 线段分析 — 3 级递归
for i in 0..self.线 {
if i == 0 {
线::(
&self.,
&mut self.线[i],
&self.,
0,
&[::, ::],
);
} else {
let = self.线[i - 1].clone();
线::(
&,
&mut self.线[i],
&self.,
0,
&[::, ::],
);
if self..线 || self..线 {
for i in 0..self.线 {
if i == 0 {
if self..线 {
线::(
&self.,
&mut self.线[i],
&self.,
0,
&[::, ::],
);
}
} else {
if self..线 {
let = self.线[i - 1].clone();
线::(
&,
&mut self.线[i],
&self.,
0,
&[::, ::],
);
}
}
if self..线 {
::(&self.线[i], &mut self.[i], true, "", 0);
}
}
::(&self.线[i], &mut self.[i], true, "", 0);
}
// Step 5: 扩展线段分析 — 3 级递归
for i in 0..self.线 {
if i == 0 {
线::(&self., &mut self.线[i], &self.);
} else {
let = self.线[i - 1].clone();
线::(&, &mut self.线[i], &self.);
if self..线 || self..线 {
for i in 0..self.线 {
if i == 0 {
if self..线 {
线::(&self., &mut self.线[i], &self.);
}
} else {
if self..线 {
let = self.线[i - 1].clone();
线::(&, &mut self.线[i], &self.);
}
}
if self..线 {
::(
&self.线[i],
&mut self.[i],
true,
"",
0,
);
}
}
::(
&self.线[i],
&mut self.[i],
true,
"",
0,
);
}
// Step 6: 混合扩展线段分析 — 3 级递归 (源 = 线段序列组[i])
// NOTE: 当 线段分析层次=0 时 线段序列组 为空,用 min 避免越界
for i in 0..self.线.min(self.线.len()) {
let = self.线[i].clone();
线::(&, &mut self.线[i], &self.);
::(
&self.线[i],
&mut self.[i],
true,
"",
0,
);
// Step 6: 混合扩展线段分析 — 3 级递归
if self..线 || self..线 {
for i in 0..self.线.min(self.线.len()) {
if self..线 {
let = self.线[i].clone();
线::(&, &mut self.线[i], &self.);
}
if self..线 {
::(
&self.线[i],
&mut self.[i],
true,
"",
0,
);
}
}
}
}
@@ -366,73 +391,103 @@ impl 观察者 {
self..push(Vec::new());
}
for i in 1..self.K线序列.len() - 1 {
let = ::new(
Some(Arc::clone(&self.K线序列[i - 1])),
Arc::clone(&self.K线序列[i]),
Some(Arc::clone(&self.K线序列[i + 1])),
);
::(
Arc::new(),
&mut self.,
&mut self.,
&self.K线序列,
&self.K线序列,
0,
&self.,
);
}
::(&self., &mut self._中枢序列, true, "", 0);
for i in 0..self.线 {
if i == 0 {
线::(
&self.,
&mut self.线[i],
&self.,
0,
&[::, ::],
if self.. {
for i in 1..self.K线序列.len() - 1 {
let = ::new(
Some(Arc::clone(&self.K线序列[i - 1])),
Arc::clone(&self.K线序列[i]),
Some(Arc::clone(&self.K线序列[i + 1])),
);
} else {
let = self.线[i - 1].clone();
线::(
&,
&mut self.线[i],
&self.,
::(
Arc::new(),
&mut self.,
&mut self.,
&self.K线序列,
&self.K线序列,
0,
&[::, ::],
&self.,
);
}
::(&self.线[i], &mut self.[i], true, "", 0);
}
for i in 0..self.线 {
if i == 0 {
线::(&self., &mut self.线[i], &self.);
} else {
let = self.线[i - 1].clone();
线::(&, &mut self.线[i], &self.);
if self..is_empty() {
return;
}
if self.. {
::(&self., &mut self._中枢序列, true, "", 0);
}
if self..线 || self..线 {
for i in 0..self.线 {
if i == 0 {
if self..线 {
线::(
&self.,
&mut self.线[i],
&self.,
0,
&[::, ::],
);
}
} else {
if self..线 {
let = self.线[i - 1].clone();
线::(
&,
&mut self.线[i],
&self.,
0,
&[::, ::],
);
}
}
if self..线 {
::(&self.线[i], &mut self.[i], true, "", 0);
}
}
::(
&self.线[i],
&mut self.[i],
true,
"",
0,
);
}
for i in 0..self.线.min(self.线.len()) {
let = self.线[i].clone();
线::(&, &mut self.线[i], &self.);
::(
&self.线[i],
&mut self.[i],
true,
"",
0,
);
if self..线 || self..线 {
for i in 0..self.线 {
if i == 0 {
if self..线 {
线::(&self., &mut self.线[i], &self.);
}
} else {
if self..线 {
let = self.线[i - 1].clone();
线::(&, &mut self.线[i], &self.);
}
}
if self..线 {
::(
&self.线[i],
&mut self.[i],
true,
"",
0,
);
}
}
}
if self..线 || self..线 {
for i in 0..self.线.min(self.线.len()) {
if self..线 {
let = self.线[i].clone();
线::(&, &mut self.线[i], &self.);
}
if self..线 {
::(
&self.线[i],
&mut self.[i],
true,
"",
0,
);
}
}
}
}
@@ -582,6 +637,97 @@ impl 观察者 {
self. = ;
self.()
}
/// 相等 — 全量序列逐项比对,双端一致性验证,对应 Python `观察者相等`
pub fn (&self, other: &Self, : f64) -> (bool, String) {
let = format!("观察者校验[A={},B={}]", self.(), other.());
if self.K线序列.len() != other.K线序列.len() {
return (
false,
format!(
"{标签}: 缠K序列长度不一致 A={},B={}",
self.K线序列.len(),
other.K线序列.len()
),
);
}
if self..len() != other..len() {
return (
false,
format!(
"{标签}: 分型序列长度不一致 A={},B={}",
self..len(),
other..len()
),
);
}
if self..len() != other..len() {
return (
false,
format!(
"{标签}: 笔序列长度不一致 A={},B={}",
self..len(),
other..len()
),
);
}
for (i, (a, b)) in self..iter().zip(other..iter()).enumerate() {
let (eq, msg) = a.(b, );
if !eq {
return (false, format!("{标签}: 笔#{i}不一致 >> {msg}"));
}
}
if self._中枢序列.len() != other._中枢序列.len() {
return (false, format!("{标签}: 笔中枢序列长度不一致"));
}
for (i, (a, b)) in self
._中枢序列
.iter()
.zip(other._中枢序列.iter())
.enumerate()
{
let (eq, msg) = a.(b, );
if !eq {
return (false, format!("{标签}: 笔中枢#{i}不一致 >> {msg}"));
}
}
for level in 0..self.线.min(other.线) {
let a_segs = &self.线[level];
let b_segs = &other.线[level];
if a_segs.len() != b_segs.len() {
return (false, format!("{标签}: 线段序列组[{level}]长度不一致"));
}
for (i, (a, b)) in a_segs.iter().zip(b_segs.iter()).enumerate() {
let (eq, msg) = a.(b, );
if !eq {
return (
false,
format!("{标签}: 线段序列组[{level}]#{i}不一致 >> {msg}"),
);
}
}
let a_hubs = &self.[level];
let b_hubs = &other.[level];
if a_hubs.len() != b_hubs.len() {
return (false, format!("{标签}: 中枢序列组[{level}]长度不一致"));
}
for (i, (a, b)) in a_hubs.iter().zip(b_hubs.iter()).enumerate() {
let (eq, msg) = a.(b, );
if !eq {
return (
false,
format!("{标签}: 中枢序列组[{level}]#{i}不一致 >> {msg}"),
);
}
}
}
(true, format!("{标签}:全量序列校验全部一致"))
}
}
#[cfg(test)]
+156 -28
View File
@@ -31,11 +31,19 @@ pub struct K线合成器 {
pub : Vec<i64>,
pub K线: HashMap<i64, Option<K线>>,
pub K线列表: HashMap<i64, Vec<K线>>,
/// 事件回调 — K线完成时触发,对应 Python K线合成器.事件回调
/// 签名: fn(信号类型: str, 标识: str, 周期: i64, 完成K线: K线)
/// 在 _完成K线 清空当前K线后、新K线创建前触发
: Option<Box<dyn Fn(String, String, i64, K线) + Send + Sync>>,
}
impl K线合成器 {
/// 创建K线合成器,按周期升序排列,初始化当前K线合成K线列表
pub fn new(: String, : Vec<i64>) -> Self {
/// 创建K线合成器 — 对应 Python K线合成器.__init__(标识, 周期组, 事件回调=None)
pub fn new(
: String,
: Vec<i64>,
: Option<Box<dyn Fn(String, String, i64, K线) + Send + Sync>>,
) -> Self {
let mut = ;
.sort();
@@ -51,37 +59,33 @@ impl K线合成器 {
,
K线,
K线列表,
,
}
}
/// 设置事件回调 — 对应 Python `设置事件回调`
pub fn (
&mut self,
: Box<dyn Fn(String, String, i64, K线) + Send + Sync>,
) {
self. = Some();
}
/// 投喂 — 便捷入口,直接从 OHLCV 创建 K线 并投喂
pub fn (
&mut self,
: i64,
: f64,
: f64,
: f64,
: f64,
: f64,
) -> Vec<(i64, K线)> {
pub fn (&mut self, : i64, : f64, : f64, : f64, : f64, : f64) {
let K = K线::K(&self., , , , , , , 0, 0);
self.K线(K)
self.K线(K);
}
/// 投喂K线 — 输入最小周期K线,合成为所有目标周期
/// 返回本次投喂完成了哪些周期的K线(周期 → 完成K线)
pub fn K线(&mut self, K: K线) -> Vec<(i64, K线)> {
let mut = Vec::new();
pub fn K线(&mut self, K: K线) {
let = self..clone();
for in {
if let Some(K线) = self._处理单个周期(, &K) {
.push((, K线));
}
self._处理单个周期(, &K);
}
}
fn _处理单个周期(&mut self, : i64, K: &K线) -> Option<K线> {
fn _处理单个周期(&mut self, : i64, K: &K线) {
let = self._对齐时间戳(K., );
let = self.K线[&]
.as_ref()
@@ -91,19 +95,17 @@ impl K线合成器 {
if self.K线[&].is_none() {
let K线 = self._创建新K线(, , K);
self.K线.insert(, Some(K线));
None
} else if {
let ent = self.K线.get_mut(&).unwrap();
Self::_更新K线(ent.as_mut().unwrap(), K);
None
} else {
let K线 = self._完成K线();
self._完成K线();
let K线 = self._创建新K线(, , K);
self.K线.insert(, Some(K线));
K线
}
}
/// 对齐时间戳到周期边界 — 对应 Python `_对齐时间戳`
fn _对齐时间戳(&self, : i64, : i64) -> i64 {
if == 0 {
panic!("_对齐时间戳: 周期不能为0");
@@ -111,6 +113,7 @@ impl K线合成器 {
( / ) *
}
/// 创建新K线 — 对应 Python `_创建新K线`
fn _创建新K线(&self, : i64, : i64, K: &K线) -> K线 {
let = self
.K线列表
@@ -132,6 +135,7 @@ impl K线合成器 {
)
}
/// 更新K线 — 对应 Python `_更新K线`
fn _更新K线(K线: &mut K线, : &K线) {
K线. = K线..max(.);
K线. = K线..min(.);
@@ -139,9 +143,14 @@ impl K线合成器 {
K线. += .;
}
fn _完成K线(&mut self, : i64) -> Option<K线> {
/// 完成K线 — 对应 Python `_完成K线`
/// 清空当前K线后,触发事件回调(此时获取当前K线返回 None)
fn _完成K线(&mut self, : i64) {
let ent = self.K线.get_mut(&).unwrap();
let mut k线 = ent.take()?;
let mut k线 = match ent.take() {
Some(k) => k,
None => return,
};
k线. = self
.K线列表
.get(&)
@@ -151,11 +160,130 @@ impl K线合成器 {
let K线 = k线.clone();
self.K线列表.get_mut(&).unwrap().push(k线);
Some(K线)
// 对应 Python _完成K线:清空当前K线后、新K线创建前触发回调
self._产生完成K线信号(, K线);
}
/// 获取指定周期当前正在合成的K线
/// 产生完成K线信号 — 对应 Python `_产生完成K线信号`
fn _产生完成K线信号(&self, : i64, K线: K线) {
if let Some(ref cb) = self. {
cb("K线完成".into(), self..clone(), , K线);
}
}
/// 获取指定周期当前正在合成的K线 — 对应 Python `获取当前K线`
pub fn K线(&self, : i64) -> Option<&K线> {
self.K线.get(&).and_then(|k| k.as_ref())
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_创建合成器_初始状态正确() {
let synth = K线合成器::new("btcusd".into(), vec![60, 300], None);
assert_eq!(synth., "btcusd");
assert_eq!(synth., vec![60, 300]);
assert!(synth..is_none());
assert!(synth.K线[&60].is_none());
assert!(synth.K线[&300].is_none());
}
#[test]
fn test_设置事件回调() {
let mut synth = K线合成器::new("btcusd".into(), vec![60], None);
assert!(synth..is_none());
synth.(Box::new(|_, _, _, _| {}));
assert!(synth..is_some());
}
#[test]
fn test_对齐时间戳() {
let synth = K线合成器::new("t".into(), vec![300], None);
assert_eq!(synth._对齐时间戳(1218124800, 300), 1218124800);
assert_eq!(synth._对齐时间戳(1218124801, 300), 1218124800);
assert_eq!(synth._对齐时间戳(1218125099, 300), 1218124800);
assert_eq!(synth._对齐时间戳(1218125100, 300), 1218125100);
}
#[test]
fn test_创建新K线_序号递进() {
let mut synth = K线合成器::new("btcusd".into(), vec![300], None);
{
let first = K线::K("btcusd", 0, 100.0, 110.0, 90.0, 105.0, 1000.0, 0, 300);
synth.K线列表.get_mut(&300).unwrap().push(first);
}
let new_bar = K线::K("btcusd", 100, 200.0, 210.0, 190.0, 205.0, 500.0, 0, 60);
let created = synth._创建新K线(300, 300, &new_bar);
assert_eq!(created., 1);
assert_eq!(created., 300);
assert_eq!(created., 200.0);
}
#[test]
fn test_更新K线_高低更新() {
let mut current = K线::K("t", 0, 100.0, 110.0, 90.0, 105.0, 100.0, 0, 300);
let new_data = K线::K("t", 0, 102.0, 115.0, 85.0, 108.0, 50.0, 0, 60);
K线合成器::_更新K线(&mut current, &new_data);
assert_eq!(current., 115.0);
assert_eq!(current., 85.0);
assert_eq!(current., 108.0);
assert_eq!(current., 150.0);
}
#[test]
fn test_完成K线_返回完成K并将当前置空() {
let mut synth = K线合成器::new("btcusd".into(), vec![300], None);
let bar = K线::K("btcusd", 300, 100.0, 110.0, 90.0, 105.0, 1000.0, 0, 300);
synth.K线.insert(300, Some(bar));
synth._完成K线(300);
assert!(synth.K线[&300].is_none());
assert_eq!(synth.K线列表[&300].len(), 1);
}
#[test]
fn test_完成K线_事件回调触发() {
use std::sync::Arc;
use std::sync::atomic::{AtomicBool, Ordering};
let callback_fired = Arc::new(AtomicBool::new(false));
let cb_flag = Arc::clone(&callback_fired);
let mut synth = K线合成器::new(
"btcusd".into(),
vec![300],
Some(Box::new(move |, , , _完成K线| {
assert_eq!(, "K线完成");
assert_eq!(, "btcusd");
assert_eq!(, 300);
cb_flag.store(true, Ordering::SeqCst);
})),
);
let bar1 = K线::K("btcusd", 0, 100.0, 110.0, 90.0, 105.0, 1000.0, 0, 300);
synth.K线.insert(300, Some(bar1));
let bar2 = K线::K("btcusd", 400, 200.0, 210.0, 190.0, 205.0, 500.0, 0, 60);
synth.K线(bar2);
assert!(callback_fired.load(Ordering::SeqCst));
}
#[test]
fn test_投喂K线_多周期合成() {
let mut synth = K线合成器::new("btcusd".into(), vec![60, 300], None);
synth.K线(K线::K(
"btcusd", 60, 100.0, 110.0, 90.0, 105.0, 100.0, 0, 60,
));
assert!(synth.K线(60).is_some());
assert!(synth.K线(300).is_some());
}
#[test]
fn test_投喂_便捷方法() {
let mut synth = K线合成器::new("btcusd".into(), vec![300], None);
synth.(1218124800, 100.0, 110.0, 90.0, 105.0, 1000.0);
assert!(synth.K线(300).is_some());
}
}