sky/app-starlock
3
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix:调整蓝牙搜索时判断搜索到的设备是否配对的逻辑

Browse Source
This commit is contained in:
liyi 2025-05-12 13:57:50 +08:00
parent 310062513b
commit 4a725be23f
1 changed files with 20 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
lib/blue/blue_manage.dart
View File

@ -319,22 +319,34 @@ class BlueManage {
bool _isMatch(List<String> serviceUuids, {DeviceType deviceType = DeviceType.blue}) {
final List<String> prefixes = getDeviceType(deviceType).map((e) => e.toLowerCase()).toList();
for (String uuid in serviceUuids) {
final String cleanUuid = uuid.replaceAll('-', '').toLowerCase();
final String cleanUuid = uuid.toLowerCase();
if (cleanUuid.length == 8) {
// 8位，判断前两位
// 8位，判断第4、5位
String pairStatus = cleanUuid.substring(4, 6); // 第4、5位（索引3和4）
for (final prefix in prefixes) {
if (cleanUuid.startsWith(prefix)) {
return true;
// 00=未配对，01=已配对
if (pairStatus == '00') {
return true; // 未配对才返回true
}
// 已配对（01）不返回true，继续判断下一个uuid
}
}
} else if (cleanUuid.length == 32) {
} else {
// 128位，判断前8位的第3、第4位
final String first8 = cleanUuid.substring(0, 8);
if (first8.length >= 4) {
final String thirdAndFourth = first8.substring(2, 4); // 索引2和3
if (cleanUuid.length >= 32) {
final String thirdAndFourth = cleanUuid.substring(2, 4); // 索引2和3
for (final prefix in prefixes) {
if (thirdAndFourth == prefix) {
return true;
// 判断配对状态（带横杠UUID的第31、32位，从1开始计数）
if (cleanUuid.length >= 32) {
String pairStatus = cleanUuid.substring(30, 32); // 第31、32位（从1开始计数）
// 00=未配对，01=已配对
if (pairStatus == '00') {
return true; // 未配对才返回true
}
// 已配对（01）不返回true，继续判断下一个uuid
}
}
}
}