Last active
December 17, 2015 19:59
-
-
Save bendlas/5664542 to your computer and use it in GitHub Desktop.
Generated code for PersistentArrayMap with advanced optimizations on branch specify vs current master
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function $cljs$core$PersistentArrayMap$$($meta$$20$$, $cnt$$9$$, $arr$$73$$, $__hash$$11$$) { | |
this.$meta$ = $meta$$20$$; | |
this.$cnt$ = $cnt$$9$$; | |
this.$arr$ = $arr$$73$$; | |
this.$__hash$ = $__hash$$11$$; | |
this.$cljs$lang$protocol_mask$partition1$$ = 4; | |
this.$cljs$lang$protocol_mask$partition0$$ = 16123663 | |
} | |
$JSCompiler_prototypeAlias$$ = $cljs$core$PersistentArrayMap$$.prototype; | |
$JSCompiler_prototypeAlias$$.$cljs$core$IEditableCollection$_as_transient$arity$1$ = function $$JSCompiler_prototypeAlias$$$$cljs$core$IEditableCollection$_as_transient$arity$1$$() { | |
return new $cljs$core$TransientArrayMap$$({}, this.$arr$.length, this.$arr$.slice()) | |
}; | |
$JSCompiler_prototypeAlias$$.$cljs$core$IHash$_hash$arity$1$ = function $$JSCompiler_prototypeAlias$$$$cljs$core$IHash$_hash$arity$1$$($coll$$334_h__2444__auto____$1$$10$$) { | |
var $h__2444__auto__$$10$$ = this.$__hash$; | |
return $h__2444__auto__$$10$$ != $JSCompiler_alias_NULL$$ ? $h__2444__auto__$$10$$ : this.$__hash$ = $coll$$334_h__2444__auto____$1$$10$$ = $cljs$core$hash_imap$$($coll$$334_h__2444__auto____$1$$10$$) | |
}; | |
$JSCompiler_prototypeAlias$$.$cljs$core$ILookup$_lookup$arity$2$ = function $$JSCompiler_prototypeAlias$$$$cljs$core$ILookup$_lookup$arity$2$$($coll$$335$$, $k$$81$$) { | |
return $coll$$335$$.$cljs$core$ILookup$_lookup$arity$3$($coll$$335$$, $k$$81$$, $JSCompiler_alias_NULL$$) | |
}; | |
$JSCompiler_prototypeAlias$$.$cljs$core$ILookup$_lookup$arity$3$ = function $$JSCompiler_prototypeAlias$$$$cljs$core$ILookup$_lookup$arity$3$$($coll$$336_idx$$12$$, $k$$82$$, $not_found$$35$$) { | |
$coll$$336_idx$$12$$ = $cljs$core$array_map_index_of$$($coll$$336_idx$$12$$, $k$$82$$); | |
return-1 === $coll$$336_idx$$12$$ ? $not_found$$35$$ : this.$arr$[$coll$$336_idx$$12$$ + 1] | |
}; | |
$JSCompiler_prototypeAlias$$.$cljs$core$IAssociative$_assoc$arity$3$ = function $$JSCompiler_prototypeAlias$$$$cljs$core$IAssociative$_assoc$arity$3$$($coll$$337_l$$inline_1054$$, $G__4530$$inline_266_k$$83$$, $v$$27$$) { | |
var $arr$$inline_1053_idx$$13$$ = $cljs$core$array_map_index_of$$($coll$$337_l$$inline_1054$$, $G__4530$$inline_266_k$$83$$); | |
if(-1 === $arr$$inline_1053_idx$$13$$) { | |
if(this.$cnt$ < $cljs$core$PersistentArrayMap$HASHMAP_THRESHOLD$$) { | |
$arr$$inline_1053_idx$$13$$ = $coll$$337_l$$inline_1054$$.$arr$; | |
$coll$$337_l$$inline_1054$$ = $arr$$inline_1053_idx$$13$$.length; | |
for(var $narr$$inline_1055$$ = Array($coll$$337_l$$inline_1054$$ + 2), $i_4527$$inline_1056$$ = 0;;) { | |
if($i_4527$$inline_1056$$ < $coll$$337_l$$inline_1054$$) { | |
$narr$$inline_1055$$[$i_4527$$inline_1056$$] = $arr$$inline_1053_idx$$13$$[$i_4527$$inline_1056$$], $i_4527$$inline_1056$$ += 1 | |
}else { | |
break | |
} | |
} | |
$narr$$inline_1055$$[$coll$$337_l$$inline_1054$$] = $G__4530$$inline_266_k$$83$$; | |
$narr$$inline_1055$$[$coll$$337_l$$inline_1054$$ + 1] = $v$$27$$; | |
return new $cljs$core$PersistentArrayMap$$(this.$meta$, this.$cnt$ + 1, $narr$$inline_1055$$, $JSCompiler_alias_NULL$$) | |
} | |
return $cljs$core$_with_meta$$($cljs$core$_assoc$$($cljs$core$into$$($cljs$core$PersistentHashMap$EMPTY$$, $coll$$337_l$$inline_1054$$), $G__4530$$inline_266_k$$83$$, $v$$27$$), this.$meta$) | |
} | |
if($v$$27$$ === this.$arr$[$arr$$inline_1053_idx$$13$$ + 1]) { | |
return $coll$$337_l$$inline_1054$$ | |
} | |
$G__4530$$inline_266_k$$83$$ = this.$arr$.slice(); | |
$G__4530$$inline_266_k$$83$$[$arr$$inline_1053_idx$$13$$ + 1] = $v$$27$$; | |
return new $cljs$core$PersistentArrayMap$$(this.$meta$, this.$cnt$, $G__4530$$inline_266_k$$83$$, $JSCompiler_alias_NULL$$) | |
}; | |
$JSCompiler_prototypeAlias$$.$cljs$core$IAssociative$_contains_key_QMARK_$arity$2$ = function $$JSCompiler_prototypeAlias$$$$cljs$core$IAssociative$_contains_key_QMARK_$arity$2$$($coll$$338$$, $k$$84$$) { | |
return-1 !== $cljs$core$array_map_index_of$$($coll$$338$$, $k$$84$$) | |
}; | |
/** | |
Note that the generated .call method in current master is pretty optimal in and of itself, | |
but the compiler can't directly dispatch to arities from outside. | |
*/ | |
$JSCompiler_prototypeAlias$$.call = function() { | |
var $G__4531$$ = $JSCompiler_alias_NULL$$; | |
return $G__4531$$ = function $$G__4531$$$($G__4531$$, $k$$87$$, $not_found$$37$$) { | |
switch(arguments.length) { | |
case 2: | |
return this.$cljs$core$ILookup$_lookup$arity$2$(this, $k$$87$$); | |
case 3: | |
return this.$cljs$core$ILookup$_lookup$arity$3$(this, $k$$87$$, $not_found$$37$$) | |
} | |
$JSCompiler_alias_THROW$$(Error("Invalid arity: " + arguments.length)) | |
} | |
}(); | |
$JSCompiler_prototypeAlias$$.apply = function $$JSCompiler_prototypeAlias$$$apply$($self__$$261$$, $args4529$$) { | |
$self__$$261$$ = this; | |
return $self__$$261$$.call.apply($self__$$261$$, [$self__$$261$$].concat($args4529$$.slice())) | |
}; | |
$JSCompiler_prototypeAlias$$.$cljs$core$ICollection$_conj$arity$2$ = function $$JSCompiler_prototypeAlias$$$$cljs$core$ICollection$_conj$arity$2$$($coll$$342$$, $entry$$2$$) { | |
return $cljs$core$vector_QMARK_$$($entry$$2$$) ? $coll$$342$$.$cljs$core$IAssociative$_assoc$arity$3$($coll$$342$$, $cljs$core$_nth$$.$cljs$core$IFn$_invoke$arity$2$($entry$$2$$, 0), $cljs$core$_nth$$.$cljs$core$IFn$_invoke$arity$2$($entry$$2$$, 1)) : $cljs$core$reduce$$.$cljs$core$IFn$_invoke$arity$3$($cljs$core$_conj$$, $coll$$342$$, $entry$$2$$) | |
}; | |
$JSCompiler_prototypeAlias$$.toString = function $$JSCompiler_prototypeAlias$$$toString$() { | |
return $cljs$core$pr_str_STAR_$$(this) | |
}; | |
$JSCompiler_prototypeAlias$$.$cljs$core$ISeqable$_seq$arity$1$ = function $$JSCompiler_prototypeAlias$$$$cljs$core$ISeqable$_seq$arity$1$$() { | |
var $self__$$265$$ = this; | |
return 0 < $self__$$265$$.$cnt$ ? function($len$$15$$) { | |
return function array_map_seq$$1($i$$102$$) { | |
return new $cljs$core$LazySeq$$($JSCompiler_alias_NULL$$, $JSCompiler_alias_FALSE$$, function($len$$15$$) { | |
return function() { | |
return $i$$102$$ < $len$$15$$ ? $cljs$core$cons$$($cljs$core$PersistentVector$fromArray$$([$self__$$265$$.$arr$[$i$$102$$], $self__$$265$$.$arr$[$i$$102$$ + 1]]), array_map_seq$$1($i$$102$$ + 2)) : $JSCompiler_alias_NULL$$ | |
} | |
}($len$$15$$), $JSCompiler_alias_NULL$$) | |
} | |
}($self__$$265$$.$arr$.length)(0) : $JSCompiler_alias_NULL$$ | |
}; | |
$JSCompiler_prototypeAlias$$.$cljs$core$ICounted$_count$arity$1$ = $JSCompiler_get$$("$cnt$"); | |
$JSCompiler_prototypeAlias$$.$cljs$core$IEquiv$_equiv$arity$2$ = function $$JSCompiler_prototypeAlias$$$$cljs$core$IEquiv$_equiv$arity$2$$($coll$$346$$, $other$$21$$) { | |
return $cljs$core$equiv_map$$($coll$$346$$, $other$$21$$) | |
}; | |
$JSCompiler_prototypeAlias$$.$cljs$core$IWithMeta$_with_meta$arity$2$ = function $$JSCompiler_prototypeAlias$$$$cljs$core$IWithMeta$_with_meta$arity$2$$($coll$$347$$, $meta__$1$$9$$) { | |
return new $cljs$core$PersistentArrayMap$$($meta__$1$$9$$, this.$cnt$, this.$arr$, this.$__hash$) | |
}; | |
$JSCompiler_prototypeAlias$$.$cljs$core$IMeta$_meta$arity$1$ = $JSCompiler_get$$("$meta$"); | |
$JSCompiler_prototypeAlias$$.$cljs$core$IEmptyableCollection$_empty$arity$1$ = function $$JSCompiler_prototypeAlias$$$$cljs$core$IEmptyableCollection$_empty$arity$1$$() { | |
return $cljs$core$_with_meta$$($cljs$core$PersistentArrayMap$EMPTY$$, this.$meta$) | |
}; | |
$JSCompiler_prototypeAlias$$.$cljs$core$IMap$_dissoc$arity$2$ = function $$JSCompiler_prototypeAlias$$$$cljs$core$IMap$_dissoc$arity$2$$($coll$$350$$, $k$$88$$) { | |
if(0 <= $cljs$core$array_map_index_of$$($coll$$350$$, $k$$88$$)) { | |
var $len$$17$$ = this.$arr$.length, $new_arr_new_len$$ = $len$$17$$ - 2; | |
if(0 === $new_arr_new_len$$) { | |
return $coll$$350$$.$cljs$core$IEmptyableCollection$_empty$arity$1$($coll$$350$$) | |
} | |
for(var $new_arr_new_len$$ = Array($new_arr_new_len$$), $s$$66$$ = 0, $G__4535_G__4537_d$$33$$ = 0;;) { | |
if($s$$66$$ >= $len$$17$$) { | |
return new $cljs$core$PersistentArrayMap$$(this.$meta$, this.$cnt$ - 1, $new_arr_new_len$$, $JSCompiler_alias_NULL$$) | |
} | |
$cljs$core$_EQ_$$.$cljs$core$IFn$_invoke$arity$2$($k$$88$$, this.$arr$[$s$$66$$]) || ($new_arr_new_len$$[$G__4535_G__4537_d$$33$$] = this.$arr$[$s$$66$$], $new_arr_new_len$$[$G__4535_G__4537_d$$33$$ + 1] = this.$arr$[$s$$66$$ + 1], $G__4535_G__4537_d$$33$$ += 2); | |
$s$$66$$ += 2 | |
} | |
}else { | |
return $coll$$350$$ | |
} | |
}; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function $cljs$core$PersistentArrayMap$$($meta$$20$$, $cnt$$9$$, $arr$$73$$, $__hash$$11$$) { | |
this.$meta$ = $meta$$20$$; | |
this.$cnt$ = $cnt$$9$$; | |
this.$arr$ = $arr$$73$$; | |
this.$__hash$ = $__hash$$11$$; | |
this.$cljs$lang$protocol_mask$partition1$$ = 4; | |
this.$cljs$lang$protocol_mask$partition0$$ = 16123663 | |
} | |
var $specify_target4747_4749$$ = $cljs$core$PersistentArrayMap$$.prototype; | |
$specify_target4747_4749$$.toString = function $$specify_target4747_4749$$$toString$() { | |
return $cljs$core$pr_str_STAR_$$(this) | |
}; | |
$specify_target4747_4749$$.$cljs$core$IEditableCollection$_as_transient$arity$1$ = function $$specify_target4747_4749$$$$cljs$core$IEditableCollection$_as_transient$arity$1$$() { | |
return new $cljs$core$TransientArrayMap$$({}, this.$arr$.length, this.$arr$.slice()) | |
}; | |
$specify_target4747_4749$$.$cljs$core$IHash$_hash$arity$1$ = function $$specify_target4747_4749$$$$cljs$core$IHash$_hash$arity$1$$($coll$$332_h__2444__auto____$1$$10$$) { | |
var $h__2444__auto__$$10$$ = this.$__hash$; | |
return $h__2444__auto__$$10$$ != $JSCompiler_alias_NULL$$ ? $h__2444__auto__$$10$$ : this.$__hash$ = $coll$$332_h__2444__auto____$1$$10$$ = $cljs$core$hash_imap$$($coll$$332_h__2444__auto____$1$$10$$) | |
}; | |
$specify_target4747_4749$$.$cljs$core$ILookup$_lookup$arity$3$ = function $$specify_target4747_4749$$$$cljs$core$ILookup$_lookup$arity$3$$($coll$$333_idx$$12$$, $k$$77$$, $not_found$$28$$) { | |
$coll$$333_idx$$12$$ = $cljs$core$array_map_index_of$$($coll$$333_idx$$12$$, $k$$77$$); | |
return-1 === $coll$$333_idx$$12$$ ? $not_found$$28$$ : this.$arr$[$coll$$333_idx$$12$$ + 1] | |
}; | |
$specify_target4747_4749$$.$cljs$core$ILookup$_lookup$arity$2$ = function $$specify_target4747_4749$$$$cljs$core$ILookup$_lookup$arity$2$$($coll$$334$$, $k$$78$$) { | |
return $cljs$core$_lookup$$.$cljs$core$IFn$_invoke$arity$3$($coll$$334$$, $k$$78$$, $JSCompiler_alias_NULL$$) | |
}; | |
$specify_target4747_4749$$.$cljs$core$IAssociative$_assoc$arity$3$ = function $$specify_target4747_4749$$$$cljs$core$IAssociative$_assoc$arity$3$$($coll$$335_l$$inline_1071$$, $G__4748$$inline_263_k$$79$$, $v$$27$$) { | |
var $arr$$inline_1070_idx$$13$$ = $cljs$core$array_map_index_of$$($coll$$335_l$$inline_1071$$, $G__4748$$inline_263_k$$79$$); | |
if(-1 === $arr$$inline_1070_idx$$13$$) { | |
if(this.$cnt$ < $cljs$core$PersistentArrayMap$HASHMAP_THRESHOLD$$) { | |
$arr$$inline_1070_idx$$13$$ = $coll$$335_l$$inline_1071$$.$arr$; | |
$coll$$335_l$$inline_1071$$ = $arr$$inline_1070_idx$$13$$.length; | |
for(var $narr$$inline_1072$$ = Array($coll$$335_l$$inline_1071$$ + 2), $i_4745$$inline_1073$$ = 0;;) { | |
if($i_4745$$inline_1073$$ < $coll$$335_l$$inline_1071$$) { | |
$narr$$inline_1072$$[$i_4745$$inline_1073$$] = $arr$$inline_1070_idx$$13$$[$i_4745$$inline_1073$$], $i_4745$$inline_1073$$ += 1 | |
}else { | |
break | |
} | |
} | |
$narr$$inline_1072$$[$coll$$335_l$$inline_1071$$] = $G__4748$$inline_263_k$$79$$; | |
$narr$$inline_1072$$[$coll$$335_l$$inline_1071$$ + 1] = $v$$27$$; | |
return new $cljs$core$PersistentArrayMap$$(this.$meta$, this.$cnt$ + 1, $narr$$inline_1072$$, $JSCompiler_alias_NULL$$) | |
} | |
return $cljs$core$_with_meta$$($cljs$core$_assoc$$($cljs$core$into$$($cljs$core$PersistentHashMap$EMPTY$$, $coll$$335_l$$inline_1071$$), $G__4748$$inline_263_k$$79$$, $v$$27$$), this.$meta$) | |
} | |
if($v$$27$$ === this.$arr$[$arr$$inline_1070_idx$$13$$ + 1]) { | |
return $coll$$335_l$$inline_1071$$ | |
} | |
$G__4748$$inline_263_k$$79$$ = this.$arr$.slice(); | |
$G__4748$$inline_263_k$$79$$[$arr$$inline_1070_idx$$13$$ + 1] = $v$$27$$; | |
return new $cljs$core$PersistentArrayMap$$(this.$meta$, this.$cnt$, $G__4748$$inline_263_k$$79$$, $JSCompiler_alias_NULL$$) | |
}; | |
$specify_target4747_4749$$.$cljs$core$IAssociative$_contains_key_QMARK_$arity$2$ = function $$specify_target4747_4749$$$$cljs$core$IAssociative$_contains_key_QMARK_$arity$2$$($coll$$336$$, $k$$80$$) { | |
return-1 !== $cljs$core$array_map_index_of$$($coll$$336$$, $k$$80$$) | |
}; | |
/** | |
The generated .call for specify is worse, since it dispatches through this again, | |
OTOH, the arity methods should be use most of the time. | |
*/ | |
$specify_target4747_4749$$.call = function() { | |
var $G__4750$$ = $JSCompiler_alias_NULL$$; | |
return $G__4750$$ = function $$G__4750$$$($G__4750$$, $arg_2$$32$$, $arg_3$$16$$) { | |
switch(arguments.length) { | |
case 2: | |
return this.$cljs$core$IFn$_invoke$arity$1$($arg_2$$32$$); | |
case 3: | |
return this.$cljs$core$IFn$_invoke$arity$2$($arg_2$$32$$, $arg_3$$16$$) | |
} | |
$JSCompiler_alias_THROW$$(Error("Invalid arity: " + arguments.length)) | |
} | |
}(); | |
$specify_target4747_4749$$.$cljs$lang$maxFixedArity$ = 2; | |
$specify_target4747_4749$$.$cljs$lang$applyTo$ = function $$specify_target4747_4749$$$$cljs$lang$applyTo$$($args__2512__auto__$$8$$) { | |
return $cljs$core$apply_to$$(this, $cljs$core$count$$($args__2512__auto__$$8$$), $args__2512__auto__$$8$$) | |
}; | |
$specify_target4747_4749$$.$cljs$core$IFn$_invoke$arity$2$ = function $$specify_target4747_4749$$$$cljs$core$IFn$_invoke$arity$2$$($arg_1$$40$$, $arg_2$$33$$) { | |
return $cljs$core$_lookup$$.$cljs$core$IFn$_invoke$arity$3$(this, $arg_1$$40$$, $arg_2$$33$$) | |
}; | |
$specify_target4747_4749$$.$cljs$core$IFn$_invoke$arity$1$ = function $$specify_target4747_4749$$$$cljs$core$IFn$_invoke$arity$1$$($arg_1$$41$$) { | |
return $cljs$core$_lookup$$.$cljs$core$IFn$_invoke$arity$2$(this, $arg_1$$41$$) | |
}; | |
$specify_target4747_4749$$.$cljs$core$IKVReduce$_kv_reduce$arity$3$ = function $$specify_target4747_4749$$$$cljs$core$IKVReduce$_kv_reduce$arity$3$$($coll$$339_len$$13$$, $f$$142$$, $G__4752_init$$5_init__$1$$3$$) { | |
$coll$$339_len$$13$$ = this.$arr$.length; | |
for(var $i$$101$$ = 0;;) { | |
if($i$$101$$ < $coll$$339_len$$13$$) { | |
$G__4752_init$$5_init__$1$$3$$ = $f$$142$$.$cljs$core$IFn$_invoke$arity$3$ ? $f$$142$$.$cljs$core$IFn$_invoke$arity$3$($G__4752_init$$5_init__$1$$3$$, this.$arr$[$i$$101$$], this.$arr$[$i$$101$$ + 1]) : $f$$142$$.call($JSCompiler_alias_NULL$$, $G__4752_init$$5_init__$1$$3$$, this.$arr$[$i$$101$$], this.$arr$[$i$$101$$ + 1]), $i$$101$$ += 2 | |
}else { | |
return $G__4752_init$$5_init__$1$$3$$ | |
} | |
} | |
}; | |
$specify_target4747_4749$$.$cljs$core$ICollection$_conj$arity$2$ = function $$specify_target4747_4749$$$$cljs$core$ICollection$_conj$arity$2$$($coll$$340$$, $entry$$2$$) { | |
return $cljs$core$vector_QMARK_$$($entry$$2$$) ? $cljs$core$_assoc$$($coll$$340$$, $cljs$core$_nth$$.$cljs$core$IFn$_invoke$arity$2$($entry$$2$$, 0), $cljs$core$_nth$$.$cljs$core$IFn$_invoke$arity$2$($entry$$2$$, 1)) : $cljs$core$reduce$$.$cljs$core$IFn$_invoke$arity$3$($cljs$core$_conj$$, $coll$$340$$, $entry$$2$$) | |
}; | |
$specify_target4747_4749$$.$cljs$core$ISeqable$_seq$arity$1$ = function $$specify_target4747_4749$$$$cljs$core$ISeqable$_seq$arity$1$$() { | |
var $self__$$261$$ = this; | |
return 0 < $self__$$261$$.$cnt$ ? function($len$$15$$) { | |
return function array_map_seq$$1($i$$102$$) { | |
return new $cljs$core$LazySeq$$($JSCompiler_alias_NULL$$, $JSCompiler_alias_FALSE$$, function($len$$15$$) { | |
return function() { | |
return $i$$102$$ < $len$$15$$ ? $cljs$core$cons$$($cljs$core$PersistentVector$fromArray$$([$self__$$261$$.$arr$[$i$$102$$], $self__$$261$$.$arr$[$i$$102$$ + 1]]), array_map_seq$$1($i$$102$$ + 2)) : $JSCompiler_alias_NULL$$ | |
} | |
}($len$$15$$), $JSCompiler_alias_NULL$$) | |
} | |
}($self__$$261$$.$arr$.length)(0) : $JSCompiler_alias_NULL$$ | |
}; | |
$specify_target4747_4749$$.$cljs$core$ICounted$_count$arity$1$ = $JSCompiler_get$$("$cnt$"); | |
$specify_target4747_4749$$.$cljs$core$IEquiv$_equiv$arity$2$ = function $$specify_target4747_4749$$$$cljs$core$IEquiv$_equiv$arity$2$$($coll$$343$$, $other$$21$$) { | |
return $cljs$core$equiv_map$$($coll$$343$$, $other$$21$$) | |
}; | |
$specify_target4747_4749$$.$cljs$core$IWithMeta$_with_meta$arity$2$ = function $$specify_target4747_4749$$$$cljs$core$IWithMeta$_with_meta$arity$2$$($coll$$344$$, $meta__$1$$9$$) { | |
return new $cljs$core$PersistentArrayMap$$($meta__$1$$9$$, this.$cnt$, this.$arr$, this.$__hash$) | |
}; | |
$specify_target4747_4749$$.$cljs$core$IMeta$_meta$arity$1$ = $JSCompiler_get$$("$meta$"); | |
$specify_target4747_4749$$.$cljs$core$IEmptyableCollection$_empty$arity$1$ = function $$specify_target4747_4749$$$$cljs$core$IEmptyableCollection$_empty$arity$1$$() { | |
return $cljs$core$_with_meta$$($cljs$core$PersistentArrayMap$EMPTY$$, this.$meta$) | |
}; | |
$specify_target4747_4749$$.$cljs$core$IMap$_dissoc$arity$2$ = function $$specify_target4747_4749$$$$cljs$core$IMap$_dissoc$arity$2$$($coll$$347$$, $k$$83$$) { | |
if(0 <= $cljs$core$array_map_index_of$$($coll$$347$$, $k$$83$$)) { | |
var $len$$17$$ = this.$arr$.length, $new_arr_new_len$$ = $len$$17$$ - 2; | |
if(0 === $new_arr_new_len$$) { | |
return $cljs$core$_empty$$($coll$$347$$) | |
} | |
for(var $new_arr_new_len$$ = Array($new_arr_new_len$$), $s$$66$$ = 0, $G__4754_G__4756_d$$33$$ = 0;;) { | |
if($s$$66$$ >= $len$$17$$) { | |
return new $cljs$core$PersistentArrayMap$$(this.$meta$, this.$cnt$ - 1, $new_arr_new_len$$, $JSCompiler_alias_NULL$$) | |
} | |
$cljs$core$_EQ_$$.$cljs$core$IFn$_invoke$arity$2$($k$$83$$, this.$arr$[$s$$66$$]) || ($new_arr_new_len$$[$G__4754_G__4756_d$$33$$] = this.$arr$[$s$$66$$], $new_arr_new_len$$[$G__4754_G__4756_d$$33$$ + 1] = this.$arr$[$s$$66$$ + 1], $G__4754_G__4756_d$$33$$ += 2); | |
$s$$66$$ += 2 | |
} | |
}else { | |
return $coll$$347$$ | |
} | |
}; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment