You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository was archived by the owner on Feb 11, 2020. It is now read-only.
* @description loops through all the insertion points and initializes each one to execute the children specific for it.
25
+
*
26
+
* @param {Class Instance} nestedUnitInstance Tree instance of the module using "reusableNestedUnit" pattern. instance should have "initializeInsertionPoint" function & "insertionPoint" Array.
27
+
* @returns undifiend for false or any type of value depending on the module being applied.
28
+
*/
29
+
/**
30
+
* @description loops through all the insertion points and initializes each one to execute the children specific for it.
31
+
*
32
+
* @param {Class Instance} nestedUnitInstance Tree instance of the module using "reusableNestedUnit" pattern. instance should have "initializeInsertionPoint" function & "insertionPoint" Array.
33
+
* @returns undifiend for false or any type of value depending on the module being applied.
* @description loops through all the insertion points and initializes each one to execute the children specific for it.
69
+
*
70
+
* @param {Class Instance} nestedUnitInstance Tree instance of the module using "reusableNestedUnit" pattern. instance should have "initializeInsertionPoint" function & "insertionPoint" Array.
71
+
* @returns undifiend for false or any type of value depending on the module being applied.
72
+
*/
73
+
case'returnedFirstValue':
74
+
letreturned;
75
+
// get callback from subtrees
76
+
for(letinsertionPointofthis.insertionPoint){
77
+
// [1] get children immediate & relating to this insertion position.
// if (result) childrenArray.splice(index, 1); // was ment to increase the performance of the program, preventing rechecking of already checked array items. But it causes some issues.
115
+
/**
116
+
* Get children corresponding to the current insertion point.
117
+
* // Take into consideration the indirect children added from previous (inhereted) trees.
// if (result) children.splice(index, 1); // was ment to increase the performance of the program, preventing rechecking of already checked array items. But it causes some issues.
52
128
returnresult
53
129
})
54
130
}
55
-
56
131
// order additional children that will be mixed into ownChildren. According to a setting that needs to be added into each child object.
* @description loops through all the insertion points and initializes each one to execute the children specific for it.
31
-
*
32
-
* @param {Class Instance} nestedUnitInstance Tree instance of the module using "reusableNestedUnit" pattern. instance should have "initializeInsertionPoint" function & "insertionPoint" Array.
33
-
* @returns undifiend for false or any type of value depending on the module being applied.
0 commit comments