inode_without_transient method

dynamic inode_without_transient(
  1. int shift$5,
  2. int h$5,
  3. dynamic k$6
)

Implementation

dc.dynamic inode_without_transient(dc.int shift$5, dc.int h$5, dc.dynamic k$6, ){
if((shift$5<32)){
final dc.int n$9=((h$5>>(31&shift$5))&31);
final dc.int bit$5=(4294967295&(1<<(31&n$9)));
final dc.int mask$5=(bit$5-1);
final dc.int idx$5=lcoc_core.u32x2_bit_count((mask$5&bitmap_hi), (mask$5&bitmap_lo), );
final dc.int hi$5=(bitmap_hi&bit$5);
final dc.int lo$5=(bitmap_lo&bit$5);
if((0==(hi$5|lo$5))){
}else if((0==(hi$5&lo$5))){
final lcoc_core.BitmapNode child$4=((arr[idx$5]) as lcoc_core.BitmapNode);
final dc.int child_cnt$1=child$4.cnt;
late final dc.dynamic $if_$5;
if((0==hi$5)){
final dc.dynamic child$PRIME_$2=(child$4.inode_without(shift$5, h$5, k$6, ));
if(dc.identical((child$4 as dc.Object?), child$PRIME_$2, )){
$if_$5=null;
}else{
$if_$5=child$PRIME_$2;
}
}else{
$if_$5=(child$4.inode_without_transient((shift$5+5), h$5, k$6, ));
}
late final lcoc_core.BitmapNode? child$PRIME_$3;
if((null!=$if_$5)){
child$PRIME_$3=($if_$5 as lcoc_core.BitmapNode);
}else{
child$PRIME_$3=null;
}
if((child$PRIME_$3!=null)){
final dc.bool and$7465_$AUTO_$2=(1==(child$PRIME_$3 as lcoc_core.BitmapNode).cnt);
late final dc.bool $if_$6;
if(and$7465_$AUTO_$2){
$if_$6=(0==((child$PRIME_$3 as lcoc_core.BitmapNode).bitmap_hi^(child$PRIME_$3 as lcoc_core.BitmapNode).bitmap_lo));
}else{
$if_$6=and$7465_$AUTO_$2;
}
if($if_$6){
final dc.dynamic k$7=((child$PRIME_$3 as lcoc_core.BitmapNode).arr[0]);
final dc.dynamic v$4=((child$PRIME_$3 as lcoc_core.BitmapNode).arr[1]);
final dc.int net_size$3=(1+lcoc_core.u32x2_bit_count(bitmap_hi, bitmap_lo, ));
final dc.int gross_size$2=(-8&(7+net_size$3));
final dc.List from_arr$3=arr;
if((arr.length<net_size$3)){
arr=lcoc_core.aresize(arr, idx$5, gross_size$2, null, );
}else{
}
dc.int j$7=(1+idx$5);
dc.int i$15=(1+j$7);
do {
if((i$15<net_size$3)){
final dc.dynamic v$8083_$AUTO_$32=(from_arr$3[j$7]);
arr[i$15]=v$8083_$AUTO_$32;
j$7=(1+j$7);
i$15=(1+i$15);
continue;
}
break;
} while(true);
final dc.dynamic v$8083_$AUTO_$33=k$7;
arr[idx$5]=v$8083_$AUTO_$33;
final dc.dynamic v$8083_$AUTO_$34=v$4;
arr[(1+idx$5)]=v$8083_$AUTO_$34;
cnt=(cnt-1);
bitmap_hi=(bitmap_hi|bit$5);
bitmap_lo=(bitmap_lo|bit$5);
}else{
final lcoc_core.BitmapNode? v$8083_$AUTO_$35=child$PRIME_$3;
arr[idx$5]=v$8083_$AUTO_$35;
}
}else{
}
}else if((lcoc_core.$EQ_.$_invoke$2(k$6, (arr[idx$5]), ))){
final dc.int net_size$4=(lcoc_core.u32x2_bit_count(bitmap_hi, bitmap_lo, )-2);
final dc.int gross_size$3=(-8&(7+net_size$4));
final dc.List from_arr$4=arr;
if((gross_size$3<arr.length)){
arr=lcoc_core.aresize(arr, idx$5, gross_size$3, null, );
}else{
}
dc.int i$16=idx$5;
dc.int j$8=(2+idx$5);
do {
if((i$16<net_size$4)){
final dc.dynamic v$8083_$AUTO_$36=(from_arr$4[j$8]);
arr[i$16]=v$8083_$AUTO_$36;
i$16=(1+i$16);
j$8=(1+j$8);
continue;
}
break;
} while(true);
if(dc.identical(arr, from_arr$4, )){
arr[net_size$4]=null;
arr[(1+net_size$4)]=null;
}else{
}
cnt=(cnt-1);
bitmap_hi=(bitmap_hi^bit$5);
bitmap_lo=(bitmap_lo^bit$5);
}else{
}
return this;
}
final dc.int n$10=(2*cnt);
dc.int i$17=0;
do {
if((i$17==n$10)){
}else if((lcoc_core.$EQ_.$_invoke$2((arr[i$17]), k$6, ))){
final dc.int n_1$1=(n$10-1);
final dc.int n_2$2=(n$10-2);
final dc.int i$PLUS_1$3=(1+i$17);
if((i$17==n_2$2)){
}else{
final dc.List G$8921_$1=arr;
final dc.dynamic v$8083_$AUTO_$39=(arr[n_2$2]);
G$8921_$1[i$17]=v$8083_$AUTO_$39;
final dc.dynamic v$8083_$AUTO_$40=(arr[n_1$1]);
G$8921_$1[i$PLUS_1$3]=v$8083_$AUTO_$40;
final dc.List G$8922_$1=arr;
G$8922_$1[n_2$2]=null;
G$8922_$1[n_1$1]=null;
cnt=(cnt-1);
}
}else{
i$17=(2+i$17);
continue;
}
break;
} while(true);
return this;
}