1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
// Copyright (C) 2025, uvok cheetah
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <https://www.gnu.org/licenses/>.
extension ListExt<T> on List<T> {
/// Similar to addOrReplaceWhere, but simply use a given keySelector do check equality.
void addOrReplaceKey<K extends Comparable>(
T dev, {
required K Function(T item) keySelector,
bool Function(T existing)? replaceCondition,
}) {
final devKey = keySelector(dev);
final idx = indexWhere((item) => keySelector(item) == devKey);
if (idx == -1) {
add(dev);
} else {
final bool shouldReplace = replaceCondition?.call(this[idx]) ?? true;
if (shouldReplace) this[idx] = dev;
}
}
/// If predicate(1) is false for all elements in the list, add the element.
/// Otherwise, the first element that matches this(1) predicate might be replaced.
/// For this, check replaceCondition(2).
/// If (2) is omitted, the element is always replaced.
/// If (2) is given, it's passed the matching element.
/// The predicate(2) determines whether to replace the element.
void addOrReplaceWhere(
T dev,
bool Function(T exDev) predicate, {
bool Function(T exDev)? replaceCondition,
}) {
int idx = indexWhere(predicate);
if (idx == -1) {
add(dev);
} else {
final bool shouldReplace = replaceCondition?.call(this[idx]) ?? true;
if (shouldReplace) this[idx] = dev;
}
}
/// An element if the predicate is true only for all elements.
/// predicate is passed all existing elements.
bool addIf(T dev, bool Function(T exDev) predicate) {
if (every(predicate)) {
add(dev);
return true;
}
return false;
}
}
|
