|
|
@@ -2641,6 +2641,29 @@ function fun_TEST_SORT_SAVE() {
|
|
|
}
|
|
|
}
|
|
|
echo '</td>';
|
|
|
+ echo '<td><nobr>';
|
|
|
+ $path_arr=explode('/', $v_proces->path);
|
|
|
+ foreach($path_arr as $path) {
|
|
|
+ $col_temp_r=dechex(rand(0,25)*10);
|
|
|
+ $col_temp_g=dechex(rand(0,25)*10);
|
|
|
+ $col_temp_b=dechex(rand(0,25)*10);
|
|
|
+ if(empty($color[$path])) $color[$path]="color='#".(strlen($col_temp_r)==1 ? "0".$col_temp_r : $col_temp_r ).(strlen($col_temp_g)==1 ? "0".$col_temp_g : $col_temp_g ).(strlen($col_temp_b)==1 ? "0".$col_temp_b : $col_temp_b );
|
|
|
+ echo " <font color=".$color[$path].">".$path."</font>(".$v_proces->SORT_PRIO.")";
|
|
|
+ }
|
|
|
+
|
|
|
+ if($path_arr[count($path_arr)-2]==$path_last['ID']) { //ostatni parent jest taki sam, wiec sa w jednym miejscu
|
|
|
+// if($v_proces->TEST_SORT_PRIO>$path_last['TEST_SORT_PRIO']) echo "wieksz. TSP niz ostatni";
|
|
|
+// if($v_proces->TEST_SORT_PRIO<=$path_last['TEST_SORT_PRIO']) echo "mniejsz. TSP niz ostatni";
|
|
|
+// if($v_proces->SORT_PRIO>$path_last['SORT_PRIO']) echo "OK ? wieksz. sort niz ostatni";
|
|
|
+ if($v_proces->SORT_PRIO<$path_last['SORT_PRIO']) echo " Błąd kolejności pod kątem ustalenia w drzewie procesów";
|
|
|
+ }
|
|
|
+
|
|
|
+ $path_last['ID']=$path_arr[count($path_arr)-2];
|
|
|
+ $path_last['TEST_SORT_PRIO']=$v_proces->TEST_SORT_PRIO;
|
|
|
+ $path_last['SORT_PRIO']=$v_proces->SORT_PRIO;
|
|
|
+ // echo $path_last['ID']."==?".$path_arr[count($path_arr)-2]." / ".$path_last['TEST_SORT_PRIO']." ".$path_last['SORT_PRIO'];
|
|
|
+
|
|
|
+ echo '</nobr></td>';
|
|
|
echo '</tr>';
|
|
|
}
|
|
|
echo '</tbody>';
|