JSON Schema定义 +Networknt validator格式校验

本文介绍了JSON Schema作为JSON数据结构规范的作用,并重点讨论了networknt的json-schema-validator库,强调了它在与其他java JSON Schema validator库的性能对比中的优势。此外,文中提供了JSON Schema的示例,并提及了在使用特定版本时遇到的问题,例如对于某些属性的支持和Jackson版本的要求。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

一、介绍

JSON Schema是基于JSON的格式的规范,用于定义JSON数据的结构。

官网:https://ajv.js.org/json-schema.html

在线验证:https://www.jsonschemavalidator.net/

在json-schema官网上可以看到,java版本的validator库推荐了以下几种方案:

  • Snow 2019-09, draft-07, -06 Uses Maven for the project and Gson under the hood. (GNU Affero General Public License v3.0)

  • Justify draft-07, -06, -04 (Apache License 2.0)

常用的json-schema-validator库有:everit-org/json-schema和networknt/json-schema-validator ,在everit-org/json-schema的github介绍中可知,如果项目代码中使用jackson进行的json解析,推荐使用后者进行校验;如果使用的是org.json API 进行json解析,推荐使用前者校验。

everit:GitHub - everit-org/json-schema: JSON Schema validator for java, based on the org.json API

networknt: https://github.com/networknt/json-schema-validator

fge:https://github.com/java-json-tools/json-schema-validator

注意:fge/json-schema-validator也称作 java-json-tools/json-schema-validator

参考https://blog.csdn.net/liuxiao723846/article/details/108578544

二、性能对比

在networknt github上有一个三者的性能对比,最快的是networknt。

fge: 7130ms

everit-org: 1168ms

networknt: 223ms

三、json Schema示例

示例1


package com.lsm.util; import java.text.CharacterIterator; import java.text.StringCharacterIterator; /** * 用于校验一个字符串是否是合法的JSON格式 * @author liShuMin * */ public class JsonValidator { private CharacterIterator it; private char c; private int col; public JsonValidator(){ } /** * 验证一个字符串是否是合法的JSON串 * * @param input 要验证的字符串 * @return true-合法 ,false-非法 */ public boolean validate(String input) { input = input.trim(); boolean ret = valid(input); return ret; } private boolean valid(String input) { if ("".equals(input)) return true; boolean ret = true; it = new StringCharacterIterator(input); c = it.first(); col = 1; if (!value()) { ret = error("value", 1); } else { skipWhiteSpace(); if (c != CharacterIterator.DONE) { ret = error("end", col); } } return ret; } private boolean value() { return literal("true") || literal("false") || literal("null") || string() || number() || object() || array(); } private boolean literal(String text) { CharacterIterator ci = new StringCharacterIterator(text); char t = ci.first(); if (c != t) return false; int start = col; boolean ret = true; for (t = ci.next(); t != CharacterIterator.DONE; t = ci.next()) { if (t != nextCharacter()) { ret = false; break; } } nextCharacter(); if (!ret) error("literal " + text, start); return ret; } private boolean array() { return aggregate('[', ']', false); } private boolean object() { return aggregate('{', '}', true); } private boolean aggregate(char entryCharacter, char exitCharacter, boolean prefix) { if (c != entryCharacter) return false; nextCharacter(); skipWhiteSpace(); if (c == exitCharacter) { nextCharacter(); return true; } for (;;) { if (prefix) { int start = col; if (!string()) return error("string", start); skipWhiteSpace(); if (c != ':') return error("colon", col); nextCharacter(); skipWhiteSpace(); } if (value()) { skipWhiteSpace(); if (c == ',') { nextCharacter(); } else if (c == exitCharacter) { break; } else { return error("comma or " + exitCharacter, col); } } else { return error("value", col); } skipWhiteSpace(); } nextCharacter(); return true; } private boolean number() { if (!Character.isDigit(c) && c != '-') return false; int start = col; if (c == '-') nextCharacter(); if (c == '0') { nextCharacter(); } else if (Character.isDigit(c)) { while (Character.isDigit(c)) nextCharacter(); } else { return error("number", start); } if (c == '.') { nextCharacter(); if (Character.isDigit(c)) { while (Character.isDigit(c)) nextCharacter(); } else { return error("number", start); } } if (c == 'e' || c == 'E') { nextCharacter(); if (c == '+' || c == '-') { nextCharacter(); } if (Character.isDigit(c)) { while (Character.isDigit(c)) nextCharacter(); } else { return error("number", start); } } return true; } private boolean string() { if (c != '"') return false; int start = col; boolean escaped = false; for (nextCharacter(); c != CharacterIterator.DONE; nextCharacter()) { if (!escaped && c == '\\') { escaped = true; } else if (escaped) { if (!escape()) { return false; } escaped = false; } else if (c == '"') { nextCharacter(); return true; } } return error("quoted string", start); } private boolean escape() { int start = col - 1; if (" \\\"/bfnrtu".indexOf(c) < 0) { return error("escape sequence \\\",\\\\,\\/,\\b,\\f,\\n,\\r,\\t or \\uxxxx ", start); } if (c == 'u') { if (!ishex(nextCharacter()) || !ishex(nextCharacter()) || !ishex(nextCharacter()) || !ishex(nextCharacter())) { return error("unicode escape sequence \\uxxxx ", start); } } return true; } private boolean ishex(char d) { return "0123456789abcdefABCDEF".indexOf(c) >= 0; } private char nextCharacter() { c = it.next(); ++col; return c; } private void skipWhiteSpace() { while (Character.isWhitespace(c)) { nextCharacter(); } } private boolean error(String type, int col) { System.out.printf("type: %s, col: %s%s", type, col, System.getProperty("line.separator")); return false; } public static void main(String[] args){ //String jsonStr = "{\"website\":\"oschina.net\"}"; String jsonStr = "{" + " \"ccobjtypeid\": \"1001\"," + " \"fromuser\": \"李四\"," + " \"touser\": \"张三\"," + " \"desc\": \"描述\"," + " \"subject\": \"主题\"," + " \"attach\": \"3245,3456,4345,4553\"," + " \"data\": {" + " \"desc\": \"测试对象\"," + " \"dataid\": \"22\"," + " \"billno\": \"TEST0001\"," + " \"datarelation\":[" + " {" + " \"dataname\": \"关联对象1\"," + " \"data\": [" + " {" + " \"dataid\": \"22\"," + " \"datalineid\": \"1\"," + " \"content1\": \"test1\"," + " \"content2\": \"test2\"" + " }" + " ]" + " }" + " ]" + " }" + " }"; System.out.println(jsonStr+":"+new JsonValidator().validate(jsonStr)); } }
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值