jsdiff

Required for hitdb

此脚本不应直接安装,它是一个供其他脚本使用的外部库。如果您需要使用该库,请在脚本元属性加入:// @require https://update.gf.qytechs.cn/scripts/2351/6256/jsdiff.js

  1. // ==UserScript==
  2. // @name jsdiff
  3. // @description Required for hitdb
  4. // ==/UserScript==
  5. function escape(s) {
  6. var n = s;
  7. n = n.replace(/&/g, "&");
  8. n = n.replace(/</g, "&lt;");
  9. n = n.replace(/>/g, "&gt;");
  10. n = n.replace(/"/g, "&quot;");
  11.  
  12. return n;
  13. }
  14.  
  15. function diffString( o, n ) {
  16. o = o.replace(/\s+$/, '');
  17. n = n.replace(/\s+$/, '');
  18.  
  19. var out = diff(o == "" ? [] : o.split(/\s+/), n == "" ? [] : n.split(/\s+/) );
  20. var str = "";
  21.  
  22. var oSpace = o.match(/\s+/g);
  23. if (oSpace == null) {
  24. oSpace = ["\n"];
  25. } else {
  26. oSpace.push("\n");
  27. }
  28. var nSpace = n.match(/\s+/g);
  29. if (nSpace == null) {
  30. nSpace = ["\n"];
  31. } else {
  32. nSpace.push("\n");
  33. }
  34.  
  35. if (out.n.length == 0) {
  36. for (var i = 0; i < out.o.length; i++) {
  37. str += '<del>' + escape(out.o[i]) + oSpace[i] + "</del>";
  38. }
  39. } else {
  40. if (out.n[0].text == null) {
  41. for (n = 0; n < out.o.length && out.o[n].text == null; n++) {
  42. str += '<del>' + escape(out.o[n]) + oSpace[n] + "</del>";
  43. }
  44. }
  45.  
  46. for ( var i = 0; i < out.n.length; i++ ) {
  47. if (out.n[i].text == null) {
  48. str += '<ins>' + escape(out.n[i]) + nSpace[i] + "</ins>";
  49. } else {
  50. var pre = "";
  51.  
  52. for (n = out.n[i].row + 1; n < out.o.length && out.o[n].text == null; n++ ) {
  53. pre += '<del>' + escape(out.o[n]) + oSpace[n] + "</del>";
  54. }
  55. str += " " + out.n[i].text + nSpace[i] + pre;
  56. }
  57. }
  58. }
  59. return str;
  60. }
  61.  
  62. function randomColor() {
  63. return "rgb(" + (Math.random() * 100) + "%, " +
  64. (Math.random() * 100) + "%, " +
  65. (Math.random() * 100) + "%)";
  66. }
  67. function diffString2( o, n ) {
  68. o = o.replace(/\s+$/, '');
  69. n = n.replace(/\s+$/, '');
  70.  
  71. var out = diff(o == "" ? [] : o.split(/\s+/), n == "" ? [] : n.split(/\s+/) );
  72.  
  73. var oSpace = o.match(/\s+/g);
  74. if (oSpace == null) {
  75. oSpace = ["\n"];
  76. } else {
  77. oSpace.push("\n");
  78. }
  79. var nSpace = n.match(/\s+/g);
  80. if (nSpace == null) {
  81. nSpace = ["\n"];
  82. } else {
  83. nSpace.push("\n");
  84. }
  85.  
  86. var os = "";
  87. var colors = new Array();
  88. for (var i = 0; i < out.o.length; i++) {
  89. colors[i] = randomColor();
  90.  
  91. if (out.o[i].text != null) {
  92. os += '<span style="background-color: ' +colors[i]+ '">' +
  93. escape(out.o[i].text) + oSpace[i] + "</span>";
  94. } else {
  95. os += "<del>" + escape(out.o[i]) + oSpace[i] + "</del>";
  96. }
  97. }
  98.  
  99. var ns = "";
  100. for (var i = 0; i < out.n.length; i++) {
  101. if (out.n[i].text != null) {
  102. ns += '<span style="background-color: ' +colors[out.n[i].row]+ '">' +
  103. escape(out.n[i].text) + nSpace[i] + "</span>";
  104. } else {
  105. ns += "<ins>" + escape(out.n[i]) + nSpace[i] + "</ins>";
  106. }
  107. }
  108.  
  109. return { o : os , n : ns };
  110. }
  111.  
  112. function diff( o, n ) {
  113. var ns = new Object();
  114. var os = new Object();
  115. for ( var i = 0; i < n.length; i++ ) {
  116. if ( ns[ n[i] ] == null )
  117. ns[ n[i] ] = { rows: new Array(), o: null };
  118. ns[ n[i] ].rows.push( i );
  119. }
  120. for ( var i = 0; i < o.length; i++ ) {
  121. if ( os[ o[i] ] == null )
  122. os[ o[i] ] = { rows: new Array(), n: null };
  123. os[ o[i] ].rows.push( i );
  124. }
  125. for ( var i in ns ) {
  126. if ( ns[i].rows.length == 1 && typeof(os[i]) != "undefined" && os[i].rows.length == 1 ) {
  127. n[ ns[i].rows[0] ] = { text: n[ ns[i].rows[0] ], row: os[i].rows[0] };
  128. o[ os[i].rows[0] ] = { text: o[ os[i].rows[0] ], row: ns[i].rows[0] };
  129. }
  130. }
  131. for ( var i = 0; i < n.length - 1; i++ ) {
  132. if ( n[i].text != null && n[i+1].text == null && n[i].row + 1 < o.length && o[ n[i].row + 1 ].text == null &&
  133. n[i+1] == o[ n[i].row + 1 ] ) {
  134. n[i+1] = { text: n[i+1], row: n[i].row + 1 };
  135. o[n[i].row+1] = { text: o[n[i].row+1], row: i + 1 };
  136. }
  137. }
  138. for ( var i = n.length - 1; i > 0; i-- ) {
  139. if ( n[i].text != null && n[i-1].text == null && n[i].row > 0 && o[ n[i].row - 1 ].text == null &&
  140. n[i-1] == o[ n[i].row - 1 ] ) {
  141. n[i-1] = { text: n[i-1], row: n[i].row - 1 };
  142. o[n[i].row-1] = { text: o[n[i].row-1], row: i - 1 };
  143. }
  144. }
  145. return { o: o, n: n };
  146. }

QingJ © 2025

镜像随时可能失效,请加Q群300939539或关注我们的公众号极客氢云获取最新地址