waterline-postgresql

<html><head><meta http-equiv="content-type" content="text/html; charset=utf-8"> <style> .KEYW {color: #933;} .COMM {color: #bbb; font-style: italic;} .NUMB {color: #393;} .STRN {color: #393;} .REGX {color: #339;} .line {border-right: 1px dotted #666; color: #666; font-style: normal;} </style></head><body><pre> 1 /** 2 * JSV: JSON Schema Validator 3 * 4 * @fileOverview A JavaScript implementation of a extendable, fully compliant JSON Schema validator. 5 * @author <a href="mailto:gary.court@gmail.com">Gary Court</a> 6 * @version 4.0 7 * @see http://github.com/garycourt/JSV 8 */ 9 10 /* 11 * Copyright 2010 Gary Court. All rights reserved. 12 * 13 * Redistribution and use in source and binary forms, with or without modification, are 14 * permitted provided that the following conditions are met: 15 * 16 * 1. Redistributions of source code must retain the above copyright notice, this list of 17 * conditions and the following disclaimer. 18 * 19 * 2. Redistributions in binary form must reproduce the above copyright notice, this list 20 * of conditions and the following disclaimer in the documentation and/or other materials 21 * provided with the distribution. 22 * 23 * THIS SOFTWARE IS PROVIDED BY GARY COURT ``AS IS'' AND ANY EXPRESS OR IMPLIED 24 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND 25 * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GARY COURT OR 26 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 27 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 28 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON 29 * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 30 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF 31 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 32 * 33 * The views and conclusions contained in the software and documentation are those of the 34 * authors and should not be interpreted as representing official policies, either expressed 35 * or implied, of Gary Court or the JSON Schema specification. 36 */ 37 38 /*jslint white: true, sub: true, onevar: true, undef: true, eqeqeq: true, newcap: true, immed: true, indent: 4 */ 39 40 var exports = exports || this, 41 require = require || function () { 42 return exports; 43 }; 44 45 (function () { 46 47 var URI = require("./uri/uri").URI, 48 O = {}, 49 I2H = "0123456789abcdef".split(""), 50 mapArray, filterArray, searchArray, 51 52 JSV; 53 54 // 55 // Utility functions 56 // 57 58 function typeOf(o) { 59 return o === undefined ? "undefined" : (o === null ? "null" : Object.prototype.toString.call(o).split(" ").pop().split("]").shift().toLowerCase()); 60 } 61 62 /** @inner */ 63 function F() {} 64 65 function createObject(proto) { 66 F.prototype = proto || {}; 67 return new F(); 68 } 69 70 function mapObject(obj, func, scope) { 71 var newObj = {}, key; 72 for (key in obj) { 73 if (obj[key] !== O[key]) { 74 newObj[key] = func.call(scope, obj[key], key, obj); 75 } 76 } 77 return newObj; 78 } 79 80 /** @ignore */ 81 mapArray = function (arr, func, scope) { 82 var x = 0, xl = arr.length, newArr = new Array(xl); 83 for (; x < xl; ++x) { 84 newArr[x] = func.call(scope, arr[x], x, arr); 85 } 86 return newArr; 87 }; 88 89 if (Array.prototype.map) { 90 /** @ignore */ 91 mapArray = function (arr, func, scope) { 92 return Array.prototype.map.call(arr, func, scope); 93 }; 94 } 95 96 /** @ignore */ 97 filterArray = function (arr, func, scope) { 98 var x = 0, xl = arr.length, newArr = []; 99 for (; x < xl; ++x) { 100 if (func.call(scope, arr[x], x, arr)) { 101 newArr[newArr.length] = arr[x]; 102 } 103 } 104 return newArr; 105 }; 106 107 if (Array.prototype.filter) { 108 /** @ignore */ 109 filterArray = function (arr, func, scope) { 110 return Array.prototype.filter.call(arr, func, scope); 111 }; 112 } 113 114 /** @ignore */ 115 searchArray = function (arr, o) { 116 var x = 0, xl = arr.length; 117 for (; x < xl; ++x) { 118 if (arr[x] === o) { 119 return x; 120 } 121 } 122 return -1; 123 }; 124 125 if (Array.prototype.indexOf) { 126 /** @ignore */ 127 searchArray = function (arr, o) { 128 return Array.prototype.indexOf.call(arr, o); 129 }; 130 } 131 132 function toArray(o) { 133 return o !== undefined && o !== null ? (o instanceof Array && !o.callee ? o : (typeof o.length !== "number" || o.split || o.setInterval || o.call ? [ o ] : Array.prototype.slice.call(o))) : []; 134 } 135 136 function keys(o) { 137 var result = [], key; 138 139 switch (typeOf(o)) { 140 case "object": 141 for (key in o) { 142 if (o[key] !== O[key]) { 143 result[result.length] = key; 144 } 145 } 146 break; 147 case "array": 148 for (key = o.length - 1; key >= 0; --key) { 149 result[key] = key; 150 } 151 break; 152 } 153 154 return result; 155 } 156 157 function pushUnique(arr, o) { 158 if (searchArray(arr, o) === -1) { 159 arr.push(o); 160 } 161 return arr; 162 } 163 164 function popFirst(arr, o) { 165 var index = searchArray(arr, o); 166 if (index > -1) { 167 arr.splice(index, 1); 168 } 169 return arr; 170 } 171 172 function randomUUID() { 173 return [ 174 I2H[Math.floor(Math.random() * 0x10)], 175 I2H[Math.floor(Math.random() * 0x10)], 176 I2H[Math.floor(Math.random() * 0x10)], 177 I2H[Math.floor(Math.random() * 0x10)], 178 I2H[Math.floor(Math.random() * 0x10)], 179 I2H[Math.floor(Math.random() * 0x10)], 180 I2H[Math.floor(Math.random() * 0x10)], 181 I2H[Math.floor(Math.random() * 0x10)], 182 "-", 183 I2H[Math.floor(Math.random() * 0x10)], 184 I2H[Math.floor(Math.random() * 0x10)], 185 I2H[Math.floor(Math.random() * 0x10)], 186 I2H[Math.floor(Math.random() * 0x10)], 187 "-4", //set 4 high bits of time_high field to version 188 I2H[Math.floor(Math.random() * 0x10)], 189 I2H[Math.floor(Math.random() * 0x10)], 190 I2H[Math.floor(Math.random() <span class="PUN