// 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 . extension ListExt on List { /// If predicate is true for any element on the list, replace first element on that position. /// Otherwise, add element. void addOrReplaceWhere(T dev, bool Function(T exDev) predicate) { int idx = indexWhere(predicate); if (idx == -1) { add(dev); } else { removeAt(idx); insert(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; } }