onchain-utility 0.0.1

package/README.md

@@ -0,0 +1,5 @@
+# `@lexical/utils`
+
+[![See API Documentation](https://lexical.dev/img/see-api-documentation.svg)](https://lexical.dev/docs/api/modules/lexical_utils)
+
+This package contains misc utilities for Lexical.

package/package.json

@@ -0,0 +1,38 @@
+{
+  "name": "onchain-utility",
+  "description": "This package contains misc utilities for onchain.",
+  "license": "MIT",
+  "version": "0.0.1",
+  "exports": {
+    ".": {
+      "import": {
+        "types": "./src/index.ts",
+        "default": "./dist/OnchainUtility.mjs"
+      },
+      "require": {
+        "types": "./src/index.ts",
+        "default": "./dist/OnchainUtility.js"
+      }
+    },
+    "./language": {
+      "import": {
+        "types": "./src/Language/index.ts",
+        "default": "./dist/Language.mjs"
+      },
+      "require": {
+        "types": "./src/Language/index.ts",
+        "default": "./dist/Language.js"
+      }
+    },
+    "./traversal": {
+      "import": {
+        "types": "./src/Traversal/index.ts",
+        "default": "./dist/Traversal.mjs"
+      },
+      "require": {
+        "types": "./src/Traversal/index.ts",
+        "default": "./dist/Traversal.js"
+      }
+    }
+  }
+}

package/src/Language/index.ts

@@ -0,0 +1,71 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+/**
+ * 用于国际化的文本格式化处理
+ */
+export function t(strTemp: string, obj?: object) {
+  if (!obj) {
+    return strTemp;
+  }
+
+  for (const key in obj) {
+    if (Object.prototype.hasOwnProperty.call(obj, key)) {
+      const reg = new RegExp(`{(${key})+}`, 'g');
+      strTemp = strTemp.replace(reg, (obj as Record<string, string>)[key]);
+    }
+  }
+  return strTemp;
+}
+
+/**
+ * 国际化-根据pathCode从用户的languageMap查询对应文本
+ */
+export const getI18nText = (
+  languageMap?: Record<string, string | undefined>,
+  pathCode?: string,
+  placeholder?: string,
+) => {
+  if (languageMap && pathCode) {
+    return languageMap[pathCode] || placeholder;
+  }
+
+  return placeholder;
+};
+/** 处理国际化模板的基础方法 */
+export function baseTemplate(
+  LanguageMap: Record<string, string>,
+  ...params: TranslateI18nParams
+) {
+  const [key, extra] = params;
+  return t(
+    getI18nText(LanguageMap, key, extra.placeholder) || '',
+    extra.variate,
+  );
+}
+/**
+ * 初始化国际化函数 从LanguageMap(Record<string, string>)上获取到字符串模板，生成对应语言
+ * ```javascript
+ * initTranslateI18nFn((...params) => {
+ *  return baseTemplate(LanguageMap, ...params)
+ * })
+ * ```
+ */
+export function initTranslateI18nFn(
+  fn: (...params: TranslateI18nParams) => string,
+) {
+  window.translateI18n = fn;
+}
+
+export function translateI18n(...params: TranslateI18nParams) {
+  if (window.translateI18n) {
+    return window.translateI18n(...params);
+  } else {
+    return baseTemplate({}, ...params);
+  }
+}

package/src/Traversal/index.ts

@@ -0,0 +1,23 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+/** 按顺序深度优先 */
+export function dfs<T = unknown>(data: T[], getNewStack: (node: T) => T[]) {
+  const stack = [...data];
+  const result = [];
+  while (stack.length > 0) {
+    const node = stack.shift()!;
+    result.push(node);
+    const children = getNewStack(node);
+    for (let i = children.length - 1; i >= 0; i--) {
+      const child = children[i];
+      stack.unshift(child);
+    }
+  }
+  return result;
+}

package/src/index.ts

@@ -0,0 +1,10 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ */
+
+export * from './Language';
+export * from './Traversal';