$_reduce$1 method

dynamic $_reduce$1(dynamic f$2)

Implementation

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