gantt-task-react-powern 0.4.32 → 0.4.34
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/components/gantt/gantt.d.ts +6 -1
- package/dist/index.d.ts +1 -0
- package/dist/index.js +171 -175
- package/dist/index.js.map +1 -1
- package/dist/index.modern.js +171 -176
- package/dist/index.modern.js.map +1 -1
- package/package.json +1 -1
package/dist/index.modern.js
CHANGED
|
@@ -2742,181 +2742,6 @@ var Gantt = function Gantt(_ref) {
|
|
|
2742
2742
|
}
|
|
2743
2743
|
};
|
|
2744
2744
|
|
|
2745
|
-
function topologicalOrderingHelper(taskID, taskMap, sortedTaskList) {
|
|
2746
|
-
if (!taskMap[taskID]) return true;
|
|
2747
|
-
if (taskMap[taskID].finished) return true;
|
|
2748
|
-
|
|
2749
|
-
if (taskMap[taskID].started) {
|
|
2750
|
-
console.log("Cycle involving " + taskID);
|
|
2751
|
-
return false;
|
|
2752
|
-
}
|
|
2753
|
-
|
|
2754
|
-
taskMap[taskID].started = true;
|
|
2755
|
-
var task = taskMap[taskID].task;
|
|
2756
|
-
if (task.dependencies) for (var i = 0; i < task.dependencies.length; i++) {
|
|
2757
|
-
var successVal = topologicalOrderingHelper(task.dependencies[i], taskMap, sortedTaskList);
|
|
2758
|
-
if (!successVal) return false;
|
|
2759
|
-
}
|
|
2760
|
-
taskMap[taskID].finished = true;
|
|
2761
|
-
sortedTaskList.push(taskID);
|
|
2762
|
-
return true;
|
|
2763
|
-
}
|
|
2764
|
-
|
|
2765
|
-
function getCriticalPaths(leafTasks) {
|
|
2766
|
-
var taskMap = {};
|
|
2767
|
-
|
|
2768
|
-
for (var i = 0; i < leafTasks.length; i++) {
|
|
2769
|
-
taskMap[leafTasks[i].id] = {
|
|
2770
|
-
task: leafTasks[i]
|
|
2771
|
-
};
|
|
2772
|
-
}
|
|
2773
|
-
|
|
2774
|
-
var sortedTaskList = [];
|
|
2775
|
-
|
|
2776
|
-
for (var _i = 0; _i < leafTasks.length; _i++) {
|
|
2777
|
-
var successVal = topologicalOrderingHelper(leafTasks[_i].id, taskMap, sortedTaskList);
|
|
2778
|
-
if (!successVal) return [[], []];
|
|
2779
|
-
}
|
|
2780
|
-
|
|
2781
|
-
for (var _i2 = 0; _i2 < leafTasks.length; _i2++) {
|
|
2782
|
-
taskMap[leafTasks[_i2].id].dependents = [];
|
|
2783
|
-
}
|
|
2784
|
-
|
|
2785
|
-
for (var _i3 = 0; _i3 < leafTasks.length; _i3++) {
|
|
2786
|
-
var task = leafTasks[_i3];
|
|
2787
|
-
if (task.dependencies) for (var j = 0; j < task.dependencies.length; j++) {
|
|
2788
|
-
var _taskMap$task$depende;
|
|
2789
|
-
|
|
2790
|
-
(_taskMap$task$depende = taskMap[task.dependencies[j]]) === null || _taskMap$task$depende === void 0 ? void 0 : _taskMap$task$depende.dependents.push(task.id);
|
|
2791
|
-
}
|
|
2792
|
-
}
|
|
2793
|
-
|
|
2794
|
-
for (var _i4 = sortedTaskList.length - 1; _i4 >= 0; _i4--) {
|
|
2795
|
-
computeCriticalPath(sortedTaskList[_i4], taskMap);
|
|
2796
|
-
}
|
|
2797
|
-
|
|
2798
|
-
var primaryLeaf;
|
|
2799
|
-
var primaryDuration = 0;
|
|
2800
|
-
|
|
2801
|
-
for (var _i5 = 0; _i5 < sortedTaskList.length; _i5++) {
|
|
2802
|
-
var newDuration = taskMap[sortedTaskList[_i5]].end - taskMap[sortedTaskList[_i5]].task.start.getTime();
|
|
2803
|
-
|
|
2804
|
-
if (primaryDuration < newDuration) {
|
|
2805
|
-
primaryLeaf = sortedTaskList[_i5];
|
|
2806
|
-
primaryDuration = newDuration;
|
|
2807
|
-
}
|
|
2808
|
-
}
|
|
2809
|
-
|
|
2810
|
-
var primaryPath = [];
|
|
2811
|
-
|
|
2812
|
-
while (primaryLeaf !== undefined) {
|
|
2813
|
-
taskMap[primaryLeaf].excluded = true;
|
|
2814
|
-
primaryPath.push(taskMap[primaryLeaf].task);
|
|
2815
|
-
primaryLeaf = taskMap[primaryLeaf].next;
|
|
2816
|
-
}
|
|
2817
|
-
|
|
2818
|
-
var secondaryLeaf;
|
|
2819
|
-
var secondaryDuration = 0;
|
|
2820
|
-
|
|
2821
|
-
for (var _i6 = 0; _i6 < sortedTaskList.length; _i6++) {
|
|
2822
|
-
if (taskMap[sortedTaskList[_i6]].excluded) continue;
|
|
2823
|
-
|
|
2824
|
-
var _newDuration = taskMap[sortedTaskList[_i6]].end - taskMap[sortedTaskList[_i6]].task.start.getTime();
|
|
2825
|
-
|
|
2826
|
-
if (secondaryDuration < _newDuration) {
|
|
2827
|
-
secondaryLeaf = sortedTaskList[_i6];
|
|
2828
|
-
secondaryDuration = _newDuration;
|
|
2829
|
-
}
|
|
2830
|
-
}
|
|
2831
|
-
|
|
2832
|
-
var secondaryPath = [];
|
|
2833
|
-
|
|
2834
|
-
while (secondaryLeaf !== undefined) {
|
|
2835
|
-
secondaryPath.push(taskMap[secondaryLeaf].task);
|
|
2836
|
-
secondaryLeaf = taskMap[secondaryLeaf].next;
|
|
2837
|
-
}
|
|
2838
|
-
|
|
2839
|
-
return [primaryPath, secondaryPath];
|
|
2840
|
-
}
|
|
2841
|
-
|
|
2842
|
-
function computeCriticalPath(taskID, taskMap) {
|
|
2843
|
-
var task = taskMap[taskID].task;
|
|
2844
|
-
var dependents = taskMap[taskID].dependents;
|
|
2845
|
-
taskMap[taskID].end = task.end.getTime();
|
|
2846
|
-
|
|
2847
|
-
for (var j = 0; j < dependents.length; j++) {
|
|
2848
|
-
var newDependentEnd = taskMap[dependents[j]].end;
|
|
2849
|
-
|
|
2850
|
-
if (newDependentEnd > taskMap[taskID].end) {
|
|
2851
|
-
taskMap[taskID].next = dependents[j];
|
|
2852
|
-
taskMap[taskID].end = newDependentEnd;
|
|
2853
|
-
}
|
|
2854
|
-
}
|
|
2855
|
-
}
|
|
2856
|
-
|
|
2857
|
-
function uncolorAll(tasks) {
|
|
2858
|
-
tasks.forEach(function (task) {
|
|
2859
|
-
if (task.styles) delete task.styles.criticalPathColor;
|
|
2860
|
-
delete task.criticalPathArrows;
|
|
2861
|
-
});
|
|
2862
|
-
}
|
|
2863
|
-
|
|
2864
|
-
function colorPath(path, color, tasks) {
|
|
2865
|
-
for (var i = 0; i < path.length; i++) {
|
|
2866
|
-
var longestIDLength = 0;
|
|
2867
|
-
var longestTask = void 0;
|
|
2868
|
-
|
|
2869
|
-
for (var j = 0; j < tasks.length; j++) {
|
|
2870
|
-
if (path[i].id === tasks[j].id) {
|
|
2871
|
-
longestTask = tasks[j];
|
|
2872
|
-
break;
|
|
2873
|
-
}
|
|
2874
|
-
|
|
2875
|
-
if (path[i].id.startsWith(tasks[j].id + ".") && tasks[j].id.length > longestIDLength) {
|
|
2876
|
-
longestIDLength = tasks[j].id.length;
|
|
2877
|
-
longestTask = tasks[j];
|
|
2878
|
-
}
|
|
2879
|
-
}
|
|
2880
|
-
|
|
2881
|
-
if (longestTask) {
|
|
2882
|
-
var _longestTask$styles;
|
|
2883
|
-
|
|
2884
|
-
var _styles = (_longestTask$styles = longestTask.styles) != null ? _longestTask$styles : {};
|
|
2885
|
-
|
|
2886
|
-
_styles.criticalPathColor = color;
|
|
2887
|
-
longestTask.styles = _styles;
|
|
2888
|
-
}
|
|
2889
|
-
}
|
|
2890
|
-
|
|
2891
|
-
var _loop = function _loop(_i7) {
|
|
2892
|
-
var taskFromTasks = void 0;
|
|
2893
|
-
|
|
2894
|
-
for (var _j = 0; _j < tasks.length; _j++) {
|
|
2895
|
-
if (path[_i7].id === tasks[_j].id) {
|
|
2896
|
-
taskFromTasks = tasks[_j];
|
|
2897
|
-
break;
|
|
2898
|
-
}
|
|
2899
|
-
}
|
|
2900
|
-
|
|
2901
|
-
if (taskFromTasks) {
|
|
2902
|
-
var arrows = taskFromTasks.criticalPathArrows;
|
|
2903
|
-
if (!arrows) arrows = [];
|
|
2904
|
-
var arrow = arrows.find(function (arrow) {
|
|
2905
|
-
return arrow.taskId === path[_i7 + 1].id;
|
|
2906
|
-
});
|
|
2907
|
-
if (arrow) arrow.arrowColor = color;else arrows.push({
|
|
2908
|
-
taskId: path[_i7 + 1].id,
|
|
2909
|
-
arrowColor: color
|
|
2910
|
-
});
|
|
2911
|
-
taskFromTasks.criticalPathArrows = arrows;
|
|
2912
|
-
}
|
|
2913
|
-
};
|
|
2914
|
-
|
|
2915
|
-
for (var _i7 = 0; _i7 + 1 < path.length; _i7++) {
|
|
2916
|
-
_loop(_i7);
|
|
2917
|
-
}
|
|
2918
|
-
}
|
|
2919
|
-
|
|
2920
2745
|
var gridProps = {
|
|
2921
2746
|
columnWidth: columnWidth,
|
|
2922
2747
|
svgWidth: svgWidth,
|
|
@@ -3023,6 +2848,176 @@ var Gantt = function Gantt(_ref) {
|
|
|
3023
2848
|
onScroll: handleScrollX
|
|
3024
2849
|
}));
|
|
3025
2850
|
};
|
|
2851
|
+
function topologicalOrderingHelper(taskID, taskMap, sortedTaskList) {
|
|
2852
|
+
if (!taskMap[taskID]) return true;
|
|
2853
|
+
if (taskMap[taskID].finished) return true;
|
|
2854
|
+
|
|
2855
|
+
if (taskMap[taskID].started) {
|
|
2856
|
+
console.log("Cycle involving " + taskID);
|
|
2857
|
+
return false;
|
|
2858
|
+
}
|
|
2859
|
+
|
|
2860
|
+
taskMap[taskID].started = true;
|
|
2861
|
+
var task = taskMap[taskID].task;
|
|
2862
|
+
if (task.dependencies) for (var i = 0; i < task.dependencies.length; i++) {
|
|
2863
|
+
var successVal = topologicalOrderingHelper(task.dependencies[i], taskMap, sortedTaskList);
|
|
2864
|
+
if (!successVal) return false;
|
|
2865
|
+
}
|
|
2866
|
+
taskMap[taskID].finished = true;
|
|
2867
|
+
sortedTaskList.push(taskID);
|
|
2868
|
+
return true;
|
|
2869
|
+
}
|
|
2870
|
+
function getCriticalPaths(leafTasks) {
|
|
2871
|
+
var taskMap = {};
|
|
2872
|
+
|
|
2873
|
+
for (var i = 0; i < leafTasks.length; i++) {
|
|
2874
|
+
taskMap[leafTasks[i].id] = {
|
|
2875
|
+
task: leafTasks[i]
|
|
2876
|
+
};
|
|
2877
|
+
}
|
|
2878
|
+
|
|
2879
|
+
var sortedTaskList = [];
|
|
2880
|
+
|
|
2881
|
+
for (var _i = 0; _i < leafTasks.length; _i++) {
|
|
2882
|
+
var successVal = topologicalOrderingHelper(leafTasks[_i].id, taskMap, sortedTaskList);
|
|
2883
|
+
if (!successVal) return [[], []];
|
|
2884
|
+
}
|
|
2885
|
+
|
|
2886
|
+
for (var _i2 = 0; _i2 < leafTasks.length; _i2++) {
|
|
2887
|
+
taskMap[leafTasks[_i2].id].dependents = [];
|
|
2888
|
+
}
|
|
2889
|
+
|
|
2890
|
+
for (var _i3 = 0; _i3 < leafTasks.length; _i3++) {
|
|
2891
|
+
var task = leafTasks[_i3];
|
|
2892
|
+
if (task.dependencies) for (var j = 0; j < task.dependencies.length; j++) {
|
|
2893
|
+
var _taskMap$task$depende;
|
|
2894
|
+
|
|
2895
|
+
(_taskMap$task$depende = taskMap[task.dependencies[j]]) === null || _taskMap$task$depende === void 0 ? void 0 : _taskMap$task$depende.dependents.push(task.id);
|
|
2896
|
+
}
|
|
2897
|
+
}
|
|
2898
|
+
|
|
2899
|
+
for (var _i4 = sortedTaskList.length - 1; _i4 >= 0; _i4--) {
|
|
2900
|
+
computeCriticalPath(sortedTaskList[_i4], taskMap);
|
|
2901
|
+
}
|
|
2902
|
+
|
|
2903
|
+
var primaryLeaf;
|
|
2904
|
+
var primaryDuration = 0;
|
|
2905
|
+
|
|
2906
|
+
for (var _i5 = 0; _i5 < sortedTaskList.length; _i5++) {
|
|
2907
|
+
var newDuration = taskMap[sortedTaskList[_i5]].end - taskMap[sortedTaskList[_i5]].task.start.getTime();
|
|
2908
|
+
|
|
2909
|
+
if (primaryDuration < newDuration) {
|
|
2910
|
+
primaryLeaf = sortedTaskList[_i5];
|
|
2911
|
+
primaryDuration = newDuration;
|
|
2912
|
+
}
|
|
2913
|
+
}
|
|
2914
|
+
|
|
2915
|
+
var primaryPath = [];
|
|
2916
|
+
|
|
2917
|
+
while (primaryLeaf !== undefined) {
|
|
2918
|
+
taskMap[primaryLeaf].excluded = true;
|
|
2919
|
+
primaryPath.push(taskMap[primaryLeaf].task);
|
|
2920
|
+
primaryLeaf = taskMap[primaryLeaf].next;
|
|
2921
|
+
}
|
|
2922
|
+
|
|
2923
|
+
var secondaryLeaf;
|
|
2924
|
+
var secondaryDuration = 0;
|
|
2925
|
+
|
|
2926
|
+
for (var _i6 = 0; _i6 < sortedTaskList.length; _i6++) {
|
|
2927
|
+
if (taskMap[sortedTaskList[_i6]].excluded) continue;
|
|
2928
|
+
|
|
2929
|
+
var _newDuration = taskMap[sortedTaskList[_i6]].end - taskMap[sortedTaskList[_i6]].task.start.getTime();
|
|
2930
|
+
|
|
2931
|
+
if (secondaryDuration < _newDuration) {
|
|
2932
|
+
secondaryLeaf = sortedTaskList[_i6];
|
|
2933
|
+
secondaryDuration = _newDuration;
|
|
2934
|
+
}
|
|
2935
|
+
}
|
|
2936
|
+
|
|
2937
|
+
var secondaryPath = [];
|
|
2938
|
+
|
|
2939
|
+
while (secondaryLeaf !== undefined) {
|
|
2940
|
+
secondaryPath.push(taskMap[secondaryLeaf].task);
|
|
2941
|
+
secondaryLeaf = taskMap[secondaryLeaf].next;
|
|
2942
|
+
}
|
|
2943
|
+
|
|
2944
|
+
return [primaryPath, secondaryPath];
|
|
2945
|
+
}
|
|
2946
|
+
function computeCriticalPath(taskID, taskMap) {
|
|
2947
|
+
var task = taskMap[taskID].task;
|
|
2948
|
+
var dependents = taskMap[taskID].dependents;
|
|
2949
|
+
taskMap[taskID].end = task.end.getTime();
|
|
2950
|
+
|
|
2951
|
+
for (var j = 0; j < dependents.length; j++) {
|
|
2952
|
+
var newDependentEnd = taskMap[dependents[j]].end;
|
|
2953
|
+
|
|
2954
|
+
if (newDependentEnd > taskMap[taskID].end) {
|
|
2955
|
+
taskMap[taskID].next = dependents[j];
|
|
2956
|
+
taskMap[taskID].end = newDependentEnd;
|
|
2957
|
+
}
|
|
2958
|
+
}
|
|
2959
|
+
}
|
|
2960
|
+
function uncolorAll(tasks) {
|
|
2961
|
+
tasks.forEach(function (task) {
|
|
2962
|
+
if (task.styles) delete task.styles.criticalPathColor;
|
|
2963
|
+
delete task.criticalPathArrows;
|
|
2964
|
+
});
|
|
2965
|
+
}
|
|
2966
|
+
function colorPath(path, color, tasks) {
|
|
2967
|
+
for (var i = 0; i < path.length; i++) {
|
|
2968
|
+
var longestIDLength = 0;
|
|
2969
|
+
var longestTask = void 0;
|
|
2970
|
+
|
|
2971
|
+
for (var j = 0; j < tasks.length; j++) {
|
|
2972
|
+
if (path[i].id === tasks[j].id) {
|
|
2973
|
+
longestTask = tasks[j];
|
|
2974
|
+
break;
|
|
2975
|
+
}
|
|
2976
|
+
|
|
2977
|
+
if (path[i].id.startsWith(tasks[j].id + ".") && tasks[j].id.length > longestIDLength) {
|
|
2978
|
+
longestIDLength = tasks[j].id.length;
|
|
2979
|
+
longestTask = tasks[j];
|
|
2980
|
+
}
|
|
2981
|
+
}
|
|
2982
|
+
|
|
2983
|
+
if (longestTask) {
|
|
2984
|
+
var _longestTask$styles;
|
|
2985
|
+
|
|
2986
|
+
var _styles = (_longestTask$styles = longestTask.styles) != null ? _longestTask$styles : {};
|
|
2987
|
+
|
|
2988
|
+
_styles.criticalPathColor = color;
|
|
2989
|
+
longestTask.styles = _styles;
|
|
2990
|
+
}
|
|
2991
|
+
}
|
|
2992
|
+
|
|
2993
|
+
var _loop = function _loop(_i7) {
|
|
2994
|
+
var taskFromTasks = void 0;
|
|
2995
|
+
|
|
2996
|
+
for (var _j = 0; _j < tasks.length; _j++) {
|
|
2997
|
+
if (path[_i7].id === tasks[_j].id) {
|
|
2998
|
+
taskFromTasks = tasks[_j];
|
|
2999
|
+
break;
|
|
3000
|
+
}
|
|
3001
|
+
}
|
|
3002
|
+
|
|
3003
|
+
if (taskFromTasks) {
|
|
3004
|
+
var arrows = taskFromTasks.criticalPathArrows;
|
|
3005
|
+
if (!arrows) arrows = [];
|
|
3006
|
+
var arrow = arrows.find(function (arrow) {
|
|
3007
|
+
return arrow.taskId === path[_i7 + 1].id;
|
|
3008
|
+
});
|
|
3009
|
+
if (arrow) arrow.arrowColor = color;else arrows.push({
|
|
3010
|
+
taskId: path[_i7 + 1].id,
|
|
3011
|
+
arrowColor: color
|
|
3012
|
+
});
|
|
3013
|
+
taskFromTasks.criticalPathArrows = arrows;
|
|
3014
|
+
}
|
|
3015
|
+
};
|
|
3016
|
+
|
|
3017
|
+
for (var _i7 = 0; _i7 + 1 < path.length; _i7++) {
|
|
3018
|
+
_loop(_i7);
|
|
3019
|
+
}
|
|
3020
|
+
}
|
|
3026
3021
|
|
|
3027
|
-
export { Gantt, ViewMode };
|
|
3022
|
+
export { Gantt, ViewMode, getCriticalPaths };
|
|
3028
3023
|
//# sourceMappingURL=index.modern.js.map
|