hash_unordered_coll function

int hash_unordered_coll(dynamic coll$1)

Implementation

dc.int hash_unordered_coll(dc.dynamic coll$1, ){
dc.int n$1=0;
dc.int hash_code$1=0;
final dc.dynamic o7603$1=coll$1;
dc.dynamic coll$2;
if((o7603$1 is lcoc_core.ISeqable$iface)){
coll$2=((o7603$1 as lcoc_core.ISeqable$iface).$_seq$0());
}else{
coll$2=((lcoc_core.ISeqable.extensions(o7603$1, ) as lcoc_core.ISeqable$ext).$_seq$0(o7603$1, ));
}
do {
if((null==coll$2)){
return lcoc_core.mix_collection_hash(hash_code$1, n$1, );
}
n$1=(1+n$1);
final dc.dynamic o7835$1=lcoc_core.first(coll$2, );
late final dc.int cast$1;
if((o7835$1 is lcoc_core.IHash$iface)){
cast$1=(((o7835$1 as lcoc_core.IHash$iface).$_hash$0()) as dc.int);
}else{
cast$1=(((lcoc_core.IHash.extensions(o7835$1, ) as lcoc_core.IHash$ext).$_hash$0(o7835$1, )) as dc.int);
}
final dc.int $1=(hash_code$1+cast$1);
hash_code$1=(4294967295&$1);
coll$2=lcoc_core.next(coll$2, );
continue;
} while(true);
}