Giter VIP home page Giter VIP logo

Comments (2)

RubyLouvre avatar RubyLouvre commented on July 21, 2024
  1.  ref的执行顺序问题(已解决)
    image

from anu.

RubyLouvre avatar RubyLouvre commented on July 21, 2024
import {
    options,
    clearArray
} from "./util";
import {
    Refs
} from "./Refs";

/*
function callUpdate(updater, instance) {
    Refs.clearRefs();
    if (updater._lifeStage === 2) {  
        updater._didUpdate = true;
        instance._didUpdate();
        updater._lifeStage = 1;
        updater._hydrating = false;
        if (!updater._renderInNextCycle) {
            updater._didUpdate = false;
        }
    }
    updater._ref();
}*/

export function drainQueue(queue) {
    options.beforePatch();
    //先执行所有refs方法(从上到下)
    Refs.clearRefs();
    //再执行所有mount/update钩子(从下到上)
    let i = 0;
    while(i < queue.length){//queue可能中途加入新元素,  因此不能直接使用queue.forEach(fn)
        let updater = queue[i];
        i++;
        Refs.clearRefs();
        updater._didUpdate = updater._lifeStage === 2;
        updater._didHook();
        updater._lifeStage = 1;
        updater._hydrating = false;
        if (!updater._renderInNextCycle) {
            updater._didUpdate = false;
        }
        updater._ref();
        /*
        if (!updater._lifeStage) {
            Refs.clearRefs();
            updater._didHook();
            updater._lifeStage = 1;
            updater._hydrating = false;
            updater._ref();
        } else {
            callUpdate(updater, instance);
        }*/
        //如果组件在componentDidMount中调用setState
        if (updater._renderInNextCycle) {
            options.refreshComponent(updater, queue);
            // callUpdate(updater, instance);
        }
       
    }
    //再执行所有setState/forceUpdate回调,根据从下到上的顺序执行
    queue.sort(mountSorter).forEach(function(updater){
        clearArray(updater._pendingCallbacks).forEach(function(fn) {
            fn.call(updater._instance);
        });
    });
    queue.length = 0;
    options.afterPatch();
}

var dirtyComponents = [];
function mountSorter(u1, u2) {//按文档顺序执行
    return u1._mountIndex - u2._mountIndex;
}

options.flushUpdaters = function(queue) {
    if (!queue) {
        queue = dirtyComponents;
        if(queue.length) {
            queue.sort(mountSorter);
        }
    }
    drainQueue(queue);
};

options.enqueueUpdater = function(updater) {
    if (dirtyComponents.indexOf(updater) == -1) {
        dirtyComponents.push(updater);
    }
};

from anu.

Related Issues (20)

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.