dapingmu.js 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317
  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 flowIds = [];
  19. var namedata = [];
  20. var lazhang = {};
  21. function page_document_load() {
  22. get_data("fcWorkScheduleLoad/get", first_success)
  23. }
  24. function first_success(obj, sta) {
  25. let output = first_parse(this, obj);
  26. let i, j, k, z;
  27. failnum = 0;
  28. let x = 0;
  29. let worksum = [];
  30. z = 0;
  31. if(typeof output.length =="number"){
  32. output.list = output;
  33. }
  34. if (output.list == undefined || output.list.length == 0) {
  35. send_alert("没有数据");
  36. }
  37. if (output.list.length > 0) {
  38. flowIds[0] = output.list[0].sectorId;
  39. for (i = 1; i < output.list.length; i++) {
  40. var thisUid = output.list[i].flowId;
  41. x = 0;
  42. for (j = 0; j < flowIds.length; j++) {
  43. if (flowIds[j] === thisUid) {
  44. x = 1;
  45. break;
  46. }
  47. }
  48. if (x === 0) {
  49. flowIds.push(thisUid);
  50. }
  51. }
  52. j = 0;
  53. for (k = 0; k < flowIds.length; k++) {
  54. var uid = flowIds[k];
  55. z = 0;
  56. passNumber[k] = 0;
  57. failNumber[k] = 0;
  58. stackeverynum[k] = 0;
  59. for (i = 0; i < output.list.length; i++) {
  60. if (uid === output.list[i].flowId) {
  61. passNumber[k] = output.list[i].passNum + passNumber[j];
  62. failNumber[k] = output.list[i].failNum + failNumber[j];
  63. stackeverynum[k] = output.list[i].due + stackeverynum[j];
  64. z++;
  65. }
  66. }
  67. if (failNumber[k] + passNumber[k] == 0) {
  68. failrate[k] = 0;
  69. } else {
  70. failrate[k] = Math.floor(failNumber[k] / (failNumber[k] + passNumber[k]) * 10000) / 100;
  71. }
  72. }
  73. }
  74. for (i = 1; i <= 3; i++) {
  75. load_flows_history_data(i);
  76. }
  77. showChart();
  78. lazhang.timer = setInterval(request_data_realtime, 1000);
  79. }
  80. function request_data_realtime() {
  81. get_data("fcWorkScheduleLoad/get", realtime_success);
  82. //load_flows_history_realtime_data();
  83. load_table_red_rank();
  84. load_table_black_rank();
  85. }
  86. function load_flows_history_data(nnm) {
  87. get_data("fcBiFactoryDaily/list?type=" + nnm, history_success);
  88. }
  89. function load_flows_history_realtime_data() {
  90. get_data("fcBiFactoryDaily/list?type=1" , history_success);
  91. }
  92. function load_table_red_rank() {
  93. get_data("fcBiWorkerDaily/get?type=0&limit=3", on_red_rank_success);
  94. }
  95. function load_table_black_rank() {
  96. get_data("fcBiWorkerDaily/get?type=4&limit=3", on_black_rank_success);
  97. }
  98. function get_stop_scheudle() {
  99. location.href='denglu.html';
  100. }
  101. function history_success(obj, sta) {
  102. var history = first_parse(this, obj);
  103. var i, j, t;
  104. console.log(" history : ");
  105. console.log(history);
  106. if (this.url.indexOf("type=1") >= 0) {
  107. t = 1;
  108. } else if (this.url.indexOf("type=2") >= 0) {
  109. t = 2;
  110. } else if (this.url.indexOf("type=3") >= 0) {
  111. t = 3;
  112. } else {
  113. t = 0;
  114. }
  115. if (t == 2 || t == 3) {
  116. hispass[t] = 0;
  117. hisfail[t] = 0;
  118. hisstack[t] = 0;
  119. hisrate[t] = 0;
  120. for (i = 0; i < history.length; i++) {
  121. hispass[t] = history[i].passNum + hispass[t];
  122. hisfail[t] = history[i].failNum + hisfail[t];
  123. hisstack[t] = history[i].avgDue + hisstack[t];
  124. }
  125. if (history.length != 1) {
  126. if (hispass[t] + hisfail[t] == 0) {
  127. hisrate[t] = 0;
  128. } else {
  129. hisrate[t] = Math.floor(hisfail[t] / (hispass[t] + hisfail[t]) * 10000) / 100;
  130. }
  131. }
  132. } else if (t == 1) {
  133. hispass[1] = history[0].passNum;
  134. hisfail[1] = history[0].failNum;
  135. hisstack[1] = history[0].avgDue;
  136. if (hispass[1] + hisfail[1] == 0) {
  137. hisrate[1] = 0;
  138. } else {
  139. hisrate[1] = Math.floor(hisfail[1] / (hispass[1] + hisfail[1]) * 10000) / 100;
  140. }
  141. }
  142. hispass[0] = history[history.length - 1].passNum;
  143. hisfail[0] = history[history.length - 1].failNum;
  144. hisstack[0] = history[history.length - 1].avgDue;
  145. if (hispass[0] + hisfail[0] == 0) {
  146. hisrate[0] = 0;
  147. } else {
  148. hisrate[0] = Math.floor(hisfail[0] / (hispass[0] + hisfail[0]) * 10000) / 100;
  149. }
  150. }
  151. function on_red_rank_success(obj, sta) {
  152. var redchart = first_parse(this, obj);
  153. var i, j;
  154. i = j = 0;
  155. console.log(" redchart : ");
  156. console.log(redchart);
  157. for (i = 0; i < redchart.list.length; i++) {
  158. goodid[i] = getUserName(redchart.list[i].workerId);
  159. goodpass[i] = redchart.list[i].passNum;
  160. goodfailrate[i] = Math.floor(100 * redchart.list[i].failRate) / 100;
  161. }
  162. }
  163. function on_black_rank_success(obj, sta) {
  164. var blackchart = first_parse(this, obj);
  165. var i, j;
  166. i = j = 0;
  167. console.log(" black chart : ");
  168. console.log(blackchart);
  169. for (i = 0; i < blackchart.list.length; i++) {
  170. badid[i] = getUserName(blackchart.list[i].workerId);
  171. badpass[i] = blackchart.list[i].passNum;
  172. badfailrate[i] = Math.floor(100* blackchart.list[i].failRate )/ 100;
  173. }
  174. }
  175. function add_success(obj, sta) {
  176. var history1 = first_parse(this, obj);
  177. var i, j;
  178. console.log(" history1 : ");
  179. console.log(history1);
  180. hispass[t] = 0;
  181. hisfail[t] = 0;
  182. hisstack[t] = 0;
  183. hisrate[t] = 0;
  184. var lengthnum = history1.length - 1;
  185. for (i = lengthnum; i < history1.length; i++) {
  186. hispass[t] = history1[i].passNum + hispass[t];
  187. hisfail[t] = history1[i].failNum + hisfail[t];
  188. hisstack[t] = history1[i].avgDue + hisstack[t];
  189. hisrate[t] = history1[i].failRate;
  190. hisrate[t] = hisrate[t] / 100;
  191. }
  192. if (hispass[t] + hisfail[t] == 0) {
  193. hisrate[t] = 0;
  194. }
  195. t++;
  196. }
  197. function realtime_success(obj, sta) {
  198. var output = first_parse(this, obj);
  199. //在这里排序 spo\
  200. console.log(" output : ");
  201. console.log(output);
  202. var i, j, k, z;
  203. failnum = 0;
  204. var x = 0;
  205. var worksum = [];
  206. var hhp = 0, hhf = 0, hhs = 0;
  207. if (output.list.length > 0) {
  208. flowIds[0] = output.list[0].flowId;
  209. passNumber[0] = 0;
  210. failNumber[0] = 0;
  211. stackeverynum[0] = 0;
  212. z = 0;
  213. for (i = 1; i < output.list.length; i++) {
  214. var thisUid = output.list[i].flowId;
  215. x = 0;
  216. for (j = 0; j < flowIds.length; j++) {
  217. if (flowIds[j] === thisUid) {
  218. x = 1;
  219. break;
  220. }
  221. }
  222. if (x === 0) {
  223. flowIds.push(thisUid);
  224. }
  225. }
  226. j = 0;
  227. for (k = 0; k < flowIds.length; k++) {
  228. var uid = flowIds[k];
  229. z = 0;
  230. passNumber[k] = 0;
  231. failNumber[k] = 0;
  232. stackeverynum[k] = 0;
  233. for (i = 0; i < output.list.length; i++) {
  234. if (uid === output.list[i].flowId) {
  235. passNumber[k] = output.list[i].passNum + passNumber[k];
  236. failNumber[k] = output.list[i].failNum + failNumber[k];
  237. stackeverynum[k] = output.list[i].due + stackeverynum[k];
  238. z++;
  239. }
  240. }
  241. if (failNumber[k] + passNumber[k] == 0) {
  242. failrate[k] = 0;
  243. } else {
  244. failrate[k] = Math.floor(failNumber[k] / (failNumber[k] + passNumber[k]) * 10000) / 100
  245. }
  246. /*stackeverynum[k]=stackeverynum[k]/z;*/
  247. ///
  248. }
  249. output.list.forEach(function (val, fid, arr) {
  250. hhp += val.passNum;
  251. hhf += val.failNum;
  252. hhs += val.due;
  253. })
  254. }
  255. hispass[0] = hhp;
  256. hisfail[0] = hhf;
  257. if (output.list.length > 0) {
  258. hisstack[0] = hhs / output.list.length;
  259. } else {
  260. hisstack[0] = 0;
  261. }
  262. if (hispass[0] + hisfail[0] <= 0) {
  263. hisrate[0] = 0;
  264. } else {
  265. hisrate[0] = Math.floor(hisfail[0] / (hispass[0] + hisfail[0]) * 10000) / 100;
  266. }
  267. updateChart();
  268. }