lazhang-data.js 5.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223
  1. var passNumber = [];
  2. var failNumber = [];
  3. var failrate = [];
  4. var stackeverynum = [];
  5. var failnum = 0;
  6. var num = 0;
  7. var hispass = [];
  8. var hisfail = [];
  9. var hisstack = [];
  10. var hisrate = [];
  11. var goodpass = [];
  12. var goodid = [];
  13. var goodfailrate = [];
  14. var badpass = [];
  15. var badid = [];
  16. var badfailrate = [];
  17. var n = 0;
  18. var sectorID = [];
  19. var namedata = [];
  20. var lazhang = {};
  21. var scheduleId = utils_get_param("scheduleId");
  22. var flowId = utils_get_param("flowId");
  23. function first_success(obj, sta) {
  24. let output = first_parse(this, obj);
  25. let i, j, k, z;
  26. failnum = 0;
  27. let x = 0;
  28. let worksum = [];
  29. z = 0;
  30. if (output.list == undefined || output.list.length == 0) {
  31. send_alert("没有数据");
  32. }
  33. if (output.list.length > 0) {
  34. sectorID[0] = output.list[0].sectorId;
  35. for (i = 1; i < output.list.length; i++) {
  36. var thisUid = output.list[i].sectorId;
  37. x = 0;
  38. for (j = 0; j < sectorID.length; j++) {
  39. if (sectorID[j] === thisUid) {
  40. x = 1;
  41. break;
  42. }
  43. }
  44. if (x === 0) {
  45. sectorID.push(thisUid);
  46. }
  47. }
  48. j = 0;
  49. for (k = 0; k < sectorID.length; k++) {
  50. var uid = sectorID[k];
  51. z = 0;
  52. passNumber[k] = 0;
  53. failNumber[k] = 0;
  54. stackeverynum[k] = 0;
  55. for (i = 0; i < output.list.length; i++) {
  56. if (uid === output.list[i].sectorId) {
  57. passNumber[k] = output.list[i].passNum + passNumber[j];
  58. failNumber[k] = output.list[i].failNum + failNumber[j];
  59. stackeverynum[k] = output.list[i].due + stackeverynum[j];
  60. z++;
  61. }
  62. }
  63. if (failNumber[k] + passNumber[k] == 0) {
  64. failrate[k] = 0;
  65. }
  66. else {
  67. failrate[k] = failNumber[k] / (failNumber[k] + passNumber[k]) * 100;
  68. }
  69. /*stackeverynum[k]=stackeverynum[k]/z;*/
  70. ///
  71. }
  72. }
  73. for (i = 1; i <= 3; i++) {
  74. load_flows_history_data(i);
  75. }
  76. showChart();
  77. lazhang.timer = setInterval(request_data_realtime, 1000);
  78. }
  79. function request_data_realtime() {
  80. get_data("fcWorkScheduleLoad/list?scheduleId=" + scheduleId, realtime_success);
  81. //load_flows_history_realtime_data();
  82. load_table_red_rank();
  83. load_table_black_rank();
  84. }
  85. function load_flows_history_data(nnm) {
  86. get_data("fcBiFlowDaily/list?type=" + nnm + "&flowId=" + flowId, history_success);
  87. }
  88. function load_flows_history_realtime_data() {
  89. get_data("fcBiFlowDaily/list?type=1&flowId=" + flowId, history_success);
  90. }
  91. function get_stop_scheudle() {
  92. get_data("fcWorkSchedule/stopSchedule?scheduleId=" + scheduleId, stopSuccess);
  93. }
  94. function stopSuccess(obj, sta) {
  95. send_alert("下班操作成功! <a href='denglu.html'> 点击这里返回控制主页 </a>");
  96. }
  97. function add_success(obj, sta) {
  98. var history1 = first_parse(this, obj);
  99. var i, j;
  100. console.log(" history1 : ");
  101. console.log(history1);
  102. hispass[t] = 0;
  103. hisfail[t] = 0;
  104. hisstack[t] = 0;
  105. hisrate[t] = 0;
  106. var lengthnum = history1.length - 1;
  107. for (i = lengthnum; i < history1.length; i++) {
  108. hispass[t] = history1[i].passNum + hispass[t];
  109. hisfail[t] = history1[i].failNum + hisfail[t];
  110. hisstack[t] = history1[i].avgDue + hisstack[t];
  111. hisrate[t] = history1[i].failRate;
  112. hisrate[t] = hisrate[t] / 100;
  113. }
  114. if (hispass[t] + hisfail[t] == 0) {
  115. hisrate[t] = 0;
  116. }
  117. t++;
  118. }
  119. function realtime_success(obj, sta) {
  120. var output = first_parse(this, obj);
  121. //在这里排序 spo\
  122. console.log(" output : ");
  123. console.log(output);
  124. var i, j, k, z;
  125. failnum = 0;
  126. var x = 0;
  127. var worksum = [];
  128. var hhp = 0, hhf = 0, hhs = 0;
  129. if (output.list.length > 0) {
  130. sectorID[0] = output.list[0].sectorId;
  131. passNumber[0] = 0;
  132. failNumber[0] = 0;
  133. stackeverynum[0] = 0;
  134. z = 0;
  135. for (i = 1; i < output.list.length; i++) {
  136. var thisUid = output.list[i].sectorId;
  137. x = 0;
  138. for (j = 0; j < sectorID.length; j++) {
  139. if (sectorID[j] === thisUid) {
  140. x = 1;
  141. break;
  142. }
  143. }
  144. if (x === 0) {
  145. sectorID.push(thisUid);
  146. }
  147. }
  148. j = 0;
  149. for (k = 0; k < sectorID.length; k++) {
  150. var uid = sectorID[k];
  151. z = 0;
  152. passNumber[k] = 0;
  153. failNumber[k] = 0;
  154. stackeverynum[k] = 0;
  155. for (i = 0; i < output.list.length; i++) {
  156. if (uid === output.list[i].sectorId) {
  157. passNumber[k] = output.list[i].passNum + passNumber[k];
  158. failNumber[k] = output.list[i].failNum + failNumber[k];
  159. stackeverynum[k] = output.list[i].due + stackeverynum[k];
  160. z++;
  161. }
  162. }
  163. if (failNumber[k] + passNumber[k] == 0) {
  164. failrate[k] = 0;
  165. } else {
  166. failrate[k] = failNumber[k] / (failNumber[k] + passNumber[k]) * 100;
  167. }
  168. /*stackeverynum[k]=stackeverynum[k]/z;*/
  169. ///
  170. }
  171. output.list.forEach(function (val, fid, arr) {
  172. hhp += val.passNum;
  173. hhf += val.failNum;
  174. hhs += val.due;
  175. })
  176. }
  177. hispass[0] = hhp;
  178. hisfail[0] = hhf;
  179. if (output.list.length > 0) {
  180. hisstack[0] = hhs / output.list.length;
  181. } else {
  182. hisstack[0] = 0;
  183. }
  184. if (hispass[0] + hisfail[0] <= 0) {
  185. hisrate[0] = 0;
  186. } else {
  187. hisrate[0] = Math.floor(hisfail[0] / (hispass[0] + hisfail[0]) * 10000) / 100;
  188. }
  189. updateChart();
  190. }