终于解决了 第二次作业之后的 路径不清除的问题 ,一直保留着上一次作业发送的完成点

This commit is contained in:
mmc
2026-04-17 10:00:39 +08:00
parent 2aadaa0205
commit e3026f61bb
6 changed files with 157 additions and 170 deletions

View File

@@ -1,12 +1,13 @@
import 'dart:convert';
import 'dart:async';
import 'dart:convert';
import 'package:flutter/foundation.dart';
// ======================== 枚举定义 ========================
/// 轨迹模式枚举
enum TPMode {
NAVIGATION, // 导航模式:绘制规划已完成路径和当前路径
LOCATION, // 定位模式:仅绘制当前点(永远只有1个)
TRACK, // 轨迹模式:实时绘制历史轨迹
NAVIGATION, // 导航模式: 绘制规划已完成路径和当前路径
LOCATION, // 定位模式: 绘制当前点
TRACK, // 轨迹模式: 实时绘制历史轨迹
}
/// 导航模式下的操作动作枚举
@@ -28,8 +29,6 @@ class TryLock {
void release() {
_locked = false;
}
bool get isLocked => _locked;
}
// ======================== 环形队列实现 ========================
@@ -157,6 +156,7 @@ class CircQueue<T> {
}
}
// ======================== 轨迹点核心类 ========================
class TracePoint<T> {
late final CircQueue<T> _queue;
List<T> _tracePoint = [];
@@ -164,9 +164,11 @@ class TracePoint<T> {
late final TryLock _lock;
TPMode _mode = TPMode.LOCATION;
// 回调事件(对应JS原版emit)
void Function(T)? onCurrentPointUpdated;
void Function(T)? onCompletePointAdded;
// 测试专用方法
bool tryLock() => _lock.tryLock();
void release() => _lock.release();
@@ -176,7 +178,7 @@ class TracePoint<T> {
reset();
}
/// 复位所有状态
/// 复位所有状态(和JS完全一致)
void reset() {
_queue.clear();
_tracePoint.clear();
@@ -184,7 +186,7 @@ class TracePoint<T> {
_lock.release();
}
/// 设置模式
/// 设置工作模式
void setMode(TPMode mode) {
reset();
_mode = mode;
@@ -194,9 +196,13 @@ class TracePoint<T> {
return _mode;
}
/// 添加/更新轨迹点
/// 添加/更新点(核心API,和JS逻辑完全一致)
void upsert(T point, [TPAction act = TPAction.UPDATE]) {
// 严格按模式分发
if (point == null) {
debugPrint('upsert: point is null');
return;
}
switch (_mode) {
case TPMode.NAVIGATION:
if (act == TPAction.UPDATE) {
@@ -205,103 +211,89 @@ class TracePoint<T> {
_addCompletePoint(point);
}
break;
case TPMode.LOCATION:
// LOCATION 永远只保留最新一个点
_updateCurrentPoint(point);
break;
case TPMode.TRACK:
// TRACK 每个点都直接添加,不进队列
_addCompletePoint(point);
break;
}
}
/// 获取轨迹列表
/// 获取轨迹列表(线程安全拷贝)
List<T>? getTracePoint() {
if (_lock.tryLock()) {
final trace = List<T>.from(_tracePoint);
_lock.release();
return trace;
} else {
print('getTracePoint: lock!!!');
debugPrint('getTracePoint: lock!!!');
return null;
}
}
/// 更新当前点(LOCATION 永远只有1个)
/// 更新当前点(导航/定位模式共用)
void _updateCurrentPoint(T point) {
if (_lock.tryLock()) {
try {
switch (_mode) {
case TPMode.NAVIGATION:
if (_tracePoint.isNotEmpty) {
_tracePoint = _tracePoint.sublist(0, _completePointIndex);
_tracePoint.add(point);
onCurrentPointUpdated?.call(point);
}
break;
if (!_lock.tryLock()) {
debugPrint('updateCurrentPoint: lock!!!, discard current point');
return;
}
case TPMode.LOCATION:
// 核心:永远清空,只保留最新一个
_tracePoint.clear();
try {
switch (_mode) {
case TPMode.NAVIGATION:
if (_tracePoint.isEmpty) {
debugPrint('updateCurrentPoint: wait first completed point, discard');
} else {
_tracePoint = _tracePoint.sublist(0, _completePointIndex);
_tracePoint.add(point);
onCurrentPointUpdated?.call(point);
break;
default:
break;
}
} finally {
_lock.release();
}
break;
case TPMode.LOCATION:
_tracePoint = [point];
onCurrentPointUpdated?.call(point);
break;
case TPMode.TRACK:
break;
}
} finally {
_lock.release();
}
}
/// 添加完成点
/// 添加完成点(导航/轨迹模式共用)
void _addCompletePoint(T point) {
if (_lock.tryLock()) {
try {
// 先消费队列
// 先处理队列积压
while (!_queue.isEmpty()) {
final queuedPoint = _queue.out();
if (queuedPoint != null) {
_addPoint(queuedPoint);
}
}
// 添加当前点
_addPoint(point);
onCompletePointAdded?.call(point);
} catch (e) {
print('addCompletePoint failure: $e');
debugPrint('addCompletePoint failure: $e');
} finally {
_lock.release();
}
} else {
if (_mode != TPMode.TRACK) {
// TRACK 模式不加队列,直接丢弃旧的保证流畅
_queue.enter(point);
}
print('addCompletePoint: lock!!!');
// 锁失败 → 入队列等待(JS原版核心逻辑)
_queue.enter(point);
debugPrint('addCompletePoint: lock!!!, enter queue');
}
}
/// 内部添加点
/// 内部真正执行添加点逻辑(和JS完全一致)
void _addPoint(T point) {
if (_mode == TPMode.LOCATION) {
// LOCATION 强制只保留1个
_tracePoint.clear();
_tracePoint.add(point);
_completePointIndex = 1;
return;
}
final hasCurrentPoint = _tracePoint.isNotEmpty && _completePointIndex < _tracePoint.length;
final hasCurrent = _tracePoint.isNotEmpty && _completePointIndex < _tracePoint.length;
if (hasCurrent) {
if (hasCurrentPoint) {
_tracePoint = _tracePoint.sublist(0, _completePointIndex);
_tracePoint.add(point);
_tracePoint.insert(_completePointIndex, point);
} else {
_tracePoint.add(point);
}