105 lines
5.5 KiB
JavaScript
105 lines
5.5 KiB
JavaScript
goog.provide('replicant.asserts');
|
|
replicant.asserts.camel__GT_dash = (function replicant$asserts$camel__GT_dash(s){
|
|
return clojure.string.join.cljs$core$IFn$_invoke$arity$2("-",cljs.core.map.cljs$core$IFn$_invoke$arity$2(clojure.string.lower_case,cljs.core.re_seq(/[A-Z][a-z0-9]*|[a-z0-9]+/,s)));
|
|
});
|
|
replicant.asserts.camel__GT_dash_k = (function replicant$asserts$camel__GT_dash_k(k){
|
|
return cljs.core.keyword.cljs$core$IFn$_invoke$arity$1(replicant.asserts.camel__GT_dash(cljs.core.name(k)));
|
|
});
|
|
replicant.asserts.has_bad_conditional_attrs_QMARK_ = (function replicant$asserts$has_bad_conditional_attrs_QMARK_(vdom,headers){
|
|
if(((((0) < cljs.core.count((headers[(5)])))) || (((0) < cljs.core.count((vdom[(4)])))))){
|
|
var vec__49816 = (headers[(7)]);
|
|
var new_selector = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__49816,(0),null);
|
|
var new_attrs = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__49816,(1),null);
|
|
var vec__49819 = (vdom[(7)]);
|
|
var old_selector = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__49819,(0),null);
|
|
var old_attrs = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__49819,(1),null);
|
|
if(cljs.core.not_EQ_.cljs$core$IFn$_invoke$arity$2(new_selector,old_selector)){
|
|
return false;
|
|
} else {
|
|
if((new_attrs == null)){
|
|
return cljs.core.map_QMARK_(old_attrs);
|
|
} else {
|
|
if(cljs.core.map_QMARK_(new_attrs)){
|
|
return (old_attrs == null);
|
|
} else {
|
|
return false;
|
|
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
return false;
|
|
}
|
|
});
|
|
replicant.asserts.abbreviate_map = (function replicant$asserts$abbreviate_map(m,n){
|
|
return ["{",clojure.string.join.cljs$core$IFn$_invoke$arity$2(", ",cljs.core.mapv.cljs$core$IFn$_invoke$arity$2((function (p__49839){
|
|
var vec__49841 = p__49839;
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__49841,(0),null);
|
|
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__49841,(1),null);
|
|
return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(k)," ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(((cljs.core.map_QMARK_(v))?(replicant.asserts.abbreviate_map.cljs$core$IFn$_invoke$arity$2 ? replicant.asserts.abbreviate_map.cljs$core$IFn$_invoke$arity$2(v,n) : replicant.asserts.abbreviate_map.call(null,v,n)):cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([v], 0))))].join('');
|
|
}),cljs.core.take.cljs$core$IFn$_invoke$arity$2(n,m))),(((n < cljs.core.count(m)))?" ,,,":null),"}"].join('');
|
|
});
|
|
replicant.asserts.abbreviate_node = (function replicant$asserts$abbreviate_node(x){
|
|
if(replicant.hiccup.hiccup_QMARK_(x)){
|
|
return ["[",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.first(x))," ,,,]"].join('');
|
|
} else {
|
|
if((x == null)){
|
|
return "nil";
|
|
} else {
|
|
if(typeof x === 'string'){
|
|
if(((20) < ((x).length))){
|
|
return [clojure.string.join.cljs$core$IFn$_invoke$arity$1(cljs.core.take.cljs$core$IFn$_invoke$arity$2((20),x)),"..."].join('');
|
|
} else {
|
|
return x;
|
|
}
|
|
} else {
|
|
if(cljs.core.coll_QMARK_(x)){
|
|
return "(,,,)";
|
|
} else {
|
|
return cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([x], 0));
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
});
|
|
replicant.asserts.format_hiccup_part = (function replicant$asserts$format_hiccup_part(x){
|
|
if(cljs.core.map_QMARK_(x)){
|
|
return replicant.asserts.abbreviate_map(x,(2));
|
|
} else {
|
|
if(replicant.hiccup.hiccup_QMARK_(x)){
|
|
var s = cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([x], 0));
|
|
if((((s).length) < (20))){
|
|
return s;
|
|
} else {
|
|
return replicant.asserts.abbreviate_node(x);
|
|
}
|
|
} else {
|
|
if(cljs.core.coll_QMARK_(x)){
|
|
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2((1),cljs.core.count(x))){
|
|
return ["(",replicant.asserts.abbreviate_node(cljs.core.first(x)),")"].join('');
|
|
} else {
|
|
return ["(",replicant.asserts.abbreviate_node(cljs.core.first(x))," ,,,)"].join('');
|
|
}
|
|
} else {
|
|
return cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([x], 0));
|
|
|
|
}
|
|
}
|
|
}
|
|
});
|
|
replicant.asserts.convey_bad_conditional_attributes = (function replicant$asserts$convey_bad_conditional_attributes(vdom,headers){
|
|
var vec__49853 = cljs.core.first((function (){var or__5025__auto__ = cljs.core.not_empty((vdom[(3)]));
|
|
if(cljs.core.truth_(or__5025__auto__)){
|
|
return or__5025__auto__;
|
|
} else {
|
|
return cljs.core.not_empty((headers[(4)]));
|
|
}
|
|
})());
|
|
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__49853,(0),null);
|
|
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__49853,(1),null);
|
|
return ["Replicant treats nils as hints of nodes that come and go. Wrapping ","the entire attribute map in a conditional such that what used to be ",replicant.asserts.format_hiccup_part(cljs.core.second((vdom[(7)])))," is now ",replicant.asserts.format_hiccup_part(cljs.core.second((headers[(7)])))," can impair how well Replicant can match up child nodes without keys, and ","may lead to undesirable behavior for life-cycle events and transitions.\n\n","Instead of:\n[",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.first((headers[(7)])))," (when something? {",(cljs.core.truth_(k)?[cljs.core.str.cljs$core$IFn$_invoke$arity$1(k)," ",cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([v], 0))].join(''):null),"}) ,,,]\n\nConsider:\n[",cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.first((headers[(7)]))),(cljs.core.truth_(k)?["\n ","(cond-> {}\n something? (assoc ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(k)," ",cljs.core.pr_str.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([v], 0)),"))\n"].join(''):" {}")," ,,,]"].join('');
|
|
});
|
|
|
|
//# sourceMappingURL=replicant.asserts.js.map
|