@anysoftinc/anydb-sdk 0.5.1 → 0.6.1

package/dist/clojure.data.js

@@ -1,307 +0,0 @@
-var $CLJS = require("./cljs_env");
-var $jscomp = $CLJS.$jscomp;
-var COMPILED = false;
-require("./cljs.core.js");
-require("./clojure.set.js");
-var anydb=$CLJS.anydb || ($CLJS.anydb = {});
-var clojure=$CLJS.clojure || ($CLJS.clojure = {});
-var cljs=$CLJS.cljs || ($CLJS.cljs = {});
-var goog=$CLJS.goog || ($CLJS.goog = {});
-var datascript=$CLJS.datascript || ($CLJS.datascript = {});
-var me=$CLJS.me || ($CLJS.me = {});
-var extend_clj=$CLJS.extend_clj || ($CLJS.extend_clj = {});
-
-$CLJS.SHADOW_ENV.setLoaded("clojure.data.js");
-
-goog.provide('clojure.data');
-/**
- * Internal helper for diff.
- */
-clojure.data.atom_diff = (function clojure$data$atom_diff(a,b){
-if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(a,b)){
-return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [null,null,a], null);
-} else {
-return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [a,b,null], null);
-}
-});
-/**
- * Convert an associative-by-numeric-index collection into
- * an equivalent vector, with nil for any missing keys
- */
-clojure.data.vectorize = (function clojure$data$vectorize(m){
-if(cljs.core.seq(m)){
-return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (result,p__7714){
-var vec__7715 = p__7714;
-var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__7715,(0),null);
-var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__7715,(1),null);
-return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(result,k,v);
-}),cljs.core.vec(cljs.core.repeat.cljs$core$IFn$_invoke$arity$2(cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.max,cljs.core.keys(m)),null)),m);
-} else {
-return null;
-}
-});
-/**
- * Diff associative things a and b, comparing only the key k.
- */
-clojure.data.diff_associative_key = (function clojure$data$diff_associative_key(a,b,k){
-var va = cljs.core.get.cljs$core$IFn$_invoke$arity$2(a,k);
-var vb = cljs.core.get.cljs$core$IFn$_invoke$arity$2(b,k);
-var vec__7724 = clojure.data.diff(va,vb);
-var a_STAR_ = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__7724,(0),null);
-var b_STAR_ = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__7724,(1),null);
-var ab = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__7724,(2),null);
-var in_a = cljs.core.contains_QMARK_(a,k);
-var in_b = cljs.core.contains_QMARK_(b,k);
-var same = ((in_a) && (((in_b) && ((((!((ab == null)))) || ((((va == null)) && ((vb == null)))))))));
-return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [((((in_a) && ((((!((a_STAR_ == null)))) || ((!(same)))))))?cljs.core.PersistentArrayMap.createAsIfByAssoc([k,a_STAR_]):null),((((in_b) && ((((!((b_STAR_ == null)))) || ((!(same)))))))?cljs.core.PersistentArrayMap.createAsIfByAssoc([k,b_STAR_]):null),((same)?cljs.core.PersistentArrayMap.createAsIfByAssoc([k,ab]):null)], null);
-});
-/**
- * Diff associative things a and b, comparing only keys in ks (if supplied).
- */
-clojure.data.diff_associative = (function clojure$data$diff_associative(var_args){
-var G__7733 = arguments.length;
-switch (G__7733) {
-case 2:
-return clojure.data.diff_associative.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
-
-break;
-case 3:
-return clojure.data.diff_associative.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('')));
-
-}
-});
-
-(clojure.data.diff_associative.cljs$core$IFn$_invoke$arity$2 = (function (a,b){
-return clojure.data.diff_associative.cljs$core$IFn$_invoke$arity$3(a,b,clojure.set.union.cljs$core$IFn$_invoke$arity$2(cljs.core.keys(a),cljs.core.keys(b)));
-}));
-
-(clojure.data.diff_associative.cljs$core$IFn$_invoke$arity$3 = (function (a,b,ks){
-return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (diff1,diff2){
-return cljs.core.doall.cljs$core$IFn$_invoke$arity$1(cljs.core.map.cljs$core$IFn$_invoke$arity$3(cljs.core.merge,diff1,diff2));
-}),new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [null,null,null], null),cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.partial.cljs$core$IFn$_invoke$arity$3(clojure.data.diff_associative_key,a,b),ks));
-}));
-
-(clojure.data.diff_associative.cljs$lang$maxFixedArity = 3);
-
-clojure.data.diff_sequential = (function clojure$data$diff_sequential(a,b){
-return cljs.core.vec(cljs.core.map.cljs$core$IFn$_invoke$arity$2(clojure.data.vectorize,clojure.data.diff_associative.cljs$core$IFn$_invoke$arity$3(((cljs.core.vector_QMARK_(a))?a:cljs.core.vec(a)),((cljs.core.vector_QMARK_(b))?b:cljs.core.vec(b)),cljs.core.range.cljs$core$IFn$_invoke$arity$1((function (){var x__5087__auto__ = cljs.core.count(a);
-var y__5088__auto__ = cljs.core.count(b);
-return ((x__5087__auto__ > y__5088__auto__) ? x__5087__auto__ : y__5088__auto__);
-})()))));
-});
-clojure.data.diff_set = (function clojure$data$diff_set(a,b){
-return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.not_empty(clojure.set.difference.cljs$core$IFn$_invoke$arity$2(a,b)),cljs.core.not_empty(clojure.set.difference.cljs$core$IFn$_invoke$arity$2(b,a)),cljs.core.not_empty(clojure.set.intersection.cljs$core$IFn$_invoke$arity$2(a,b))], null);
-});
-
-/**
- * Implementation detail. Subject to change.
- * @interface
- */
-clojure.data.EqualityPartition = function(){};
-
-var clojure$data$EqualityPartition$equality_partition$dyn_7804 = (function (x){
-var x__5350__auto__ = (((x == null))?null:x);
-var m__5351__auto__ = (clojure.data.equality_partition[goog.typeOf(x__5350__auto__)]);
-if((!((m__5351__auto__ == null)))){
-return (m__5351__auto__.cljs$core$IFn$_invoke$arity$1 ? m__5351__auto__.cljs$core$IFn$_invoke$arity$1(x) : m__5351__auto__.call(null,x));
-} else {
-var m__5349__auto__ = (clojure.data.equality_partition["_"]);
-if((!((m__5349__auto__ == null)))){
-return (m__5349__auto__.cljs$core$IFn$_invoke$arity$1 ? m__5349__auto__.cljs$core$IFn$_invoke$arity$1(x) : m__5349__auto__.call(null,x));
-} else {
-throw cljs.core.missing_protocol("EqualityPartition.equality-partition",x);
-}
-}
-});
-/**
- * Implementation detail. Subject to change.
- */
-clojure.data.equality_partition = (function clojure$data$equality_partition(x){
-if((((!((x == null)))) && ((!((x.clojure$data$EqualityPartition$equality_partition$arity$1 == null)))))){
-return x.clojure$data$EqualityPartition$equality_partition$arity$1(x);
-} else {
-return clojure$data$EqualityPartition$equality_partition$dyn_7804(x);
-}
-});
-
-
-/**
- * Implementation detail. Subject to change.
- * @interface
- */
-clojure.data.Diff = function(){};
-
-var clojure$data$Diff$diff_similar$dyn_7809 = (function (a,b){
-var x__5350__auto__ = (((a == null))?null:a);
-var m__5351__auto__ = (clojure.data.diff_similar[goog.typeOf(x__5350__auto__)]);
-if((!((m__5351__auto__ == null)))){
-return (m__5351__auto__.cljs$core$IFn$_invoke$arity$2 ? m__5351__auto__.cljs$core$IFn$_invoke$arity$2(a,b) : m__5351__auto__.call(null,a,b));
-} else {
-var m__5349__auto__ = (clojure.data.diff_similar["_"]);
-if((!((m__5349__auto__ == null)))){
-return (m__5349__auto__.cljs$core$IFn$_invoke$arity$2 ? m__5349__auto__.cljs$core$IFn$_invoke$arity$2(a,b) : m__5349__auto__.call(null,a,b));
-} else {
-throw cljs.core.missing_protocol("Diff.diff-similar",a);
-}
-}
-});
-/**
- * Implementation detail. Subject to change.
- */
-clojure.data.diff_similar = (function clojure$data$diff_similar(a,b){
-if((((!((a == null)))) && ((!((a.clojure$data$Diff$diff_similar$arity$2 == null)))))){
-return a.clojure$data$Diff$diff_similar$arity$2(a,b);
-} else {
-return clojure$data$Diff$diff_similar$dyn_7809(a,b);
-}
-});
-
-(clojure.data.EqualityPartition["null"] = true);
-
-(clojure.data.equality_partition["null"] = (function (x){
-return new cljs.core.Keyword(null,"atom","atom",-397043653);
-}));
-
-(clojure.data.EqualityPartition["string"] = true);
-
-(clojure.data.equality_partition["string"] = (function (x){
-return new cljs.core.Keyword(null,"atom","atom",-397043653);
-}));
-
-(clojure.data.EqualityPartition["number"] = true);
-
-(clojure.data.equality_partition["number"] = (function (x){
-return new cljs.core.Keyword(null,"atom","atom",-397043653);
-}));
-
-(clojure.data.EqualityPartition["array"] = true);
-
-(clojure.data.equality_partition["array"] = (function (x){
-return new cljs.core.Keyword(null,"sequential","sequential",-1082983960);
-}));
-
-(clojure.data.EqualityPartition["function"] = true);
-
-(clojure.data.equality_partition["function"] = (function (x){
-return new cljs.core.Keyword(null,"atom","atom",-397043653);
-}));
-
-(clojure.data.EqualityPartition["boolean"] = true);
-
-(clojure.data.equality_partition["boolean"] = (function (x){
-return new cljs.core.Keyword(null,"atom","atom",-397043653);
-}));
-
-(clojure.data.EqualityPartition["_"] = true);
-
-(clojure.data.equality_partition["_"] = (function (x){
-if((((!((x == null))))?(((((x.cljs$lang$protocol_mask$partition0$ & (1024))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$IMap$))))?true:(((!x.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.IMap,x):false)):cljs.core.native_satisfies_QMARK_(cljs.core.IMap,x))){
-return new cljs.core.Keyword(null,"map","map",1371690461);
-} else {
-if((((!((x == null))))?(((((x.cljs$lang$protocol_mask$partition0$ & (4096))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$ISet$))))?true:(((!x.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.ISet,x):false)):cljs.core.native_satisfies_QMARK_(cljs.core.ISet,x))){
-return new cljs.core.Keyword(null,"set","set",304602554);
-} else {
-if((((!((x == null))))?(((((x.cljs$lang$protocol_mask$partition0$ & (16777216))) || ((cljs.core.PROTOCOL_SENTINEL === x.cljs$core$ISequential$))))?true:(((!x.cljs$lang$protocol_mask$partition0$))?cljs.core.native_satisfies_QMARK_(cljs.core.ISequential,x):false)):cljs.core.native_satisfies_QMARK_(cljs.core.ISequential,x))){
-return new cljs.core.Keyword(null,"sequential","sequential",-1082983960);
-} else {
-return new cljs.core.Keyword(null,"atom","atom",-397043653);
-
-}
-}
-}
-}));
-(clojure.data.Diff["null"] = true);
-
-(clojure.data.diff_similar["null"] = (function (a,b){
-return clojure.data.atom_diff(a,b);
-}));
-
-(clojure.data.Diff["string"] = true);
-
-(clojure.data.diff_similar["string"] = (function (a,b){
-return clojure.data.atom_diff(a,b);
-}));
-
-(clojure.data.Diff["number"] = true);
-
-(clojure.data.diff_similar["number"] = (function (a,b){
-return clojure.data.atom_diff(a,b);
-}));
-
-(clojure.data.Diff["array"] = true);
-
-(clojure.data.diff_similar["array"] = (function (a,b){
-return clojure.data.diff_sequential(a,b);
-}));
-
-(clojure.data.Diff["function"] = true);
-
-(clojure.data.diff_similar["function"] = (function (a,b){
-return clojure.data.atom_diff(a,b);
-}));
-
-(clojure.data.Diff["boolean"] = true);
-
-(clojure.data.diff_similar["boolean"] = (function (a,b){
-return clojure.data.atom_diff(a,b);
-}));
-
-(clojure.data.Diff["_"] = true);
-
-(clojure.data.diff_similar["_"] = (function (a,b){
-var fexpr__7780 = (function (){var G__7781 = clojure.data.equality_partition(a);
-var G__7781__$1 = (((G__7781 instanceof cljs.core.Keyword))?G__7781.fqn:null);
-switch (G__7781__$1) {
-case "atom":
-return clojure.data.atom_diff;
-
-break;
-case "set":
-return clojure.data.diff_set;
-
-break;
-case "sequential":
-return clojure.data.diff_sequential;
-
-break;
-case "map":
-return clojure.data.diff_associative;
-
-break;
-default:
-throw (new Error(["No matching clause: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__7781__$1)].join('')));
-
-}
-})();
-return (fexpr__7780.cljs$core$IFn$_invoke$arity$2 ? fexpr__7780.cljs$core$IFn$_invoke$arity$2(a,b) : fexpr__7780.call(null,a,b));
-}));
-/**
- * Recursively compares a and b, returning a tuple of
- *   [things-only-in-a things-only-in-b things-in-both].
- *   Comparison rules:
- * 
- *   * For equal a and b, return [nil nil a].
- *   * Maps are subdiffed where keys match and values differ.
- *   * Sets are never subdiffed.
- *   * All sequential things are treated as associative collections
- *  by their indexes, with results returned as vectors.
- *   * Everything else (including strings!) is treated as
- *  an atom and compared for equality.
- */
-clojure.data.diff = (function clojure$data$diff(a,b){
-if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(a,b)){
-return new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [null,null,a], null);
-} else {
-if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(clojure.data.equality_partition(a),clojure.data.equality_partition(b))){
-return clojure.data.diff_similar(a,b);
-} else {
-return clojure.data.atom_diff(a,b);
-}
-}
-});
-
-//# sourceMappingURL=clojure.data.js.map

package/dist/clojure.edn.js

@@ -1,107 +0,0 @@
-var $CLJS = require("./cljs_env");
-var $jscomp = $CLJS.$jscomp;
-var COMPILED = false;
-require("./cljs.core.js");
-require("./cljs.reader.js");
-var anydb=$CLJS.anydb || ($CLJS.anydb = {});
-var clojure=$CLJS.clojure || ($CLJS.clojure = {});
-var cljs=$CLJS.cljs || ($CLJS.cljs = {});
-var goog=$CLJS.goog || ($CLJS.goog = {});
-var datascript=$CLJS.datascript || ($CLJS.datascript = {});
-var me=$CLJS.me || ($CLJS.me = {});
-var extend_clj=$CLJS.extend_clj || ($CLJS.extend_clj = {});
-
-$CLJS.SHADOW_ENV.setLoaded("clojure.edn.js");
-
-goog.provide('clojure.edn');
-/**
- * Reads the first object from an cljs.tools.reader.reader-types/IPushbackReader.
- * Returns the object read. If EOF, throws if eof-error? is true otherwise returns eof.
- * If no reader is provided, *in* will be used.
- * 
- * Reads data in the edn format (subset of Clojure data):
- * http://edn-format.org
- * 
- * cljs.tools.reader.edn/read doesn't depend on dynamic Vars, all configuration
- * is done by passing an opt map.
- * 
- * opts is a map that can include the following keys:
- * :eof - value to return on end-of-file. When not supplied, eof throws an exception.
- * :readers  - a map of tag symbols to data-reader functions to be considered before default-data-readers.
- *            When not supplied, only the default-data-readers will be used.
- * :default - A function of two args, that will, if present and no reader is found for a tag,
- *            be called with the tag and the value.
- */
-clojure.edn.read = (function clojure$edn$read(var_args){
-var G__11247 = arguments.length;
-switch (G__11247) {
-case 1:
-return clojure.edn.read.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
-
-break;
-case 2:
-return clojure.edn.read.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
-
-break;
-case 4:
-return clojure.edn.read.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('')));
-
-}
-});
-
-(clojure.edn.read.cljs$core$IFn$_invoke$arity$1 = (function (reader){
-return cljs.reader.read.cljs$core$IFn$_invoke$arity$1(reader);
-}));
-
-(clojure.edn.read.cljs$core$IFn$_invoke$arity$2 = (function (opts,reader){
-return cljs.reader.read.cljs$core$IFn$_invoke$arity$2(opts,reader);
-}));
-
-(clojure.edn.read.cljs$core$IFn$_invoke$arity$4 = (function (reader,eof_error_QMARK_,eof,opts){
-return cljs.reader.read.cljs$core$IFn$_invoke$arity$4(reader,eof_error_QMARK_,eof,opts);
-}));
-
-(clojure.edn.read.cljs$lang$maxFixedArity = 4);
-
-/**
- * Reads one object from the string s.
- * Returns nil when s is nil or empty.
- * 
- * Reads data in the edn format (subset of Clojure data):
- * http://edn-format.org
- * 
- * opts is a map as per cljs.tools.reader.edn/read
- */
-clojure.edn.read_string = (function clojure$edn$read_string(var_args){
-var G__11256 = arguments.length;
-switch (G__11256) {
-case 1:
-return clojure.edn.read_string.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
-
-break;
-case 2:
-return clojure.edn.read_string.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
-
-break;
-default:
-throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
-
-}
-});
-
-(clojure.edn.read_string.cljs$core$IFn$_invoke$arity$1 = (function (s){
-return cljs.reader.read_string.cljs$core$IFn$_invoke$arity$1(s);
-}));
-
-(clojure.edn.read_string.cljs$core$IFn$_invoke$arity$2 = (function (opts,s){
-return cljs.reader.read_string.cljs$core$IFn$_invoke$arity$2(opts,s);
-}));
-
-(clojure.edn.read_string.cljs$lang$maxFixedArity = 2);
-
-
-//# sourceMappingURL=clojure.edn.js.map