Js解析Json数据获取元素JsonPath与深度

2024-06-02 19:38
文章标签 数据 元素 深度 json js 解析 获取 jsonpath

本文主要是介绍Js解析Json数据获取元素JsonPath与深度，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

原文出处：http://www.yund.tech/zdetail.html?type=1&id=c2b21696839eccdef2e9b085b9e064f6

作者: jstarseven

JsonPath 是一种信息抽取类库，是从JSON文档中抽取指定信息的工具，提供多种语言实现版本，包括：Javascript, Python， PHP 和 Java，JsonPath 对于 JSON 来说，相当于 XPATH 对于 XML。

  • JsonPath与Xpath用法对比
  • Java使用Jsonpath解析json数据
  • Js获取Json每个节点的JsonPath
  • 将输出结果转换成树形结构

1.JsonPath与Xpath用法对比

XPathJSONPath描述
/$根节点
.@现行节点
/.or[]取子节点
…n/a取父节点，Jsonpath未支持
//…就是不管位置，选择所有符合条件的条件
**匹配所有元素节点
@n/a根据属性访问，Json不支持，因为Json是个Key-value递归结构，不需要。
[][]迭代器标示（可以在里边做简单的迭代操作，如数组下标，根据内容选值等）
|[,]支持迭代器中做多选。
[]?()支持过滤操作.
n/a()支持表达式计算
()n/a分组，JsonPath不支持

2.Java使用Jsonpath解析json数据

1）引入fastjson依赖

<dependency><groupId>com.alibaba</groupId><artifactId>fastjson</artifactId><version>1.2.6</version>
</dependency>

2）java简单的解析案例

public class JsonPath {public static void main(String[] args) {String jsonStr = "{\n" +"  \"store\": {\n" +"    \"book\": [\n" +"      {\n" +"        \"category\": \"reference\",\n" +"        \"author\": \"Nigel Rees\",\n" +"        \"title\": \"Sayings of the Century\",\n" +"        \"price\": 8.95\n" +"      },\n" +"      {\n" +"        \"category\": \"fiction\",\n" +"        \"author\": \"Evelyn Waugh\",\n" +"        \"title\": \"Sword of Honour\",\n" +"        \"price\": 12.99,\n" +"        \"isbn\": \"0-553-21311-3\"\n" +"      }\n" +"      {\n" +"        \"category\": \"fiction\",\n" +"        \"author\": \"Evelyn Waugh\",\n" +"        \"title\": \"Sword of Honour two\",\n" +"        \"price\": 12.99,\n" +"        \"isbn\": \"0-553-21311-3\"\n" +"      }\n" +"    ],\n" +"    \"bicycle\": {\n" +"      \"color\": \"red\",\n" +"      \"price\": 19.95\n" +"    }\n" +"  }\n" +"}";JSONObject jsonObject = JSON.parseObject(jsonStr);System.out.println("Book：" + JSONPath.eval(jsonObject, "$.store.book"));System.out.println("Book数目：" + JSONPath.eval(jsonObject, "$.store.book.size()"));System.out.println("第一本书title：" + JSONPath.eval(jsonObject, "$.store.book[0].title"));System.out.println("price大于10元的book：" + JSONPath.eval(jsonObject, "$.store.book[price > 10]"));System.out.println("price大于10元的title：" + JSONPath.eval(jsonObject, "$.store.book[price > 10][0].title"));System.out.println("price大于10元的title：" + JSONPath.eval(jsonObject, "$.store.book[price > 10][1].title"));System.out.println("category(类别)为fiction(小说)的book：" + JSONPath.eval(jsonObject, "$.store.book[category = 'fiction']"));System.out.println("bicycle的所有属性值" + JSONPath.eval(jsonObject, "$.store.bicycle.*"));System.out.println("bicycle的color和price属性值" + JSONPath.eval(jsonObject, "$.store.bicycle['color','price']"));}

3.Js获取Json每个节点的JsonPath

1）准备json测试数据

var root = {name: '测试节点',doms: {name: "dom测试",children: [{name: '茶馆',val: 'demo',child: [{"name": "李四", "cal": "ceshi"}, {"name": "王五", "cal": "ceshi"}]},{name: '红与黑',val: 'demo',child: [{"name": "张三", "cal": "ceshi"}, {"name": "张三", "cal": "ceshi"}]}]},children: [{name: '学习',children: []},{name: '电影',children: [{name: '喜剧电影'},{name: '动作电影'}]}]}

2）遍历Json对象获取每个节点的深度与JsonPath

     function traverseTree(node, flat) {var stack = [], res = [];if (!node) return;stack.push({"dom": node, "dep": 0, "path": "$", "name": "根节点"});var tmpNode;while (stack.length > 0) {tmpNode = stack.pop();res.push({"name": tmpNode.name,"pid": tmpNode.pid,"path": tmpNode.path,"dep": tmpNode.dep});traverseNode2(tmpNode, tmpNode.dep);}// 遍历单个节点function traverseNode2(node, dep) {var doc = node.dom;if (Object.prototype.toString.call(doc) === '[object Object]') {for (var val in doc) {var cpath = (node.path + "." + val);stack.push({"dom": doc[val],"dep": (dep + 1),"path": cpath,"pid": node.path,"name": val});}}if (Object.prototype.toString.call(doc) === '[object Array]') {for (let i = 0; i < doc.length; i++) {stack.push({"dom": doc[i],"dep": (dep + 1),"path": (node.path + "[" + i + "]"),"pid": node.path,"name": node.name + "[" + i + "]"});}}}// 树形结构转换function flat2tree(jsonData) {var result = [], temp = {}, i = 0, j = 0, len = jsonData.length;for (; i < len; i++)temp[jsonData[i]['path']] = jsonData[i]for (; j < len; j++) {var cel = jsonData[j]var tcel = temp[cel['pid']]if (tcel) {if (!tcel['children']) {tcel['children'] = [];}tcel['children'].push(cel)} else {result.push(cel);}}return result;}return flat ? flat2tree(res) : res;}

3）测试输出

console.log("res-tree:\n" + JSON.stringify(traverseTree(root, false)));
res-tree:
[{"name":"根节点","path":"$","dep":0},{"name":"children","pid":"$","path":"$.children","dep":1},{"name":"children[1]","pid":"$.children","path":"$.children[1]","dep":2},{"name":"children","pid":"$.children[1]","path":"$.children[1].children","dep":3},{"name":"children[1]","pid":"$.children[1].children","path":"$.children[1].children[1]","dep":4},{"name":"name","pid":"$.children[1].children[1]","path":"$.children[1].children[1].name","dep":5},{"name":"children[0]","pid":"$.children[1].children","path":"$.children[1].children[0]","dep":4},{"name":"name","pid":"$.children[1].children[0]","path":"$.children[1].children[0].name","dep":5},{"name":"name","pid":"$.children[1]","path":"$.children[1].name","dep":3},{"name":"children[0]","pid":"$.children","path":"$.children[0]","dep":2},{"name":"children","pid":"$.children[0]","path":"$.children[0].children","dep":3},{"name":"name","pid":"$.children[0]","path":"$.children[0].name","dep":3},{"name":"doms","pid":"$","path":"$.doms","dep":1},{"name":"children","pid":"$.doms","path":"$.doms.children","dep":2},{"name":"children[1]","pid":"$.doms.children","path":"$.doms.children[1]","dep":3},{"name":"child","pid":"$.doms.children[1]","path":"$.doms.children[1].child","dep":4},{"name":"child[1]","pid":"$.doms.children[1].child","path":"$.doms.children[1].child[1]","dep":5},{"name":"cal","pid":"$.doms.children[1].child[1]","path":"$.doms.children[1].child[1].cal","dep":6},{"name":"name","pid":"$.doms.children[1].child[1]","path":"$.doms.children[1].child[1].name","dep":6},{"name":"child[0]","pid":"$.doms.children[1].child","path":"$.doms.children[1].child[0]","dep":5},{"name":"cal","pid":"$.doms.children[1].child[0]","path":"$.doms.children[1].child[0].cal","dep":6},{"name":"name","pid":"$.doms.children[1].child[0]","path":"$.doms.children[1].child[0].name","dep":6},{"name":"val","pid":"$.doms.children[1]","path":"$.doms.children[1].val","dep":4},{"name":"name","pid":"$.doms.children[1]","path":"$.doms.children[1].name","dep":4},{"name":"children[0]","pid":"$.doms.children","path":"$.doms.children[0]","dep":3},{"name":"child","pid":"$.doms.children[0]","path":"$.doms.children[0].child","dep":4},{"name":"child[1]","pid":"$.doms.children[0].child","path":"$.doms.children[0].child[1]","dep":5},{"name":"cal","pid":"$.doms.children[0].child[1]","path":"$.doms.children[0].child[1].cal","dep":6},{"name":"name","pid":"$.doms.children[0].child[1]","path":"$.doms.children[0].child[1].name","dep":6},{"name":"child[0]","pid":"$.doms.children[0].child","path":"$.doms.children[0].child[0]","dep":5},{"name":"cal","pid":"$.doms.children[0].child[0]","path":"$.doms.children[0].child[0].cal","dep":6},{"name":"name","pid":"$.doms.children[0].child[0]","path":"$.doms.children[0].child[0].name","dep":6},{"name":"val","pid":"$.doms.children[0]","path":"$.doms.children[0].val","dep":4},{"name":"name","pid":"$.doms.children[0]","path":"$.doms.children[0].name","dep":4},{"name":"name","pid":"$.doms","path":"$.doms.name","dep":2},{"name":"name","pid":"$","path":"$.name","dep":1}
]

4.将输出结果转换成树形结构

console.log("res-tree:\n" + JSON.stringify(traverseTree(root, true)));
res-tree:
[{"name":"根节点","path":"$","dep":0,"children":[{"name":"children","pid":"$","path":"$.children","dep":1,"children":[{"name":"children[1]","pid":"$.children","path":"$.children[1]","dep":2,"children":[{"name":"children","pid":"$.children[1]","path":"$.children[1].children","dep":3,"children":[{"name":"children[1]","pid":"$.children[1].children","path":"$.children[1].children[1]","dep":4,"children":[{"name":"name","pid":"$.children[1].children[1]","path":"$.children[1].children[1].name","dep":5}]},{"name":"children[0]","pid":"$.children[1].children","path":"$.children[1].children[0]","dep":4,"children":[{"name":"name","pid":"$.children[1].children[0]","path":"$.children[1].children[0].name","dep":5}]}]},{"name":"name","pid":"$.children[1]","path":"$.children[1].name","dep":3}]},{"name":"children[0]","pid":"$.children","path":"$.children[0]","dep":2,"children":[{"name":"children","pid":"$.children[0]","path":"$.children[0].children","dep":3},{"name":"name","pid":"$.children[0]","path":"$.children[0].name","dep":3}]}]},{"name":"doms","pid":"$","path":"$.doms","dep":1,"children":[{"name":"children","pid":"$.doms","path":"$.doms.children","dep":2,"children":[{"name":"children[1]","pid":"$.doms.children","path":"$.doms.children[1]","dep":3,"children":[{"name":"child","pid":"$.doms.children[1]","path":"$.doms.children[1].child","dep":4,"children":[{"name":"child[1]","pid":"$.doms.children[1].child","path":"$.doms.children[1].child[1]","dep":5,"children":[{"name":"cal","pid":"$.doms.children[1].child[1]","path":"$.doms.children[1].child[1].cal","dep":6},{"name":"name","pid":"$.doms.children[1].child[1]","path":"$.doms.children[1].child[1].name","dep":6}]},{"name":"child[0]","pid":"$.doms.children[1].child","path":"$.doms.children[1].child[0]","dep":5,"children":[{"name":"cal","pid":"$.doms.children[1].child[0]","path":"$.doms.children[1].child[0].cal","dep":6},{"name":"name","pid":"$.doms.children[1].child[0]","path":"$.doms.children[1].child[0].name","dep":6}]}]},{"name":"val","pid":"$.doms.children[1]","path":"$.doms.children[1].val","dep":4},{"name":"name","pid":"$.doms.children[1]","path":"$.doms.children[1].name","dep":4}]},{"name":"children[0]","pid":"$.doms.children","path":"$.doms.children[0]","dep":3,"children":[{"name":"child","pid":"$.doms.children[0]","path":"$.doms.children[0].child","dep":4,"children":[{"name":"child[1]","pid":"$.doms.children[0].child","path":"$.doms.children[0].child[1]","dep":5,"children":[{"name":"cal","pid":"$.doms.children[0].child[1]","path":"$.doms.children[0].child[1].cal","dep":6},{"name":"name","pid":"$.doms.children[0].child[1]","path":"$.doms.children[0].child[1].name","dep":6}]},{"name":"child[0]","pid":"$.doms.children[0].child","path":"$.doms.children[0].child[0]","dep":5,"children":[{"name":"cal","pid":"$.doms.children[0].child[0]","path":"$.doms.children[0].child[0].cal","dep":6},{"name":"name","pid":"$.doms.children[0].child[0]","path":"$.doms.children[0].child[0].name","dep":6}]}]},{"name":"val","pid":"$.doms.children[0]","path":"$.doms.children[0].val","dep":4},{"name":"name","pid":"$.doms.children[0]","path":"$.doms.children[0].name","dep":4}]}]},{"name":"name","pid":"$.doms","path":"$.doms.name","dep":2}]},{"name":"name","pid":"$","path":"$.name","dep":1}]}
]

file

本文由博客群发一文多发等运营工具平台 OpenWrite 发布

这篇关于Js解析Json数据获取元素JsonPath与深度的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！


http://www.chinasem.cn/article/1024902。

相关文章

网页解析 lxml 库--实战

网页解析 lxml 库--实战

lxml库使用流程 lxml 是 Python 的第三方解析库，完全使用 Python 语言编写，它对 XPath表达式提供了良好的支 持，因此能够了高效地解析 HTML/XML 文档。本节讲解如何通过 lxml 库解析 HTML 文档。 pip install lxml lxm| 库提供了一个 etree 模块，该模块专门用来解析 HTML/XML 文档，下面来介绍一下 lxml 库
阅读更多...
JS常用组件收集

JS常用组件收集

收集了一些平时遇到的前端比较优秀的组件，方便以后开发的时候查找！！！ 函数工具： Lodash 页面固定： stickUp、jQuery.Pin 轮播： unslider、swiper 开关: switch 复选框： icheck 气泡： grumble 隐藏元素： Headroom
阅读更多...
大模型研发全揭秘：客服工单数据标注的完整攻略

大模型研发全揭秘：客服工单数据标注的完整攻略

在人工智能（AI）领域，数据标注是模型训练过程中至关重要的一步。无论你是新手还是有经验的从业者，掌握数据标注的技术细节和常见问题的解决方案都能为你的AI项目增添不少价值。在电信运营商的客服系统中，工单数据是客户问题和解决方案的重要记录。通过对这些工单数据进行有效标注，不仅能够帮助提升客服自动化系统的智能化水平，还能优化客户服务流程，提高客户满意度。本文将详细介绍如何在电信运营商客服工单的背景下进行
阅读更多...
基于MySQL Binlog的Elasticsearch数据同步实践

基于MySQL Binlog的Elasticsearch数据同步实践

一、为什么要做 随着马蜂窝的逐渐发展，我们的业务数据越来越多，单纯使用 MySQL 已经不能满足我们的数据查询需求，例如对于商品、订单等数据的多维度检索。 使用 Elasticsearch 存储业务数据可以很好的解决我们业务中的搜索需求。而数据进行异构存储后，随之而来的就是数据同步的问题。 二、现有方法及问题 对于数据同步，我们目前的解决方案是建立数据中间表。把需要检索的业务数据，统一放到一张M
阅读更多...
关于数据埋点，你需要了解这些基本知识

关于数据埋点，你需要了解这些基本知识

产品汪每天都在和数据打交道，你知道数据来自哪里吗？ 移动app端内的用户行为数据大多来自埋点，了解一些埋点知识，能和数据分析师、技术侃大山，参与到前期的数据采集，更重要是让最终的埋点数据能为我所用，否则可怜巴巴等上几个月是常有的事。   埋点类型 根据埋点方式，可以区分为： 手动埋点半自动埋点全自动埋点 秉承“任何事物都有两面性”的道理：自动程度高的，能解决通用统计，便于统一化管理，但个性化定
阅读更多...
使用SecondaryNameNode恢复NameNode的数据

使用SecondaryNameNode恢复NameNode的数据

1）需求： NameNode进程挂了并且存储的数据也丢失了，如何恢复NameNode 此种方式恢复的数据可能存在小部分数据的丢失。 2）故障模拟 （1）kill -9 NameNode进程 [lytfly@hadoop102 current]$ kill -9 19886 （2）删除NameNode存储的数据（/opt/module/hadoop-3.1.4/data/tmp/dfs/na
阅读更多...
异构存储（冷热数据分离）

异构存储（冷热数据分离）

异构存储主要解决不同的数据，存储在不同类型的硬盘中，达到最佳性能的问题。 异构存储Shell操作 （1）查看当前有哪些存储策略可以用 [lytfly@hadoop102 hadoop-3.1.4]$ hdfs storagepolicies -listPolicies （2）为指定路径（数据存储目录）设置指定的存储策略 hdfs storagepolicies -setStoragePo
阅读更多...
Hadoop集群数据均衡之磁盘间数据均衡

Hadoop集群数据均衡之磁盘间数据均衡

生产环境，由于硬盘空间不足，往往需要增加一块硬盘。刚加载的硬盘没有数据时，可以执行磁盘数据均衡命令。（Hadoop3.x新特性） plan后面带的节点的名字必须是已经存在的，并且是需要均衡的节点。 如果节点不存在，会报如下错误： 如果节点只有一个硬盘的话，不会创建均衡计划： （1）生成均衡计划 hdfs diskbalancer -plan hadoop102 （2）执行均衡计划 hd
阅读更多...
【C++】_list常用方法解析及模拟实现

【C++】_list常用方法解析及模拟实现

相信自己的力量，只要对自己始终保持信心，尽自己最大努力去完成任何事，就算事情最终结果是失败了，努力了也不留遗憾。💓💓💓 目录   ✨说在前面 🍋知识点一：什么是list？ •🌰1.list的定义 •🌰2.list的基本特性 •🌰3.常用接口介绍 🍋知识点二：list常用接口 •🌰1.默认成员函数 🔥构造函数（⭐） 🔥析构函数 •🌰2.list对象
阅读更多...
【Prometheus】PromQL向量匹配实现不同标签的向量数据进行运算

【Prometheus】PromQL向量匹配实现不同标签的向量数据进行运算

✨✨ 欢迎大家来到景天科技苑✨✨ 🎈🎈 养成好习惯，先赞后看哦~🎈🎈 🏆 作者简介：景天科技苑 🏆《头衔》：大厂架构师，华为云开发者社区专家博主，阿里云开发者社区专家博主，CSDN全栈领域优质创作者，掘金优秀博主，51CTO博客专家等。 🏆《博客》：Python全栈，前后端开发，小程序开发，人工智能，js逆向，App逆向，网络系统安全，数据分析，Django，fastapi
阅读更多...

Copyright China编程 23002807@qq.com

沪ICP备2023033072号-2