utils.js 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107
  1. const fs = require('fs-extra');
  2. const path = require('path');
  3. const crypto = require('crypto');
  4. function sleep(ms) {
  5. return new Promise(resolve => setTimeout(resolve, ms));
  6. }
  7. function versionText(config) {
  8. return `${config.name} v${config.version}, Node.js ${process.version}`;
  9. }
  10. async function findFiles(callback, dir, recursive = true) {
  11. if (!(callback && dir))
  12. return;
  13. const files = await fs.readdir(dir, { withFileTypes: true });
  14. for (const file of files) {
  15. const found = path.resolve(dir, file.name);
  16. if (file.isDirectory()) {
  17. if (recursive)
  18. await findFiles(callback, found);
  19. } else {
  20. await callback(found);
  21. }
  22. }
  23. }
  24. async function touchFile(filename) {
  25. await fs.utimes(filename, Date.now()/1000, Date.now()/1000);
  26. }
  27. function hasProp(obj, prop) {
  28. return Object.prototype.hasOwnProperty.call(obj, prop);
  29. }
  30. function freeMemory() {
  31. if (global.gc) {
  32. global.gc();
  33. }
  34. }
  35. function getFileHash(filename, hashName, enc) {
  36. return new Promise((resolve, reject) => {
  37. const hash = crypto.createHash(hashName);
  38. const rs = fs.createReadStream(filename);
  39. rs.on('error', reject);
  40. rs.on('data', chunk => hash.update(chunk));
  41. rs.on('end', () => resolve(hash.digest(enc)));
  42. });
  43. }
  44. function getBufHash(buf, hashName, enc) {
  45. const hash = crypto.createHash(hashName);
  46. hash.update(buf);
  47. return hash.digest(enc);
  48. }
  49. function intersectSet(arrSet) {
  50. if (!arrSet.length)
  51. return new Set();
  52. let min = 0;
  53. let size = arrSet[0].size;
  54. for (let i = 1; i < arrSet.length; i++) {
  55. if (arrSet[i].size < size) {
  56. min = i;
  57. size = arrSet[i].size;
  58. }
  59. }
  60. const result = new Set();
  61. for (const elem of arrSet[min]) {
  62. let inAll = true;
  63. for (let i = 0; i < arrSet.length; i++) {
  64. if (i === min)
  65. continue;
  66. if (!arrSet[i].has(elem)) {
  67. inAll = false;
  68. break;
  69. }
  70. }
  71. if (inAll)
  72. result.add(elem);
  73. }
  74. return result;
  75. }
  76. function randomHexString(len) {
  77. return crypto.randomBytes(len).toString('hex')
  78. }
  79. module.exports = {
  80. sleep,
  81. versionText,
  82. findFiles,
  83. touchFile,
  84. hasProp,
  85. freeMemory,
  86. getFileHash,
  87. getBufHash,
  88. intersectSet,
  89. randomHexString,
  90. };