60 lines
1.7 KiB
Dart
60 lines
1.7 KiB
Dart
import 'dart:async';
|
|
|
|
import 'package:rimworld_modman/logger.dart';
|
|
import 'package:rimworld_modman/mod.dart';
|
|
import 'package:rimworld_modman/mod_list.dart';
|
|
|
|
/// A class that helps find the minimum set of mods that exhibit a bug.
|
|
///
|
|
/// Provides two main algorithms:
|
|
/// - Binary search / bisect: Divides mods into smaller subsets to find problematic ones quickly.
|
|
/// - Linear search / batching: Tests mods in small groups to systematically identify issues.
|
|
///
|
|
/// These approaches help RimWorld mod users identify which mods are causing problems
|
|
/// when many mods are installed.
|
|
class ModListTroubleshooter {
|
|
final ModList originalModList;
|
|
ModList currentModList;
|
|
int _startIndex = 0;
|
|
int _endIndex = 0;
|
|
|
|
ModListTroubleshooter(ModList modList)
|
|
: originalModList = modList,
|
|
currentModList = modList.copyWith(),
|
|
_startIndex = 0,
|
|
_endIndex = modList.activeMods.length;
|
|
|
|
ModList binaryForward() {
|
|
final midIndex = (_startIndex + _endIndex) ~/ 2;
|
|
final subset = originalModList.activeMods.keys.toList().sublist(midIndex);
|
|
currentModList.disableAll();
|
|
currentModList.enableMods(subset);
|
|
_startIndex = midIndex;
|
|
return currentModList;
|
|
}
|
|
|
|
ModList binaryBackward() {
|
|
final midIndex = ((_startIndex + _endIndex) / 2).ceil();
|
|
final subset = originalModList.activeMods.keys.toList().sublist(
|
|
0,
|
|
midIndex,
|
|
);
|
|
currentModList.disableAll();
|
|
currentModList.enableMods(subset);
|
|
_endIndex = midIndex;
|
|
return currentModList;
|
|
}
|
|
|
|
ModList linearForward() {
|
|
return currentModList;
|
|
}
|
|
|
|
ModList linearBackward() {
|
|
return currentModList;
|
|
}
|
|
|
|
void reset() {
|
|
currentModList = originalModList.copyWith();
|
|
}
|
|
}
|