bounded_count function

int bounded_count(dynamic n$1, dynamic coll$1)

Implementation

dc.int bounded_count(dc.dynamic n$1, dc.dynamic coll$1, ){
if(lcoc_core.counted$QMARK_(coll$1, )){
final dc.dynamic coll7674$1=coll$1;
if((coll7674$1 is lcoc_core.ICounted$iface)){
return (((coll7674$1 as lcoc_core.ICounted$iface).$_count$0()) as dc.int);
}
return (((lcoc_core.ICounted.extensions(coll7674$1, ) as lcoc_core.ICounted$ext).$_count$0(coll7674$1, )) as dc.int);
}
dc.int i$1=0;
final dc.dynamic o7600$1=coll$1;
dc.dynamic s$1;
if((o7600$1 is lcoc_core.ISeqable$iface)){
s$1=((o7600$1 as lcoc_core.ISeqable$iface).$_seq$0());
}else{
s$1=((lcoc_core.ISeqable.extensions(o7600$1, ) as lcoc_core.ISeqable$ext).$_seq$0(o7600$1, ));
}
do {
final dc.dynamic and$7465_$AUTO_$1=s$1;
late final dc.dynamic $if_$1;
if(((and$7465_$AUTO_$1!=false)&&(and$7465_$AUTO_$1!=null))){
$if_$1=(i$1<(n$1 as dc.num));
}else{
$if_$1=and$7465_$AUTO_$1;
}
if((($if_$1!=false)&&($if_$1!=null))){
i$1=(1+i$1);
s$1=lcoc_core.next(s$1, );
continue;
}
return i$1;
} while(true);
}