Git Product home page Git Product logo

simple-virtual-dom's Introduction

VDOM

一个手写的 VDOM 类库

使用 babel 转换 jsx 代码

目前实现 jsx 到 js 的转换不需要完全依赖 react 的库,只需要用 babel 的新插件

配置环境

yarn init
yarn add -D @babel/cli @babel/core @babel/plugin-transform-react-jxs

运行 babel

./node_modules/.bin/babel src --out-dir lib

createVdom

// 1.利用函数创建一个vdom
let vKey = 0;
const createVdom = (type, props, ...children) => {
  return {
    type,
    props: {
      ...props,
      key: ++vKey,
    },
    // 需要特别处理字符串VDOM
    children: children.map((child) => {
      if (typeof child === "string") {
        return {
          type: "textNode",
          prop: { key: ++vKey },
          children: [],
          text: child,
        };
      }
      return child;
    }),
  };
};

export default createVdom;

convertVdom

  • isCustomProp:对prop的判断
  • isEventProp:对事件回调属性的判断
  • extractEventName:处理事件回调属性的key
  • setProp:设置属性
  • toRealDom:转化成真实dom的主函数
// 2.将虚拟dom转化成真实dom

/*关于 isCustomProp 函数:
  还有一类属性是我们的自定义属性,例如主流框架中的组件间的状态传递,
  即通过props来进行传递的,我们并不希望这一类属性显示在 DOM 中,
  因此需要编写一个函数isCustomProp来检查这个属性是否是自定义属性,
  因为本文只是为了实现 Virtual DOM 的核心**,为了方便,在本文中,这个函数直接返回false。
*/

const isCustomProp = (name) => {
  /* 这里需要对prop进行判断 */
  return false;
};

//判断是否有事件回调属性
const isEventProp = (name) => {
  return /^on/.test(name);
};

//去掉on,在JSX中还要转化成小写
const extractEventName = (name) => {
  return name.slice(2).toLowerCase();
};

//给真实dom设置prop
const setProp = ($target, name, value) => {
  if (isCustomProp(name)) {
    return;
    //主要针对jsx生成虚拟DOM
  } else if (name === "className") {
    return $target.setAttribute("class", value);
  } else if (isEventProp(name)) {
    return $target.addEventListener(extractEventName(name), value);
  } else if (typeof value === "boolean") {
    if (value) {
      $target.setAttribute(name, value);
    }
    //如果value是false的话真实dom没有必要加上这个属性
    $target[name] = value;
  } else {
    $target.setAttribute(name, value);
  }
};

const toRealDom = (vNode) => {
  ///$dom表示真实DOM
  let $dom;
  if (vNode.type === "textNode") {
    //如果vdom的类型是string而不是对象
    $dom = document.createTextNode(vNode.text);
  } else {
    $dom = document.createElement(vNode.type);
  }

  //处理虚拟DOM上的props
  if (vNode.props) {
    Object.keys(vNode.props).forEach((key) => {
      vNode.type !== "textNode" && setProp($dom, key, vNode.props[key]);
    });
  }

  //递归处理子节点,这里需要注意 空数组[]返回的是true 因此加上 vNode.children.length
  if (vNode.children && vNode.children.length) {
    vNode.children.forEach((childVdom) => {
      const realChildDom = toRealDom(childVdom);
      $dom.appendChild(realChildDom);
    });
  }

  vNode.$el = $dom;

  return $dom;
};

export default toRealDom;

updateDom

  • updateDom:更新 DOM 的主函数
  • isNodeChanged:来判断节点是否改变
  • isPropsChanged:来判断属性值是否改变
import toRealDom from "./convertVdom.js";

const updateDom = ($parent, oldVNode, newVNode) => {
  // 当前的真实dom
  const $currentDom = oldVNode.$el;

  // 先考虑新旧VDOM的类型变化
  // 没有旧的节点,添加新的节点
  if (!oldVNode) {
    return $parent.appendChild(toRealDom(newVNode));
  }

  // 没有新的节点,删去旧的RDOM
  if (!newVNode) {
    return $parent.removeChild($currentDom);
  }

  // 都是文本节点,都没有发生变化
  if (
    oldVNode.type === "textNode" &&
    newVNode.type === "textNode" &&
    oldVNode.text === newVNode.text
  ) {
    return;
  }

  const oldProps = oldVNode.props || {};
  const newProps = newVNode.props || {};

  // 在考虑新旧节点上props的变化
  if (isPropsChanged(oldProps, newProps)) {
    const oldPropsKeys = Object.keys(oldProps);
    const newPropsKeys = Object.keys(newProps);

    // 如果新节点没有属性,把旧的节点的属性清除掉
    if (newPropsKeys.length === 0) {
      oldPropsKeys.forEach((propKey) => {
        removeProp($currentDom, propKey, oldProps[propKey]);
      });
    } else {
      // 拿到所有的props,以此遍历,增加/删除/修改对应属性
      const allPropsKeys = new Set([...oldPropsKeys, ...newPropsKeys]);
      allPropsKeys.forEach((propKey) => {
        if (!newProps[propKey]) {
          return removeProp($currentDom, propKey, oldProps[propKey]);
        }
        if (newProps[propKey] !== oldProps[propKey]) {
          return setProp($currentDom, propKey, newProps[propKey]);
        }
      });
    }
  }

  // 递归处理子节点
  if (
    (oldVNode.children && oldVNode.children.length) ||
    (newVNode.children && newVNode.children.length)
  ) {
    // 没有实现顺序diff
    // for (
    //   let i = 0;
    //   i < oldVNode.children.length || i < newVNode.children.length;
    //   i++
    // ) {
    //   updateDom($currentDom, oldVNode.children[i], newVNode.children[i], i);
    // }

    let oldStartIdx = 0;
    let oldEndIdx = oldVNode.children.length - 1;
    let oldStartVnode = oldVNode.children[oldStartIdx];
    let oldEndVnode = oldVNode.children[oldEndIdx];

    let newStartIdx = 0;
    let newEndIdx = newVNode.children.length - 1;
    let newStartVnode = newVNode.children[newStartIdx];
    let newEndVnode = newVNode.children[newEndIdx];

    let oldKeyToIdx;
    let idxInOld;
    let elmToMove;

    while (oldStartIdx <= oldEndIdx && newStartIdx <= newEndIdx) {
      if (!oldStartVnode) {
        oldStartVnode = oldVNode.children[++oldStartIdx];
      } else if (!oldEndVnode) {
        oldEndVnode = oldVNode.children[--oldEndIdx];
      } else if (!newStartVnode) {
        newStartVnode = newVNode.children[++newStartIdx];
      } else if (!newEndVnode) {
        newEndVnode = newVNode.children[--newEndIdx];
      } else if (isSameNode(oldStartVnode, newStartVnode)) {
        // 如果两个头节点是同一个节点,则更新其子节点,继续向后遍历
        updateDom($currentDom, oldStartVnode, newStartVnode);
        oldStartVnode = oldVNode.children[++oldStartIdx];
        newStartVnode = newVNode.children[++newStartIdx];
      } else if (isSameNode(oldEndVnode, newStartVnode)) {
        // 如果两个尾节点是同一个节点,则更新其子节点,继续向前遍历
        updateDom($currentDom, oldEndVnode, newEndVnode);
        oldEndVnode = oldVNode.children[--oldEndIdx];
        newEndVnode = newVNode.children[--newEndIdx];
      } else if (isSameNode(oldStartVnode, newEndVnode)) {
        // 如果旧的头节点和新的尾节点相同,可以通过移动节点来复用DOM
        // 先继续更新子节点,然后把旧的头结点(即新的尾节点)加入到最后面
        updateDom(oldVNode.$el, oldStartVnode, newEndVnode);
        oldVNode.$el.insertBefore(
          oldStartVnode.$el,
          oldEndVnode.$el.nextSibling
        );
        oldStartVnode = oldVNode.children[++oldStartIdx];
        newEndVnode = newVNode.children[--newEndIdx];
      } else if (isSameNode(oldEndVnode, newStartVnode)) {
        // 原理同上
        updateDom(oldVNode.$el, oldEndVnode, newStartVnode);
        oldVNode.$el.insertBefore(oldEndVnode.$el, oldStartVnode.$el);
        oldEndVnode = oldVNode.children[--oldEndIdx];
        newStartVnode = newVNode.children[++newStartIdx];
      } else {
        // 如果不存在旧节点的key表,则创建。(头头、尾尾、头尾、尾头都比较完后再比较剩余的节点)
        if (oldKeyToIdx === undefined) {
          oldKeyToIdx = createKeyToOldIdx(
            oldVNode.children,
            oldStartIdx,
            oldEndIdx
          );
        }

        // 找到新节点在旧节点组中对应节点的位置
        idxInOld = oldKeyToIdx[newStartVnode.props["key"]];
        // 该节点是一个新的节点,则在旧节点前插入该节点
        if (idxInOld === undefined) {
          // 这里创建一个新节点,表示新增加的
          $currentDom.insertBefore(toRealDom(newStartVnode), oldStartVnode.$el);
          newStartVnode = newVNode.children[++newStartIdx];
        } else {
          // 该节点是一个旧节点,可以复用旧的DOM,则移动该节点
          elmToMove = oldVNode.children[idxInOld];
          updateDom($currentDom, elmToMove, newStartVnode);
          // 然后将旧节点组中对应节点设置为undefined,代表已经遍历过了,不在遍历,否则可能存在重复插入的问题
          oldVNode.children[idxInOld] = undefined;
          $currentDom.insertBefore(elmToMove.$el, oldStartVnode.$el);
          // 自增newStartIdx,继续遍历新节点
          newStartVnode = newVNode.children[++newStartIdx];
        }
      }

      if (oldStartIdx > oldEndIdx) {
        for (let i = newStartIdx; i <= newEndIdx; i++) {
          if (newVNode.children[i]) {
            $currentDom.insertBefore(
              toRealDom(newVNode.children[i]),
              newVNode.children[newEndIdx + 1]
                ? newVNode.children[newEndIdx + 1].$el
                : null
            );
          }
        }
      } else if (newStartIdx > newEndIdx) {
        // 当新节点头索引大于新节点尾索引,表示新节点组已经遍历完了,直接删除旧的未遍历到的节点,这些节点不再需要
        for (let i = oldStartIdx; i <= oldEndIdx; i++) {
          if (oldVNode.children[i]) {
            $currentDom.removeChild(oldVNode.children[i].$el);
          }
        }
      }
    }
  }
};

// const isNodeChanged = (oldVNode, newVNode) => {
//   //一个是textNode(string),一个是element(object)
//   if (typeof oldVNode !== typeof newVNode) {
//     return true;
//   }

//   //都是textNode(string) 则需比较文本是否发生改变
//   if (oldVNode.type === "textNode" && newVNode.type === "textNode") {
//     return oldVNode.text !== newVNode.text;
//   }

//   //都是element节点,比较节点类型是否发生改变
//   if (typeof oldVNode === "object" && typeof newVNode === "object") {
//     return oldVNode.type !== newVNode.type;
//   }
// };

const isPropsChanged = (oldProps, newProps) => {
  // 类型不一致,props肯定发生变化
  if (typeof oldProps !== typeof newProps) {
    return true;
  }

  // props为对象
  if (typeof oldProps === "object" && typeof newProps === "object") {
    const oldKeys = Object.keys(oldProps);
    const newKeys = Object.keys(newProps);

    //如果数目不同一定发生变化直接返回true
    if (oldKeys.length !== newKeys.length) {
      return true;
    }

    for (let i = 0; i < oldKeys.length; i++) {
      const key = oldKeys[i];
      // 如果key也发生改变了那就不能做到一一对应,newProps[key] === undefined
      if (oldProps[key] !== newProps[key]) {
        return true;
      }
    }
    return false;
  }
  return false;
};

// removeProp 与 setProp 相对应
const isCustomProp = (name) => {
  /* 这里需要对prop进行判断 */
  return false;
};
//判断是否有事件回调属性
const isEventProp = (name) => {
  return /^on/.test(name);
};
//去掉on,在JSX中还要转化成小写
const extractEventName = (name) => {
  return name.slice(2).toLowerCase();
};

const removeProp = ($target, name, value) => {
  if (isCustomProp(name)) {
    return;
  } else if (name === "className") {
    return $target.removeAttribute("class");
  } else if (isEventProp(name)) {
    return $target.removeEventListener(extractEventName(name), value);
  } else if (typeof value === "boolean") {
    $target.removeAttribute(name);
    $target[name] = false;
  } else {
    $target.removeAttribute(name);
  }
};

const setProp = ($target, name, value) => {
  if (isCustomProp(name)) {
    return;
    //主要针对jsx生成虚拟DOM
  } else if (name === "className") {
    return $target.setAttribute("class", value);
  } else if (isEventProp(name)) {
    return $target.addEventListener(extractEventName(name), value);
  } else if (typeof value === "boolean") {
    if (value) {
      $target.setAttribute(name, value);
    }
    //如果value是false的话真实dom没有必要加上这个属性
    $target[name] = value;
  } else {
    $target.setAttribute(name, value);
  }
};

// 对比key,key一样则说明是同一个节点
const isSameNode = (oldNode, newNode) => {
  return oldNode.props["key"] === newNode.props["key"];
};

const createKeyToOldIdx = (children, beginIdx, endIdx) => {
  let i;
  let map = {};
  let key;
  let child;
  for (i = beginIdx; i <= endIdx; ++i) {
    child = children[i];
    if (child != null) {
      key = child.props["key"];
      if (key !== undefined) {
        map[key] = i;
      }
    }
  }
  return map;
};

export default updateDom;

simple-virtual-dom's People

Contributors

gaoachao avatar

Watchers

 avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.