内容简介:It figures out relations between DOM elements without storing them or creating actual dom tree. Instead, it gets relationship based on element depth. In case you are studying any dom-tree, you can build entire branches and navigate through them using gener
@dflex/dom-gen
Generates relations between DOM elements depending on their depth.
npm install @dflex/dom-gen
It figures out relations between DOM elements without storing them or creating actual dom tree. Instead, it gets relationship based on element depth. In case you are studying any dom-tree, you can build entire branches and navigate through them using generated unique keys.
const domGen = new Generator() domGen.getElmPointer(id: string, depth: number)
Returns pointer object refers to element relation with its unique keys and related index:
-
order: Object <elementOrder>
self: number parent: number
-
keys: Object <relationKey>
sK: string pK: string chK: string
import Generator from "@dflex/dom-gen"; const domGen = new Generator(); let pointer = domGen.getElmPointer("id-0", 0); // pointer = { // keys: { // chK: null, // pK: "1-0", // sK: "0-0", // }, // order: { // parent: 0, // self: 0, // }, // };
Internally Generator
has build dom tree as following:
DOM-root │ │───id-0 => order: { parent: 0, self: 0 } || keys: { chK: null , pK: "1-0", sK: "0-0" }
Adding more elements on the same level:
const domGen = new Generator(); const pointer1 = domGen.getElmPointer("id-1", 0); // pointer1 = { // keys: { // chK: null, // pK: "1-0", // sK: "0-0", // }, // order: { // parent: 0, // self: 1, // }, // }; const pointer2 = domGen.getElmPointer("id-2", 0); // pointer2 = { // keys: { // chK: null, // pK: "1-0", // sK: "0-0", // }, // order: { // parent: 0, // self: 2, // }, // };
And dom tree is:
DOM-root │ │───id-0 => order: {parent: 0, self: 0} || keys: {chK: null, pK: "1-0", sK: "0-0"} │ │───id-1 => order: {parent: 0, self: 1} || keys: {chK: null, pK: "1-0", sK: "0-0"} │ │───id-2 => order: {parent: 0, self: 2} || keys: {chK: null, pK: "1-0", sK: "0-0"}
Note:id/0-2 all have same parent and siblings key. So any incoming parent will
carry key 1-0
and exists in position 0
. And this goes also for any parent
which means for any element you can go up↑ and down↓ .
Following the same logic we can go deeper:
const domGen = new Generator(); const pointer = domGen.getElmPointer("id-parent-1", 1); // pointer = { // keys: { // chK: "0-0", // pK: "2-0", // sK: "1-0", // this key was generated previously in children level // }, // order: { // parent: 0, // self: 0, // }, // };
And dom tree is with relational key is as following:
DOM-root ├───id-parent-1 => order: {parent: 0, self: 0} || keys: {chK: "0-0", pK: "2-0", sK: "1-0"} | │───id-0 => order: {parent: 0, self: 0} || keys: {chK: null, pK: "1-0", sK: "0-0"} │ │───id-1 => .. │ │───id-2 => ..
dom-gen
doesn't store keys and ids. All the id's validations should be done
outside Generator
logic. Also, storing relationships should be done separately
in a store.
Test
npm test
License
This project is licensed under the GPL-3.0 License
以上就是本文的全部内容,希望本文的内容对大家的学习或者工作能带来一定的帮助,也希望大家多多支持 码农网
猜你喜欢:本站部分资源来源于网络,本站转载出于传递更多信息之目的,版权归原作者或者来源机构所有,如转载稿涉及版权问题,请联系我们。
重新定义团队:谷歌如何工作
拉兹洛·博克 / 宋伟 / 中信出版集团 / 2015-12-1 / CNY 56.00
谷歌首席人才官拉斯洛•博克权威力作,谷歌公开认可的谷歌高层作品,首度揭秘谷歌颠覆工业时代模式的人才和团队管理的核心法则,《纽约时报》畅销榜第一名,Business Insider 2015最佳商业书籍,谷歌的创造力就在于此! 编辑推荐! 1、 谷歌人才官首次公开谷歌人才和团队管理的核心秘籍 在谷歌执掌人事多年的拉斯洛•博克是人才和团队管理的顶级专家。他加入谷歌后,谷歌的员工数从六......一起来看看 《重新定义团队:谷歌如何工作》 这本书的介绍吧!