datahike 0.7.1630

package/cljs.core.async.impl.timers.js

@@ -0,0 +1,510 @@
+var $CLJS = require("./cljs_env");
+var $jscomp = $CLJS.$jscomp;
+var COMPILED = false;
+require("./cljs.core.js");
+require("./cljs.core.async.impl.protocols.js");
+require("./cljs.core.async.impl.channels.js");
+require("./cljs.core.async.impl.dispatch.js");
+var environ=$CLJS.environ || ($CLJS.environ = {});
+var fress=$CLJS.fress || ($CLJS.fress = {});
+var datahike=$CLJS.datahike || ($CLJS.datahike = {});
+var clojure=$CLJS.clojure || ($CLJS.clojure = {});
+var hasch=$CLJS.hasch || ($CLJS.hasch = {});
+var tailrecursion=$CLJS.tailrecursion || ($CLJS.tailrecursion = {});
+var superv=$CLJS.superv || ($CLJS.superv = {});
+var geheimnis=$CLJS.geheimnis || ($CLJS.geheimnis = {});
+var is=$CLJS.is || ($CLJS.is = {});
+var cljs=$CLJS.cljs || ($CLJS.cljs = {});
+var cljs_node_io=$CLJS.cljs_node_io || ($CLJS.cljs_node_io = {});
+var goog=$CLJS.goog || ($CLJS.goog = {});
+var konserve=$CLJS.konserve || ($CLJS.konserve = {});
+var datalog=$CLJS.datalog || ($CLJS.datalog = {});
+var spec_tools=$CLJS.spec_tools || ($CLJS.spec_tools = {});
+var taoensso=$CLJS.taoensso || ($CLJS.taoensso = {});
+var incognito=$CLJS.incognito || ($CLJS.incognito = {});
+var medley=$CLJS.medley || ($CLJS.medley = {});
+var me=$CLJS.me || ($CLJS.me = {});
+
+$CLJS.SHADOW_ENV.setLoaded("cljs.core.async.impl.timers.js");
+
+goog.provide('cljs.core.async.impl.timers');
+cljs.core.async.impl.timers.MAX_LEVEL = (15);
+cljs.core.async.impl.timers.P = ((1) / (2));
+cljs.core.async.impl.timers.random_level = (function cljs$core$async$impl$timers$random_level(var_args){
+var G__25961 = arguments.length;
+switch (G__25961) {
+case 0:
+return cljs.core.async.impl.timers.random_level.cljs$core$IFn$_invoke$arity$0();
+
+break;
+case 1:
+return cljs.core.async.impl.timers.random_level.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+(cljs.core.async.impl.timers.random_level.cljs$core$IFn$_invoke$arity$0 = (function (){
+return cljs.core.async.impl.timers.random_level.cljs$core$IFn$_invoke$arity$1((0));
+}));
+
+(cljs.core.async.impl.timers.random_level.cljs$core$IFn$_invoke$arity$1 = (function (level){
+while(true){
+if((((Math.random() < cljs.core.async.impl.timers.P)) && ((level < cljs.core.async.impl.timers.MAX_LEVEL)))){
+var G__26054 = (level + (1));
+level = G__26054;
+continue;
+} else {
+return level;
+}
+break;
+}
+}));
+
+(cljs.core.async.impl.timers.random_level.cljs$lang$maxFixedArity = 1);
+
+
+/**
+* @constructor
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IPrintWithWriter}
+*/
+cljs.core.async.impl.timers.SkipListNode = (function (key,val,forward){
+this.key = key;
+this.val = val;
+this.forward = forward;
+this.cljs$lang$protocol_mask$partition0$ = 2155872256;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+(cljs.core.async.impl.timers.SkipListNode.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+return (new cljs.core.List(null,self__.key,(new cljs.core.List(null,self__.val,null,(1),null)),(2),null));
+}));
+
+(cljs.core.async.impl.timers.SkipListNode.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var self__ = this;
+var coll__$1 = this;
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,"["," ","]",opts,coll__$1);
+}));
+
+(cljs.core.async.impl.timers.SkipListNode.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [new cljs.core.Symbol(null,"key","key",124488940,null),cljs.core.with_meta(new cljs.core.Symbol(null,"val","val",1769233139,null),new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"mutable","mutable",875778266),true], null)),new cljs.core.Symbol(null,"forward","forward",1083186224,null)], null);
+}));
+
+(cljs.core.async.impl.timers.SkipListNode.cljs$lang$type = true);
+
+(cljs.core.async.impl.timers.SkipListNode.cljs$lang$ctorStr = "cljs.core.async.impl.timers/SkipListNode");
+
+(cljs.core.async.impl.timers.SkipListNode.cljs$lang$ctorPrWriter = (function (this__5287__auto__,writer__5288__auto__,opt__5289__auto__){
+return cljs.core._write(writer__5288__auto__,"cljs.core.async.impl.timers/SkipListNode");
+}));
+
+/**
+ * Positional factory function for cljs.core.async.impl.timers/SkipListNode.
+ */
+cljs.core.async.impl.timers.__GT_SkipListNode = (function cljs$core$async$impl$timers$__GT_SkipListNode(key,val,forward){
+return (new cljs.core.async.impl.timers.SkipListNode(key,val,forward));
+});
+
+cljs.core.async.impl.timers.skip_list_node = (function cljs$core$async$impl$timers$skip_list_node(var_args){
+var G__25986 = arguments.length;
+switch (G__25986) {
+case 1:
+return cljs.core.async.impl.timers.skip_list_node.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
+
+break;
+case 3:
+return cljs.core.async.impl.timers.skip_list_node.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+(cljs.core.async.impl.timers.skip_list_node.cljs$core$IFn$_invoke$arity$1 = (function (level){
+return cljs.core.async.impl.timers.skip_list_node.cljs$core$IFn$_invoke$arity$3(null,null,level);
+}));
+
+(cljs.core.async.impl.timers.skip_list_node.cljs$core$IFn$_invoke$arity$3 = (function (k,v,level){
+var arr = (new Array((level + (1))));
+var i_26064 = (0);
+while(true){
+if((i_26064 < arr.length)){
+(arr[i_26064] = null);
+
+var G__26065 = (i_26064 + (1));
+i_26064 = G__26065;
+continue;
+} else {
+}
+break;
+}
+
+return (new cljs.core.async.impl.timers.SkipListNode(k,v,arr));
+}));
+
+(cljs.core.async.impl.timers.skip_list_node.cljs$lang$maxFixedArity = 3);
+
+cljs.core.async.impl.timers.least_greater_node = (function cljs$core$async$impl$timers$least_greater_node(var_args){
+var G__25988 = arguments.length;
+switch (G__25988) {
+case 3:
+return cljs.core.async.impl.timers.least_greater_node.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
+
+break;
+case 4:
+return cljs.core.async.impl.timers.least_greater_node.cljs$core$IFn$_invoke$arity$4((arguments[(0)]),(arguments[(1)]),(arguments[(2)]),(arguments[(3)]));
+
+break;
+default:
+throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
+
+}
+});
+
+(cljs.core.async.impl.timers.least_greater_node.cljs$core$IFn$_invoke$arity$3 = (function (x,k,level){
+return cljs.core.async.impl.timers.least_greater_node.cljs$core$IFn$_invoke$arity$4(x,k,level,null);
+}));
+
+(cljs.core.async.impl.timers.least_greater_node.cljs$core$IFn$_invoke$arity$4 = (function (x,k,level,update){
+while(true){
+if((!((level < (0))))){
+var x__$1 = (function (){var x__$1 = x;
+while(true){
+var temp__5802__auto__ = (((level < x__$1.forward.length))?(x__$1.forward[level]):null);
+if(cljs.core.truth_(temp__5802__auto__)){
+var x_SINGLEQUOTE_ = temp__5802__auto__;
+if((x_SINGLEQUOTE_.key < k)){
+var G__26071 = x_SINGLEQUOTE_;
+x__$1 = G__26071;
+continue;
+} else {
+return x__$1;
+}
+} else {
+return x__$1;
+}
+break;
+}
+})();
+if((update == null)){
+} else {
+(update[level] = x__$1);
+}
+
+var G__26072 = x__$1;
+var G__26073 = k;
+var G__26074 = (level - (1));
+var G__26075 = update;
+x = G__26072;
+k = G__26073;
+level = G__26074;
+update = G__26075;
+continue;
+} else {
+return x;
+}
+break;
+}
+}));
+
+(cljs.core.async.impl.timers.least_greater_node.cljs$lang$maxFixedArity = 4);
+
+
+/**
+* @constructor
+ * @implements {cljs.core.ISeqable}
+ * @implements {cljs.core.IPrintWithWriter}
+*/
+cljs.core.async.impl.timers.SkipList = (function (header,level){
+this.header = header;
+this.level = level;
+this.cljs$lang$protocol_mask$partition0$ = 2155872256;
+this.cljs$lang$protocol_mask$partition1$ = 0;
+});
+(cljs.core.async.impl.timers.SkipList.prototype.put = (function (k,v){
+var self__ = this;
+var coll = this;
+var update = (new Array(cljs.core.async.impl.timers.MAX_LEVEL));
+var x = cljs.core.async.impl.timers.least_greater_node.cljs$core$IFn$_invoke$arity$4(self__.header,k,self__.level,update);
+var x__$1 = (x.forward[(0)]);
+if((((!((x__$1 == null)))) && ((x__$1.key === k)))){
+return (x__$1.val = v);
+} else {
+var new_level = cljs.core.async.impl.timers.random_level.cljs$core$IFn$_invoke$arity$0();
+if((new_level > self__.level)){
+var i_26099 = (self__.level + (1));
+while(true){
+if((i_26099 <= (new_level + (1)))){
+(update[i_26099] = self__.header);
+
+var G__26100 = (i_26099 + (1));
+i_26099 = G__26100;
+continue;
+} else {
+}
+break;
+}
+
+(self__.level = new_level);
+} else {
+}
+
+var x__$2 = cljs.core.async.impl.timers.skip_list_node.cljs$core$IFn$_invoke$arity$3(k,v,(new Array(new_level)));
+var i = (0);
+while(true){
+if((i <= self__.level)){
+var links_26105 = (update[i]).forward;
+if((i < x__$2.forward.length)){
+(x__$2.forward[i] = (links_26105[i]));
+} else {
+x__$2.forward.push((((i < links_26105.length))?(links_26105[i]):null));
+}
+
+if((i < links_26105.length)){
+(links_26105[i] = x__$2);
+} else {
+links_26105.push(x__$2);
+}
+
+var G__26108 = (i + (1));
+i = G__26108;
+continue;
+} else {
+return null;
+}
+break;
+}
+}
+}));
+
+(cljs.core.async.impl.timers.SkipList.prototype.remove = (function (k){
+var self__ = this;
+var coll = this;
+var update = (new Array(cljs.core.async.impl.timers.MAX_LEVEL));
+var x = cljs.core.async.impl.timers.least_greater_node.cljs$core$IFn$_invoke$arity$4(self__.header,k,self__.level,update);
+var x__$1 = (((x.forward.length === (0)))?null:(x.forward[(0)]));
+if((((!((x__$1 == null)))) && ((x__$1.key === k)))){
+var i_26111 = (0);
+while(true){
+if((i_26111 <= self__.level)){
+var links_26112 = (update[i_26111]).forward;
+if((x__$1 === (((i_26111 < links_26112.length))?(links_26112[i_26111]):null))){
+(links_26112[i_26111] = (x__$1.forward[i_26111]));
+
+var G__26113 = (i_26111 + (1));
+i_26111 = G__26113;
+continue;
+} else {
+var G__26114 = (i_26111 + (1));
+i_26111 = G__26114;
+continue;
+}
+} else {
+}
+break;
+}
+
+while(true){
+if(((((((0) < self__.level)) && ((self__.level < self__.header.forward.length)))) && (((self__.header.forward[self__.level]) == null)))){
+(self__.level = (self__.level - (1)));
+
+continue;
+} else {
+return null;
+}
+break;
+}
+} else {
+return null;
+}
+}));
+
+(cljs.core.async.impl.timers.SkipList.prototype.ceilingEntry = (function (k){
+var self__ = this;
+var coll = this;
+var x = self__.header;
+var level__$1 = self__.level;
+while(true){
+if((!((level__$1 < (0))))){
+var nx = (function (){var x__$1 = x;
+while(true){
+var x_SINGLEQUOTE_ = (((level__$1 < x__$1.forward.length))?(x__$1.forward[level__$1]):null);
+if((!((x_SINGLEQUOTE_ == null)))){
+if((x_SINGLEQUOTE_.key > k)){
+return x__$1;
+} else {
+var G__26117 = x_SINGLEQUOTE_;
+x__$1 = G__26117;
+continue;
+}
+} else {
+if((level__$1 === (0))){
+return x__$1;
+} else {
+return null;
+}
+}
+break;
+}
+})();
+if(cljs.core.truth_(nx)){
+var G__26118 = nx;
+var G__26119 = (level__$1 - (1));
+x = G__26118;
+level__$1 = G__26119;
+continue;
+} else {
+var G__26120 = x;
+var G__26121 = (level__$1 - (1));
+x = G__26120;
+level__$1 = G__26121;
+continue;
+}
+} else {
+if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(x.key,k)){
+return x;
+} else {
+return (x.forward[(0)]);
+}
+}
+break;
+}
+}));
+
+(cljs.core.async.impl.timers.SkipList.prototype.floorEntry = (function (k){
+var self__ = this;
+var coll = this;
+var x = self__.header;
+var level__$1 = self__.level;
+while(true){
+if((!((level__$1 < (0))))){
+var nx = (function (){var x__$1 = x;
+while(true){
+var x_SINGLEQUOTE_ = (((level__$1 < x__$1.forward.length))?(x__$1.forward[level__$1]):null);
+if((!((x_SINGLEQUOTE_ == null)))){
+if((x_SINGLEQUOTE_.key > k)){
+return x__$1;
+} else {
+var G__26125 = x_SINGLEQUOTE_;
+x__$1 = G__26125;
+continue;
+}
+} else {
+if((level__$1 === (0))){
+return x__$1;
+} else {
+return null;
+}
+}
+break;
+}
+})();
+if(cljs.core.truth_(nx)){
+var G__26127 = nx;
+var G__26128 = (level__$1 - (1));
+x = G__26127;
+level__$1 = G__26128;
+continue;
+} else {
+var G__26129 = x;
+var G__26130 = (level__$1 - (1));
+x = G__26129;
+level__$1 = G__26130;
+continue;
+}
+} else {
+if((x === self__.header)){
+return null;
+} else {
+return x;
+}
+}
+break;
+}
+}));
+
+(cljs.core.async.impl.timers.SkipList.prototype.cljs$core$ISeqable$_seq$arity$1 = (function (coll){
+var self__ = this;
+var coll__$1 = this;
+var iter = (function cljs$core$async$impl$timers$iter(node){
+return (new cljs.core.LazySeq(null,(function (){
+if((node == null)){
+return null;
+} else {
+return cljs.core.cons(new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [node.key,node.val], null),cljs$core$async$impl$timers$iter((node.forward[(0)])));
+}
+}),null,null));
+});
+return iter((self__.header.forward[(0)]));
+}));
+
+(cljs.core.async.impl.timers.SkipList.prototype.cljs$core$IPrintWithWriter$_pr_writer$arity$3 = (function (coll,writer,opts){
+var self__ = this;
+var coll__$1 = this;
+var pr_pair = (function (keyval){
+return cljs.core.pr_sequential_writer(writer,cljs.core.pr_writer,""," ","",opts,keyval);
+});
+return cljs.core.pr_sequential_writer(writer,pr_pair,"{",", ","}",opts,coll__$1);
+}));
+
+(cljs.core.async.impl.timers.SkipList.getBasis = (function (){
+return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [new cljs.core.Symbol(null,"header","header",1759972661,null),cljs.core.with_meta(new cljs.core.Symbol(null,"level","level",-1363938217,null),new cljs.core.PersistentArrayMap(null, 1, [new cljs.core.Keyword(null,"mutable","mutable",875778266),true], null))], null);
+}));
+
+(cljs.core.async.impl.timers.SkipList.cljs$lang$type = true);
+
+(cljs.core.async.impl.timers.SkipList.cljs$lang$ctorStr = "cljs.core.async.impl.timers/SkipList");
+
+(cljs.core.async.impl.timers.SkipList.cljs$lang$ctorPrWriter = (function (this__5287__auto__,writer__5288__auto__,opt__5289__auto__){
+return cljs.core._write(writer__5288__auto__,"cljs.core.async.impl.timers/SkipList");
+}));
+
+/**
+ * Positional factory function for cljs.core.async.impl.timers/SkipList.
+ */
+cljs.core.async.impl.timers.__GT_SkipList = (function cljs$core$async$impl$timers$__GT_SkipList(header,level){
+return (new cljs.core.async.impl.timers.SkipList(header,level));
+});
+
+cljs.core.async.impl.timers.skip_list = (function cljs$core$async$impl$timers$skip_list(){
+return (new cljs.core.async.impl.timers.SkipList(cljs.core.async.impl.timers.skip_list_node.cljs$core$IFn$_invoke$arity$1((0)),(0)));
+});
+cljs.core.async.impl.timers.timeouts_map = cljs.core.async.impl.timers.skip_list();
+cljs.core.async.impl.timers.TIMEOUT_RESOLUTION_MS = (10);
+/**
+ * returns a channel that will close after msecs
+ */
+cljs.core.async.impl.timers.timeout = (function cljs$core$async$impl$timers$timeout(msecs){
+var timeout = ((new Date()).valueOf() + msecs);
+var me__$1 = cljs.core.async.impl.timers.timeouts_map.ceilingEntry(timeout);
+var or__5002__auto__ = (cljs.core.truth_((function (){var and__5000__auto__ = me__$1;
+if(cljs.core.truth_(and__5000__auto__)){
+return (me__$1.key < (timeout + cljs.core.async.impl.timers.TIMEOUT_RESOLUTION_MS));
+} else {
+return and__5000__auto__;
+}
+})())?me__$1.val:null);
+if(cljs.core.truth_(or__5002__auto__)){
+return or__5002__auto__;
+} else {
+var timeout_channel = cljs.core.async.impl.channels.chan.cljs$core$IFn$_invoke$arity$1(null);
+cljs.core.async.impl.timers.timeouts_map.put(timeout,timeout_channel);
+
+cljs.core.async.impl.dispatch.queue_delay((function (){
+cljs.core.async.impl.timers.timeouts_map.remove(timeout);
+
+return cljs.core.async.impl.protocols.close_BANG_(timeout_channel);
+}),msecs);
+
+return timeout_channel;
+}
+});
+
+//# sourceMappingURL=cljs.core.async.impl.timers.js.map

package/cljs.core.async.impl.timers.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["cljs/core/async/impl/timers.cljs"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAaA,wCAAA,xCAAKA;AACL,AAAKC,gCAAE,CAAA,MAAA;AAEP,AAAA,2CAAA,mDAAAC,9FAAME;AAAN,AAAA,IAAAD,WAAA,AAAA;AAAA,AAAA,QAAAA;KAAA;AAAA,OAAAC;;;KAAA;AAAA,OAAAA,uEAAA,CAAA,UAAA;;;;AAAA,MAAA,KAAAC,MAAA,CAAA,8DAAA,AAAA;;;;;AAAA,CAAA,yEAAA,zEAAMD;AAAN,AACM,8EAAA,vEAACE;;;AADP,CAAA,yEAAA,zEAAMF,oFAEFG;;AAFJ,AAGI,GAAI,EAAK,CAAG,AAASC,gBAASP,oCACrB,CAAGM,QAAMP;AAChB,eAAO,SAAA,RAAKO;;;;AACZA;;;;;;AANN,CAAA,mEAAA,nEAAMH;;AAAN,AAQA,AAAA;;;;;;;;;;;;;AAAA,AAAA,CAAA,AAAA,qFAAA,rFAASS,gGAEAK;;AAFT,AAAA,eAAA,XAESA;AAFT,AAGI,YAAAC,eAAA,gBAAA,KAAAA,eAAA,gBAAA,KAAA,IAAA,OAAA,IAAA,nEAAMJ,oCAAIC;;;AAHd,CAAA,AAAA,mGAAA,nGAASH,8GAMMK,KAAKE,OAAOC;;AAN3B,AAAA,eAAA,XAMeH;AANf,AAOI,iEAAA,IAAA,IAAA,lEAACI,+BAAqBF,OAAOG,gCAAsBF,KAAKH;;;AAP5D,CAAA,oDAAA,pDAASL;AAAT,AAAA,AAAA;;;AAAA,CAAA,0DAAA,1DAASA;;AAAT,CAAA,6DAAA,7DAASA;;AAAT,CAAA,kEAAA,WAAAJ,mBAAAC,qBAAAC,rHAASE;AAAT,AAAA,OAAAD,iBAAAF,qBAAA;;;AAAA;;;gDAAA,hDAASI,wGAAcC,IAAcC,IAAIC;AAAzC,AAAA,YAAAJ,yCAAuBE,IAAcC,IAAIC;;;AAAhCJ,AAST,AAAA,6CAAA,qDAAAX,lGAAMuB;AAAN,AAAA,IAAAD,WAAA,AAAA;AAAA,AAAA,QAAAA;KAAA;AAAA,OAAAC,yEAAA,CAAA,UAAA;;;KAAA;AAAA,OAAAA,yEAAA,CAAA,UAAA,MAAA,CAAA,UAAA,MAAA,CAAA,UAAA;;;;AAAA,MAAA,KAAApB,MAAA,CAAA,8DAAA,AAAA;;;;;AAAA,CAAA,2EAAA,3EAAMoB,sFACFlB;AADJ,AACW,gFAAA,KAAA,9EAACmB,mFAAuBnB;;;AADnC,CAAA,2EAAA,3EAAMkB,sFAEFE,EAAEC,EAAErB;AAFR,AAGI,IAAMsB,MAAI,KAAAC,MAAY,SAAA,RAAKvB;AAA3B,AACE,cAAA,VAAOwB;;AAAP,AACE,GAAM,CAAGA,UAAE,AAASF;AAApB,AACE,gBAAA,fAAMA,IAAIE;;AACV,eAAO,WAAA,VAAKA;;;;AAFd;;;;AAGF,YAAAlB,yCAAec,EAAEC,EAAEC;;;AARzB,CAAA,qEAAA,rEAAMJ;;AAAN,AAUA,AAAA,iDAAA,yDAAAvB,1GAAM+B;AAAN,AAAA,IAAAD,WAAA,AAAA;AAAA,AAAA,QAAAA;KAAA;AAAA,OAAAC,6EAAA,CAAA,UAAA,MAAA,CAAA,UAAA,MAAA,CAAA,UAAA;;;KAAA;AAAA,OAAAA,6EAAA,CAAA,UAAA,MAAA,CAAA,UAAA,MAAA,CAAA,UAAA,MAAA,CAAA,UAAA;;;;AAAA,MAAA,KAAA5B,MAAA,CAAA,8DAAA,AAAA;;;;;AAAA,CAAA,+EAAA,/EAAM4B,0FACFC,EAAEP,EAAEpB;AADR,AACe,8FAAA,vFAAC4B,6EAAmBD,EAAEP,EAAEpB;;;AADvC,CAAA,+EAAA,/EAAM0B,0FAEFC,EAAEP,EAAEpB,MAAM6B;;AAFd,AAGI,GAAA,GAAQ,SAAA,RAAM7B;AACZ,IAAM2B,QAAE,iBAAOA,QAAEA;;AAAT,AACE,IAAAG,qBAAY,kCAAA,uBAAA,vDAAM,CAAG9B,QAAM,AAAS,AAAW2B,uBACjC,CAAM,AAAWA,cAAG3B;AADlC,AAAA,oBAAA8B;AAAA,qBAAAA,jBAASC;AAAT,AAEE,GAAI,CAAG,AAAOA,qBAAIX;AAChB,eAAOW;;;;AACPJ;;;AACFA;;;;;AANZ,AAOE,GAAU,WAAA,VAAME;AAAhB;AAAA,AACE,CAAMA,OAAO7B,SAAM2B;;;AACrB,eAAOA;eAAEP;eAAE,SAAA,RAAKpB;eAAO6B;;;;;;;AACzBF;;;;;;AAdN,CAAA,yEAAA,zEAAMD;;AAAN,AAgBA,AAAA;;;;;;;;;;;;AAAA,AAAA,CAAA,AAAA,qDAAA,rDAASM,gEAEIZ,EAAEC;;AAFf,AAAA,WAAA,PAEQV;AAFR,AAGI,IAAMkB,SAAO,KAAAN,MAAY9B;IACnBkC,IAAE,AAACC,6EAAmBM,cAAOd,EAAEpB,aAAM6B;IACrCF,QAAE,WAAA,VAAM,AAAWA;AAFzB,AAGE,GAAI,EAAK,GAAK,UAAA,TAAMA,sBAAI,CAAI,AAAOA,cAAGP;AACpC,QAAM,AAAOO,YAAGN;;AAChB,IAAMc,YAAU,AAACpC;AAAjB,AACE,GAAM,CAAGoC,YAAUnC;AAAnB,AACE,IAAOwB,UAAE,gBAAA,fAAKxB;;AAAd,AACE,GAAM,CAAIwB,WAAE,aAAA,ZAAKW;AAAjB,AACE,CAAMN,OAAOL,WAAEU;;AACf,eAAO,WAAA,VAAKV;;;;AAFd;;;;AAGF,CAAMxB,eAAMmC;;AALd;;AAMA,IAAMR,QAAE,AAACR,yEAAeC,EAAEC,EAAE,KAAAE,MAAYY;AAAxC,AACE,QAAA,JAAOX;;AAAP,AACE,GAAM,CAAIA,KAAExB;AAAZ,AACE,IAAMoC,cAAM,AAAW,CAAMP,OAAOL;AAApC,AACE,GAAI,CAAGA,IAAE,AAAS,AAAWG;AAC3B,CAAM,AAAWA,cAAGH,KAAE,CAAMY,YAAMZ;;AAClC,AAAO,AAAWG,mBAAG,4BAAA,iBAAA,3CAAM,CAAGH,IAAE,AAASY,qBAClB,CAAMA,YAAMZ;;;AACrC,GAAI,CAAGA,IAAE,AAASY;AAChB,CAAMA,YAAMZ,KAAEG;;AACd,AAAOS,iBAAMT;;;AACjB,eAAO,KAAA,JAAKH;;;;AATd;;;;;;;AAjBd,CAAA,AAAA,wDAAA,xDAASQ,mEA4BOZ;;AA5BhB,AAAA,WAAA,PA4BWT;AA5BX,AA6BI,IAAMkB,SAAO,KAAAN,MAAY9B;IACnBkC,IAAE,AAACC,6EAAmBM,cAAOd,EAAEpB,aAAM6B;IACrCF,QAAE,8BAAA,KAAA,jCAAU,sBAAA,rBAAO,AAAS,AAAWA,gCACnC,WAAA,VAAM,AAAWA;AAH3B,AAIE,GAAM,EAAK,GAAK,UAAA,TAAMA,sBAAI,CAAI,AAAOA,cAAGP;AAAxC,AACE,cAAA,VAAOI;;AAAP,AACE,GAAM,CAAIA,WAAExB;AAAZ,AACE,IAAMoC,cAAM,AAAW,CAAMP,OAAOL;AAApC,AACE,GAAI,CAAYG,UAAE,kCAAA,uBAAA,vDAAM,CAAGH,UAAE,AAASY,qBAClB,CAAMA,YAAMZ;AAC9B,AACE,CAAMY,YAAMZ,WAAE,CAAM,AAAWG,cAAGH;;AAClC,eAAO,WAAA,VAAKA;;;;AACd,eAAO,WAAA,VAAKA;;;;;AAPlB;;;;AAQF;AAAA,AAAA,GAAO,EAAK,EAAA,CAAA,yBAAA,nBAAKxB,oBAAAA,eAAM,AAAS,AAAWkC,qCAC/B,0CAAA,zCAAM,CAAM,AAAWA,sBAAQlC;AAD3C,AAEE,CAAMA,eAAM,gBAAA,fAAKA;;AAFnB;;AAAA;;;;;AAVF;;;;AAjCN,CAAA,AAAA,8DAAA,9DAASgC,yEA+CaZ;;AA/CtB,AAAA,WAAA,PA+CiBT;AA/CjB,AAgDI,IAAOgB,IAAEO;IAAOlC,YAAMA;;AAAtB,AACE,GAAA,GAAQ,aAAA,ZAAMA;AACZ,IAAMqC,KAAG,iBAAOV,QAAEA;;AAAT,AACE,IAAMI,iBAAG,sCAAA,2BAAA,/DAAM,CAAG/B,YAAM,AAAS,AAAW2B,uBACjC,CAAM,AAAWA,cAAG3B;AAD/B,AAEE,GAAA,GAAQ,mBAAA,lBAAM+B;AACZ,GAAI,CAAG,AAAOA,qBAAIX;AAChBO;;AACA,eAAOI;;;;;AACT,GAAM,eAAA,dAAO/B;AAAb,AACE2B;;AADF;;;;;;AAPf,AASE,oBAAIU;AACF,eAAOA;eAAG,aAAA,ZAAKrC;;;;;AACf,eAAO2B;eAAE,aAAA,ZAAK3B;;;;;;AAClB,GAAI,AAACsC,6CAAE,AAAOX,MAAGP;AACfO;;AACA,kBAAA,VAAM,AAAWA;;;;;;;AAhE3B,CAAA,AAAA,4DAAA,5DAASK,uEAkEWZ;;AAlEpB,AAAA,WAAA,PAkEeT;AAlEf,AAmEI,IAAOgB,IAAEO;IAAOlC,YAAMA;;AAAtB,AACE,GAAA,GAAQ,aAAA,ZAAMA;AACZ,IAAMqC,KAAG,iBAAOV,QAAEA;;AAAT,AACE,IAAMI,iBAAG,sCAAA,2BAAA,/DAAM,CAAG/B,YAAM,AAAS,AAAW2B,uBACjC,CAAM,AAAWA,cAAG3B;AAD/B,AAEE,GAAA,GAAQ,mBAAA,lBAAM+B;AACZ,GAAI,CAAG,AAAOA,qBAAIX;AAChBO;;AACA,eAAOI;;;;;AACT,GAAM,eAAA,dAAO/B;AAAb,AACE2B;;AADF;;;;;;AAPf,AASE,oBAAIU;AACF,eAAOA;eAAG,aAAA,ZAAKrC;;;;;AACf,eAAO2B;eAAE,aAAA,ZAAK3B;;;;;;AAClB,GAAU,CAAY2B,MAAEO;AAAxB;;AAAA,AACEP;;;;;;;AAlFV,CAAA,AAAA,iFAAA,jFAASK,4FAqFArB;;AArFT,AAAA,eAAA,XAqFSA;AArFT,AAsFI,WAAA,2CAAe4B;AAAf,AACU,YAAAC,kBAAA,KAAA;AAAA,AACE,GAAU,SAAA,RAAMD;AAAhB;;AAAA,AACE,sBAAA,fAACE,kGAAM,AAAOF,SAAM,AAAOA,iBACzB,AAACG,iCAAK,cAAA,bAAM,AAAWH;;GAH7B,KAAA;;AADV,AAKE,OAACG,KAAK,uBAAA,tBAAM,AAAWR;;;AA3F7B,CAAA,AAAA,+FAAA,/FAASF,0GA8FMrB,KAAKE,OAAOC;;AA9F3B,AAAA,eAAA,XA8FeH;AA9Ff,AA+FI,IAAMgC,UAAQ,WAAKC;AAAL,AACE,iEAAA,GAAA,IAAA,jEAAC7B,+BAAqBF,OAAOG,8BAAoBF,KAAK8B;;AADtE,AAEE,qDAAA,IAAA,KAAA,vDAAC7B,+BAAqBF,OAAO8B,qBAAqB7B,KAAKH;;;AAjG7D,CAAA,gDAAA,hDAASqB;AAAT,AAAA,AAAA;;;AAAA,CAAA,sDAAA,tDAASA;;AAAT,CAAA,yDAAA,zDAASA;;AAAT,CAAA,8DAAA,WAAA9B,mBAAAC,qBAAAC,jHAAS4B;AAAT,AAAA,OAAA3B,iBAAAF,qBAAA;;;AAAA;;;4CAAA,5CAAS8B,gGAAUC,OAAiBlC;AAApC,AAAA,YAAAgC,qCAAmBE,OAAiBlC;;;AAA3BgC,AAmGT,wCAAA,xCAAMa;AAAN,AACE,YAAAb,mHAAA,9EAAW,yEAAA,zEAACb;;AAEd,AAAK2B,2CAAa,AAACD;AAEnB,oDAAA,pDAAKE;AAEL;;;sCAAA,tCAAMC,oFAEHC;AAFH,AAGE,IAAMC,UAAQ,CAAG,AAAU,KAAAC,oBAAYF;IACjCG,SAAG,AAAeN,sDAAaI;AADrC,AAEE,IAAAG,mBAAI,kBAAM,iBAAAC,oBAAKF;AAAL,AAAA,oBAAAE;AAAQ,QAAG,AAAOF,aAAI,CAAGF,UAAQH;;AAAjCO;;MAAN,WAAA,XACE,AAAOF;AADb,AAAA,oBAAAC;AAAAA;;AAEI,IAAME,kBAAgB,iEAAA,jEAACC;AAAvB,AACE,AAAMV,6CAAaI,QAAQK;;AAC3B,AAACE,0CACC;AAAA,AACE,AAASX,gDAAaI;;AACtB,OAACQ,2CAAYH;GACfN;;AACFM","names":["cljs.core.async.impl.timers/MAX_LEVEL","cljs.core.async.impl.timers/P","var_args","G__25961","cljs.core.async.impl.timers/random-level","js/Error","cljs.core.async.impl.timers.random_level","level","js/Math","this__5287__auto__","writer__5288__auto__","opt__5289__auto__","cljs.core/-write","cljs.core.async.impl.timers/SkipListNode","cljs.core.async.impl.timers/->SkipListNode","key","val","forward","coll","cljs.core/List","writer","opts","cljs.core/pr-sequential-writer","cljs.core/pr-writer","G__25986","cljs.core.async.impl.timers/skip-list-node","cljs.core.async.impl.timers.skip_list_node","k","v","arr","js/Array","i","G__25988","cljs.core.async.impl.timers/least-greater-node","x","cljs.core.async.impl.timers.least_greater_node","update","temp__5802__auto__","x'","cljs.core.async.impl.timers/SkipList","cljs.core.async.impl.timers/->SkipList","header","new-level","links","nx","cljs.core._EQ_","node","cljs.core/LazySeq","cljs.core/cons","iter","pr-pair","keyval","cljs.core.async.impl.timers/skip-list","cljs.core.async.impl.timers/timeouts-map","cljs.core.async.impl.timers/TIMEOUT_RESOLUTION_MS","cljs.core.async.impl.timers/timeout","msecs","timeout","js/Date","me","or__5002__auto__","and__5000__auto__","timeout-channel","cljs.core.async.impl.channels.chan","cljs.core.async.impl.dispatch/queue-delay","cljs.core.async.impl.protocols/close!"],"sourcesContent":[";;   Copyright (c) Rich Hickey and contributors. All rights reserved.\n;;   The use and distribution terms for this software are covered by the\n;;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n;;   which can be found in the file epl-v10.html at the root of this distribution.\n;;   By using this software in any fashion, you are agreeing to be bound by\n;;   the terms of this license.\n;;   You must not remove this notice, or any other, from this software.\n\n(ns cljs.core.async.impl.timers\n  (:require [cljs.core.async.impl.protocols :as impl]\n            [cljs.core.async.impl.channels :as channels]\n            [cljs.core.async.impl.dispatch :as dispatch]))\n\n(def MAX_LEVEL 15) ;; 16 levels\n(def P (/ 1 2))\n\n(defn random-level\n  ([] (random-level 0))\n  ([level]\n    (if (and (< (.random js/Math) P)\n             (< level MAX_LEVEL))\n      (recur (inc level))\n      level)))\n\n(deftype SkipListNode [key ^:mutable val forward]\n  ISeqable\n  (-seq [coll]\n    (list key val))\n\n  IPrintWithWriter\n  (-pr-writer [coll writer opts]\n    (pr-sequential-writer writer pr-writer \"[\" \" \" \"]\" opts coll)))\n\n(defn skip-list-node\n  ([level] (skip-list-node nil nil level))\n  ([k v level]\n    (let [arr (make-array (inc level))]\n      (loop [i 0]\n        (when (< i (alength arr))\n          (aset arr i nil)\n          (recur (inc i))))\n      (SkipListNode. k v arr))))\n\n(defn least-greater-node\n  ([x k level] (least-greater-node x k level nil))\n  ([x k level update]\n    (if-not (neg? level)\n      (let [x (loop [x x]\n                (if-let [x' (when (< level (alength (.-forward x)))\n                              (aget (.-forward x) level))]\n                  (if (< (.-key x') k)\n                    (recur x')\n                    x)\n                  x))]\n        (when-not (nil? update)\n          (aset update level x))\n        (recur x k (dec level) update))\n      x)))\n\n(deftype SkipList [header ^:mutable level]\n  Object\n  (put [coll k v]\n    (let [update (make-array MAX_LEVEL)\n          x (least-greater-node header k level update)\n          x (aget (.-forward x) 0)]\n      (if (and (not (nil? x)) (== (.-key x) k))\n        (set! (.-val x) v)\n        (let [new-level (random-level)]\n          (when (> new-level level)\n            (loop [i (inc level)]\n              (when (<= i (inc new-level))\n                (aset update i header)\n                (recur (inc i))))\n            (set! level new-level))\n          (let [x (skip-list-node k v (make-array new-level))]\n            (loop [i 0]\n              (when (<= i level)\n                (let [links (.-forward (aget update i))]\n                  (if (< i (alength (.-forward x)))\n                    (aset (.-forward x) i (aget links i))\n                    (.push (.-forward x) (when (< i (alength links))\n                                           (aget links i))))\n                  (if (< i (alength links))\n                    (aset links i x)\n                    (.push links x)))\n                (recur (inc i)))))))))\n\n  (remove [coll k]\n    (let [update (make-array MAX_LEVEL)\n          x (least-greater-node header k level update)\n          x (when-not (zero? (alength (.-forward x)))\n              (aget (.-forward x) 0))]\n      (when (and (not (nil? x)) (== (.-key x) k))\n        (loop [i 0]\n          (when (<= i level)\n            (let [links (.-forward (aget update i))]\n              (if (identical? x (when (< i (alength links))\n                                  (aget links i)))\n                (do\n                  (aset links i (aget (.-forward x) i))\n                  (recur (inc i)))\n                (recur (inc i))))))\n        (while (and (< 0 level (alength (.-forward header)))\n                    (nil? (aget (.-forward header) level)))\n          (set! level (dec level))))))\n\n  (ceilingEntry [coll k]\n    (loop [x header level level]\n      (if-not (neg? level)\n        (let [nx (loop [x x]\n                   (let [x' (when (< level (alength (.-forward x)))\n                              (aget (.-forward x) level))]\n                     (if-not (nil? x')\n                       (if (> (.-key x') k)\n                         x\n                         (recur x'))\n                       (when (zero? level)\n                         x))))]\n          (if nx\n            (recur nx (dec level))\n            (recur x (dec level))))\n        (if (= (.-key x) k)\n          x\n          (aget (.-forward x) 0)))))\n\n  (floorEntry [coll k]\n    (loop [x header level level]\n      (if-not (neg? level)\n        (let [nx (loop [x x]\n                   (let [x' (when (< level (alength (.-forward x)))\n                              (aget (.-forward x) level))]\n                     (if-not (nil? x')\n                       (if (> (.-key x') k)\n                         x\n                         (recur x'))\n                       (when (zero? level)\n                         x))))]\n          (if nx\n            (recur nx (dec level))\n            (recur x (dec level))))\n        (when-not (identical? x header)\n          x))))\n\n  ISeqable\n  (-seq [coll]\n    (letfn [(iter [node]\n              (lazy-seq\n                (when-not (nil? node)\n                  (cons [(.-key node) (.-val node)]\n                    (iter (aget (.-forward node) 0))))))]\n      (iter (aget (.-forward header) 0))))\n\n  IPrintWithWriter\n  (-pr-writer [coll writer opts]\n    (let [pr-pair (fn [keyval]\n                    (pr-sequential-writer writer pr-writer \"\" \" \" \"\" opts keyval))]\n      (pr-sequential-writer writer pr-pair \"{\" \", \" \"}\" opts coll))))\n\n(defn skip-list []\n  (SkipList. (skip-list-node 0) 0))\n\n(def timeouts-map (skip-list))\n\n(def TIMEOUT_RESOLUTION_MS 10)\n\n(defn timeout\n  \"returns a channel that will close after msecs\"\n  [msecs]\n  (let [timeout (+ (.valueOf (js/Date.)) msecs)\n        me (.ceilingEntry timeouts-map timeout)]\n    (or (when (and me (< (.-key me) (+ timeout TIMEOUT_RESOLUTION_MS)))\n          (.-val me))\n        (let [timeout-channel (channels/chan nil)]\n          (.put timeouts-map timeout timeout-channel)\n          (dispatch/queue-delay\n            (fn []\n              (.remove timeouts-map timeout)\n              (impl/close! timeout-channel))\n            msecs)\n          timeout-channel))))\n"],"x_google_ignoreList":[0]}