400 lines
16 KiB
JavaScript
400 lines
16 KiB
JavaScript
// Compiled by ClojureScript 1.9.229 {}
|
|
goog.provide('re_com.util');
|
|
goog.require('cljs.core');
|
|
goog.require('clojure.set');
|
|
goog.require('reagent.ratom');
|
|
goog.require('goog.date.DateTime');
|
|
goog.require('goog.date.UtcDateTime');
|
|
/**
|
|
* Takes a function 'f' amd a map 'm'. Applies 'f' to each value in 'm' and returns.
|
|
* (fmap inc {:a 4 :b 2}) => {:a 5 :b 3}
|
|
*/
|
|
re_com.util.fmap = (function re_com$util$fmap(f,m){
|
|
return cljs.core.into.call(null,cljs.core.PersistentArrayMap.EMPTY,(function (){var iter__25910__auto__ = (function re_com$util$fmap_$_iter__26710(s__26711){
|
|
return (new cljs.core.LazySeq(null,(function (){
|
|
var s__26711__$1 = s__26711;
|
|
while(true){
|
|
var temp__4657__auto__ = cljs.core.seq.call(null,s__26711__$1);
|
|
if(temp__4657__auto__){
|
|
var s__26711__$2 = temp__4657__auto__;
|
|
if(cljs.core.chunked_seq_QMARK_.call(null,s__26711__$2)){
|
|
var c__25908__auto__ = cljs.core.chunk_first.call(null,s__26711__$2);
|
|
var size__25909__auto__ = cljs.core.count.call(null,c__25908__auto__);
|
|
var b__26713 = cljs.core.chunk_buffer.call(null,size__25909__auto__);
|
|
if((function (){var i__26712 = (0);
|
|
while(true){
|
|
if((i__26712 < size__25909__auto__)){
|
|
var vec__26720 = cljs.core._nth.call(null,c__25908__auto__,i__26712);
|
|
var k = cljs.core.nth.call(null,vec__26720,(0),null);
|
|
var val = cljs.core.nth.call(null,vec__26720,(1),null);
|
|
cljs.core.chunk_append.call(null,b__26713,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [k,f.call(null,val)], null));
|
|
|
|
var G__26726 = (i__26712 + (1));
|
|
i__26712 = G__26726;
|
|
continue;
|
|
} else {
|
|
return true;
|
|
}
|
|
break;
|
|
}
|
|
})()){
|
|
return cljs.core.chunk_cons.call(null,cljs.core.chunk.call(null,b__26713),re_com$util$fmap_$_iter__26710.call(null,cljs.core.chunk_rest.call(null,s__26711__$2)));
|
|
} else {
|
|
return cljs.core.chunk_cons.call(null,cljs.core.chunk.call(null,b__26713),null);
|
|
}
|
|
} else {
|
|
var vec__26723 = cljs.core.first.call(null,s__26711__$2);
|
|
var k = cljs.core.nth.call(null,vec__26723,(0),null);
|
|
var val = cljs.core.nth.call(null,vec__26723,(1),null);
|
|
return cljs.core.cons.call(null,new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [k,f.call(null,val)], null),re_com$util$fmap_$_iter__26710.call(null,cljs.core.rest.call(null,s__26711__$2)));
|
|
}
|
|
} else {
|
|
return null;
|
|
}
|
|
break;
|
|
}
|
|
}),null,null));
|
|
});
|
|
return iter__25910__auto__.call(null,m);
|
|
})());
|
|
});
|
|
/**
|
|
* Recursively merges maps. If vals are not maps, the last value wins.
|
|
*/
|
|
re_com.util.deep_merge = (function re_com$util$deep_merge(var_args){
|
|
var args__26212__auto__ = [];
|
|
var len__26205__auto___26728 = arguments.length;
|
|
var i__26206__auto___26729 = (0);
|
|
while(true){
|
|
if((i__26206__auto___26729 < len__26205__auto___26728)){
|
|
args__26212__auto__.push((arguments[i__26206__auto___26729]));
|
|
|
|
var G__26730 = (i__26206__auto___26729 + (1));
|
|
i__26206__auto___26729 = G__26730;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__26213__auto__ = ((((0) < args__26212__auto__.length))?(new cljs.core.IndexedSeq(args__26212__auto__.slice((0)),(0),null)):null);
|
|
return re_com.util.deep_merge.cljs$core$IFn$_invoke$arity$variadic(argseq__26213__auto__);
|
|
});
|
|
|
|
re_com.util.deep_merge.cljs$core$IFn$_invoke$arity$variadic = (function (vals){
|
|
if(cljs.core.every_QMARK_.call(null,cljs.core.map_QMARK_,vals)){
|
|
return cljs.core.apply.call(null,cljs.core.merge_with,re_com.util.deep_merge,vals);
|
|
} else {
|
|
return cljs.core.last.call(null,vals);
|
|
}
|
|
});
|
|
|
|
re_com.util.deep_merge.cljs$lang$maxFixedArity = (0);
|
|
|
|
re_com.util.deep_merge.cljs$lang$applyTo = (function (seq26727){
|
|
return re_com.util.deep_merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.seq.call(null,seq26727));
|
|
});
|
|
|
|
/**
|
|
* Takes a value or an atom
|
|
* If it's a value, returns it
|
|
* If it's a Reagent object that supports IDeref, returns the value inside it by derefing
|
|
*
|
|
*/
|
|
re_com.util.deref_or_value = (function re_com$util$deref_or_value(val_or_atom){
|
|
if(((!((val_or_atom == null)))?((((val_or_atom.cljs$lang$protocol_mask$partition0$ & (32768))) || (val_or_atom.cljs$core$IDeref$))?true:(((!val_or_atom.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_.call(null,cljs.core.IDeref,val_or_atom):false)):cljs.core.native_satisfies_QMARK_.call(null,cljs.core.IDeref,val_or_atom))){
|
|
return cljs.core.deref.call(null,val_or_atom);
|
|
} else {
|
|
return val_or_atom;
|
|
}
|
|
});
|
|
/**
|
|
* Takes a value or an atom
|
|
* If it's a value, returns it
|
|
* If it's a Reagent object that supports IDeref, returns the value inside it, but WITHOUT derefing
|
|
*
|
|
* The arg validation code uses this, since calling deref-or-value adds this arg to the watched ratom list for the component
|
|
* in question, which in turn can cause different rendering behaviour between dev (where we validate) and prod (where we don't).
|
|
*
|
|
* This was experienced in popover-content-wrapper with the position-injected atom which was not derefed there, however
|
|
* the dev-only validation caused it to be derefed, modifying its render behaviour and causing mayhem and madness for the developer.
|
|
*
|
|
* See below that different Reagent types have different ways of retrieving the value without causing capture, although in the case of
|
|
* Track, we just deref it as there is no peek or state, so hopefully this won't cause issues (surely this is used very rarely).
|
|
*
|
|
*/
|
|
re_com.util.deref_or_value_peek = (function re_com$util$deref_or_value_peek(val_or_atom){
|
|
if(((!((val_or_atom == null)))?((((val_or_atom.cljs$lang$protocol_mask$partition0$ & (32768))) || (val_or_atom.cljs$core$IDeref$))?true:(((!val_or_atom.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_.call(null,cljs.core.IDeref,val_or_atom):false)):cljs.core.native_satisfies_QMARK_.call(null,cljs.core.IDeref,val_or_atom))){
|
|
if((val_or_atom instanceof reagent.ratom.RAtom)){
|
|
return val_or_atom.state;
|
|
} else {
|
|
if((val_or_atom instanceof reagent.ratom.Reaction)){
|
|
return val_or_atom._peek_at();
|
|
} else {
|
|
if((val_or_atom instanceof reagent.ratom.RCursor)){
|
|
return val_or_atom._peek();
|
|
} else {
|
|
if((val_or_atom instanceof reagent.ratom.Track)){
|
|
return cljs.core.deref.call(null,val_or_atom);
|
|
} else {
|
|
if((val_or_atom instanceof reagent.ratom.Wrapper)){
|
|
return val_or_atom.state;
|
|
} else {
|
|
throw (new Error("Unknown reactive data type"));
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
return val_or_atom;
|
|
}
|
|
});
|
|
re_com.util.get_element_by_id = (function re_com$util$get_element_by_id(id){
|
|
return document.getElementById(id);
|
|
});
|
|
/**
|
|
* Left pad a string 's' with '0', until 's' has length 'len'. Return 's' unchanged, if it is already len or greater
|
|
*/
|
|
re_com.util.pad_zero = (function re_com$util$pad_zero(s,len){
|
|
if((cljs.core.count.call(null,s) < len)){
|
|
return cljs.core.apply.call(null,cljs.core.str,cljs.core.take_last.call(null,len,cljs.core.concat.call(null,cljs.core.repeat.call(null,len,"0"),s)));
|
|
} else {
|
|
return s;
|
|
}
|
|
});
|
|
/**
|
|
* return 'num' as a string of 'len' characters, left padding with '0' as necessary
|
|
*/
|
|
re_com.util.pad_zero_number = (function re_com$util$pad_zero_number(num,len){
|
|
return re_com.util.pad_zero.call(null,[cljs.core.str(num)].join(''),len);
|
|
});
|
|
/**
|
|
* takes a number (and optional :negative keyword to indicate a negative value) and returns that number as a string with 'px' at the end
|
|
*/
|
|
re_com.util.px = (function re_com$util$px(var_args){
|
|
var args__26212__auto__ = [];
|
|
var len__26205__auto___26737 = arguments.length;
|
|
var i__26206__auto___26738 = (0);
|
|
while(true){
|
|
if((i__26206__auto___26738 < len__26205__auto___26737)){
|
|
args__26212__auto__.push((arguments[i__26206__auto___26738]));
|
|
|
|
var G__26739 = (i__26206__auto___26738 + (1));
|
|
i__26206__auto___26738 = G__26739;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__26213__auto__ = ((((1) < args__26212__auto__.length))?(new cljs.core.IndexedSeq(args__26212__auto__.slice((1)),(0),null)):null);
|
|
return re_com.util.px.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),argseq__26213__auto__);
|
|
});
|
|
|
|
re_com.util.px.cljs$core$IFn$_invoke$arity$variadic = (function (val,negative){
|
|
return [cljs.core.str((cljs.core.truth_(negative)?(- val):val)),cljs.core.str("px")].join('');
|
|
});
|
|
|
|
re_com.util.px.cljs$lang$maxFixedArity = (1);
|
|
|
|
re_com.util.px.cljs$lang$applyTo = (function (seq26735){
|
|
var G__26736 = cljs.core.first.call(null,seq26735);
|
|
var seq26735__$1 = cljs.core.next.call(null,seq26735);
|
|
return re_com.util.px.cljs$core$IFn$_invoke$arity$variadic(G__26736,seq26735__$1);
|
|
});
|
|
|
|
/**
|
|
* Removes the item at position n from a vector v, returning a shrunk vector
|
|
*/
|
|
re_com.util.remove_nth = (function re_com$util$remove_nth(v,n){
|
|
return cljs.core.vec.call(null,cljs.core.concat.call(null,cljs.core.subvec.call(null,v,(0),n),cljs.core.subvec.call(null,v,(n + (1)),cljs.core.count.call(null,v))));
|
|
});
|
|
re_com.util.insert_nth = (function re_com$util$insert_nth(vect,index,item){
|
|
return cljs.core.apply.call(null,cljs.core.merge,cljs.core.subvec.call(null,vect,(0),index),item,cljs.core.subvec.call(null,vect,index));
|
|
});
|
|
/**
|
|
* Takes a vector of maps 'v'. Returns the position of the first item in 'v' whose id-fn (default :id) matches 'id'.
|
|
* Returns nil if id not found
|
|
*/
|
|
re_com.util.position_for_id = (function re_com$util$position_for_id(var_args){
|
|
var args__26212__auto__ = [];
|
|
var len__26205__auto___26746 = arguments.length;
|
|
var i__26206__auto___26747 = (0);
|
|
while(true){
|
|
if((i__26206__auto___26747 < len__26205__auto___26746)){
|
|
args__26212__auto__.push((arguments[i__26206__auto___26747]));
|
|
|
|
var G__26748 = (i__26206__auto___26747 + (1));
|
|
i__26206__auto___26747 = G__26748;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__26213__auto__ = ((((2) < args__26212__auto__.length))?(new cljs.core.IndexedSeq(args__26212__auto__.slice((2)),(0),null)):null);
|
|
return re_com.util.position_for_id.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__26213__auto__);
|
|
});
|
|
|
|
re_com.util.position_for_id.cljs$core$IFn$_invoke$arity$variadic = (function (id,v,p__26743){
|
|
var map__26744 = p__26743;
|
|
var map__26744__$1 = ((((!((map__26744 == null)))?((((map__26744.cljs$lang$protocol_mask$partition0$ & (64))) || (map__26744.cljs$core$ISeq$))?true:false):false))?cljs.core.apply.call(null,cljs.core.hash_map,map__26744):map__26744);
|
|
var id_fn = cljs.core.get.call(null,map__26744__$1,new cljs.core.Keyword(null,"id-fn","id-fn",316222798),new cljs.core.Keyword(null,"id","id",-1388402092));
|
|
var index_fn = ((function (map__26744,map__26744__$1,id_fn){
|
|
return (function (index,item){
|
|
if(cljs.core._EQ_.call(null,id_fn.call(null,item),id)){
|
|
return index;
|
|
} else {
|
|
return null;
|
|
}
|
|
});})(map__26744,map__26744__$1,id_fn))
|
|
;
|
|
return cljs.core.first.call(null,cljs.core.keep_indexed.call(null,index_fn,v));
|
|
});
|
|
|
|
re_com.util.position_for_id.cljs$lang$maxFixedArity = (2);
|
|
|
|
re_com.util.position_for_id.cljs$lang$applyTo = (function (seq26740){
|
|
var G__26741 = cljs.core.first.call(null,seq26740);
|
|
var seq26740__$1 = cljs.core.next.call(null,seq26740);
|
|
var G__26742 = cljs.core.first.call(null,seq26740__$1);
|
|
var seq26740__$2 = cljs.core.next.call(null,seq26740__$1);
|
|
return re_com.util.position_for_id.cljs$core$IFn$_invoke$arity$variadic(G__26741,G__26742,seq26740__$2);
|
|
});
|
|
|
|
/**
|
|
* Takes a vector of maps 'v'. Returns the first item in 'v' whose id-fn (default :id) matches 'id'.
|
|
* Returns nil if id not found
|
|
*/
|
|
re_com.util.item_for_id = (function re_com$util$item_for_id(var_args){
|
|
var args__26212__auto__ = [];
|
|
var len__26205__auto___26756 = arguments.length;
|
|
var i__26206__auto___26757 = (0);
|
|
while(true){
|
|
if((i__26206__auto___26757 < len__26205__auto___26756)){
|
|
args__26212__auto__.push((arguments[i__26206__auto___26757]));
|
|
|
|
var G__26758 = (i__26206__auto___26757 + (1));
|
|
i__26206__auto___26757 = G__26758;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__26213__auto__ = ((((2) < args__26212__auto__.length))?(new cljs.core.IndexedSeq(args__26212__auto__.slice((2)),(0),null)):null);
|
|
return re_com.util.item_for_id.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__26213__auto__);
|
|
});
|
|
|
|
re_com.util.item_for_id.cljs$core$IFn$_invoke$arity$variadic = (function (id,v,p__26753){
|
|
var map__26754 = p__26753;
|
|
var map__26754__$1 = ((((!((map__26754 == null)))?((((map__26754.cljs$lang$protocol_mask$partition0$ & (64))) || (map__26754.cljs$core$ISeq$))?true:false):false))?cljs.core.apply.call(null,cljs.core.hash_map,map__26754):map__26754);
|
|
var id_fn = cljs.core.get.call(null,map__26754__$1,new cljs.core.Keyword(null,"id-fn","id-fn",316222798),new cljs.core.Keyword(null,"id","id",-1388402092));
|
|
return cljs.core.first.call(null,cljs.core.filter.call(null,((function (map__26754,map__26754__$1,id_fn){
|
|
return (function (p1__26749_SHARP_){
|
|
return cljs.core._EQ_.call(null,id_fn.call(null,p1__26749_SHARP_),id);
|
|
});})(map__26754,map__26754__$1,id_fn))
|
|
,v));
|
|
});
|
|
|
|
re_com.util.item_for_id.cljs$lang$maxFixedArity = (2);
|
|
|
|
re_com.util.item_for_id.cljs$lang$applyTo = (function (seq26750){
|
|
var G__26751 = cljs.core.first.call(null,seq26750);
|
|
var seq26750__$1 = cljs.core.next.call(null,seq26750);
|
|
var G__26752 = cljs.core.first.call(null,seq26750__$1);
|
|
var seq26750__$2 = cljs.core.next.call(null,seq26750__$1);
|
|
return re_com.util.item_for_id.cljs$core$IFn$_invoke$arity$variadic(G__26751,G__26752,seq26750__$2);
|
|
});
|
|
|
|
/**
|
|
* Takes a vector of maps 'v', each of which has an id-fn (default :id) key.
|
|
* Return v where item matching 'id' is excluded
|
|
*/
|
|
re_com.util.remove_id_item = (function re_com$util$remove_id_item(var_args){
|
|
var args__26212__auto__ = [];
|
|
var len__26205__auto___26766 = arguments.length;
|
|
var i__26206__auto___26767 = (0);
|
|
while(true){
|
|
if((i__26206__auto___26767 < len__26205__auto___26766)){
|
|
args__26212__auto__.push((arguments[i__26206__auto___26767]));
|
|
|
|
var G__26768 = (i__26206__auto___26767 + (1));
|
|
i__26206__auto___26767 = G__26768;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__26213__auto__ = ((((2) < args__26212__auto__.length))?(new cljs.core.IndexedSeq(args__26212__auto__.slice((2)),(0),null)):null);
|
|
return re_com.util.remove_id_item.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__26213__auto__);
|
|
});
|
|
|
|
re_com.util.remove_id_item.cljs$core$IFn$_invoke$arity$variadic = (function (id,v,p__26763){
|
|
var map__26764 = p__26763;
|
|
var map__26764__$1 = ((((!((map__26764 == null)))?((((map__26764.cljs$lang$protocol_mask$partition0$ & (64))) || (map__26764.cljs$core$ISeq$))?true:false):false))?cljs.core.apply.call(null,cljs.core.hash_map,map__26764):map__26764);
|
|
var id_fn = cljs.core.get.call(null,map__26764__$1,new cljs.core.Keyword(null,"id-fn","id-fn",316222798),new cljs.core.Keyword(null,"id","id",-1388402092));
|
|
return cljs.core.filterv.call(null,((function (map__26764,map__26764__$1,id_fn){
|
|
return (function (p1__26759_SHARP_){
|
|
return cljs.core.not_EQ_.call(null,id_fn.call(null,p1__26759_SHARP_),id);
|
|
});})(map__26764,map__26764__$1,id_fn))
|
|
,v);
|
|
});
|
|
|
|
re_com.util.remove_id_item.cljs$lang$maxFixedArity = (2);
|
|
|
|
re_com.util.remove_id_item.cljs$lang$applyTo = (function (seq26760){
|
|
var G__26761 = cljs.core.first.call(null,seq26760);
|
|
var seq26760__$1 = cljs.core.next.call(null,seq26760);
|
|
var G__26762 = cljs.core.first.call(null,seq26760__$1);
|
|
var seq26760__$2 = cljs.core.next.call(null,seq26760__$1);
|
|
return re_com.util.remove_id_item.cljs$core$IFn$_invoke$arity$variadic(G__26761,G__26762,seq26760__$2);
|
|
});
|
|
|
|
/**
|
|
* (for [[index item first? last?] (enumerate coll)] ...)
|
|
*/
|
|
re_com.util.enumerate = (function re_com$util$enumerate(coll){
|
|
var c = (cljs.core.count.call(null,coll) - (1));
|
|
var f = ((function (c){
|
|
return (function (index,item){
|
|
return new cljs.core.PersistentVector(null, 4, 5, cljs.core.PersistentVector.EMPTY_NODE, [index,item,cljs.core._EQ_.call(null,(0),index),cljs.core._EQ_.call(null,c,index)], null);
|
|
});})(c))
|
|
;
|
|
return cljs.core.map_indexed.call(null,f,coll);
|
|
});
|
|
/**
|
|
* Given a DOM node, I traverse through all ascendant nodes (until I reach body), summing any scrollLeft and scrollTop values
|
|
* and return these sums in a map
|
|
*/
|
|
re_com.util.sum_scroll_offsets = (function re_com$util$sum_scroll_offsets(node){
|
|
var current_node = node.parentNode;
|
|
var sum_scroll_left = (0);
|
|
var sum_scroll_top = (0);
|
|
while(true){
|
|
if(cljs.core.not_EQ_.call(null,current_node.tagName,"BODY")){
|
|
var G__26769 = current_node.parentNode;
|
|
var G__26770 = (sum_scroll_left + current_node.scrollLeft);
|
|
var G__26771 = (sum_scroll_top + current_node.scrollTop);
|
|
current_node = G__26769;
|
|
sum_scroll_left = G__26770;
|
|
sum_scroll_top = G__26771;
|
|
continue;
|
|
} else {
|
|
return new cljs.core.PersistentArrayMap(null, 2, [new cljs.core.Keyword(null,"left","left",-399115937),sum_scroll_left,new cljs.core.Keyword(null,"top","top",-1856271961),sum_scroll_top], null);
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
/**
|
|
* Answer a goog.date.UtcDateTime based on local date/time.
|
|
*/
|
|
re_com.util.now__GT_utc = (function re_com$util$now__GT_utc(){
|
|
var local_date = (new goog.date.DateTime());
|
|
return (new goog.date.UtcDateTime(local_date.getYear(),local_date.getMonth(),local_date.getDate(),(0),(0),(0),(0)));
|
|
});
|
|
|
|
//# sourceMappingURL=util.js.map?rel=1603199188274
|