static/ext/src/data/NodeStore.js
function(parent, records, toAdd) {
        var me = this,
            ln = records ? records.length : 0,
            i, record;

        // recursive is hardcoded to true in TreeView.
        if (!me.recursive && parent !== me.node) {
            return;
        }

        if (parent !== this.node && !me.isVisible(parent)) {
            return;
        }

        if (ln) {
            // The view items corresponding to these are rendered.
            // Loop through and expand any of the non-leaf nodes which are expanded
            for (i = 0; i < ln; i++) {
                record = records[i];

                // Add to array being collected by recursion when child nodes are loaded.
                // Must be done here in loop so that child nodes are inserted into the stream in place
                // in recursive calls.
                toAdd.push(record);

                if (record.isExpanded()) {
                    if (record.isLoaded()) {
                        // Take a shortcut - appends to toAdd array
                        me.handleNodeExpand(record, record.childNodes, toAdd);
                    }
                    else {
                        // Might be asynchronous if child nodes are not immediately available
                        record.set('expanded', false);
                        record.expand();
                    }
                }
            }
        }
    }
function(parent, records, toAdd) {
        var me = this,
            ln = records ? records.length : 0,
            i, record;

        // recursive is hardcoded to true in TreeView.
        if (!me.recursive && parent !== me.node) {
            return;
        }

        if (parent !== this.node && !me.isVisible(parent)) {
            return;
        }

        if (ln) {
            // The view items corresponding to these are rendered.
            // Loop through and expand any of the non-leaf nodes which are expanded
            for (i = 0; i < ln; i++) {
                record = records[i];

                // Add to array being collected by recursion when child nodes are loaded.
                // Must be done here in loop so that child nodes are inserted into the stream in place
                // in recursive calls.
                toAdd.push(record);

                if (record.isExpanded()) {
                    if (record.isLoaded()) {
                        // Take a shortcut - appends to toAdd array
                        me.handleNodeExpand(record, record.childNodes, toAdd);
                    }
                    else {
                        // Might be asynchronous if child nodes are not immediately available
                        record.set('expanded', false);
                        record.expand();
                    }
                }
            }
        }
    }
function ( parent , records , toAdd ) { var me = this , ln = records ? records . length : 0 , i , record ; // recursive is hardcoded to true in TreeView. if ( ! me . recursive && parent !== me . node ) { return ; } if ( parent !== this . node && ! me . isVisible ( parent ) ) { return ; } if ( ln ) { // The view items corresponding to these are rendered. // Loop through and expand any of the non-leaf nodes which are expanded for ( i = 0 ; i < ln ; i ++ ) { record = records [ i ] ; // Add to array being collected by recursion when child nodes are loaded. // Must be done here in loop so that child nodes are inserted into the stream in place // in recursive calls. toAdd . push ( record ) ; if ( record . isExpanded ( ) ) { if ( record . isLoaded ( ) ) { // Take a shortcut - appends to toAdd array me . handleNodeExpand ( record , record . childNodes , toAdd ) ; } else { // Might be asynchronous if child nodes are not immediately available record . set ( 'expanded' , false ) ; record . expand ( ) ; } } } } }
Collects child nodes to remove into the passed toRemove array. When available, all descendant nodes are pushed into that array using recursion.
Collects child nodes to remove into the passed toRemove array . When available all descendant nodes are pushed into that array using recursion .