2026-02-26 14:08:02 +08:00
|
|
|
|
import 'dart:async';
|
2026-04-17 10:00:39 +08:00
|
|
|
|
import 'dart:convert';
|
|
|
|
|
|
import 'package:flutter/foundation.dart';
|
2026-02-26 14:08:02 +08:00
|
|
|
|
|
|
|
|
|
|
// ======================== 枚举定义 ========================
|
|
|
|
|
|
/// 轨迹模式枚举
|
|
|
|
|
|
enum TPMode {
|
2026-04-17 10:00:39 +08:00
|
|
|
|
NAVIGATION, // 导航模式: 绘制规划已完成路径和当前路径
|
|
|
|
|
|
LOCATION, // 定位模式: 绘制当前点
|
|
|
|
|
|
TRACK, // 轨迹模式: 实时绘制历史轨迹
|
2026-02-26 14:08:02 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// 导航模式下的操作动作枚举
|
|
|
|
|
|
enum TPAction {
|
|
|
|
|
|
UPDATE, // 更新当前点
|
|
|
|
|
|
ADD, // 添加完成点
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// ======================== 尝试锁实现 ========================
|
|
|
|
|
|
class TryLock {
|
|
|
|
|
|
bool _locked = false;
|
|
|
|
|
|
|
|
|
|
|
|
bool tryLock() {
|
|
|
|
|
|
if (_locked) return false;
|
|
|
|
|
|
_locked = true;
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void release() {
|
|
|
|
|
|
_locked = false;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// ======================== 环形队列实现 ========================
|
|
|
|
|
|
class CircQueue<T> {
|
2026-04-15 16:38:54 +08:00
|
|
|
|
final int capacity;
|
|
|
|
|
|
final List<T?> buffer;
|
|
|
|
|
|
int head = 0;
|
|
|
|
|
|
int tail = 0;
|
|
|
|
|
|
bool isFull = false;
|
|
|
|
|
|
final bool deepCopy;
|
|
|
|
|
|
final int maxMemoryBytes;
|
|
|
|
|
|
int currentMemoryBytes = 0;
|
|
|
|
|
|
|
|
|
|
|
|
CircQueue(this.capacity, {this.deepCopy = true, this.maxMemoryBytes = 1024 * 1024}) : buffer = List<T?>.filled(capacity, null);
|
|
|
|
|
|
|
2026-02-26 14:08:02 +08:00
|
|
|
|
void clear() {
|
|
|
|
|
|
head = tail;
|
|
|
|
|
|
isFull = false;
|
|
|
|
|
|
currentMemoryBytes = 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool isEmpty() {
|
|
|
|
|
|
return head == tail && !isFull;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool isFullFn() {
|
|
|
|
|
|
return isFull;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int _estimateSize(T item) {
|
|
|
|
|
|
try {
|
|
|
|
|
|
return utf8.encode(jsonEncode(item)).length;
|
|
|
|
|
|
} catch (e) {
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
T? _deepClone(T? item) {
|
|
|
|
|
|
if (!deepCopy || item == null) return item;
|
|
|
|
|
|
try {
|
|
|
|
|
|
return jsonDecode(jsonEncode(item)) as T;
|
|
|
|
|
|
} catch (e) {
|
|
|
|
|
|
return item;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool enter(T item) {
|
|
|
|
|
|
final itemSize = _estimateSize(item);
|
|
|
|
|
|
if (isFullFn() || (currentMemoryBytes + itemSize > maxMemoryBytes)) {
|
|
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
final clone = _deepClone(item);
|
|
|
|
|
|
buffer[tail] = clone;
|
|
|
|
|
|
tail = (tail + 1) % capacity;
|
|
|
|
|
|
currentMemoryBytes += itemSize;
|
|
|
|
|
|
|
|
|
|
|
|
if (tail == head) isFull = true;
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
T? out() {
|
|
|
|
|
|
if (isEmpty()) return null;
|
|
|
|
|
|
|
|
|
|
|
|
final item = buffer[head];
|
|
|
|
|
|
if (item != null) {
|
|
|
|
|
|
currentMemoryBytes -= _estimateSize(item);
|
|
|
|
|
|
}
|
|
|
|
|
|
head = (head + 1) % capacity;
|
|
|
|
|
|
isFull = false;
|
|
|
|
|
|
return _deepClone(item);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool discard(int len) {
|
|
|
|
|
|
for (int i = 0; i < len; i++) {
|
|
|
|
|
|
if (isEmpty()) return false;
|
|
|
|
|
|
|
|
|
|
|
|
final index = (tail - 1 + capacity) % capacity;
|
|
|
|
|
|
final item = buffer[index];
|
|
|
|
|
|
if (item != null) {
|
|
|
|
|
|
currentMemoryBytes -= _estimateSize(item);
|
|
|
|
|
|
}
|
|
|
|
|
|
tail = index;
|
|
|
|
|
|
isFull = false;
|
|
|
|
|
|
}
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int getDepth() {
|
|
|
|
|
|
return isFull ? capacity : (tail + capacity - head) % capacity;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
Future<bool> send(T item, {int timeoutMs = 0}) async {
|
|
|
|
|
|
final start = DateTime.now().millisecondsSinceEpoch;
|
|
|
|
|
|
while (!enter(item)) {
|
2026-03-13 12:37:59 +08:00
|
|
|
|
if (timeoutMs > 0 && DateTime.now().millisecondsSinceEpoch - start >= timeoutMs) {
|
2026-02-26 14:08:02 +08:00
|
|
|
|
return false;
|
|
|
|
|
|
}
|
|
|
|
|
|
await Future.delayed(const Duration(milliseconds: 1));
|
|
|
|
|
|
}
|
|
|
|
|
|
return true;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
Future<T?> recv({int timeoutMs = 0}) async {
|
|
|
|
|
|
final start = DateTime.now().millisecondsSinceEpoch;
|
|
|
|
|
|
while (true) {
|
|
|
|
|
|
final item = out();
|
|
|
|
|
|
if (item != null) return item;
|
2026-03-13 12:37:59 +08:00
|
|
|
|
if (timeoutMs > 0 && DateTime.now().millisecondsSinceEpoch - start >= timeoutMs) {
|
2026-02-26 14:08:02 +08:00
|
|
|
|
return null;
|
|
|
|
|
|
}
|
|
|
|
|
|
await Future.delayed(const Duration(milliseconds: 1));
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
List<T?> toList() {
|
|
|
|
|
|
final result = <T?>[];
|
|
|
|
|
|
int i = head;
|
|
|
|
|
|
int count = getDepth();
|
|
|
|
|
|
while (count-- > 0) {
|
|
|
|
|
|
result.add(_deepClone(buffer[i]));
|
|
|
|
|
|
i = (i + 1) % capacity;
|
|
|
|
|
|
}
|
|
|
|
|
|
return result;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-04-17 10:00:39 +08:00
|
|
|
|
// ======================== 轨迹点核心类 ========================
|
2026-02-26 14:08:02 +08:00
|
|
|
|
class TracePoint<T> {
|
|
|
|
|
|
late final CircQueue<T> _queue;
|
|
|
|
|
|
List<T> _tracePoint = [];
|
|
|
|
|
|
int _completePointIndex = 0;
|
|
|
|
|
|
late final TryLock _lock;
|
|
|
|
|
|
TPMode _mode = TPMode.LOCATION;
|
|
|
|
|
|
|
2026-04-17 10:00:39 +08:00
|
|
|
|
// 回调事件(对应JS原版emit)
|
2026-02-26 14:08:02 +08:00
|
|
|
|
void Function(T)? onCurrentPointUpdated;
|
|
|
|
|
|
void Function(T)? onCompletePointAdded;
|
|
|
|
|
|
|
2026-04-17 10:00:39 +08:00
|
|
|
|
// 测试专用方法
|
2026-02-26 14:08:02 +08:00
|
|
|
|
bool tryLock() => _lock.tryLock();
|
|
|
|
|
|
void release() => _lock.release();
|
|
|
|
|
|
|
|
|
|
|
|
TracePoint({int queueCapacity = 5, int maxMemoryBytes = 1024 * 1024}) {
|
2026-03-13 12:37:59 +08:00
|
|
|
|
_queue = CircQueue<T>(queueCapacity, deepCopy: true, maxMemoryBytes: maxMemoryBytes);
|
2026-02-26 14:08:02 +08:00
|
|
|
|
_lock = TryLock();
|
|
|
|
|
|
reset();
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-04-17 10:00:39 +08:00
|
|
|
|
/// 复位所有状态(和JS完全一致)
|
2026-02-26 14:08:02 +08:00
|
|
|
|
void reset() {
|
|
|
|
|
|
_queue.clear();
|
2026-04-15 16:38:54 +08:00
|
|
|
|
_tracePoint.clear();
|
2026-02-26 14:08:02 +08:00
|
|
|
|
_completePointIndex = 0;
|
|
|
|
|
|
_lock.release();
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-04-17 10:00:39 +08:00
|
|
|
|
/// 设置工作模式
|
2026-02-26 14:08:02 +08:00
|
|
|
|
void setMode(TPMode mode) {
|
|
|
|
|
|
reset();
|
|
|
|
|
|
_mode = mode;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-14 20:05:42 +08:00
|
|
|
|
TPMode getMode() {
|
|
|
|
|
|
return _mode;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-04-17 10:00:39 +08:00
|
|
|
|
/// 添加/更新点(核心API,和JS逻辑完全一致)
|
2026-02-26 14:08:02 +08:00
|
|
|
|
void upsert(T point, [TPAction act = TPAction.UPDATE]) {
|
2026-04-17 10:00:39 +08:00
|
|
|
|
if (point == null) {
|
|
|
|
|
|
debugPrint('upsert: point is null');
|
|
|
|
|
|
return;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-02-26 14:08:02 +08:00
|
|
|
|
switch (_mode) {
|
|
|
|
|
|
case TPMode.NAVIGATION:
|
2026-04-15 16:38:54 +08:00
|
|
|
|
if (act == TPAction.UPDATE) {
|
|
|
|
|
|
_updateCurrentPoint(point);
|
|
|
|
|
|
} else {
|
|
|
|
|
|
_addCompletePoint(point);
|
|
|
|
|
|
}
|
2026-02-26 14:08:02 +08:00
|
|
|
|
break;
|
|
|
|
|
|
case TPMode.LOCATION:
|
|
|
|
|
|
_updateCurrentPoint(point);
|
|
|
|
|
|
break;
|
|
|
|
|
|
case TPMode.TRACK:
|
|
|
|
|
|
_addCompletePoint(point);
|
|
|
|
|
|
break;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-04-17 10:00:39 +08:00
|
|
|
|
/// 获取轨迹列表(线程安全拷贝)
|
2026-02-26 14:08:02 +08:00
|
|
|
|
List<T>? getTracePoint() {
|
|
|
|
|
|
if (_lock.tryLock()) {
|
|
|
|
|
|
final trace = List<T>.from(_tracePoint);
|
|
|
|
|
|
_lock.release();
|
|
|
|
|
|
return trace;
|
|
|
|
|
|
} else {
|
2026-04-17 10:00:39 +08:00
|
|
|
|
debugPrint('getTracePoint: lock!!!');
|
2026-02-26 14:08:02 +08:00
|
|
|
|
return null;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-04-17 10:00:39 +08:00
|
|
|
|
/// 更新当前点(导航/定位模式共用)
|
2026-02-26 14:08:02 +08:00
|
|
|
|
void _updateCurrentPoint(T point) {
|
2026-04-17 10:00:39 +08:00
|
|
|
|
if (!_lock.tryLock()) {
|
|
|
|
|
|
debugPrint('updateCurrentPoint: lock!!!, discard current point');
|
|
|
|
|
|
return;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
try {
|
|
|
|
|
|
switch (_mode) {
|
|
|
|
|
|
case TPMode.NAVIGATION:
|
|
|
|
|
|
if (_tracePoint.isEmpty) {
|
|
|
|
|
|
debugPrint('updateCurrentPoint: wait first completed point, discard');
|
|
|
|
|
|
} else {
|
|
|
|
|
|
_tracePoint = _tracePoint.sublist(0, _completePointIndex);
|
2026-04-15 16:38:54 +08:00
|
|
|
|
_tracePoint.add(point);
|
2026-02-26 14:08:02 +08:00
|
|
|
|
onCurrentPointUpdated?.call(point);
|
2026-04-17 10:00:39 +08:00
|
|
|
|
}
|
|
|
|
|
|
break;
|
|
|
|
|
|
case TPMode.LOCATION:
|
|
|
|
|
|
_tracePoint = [point];
|
|
|
|
|
|
onCurrentPointUpdated?.call(point);
|
|
|
|
|
|
break;
|
|
|
|
|
|
case TPMode.TRACK:
|
|
|
|
|
|
break;
|
2026-02-26 14:08:02 +08:00
|
|
|
|
}
|
2026-04-17 10:00:39 +08:00
|
|
|
|
} finally {
|
|
|
|
|
|
_lock.release();
|
2026-02-26 14:08:02 +08:00
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-04-17 10:00:39 +08:00
|
|
|
|
/// 添加完成点(导航/轨迹模式共用)
|
2026-02-26 14:08:02 +08:00
|
|
|
|
void _addCompletePoint(T point) {
|
|
|
|
|
|
if (_lock.tryLock()) {
|
|
|
|
|
|
try {
|
2026-04-17 10:00:39 +08:00
|
|
|
|
// 先处理队列积压
|
2026-02-26 14:08:02 +08:00
|
|
|
|
while (!_queue.isEmpty()) {
|
|
|
|
|
|
final queuedPoint = _queue.out();
|
|
|
|
|
|
if (queuedPoint != null) {
|
|
|
|
|
|
_addPoint(queuedPoint);
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
_addPoint(point);
|
|
|
|
|
|
onCompletePointAdded?.call(point);
|
|
|
|
|
|
} catch (e) {
|
2026-04-17 10:00:39 +08:00
|
|
|
|
debugPrint('addCompletePoint failure: $e');
|
2026-02-26 14:08:02 +08:00
|
|
|
|
} finally {
|
|
|
|
|
|
_lock.release();
|
|
|
|
|
|
}
|
|
|
|
|
|
} else {
|
2026-04-17 10:00:39 +08:00
|
|
|
|
// 锁失败 → 入队列等待(JS原版核心逻辑)
|
|
|
|
|
|
_queue.enter(point);
|
|
|
|
|
|
debugPrint('addCompletePoint: lock!!!, enter queue');
|
2026-02-26 14:08:02 +08:00
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-04-17 10:00:39 +08:00
|
|
|
|
/// 内部真正执行添加点逻辑(和JS完全一致)
|
2026-02-26 14:08:02 +08:00
|
|
|
|
void _addPoint(T point) {
|
2026-04-17 10:00:39 +08:00
|
|
|
|
final hasCurrentPoint = _tracePoint.isNotEmpty && _completePointIndex < _tracePoint.length;
|
2026-02-26 14:08:02 +08:00
|
|
|
|
|
2026-04-17 10:00:39 +08:00
|
|
|
|
if (hasCurrentPoint) {
|
2026-02-26 14:08:02 +08:00
|
|
|
|
_tracePoint = _tracePoint.sublist(0, _completePointIndex);
|
2026-04-17 10:00:39 +08:00
|
|
|
|
_tracePoint.insert(_completePointIndex, point);
|
2026-02-26 14:08:02 +08:00
|
|
|
|
} else {
|
|
|
|
|
|
_tracePoint.add(point);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
_completePointIndex++;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|