tnode_leaf_search method

int tnode_leaf_search(
  1. dynamic k$1,
  2. int cmp$1(
    1. dynamic x$1,
    2. dynamic n$1
    )
)

Implementation

dc.int tnode_leaf_search(dc.dynamic k$1, dc.int Function(dc.dynamic, dc.dynamic, ) cmp$1, ){
assert((){
late final dc.bool $if_$1;
if(arr.length.isEven){
$if_$1=true;
}else{
$if_$1=false;
}
return $if_$1;
}(), (){
final dc.List<dc.dynamic> fl$1=(dc.List<dc.dynamic>.filled(2, (lcoc_core.symbol.$_invoke$2(null, "even?", )), ));
final dc.List<dc.dynamic> fl$2=(dc.List<dc.dynamic>.filled(2, (lcoc_core.symbol.$_invoke$2(null, "alength", )), ));
fl$2[1]=(lcoc_core.symbol.$_invoke$2(null, "arr", ));
final lcoc_core.PersistentList $2=lcoc_core.$_list_lit(fl$2, );
final dc.List<dc.dynamic> fl$3=(dc.List<dc.dynamic>.filled(4, const lcoc_core.Keyword(null, "line", 878494669, ), ));
fl$3[1]=7411;
fl$3[2]=const lcoc_core.Keyword(null, "column", 3362807310, );
fl$3[3]=19;
final lcoc_core.PersistentHashMap $3=lcoc_core.$_map_lit(fl$3, );
final dc.dynamic $4=lcoc_core.with_meta($2, $3, );
fl$1[1]=$4;
final lcoc_core.PersistentList $1=lcoc_core.$_list_lit(fl$1, );
final dc.List<dc.dynamic> fl$4=(dc.List<dc.dynamic>.filled(4, const lcoc_core.Keyword(null, "line", 878494669, ), ));
fl$4[1]=7411;
fl$4[2]=const lcoc_core.Keyword(null, "column", 3362807310, );
fl$4[3]=12;
final lcoc_core.PersistentHashMap $5=lcoc_core.$_map_lit(fl$4, );
final dc.dynamic $6=lcoc_core.with_meta($1, $5, );
final dc.String $7=(lcoc_core.pr_str.$_invoke$1($6, ));
final dc.String $8=(lcoc_core.str.$_invoke$2("Assert failed: ", $7, ));
return $8;
}());
dc.int i$1=-1;
dc.int j$1=(arr.length-1);
do {
if((i$1<j$1)){
final dc.int m$1=(((i$1+j$1)~/2)&4294967294);
final dc.dynamic z$1=cmp$1(k$1, (arr[m$1]), );
if((0>(z$1 as dc.num))){
j$1=(m$1-1);
continue;
}
if((0==z$1)){
return m$1;
}
i$1=(1+m$1);
continue;
}
return i$1;
} while(true);
}