$_reduce$2 method

dynamic $_reduce$2(dynamic f$3, dynamic init$3)

Implementation

dc.dynamic $_reduce$2(dc.dynamic f$3, dc.dynamic init$3, ){
final lcoc_core.TreapIterator it$3=lcoc_core.TreapIterator(root, 0, top_rank, (dc.List<dc.int>.filled(top_rank, 0, )), (dc.List<lcoc_core.TreapNode>.filled(top_rank, root, )), null, null, 0, );
dc.dynamic acc$5=init$3;
do {
late final dc.bool $if_$6;
if((it$3.moveNext())){
$if_$6=false;
}else{
$if_$6=true;
}
if($if_$6){
return acc$5;
}
final dc.int idx$4=it$3.idx;
final dc.List arr$4=it$3.node.arr;
late final dc.dynamic acc$6;
if((f$3 is dc.Function)){
acc$6=(f$3 as dc.Function)(acc$5, dc.MapEntry<K, V>(((arr$4[(idx$4-2)]) as K), ((arr$4[(idx$4-1)]) as V), ), );
}else if((f$3 is lcoc_core.IFn$iface)){
acc$6=((f$3 as lcoc_core.IFn$iface).$_invoke$2(acc$5, dc.MapEntry<K, V>(((arr$4[(idx$4-2)]) as K), ((arr$4[(idx$4-1)]) as V), ), ));
}else{
acc$6=(lcoc_core.IFn.extensions(f$3, ).$_invoke$2(f$3, acc$5, dc.MapEntry<K, V>(((arr$4[(idx$4-2)]) as K), ((arr$4[(idx$4-1)]) as V), ), ));
}
if(lcoc_core.reduced$QMARK_(acc$6, )){
return lcoc_core.unreduced(acc$6, );
}
acc$5=acc$6;
continue;
} while(true);
}