1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189
|
//
// etc.js - version 0.91
// a graph vizualization toolkit
//
// Copyright (c) 2011 Samizdat Drafting Co.
// Physics code derived from springy.js, copyright (c) 2010 Dennis Hotson
//
// Permission is hereby granted, free of charge, to any person
// obtaining a copy of this software and associated documentation
// files (the "Software"), to deal in the Software without
// restriction, including without limitation the rights to use,
// copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the
// Software is furnished to do so, subject to the following
// conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
// OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
// WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
// OTHER DEALINGS IN THE SOFTWARE.
//
//
// etc.js
//
// misc utilities
//
var trace = function(msg){
if (typeof(window)=='undefined' || !window.console) return
var len = arguments.length
var args = []
for (var i=0; i<len; i++) args.push("arguments["+i+"]")
eval("console.log("+args.join(",")+")")
}
var dirname = function(path){
var pth = path.replace(/^\/?(.*?)\/?$/,"$1").split('/')
pth.pop()
return "/"+pth.join("/")
}
var basename = function(path){
// var pth = path.replace(/^\//,'').split('/')
var pth = path.replace(/^\/?(.*?)\/?$/,"$1").split('/')
var base = pth.pop()
if (base=="") return null
else return base
}
var _ordinalize_re = /(\d)(?=(\d\d\d)+(?!\d))/g
var ordinalize = function(num){
var norm = ""+num
if (num < 11000){
norm = (""+num).replace(_ordinalize_re, "$1,")
} else if (num < 1000000){
norm = Math.floor(num/1000)+"k"
} else if (num < 1000000000){
norm = (""+Math.floor(num/1000)).replace(_ordinalize_re, "$1,")+"m"
}
return norm
}
/* Nano Templates (Tomasz Mazur, Jacek Becela) */
var nano = function(template, data){
return template.replace(/\{([\w\-\.]*)}/g, function(str, key){
var keys = key.split("."), value = data[keys.shift()]
$.each(keys, function(){
if (value.hasOwnProperty(this)) value = value[this]
else value = str
})
return value
})
}
var objcopy = function(old){
if (old===undefined) return undefined
if (old===null) return null
if (old.parentNode) return old
switch (typeof old){
case "string":
return old.substring(0)
break
case "number":
return old + 0
break
case "boolean":
return old === true
break
}
var newObj = ($.isArray(old)) ? [] : {}
$.each(old, function(ik, v){
newObj[ik] = objcopy(v)
})
return newObj
}
var objmerge = function(dst, src){
dst = dst || {}
src = src || {}
var merge = objcopy(dst)
for (var k in src) merge[k] = src[k]
return merge
}
var objcmp = function(a, b, strict_ordering){
if (!a || !b) return a===b // handle null+undef
if (typeof a != typeof b) return false // handle type mismatch
if (typeof a != 'object'){
// an atomic type
return a===b
}else{
// a collection type
// first compare buckets
if ($.isArray(a)){
if (!($.isArray(b))) return false
if (a.length != b.length) return false
}else{
var a_keys = []; for (var k in a) if (a.hasOwnProperty(k)) a_keys.push(k)
var b_keys = []; for (var k in b) if (b.hasOwnProperty(k)) b_keys.push(k)
if (!strict_ordering){
a_keys.sort()
b_keys.sort()
}
if (a_keys.join(',') !== b_keys.join(',')) return false
}
// then compare contents
var same = true
$.each(a, function(ik){
var diff = objcmp(a[ik], b[ik])
same = same && diff
if (!same) return false
})
return same
}
}
var objkeys = function(obj){
var keys = []
$.each(obj, function(k,v){ if (obj.hasOwnProperty(k)) keys.push(k) })
return keys
}
var objcontains = function(obj){
if (!obj || typeof obj!='object') return false
for (var i=1, j=arguments.length; i<j; i++){
if (obj.hasOwnProperty(arguments[i])) return true
}
return false
}
var uniq = function(arr){
// keep in mind that this is only sensible with a list of strings
// anything else, objkey type coercion will turn it into one anyway
var len = arr.length
var set = {}
for (var i=0; i<len; i++){
set[arr[i]] = true
}
return objkeys(set)
}
var arbor_path = function(){
var candidates = $("script").map(function(elt){
var src = $(this).attr('src')
if (!src) return
if (src.match(/arbor[^\/\.]*.js|dev.js/)){
return src.match(/.*\//) || "/"
}
})
if (candidates.length>0) return candidates[0]
else return null
}
|