Nevar pievienot vairāk kā 25 tēmas Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.

fileData.js 3.1KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144
  1. import {
  2. TextEncoder,
  3. TextDecoder
  4. } from "../node-model/text-decoding";
  5. export function IntegerToHexString(num, nLen) {
  6. if (num == null) {
  7. let str = "";
  8. for (let i = 0; i < nLen; i++) {
  9. str += "0";
  10. }
  11. return str;
  12. }
  13. return HighAddZero(num.toString(16), nLen);
  14. }
  15. export function HighAddZero(str, nLen) {
  16. let length = str.length;
  17. let nAddLen = nLen - length;
  18. if (length > nLen) {
  19. str = str.substring(0, nLen);
  20. } else {
  21. for (let i = 0; i < nAddLen; i++) {
  22. str = "0" + str;
  23. }
  24. }
  25. return str;
  26. }
  27. export function AsciToHexString(strAsci, nLen) {
  28. let s = String(strAsci);
  29. let encoder = new TextEncoder("UTF-8");
  30. // let encoder = new TextEncoder("gbk");
  31. // let bytes = encode(str, 'gbk');
  32. let bytes = encoder.encode(s);
  33. let strResult = HexToString(bytes);
  34. let strLen = strResult.length;
  35. if (strLen >= nLen) {
  36. strResult = strResult.substring(0, nLen);
  37. } else {
  38. let nAddLen = nLen - strLen;
  39. for (let i = 0; i < nAddLen; i++) {
  40. strResult += "0";
  41. }
  42. }
  43. return strResult;
  44. }
  45. const DIGITS_UPPER = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D',
  46. 'E', 'F'
  47. ];
  48. export function HexToString(inHex) {
  49. let i;
  50. let strResult = "";
  51. for (i = 0; i < inHex.length; i++) {
  52. strResult += DIGITS_UPPER[(0xF0 & inHex[i]) >>> 4];
  53. strResult += DIGITS_UPPER[inHex[i] & 0x0F];
  54. }
  55. return strResult;
  56. }
  57. /**
  58. * 十六进制转汉字
  59. *
  60. * @param {string} data
  61. * @returns {string}
  62. */
  63. export function HexToStrig(data, charType = 1) {
  64. let str = data.substring(data.length - 2);
  65. while (str === "00") {
  66. data = data.substring(0, data.length - 2);
  67. if (data.length === 0) {
  68. return "";
  69. }
  70. str = data.substring(data.length - 2);
  71. }
  72. const asd = hexStringToByteArray(data);
  73. try {
  74. str = new TextDecoder("GBK").decode(asd);
  75. } catch (e) {
  76. console.error(e);
  77. }
  78. return str;
  79. }
  80. /**
  81. * 十六进制字符串转字节数组
  82. *
  83. * @param {string} str
  84. * @returns {Uint8Array}
  85. */
  86. export function hexStringToByteArray(str) {
  87. if (!str) {
  88. return new Uint8Array();
  89. }
  90. const result = new Uint8Array(str.length / 2);
  91. for (let i = 0; i < str.length; i += 2) {
  92. result[i / 2] = parseInt(str.substr(i, 2), 16);
  93. }
  94. return result;
  95. }
  96. /**
  97. * 十六进制转十进制
  98. *
  99. * @param {string} data
  100. * @returns {string}
  101. */
  102. export function HexToInt(data) {
  103. let num = -1;
  104. try {
  105. num = parseInt(data, 16);
  106. } catch (e) {
  107. console.error(e);
  108. }
  109. return num.toString();
  110. }
  111. function guessEncoding(bytes) {
  112. // 检查字节序列是否以 BOM(字节顺序标记)开头
  113. if (bytes[0] === 0xEF && bytes[1] === 0xBB && bytes[2] === 0xBF) {
  114. return 'UTF-8';
  115. } else if (bytes[0] === 0xFE && bytes[1] === 0xFF) {
  116. return 'UTF-16BE';
  117. } else if (bytes[0] === 0xFF && bytes[1] === 0xFE) {
  118. return 'UTF-16LE';
  119. } else {
  120. // 统计每个字节的频率
  121. let freq = {};
  122. for (let i = 0; i < bytes.length; i++) {
  123. let b = bytes[i];
  124. freq[b] = freq[b] ? freq[b] + 1 : 1;
  125. }
  126. // 检查是否存在 GBK 的特定字节序列
  127. if (freq[0x81] && freq[0x81] > 0 && freq[0x40] && freq[0x40] > 0) {
  128. return 'GBK';
  129. }
  130. // 如果没有特定的 GBK 字节序列,则假设为 UTF-8
  131. return 'UTF-8';
  132. }
  133. }