xxxxxxxxxx
import std.container : DList;
import std.algorithm : find;
import std.range : take;
import std.stdio : writeln;
import std.range : take;
struct Job
{
int id;
}
int main(string[] args)
{
auto list = DList!Job(Job(1), Job(2), Job(3));
writeln("before");
foreach (i; list[])
{
writeln(i);
}
int idToDelete = 2;
auto toRemove = list[].find!(job => job.id == idToDelete).take(1);
if (!toRemove.empty)
{
list.linearRemove(toRemove);
}
writeln("after");
foreach (i; list[])
{
writeln(i);
}
return 0;
}