azs-markdown 1.0.0

package/README.en.md

@@ -0,0 +1,36 @@
+# azs-markdown
+
+#### Description
+{**When you're done, you can delete the content in this README and update the file with details for others getting started with your repository**}
+
+#### Software Architecture
+Software architecture description
+
+#### Installation
+
+1.  xxxx
+2.  xxxx
+3.  xxxx
+
+#### Instructions
+
+1.  xxxx
+2.  xxxx
+3.  xxxx
+
+#### Contribution
+
+1.  Fork the repository
+2.  Create Feat_xxx branch
+3.  Commit your code
+4.  Create Pull Request
+
+
+#### Gitee Feature
+
+1.  You can use Readme\_XXX.md to support different languages, such as Readme\_en.md, Readme\_zh.md
+2.  Gitee blog [blog.gitee.com](https://blog.gitee.com)
+3.  Explore open source project [https://gitee.com/explore](https://gitee.com/explore)
+4.  The most valuable open source project [GVP](https://gitee.com/gvp)
+5.  The manual of Gitee [https://gitee.com/help](https://gitee.com/help)
+6.  The most popular members  [https://gitee.com/gitee-stars/](https://gitee.com/gitee-stars/)

package/README.md

@@ -0,0 +1,39 @@
+# azs-markdown
+
+#### 介绍
+{**以下是 Gitee 平台说明，您可以替换此简介**
+Gitee 是 OSCHINA 推出的基于 Git 的代码托管平台（同时支持 SVN）。专为开发者提供稳定、高效、安全的云端软件开发协作平台
+无论是个人、团队、或是企业，都能够用 Gitee 实现代码托管、项目管理、协作开发。企业项目请看 [https://gitee.com/enterprises](https://gitee.com/enterprises)}
+
+#### 软件架构
+软件架构说明
+
+
+#### 安装教程
+
+1.  xxxx
+2.  xxxx
+3.  xxxx
+
+#### 使用说明
+
+1.  xxxx
+2.  xxxx
+3.  xxxx
+
+#### 参与贡献
+
+1.  Fork 本仓库
+2.  新建 Feat_xxx 分支
+3.  提交代码
+4.  新建 Pull Request
+
+
+#### 特技
+
+1.  使用 Readme\_XXX.md 来支持不同的语言，例如 Readme\_en.md, Readme\_zh.md
+2.  Gitee 官方博客 [blog.gitee.com](https://blog.gitee.com)
+3.  你可以 [https://gitee.com/explore](https://gitee.com/explore) 这个地址来了解 Gitee 上的优秀开源项目
+4.  [GVP](https://gitee.com/gvp) 全称是 Gitee 最有价值开源项目，是综合评定出的优秀开源项目
+5.  Gitee 官方提供的使用手册 [https://gitee.com/help](https://gitee.com/help)
+6.  Gitee 封面人物是一档用来展示 Gitee 会员风采的栏目 [https://gitee.com/gitee-stars/](https://gitee.com/gitee-stars/)

package/dist/_basePickBy-DjPeYAOj.js

@@ -0,0 +1,151 @@
+import { e as x, c as O, g as m, k as P, h as p, j as w, l as A, m as c, n as I, t as N, o as _ } from "./_baseUniq-Cbb7mysM.js";
+import { aS as g, aA as E, aT as F, aU as M, aV as T, aW as l, aX as $, aY as B, aZ as S, a_ as y } from "./index-DRursjyi.js";
+var G = /\s/;
+function H(n) {
+  for (var r = n.length; r-- && G.test(n.charAt(r)); )
+    ;
+  return r;
+}
+var L = /^\s+/;
+function R(n) {
+  return n && n.slice(0, H(n) + 1).replace(L, "");
+}
+var o = NaN, W = /^[-+]0x[0-9a-f]+$/i, X = /^0b[01]+$/i, Y = /^0o[0-7]+$/i, q = parseInt;
+function z(n) {
+  if (typeof n == "number")
+    return n;
+  if (x(n))
+    return o;
+  if (g(n)) {
+    var r = typeof n.valueOf == "function" ? n.valueOf() : n;
+    n = g(r) ? r + "" : r;
+  }
+  if (typeof n != "string")
+    return n === 0 ? n : +n;
+  n = R(n);
+  var t = X.test(n);
+  return t || Y.test(n) ? q(n.slice(2), t ? 2 : 8) : W.test(n) ? o : +n;
+}
+var v = 1 / 0, C = 17976931348623157e292;
+function K(n) {
+  if (!n)
+    return n === 0 ? n : 0;
+  if (n = z(n), n === v || n === -v) {
+    var r = n < 0 ? -1 : 1;
+    return r * C;
+  }
+  return n === n ? n : 0;
+}
+function U(n) {
+  var r = K(n), t = r % 1;
+  return r === r ? t ? r - t : r : 0;
+}
+function fn(n) {
+  var r = n == null ? 0 : n.length;
+  return r ? O(n) : [];
+}
+var b = Object.prototype, Z = b.hasOwnProperty, dn = E(function(n, r) {
+  n = Object(n);
+  var t = -1, i = r.length, a = i > 2 ? r[2] : void 0;
+  for (a && F(r[0], r[1], a) && (i = 1); ++t < i; )
+    for (var f = r[t], e = M(f), s = -1, d = e.length; ++s < d; ) {
+      var u = e[s], h = n[u];
+      (h === void 0 || T(h, b[u]) && !Z.call(n, u)) && (n[u] = f[u]);
+    }
+  return n;
+});
+function un(n) {
+  var r = n == null ? 0 : n.length;
+  return r ? n[r - 1] : void 0;
+}
+function D(n) {
+  return function(r, t, i) {
+    var a = Object(r);
+    if (!l(r)) {
+      var f = m(t);
+      r = P(r), t = function(s) {
+        return f(a[s], s, a);
+      };
+    }
+    var e = n(r, t, i);
+    return e > -1 ? a[f ? r[e] : e] : void 0;
+  };
+}
+var J = Math.max;
+function Q(n, r, t) {
+  var i = n == null ? 0 : n.length;
+  if (!i)
+    return -1;
+  var a = t == null ? 0 : U(t);
+  return a < 0 && (a = J(i + a, 0)), p(n, m(r), a);
+}
+var hn = D(Q);
+function V(n, r) {
+  var t = -1, i = l(n) ? Array(n.length) : [];
+  return w(n, function(a, f, e) {
+    i[++t] = r(a, f, e);
+  }), i;
+}
+function gn(n, r) {
+  var t = $(n) ? A : V;
+  return t(n, m(r));
+}
+var j = Object.prototype, k = j.hasOwnProperty;
+function nn(n, r) {
+  return n != null && k.call(n, r);
+}
+function mn(n, r) {
+  return n != null && c(n, r, nn);
+}
+function rn(n, r) {
+  return n < r;
+}
+function tn(n, r, t) {
+  for (var i = -1, a = n.length; ++i < a; ) {
+    var f = n[i], e = r(f);
+    if (e != null && (s === void 0 ? e === e && !x(e) : t(e, s)))
+      var s = e, d = f;
+  }
+  return d;
+}
+function on(n) {
+  return n && n.length ? tn(n, B, rn) : void 0;
+}
+function an(n, r, t, i) {
+  if (!g(n))
+    return n;
+  r = I(r, n);
+  for (var a = -1, f = r.length, e = f - 1, s = n; s != null && ++a < f; ) {
+    var d = N(r[a]), u = t;
+    if (d === "__proto__" || d === "constructor" || d === "prototype")
+      return n;
+    if (a != e) {
+      var h = s[d];
+      u = void 0, u === void 0 && (u = g(h) ? h : S(r[a + 1]) ? [] : {});
+    }
+    y(s, d, u), s = s[d];
+  }
+  return n;
+}
+function vn(n, r, t) {
+  for (var i = -1, a = r.length, f = {}; ++i < a; ) {
+    var e = r[i], s = _(n, e);
+    t(s, e) && an(f, I(e, n), s);
+  }
+  return f;
+}
+export {
+  rn as a,
+  tn as b,
+  V as c,
+  vn as d,
+  on as e,
+  fn as f,
+  hn as g,
+  mn as h,
+  dn as i,
+  U as j,
+  un as l,
+  gn as m,
+  K as t
+};