IRIS: Decrease execution time at the cost of slightly higher memory use
The first { $_->raw_id eq $id } @{ $self->{results} } calls effectively handle the results as a linked list, while in both cases only a single element (with a unique ID, too) is looked up. A hashmap makes this about 30% faster (580ms total -> 490ms total)
Loading
Please register or sign in to comment