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 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371
|
-- This file is generated from teal-src/util/jsonschema.lua
if not math.type then
require("prosody.util.mathcompat")
end
local utf8_enc = rawget(_G, "utf8") or require("prosody.util.encodings").utf8;
local utf8_len = utf8_enc.len or function(s)
local _, count = s:gsub("[%z\001-\127\194-\253][\128-\191]*", "");
return count
end;
local json = require("prosody.util.json")
local null = json.null;
local pointer = require("prosody.util.jsonpointer")
local json_schema_object = { xml_t = {} }
local function simple_validate(schema, data)
if schema == nil then
return true
elseif schema == "object" and type(data) == "table" then
return type(data) == "table" and (next(data) == nil or type((next(data, nil))) == "string")
elseif schema == "array" and type(data) == "table" then
return type(data) == "table" and (next(data) == nil or type((next(data, nil))) == "number")
elseif schema == "integer" then
return math.type(data) == schema
elseif schema == "null" then
return data == null
elseif type(schema) == "table" then
for _, one in ipairs(schema) do
if simple_validate(one, data) then
return true
end
end
return false
else
return type(data) == schema
end
end
local function mkerr(sloc, iloc, err)
return { schemaLocation = sloc; instanceLocation = iloc; error = err }
end
local function validate(schema, data, root, sloc, iloc, errs)
if type(schema) == "boolean" then
return schema
end
if root == nil then
root = schema
iloc = ""
sloc = ""
errs = {};
end
if schema["$ref"] and schema["$ref"]:sub(1, 1) == "#" then
local referenced = pointer.resolve(root, schema["$ref"]:sub(2))
if referenced ~= nil and referenced ~= root and referenced ~= schema then
if not validate(referenced, data, root, schema["$ref"], iloc, errs) then
table.insert(errs, mkerr(sloc .. "/$ref", iloc, "Subschema failed validation"))
return false, errs
end
end
end
if not simple_validate(schema.type, data) then
table.insert(errs, mkerr(sloc .. "/type", iloc, "unexpected type"));
return false, errs
end
if schema.type == "object" then
if type(data) == "table" then
for k in pairs(data) do
if not (type(k) == "string") then
table.insert(errs, mkerr(sloc .. "/type", iloc, "'object' had non-string keys"));
return false, errs
end
end
end
end
if schema.type == "array" then
if type(data) == "table" then
for i in pairs(data) do
if not (math.type(i) == "integer") then
table.insert(errs, mkerr(sloc .. "/type", iloc, "'array' had non-integer keys"));
return false, errs
end
end
end
end
if schema["enum"] ~= nil then
local match = false
for _, v in ipairs(schema["enum"]) do
if v == data then
match = true
break
end
end
if not match then
table.insert(errs, mkerr(sloc .. "/enum", iloc, "not one of the enumerated values"));
return false, errs
end
end
if type(data) == "string" then
if schema.maxLength and utf8_len(data) > schema.maxLength then
table.insert(errs, mkerr(sloc .. "/maxLength", iloc, "string too long"))
return false, errs
end
if schema.minLength and utf8_len(data) < schema.minLength then
table.insert(errs, mkerr(sloc .. "/maxLength", iloc, "string too short"))
return false, errs
end
if schema.luaPattern and not data:match(schema.luaPattern) then
table.insert(errs, mkerr(sloc .. "/luaPattern", iloc, "string does not match pattern"))
return false, errs
end
end
if type(data) == "number" then
if schema.multipleOf and (data == 0 or data % schema.multipleOf ~= 0) then
table.insert(errs, mkerr(sloc .. "/luaPattern", iloc, "not a multiple"))
return false, errs
end
if schema.maximum and not (data <= schema.maximum) then
table.insert(errs, mkerr(sloc .. "/maximum", iloc, "number exceeds maximum"))
return false, errs
end
if schema.exclusiveMaximum and not (data < schema.exclusiveMaximum) then
table.insert(errs, mkerr(sloc .. "/exclusiveMaximum", iloc, "number exceeds exclusive maximum"))
return false, errs
end
if schema.minimum and not (data >= schema.minimum) then
table.insert(errs, mkerr(sloc .. "/minimum", iloc, "number below minimum"))
return false, errs
end
if schema.exclusiveMinimum and not (data > schema.exclusiveMinimum) then
table.insert(errs, mkerr(sloc .. "/exclusiveMinimum", iloc, "number below exclusive minimum"))
return false, errs
end
end
if schema.allOf then
for i, sub in ipairs(schema.allOf) do
if not validate(sub, data, root, sloc .. "/allOf/" .. i, iloc, errs) then
table.insert(errs, mkerr(sloc .. "/allOf", iloc, "did not match all subschemas"))
return false, errs
end
end
end
if schema.oneOf then
local valid = 0
for i, sub in ipairs(schema.oneOf) do
if validate(sub, data, root, sloc .. "/oneOf" .. i, iloc, errs) then
valid = valid + 1
end
end
if valid ~= 1 then
table.insert(errs, mkerr(sloc .. "/oneOf", iloc, "did not match exactly one subschema"))
return false, errs
end
end
if schema.anyOf then
local match = false
for i, sub in ipairs(schema.anyOf) do
if validate(sub, data, root, sloc .. "/anyOf/" .. i, iloc, errs) then
match = true
break
end
end
if not match then
table.insert(errs, mkerr(sloc .. "/anyOf", iloc, "did not match any subschema"))
return false, errs
end
end
if schema["not"] ~= nil then
if validate(schema["not"], data, root, sloc .. "/not", iloc, errs) then
table.insert(errs, mkerr(sloc .. "/not", iloc, "did match subschema"))
return false, errs
end
end
if schema["if"] ~= nil then
if validate(schema["if"], data, root, sloc .. "/if", iloc, errs) then
if schema["then"] ~= nil then
if not validate(schema["then"], data, root, sloc .. "/then", iloc, errs) then
table.insert(errs, mkerr(sloc .. "/then", iloc, "did not match subschema"))
return false, errs
end
end
else
if schema["else"] ~= nil then
if not validate(schema["else"], data, root, sloc .. "/else", iloc, errs) then
table.insert(errs, mkerr(sloc .. "/else", iloc, "did not match subschema"))
return false, errs
end
end
end
end
if schema.const ~= nil and schema.const ~= data then
table.insert(errs, mkerr(sloc .. "/const", iloc, "did not match constant value"))
return false, errs
end
if type(data) == "table" then
if schema.maxItems and #(data) > schema.maxItems then
table.insert(errs, mkerr(sloc .. "/maxItems", iloc, "too many items"))
return false, errs
end
if schema.minItems and #(data) < schema.minItems then
table.insert(errs, mkerr(sloc .. "/minItems", iloc, "too few items"))
return false, errs
end
if schema.required then
for _, k in ipairs(schema.required) do
if data[k] == nil then
table.insert(errs, mkerr(sloc .. "/required", iloc .. "/" .. tostring(k), "missing required property"))
return false, errs
end
end
end
if schema.dependentRequired then
for k, reqs in pairs(schema.dependentRequired) do
if data[k] ~= nil then
for _, req in ipairs(reqs) do
if data[req] == nil then
table.insert(errs, mkerr(sloc .. "/dependentRequired", iloc, "missing dependent required property"))
return false, errs
end
end
end
end
end
if schema.propertyNames ~= nil then
for k in pairs(data) do
if not validate(schema.propertyNames, k, root, sloc .. "/propertyNames", iloc .. "/" .. tostring(k), errs) then
table.insert(errs, mkerr(sloc .. "/propertyNames", iloc .. "/" .. tostring(k), "a property name did not match subschema"))
return false, errs
end
end
end
local seen_properties = {}
if schema.properties then
for k, sub in pairs(schema.properties) do
if data[k] ~= nil and not validate(sub, data[k], root, sloc .. "/" .. tostring(k), iloc .. "/" .. tostring(k), errs) then
table.insert(errs, mkerr(sloc .. "/" .. tostring(k), iloc .. "/" .. tostring(k), "a property did not match subschema"))
return false, errs
end
seen_properties[k] = true
end
end
if schema.luaPatternProperties then
for pattern, sub in pairs(schema.luaPatternProperties) do
for k in pairs(data) do
if type(k) == "string" and k:match(pattern) then
if not validate(sub, data[k], root, sloc .. "/luaPatternProperties", iloc, errs) then
table.insert(errs, mkerr(sloc .. "/luaPatternProperties/" .. pattern, iloc .. "/" .. tostring(k), "a property did not match subschema"))
return false, errs
end
seen_properties[k] = true
end
end
end
end
if schema.additionalProperties ~= nil then
for k, v in pairs(data) do
if not seen_properties[k] then
if not validate(schema.additionalProperties, v, root, sloc .. "/additionalProperties", iloc .. "/" .. tostring(k), errs) then
table.insert(errs, mkerr(sloc .. "/additionalProperties", iloc .. "/" .. tostring(k), "additional property did not match subschema"))
return false, errs
end
end
end
end
if schema.dependentSchemas then
for k, sub in pairs(schema.dependentSchemas) do
if data[k] ~= nil and not validate(sub, data, root, sloc .. "/dependentSchemas/" .. k, iloc, errs) then
table.insert(errs, mkerr(sloc .. "/dependentSchemas", iloc .. "/" .. tostring(k), "did not match dependent subschema"))
return false, errs
end
end
end
if schema.uniqueItems then
local values = {}
for _, v in pairs(data) do
if values[v] then
table.insert(errs, mkerr(sloc .. "/uniqueItems", iloc, "had duplicate items"))
return false, errs
end
values[v] = true
end
end
local p = 0
if schema.prefixItems ~= nil then
for i, s in ipairs(schema.prefixItems) do
if data[i] == nil then
break
elseif validate(s, data[i], root, sloc .. "/prefixItems/" .. i, iloc .. "/" .. i, errs) then
p = i
else
table.insert(errs, mkerr(sloc .. "/prefixItems/" .. i, iloc .. "/" .. tostring(i), "did not match subschema"))
return false, errs
end
end
end
if schema.items ~= nil then
for i = p + 1, #(data) do
if not validate(schema.items, data[i], root, sloc, iloc .. "/" .. i, errs) then
table.insert(errs, mkerr(sloc .. "/prefixItems/" .. i, iloc .. "/" .. i, "did not match subschema"))
return false, errs
end
end
end
if schema.contains ~= nil then
local found = 0
for i = 1, #(data) do
if validate(schema.contains, data[i], root, sloc .. "/contains", iloc .. "/" .. i, errs) then
found = found + 1
else
table.insert(errs, mkerr(sloc .. "/contains", iloc .. "/" .. i, "did not match subschema"))
end
end
if found < (schema.minContains or 1) then
table.insert(errs, mkerr(sloc .. "/minContains", iloc, "too few matches"))
return false, errs
elseif found > (schema.maxContains or math.huge) then
table.insert(errs, mkerr(sloc .. "/maxContains", iloc, "too many matches"))
return false, errs
end
end
end
return true
end
json_schema_object.validate = validate;
return json_schema_object
|