const e=JSON.parse('{"key":"v-12027ebe","path":"/md/dev-log/day12.html","title":"Day012","lang":"zh-CN","frontmatter":{"title":"Day012","index":false,"icon":"laptop-code","category":["开发笔记","学习记录"],"description":"任务 [x] 规则引擎量化人群参与活动; 总结 首先先去了解了一下组合模式和决策树，然后看了看数据库，其实就是把一个类似于二叉树的结构存到了数据库里，分别对应了三个东西，一个表用来保存决策树的树根信息，然后一个表用来保存树上的所有节点的信息，然后一个表用来存决策树的连接信息，我们可以通过树根的 ID 拿到所有相关的连线信息以及所有相关的节点信息，明白了...","head":[["meta",{"property":"og:url","content":"https://vuepress-theme-hope-docs-demo.netlify.app/md/dev-log/day12.html"}],["meta",{"property":"og:site_name","content":"我的简历"}],["meta",{"property":"og:title","content":"Day012"}],["meta",{"property":"og:description","content":"任务 [x] 规则引擎量化人群参与活动; 总结 首先先去了解了一下组合模式和决策树，然后看了看数据库，其实就是把一个类似于二叉树的结构存到了数据库里，分别对应了三个东西，一个表用来保存决策树的树根信息，然后一个表用来保存树上的所有节点的信息，然后一个表用来存决策树的连接信息，我们可以通过树根的 ID 拿到所有相关的连线信息以及所有相关的节点信息，明白了..."}],["meta",{"property":"og:type","content":"article"}],["meta",{"property":"og:locale","content":"zh-CN"}],["meta",{"property":"og:updated_time","content":"2024-01-30T13:39:55.000Z"}],["meta",{"property":"article:author","content":"小傅哥"}],["meta",{"property":"article:modified_time","content":"2024-01-30T13:39:55.000Z"}],["script",{"type":"application/ld+json"},"{\\"@context\\":\\"https://schema.org\\",\\"@type\\":\\"Article\\",\\"headline\\":\\"Day012\\",\\"image\\":[\\"\\"],\\"dateModified\\":\\"2024-01-30T13:39:55.000Z\\",\\"author\\":[{\\"@type\\":\\"Person\\",\\"name\\":\\"小傅哥\\",\\"url\\":\\"https://mister-hope.com\\"}]}"]]},"headers":[{"level":3,"title":"任务","slug":"任务","link":"#任务","children":[]},{"level":2,"title":"总结","slug":"总结","link":"#总结","children":[]}],"git":{"createdTime":1706621995000,"updatedTime":1706621995000,"contributors":[{"name":"小傅哥","email":"184172133@qq.com","commits":1}]},"readingTime":{"minutes":2.62,"words":786},"filePathRelative":"md/dev-log/day12.md","localizedDate":"2024年1月30日","autoDesc":true}');export{e as data};
